source: src/SymTab/Indexer.cc@ 0992849

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 0992849 was 4670c79, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

Change Indexer::addWith to take a list of expressions instead of a WithStmt
  • Property mode set to 100644
File size: 26.3 KB
Line 
1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// Indexer.cc --
8//
9// Author : Richard C. Bilson
10// Created On : Sun May 17 21:37:33 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Thu Aug 17 16:08:40 2017
13// Update Count : 20
14//
15
16#include "Indexer.h"
17
18#include <cassert> // for assert, strict_dynamic_cast
19#include <iostream> // for operator<<, basic_ostream, ostream
20#include <string> // for string, operator<<, operator!=
21#include <unordered_map> // for operator!=, unordered_map<>::const...
22#include <unordered_set> // for unordered_set
23#include <utility> // for pair, make_pair, move
24
25#include "CodeGen/OperatorTable.h" // for isCtorDtor, isCtorDtorAssign
26#include "Common/SemanticError.h" // for SemanticError
27#include "Common/utility.h" // for cloneAll
28#include "InitTweak/InitTweak.h" // for isConstructor, isCopyFunction, isC...
29#include "Mangler.h" // for Mangler
30#include "Parser/LinkageSpec.h" // for isMangled, isOverridable, Spec
31#include "ResolvExpr/typeops.h" // for typesCompatible
32#include "SynTree/Constant.h" // for Constant
33#include "SynTree/Declaration.h" // for DeclarationWithType, FunctionDecl
34#include "SynTree/Expression.h" // for Expression, ImplicitCopyCtorExpr
35#include "SynTree/Initializer.h" // for Initializer
36#include "SynTree/Statement.h" // for CompoundStmt, Statement, ForStmt (...
37#include "SynTree/Type.h" // for Type, StructInstType, UnionInstType
38
39#define debugPrint(x) if ( doDebug ) { std::cerr << x; }
40
41namespace SymTab {
42 std::ostream & operator<<( std::ostream & out, const Indexer::IdData & data ) {
43 return out << "(" << data.id << "," << data.baseExpr << ")";
44 }
45
46 typedef std::unordered_map< std::string, Indexer::IdData > MangleTable;
47 typedef std::unordered_map< std::string, MangleTable > IdTable;
48 typedef std::unordered_map< std::string, NamedTypeDecl* > TypeTable;
49 typedef std::unordered_map< std::string, StructDecl* > StructTable;
50 typedef std::unordered_map< std::string, EnumDecl* > EnumTable;
51 typedef std::unordered_map< std::string, UnionDecl* > UnionTable;
52 typedef std::unordered_map< std::string, TraitDecl* > TraitTable;
53
54 void dump( const IdTable &table, std::ostream &os ) {
55 for ( IdTable::const_iterator id = table.begin(); id != table.end(); ++id ) {
56 for ( MangleTable::const_iterator mangle = id->second.begin(); mangle != id->second.end(); ++mangle ) {
57 os << mangle->second << std::endl;
58 }
59 }
60 }
61
62 template< typename Decl >
63 void dump( const std::unordered_map< std::string, Decl* > &table, std::ostream &os ) {
64 for ( typename std::unordered_map< std::string, Decl* >::const_iterator it = table.begin(); it != table.end(); ++it ) {
65 os << it->second << std::endl;
66 } // for
67 }
68
69 struct Indexer::Impl {
70 Impl( unsigned long _scope ) : refCount(1), scope( _scope ), size( 0 ), base(),
71 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
72 Impl( unsigned long _scope, Indexer &&_base ) : refCount(1), scope( _scope ), size( 0 ), base( _base ),
73 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
74 unsigned long refCount; ///< Number of references to these tables
75 unsigned long scope; ///< Scope these tables are associated with
76 unsigned long size; ///< Number of elements stored in this table
77 const Indexer base; ///< Base indexer this extends
78
79 IdTable idTable; ///< Identifier namespace
80 TypeTable typeTable; ///< Type namespace
81 StructTable structTable; ///< Struct namespace
82 EnumTable enumTable; ///< Enum namespace
83 UnionTable unionTable; ///< Union namespace
84 TraitTable traitTable; ///< Trait namespace
85 };
86
87 Indexer::Impl *Indexer::newRef( Indexer::Impl *toClone ) {
88 if ( ! toClone ) return 0;
89
90 // shorten the search chain by skipping empty links
91 Indexer::Impl *ret = toClone->size == 0 ? toClone->base.tables : toClone;
92 if ( ret ) { ++ret->refCount; }
93
94 return ret;
95 }
96
97 void Indexer::deleteRef( Indexer::Impl *toFree ) {
98 if ( ! toFree ) return;
99
100 if ( --toFree->refCount == 0 ) delete toFree;
101 }
102
103 void Indexer::removeSpecialOverrides( const std::string &id, std::list< IdData > & out ) const {
104 // only need to perform this step for constructors, destructors, and assignment functions
105 if ( ! CodeGen::isCtorDtorAssign( id ) ) return;
106
107 // helpful data structure
108 struct ValueType {
109 struct DeclBall {
110 IdData decl;
111 bool isUserDefinedFunc; // properties for this particular decl
112 bool isDefaultCtor;
113 bool isDtor;
114 bool isCopyFunc;
115 };
116 // properties for this type
117 bool existsUserDefinedFunc = false; // any user-defined function found
118 bool existsUserDefinedCtor = false; // any user-defined constructor found
119 bool existsUserDefinedDtor = false; // any user-defined destructor found
120 bool existsUserDefinedCopyFunc = false; // user-defined copy ctor found
121 bool existsUserDefinedDefaultCtor = false; // user-defined default ctor found
122 std::list< DeclBall > decls;
123
124 // another FunctionDecl for the current type was found - determine
125 // if it has special properties and update data structure accordingly
126 ValueType & operator+=( IdData data ) {
127 DeclarationWithType * function = data.id;
128 bool isUserDefinedFunc = ! LinkageSpec::isOverridable( function->get_linkage() );
129 bool isDefaultCtor = InitTweak::isDefaultConstructor( function );
130 bool isDtor = InitTweak::isDestructor( function );
131 bool isCopyFunc = InitTweak::isCopyFunction( function, function->get_name() );
132 decls.push_back( DeclBall{ data, isUserDefinedFunc, isDefaultCtor, isDtor, isCopyFunc } );
133 existsUserDefinedFunc = existsUserDefinedFunc || isUserDefinedFunc;
134 existsUserDefinedCtor = existsUserDefinedCtor || (isUserDefinedFunc && CodeGen::isConstructor( function->get_name() ) );
135 existsUserDefinedDtor = existsUserDefinedDtor || (isUserDefinedFunc && isDtor);
136 existsUserDefinedCopyFunc = existsUserDefinedCopyFunc || (isUserDefinedFunc && isCopyFunc);
137 existsUserDefinedDefaultCtor = existsUserDefinedDefaultCtor || (isUserDefinedFunc && isDefaultCtor);
138 return *this;
139 }
140 }; // ValueType
141
142 std::list< IdData > copy;
143 copy.splice( copy.end(), out );
144
145 // organize discovered declarations by type
146 std::unordered_map< std::string, ValueType > funcMap;
147 for ( auto decl : copy ) {
148 if ( FunctionDecl * function = dynamic_cast< FunctionDecl * >( decl.id ) ) {
149 std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters();
150 assert( ! params.empty() );
151 // use base type of pointer, so that qualifiers on the pointer type aren't considered.
152 Type * base = InitTweak::getPointerBase( params.front()->get_type() );
153 assert( base );
154 funcMap[ Mangler::mangle( base ) ] += decl;
155 } else {
156 out.push_back( decl );
157 }
158 }
159
160 // if a type contains user defined ctor/dtor/assign, then special rules trigger, which determine
161 // the set of ctor/dtor/assign that are seen by the requester. In particular, if the user defines
162 // a default ctor, then the generated default ctor should never be seen, likewise for copy ctor
163 // and dtor. If the user defines any ctor/dtor, then no generated field ctors should be seen.
164 // If the user defines any ctor then the generated default ctor should not be seen (intrinsic default
165 // ctor must be overridden exactly).
166 for ( std::pair< const std::string, ValueType > & pair : funcMap ) {
167 ValueType & val = pair.second;
168 for ( ValueType::DeclBall ball : val.decls ) {
169 bool noUserDefinedFunc = ! val.existsUserDefinedFunc;
170 bool isUserDefinedFunc = ball.isUserDefinedFunc;
171 bool isAcceptableDefaultCtor = (! val.existsUserDefinedCtor || (! val.existsUserDefinedDefaultCtor && ball.decl.id->get_linkage() == LinkageSpec::Intrinsic)) && ball.isDefaultCtor; // allow default constructors only when no user-defined constructors exist, except in the case of intrinsics, which require exact overrides
172 bool isAcceptableCopyFunc = ! val.existsUserDefinedCopyFunc && ball.isCopyFunc; // handles copy ctor and assignment operator
173 bool isAcceptableDtor = ! val.existsUserDefinedDtor && ball.isDtor;
174 if ( noUserDefinedFunc || isUserDefinedFunc || isAcceptableDefaultCtor || isAcceptableCopyFunc || isAcceptableDtor ) {
175 // decl conforms to the rules described above, so it should be seen by the requester
176 out.push_back( ball.decl );
177 }
178 }
179 }
180 }
181
182 void Indexer::makeWritable() {
183 if ( ! tables ) {
184 // create indexer if not yet set
185 tables = new Indexer::Impl( scope );
186 } else if ( tables->refCount > 1 || tables->scope != scope ) {
187 // make this indexer the base of a fresh indexer at the current scope
188 tables = new Indexer::Impl( scope, std::move( *this ) );
189 }
190 }
191
192 Indexer::Indexer() : tables( 0 ), scope( 0 ) {}
193
194 Indexer::Indexer( const Indexer &that ) : doDebug( that.doDebug ), tables( newRef( that.tables ) ), scope( that.scope ) {}
195
196 Indexer::Indexer( Indexer &&that ) : doDebug( that.doDebug ), tables( that.tables ), scope( that.scope ) {
197 that.tables = 0;
198 }
199
200 Indexer::~Indexer() {
201 deleteRef( tables );
202 }
203
204 Indexer& Indexer::operator= ( const Indexer &that ) {
205 deleteRef( tables );
206
207 tables = newRef( that.tables );
208 scope = that.scope;
209 doDebug = that.doDebug;
210
211 return *this;
212 }
213
214 Indexer& Indexer::operator= ( Indexer &&that ) {
215 deleteRef( tables );
216
217 tables = that.tables;
218 scope = that.scope;
219 doDebug = that.doDebug;
220
221 that.tables = 0;
222
223 return *this;
224 }
225
226 void Indexer::lookupId( const std::string &id, std::list< IdData > &out ) const {
227 std::unordered_set< std::string > foundMangleNames;
228
229 Indexer::Impl *searchTables = tables;
230 while ( searchTables ) {
231
232 IdTable::const_iterator decls = searchTables->idTable.find( id );
233 if ( decls != searchTables->idTable.end() ) {
234 const MangleTable &mangleTable = decls->second;
235 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
236 // mark the mangled name as found, skipping this insertion if a declaration for that name has already been found
237 if ( foundMangleNames.insert( decl->first ).second == false ) continue;
238
239 out.push_back( decl->second );
240 }
241 }
242
243 // get declarations from base indexers
244 searchTables = searchTables->base.tables;
245 }
246
247 // some special functions, e.g. constructors and destructors
248 // remove autogenerated functions when they are defined so that
249 // they can never be matched
250 removeSpecialOverrides( id, out );
251 }
252
253 NamedTypeDecl *Indexer::lookupType( const std::string &id ) const {
254 if ( ! tables ) return 0;
255
256 TypeTable::const_iterator ret = tables->typeTable.find( id );
257 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupType( id );
258 }
259
260 StructDecl *Indexer::lookupStruct( const std::string &id ) const {
261 if ( ! tables ) return 0;
262
263 StructTable::const_iterator ret = tables->structTable.find( id );
264 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStruct( id );
265 }
266
267 EnumDecl *Indexer::lookupEnum( const std::string &id ) const {
268 if ( ! tables ) return 0;
269
270 EnumTable::const_iterator ret = tables->enumTable.find( id );
271 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnum( id );
272 }
273
274 UnionDecl *Indexer::lookupUnion( const std::string &id ) const {
275 if ( ! tables ) return 0;
276
277 UnionTable::const_iterator ret = tables->unionTable.find( id );
278 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnion( id );
279 }
280
281 TraitDecl *Indexer::lookupTrait( const std::string &id ) const {
282 if ( ! tables ) return 0;
283
284 TraitTable::const_iterator ret = tables->traitTable.find( id );
285 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTrait( id );
286 }
287
288 DeclarationWithType *Indexer::lookupIdAtScope( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
289 if ( ! tables ) return 0;
290 if ( tables->scope < scope ) return 0;
291
292 IdTable::const_iterator decls = tables->idTable.find( id );
293 if ( decls != tables->idTable.end() ) {
294 const MangleTable &mangleTable = decls->second;
295 MangleTable::const_iterator decl = mangleTable.find( mangleName );
296 if ( decl != mangleTable.end() ) return decl->second.id;
297 }
298
299 return tables->base.lookupIdAtScope( id, mangleName, scope );
300 }
301
302 bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
303 if ( ! tables ) return false;
304 if ( tables->scope < scope ) return false;
305
306 IdTable::const_iterator decls = tables->idTable.find( id );
307 if ( decls != tables->idTable.end() ) {
308 const MangleTable &mangleTable = decls->second;
309 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
310 // check for C decls with the same name, skipping those with a compatible type (by mangleName)
311 if ( ! LinkageSpec::isMangled( decl->second.id->get_linkage() ) && decl->first != mangleName ) return true;
312 }
313 }
314
315 return tables->base.hasIncompatibleCDecl( id, mangleName, scope );
316 }
317
318 bool Indexer::hasCompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
319 if ( ! tables ) return false;
320 if ( tables->scope < scope ) return false;
321
322 IdTable::const_iterator decls = tables->idTable.find( id );
323 if ( decls != tables->idTable.end() ) {
324 const MangleTable &mangleTable = decls->second;
325 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
326 // check for C decls with the same name, skipping
327 // those with an incompatible type (by mangleName)
328 if ( ! LinkageSpec::isMangled( decl->second.id->get_linkage() ) && decl->first == mangleName ) return true;
329 }
330 }
331
332 return tables->base.hasCompatibleCDecl( id, mangleName, scope );
333 }
334
335 NamedTypeDecl *Indexer::lookupTypeAtScope( const std::string &id, unsigned long scope ) const {
336 if ( ! tables ) return 0;
337 if ( tables->scope < scope ) return 0;
338
339 TypeTable::const_iterator ret = tables->typeTable.find( id );
340 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupTypeAtScope( id, scope );
341 }
342
343 StructDecl *Indexer::lookupStructAtScope( const std::string &id, unsigned long scope ) const {
344 if ( ! tables ) return 0;
345 if ( tables->scope < scope ) return 0;
346
347 StructTable::const_iterator ret = tables->structTable.find( id );
348 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStructAtScope( id, scope );
349 }
350
351 EnumDecl *Indexer::lookupEnumAtScope( const std::string &id, unsigned long scope ) const {
352 if ( ! tables ) return 0;
353 if ( tables->scope < scope ) return 0;
354
355 EnumTable::const_iterator ret = tables->enumTable.find( id );
356 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnumAtScope( id, scope );
357 }
358
359 UnionDecl *Indexer::lookupUnionAtScope( const std::string &id, unsigned long scope ) const {
360 if ( ! tables ) return 0;
361 if ( tables->scope < scope ) return 0;
362
363 UnionTable::const_iterator ret = tables->unionTable.find( id );
364 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnionAtScope( id, scope );
365 }
366
367 TraitDecl *Indexer::lookupTraitAtScope( const std::string &id, unsigned long scope ) const {
368 if ( ! tables ) return 0;
369 if ( tables->scope < scope ) return 0;
370
371 TraitTable::const_iterator ret = tables->traitTable.find( id );
372 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTraitAtScope( id, scope );
373 }
374
375 bool addedIdConflicts( DeclarationWithType *existing, DeclarationWithType *added ) {
376 // if we're giving the same name mangling to things of different types then there is something wrong
377 assert( (dynamic_cast<ObjectDecl*>( added ) && dynamic_cast<ObjectDecl*>( existing ) )
378 || (dynamic_cast<FunctionDecl*>( added ) && dynamic_cast<FunctionDecl*>( existing ) ) );
379
380 if ( LinkageSpec::isOverridable( existing->get_linkage() ) ) {
381 // new definition shadows the autogenerated one, even at the same scope
382 return false;
383 } else if ( LinkageSpec::isMangled( added->get_linkage() ) || ResolvExpr::typesCompatible( added->get_type(), existing->get_type(), Indexer() ) ) {
384 // typesCompatible doesn't really do the right thing here. When checking compatibility of function types,
385 // we should ignore outermost pointer qualifiers, except _Atomic?
386 FunctionDecl *newentry = dynamic_cast< FunctionDecl* >( added );
387 FunctionDecl *oldentry = dynamic_cast< FunctionDecl* >( existing );
388 if ( newentry && oldentry ) {
389 if ( newentry->get_statements() && oldentry->get_statements() ) {
390 throw SemanticError( "duplicate function definition for ", added );
391 } // if
392 } else {
393 // two objects with the same mangled name defined in the same scope.
394 // both objects must be marked extern or both must be intrinsic for this to be okay
395 // xxx - perhaps it's actually if either is intrinsic then this is okay?
396 // might also need to be same storage class?
397 ObjectDecl *newobj = dynamic_cast< ObjectDecl* >( added );
398 ObjectDecl *oldobj = dynamic_cast< ObjectDecl* >( existing );
399 if ( ! newobj->get_storageClasses().is_extern && ! oldobj->get_storageClasses().is_extern ) {
400 throw SemanticError( "duplicate object definition for ", added );
401 } // if
402 } // if
403 } else {
404 throw SemanticError( "duplicate definition for ", added );
405 } // if
406
407 return true;
408 }
409
410 void Indexer::addId( DeclarationWithType *decl, Expression * baseExpr ) {
411 if ( decl->name == "" ) return;
412 debugPrint( "Adding Id " << decl->name << std::endl );
413 makeWritable();
414
415 const std::string &name = decl->name;
416 std::string mangleName;
417 if ( LinkageSpec::isOverridable( decl->linkage ) ) {
418 // mangle the name without including the appropriate suffix, so overridable routines are placed into the
419 // same "bucket" as their user defined versions.
420 mangleName = Mangler::mangle( decl, false );
421 } else {
422 mangleName = Mangler::mangle( decl );
423 } // if
424
425 // this ensures that no two declarations with the same unmangled name at the same scope both have C linkage
426 if ( ! LinkageSpec::isMangled( decl->linkage ) ) {
427 // NOTE this is broken in Richard's original code in such a way that it never triggers (it
428 // doesn't check decls that have the same manglename, and all C-linkage decls are defined to
429 // have their name as their manglename, hence the error can never trigger).
430 // The code here is closer to correct, but name mangling would have to be completely
431 // isomorphic to C type-compatibility, which it may not be.
432 if ( hasIncompatibleCDecl( name, mangleName, scope ) ) {
433 throw SemanticError( "conflicting overload of C function ", decl );
434 }
435 } else {
436 // Check that a Cforall declaration doesn't overload any C declaration
437 if ( hasCompatibleCDecl( name, mangleName, scope ) ) {
438 throw SemanticError( "Cforall declaration hides C function ", decl );
439 }
440 }
441
442 // Skip repeat declarations of the same identifier
443 DeclarationWithType *existing = lookupIdAtScope( name, mangleName, scope );
444 if ( existing && addedIdConflicts( existing, decl ) ) return;
445
446 // add to indexer
447 tables->idTable[ name ][ mangleName ] = { decl, baseExpr };
448 ++tables->size;
449 }
450
451 bool addedTypeConflicts( NamedTypeDecl *existing, NamedTypeDecl *added ) {
452 if ( existing->get_base() == 0 ) {
453 return false;
454 } else if ( added->get_base() == 0 ) {
455 return true;
456 } else {
457 throw SemanticError( "redeclaration of ", added );
458 }
459 }
460
461 void Indexer::addType( NamedTypeDecl *decl ) {
462 debugPrint( "Adding type " << decl->name << std::endl );
463 makeWritable();
464
465 const std::string &id = decl->get_name();
466 TypeTable::iterator existing = tables->typeTable.find( id );
467 if ( existing == tables->typeTable.end() ) {
468 NamedTypeDecl *parent = tables->base.lookupTypeAtScope( id, scope );
469 if ( ! parent || ! addedTypeConflicts( parent, decl ) ) {
470 tables->typeTable.insert( existing, std::make_pair( id, decl ) );
471 ++tables->size;
472 }
473 } else {
474 if ( ! addedTypeConflicts( existing->second, decl ) ) {
475 existing->second = decl;
476 }
477 }
478 }
479
480 bool addedDeclConflicts( AggregateDecl *existing, AggregateDecl *added ) {
481 if ( existing->get_members().empty() ) {
482 return false;
483 } else if ( ! added->get_members().empty() ) {
484 throw SemanticError( "redeclaration of ", added );
485 } // if
486 return true;
487 }
488
489 void Indexer::addStruct( const std::string &id ) {
490 debugPrint( "Adding fwd decl for struct " << id << std::endl );
491 addStruct( new StructDecl( id ) );
492 }
493
494 void Indexer::addStruct( StructDecl *decl ) {
495 debugPrint( "Adding struct " << decl->name << std::endl );
496 makeWritable();
497
498 const std::string &id = decl->get_name();
499 StructTable::iterator existing = tables->structTable.find( id );
500 if ( existing == tables->structTable.end() ) {
501 StructDecl *parent = tables->base.lookupStructAtScope( id, scope );
502 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
503 tables->structTable.insert( existing, std::make_pair( id, decl ) );
504 ++tables->size;
505 }
506 } else {
507 if ( ! addedDeclConflicts( existing->second, decl ) ) {
508 existing->second = decl;
509 }
510 }
511 }
512
513 void Indexer::addEnum( EnumDecl *decl ) {
514 debugPrint( "Adding enum " << decl->name << std::endl );
515 makeWritable();
516
517 const std::string &id = decl->get_name();
518 EnumTable::iterator existing = tables->enumTable.find( id );
519 if ( existing == tables->enumTable.end() ) {
520 EnumDecl *parent = tables->base.lookupEnumAtScope( id, scope );
521 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
522 tables->enumTable.insert( existing, std::make_pair( id, decl ) );
523 ++tables->size;
524 }
525 } else {
526 if ( ! addedDeclConflicts( existing->second, decl ) ) {
527 existing->second = decl;
528 }
529 }
530 }
531
532 void Indexer::addUnion( const std::string &id ) {
533 debugPrint( "Adding fwd decl for union " << id << std::endl );
534 addUnion( new UnionDecl( id ) );
535 }
536
537 void Indexer::addUnion( UnionDecl *decl ) {
538 debugPrint( "Adding union " << decl->name << std::endl );
539 makeWritable();
540
541 const std::string &id = decl->get_name();
542 UnionTable::iterator existing = tables->unionTable.find( id );
543 if ( existing == tables->unionTable.end() ) {
544 UnionDecl *parent = tables->base.lookupUnionAtScope( id, scope );
545 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
546 tables->unionTable.insert( existing, std::make_pair( id, decl ) );
547 ++tables->size;
548 }
549 } else {
550 if ( ! addedDeclConflicts( existing->second, decl ) ) {
551 existing->second = decl;
552 }
553 }
554 }
555
556 void Indexer::addTrait( TraitDecl *decl ) {
557 debugPrint( "Adding trait " << decl->name << std::endl );
558 makeWritable();
559
560 const std::string &id = decl->get_name();
561 TraitTable::iterator existing = tables->traitTable.find( id );
562 if ( existing == tables->traitTable.end() ) {
563 TraitDecl *parent = tables->base.lookupTraitAtScope( id, scope );
564 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
565 tables->traitTable.insert( existing, std::make_pair( id, decl ) );
566 ++tables->size;
567 }
568 } else {
569 if ( ! addedDeclConflicts( existing->second, decl ) ) {
570 existing->second = decl;
571 }
572 }
573 }
574
575 void Indexer::addMembers( AggregateDecl * aggr, Expression * expr ) {
576 for ( Declaration * decl : aggr->members ) {
577 if ( DeclarationWithType * dwt = dynamic_cast< DeclarationWithType * >( decl ) ) {
578 addId( dwt, expr );
579 if ( dwt->name == "" ) {
580 Type * t = dwt->get_type()->stripReferences();
581 if ( dynamic_cast< StructInstType * >( t ) || dynamic_cast< UnionInstType * >( t ) ) {
582 Expression * base = expr->clone();
583 ResolvExpr::referenceToRvalueConversion( base );
584 addMembers( t->getAggr(), new MemberExpr( dwt, base ) );
585 }
586 }
587 }
588 }
589 }
590
591 void Indexer::addWith( std::list< Expression * > & withExprs ) {
592 for ( Expression * expr : withExprs ) {
593 if ( expr->result ) {
594 AggregateDecl * aggr = expr->result->stripReferences()->getAggr();
595 assertf( aggr, "WithStmt expr has non-aggregate type: %s", toString( expr->result ).c_str() );
596
597 addMembers( aggr, expr );
598 }
599 }
600 }
601
602 void Indexer::addIds( const std::list< DeclarationWithType * > & decls ) {
603 for ( auto d : decls ) {
604 addId( d );
605 }
606 }
607
608 void Indexer::addTypes( const std::list< TypeDecl * > & tds ) {
609 for ( auto td : tds ) {
610 addType( td );
611 addIds( td->assertions );
612 }
613 }
614
615 void Indexer::addFunctionType( FunctionType * ftype ) {
616 addTypes( ftype->forall );
617 addIds( ftype->returnVals );
618 addIds( ftype->parameters );
619 }
620
621 void Indexer::enterScope() {
622 ++scope;
623
624 if ( doDebug ) {
625 std::cerr << "--- Entering scope " << scope << std::endl;
626 }
627 }
628
629 void Indexer::leaveScope() {
630 using std::cerr;
631
632 assert( scope > 0 && "cannot leave initial scope" );
633 if ( doDebug ) {
634 cerr << "--- Leaving scope " << scope << " containing" << std::endl;
635 }
636 --scope;
637
638 while ( tables && tables->scope > scope ) {
639 if ( doDebug ) {
640 dump( tables->idTable, cerr );
641 dump( tables->typeTable, cerr );
642 dump( tables->structTable, cerr );
643 dump( tables->enumTable, cerr );
644 dump( tables->unionTable, cerr );
645 dump( tables->traitTable, cerr );
646 }
647
648 // swap tables for base table until we find one at an appropriate scope
649 Indexer::Impl *base = newRef( tables->base.tables );
650 deleteRef( tables );
651 tables = base;
652 }
653 }
654
655 void Indexer::print( std::ostream &os, int indent ) const {
656 using std::cerr;
657
658 if ( tables ) {
659 os << "--- scope " << tables->scope << " ---" << std::endl;
660
661 os << "===idTable===" << std::endl;
662 dump( tables->idTable, os );
663 os << "===typeTable===" << std::endl;
664 dump( tables->typeTable, os );
665 os << "===structTable===" << std::endl;
666 dump( tables->structTable, os );
667 os << "===enumTable===" << std::endl;
668 dump( tables->enumTable, os );
669 os << "===unionTable===" << std::endl;
670 dump( tables->unionTable, os );
671 os << "===contextTable===" << std::endl;
672 dump( tables->traitTable, os );
673
674 tables->base.print( os, indent );
675 } else {
676 os << "--- end ---" << std::endl;
677 }
678
679 }
680
681 Expression * Indexer::IdData::combine() const {
682 if ( baseExpr ) {
683 Expression * base = baseExpr->clone();
684 ResolvExpr::referenceToRvalueConversion( base );
685 Expression * ret = new MemberExpr( id, base );
686 // xxx - this introduces hidden environments, for now remove them.
687 // std::swap( base->env, ret->env );
688 delete base->env;
689 base->env = nullptr;
690 return ret;
691 } else {
692 return new VariableExpr( id );
693 }
694 }
695} // namespace SymTab
696
697// Local Variables: //
698// tab-width: 4 //
699// mode: c++ //
700// compile-command: "make install" //
701// End: //
Note: See TracBrowser for help on using the repository browser.