source: src/SymTab/Indexer.cc@ cdd1695

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 cdd1695 was d7dc824, checked in by Thierry Delisle <tdelisle@…>, 8 years ago

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