[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 | // |
---|
[9cb8e88d] | 7 | // Validate.cc -- |
---|
[0dd3a2f] | 8 | // |
---|
| 9 | // Author : Richard C. Bilson |
---|
| 10 | // Created On : Sun May 17 21:50:04 2015 |
---|
[4e06c1e] | 11 | // Last Modified By : Peter A. Buhr |
---|
| 12 | // Last Modified On : Tue Jul 12 17:49:21 2016 |
---|
| 13 | // Update Count : 298 |
---|
[0dd3a2f] | 14 | // |
---|
| 15 | |
---|
| 16 | // The "validate" phase of translation is used to take a syntax tree and convert it into a standard form that aims to be |
---|
| 17 | // as regular in structure as possible. Some assumptions can be made regarding the state of the tree after this pass is |
---|
| 18 | // complete, including: |
---|
| 19 | // |
---|
| 20 | // - No nested structure or union definitions; any in the input are "hoisted" to the level of the containing struct or |
---|
| 21 | // union. |
---|
| 22 | // |
---|
| 23 | // - All enumeration constants have type EnumInstType. |
---|
| 24 | // |
---|
| 25 | // - The type "void" never occurs in lists of function parameter or return types; neither do tuple types. A function |
---|
| 26 | // taking no arguments has no argument types, and tuples are flattened. |
---|
| 27 | // |
---|
| 28 | // - No context instances exist; they are all replaced by the set of declarations signified by the context, instantiated |
---|
| 29 | // by the particular set of type arguments. |
---|
| 30 | // |
---|
| 31 | // - Every declaration is assigned a unique id. |
---|
| 32 | // |
---|
| 33 | // - No typedef declarations or instances exist; the actual type is substituted for each instance. |
---|
| 34 | // |
---|
| 35 | // - Each type, struct, and union definition is followed by an appropriate assignment operator. |
---|
| 36 | // |
---|
| 37 | // - Each use of a struct or union is connected to a complete definition of that struct or union, even if that |
---|
| 38 | // definition occurs later in the input. |
---|
[51b7345] | 39 | |
---|
| 40 | #include <list> |
---|
| 41 | #include <iterator> |
---|
[630a82a] | 42 | #include "Common/utility.h" |
---|
| 43 | #include "Common/UniqueName.h" |
---|
[51b7345] | 44 | #include "Validate.h" |
---|
| 45 | #include "SynTree/Visitor.h" |
---|
| 46 | #include "SynTree/Mutator.h" |
---|
| 47 | #include "SynTree/Type.h" |
---|
[630a82a] | 48 | #include "SynTree/Expression.h" |
---|
[51b7345] | 49 | #include "SynTree/Statement.h" |
---|
| 50 | #include "SynTree/TypeSubstitution.h" |
---|
[68cd1ce] | 51 | #include "Indexer.h" |
---|
[51b7345] | 52 | #include "FixFunction.h" |
---|
[cc79d97] | 53 | // #include "ImplementationType.h" |
---|
[630a82a] | 54 | #include "GenPoly/DeclMutator.h" |
---|
[51b7345] | 55 | #include "AddVisit.h" |
---|
[f6d7e0f] | 56 | #include "MakeLibCfa.h" |
---|
[cc79d97] | 57 | #include "TypeEquality.h" |
---|
[620cb95] | 58 | #include "Autogen.h" |
---|
[1cbca6e] | 59 | #include "ResolvExpr/typeops.h" |
---|
[51b7345] | 60 | |
---|
[c8ffe20b] | 61 | #define debugPrint( x ) if ( doDebug ) { std::cout << x; } |
---|
[51b7345] | 62 | |
---|
| 63 | namespace SymTab { |
---|
[a08ba92] | 64 | class HoistStruct : public Visitor { |
---|
| 65 | public: |
---|
[82dd287] | 66 | /// Flattens nested struct types |
---|
[0dd3a2f] | 67 | static void hoistStruct( std::list< Declaration * > &translationUnit ); |
---|
[9cb8e88d] | 68 | |
---|
[0dd3a2f] | 69 | std::list< Declaration * > &get_declsToAdd() { return declsToAdd; } |
---|
[9cb8e88d] | 70 | |
---|
[0dd3a2f] | 71 | virtual void visit( StructDecl *aggregateDecl ); |
---|
| 72 | virtual void visit( UnionDecl *aggregateDecl ); |
---|
[c8ffe20b] | 73 | |
---|
[0dd3a2f] | 74 | virtual void visit( CompoundStmt *compoundStmt ); |
---|
| 75 | virtual void visit( SwitchStmt *switchStmt ); |
---|
[a08ba92] | 76 | private: |
---|
[0dd3a2f] | 77 | HoistStruct(); |
---|
[c8ffe20b] | 78 | |
---|
[0dd3a2f] | 79 | template< typename AggDecl > void handleAggregate( AggDecl *aggregateDecl ); |
---|
[c8ffe20b] | 80 | |
---|
[0dd3a2f] | 81 | std::list< Declaration * > declsToAdd; |
---|
| 82 | bool inStruct; |
---|
[a08ba92] | 83 | }; |
---|
[c8ffe20b] | 84 | |
---|
[de91427b] | 85 | /// Replaces enum types by int, and function or array types in function parameter and return lists by appropriate pointers. |
---|
[a08ba92] | 86 | class Pass1 : public Visitor { |
---|
[0dd3a2f] | 87 | typedef Visitor Parent; |
---|
| 88 | virtual void visit( EnumDecl *aggregateDecl ); |
---|
| 89 | virtual void visit( FunctionType *func ); |
---|
[a08ba92] | 90 | }; |
---|
[82dd287] | 91 | |
---|
| 92 | /// Associates forward declarations of aggregates with their definitions |
---|
[a08ba92] | 93 | class Pass2 : public Indexer { |
---|
[0dd3a2f] | 94 | typedef Indexer Parent; |
---|
[a08ba92] | 95 | public: |
---|
[0dd3a2f] | 96 | Pass2( bool doDebug, const Indexer *indexer ); |
---|
[a08ba92] | 97 | private: |
---|
[0dd3a2f] | 98 | virtual void visit( StructInstType *structInst ); |
---|
| 99 | virtual void visit( UnionInstType *unionInst ); |
---|
[4040425] | 100 | virtual void visit( TraitInstType *contextInst ); |
---|
[0dd3a2f] | 101 | virtual void visit( StructDecl *structDecl ); |
---|
| 102 | virtual void visit( UnionDecl *unionDecl ); |
---|
| 103 | virtual void visit( TypeInstType *typeInst ); |
---|
| 104 | |
---|
| 105 | const Indexer *indexer; |
---|
[9cb8e88d] | 106 | |
---|
[0dd3a2f] | 107 | typedef std::map< std::string, std::list< StructInstType * > > ForwardStructsType; |
---|
| 108 | typedef std::map< std::string, std::list< UnionInstType * > > ForwardUnionsType; |
---|
| 109 | ForwardStructsType forwardStructs; |
---|
| 110 | ForwardUnionsType forwardUnions; |
---|
[a08ba92] | 111 | }; |
---|
[c8ffe20b] | 112 | |
---|
[82dd287] | 113 | /// Replaces array and function types in forall lists by appropriate pointer type |
---|
[a08ba92] | 114 | class Pass3 : public Indexer { |
---|
[0dd3a2f] | 115 | typedef Indexer Parent; |
---|
[a08ba92] | 116 | public: |
---|
[0dd3a2f] | 117 | Pass3( const Indexer *indexer ); |
---|
[a08ba92] | 118 | private: |
---|
[0dd3a2f] | 119 | virtual void visit( ObjectDecl *object ); |
---|
| 120 | virtual void visit( FunctionDecl *func ); |
---|
[c8ffe20b] | 121 | |
---|
[0dd3a2f] | 122 | const Indexer *indexer; |
---|
[a08ba92] | 123 | }; |
---|
[c8ffe20b] | 124 | |
---|
[de91427b] | 125 | class ReturnChecker : public Visitor { |
---|
| 126 | public: |
---|
| 127 | /// Checks that return statements return nothing if their return type is void |
---|
| 128 | /// and return something if the return type is non-void. |
---|
| 129 | static void checkFunctionReturns( std::list< Declaration * > & translationUnit ); |
---|
| 130 | private: |
---|
| 131 | virtual void visit( FunctionDecl * functionDecl ); |
---|
| 132 | |
---|
| 133 | virtual void visit( ReturnStmt * returnStmt ); |
---|
| 134 | |
---|
| 135 | std::list< DeclarationWithType * > returnVals; |
---|
| 136 | }; |
---|
| 137 | |
---|
[a08ba92] | 138 | class EliminateTypedef : public Mutator { |
---|
| 139 | public: |
---|
[de91427b] | 140 | EliminateTypedef() : scopeLevel( 0 ) {} |
---|
| 141 | /// Replaces typedefs by forward declarations |
---|
[0dd3a2f] | 142 | static void eliminateTypedef( std::list< Declaration * > &translationUnit ); |
---|
[a08ba92] | 143 | private: |
---|
[0dd3a2f] | 144 | virtual Declaration *mutate( TypedefDecl *typeDecl ); |
---|
| 145 | virtual TypeDecl *mutate( TypeDecl *typeDecl ); |
---|
| 146 | virtual DeclarationWithType *mutate( FunctionDecl *funcDecl ); |
---|
[1db21619] | 147 | virtual DeclarationWithType *mutate( ObjectDecl *objDecl ); |
---|
[0dd3a2f] | 148 | virtual CompoundStmt *mutate( CompoundStmt *compoundStmt ); |
---|
| 149 | virtual Type *mutate( TypeInstType *aggregateUseType ); |
---|
| 150 | virtual Expression *mutate( CastExpr *castExpr ); |
---|
[cc79d97] | 151 | |
---|
[85c4ef0] | 152 | virtual Declaration *mutate( StructDecl * structDecl ); |
---|
| 153 | virtual Declaration *mutate( UnionDecl * unionDecl ); |
---|
| 154 | virtual Declaration *mutate( EnumDecl * enumDecl ); |
---|
[4040425] | 155 | virtual Declaration *mutate( TraitDecl * contextDecl ); |
---|
[85c4ef0] | 156 | |
---|
| 157 | template<typename AggDecl> |
---|
| 158 | AggDecl *handleAggregate( AggDecl * aggDecl ); |
---|
| 159 | |
---|
[45161b4d] | 160 | template<typename AggDecl> |
---|
| 161 | void addImplicitTypedef( AggDecl * aggDecl ); |
---|
[70a06f6] | 162 | |
---|
[cc79d97] | 163 | typedef std::map< std::string, std::pair< TypedefDecl *, int > > TypedefMap; |
---|
[679864e1] | 164 | typedef std::map< std::string, TypeDecl * > TypeDeclMap; |
---|
[cc79d97] | 165 | TypedefMap typedefNames; |
---|
[679864e1] | 166 | TypeDeclMap typedeclNames; |
---|
[cc79d97] | 167 | int scopeLevel; |
---|
[a08ba92] | 168 | }; |
---|
[c8ffe20b] | 169 | |
---|
[9cb8e88d] | 170 | class VerifyCtorDtor : public Visitor { |
---|
| 171 | public: |
---|
| 172 | /// ensure that constructors and destructors have at least one |
---|
| 173 | /// parameter, the first of which must be a pointer, and no |
---|
| 174 | /// return values. |
---|
| 175 | static void verify( std::list< Declaration * > &translationUnit ); |
---|
| 176 | |
---|
| 177 | virtual void visit( FunctionDecl *funcDecl ); |
---|
[5f98ce5] | 178 | }; |
---|
[70a06f6] | 179 | |
---|
[630a82a] | 180 | class CompoundLiteral : public GenPoly::DeclMutator { |
---|
| 181 | DeclarationNode::StorageClass storageclass = DeclarationNode::NoStorageClass; |
---|
| 182 | |
---|
| 183 | virtual DeclarationWithType * mutate( ObjectDecl *objectDecl ); |
---|
| 184 | virtual Expression *mutate( CompoundLiteralExpr *compLitExpr ); |
---|
[9cb8e88d] | 185 | }; |
---|
| 186 | |
---|
[a08ba92] | 187 | void validate( std::list< Declaration * > &translationUnit, bool doDebug ) { |
---|
[0dd3a2f] | 188 | Pass1 pass1; |
---|
| 189 | Pass2 pass2( doDebug, 0 ); |
---|
| 190 | Pass3 pass3( 0 ); |
---|
[630a82a] | 191 | CompoundLiteral compoundliteral; |
---|
| 192 | |
---|
[0dd3a2f] | 193 | EliminateTypedef::eliminateTypedef( translationUnit ); |
---|
| 194 | HoistStruct::hoistStruct( translationUnit ); |
---|
[40e636a] | 195 | autogenerateRoutines( translationUnit ); // moved up, used to be below compoundLiteral - currently needs Pass1 |
---|
[0dd3a2f] | 196 | acceptAll( translationUnit, pass1 ); |
---|
| 197 | acceptAll( translationUnit, pass2 ); |
---|
[de91427b] | 198 | ReturnChecker::checkFunctionReturns( translationUnit ); |
---|
[40e636a] | 199 | compoundliteral.mutateDeclarationList( translationUnit ); |
---|
[0dd3a2f] | 200 | acceptAll( translationUnit, pass3 ); |
---|
[9cb8e88d] | 201 | VerifyCtorDtor::verify( translationUnit ); |
---|
[a08ba92] | 202 | } |
---|
[9cb8e88d] | 203 | |
---|
[a08ba92] | 204 | void validateType( Type *type, const Indexer *indexer ) { |
---|
[0dd3a2f] | 205 | Pass1 pass1; |
---|
| 206 | Pass2 pass2( false, indexer ); |
---|
| 207 | Pass3 pass3( indexer ); |
---|
| 208 | type->accept( pass1 ); |
---|
| 209 | type->accept( pass2 ); |
---|
| 210 | type->accept( pass3 ); |
---|
[a08ba92] | 211 | } |
---|
[c8ffe20b] | 212 | |
---|
[a08ba92] | 213 | void HoistStruct::hoistStruct( std::list< Declaration * > &translationUnit ) { |
---|
[0dd3a2f] | 214 | HoistStruct hoister; |
---|
| 215 | acceptAndAdd( translationUnit, hoister, true ); |
---|
[a08ba92] | 216 | } |
---|
[c8ffe20b] | 217 | |
---|
[a08ba92] | 218 | HoistStruct::HoistStruct() : inStruct( false ) { |
---|
| 219 | } |
---|
[c8ffe20b] | 220 | |
---|
[a08ba92] | 221 | void filter( std::list< Declaration * > &declList, bool (*pred)( Declaration * ), bool doDelete ) { |
---|
[0dd3a2f] | 222 | std::list< Declaration * >::iterator i = declList.begin(); |
---|
| 223 | while ( i != declList.end() ) { |
---|
| 224 | std::list< Declaration * >::iterator next = i; |
---|
| 225 | ++next; |
---|
| 226 | if ( pred( *i ) ) { |
---|
| 227 | if ( doDelete ) { |
---|
| 228 | delete *i; |
---|
| 229 | } // if |
---|
| 230 | declList.erase( i ); |
---|
| 231 | } // if |
---|
| 232 | i = next; |
---|
| 233 | } // while |
---|
[a08ba92] | 234 | } |
---|
[c8ffe20b] | 235 | |
---|
[a08ba92] | 236 | bool isStructOrUnion( Declaration *decl ) { |
---|
[0dd3a2f] | 237 | return dynamic_cast< StructDecl * >( decl ) || dynamic_cast< UnionDecl * >( decl ); |
---|
[a08ba92] | 238 | } |
---|
[51b7345] | 239 | |
---|
[a08ba92] | 240 | template< typename AggDecl > |
---|
| 241 | void HoistStruct::handleAggregate( AggDecl *aggregateDecl ) { |
---|
[0dd3a2f] | 242 | if ( inStruct ) { |
---|
| 243 | // Add elements in stack order corresponding to nesting structure. |
---|
| 244 | declsToAdd.push_front( aggregateDecl ); |
---|
| 245 | Visitor::visit( aggregateDecl ); |
---|
| 246 | } else { |
---|
| 247 | inStruct = true; |
---|
| 248 | Visitor::visit( aggregateDecl ); |
---|
| 249 | inStruct = false; |
---|
| 250 | } // if |
---|
| 251 | // Always remove the hoisted aggregate from the inner structure. |
---|
| 252 | filter( aggregateDecl->get_members(), isStructOrUnion, false ); |
---|
[a08ba92] | 253 | } |
---|
[c8ffe20b] | 254 | |
---|
[a08ba92] | 255 | void HoistStruct::visit( StructDecl *aggregateDecl ) { |
---|
[0dd3a2f] | 256 | handleAggregate( aggregateDecl ); |
---|
[a08ba92] | 257 | } |
---|
[c8ffe20b] | 258 | |
---|
[a08ba92] | 259 | void HoistStruct::visit( UnionDecl *aggregateDecl ) { |
---|
[0dd3a2f] | 260 | handleAggregate( aggregateDecl ); |
---|
[a08ba92] | 261 | } |
---|
[c8ffe20b] | 262 | |
---|
[a08ba92] | 263 | void HoistStruct::visit( CompoundStmt *compoundStmt ) { |
---|
[0dd3a2f] | 264 | addVisit( compoundStmt, *this ); |
---|
[a08ba92] | 265 | } |
---|
[c8ffe20b] | 266 | |
---|
[a08ba92] | 267 | void HoistStruct::visit( SwitchStmt *switchStmt ) { |
---|
[0dd3a2f] | 268 | addVisit( switchStmt, *this ); |
---|
[a08ba92] | 269 | } |
---|
[c8ffe20b] | 270 | |
---|
[a08ba92] | 271 | void Pass1::visit( EnumDecl *enumDecl ) { |
---|
[0dd3a2f] | 272 | // Set the type of each member of the enumeration to be EnumConstant |
---|
| 273 | for ( std::list< Declaration * >::iterator i = enumDecl->get_members().begin(); i != enumDecl->get_members().end(); ++i ) { |
---|
[f6d7e0f] | 274 | ObjectDecl * obj = dynamic_cast< ObjectDecl * >( *i ); |
---|
[0dd3a2f] | 275 | assert( obj ); |
---|
[a436947] | 276 | obj->set_type( new EnumInstType( Type::Qualifiers( true, false, false, false, false, false ), enumDecl->get_name() ) ); |
---|
[0dd3a2f] | 277 | } // for |
---|
| 278 | Parent::visit( enumDecl ); |
---|
[a08ba92] | 279 | } |
---|
[51b7345] | 280 | |
---|
[a08ba92] | 281 | namespace { |
---|
[83de11e] | 282 | template< typename DWTList > |
---|
| 283 | void fixFunctionList( DWTList & dwts, FunctionType * func ) { |
---|
[0dd3a2f] | 284 | // the only case in which "void" is valid is where it is the only one in the list; then it should be removed |
---|
| 285 | // entirely other fix ups are handled by the FixFunction class |
---|
[83de11e] | 286 | typedef typename DWTList::iterator DWTIterator; |
---|
| 287 | DWTIterator begin( dwts.begin() ), end( dwts.end() ); |
---|
[0dd3a2f] | 288 | if ( begin == end ) return; |
---|
| 289 | FixFunction fixer; |
---|
| 290 | DWTIterator i = begin; |
---|
[83de11e] | 291 | *i = (*i)->acceptMutator( fixer ); |
---|
[0dd3a2f] | 292 | if ( fixer.get_isVoid() ) { |
---|
| 293 | DWTIterator j = i; |
---|
| 294 | ++i; |
---|
[83de11e] | 295 | dwts.erase( j ); |
---|
[9cb8e88d] | 296 | if ( i != end ) { |
---|
[0dd3a2f] | 297 | throw SemanticError( "invalid type void in function type ", func ); |
---|
| 298 | } // if |
---|
| 299 | } else { |
---|
| 300 | ++i; |
---|
| 301 | for ( ; i != end; ++i ) { |
---|
| 302 | FixFunction fixer; |
---|
| 303 | *i = (*i )->acceptMutator( fixer ); |
---|
| 304 | if ( fixer.get_isVoid() ) { |
---|
| 305 | throw SemanticError( "invalid type void in function type ", func ); |
---|
| 306 | } // if |
---|
| 307 | } // for |
---|
| 308 | } // if |
---|
| 309 | } |
---|
[a08ba92] | 310 | } |
---|
[c8ffe20b] | 311 | |
---|
[a08ba92] | 312 | void Pass1::visit( FunctionType *func ) { |
---|
[0dd3a2f] | 313 | // Fix up parameters and return types |
---|
[83de11e] | 314 | fixFunctionList( func->get_parameters(), func ); |
---|
| 315 | fixFunctionList( func->get_returnVals(), func ); |
---|
[0dd3a2f] | 316 | Visitor::visit( func ); |
---|
[a08ba92] | 317 | } |
---|
[c8ffe20b] | 318 | |
---|
[a08ba92] | 319 | Pass2::Pass2( bool doDebug, const Indexer *other_indexer ) : Indexer( doDebug ) { |
---|
[0dd3a2f] | 320 | if ( other_indexer ) { |
---|
| 321 | indexer = other_indexer; |
---|
| 322 | } else { |
---|
| 323 | indexer = this; |
---|
| 324 | } // if |
---|
[a08ba92] | 325 | } |
---|
[c8ffe20b] | 326 | |
---|
[a08ba92] | 327 | void Pass2::visit( StructInstType *structInst ) { |
---|
[0dd3a2f] | 328 | Parent::visit( structInst ); |
---|
| 329 | StructDecl *st = indexer->lookupStruct( structInst->get_name() ); |
---|
| 330 | // it's not a semantic error if the struct is not found, just an implicit forward declaration |
---|
| 331 | if ( st ) { |
---|
[98735ef] | 332 | //assert( ! structInst->get_baseStruct() || structInst->get_baseStruct()->get_members().empty() || ! st->get_members().empty() ); |
---|
[0dd3a2f] | 333 | structInst->set_baseStruct( st ); |
---|
| 334 | } // if |
---|
| 335 | if ( ! st || st->get_members().empty() ) { |
---|
| 336 | // use of forward declaration |
---|
| 337 | forwardStructs[ structInst->get_name() ].push_back( structInst ); |
---|
| 338 | } // if |
---|
[a08ba92] | 339 | } |
---|
[c8ffe20b] | 340 | |
---|
[a08ba92] | 341 | void Pass2::visit( UnionInstType *unionInst ) { |
---|
[0dd3a2f] | 342 | Parent::visit( unionInst ); |
---|
| 343 | UnionDecl *un = indexer->lookupUnion( unionInst->get_name() ); |
---|
| 344 | // it's not a semantic error if the union is not found, just an implicit forward declaration |
---|
| 345 | if ( un ) { |
---|
| 346 | unionInst->set_baseUnion( un ); |
---|
| 347 | } // if |
---|
| 348 | if ( ! un || un->get_members().empty() ) { |
---|
| 349 | // use of forward declaration |
---|
| 350 | forwardUnions[ unionInst->get_name() ].push_back( unionInst ); |
---|
| 351 | } // if |
---|
[a08ba92] | 352 | } |
---|
[c8ffe20b] | 353 | |
---|
[4040425] | 354 | void Pass2::visit( TraitInstType *contextInst ) { |
---|
[0dd3a2f] | 355 | Parent::visit( contextInst ); |
---|
[4040425] | 356 | TraitDecl *ctx = indexer->lookupTrait( contextInst->get_name() ); |
---|
[0dd3a2f] | 357 | if ( ! ctx ) { |
---|
| 358 | throw SemanticError( "use of undeclared context " + contextInst->get_name() ); |
---|
[17cd4eb] | 359 | } // if |
---|
[0dd3a2f] | 360 | for ( std::list< TypeDecl * >::const_iterator i = ctx->get_parameters().begin(); i != ctx->get_parameters().end(); ++i ) { |
---|
| 361 | for ( std::list< DeclarationWithType * >::const_iterator assert = (*i )->get_assertions().begin(); assert != (*i )->get_assertions().end(); ++assert ) { |
---|
[4040425] | 362 | if ( TraitInstType *otherCtx = dynamic_cast< TraitInstType * >(*assert ) ) { |
---|
[0dd3a2f] | 363 | cloneAll( otherCtx->get_members(), contextInst->get_members() ); |
---|
| 364 | } else { |
---|
| 365 | contextInst->get_members().push_back( (*assert )->clone() ); |
---|
| 366 | } // if |
---|
| 367 | } // for |
---|
| 368 | } // for |
---|
[51b986f] | 369 | |
---|
| 370 | if ( ctx->get_parameters().size() != contextInst->get_parameters().size() ) { |
---|
| 371 | throw SemanticError( "incorrect number of context parameters: ", contextInst ); |
---|
| 372 | } // if |
---|
| 373 | |
---|
[0dd3a2f] | 374 | applySubstitution( ctx->get_parameters().begin(), ctx->get_parameters().end(), contextInst->get_parameters().begin(), ctx->get_members().begin(), ctx->get_members().end(), back_inserter( contextInst->get_members() ) ); |
---|
[a08ba92] | 375 | } |
---|
[c8ffe20b] | 376 | |
---|
[a08ba92] | 377 | void Pass2::visit( StructDecl *structDecl ) { |
---|
[677c1be] | 378 | // visit struct members first so that the types of self-referencing members are updated properly |
---|
| 379 | Parent::visit( structDecl ); |
---|
[0dd3a2f] | 380 | if ( ! structDecl->get_members().empty() ) { |
---|
| 381 | ForwardStructsType::iterator fwds = forwardStructs.find( structDecl->get_name() ); |
---|
| 382 | if ( fwds != forwardStructs.end() ) { |
---|
| 383 | for ( std::list< StructInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) { |
---|
| 384 | (*inst )->set_baseStruct( structDecl ); |
---|
| 385 | } // for |
---|
| 386 | forwardStructs.erase( fwds ); |
---|
| 387 | } // if |
---|
| 388 | } // if |
---|
[a08ba92] | 389 | } |
---|
[c8ffe20b] | 390 | |
---|
[a08ba92] | 391 | void Pass2::visit( UnionDecl *unionDecl ) { |
---|
[677c1be] | 392 | Parent::visit( unionDecl ); |
---|
[0dd3a2f] | 393 | if ( ! unionDecl->get_members().empty() ) { |
---|
| 394 | ForwardUnionsType::iterator fwds = forwardUnions.find( unionDecl->get_name() ); |
---|
| 395 | if ( fwds != forwardUnions.end() ) { |
---|
| 396 | for ( std::list< UnionInstType * >::iterator inst = fwds->second.begin(); inst != fwds->second.end(); ++inst ) { |
---|
| 397 | (*inst )->set_baseUnion( unionDecl ); |
---|
| 398 | } // for |
---|
| 399 | forwardUnions.erase( fwds ); |
---|
| 400 | } // if |
---|
| 401 | } // if |
---|
[a08ba92] | 402 | } |
---|
[c8ffe20b] | 403 | |
---|
[a08ba92] | 404 | void Pass2::visit( TypeInstType *typeInst ) { |
---|
[0dd3a2f] | 405 | if ( NamedTypeDecl *namedTypeDecl = lookupType( typeInst->get_name() ) ) { |
---|
| 406 | if ( TypeDecl *typeDecl = dynamic_cast< TypeDecl * >( namedTypeDecl ) ) { |
---|
| 407 | typeInst->set_isFtype( typeDecl->get_kind() == TypeDecl::Ftype ); |
---|
| 408 | } // if |
---|
| 409 | } // if |
---|
[a08ba92] | 410 | } |
---|
[c8ffe20b] | 411 | |
---|
[a08ba92] | 412 | Pass3::Pass3( const Indexer *other_indexer ) : Indexer( false ) { |
---|
[0dd3a2f] | 413 | if ( other_indexer ) { |
---|
| 414 | indexer = other_indexer; |
---|
| 415 | } else { |
---|
| 416 | indexer = this; |
---|
| 417 | } // if |
---|
[a08ba92] | 418 | } |
---|
[c8ffe20b] | 419 | |
---|
[82dd287] | 420 | /// Fix up assertions |
---|
[a08ba92] | 421 | void forallFixer( Type *func ) { |
---|
[0dd3a2f] | 422 | for ( std::list< TypeDecl * >::iterator type = func->get_forall().begin(); type != func->get_forall().end(); ++type ) { |
---|
| 423 | std::list< DeclarationWithType * > toBeDone, nextRound; |
---|
| 424 | toBeDone.splice( toBeDone.end(), (*type )->get_assertions() ); |
---|
| 425 | while ( ! toBeDone.empty() ) { |
---|
| 426 | for ( std::list< DeclarationWithType * >::iterator assertion = toBeDone.begin(); assertion != toBeDone.end(); ++assertion ) { |
---|
[4040425] | 427 | if ( TraitInstType *ctx = dynamic_cast< TraitInstType * >( (*assertion )->get_type() ) ) { |
---|
[0dd3a2f] | 428 | for ( std::list< Declaration * >::const_iterator i = ctx->get_members().begin(); i != ctx->get_members().end(); ++i ) { |
---|
| 429 | DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *i ); |
---|
| 430 | assert( dwt ); |
---|
| 431 | nextRound.push_back( dwt->clone() ); |
---|
| 432 | } |
---|
| 433 | delete ctx; |
---|
| 434 | } else { |
---|
| 435 | FixFunction fixer; |
---|
| 436 | *assertion = (*assertion )->acceptMutator( fixer ); |
---|
| 437 | if ( fixer.get_isVoid() ) { |
---|
| 438 | throw SemanticError( "invalid type void in assertion of function ", func ); |
---|
| 439 | } |
---|
| 440 | (*type )->get_assertions().push_back( *assertion ); |
---|
| 441 | } // if |
---|
| 442 | } // for |
---|
| 443 | toBeDone.clear(); |
---|
| 444 | toBeDone.splice( toBeDone.end(), nextRound ); |
---|
| 445 | } // while |
---|
| 446 | } // for |
---|
[a08ba92] | 447 | } |
---|
[c8ffe20b] | 448 | |
---|
[a08ba92] | 449 | void Pass3::visit( ObjectDecl *object ) { |
---|
[0dd3a2f] | 450 | forallFixer( object->get_type() ); |
---|
| 451 | if ( PointerType *pointer = dynamic_cast< PointerType * >( object->get_type() ) ) { |
---|
| 452 | forallFixer( pointer->get_base() ); |
---|
| 453 | } // if |
---|
| 454 | Parent::visit( object ); |
---|
| 455 | object->fixUniqueId(); |
---|
[a08ba92] | 456 | } |
---|
[c8ffe20b] | 457 | |
---|
[a08ba92] | 458 | void Pass3::visit( FunctionDecl *func ) { |
---|
[0dd3a2f] | 459 | forallFixer( func->get_type() ); |
---|
| 460 | Parent::visit( func ); |
---|
| 461 | func->fixUniqueId(); |
---|
[a08ba92] | 462 | } |
---|
[c8ffe20b] | 463 | |
---|
[de91427b] | 464 | void ReturnChecker::checkFunctionReturns( std::list< Declaration * > & translationUnit ) { |
---|
| 465 | ReturnChecker checker; |
---|
| 466 | acceptAll( translationUnit, checker ); |
---|
| 467 | } |
---|
| 468 | |
---|
| 469 | void ReturnChecker::visit( FunctionDecl * functionDecl ) { |
---|
| 470 | std::list< DeclarationWithType * > oldReturnVals = returnVals; |
---|
| 471 | returnVals = functionDecl->get_functionType()->get_returnVals(); |
---|
| 472 | Visitor::visit( functionDecl ); |
---|
| 473 | returnVals = oldReturnVals; |
---|
| 474 | } |
---|
| 475 | |
---|
| 476 | void ReturnChecker::visit( ReturnStmt * returnStmt ) { |
---|
[74d1804] | 477 | // Previously this also checked for the existence of an expr paired with no return values on |
---|
| 478 | // the function return type. This is incorrect, since you can have an expression attached to |
---|
| 479 | // a return statement in a void-returning function in C. The expression is treated as if it |
---|
| 480 | // were cast to void. |
---|
[de91427b] | 481 | if ( returnStmt->get_expr() == NULL && returnVals.size() != 0 ) { |
---|
| 482 | throw SemanticError( "Non-void function returns no values: " , returnStmt ); |
---|
| 483 | } |
---|
| 484 | } |
---|
| 485 | |
---|
| 486 | |
---|
[a08ba92] | 487 | bool isTypedef( Declaration *decl ) { |
---|
[0dd3a2f] | 488 | return dynamic_cast< TypedefDecl * >( decl ); |
---|
[a08ba92] | 489 | } |
---|
[c8ffe20b] | 490 | |
---|
[a08ba92] | 491 | void EliminateTypedef::eliminateTypedef( std::list< Declaration * > &translationUnit ) { |
---|
[0dd3a2f] | 492 | EliminateTypedef eliminator; |
---|
| 493 | mutateAll( translationUnit, eliminator ); |
---|
[5f98ce5] | 494 | if ( eliminator.typedefNames.count( "size_t" ) ) { |
---|
| 495 | // grab and remember declaration of size_t |
---|
| 496 | SizeType = eliminator.typedefNames["size_t"].first->get_base()->clone(); |
---|
| 497 | } else { |
---|
[40e636a] | 498 | // xxx - missing global typedef for size_t - default to long unsigned int, even though that may be wrong |
---|
| 499 | // eventually should have a warning for this case. |
---|
| 500 | SizeType = new BasicType( Type::Qualifiers(), BasicType::LongUnsignedInt ); |
---|
[5f98ce5] | 501 | } |
---|
[0dd3a2f] | 502 | filter( translationUnit, isTypedef, true ); |
---|
[5f98ce5] | 503 | |
---|
[a08ba92] | 504 | } |
---|
[c8ffe20b] | 505 | |
---|
[85c4ef0] | 506 | Type *EliminateTypedef::mutate( TypeInstType * typeInst ) { |
---|
[9cb8e88d] | 507 | // instances of typedef types will come here. If it is an instance |
---|
[cc79d97] | 508 | // of a typdef type, link the instance to its actual type. |
---|
| 509 | TypedefMap::const_iterator def = typedefNames.find( typeInst->get_name() ); |
---|
[0dd3a2f] | 510 | if ( def != typedefNames.end() ) { |
---|
[cc79d97] | 511 | Type *ret = def->second.first->get_base()->clone(); |
---|
[0dd3a2f] | 512 | ret->get_qualifiers() += typeInst->get_qualifiers(); |
---|
[0215a76f] | 513 | // place instance parameters on the typedef'd type |
---|
| 514 | if ( ! typeInst->get_parameters().empty() ) { |
---|
| 515 | ReferenceToType *rtt = dynamic_cast<ReferenceToType*>(ret); |
---|
| 516 | if ( ! rtt ) { |
---|
| 517 | throw SemanticError("cannot apply type parameters to base type of " + typeInst->get_name()); |
---|
| 518 | } |
---|
| 519 | rtt->get_parameters().clear(); |
---|
[b644d6f] | 520 | cloneAll( typeInst->get_parameters(), rtt->get_parameters() ); |
---|
| 521 | mutateAll( rtt->get_parameters(), *this ); // recursively fix typedefs on parameters |
---|
[1db21619] | 522 | } // if |
---|
[0dd3a2f] | 523 | delete typeInst; |
---|
| 524 | return ret; |
---|
[679864e1] | 525 | } else { |
---|
| 526 | TypeDeclMap::const_iterator base = typedeclNames.find( typeInst->get_name() ); |
---|
| 527 | assert( base != typedeclNames.end() ); |
---|
| 528 | typeInst->set_baseType( base->second->clone() ); |
---|
[0dd3a2f] | 529 | } // if |
---|
| 530 | return typeInst; |
---|
[a08ba92] | 531 | } |
---|
[c8ffe20b] | 532 | |
---|
[85c4ef0] | 533 | Declaration *EliminateTypedef::mutate( TypedefDecl * tyDecl ) { |
---|
[0dd3a2f] | 534 | Declaration *ret = Mutator::mutate( tyDecl ); |
---|
[5f98ce5] | 535 | |
---|
[cc79d97] | 536 | if ( typedefNames.count( tyDecl->get_name() ) == 1 && typedefNames[ tyDecl->get_name() ].second == scopeLevel ) { |
---|
[9cb8e88d] | 537 | // typedef to the same name from the same scope |
---|
[cc79d97] | 538 | // must be from the same type |
---|
| 539 | |
---|
| 540 | Type * t1 = tyDecl->get_base(); |
---|
| 541 | Type * t2 = typedefNames[ tyDecl->get_name() ].first->get_base(); |
---|
[1cbca6e] | 542 | if ( ! ResolvExpr::typesCompatible( t1, t2, Indexer() ) ) { |
---|
[cc79d97] | 543 | throw SemanticError( "cannot redefine typedef: " + tyDecl->get_name() ); |
---|
[85c4ef0] | 544 | } |
---|
[cc79d97] | 545 | } else { |
---|
| 546 | typedefNames[ tyDecl->get_name() ] = std::make_pair( tyDecl, scopeLevel ); |
---|
| 547 | } // if |
---|
| 548 | |
---|
[0dd3a2f] | 549 | // When a typedef is a forward declaration: |
---|
| 550 | // typedef struct screen SCREEN; |
---|
| 551 | // the declaration portion must be retained: |
---|
| 552 | // struct screen; |
---|
| 553 | // because the expansion of the typedef is: |
---|
| 554 | // void rtn( SCREEN *p ) => void rtn( struct screen *p ) |
---|
| 555 | // hence the type-name "screen" must be defined. |
---|
| 556 | // Note, qualifiers on the typedef are superfluous for the forward declaration. |
---|
| 557 | if ( StructInstType *aggDecl = dynamic_cast< StructInstType * >( tyDecl->get_base() ) ) { |
---|
| 558 | return new StructDecl( aggDecl->get_name() ); |
---|
| 559 | } else if ( UnionInstType *aggDecl = dynamic_cast< UnionInstType * >( tyDecl->get_base() ) ) { |
---|
| 560 | return new UnionDecl( aggDecl->get_name() ); |
---|
[956a9c7] | 561 | } else if ( EnumInstType *enumDecl = dynamic_cast< EnumInstType * >( tyDecl->get_base() ) ) { |
---|
| 562 | return new EnumDecl( enumDecl->get_name() ); |
---|
[0dd3a2f] | 563 | } else { |
---|
| 564 | return ret; |
---|
| 565 | } // if |
---|
[a08ba92] | 566 | } |
---|
[c8ffe20b] | 567 | |
---|
[85c4ef0] | 568 | TypeDecl *EliminateTypedef::mutate( TypeDecl * typeDecl ) { |
---|
[cc79d97] | 569 | TypedefMap::iterator i = typedefNames.find( typeDecl->get_name() ); |
---|
[0dd3a2f] | 570 | if ( i != typedefNames.end() ) { |
---|
| 571 | typedefNames.erase( i ) ; |
---|
| 572 | } // if |
---|
[679864e1] | 573 | |
---|
| 574 | typedeclNames[ typeDecl->get_name() ] = typeDecl; |
---|
[0dd3a2f] | 575 | return typeDecl; |
---|
[a08ba92] | 576 | } |
---|
[c8ffe20b] | 577 | |
---|
[85c4ef0] | 578 | DeclarationWithType *EliminateTypedef::mutate( FunctionDecl * funcDecl ) { |
---|
[cc79d97] | 579 | TypedefMap oldNames = typedefNames; |
---|
[0dd3a2f] | 580 | DeclarationWithType *ret = Mutator::mutate( funcDecl ); |
---|
| 581 | typedefNames = oldNames; |
---|
| 582 | return ret; |
---|
[a08ba92] | 583 | } |
---|
[c8ffe20b] | 584 | |
---|
[1db21619] | 585 | DeclarationWithType *EliminateTypedef::mutate( ObjectDecl * objDecl ) { |
---|
[cc79d97] | 586 | TypedefMap oldNames = typedefNames; |
---|
[1db21619] | 587 | DeclarationWithType *ret = Mutator::mutate( objDecl ); |
---|
[ae4c85a] | 588 | typedefNames = oldNames; |
---|
[02e5ab6] | 589 | // is the type a function? |
---|
[1db21619] | 590 | if ( FunctionType *funtype = dynamic_cast<FunctionType *>( ret->get_type() ) ) { |
---|
[02e5ab6] | 591 | // replace the current object declaration with a function declaration |
---|
[1db21619] | 592 | return new FunctionDecl( ret->get_name(), ret->get_storageClass(), ret->get_linkage(), funtype, 0, ret->get_isInline(), ret->get_isNoreturn() ); |
---|
| 593 | } else if ( objDecl->get_isInline() || objDecl->get_isNoreturn() ) { |
---|
| 594 | throw SemanticError( "invalid inline or _Noreturn specification in declaration of ", objDecl ); |
---|
| 595 | } // if |
---|
[0dd3a2f] | 596 | return ret; |
---|
[a08ba92] | 597 | } |
---|
[c8ffe20b] | 598 | |
---|
[85c4ef0] | 599 | Expression *EliminateTypedef::mutate( CastExpr * castExpr ) { |
---|
[cc79d97] | 600 | TypedefMap oldNames = typedefNames; |
---|
[0dd3a2f] | 601 | Expression *ret = Mutator::mutate( castExpr ); |
---|
| 602 | typedefNames = oldNames; |
---|
| 603 | return ret; |
---|
[a08ba92] | 604 | } |
---|
[c8ffe20b] | 605 | |
---|
[85c4ef0] | 606 | CompoundStmt *EliminateTypedef::mutate( CompoundStmt * compoundStmt ) { |
---|
[cc79d97] | 607 | TypedefMap oldNames = typedefNames; |
---|
| 608 | scopeLevel += 1; |
---|
[0dd3a2f] | 609 | CompoundStmt *ret = Mutator::mutate( compoundStmt ); |
---|
[cc79d97] | 610 | scopeLevel -= 1; |
---|
[0dd3a2f] | 611 | std::list< Statement * >::iterator i = compoundStmt->get_kids().begin(); |
---|
| 612 | while ( i != compoundStmt->get_kids().end() ) { |
---|
[85c4ef0] | 613 | std::list< Statement * >::iterator next = i+1; |
---|
[0dd3a2f] | 614 | if ( DeclStmt *declStmt = dynamic_cast< DeclStmt * >( *i ) ) { |
---|
| 615 | if ( dynamic_cast< TypedefDecl * >( declStmt->get_decl() ) ) { |
---|
| 616 | delete *i; |
---|
| 617 | compoundStmt->get_kids().erase( i ); |
---|
| 618 | } // if |
---|
| 619 | } // if |
---|
| 620 | i = next; |
---|
| 621 | } // while |
---|
| 622 | typedefNames = oldNames; |
---|
| 623 | return ret; |
---|
[a08ba92] | 624 | } |
---|
[85c4ef0] | 625 | |
---|
[45161b4d] | 626 | // there may be typedefs nested within aggregates in order for everything to work properly, these should be removed |
---|
| 627 | // as well |
---|
[85c4ef0] | 628 | template<typename AggDecl> |
---|
| 629 | AggDecl *EliminateTypedef::handleAggregate( AggDecl * aggDecl ) { |
---|
| 630 | std::list<Declaration *>::iterator it = aggDecl->get_members().begin(); |
---|
| 631 | for ( ; it != aggDecl->get_members().end(); ) { |
---|
| 632 | std::list< Declaration * >::iterator next = it+1; |
---|
| 633 | if ( dynamic_cast< TypedefDecl * >( *it ) ) { |
---|
| 634 | delete *it; |
---|
| 635 | aggDecl->get_members().erase( it ); |
---|
| 636 | } // if |
---|
| 637 | it = next; |
---|
| 638 | } |
---|
| 639 | return aggDecl; |
---|
| 640 | } |
---|
| 641 | |
---|
[45161b4d] | 642 | template<typename AggDecl> |
---|
| 643 | void EliminateTypedef::addImplicitTypedef( AggDecl * aggDecl ) { |
---|
| 644 | if ( typedefNames.count( aggDecl->get_name() ) == 0 ) { |
---|
| 645 | Type *type; |
---|
| 646 | if ( StructDecl * newDeclStructDecl = dynamic_cast< StructDecl * >( aggDecl ) ) { |
---|
| 647 | type = new StructInstType( Type::Qualifiers(), newDeclStructDecl->get_name() ); |
---|
| 648 | } else if ( UnionDecl * newDeclUnionDecl = dynamic_cast< UnionDecl * >( aggDecl ) ) { |
---|
| 649 | type = new UnionInstType( Type::Qualifiers(), newDeclUnionDecl->get_name() ); |
---|
| 650 | } else if ( EnumDecl * newDeclEnumDecl = dynamic_cast< EnumDecl * >( aggDecl ) ) { |
---|
| 651 | type = new EnumInstType( Type::Qualifiers(), newDeclEnumDecl->get_name() ); |
---|
| 652 | } // if |
---|
| 653 | TypedefDecl * tyDecl = new TypedefDecl( aggDecl->get_name(), DeclarationNode::NoStorageClass, type ); |
---|
| 654 | typedefNames[ aggDecl->get_name() ] = std::make_pair( tyDecl, scopeLevel ); |
---|
| 655 | } // if |
---|
| 656 | } |
---|
[4e06c1e] | 657 | |
---|
[85c4ef0] | 658 | Declaration *EliminateTypedef::mutate( StructDecl * structDecl ) { |
---|
[45161b4d] | 659 | addImplicitTypedef( structDecl ); |
---|
[85c4ef0] | 660 | Mutator::mutate( structDecl ); |
---|
| 661 | return handleAggregate( structDecl ); |
---|
| 662 | } |
---|
| 663 | |
---|
| 664 | Declaration *EliminateTypedef::mutate( UnionDecl * unionDecl ) { |
---|
[45161b4d] | 665 | addImplicitTypedef( unionDecl ); |
---|
[85c4ef0] | 666 | Mutator::mutate( unionDecl ); |
---|
| 667 | return handleAggregate( unionDecl ); |
---|
| 668 | } |
---|
| 669 | |
---|
| 670 | Declaration *EliminateTypedef::mutate( EnumDecl * enumDecl ) { |
---|
[45161b4d] | 671 | addImplicitTypedef( enumDecl ); |
---|
[85c4ef0] | 672 | Mutator::mutate( enumDecl ); |
---|
| 673 | return handleAggregate( enumDecl ); |
---|
| 674 | } |
---|
| 675 | |
---|
[45161b4d] | 676 | Declaration *EliminateTypedef::mutate( TraitDecl * contextDecl ) { |
---|
[85c4ef0] | 677 | Mutator::mutate( contextDecl ); |
---|
| 678 | return handleAggregate( contextDecl ); |
---|
| 679 | } |
---|
| 680 | |
---|
[9cb8e88d] | 681 | void VerifyCtorDtor::verify( std::list< Declaration * > & translationUnit ) { |
---|
| 682 | VerifyCtorDtor verifier; |
---|
| 683 | acceptAll( translationUnit, verifier ); |
---|
| 684 | } |
---|
| 685 | |
---|
| 686 | void VerifyCtorDtor::visit( FunctionDecl * funcDecl ) { |
---|
| 687 | FunctionType * funcType = funcDecl->get_functionType(); |
---|
| 688 | std::list< DeclarationWithType * > &returnVals = funcType->get_returnVals(); |
---|
| 689 | std::list< DeclarationWithType * > ¶ms = funcType->get_parameters(); |
---|
| 690 | |
---|
| 691 | if ( funcDecl->get_name() == "?{}" || funcDecl->get_name() == "^?{}" ) { |
---|
| 692 | if ( params.size() == 0 ) { |
---|
| 693 | throw SemanticError( "Constructors and destructors require at least one parameter ", funcDecl ); |
---|
| 694 | } |
---|
| 695 | if ( ! dynamic_cast< PointerType * >( params.front()->get_type() ) ) { |
---|
| 696 | throw SemanticError( "First parameter of a constructor or destructor must be a pointer ", funcDecl ); |
---|
| 697 | } |
---|
| 698 | if ( returnVals.size() != 0 ) { |
---|
| 699 | throw SemanticError( "Constructors and destructors cannot have explicit return values ", funcDecl ); |
---|
| 700 | } |
---|
| 701 | } |
---|
| 702 | |
---|
| 703 | Visitor::visit( funcDecl ); |
---|
| 704 | } |
---|
[70a06f6] | 705 | |
---|
[630a82a] | 706 | DeclarationWithType * CompoundLiteral::mutate( ObjectDecl *objectDecl ) { |
---|
| 707 | storageclass = objectDecl->get_storageClass(); |
---|
| 708 | DeclarationWithType * temp = Mutator::mutate( objectDecl ); |
---|
| 709 | storageclass = DeclarationNode::NoStorageClass; |
---|
| 710 | return temp; |
---|
| 711 | } |
---|
| 712 | |
---|
| 713 | Expression *CompoundLiteral::mutate( CompoundLiteralExpr *compLitExpr ) { |
---|
| 714 | // transform [storage_class] ... (struct S){ 3, ... }; |
---|
| 715 | // into [storage_class] struct S temp = { 3, ... }; |
---|
| 716 | static UniqueName indexName( "_compLit" ); |
---|
| 717 | |
---|
| 718 | ObjectDecl *tempvar = new ObjectDecl( indexName.newName(), storageclass, LinkageSpec::C, 0, compLitExpr->get_type(), compLitExpr->get_initializer() ); |
---|
| 719 | compLitExpr->set_type( 0 ); |
---|
| 720 | compLitExpr->set_initializer( 0 ); |
---|
| 721 | delete compLitExpr; |
---|
| 722 | DeclarationWithType * newtempvar = mutate( tempvar ); |
---|
| 723 | addDeclaration( newtempvar ); // add modified temporary to current block |
---|
| 724 | return new VariableExpr( newtempvar ); |
---|
| 725 | } |
---|
[51b7345] | 726 | } // namespace SymTab |
---|
[0dd3a2f] | 727 | |
---|
| 728 | // Local Variables: // |
---|
| 729 | // tab-width: 4 // |
---|
| 730 | // mode: c++ // |
---|
| 731 | // compile-command: "make install" // |
---|
| 732 | // End: // |
---|