From 6925f5074f6c456dc37f052b67229d07f667b2e5 Mon Sep 17 00:00:00 2001 From: Ted Kremenek Date: Wed, 7 May 2008 18:35:46 +0000 Subject: [PATCH] Added CStrInCStrNoCase, a portable implementation of strcasestr. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@50821 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/ADT/StringExtras.h | 24 ++++++++++++++++++++++++ 1 file changed, 24 insertions(+) diff --git a/include/llvm/ADT/StringExtras.h b/include/llvm/ADT/StringExtras.h index 3bfd3f5c727..9a3e1b51595 100644 --- a/include/llvm/ADT/StringExtras.h +++ b/include/llvm/ADT/StringExtras.h @@ -141,6 +141,30 @@ static inline bool StringsEqualNoCase(const std::string &LHS, } return RHS[LHS.size()] == 0; // Not too long? } + +/// 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. +static inline const char* CStrInCStrNoCase(const char *s1, const char *s2) { + + // Are either strings NULL? + if (!s1 || !s2) + return 0; + + const char *I1=s1, *I2=s2; + + while (*I1 != '\0' || *I2 != '\0' ) + if (tolower(*I1) != tolower(*I2)) { // No match. Start over. + ++s1; I1 = s1; I2 = s2; + } + else { // Character match. Advance to the next character. + ++I1; ++I2; + } + + // If we exhausted all of the characters in 's2', then 's1' does not occur + // in it. + return *I2 == '\0' ? 0 : I1; +} /// getToken - This function extracts one token from source, ignoring any /// leading characters that appear in the Delimiters string, and ending the