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
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
|
// slang-ast-decl.cpp
#include "slang-ast-decl.h"
#include "slang-ast-builder.h"
#include "slang-ast-dispatch.h"
#include "slang-syntax.h"
#include <assert.h>
namespace Slang
{
const TypeExp& TypeConstraintDecl::getSup() const
{
SLANG_AST_NODE_VIRTUAL_CALL(TypeConstraintDecl, getSup, ())
}
const TypeExp& TypeConstraintDecl::_getSupOverride() const
{
SLANG_UNEXPECTED("TypeConstraintDecl::_getSupOverride not overridden");
// return TypeExp::empty;
}
InterfaceDecl* findParentInterfaceDecl(Decl* decl)
{
auto ancestor = decl->parentDecl;
for (; ancestor; ancestor = ancestor->parentDecl)
{
if (auto interfaceDecl = as<InterfaceDecl>(ancestor))
return interfaceDecl;
if (as<ExtensionDecl>(ancestor))
return nullptr;
}
return nullptr;
}
bool isInterfaceRequirement(Decl* decl)
{
auto ancestor = decl->parentDecl;
for (; ancestor; ancestor = ancestor->parentDecl)
{
if (as<InterfaceDecl>(ancestor))
return true;
if (as<ExtensionDecl>(ancestor))
return false;
}
return false;
}
//
// ContainerDecl
//
List<Decl*> const& ContainerDecl::getDirectMemberDecls()
{
return _directMemberDecls.decls;
}
Count ContainerDecl::getDirectMemberDeclCount()
{
return _directMemberDecls.decls.getCount();
}
Decl* ContainerDecl::getDirectMemberDecl(Index index)
{
return _directMemberDecls.decls[index];
}
Decl* ContainerDecl::getFirstDirectMemberDecl()
{
if (getDirectMemberDeclCount() == 0)
return nullptr;
return getDirectMemberDecl(0);
}
DeclsOfNameList ContainerDecl::getDirectMemberDeclsOfName(Name* name)
{
return DeclsOfNameList(findLastDirectMemberDeclOfName(name));
}
Decl* ContainerDecl::findLastDirectMemberDeclOfName(Name* name)
{
_ensureLookupAcceleratorsAreValid();
if (auto found = _directMemberDecls.accelerators.mapNameToLastDeclOfThatName.tryGetValue(name))
return *found;
return nullptr;
}
Decl* ContainerDecl::getPrevDirectMemberDeclWithSameName(Decl* decl)
{
SLANG_ASSERT(decl);
SLANG_ASSERT(decl->parentDecl == this);
_ensureLookupAcceleratorsAreValid();
return decl->_prevInContainerWithSameName;
}
void ContainerDecl::addDirectMemberDecl(Decl* decl)
{
if (!decl)
return;
decl->parentDecl = this;
_directMemberDecls.decls.add(decl);
}
List<Decl*> const& ContainerDecl::getTransparentDirectMemberDecls()
{
_ensureLookupAcceleratorsAreValid();
return _directMemberDecls.accelerators.filteredListOfTransparentDecls;
}
bool ContainerDecl::_areLookupAcceleratorsValid()
{
return _directMemberDecls.accelerators.declCountWhenLastUpdated ==
_directMemberDecls.decls.getCount();
}
void ContainerDecl::_invalidateLookupAccelerators()
{
_directMemberDecls.accelerators.declCountWhenLastUpdated = -1;
}
void ContainerDecl::_ensureLookupAcceleratorsAreValid()
{
if (_areLookupAcceleratorsValid())
return;
// If the `declCountWhenLastUpdated` is less than zero, it means that
// the accelerators are entirely invalidated, and must be rebuilt
// from scratch.
//
if (_directMemberDecls.accelerators.declCountWhenLastUpdated < 0)
{
_directMemberDecls.accelerators.declCountWhenLastUpdated = 0;
_directMemberDecls.accelerators.mapNameToLastDeclOfThatName.clear();
_directMemberDecls.accelerators.filteredListOfTransparentDecls.clear();
}
// are we a generic?
GenericDecl* genericDecl = as<GenericDecl>(this);
Count memberCount = _directMemberDecls.decls.getCount();
Count memberCountWhenLastUpdated = _directMemberDecls.accelerators.declCountWhenLastUpdated;
SLANG_ASSERT(memberCountWhenLastUpdated >= 0 && memberCountWhenLastUpdated <= memberCount);
for (Index i = memberCountWhenLastUpdated; i < memberCount; ++i)
{
Decl* memberDecl = _directMemberDecls.decls[i];
// Transparent member declarations will go into a separate list,
// so that they can be conveniently queried later for lookup
// operations.
//
// TODO: Rather than track these using a separate table, we
// could design a scheme where transparent members are put into
// the same lookup dictionary as everything else, just under
// a pseudo-name that identifies transparent members.
//
if (memberDecl->hasModifier<TransparentModifier>())
{
_directMemberDecls.accelerators.filteredListOfTransparentDecls.add(memberDecl);
}
// Members that don't have a name don't go into the lookup dictionary.
//
auto memberName = memberDecl->getName();
if (!memberName)
continue;
// As a special case, we ignore the `inner` member of a
// `GenericDecl`, since it will always have the same name
// as the outer generic, and should not be found by lookup.
//
// TODO: We really ought to change up our entire encoding
// of generic declarations in the AST.
//
if (genericDecl && memberDecl == genericDecl->inner)
continue;
// It is possible that we have encountered previous declarations
// that have the same name as `memberDecl`, and in that
// case we want to wire them up into a singly-linked list.
//
// This list makes it easy for a lookup operation to find, e.g.,
// all of the overloaded functions with a given name.
//
Decl* prevMemberWithSameName = nullptr;
_directMemberDecls.accelerators.mapNameToLastDeclOfThatName.tryGetValue(
memberName,
prevMemberWithSameName);
memberDecl->_prevInContainerWithSameName = prevMemberWithSameName;
// Whether or not there was a previous declaration with this
// name, the current `memberDecl` is the last member declaration
// with that name encountered so far, and it is what we will
// store in the lookup dictionary.
//
_directMemberDecls.accelerators.mapNameToLastDeclOfThatName[memberName] = memberDecl;
}
_directMemberDecls.accelerators.declCountWhenLastUpdated = memberCount;
SLANG_ASSERT(_areLookupAcceleratorsValid());
}
void ContainerDecl::
_invalidateLookupAcceleratorsBecauseUnscopedEnumAttributeWillBeTurnedIntoTransparentModifier(
UnscopedEnumAttribute* unscopedEnumAttr,
TransparentModifier* transparentModifier)
{
SLANG_ASSERT(unscopedEnumAttr);
SLANG_ASSERT(transparentModifier);
SLANG_UNUSED(unscopedEnumAttr);
SLANG_UNUSED(transparentModifier);
_invalidateLookupAccelerators();
}
void ContainerDecl::
_removeDirectMemberConstructorDeclBecauseSynthesizedAnotherDefaultConstructorInstead(
ConstructorDecl* decl)
{
SLANG_ASSERT(decl);
_invalidateLookupAccelerators();
_directMemberDecls.decls.remove(decl);
}
void ContainerDecl::
_replaceDirectMemberBitFieldVariableDeclAtIndexWithPropertyDeclThatWasSynthesizedForIt(
Index index,
VarDecl* oldDecl,
PropertyDecl* newDecl)
{
SLANG_ASSERT(oldDecl);
SLANG_ASSERT(newDecl);
SLANG_ASSERT(index >= 0 && index < getDirectMemberDeclCount());
SLANG_ASSERT(getDirectMemberDecl(index) == oldDecl);
SLANG_UNUSED(oldDecl);
_invalidateLookupAccelerators();
_directMemberDecls.decls[index] = newDecl;
}
void ContainerDecl::_insertDirectMemberDeclAtIndexForBitfieldPropertyBackingMember(
Index index,
VarDecl* backingVarDecl)
{
SLANG_ASSERT(backingVarDecl);
SLANG_ASSERT(index >= 0 && index <= getDirectMemberDeclCount());
_invalidateLookupAccelerators();
_directMemberDecls.decls.insert(index, backingVarDecl);
}
//
//
//
bool isLocalVar(const Decl* decl)
{
const auto varDecl = as<VarDecl>(decl);
if (!varDecl)
return false;
const Decl* pp = varDecl->parentDecl;
if (as<ScopeDecl>(pp))
return true;
while (auto genericDecl = as<GenericDecl>(pp))
pp = genericDecl->inner;
if (as<FunctionDeclBase>(pp))
return true;
return false;
}
ThisTypeDecl* InterfaceDecl::getThisTypeDecl()
{
auto thisTypeDecl = findFirstDirectMemberDeclOfType<ThisTypeDecl>();
if (!thisTypeDecl)
{
SLANG_UNEXPECTED("InterfaceDecl does not have a ThisType decl.");
}
return thisTypeDecl;
}
InterfaceDecl* ThisTypeConstraintDecl::getInterfaceDecl()
{
return as<InterfaceDecl>(parentDecl->parentDecl);
}
void AggTypeDecl::addTag(TypeTag tag)
{
typeTags = (TypeTag)((int)tag | (int)tag);
}
bool AggTypeDecl::hasTag(TypeTag tag)
{
return ((int)typeTags & (int)tag) != 0;
}
void AggTypeDecl::unionTagsWith(TypeTag other)
{
addTag(other);
}
} // namespace Slang
|