1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
|
//===-- PathMappingList.cpp -------------------------------------*- C++ -*-===//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// C Includes
// C++ Includes
// Other libraries and framework includes
#include "lldb/Core/Error.h"
#include "lldb/Core/Stream.h"
// Project includes
#include "lldb/Target/PathMappingList.h"
#include <string.h>
using namespace lldb;
using namespace lldb_private;
//----------------------------------------------------------------------
// PathMappingList constructor
//----------------------------------------------------------------------
PathMappingList::PathMappingList
(
ChangedCallback callback,
void *callback_baton
) :
m_pairs (),
m_callback (callback),
m_callback_baton (callback_baton)
{
}
//----------------------------------------------------------------------
// Destructor
//----------------------------------------------------------------------
PathMappingList::~PathMappingList ()
{
}
void
PathMappingList::Append (const ConstString &path,
const ConstString &replacement,
bool notify)
{
m_pairs.push_back(pair(path, replacement));
if (notify && m_callback)
m_callback (*this, m_callback_baton);
}
void
PathMappingList::Insert (const ConstString &path,
const ConstString &replacement,
uint32_t index,
bool notify)
{
iterator insert_iter;
if (index >= m_pairs.size())
insert_iter = m_pairs.end();
else
insert_iter = m_pairs.begin() + index;
m_pairs.insert(insert_iter, pair(path, replacement));
if (notify && m_callback)
m_callback (*this, m_callback_baton);
}
bool
PathMappingList::Remove (off_t index, bool notify)
{
if (index >= m_pairs.size())
return false;
iterator iter = m_pairs.begin() + index;
m_pairs.erase(iter);
if (notify && m_callback)
m_callback (*this, m_callback_baton);
return true;
}
void
PathMappingList::Dump (Stream *s)
{
unsigned int numPairs = m_pairs.size();
unsigned int index;
for (index = 0; index < numPairs; ++index)
{
s->Printf("[%d] \"%s\" -> \"%s\"\n",
index, m_pairs[index].first.GetCString(), m_pairs[index].second.GetCString());
}
}
void
PathMappingList::Clear (bool notify)
{
m_pairs.clear();
if (notify && m_callback)
m_callback (*this, m_callback_baton);
}
size_t
PathMappingList::GetSize ()
{
return m_pairs.size();
}
bool
PathMappingList::RemapPath (const ConstString &path, ConstString &new_path)
{
const_iterator pos, end = m_pairs.end();
for (pos = m_pairs.begin(); pos != end; ++pos)
{
const size_t prefixLen = pos->first.GetLength();
if (::strncmp (pos->first.GetCString(), path.GetCString(), prefixLen) == 0)
{
std::string new_path_str (pos->second.GetCString());
new_path_str.append(path.GetCString() + prefixLen);
new_path.SetCString(new_path_str.c_str());
return true;
}
}
return false;
}
|
