1894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman//===-- StringExtras.cpp - Implement the StringExtras header --------------===// 2894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// 3894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// The LLVM Compiler Infrastructure 4894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// 5894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// This file is distributed under the University of Illinois Open Source 6894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// License. See LICENSE.TXT for details. 7894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// 8894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman//===----------------------------------------------------------------------===// 9894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// 10894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// This file implements the StringExtras.h header 11894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman// 12894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman//===----------------------------------------------------------------------===// 13894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 14894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman#include "llvm/ADT/SmallVector.h" 15894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman#include "llvm/ADT/STLExtras.h" 16894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman#include "llvm/ADT/StringExtras.h" 17894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Baumanusing namespace llvm; 18894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 19894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// StrInStrNoCase - Portable version of strcasestr. Locates the first 20894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// occurrence of string 's1' in string 's2', ignoring case. Returns 21894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// the offset of s2 in s1 or npos if s2 cannot be found. 22894018228b0e0bdbd7aa7e8f47d4a9458789ca82John BaumanStringRef::size_type llvm::StrInStrNoCase(StringRef s1, StringRef s2) { 23894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman size_t N = s2.size(), M = s1.size(); 24894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman if (N > M) 25894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman return StringRef::npos; 26894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman for (size_t i = 0, e = M - N + 1; i != e; ++i) 27894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman if (s1.substr(i, N).equals_lower(s2)) 28894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman return i; 29894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman return StringRef::npos; 30894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman} 31894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 32894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// getToken - This function extracts one token from source, ignoring any 33894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// leading characters that appear in the Delimiters string, and ending the 34894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// token at any of the characters that appear in the Delimiters string. If 35894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// there are no tokens in the source string, an empty string is returned. 36894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// The function returns a pair containing the extracted token and the 37894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// remaining tail string. 38894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Baumanstd::pair<StringRef, StringRef> llvm::getToken(StringRef Source, 39894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef Delimiters) { 40894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman // Figure out where the token starts. 41894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef::size_type Start = Source.find_first_not_of(Delimiters); 42894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 43894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman // Find the next occurrence of the delimiter. 44894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef::size_type End = Source.find_first_of(Delimiters, Start); 45894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 46894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman return std::make_pair(Source.slice(Start, End), Source.substr(End)); 47894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman} 48894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 49894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// SplitString - Split up the specified string according to the specified 50894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman/// delimiters, appending the result fragments to the output list. 51894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Baumanvoid llvm::SplitString(StringRef Source, 52894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman SmallVectorImpl<StringRef> &OutFragments, 53894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef Delimiters) { 5419bac1e08be200c31efd26f0f5fd144c9b3eefd3John Bauman std::pair<StringRef, StringRef> S = getToken(Source, Delimiters); 5519bac1e08be200c31efd26f0f5fd144c9b3eefd3John Bauman while (!S.first.empty()) { 5619bac1e08be200c31efd26f0f5fd144c9b3eefd3John Bauman OutFragments.push_back(S.first); 5719bac1e08be200c31efd26f0f5fd144c9b3eefd3John Bauman S = getToken(S.second, Delimiters); 58894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman } 59894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman} 60894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 61894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Baumanvoid llvm::StringRef::split(SmallVectorImpl<StringRef> &A, 62894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef Separators, int MaxSplit, 63894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman bool KeepEmpty) const { 64894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman StringRef rest = *this; 65894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 66894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman // rest.data() is used to distinguish cases like "a," that splits into 67894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman // "a" + "" and "a" that splits into "a" + 0. 68894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman for (int splits = 0; 69894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman rest.data() != NULL && (MaxSplit < 0 || splits < MaxSplit); 70894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman ++splits) { 71894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman std::pair<llvm::StringRef, llvm::StringRef> p = rest.split(Separators); 72894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman 73894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman if (p.first.size() != 0 || KeepEmpty) 74894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman A.push_back(p.first); 75894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman rest = p.second; 76894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman } 77894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman // If we have a tail left, add it. 78894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman if (rest.data() != NULL && (rest.size() != 0 || KeepEmpty)) 79894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman A.push_back(rest); 80894018228b0e0bdbd7aa7e8f47d4a9458789ca82John Bauman} 81