24 unsigned char LHC =
toLower(LC);
25 unsigned char RHC =
toLower(RC);
27 return LHC < RHC ? -1 : 1;
33 size_t Min = std::min(
size(), RHS.size());
36 if (
size() == RHS.size())
38 return size() < RHS.size() ? -1 : 1;
42 return size() >= Prefix.size() &&
58 for (
size_t I = 0, E = std::min(
size(), RHS.size());
I != E; ++
I) {
64 for (J =
I + 1; J != E + 1; ++J) {
66 bool rd = J < RHS.size() &&
isDigit(RHS.data()[J]);
73 if (
int Res = compareMemory(
data() +
I, RHS.data() +
I, J -
I))
74 return Res < 0 ? -1 : 1;
79 if (
data()[
I] != RHS.data()[
I])
80 return (
unsigned char)
data()[
I] < (
unsigned char)RHS.data()[
I] ? -1 : 1;
82 if (
size() == RHS.size())
84 return size() < RHS.size() ? -1 : 1;
89 bool AllowReplacements,
90 unsigned MaxEditDistance)
const {
93 AllowReplacements, MaxEditDistance);
97 StringRef Other,
bool AllowReplacements,
unsigned MaxEditDistance)
const {
130 const char *Start =
data() + From;
133 const char *Needle = Str.data();
134 size_t N = Str.size();
140 const char *Ptr = (
const char *)::memchr(Start, Needle[0],
Size);
141 return Ptr ==
nullptr ?
npos : Ptr -
data();
144 const char *Stop = Start + (
Size -
N + 1);
151 if (std::memcmp(Start, Needle, 2) == 0)
152 return Start -
data();
154 }
while (Start < Stop);
161 if (std::memcmp(Start, Needle,
N) == 0)
162 return Start -
data();
164 }
while (Start < Stop);
170 std::memset(BadCharSkip,
N, 256);
171 for (
unsigned i = 0; i !=
N-1; ++i)
172 BadCharSkip[(
uint8_t)Str[i]] =
N-1-i;
177 if (std::memcmp(Start, Needle,
N - 1) == 0)
178 return Start -
data();
181 Start += BadCharSkip[
Last];
182 }
while (Start < Stop);
189 while (This.size() >= Str.size()) {
190 if (This.starts_with_insensitive(Str))
192 This = This.drop_front();
201 size_t End,
char C) {
202 constexpr size_t VectorWidth = 16;
204 for (;
I >= VectorWidth;
I -= VectorWidth) {
205 const char *Chunk =
Data +
I - VectorWidth;
206 unsigned char Any = 0;
207 for (
size_t J = 0; J != VectorWidth; ++J)
208 Any |= Chunk[J] ==
C;
225 From = std::min(From,
size());
240 size_t N = Str.size();
246 if (std::memcmp(
data() +
I + 1, Str.data() + 1,
N - 1) == 0)
252 size_t N = Str.size();
255 for (
size_t i =
size() -
N + 1, e = 0; i != e;) {
269 std::bitset<1 << CHAR_BIT> CharBits;
271 CharBits.set((
unsigned char)
C);
274 if (CharBits.test((
unsigned char)
data()[i]))
282 return std::string_view(*this).find_first_not_of(
C, From);
291 std::bitset<1 << CHAR_BIT> CharBits;
293 CharBits.set((
unsigned char)
C);
296 if (!CharBits.test((
unsigned char)
data()[i]))
307 std::bitset<1 << CHAR_BIT> CharBits;
309 CharBits.set((
unsigned char)
C);
311 for (
size_type i = std::min(From,
size()) - 1, e = -1; i != e; --i)
312 if (CharBits.test((
unsigned char)
data()[i]))
320 for (
size_type i = std::min(From,
size()) - 1, e = -1; i != e; --i)
332 std::bitset<1 << CHAR_BIT> CharBits;
334 CharBits.set((
unsigned char)
C);
336 for (
size_type i = std::min(From,
size()) - 1, e = -1; i != e; --i)
337 if (!CharBits.test((
unsigned char)
data()[i]))
344 bool KeepEmpty)
const {
351 while (MaxSplit-- != 0) {
352 size_t Idx = S.
find(Separator);
357 if (KeepEmpty || Idx > 0)
358 A.push_back(S.
slice(0, Idx));
365 if (KeepEmpty || !S.
empty())
370 int MaxSplit,
bool KeepEmpty)
const {
377 while (MaxSplit-- != 0) {
378 size_t Idx = S.
find(Separator);
383 if (KeepEmpty || Idx > 0)
384 A.push_back(S.
slice(0, Idx));
391 if (KeepEmpty || !S.
empty())
404 size_t N = Str.size();
410 while ((Pos =
find(Str, Pos)) !=
npos) {
421 if (Str.consume_front_insensitive(
"0x"))
424 if (Str.consume_front_insensitive(
"0b"))
427 if (Str.consume_front(
"0o"))
430 if (Str[0] ==
'0' && Str.size() > 1 &&
isDigit(Str[1])) {
439 unsigned long long &Result) {
445 if (Str.empty())
return true;
450 while (!Str2.
empty()) {
452 if (Str2[0] >=
'0' && Str2[0] <=
'9')
453 CharVal = Str2[0] -
'0';
454 else if (Str2[0] >=
'a' && Str2[0] <=
'z')
455 CharVal = Str2[0] -
'a' + 10;
456 else if (Str2[0] >=
'A' && Str2[0] <=
'Z')
457 CharVal = Str2[0] -
'A' + 10;
463 if (CharVal >= Radix)
467 unsigned long long PrevResult = Result;
468 Result = Result * Radix + CharVal;
471 if (Result / Radix < PrevResult)
479 if (Str.size() == Str2.
size())
488 unsigned long long ULLVal;
491 if (!Str.starts_with(
"-")) {
494 (
long long)ULLVal < 0)
506 (
long long)-ULLVal > 0)
517 unsigned long long &Result) {
543 assert(Radix > 1 && Radix <= 36);
546 if (Str.empty())
return true;
550 Str = Str.ltrim(
'0');
554 Result =
APInt(64, 0);
559 unsigned Log2Radix = 0;
560 while ((1U << Log2Radix) < Radix) Log2Radix++;
561 bool IsPowerOf2Radix = ((1U << Log2Radix) == Radix);
565 unsigned BitWidth = std::max(64U, Result.getBitWidth());
567 if (Result.getBitWidth() <
BitWidth) {
571 APInt RadixAP, CharAP;
572 if (!IsPowerOf2Radix) {
580 while (!Str.empty()) {
582 if (Str[0] >=
'0' && Str[0] <=
'9')
583 CharVal = Str[0]-
'0';
584 else if (Str[0] >=
'a' && Str[0] <=
'z')
585 CharVal = Str[0]-
'a'+10;
586 else if (Str[0] >=
'A' && Str[0] <=
'Z')
587 CharVal = Str[0]-
'A'+10;
593 if (CharVal >= Radix)
597 if (Result.getActiveBits() + Log2Radix > Result.getBitWidth()) {
598 unsigned NewWidth = Result.getBitWidth() * 2;
601 if (NewWidth < Result.getBitWidth())
604 Result = Result.zext(NewWidth);
605 if (!IsPowerOf2Radix) {
606 RadixAP = RadixAP.
zext(NewWidth);
607 CharAP = CharAP.
zext(NewWidth);
612 if (IsPowerOf2Radix) {
613 Result <<= Log2Radix;
626 if (
size() == Str.size())
635 if (Str.consumeInteger(Radix, Result))
655 Result =
F.convertToDouble();
assert(UImm &&(UImm !=~static_cast< T >(0)) &&"Invalid immediate!")
This file declares a class to represent arbitrary precision floating point values and provide a varie...
This file implements a class to represent arbitrary precision integral constant values and operations...
static GCRegistry::Add< ShadowStackGC > C("shadow-stack", "Very portable GC for uncooperative code generators")
static GCRegistry::Add< ErlangGC > A("erlang", "erlang-compatible garbage collector")
static GCRegistry::Add< StatepointGC > D("statepoint-example", "an example strategy for statepoint")
#define LLVM_UNLIKELY(EXPR)
#define LLVM_ATTRIBUTE_ALWAYS_INLINE
LLVM_ATTRIBUTE_ALWAYS_INLINE - On compilers where we have a directive to do so, mark a method "always...
static int ascii_strncasecmp(StringRef LHS, StringRef RHS)
static LLVM_ATTRIBUTE_ALWAYS_INLINE size_t rfindByte(const char *Data, size_t End, char C)
static constexpr roundingMode rmNearestTiesToEven
opStatus
IEEE-754R 7: Default exception handling.
Class for arbitrary precision integers.
LLVM_ABI APInt zext(unsigned width) const
Zero extend to a new width.
This class consists of common code factored out of the SmallVector class to reduce code duplication b...
Represent a constant reference to a string, i.e.
std::pair< StringRef, StringRef > split(char Separator) const
Split into two substrings around the first occurrence of a separator character.
LLVM_ABI size_t find_last_not_of(char C, size_t From=npos) const
Find the last character in the string that is not C, or npos if not found.
static constexpr size_t npos
bool consumeInteger(unsigned Radix, T &Result)
Parse the current string as an integer of the specified radix.
bool getAsInteger(unsigned Radix, T &Result) const
Parse the current string as an integer of the specified radix.
LLVM_ABI bool getAsDouble(double &Result, bool AllowInexact=true) const
Parse the current string as an IEEE double-precision floating point value.
size_t find_if(function_ref< bool(char)> F, size_t From=0) const
Search for the first character satisfying the predicate F.
constexpr StringRef substr(size_t Start, size_t N=npos) const
Return a reference to the substring from [Start, Start + N).
constexpr bool empty() const
Check if the string is empty.
LLVM_ABI size_t rfind(char C, size_t From=npos) const
Search for the last character C in the string.
LLVM_ABI bool starts_with_insensitive(StringRef Prefix) const
Check if this string starts with the given Prefix, ignoring case.
StringRef drop_front(size_t N=1) const
Return a StringRef equal to 'this' but with the first N elements dropped.
LLVM_ABI std::string upper() const
Convert the given ASCII string to uppercase.
LLVM_ABI unsigned edit_distance(StringRef Other, bool AllowReplacements=true, unsigned MaxEditDistance=0) const
Determine the edit distance between this string and another string.
StringRef slice(size_t Start, size_t End) const
Return a reference to the substring from [Start, End).
constexpr size_t size() const
Get the string size.
size_t find_last_of(char C, size_t From=npos) const
Find the last character in the string that is C, or npos if not found.
constexpr const char * data() const
Get a pointer to the start of the string (which may not be null terminated).
LLVM_ABI int compare_numeric(StringRef RHS) const
Compare two strings, treating sequences of digits as numbers.
size_t find_first_of(char C, size_t From=0) const
Find the first character in the string that is C, or npos if not found.
StringRef()=default
Construct an empty string ref.
StringRef take_back(size_t N=1) const
Return a StringRef equal to 'this' but with only the last N elements remaining.
StringRef take_front(size_t N=1) const
Return a StringRef equal to 'this' but with only the first N elements remaining.
size_t find(char C, size_t From=0) const
Search for the first character C in the string.
LLVM_ABI size_t rfind_insensitive(char C, size_t From=npos) const
Search for the last character C in the string, ignoring case.
LLVM_ABI std::string lower() const
LLVM_ABI size_t find_insensitive(char C, size_t From=0) const
Search for the first character C in the string, ignoring case.
size_t count(char C) const
Return the number of occurrences of C in the string.
bool equals_insensitive(StringRef RHS) const
Check for string equality, ignoring case.
LLVM_ABI bool ends_with_insensitive(StringRef Suffix) const
Check if this string ends with the given Suffix, ignoring case.
LLVM_ABI size_t find_first_not_of(char C, size_t From=0) const
Find the first character in the string that is not C or npos if not found.
LLVM_ABI int compare_insensitive(StringRef RHS) const
Compare two strings, ignoring case.
LLVM_ABI unsigned edit_distance_insensitive(StringRef Other, bool AllowReplacements=true, unsigned MaxEditDistance=0) const
An opaque object representing a hash code.
This file defines a Levenshtein distance function that works for any two sequences,...
This is an optimization pass for GlobalISel generic memory operations.
bool errorToBool(Error Err)
Helper for converting an Error to a bool.
char toLower(char x)
Returns the corresponding lowercase character if x is uppercase.
LLVM_ABI bool getAsSignedInteger(StringRef Str, unsigned Radix, long long &Result)
hash_code hash_value(const FixedPointSemantics &Val)
LLVM_ABI unsigned getAutoSenseRadix(StringRef &Str)
detail::zippy< detail::zip_first, T, U, Args... > zip_equal(T &&t, U &&u, Args &&...args)
zip iterator that assumes that all iteratees have the same length.
mapped_iterator< ItTy, FuncTy > map_iterator(ItTy I, FuncTy F)
LLVM_ABI bool consumeUnsignedInteger(StringRef &Str, unsigned Radix, unsigned long long &Result)
unsigned ComputeEditDistance(ArrayRef< T > FromArray, ArrayRef< T > ToArray, bool AllowReplacements=true, unsigned MaxEditDistance=0)
bool isDigit(char C)
Checks if character C is one of the 10 decimal digits.
char toUpper(char x)
Returns the corresponding uppercase character if x is lowercase.
LLVM_ABI bool consumeSignedInteger(StringRef &Str, unsigned Radix, long long &Result)
RelativeUniformCounterPtr ValuesPtrExpr VTableAddr Count
ArrayRef(const T &OneElt) -> ArrayRef< T >
constexpr unsigned BitWidth
LLVM_ABI bool getAsUnsignedInteger(StringRef Str, unsigned Radix, unsigned long long &Result)
Helper functions for StringRef::getAsInteger.
unsigned ComputeMappedEditDistance(ArrayRef< T > FromArray, ArrayRef< T > ToArray, Functor Map, bool AllowReplacements=true, unsigned MaxEditDistance=0)
Determine the edit distance between two sequences.
@ End
Run the machine verifier once, at the end of the pipeline.
hash_code hash_combine_range(InputIteratorT first, InputIteratorT last)
Compute a hash_code for a sequence of values.
An information struct used to provide DenseMap with the various necessary components for a given valu...