source: src/SymTab/Indexer.cc@ ac032b5

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 ac032b5 was 67cf18c, checked in by Rob Schluntz <rschlunt@…>, 8 years ago

implement default type arguments for generic types [closes #13]
  • Property mode set to 100644
File size: 34.9 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 Mar 30 16:38:47 2017
13// Update Count : 19
14//
15
16#include "Indexer.h"
17
18#include <string>
19#include <typeinfo>
20#include <unordered_map>
21#include <unordered_set>
22#include <utility>
23#include <algorithm>
24
25#include "Mangler.h"
26
27#include "Common/utility.h"
28
29#include "ResolvExpr/typeops.h"
30
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"
36
37#include "InitTweak/InitTweak.h"
38
39#define debugPrint(x) if ( doDebug ) { std::cout << x; }
40
41namespace SymTab {
42 struct NewScope {
43 NewScope( SymTab::Indexer & indexer ) : indexer( indexer ) { indexer.enterScope(); }
44 ~NewScope() { indexer.leaveScope(); }
45 SymTab::Indexer & indexer;
46 };
47
48 template< typename TreeType, typename VisitorType >
49 inline void acceptNewScope( TreeType *tree, VisitorType &visitor ) {
50 visitor.enterScope();
51 maybeAccept( tree, visitor );
52 visitor.leaveScope();
53 }
54
55 typedef std::unordered_map< std::string, DeclarationWithType* > MangleTable;
56 typedef std::unordered_map< std::string, MangleTable > IdTable;
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
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 }
70
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 }
77
78 struct Indexer::Impl {
79 Impl( unsigned long _scope ) : refCount(1), scope( _scope ), size( 0 ), base(),
80 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
81 Impl( unsigned long _scope, Indexer &&_base ) : refCount(1), scope( _scope ), size( 0 ), base( _base ),
82 idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
83 unsigned long refCount; ///< Number of references to these tables
84 unsigned long scope; ///< Scope these tables are associated with
85 unsigned long size; ///< Number of elements stored in this table
86 const Indexer base; ///< Base indexer this extends
87
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
112 void Indexer::removeSpecialOverrides( const std::string &id, std::list< DeclarationWithType * > & out ) const {
113 // only need to perform this step for constructors, destructors, and assignment functions
114 if ( ! InitTweak::isCtorDtorAssign( id ) ) return;
115
116 // helpful data structure
117 struct ValueType {
118 struct DeclBall {
119 FunctionDecl * decl;
120 bool isUserDefinedFunc; // properties for this particular decl
121 bool isDefaultCtor;
122 bool isDtor;
123 bool isCopyFunc;
124 };
125 // properties for this type
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
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() );
137 bool isDefaultCtor = InitTweak::isDefaultConstructor( function );
138 bool isDtor = InitTweak::isDestructor( function );
139 bool isCopyFunc = InitTweak::isCopyFunction( function, function->get_name() );
140 decls.push_back( DeclBall{ function, isUserDefinedFunc, isDefaultCtor, isDtor, isCopyFunc } );
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);
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 ) ) {
157 std::list< DeclarationWithType * > & params = function->get_functionType()->get_parameters();
158 assert( ! params.empty() );
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;
162 } else {
163 out.push_back( decl );
164 }
165 }
166
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
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.
171 // If the user defines any ctor then the generated default ctor should not be seen (intrinsic default
172 // ctor must be overridden exactly).
173 for ( std::pair< const std::string, ValueType > & pair : funcMap ) {
174 ValueType & val = pair.second;
175 for ( ValueType::DeclBall ball : val.decls ) {
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 ) {
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
189 void Indexer::makeWritable() {
190 if ( ! tables ) {
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 ) );
196 }
197 }
198
199 Indexer::Indexer( bool _doDebug ) : tables( 0 ), scope( 0 ), doDebug( _doDebug ) {}
200
201 Indexer::Indexer( const Indexer &that ) : tables( newRef( that.tables ) ), scope( that.scope ), doDebug( that.doDebug ) {}
202
203 Indexer::Indexer( Indexer &&that ) : tables( that.tables ), scope( that.scope ), doDebug( that.doDebug ) {
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 );
215 scope = that.scope;
216 doDebug = that.doDebug;
217
218 return *this;
219 }
220
221 Indexer& Indexer::operator= ( Indexer &&that ) {
222 deleteRef( tables );
223
224 tables = that.tables;
225 scope = that.scope;
226 doDebug = that.doDebug;
227
228 that.tables = 0;
229
230 return *this;
231 }
232
233 void Indexer::visit( ObjectDecl *objectDecl ) {
234 enterScope();
235 maybeAccept( objectDecl->get_type(), *this );
236 leaveScope();
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 );
241 addId( objectDecl );
242 } // if
243 }
244
245 void Indexer::visit( FunctionDecl *functionDecl ) {
246 if ( functionDecl->get_name() == "" ) return;
247 debugPrint( "Adding function " << functionDecl->get_name() << std::endl );
248 addId( functionDecl );
249 enterScope();
250 maybeAccept( functionDecl->get_functionType(), *this );
251 maybeAccept( functionDecl->get_statements(), *this );
252 leaveScope();
253 }
254
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
275
276 void Indexer::visit( TypeDecl *typeDecl ) {
277 // see A NOTE ON THE ORDER OF TRAVERSAL, above
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
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 );
285 addType( typeDecl );
286 acceptAll( typeDecl->get_assertions(), *this );
287 acceptNewScope( typeDecl->get_init(), *this );
288 }
289
290 void Indexer::visit( TypedefDecl *typeDecl ) {
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 );
296 addType( typeDecl );
297 }
298
299 void Indexer::visit( StructDecl *aggregateDecl ) {
300 // make up a forward declaration and add it before processing the members
301 // needs to be on the heap because addStruct saves the pointer
302 StructDecl &fwdDecl = *new StructDecl( aggregateDecl->get_name() );
303 cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() );
304 debugPrint( "Adding fwd decl for struct " << fwdDecl.get_name() << std::endl );
305 addStruct( &fwdDecl );
306
307 enterScope();
308 acceptAll( aggregateDecl->get_parameters(), *this );
309 acceptAll( aggregateDecl->get_members(), *this );
310 leaveScope();
311
312 debugPrint( "Adding struct " << aggregateDecl->get_name() << std::endl );
313 // this addition replaces the forward declaration
314 addStruct( aggregateDecl );
315 }
316
317 void Indexer::visit( UnionDecl *aggregateDecl ) {
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 );
322 addUnion( &fwdDecl );
323
324 enterScope();
325 acceptAll( aggregateDecl->get_parameters(), *this );
326 acceptAll( aggregateDecl->get_members(), *this );
327 leaveScope();
328
329 debugPrint( "Adding union " << aggregateDecl->get_name() << std::endl );
330 addUnion( aggregateDecl );
331 }
332
333 void Indexer::visit( EnumDecl *aggregateDecl ) {
334 debugPrint( "Adding enum " << aggregateDecl->get_name() << std::endl );
335 addEnum( aggregateDecl );
336 // unlike structs, contexts, and unions, enums inject their members into the global scope
337 acceptAll( aggregateDecl->get_members(), *this );
338 }
339
340 void Indexer::visit( TraitDecl *aggregateDecl ) {
341 enterScope();
342 acceptAll( aggregateDecl->get_parameters(), *this );
343 acceptAll( aggregateDecl->get_members(), *this );
344 leaveScope();
345
346 debugPrint( "Adding context " << aggregateDecl->get_name() << std::endl );
347 addTrait( aggregateDecl );
348 }
349
350 void Indexer::visit( CompoundStmt *compoundStmt ) {
351 enterScope();
352 acceptAll( compoundStmt->get_kids(), *this );
353 leaveScope();
354 }
355
356
357 void Indexer::visit( ApplicationExpr *applicationExpr ) {
358 acceptNewScope( applicationExpr->get_result(), *this );
359 maybeAccept( applicationExpr->get_function(), *this );
360 acceptAll( applicationExpr->get_args(), *this );
361 }
362
363 void Indexer::visit( UntypedExpr *untypedExpr ) {
364 acceptNewScope( untypedExpr->get_result(), *this );
365 acceptAll( untypedExpr->get_args(), *this );
366 }
367
368 void Indexer::visit( NameExpr *nameExpr ) {
369 acceptNewScope( nameExpr->get_result(), *this );
370 }
371
372 void Indexer::visit( AddressExpr *addressExpr ) {
373 acceptNewScope( addressExpr->get_result(), *this );
374 maybeAccept( addressExpr->get_arg(), *this );
375 }
376
377 void Indexer::visit( LabelAddressExpr *labAddressExpr ) {
378 acceptNewScope( labAddressExpr->get_result(), *this );
379 maybeAccept( labAddressExpr->get_arg(), *this );
380 }
381
382 void Indexer::visit( CastExpr *castExpr ) {
383 acceptNewScope( castExpr->get_result(), *this );
384 maybeAccept( castExpr->get_arg(), *this );
385 }
386
387 void Indexer::visit( UntypedMemberExpr *memberExpr ) {
388 acceptNewScope( memberExpr->get_result(), *this );
389 maybeAccept( memberExpr->get_aggregate(), *this );
390 }
391
392 void Indexer::visit( MemberExpr *memberExpr ) {
393 acceptNewScope( memberExpr->get_result(), *this );
394 maybeAccept( memberExpr->get_aggregate(), *this );
395 }
396
397 void Indexer::visit( VariableExpr *variableExpr ) {
398 acceptNewScope( variableExpr->get_result(), *this );
399 }
400
401 void Indexer::visit( ConstantExpr *constantExpr ) {
402 acceptNewScope( constantExpr->get_result(), *this );
403 maybeAccept( constantExpr->get_constant(), *this );
404 }
405
406 void Indexer::visit( SizeofExpr *sizeofExpr ) {
407 acceptNewScope( sizeofExpr->get_result(), *this );
408 if ( sizeofExpr->get_isType() ) {
409 maybeAccept( sizeofExpr->get_type(), *this );
410 } else {
411 maybeAccept( sizeofExpr->get_expr(), *this );
412 }
413 }
414
415 void Indexer::visit( AlignofExpr *alignofExpr ) {
416 acceptNewScope( alignofExpr->get_result(), *this );
417 if ( alignofExpr->get_isType() ) {
418 maybeAccept( alignofExpr->get_type(), *this );
419 } else {
420 maybeAccept( alignofExpr->get_expr(), *this );
421 }
422 }
423
424 void Indexer::visit( UntypedOffsetofExpr *offsetofExpr ) {
425 acceptNewScope( offsetofExpr->get_result(), *this );
426 maybeAccept( offsetofExpr->get_type(), *this );
427 }
428
429 void Indexer::visit( OffsetofExpr *offsetofExpr ) {
430 acceptNewScope( offsetofExpr->get_result(), *this );
431 maybeAccept( offsetofExpr->get_type(), *this );
432 maybeAccept( offsetofExpr->get_member(), *this );
433 }
434
435 void Indexer::visit( OffsetPackExpr *offsetPackExpr ) {
436 acceptNewScope( offsetPackExpr->get_result(), *this );
437 maybeAccept( offsetPackExpr->get_type(), *this );
438 }
439
440 void Indexer::visit( AttrExpr *attrExpr ) {
441 acceptNewScope( attrExpr->get_result(), *this );
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 ) {
450 acceptNewScope( logicalExpr->get_result(), *this );
451 maybeAccept( logicalExpr->get_arg1(), *this );
452 maybeAccept( logicalExpr->get_arg2(), *this );
453 }
454
455 void Indexer::visit( ConditionalExpr *conditionalExpr ) {
456 acceptNewScope( conditionalExpr->get_result(), *this );
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 ) {
463 acceptNewScope( commaExpr->get_result(), *this );
464 maybeAccept( commaExpr->get_arg1(), *this );
465 maybeAccept( commaExpr->get_arg2(), *this );
466 }
467
468 void Indexer::visit( TypeExpr *typeExpr ) {
469 acceptNewScope( typeExpr->get_result(), *this );
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
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
497 void Indexer::visit( UntypedValofExpr *valofExpr ) {
498 acceptNewScope( valofExpr->get_result(), *this );
499 maybeAccept( valofExpr->get_body(), *this );
500 }
501
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( MemberTupleExpr *tupleExpr ) {
523 acceptNewScope( tupleExpr->get_result(), *this );
524 maybeAccept( tupleExpr->get_member(), *this );
525 maybeAccept( tupleExpr->get_aggregate(), *this );
526 }
527
528 void Indexer::visit( TupleAssignExpr *tupleExpr ) {
529 acceptNewScope( tupleExpr->get_result(), *this );
530 maybeAccept( tupleExpr->get_stmtExpr(), *this );
531 }
532
533 void Indexer::visit( StmtExpr *stmtExpr ) {
534 acceptNewScope( stmtExpr->get_result(), *this );
535 maybeAccept( stmtExpr->get_statements(), *this );
536 acceptAll( stmtExpr->get_returnDecls(), *this );
537 acceptAll( stmtExpr->get_dtors(), *this );
538 }
539
540 void Indexer::visit( UniqueExpr *uniqueExpr ) {
541 acceptNewScope( uniqueExpr->get_result(), *this );
542 maybeAccept( uniqueExpr->get_expr(), *this );
543 }
544
545
546 void Indexer::visit( TraitInstType *contextInst ) {
547 acceptAll( contextInst->get_parameters(), *this );
548 acceptAll( contextInst->get_members(), *this );
549 }
550
551 void Indexer::visit( StructInstType *structInst ) {
552 if ( ! lookupStruct( structInst->get_name() ) ) {
553 debugPrint( "Adding struct " << structInst->get_name() << " from implicit forward declaration" << std::endl );
554 addStruct( structInst->get_name() );
555 }
556 enterScope();
557 acceptAll( structInst->get_parameters(), *this );
558 leaveScope();
559 }
560
561 void Indexer::visit( UnionInstType *unionInst ) {
562 if ( ! lookupUnion( unionInst->get_name() ) ) {
563 debugPrint( "Adding union " << unionInst->get_name() << " from implicit forward declaration" << std::endl );
564 addUnion( unionInst->get_name() );
565 }
566 enterScope();
567 acceptAll( unionInst->get_parameters(), *this );
568 leaveScope();
569 }
570
571 void Indexer::visit( ForStmt *forStmt ) {
572 // for statements introduce a level of scope
573 enterScope();
574 Visitor::visit( forStmt );
575 leaveScope();
576 }
577
578
579
580 void Indexer::lookupId( const std::string &id, std::list< DeclarationWithType* > &out ) const {
581 std::unordered_set< std::string > foundMangleNames;
582
583 Indexer::Impl *searchTables = tables;
584 while ( searchTables ) {
585
586 IdTable::const_iterator decls = searchTables->idTable.find( id );
587 if ( decls != searchTables->idTable.end() ) {
588 const MangleTable &mangleTable = decls->second;
589 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
590 // mark the mangled name as found, skipping this insertion if a declaration for that name has already been found
591 if ( foundMangleNames.insert( decl->first ).second == false ) continue;
592
593 out.push_back( decl->second );
594 }
595 }
596
597 // get declarations from base indexers
598 searchTables = searchTables->base.tables;
599 }
600
601 // some special functions, e.g. constructors and destructors
602 // remove autogenerated functions when they are defined so that
603 // they can never be matched
604 removeSpecialOverrides( id, out );
605 }
606
607 NamedTypeDecl *Indexer::lookupType( const std::string &id ) const {
608 if ( ! tables ) return 0;
609
610 TypeTable::const_iterator ret = tables->typeTable.find( id );
611 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupType( id );
612 }
613
614 StructDecl *Indexer::lookupStruct( const std::string &id ) const {
615 if ( ! tables ) return 0;
616
617 StructTable::const_iterator ret = tables->structTable.find( id );
618 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStruct( id );
619 }
620
621 EnumDecl *Indexer::lookupEnum( const std::string &id ) const {
622 if ( ! tables ) return 0;
623
624 EnumTable::const_iterator ret = tables->enumTable.find( id );
625 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnum( id );
626 }
627
628 UnionDecl *Indexer::lookupUnion( const std::string &id ) const {
629 if ( ! tables ) return 0;
630
631 UnionTable::const_iterator ret = tables->unionTable.find( id );
632 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnion( id );
633 }
634
635 TraitDecl *Indexer::lookupTrait( const std::string &id ) const {
636 if ( ! tables ) return 0;
637
638 TraitTable::const_iterator ret = tables->traitTable.find( id );
639 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTrait( id );
640 }
641
642 DeclarationWithType *Indexer::lookupIdAtScope( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
643 if ( ! tables ) return 0;
644 if ( tables->scope < scope ) return 0;
645
646 IdTable::const_iterator decls = tables->idTable.find( id );
647 if ( decls != tables->idTable.end() ) {
648 const MangleTable &mangleTable = decls->second;
649 MangleTable::const_iterator decl = mangleTable.find( mangleName );
650 if ( decl != mangleTable.end() ) return decl->second;
651 }
652
653 return tables->base.lookupIdAtScope( id, mangleName, scope );
654 }
655
656 bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
657 if ( ! tables ) return false;
658 if ( tables->scope < scope ) return false;
659
660 IdTable::const_iterator decls = tables->idTable.find( id );
661 if ( decls != tables->idTable.end() ) {
662 const MangleTable &mangleTable = decls->second;
663 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
664 // check for C decls with the same name, skipping those with a compatible type (by mangleName)
665 if ( decl->second->get_linkage() == LinkageSpec::C && decl->first != mangleName ) return true;
666 }
667 }
668
669 return tables->base.hasIncompatibleCDecl( id, mangleName, scope );
670 }
671
672 bool Indexer::hasCompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
673 if ( ! tables ) return false;
674 if ( tables->scope < scope ) return false;
675
676 IdTable::const_iterator decls = tables->idTable.find( id );
677 if ( decls != tables->idTable.end() ) {
678 const MangleTable &mangleTable = decls->second;
679 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
680 // check for C decls with the same name, skipping
681 // those with an incompatible type (by mangleName)
682 if ( decl->second->get_linkage() == LinkageSpec::C && decl->first == mangleName ) return true;
683 }
684 }
685
686 return tables->base.hasCompatibleCDecl( id, mangleName, scope );
687 }
688
689 NamedTypeDecl *Indexer::lookupTypeAtScope( const std::string &id, unsigned long scope ) const {
690 if ( ! tables ) return 0;
691 if ( tables->scope < scope ) return 0;
692
693 TypeTable::const_iterator ret = tables->typeTable.find( id );
694 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupTypeAtScope( id, scope );
695 }
696
697 StructDecl *Indexer::lookupStructAtScope( const std::string &id, unsigned long scope ) const {
698 if ( ! tables ) return 0;
699 if ( tables->scope < scope ) return 0;
700
701 StructTable::const_iterator ret = tables->structTable.find( id );
702 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStructAtScope( id, scope );
703 }
704
705 EnumDecl *Indexer::lookupEnumAtScope( const std::string &id, unsigned long scope ) const {
706 if ( ! tables ) return 0;
707 if ( tables->scope < scope ) return 0;
708
709 EnumTable::const_iterator ret = tables->enumTable.find( id );
710 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnumAtScope( id, scope );
711 }
712
713 UnionDecl *Indexer::lookupUnionAtScope( const std::string &id, unsigned long scope ) const {
714 if ( ! tables ) return 0;
715 if ( tables->scope < scope ) return 0;
716
717 UnionTable::const_iterator ret = tables->unionTable.find( id );
718 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnionAtScope( id, scope );
719 }
720
721 TraitDecl *Indexer::lookupTraitAtScope( const std::string &id, unsigned long scope ) const {
722 if ( ! tables ) return 0;
723 if ( tables->scope < scope ) return 0;
724
725 TraitTable::const_iterator ret = tables->traitTable.find( id );
726 return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTraitAtScope( id, scope );
727 }
728
729 bool addedIdConflicts( DeclarationWithType *existing, DeclarationWithType *added ) {
730 // if we're giving the same name mangling to things of different types then there is something wrong
731 assert( (dynamic_cast<ObjectDecl*>( added ) && dynamic_cast<ObjectDecl*>( existing ) )
732 || (dynamic_cast<FunctionDecl*>( added ) && dynamic_cast<FunctionDecl*>( existing ) ) );
733
734 if ( LinkageSpec::isOverridable( existing->get_linkage() ) ) {
735 // new definition shadows the autogenerated one, even at the same scope
736 return false;
737 } else if ( added->get_linkage() != LinkageSpec::C || ResolvExpr::typesCompatible( added->get_type(), existing->get_type(), Indexer() ) ) {
738 // typesCompatible doesn't really do the right thing here. When checking compatibility of function types,
739 // we should ignore outermost pointer qualifiers, except _Atomic?
740 FunctionDecl *newentry = dynamic_cast< FunctionDecl* >( added );
741 FunctionDecl *oldentry = dynamic_cast< FunctionDecl* >( existing );
742 if ( newentry && oldentry ) {
743 if ( newentry->get_statements() && oldentry->get_statements() ) {
744 throw SemanticError( "duplicate function definition for ", added );
745 } // if
746 } else {
747 // two objects with the same mangled name defined in the same scope.
748 // both objects must be marked extern or both must be intrinsic for this to be okay
749 // xxx - perhaps it's actually if either is intrinsic then this is okay?
750 // might also need to be same storage class?
751 ObjectDecl *newobj = dynamic_cast< ObjectDecl* >( added );
752 ObjectDecl *oldobj = dynamic_cast< ObjectDecl* >( existing );
753 if ( ! newobj->get_storageClasses().is_extern && ! oldobj->get_storageClasses().is_extern ) {
754 throw SemanticError( "duplicate object definition for ", added );
755 } // if
756 } // if
757 } else {
758 throw SemanticError( "duplicate definition for ", added );
759 } // if
760
761 return true;
762 }
763
764 void Indexer::addId( DeclarationWithType *decl ) {
765 makeWritable();
766
767 const std::string &name = decl->get_name();
768 std::string mangleName;
769 if ( LinkageSpec::isOverridable( decl->get_linkage() ) ) {
770 // mangle the name without including the appropriate suffix, so overridable routines are placed into the
771 // same "bucket" as their user defined versions.
772 mangleName = Mangler::mangle( decl, false );
773 } else {
774 mangleName = Mangler::mangle( decl );
775 } // if
776
777 // this ensures that no two declarations with the same unmangled name at the same scope both have C linkage
778 if ( decl->get_linkage() == LinkageSpec::C ) {
779 // NOTE this is broken in Richard's original code in such a way that it never triggers (it
780 // doesn't check decls that have the same manglename, and all C-linkage decls are defined to
781 // have their name as their manglename, hence the error can never trigger).
782 // The code here is closer to correct, but name mangling would have to be completely
783 // isomorphic to C type-compatibility, which it may not be.
784 if ( hasIncompatibleCDecl( name, mangleName, scope ) ) {
785 throw SemanticError( "conflicting overload of C function ", decl );
786 }
787 } else {
788 // Check that a Cforall declaration doesn't overload any C declaration
789 if ( hasCompatibleCDecl( name, mangleName, scope ) ) {
790 throw SemanticError( "Cforall declaration hides C function ", decl );
791 }
792 }
793
794 // Skip repeat declarations of the same identifier
795 DeclarationWithType *existing = lookupIdAtScope( name, mangleName, scope );
796 if ( existing && addedIdConflicts( existing, decl ) ) return;
797
798 // add to indexer
799 tables->idTable[ name ][ mangleName ] = decl;
800 ++tables->size;
801 }
802
803 bool addedTypeConflicts( NamedTypeDecl *existing, NamedTypeDecl *added ) {
804 if ( existing->get_base() == 0 ) {
805 return false;
806 } else if ( added->get_base() == 0 ) {
807 return true;
808 } else {
809 throw SemanticError( "redeclaration of ", added );
810 }
811 }
812
813 void Indexer::addType( NamedTypeDecl *decl ) {
814 makeWritable();
815
816 const std::string &id = decl->get_name();
817 TypeTable::iterator existing = tables->typeTable.find( id );
818 if ( existing == tables->typeTable.end() ) {
819 NamedTypeDecl *parent = tables->base.lookupTypeAtScope( id, scope );
820 if ( ! parent || ! addedTypeConflicts( parent, decl ) ) {
821 tables->typeTable.insert( existing, std::make_pair( id, decl ) );
822 ++tables->size;
823 }
824 } else {
825 if ( ! addedTypeConflicts( existing->second, decl ) ) {
826 existing->second = decl;
827 }
828 }
829 }
830
831 bool addedDeclConflicts( AggregateDecl *existing, AggregateDecl *added ) {
832 if ( existing->get_members().empty() ) {
833 return false;
834 } else if ( ! added->get_members().empty() ) {
835 throw SemanticError( "redeclaration of ", added );
836 } // if
837 return true;
838 }
839
840 void Indexer::addStruct( const std::string &id ) {
841 addStruct( new StructDecl( id ) );
842 }
843
844 void Indexer::addStruct( StructDecl *decl ) {
845 makeWritable();
846
847 const std::string &id = decl->get_name();
848 StructTable::iterator existing = tables->structTable.find( id );
849 if ( existing == tables->structTable.end() ) {
850 StructDecl *parent = tables->base.lookupStructAtScope( id, scope );
851 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
852 tables->structTable.insert( existing, std::make_pair( id, decl ) );
853 ++tables->size;
854 }
855 } else {
856 if ( ! addedDeclConflicts( existing->second, decl ) ) {
857 existing->second = decl;
858 }
859 }
860 }
861
862 void Indexer::addEnum( EnumDecl *decl ) {
863 makeWritable();
864
865 const std::string &id = decl->get_name();
866 EnumTable::iterator existing = tables->enumTable.find( id );
867 if ( existing == tables->enumTable.end() ) {
868 EnumDecl *parent = tables->base.lookupEnumAtScope( id, scope );
869 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
870 tables->enumTable.insert( existing, std::make_pair( id, decl ) );
871 ++tables->size;
872 }
873 } else {
874 if ( ! addedDeclConflicts( existing->second, decl ) ) {
875 existing->second = decl;
876 }
877 }
878 }
879
880 void Indexer::addUnion( const std::string &id ) {
881 addUnion( new UnionDecl( id ) );
882 }
883
884 void Indexer::addUnion( UnionDecl *decl ) {
885 makeWritable();
886
887 const std::string &id = decl->get_name();
888 UnionTable::iterator existing = tables->unionTable.find( id );
889 if ( existing == tables->unionTable.end() ) {
890 UnionDecl *parent = tables->base.lookupUnionAtScope( id, scope );
891 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
892 tables->unionTable.insert( existing, std::make_pair( id, decl ) );
893 ++tables->size;
894 }
895 } else {
896 if ( ! addedDeclConflicts( existing->second, decl ) ) {
897 existing->second = decl;
898 }
899 }
900 }
901
902 void Indexer::addTrait( TraitDecl *decl ) {
903 makeWritable();
904
905 const std::string &id = decl->get_name();
906 TraitTable::iterator existing = tables->traitTable.find( id );
907 if ( existing == tables->traitTable.end() ) {
908 TraitDecl *parent = tables->base.lookupTraitAtScope( id, scope );
909 if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
910 tables->traitTable.insert( existing, std::make_pair( id, decl ) );
911 ++tables->size;
912 }
913 } else {
914 if ( ! addedDeclConflicts( existing->second, decl ) ) {
915 existing->second = decl;
916 }
917 }
918 }
919
920 void Indexer::enterScope() {
921 ++scope;
922
923 if ( doDebug ) {
924 std::cout << "--- Entering scope " << scope << std::endl;
925 }
926 }
927
928 void Indexer::leaveScope() {
929 using std::cout;
930
931 assert( scope > 0 && "cannot leave initial scope" );
932 --scope;
933
934 while ( tables && tables->scope > scope ) {
935 if ( doDebug ) {
936 cout << "--- Leaving scope " << tables->scope << " containing" << std::endl;
937 dump( tables->idTable, cout );
938 dump( tables->typeTable, cout );
939 dump( tables->structTable, cout );
940 dump( tables->enumTable, cout );
941 dump( tables->unionTable, cout );
942 dump( tables->traitTable, cout );
943 }
944
945 // swap tables for base table until we find one at an appropriate scope
946 Indexer::Impl *base = newRef( tables->base.tables );
947 deleteRef( tables );
948 tables = base;
949 }
950 }
951
952 void Indexer::print( std::ostream &os, int indent ) const {
953 using std::cerr;
954
955 if ( tables ) {
956 os << "--- scope " << tables->scope << " ---" << std::endl;
957
958 os << "===idTable===" << std::endl;
959 dump( tables->idTable, os );
960 os << "===typeTable===" << std::endl;
961 dump( tables->typeTable, os );
962 os << "===structTable===" << std::endl;
963 dump( tables->structTable, os );
964 os << "===enumTable===" << std::endl;
965 dump( tables->enumTable, os );
966 os << "===unionTable===" << std::endl;
967 dump( tables->unionTable, os );
968 os << "===contextTable===" << std::endl;
969 dump( tables->traitTable, os );
970
971 tables->base.print( os, indent );
972 } else {
973 os << "--- end ---" << std::endl;
974 }
975
976 }
977} // namespace SymTab
978
979// Local Variables: //
980// tab-width: 4 //
981// mode: c++ //
982// compile-command: "make install" //
983// End: //
Note: See TracBrowser for help on using the repository browser.