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
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
|
/*
*/
#include "ast.hpp"
#include "crate.hpp"
#include "types.hpp"
#include "../common.hpp"
#include <iostream>
#include "../parse/parseerror.hpp"
#include <algorithm>
#include <serialiser_texttree.hpp>
namespace AST {
namespace {
::std::vector<MetaItem> clone_mivec(const ::std::vector<MetaItem>& v) {
::std::vector<MetaItem> ri;
ri.reserve(v.size());
for(const auto& i : v)
ri.push_back( i.clone() );
return ri;
}
}
MetaItems::~MetaItems()
{
}
MetaItems MetaItems::clone() const
{
return MetaItems( m_span, clone_mivec(m_items) );
}
void MetaItems::push_back(MetaItem i)
{
m_items.push_back( ::std::move(i) );
}
MetaItem* MetaItems::get(const char *name)
{
for( auto& i : m_items ) {
if(i.name() == name) {
i.mark_used();
return &i;
}
}
return 0;
}
MetaItem::~MetaItem()
{
}
MetaItem MetaItem::clone() const
{
TU_MATCH(MetaItemData, (m_data), (e),
(None,
return MetaItem(m_name);
),
(String,
return MetaItem(m_name, e.val);
),
(List,
return MetaItem(m_name, clone_mivec(e.sub_items));
)
)
throw ::std::runtime_error("MetaItem::clone - Fell off end");
}
::std::ostream& operator<<(::std::ostream& os, const ImplDef& impl)
{
return os << "impl<" << impl.m_params << "> " << impl.m_trait.ent << " for " << impl.m_type << "";
}
void Impl::add_function(bool is_public, bool is_specialisable, ::std::string name, Function fcn)
{
DEBUG("impl fn " << name);
m_items.push_back( ImplItem { is_public, is_specialisable, mv$(name), box$( Item::make_Function(mv$(fcn)) ) } );
}
void Impl::add_type(bool is_public, bool is_specialisable, ::std::string name, TypeRef type)
{
m_items.push_back( ImplItem { is_public, is_specialisable, mv$(name), box$( Item::make_Type(TypeAlias(GenericParams(), mv$(type))) ) } );
}
void Impl::add_static(bool is_public, bool is_specialisable, ::std::string name, Static v)
{
m_items.push_back( ImplItem { is_public, is_specialisable, mv$(name), box$( Item::make_Static(mv$(v)) ) } );
}
bool Impl::has_named_item(const ::std::string& name) const
{
for( const auto& it : this->items() )
{
if( it.name == name ) {
return true;
}
}
return false;
}
::std::ostream& operator<<(::std::ostream& os, const Impl& impl)
{
return os << impl.m_def;
}
::rust::option<char> ImplRef::find_named_item(const ::std::string& name) const
{
if( this->impl.has_named_item(name) ) {
return ::rust::Some(' ');
}
else {
return ::rust::None<char>();
}
}
::std::ostream& operator<<(::std::ostream& os, const UseStmt& x)
{
os << "Use(" << x.path << ")";
return os;
}
MacroInvocation MacroInvocation::clone() const
{
return MacroInvocation(m_span, m_attrs.clone(), m_macro_name, m_ident, m_input.clone());
}
::std::unique_ptr<AST::Module> Module::add_anon() {
auto rv = box$( Module(m_my_path + FMT("#" << m_anon_modules.size())) );
m_anon_modules.push_back( rv.get() );
return rv;
}
void Module::add_item(bool is_pub, ::std::string name, Item it, MetaItems attrs) {
m_items.push_back( Named<Item>( mv$(name), mv$(it), is_pub ) );
m_items.back().data.attrs = mv$(attrs);
DEBUG("Item " << ::AST::Item::tag_to_str( m_items.back().data.tag() ) << " - attrs = " << m_items.back().data.attrs);
}
void Module::add_ext_crate(bool is_public, ::std::string ext_name, ::std::string imp_name, MetaItems attrs) {
this->add_item( is_public, imp_name, Item::make_Crate({mv$(ext_name)}), mv$(attrs) );
}
void Module::add_alias(bool is_public, UseStmt us, ::std::string name, MetaItems attrs) {
us.attrs = mv$(attrs);
m_imports.push_back( Named<UseStmt>( mv$(name), mv$(us), is_public) );
}
void Module::add_typealias(bool is_public, ::std::string name, TypeAlias alias, MetaItems attrs) {
this->add_item( is_public, name, Item::make_Type({mv$(alias)}), mv$(attrs) );
}
void Module::add_static(bool is_public, ::std::string name, Static item, MetaItems attrs) {
this->add_item( is_public, name, Item::make_Static({mv$(item)}), mv$(attrs) );
}
void Module::add_trait(bool is_public, ::std::string name, Trait item, MetaItems attrs) {
this->add_item( is_public, name, Item::make_Trait({mv$(item)}), mv$(attrs) );
}
void Module::add_struct(bool is_public, ::std::string name, Struct item, MetaItems attrs) {
this->add_item( is_public, name, Item::make_Struct({mv$(item)}), mv$(attrs) );
}
void Module::add_enum(bool is_public, ::std::string name, Enum item, MetaItems attrs) {
this->add_item( is_public, name, Item::make_Enum({mv$(item)}), mv$(attrs) );
}
void Module::add_function(bool is_public, ::std::string name, Function item, MetaItems attrs) {
DEBUG("mod fn " << name);
this->add_item( is_public, name, Item::make_Function({mv$(item)}), mv$(attrs) );
}
void Module::add_submod(bool is_public, ::std::string name, Module mod, MetaItems attrs) {
DEBUG("mod.m_name = " << name << ", attrs = " << attrs);
this->add_item( is_public, mv$(name), Item::make_Module({mv$(mod)}), mv$(attrs) );
}
void Module::add_macro(bool is_exported, ::std::string name, MacroRulesPtr macro) {
m_macros.push_back( Named<MacroRulesPtr>( mv$(name), mv$(macro), is_exported ) );
}
void Module::prescan()
{
//TRACE_FUNCTION;
//DEBUG("- '"<<m_name<<"'");
//
//for( auto& sm_p : m_submods )
//{
// sm_p.first.prescan();
//}
}
template<typename T>
typename ::std::vector<Named<T> >::const_iterator find_named(const ::std::vector<Named<T> >& vec, const ::std::string& name)
{
return ::std::find_if(vec.begin(), vec.end(), [&name](const Named<T>& x) {
//DEBUG("find_named - x.name = " << x.name);
return x.name == name && !x.data.is_None();
});
}
Module::ItemRef Module::find_item(const ::std::string& needle, bool allow_leaves, bool ignore_private_wildcard) const
{
TRACE_FUNCTION_F("path = " << m_my_path << ", needle = " << needle);
{
auto it = find_named(this->items(), needle);
if( it != this->items().end() ) {
TU_MATCH(::AST::Item, (it->data), (e),
(None,
throw ::std::runtime_error("BUG: Hit a None item");
),
(MacroInv,
throw ::std::runtime_error("BUG: Hit a macro invocation");
),
(Module, return ItemRef(e); ),
(Crate, return ItemRef(e.name); ),
(Type, return ItemRef(e); ),
(Struct, return ItemRef(e); ),
(Enum, return ItemRef(e); ),
(Trait, return ItemRef(e); ),
(Function,
if( allow_leaves )
return ItemRef(e);
else
DEBUG("Skipping function, leaves not allowed");
),
(Static,
if( allow_leaves )
return ItemRef(e);
else
DEBUG("Skipping function, leaves not allowed");
)
)
DEBUG("Item not checked at this level, try re-export list");
}
}
// - Re-exports
// > Comes last, as it's a potentially expensive operation
{
for( const auto& imp : this->imports() )
{
//DEBUG("imp: '" << imp.name << "' = " << imp.data);
if( !imp.is_pub && ignore_private_wildcard )
{
// not public, ignore
//DEBUG("Private import, '" << imp.name << "' = " << imp.data);
}
else if( imp.name == needle )
{
DEBUG("Match " << needle << " = " << imp.data);
return ItemRef(imp);
}
else if( imp.name == "" )
{
// Loop avoidance, don't check this
//if( &imp.data == this )
// continue ;
//
const auto& binding = imp.data.path.binding();
if( binding.is_Unbound() )
{
// not yet bound, so run resolution (recursion)
DEBUG("Recursively resolving pub wildcard use " << imp.data);
//imp.data.resolve(root_crate);
throw ParseError::Todo("AST::Module::find_item() - Wildcard `use` not bound, call resolve here?");
}
TU_MATCH_DEF(AST::PathBinding, (binding), (info),
// - any other type - error
(
DEBUG("ERROR: Import of invalid class : " << imp.data.path);
throw ParseError::Generic("Wildcard import of non-module/enum");
),
(Unbound,
throw ParseError::BugCheck("Wildcard import path not bound");
),
// - If it's a module, recurse
(Module,
auto rv = info.module_->find_item(needle);
if( !rv.is_None() ) {
// Don't return RV, return the import (so caller can rewrite path if need be)
return ItemRef(imp);
//return rv;
}
),
// - If it's an enum, search for this name and then pass to resolve
(Enum,
auto& vars = info.enum_->variants();
// Damnit C++ "let it = vars.find(|a| a.name == needle);"
auto it = ::std::find_if(vars.begin(), vars.end(),
[&needle](const EnumVariant& ev) { return ev.m_name == needle; });
if( it != vars.end() ) {
DEBUG("Found enum variant " << it->m_name);
return ItemRef(imp);
//throw ParseError::Todo("Handle lookup_path_in_module for wildcard imports - enum");
}
)
)
}
else
{
// Can't match, ignore
}
}
}
return Module::ItemRef();
}
void Trait::add_type(::std::string name, TypeRef type) {
m_items.push_back( Named<Item>(mv$(name), Item::make_Type({TypeAlias(GenericParams(), mv$(type))}), true) );
}
void Trait::add_function(::std::string name, Function fcn) {
DEBUG("trait fn " << name);
m_items.push_back( Named<Item>(mv$(name), Item::make_Function({mv$(fcn)}), true) );
}
void Trait::add_static(::std::string name, Static v) {
m_items.push_back( Named<Item>(mv$(name), Item::make_Static({mv$(v)}), true) );
}
void Trait::set_is_marker() {
m_is_marker = true;
}
bool Trait::is_marker() const {
return m_is_marker;
}
bool Trait::has_named_item(const ::std::string& name, bool& out_is_fcn) const
{
for( const auto& i : m_items )
{
if( i.name == name ) {
out_is_fcn = i.data.is_Function();
return true;
}
}
return false;
}
::std::ostream& operator<<(::std::ostream& os, const TypeParam& tp)
{
//os << "TypeParam(";
os << tp.m_name;
os << " = ";
os << tp.m_default;
//os << ")";
return os;
}
::std::ostream& operator<<(::std::ostream& os, const GenericBound& x)
{
TU_MATCH(GenericBound, (x), (ent),
(Lifetime,
os << "'" << ent.test << ": '" << ent.bound;
),
(TypeLifetime,
os << ent.type << ": '" << ent.bound;
),
(IsTrait,
if( ! ent.hrls.empty() )
{
os << "for<";
for(const auto& l : ent.hrls)
os << "'" << l;
os << ">";
}
os << ent.type << ": " << ent.trait;
),
(MaybeTrait,
os << ent.type << ": ?" << ent.trait;
),
(NotTrait,
os << ent.type << ": !" << ent.trait;
),
(Equality,
os << ent.type << " = " << ent.replacement;
)
)
return os;
}
int GenericParams::find_name(const char* name) const
{
for( unsigned int i = 0; i < m_type_params.size(); i ++ )
{
if( m_type_params[i].name() == name )
return i;
}
DEBUG("Type param '" << name << "' not in list");
return -1;
}
::std::ostream& operator<<(::std::ostream& os, const GenericParams& tps)
{
return os << "<" << tps.m_lifetime_params << "," << tps.m_type_params << "> where {" << tps.m_bounds << "}";
}
} // namespace AST
|