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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
|
#include "slang-source-map.h"
namespace Slang
{
void SourceMap::clear()
{
const String empty;
m_file = empty;
m_sourceRoot = empty;
m_sources.clear();
m_names.clear();
m_sourcesContent.clear();
m_lineStarts.setCount(1);
m_lineStarts[0] = 0;
m_lineEntries.clear();
m_slicePool.clear();
}
void SourceMap::swapWith(ThisType& rhs)
{
m_file.swapWith(rhs.m_file);
m_sourceRoot.swapWith(rhs.m_sourceRoot);
m_sources.swapWith(rhs.m_sources);
m_names.swapWith(rhs.m_names);
m_sourcesContent.swapWith(rhs.m_sourcesContent);
m_lineStarts.swapWith(rhs.m_lineStarts);
m_lineEntries.swapWith(rhs.m_lineEntries);
m_slicePool.swapWith(rhs.m_slicePool);
}
static bool _areEqual(
const List<StringSlicePool::Handle>& a,
const List<StringSlicePool::Handle>& b,
const List<Index>& bToAMap)
{
const auto count = a.getCount();
if (count != b.getCount())
{
return false;
}
const auto* as = a.getBuffer();
const auto* bs = a.getBuffer();
for (Index i = 0; i < count; ++i)
{
if (StringSlicePool::asIndex(as[i]) != bToAMap[StringSlicePool::asIndex(bs[i])])
{
return false;
}
}
return true;
}
static bool _areEqual(
const SourceMap::Entry& a,
const SourceMap::Entry& b,
const List<Index>& bToAMap)
{
return a.generatedColumn == b.generatedColumn && a.sourceLine == b.sourceLine &&
a.sourceColumn == b.sourceColumn && a.sourceFileIndex == bToAMap[b.sourceFileIndex] &&
a.nameIndex == bToAMap[b.nameIndex];
}
static bool _areEqual(
const List<SourceMap::Entry>& a,
const List<SourceMap::Entry>& b,
const List<Index>& bToAMap)
{
const auto count = a.getCount();
if (count != b.getCount())
{
return false;
}
for (Index i = 0; i < count; ++i)
{
if (!_areEqual(a[i], b[i], bToAMap))
{
return false;
}
}
return true;
}
bool SourceMap::operator==(const ThisType& rhs) const
{
if (this == &rhs)
{
return true;
}
if (m_file != rhs.m_file || m_sourceRoot != rhs.m_sourceRoot ||
m_lineStarts != rhs.m_lineStarts)
{
return false;
}
if (m_slicePool == rhs.m_slicePool)
{
// If the slice pools are the same we can just compare indices directly
return m_sources == rhs.m_sources && m_sourcesContent == rhs.m_sourcesContent &&
m_names == rhs.m_names && m_lineEntries == rhs.m_lineEntries;
}
else
{
// Otherwise we need to remap the indices
// Maps a pool handle from the rhs source map to the
List<Index> rhsMap;
Count count = rhs.m_slicePool.getSlicesCount();
rhsMap.setCount(count);
const auto startIndex = rhs.m_slicePool.getFirstAddedIndex();
// Work out the map
for (Index i = 0; i < startIndex; ++i)
{
const auto rhsSlice = rhs.m_slicePool.getSlice(StringSlicePool::Handle(i));
rhsMap[i] = (i < startIndex) ? i : m_slicePool.findIndex(rhsSlice);
}
// Do the comparison taking into account the mapping.
return _areEqual(m_sources, rhs.m_sources, rhsMap) &&
_areEqual(m_sourcesContent, rhs.m_sourcesContent, rhsMap) &&
_areEqual(m_names, rhs.m_names, rhsMap) &&
_areEqual(m_lineEntries, rhs.m_lineEntries, rhsMap);
}
}
void SourceMap::advanceToLine(Index nextLineIndex)
{
const Count currentLineIndex = getGeneratedLineCount() - 1;
SLANG_ASSERT(nextLineIndex >= currentLineIndex);
if (nextLineIndex <= currentLineIndex)
{
return;
}
const auto lastEntryIndex = m_lineEntries.getCount();
// For all the new entries they will need to point to the end
m_lineStarts.growToCount(nextLineIndex + 1);
Index* starts = m_lineStarts.getBuffer();
for (Index i = currentLineIndex + 1; i < nextLineIndex + 1; ++i)
{
starts[i] = lastEntryIndex;
}
}
Index SourceMap::getNameIndex(const UnownedStringSlice& slice)
{
StringSlicePool::Handle handle;
if (!m_slicePool.findOrAdd(slice, handle))
{
// We know it can't possibly be used, so must be new (!)
m_names.add(handle);
return m_names.getCount() - 1;
}
// Okay, could already be in the list
const auto index = m_names.indexOf(handle);
if (index >= 0)
{
return index;
}
m_names.add(handle);
return m_names.getCount() - 1;
}
UnownedStringSlice SourceMap::getSourceFileName(Index sourceFileIndex) const
{
return m_slicePool.getSlice(m_sources[sourceFileIndex]);
}
Index SourceMap::getSourceFileIndex(const UnownedStringSlice& slice)
{
StringSlicePool::Handle handle;
if (!m_slicePool.findOrAdd(slice, handle))
{
// We know it can't possibly be used, so must be new (!)
m_sources.add(handle);
return m_sources.getCount() - 1;
}
// Okay, could already be in the list
const auto index = m_sources.indexOf(handle);
if (index >= 0)
{
return index;
}
m_sources.add(handle);
return m_sources.getCount() - 1;
}
Index SourceMap::findEntry(Index lineIndex, Index colIndex) const
{
auto entries = getEntriesForLine(lineIndex);
Index closestDist = 0x7fffffff;
Index bestIndex = -1;
const Count count = entries.getCount();
for (Index i = 0; i < count; ++i)
{
const Entry& entry = entries[i];
// We found an exact match
if (entry.generatedColumn == colIndex)
{
bestIndex = i;
break;
}
Index dist = entry.generatedColumn - colIndex;
dist = (dist < 0) ? -dist : dist;
if (dist < closestDist)
{
closestDist = dist;
bestIndex = i;
}
}
if (bestIndex < 0)
{
return bestIndex;
}
return m_lineStarts[lineIndex] + bestIndex;
}
} // namespace Slang
|
