This moves the following classes from Core -> Utility. ConstString Error RegularExpression Stream StreamString The goal here is to get lldbUtility into a state where it has no dependendencies except on itself and LLVM, so it can be the starting point at which to start untangling LLDB's dependencies. These are all low level and very widely used classes, and previously lldbUtility had dependencies up to lldbCore in order to use these classes. So moving then down to lldbUtility makes sense from both the short term and long term perspective in solving this problem. Differential Revision: https://reviews.llvm.org/D29427 llvm-svn: 293941
272 lines
6.5 KiB
C++
272 lines
6.5 KiB
C++
//===-- StringList.cpp ------------------------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "lldb/Core/StringList.h"
|
|
|
|
#include "lldb/Core/Log.h"
|
|
#include "lldb/Host/FileSpec.h"
|
|
#include "lldb/Utility/StreamString.h"
|
|
|
|
#include <string>
|
|
|
|
using namespace lldb_private;
|
|
|
|
StringList::StringList() : m_strings() {}
|
|
|
|
StringList::StringList(const char *str) : m_strings() {
|
|
if (str)
|
|
m_strings.push_back(str);
|
|
}
|
|
|
|
StringList::StringList(const char **strv, int strc) : m_strings() {
|
|
for (int i = 0; i < strc; ++i) {
|
|
if (strv[i])
|
|
m_strings.push_back(strv[i]);
|
|
}
|
|
}
|
|
|
|
StringList::~StringList() {}
|
|
|
|
void StringList::AppendString(const char *str) {
|
|
if (str)
|
|
m_strings.push_back(str);
|
|
}
|
|
|
|
void StringList::AppendString(const std::string &s) { m_strings.push_back(s); }
|
|
|
|
void StringList::AppendString(std::string &&s) { m_strings.push_back(s); }
|
|
|
|
void StringList::AppendString(const char *str, size_t str_len) {
|
|
if (str)
|
|
m_strings.push_back(std::string(str, str_len));
|
|
}
|
|
|
|
void StringList::AppendString(llvm::StringRef str) {
|
|
m_strings.push_back(str.str());
|
|
}
|
|
|
|
void StringList::AppendList(const char **strv, int strc) {
|
|
for (int i = 0; i < strc; ++i) {
|
|
if (strv[i])
|
|
m_strings.push_back(strv[i]);
|
|
}
|
|
}
|
|
|
|
void StringList::AppendList(StringList strings) {
|
|
size_t len = strings.GetSize();
|
|
|
|
for (size_t i = 0; i < len; ++i)
|
|
m_strings.push_back(strings.GetStringAtIndex(i));
|
|
}
|
|
|
|
bool StringList::ReadFileLines(FileSpec &input_file) {
|
|
return input_file.ReadFileLines(m_strings);
|
|
}
|
|
|
|
size_t StringList::GetSize() const { return m_strings.size(); }
|
|
|
|
size_t StringList::GetMaxStringLength() const {
|
|
size_t max_length = 0;
|
|
for (const auto &s : m_strings) {
|
|
const size_t len = s.size();
|
|
if (max_length < len)
|
|
max_length = len;
|
|
}
|
|
return max_length;
|
|
}
|
|
|
|
const char *StringList::GetStringAtIndex(size_t idx) const {
|
|
if (idx < m_strings.size())
|
|
return m_strings[idx].c_str();
|
|
return NULL;
|
|
}
|
|
|
|
void StringList::Join(const char *separator, Stream &strm) {
|
|
size_t size = GetSize();
|
|
|
|
if (size == 0)
|
|
return;
|
|
|
|
for (uint32_t i = 0; i < size; ++i) {
|
|
if (i > 0)
|
|
strm.PutCString(separator);
|
|
strm.PutCString(GetStringAtIndex(i));
|
|
}
|
|
}
|
|
|
|
void StringList::Clear() { m_strings.clear(); }
|
|
|
|
void StringList::LongestCommonPrefix(std::string &common_prefix) {
|
|
common_prefix.clear();
|
|
if (m_strings.empty())
|
|
return;
|
|
|
|
auto args = llvm::makeArrayRef(m_strings);
|
|
llvm::StringRef prefix = args.front();
|
|
for (auto arg : args.drop_front()) {
|
|
size_t count = 0;
|
|
for (count = 0; count < std::min(prefix.size(), arg.size()); ++count) {
|
|
if (prefix[count] != arg[count])
|
|
break;
|
|
}
|
|
prefix = prefix.take_front(count);
|
|
}
|
|
common_prefix = prefix;
|
|
}
|
|
|
|
void StringList::InsertStringAtIndex(size_t idx, const char *str) {
|
|
if (str) {
|
|
if (idx < m_strings.size())
|
|
m_strings.insert(m_strings.begin() + idx, str);
|
|
else
|
|
m_strings.push_back(str);
|
|
}
|
|
}
|
|
|
|
void StringList::InsertStringAtIndex(size_t idx, const std::string &str) {
|
|
if (idx < m_strings.size())
|
|
m_strings.insert(m_strings.begin() + idx, str);
|
|
else
|
|
m_strings.push_back(str);
|
|
}
|
|
|
|
void StringList::InsertStringAtIndex(size_t idx, std::string &&str) {
|
|
if (idx < m_strings.size())
|
|
m_strings.insert(m_strings.begin() + idx, str);
|
|
else
|
|
m_strings.push_back(str);
|
|
}
|
|
|
|
void StringList::DeleteStringAtIndex(size_t idx) {
|
|
if (idx < m_strings.size())
|
|
m_strings.erase(m_strings.begin() + idx);
|
|
}
|
|
|
|
size_t StringList::SplitIntoLines(const std::string &lines) {
|
|
return SplitIntoLines(lines.c_str(), lines.size());
|
|
}
|
|
|
|
size_t StringList::SplitIntoLines(const char *lines, size_t len) {
|
|
const size_t orig_size = m_strings.size();
|
|
|
|
if (len == 0)
|
|
return 0;
|
|
|
|
const char *k_newline_chars = "\r\n";
|
|
const char *p = lines;
|
|
const char *end = lines + len;
|
|
while (p < end) {
|
|
size_t count = strcspn(p, k_newline_chars);
|
|
if (count == 0) {
|
|
if (p[count] == '\r' || p[count] == '\n')
|
|
m_strings.push_back(std::string());
|
|
else
|
|
break;
|
|
} else {
|
|
if (p + count > end)
|
|
count = end - p;
|
|
m_strings.push_back(std::string(p, count));
|
|
}
|
|
if (p[count] == '\r' && p[count + 1] == '\n')
|
|
count++; // Skip an extra newline char for the DOS newline
|
|
count++; // Skip the newline character
|
|
p += count;
|
|
}
|
|
return m_strings.size() - orig_size;
|
|
}
|
|
|
|
void StringList::RemoveBlankLines() {
|
|
if (GetSize() == 0)
|
|
return;
|
|
|
|
size_t idx = 0;
|
|
while (idx < m_strings.size()) {
|
|
if (m_strings[idx].empty())
|
|
DeleteStringAtIndex(idx);
|
|
else
|
|
idx++;
|
|
}
|
|
}
|
|
|
|
std::string StringList::CopyList(const char *item_preamble,
|
|
const char *items_sep) const {
|
|
StreamString strm;
|
|
for (size_t i = 0; i < GetSize(); i++) {
|
|
if (i && items_sep && items_sep[0])
|
|
strm << items_sep;
|
|
if (item_preamble)
|
|
strm << item_preamble;
|
|
strm << GetStringAtIndex(i);
|
|
}
|
|
return strm.GetString();
|
|
}
|
|
|
|
StringList &StringList::operator<<(const char *str) {
|
|
AppendString(str);
|
|
return *this;
|
|
}
|
|
|
|
StringList &StringList::operator<<(const std::string &str) {
|
|
AppendString(str);
|
|
return *this;
|
|
}
|
|
|
|
StringList &StringList::operator<<(StringList strings) {
|
|
AppendList(strings);
|
|
return *this;
|
|
}
|
|
|
|
StringList &StringList::operator=(const std::vector<std::string> &rhs) {
|
|
Clear();
|
|
for (const auto &s : rhs)
|
|
m_strings.push_back(s);
|
|
|
|
return *this;
|
|
}
|
|
|
|
size_t StringList::AutoComplete(llvm::StringRef s, StringList &matches,
|
|
size_t &exact_idx) const {
|
|
matches.Clear();
|
|
exact_idx = SIZE_MAX;
|
|
if (s.empty()) {
|
|
// No string, so it matches everything
|
|
matches = *this;
|
|
return matches.GetSize();
|
|
}
|
|
|
|
const size_t s_len = s.size();
|
|
const size_t num_strings = m_strings.size();
|
|
|
|
for (size_t i = 0; i < num_strings; ++i) {
|
|
if (m_strings[i].find(s) == 0) {
|
|
if (exact_idx == SIZE_MAX && m_strings[i].size() == s_len)
|
|
exact_idx = matches.GetSize();
|
|
matches.AppendString(m_strings[i]);
|
|
}
|
|
}
|
|
return matches.GetSize();
|
|
}
|
|
|
|
void StringList::LogDump(Log *log, const char *name) {
|
|
if (!log)
|
|
return;
|
|
|
|
StreamString strm;
|
|
if (name)
|
|
strm.Printf("Begin %s:\n", name);
|
|
for (const auto &s : m_strings) {
|
|
strm.Indent();
|
|
strm.Printf("%s\n", s.c_str());
|
|
}
|
|
if (name)
|
|
strm.Printf("End %s.\n", name);
|
|
|
|
log->Debug("%s", strm.GetData());
|
|
}
|