Changeset 1048b31 for src/SymTab/Indexer.cc
- Timestamp:
- May 2, 2016, 3:28:16 PM (9 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- 1b7ea43
- Parents:
- 1f6e009 (diff), e945826 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/SymTab/Indexer.cc
r1f6e009 r1048b31 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Indexer.cc -- 7 // Indexer.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Sun May 17 21:37:33 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:31:29201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Fri Apr 22 15:25:43 2016 13 13 // Update Count : 11 14 14 // … … 59 59 } 60 60 } 61 61 62 62 template< typename Decl > 63 63 void dump( const std::unordered_map< std::string, Decl* > &table, std::ostream &os ) { … … 66 66 } // for 67 67 } 68 68 69 69 struct Indexer::Impl { 70 70 Impl( unsigned long _scope ) : refCount(1), scope( _scope ), size( 0 ), base(), … … 76 76 unsigned long size; ///< Number of elements stored in this table 77 77 const Indexer base; ///< Base indexer this extends 78 78 79 79 IdTable idTable; ///< Identifier namespace 80 80 TypeTable typeTable; ///< Type namespace … … 213 213 void Indexer::visit( StructDecl *aggregateDecl ) { 214 214 // make up a forward declaration and add it before processing the members 215 StructDecl fwdDecl( aggregateDecl->get_name() ); 215 // needs to be on the heap because addStruct saves the pointer 216 StructDecl &fwdDecl = *new StructDecl( aggregateDecl->get_name() ); 216 217 cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() ); 217 218 debugPrint( "Adding fwd decl for struct " << fwdDecl.get_name() << std::endl ); 218 219 addStruct( &fwdDecl ); 219 220 220 221 enterScope(); 221 222 acceptAll( aggregateDecl->get_parameters(), *this ); 222 223 acceptAll( aggregateDecl->get_members(), *this ); 223 224 leaveScope(); 224 225 225 226 debugPrint( "Adding struct " << aggregateDecl->get_name() << std::endl ); 226 227 // this addition replaces the forward declaration … … 234 235 debugPrint( "Adding fwd decl for union " << fwdDecl.get_name() << std::endl ); 235 236 addUnion( &fwdDecl ); 236 237 237 238 enterScope(); 238 239 acceptAll( aggregateDecl->get_parameters(), *this ); 239 240 acceptAll( aggregateDecl->get_members(), *this ); 240 241 leaveScope(); 241 242 242 243 debugPrint( "Adding union " << aggregateDecl->get_name() << std::endl ); 243 244 addUnion( aggregateDecl ); … … 256 257 acceptAll( aggregateDecl->get_members(), *this ); 257 258 leaveScope(); 258 259 259 260 debugPrint( "Adding context " << aggregateDecl->get_name() << std::endl ); 260 261 addTrait( aggregateDecl ); … … 344 345 maybeAccept( offsetofExpr->get_type(), *this ); 345 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 ); 346 352 } 347 353 … … 433 439 } 434 440 435 441 436 442 437 443 void Indexer::lookupId( const std::string &id, std::list< DeclarationWithType* > &out ) const { 438 444 std::unordered_set< std::string > foundMangleNames; 439 445 440 446 Indexer::Impl *searchTables = tables; 441 447 while ( searchTables ) { … … 447 453 // mark the mangled name as found, skipping this insertion if a declaration for that name has already been found 448 454 if ( foundMangleNames.insert( decl->first ).second == false ) continue; 449 455 450 456 out.push_back( decl->second ); 451 457 } 452 458 } 453 459 454 460 // get declarations from base indexers 455 461 searchTables = searchTables->base.tables; … … 506 512 } 507 513 508 bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName ) const {514 bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName, unsigned long scope ) const { 509 515 if ( ! tables ) return false; 516 if ( tables->scope < scope ) return false; 510 517 511 518 IdTable::const_iterator decls = tables->idTable.find( id ); … … 513 520 const MangleTable &mangleTable = decls->second; 514 521 for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) { 515 // check for C decls with the same name, skipping 522 // check for C decls with the same name, skipping 516 523 // those with a compatible type (by mangleName) 517 524 if ( decl->second->get_linkage() == LinkageSpec::C && decl->first != mangleName ) return true; … … 519 526 } 520 527 521 return tables->base.hasIncompatibleCDecl( id, mangleName );522 } 523 528 return tables->base.hasIncompatibleCDecl( id, mangleName, scope ); 529 } 530 524 531 NamedTypeDecl *Indexer::lookupTypeAtScope( const std::string &id, unsigned long scope ) const { 525 532 if ( ! tables ) return 0; … … 529 536 return ret != tables->typeTable.end() ? ret->second : tables->base.lookupTypeAtScope( id, scope ); 530 537 } 531 538 532 539 StructDecl *Indexer::lookupStructAtScope( const std::string &id, unsigned long scope ) const { 533 540 if ( ! tables ) return 0; … … 537 544 return ret != tables->structTable.end() ? ret->second : tables->base.lookupStructAtScope( id, scope ); 538 545 } 539 546 540 547 EnumDecl *Indexer::lookupEnumAtScope( const std::string &id, unsigned long scope ) const { 541 548 if ( ! tables ) return 0; … … 545 552 return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnumAtScope( id, scope ); 546 553 } 547 554 548 555 UnionDecl *Indexer::lookupUnionAtScope( const std::string &id, unsigned long scope ) const { 549 556 if ( ! tables ) return 0; … … 553 560 return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnionAtScope( id, scope ); 554 561 } 555 562 556 563 TraitDecl *Indexer::lookupTraitAtScope( const std::string &id, unsigned long scope ) const { 557 564 if ( ! tables ) return 0; … … 596 603 return true; 597 604 } 598 605 599 606 void Indexer::addId( DeclarationWithType *decl ) { 600 607 makeWritable(); … … 612 619 DeclarationWithType *existing = lookupIdAtScope( name, mangleName, scope ); 613 620 if ( ! existing || ! addedIdConflicts( existing, decl ) ) { 614 // this ensures that no two declarations with the same unmangled name both have C linkage615 if ( decl->get_linkage() == LinkageSpec::C && hasIncompatibleCDecl( name, mangleName ) ) {621 // this ensures that no two declarations with the same unmangled name at the same scope both have C linkage 622 if ( decl->get_linkage() == LinkageSpec::C && hasIncompatibleCDecl( name, mangleName, scope ) ) { 616 623 throw SemanticError( "invalid overload of C function ", decl ); 617 } // NOTE this is broken in Richard's original code in such a way that it never triggers (it 618 // doesn't check decls that have the same manglename, and all C-linkage decls are defined to 624 } // NOTE this is broken in Richard's original code in such a way that it never triggers (it 625 // doesn't check decls that have the same manglename, and all C-linkage decls are defined to 619 626 // have their name as their manglename, hence the error can never trigger). 620 // The code here is closer to correct, but name mangling would have to be completely 627 // The code here is closer to correct, but name mangling would have to be completely 621 628 // isomorphic to C type-compatibility, which it may not be. 622 629 623 630 tables->idTable[ name ][ mangleName ] = decl; 624 631 ++tables->size; … … 635 642 } 636 643 } 637 644 638 645 void Indexer::addType( NamedTypeDecl *decl ) { 639 646 makeWritable(); … … 666 673 addStruct( new StructDecl( id ) ); 667 674 } 668 675 669 676 void Indexer::addStruct( StructDecl *decl ) { 670 677 makeWritable(); … … 684 691 } 685 692 } 686 693 687 694 void Indexer::addEnum( EnumDecl *decl ) { 688 695 makeWritable(); … … 706 713 addUnion( new UnionDecl( id ) ); 707 714 } 708 715 709 716 void Indexer::addUnion( UnionDecl *decl ) { 710 717 makeWritable(); … … 724 731 } 725 732 } 726 733 727 734 void Indexer::addTrait( TraitDecl *decl ) { 728 735 makeWritable(); … … 745 752 void Indexer::enterScope() { 746 753 ++scope; 747 754 748 755 if ( doDebug ) { 749 756 std::cout << "--- Entering scope " << scope << std::endl; … … 778 785 using std::cerr; 779 786 780 cerr << "===idTable===" << std::endl; 781 if ( tables ) dump( tables->idTable, os ); 782 cerr << "===typeTable===" << std::endl; 783 if ( tables ) dump( tables->typeTable, os ); 784 cerr << "===structTable===" << std::endl; 785 if ( tables ) dump( tables->structTable, os ); 786 cerr << "===enumTable===" << std::endl; 787 if ( tables ) dump( tables->enumTable, os ); 788 cerr << "===unionTable===" << std::endl; 789 if ( tables ) dump( tables->unionTable, os ); 790 cerr << "===contextTable===" << std::endl; 791 if ( tables ) dump( tables->traitTable, os ); 787 if ( tables ) { 788 os << "--- scope " << tables->scope << " ---" << std::endl; 789 790 os << "===idTable===" << std::endl; 791 dump( tables->idTable, os ); 792 os << "===typeTable===" << std::endl; 793 dump( tables->typeTable, os ); 794 os << "===structTable===" << std::endl; 795 dump( tables->structTable, os ); 796 os << "===enumTable===" << std::endl; 797 dump( tables->enumTable, os ); 798 os << "===unionTable===" << std::endl; 799 dump( tables->unionTable, os ); 800 os << "===contextTable===" << std::endl; 801 dump( tables->traitTable, os ); 802 803 tables->base.print( os, indent ); 804 } else { 805 os << "--- end ---" << std::endl; 806 } 807 792 808 } 793 809 } // namespace SymTab
Note:
See TracChangeset
for help on using the changeset viewer.