[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 | //
|
---|
| 7 | // Indexer.cc --
|
---|
| 8 | //
|
---|
| 9 | // Author : Richard C. Bilson
|
---|
| 10 | // Created On : Sun May 17 21:37:33 2015
|
---|
[4040425] | 11 | // Last Modified By : Peter A. Buhr
|
---|
| 12 | // Last Modified On : Wed Mar 2 17:31:29 2016
|
---|
| 13 | // Update Count : 11
|
---|
[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>
|
---|
| 23 |
|
---|
[bed4c63e] | 24 | #include "Mangler.h"
|
---|
| 25 |
|
---|
| 26 | #include "Common/utility.h"
|
---|
| 27 |
|
---|
| 28 | #include "ResolvExpr/typeops.h"
|
---|
[e8032b0] | 29 |
|
---|
[51b73452] | 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"
|
---|
[e8032b0] | 35 |
|
---|
[17cd4eb] | 36 | #define debugPrint(x) if ( doDebug ) { std::cout << x; }
|
---|
[51b73452] | 37 |
|
---|
| 38 | namespace SymTab {
|
---|
[ae4c85a] | 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 |
|
---|
[bed4c63e] | 46 | typedef std::unordered_map< std::string, DeclarationWithType* > MangleTable;
|
---|
| 47 | typedef std::unordered_map< std::string, MangleTable > IdTable;
|
---|
[52c2a72] | 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 |
|
---|
[bed4c63e] | 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 |
|
---|
[52c2a72] | 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 |
|
---|
[e8032b0] | 69 | struct Indexer::Impl {
|
---|
[52c2a72] | 70 | Impl( unsigned long _scope ) : refCount(1), scope( _scope ), size( 0 ), base(),
|
---|
[e8032b0] | 71 | idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
|
---|
[52c2a72] | 72 | Impl( unsigned long _scope, Indexer &&_base ) : refCount(1), scope( _scope ), size( 0 ), base( _base ),
|
---|
[e8032b0] | 73 | idTable(), typeTable(), structTable(), enumTable(), unionTable(), traitTable() {}
|
---|
| 74 | unsigned long refCount; ///< Number of references to these tables
|
---|
[52c2a72] | 75 | unsigned long scope; ///< Scope these tables are associated with
|
---|
[e8032b0] | 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 ) {
|
---|
[52c2a72] | 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 ) );
|
---|
[e8032b0] | 110 | }
|
---|
| 111 | }
|
---|
| 112 |
|
---|
[52c2a72] | 113 | Indexer::Indexer( bool _doDebug ) : tables( 0 ), scope( 0 ), doDebug( _doDebug ) {}
|
---|
[e8032b0] | 114 |
|
---|
[52c2a72] | 115 | Indexer::Indexer( const Indexer &that ) : tables( newRef( that.tables ) ), scope( that.scope ), doDebug( that.doDebug ) {}
|
---|
[e8032b0] | 116 |
|
---|
[52c2a72] | 117 | Indexer::Indexer( Indexer &&that ) : tables( that.tables ), scope( that.scope ), doDebug( that.doDebug ) {
|
---|
[e8032b0] | 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 );
|
---|
[52c2a72] | 129 | scope = that.scope;
|
---|
[e8032b0] | 130 | doDebug = that.doDebug;
|
---|
| 131 |
|
---|
| 132 | return *this;
|
---|
| 133 | }
|
---|
| 134 |
|
---|
| 135 | Indexer& Indexer::operator= ( Indexer &&that ) {
|
---|
| 136 | deleteRef( tables );
|
---|
| 137 |
|
---|
| 138 | tables = that.tables;
|
---|
[52c2a72] | 139 | scope = that.scope;
|
---|
[e8032b0] | 140 | doDebug = that.doDebug;
|
---|
[17cd4eb] | 141 |
|
---|
[e8032b0] | 142 | that.tables = 0;
|
---|
| 143 |
|
---|
| 144 | return *this;
|
---|
| 145 | }
|
---|
[17cd4eb] | 146 |
|
---|
[a08ba92] | 147 | void Indexer::visit( ObjectDecl *objectDecl ) {
|
---|
[ae4c85a] | 148 | enterScope();
|
---|
[0dd3a2f] | 149 | maybeAccept( objectDecl->get_type(), *this );
|
---|
[ae4c85a] | 150 | leaveScope();
|
---|
[0dd3a2f] | 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 );
|
---|
[e8032b0] | 155 | addId( objectDecl );
|
---|
[0dd3a2f] | 156 | } // if
|
---|
[a08ba92] | 157 | }
|
---|
[17cd4eb] | 158 |
|
---|
[a08ba92] | 159 | void Indexer::visit( FunctionDecl *functionDecl ) {
|
---|
[0dd3a2f] | 160 | if ( functionDecl->get_name() == "" ) return;
|
---|
| 161 | debugPrint( "Adding function " << functionDecl->get_name() << std::endl );
|
---|
[e8032b0] | 162 | addId( functionDecl );
|
---|
[0dd3a2f] | 163 | enterScope();
|
---|
| 164 | maybeAccept( functionDecl->get_functionType(), *this );
|
---|
| 165 | acceptAll( functionDecl->get_oldDecls(), *this );
|
---|
| 166 | maybeAccept( functionDecl->get_statements(), *this );
|
---|
| 167 | leaveScope();
|
---|
[a08ba92] | 168 | }
|
---|
[51b73452] | 169 |
|
---|
[44b5ca0] | 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 |
|
---|
[51b73452] | 190 |
|
---|
[a08ba92] | 191 | void Indexer::visit( TypeDecl *typeDecl ) {
|
---|
[0dd3a2f] | 192 | // see A NOTE ON THE ORDER OF TRAVERSAL, above
|
---|
[44b5ca0] | 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
|
---|
[0dd3a2f] | 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 );
|
---|
[e8032b0] | 200 | addType( typeDecl );
|
---|
[0dd3a2f] | 201 | acceptAll( typeDecl->get_assertions(), *this );
|
---|
[a08ba92] | 202 | }
|
---|
[17cd4eb] | 203 |
|
---|
[a08ba92] | 204 | void Indexer::visit( TypedefDecl *typeDecl ) {
|
---|
[0dd3a2f] | 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 );
|
---|
[e8032b0] | 210 | addType( typeDecl );
|
---|
[a08ba92] | 211 | }
|
---|
[17cd4eb] | 212 |
|
---|
[a08ba92] | 213 | void Indexer::visit( StructDecl *aggregateDecl ) {
|
---|
[0dd3a2f] | 214 | // make up a forward declaration and add it before processing the members
|
---|
| 215 | StructDecl fwdDecl( aggregateDecl->get_name() );
|
---|
| 216 | cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() );
|
---|
| 217 | debugPrint( "Adding fwd decl for struct " << fwdDecl.get_name() << std::endl );
|
---|
[e8032b0] | 218 | addStruct( &fwdDecl );
|
---|
[51b73452] | 219 |
|
---|
[0dd3a2f] | 220 | enterScope();
|
---|
| 221 | acceptAll( aggregateDecl->get_parameters(), *this );
|
---|
| 222 | acceptAll( aggregateDecl->get_members(), *this );
|
---|
| 223 | leaveScope();
|
---|
[51b73452] | 224 |
|
---|
[0dd3a2f] | 225 | debugPrint( "Adding struct " << aggregateDecl->get_name() << std::endl );
|
---|
| 226 | // this addition replaces the forward declaration
|
---|
[e8032b0] | 227 | addStruct( aggregateDecl );
|
---|
[a08ba92] | 228 | }
|
---|
[17cd4eb] | 229 |
|
---|
[a08ba92] | 230 | void Indexer::visit( UnionDecl *aggregateDecl ) {
|
---|
[0dd3a2f] | 231 | // make up a forward declaration and add it before processing the members
|
---|
| 232 | UnionDecl fwdDecl( aggregateDecl->get_name() );
|
---|
| 233 | cloneAll( aggregateDecl->get_parameters(), fwdDecl.get_parameters() );
|
---|
| 234 | debugPrint( "Adding fwd decl for union " << fwdDecl.get_name() << std::endl );
|
---|
[e8032b0] | 235 | addUnion( &fwdDecl );
|
---|
[51b73452] | 236 |
|
---|
[0dd3a2f] | 237 | enterScope();
|
---|
| 238 | acceptAll( aggregateDecl->get_parameters(), *this );
|
---|
| 239 | acceptAll( aggregateDecl->get_members(), *this );
|
---|
| 240 | leaveScope();
|
---|
[51b73452] | 241 |
|
---|
[0dd3a2f] | 242 | debugPrint( "Adding union " << aggregateDecl->get_name() << std::endl );
|
---|
[e8032b0] | 243 | addUnion( aggregateDecl );
|
---|
[a08ba92] | 244 | }
|
---|
[17cd4eb] | 245 |
|
---|
[a08ba92] | 246 | void Indexer::visit( EnumDecl *aggregateDecl ) {
|
---|
[0dd3a2f] | 247 | debugPrint( "Adding enum " << aggregateDecl->get_name() << std::endl );
|
---|
[e8032b0] | 248 | addEnum( aggregateDecl );
|
---|
[0dd3a2f] | 249 | // unlike structs, contexts, and unions, enums inject their members into the global scope
|
---|
| 250 | acceptAll( aggregateDecl->get_members(), *this );
|
---|
[a08ba92] | 251 | }
|
---|
[17cd4eb] | 252 |
|
---|
[4040425] | 253 | void Indexer::visit( TraitDecl *aggregateDecl ) {
|
---|
[0dd3a2f] | 254 | enterScope();
|
---|
| 255 | acceptAll( aggregateDecl->get_parameters(), *this );
|
---|
| 256 | acceptAll( aggregateDecl->get_members(), *this );
|
---|
| 257 | leaveScope();
|
---|
[51b73452] | 258 |
|
---|
[0dd3a2f] | 259 | debugPrint( "Adding context " << aggregateDecl->get_name() << std::endl );
|
---|
[e8032b0] | 260 | addTrait( aggregateDecl );
|
---|
[a08ba92] | 261 | }
|
---|
[17cd4eb] | 262 |
|
---|
[a08ba92] | 263 | void Indexer::visit( CompoundStmt *compoundStmt ) {
|
---|
[0dd3a2f] | 264 | enterScope();
|
---|
| 265 | acceptAll( compoundStmt->get_kids(), *this );
|
---|
| 266 | leaveScope();
|
---|
[a08ba92] | 267 | }
|
---|
[17cd4eb] | 268 |
|
---|
[ae4c85a] | 269 |
|
---|
| 270 | void Indexer::visit( ApplicationExpr *applicationExpr ) {
|
---|
| 271 | acceptAllNewScope( applicationExpr->get_results(), *this );
|
---|
| 272 | maybeAccept( applicationExpr->get_function(), *this );
|
---|
| 273 | acceptAll( applicationExpr->get_args(), *this );
|
---|
| 274 | }
|
---|
| 275 |
|
---|
| 276 | void Indexer::visit( UntypedExpr *untypedExpr ) {
|
---|
| 277 | acceptAllNewScope( untypedExpr->get_results(), *this );
|
---|
| 278 | acceptAll( untypedExpr->get_args(), *this );
|
---|
| 279 | }
|
---|
| 280 |
|
---|
| 281 | void Indexer::visit( NameExpr *nameExpr ) {
|
---|
| 282 | acceptAllNewScope( nameExpr->get_results(), *this );
|
---|
| 283 | }
|
---|
| 284 |
|
---|
| 285 | void Indexer::visit( AddressExpr *addressExpr ) {
|
---|
| 286 | acceptAllNewScope( addressExpr->get_results(), *this );
|
---|
| 287 | maybeAccept( addressExpr->get_arg(), *this );
|
---|
| 288 | }
|
---|
| 289 |
|
---|
| 290 | void Indexer::visit( LabelAddressExpr *labAddressExpr ) {
|
---|
| 291 | acceptAllNewScope( labAddressExpr->get_results(), *this );
|
---|
| 292 | maybeAccept( labAddressExpr->get_arg(), *this );
|
---|
| 293 | }
|
---|
| 294 |
|
---|
| 295 | void Indexer::visit( CastExpr *castExpr ) {
|
---|
| 296 | acceptAllNewScope( castExpr->get_results(), *this );
|
---|
| 297 | maybeAccept( castExpr->get_arg(), *this );
|
---|
| 298 | }
|
---|
| 299 |
|
---|
| 300 | void Indexer::visit( UntypedMemberExpr *memberExpr ) {
|
---|
| 301 | acceptAllNewScope( memberExpr->get_results(), *this );
|
---|
| 302 | maybeAccept( memberExpr->get_aggregate(), *this );
|
---|
| 303 | }
|
---|
| 304 |
|
---|
| 305 | void Indexer::visit( MemberExpr *memberExpr ) {
|
---|
| 306 | acceptAllNewScope( memberExpr->get_results(), *this );
|
---|
| 307 | maybeAccept( memberExpr->get_aggregate(), *this );
|
---|
| 308 | }
|
---|
| 309 |
|
---|
| 310 | void Indexer::visit( VariableExpr *variableExpr ) {
|
---|
| 311 | acceptAllNewScope( variableExpr->get_results(), *this );
|
---|
| 312 | }
|
---|
| 313 |
|
---|
| 314 | void Indexer::visit( ConstantExpr *constantExpr ) {
|
---|
| 315 | acceptAllNewScope( constantExpr->get_results(), *this );
|
---|
| 316 | maybeAccept( constantExpr->get_constant(), *this );
|
---|
| 317 | }
|
---|
| 318 |
|
---|
| 319 | void Indexer::visit( SizeofExpr *sizeofExpr ) {
|
---|
| 320 | acceptAllNewScope( sizeofExpr->get_results(), *this );
|
---|
| 321 | if ( sizeofExpr->get_isType() ) {
|
---|
| 322 | maybeAccept( sizeofExpr->get_type(), *this );
|
---|
| 323 | } else {
|
---|
| 324 | maybeAccept( sizeofExpr->get_expr(), *this );
|
---|
| 325 | }
|
---|
| 326 | }
|
---|
| 327 |
|
---|
[47534159] | 328 | void Indexer::visit( AlignofExpr *alignofExpr ) {
|
---|
| 329 | acceptAllNewScope( alignofExpr->get_results(), *this );
|
---|
| 330 | if ( alignofExpr->get_isType() ) {
|
---|
| 331 | maybeAccept( alignofExpr->get_type(), *this );
|
---|
| 332 | } else {
|
---|
| 333 | maybeAccept( alignofExpr->get_expr(), *this );
|
---|
| 334 | }
|
---|
| 335 | }
|
---|
| 336 |
|
---|
[2a4b088] | 337 | void Indexer::visit( UntypedOffsetofExpr *offsetofExpr ) {
|
---|
| 338 | acceptAllNewScope( offsetofExpr->get_results(), *this );
|
---|
| 339 | maybeAccept( offsetofExpr->get_type(), *this );
|
---|
| 340 | }
|
---|
| 341 |
|
---|
[25a054f] | 342 | void Indexer::visit( OffsetofExpr *offsetofExpr ) {
|
---|
| 343 | acceptAllNewScope( offsetofExpr->get_results(), *this );
|
---|
| 344 | maybeAccept( offsetofExpr->get_type(), *this );
|
---|
| 345 | maybeAccept( offsetofExpr->get_member(), *this );
|
---|
| 346 | }
|
---|
| 347 |
|
---|
[afc1045] | 348 | void Indexer::visit( OffsetPackExpr *offsetPackExpr ) {
|
---|
| 349 | acceptAllNewScope( offsetPackExpr->get_results(), *this );
|
---|
| 350 | maybeAccept( offsetPackExpr->get_type(), *this );
|
---|
| 351 | }
|
---|
| 352 |
|
---|
[ae4c85a] | 353 | void Indexer::visit( AttrExpr *attrExpr ) {
|
---|
| 354 | acceptAllNewScope( attrExpr->get_results(), *this );
|
---|
| 355 | if ( attrExpr->get_isType() ) {
|
---|
| 356 | maybeAccept( attrExpr->get_type(), *this );
|
---|
| 357 | } else {
|
---|
| 358 | maybeAccept( attrExpr->get_expr(), *this );
|
---|
| 359 | }
|
---|
| 360 | }
|
---|
| 361 |
|
---|
| 362 | void Indexer::visit( LogicalExpr *logicalExpr ) {
|
---|
| 363 | acceptAllNewScope( logicalExpr->get_results(), *this );
|
---|
| 364 | maybeAccept( logicalExpr->get_arg1(), *this );
|
---|
| 365 | maybeAccept( logicalExpr->get_arg2(), *this );
|
---|
| 366 | }
|
---|
| 367 |
|
---|
| 368 | void Indexer::visit( ConditionalExpr *conditionalExpr ) {
|
---|
| 369 | acceptAllNewScope( conditionalExpr->get_results(), *this );
|
---|
| 370 | maybeAccept( conditionalExpr->get_arg1(), *this );
|
---|
| 371 | maybeAccept( conditionalExpr->get_arg2(), *this );
|
---|
| 372 | maybeAccept( conditionalExpr->get_arg3(), *this );
|
---|
| 373 | }
|
---|
| 374 |
|
---|
| 375 | void Indexer::visit( CommaExpr *commaExpr ) {
|
---|
| 376 | acceptAllNewScope( commaExpr->get_results(), *this );
|
---|
| 377 | maybeAccept( commaExpr->get_arg1(), *this );
|
---|
| 378 | maybeAccept( commaExpr->get_arg2(), *this );
|
---|
| 379 | }
|
---|
| 380 |
|
---|
| 381 | void Indexer::visit( TupleExpr *tupleExpr ) {
|
---|
| 382 | acceptAllNewScope( tupleExpr->get_results(), *this );
|
---|
| 383 | acceptAll( tupleExpr->get_exprs(), *this );
|
---|
| 384 | }
|
---|
| 385 |
|
---|
| 386 | void Indexer::visit( SolvedTupleExpr *tupleExpr ) {
|
---|
| 387 | acceptAllNewScope( tupleExpr->get_results(), *this );
|
---|
| 388 | acceptAll( tupleExpr->get_exprs(), *this );
|
---|
| 389 | }
|
---|
| 390 |
|
---|
| 391 | void Indexer::visit( TypeExpr *typeExpr ) {
|
---|
| 392 | acceptAllNewScope( typeExpr->get_results(), *this );
|
---|
| 393 | maybeAccept( typeExpr->get_type(), *this );
|
---|
| 394 | }
|
---|
| 395 |
|
---|
| 396 | void Indexer::visit( AsmExpr *asmExpr ) {
|
---|
| 397 | maybeAccept( asmExpr->get_inout(), *this );
|
---|
| 398 | maybeAccept( asmExpr->get_constraint(), *this );
|
---|
| 399 | maybeAccept( asmExpr->get_operand(), *this );
|
---|
| 400 | }
|
---|
| 401 |
|
---|
| 402 | void Indexer::visit( UntypedValofExpr *valofExpr ) {
|
---|
| 403 | acceptAllNewScope( valofExpr->get_results(), *this );
|
---|
| 404 | maybeAccept( valofExpr->get_body(), *this );
|
---|
| 405 | }
|
---|
| 406 |
|
---|
| 407 |
|
---|
[4040425] | 408 | void Indexer::visit( TraitInstType *contextInst ) {
|
---|
[0dd3a2f] | 409 | acceptAll( contextInst->get_parameters(), *this );
|
---|
| 410 | acceptAll( contextInst->get_members(), *this );
|
---|
[a08ba92] | 411 | }
|
---|
[17cd4eb] | 412 |
|
---|
[a08ba92] | 413 | void Indexer::visit( StructInstType *structInst ) {
|
---|
[e8032b0] | 414 | if ( ! lookupStruct( structInst->get_name() ) ) {
|
---|
[0dd3a2f] | 415 | debugPrint( "Adding struct " << structInst->get_name() << " from implicit forward declaration" << std::endl );
|
---|
[e8032b0] | 416 | addStruct( structInst->get_name() );
|
---|
[0dd3a2f] | 417 | }
|
---|
| 418 | enterScope();
|
---|
| 419 | acceptAll( structInst->get_parameters(), *this );
|
---|
| 420 | leaveScope();
|
---|
[a08ba92] | 421 | }
|
---|
[17cd4eb] | 422 |
|
---|
[a08ba92] | 423 | void Indexer::visit( UnionInstType *unionInst ) {
|
---|
[e8032b0] | 424 | if ( ! lookupUnion( unionInst->get_name() ) ) {
|
---|
[0dd3a2f] | 425 | debugPrint( "Adding union " << unionInst->get_name() << " from implicit forward declaration" << std::endl );
|
---|
[e8032b0] | 426 | addUnion( unionInst->get_name() );
|
---|
[0dd3a2f] | 427 | }
|
---|
| 428 | enterScope();
|
---|
| 429 | acceptAll( unionInst->get_parameters(), *this );
|
---|
| 430 | leaveScope();
|
---|
[a08ba92] | 431 | }
|
---|
[17cd4eb] | 432 |
|
---|
[a08ba92] | 433 | void Indexer::visit( ForStmt *forStmt ) {
|
---|
| 434 | // for statements introduce a level of scope
|
---|
| 435 | enterScope();
|
---|
| 436 | Visitor::visit( forStmt );
|
---|
| 437 | leaveScope();
|
---|
| 438 | }
|
---|
[d4778a6] | 439 |
|
---|
[bed4c63e] | 440 |
|
---|
[d4778a6] | 441 |
|
---|
[bed4c63e] | 442 | void Indexer::lookupId( const std::string &id, std::list< DeclarationWithType* > &out ) const {
|
---|
[5447e09] | 443 | std::unordered_set< std::string > foundMangleNames;
|
---|
| 444 |
|
---|
| 445 | Indexer::Impl *searchTables = tables;
|
---|
| 446 | while ( searchTables ) {
|
---|
| 447 |
|
---|
| 448 | IdTable::const_iterator decls = searchTables->idTable.find( id );
|
---|
| 449 | if ( decls != searchTables->idTable.end() ) {
|
---|
| 450 | const MangleTable &mangleTable = decls->second;
|
---|
| 451 | for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
|
---|
| 452 | // mark the mangled name as found, skipping this insertion if a declaration for that name has already been found
|
---|
| 453 | if ( foundMangleNames.insert( decl->first ).second == false ) continue;
|
---|
| 454 |
|
---|
| 455 | out.push_back( decl->second );
|
---|
| 456 | }
|
---|
[bed4c63e] | 457 | }
|
---|
[5447e09] | 458 |
|
---|
| 459 | // get declarations from base indexers
|
---|
| 460 | searchTables = searchTables->base.tables;
|
---|
[bed4c63e] | 461 | }
|
---|
[a08ba92] | 462 | }
|
---|
[bdd516a] | 463 |
|
---|
[a08ba92] | 464 | NamedTypeDecl *Indexer::lookupType( const std::string &id ) const {
|
---|
[e8032b0] | 465 | if ( ! tables ) return 0;
|
---|
| 466 |
|
---|
[52c2a72] | 467 | TypeTable::const_iterator ret = tables->typeTable.find( id );
|
---|
| 468 | return ret != tables->typeTable.end() ? ret->second : tables->base.lookupType( id );
|
---|
[a08ba92] | 469 | }
|
---|
[17cd4eb] | 470 |
|
---|
[a08ba92] | 471 | StructDecl *Indexer::lookupStruct( const std::string &id ) const {
|
---|
[e8032b0] | 472 | if ( ! tables ) return 0;
|
---|
| 473 |
|
---|
[52c2a72] | 474 | StructTable::const_iterator ret = tables->structTable.find( id );
|
---|
| 475 | return ret != tables->structTable.end() ? ret->second : tables->base.lookupStruct( id );
|
---|
[a08ba92] | 476 | }
|
---|
[17cd4eb] | 477 |
|
---|
[a08ba92] | 478 | EnumDecl *Indexer::lookupEnum( const std::string &id ) const {
|
---|
[e8032b0] | 479 | if ( ! tables ) return 0;
|
---|
| 480 |
|
---|
[52c2a72] | 481 | EnumTable::const_iterator ret = tables->enumTable.find( id );
|
---|
| 482 | return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnum( id );
|
---|
[a08ba92] | 483 | }
|
---|
[17cd4eb] | 484 |
|
---|
[a08ba92] | 485 | UnionDecl *Indexer::lookupUnion( const std::string &id ) const {
|
---|
[e8032b0] | 486 | if ( ! tables ) return 0;
|
---|
| 487 |
|
---|
[52c2a72] | 488 | UnionTable::const_iterator ret = tables->unionTable.find( id );
|
---|
| 489 | return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnion( id );
|
---|
[e8032b0] | 490 | }
|
---|
| 491 |
|
---|
| 492 | TraitDecl *Indexer::lookupTrait( const std::string &id ) const {
|
---|
| 493 | if ( ! tables ) return 0;
|
---|
| 494 |
|
---|
[52c2a72] | 495 | TraitTable::const_iterator ret = tables->traitTable.find( id );
|
---|
| 496 | return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTrait( id );
|
---|
| 497 | }
|
---|
| 498 |
|
---|
[bed4c63e] | 499 | DeclarationWithType *Indexer::lookupIdAtScope( const std::string &id, const std::string &mangleName, unsigned long scope ) const {
|
---|
| 500 | if ( ! tables ) return 0;
|
---|
| 501 | if ( tables->scope < scope ) return 0;
|
---|
| 502 |
|
---|
| 503 | IdTable::const_iterator decls = tables->idTable.find( id );
|
---|
| 504 | if ( decls != tables->idTable.end() ) {
|
---|
| 505 | const MangleTable &mangleTable = decls->second;
|
---|
| 506 | MangleTable::const_iterator decl = mangleTable.find( mangleName );
|
---|
| 507 | if ( decl != mangleTable.end() ) return decl->second;
|
---|
| 508 | }
|
---|
| 509 |
|
---|
| 510 | return tables->base.lookupIdAtScope( id, mangleName, scope );
|
---|
| 511 | }
|
---|
| 512 |
|
---|
[5447e09] | 513 | bool Indexer::hasIncompatibleCDecl( const std::string &id, const std::string &mangleName ) const {
|
---|
[bed4c63e] | 514 | if ( ! tables ) return false;
|
---|
| 515 |
|
---|
| 516 | IdTable::const_iterator decls = tables->idTable.find( id );
|
---|
| 517 | if ( decls != tables->idTable.end() ) {
|
---|
| 518 | const MangleTable &mangleTable = decls->second;
|
---|
| 519 | for ( MangleTable::const_iterator decl = mangleTable.begin(); decl != mangleTable.end(); ++decl ) {
|
---|
[5447e09] | 520 | // check for C decls with the same name, skipping
|
---|
| 521 | // those with a compatible type (by mangleName)
|
---|
| 522 | if ( decl->second->get_linkage() == LinkageSpec::C && decl->first != mangleName ) return true;
|
---|
[bed4c63e] | 523 | }
|
---|
| 524 | }
|
---|
| 525 |
|
---|
[5447e09] | 526 | return tables->base.hasIncompatibleCDecl( id, mangleName );
|
---|
[bed4c63e] | 527 | }
|
---|
| 528 |
|
---|
[52c2a72] | 529 | NamedTypeDecl *Indexer::lookupTypeAtScope( const std::string &id, unsigned long scope ) const {
|
---|
| 530 | if ( ! tables ) return 0;
|
---|
| 531 | if ( tables->scope < scope ) return 0;
|
---|
| 532 |
|
---|
| 533 | TypeTable::const_iterator ret = tables->typeTable.find( id );
|
---|
| 534 | return ret != tables->typeTable.end() ? ret->second : tables->base.lookupTypeAtScope( id, scope );
|
---|
| 535 | }
|
---|
| 536 |
|
---|
| 537 | StructDecl *Indexer::lookupStructAtScope( const std::string &id, unsigned long scope ) const {
|
---|
| 538 | if ( ! tables ) return 0;
|
---|
| 539 | if ( tables->scope < scope ) return 0;
|
---|
| 540 |
|
---|
| 541 | StructTable::const_iterator ret = tables->structTable.find( id );
|
---|
| 542 | return ret != tables->structTable.end() ? ret->second : tables->base.lookupStructAtScope( id, scope );
|
---|
| 543 | }
|
---|
| 544 |
|
---|
| 545 | EnumDecl *Indexer::lookupEnumAtScope( const std::string &id, unsigned long scope ) const {
|
---|
| 546 | if ( ! tables ) return 0;
|
---|
| 547 | if ( tables->scope < scope ) return 0;
|
---|
| 548 |
|
---|
| 549 | EnumTable::const_iterator ret = tables->enumTable.find( id );
|
---|
| 550 | return ret != tables->enumTable.end() ? ret->second : tables->base.lookupEnumAtScope( id, scope );
|
---|
| 551 | }
|
---|
| 552 |
|
---|
| 553 | UnionDecl *Indexer::lookupUnionAtScope( const std::string &id, unsigned long scope ) const {
|
---|
| 554 | if ( ! tables ) return 0;
|
---|
| 555 | if ( tables->scope < scope ) return 0;
|
---|
| 556 |
|
---|
| 557 | UnionTable::const_iterator ret = tables->unionTable.find( id );
|
---|
| 558 | return ret != tables->unionTable.end() ? ret->second : tables->base.lookupUnionAtScope( id, scope );
|
---|
| 559 | }
|
---|
| 560 |
|
---|
| 561 | TraitDecl *Indexer::lookupTraitAtScope( const std::string &id, unsigned long scope ) const {
|
---|
| 562 | if ( ! tables ) return 0;
|
---|
| 563 | if ( tables->scope < scope ) return 0;
|
---|
| 564 |
|
---|
| 565 | TraitTable::const_iterator ret = tables->traitTable.find( id );
|
---|
| 566 | return ret != tables->traitTable.end() ? ret->second : tables->base.lookupTraitAtScope( id, scope );
|
---|
[a08ba92] | 567 | }
|
---|
[17cd4eb] | 568 |
|
---|
[bed4c63e] | 569 | bool addedIdConflicts( DeclarationWithType *existing, DeclarationWithType *added ) {
|
---|
| 570 | // if we're giving the same name mangling to things of different types then there is something wrong
|
---|
| 571 | assert( (dynamic_cast<ObjectDecl*>( added ) && dynamic_cast<ObjectDecl*>( existing ) )
|
---|
| 572 | || (dynamic_cast<FunctionDecl*>( added ) && dynamic_cast<FunctionDecl*>( existing ) ) );
|
---|
| 573 |
|
---|
| 574 | if ( LinkageSpec::isOverridable( existing->get_linkage() ) ) {
|
---|
| 575 | // new definition shadows the autogenerated one, even at the same scope
|
---|
| 576 | return false;
|
---|
| 577 | } else if ( added->get_linkage() != LinkageSpec::C || ResolvExpr::typesCompatible( added->get_type(), existing->get_type(), Indexer() ) ) {
|
---|
| 578 | // typesCompatible doesn't really do the right thing here. When checking compatibility of function types,
|
---|
| 579 | // we should ignore outermost pointer qualifiers, except _Atomic?
|
---|
| 580 | FunctionDecl *newentry = dynamic_cast< FunctionDecl* >( added );
|
---|
| 581 | FunctionDecl *oldentry = dynamic_cast< FunctionDecl* >( existing );
|
---|
| 582 | if ( newentry && oldentry ) {
|
---|
| 583 | if ( newentry->get_statements() && oldentry->get_statements() ) {
|
---|
| 584 | throw SemanticError( "duplicate function definition for ", added );
|
---|
| 585 | } // if
|
---|
| 586 | } else {
|
---|
| 587 | // two objects with the same mangled name defined in the same scope.
|
---|
| 588 | // both objects must be marked extern or both must be intrinsic for this to be okay
|
---|
| 589 | // xxx - perhaps it's actually if either is intrinsic then this is okay?
|
---|
| 590 | // might also need to be same storage class?
|
---|
| 591 | ObjectDecl *newobj = dynamic_cast< ObjectDecl* >( added );
|
---|
| 592 | ObjectDecl *oldobj = dynamic_cast< ObjectDecl* >( existing );
|
---|
| 593 | if ( newobj->get_storageClass() != DeclarationNode::Extern && oldobj->get_storageClass() != DeclarationNode::Extern ) {
|
---|
| 594 | throw SemanticError( "duplicate object definition for ", added );
|
---|
| 595 | } // if
|
---|
| 596 | } // if
|
---|
| 597 | } else {
|
---|
| 598 | throw SemanticError( "duplicate definition for ", added );
|
---|
| 599 | } // if
|
---|
| 600 |
|
---|
| 601 | return true;
|
---|
| 602 | }
|
---|
| 603 |
|
---|
[e8032b0] | 604 | void Indexer::addId( DeclarationWithType *decl ) {
|
---|
| 605 | makeWritable();
|
---|
[bed4c63e] | 606 |
|
---|
| 607 | const std::string &name = decl->get_name();
|
---|
| 608 | std::string mangleName;
|
---|
[6a57da5] | 609 | if ( LinkageSpec::isOverridable( decl->get_linkage() ) ) {
|
---|
[bed4c63e] | 610 | // mangle the name without including the appropriate suffix, so overridable routines are placed into the
|
---|
| 611 | // same "bucket" as their user defined versions.
|
---|
| 612 | mangleName = Mangler::mangle( decl, false );
|
---|
| 613 | } else {
|
---|
| 614 | mangleName = Mangler::mangle( decl );
|
---|
| 615 | } // if
|
---|
| 616 |
|
---|
| 617 | DeclarationWithType *existing = lookupIdAtScope( name, mangleName, scope );
|
---|
| 618 | if ( ! existing || ! addedIdConflicts( existing, decl ) ) {
|
---|
| 619 | // this ensures that no two declarations with the same unmangled name both have C linkage
|
---|
[5447e09] | 620 | if ( decl->get_linkage() == LinkageSpec::C && hasIncompatibleCDecl( name, mangleName ) ) {
|
---|
[bed4c63e] | 621 | throw SemanticError( "invalid overload of C function ", decl );
|
---|
[5447e09] | 622 | } // NOTE this is broken in Richard's original code in such a way that it never triggers (it
|
---|
| 623 | // doesn't check decls that have the same manglename, and all C-linkage decls are defined to
|
---|
| 624 | // have their name as their manglename, hence the error can never trigger).
|
---|
[6a57da5] | 625 | // The code here is closer to correct, but name mangling would have to be completely
|
---|
[5447e09] | 626 | // isomorphic to C type-compatibility, which it may not be.
|
---|
[bed4c63e] | 627 |
|
---|
| 628 | tables->idTable[ name ][ mangleName ] = decl;
|
---|
| 629 | ++tables->size;
|
---|
| 630 | }
|
---|
[e8032b0] | 631 | }
|
---|
[52c2a72] | 632 |
|
---|
| 633 | bool addedTypeConflicts( NamedTypeDecl *existing, NamedTypeDecl *added ) {
|
---|
| 634 | if ( existing->get_base() == 0 ) {
|
---|
| 635 | return false;
|
---|
| 636 | } else if ( added->get_base() == 0 ) {
|
---|
| 637 | return true;
|
---|
| 638 | } else {
|
---|
| 639 | throw SemanticError( "redeclaration of ", added );
|
---|
| 640 | }
|
---|
| 641 | }
|
---|
[e8032b0] | 642 |
|
---|
| 643 | void Indexer::addType( NamedTypeDecl *decl ) {
|
---|
| 644 | makeWritable();
|
---|
[52c2a72] | 645 |
|
---|
| 646 | const std::string &id = decl->get_name();
|
---|
| 647 | TypeTable::iterator existing = tables->typeTable.find( id );
|
---|
| 648 | if ( existing == tables->typeTable.end() ) {
|
---|
| 649 | NamedTypeDecl *parent = tables->base.lookupTypeAtScope( id, scope );
|
---|
| 650 | if ( ! parent || ! addedTypeConflicts( parent, decl ) ) {
|
---|
| 651 | tables->typeTable.insert( existing, std::make_pair( id, decl ) );
|
---|
| 652 | ++tables->size;
|
---|
| 653 | }
|
---|
| 654 | } else {
|
---|
| 655 | if ( ! addedTypeConflicts( existing->second, decl ) ) {
|
---|
| 656 | existing->second = decl;
|
---|
| 657 | }
|
---|
| 658 | }
|
---|
| 659 | }
|
---|
| 660 |
|
---|
| 661 | bool addedDeclConflicts( AggregateDecl *existing, AggregateDecl *added ) {
|
---|
| 662 | if ( existing->get_members().empty() ) {
|
---|
| 663 | return false;
|
---|
| 664 | } else if ( ! added->get_members().empty() ) {
|
---|
| 665 | throw SemanticError( "redeclaration of ", added );
|
---|
| 666 | } // if
|
---|
| 667 | return true;
|
---|
[e8032b0] | 668 | }
|
---|
| 669 |
|
---|
| 670 | void Indexer::addStruct( const std::string &id ) {
|
---|
[52c2a72] | 671 | addStruct( new StructDecl( id ) );
|
---|
[e8032b0] | 672 | }
|
---|
| 673 |
|
---|
| 674 | void Indexer::addStruct( StructDecl *decl ) {
|
---|
| 675 | makeWritable();
|
---|
[52c2a72] | 676 |
|
---|
| 677 | const std::string &id = decl->get_name();
|
---|
| 678 | StructTable::iterator existing = tables->structTable.find( id );
|
---|
| 679 | if ( existing == tables->structTable.end() ) {
|
---|
| 680 | StructDecl *parent = tables->base.lookupStructAtScope( id, scope );
|
---|
| 681 | if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
|
---|
| 682 | tables->structTable.insert( existing, std::make_pair( id, decl ) );
|
---|
| 683 | ++tables->size;
|
---|
| 684 | }
|
---|
| 685 | } else {
|
---|
| 686 | if ( ! addedDeclConflicts( existing->second, decl ) ) {
|
---|
| 687 | existing->second = decl;
|
---|
| 688 | }
|
---|
| 689 | }
|
---|
[e8032b0] | 690 | }
|
---|
| 691 |
|
---|
| 692 | void Indexer::addEnum( EnumDecl *decl ) {
|
---|
| 693 | makeWritable();
|
---|
[52c2a72] | 694 |
|
---|
| 695 | const std::string &id = decl->get_name();
|
---|
| 696 | EnumTable::iterator existing = tables->enumTable.find( id );
|
---|
| 697 | if ( existing == tables->enumTable.end() ) {
|
---|
| 698 | EnumDecl *parent = tables->base.lookupEnumAtScope( id, scope );
|
---|
| 699 | if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
|
---|
| 700 | tables->enumTable.insert( existing, std::make_pair( id, decl ) );
|
---|
| 701 | ++tables->size;
|
---|
| 702 | }
|
---|
| 703 | } else {
|
---|
| 704 | if ( ! addedDeclConflicts( existing->second, decl ) ) {
|
---|
| 705 | existing->second = decl;
|
---|
| 706 | }
|
---|
| 707 | }
|
---|
[e8032b0] | 708 | }
|
---|
| 709 |
|
---|
| 710 | void Indexer::addUnion( const std::string &id ) {
|
---|
[52c2a72] | 711 | addUnion( new UnionDecl( id ) );
|
---|
[e8032b0] | 712 | }
|
---|
| 713 |
|
---|
| 714 | void Indexer::addUnion( UnionDecl *decl ) {
|
---|
| 715 | makeWritable();
|
---|
[52c2a72] | 716 |
|
---|
| 717 | const std::string &id = decl->get_name();
|
---|
| 718 | UnionTable::iterator existing = tables->unionTable.find( id );
|
---|
| 719 | if ( existing == tables->unionTable.end() ) {
|
---|
| 720 | UnionDecl *parent = tables->base.lookupUnionAtScope( id, scope );
|
---|
| 721 | if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
|
---|
| 722 | tables->unionTable.insert( existing, std::make_pair( id, decl ) );
|
---|
| 723 | ++tables->size;
|
---|
| 724 | }
|
---|
| 725 | } else {
|
---|
| 726 | if ( ! addedDeclConflicts( existing->second, decl ) ) {
|
---|
| 727 | existing->second = decl;
|
---|
| 728 | }
|
---|
| 729 | }
|
---|
[e8032b0] | 730 | }
|
---|
| 731 |
|
---|
| 732 | void Indexer::addTrait( TraitDecl *decl ) {
|
---|
| 733 | makeWritable();
|
---|
[52c2a72] | 734 |
|
---|
| 735 | const std::string &id = decl->get_name();
|
---|
| 736 | TraitTable::iterator existing = tables->traitTable.find( id );
|
---|
| 737 | if ( existing == tables->traitTable.end() ) {
|
---|
| 738 | TraitDecl *parent = tables->base.lookupTraitAtScope( id, scope );
|
---|
| 739 | if ( ! parent || ! addedDeclConflicts( parent, decl ) ) {
|
---|
| 740 | tables->traitTable.insert( existing, std::make_pair( id, decl ) );
|
---|
| 741 | ++tables->size;
|
---|
| 742 | }
|
---|
| 743 | } else {
|
---|
| 744 | if ( ! addedDeclConflicts( existing->second, decl ) ) {
|
---|
| 745 | existing->second = decl;
|
---|
| 746 | }
|
---|
| 747 | }
|
---|
[a08ba92] | 748 | }
|
---|
[17cd4eb] | 749 |
|
---|
[a08ba92] | 750 | void Indexer::enterScope() {
|
---|
[52c2a72] | 751 | ++scope;
|
---|
[e8032b0] | 752 |
|
---|
[0dd3a2f] | 753 | if ( doDebug ) {
|
---|
[52c2a72] | 754 | std::cout << "--- Entering scope " << scope << std::endl;
|
---|
[0dd3a2f] | 755 | }
|
---|
[a08ba92] | 756 | }
|
---|
[17cd4eb] | 757 |
|
---|
[a08ba92] | 758 | void Indexer::leaveScope() {
|
---|
[0dd3a2f] | 759 | using std::cout;
|
---|
[52c2a72] | 760 |
|
---|
| 761 | assert( scope > 0 && "cannot leave initial scope" );
|
---|
| 762 | --scope;
|
---|
| 763 |
|
---|
| 764 | while ( tables && tables->scope > scope ) {
|
---|
| 765 | if ( doDebug ) {
|
---|
| 766 | cout << "--- Leaving scope " << tables->scope << " containing" << std::endl;
|
---|
[bed4c63e] | 767 | dump( tables->idTable, cout );
|
---|
[52c2a72] | 768 | dump( tables->typeTable, cout );
|
---|
| 769 | dump( tables->structTable, cout );
|
---|
| 770 | dump( tables->enumTable, cout );
|
---|
| 771 | dump( tables->unionTable, cout );
|
---|
| 772 | dump( tables->traitTable, cout );
|
---|
| 773 | }
|
---|
| 774 |
|
---|
| 775 | // swap tables for base table until we find one at an appropriate scope
|
---|
| 776 | Indexer::Impl *base = newRef( tables->base.tables );
|
---|
| 777 | deleteRef( tables );
|
---|
| 778 | tables = base;
|
---|
[0dd3a2f] | 779 | }
|
---|
[a08ba92] | 780 | }
|
---|
[17cd4eb] | 781 |
|
---|
[a08ba92] | 782 | void Indexer::print( std::ostream &os, int indent ) const {
|
---|
| 783 | using std::cerr;
|
---|
[e8032b0] | 784 |
|
---|
| 785 | cerr << "===idTable===" << std::endl;
|
---|
[bed4c63e] | 786 | if ( tables ) dump( tables->idTable, os );
|
---|
[e8032b0] | 787 | cerr << "===typeTable===" << std::endl;
|
---|
[52c2a72] | 788 | if ( tables ) dump( tables->typeTable, os );
|
---|
[e8032b0] | 789 | cerr << "===structTable===" << std::endl;
|
---|
[52c2a72] | 790 | if ( tables ) dump( tables->structTable, os );
|
---|
[e8032b0] | 791 | cerr << "===enumTable===" << std::endl;
|
---|
[52c2a72] | 792 | if ( tables ) dump( tables->enumTable, os );
|
---|
[e8032b0] | 793 | cerr << "===unionTable===" << std::endl;
|
---|
[52c2a72] | 794 | if ( tables ) dump( tables->unionTable, os );
|
---|
[e8032b0] | 795 | cerr << "===contextTable===" << std::endl;
|
---|
[52c2a72] | 796 | if ( tables ) dump( tables->traitTable, os );
|
---|
[a08ba92] | 797 | }
|
---|
[51b73452] | 798 | } // namespace SymTab
|
---|
[0dd3a2f] | 799 |
|
---|
| 800 | // Local Variables: //
|
---|
| 801 | // tab-width: 4 //
|
---|
| 802 | // mode: c++ //
|
---|
| 803 | // compile-command: "make install" //
|
---|
| 804 | // End: //
|
---|