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
|
// Copyright (c) 2008 Roberto Raggi <roberto.raggi@gmail.com>
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
#pragma once
#include "CPlusPlusForwardDeclarations.h"
#include "Name.h"
#include "FullySpecifiedType.h"
#include <vector>
namespace CPlusPlus {
class CPLUSPLUS_EXPORT QualifiedNameId: public Name
{
public:
QualifiedNameId(const Name *base, const Name *name)
: _base(base), _name(name) {}
virtual ~QualifiedNameId();
virtual const Identifier *identifier() const;
const Name *base() const;
const Name *name() const;
virtual const QualifiedNameId *asQualifiedNameId() const
{ return this; }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
const Name *_base;
const Name *_name;
};
class CPLUSPLUS_EXPORT DestructorNameId: public Name
{
public:
DestructorNameId(const Name *name);
virtual ~DestructorNameId();
virtual const Name *name() const;
virtual const Identifier *identifier() const;
virtual const DestructorNameId *asDestructorNameId() const
{ return this; }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
const Name *_name;
};
class CPLUSPLUS_EXPORT TemplateNameId: public Name
{
public:
template <typename Iterator>
TemplateNameId(const Identifier *identifier, bool isSpecialization, Iterator first,
Iterator last)
: _identifier(identifier)
, _templateArguments(first, last)
, _isSpecialization(isSpecialization) {}
virtual ~TemplateNameId();
virtual const Identifier *identifier() const;
// ### find a better name
unsigned templateArgumentCount() const;
const FullySpecifiedType &templateArgumentAt(unsigned index) const;
virtual const TemplateNameId *asTemplateNameId() const
{ return this; }
typedef std::vector<FullySpecifiedType>::const_iterator TemplateArgumentIterator;
TemplateArgumentIterator firstTemplateArgument() const { return _templateArguments.begin(); }
TemplateArgumentIterator lastTemplateArgument() const { return _templateArguments.end(); }
bool isSpecialization() const { return _isSpecialization; }
// Comparator needed to distinguish between two different TemplateNameId(e.g.:used in std::map)
struct Compare: std::binary_function<const TemplateNameId *, const TemplateNameId *, bool> {
bool operator()(const TemplateNameId *name, const TemplateNameId *other) const;
};
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
const Identifier *_identifier;
std::vector<FullySpecifiedType> _templateArguments;
// now TemplateNameId can be a specialization or an instantiation
bool _isSpecialization;
};
class CPLUSPLUS_EXPORT OperatorNameId: public Name
{
public:
/*
new delete new[] delete[]
+ - * / % ^ & | ~
! = < > += -= *= /= %=
^= &= |= << >> >>= <<= == !=
<= >= && || ++ -- , ->* ->
() []
*/
enum Kind {
InvalidOp,
NewOp,
DeleteOp,
NewArrayOp,
DeleteArrayOp,
PlusOp,
MinusOp,
StarOp,
SlashOp,
PercentOp,
CaretOp,
AmpOp,
PipeOp,
TildeOp,
ExclaimOp,
EqualOp,
LessOp,
GreaterOp,
PlusEqualOp,
MinusEqualOp,
StarEqualOp,
SlashEqualOp,
PercentEqualOp,
CaretEqualOp,
AmpEqualOp,
PipeEqualOp,
LessLessOp,
GreaterGreaterOp,
LessLessEqualOp,
GreaterGreaterEqualOp,
EqualEqualOp,
ExclaimEqualOp,
LessEqualOp,
GreaterEqualOp,
AmpAmpOp,
PipePipeOp,
PlusPlusOp,
MinusMinusOp,
CommaOp,
ArrowStarOp,
ArrowOp,
FunctionCallOp,
ArrayAccessOp
};
public:
OperatorNameId(Kind kind);
virtual ~OperatorNameId();
Kind kind() const;
virtual const Identifier *identifier() const;
virtual const OperatorNameId *asOperatorNameId() const
{ return this; }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
Kind _kind;
};
class CPLUSPLUS_EXPORT ConversionNameId: public Name
{
public:
ConversionNameId(const FullySpecifiedType &type);
virtual ~ConversionNameId();
FullySpecifiedType type() const;
virtual const Identifier *identifier() const;
virtual const ConversionNameId *asConversionNameId() const
{ return this; }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
FullySpecifiedType _type;
};
class CPLUSPLUS_EXPORT SelectorNameId: public Name
{
public:
template <typename Iterator>
SelectorNameId(Iterator first, Iterator last, bool hasArguments)
: _names(first, last), _hasArguments(hasArguments) {}
virtual ~SelectorNameId();
virtual const Identifier *identifier() const;
unsigned nameCount() const;
const Name *nameAt(unsigned index) const;
bool hasArguments() const;
virtual const SelectorNameId *asSelectorNameId() const
{ return this; }
typedef std::vector<const Name *>::const_iterator NameIterator;
NameIterator firstName() const { return _names.begin(); }
NameIterator lastName() const { return _names.end(); }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
std::vector<const Name *> _names;
bool _hasArguments;
};
class CPLUSPLUS_EXPORT AnonymousNameId: public Name
{
public:
AnonymousNameId(unsigned classTokenIndex);
virtual ~AnonymousNameId();
unsigned classTokenIndex() const;
virtual const Identifier *identifier() const;
virtual const AnonymousNameId *asAnonymousNameId() const
{ return this; }
protected:
virtual void accept0(NameVisitor *visitor) const;
virtual bool match0(const Name *otherName, Matcher *matcher) const;
private:
unsigned _classTokenIndex;
};
} // namespace CPlusPlus
|
