2017-05-17 01:10:25 +02:00
|
|
|
//===- llvm/ADT/StringExtras.h - Useful string functions --------*- C++ -*-===//
|
2005-04-21 22:19:05 +02:00
|
|
|
//
|
2019-01-19 09:50:56 +01:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2005-04-21 22:19:05 +02:00
|
|
|
//
|
2003-10-20 21:46:57 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
2001-06-06 22:29:01 +02:00
|
|
|
//
|
|
|
|
// This file contains some functions that are useful when dealing with strings.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2004-09-02 00:55:40 +02:00
|
|
|
#ifndef LLVM_ADT_STRINGEXTRAS_H
|
|
|
|
#define LLVM_ADT_STRINGEXTRAS_H
|
2001-06-06 22:29:01 +02:00
|
|
|
|
2021-06-11 14:19:00 +02:00
|
|
|
#include "llvm/ADT/APSInt.h"
|
2017-06-14 22:11:46 +02:00
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
2017-06-23 14:55:02 +02:00
|
|
|
#include "llvm/ADT/SmallString.h"
|
2009-10-17 20:21:06 +02:00
|
|
|
#include "llvm/ADT/StringRef.h"
|
2017-11-17 02:00:35 +01:00
|
|
|
#include "llvm/ADT/Twine.h"
|
2017-05-17 01:10:25 +02:00
|
|
|
#include <cassert>
|
|
|
|
#include <cstddef>
|
|
|
|
#include <cstdint>
|
2017-06-23 14:55:02 +02:00
|
|
|
#include <cstdlib>
|
2017-05-17 01:10:25 +02:00
|
|
|
#include <cstring>
|
2017-06-06 13:49:48 +02:00
|
|
|
#include <iterator>
|
2017-05-17 01:10:25 +02:00
|
|
|
#include <string>
|
|
|
|
#include <utility>
|
2001-10-29 14:24:31 +01:00
|
|
|
|
2003-11-11 23:41:34 +01:00
|
|
|
namespace llvm {
|
2017-05-17 01:10:25 +02:00
|
|
|
|
2010-01-11 19:03:24 +01:00
|
|
|
template<typename T> class SmallVectorImpl;
|
2017-05-17 01:10:25 +02:00
|
|
|
class raw_ostream;
|
2003-11-11 23:41:34 +01:00
|
|
|
|
2010-11-27 14:19:46 +01:00
|
|
|
/// hexdigit - Return the hexadecimal character for the
|
2012-09-13 14:34:29 +02:00
|
|
|
/// given number \p X (which should be less than 16).
|
2017-10-24 19:29:12 +02:00
|
|
|
inline char hexdigit(unsigned X, bool LowerCase = false) {
|
2010-11-27 14:19:46 +01:00
|
|
|
const char HexChar = LowerCase ? 'a' : 'A';
|
|
|
|
return X < 10 ? '0' + X : HexChar + X - 10;
|
2008-10-15 01:26:20 +02:00
|
|
|
}
|
|
|
|
|
2018-06-12 19:43:52 +02:00
|
|
|
/// Given an array of c-style strings terminated by a null pointer, construct
|
|
|
|
/// a vector of StringRefs representing the same strings without the terminating
|
|
|
|
/// null string.
|
|
|
|
inline std::vector<StringRef> toStringRefArray(const char *const *Strings) {
|
|
|
|
std::vector<StringRef> Result;
|
|
|
|
while (*Strings)
|
|
|
|
Result.push_back(*Strings++);
|
|
|
|
return Result;
|
|
|
|
}
|
|
|
|
|
2014-01-27 05:07:36 +01:00
|
|
|
/// Construct a string ref from a boolean.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline StringRef toStringRef(bool B) { return StringRef(B ? "true" : "false"); }
|
2014-01-27 05:07:36 +01:00
|
|
|
|
2017-06-14 22:11:46 +02:00
|
|
|
/// Construct a string ref from an array ref of unsigned chars.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline StringRef toStringRef(ArrayRef<uint8_t> Input) {
|
2017-06-14 22:11:46 +02:00
|
|
|
return StringRef(reinterpret_cast<const char *>(Input.begin()), Input.size());
|
|
|
|
}
|
|
|
|
|
2017-11-27 19:48:37 +01:00
|
|
|
/// Construct a string ref from an array ref of unsigned chars.
|
|
|
|
inline ArrayRef<uint8_t> arrayRefFromStringRef(StringRef Input) {
|
|
|
|
return {Input.bytes_begin(), Input.bytes_end()};
|
|
|
|
}
|
|
|
|
|
2013-01-18 22:45:30 +01:00
|
|
|
/// Interpret the given character \p C as a hexadecimal digit and return its
|
|
|
|
/// value.
|
|
|
|
///
|
|
|
|
/// If \p C is not a valid hex digit, -1U is returned.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline unsigned hexDigitValue(char C) {
|
2020-10-29 00:46:31 +01:00
|
|
|
struct HexTable {
|
|
|
|
unsigned LUT[255] = {};
|
|
|
|
constexpr HexTable() {
|
|
|
|
// Default initialize everything to invalid.
|
|
|
|
for (int i = 0; i < 255; ++i)
|
2021-01-15 23:32:38 +01:00
|
|
|
LUT[i] = ~0U;
|
2020-10-29 00:46:31 +01:00
|
|
|
// Initialize `0`-`9`.
|
|
|
|
for (int i = 0; i < 10; ++i)
|
|
|
|
LUT['0' + i] = i;
|
|
|
|
// Initialize `A`-`F` and `a`-`f`.
|
|
|
|
for (int i = 0; i < 6; ++i)
|
|
|
|
LUT['A' + i] = LUT['a' + i] = 10 + i;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
constexpr HexTable Table;
|
|
|
|
return Table.LUT[static_cast<unsigned char>(C)];
|
2013-01-18 22:45:30 +01:00
|
|
|
}
|
|
|
|
|
2017-10-04 10:50:08 +02:00
|
|
|
/// Checks if character \p C is one of the 10 decimal digits.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline bool isDigit(char C) { return C >= '0' && C <= '9'; }
|
2017-10-04 10:50:08 +02:00
|
|
|
|
|
|
|
/// Checks if character \p C is a hexadecimal numeric character.
|
2021-01-15 23:32:38 +01:00
|
|
|
inline bool isHexDigit(char C) { return hexDigitValue(C) != ~0U; }
|
2017-10-04 10:50:08 +02:00
|
|
|
|
|
|
|
/// Checks if character \p C is a valid letter as classified by "C" locale.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline bool isAlpha(char C) {
|
2017-10-04 10:50:08 +02:00
|
|
|
return ('a' <= C && C <= 'z') || ('A' <= C && C <= 'Z');
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Checks whether character \p C is either a decimal digit or an uppercase or
|
|
|
|
/// lowercase letter as classified by "C" locale.
|
2017-10-24 19:29:12 +02:00
|
|
|
inline bool isAlnum(char C) { return isAlpha(C) || isDigit(C); }
|
2017-10-04 10:50:08 +02:00
|
|
|
|
2018-07-10 13:51:26 +02:00
|
|
|
/// Checks whether character \p C is valid ASCII (high bit is zero).
|
|
|
|
inline bool isASCII(char C) { return static_cast<unsigned char>(C) <= 127; }
|
|
|
|
|
|
|
|
/// Checks whether all characters in S are ASCII.
|
|
|
|
inline bool isASCII(llvm::StringRef S) {
|
|
|
|
for (char C : S)
|
|
|
|
if (LLVM_UNLIKELY(!isASCII(C)))
|
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-07-26 17:31:41 +02:00
|
|
|
/// Checks whether character \p C is printable.
|
|
|
|
///
|
|
|
|
/// Locale-independent version of the C standard library isprint whose results
|
|
|
|
/// may differ on different platforms.
|
|
|
|
inline bool isPrint(char C) {
|
|
|
|
unsigned char UC = static_cast<unsigned char>(C);
|
|
|
|
return (0x20 <= UC) && (UC <= 0x7E);
|
|
|
|
}
|
|
|
|
|
2020-05-02 15:18:35 +02:00
|
|
|
/// Checks whether character \p C is whitespace in the "C" locale.
|
|
|
|
///
|
|
|
|
/// Locale-independent version of the C standard library isspace.
|
|
|
|
inline bool isSpace(char C) {
|
|
|
|
return C == ' ' || C == '\f' || C == '\n' || C == '\r' || C == '\t' ||
|
|
|
|
C == '\v';
|
|
|
|
}
|
|
|
|
|
2017-11-28 15:22:27 +01:00
|
|
|
/// Returns the corresponding lowercase character if \p x is uppercase.
|
|
|
|
inline char toLower(char x) {
|
|
|
|
if (x >= 'A' && x <= 'Z')
|
|
|
|
return x - 'A' + 'a';
|
|
|
|
return x;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Returns the corresponding uppercase character if \p x is lowercase.
|
|
|
|
inline char toUpper(char x) {
|
|
|
|
if (x >= 'a' && x <= 'z')
|
|
|
|
return x - 'a' + 'A';
|
|
|
|
return x;
|
|
|
|
}
|
|
|
|
|
2017-10-24 19:29:12 +02:00
|
|
|
inline std::string utohexstr(uint64_t X, bool LowerCase = false) {
|
2016-01-31 21:00:22 +01:00
|
|
|
char Buffer[17];
|
|
|
|
char *BufPtr = std::end(Buffer);
|
|
|
|
|
|
|
|
if (X == 0) *--BufPtr = '0';
|
2002-04-07 10:36:19 +02:00
|
|
|
|
|
|
|
while (X) {
|
2005-01-28 08:22:20 +01:00
|
|
|
unsigned char Mod = static_cast<unsigned char>(X) & 15;
|
2014-07-14 23:56:54 +02:00
|
|
|
*--BufPtr = hexdigit(Mod, LowerCase);
|
2002-04-07 10:36:19 +02:00
|
|
|
X >>= 4;
|
|
|
|
}
|
2009-01-09 20:25:42 +01:00
|
|
|
|
2016-01-31 21:00:22 +01:00
|
|
|
return std::string(BufPtr, std::end(Buffer));
|
2002-04-07 10:36:19 +02:00
|
|
|
}
|
|
|
|
|
2016-04-21 07:54:23 +02:00
|
|
|
/// Convert buffer \p Input to its hexadecimal representation.
|
|
|
|
/// The returned string is double the size of \p Input.
|
2018-09-10 21:34:44 +02:00
|
|
|
inline std::string toHex(StringRef Input, bool LowerCase = false) {
|
2016-04-21 07:54:23 +02:00
|
|
|
static const char *const LUT = "0123456789ABCDEF";
|
2018-09-10 21:34:44 +02:00
|
|
|
const uint8_t Offset = LowerCase ? 32 : 0;
|
2016-04-21 07:54:23 +02:00
|
|
|
size_t Length = Input.size();
|
|
|
|
|
|
|
|
std::string Output;
|
|
|
|
Output.reserve(2 * Length);
|
|
|
|
for (size_t i = 0; i < Length; ++i) {
|
|
|
|
const unsigned char c = Input[i];
|
2018-09-10 21:34:44 +02:00
|
|
|
Output.push_back(LUT[c >> 4] | Offset);
|
|
|
|
Output.push_back(LUT[c & 15] | Offset);
|
2016-04-21 07:54:23 +02:00
|
|
|
}
|
|
|
|
return Output;
|
|
|
|
}
|
|
|
|
|
2018-09-10 21:34:44 +02:00
|
|
|
inline std::string toHex(ArrayRef<uint8_t> Input, bool LowerCase = false) {
|
|
|
|
return toHex(toStringRef(Input), LowerCase);
|
2017-06-14 22:11:46 +02:00
|
|
|
}
|
|
|
|
|
2020-10-29 00:46:25 +01:00
|
|
|
/// Store the binary representation of the two provided values, \p MSB and
|
|
|
|
/// \p LSB, that make up the nibbles of a hexadecimal digit. If \p MSB or \p LSB
|
|
|
|
/// do not correspond to proper nibbles of a hexadecimal digit, this method
|
|
|
|
/// returns false. Otherwise, returns true.
|
|
|
|
inline bool tryGetHexFromNibbles(char MSB, char LSB, uint8_t &Hex) {
|
2017-04-25 22:21:35 +02:00
|
|
|
unsigned U1 = hexDigitValue(MSB);
|
|
|
|
unsigned U2 = hexDigitValue(LSB);
|
2021-01-15 23:32:38 +01:00
|
|
|
if (U1 == ~0U || U2 == ~0U)
|
2020-10-29 00:46:25 +01:00
|
|
|
return false;
|
2017-04-25 22:21:35 +02:00
|
|
|
|
2020-10-29 00:46:25 +01:00
|
|
|
Hex = static_cast<uint8_t>((U1 << 4) | U2);
|
|
|
|
return true;
|
2017-04-25 22:21:35 +02:00
|
|
|
}
|
|
|
|
|
2020-10-29 00:46:25 +01:00
|
|
|
/// Return the binary representation of the two provided values, \p MSB and
|
|
|
|
/// \p LSB, that make up the nibbles of a hexadecimal digit.
|
|
|
|
inline uint8_t hexFromNibbles(char MSB, char LSB) {
|
|
|
|
uint8_t Hex = 0;
|
|
|
|
bool GotHex = tryGetHexFromNibbles(MSB, LSB, Hex);
|
|
|
|
(void)GotHex;
|
|
|
|
assert(GotHex && "MSB and/or LSB do not correspond to hex digits");
|
|
|
|
return Hex;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Convert hexadecimal string \p Input to its binary representation and store
|
|
|
|
/// the result in \p Output. Returns true if the binary representation could be
|
|
|
|
/// converted from the hexadecimal string. Returns false if \p Input contains
|
|
|
|
/// non-hexadecimal digits. The output string is half the size of \p Input.
|
|
|
|
inline bool tryGetFromHex(StringRef Input, std::string &Output) {
|
2017-04-25 22:21:35 +02:00
|
|
|
if (Input.empty())
|
2020-10-29 00:46:25 +01:00
|
|
|
return true;
|
2017-04-25 22:21:35 +02:00
|
|
|
|
|
|
|
Output.reserve((Input.size() + 1) / 2);
|
|
|
|
if (Input.size() % 2 == 1) {
|
2020-10-29 00:46:25 +01:00
|
|
|
uint8_t Hex = 0;
|
|
|
|
if (!tryGetHexFromNibbles('0', Input.front(), Hex))
|
|
|
|
return false;
|
|
|
|
|
|
|
|
Output.push_back(Hex);
|
2017-04-25 22:21:35 +02:00
|
|
|
Input = Input.drop_front();
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(Input.size() % 2 == 0);
|
|
|
|
while (!Input.empty()) {
|
2020-10-29 00:46:25 +01:00
|
|
|
uint8_t Hex = 0;
|
|
|
|
if (!tryGetHexFromNibbles(Input[0], Input[1], Hex))
|
|
|
|
return false;
|
|
|
|
|
2017-04-25 22:21:35 +02:00
|
|
|
Output.push_back(Hex);
|
|
|
|
Input = Input.drop_front(2);
|
|
|
|
}
|
2020-10-29 00:46:25 +01:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Convert hexadecimal string \p Input to its binary representation.
|
|
|
|
/// The return string is half the size of \p Input.
|
|
|
|
inline std::string fromHex(StringRef Input) {
|
|
|
|
std::string Hex;
|
|
|
|
bool GotHex = tryGetFromHex(Input, Hex);
|
|
|
|
(void)GotHex;
|
|
|
|
assert(GotHex && "Input contains non hex digits");
|
|
|
|
return Hex;
|
2017-04-25 22:21:35 +02:00
|
|
|
}
|
|
|
|
|
2018-05-01 17:54:18 +02:00
|
|
|
/// Convert the string \p S to an integer of the specified type using
|
2017-05-14 19:11:05 +02:00
|
|
|
/// the radix \p Base. If \p Base is 0, auto-detects the radix.
|
|
|
|
/// Returns true if the number was successfully converted, false otherwise.
|
|
|
|
template <typename N> bool to_integer(StringRef S, N &Num, unsigned Base = 0) {
|
|
|
|
return !S.getAsInteger(Base, Num);
|
|
|
|
}
|
|
|
|
|
2017-06-23 14:55:02 +02:00
|
|
|
namespace detail {
|
|
|
|
template <typename N>
|
|
|
|
inline bool to_float(const Twine &T, N &Num, N (*StrTo)(const char *, char **)) {
|
|
|
|
SmallString<32> Storage;
|
|
|
|
StringRef S = T.toNullTerminatedStringRef(Storage);
|
|
|
|
char *End;
|
|
|
|
N Temp = StrTo(S.data(), &End);
|
|
|
|
if (*End != '\0')
|
|
|
|
return false;
|
|
|
|
Num = Temp;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool to_float(const Twine &T, float &Num) {
|
2017-06-23 15:13:06 +02:00
|
|
|
return detail::to_float(T, Num, strtof);
|
2017-06-23 14:55:02 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline bool to_float(const Twine &T, double &Num) {
|
2017-06-23 15:13:06 +02:00
|
|
|
return detail::to_float(T, Num, strtod);
|
2017-06-23 14:55:02 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline bool to_float(const Twine &T, long double &Num) {
|
2017-06-23 15:13:06 +02:00
|
|
|
return detail::to_float(T, Num, strtold);
|
2017-06-23 14:55:02 +02:00
|
|
|
}
|
|
|
|
|
2017-10-24 19:29:12 +02:00
|
|
|
inline std::string utostr(uint64_t X, bool isNeg = false) {
|
2010-04-11 21:00:03 +02:00
|
|
|
char Buffer[21];
|
2016-01-31 02:12:35 +01:00
|
|
|
char *BufPtr = std::end(Buffer);
|
2009-01-09 20:25:42 +01:00
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
if (X == 0) *--BufPtr = '0'; // Handle special case...
|
2009-01-09 20:25:42 +01:00
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
while (X) {
|
2004-06-04 21:10:30 +02:00
|
|
|
*--BufPtr = '0' + char(X % 10);
|
2001-06-06 22:29:01 +02:00
|
|
|
X /= 10;
|
|
|
|
}
|
2009-01-09 20:25:42 +01:00
|
|
|
|
2001-06-06 22:29:01 +02:00
|
|
|
if (isNeg) *--BufPtr = '-'; // Add negative sign...
|
2016-01-31 02:12:35 +01:00
|
|
|
return std::string(BufPtr, std::end(Buffer));
|
2001-06-06 22:29:01 +02:00
|
|
|
}
|
|
|
|
|
2017-10-24 19:29:12 +02:00
|
|
|
inline std::string itostr(int64_t X) {
|
2005-04-21 22:19:05 +02:00
|
|
|
if (X < 0)
|
2021-01-15 23:32:38 +01:00
|
|
|
return utostr(static_cast<uint64_t>(1) + ~static_cast<uint64_t>(X), true);
|
2004-08-19 00:56:12 +02:00
|
|
|
else
|
|
|
|
return utostr(static_cast<uint64_t>(X));
|
|
|
|
}
|
2005-04-21 22:19:05 +02:00
|
|
|
|
2021-06-11 14:19:00 +02:00
|
|
|
inline std::string toString(const APInt &I, unsigned Radix, bool Signed,
|
|
|
|
bool formatAsCLiteral = false) {
|
|
|
|
SmallString<40> S;
|
|
|
|
I.toString(S, Radix, Signed, formatAsCLiteral);
|
|
|
|
return std::string(S.str());
|
|
|
|
}
|
|
|
|
|
|
|
|
inline std::string toString(const APSInt &I, unsigned Radix) {
|
|
|
|
return toString(I, Radix, I.isSigned());
|
|
|
|
}
|
|
|
|
|
2010-01-11 20:45:18 +01:00
|
|
|
/// 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 StrInStrNoCase(StringRef s1, StringRef s2);
|
|
|
|
|
2003-12-29 06:06:38 +01:00
|
|
|
/// 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.
|
2010-01-11 19:03:24 +01:00
|
|
|
/// The function returns a pair containing the extracted token and the
|
|
|
|
/// remaining tail string.
|
|
|
|
std::pair<StringRef, StringRef> getToken(StringRef Source,
|
|
|
|
StringRef Delimiters = " \t\n\v\f\r");
|
2003-12-29 06:06:38 +01:00
|
|
|
|
2006-11-28 23:32:35 +01:00
|
|
|
/// SplitString - Split up the specified string according to the specified
|
|
|
|
/// delimiters, appending the result fragments to the output list.
|
2010-01-11 19:03:24 +01:00
|
|
|
void SplitString(StringRef Source,
|
|
|
|
SmallVectorImpl<StringRef> &OutFragments,
|
|
|
|
StringRef Delimiters = " \t\n\v\f\r");
|
2006-11-28 23:32:35 +01:00
|
|
|
|
2012-09-22 03:24:21 +02:00
|
|
|
/// Returns the English suffix for an ordinal integer (-st, -nd, -rd, -th).
|
2017-10-24 19:29:12 +02:00
|
|
|
inline StringRef getOrdinalSuffix(unsigned Val) {
|
2012-09-22 03:24:21 +02:00
|
|
|
// It is critically important that we do this perfectly for
|
|
|
|
// user-written sequences with over 100 elements.
|
|
|
|
switch (Val % 100) {
|
|
|
|
case 11:
|
|
|
|
case 12:
|
|
|
|
case 13:
|
|
|
|
return "th";
|
|
|
|
default:
|
|
|
|
switch (Val % 10) {
|
|
|
|
case 1: return "st";
|
|
|
|
case 2: return "nd";
|
|
|
|
case 3: return "rd";
|
|
|
|
default: return "th";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-05-31 19:01:42 +02:00
|
|
|
/// Print each character of the specified string, escaping it if it is not
|
|
|
|
/// printable or if it is an escape char.
|
|
|
|
void printEscapedString(StringRef Name, raw_ostream &Out);
|
[IR] Properly handle escape characters in Attribute::getAsString()
If an attribute name has special characters such as '\01', it is not
properly printed in LLVM assembly language format. Since the format
expects the special characters are printed as it is, it has to contain
escape characters to make it printable.
Before:
attributes #0 = { ... "counting-function"="^A__gnu_mcount_nc" ...
After:
attributes #0 = { ... "counting-function"="\01__gnu_mcount_nc" ...
Reviewers: hfinkel, rengolin, rjmccall, compnerd
Subscribers: nemanjai, mcrosier, hans, shenhan, majnemer, llvm-commits
Differential Revision: https://reviews.llvm.org/D23792
llvm-svn: 280357
2016-09-01 13:44:06 +02:00
|
|
|
|
2018-05-30 19:47:11 +02:00
|
|
|
/// Print each character of the specified string, escaping HTML special
|
|
|
|
/// characters.
|
2018-05-31 19:01:42 +02:00
|
|
|
void printHTMLEscaped(StringRef String, raw_ostream &Out);
|
2018-05-30 19:47:11 +02:00
|
|
|
|
2017-11-28 15:22:27 +01:00
|
|
|
/// printLowerCase - Print each character as lowercase if it is uppercase.
|
|
|
|
void printLowerCase(StringRef String, raw_ostream &Out);
|
|
|
|
|
2020-04-15 03:54:23 +02:00
|
|
|
/// Converts a string from camel-case to snake-case by replacing all uppercase
|
|
|
|
/// letters with '_' followed by the letter in lowercase, except if the
|
|
|
|
/// uppercase letter is the first character of the string.
|
|
|
|
std::string convertToSnakeFromCamelCase(StringRef input);
|
|
|
|
|
|
|
|
/// Converts a string from snake-case to camel-case by replacing all occurrences
|
|
|
|
/// of '_' followed by a lowercase letter with the letter in uppercase.
|
|
|
|
/// Optionally allow capitalization of the first letter (if it is a lowercase
|
|
|
|
/// letter)
|
|
|
|
std::string convertToCamelFromSnakeCase(StringRef input,
|
|
|
|
bool capitalizeFirst = false);
|
|
|
|
|
2016-09-27 18:37:30 +02:00
|
|
|
namespace detail {
|
|
|
|
|
2013-09-03 22:43:54 +02:00
|
|
|
template <typename IteratorT>
|
|
|
|
inline std::string join_impl(IteratorT Begin, IteratorT End,
|
|
|
|
StringRef Separator, std::input_iterator_tag) {
|
|
|
|
std::string S;
|
|
|
|
if (Begin == End)
|
|
|
|
return S;
|
|
|
|
|
|
|
|
S += (*Begin);
|
|
|
|
while (++Begin != End) {
|
|
|
|
S += Separator;
|
|
|
|
S += (*Begin);
|
|
|
|
}
|
|
|
|
return S;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename IteratorT>
|
|
|
|
inline std::string join_impl(IteratorT Begin, IteratorT End,
|
|
|
|
StringRef Separator, std::forward_iterator_tag) {
|
|
|
|
std::string S;
|
|
|
|
if (Begin == End)
|
|
|
|
return S;
|
|
|
|
|
|
|
|
size_t Len = (std::distance(Begin, End) - 1) * Separator.size();
|
|
|
|
for (IteratorT I = Begin; I != End; ++I)
|
2021-01-13 13:19:42 +01:00
|
|
|
Len += (*I).size();
|
2013-09-03 22:43:54 +02:00
|
|
|
S.reserve(Len);
|
2021-01-13 12:36:49 +01:00
|
|
|
size_t PrevCapacity = S.capacity();
|
|
|
|
(void)PrevCapacity;
|
2013-09-03 22:43:54 +02:00
|
|
|
S += (*Begin);
|
|
|
|
while (++Begin != End) {
|
|
|
|
S += Separator;
|
|
|
|
S += (*Begin);
|
|
|
|
}
|
2021-01-13 12:36:49 +01:00
|
|
|
assert(PrevCapacity == S.capacity() && "String grew during building");
|
2013-09-03 22:43:54 +02:00
|
|
|
return S;
|
|
|
|
}
|
|
|
|
|
2016-09-27 18:37:30 +02:00
|
|
|
template <typename Sep>
|
|
|
|
inline void join_items_impl(std::string &Result, Sep Separator) {}
|
|
|
|
|
|
|
|
template <typename Sep, typename Arg>
|
|
|
|
inline void join_items_impl(std::string &Result, Sep Separator,
|
|
|
|
const Arg &Item) {
|
|
|
|
Result += Item;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Sep, typename Arg1, typename... Args>
|
|
|
|
inline void join_items_impl(std::string &Result, Sep Separator, const Arg1 &A1,
|
|
|
|
Args &&... Items) {
|
|
|
|
Result += A1;
|
|
|
|
Result += Separator;
|
|
|
|
join_items_impl(Result, Separator, std::forward<Args>(Items)...);
|
|
|
|
}
|
|
|
|
|
2019-09-01 18:04:38 +02:00
|
|
|
inline size_t join_one_item_size(char) { return 1; }
|
2016-09-27 18:37:30 +02:00
|
|
|
inline size_t join_one_item_size(const char *S) { return S ? ::strlen(S) : 0; }
|
|
|
|
|
|
|
|
template <typename T> inline size_t join_one_item_size(const T &Str) {
|
|
|
|
return Str.size();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline size_t join_items_size() { return 0; }
|
|
|
|
|
|
|
|
template <typename A1> inline size_t join_items_size(const A1 &A) {
|
|
|
|
return join_one_item_size(A);
|
|
|
|
}
|
|
|
|
template <typename A1, typename... Args>
|
|
|
|
inline size_t join_items_size(const A1 &A, Args &&... Items) {
|
|
|
|
return join_one_item_size(A) + join_items_size(std::forward<Args>(Items)...);
|
|
|
|
}
|
2017-05-17 01:10:25 +02:00
|
|
|
|
|
|
|
} // end namespace detail
|
2016-09-27 18:37:30 +02:00
|
|
|
|
2013-09-03 22:43:54 +02:00
|
|
|
/// Joins the strings in the range [Begin, End), adding Separator between
|
|
|
|
/// the elements.
|
|
|
|
template <typename IteratorT>
|
|
|
|
inline std::string join(IteratorT Begin, IteratorT End, StringRef Separator) {
|
2017-05-17 01:10:25 +02:00
|
|
|
using tag = typename std::iterator_traits<IteratorT>::iterator_category;
|
2017-03-30 13:06:25 +02:00
|
|
|
return detail::join_impl(Begin, End, Separator, tag());
|
2016-09-27 18:37:30 +02:00
|
|
|
}
|
|
|
|
|
2017-03-21 20:35:05 +01:00
|
|
|
/// Joins the strings in the range [R.begin(), R.end()), adding Separator
|
|
|
|
/// between the elements.
|
|
|
|
template <typename Range>
|
|
|
|
inline std::string join(Range &&R, StringRef Separator) {
|
|
|
|
return join(R.begin(), R.end(), Separator);
|
|
|
|
}
|
|
|
|
|
2016-09-27 18:37:30 +02:00
|
|
|
/// Joins the strings in the parameter pack \p Items, adding \p Separator
|
|
|
|
/// between the elements. All arguments must be implicitly convertible to
|
|
|
|
/// std::string, or there should be an overload of std::string::operator+=()
|
|
|
|
/// that accepts the argument explicitly.
|
|
|
|
template <typename Sep, typename... Args>
|
|
|
|
inline std::string join_items(Sep Separator, Args &&... Items) {
|
|
|
|
std::string Result;
|
|
|
|
if (sizeof...(Items) == 0)
|
|
|
|
return Result;
|
|
|
|
|
2017-03-30 13:06:25 +02:00
|
|
|
size_t NS = detail::join_one_item_size(Separator);
|
|
|
|
size_t NI = detail::join_items_size(std::forward<Args>(Items)...);
|
2016-09-27 18:37:30 +02:00
|
|
|
Result.reserve(NI + (sizeof...(Items) - 1) * NS + 1);
|
2017-03-30 13:06:25 +02:00
|
|
|
detail::join_items_impl(Result, Separator, std::forward<Args>(Items)...);
|
2016-09-27 18:37:30 +02:00
|
|
|
return Result;
|
2013-09-03 22:43:54 +02:00
|
|
|
}
|
|
|
|
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
/// A helper class to return the specified delimiter string after the first
|
|
|
|
/// invocation of operator StringRef(). Used to generate a comma-separated
|
|
|
|
/// list from a loop like so:
|
|
|
|
///
|
|
|
|
/// \code
|
2021-01-16 18:40:51 +01:00
|
|
|
/// ListSeparator LS;
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
/// for (auto &I : C)
|
2021-01-16 18:40:51 +01:00
|
|
|
/// OS << LS << I.getName();
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
/// \end
|
2021-01-16 06:00:55 +01:00
|
|
|
class ListSeparator {
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
bool First = true;
|
2021-01-16 06:00:55 +01:00
|
|
|
StringRef Separator;
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
|
2021-01-16 06:00:55 +01:00
|
|
|
public:
|
|
|
|
ListSeparator(StringRef Separator = ", ") : Separator(Separator) {}
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
operator StringRef() {
|
|
|
|
if (First) {
|
|
|
|
First = false;
|
|
|
|
return {};
|
|
|
|
}
|
2021-01-16 06:00:55 +01:00
|
|
|
return Separator;
|
[StringExtras] Add a helper class for comma-separated lists
This patch introduces a helper class SubsequentDelim to simplify loops
that generate a comma-separated lists.
For example, consider the following loop, taken from
llvm/lib/CodeGen/MachineBasicBlock.cpp:
for (auto I = pred_begin(), E = pred_end(); I != E; ++I) {
if (I != pred_begin())
OS << ", ";
OS << printMBBReference(**I);
}
The new class allows us to rewrite the loop as:
SubsequentDelim SD;
for (auto I = pred_begin(), E = pred_end(); I != E; ++I)
OS << SD << printMBBReference(**I);
where SD evaluates to the empty string for the first time and ", " for
subsequent iterations.
Unlike interleaveComma, defined in llvm/include/llvm/ADT/STLExtras.h,
SubsequentDelim can accommodate a wider variety of loops, including:
- those that conditionally skip certain items,
- those that need iterators to call getSuccProbability(I), and
- those that iterate over integer ranges.
As an example, this patch cleans up MachineBasicBlock::print.
Differential Revision: https://reviews.llvm.org/D94377
2021-01-10 23:32:02 +01:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2017-05-17 01:10:25 +02:00
|
|
|
} // end namespace llvm
|
2003-11-11 23:41:34 +01:00
|
|
|
|
2017-05-17 01:10:25 +02:00
|
|
|
#endif // LLVM_ADT_STRINGEXTRAS_H
|