llvm-project/lldb/source/Utility/StringList.cpp

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

242 lines
5.8 KiB
C++
Raw Normal View History

//===-- StringList.cpp ------------------------------------------*- C++ -*-===//
//
// 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
//
//===----------------------------------------------------------------------===//
#include "lldb/Utility/StringList.h"
#include "lldb/Utility/Log.h"
#include "lldb/Utility/Stream.h"
#include "lldb/Utility/StreamString.h"
#include "llvm/ADT/ArrayRef.h"
#include <algorithm>
#include <stdint.h>
#include <string.h>
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) {
m_strings.reserve(m_strings.size() + strings.GetSize());
m_strings.insert(m_strings.end(), strings.begin(), strings.end());
}
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 nullptr;
}
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(); }
std::string StringList::LongestCommonPrefix() {
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);
}
return prefix.str();
}
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;
While tracking down memory consumption issue a few things were needed: the ability to dump more information about modules in "target modules list". We can now dump the shared pointer reference count for modules, the pointer to the module itself (in case performance tools can help track down who has references to said pointer), and the modification time. Added "target delete [target-idx ...]" to be able to delete targets when they are no longer needed. This will help track down memory usage issues and help to resolve when module ref counts keep getting incremented. If the command gets no arguments, the currently selected target will be deleted. If any arguments are given, they must all be valid target indexes (use the "target list" command to get the current target indexes). Took care of a bunch of "no newline at end of file" warnings. TimeValue objects can now dump their time to a lldb_private::Stream object. Modified the "target modules list --global" command to not error out if there are no targets since it doesn't require a target. Fixed an issue in the MacOSX DYLD dynamic loader plug-in where if a shared library was updated on disk, we would keep using the older one, even if it was updated. Don't allow the ModuleList::GetSharedModule(...) to return an empty module. Previously we could specify a valid path on disc to a module, and specify an architecture that wasn't contained in that module and get a shared pointer to a module that wouldn't be able to return an object file or a symbol file. We now make sure an object file can be extracted prior to adding the shared pointer to the module to get added to the shared list. llvm-svn: 137196
2011-08-10 10:10:13 +08:00
}
StringList &StringList::operator=(const std::vector<std::string> &rhs) {
m_strings.assign(rhs.begin(), rhs.end());
return *this;
}
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);
LLDB_LOGV(log, "{0}", strm.GetData());
}