- you can use a Python script to write a summary string for data-types, in one of
three ways:
-P option and typing the script a line at a time
-s option and passing a one-line Python script
-F option and passing the name of a Python function
these options all work for the "type summary add" command
your Python code (if provided through -P or -s) is wrapped in a function
that accepts two parameters: valobj (a ValueObject) and dict (an LLDB
internal dictionary object). if you use -F and give a function name,
you're expected to define the function on your own and with the right
prototype. your function, however defined, must return a Python string
- test case for the Python summary feature
- a few quirks:
Python summaries cannot have names, and cannot use regex as type names
both issues will be fixed ASAP
major redesign of type summary code:
- type summary working with strings and type summary working with Python code
are two classes, with a common base class SummaryFormat
- SummaryFormat classes now are able to actively format objects rather than
just aggregating data
- cleaner code to print descriptions for summaries
the public API now exports a method to easily navigate a ValueObject hierarchy
New InputReaderEZ and PriorityPointerPair classes
Several minor fixes and improvements
llvm-svn: 135238
239 lines
4.9 KiB
C++
239 lines
4.9 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/StreamString.h"
|
|
#include "lldb/Host/FileSpec.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 char *str, size_t str_len)
|
|
{
|
|
if (str)
|
|
m_strings.push_back (std::string (str, str_len));
|
|
}
|
|
|
|
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)
|
|
{
|
|
uint32_t len = strings.GetSize();
|
|
|
|
for (uint32_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);
|
|
}
|
|
|
|
uint32_t
|
|
StringList::GetSize () const
|
|
{
|
|
return m_strings.size();
|
|
}
|
|
|
|
const char *
|
|
StringList::GetStringAtIndex (size_t idx) const
|
|
{
|
|
if (idx < m_strings.size())
|
|
return m_strings[idx].c_str();
|
|
return NULL;
|
|
}
|
|
|
|
void
|
|
StringList::Clear ()
|
|
{
|
|
m_strings.clear();
|
|
}
|
|
|
|
void
|
|
StringList::LongestCommonPrefix (std::string &common_prefix)
|
|
{
|
|
//arg_sstr_collection::iterator pos, end = m_args.end();
|
|
int pos = 0;
|
|
int end = m_strings.size();
|
|
|
|
if (pos == end)
|
|
common_prefix.clear();
|
|
else
|
|
common_prefix = m_strings[pos];
|
|
|
|
for (++pos; pos != end; ++pos)
|
|
{
|
|
size_t new_size = strlen (m_strings[pos].c_str());
|
|
|
|
// First trim common_prefix if it is longer than the current element:
|
|
if (common_prefix.size() > new_size)
|
|
common_prefix.erase (new_size);
|
|
|
|
// Then trim it at the first disparity:
|
|
|
|
for (size_t i = 0; i < common_prefix.size(); i++)
|
|
{
|
|
if (m_strings[pos][i] != common_prefix[i])
|
|
{
|
|
common_prefix.erase(i);
|
|
break;
|
|
}
|
|
}
|
|
|
|
// If we've emptied the common prefix, we're done.
|
|
if (common_prefix.empty())
|
|
break;
|
|
}
|
|
}
|
|
|
|
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::DeleteStringAtIndex (size_t idx)
|
|
{
|
|
if (idx < m_strings.size())
|
|
m_strings.erase (m_strings.begin() + idx);
|
|
}
|
|
|
|
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)
|
|
{
|
|
StreamString strm;
|
|
for (int 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 std::string(strm.GetData());
|
|
}
|
|
|
|
StringList&
|
|
StringList::operator << (const char* str)
|
|
{
|
|
AppendString(str);
|
|
return *this;
|
|
}
|
|
|
|
StringList&
|
|
StringList::operator << (StringList strings)
|
|
{
|
|
AppendList(strings);
|
|
return *this;
|
|
} |