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