Coverage Report

Created: 2019-07-24 05:18

/Users/buildslave/jenkins/workspace/clang-stage2-coverage-R/llvm/lib/Support/StringExtras.cpp
Line
Count
Source
1
//===-- StringExtras.cpp - Implement the StringExtras header --------------===//
2
//
3
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4
// See https://llvm.org/LICENSE.txt for license information.
5
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6
//
7
//===----------------------------------------------------------------------===//
8
//
9
// This file implements the StringExtras.h header
10
//
11
//===----------------------------------------------------------------------===//
12
13
#include "llvm/ADT/StringExtras.h"
14
#include "llvm/ADT/SmallVector.h"
15
#include "llvm/Support/raw_ostream.h"
16
using namespace llvm;
17
18
/// StrInStrNoCase - Portable version of strcasestr.  Locates the first
19
/// occurrence of string 's1' in string 's2', ignoring case.  Returns
20
/// the offset of s2 in s1 or npos if s2 cannot be found.
21
4.25k
StringRef::size_type llvm::StrInStrNoCase(StringRef s1, StringRef s2) {
22
4.25k
  size_t N = s2.size(), M = s1.size();
23
4.25k
  if (N > M)
24
593
    return StringRef::npos;
25
39.0k
  
for (size_t i = 0, e = M - N + 1; 3.65k
i != e;
++i35.3k
)
26
35.4k
    if (s1.substr(i, N).equals_lower(s2))
27
29
      return i;
28
3.65k
  
return StringRef::npos3.62k
;
29
3.65k
}
30
31
/// getToken - This function extracts one token from source, ignoring any
32
/// leading characters that appear in the Delimiters string, and ending the
33
/// token at any of the characters that appear in the Delimiters string.  If
34
/// there are no tokens in the source string, an empty string is returned.
35
/// The function returns a pair containing the extracted token and the
36
/// remaining tail string.
37
std::pair<StringRef, StringRef> llvm::getToken(StringRef Source,
38
1.00M
                                               StringRef Delimiters) {
39
1.00M
  // Figure out where the token starts.
40
1.00M
  StringRef::size_type Start = Source.find_first_not_of(Delimiters);
41
1.00M
42
1.00M
  // Find the next occurrence of the delimiter.
43
1.00M
  StringRef::size_type End = Source.find_first_of(Delimiters, Start);
44
1.00M
45
1.00M
  return std::make_pair(Source.slice(Start, End), Source.substr(End));
46
1.00M
}
47
48
/// SplitString - Split up the specified string according to the specified
49
/// delimiters, appending the result fragments to the output list.
50
void llvm::SplitString(StringRef Source,
51
                       SmallVectorImpl<StringRef> &OutFragments,
52
48.1k
                       StringRef Delimiters) {
53
48.1k
  std::pair<StringRef, StringRef> S = getToken(Source, Delimiters);
54
345k
  while (!S.first.empty()) {
55
297k
    OutFragments.push_back(S.first);
56
297k
    S = getToken(S.second, Delimiters);
57
297k
  }
58
48.1k
}
59
60
499k
void llvm::printEscapedString(StringRef Name, raw_ostream &Out) {
61
9.00M
  for (unsigned i = 0, e = Name.size(); i != e; 
++i8.50M
) {
62
8.50M
    unsigned char C = Name[i];
63
8.50M
    if (isPrint(C) && 
C != '\\'8.47M
&&
C != '"'8.47M
)
64
8.47M
      Out << C;
65
36.2k
    else
66
36.2k
      Out << '\\' << hexdigit(C >> 4) << hexdigit(C & 0x0F);
67
8.50M
  }
68
499k
}
69
70
2.81k
void llvm::printHTMLEscaped(StringRef String, raw_ostream &Out) {
71
53.9k
  for (char C : String) {
72
53.9k
    if (C == '&')
73
38
      Out << "&amp;";
74
53.8k
    else if (C == '<')
75
460
      Out << "&lt;";
76
53.4k
    else if (C == '>')
77
481
      Out << "&gt;";
78
52.9k
    else if (C == '\"')
79
97
      Out << "&quot;";
80
52.8k
    else if (C == '\'')
81
312
      Out << "&apos;";
82
52.5k
    else
83
52.5k
      Out << C;
84
53.9k
  }
85
2.81k
}
86
87
960k
void llvm::printLowerCase(StringRef String, raw_ostream &Out) {
88
960k
  for (const char C : String)
89
3.10M
    Out << toLower(C);
90
960k
}