blob: eb2fa084218aef31b157cddb31af44e29ed73c98 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===-- StringExtras.cpp - Implement the StringExtras header --------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner081ce942007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This file implements the StringExtras.h header
11//
12//===----------------------------------------------------------------------===//
13
Rafael Espindola3d495962009-11-13 02:18:25 +000014#include "llvm/ADT/SmallVector.h"
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000015#include "llvm/ADT/STLExtras.h"
16#include "llvm/ADT/StringExtras.h"
Dan Gohmanf17a25c2007-07-18 16:29:46 +000017using namespace llvm;
18
Benjamin Kramerccb33822010-01-11 19:45:18 +000019/// StrInStrNoCase - Portable version of strcasestr. Locates the first
20/// occurrence of string 's1' in string 's2', ignoring case. Returns
21/// the offset of s2 in s1 or npos if s2 cannot be found.
22StringRef::size_type llvm::StrInStrNoCase(StringRef s1, StringRef s2) {
23 size_t N = s2.size(), M = s1.size();
24 if (N > M)
25 return StringRef::npos;
26 for (size_t i = 0, e = M - N + 1; i != e; ++i)
27 if (s1.substr(i, N).equals_lower(s2))
28 return i;
29 return StringRef::npos;
30}
31
Dan Gohmanf17a25c2007-07-18 16:29:46 +000032/// getToken - This function extracts one token from source, ignoring any
33/// leading characters that appear in the Delimiters string, and ending the
34/// token at any of the characters that appear in the Delimiters string. If
35/// there are no tokens in the source string, an empty string is returned.
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000036/// The function returns a pair containing the extracted token and the
37/// remaining tail string.
38std::pair<StringRef, StringRef> llvm::getToken(StringRef Source,
39 StringRef Delimiters) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000040 // Figure out where the token starts.
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000041 StringRef::size_type Start = Source.find_first_not_of(Delimiters);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000042
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000043 // Find the next occurrence of the delimiter.
44 StringRef::size_type End = Source.find_first_of(Delimiters, Start);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000045
Benjamin Kramerbfdd13b2010-01-18 12:40:05 +000046 return std::make_pair(Source.slice(Start, End), Source.substr(End));
Dan Gohmanf17a25c2007-07-18 16:29:46 +000047}
48
49/// SplitString - Split up the specified string according to the specified
50/// delimiters, appending the result fragments to the output list.
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000051void llvm::SplitString(StringRef Source,
52 SmallVectorImpl<StringRef> &OutFragments,
53 StringRef Delimiters) {
54 StringRef S2, S;
55 tie(S2, S) = getToken(Source, Delimiters);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000056 while (!S2.empty()) {
57 OutFragments.push_back(S2);
Benjamin Kramer3601d1b2010-01-11 18:03:24 +000058 tie(S2, S) = getToken(S, Delimiters);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000059 }
60}
Rafael Espindola76af1582009-11-13 01:24:40 +000061
Rafael Espindola3d495962009-11-13 02:18:25 +000062void llvm::StringRef::split(SmallVectorImpl<StringRef> &A,
63 StringRef Separators, int MaxSplit,
Rafael Espindola76af1582009-11-13 01:24:40 +000064 bool KeepEmpty) const {
65 StringRef rest = *this;
66
Rafael Espindolace91e0a2009-11-13 04:55:09 +000067 // rest.data() is used to distinguish cases like "a," that splits into
68 // "a" + "" and "a" that splits into "a" + 0.
Rafael Espindola3d495962009-11-13 02:18:25 +000069 for (int splits = 0;
Rafael Espindolace91e0a2009-11-13 04:55:09 +000070 rest.data() != NULL && (MaxSplit < 0 || splits < MaxSplit);
Rafael Espindola76af1582009-11-13 01:24:40 +000071 ++splits) {
72 std::pair<llvm::StringRef, llvm::StringRef> p = rest.split(Separators);
73
74 if (p.first.size() != 0 || KeepEmpty)
75 A.push_back(p.first);
76 rest = p.second;
77 }
Rafael Espindolace91e0a2009-11-13 04:55:09 +000078 // If we have a tail left, add it.
79 if (rest.data() != NULL && (rest.size() != 0 || KeepEmpty))
Rafael Espindola76af1582009-11-13 01:24:40 +000080 A.push_back(rest);
81}