mirror of
				https://github.com/c64scene-ar/llvm-6502.git
				synced 2025-11-04 05:17:07 +00:00 
			
		
		
		
	git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@93723 91177308-0d34-0410-b5e6-96231b3b80d8
		
			
				
	
	
		
			82 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			82 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
//===-- StringExtras.cpp - Implement the StringExtras header --------------===//
 | 
						|
//
 | 
						|
//                     The LLVM Compiler Infrastructure
 | 
						|
//
 | 
						|
// This file is distributed under the University of Illinois Open Source
 | 
						|
// License. See LICENSE.TXT for details.
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
//
 | 
						|
// This file implements the StringExtras.h header
 | 
						|
//
 | 
						|
//===----------------------------------------------------------------------===//
 | 
						|
 | 
						|
#include "llvm/ADT/SmallVector.h"
 | 
						|
#include "llvm/ADT/STLExtras.h"
 | 
						|
#include "llvm/ADT/StringExtras.h"
 | 
						|
using namespace llvm;
 | 
						|
 | 
						|
/// StrInStrNoCase - Portable version of strcasestr.  Locates the first
 | 
						|
/// occurrence of string 's1' in string 's2', ignoring case.  Returns
 | 
						|
/// the offset of s2 in s1 or npos if s2 cannot be found.
 | 
						|
StringRef::size_type llvm::StrInStrNoCase(StringRef s1, StringRef s2) {
 | 
						|
  size_t N = s2.size(), M = s1.size();
 | 
						|
  if (N > M)
 | 
						|
    return StringRef::npos;
 | 
						|
  for (size_t i = 0, e = M - N + 1; i != e; ++i)
 | 
						|
    if (s1.substr(i, N).equals_lower(s2))
 | 
						|
      return i;
 | 
						|
  return StringRef::npos;
 | 
						|
}
 | 
						|
 | 
						|
/// getToken - This function extracts one token from source, ignoring any
 | 
						|
/// leading characters that appear in the Delimiters string, and ending the
 | 
						|
/// token at any of the characters that appear in the Delimiters string.  If
 | 
						|
/// there are no tokens in the source string, an empty string is returned.
 | 
						|
/// The function returns a pair containing the extracted token and the
 | 
						|
/// remaining tail string.
 | 
						|
std::pair<StringRef, StringRef> llvm::getToken(StringRef Source,
 | 
						|
                                               StringRef Delimiters) {
 | 
						|
  // Figure out where the token starts.
 | 
						|
  StringRef::size_type Start = Source.find_first_not_of(Delimiters);
 | 
						|
 | 
						|
  // Find the next occurrence of the delimiter.
 | 
						|
  StringRef::size_type End = Source.find_first_of(Delimiters, Start);
 | 
						|
 | 
						|
  return std::make_pair(Source.slice(Start, End), Source.substr(End));
 | 
						|
}
 | 
						|
 | 
						|
/// SplitString - Split up the specified string according to the specified
 | 
						|
/// delimiters, appending the result fragments to the output list.
 | 
						|
void llvm::SplitString(StringRef Source,
 | 
						|
                       SmallVectorImpl<StringRef> &OutFragments,
 | 
						|
                       StringRef Delimiters) {
 | 
						|
  StringRef S2, S;
 | 
						|
  tie(S2, S) = getToken(Source, Delimiters);
 | 
						|
  while (!S2.empty()) {
 | 
						|
    OutFragments.push_back(S2);
 | 
						|
    tie(S2, S) = getToken(S, Delimiters);
 | 
						|
  }
 | 
						|
}
 | 
						|
 | 
						|
void llvm::StringRef::split(SmallVectorImpl<StringRef> &A,
 | 
						|
                            StringRef Separators, int MaxSplit,
 | 
						|
                            bool KeepEmpty) const {
 | 
						|
  StringRef rest = *this;
 | 
						|
 | 
						|
  // rest.data() is used to distinguish cases like "a," that splits into
 | 
						|
  // "a" + "" and "a" that splits into "a" + 0.
 | 
						|
  for (int splits = 0;
 | 
						|
       rest.data() != NULL && (MaxSplit < 0 || splits < MaxSplit);
 | 
						|
       ++splits) {
 | 
						|
    std::pair<llvm::StringRef, llvm::StringRef> p = rest.split(Separators);
 | 
						|
 | 
						|
    if (p.first.size() != 0 || KeepEmpty)
 | 
						|
      A.push_back(p.first);
 | 
						|
    rest = p.second;
 | 
						|
  }
 | 
						|
  // If we have a tail left, add it.
 | 
						|
  if (rest.data() != NULL && (rest.size() != 0 || KeepEmpty))
 | 
						|
    A.push_back(rest);
 | 
						|
}
 |