source: src/SymTab/Indexer.cc@ 43426d4

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 43426d4 was fbcde64, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago

remove duplication in compound literal, support aggregate-type compound literals
  • Property mode set to 100644
File size: 34.0 KB
RevLine 
[0dd3a2f]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//
[743fbda]7// Indexer.cc --
[0dd3a2f]8//
9// Author : Richard C. Bilson
10// Created On : Sun May 17 21:37:33 2015
[4e06c1e]11// Last Modified By : Peter A. Buhr
[fbcde64]12// Last Modified On : Thu Mar 30 16:38:47 2017
13// Update Count : 19
[0dd3a2f]14//
15
[e8032b0]16#include "Indexer.h"
17
[52c2a72]18#include <string>
19#include <typeinfo>
20#include <unordered_map>
[5447e09]21#include <unordered_set>
[52c2a72]22#include <utility>
[1ba88a0]23#include <algorithm>
[52c2a72]24
[bed4c63e]25#include "Mangler.h"
26
27#include "Common/utility.h"
28
29#include "ResolvExpr/typeops.h"
[e8032b0]30
[51b73452]31#include "SynTree/Declaration.h"
32#include "SynTree/Type.h"
33#include "SynTree/Expression.h"
34#include "SynTree/Initializer.h"
35#include "SynTree/Statement.h"
[e8032b0]36
[1ba88a0]37#include "InitTweak/InitTweak.h"
38
[17cd4eb]39#define debugPrint(x) if ( doDebug ) { std::cout << x; }
[51b73452]40
41namespace SymTab {
[d5556a3]42 struct NewScope {
43 NewScope( SymTab::Indexer & indexer ) : indexer( indexer ) { indexer.enterScope(); }
44 ~NewScope() { indexer.leaveScope(); }
45 SymTab::Indexer & indexer;
46 };
47
[906e24d]48 template< typename TreeType, typename VisitorType >
49 inline void acceptNewScope( TreeType *tree, VisitorType &visitor ) {
[ae4c85a]50 visitor.enterScope();
[906e24d]51 maybeAccept( tree, visitor );
[ae4c85a]52 visitor.leaveScope();
53 }
54
[bed4c63e]55 typedef std::unordered_map< std::string, DeclarationWithType* > MangleTable;
56 typedef std::unordered_map< std::string, MangleTable > IdTable;
[52c2a72]57 typedef std::unordered_map< std::string, NamedTypeDecl* > TypeTable;
58 typedef std::unordered_map< std::string, StructDecl* > StructTable;
59 typedef std::unordered_map< std::string, EnumDecl* > EnumTable;
60 typedef std::unordered_map< std::string, UnionDecl* > UnionTable;
61 typedef std::unordered_map< std::string, TraitDecl* > TraitTable;
62
[bed4c63e]63 void dump( const IdTable &table, std::ostream &os ) {
64 for ( IdTable::const_iterator id = table.begin(); id != table.end(); ++id ) {
65 for ( MangleTable::const_iterator mangle = id->second.begin(); mangle != id->second.end(); ++mangle ) {
66 os << mangle->second << std::endl;
67 }
68 }
69 }
[743fbda]70
[52c2a72]71 template< typename Decl >
72 void dump( const std::unordered_map< std::string, Decl* > &table, std::ostream &os ) {
73 for ( typename std::unordered_map< std::string, Decl* >::const_iterator it = table.begin(); it != table.end(); ++it ) {
74 os << it->second << std::endl;
75 } // for
76 }
[743fbda]77
[e8032b0]78 struct Indexer::Impl {
[52c2a72]79 Impl( unsigned long _scope ) : refCount(1), scope( _scope ), size( 0 ), base(),
[e8032b0]80 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
[52c2a72]81 Impl( unsigned long _scope, Indexer &&_base ) : refCount(1), scope( _scope ), size( 0 ), base( _base ),
[e8032b0]82 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
83 unsigned long refCount; ///< Number of references to these tables
[52c2a72]84 unsigned long scope; ///< Scope these tables are associated with
[e8032b0]85 unsigned long size; ///< Number of elements stored in this table
86 const Indexer base; ///< Base indexer this extends
[743fbda]87
[e8032b0]88 IdTable idTable; ///< Identifier namespace
89 TypeTable typeTable; ///< Type namespace
90 StructTable structTable; ///< Struct namespace
91 EnumTable enumTable; ///< Enum namespace
92 UnionTable unionTable; ///< Union namespace
93 TraitTable traitTable; ///< Trait namespace
94 };
95
96 Indexer::Impl *Indexer::newRef( Indexer::Impl *toClone ) {
97 if ( ! toClone ) return 0;
98
99 // shorten the search chain by skipping empty links
100 Indexer::Impl *ret = toClone->size == 0 ? toClone->base.tables : toClone;
101 if ( ret ) { ++ret->refCount; }
102
103 return ret;
104 }
105
106 void Indexer::deleteRef( Indexer::Impl *toFree ) {
107 if ( ! toFree ) return;
108
109 if ( --toFree->refCount == 0 ) delete toFree;
110 }
111
[1ba88a0]112 void Indexer::removeSpecialOverrides( const std::string &id, std::list< DeclarationWithType * > & out ) const {
[ee1635c8]113 // only need to perform this step for constructors, destructors, and assignment functions
114 if ( ! InitTweak::isCtorDtorAssign( id ) ) return;
[1ba88a0]115
116 // helpful data structure
117 struct ValueType {
118 struct DeclBall {
119 FunctionDecl * decl;
120 bool isUserDefinedFunc; // properties for this particular decl
[235114f]121 bool isDefaultCtor;
122 bool isDtor;
[1ba88a0]123 bool isCopyFunc;
124 };
125 // properties for this type
[235114f]126 bool userDefinedFunc = false; // any user-defined function found
127 bool userDefinedCtor = false; // any user-defined constructor found
128 bool userDefinedDtor = false; // any user-defined destructor found
129 bool userDefinedCopyFunc = false; // user-defined copy ctor found
[1ba88a0]130 std::list< DeclBall > decls;
131
132 // another FunctionDecl for the current type was found - determine
133 // if it has special properties and update data structure accordingly
134 ValueType & operator+=( FunctionDecl * function ) {
135 bool isUserDefinedFunc = ! LinkageSpec::isOverridable( function->get_linkage() );
[235114f]136 bool isDefaultCtor = InitTweak::isDefaultConstructor( function );
137 bool isDtor = InitTweak::isDestructor( function );
[ee1635c8]138 bool isCopyFunc = InitTweak::isCopyFunction( function, function->get_name() );
[235114f]139 decls.push_back( DeclBall{ function, isUserDefinedFunc, isDefaultCtor, isDtor, isCopyFunc } );
[1ba88a0]140 userDefinedFunc = userDefinedFunc || isUserDefinedFunc;
[235114f]141 userDefinedCtor = userDefinedCtor || (isUserDefinedFunc && InitTweak::isConstructor( function->get_name() ) );
142 userDefinedDtor = userDefinedDtor || (isUserDefinedFunc && isDtor);
[1ba88a0]143 userDefinedCopyFunc = userDefinedCopyFunc || (isUserDefinedFunc && isCopyFunc);
144 return *this;
145 }
146 }; // ValueType
147
148 std::list< DeclarationWithType * > copy;
149 copy.splice( copy.end(), out );
150
151 // organize discovered declarations by type
152 std::unordered_map< std::string, ValueType > funcMap;
153 for ( DeclarationWithType * decl : copy ) {
154 if ( FunctionDecl * function = dynamic_cast< FunctionDecl * >( decl ) ) {
[8c49c0e]155 std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters();
[1ba88a0]156 assert( ! params.empty() );
[24670d2]157 // use base type of pointer, so that qualifiers on the pointer type aren't considered.
158 Type * base = safe_dynamic_cast< PointerType * >( params.front()->get_type() )->get_base();
159 funcMap[ Mangler::mangle( base ) ] += function;
[1ba88a0]160 } else {
161 out.push_back( decl );
162 }
163 }
164
165 // if a type contains user defined ctor/dtors, then special rules trigger, which determine
166 // the set of ctor/dtors that are seen by the requester. In particular, if the user defines
167 // a default ctor, then the generated default ctor should never be seen, likewise for copy ctor
168 // and dtor. If the user defines any ctor/dtor, then no generated field ctors should be seen.
[235114f]169 // If the user defines any ctor then the generated default ctor should not be seen.
[1ba88a0]170 for ( std::pair< const std::string, ValueType > & pair : funcMap ) {
171 ValueType & val = pair.second;
172 for ( ValueType::DeclBall ball : val.decls ) {
[235114f]173 if ( ! val.userDefinedFunc || ball.isUserDefinedFunc || (! val.userDefinedCtor && ball.isDefaultCtor) || (! val.userDefinedCopyFunc && ball.isCopyFunc) || (! val.userDefinedDtor && ball.isDtor) ) {
[1ba88a0]174 // decl conforms to the rules described above, so it should be seen by the requester
175 out.push_back( ball.decl );
176 }
177 }
178 }
179 }
180
[e8032b0]181 void Indexer::makeWritable() {
182 if ( ! tables ) {
[52c2a72]183 // create indexer if not yet set
184 tables = new Indexer::Impl( scope );
185 } else if ( tables->refCount > 1 || tables->scope != scope ) {
186 // make this indexer the base of a fresh indexer at the current scope
187 tables = new Indexer::Impl( scope, std::move( *this ) );
[e8032b0]188 }
189 }
190
[52c2a72]191 Indexer::Indexer( bool _doDebug ) : tables( 0 ), scope( 0 ), doDebug( _doDebug ) {}
[e8032b0]192
[52c2a72]193 Indexer::Indexer( const Indexer &that ) : tables( newRef( that.tables ) ), scope( that.scope ), doDebug( that.doDebug ) {}
[e8032b0]194
[52c2a72]195 Indexer::Indexer( Indexer &&that ) : tables( that.tables ), scope( that.scope ), doDebug( that.doDebug ) {
[e8032b0]196 that.tables = 0;
197 }
198
199 Indexer::~Indexer() {
200 deleteRef( tables );
201 }
202
203 Indexer& Indexer::operator= ( const Indexer &that ) {
204 deleteRef( tables );
205
206 tables = newRef( that.tables );
[52c2a72]207 scope = that.scope;
[e8032b0]208 doDebug = that.doDebug;
209
210 return *this;
211 }
212
213 Indexer& Indexer::operator= ( Indexer &&that ) {
214 deleteRef( tables );
215
216 tables = that.tables;
[52c2a72]217 scope = that.scope;
[e8032b0]218 doDebug = that.doDebug;
[17cd4eb]219
[e8032b0]220 that.tables = 0;
221
222 return *this;
223 }
[17cd4eb]224
[a08ba92]225 void Indexer::visit( ObjectDecl *objectDecl ) {
[ae4c85a]226 enterScope();
[0dd3a2f]227 maybeAccept( objectDecl->get_type(), *this );
[ae4c85a]228 leaveScope();
[0dd3a2f]229 maybeAccept( objectDecl->get_init(), *this );
230 maybeAccept( objectDecl->get_bitfieldWidth(), *this );
231 if ( objectDecl->get_name() != "" ) {
232 debugPrint( "Adding object " << objectDecl->get_name() << std::endl );
[e8032b0]233 addId( objectDecl );
[0dd3a2f]234 } // if
[a08ba92]235 }
[17cd4eb]236
[a08ba92]237 void Indexer::visit( FunctionDecl *functionDecl ) {
[0dd3a2f]238 if ( functionDecl->get_name() == "" ) return;
239 debugPrint( "Adding function " << functionDecl->get_name() << std::endl );
[e8032b0]240 addId( functionDecl );
[0dd3a2f]241 enterScope();
242 maybeAccept( functionDecl->get_functionType(), *this );
243 maybeAccept( functionDecl->get_statements(), *this );
244 leaveScope();
[a08ba92]245 }
[51b73452]246
[44b5ca0]247
248// A NOTE ON THE ORDER OF TRAVERSAL
249//
250// Types and typedefs have their base types visited before they are added to the type table. This is ok, since there is
251// no such thing as a recursive type or typedef.
252//
253// typedef struct { T *x; } T; // never allowed
254//
255// for structs/unions, it is possible to have recursion, so the decl should be added as if it's incomplete to begin, the
256// members are traversed, and then the complete type should be added (assuming the type is completed by this particular
257// declaration).
258//
259// struct T { struct T *x; }; // allowed
260//
261// It is important to add the complete type to the symbol table *after* the members/base has been traversed, since that
262// traversal may modify the definition of the type and these modifications should be visible when the symbol table is
263// queried later in this pass.
264//
265// TODO: figure out whether recursive contexts are sensible/possible/reasonable.
266
[51b73452]267
[a08ba92]268 void Indexer::visit( TypeDecl *typeDecl ) {
[0dd3a2f]269 // see A NOTE ON THE ORDER OF TRAVERSAL, above
[44b5ca0]270 // note that assertions come after the type is added to the symtab, since they are not part of the type proper
271 // and may depend on the type itself
[0dd3a2f]272 enterScope();
273 acceptAll( typeDecl->get_parameters(), *this );
274 maybeAccept( typeDecl->get_base(), *this );
275 leaveScope();
276 debugPrint( "Adding type " << typeDecl->get_name() << std::endl );
[e8032b0]277 addType( typeDecl );
[0dd3a2f]278 acceptAll( typeDecl->get_assertions(), *this );
[a08ba92]279 }
[17cd4eb]280
[a08ba92]281 void Indexer::visit( TypedefDecl *typeDecl ) {
[0dd3a2f]282 enterScope();
283 acceptAll( typeDecl->get_parameters(), *this );
284 maybeAccept( typeDecl->get_base(), *this );
285 leaveScope();
286 debugPrint( "Adding typedef " << typeDecl->get_name() << std::endl );
[e8032b0]287 addType( typeDecl );
[a08ba92]288 }
[17cd4eb]289
[a08ba92]290 void Indexer::visit( StructDecl *aggregateDecl ) {
[0dd3a2f]291 // make up a forward declaration and add it before processing the members
[743fbda]292 // needs to be on the heap because addStruct saves the pointer
293 StructDecl &fwdDecl = *new StructDecl( aggregateDecl->get_name() );
[0dd3a2f]294 cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() );
295 debugPrint( "Adding fwd decl for struct " << fwdDecl.get_name() << std::endl );
[e8032b0]296 addStruct( &fwdDecl );
[743fbda]297
[0dd3a2f]298 enterScope();
299 acceptAll( aggregateDecl->get_parameters(), *this );
300 acceptAll( aggregateDecl->get_members(), *this );
301 leaveScope();
[743fbda]302
[0dd3a2f]303 debugPrint( "Adding struct " << aggregateDecl->get_name() << std::endl );
304 // this addition replaces the forward declaration
[e8032b0]305 addStruct( aggregateDecl );
[a08ba92]306 }
[17cd4eb]307
[a08ba92]308 void Indexer::visit( UnionDecl *aggregateDecl ) {
[0dd3a2f]309 // make up a forward declaration and add it before processing the members
310 UnionDecl fwdDecl( aggregateDecl->get_name() );
311 cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() );
312 debugPrint( "Adding fwd decl for union " << fwdDecl.get_name() << std::endl );
[e8032b0]313 addUnion( &fwdDecl );
[743fbda]314
[0dd3a2f]315 enterScope();
316 acceptAll( aggregateDecl->get_parameters(), *this );
317 acceptAll( aggregateDecl->get_members(), *this );
318 leaveScope();
[743fbda]319
[0dd3a2f]320 debugPrint( "Adding union " << aggregateDecl->get_name() << std::endl );
[e8032b0]321 addUnion( aggregateDecl );
[a08ba92]322 }
[17cd4eb]323
[a08ba92]324 void Indexer::visit( EnumDecl *aggregateDecl ) {
[0dd3a2f]325 debugPrint( "Adding enum " << aggregateDecl->get_name() << std::endl );
[e8032b0]326 addEnum( aggregateDecl );
[0dd3a2f]327 // unlike structs, contexts, and unions, enums inject their members into the global scope
328 acceptAll( aggregateDecl->get_members(), *this );
[a08ba92]329 }
[17cd4eb]330
[4040425]331 void Indexer::visit( TraitDecl *aggregateDecl ) {
[0dd3a2f]332 enterScope();
333 acceptAll( aggregateDecl->get_parameters(), *this );
334 acceptAll( aggregateDecl->get_members(), *this );
335 leaveScope();
[743fbda]336
[0dd3a2f]337 debugPrint( "Adding context " << aggregateDecl->get_name() << std::endl );
[e8032b0]338 addTrait( aggregateDecl );
[a08ba92]339 }
[17cd4eb]340
[a08ba92]341 void Indexer::visit( CompoundStmt *compoundStmt ) {
[0dd3a2f]342 enterScope();
343 acceptAll( compoundStmt->get_kids(), *this );
344 leaveScope();
[a08ba92]345 }
[17cd4eb]346
[ae4c85a]347
348 void Indexer::visit( ApplicationExpr *applicationExpr ) {
[906e24d]349 acceptNewScope( applicationExpr->get_result(), *this );
[ae4c85a]350 maybeAccept( applicationExpr->get_function(), *this );
351 acceptAll( applicationExpr->get_args(), *this );
352 }
353
354 void Indexer::visit( UntypedExpr *untypedExpr ) {
[906e24d]355 acceptNewScope( untypedExpr->get_result(), *this );
[ae4c85a]356 acceptAll( untypedExpr->get_args(), *this );
357 }
358
359 void Indexer::visit( NameExpr *nameExpr ) {
[906e24d]360 acceptNewScope( nameExpr->get_result(), *this );
[ae4c85a]361 }
362
363 void Indexer::visit( AddressExpr *addressExpr ) {
[906e24d]364 acceptNewScope( addressExpr->get_result(), *this );
[ae4c85a]365 maybeAccept( addressExpr->get_arg(), *this );
366 }
367
368 void Indexer::visit( LabelAddressExpr *labAddressExpr ) {
[906e24d]369 acceptNewScope( labAddressExpr->get_result(), *this );
[ae4c85a]370 maybeAccept( labAddressExpr->get_arg(), *this );
371 }
372
373 void Indexer::visit( CastExpr *castExpr ) {
[906e24d]374 acceptNewScope( castExpr->get_result(), *this );
[ae4c85a]375 maybeAccept( castExpr->get_arg(), *this );
376 }
377
378 void Indexer::visit( UntypedMemberExpr *memberExpr ) {
[906e24d]379 acceptNewScope( memberExpr->get_result(), *this );
[ae4c85a]380 maybeAccept( memberExpr->get_aggregate(), *this );
381 }
382
383 void Indexer::visit( MemberExpr *memberExpr ) {
[906e24d]384 acceptNewScope( memberExpr->get_result(), *this );
[ae4c85a]385 maybeAccept( memberExpr->get_aggregate(), *this );
386 }
387
388 void Indexer::visit( VariableExpr *variableExpr ) {
[906e24d]389 acceptNewScope( variableExpr->get_result(), *this );
[ae4c85a]390 }
391
392 void Indexer::visit( ConstantExpr *constantExpr ) {
[906e24d]393 acceptNewScope( constantExpr->get_result(), *this );
[ae4c85a]394 maybeAccept( constantExpr->get_constant(), *this );
395 }
396
397 void Indexer::visit( SizeofExpr *sizeofExpr ) {
[906e24d]398 acceptNewScope( sizeofExpr->get_result(), *this );
[ae4c85a]399 if ( sizeofExpr->get_isType() ) {
400 maybeAccept( sizeofExpr->get_type(), *this );
401 } else {
402 maybeAccept( sizeofExpr->get_expr(), *this );
403 }
404 }
405
[47534159]406 void Indexer::visit( AlignofExpr *alignofExpr ) {
[906e24d]407 acceptNewScope( alignofExpr->get_result(), *this );
[47534159]408 if ( alignofExpr->get_isType() ) {
409 maybeAccept( alignofExpr->get_type(), *this );
410 } else {
411 maybeAccept( alignofExpr->get_expr(), *this );
412 }
413 }
414
[2a4b088]415 void Indexer::visit( UntypedOffsetofExpr *offsetofExpr ) {
[906e24d]416 acceptNewScope( offsetofExpr->get_result(), *this );
[2a4b088]417 maybeAccept( offsetofExpr->get_type(), *this );
418 }
419
[25a054f]420 void Indexer::visit( OffsetofExpr *offsetofExpr ) {
[906e24d]421 acceptNewScope( offsetofExpr->get_result(), *this );
[25a054f]422 maybeAccept( offsetofExpr->get_type(), *this );
423 maybeAccept( offsetofExpr->get_member(), *this );
424 }
425
[afc1045]426 void Indexer::visit( OffsetPackExpr *offsetPackExpr ) {
[906e24d]427 acceptNewScope( offsetPackExpr->get_result(), *this );
[afc1045]428 maybeAccept( offsetPackExpr->get_type(), *this );
429 }
430
[ae4c85a]431 void Indexer::visit( AttrExpr *attrExpr ) {
[906e24d]432 acceptNewScope( attrExpr->get_result(), *this );
[ae4c85a]433 if ( attrExpr->get_isType() ) {
434 maybeAccept( attrExpr->get_type(), *this );
435 } else {
436 maybeAccept( attrExpr->get_expr(), *this );
437 }
438 }
439
440 void Indexer::visit( LogicalExpr *logicalExpr ) {
[906e24d]441 acceptNewScope( logicalExpr->get_result(), *this );
[ae4c85a]442 maybeAccept( logicalExpr->get_arg1(), *this );
443 maybeAccept( logicalExpr->get_arg2(), *this );
444 }
445
446 void Indexer::visit( ConditionalExpr *conditionalExpr ) {
[906e24d]447 acceptNewScope( conditionalExpr->get_result(), *this );
[ae4c85a]448 maybeAccept( conditionalExpr->get_arg1(), *this );
449 maybeAccept( conditionalExpr->get_arg2(), *this );
450 maybeAccept( conditionalExpr->get_arg3(), *this );
451 }
452
453 void Indexer::visit( CommaExpr *commaExpr ) {
[906e24d]454 acceptNewScope( commaExpr->get_result(), *this );
[ae4c85a]455 maybeAccept( commaExpr->get_arg1(), *this );
456 maybeAccept( commaExpr->get_arg2(), *this );
457 }
458
459 void Indexer::visit( TypeExpr *typeExpr ) {
[906e24d]460 acceptNewScope( typeExpr->get_result(), *this );
[ae4c85a]461 maybeAccept( typeExpr->get_type(), *this );
462 }
463
464 void Indexer::visit( AsmExpr *asmExpr ) {
465 maybeAccept( asmExpr->get_inout(), *this );
466 maybeAccept( asmExpr->get_constraint(), *this );
467 maybeAccept( asmExpr->get_operand(), *this );
468 }
469
[907eccb]470 void Indexer::visit( ImplicitCopyCtorExpr *impCpCtorExpr ) {
471 acceptNewScope( impCpCtorExpr->get_result(), *this );
472 maybeAccept( impCpCtorExpr->get_callExpr(), *this );
473 acceptAll( impCpCtorExpr->get_tempDecls(), *this );
474 acceptAll( impCpCtorExpr->get_returnDecls(), *this );
475 acceptAll( impCpCtorExpr->get_dtors(), *this );
476 }
477
478 void Indexer::visit( ConstructorExpr * ctorExpr ) {
479 acceptNewScope( ctorExpr->get_result(), *this );
480 maybeAccept( ctorExpr->get_callExpr(), *this );
481 }
482
483 void Indexer::visit( CompoundLiteralExpr *compLitExpr ) {
484 acceptNewScope( compLitExpr->get_result(), *this );
485 maybeAccept( compLitExpr->get_initializer(), *this );
486 }
487
[ae4c85a]488 void Indexer::visit( UntypedValofExpr *valofExpr ) {
[906e24d]489 acceptNewScope( valofExpr->get_result(), *this );
[ae4c85a]490 maybeAccept( valofExpr->get_body(), *this );
491 }
492
[907eccb]493 void Indexer::visit( RangeExpr *rangeExpr ) {
494 maybeAccept( rangeExpr->get_low(), *this );
495 maybeAccept( rangeExpr->get_high(), *this );
496 }
497
498 void Indexer::visit( UntypedTupleExpr *tupleExpr ) {
499 acceptNewScope( tupleExpr->get_result(), *this );
500 acceptAll( tupleExpr->get_exprs(), *this );
501 }
502
503 void Indexer::visit( TupleExpr *tupleExpr ) {
504 acceptNewScope( tupleExpr->get_result(), *this );
505 acceptAll( tupleExpr->get_exprs(), *this );
506 }
507
508 void Indexer::visit( TupleIndexExpr *tupleExpr ) {
509 acceptNewScope( tupleExpr->get_result(), *this );
510 maybeAccept( tupleExpr->get_tuple(), *this );
511 }
512
513 void Indexer::visit( MemberTupleExpr *tupleExpr ) {
514 acceptNewScope( tupleExpr->get_result(), *this );
515 maybeAccept( tupleExpr->get_member(), *this );
516 maybeAccept( tupleExpr->get_aggregate(), *this );
517 }
518
519 void Indexer::visit( TupleAssignExpr *tupleExpr ) {
520 acceptNewScope( tupleExpr->get_result(), *this );
521 maybeAccept( tupleExpr->get_stmtExpr(), *this );
522 }
523
524 void Indexer::visit( StmtExpr *stmtExpr ) {
525 acceptNewScope( stmtExpr->get_result(), *this );
526 maybeAccept( stmtExpr->get_statements(), *this );
527 acceptAll( stmtExpr->get_returnDecls(), *this );
528 acceptAll( stmtExpr->get_dtors(), *this );
529 }
530
531 void Indexer::visit( UniqueExpr *uniqueExpr ) {
532 acceptNewScope( uniqueExpr->get_result(), *this );
533 maybeAccept( uniqueExpr->get_expr(), *this );
534 }
535
[ae4c85a]536
[4040425]537 void Indexer::visit( TraitInstType *contextInst ) {
[0dd3a2f]538 acceptAll( contextInst->get_parameters(), *this );
539 acceptAll( contextInst->get_members(), *this );
[a08ba92]540 }
[17cd4eb]541
[a08ba92]542 void Indexer::visit( StructInstType *structInst ) {
[e8032b0]543 if ( ! lookupStruct( structInst->get_name() ) ) {
[0dd3a2f]544 debugPrint( "Adding struct " << structInst->get_name() << " from implicit forward declaration" << std::endl );
[e8032b0]545 addStruct( structInst->get_name() );
[0dd3a2f]546 }
547 enterScope();
548 acceptAll( structInst->get_parameters(), *this );
549 leaveScope();
[a08ba92]550 }
[17cd4eb]551
[a08ba92]552 void Indexer::visit( UnionInstType *unionInst ) {
[e8032b0]553 if ( ! lookupUnion( unionInst->get_name() ) ) {
[0dd3a2f]554 debugPrint( "Adding union " << unionInst->get_name() << " from implicit forward declaration" << std::endl );
[e8032b0]555 addUnion( unionInst->get_name() );
[0dd3a2f]556 }
557 enterScope();
558 acceptAll( unionInst->get_parameters(), *this );
559 leaveScope();
[a08ba92]560 }
[17cd4eb]561
[a08ba92]562 void Indexer::visit( ForStmt *forStmt ) {
563 // for statements introduce a level of scope
564 enterScope();
565 Visitor::visit( forStmt );
566 leaveScope();
567 }
[d4778a6]568
[743fbda]569
[d4778a6]570
[bed4c63e]571 void Indexer::lookupId( const std::string &id, std::list< DeclarationWithType* > &out ) const {
[5447e09]572 std::unordered_set< std::string > foundMangleNames;
[743fbda]573
[5447e09]574 Indexer::Impl *searchTables = tables;
575 while ( searchTables ) {
576
577 IdTable::const_iterator decls = searchTables->idTable.find( id );
578 if ( decls != searchTables->idTable.end() ) {
579 const MangleTable &mangleTable = decls->second;
580 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
581 // mark the mangled name as found, skipping this insertion if a declaration for that name has already been found
582 if ( foundMangleNames.insert( decl->first ).second == false ) continue;
[743fbda]583
[5447e09]584 out.push_back( decl->second );
585 }
[bed4c63e]586 }
[743fbda]587
[5447e09]588 // get declarations from base indexers
589 searchTables = searchTables->base.tables;
[bed4c63e]590 }
[1ba88a0]591
592 // some special functions, e.g. constructors and destructors
593 // remove autogenerated functions when they are defined so that
594 // they can never be matched
595 removeSpecialOverrides( id, out );
[a08ba92]596 }
[bdd516a]597
[a08ba92]598 NamedTypeDecl *Indexer::lookupType( const std::string &id ) const {
[e8032b0]599 if ( ! tables ) return 0;
600
[52c2a72]601 TypeTable::const_iterator ret = tables->typeTable.find( id );
602 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupType( id );
[a08ba92]603 }
[17cd4eb]604
[a08ba92]605 StructDecl *Indexer::lookupStruct( const std::string &id ) const {
[e8032b0]606 if ( ! tables ) return 0;
607
[52c2a72]608 StructTable::const_iterator ret = tables->structTable.find( id );
609 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStruct( id );
[a08ba92]610 }
[17cd4eb]611
[a08ba92]612 EnumDecl *Indexer::lookupEnum( const std::string &id ) const {
[e8032b0]613 if ( ! tables ) return 0;
614
[52c2a72]615 EnumTable::const_iterator ret = tables->enumTable.find( id );
616 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnum( id );
[a08ba92]617 }
[17cd4eb]618
[a08ba92]619 UnionDecl *Indexer::lookupUnion( const std::string &id ) const {
[e8032b0]620 if ( ! tables ) return 0;
621
[52c2a72]622 UnionTable::const_iterator ret = tables->unionTable.find( id );
623 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnion( id );
[e8032b0]624 }
625
626 TraitDecl *Indexer::lookupTrait( const std::string &id ) const {
627 if ( ! tables ) return 0;
628
[52c2a72]629 TraitTable::const_iterator ret = tables->traitTable.find( id );
630 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTrait( id );
631 }
632
[bed4c63e]633 DeclarationWithType *Indexer::lookupIdAtScope( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
634 if ( ! tables ) return 0;
635 if ( tables->scope < scope ) return 0;
636
637 IdTable::const_iterator decls = tables->idTable.find( id );
638 if ( decls != tables->idTable.end() ) {
639 const MangleTable &mangleTable = decls->second;
640 MangleTable::const_iterator decl = mangleTable.find( mangleName );
641 if ( decl != mangleTable.end() ) return decl->second;
642 }
643
644 return tables->base.lookupIdAtScope( id, mangleName, scope );
645 }
646
[09d1ad0]647 bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
[bed4c63e]648 if ( ! tables ) return false;
[09d1ad0]649 if ( tables->scope < scope ) return false;
[bed4c63e]650
651 IdTable::const_iterator decls = tables->idTable.find( id );
652 if ( decls != tables->idTable.end() ) {
653 const MangleTable &mangleTable = decls->second;
654 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
[4e06c1e]655 // check for C decls with the same name, skipping those with a compatible type (by mangleName)
[5447e09]656 if ( decl->second->get_linkage() == LinkageSpec::C && decl->first != mangleName ) return true;
[bed4c63e]657 }
658 }
659
[09d1ad0]660 return tables->base.hasIncompatibleCDecl( id, mangleName, scope );
[bed4c63e]661 }
[743fbda]662
[8884112]663 bool Indexer::hasCompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
664 if ( ! tables ) return false;
665 if ( tables->scope < scope ) return false;
666
667 IdTable::const_iterator decls = tables->idTable.find( id );
668 if ( decls != tables->idTable.end() ) {
669 const MangleTable &mangleTable = decls->second;
670 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
671 // check for C decls with the same name, skipping
672 // those with an incompatible type (by mangleName)
673 if ( decl->second->get_linkage() == LinkageSpec::C && decl->first == mangleName ) return true;
674 }
675 }
676
677 return tables->base.hasCompatibleCDecl( id, mangleName, scope );
678 }
679
[52c2a72]680 NamedTypeDecl *Indexer::lookupTypeAtScope( const std::string &id, unsigned long scope ) const {
681 if ( ! tables ) return 0;
682 if ( tables->scope < scope ) return 0;
683
684 TypeTable::const_iterator ret = tables->typeTable.find( id );
685 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupTypeAtScope( id, scope );
686 }
[743fbda]687
[52c2a72]688 StructDecl *Indexer::lookupStructAtScope( const std::string &id, unsigned long scope ) const {
689 if ( ! tables ) return 0;
690 if ( tables->scope < scope ) return 0;
691
692 StructTable::const_iterator ret = tables->structTable.find( id );
693 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStructAtScope( id, scope );
694 }
[743fbda]695
[52c2a72]696 EnumDecl *Indexer::lookupEnumAtScope( const std::string &id, unsigned long scope ) const {
697 if ( ! tables ) return 0;
698 if ( tables->scope < scope ) return 0;
699
700 EnumTable::const_iterator ret = tables->enumTable.find( id );
701 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnumAtScope( id, scope );
702 }
[743fbda]703
[52c2a72]704 UnionDecl *Indexer::lookupUnionAtScope( const std::string &id, unsigned long scope ) const {
705 if ( ! tables ) return 0;
706 if ( tables->scope < scope ) return 0;
707
708 UnionTable::const_iterator ret = tables->unionTable.find( id );
709 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnionAtScope( id, scope );
710 }
[743fbda]711
[52c2a72]712 TraitDecl *Indexer::lookupTraitAtScope( const std::string &id, unsigned long scope ) const {
713 if ( ! tables ) return 0;
714 if ( tables->scope < scope ) return 0;
715
716 TraitTable::const_iterator ret = tables->traitTable.find( id );
717 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTraitAtScope( id, scope );
[a08ba92]718 }
[17cd4eb]719
[bed4c63e]720 bool addedIdConflicts( DeclarationWithType *existing, DeclarationWithType *added ) {
721 // if we're giving the same name mangling to things of different types then there is something wrong
722 assert( (dynamic_cast<ObjectDecl*>( added ) && dynamic_cast<ObjectDecl*>( existing ) )
723 || (dynamic_cast<FunctionDecl*>( added ) && dynamic_cast<FunctionDecl*>( existing ) ) );
724
725 if ( LinkageSpec::isOverridable( existing->get_linkage() ) ) {
726 // new definition shadows the autogenerated one, even at the same scope
727 return false;
728 } else if ( added->get_linkage() != LinkageSpec::C || ResolvExpr::typesCompatible( added->get_type(), existing->get_type(), Indexer() ) ) {
729 // typesCompatible doesn't really do the right thing here. When checking compatibility of function types,
730 // we should ignore outermost pointer qualifiers, except _Atomic?
731 FunctionDecl *newentry = dynamic_cast< FunctionDecl* >( added );
732 FunctionDecl *oldentry = dynamic_cast< FunctionDecl* >( existing );
733 if ( newentry && oldentry ) {
734 if ( newentry->get_statements() && oldentry->get_statements() ) {
735 throw SemanticError( "duplicate function definition for ", added );
736 } // if
737 } else {
738 // two objects with the same mangled name defined in the same scope.
739 // both objects must be marked extern or both must be intrinsic for this to be okay
740 // xxx - perhaps it's actually if either is intrinsic then this is okay?
741 // might also need to be same storage class?
742 ObjectDecl *newobj = dynamic_cast< ObjectDecl* >( added );
743 ObjectDecl *oldobj = dynamic_cast< ObjectDecl* >( existing );
[08d5507b]744 if ( ! newobj->get_storageClasses().is_extern && ! oldobj->get_storageClasses().is_extern ) {
[bed4c63e]745 throw SemanticError( "duplicate object definition for ", added );
746 } // if
747 } // if
748 } else {
749 throw SemanticError( "duplicate definition for ", added );
750 } // if
751
752 return true;
753 }
[743fbda]754
[e8032b0]755 void Indexer::addId( DeclarationWithType *decl ) {
756 makeWritable();
[bed4c63e]757
758 const std::string &name = decl->get_name();
759 std::string mangleName;
[6a57da5]760 if ( LinkageSpec::isOverridable( decl->get_linkage() ) ) {
[bed4c63e]761 // mangle the name without including the appropriate suffix, so overridable routines are placed into the
762 // same "bucket" as their user defined versions.
763 mangleName = Mangler::mangle( decl, false );
764 } else {
765 mangleName = Mangler::mangle( decl );
766 } // if
767
[8884112]768 // this ensures that no two declarations with the same unmangled name at the same scope both have C linkage
769 if ( decl->get_linkage() == LinkageSpec::C ) {
770 // NOTE this is broken in Richard's original code in such a way that it never triggers (it
771 // doesn't check decls that have the same manglename, and all C-linkage decls are defined to
772 // have their name as their manglename, hence the error can never trigger).
773 // The code here is closer to correct, but name mangling would have to be completely
774 // isomorphic to C type-compatibility, which it may not be.
775 if ( hasIncompatibleCDecl( name, mangleName, scope ) ) {
776 throw SemanticError( "conflicting overload of C function ", decl );
777 }
778 } else {
779 // Check that a Cforall declaration doesn't overload any C declaration
780 if ( hasCompatibleCDecl( name, mangleName, scope ) ) {
781 throw SemanticError( "Cforall declaration hides C function ", decl );
782 }
[bed4c63e]783 }
[8884112]784
785 // Skip repeat declarations of the same identifier
786 DeclarationWithType *existing = lookupIdAtScope( name, mangleName, scope );
787 if ( existing && addedIdConflicts( existing, decl ) ) return;
788
789 // add to indexer
790 tables->idTable[ name ][ mangleName ] = decl;
791 ++tables->size;
[e8032b0]792 }
[52c2a72]793
794 bool addedTypeConflicts( NamedTypeDecl *existing, NamedTypeDecl *added ) {
795 if ( existing->get_base() == 0 ) {
796 return false;
797 } else if ( added->get_base() == 0 ) {
798 return true;
799 } else {
800 throw SemanticError( "redeclaration of ", added );
801 }
802 }
[743fbda]803
[e8032b0]804 void Indexer::addType( NamedTypeDecl *decl ) {
805 makeWritable();
[52c2a72]806
807 const std::string &id = decl->get_name();
808 TypeTable::iterator existing = tables->typeTable.find( id );
809 if ( existing == tables->typeTable.end() ) {
810 NamedTypeDecl *parent = tables->base.lookupTypeAtScope( id, scope );
811 if ( ! parent || ! addedTypeConflicts( parent, decl ) ) {
812 tables->typeTable.insert( existing, std::make_pair( id, decl ) );
813 ++tables->size;
814 }
815 } else {
816 if ( ! addedTypeConflicts( existing->second, decl ) ) {
817 existing->second = decl;
818 }
819 }
820 }
821
822 bool addedDeclConflicts( AggregateDecl *existing, AggregateDecl *added ) {
823 if ( existing->get_members().empty() ) {
824 return false;
825 } else if ( ! added->get_members().empty() ) {
826 throw SemanticError( "redeclaration of ", added );
827 } // if
828 return true;
[e8032b0]829 }
830
831 void Indexer::addStruct( const std::string &id ) {
[52c2a72]832 addStruct( new StructDecl( id ) );
[e8032b0]833 }
[743fbda]834
[e8032b0]835 void Indexer::addStruct( StructDecl *decl ) {
836 makeWritable();
[52c2a72]837
838 const std::string &id = decl->get_name();
839 StructTable::iterator existing = tables->structTable.find( id );
840 if ( existing == tables->structTable.end() ) {
841 StructDecl *parent = tables->base.lookupStructAtScope( id, scope );
842 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
843 tables->structTable.insert( existing, std::make_pair( id, decl ) );
844 ++tables->size;
845 }
846 } else {
847 if ( ! addedDeclConflicts( existing->second, decl ) ) {
848 existing->second = decl;
849 }
850 }
[e8032b0]851 }
[743fbda]852
[e8032b0]853 void Indexer::addEnum( EnumDecl *decl ) {
854 makeWritable();
[52c2a72]855
856 const std::string &id = decl->get_name();
857 EnumTable::iterator existing = tables->enumTable.find( id );
858 if ( existing == tables->enumTable.end() ) {
859 EnumDecl *parent = tables->base.lookupEnumAtScope( id, scope );
860 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
861 tables->enumTable.insert( existing, std::make_pair( id, decl ) );
862 ++tables->size;
863 }
864 } else {
865 if ( ! addedDeclConflicts( existing->second, decl ) ) {
866 existing->second = decl;
867 }
868 }
[e8032b0]869 }
870
871 void Indexer::addUnion( const std::string &id ) {
[52c2a72]872 addUnion( new UnionDecl( id ) );
[e8032b0]873 }
[743fbda]874
[e8032b0]875 void Indexer::addUnion( UnionDecl *decl ) {
876 makeWritable();
[52c2a72]877
878 const std::string &id = decl->get_name();
879 UnionTable::iterator existing = tables->unionTable.find( id );
880 if ( existing == tables->unionTable.end() ) {
881 UnionDecl *parent = tables->base.lookupUnionAtScope( id, scope );
882 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
883 tables->unionTable.insert( existing, std::make_pair( id, decl ) );
884 ++tables->size;
885 }
886 } else {
887 if ( ! addedDeclConflicts( existing->second, decl ) ) {
888 existing->second = decl;
889 }
890 }
[e8032b0]891 }
[743fbda]892
[e8032b0]893 void Indexer::addTrait( TraitDecl *decl ) {
894 makeWritable();
[52c2a72]895
896 const std::string &id = decl->get_name();
897 TraitTable::iterator existing = tables->traitTable.find( id );
898 if ( existing == tables->traitTable.end() ) {
899 TraitDecl *parent = tables->base.lookupTraitAtScope( id, scope );
900 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
901 tables->traitTable.insert( existing, std::make_pair( id, decl ) );
902 ++tables->size;
903 }
904 } else {
905 if ( ! addedDeclConflicts( existing->second, decl ) ) {
906 existing->second = decl;
907 }
908 }
[a08ba92]909 }
[17cd4eb]910
[a08ba92]911 void Indexer::enterScope() {
[52c2a72]912 ++scope;
[743fbda]913
[0dd3a2f]914 if ( doDebug ) {
[52c2a72]915 std::cout << "--- Entering scope " << scope << std::endl;
[0dd3a2f]916 }
[a08ba92]917 }
[17cd4eb]918
[a08ba92]919 void Indexer::leaveScope() {
[0dd3a2f]920 using std::cout;
[52c2a72]921
922 assert( scope > 0 && "cannot leave initial scope" );
923 --scope;
924
925 while ( tables && tables->scope > scope ) {
926 if ( doDebug ) {
927 cout << "--- Leaving scope " << tables->scope << " containing" << std::endl;
[bed4c63e]928 dump( tables->idTable, cout );
[52c2a72]929 dump( tables->typeTable, cout );
930 dump( tables->structTable, cout );
931 dump( tables->enumTable, cout );
932 dump( tables->unionTable, cout );
933 dump( tables->traitTable, cout );
934 }
935
936 // swap tables for base table until we find one at an appropriate scope
937 Indexer::Impl *base = newRef( tables->base.tables );
938 deleteRef( tables );
939 tables = base;
[0dd3a2f]940 }
[a08ba92]941 }
[17cd4eb]942
[a08ba92]943 void Indexer::print( std::ostream &os, int indent ) const {
944 using std::cerr;
[e8032b0]945
[0cb1d61]946 if ( tables ) {
947 os << "--- scope " << tables->scope << " ---" << std::endl;
948
949 os << "===idTable===" << std::endl;
950 dump( tables->idTable, os );
951 os << "===typeTable===" << std::endl;
952 dump( tables->typeTable, os );
953 os << "===structTable===" << std::endl;
954 dump( tables->structTable, os );
955 os << "===enumTable===" << std::endl;
956 dump( tables->enumTable, os );
957 os << "===unionTable===" << std::endl;
958 dump( tables->unionTable, os );
959 os << "===contextTable===" << std::endl;
960 dump( tables->traitTable, os );
961
962 tables->base.print( os, indent );
963 } else {
964 os << "--- end ---" << std::endl;
965 }
[743fbda]966
[a08ba92]967 }
[51b73452]968} // namespace SymTab
[0dd3a2f]969
970// Local Variables: //
971// tab-width: 4 //
972// mode: c++ //
973// compile-command: "make install" //
974// End: //
Note: See TracBrowser for help on using the repository browser.