source: src/SymTab/Indexer.cc@ e85a8631

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor 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 e85a8631 was d1b9d78, checked in by Aaron Moss <a3moss@…>, 9 years ago

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