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