X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FADT%2FStringExtras.h;h=e40e409802d25c1ab4b213227987c417fe7371db;hb=b141e397d52d9946e93f84c65c6b2e653b026041;hp=e3b3c8770a24abbdd97ac498da296c4e22112f31;hpb=fbd15899b3bcc459bea20f5bb2866244eea56d6a;p=oota-llvm.git diff --git a/include/llvm/ADT/StringExtras.h b/include/llvm/ADT/StringExtras.h index e3b3c8770a2..e40e409802d 100644 --- a/include/llvm/ADT/StringExtras.h +++ b/include/llvm/ADT/StringExtras.h @@ -23,22 +23,40 @@ namespace llvm { -static inline std::string utohexstr(uint64_t X) { - char Buffer[40]; - char *BufPtr = Buffer+39; +/// hexdigit - Return the (uppercase) hexadecimal character for the +/// given number \arg X (which should be less than 16). +static inline char hexdigit(unsigned X) { + return X < 10 ? '0' + X : 'A' + X - 10; +} - *BufPtr = 0; // Null terminate buffer... - if (X == 0) *--BufPtr = '0'; // Handle special case... +/// utohex_buffer - Emit the specified number into the buffer specified by +/// BufferEnd, returning a pointer to the start of the string. This can be used +/// like this: (note that the buffer must be large enough to handle any number): +/// char Buffer[40]; +/// printf("0x%s", utohex_buffer(X, Buffer+40)); +/// +/// This should only be used with unsigned types. +/// +template +static inline char *utohex_buffer(IntTy X, char *BufferEnd) { + char *BufPtr = BufferEnd; + *--BufPtr = 0; // Null terminate buffer. + if (X == 0) { + *--BufPtr = '0'; // Handle special case. + return BufPtr; + } while (X) { unsigned char Mod = static_cast(X) & 15; - if (Mod < 10) - *--BufPtr = '0' + Mod; - else - *--BufPtr = 'A' + Mod-10; + *--BufPtr = hexdigit(Mod); X >>= 4; } - return std::string(BufPtr); + return BufPtr; +} + +static inline std::string utohexstr(uint64_t X) { + char Buffer[40]; + return utohex_buffer(X, Buffer+40); } static inline std::string utostr_32(uint32_t X, bool isNeg = false) { @@ -61,18 +79,18 @@ static inline std::string utostr_32(uint32_t X, bool isNeg = false) { static inline std::string utostr(uint64_t X, bool isNeg = false) { if (X == uint32_t(X)) return utostr_32(uint32_t(X), isNeg); - + char Buffer[40]; char *BufPtr = Buffer+39; - + *BufPtr = 0; // Null terminate buffer... if (X == 0) *--BufPtr = '0'; // Handle special case... - + while (X) { *--BufPtr = '0' + char(X % 10); X /= 10; } - + if (isNeg) *--BufPtr = '-'; // Add negative sign... return std::string(BufPtr); } @@ -123,7 +141,7 @@ static inline std::string UppercaseString(const std::string &S) { /// StringsEqualNoCase - Return true if the two strings are equal, ignoring /// case. -static inline bool StringsEqualNoCase(const std::string &LHS, +static inline bool StringsEqualNoCase(const std::string &LHS, const std::string &RHS) { if (LHS.size() != RHS.size()) return false; for (unsigned i = 0, e = static_cast(LHS.size()); i != e; ++i) @@ -133,7 +151,7 @@ static inline bool StringsEqualNoCase(const std::string &LHS, /// StringsEqualNoCase - Return true if the two strings are equal, ignoring /// case. -static inline bool StringsEqualNoCase(const std::string &LHS, +static inline bool StringsEqualNoCase(const std::string &LHS, const char *RHS) { for (unsigned i = 0, e = static_cast(LHS.size()); i != e; ++i) { if (RHS[i] == 0) return false; // RHS too short. @@ -142,18 +160,40 @@ static inline bool StringsEqualNoCase(const std::string &LHS, return RHS[LHS.size()] == 0; // Not too long? } +/// StringsEqualNoCase - Return true if the two null-terminated C strings are +/// equal, ignoring + +static inline bool StringsEqualNoCase(const char *LHS, const char *RHS, + unsigned len) { + + for (unsigned i = 0; i < len; ++i) { + if (tolower(LHS[i]) != tolower(RHS[i])) + return false; + + // If RHS[i] == 0 then LHS[i] == 0 or otherwise we would have returned + // at the previous branch as tolower('\0') == '\0'. + if (RHS[i] == 0) + return true; + } + + return true; +} + /// CStrInCStrNoCase - Portable version of strcasestr. Locates the first -/// occurance of c-string 's1' in string 's2', ignoring case. Returns -/// NULL if 's1' cannot be found. +/// occurance of c-string 's2' in string 's1', ignoring case. Returns +/// NULL if 's2' cannot be found. static inline const char* CStrInCStrNoCase(const char *s1, const char *s2) { // Are either strings NULL or empty? if (!s1 || !s2 || s1[0] == '\0' || s2[0] == '\0') return 0; - + + if (s1 == s2) + return s1; + const char *I1=s1, *I2=s2; - - while (*I1 != '\0' || *I2 != '\0' ) + + while (*I1 != '\0' && *I2 != '\0' ) if (tolower(*I1) != tolower(*I2)) { // No match. Start over. ++s1; I1 = s1; I2 = s2; } @@ -161,9 +201,8 @@ static inline const char* CStrInCStrNoCase(const char *s1, const char *s2) { ++I1; ++I2; } - // If we exhausted all of the characters in 's2', then 's1' does not occur - // in it. - return *I2 == '\0' ? 0 : I1; + // If we exhausted all of the characters in 's2', then 's2' appears in 's1'. + return *I2 == '\0' ? s1 : 0; } /// getToken - This function extracts one token from source, ignoring any