Changes in / [3aba311:a5a71d0]
- Location:
- src
- Files:
-
- 4 added
- 39 edited
Legend:
- Unmodified
- Added
- Removed
-
src/CodeGen/CodeGenerator.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // CodeGenerator.cc -- 7 // CodeGenerator.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:32:16 201613 // Update Count : 2 4311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:08:06 2016 13 // Update Count : 255 14 14 // 15 15 … … 99 99 handleStorageClass( objectDecl ); 100 100 output << genType( objectDecl->get_type(), mangleName( objectDecl ) ); 101 101 102 102 if ( objectDecl->get_init() ) { 103 103 output << " = "; … … 113 113 if ( aggDecl->get_name() != "" ) 114 114 output << aggDecl->get_name(); 115 115 116 116 std::list< Declaration * > &memb = aggDecl->get_members(); 117 117 … … 119 119 output << " {" << endl; 120 120 121 cur_indent += CodeGenerator::tabsize; 121 cur_indent += CodeGenerator::tabsize; 122 122 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) { 123 output << indent; 123 output << indent; 124 124 (*i)->accept( *this ); 125 125 output << ";" << endl; 126 126 } 127 127 128 cur_indent -= CodeGenerator::tabsize; 128 cur_indent -= CodeGenerator::tabsize; 129 129 130 130 output << indent << "}"; … … 141 141 handleAggregate( aggregateDecl ); 142 142 } 143 143 144 144 void CodeGenerator::visit( EnumDecl *aggDecl ) { 145 145 output << "enum "; … … 147 147 if ( aggDecl->get_name() != "" ) 148 148 output << aggDecl->get_name(); 149 149 150 150 std::list< Declaration* > &memb = aggDecl->get_members(); 151 151 … … 153 153 output << " {" << endl; 154 154 155 cur_indent += CodeGenerator::tabsize; 155 cur_indent += CodeGenerator::tabsize; 156 156 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) { 157 157 ObjectDecl *obj = dynamic_cast< ObjectDecl* >( *i ); 158 158 assert( obj ); 159 output << indent << mangleName( obj ); 159 output << indent << mangleName( obj ); 160 160 if ( obj->get_init() ) { 161 161 output << " = "; … … 165 165 } // for 166 166 167 cur_indent -= CodeGenerator::tabsize; 167 cur_indent -= CodeGenerator::tabsize; 168 168 169 169 output << indent << "}"; 170 170 } // if 171 171 } 172 172 173 173 void CodeGenerator::visit( TraitDecl *aggregateDecl ) {} 174 174 175 175 void CodeGenerator::visit( TypedefDecl *typeDecl ) { 176 176 output << "typedef "; 177 177 output << genType( typeDecl->get_base(), typeDecl->get_name() ); 178 178 } 179 179 180 180 void CodeGenerator::visit( TypeDecl *typeDecl ) { 181 181 // really, we should mutate this into something that isn't a TypeDecl but that requires large-scale changes, … … 213 213 printDesignators( init->get_designators() ); 214 214 output << "{ "; 215 genCommaList( init->begin_initializers(), init->end_initializers() ); 215 if ( init->begin_initializers() == init->end_initializers() ) { 216 // illegal to leave initializer list empty for scalar initializers, 217 // but always legal to have 0 218 output << "0"; 219 } else { 220 genCommaList( init->begin_initializers(), init->end_initializers() ); 221 } 216 222 output << " }"; 217 223 } 218 224 219 void CodeGenerator::visit( Constant *constant ) { 225 void CodeGenerator::visit( Constant *constant ) { 220 226 output << constant->get_value() ; 221 227 } … … 234 240 assert( arg != applicationExpr->get_args().end() ); 235 241 if ( AddressExpr *addrExpr = dynamic_cast< AddressExpr * >( *arg ) ) { 236 242 237 243 *arg = addrExpr->get_arg(); 238 244 } else { … … 243 249 break; 244 250 } 245 251 246 252 default: 247 253 // do nothing 248 254 ; 249 255 } 250 256 251 257 switch ( opInfo.type ) { 252 258 case OT_INDEX: … … 257 263 output << "]"; 258 264 break; 259 265 260 266 case OT_CALL: 261 // there are no intrinsic definitions of the function call operator 267 // there are no intrinsic definitions of the function call operator or constructors or destructors 262 268 assert( false ); 263 269 break; 264 270 271 case OT_CTOR: 272 // it's just an optimization to disallow this, so for now let it through 273 // since it makes autogenerating constructors a lot easier 274 varExpr->accept( *this ); 275 output << "("; 276 genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() ); 277 output << ")"; 278 279 // intrinsic constructors should never be called directly - they should be transformed back into Initializer nodes 280 // assert(false); 281 break; 282 283 case OT_DTOR: 284 // intrinsic destructors do nothing - don't generate any code 285 output << " /* " << dynamic_cast<VariableExpr*>(applicationExpr->get_function())->get_var()->get_name() << " */"; 286 break; 287 265 288 case OT_PREFIX: 266 289 case OT_PREFIXASSIGN: … … 271 294 output << ")"; 272 295 break; 273 296 274 297 case OT_POSTFIX: 275 298 case OT_POSTFIXASSIGN: … … 278 301 output << opInfo.symbol; 279 302 break; 303 280 304 281 305 case OT_INFIX: … … 288 312 output << ")"; 289 313 break; 290 314 291 315 case OT_CONSTANT: 292 316 case OT_LABELADDRESS: … … 307 331 } // if 308 332 } 309 333 310 334 void CodeGenerator::visit( UntypedExpr *untypedExpr ) { 311 335 if ( NameExpr *nameExpr = dynamic_cast< NameExpr* >( untypedExpr->get_function() ) ) { … … 321 345 output << "]"; 322 346 break; 323 347 324 348 case OT_CALL: 325 349 assert( false ); 326 break; 327 350 351 case OT_CTOR: 352 case OT_DTOR: 353 // intrinsic constructors should never be called 354 // intrinsic destructors do nothing 355 break; 356 328 357 case OT_PREFIX: 329 358 case OT_PREFIXASSIGN: … … 335 364 output << ")"; 336 365 break; 337 366 338 367 case OT_POSTFIX: 339 368 case OT_POSTFIXASSIGN: … … 342 371 output << opInfo.symbol; 343 372 break; 344 373 345 374 case OT_INFIX: 346 375 case OT_INFIXASSIGN: … … 352 381 output << ")"; 353 382 break; 354 383 355 384 case OT_CONSTANT: 356 385 // there are no intrinsic definitions of 0 or 1 as functions … … 370 399 } // if 371 400 } 372 401 373 402 void CodeGenerator::visit( NameExpr *nameExpr ) { 374 403 OperatorInfo opInfo; … … 380 409 } // if 381 410 } 382 411 383 412 void CodeGenerator::visit( AddressExpr *addressExpr ) { 384 413 output << "(&"; … … 409 438 output << ")"; 410 439 } 411 440 412 441 void CodeGenerator::visit( UntypedMemberExpr *memberExpr ) { 413 442 assert( false ); 414 443 } 415 444 416 445 void CodeGenerator::visit( MemberExpr *memberExpr ) { 417 446 memberExpr->get_aggregate()->accept( *this ); 418 447 output << "." << mangleName( memberExpr->get_member() ); 419 448 } 420 449 421 450 void CodeGenerator::visit( VariableExpr *variableExpr ) { 422 451 OperatorInfo opInfo; … … 427 456 } // if 428 457 } 429 458 430 459 void CodeGenerator::visit( ConstantExpr *constantExpr ) { 431 460 assert( constantExpr->get_constant() ); 432 461 constantExpr->get_constant()->accept( *this ); 433 462 } 434 463 435 464 void CodeGenerator::visit( SizeofExpr *sizeofExpr ) { 436 465 output << "sizeof("; … … 465 494 output << ")"; 466 495 } 467 496 468 497 void CodeGenerator::visit( LogicalExpr *logicalExpr ) { 469 498 output << "("; … … 477 506 output << ")"; 478 507 } 479 508 480 509 void CodeGenerator::visit( ConditionalExpr *conditionalExpr ) { 481 510 output << "("; … … 487 516 output << ")"; 488 517 } 489 518 490 519 void CodeGenerator::visit( CommaExpr *commaExpr ) { 491 520 output << "("; … … 495 524 output << ")"; 496 525 } 497 526 498 527 void CodeGenerator::visit( TupleExpr *tupleExpr ) {} 499 528 500 529 void CodeGenerator::visit( TypeExpr *typeExpr ) {} 501 530 … … 528 557 } 529 558 } 530 cur_indent -= CodeGenerator::tabsize; 559 cur_indent -= CodeGenerator::tabsize; 531 560 532 561 output << indent << "}"; … … 534 563 535 564 void CodeGenerator::visit( ExprStmt *exprStmt ) { 536 // I don't see why this check is necessary. 537 // If this starts to cause problems then put it back in, 565 // I don't see why this check is necessary. 566 // If this starts to cause problems then put it back in, 538 567 // with an explanation 539 568 assert( exprStmt ); … … 585 614 switchStmt->get_condition()->accept( *this ); 586 615 output << " ) "; 587 616 588 617 output << "{" << std::endl; 589 618 cur_indent += CodeGenerator::tabsize; … … 605 634 } // if 606 635 output << ":\n"; 607 636 608 637 std::list<Statement *> sts = caseStmt->get_statements(); 609 638 … … 622 651 if ( ! branchStmt->get_target().empty() ) 623 652 output << "goto " << branchStmt->get_target(); 624 else { 653 else { 625 654 if ( branchStmt->get_computedTarget() != 0 ) { 626 655 output << "goto *"; … … 673 702 674 703 void CodeGenerator::visit( ForStmt *forStmt ) { 675 // initialization is always hoisted, so don't 676 // bother doing anything with that 704 // initialization is always hoisted, so don't 705 // bother doing anything with that 677 706 output << "for (;"; 678 707 … … 698 727 void CodeGenerator::visit( DeclStmt *declStmt ) { 699 728 declStmt->get_decl()->accept( *this ); 700 729 701 730 if ( doSemicolon( declStmt->get_decl() ) ) { 702 731 output << ";"; -
src/CodeGen/OperatorTable.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // OperatorTable.cc -- 7 // OperatorTable.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Tue Jun 23 17:41:14 201513 // Update Count : 511 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue Oct 06 15:26:34 2015 13 // Update Count : 9 14 14 // 15 15 … … 21 21 const OperatorInfo tableValues[] = { 22 22 { "?[?]", "", "_operator_index", OT_INDEX }, 23 { "?{}", "", "_constructor", OT_CTOR }, 24 { "^?{}", "", "_destructor", OT_DTOR }, 23 25 { "?()", "", "_operator_call", OT_CALL }, 24 26 { "?++", "++", "_operator_postincr", OT_POSTFIXASSIGN }, -
src/CodeGen/OperatorTable.h
r3aba311 ra5a71d0 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Tue Jun 23 16:09:27 201513 // Update Count : 311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jun 24 16:17:57 2015 13 // Update Count : 5 14 14 // 15 15 … … 22 22 enum OperatorType { 23 23 OT_INDEX, 24 OT_CTOR, 25 OT_DTOR, 24 26 OT_CALL, 25 27 OT_PREFIX, -
src/GenPoly/Box.cc
r3aba311 ra5a71d0 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Fri Feb 5 16:45:07201613 // Update Count : 2 8611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue Feb 09 14:39:52 2016 13 // Update Count : 295 14 14 // 15 15 … … 744 744 745 745 Expression *Pass1::makeOffsetArray( StructInstType *ty ) { 746 std::list<Expression*> noDesignators; 746 747 std::list< Declaration* > &baseMembers = ty->get_baseStruct()->get_members(); 747 748 … … 762 763 memberDecl = new ObjectDecl( (*member)->get_name(), DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, offsetType->clone(), 0 ); 763 764 } 764 inits.push_back( new SingleInit( new OffsetofExpr( ty->clone(), memberDecl ) ) );765 } 766 arrayTemp->set_init( new ListInit( inits ) );765 inits.push_back( new SingleInit( new OffsetofExpr( ty->clone(), memberDecl ), noDesignators ) ); 766 } 767 arrayTemp->set_init( new ListInit( inits, noDesignators ) ); 767 768 768 769 // return variable pointing to temporary … … 1903 1904 1904 1905 std::list<Expression*> designators; 1905 objectDecl->set_init( new SingleInit( alloc, designators ) );1906 objectDecl->set_init( new SingleInit( alloc, designators, false ) ); // not constructed 1906 1907 } 1907 1908 } … … 1944 1945 return derefdVar; 1945 1946 } 1946 1947 1947 1948 Expression *MemberExprFixer::mutate( MemberExpr *memberExpr ) { 1948 1949 // mutate, exiting early if no longer MemberExpr -
src/GenPoly/CopyParams.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // CopyParams.cc -- 7 // CopyParams.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr11 // Last Modified By : Rob Schluntz 12 12 // Last Modified On : Tue May 19 07:33:31 2015 13 13 // Update Count : 1 … … 29 29 public: 30 30 CopyParams(); 31 31 32 32 virtual void visit( FunctionDecl *funcDecl ); 33 33 virtual void visit( AddressExpr *addrExpr ); … … 50 50 if ( funcDecl->get_statements() ) { 51 51 funcDecl->get_statements()->accept( *this ); 52 52 53 53 if ( ! modVars.empty() ) { 54 54 std::map< std::string, DeclarationWithType* > assignOps; … … 57 57 if ( (*tyVar)->get_kind() == TypeDecl::Any ) { 58 58 assert( !(*tyVar)->get_assertions().empty() ); 59 assert( (*tyVar)->get_assertions().front()->get_name() == "?=?" ); 59 60 assignOps[ (*tyVar)->get_name() ] = (*tyVar)->get_assertions().front(); 60 61 } // if -
src/GenPoly/Specialize.cc
r3aba311 ra5a71d0 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jan 20 1 2:40:33201613 // Update Count : 1812 // Last Modified On : Wed Jan 20 13:00:00 2016 13 // Update Count : 24 14 14 // 15 15 … … 142 142 143 143 Expression * Specialize::doSpecialization( Type *formalType, Expression *actual, InferredParams *inferParams ) { 144 assert( ! actual->get_results().empty() ); 144 assert( ! actual->get_results().empty() ); // using front, should have this assert 145 145 if ( needsSpecialization( formalType, actual->get_results().front(), env ) ) { 146 146 FunctionType *funType; -
src/InitTweak/InitModel.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // InitModel.cc -- 7 // InitModel.cc -- 8 8 // 9 9 // Author : Rodolfo G. Esteves 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : T ue May 19 16:37:08 201513 // Update Count : 111 // Last Modified By : Rob Schluntz 12 // Last Modified On : Thu Jan 07 13:38:46 2016 13 // Update Count : 5 14 14 // 15 15 … … 198 198 assert(init == 0 && single != 0); 199 199 std::list< Expression * > empty; 200 init = new SingleInit( single->get_expr(), empty );200 init = new SingleInit( single->get_expr(), empty, false ); // cannot be constructed 201 201 return; 202 202 } … … 214 214 } // if 215 215 216 init = new ListInit( contents ); 216 std::list< Expression * > desig; 217 init = new ListInit( contents, desig, false ); // cannot be constructed 217 218 return; 218 219 } -
src/InitTweak/RemoveInit.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // RemoveInit.cc -- 7 // RemoveInit.cc -- 8 8 // 9 9 // Author : Rob Schluntz 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Tue Dec 15 15:37:26 2015 13 // Update Count : 15 14 // 15 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:18:03 2016 13 // Update Count : 166 14 // 15 16 #include <stack> 17 #include <list> 16 18 #include "RemoveInit.h" 17 19 #include "SynTree/Declaration.h" … … 21 23 #include "SynTree/Initializer.h" 22 24 #include "SynTree/Mutator.h" 25 #include "SymTab/Autogen.h" 26 #include "GenPoly/PolyMutator.h" 23 27 24 28 namespace InitTweak { 25 29 namespace { 26 30 const std::list<Label> noLabels; 27 } 28 29 class RemoveInit : public Mutator { 31 const std::list<Expression *> noDesignators; 32 } 33 34 class RemoveInit : public GenPoly::PolyMutator { 30 35 public: 36 /// removes and replaces initialization for polymorphic value objects 37 /// with assignment (TODO: constructor) statements. 38 /// also consistently allocates a temporary variable for the return value 39 /// of a function so that anything which the resolver decides can be assigned 40 /// into the return type of a function can be returned. 41 static void removeInitializers( std::list< Declaration * > &translationUnit ); 42 31 43 RemoveInit(); 32 virtual ObjectDecl * mutate( ObjectDecl *objDecl);44 virtual ObjectDecl * mutate( ObjectDecl *objDecl ); 33 45 virtual DeclarationWithType * mutate( FunctionDecl *functionDecl ); 34 46 35 47 virtual Statement * mutate( ReturnStmt * returnStmt ); 36 37 virtual CompoundStmt * mutate(CompoundStmt * compoundStmt); 38 48 39 49 protected: 40 std::list< Statement* > stmtsToAddBefore;41 std::list< Statement* > stmtsToAddAfter;42 void mutateStatementList( std::list< Statement* > &statements );43 44 50 std::list<DeclarationWithType*> returnVals; 45 51 UniqueName tempNamer; … … 47 53 }; 48 54 49 void tweak( std::list< Declaration * > translationUnit ) { 55 class CtorDtor : public GenPoly::PolyMutator { 56 public: 57 /// create constructor and destructor statements for object declarations. 58 /// Destructors are inserted directly into the code, whereas constructors 59 /// will be added in after the resolver has run so that the initializer expression 60 /// is only removed if a constructor is found 61 static void generateCtorDtor( std::list< Declaration * > &translationUnit ); 62 63 CtorDtor() : inFunction( false ) {} 64 65 virtual ObjectDecl * mutate( ObjectDecl * ); 66 virtual DeclarationWithType * mutate( FunctionDecl *functionDecl ); 67 virtual Declaration* mutate( StructDecl *aggregateDecl ); 68 virtual Declaration* mutate( UnionDecl *aggregateDecl ); 69 virtual Declaration* mutate( EnumDecl *aggregateDecl ); 70 virtual Declaration* mutate( TraitDecl *aggregateDecl ); 71 virtual TypeDecl* mutate( TypeDecl *typeDecl ); 72 virtual Declaration* mutate( TypedefDecl *typeDecl ); 73 74 protected: 75 bool inFunction; 76 }; 77 78 void tweak( std::list< Declaration * > & translationUnit ) { 79 RemoveInit::removeInitializers( translationUnit ); 80 CtorDtor::generateCtorDtor( translationUnit ); 81 } 82 83 void RemoveInit::removeInitializers( std::list< Declaration * > & translationUnit ) { 50 84 RemoveInit remover; 51 85 mutateAll( translationUnit, remover ); … … 53 87 54 88 RemoveInit::RemoveInit() : tempNamer( "_retVal" ) {} 55 56 void RemoveInit::mutateStatementList( std::list< Statement* > &statements ) {57 for ( std::list< Statement* >::iterator i = statements.begin(); i != statements.end(); ++i ) {58 if ( ! stmtsToAddAfter.empty() ) {59 statements.splice( i, stmtsToAddAfter );60 } // if61 *i = (*i)->acceptMutator( *this );62 if ( ! stmtsToAddBefore.empty() ) {63 statements.splice( i, stmtsToAddBefore );64 } // if65 } // for66 if ( ! stmtsToAddAfter.empty() ) {67 statements.splice( statements.end(), stmtsToAddAfter );68 } // if69 }70 71 CompoundStmt *RemoveInit::mutate(CompoundStmt *compoundStmt) {72 mutateStatementList( compoundStmt->get_kids() );73 return compoundStmt;74 }75 89 76 90 // in the case where an object has an initializer and a polymorphic type, insert an assignment immediately after the … … 79 93 if (objDecl->get_init() && dynamic_cast<TypeInstType*>(objDecl->get_type())) { 80 94 if (SingleInit * single = dynamic_cast<SingleInit*>(objDecl->get_init())) { 81 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?=?" ) ); 95 // xxx this can be more complicated - consider ListInit 96 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?{}" ) ); 82 97 assign->get_args().push_back( new AddressExpr (new NameExpr( objDecl->get_name() ) ) ); 83 98 assign->get_args().push_back( single->get_value()->clone() ); … … 94 109 // is being returned 95 110 if ( returnStmt->get_expr() && returnVals.size() == 1 && funcName != "?=?" && ! returnVals.front()->get_type()->get_isLvalue() ) { 96 ObjectDecl *newObj = new ObjectDecl( tempNamer.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, returnVals.front()->get_type()->clone(), 0 ); 97 stmtsToAddBefore.push_back( new DeclStmt( noLabels, newObj ) ); 98 99 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?=?" ) ); 100 assign->get_args().push_back( new AddressExpr (new NameExpr( newObj->get_name() ) ) ); 101 assign->get_args().push_back( returnStmt->get_expr() ); 102 stmtsToAddBefore.push_back(new ExprStmt(noLabels, assign)); 111 // ensure return value is not destructed by explicitly creating 112 // an empty SingleInit node wherein maybeConstruct is false 113 ObjectDecl *newObj = new ObjectDecl( tempNamer.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, returnVals.front()->get_type()->clone(), new ListInit( std::list<Initializer*>(), noDesignators, false ) ); 114 stmtsToAdd.push_back( new DeclStmt( noLabels, newObj ) ); 115 116 // and explicitly create the constructor expression separately 117 UntypedExpr *construct = new UntypedExpr( new NameExpr( "?{}" ) ); 118 construct->get_args().push_back( new AddressExpr (new NameExpr( newObj->get_name() ) ) ); 119 construct->get_args().push_back( returnStmt->get_expr() ); 120 stmtsToAdd.push_back(new ExprStmt(noLabels, construct)); 103 121 104 122 returnStmt->set_expr( new VariableExpr( newObj ) ); … … 110 128 std::list<DeclarationWithType*> oldReturnVals = returnVals; 111 129 std::string oldFuncName = funcName; 112 130 113 131 FunctionType * type = functionDecl->get_functionType(); 114 132 returnVals = type->get_returnVals(); … … 119 137 return decl; 120 138 } 139 140 141 void CtorDtor::generateCtorDtor( std::list< Declaration * > & translationUnit ) { 142 CtorDtor ctordtor; 143 mutateAll( translationUnit, ctordtor ); 144 } 145 146 namespace { 147 bool tryConstruct( ObjectDecl * objDecl ) { 148 // xxx - handle designations 149 return ! LinkageSpec::isBuiltin( objDecl->get_linkage() ) && 150 (objDecl->get_init() == NULL || 151 ( objDecl->get_init() != NULL && objDecl->get_init()->get_maybeConstructed() )); 152 } 153 154 Expression * makeCtorDtorExpr( std::string name, ObjectDecl * objDecl, std::list< Expression * > args ) { 155 UntypedExpr * expr = new UntypedExpr( new NameExpr( name ) ); 156 expr->get_args().push_back( new AddressExpr( new VariableExpr( objDecl ) ) ); 157 expr->get_args().splice( expr->get_args().end(), args ); 158 return expr; 159 } 160 161 class InitExpander : public Visitor { 162 public: 163 InitExpander() {} 164 // ~InitExpander() {} 165 virtual void visit( SingleInit * singleInit ); 166 virtual void visit( ListInit * listInit ); 167 std::list< Expression * > argList; 168 }; 169 170 void InitExpander::visit( SingleInit * singleInit ) { 171 argList.push_back( singleInit->get_value()->clone() ); 172 } 173 174 void InitExpander::visit( ListInit * listInit ) { 175 // xxx - for now, assume no nested list inits 176 std::list<Initializer*>::iterator it = listInit->begin_initializers(); 177 for ( ; it != listInit->end_initializers(); ++it ) { 178 (*it)->accept( *this ); 179 } 180 } 181 182 std::list< Expression * > makeInitList( Initializer * init ) { 183 InitExpander expander; 184 maybeAccept( init, expander ); 185 return expander.argList; 186 } 187 } 188 189 ObjectDecl * CtorDtor::mutate( ObjectDecl * objDecl ) { 190 // hands off if designated or if @= 191 if ( tryConstruct( objDecl ) ) { 192 if ( inFunction ) { 193 if ( ArrayType * at = dynamic_cast< ArrayType * >( objDecl->get_type() ) ) { 194 // call into makeArrayFunction from validate.cc to generate calls to ctor/dtor for each element of array 195 // TODO: walk initializer and generate appropriate copy ctor if element has initializer 196 std::list< Statement * > ctor; 197 std::list< Statement * > dtor; 198 199 SymTab::makeArrayFunction( NULL, new VariableExpr( objDecl ), at, "?{}", back_inserter( ctor ) ); 200 SymTab::makeArrayFunction( NULL, new VariableExpr( objDecl ), at, "^?{}", front_inserter( dtor ), false ); 201 202 // Currently makeArrayFunction produces a single Statement - a CompoundStmt 203 // which wraps everything that needs to happen. As such, it's technically 204 // possible to use a Statement ** in the above calls, but this is inherently 205 // unsafe, so instead we take the slightly less efficient route, but will be 206 // immediately informed if somehow the above assumption is broken. In this case, 207 // we could always wrap the list of statements at this point with a CompoundStmt, 208 // but it seems reasonable at the moment for this to be done by makeArrayFunction 209 // itself 210 assert( ctor.size() == 1 ); 211 assert( dtor.size() == 1 ); 212 213 objDecl->set_init( new ConstructorInit( ctor.front(), dtor.front(), objDecl->get_init() ) ); 214 } else { 215 // it's sufficient to attempt to call the ctor/dtor for the given object and its initializer 216 Expression * ctor = makeCtorDtorExpr( "?{}", objDecl, makeInitList( objDecl->get_init() ) ); 217 Expression * dtor = makeCtorDtorExpr( "^?{}", objDecl, std::list< Expression * >() ); 218 219 // need to remember init expression, in case no ctors exist 220 // if ctor does exist, want to use ctor expression instead of init 221 // push this decision to the resolver 222 ExprStmt * ctorStmt = new ExprStmt( noLabels, ctor ); 223 ExprStmt * dtorStmt = new ExprStmt( noLabels, dtor ); 224 objDecl->set_init( new ConstructorInit( ctorStmt, dtorStmt, objDecl->get_init() ) ); 225 } 226 } else { 227 // xxx - find a way to construct/destruct globals 228 // hack: implicit "static" initialization routine for each struct type? or something similar? 229 // --ties into module system 230 // this can be done by mangling main and replacing it with our own main which calls each 231 // module initialization routine in some decided order (order given in link command?) 232 // and finally calls mangled main 233 } 234 } 235 return objDecl; 236 } 237 238 DeclarationWithType * CtorDtor::mutate( FunctionDecl *functionDecl ) { 239 // parameters should not be constructed and destructed, so don't mutate FunctionType 240 bool oldInFunc = inFunction; 241 mutateAll( functionDecl->get_oldDecls(), *this ); 242 inFunction = true; 243 functionDecl->set_statements( maybeMutate( functionDecl->get_statements(), *this ) ); 244 inFunction = oldInFunc; 245 return functionDecl; 246 } 247 248 // should not traverse into any of these declarations to find objects 249 // that need to be constructed or destructed 250 Declaration* CtorDtor::mutate( StructDecl *aggregateDecl ) { return aggregateDecl; } 251 Declaration* CtorDtor::mutate( UnionDecl *aggregateDecl ) { return aggregateDecl; } 252 Declaration* CtorDtor::mutate( EnumDecl *aggregateDecl ) { return aggregateDecl; } 253 Declaration* CtorDtor::mutate( TraitDecl *aggregateDecl ) { return aggregateDecl; } 254 TypeDecl* CtorDtor::mutate( TypeDecl *typeDecl ) { return typeDecl; } 255 Declaration* CtorDtor::mutate( TypedefDecl *typeDecl ) { return typeDecl; } 256 121 257 } // namespace InitTweak 122 258 -
src/InitTweak/RemoveInit.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // RemoveInit.h -- 7 // RemoveInit.h -- 8 8 // 9 9 // Author : Rodolfo G. Esteves 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Fri Nov 27 17:00:47 201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Jan 11 16:02:44 2016 13 // Update Count : 3 14 14 // 15 15 … … 26 26 namespace InitTweak { 27 27 /// Adds assignment statements for polymorphic type initializers 28 void tweak( std::list< Declaration * > translationUnit );29 } // namespace 28 void tweak( std::list< Declaration * > & translationUnit ); 29 } // namespace 30 30 31 31 #endif // GENPOLY_POLYMUTATOR_H -
src/InitTweak/module.mk
r3aba311 ra5a71d0 11 11 ## Created On : Mon Jun 1 17:49:17 2015 12 12 ## Last Modified By : Rob Schluntz 13 ## Last Modified On : Mon Jan 11 14:40:16201614 ## Update Count : 213 ## Last Modified On : Wed Jan 13 16:29:03 2016 14 ## Update Count : 3 15 15 ############################################################################### 16 16 17 SRC += InitTweak/RemoveInit.cc 18 17 SRC += InitTweak/RemoveInit.cc \ 18 InitTweak/FixInit.cc -
src/MakeLibCfa.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // MakeLibCfa.cc -- 7 // MakeLibCfa.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Sat May 16 10:33:33 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Fri Jun 26 16:52:59 201513 // Update Count : 1414 // 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue Jan 19 13:20:26 2016 13 // Update Count : 40 14 // 15 15 16 16 #include "MakeLibCfa.h" … … 29 29 void visit( FunctionDecl* funcDecl ); 30 30 void visit( ObjectDecl* objDecl ); 31 31 32 32 std::list< Declaration* > &get_newDecls() { return newDecls; } 33 33 private: … … 43 43 void MakeLibCfa::visit( FunctionDecl* origFuncDecl ) { 44 44 if ( origFuncDecl->get_linkage() != LinkageSpec::Intrinsic ) return; 45 45 46 46 FunctionDecl *funcDecl = origFuncDecl->clone(); 47 47 CodeGen::OperatorInfo opInfo; … … 54 54 assert( param != funcDecl->get_functionType()->get_parameters().end() ); 55 55 56 if ( (*param)->get_name() == "" ) { 57 (*param)->set_name( paramNamer.newName() ); 58 (*param)->set_linkage( LinkageSpec::C ); 59 } // if 56 for ( ; param != funcDecl->get_functionType()->get_parameters().end(); ++param ) { 57 if ( (*param)->get_name() == "" ) { 58 (*param)->set_name( paramNamer.newName() ); 59 (*param)->set_linkage( LinkageSpec::C ); 60 } 61 newExpr->get_args().push_back( new VariableExpr( *param ) ); 62 } // for 63 64 funcDecl->set_statements( new CompoundStmt( std::list< Label >() ) ); 65 newDecls.push_back( funcDecl ); 60 66 61 67 switch ( opInfo.type ) { … … 65 71 case CodeGen::OT_POSTFIX: 66 72 case CodeGen::OT_INFIX: 67 newExpr->get_args().push_back( new VariableExpr( *param ) );68 break;69 73 case CodeGen::OT_PREFIXASSIGN: 70 74 case CodeGen::OT_POSTFIXASSIGN: 71 75 case CodeGen::OT_INFIXASSIGN: 72 { 73 newExpr->get_args().push_back( new VariableExpr( *param ) ); 74 // UntypedExpr *deref = new UntypedExpr( new NameExpr( "*?" ) ); 75 // deref->get_args().push_back( new VariableExpr( *param ) ); 76 // newExpr->get_args().push_back( deref ); 76 funcDecl->get_statements()->get_kids().push_back( new ReturnStmt( std::list< Label >(), newExpr ) ); 77 77 break; 78 } 78 case CodeGen::OT_CTOR: 79 // ctors don't return a value 80 if ( funcDecl->get_functionType()->get_parameters().size() == 1 ) { 81 // intrinsic default constructors should do nothing 82 // delete newExpr; 83 break; 84 } else { 85 assert( funcDecl->get_functionType()->get_parameters().size() == 2 ); 86 // anything else is a single parameter constructor that is effectively a C-style assignment 87 // delete newExpr->get_function(); 88 assert(newExpr->get_args().size()==2); 89 newExpr->set_function( new NameExpr( "?=?" ) ); 90 funcDecl->get_statements()->get_kids().push_back( new ExprStmt( std::list< Label >(), newExpr ) ); 91 } 92 break; 93 case CodeGen::OT_DTOR: 94 // intrinsic destructors should do nothing 95 // delete newExpr; 96 break; 79 97 case CodeGen::OT_CONSTANT: 80 98 case CodeGen::OT_LABELADDRESS: … … 82 100 assert( false ); 83 101 } // switch 84 85 for ( param++; param != funcDecl->get_functionType()->get_parameters().end(); ++param ) {86 if ( (*param)->get_name() == "" ) {87 (*param)->set_name( paramNamer.newName() );88 (*param)->set_linkage( LinkageSpec::C );89 }90 newExpr->get_args().push_back( new VariableExpr( *param ) );91 } // for92 funcDecl->set_statements( new CompoundStmt( std::list< Label >() ) );93 funcDecl->get_statements()->get_kids().push_back( new ReturnStmt( std::list< Label >(), newExpr ) );94 newDecls.push_back( funcDecl );95 102 } 96 103 97 104 void MakeLibCfa::visit( ObjectDecl* origObjDecl ) { 98 105 if ( origObjDecl->get_linkage() != LinkageSpec::Intrinsic ) return; 99 106 100 107 ObjectDecl *objDecl = origObjDecl->clone(); 101 108 assert( ! objDecl->get_init() ); 102 109 std::list< Expression* > noDesignators; 103 objDecl->set_init( new SingleInit( new NameExpr( objDecl->get_name() ), noDesignators ) );110 objDecl->set_init( new SingleInit( new NameExpr( objDecl->get_name() ), noDesignators, false ) ); // cannot be constructed 104 111 newDecls.push_back( objDecl ); 105 112 } 106 113 } // namespace LibCfa 107 108 // Local Variables: //109 // tab-width: 4 //110 // mode: c++ //111 // compile-command: "make install" //112 // End: // -
src/Makefile.in
r3aba311 ra5a71d0 124 124 GenPoly/driver_cfa_cpp-DeclMutator.$(OBJEXT) \ 125 125 InitTweak/driver_cfa_cpp-RemoveInit.$(OBJEXT) \ 126 InitTweak/driver_cfa_cpp-FixInit.$(OBJEXT) \ 126 127 Parser/driver_cfa_cpp-parser.$(OBJEXT) \ 127 128 Parser/driver_cfa_cpp-lex.$(OBJEXT) \ … … 159 160 SymTab/driver_cfa_cpp-ImplementationType.$(OBJEXT) \ 160 161 SymTab/driver_cfa_cpp-TypeEquality.$(OBJEXT) \ 162 SymTab/driver_cfa_cpp-Autogen.$(OBJEXT) \ 161 163 SynTree/driver_cfa_cpp-Type.$(OBJEXT) \ 162 164 SynTree/driver_cfa_cpp-VoidType.$(OBJEXT) \ … … 346 348 GenPoly/CopyParams.cc GenPoly/FindFunction.cc \ 347 349 GenPoly/DeclMutator.cc InitTweak/RemoveInit.cc \ 348 Parser/parser.yy Parser/lex.ll Parser/TypedefTable.cc \ 349 Parser/ParseNode.cc Parser/DeclarationNode.cc \ 350 Parser/ExpressionNode.cc Parser/StatementNode.cc \ 351 Parser/InitializerNode.cc Parser/TypeData.cc \ 352 Parser/LinkageSpec.cc Parser/parseutility.cc Parser/Parser.cc \ 350 InitTweak/FixInit.cc Parser/parser.yy Parser/lex.ll \ 351 Parser/TypedefTable.cc Parser/ParseNode.cc \ 352 Parser/DeclarationNode.cc Parser/ExpressionNode.cc \ 353 Parser/StatementNode.cc Parser/InitializerNode.cc \ 354 Parser/TypeData.cc Parser/LinkageSpec.cc \ 355 Parser/parseutility.cc Parser/Parser.cc \ 353 356 ResolvExpr/AlternativeFinder.cc ResolvExpr/Alternative.cc \ 354 357 ResolvExpr/Unify.cc ResolvExpr/PtrsAssignable.cc \ … … 362 365 SymTab/Mangler.cc SymTab/Validate.cc SymTab/FixFunction.cc \ 363 366 SymTab/ImplementationType.cc SymTab/TypeEquality.cc \ 364 SynTree/Type.cc SynTree/VoidType.cc SynTree/BasicType.cc \ 365 SynTree/PointerType.cc SynTree/ArrayType.cc \ 366 SynTree/FunctionType.cc SynTree/ReferenceToType.cc \ 367 SynTree/TupleType.cc SynTree/TypeofType.cc SynTree/AttrType.cc \ 367 SymTab/Autogen.cc SynTree/Type.cc SynTree/VoidType.cc \ 368 SynTree/BasicType.cc SynTree/PointerType.cc \ 369 SynTree/ArrayType.cc SynTree/FunctionType.cc \ 370 SynTree/ReferenceToType.cc SynTree/TupleType.cc \ 371 SynTree/TypeofType.cc SynTree/AttrType.cc \ 368 372 SynTree/VarArgsType.cc SynTree/Constant.cc \ 369 373 SynTree/Expression.cc SynTree/TupleExpr.cc \ … … 563 567 InitTweak/driver_cfa_cpp-RemoveInit.$(OBJEXT): \ 564 568 InitTweak/$(am__dirstamp) InitTweak/$(DEPDIR)/$(am__dirstamp) 569 InitTweak/driver_cfa_cpp-FixInit.$(OBJEXT): InitTweak/$(am__dirstamp) \ 570 InitTweak/$(DEPDIR)/$(am__dirstamp) 565 571 Parser/parser.h: Parser/parser.cc 566 572 @if test ! -f $@; then rm -f Parser/parser.cc; else :; fi … … 670 676 SymTab/driver_cfa_cpp-TypeEquality.$(OBJEXT): SymTab/$(am__dirstamp) \ 671 677 SymTab/$(DEPDIR)/$(am__dirstamp) 678 SymTab/driver_cfa_cpp-Autogen.$(OBJEXT): SymTab/$(am__dirstamp) \ 679 SymTab/$(DEPDIR)/$(am__dirstamp) 672 680 SynTree/$(am__dirstamp): 673 681 @$(MKDIR_P) SynTree … … 792 800 -rm -f GenPoly/driver_cfa_cpp-ScrubTyVars.$(OBJEXT) 793 801 -rm -f GenPoly/driver_cfa_cpp-Specialize.$(OBJEXT) 802 -rm -f InitTweak/driver_cfa_cpp-FixInit.$(OBJEXT) 794 803 -rm -f InitTweak/driver_cfa_cpp-RemoveInit.$(OBJEXT) 795 804 -rm -f Parser/driver_cfa_cpp-DeclarationNode.$(OBJEXT) … … 822 831 -rm -f ResolvExpr/driver_cfa_cpp-TypeEnvironment.$(OBJEXT) 823 832 -rm -f ResolvExpr/driver_cfa_cpp-Unify.$(OBJEXT) 833 -rm -f SymTab/driver_cfa_cpp-Autogen.$(OBJEXT) 824 834 -rm -f SymTab/driver_cfa_cpp-FixFunction.$(OBJEXT) 825 835 -rm -f SymTab/driver_cfa_cpp-ImplementationType.$(OBJEXT) … … 897 907 @AMDEP_TRUE@@am__include@ @am__quote@GenPoly/$(DEPDIR)/driver_cfa_cpp-ScrubTyVars.Po@am__quote@ 898 908 @AMDEP_TRUE@@am__include@ @am__quote@GenPoly/$(DEPDIR)/driver_cfa_cpp-Specialize.Po@am__quote@ 909 @AMDEP_TRUE@@am__include@ @am__quote@InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Po@am__quote@ 899 910 @AMDEP_TRUE@@am__include@ @am__quote@InitTweak/$(DEPDIR)/driver_cfa_cpp-RemoveInit.Po@am__quote@ 900 911 @AMDEP_TRUE@@am__include@ @am__quote@Parser/$(DEPDIR)/driver_cfa_cpp-DeclarationNode.Po@am__quote@ … … 927 938 @AMDEP_TRUE@@am__include@ @am__quote@ResolvExpr/$(DEPDIR)/driver_cfa_cpp-TypeEnvironment.Po@am__quote@ 928 939 @AMDEP_TRUE@@am__include@ @am__quote@ResolvExpr/$(DEPDIR)/driver_cfa_cpp-Unify.Po@am__quote@ 940 @AMDEP_TRUE@@am__include@ @am__quote@SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Po@am__quote@ 929 941 @AMDEP_TRUE@@am__include@ @am__quote@SymTab/$(DEPDIR)/driver_cfa_cpp-FixFunction.Po@am__quote@ 930 942 @AMDEP_TRUE@@am__include@ @am__quote@SymTab/$(DEPDIR)/driver_cfa_cpp-ImplementationType.Po@am__quote@ … … 1380 1392 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o InitTweak/driver_cfa_cpp-RemoveInit.obj `if test -f 'InitTweak/RemoveInit.cc'; then $(CYGPATH_W) 'InitTweak/RemoveInit.cc'; else $(CYGPATH_W) '$(srcdir)/InitTweak/RemoveInit.cc'; fi` 1381 1393 1394 InitTweak/driver_cfa_cpp-FixInit.o: InitTweak/FixInit.cc 1395 @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -MT InitTweak/driver_cfa_cpp-FixInit.o -MD -MP -MF InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Tpo -c -o InitTweak/driver_cfa_cpp-FixInit.o `test -f 'InitTweak/FixInit.cc' || echo '$(srcdir)/'`InitTweak/FixInit.cc 1396 @am__fastdepCXX_TRUE@ $(am__mv) InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Tpo InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Po 1397 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='InitTweak/FixInit.cc' object='InitTweak/driver_cfa_cpp-FixInit.o' libtool=no @AMDEPBACKSLASH@ 1398 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ 1399 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o InitTweak/driver_cfa_cpp-FixInit.o `test -f 'InitTweak/FixInit.cc' || echo '$(srcdir)/'`InitTweak/FixInit.cc 1400 1401 InitTweak/driver_cfa_cpp-FixInit.obj: InitTweak/FixInit.cc 1402 @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -MT InitTweak/driver_cfa_cpp-FixInit.obj -MD -MP -MF InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Tpo -c -o InitTweak/driver_cfa_cpp-FixInit.obj `if test -f 'InitTweak/FixInit.cc'; then $(CYGPATH_W) 'InitTweak/FixInit.cc'; else $(CYGPATH_W) '$(srcdir)/InitTweak/FixInit.cc'; fi` 1403 @am__fastdepCXX_TRUE@ $(am__mv) InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Tpo InitTweak/$(DEPDIR)/driver_cfa_cpp-FixInit.Po 1404 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='InitTweak/FixInit.cc' object='InitTweak/driver_cfa_cpp-FixInit.obj' libtool=no @AMDEPBACKSLASH@ 1405 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ 1406 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o InitTweak/driver_cfa_cpp-FixInit.obj `if test -f 'InitTweak/FixInit.cc'; then $(CYGPATH_W) 'InitTweak/FixInit.cc'; else $(CYGPATH_W) '$(srcdir)/InitTweak/FixInit.cc'; fi` 1407 1382 1408 Parser/driver_cfa_cpp-parser.o: Parser/parser.cc 1383 1409 @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -MT Parser/driver_cfa_cpp-parser.o -MD -MP -MF Parser/$(DEPDIR)/driver_cfa_cpp-parser.Tpo -c -o Parser/driver_cfa_cpp-parser.o `test -f 'Parser/parser.cc' || echo '$(srcdir)/'`Parser/parser.cc … … 1869 1895 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ 1870 1896 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o SymTab/driver_cfa_cpp-TypeEquality.obj `if test -f 'SymTab/TypeEquality.cc'; then $(CYGPATH_W) 'SymTab/TypeEquality.cc'; else $(CYGPATH_W) '$(srcdir)/SymTab/TypeEquality.cc'; fi` 1897 1898 SymTab/driver_cfa_cpp-Autogen.o: SymTab/Autogen.cc 1899 @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -MT SymTab/driver_cfa_cpp-Autogen.o -MD -MP -MF SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Tpo -c -o SymTab/driver_cfa_cpp-Autogen.o `test -f 'SymTab/Autogen.cc' || echo '$(srcdir)/'`SymTab/Autogen.cc 1900 @am__fastdepCXX_TRUE@ $(am__mv) SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Tpo SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Po 1901 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='SymTab/Autogen.cc' object='SymTab/driver_cfa_cpp-Autogen.o' libtool=no @AMDEPBACKSLASH@ 1902 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ 1903 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o SymTab/driver_cfa_cpp-Autogen.o `test -f 'SymTab/Autogen.cc' || echo '$(srcdir)/'`SymTab/Autogen.cc 1904 1905 SymTab/driver_cfa_cpp-Autogen.obj: SymTab/Autogen.cc 1906 @am__fastdepCXX_TRUE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -MT SymTab/driver_cfa_cpp-Autogen.obj -MD -MP -MF SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Tpo -c -o SymTab/driver_cfa_cpp-Autogen.obj `if test -f 'SymTab/Autogen.cc'; then $(CYGPATH_W) 'SymTab/Autogen.cc'; else $(CYGPATH_W) '$(srcdir)/SymTab/Autogen.cc'; fi` 1907 @am__fastdepCXX_TRUE@ $(am__mv) SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Tpo SymTab/$(DEPDIR)/driver_cfa_cpp-Autogen.Po 1908 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ source='SymTab/Autogen.cc' object='SymTab/driver_cfa_cpp-Autogen.obj' libtool=no @AMDEPBACKSLASH@ 1909 @AMDEP_TRUE@@am__fastdepCXX_FALSE@ DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) @AMDEPBACKSLASH@ 1910 @am__fastdepCXX_FALSE@ $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(driver_cfa_cpp_CXXFLAGS) $(CXXFLAGS) -c -o SymTab/driver_cfa_cpp-Autogen.obj `if test -f 'SymTab/Autogen.cc'; then $(CYGPATH_W) 'SymTab/Autogen.cc'; else $(CYGPATH_W) '$(srcdir)/SymTab/Autogen.cc'; fi` 1871 1911 1872 1912 SynTree/driver_cfa_cpp-Type.o: SynTree/Type.cc -
src/Parser/DeclarationNode.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // DeclarationNode.cc -- 7 // DeclarationNode.cc -- 8 8 // 9 9 // Author : Rodolfo G. Esteves 10 10 // Created On : Sat May 16 12:34:05 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Mon Mar 21 21:04:23201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:09:46 2016 13 13 // Update Count : 142 14 14 // … … 97 97 os << endl << string( indent + 2, ' ' ) << "with initializer "; 98 98 initializer->printOneLine( os ); 99 os << " maybe constructed? " << initializer->get_maybeConstructed(); 100 99 101 } // if 100 102 … … 369 371 } // if 370 372 } 371 373 372 374 DeclarationNode *DeclarationNode::addQualifiers( DeclarationNode *q ) { 373 375 if ( q ) { … … 520 522 assert( false ); 521 523 } // switch 522 524 523 525 return this; 524 526 } … … 631 633 assert( a->type->kind == TypeData::Array ); 632 634 TypeData *lastArray = findLast( a->type ); 633 if ( type ) { 635 if ( type ) { 634 636 switch ( type->kind ) { 635 637 case TypeData::Aggregate: … … 675 677 } // if 676 678 } 677 679 678 680 DeclarationNode *DeclarationNode::addIdList( DeclarationNode *ids ) { 679 681 type = addIdListToType( type, ids ); … … 880 882 Type *DeclarationNode::buildType() const { 881 883 assert( type ); 882 884 883 885 switch ( type->kind ) { 884 886 case TypeData::Enum: -
src/Parser/InitializerNode.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // InitializerNode.cc -- 8 // 7 // InitializerNode.cc -- 8 // 9 9 // Author : Rodolfo G. Esteves 10 10 // Created On : Sat May 16 13:20:24 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Thu Oct 8 17:18:55 201513 // Update Count : 414 // 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Thu Jan 07 13:32:57 2016 13 // Update Count : 13 14 // 15 15 16 16 #include <cassert> … … 23 23 24 24 InitializerNode::InitializerNode( ExpressionNode *_expr, bool aggrp, ExpressionNode *des ) 25 : expr( _expr ), aggregate( aggrp ), designator( des ), kids( 0 ) {25 : expr( _expr ), aggregate( aggrp ), designator( des ), kids( 0 ), maybeConstructed( true ) { 26 26 if ( aggrp ) 27 27 kids = dynamic_cast< InitializerNode *>( get_link() ); … … 32 32 33 33 InitializerNode::InitializerNode( InitializerNode *init, bool aggrp, ExpressionNode *des ) 34 : expr( 0 ), aggregate( aggrp ), designator( des ), kids( 0 ) {34 : expr( 0 ), aggregate( aggrp ), designator( des ), kids( 0 ), maybeConstructed( true ) { 35 35 if ( init != 0 ) 36 36 set_link(init); … … 91 91 } // if 92 92 93 return new ListInit( initlist, designlist );93 return new ListInit( initlist, designlist, maybeConstructed ); 94 94 } else { 95 95 std::list< Expression *> designators; … … 99 99 100 100 if ( get_expression() != 0) 101 return new SingleInit( get_expression()->build(), designators );101 return new SingleInit( get_expression()->build(), designators, maybeConstructed ); 102 102 } // if 103 103 -
src/Parser/ParseNode.h
r3aba311 ra5a71d0 10 10 // Created On : Sat May 16 13:28:16 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17: 04:22201612 // Last Modified On : Mon Apr 04 17:10:10 2016 13 13 // Update Count : 190 14 14 // … … 185 185 // monadic 186 186 UnPlus, UnMinus, AddressOf, PointTo, Neg, BitNeg, Incr, IncrPost, Decr, DecrPost, LabelAddress, 187 Ctor, Dtor, 187 188 }; 188 189 … … 525 526 ExpressionNode *get_designators() const { return designator; } 526 527 528 InitializerNode *set_maybeConstructed( bool value ) { maybeConstructed = value; return this; } 529 bool get_maybeConstructed() const { return maybeConstructed; } 530 527 531 InitializerNode *next_init() const { return kids; } 528 532 … … 536 540 ExpressionNode *designator; // may be list 537 541 InitializerNode *kids; 542 bool maybeConstructed; 538 543 }; 539 544 -
src/Parser/TypeData.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // TypeData.cc -- 7 // TypeData.cc -- 8 8 // 9 9 // Author : Rodolfo G. Esteves 10 10 // Created On : Sat May 16 15:12:51 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:26:45201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Apr 06 16:57:53 2016 13 13 // Update Count : 49 14 14 // … … 449 449 for ( std::list< TypeDecl* >::iterator i = outputList.begin(); i != outputList.end(); ++i ) { 450 450 if ( (*i)->get_kind() == TypeDecl::Any ) { 451 // add assertion parameters to `type' tyvars in reverse order 452 // add dtor: void ^?{}(T *) 453 FunctionType *dtorType = new FunctionType( Type::Qualifiers(), false ); 454 dtorType->get_parameters().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), (*i)->get_name(), *i ) ), 0 ) ); 455 (*i)->get_assertions().push_front( new FunctionDecl( "^?{}", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, dtorType, 0, false, false ) ); 456 457 // add copy ctor: void ?{}(T *, T) 458 FunctionType *copyCtorType = new FunctionType( Type::Qualifiers(), false ); 459 copyCtorType->get_parameters().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), (*i)->get_name(), *i ) ), 0 ) ); 460 copyCtorType->get_parameters().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new TypeInstType( Type::Qualifiers(), (*i)->get_name(), *i ), 0 ) ); 461 (*i)->get_assertions().push_front( new FunctionDecl( "?{}", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, copyCtorType, 0, false, false ) ); 462 463 // add default ctor: void ?{}(T *) 464 FunctionType *ctorType = new FunctionType( Type::Qualifiers(), false ); 465 ctorType->get_parameters().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), (*i)->get_name(), *i ) ), 0 ) ); 466 (*i)->get_assertions().push_front( new FunctionDecl( "?{}", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, ctorType, 0, false, false ) ); 467 468 // add assignment operator: T * ?=?(T *, T) 451 469 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false ); 452 470 assignType->get_parameters().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), new TypeInstType( Type::Qualifiers(), (*i)->get_name(), *i ) ), 0 ) ); … … 902 920 if ( cur->get_enumeratorValue() != NULL ) { 903 921 ObjectDecl *member = dynamic_cast<ObjectDecl *>(*members); 904 member->set_init( new SingleInit( maybeBuild< Expression >( cur->get_enumeratorValue() ) ) );922 member->set_init( new SingleInit( maybeBuild< Expression >( cur->get_enumeratorValue() ), std::list< Expression * >() ) ); 905 923 } // if 906 924 } // for -
src/Parser/parser.cc
r3aba311 ra5a71d0 7415 7415 /* Line 1806 of yacc.c */ 7416 7416 #line 1694 "parser.yy" 7417 { (yyval.in) = (yyvsp[(2) - (2)].in) ; }7417 { (yyval.in) = (yyvsp[(2) - (2)].in)->set_maybeConstructed( false ); } 7418 7418 break; 7419 7419 -
src/Parser/parser.yy
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // cfa.y -- 8 // 7 // cfa.y -- 8 // 9 9 // Author : Peter A. Buhr 10 10 // Created On : Sat Sep 1 20:22:55 2001 … … 12 12 // Last Modified On : Thu Mar 24 16:16:16 2016 13 13 // Update Count : 1498 14 // 14 // 15 15 16 16 // This grammar is based on the ANSI99/11 C grammar, specifically parts of EXPRESSION and STATEMENTS, and on the C … … 1692 1692 { $$ = $2; } 1693 1693 | ATassign initializer 1694 { $$ = $2 ; }1694 { $$ = $2->set_maybeConstructed( false ); } 1695 1695 ; 1696 1696 -
src/ResolvExpr/Resolver.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Resolver.cc -- 7 // Resolver.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Sun May 17 12:17:01 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Thu Mar 24 16:43:11201613 // Update Count : 18111 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:11:54 2016 13 // Update Count : 203 14 14 // 15 15 … … 33 33 public: 34 34 Resolver() : SymTab::Indexer( false ), switchType( 0 ) {} 35 35 36 36 virtual void visit( FunctionDecl *functionDecl ); 37 37 virtual void visit( ObjectDecl *functionDecl ); … … 54 54 virtual void visit( SingleInit *singleInit ); 55 55 virtual void visit( ListInit *listInit ); 56 virtual void visit( ConstructorInit *ctorInit ); 56 57 private: 57 58 typedef std::list< Initializer * >::iterator InitIterator; … … 59 60 void resolveAggrInit( AggregateDecl *, InitIterator &, InitIterator & ); 60 61 void resolveSingleAggrInit( Declaration *, InitIterator &, InitIterator & ); 62 void fallbackInit( ConstructorInit * ctorInit ); 61 63 62 64 std::list< Type * > functionReturn; … … 95 97 return newExpr; 96 98 } 97 99 98 100 Expression *findSingleExpression( Expression *untyped, const SymTab::Indexer &indexer ) { 99 101 TypeEnvironment env; … … 126 128 } // if 127 129 } 128 130 129 131 Expression *findIntegralExpression( Expression *untyped, const SymTab::Indexer &indexer ) { 130 132 TypeEnvironment env; … … 159 161 return newExpr; 160 162 } 161 162 } 163 163 164 } 165 164 166 void Resolver::visit( ObjectDecl *objectDecl ) { 165 167 Type *new_type = resolveTypeof( objectDecl->get_type(), *this ); … … 258 260 forStmt->set_condition( newExpr ); 259 261 } // if 260 262 261 263 if ( forStmt->get_increment() ) { 262 264 Expression * newExpr = findVoidExpression( forStmt->get_increment(), *this ); … … 272 274 delete switchStmt->get_condition(); 273 275 switchStmt->set_condition( newExpr ); 274 276 275 277 visitor.Visitor::visit( switchStmt ); 276 278 } … … 314 316 bool isCharType( T t ) { 315 317 if ( BasicType * bt = dynamic_cast< BasicType * >( t ) ) { 316 return bt->get_kind() == BasicType::Char || bt->get_kind() == BasicType::SignedChar || 318 return bt->get_kind() == BasicType::Char || bt->get_kind() == BasicType::SignedChar || 317 319 bt->get_kind() == BasicType::UnsignedChar; 318 320 } … … 326 328 string n = ne->get_name(); 327 329 if (n == "0") { 328 initContext = new BasicType(Type::Qualifiers(), 330 initContext = new BasicType(Type::Qualifiers(), 329 331 BasicType::SignedInt); 330 332 } else { … … 332 334 initContext = decl->get_type(); 333 335 } 334 } else if (ConstantExpr * e = 336 } else if (ConstantExpr * e = 335 337 dynamic_cast<ConstantExpr*>(singleInit->get_value())) { 336 338 Constant *c = e->get_constant(); … … 355 357 singleInit->set_value( ce->get_arg() ); 356 358 ce->set_arg( NULL ); 357 delete ce; 359 delete ce; 358 360 } 359 361 } … … 471 473 #endif 472 474 } 475 476 // ConstructorInit - fall back on C-style initializer 477 void Resolver::fallbackInit( ConstructorInit * ctorInit ) { 478 // could not find valid constructor, or found an intrinsic constructor 479 // fall back on C-style initializer 480 delete ctorInit->get_ctor(); 481 ctorInit->set_ctor( NULL ); 482 maybeAccept( ctorInit->get_init(), *this ); 483 } 484 485 void Resolver::visit( ConstructorInit *ctorInit ) { 486 TypeEnvironment env; 487 try { 488 maybeAccept( ctorInit->get_ctor(), *this ); 489 maybeAccept( ctorInit->get_dtor(), *this ); 490 } catch ( SemanticError ) { 491 // no alternatives for the constructor initializer - fallback on C-style initializer 492 // xxx- not sure if this makes a ton of sense - should maybe never be able to have this situation? 493 fallbackInit( ctorInit ); 494 return; 495 } 496 497 if ( ExprStmt * exprStmt = dynamic_cast< ExprStmt * > ( ctorInit->get_ctor() ) ) { 498 ApplicationExpr * appExpr = dynamic_cast< ApplicationExpr * >( exprStmt->get_expr() ); 499 assert( appExpr ); 500 VariableExpr * function = dynamic_cast< VariableExpr * > ( appExpr->get_function() ); 501 assert( function ); 502 if ( LinkageSpec::isOverridable( function->get_var()->get_linkage() ) ) { 503 // if the constructor that was found is intrinsic or autogenerated, reset to C-style 504 // initializer so that code generation is easy to handle 505 fallbackInit( ctorInit ); 506 return; 507 } 508 } 509 // found a constructor - can get rid of C-style initializer 510 delete ctorInit->get_init(); 511 ctorInit->set_init( NULL ); 512 } 473 513 } // namespace ResolvExpr 474 514 -
src/SymTab/AddVisit.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // AddVisit.h -- 7 // AddVisit.h -- 8 8 // 9 9 // Author : Richard C. Bilson … … 85 85 maybeAccept( cathStmt->get_decl(), visitor ); 86 86 } 87 88 template< typename Visitor > 89 void acceptAndAdd( std::list< Declaration * > &translationUnit, Visitor &visitor, bool addBefore ) { 90 std::list< Declaration * >::iterator i = translationUnit.begin(); 91 while ( i != translationUnit.end() ) { 92 (*i)->accept( visitor ); 93 std::list< Declaration * >::iterator next = i; 94 next++; 95 if ( ! visitor.get_declsToAdd().empty() ) { 96 translationUnit.splice( addBefore ? i : next, visitor.get_declsToAdd() ); 97 } // if 98 i = next; 99 } // while 100 } 87 101 } // namespace SymTab 88 102 -
src/SymTab/Validate.cc
r3aba311 ra5a71d0 9 9 // Author : Richard C. Bilson 10 10 // Created On : Sun May 17 21:50:04 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:31:39 201613 // Update Count : 2 2611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:13:29 2016 13 // Update Count : 297 14 14 // 15 15 … … 54 54 #include "MakeLibCfa.h" 55 55 #include "TypeEquality.h" 56 #include "Autogen.h" 56 57 #include "ResolvExpr/typeops.h" 57 58 … … 124 125 125 126 const Indexer *indexer; 126 };127 128 class AutogenerateRoutines : public Visitor {129 public:130 /// Generates assignment operators for aggregate types as required131 static void autogenerateRoutines( std::list< Declaration * > &translationUnit );132 133 std::list< Declaration * > &get_declsToAdd() { return declsToAdd; }134 135 virtual void visit( EnumDecl *enumDecl );136 virtual void visit( StructDecl *structDecl );137 virtual void visit( UnionDecl *structDecl );138 virtual void visit( TypeDecl *typeDecl );139 virtual void visit( TraitDecl *ctxDecl );140 virtual void visit( FunctionDecl *functionDecl );141 142 virtual void visit( FunctionType *ftype );143 virtual void visit( PointerType *ftype );144 145 virtual void visit( CompoundStmt *compoundStmt );146 virtual void visit( IfStmt *ifStmt );147 virtual void visit( WhileStmt *whileStmt );148 virtual void visit( ForStmt *forStmt );149 virtual void visit( SwitchStmt *switchStmt );150 virtual void visit( ChooseStmt *chooseStmt );151 virtual void visit( CaseStmt *caseStmt );152 virtual void visit( CatchStmt *catchStmt );153 154 AutogenerateRoutines() : functionNesting( 0 ) {}155 private:156 template< typename StmtClass > void visitStatement( StmtClass *stmt );157 158 std::list< Declaration * > declsToAdd;159 std::set< std::string > structsDone;160 unsigned int functionNesting; // current level of nested functions161 127 }; 162 128 … … 202 168 }; 203 169 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 // VerifyCtorDtor() {} 178 179 virtual void visit( FunctionDecl *funcDecl ); 180 private: 181 }; 182 204 183 void validate( std::list< Declaration * > &translationUnit, bool doDebug ) { 205 184 Pass1 pass1; … … 211 190 acceptAll( translationUnit, pass2 ); 212 191 ReturnChecker::checkFunctionReturns( translationUnit ); 213 AutogenerateRoutines::autogenerateRoutines( translationUnit );192 autogenerateRoutines( translationUnit ); 214 193 acceptAll( translationUnit, pass3 ); 194 VerifyCtorDtor::verify( translationUnit ); 215 195 } 216 196 … … 222 202 type->accept( pass2 ); 223 203 type->accept( pass3 ); 224 }225 226 template< typename Visitor >227 void acceptAndAdd( std::list< Declaration * > &translationUnit, Visitor &visitor, bool addBefore ) {228 std::list< Declaration * >::iterator i = translationUnit.begin();229 while ( i != translationUnit.end() ) {230 (*i)->accept( visitor );231 std::list< Declaration * >::iterator next = i;232 next++;233 if ( ! visitor.get_declsToAdd().empty() ) {234 translationUnit.splice( addBefore ? i : next, visitor.get_declsToAdd() );235 } // if236 i = next;237 } // while238 204 } 239 205 … … 513 479 } 514 480 515 static const std::list< std::string > noLabels;516 517 void AutogenerateRoutines::autogenerateRoutines( std::list< Declaration * > &translationUnit ) {518 AutogenerateRoutines visitor;519 acceptAndAdd( translationUnit, visitor, false );520 }521 522 template< typename OutputIterator >523 void makeScalarAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, OutputIterator out ) {524 ObjectDecl *obj = dynamic_cast<ObjectDecl *>( member );525 // unnamed bit fields are not copied as they cannot be accessed526 if ( obj != NULL && obj->get_name() == "" && obj->get_bitfieldWidth() != NULL ) return;527 528 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );529 530 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );531 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );532 533 // do something special for unnamed members534 Expression *dstselect = new AddressExpr( new MemberExpr( member, derefExpr ) );535 assignExpr->get_args().push_back( dstselect );536 537 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );538 assignExpr->get_args().push_back( srcselect );539 540 *out++ = new ExprStmt( noLabels, assignExpr );541 }542 543 template< typename OutputIterator >544 void makeArrayAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, DeclarationWithType *member, ArrayType *array, OutputIterator out ) {545 static UniqueName indexName( "_index" );546 547 // for a flexible array member nothing is done -- user must define own assignment548 if ( ! array->get_dimension() ) return;549 550 ObjectDecl *index = new ObjectDecl( indexName.newName(), DeclarationNode::NoStorageClass, LinkageSpec::C, 0, new BasicType( Type::Qualifiers(), BasicType::SignedInt ), 0 );551 *out++ = new DeclStmt( noLabels, index );552 553 UntypedExpr *init = new UntypedExpr( new NameExpr( "?=?" ) );554 init->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );555 init->get_args().push_back( new NameExpr( "0" ) );556 Statement *initStmt = new ExprStmt( noLabels, init );557 std::list<Statement *> initList;558 initList.push_back( initStmt );559 560 UntypedExpr *cond = new UntypedExpr( new NameExpr( "?<?" ) );561 cond->get_args().push_back( new VariableExpr( index ) );562 cond->get_args().push_back( array->get_dimension()->clone() );563 564 UntypedExpr *inc = new UntypedExpr( new NameExpr( "++?" ) );565 inc->get_args().push_back( new AddressExpr( new VariableExpr( index ) ) );566 567 UntypedExpr *assignExpr = new UntypedExpr( new NameExpr( "?=?" ) );568 569 UntypedExpr *derefExpr = new UntypedExpr( new NameExpr( "*?" ) );570 derefExpr->get_args().push_back( new VariableExpr( dstParam ) );571 572 Expression *dstselect = new MemberExpr( member, derefExpr );573 UntypedExpr *dstIndex = new UntypedExpr( new NameExpr( "?+?" ) );574 dstIndex->get_args().push_back( dstselect );575 dstIndex->get_args().push_back( new VariableExpr( index ) );576 assignExpr->get_args().push_back( dstIndex );577 578 Expression *srcselect = new MemberExpr( member, new VariableExpr( srcParam ) );579 UntypedExpr *srcIndex = new UntypedExpr( new NameExpr( "?[?]" ) );580 srcIndex->get_args().push_back( srcselect );581 srcIndex->get_args().push_back( new VariableExpr( index ) );582 assignExpr->get_args().push_back( srcIndex );583 584 *out++ = new ForStmt( noLabels, initList, cond, inc, new ExprStmt( noLabels, assignExpr ) );585 }586 587 template< typename OutputIterator >588 void makeUnionFieldsAssignment( ObjectDecl *srcParam, ObjectDecl *dstParam, UnionInstType *unionType, OutputIterator out ) {589 UntypedExpr *copy = new UntypedExpr( new NameExpr( "__builtin_memcpy" ) );590 copy->get_args().push_back( new VariableExpr( dstParam ) );591 copy->get_args().push_back( new AddressExpr( new VariableExpr( srcParam ) ) );592 copy->get_args().push_back( new SizeofExpr( unionType ) );593 594 *out++ = new ExprStmt( noLabels, copy );595 }596 597 //E ?=?(E volatile*, int),598 // ?=?(E _Atomic volatile*, int);599 void makeEnumAssignment( EnumDecl *enumDecl, EnumInstType *refType, unsigned int functionNesting, std::list< Declaration * > &declsToAdd ) {600 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );601 602 ObjectDecl *returnVal = new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, refType->clone(), 0 );603 assignType->get_returnVals().push_back( returnVal );604 605 // need two assignment operators with different types606 FunctionType * assignType2 = assignType->clone();607 608 // E ?=?(E volatile *, E)609 Type *etype = refType->clone();610 // etype->get_qualifiers() += Type::Qualifiers(false, true, false, false, false, false);611 612 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), etype ), 0 );613 assignType->get_parameters().push_back( dstParam );614 615 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, etype->clone(), 0 );616 assignType->get_parameters().push_back( srcParam );617 618 // E ?=?(E volatile *, int)619 assignType2->get_parameters().push_back( dstParam->clone() );620 BasicType * paramType = new BasicType(Type::Qualifiers(), BasicType::SignedInt);621 ObjectDecl *srcParam2 = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, paramType, 0 );622 assignType2->get_parameters().push_back( srcParam2 );623 624 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units625 // because each unit generates copies of the default routines for each aggregate.626 627 // since there is no definition, these should not be inline628 // make these intrinsic so that the code generator does not make use of them629 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::Intrinsic, assignType, 0, false, false );630 assignDecl->fixUniqueId();631 FunctionDecl *assignDecl2 = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::Intrinsic, assignType2, 0, false, false );632 assignDecl2->fixUniqueId();633 634 // these should be built in the same way that the prelude635 // functions are, so build a list containing the prototypes636 // and allow MakeLibCfa to autogenerate the bodies.637 std::list< Declaration * > assigns;638 assigns.push_back( assignDecl );639 assigns.push_back( assignDecl2 );640 641 LibCfa::makeLibCfa( assigns );642 643 // need to remove the prototypes, since this may be nested in a routine644 for (int start = 0, end = assigns.size()/2; start < end; start++) {645 delete assigns.front();646 assigns.pop_front();647 } // for648 649 declsToAdd.insert( declsToAdd.begin(), assigns.begin(), assigns.end() );650 }651 652 /// Clones a reference type, replacing any parameters it may have with a clone of the provided list653 template< typename GenericInstType >654 GenericInstType *cloneWithParams( GenericInstType *refType, const std::list< Expression* >& params ) {655 GenericInstType *clone = refType->clone();656 clone->get_parameters().clear();657 cloneAll( params, clone->get_parameters() );658 return clone;659 }660 661 /// Creates a new type decl that's the same as src, but renamed and with only the ?=? assertion (for complete types only)662 TypeDecl *cloneAndRename( TypeDecl *src, const std::string &name ) {663 TypeDecl *dst = new TypeDecl( name, src->get_storageClass(), 0, src->get_kind() );664 665 if ( src->get_kind() == TypeDecl::Any ) {666 // just include assignment operator assertion667 TypeInstType *assignParamType = new TypeInstType( Type::Qualifiers(), name, dst );668 FunctionType *assignFunctionType = new FunctionType( Type::Qualifiers(), false );669 assignFunctionType->get_returnVals().push_back(670 new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, assignParamType->clone(), 0 ) );671 assignFunctionType->get_parameters().push_back(672 new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), assignParamType->clone() ), 0 ) );673 assignFunctionType->get_parameters().push_back(674 new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, assignParamType, 0 ) );675 FunctionDecl *assignAssert = new FunctionDecl( "?=?", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, assignFunctionType, 0, false, false );676 dst->get_assertions().push_back( assignAssert );677 }678 679 return dst;680 }681 682 Declaration *makeStructAssignment( StructDecl *aggregateDecl, StructInstType *refType, unsigned int functionNesting ) {683 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );684 685 // Make function polymorphic in same parameters as generic struct, if applicable686 bool isGeneric = false; // NOTE this flag is an incredibly ugly kludge; we should fix the assignment signature instead (ditto for union)687 std::list< TypeDecl* >& genericParams = aggregateDecl->get_parameters();688 std::list< Expression* > structParams; // List of matching parameters to put on types689 TypeSubstitution genericSubs; // Substitutions to make to member types of struct690 for ( std::list< TypeDecl* >::const_iterator param = genericParams.begin(); param != genericParams.end(); ++param ) {691 isGeneric = true;692 TypeDecl *typeParam = cloneAndRename( *param, "_autoassign_" + aggregateDecl->get_name() + "_" + (*param)->get_name() );693 assignType->get_forall().push_back( typeParam );694 TypeInstType *newParamType = new TypeInstType( Type::Qualifiers(), typeParam->get_name(), typeParam );695 genericSubs.add( (*param)->get_name(), newParamType );696 structParams.push_back( new TypeExpr( newParamType ) );697 }698 699 ObjectDecl *returnVal = new ObjectDecl( "_ret", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, cloneWithParams( refType, structParams ), 0 );700 assignType->get_returnVals().push_back( returnVal );701 702 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), cloneWithParams( refType, structParams ) ), 0 );703 assignType->get_parameters().push_back( dstParam );704 705 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, cloneWithParams( refType, structParams ), 0 );706 assignType->get_parameters().push_back( srcParam );707 708 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units709 // because each unit generates copies of the default routines for each aggregate.710 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true, false );711 assignDecl->fixUniqueId();712 713 for ( std::list< Declaration * >::const_iterator member = aggregateDecl->get_members().begin(); member != aggregateDecl->get_members().end(); ++member ) {714 if ( DeclarationWithType *dwt = dynamic_cast< DeclarationWithType * >( *member ) ) {715 // query the type qualifiers of this field and skip assigning it if it is marked const.716 // If it is an array type, we need to strip off the array layers to find its qualifiers.717 Type * type = dwt->get_type();718 while ( ArrayType * at = dynamic_cast< ArrayType * >( type ) ) {719 type = at->get_base();720 }721 722 if ( type->get_qualifiers().isConst ) {723 // don't assign const members724 continue;725 }726 727 if ( isGeneric ) {728 // rewrite member type in terms of the type variables on this operator729 DeclarationWithType *fixedMember = dwt->clone();730 genericSubs.apply( fixedMember );731 732 // assign to both destination and return value733 if ( ArrayType *array = dynamic_cast< ArrayType * >( fixedMember->get_type() ) ) {734 makeArrayAssignment( srcParam, dstParam, fixedMember, array, back_inserter( assignDecl->get_statements()->get_kids() ) );735 makeArrayAssignment( srcParam, returnVal, fixedMember, array, back_inserter( assignDecl->get_statements()->get_kids() ) );736 } else {737 makeScalarAssignment( srcParam, dstParam, fixedMember, back_inserter( assignDecl->get_statements()->get_kids() ) );738 makeScalarAssignment( srcParam, returnVal, fixedMember, back_inserter( assignDecl->get_statements()->get_kids() ) );739 } // if740 } else {741 // assign to destination742 if ( ArrayType *array = dynamic_cast< ArrayType * >( dwt->get_type() ) ) {743 makeArrayAssignment( srcParam, dstParam, dwt, array, back_inserter( assignDecl->get_statements()->get_kids() ) );744 } else {745 makeScalarAssignment( srcParam, dstParam, dwt, back_inserter( assignDecl->get_statements()->get_kids() ) );746 } // if747 } // if748 } // if749 } // for750 if ( ! isGeneric ) assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );751 752 return assignDecl;753 }754 755 Declaration *makeUnionAssignment( UnionDecl *aggregateDecl, UnionInstType *refType, unsigned int functionNesting ) {756 FunctionType *assignType = new FunctionType( Type::Qualifiers(), false );757 758 // Make function polymorphic in same parameters as generic union, if applicable759 bool isGeneric = false; // NOTE this flag is an incredibly ugly kludge; we should fix the assignment signature instead (ditto for struct)760 std::list< TypeDecl* >& genericParams = aggregateDecl->get_parameters();761 std::list< Expression* > unionParams; // List of matching parameters to put on types762 for ( std::list< TypeDecl* >::const_iterator param = genericParams.begin(); param != genericParams.end(); ++param ) {763 isGeneric = true;764 TypeDecl *typeParam = cloneAndRename( *param, "_autoassign_" + aggregateDecl->get_name() + "_" + (*param)->get_name() );765 assignType->get_forall().push_back( typeParam );766 unionParams.push_back( new TypeExpr( new TypeInstType( Type::Qualifiers(), typeParam->get_name(), typeParam ) ) );767 }768 769 ObjectDecl *returnVal = new ObjectDecl( "_ret", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, cloneWithParams( refType, unionParams ), 0 );770 assignType->get_returnVals().push_back( returnVal );771 772 ObjectDecl *dstParam = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), cloneWithParams( refType, unionParams ) ), 0 );773 assignType->get_parameters().push_back( dstParam );774 775 ObjectDecl *srcParam = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, cloneWithParams( refType, unionParams ), 0 );776 assignType->get_parameters().push_back( srcParam );777 778 // Routines at global scope marked "static" to prevent multiple definitions is separate translation units779 // because each unit generates copies of the default routines for each aggregate.780 FunctionDecl *assignDecl = new FunctionDecl( "?=?", functionNesting > 0 ? DeclarationNode::NoStorageClass : DeclarationNode::Static, LinkageSpec::AutoGen, assignType, new CompoundStmt( noLabels ), true, false );781 assignDecl->fixUniqueId();782 783 makeUnionFieldsAssignment( srcParam, dstParam, cloneWithParams( refType, unionParams ), back_inserter( assignDecl->get_statements()->get_kids() ) );784 if ( isGeneric ) makeUnionFieldsAssignment( srcParam, returnVal, cloneWithParams( refType, unionParams ), back_inserter( assignDecl->get_statements()->get_kids() ) );785 786 if ( ! isGeneric ) assignDecl->get_statements()->get_kids().push_back( new ReturnStmt( noLabels, new VariableExpr( srcParam ) ) );787 788 return assignDecl;789 }790 791 void AutogenerateRoutines::visit( EnumDecl *enumDecl ) {792 if ( ! enumDecl->get_members().empty() ) {793 EnumInstType *enumInst = new EnumInstType( Type::Qualifiers(), enumDecl->get_name() );794 // enumInst->set_baseEnum( enumDecl );795 // declsToAdd.push_back(796 makeEnumAssignment( enumDecl, enumInst, functionNesting, declsToAdd );797 }798 }799 800 void AutogenerateRoutines::visit( StructDecl *structDecl ) {801 if ( ! structDecl->get_members().empty() && structsDone.find( structDecl->get_name() ) == structsDone.end() ) {802 StructInstType structInst( Type::Qualifiers(), structDecl->get_name() );803 structInst.set_baseStruct( structDecl );804 declsToAdd.push_back( makeStructAssignment( structDecl, &structInst, functionNesting ) );805 structsDone.insert( structDecl->get_name() );806 } // if807 }808 809 void AutogenerateRoutines::visit( UnionDecl *unionDecl ) {810 if ( ! unionDecl->get_members().empty() ) {811 UnionInstType unionInst( Type::Qualifiers(), unionDecl->get_name() );812 unionInst.set_baseUnion( unionDecl );813 declsToAdd.push_back( makeUnionAssignment( unionDecl, &unionInst, functionNesting ) );814 } // if815 }816 817 void AutogenerateRoutines::visit( TypeDecl *typeDecl ) {818 CompoundStmt *stmts = 0;819 TypeInstType *typeInst = new TypeInstType( Type::Qualifiers(), typeDecl->get_name(), false );820 typeInst->set_baseType( typeDecl );821 ObjectDecl *src = new ObjectDecl( "_src", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, typeInst->clone(), 0 );822 ObjectDecl *dst = new ObjectDecl( "_dst", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, new PointerType( Type::Qualifiers(), typeInst->clone() ), 0 );823 if ( typeDecl->get_base() ) {824 stmts = new CompoundStmt( std::list< Label >() );825 UntypedExpr *assign = new UntypedExpr( new NameExpr( "?=?" ) );826 assign->get_args().push_back( new CastExpr( new VariableExpr( dst ), new PointerType( Type::Qualifiers(), typeDecl->get_base()->clone() ) ) );827 assign->get_args().push_back( new CastExpr( new VariableExpr( src ), typeDecl->get_base()->clone() ) );828 stmts->get_kids().push_back( new ReturnStmt( std::list< Label >(), assign ) );829 } // if830 FunctionType *type = new FunctionType( Type::Qualifiers(), false );831 type->get_returnVals().push_back( new ObjectDecl( "", DeclarationNode::NoStorageClass, LinkageSpec::Cforall, 0, typeInst, 0 ) );832 type->get_parameters().push_back( dst );833 type->get_parameters().push_back( src );834 FunctionDecl *func = new FunctionDecl( "?=?", DeclarationNode::NoStorageClass, LinkageSpec::AutoGen, type, stmts, false, false );835 declsToAdd.push_back( func );836 }837 838 void addDecls( std::list< Declaration * > &declsToAdd, std::list< Statement * > &statements, std::list< Statement * >::iterator i ) {839 for ( std::list< Declaration * >::iterator decl = declsToAdd.begin(); decl != declsToAdd.end(); ++decl ) {840 statements.insert( i, new DeclStmt( noLabels, *decl ) );841 } // for842 declsToAdd.clear();843 }844 845 void AutogenerateRoutines::visit( FunctionType *) {846 // ensure that we don't add assignment ops for types defined as part of the function847 }848 849 void AutogenerateRoutines::visit( PointerType *) {850 // ensure that we don't add assignment ops for types defined as part of the pointer851 }852 853 void AutogenerateRoutines::visit( TraitDecl *) {854 // ensure that we don't add assignment ops for types defined as part of the context855 }856 857 template< typename StmtClass >858 inline void AutogenerateRoutines::visitStatement( StmtClass *stmt ) {859 std::set< std::string > oldStructs = structsDone;860 addVisit( stmt, *this );861 structsDone = oldStructs;862 }863 864 void AutogenerateRoutines::visit( FunctionDecl *functionDecl ) {865 maybeAccept( functionDecl->get_functionType(), *this );866 acceptAll( functionDecl->get_oldDecls(), *this );867 functionNesting += 1;868 maybeAccept( functionDecl->get_statements(), *this );869 functionNesting -= 1;870 }871 872 void AutogenerateRoutines::visit( CompoundStmt *compoundStmt ) {873 visitStatement( compoundStmt );874 }875 876 void AutogenerateRoutines::visit( IfStmt *ifStmt ) {877 visitStatement( ifStmt );878 }879 880 void AutogenerateRoutines::visit( WhileStmt *whileStmt ) {881 visitStatement( whileStmt );882 }883 884 void AutogenerateRoutines::visit( ForStmt *forStmt ) {885 visitStatement( forStmt );886 }887 888 void AutogenerateRoutines::visit( SwitchStmt *switchStmt ) {889 visitStatement( switchStmt );890 }891 892 void AutogenerateRoutines::visit( ChooseStmt *switchStmt ) {893 visitStatement( switchStmt );894 }895 896 void AutogenerateRoutines::visit( CaseStmt *caseStmt ) {897 visitStatement( caseStmt );898 }899 900 void AutogenerateRoutines::visit( CatchStmt *cathStmt ) {901 visitStatement( cathStmt );902 }903 904 481 void ReturnChecker::checkFunctionReturns( std::list< Declaration * > & translationUnit ) { 905 482 ReturnChecker checker; … … 1080 657 } 1081 658 659 void VerifyCtorDtor::verify( std::list< Declaration * > & translationUnit ) { 660 VerifyCtorDtor verifier; 661 acceptAll( translationUnit, verifier ); 662 } 663 664 void VerifyCtorDtor::visit( FunctionDecl * funcDecl ) { 665 FunctionType * funcType = funcDecl->get_functionType(); 666 std::list< DeclarationWithType * > &returnVals = funcType->get_returnVals(); 667 std::list< DeclarationWithType * > ¶ms = funcType->get_parameters(); 668 669 if ( funcDecl->get_name() == "?{}" || funcDecl->get_name() == "^?{}" ) { 670 if ( params.size() == 0 ) { 671 throw SemanticError( "Constructors and destructors require at least one parameter ", funcDecl ); 672 } 673 if ( ! dynamic_cast< PointerType * >( params.front()->get_type() ) ) { 674 throw SemanticError( "First parameter of a constructor or destructor must be a pointer ", funcDecl ); 675 } 676 if ( returnVals.size() != 0 ) { 677 throw SemanticError( "Constructors and destructors cannot have explicit return values ", funcDecl ); 678 } 679 } 680 681 Visitor::visit( funcDecl ); 682 // original idea: modify signature of ctor/dtors and insert appropriate return statements 683 // to cause desired behaviour 684 // new idea: add comma exprs to every ctor call to produce first parameter. 685 // this requires some memoization of the first parameter, because it can be a 686 // complicated expression with side effects (see: malloc). idea: add temporary variable 687 // that is assigned address of constructed object in ctor argument position and 688 // return the temporary. It should also be done after all implicit ctors are 689 // added, so not in this pass! 690 } 1082 691 } // namespace SymTab 1083 692 -
src/SymTab/module.mk
r3aba311 ra5a71d0 6 6 ## file "LICENCE" distributed with Cforall. 7 7 ## 8 ## module.mk -- 8 ## module.mk -- 9 9 ## 10 10 ## Author : Richard C. Bilson … … 20 20 SymTab/FixFunction.cc \ 21 21 SymTab/ImplementationType.cc \ 22 SymTab/TypeEquality.cc 22 SymTab/TypeEquality.cc \ 23 SymTab/Autogen.cc -
src/SynTree/CommaExpr.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // CommaExpr.cc -- 7 // CommaExpr.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Mon May 18 08:09:58 201511 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Apr 06 17:07:54 2016 13 13 // Update Count : 1 14 14 // … … 20 20 CommaExpr::CommaExpr( Expression *arg1, Expression *arg2, Expression *_aname ) 21 21 : Expression( _aname ), arg1( arg1 ), arg2( arg2 ) { 22 // xxx - result of a comma expression is never an lvalue, so should set lvalue 23 // to false on all result types 22 24 cloneAll( arg2->get_results(), get_results() ); 23 25 } -
src/SynTree/CompoundStmt.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // XXX.cc -- 7 // XXX.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Tue Jun 23 11:37:49 201511 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Apr 06 14:35:37 2016 13 13 // Update Count : 3 14 14 // … … 18 18 #include <algorithm> 19 19 #include <functional> 20 #include "Expression.h" 21 #include "Declaration.h" 20 22 21 23 using std::string; 22 24 using std::endl; 25 26 class VarExprReplacer : public Visitor { 27 public: 28 typedef std::map< DeclarationWithType *, DeclarationWithType * > DeclMap; 29 private: 30 const DeclMap & declMap; 31 public: 32 VarExprReplacer( const DeclMap & declMap ) : declMap( declMap ) {} 33 34 // replace variable with new node from decl map 35 virtual void visit( VariableExpr * varExpr ) { 36 if ( declMap.count( varExpr->get_var() ) ) { 37 varExpr->set_var( declMap.at( varExpr->get_var() ) ); 38 } 39 } 40 }; 41 23 42 24 43 CompoundStmt::CompoundStmt( std::list<Label> labels ) : Statement( labels ) { … … 27 46 CompoundStmt::CompoundStmt( const CompoundStmt &other ) : Statement( other ) { 28 47 cloneAll( other.kids, kids ); 48 49 // when cloning a compound statement, we may end up cloning declarations which 50 // are referred to by VariableExprs throughout the block. Cloning a VariableExpr 51 // does a shallow copy, so the VariableExpr will end up pointing to the original 52 // declaration. If the original declaration is deleted, e.g. because the original 53 // CompoundStmt is deleted, then we have a dangling pointer. To avoid this case, 54 // find all DeclarationWithType nodes (since a VariableExpr must point to a 55 // DeclarationWithType) in the original CompoundStmt and map them to the cloned 56 // node in the new CompoundStmt ('this'), then replace the Declarations referred to 57 // by each VariableExpr according to the constructed map. Note that only the declarations 58 // in the current level are collected into the map, because child CompoundStmts will 59 // recursively execute this routine. There may be more efficient ways of doing 60 // this. 61 VarExprReplacer::DeclMap declMap; 62 std::list< Statement * >::const_iterator origit = other.kids.begin(); 63 for ( Statement * s : kids ) { 64 assert( origit != other.kids.end() ); 65 if ( DeclStmt * declStmt = dynamic_cast< DeclStmt * >( s ) ) { 66 DeclStmt * origDeclStmt = dynamic_cast< DeclStmt * >( *origit ); 67 assert( origDeclStmt ); 68 if ( DeclarationWithType * dwt = dynamic_cast< DeclarationWithType * > ( declStmt->get_decl() ) ) { 69 DeclarationWithType * origdwt = dynamic_cast< DeclarationWithType * > ( origDeclStmt->get_decl() ); 70 assert( origdwt ); 71 declMap[ origdwt ] = dwt; 72 } 73 } 74 } 75 if ( ! declMap.empty() ) { 76 VarExprReplacer replacer( declMap ); 77 accept( replacer ); 78 } 29 79 } 30 80 -
src/SynTree/Declaration.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Declaration.h -- 7 // Declaration.h -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:28:11201613 // Update Count : 3 311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:14:00 2016 13 // Update Count : 36 14 14 // 15 15 -
src/SynTree/Initializer.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Initializer.cc -- 7 // Initializer.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed A ug 12 14:05:25 201513 // Update Count : 1412 // Last Modified On : Wed Apr 06 16:15:32 2016 13 // Update Count : 28 14 14 // 15 15 16 16 #include "Initializer.h" 17 17 #include "Expression.h" 18 #include "Statement.h" 18 19 #include "Common/utility.h" 19 20 20 Initializer::Initializer( ) {}21 Initializer::Initializer( bool maybeConstructed ) : maybeConstructed( maybeConstructed ) {} 21 22 22 23 Initializer::~Initializer() {} … … 31 32 void Initializer::print( std::ostream &os, int indent ) {} 32 33 33 SingleInit::SingleInit( Expression *v, std::list< Expression *> &_designators ) : value ( v ), designators( _designators ) {34 SingleInit::SingleInit( Expression *v, const std::list< Expression *> &_designators, bool maybeConstructed ) : Initializer( maybeConstructed ), value ( v ), designators( _designators ) { 34 35 } 35 36 36 SingleInit::SingleInit( const SingleInit &other ) : value ( other.value) {37 SingleInit::SingleInit( const SingleInit &other ) : Initializer(other), value ( maybeClone( other.value ) ) { 37 38 cloneAll(other.designators, designators ); 38 39 } … … 54 55 } 55 56 56 ListInit::ListInit( std::list<Initializer*> &_initializers, std::list<Expression *> &_designators)57 : initializers( _initializers ), designators( _designators ) {57 ListInit::ListInit( const std::list<Initializer*> &_initializers, const std::list<Expression *> &_designators, bool maybeConstructed ) 58 : Initializer( maybeConstructed), initializers( _initializers ), designators( _designators ) { 58 59 } 59 60 … … 65 66 66 67 void ListInit::print( std::ostream &os, int indent ) { 67 os << std::endl << std::string(indent, ' ') << "Compound initializer: "; 68 os << std::endl << std::string(indent, ' ') << "Compound initializer: "; 68 69 if ( ! designators.empty() ) { 69 70 os << std::string(indent + 2, ' ' ) << "designated by: ["; 70 71 for ( std::list < Expression * >::iterator i = designators.begin(); 71 72 i != designators.end(); i++ ) { 72 ( *i )->print(os, indent + 4 ); 73 ( *i )->print(os, indent + 4 ); 73 74 } // for 74 75 75 76 os << std::string(indent + 2, ' ' ) << "]"; 76 77 } // if 77 78 78 for ( std::list<Initializer *>::iterator i = initializers.begin(); i != initializers.end(); i++ ) 79 for ( std::list<Initializer *>::iterator i = initializers.begin(); i != initializers.end(); i++ ) 79 80 (*i)->print( os, indent + 2 ); 80 81 } 82 83 84 ConstructorInit::ConstructorInit( Statement * ctor, Statement * dtor, Initializer * init ) : Initializer( true ), ctor( ctor ), dtor( dtor ), init( init ) {} 85 ConstructorInit::~ConstructorInit() { 86 delete ctor; 87 delete init; 88 } 89 90 ConstructorInit *ConstructorInit::clone() const { 91 return new ConstructorInit( *this ); 92 } 93 94 void ConstructorInit::print( std::ostream &os, int indent ) { 95 os << std::endl << std::string(indent, ' ') << "Constructor initializer: "; 96 if ( ctor ) { 97 os << " initially constructed with "; 98 ctor->print( os, indent+2 ); 99 } // if 100 101 if ( dtor ) { 102 os << " destructed with "; 103 dtor->print( os, indent+2 ); 104 } 105 106 if ( init ) { 107 os << " with fallback C-style initializer: "; 108 init->print( os, indent+2 ); 109 } 110 } 111 112 81 113 // Local Variables: // 82 114 // tab-width: 4 // -
src/SynTree/Initializer.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Initializer.h -- 7 // Initializer.h -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Mon May 18 09:03:48 201513 // Update Count : 1 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Mar 30 13:22:08 2016 13 // Update Count : 19 14 14 // 15 15 … … 27 27 public: 28 28 // Initializer( std::string _name = std::string(""), int _pos = 0 ); 29 Initializer( );29 Initializer( bool maybeConstructed ); 30 30 virtual ~Initializer(); 31 31 … … 43 43 } 44 44 45 bool get_maybeConstructed() { return maybeConstructed; } 46 45 47 virtual Initializer *clone() const = 0; 46 48 virtual void accept( Visitor &v ) = 0; … … 50 52 // std::string name; 51 53 // int pos; 54 bool maybeConstructed; 52 55 }; 53 56 … … 55 58 class SingleInit : public Initializer { 56 59 public: 57 SingleInit( Expression *value, std::list< Expression *> &designators = *(new std::list<Expression *>()));60 SingleInit( Expression *value, const std::list< Expression *> &designators, bool maybeConstructed = false ); 58 61 SingleInit( const SingleInit &other ); 59 62 virtual ~SingleInit(); 60 63 61 64 Expression *get_value() { return value; } 62 65 void set_value( Expression *newValue ) { value = newValue; } … … 79 82 class ListInit : public Initializer { 80 83 public: 81 ListInit( std::list<Initializer*> &,82 std::list<Expression *> &designators = *(new std::list<Expression *>()));84 ListInit( const std::list<Initializer*> &initializers, 85 const std::list<Expression *> &designators, bool maybeConstructed = false ); 83 86 virtual ~ListInit(); 84 87 … … 100 103 }; 101 104 105 // ConstructorInit represents an initializer that is either a constructor expression or 106 // a C-style initializer. 107 class ConstructorInit : public Initializer { 108 public: 109 ConstructorInit( Statement * ctor, Statement * dtor, Initializer * init ); 110 virtual ~ConstructorInit(); 111 112 void set_ctor( Statement * newValue ) { ctor = newValue; } 113 Statement * get_ctor() const { return ctor; } 114 void set_dtor( Statement * newValue ) { dtor = newValue; } 115 Statement * get_dtor() const { return dtor; } 116 void set_init( Initializer * newValue ) { init = newValue; } 117 Initializer * get_init() const { return init; } 118 119 virtual ConstructorInit *clone() const; 120 virtual void accept( Visitor &v ) { v.visit( this ); } 121 virtual Initializer *acceptMutator( Mutator &m ) { return m.mutate( this ); } 122 virtual void print( std::ostream &os, int indent = 0 ); 123 124 private: 125 Statement * ctor; 126 Statement * dtor; 127 // C-style initializer made up of SingleInit and ListInit nodes to use as a fallback 128 // if an appropriate constructor definition is not found by the resolver 129 Initializer * init; 130 }; 131 102 132 #endif // INITIALIZER_H 103 133 -
src/SynTree/Mutator.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Mutator.cc -- 7 // Mutator.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:28:20 201613 // Update Count : 1 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:14:20 2016 13 // Update Count : 15 14 14 // 15 15 … … 437 437 } 438 438 439 Initializer *Mutator::mutate( ConstructorInit *ctorInit ) { 440 ctorInit->set_ctor( maybeMutate( ctorInit->get_ctor(), *this ) ); 441 ctorInit->set_init( maybeMutate( ctorInit->get_init(), *this ) ); 442 return ctorInit; 443 } 444 439 445 Subrange *Mutator::mutate( Subrange *subrange ) { 440 446 return subrange; -
src/SynTree/Mutator.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Mutator.h -- 7 // Mutator.h -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:33:11201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:14:44 2016 13 13 // Update Count : 9 14 14 // … … 62 62 virtual Expression* mutate( MemberExpr *memberExpr ); 63 63 virtual Expression* mutate( VariableExpr *variableExpr ); 64 virtual Expression* mutate( ConstantExpr *constantExpr ); 64 virtual Expression* mutate( ConstantExpr *constantExpr ); 65 65 virtual Expression* mutate( SizeofExpr *sizeofExpr ); 66 66 virtual Expression* mutate( AlignofExpr *alignofExpr ); … … 94 94 virtual Initializer* mutate( SingleInit *singleInit ); 95 95 virtual Initializer* mutate( ListInit *listInit ); 96 virtual Initializer* mutate( ConstructorInit *ctorInit ); 96 97 97 98 virtual Subrange *mutate( Subrange *subrange ); -
src/SynTree/ObjectDecl.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // ObjectDecl.cc -- 7 // ObjectDecl.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue Sep 29 14:13:01 201513 // Update Count : 1812 // Last Modified On : Tue Feb 09 13:21:03 2016 13 // Update Count : 30 14 14 // 15 15 … … 19 19 #include "Expression.h" 20 20 #include "Common/utility.h" 21 #include "Statement.h" 21 22 22 23 ObjectDecl::ObjectDecl( const std::string &name, DeclarationNode::StorageClass sc, LinkageSpec::Type linkage, Expression *bitfieldWidth, Type *type, Initializer *init, bool isInline, bool isNoreturn ) … … 58 59 os << " with initializer "; 59 60 init->print( os, indent ); 61 os << std::string(indent, ' ') << "maybeConstructed? " << init->get_maybeConstructed(); 60 62 } // if 61 63 … … 69 71 #if 0 70 72 if ( get_mangleName() != "") { 71 os << get_mangleName() << ": "; 72 } else 73 os << get_mangleName() << ": "; 74 } else 73 75 #endif 74 76 if ( get_name() != "" ) { -
src/SynTree/SynTree.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // SynTree.h -- 7 // SynTree.h -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:29:00201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:16:09 2016 13 13 // Update Count : 4 14 14 // … … 102 102 class SingleInit; 103 103 class ListInit; 104 class ConstructorInit; 104 105 105 106 class Subrange; -
src/SynTree/Visitor.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Visitor.cc -- 7 // Visitor.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:29:23201613 // Update Count : 1 611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:16:25 2016 13 // Update Count : 18 14 14 // 15 15 … … 368 368 } 369 369 370 void Visitor::visit( ConstructorInit *ctorInit ) { 371 maybeAccept( ctorInit->get_ctor(), *this ); 372 maybeAccept( ctorInit->get_init(), *this ); 373 } 374 370 375 void Visitor::visit( Subrange *subrange ) {} 371 376 -
src/SynTree/Visitor.h
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // Visitor.h -- 7 // Visitor.h -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Mar 2 17:33:35201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Mon Apr 04 17:16:36 2016 13 13 // Update Count : 6 14 14 // … … 62 62 virtual void visit( MemberExpr *memberExpr ); 63 63 virtual void visit( VariableExpr *variableExpr ); 64 virtual void visit( ConstantExpr *constantExpr ); 64 virtual void visit( ConstantExpr *constantExpr ); 65 65 virtual void visit( SizeofExpr *sizeofExpr ); 66 66 virtual void visit( AlignofExpr *alignofExpr ); … … 94 94 virtual void visit( SingleInit *singleInit ); 95 95 virtual void visit( ListInit *listInit ); 96 virtual void visit( ConstructorInit *ctorInit ); 96 97 97 98 virtual void visit( Subrange *subrange ); -
src/initialization.txt
r3aba311 ra5a71d0 34 34 sure that resolved initializers for all declarations are being 35 35 generated. 36 37 38 ------ 39 40 More recent email: (I am quoted; Richard is the responder) 41 > As far as I'm aware, the only way that I could currently get the correct 42 > results from the unification engine is by feeding it an expression that 43 > looks like "?=?( ((struct Y)x.y).a, 10 )", then picking out the pieces that 44 > I need (namely the correct choice for a). Does this seem like a reasonable 45 > approach to solve this problem? 46 47 No, unfortunately. Initialization isn't being rewritten as assignment, 48 so you shouldn't allow the particular selection of assignment 49 operators that happen to be in scope (and which may include 50 user-defined operators) to guide the type resolution. 51 52 I don't think there is any way to rewrite an initializer as a single 53 expression and have the resolver just do the right thing. I see the 54 algorithm as: 55 56 For each alternative interpretation of the designator: 57 Construct an expression that casts the initializer to the type of 58 the designator 59 Construct an AlternativeFinder and use it to find the lowest cost 60 interpretation of the expression 61 Add this interpretation to a list of possibilities 62 Go through the list of possibilities and pick the lowest cost 63 64 As with many things in the resolver, it's conceptually simple but the 65 implementation may be a bit of a pain. It fits in with functions like 66 findSingleExpression, findIntegralExpression in Resolver.cc, although 67 it will be significantly more complicated than any of the existing 68 ones. 69 70 71 -
src/libcfa/Makefile.am
r3aba311 ra5a71d0 6 6 ## file "LICENCE" distributed with Cforall. 7 7 ## 8 ## Makefile.am -- 8 ## Makefile.am -- 9 9 ## 10 10 ## Author : Peter A. Buhr … … 51 51 52 52 CFLAGS = -g -Wall -Wno-unused-function -B${abs_top_srcdir}/src/driver -XCFA -t # TEMPORARY: does not build with -O2 53 CC = ${abs_top_srcdir}/src/driver/cfa 53 CC = ${abs_top_srcdir}/src/driver/cfa 54 54 55 55 # extension-less header files are overridden by default make rules => explicitly override rule -
src/libcfa/Makefile.in
r3aba311 ra5a71d0 110 110 AWK = @AWK@ 111 111 BACKEND_CC = @BACKEND_CC@ 112 CC = ${abs_top_srcdir}/src/driver/cfa 112 CC = ${abs_top_srcdir}/src/driver/cfa 113 113 CCDEPMODE = @CCDEPMODE@ 114 114 CFA_BINDIR = @CFA_BINDIR@ -
src/libcfa/iostream.c
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // iostream.c -- 7 // iostream.c -- 8 8 // 9 9 // Author : Peter A. Buhr 10 10 // Created On : Wed May 27 17:56:53 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Mon Mar 7 13:51:23201611 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Apr 06 14:42:52 2016 13 13 // Update Count : 227 14 14 // … … 171 171 172 172 173 forall( dtype ostype | ostream( ostype ) ) 173 forall( dtype ostype | ostream( ostype ) ) 174 174 ostype * ?|?( ostype *os, ostype * (* manip)( ostype * ) ) { 175 175 return manip( os ); 176 176 } // ?|? 177 177 178 forall( dtype ostype | ostream( ostype ) ) 178 forall( dtype ostype | ostream( ostype ) ) 179 179 ostype * endl( ostype * os ) { 180 180 os | '\n'; … … 184 184 } // endl 185 185 186 forall( dtype ostype | ostream( ostype ) ) 186 forall( dtype ostype | ostream( ostype ) ) 187 187 ostype * sepOn( ostype * os ) { 188 188 sepOn( os ); … … 190 190 } // sepOn 191 191 192 forall( dtype ostype | ostream( ostype ) ) 192 forall( dtype ostype | ostream( ostype ) ) 193 193 ostype * sepOff( ostype * os ) { 194 194 sepOff( os ); … … 310 310 } // ?|? 311 311 312 _Istream_str1 str( char * s ) { _Istream_str1 s = { s}; return s; }312 _Istream_str1 str( char * str ) { _Istream_str1 s = { str }; return s; } 313 313 forall( dtype istype | istream( istype ) ) 314 314 istype * ?|?( istype * is, _Istream_str1 str ) { … … 317 317 } // str 318 318 319 _Istream_str2 str( char * s , int size ) { _Istream_str2 s = { s, size }; return s; }319 _Istream_str2 str( char * str, int size ) { _Istream_str2 s = { str, size }; return s; } 320 320 forall( dtype istype | istream( istype ) ) 321 321 istype * ?|?( istype * is, _Istream_str2 str ) { -
src/libcfa/prelude.cf
r3aba311 ra5a71d0 1 1 # 2 "prelude.cf" // needed for error messages from this file 2 // -*- Mode: C -*- 3 // 2 // -*- Mode: C -*- 3 // 4 4 // Copyright (C) Glen Ditchfield 1994, 1999 5 // 5 // 6 6 // prelude.cf -- Standard Cforall Preample for C99 7 // 7 // 8 8 // Author : Glen Ditchfield 9 9 // Created On : Sat Nov 29 07:23:41 2014 … … 117 117 forall( ftype FT ) lvalue FT *?( FT * ); 118 118 119 _Bool +?( _Bool ), -?( _Bool ), ~?( _Bool ); 120 signed int +?( signed int ), -?( signed int ), ~?( signed int ); 121 unsigned int +?( unsigned int ), -?( unsigned int ), ~?( unsigned int ); 122 signed long int +?( signed long int ), -?( signed long int ), ~?( signed long int ); 123 unsigned long int +?( unsigned long int ), -?( unsigned long int ), ~?( unsigned long int ); 124 signed long long int +?( signed long long int ), -?( signed long long int ), ~?( signed long long int ); 125 unsigned long long int +?( unsigned long long int ), -?( unsigned long long int ), ~?( unsigned long long int ); 119 _Bool +?( _Bool ), -?( _Bool ), ~?( _Bool ); 120 signed int +?( signed int ), -?( signed int ), ~?( signed int ); 121 unsigned int +?( unsigned int ), -?( unsigned int ), ~?( unsigned int ); 122 signed long int +?( signed long int ), -?( signed long int ), ~?( signed long int ); 123 unsigned long int +?( unsigned long int ), -?( unsigned long int ), ~?( unsigned long int ); 124 signed long long int +?( signed long long int ), -?( signed long long int ), ~?( signed long long int ); 125 unsigned long long int +?( unsigned long long int ), -?( unsigned long long int ), ~?( unsigned long long int ); 126 126 float +?( float ), -?( float ); 127 127 double +?( double ), -?( double ); … … 627 627 ?+=?( long double _Complex *, long double _Complex ), ?+=?( volatile long double _Complex *, long double _Complex ), 628 628 ?-=?( long double _Complex *, long double _Complex ), ?-=?( volatile long double _Complex *, long double _Complex ); 629 630 631 632 633 634 // ------------------------------------------------------------ 635 // 636 // Section ??? Constructors and Destructors 637 // 638 // ------------------------------------------------------------ 639 640 // default ctor 641 void ?{}( _Bool * ), ?{}( volatile _Bool * ); 642 void ?{}( char * ), ?{}( volatile char * ); 643 void ?{}( unsigned char * ), ?{}( volatile unsigned char * ); 644 void ?{}( char signed * ), ?{}( volatile char signed * ); 645 void ?{}( int short * ), ?{}( volatile int short * ); 646 void ?{}( int short unsigned * ), ?{}( volatile int short unsigned * ); 647 void ?{}( signed int * ), ?{}( volatile signed int * ); 648 void ?{}( unsigned int * ), ?{}( volatile unsigned int * ); 649 void ?{}( signed long int * ), ?{}( volatile signed long int * ); 650 void ?{}( unsigned long int * ), ?{}( volatile unsigned long int * ); 651 void ?{}( signed long long int * ), ?{}( volatile signed long long int * ); 652 void ?{}( unsigned long long int * ), ?{}( volatile unsigned long long int * ); 653 void ?{}( float * ), ?{}( volatile float * ); 654 void ?{}( double * ), ?{}( volatile double * ); 655 void ?{}( long double * ), ?{}( volatile long double * ); 656 void ?{}( float _Complex * ), ?{}( volatile float _Complex * ); 657 void ?{}( double _Complex * ), ?{}( volatile double _Complex * ); 658 void ?{}( long double _Complex * ), ?{}( volatile long double _Complex * ); 659 660 // copy ctor 661 void ?{}( _Bool *, _Bool ), ?{}( volatile _Bool *, _Bool ); 662 void ?{}( char *, char ), ?{}( volatile char *, char ); 663 void ?{}( unsigned char *, unsigned char ), ?{}( volatile unsigned char *, unsigned char ); 664 void ?{}( char signed *, char signed ), ?{}( volatile char signed *, char signed ); 665 void ?{}( int short *, int short ), ?{}( volatile int short *, int short ); 666 void ?{}( int short unsigned *, int short unsigned ), ?{}( volatile int short unsigned *, int short unsigned ); 667 void ?{}( signed int *, signed int), ?{}( volatile signed int *, signed int ); 668 void ?{}( unsigned int *, unsigned int), ?{}( volatile unsigned int *, unsigned int ); 669 void ?{}( signed long int *, signed long int), ?{}( volatile signed long int *, signed long int ); 670 void ?{}( unsigned long int *, unsigned long int), ?{}( volatile unsigned long int *, unsigned long int ); 671 void ?{}( signed long long int *, signed long long int), ?{}( volatile signed long long int *, signed long long int ); 672 void ?{}( unsigned long long int *, unsigned long long int), ?{}( volatile unsigned long long int *, unsigned long long int ); 673 void ?{}( float *, float), ?{}( volatile float *, float ); 674 void ?{}( double *, double), ?{}( volatile double *, double ); 675 void ?{}( long double *, long double), ?{}( volatile long double *, long double ); 676 void ?{}( float _Complex *, float _Complex), ?{}( volatile float _Complex *, float _Complex ); 677 void ?{}( double _Complex *, double _Complex), ?{}( volatile double _Complex *, double _Complex ); 678 void ?{}( long double _Complex *, long double _Complex), ?{}( volatile long double _Complex *, long double _Complex ); 679 680 // dtor 681 void ^?{}( _Bool * ), ^?{}( volatile _Bool * ); 682 void ^?{}( char * ), ^?{}( volatile char * ); 683 void ^?{}( char unsigned * ), ^?{}( volatile char unsigned * ); 684 void ^?{}( char signed * ), ^?{}( volatile char signed * ); 685 void ^?{}( int short * ), ^?{}( volatile int short * ); 686 void ^?{}( int short unsigned * ), ^?{}( volatile int short unsigned * ); 687 void ^?{}( signed int * ), ^?{}( volatile signed int * ); 688 void ^?{}( unsigned int * ), ^?{}( volatile unsigned int * ); 689 void ^?{}( signed long int * ), ^?{}( volatile signed long int * ); 690 void ^?{}( unsigned long int * ), ^?{}( volatile unsigned long int * ); 691 void ^?{}( signed long long int * ), ^?{}( volatile signed long long int * ); 692 void ^?{}( unsigned long long int * ), ^?{}( volatile unsigned long long int * ); 693 void ^?{}( float * ), ^?{}( volatile float * ); 694 void ^?{}( double * ), ^?{}( volatile double * ); 695 void ^?{}( long double * ), ^?{}( volatile long double * ); 696 void ^?{}( float _Complex * ), ^?{}( volatile float _Complex * ); 697 void ^?{}( double _Complex * ), ^?{}( volatile double _Complex * ); 698 void ^?{}( long double _Complex * ), ^?{}( volatile long double _Complex * ); 699 700 // // default ctor 701 // forall( dtype DT ) void ?{}( DT ** ); 702 // forall( dtype DT ) void ?{}( const DT ** ); 703 // forall( dtype DT ) void ?{}( volatile DT ** ); 704 // forall( dtype DT ) void ?{}( const volatile DT ** ); 705 706 // // copy ctor 707 // forall( dtype DT ) void ?{}( DT **, DT* ); 708 // forall( dtype DT ) void ?{}( const DT **, DT* ); 709 // forall( dtype DT ) void ?{}( volatile DT **, DT* ); 710 // forall( dtype DT ) void ?{}( const volatile DT **, DT* ); 711 712 // // dtor 713 // forall( dtype DT ) void ^?{}( DT ** ); 714 // forall( dtype DT ) void ^?{}( const DT ** ); 715 // forall( dtype DT ) void ^?{}( volatile DT ** ); 716 // forall( dtype DT ) void ^?{}( const volatile DT ** ); 717 718 // copied from assignment section 719 // copy constructors 720 forall( ftype FT ) void ?{}( FT **, FT * ); 721 forall( ftype FT ) void ?{}( FT * volatile *, FT * ); 722 723 forall( dtype DT ) void ?{}( DT * *, DT * ); 724 forall( dtype DT ) void ?{}( DT * volatile *, DT * ); 725 forall( dtype DT ) void ?{}( const DT * *, DT * ); 726 forall( dtype DT ) void ?{}( const DT * volatile *, DT * ); 727 forall( dtype DT ) void ?{}( const DT * *, const DT * ); 728 forall( dtype DT ) void ?{}( const DT * volatile *, const DT * ); 729 forall( dtype DT ) void ?{}( volatile DT * *, DT * ); 730 forall( dtype DT ) void ?{}( volatile DT * volatile *, DT * ); 731 forall( dtype DT ) void ?{}( volatile DT * *, volatile DT * ); 732 forall( dtype DT ) void ?{}( volatile DT * volatile *, volatile DT * ); 733 734 forall( dtype DT ) void ?{}( const volatile DT * *, DT * ); 735 forall( dtype DT ) void ?{}( const volatile DT * volatile *, DT * ); 736 forall( dtype DT ) void ?{}( const volatile DT * *, const DT * ); 737 forall( dtype DT ) void ?{}( const volatile DT * volatile *, const DT * ); 738 forall( dtype DT ) void ?{}( const volatile DT * *, volatile DT * ); 739 forall( dtype DT ) void ?{}( const volatile DT * volatile *, volatile DT * ); 740 forall( dtype DT ) void ?{}( const volatile DT * *, const volatile DT * ); 741 forall( dtype DT ) void ?{}( const volatile DT * volatile *, const volatile DT * ); 742 743 forall( dtype DT ) void ?{}( DT * *, void * ); 744 forall( dtype DT ) void ?{}( DT * volatile *, void * ); 745 forall( dtype DT ) void ?{}( const DT * *, void * ); 746 forall( dtype DT ) void ?{}( const DT * volatile *, void * ); 747 forall( dtype DT ) void ?{}( const DT * *, const void * ); 748 forall( dtype DT ) void ?{}( const DT * volatile *, const void * ); 749 forall( dtype DT ) void ?{}( volatile DT * *, void * ); 750 forall( dtype DT ) void ?{}( volatile DT * volatile *, void * ); 751 forall( dtype DT ) void ?{}( volatile DT * *, volatile void * ); 752 forall( dtype DT ) void ?{}( volatile DT * volatile *, volatile void * ); 753 754 forall( dtype DT ) void ?{}( const volatile DT * *, void * ); 755 forall( dtype DT ) void ?{}( const volatile DT * volatile *, void * ); 756 forall( dtype DT ) void ?{}( const volatile DT * *, const void * ); 757 forall( dtype DT ) void ?{}( const volatile DT * volatile *, const void * ); 758 forall( dtype DT ) void ?{}( const volatile DT * *, volatile void * ); 759 forall( dtype DT ) void ?{}( const volatile DT * volatile *, volatile void * ); 760 forall( dtype DT ) void ?{}( const volatile DT * *, const volatile void * ); 761 forall( dtype DT ) void ?{}( const volatile DT * volatile *, const volatile void * ); 762 763 forall( dtype DT ) void ?{}( void * *, DT * ); 764 forall( dtype DT ) void ?{}( void * volatile *, DT * ); 765 forall( dtype DT ) void ?{}( const void * *, DT * ); 766 forall( dtype DT ) void ?{}( const void * volatile *, DT * ); 767 forall( dtype DT ) void ?{}( const void * *, const DT * ); 768 forall( dtype DT ) void ?{}( const void * volatile *, const DT * ); 769 forall( dtype DT ) void ?{}( volatile void * *, DT * ); 770 forall( dtype DT ) void ?{}( volatile void * volatile *, DT * ); 771 forall( dtype DT ) void ?{}( volatile void * *, volatile DT * ); 772 forall( dtype DT ) void ?{}( volatile void * volatile *, volatile DT * ); 773 forall( dtype DT ) void ?{}( const volatile void * *, DT * ); 774 forall( dtype DT ) void ?{}( const volatile void * volatile *, DT * ); 775 forall( dtype DT ) void ?{}( const volatile void * *, const DT * ); 776 forall( dtype DT ) void ?{}( const volatile void * volatile *, const DT * ); 777 forall( dtype DT ) void ?{}( const volatile void * *, volatile DT * ); 778 forall( dtype DT ) void ?{}( const volatile void * volatile *, volatile DT * ); 779 forall( dtype DT ) void ?{}( const volatile void * *, const volatile DT * ); 780 forall( dtype DT ) void ?{}( const volatile void * volatile *, const volatile DT * ); 781 782 void ?{}( void * *, void * ); 783 void ?{}( void * volatile *, void * ); 784 void ?{}( const void * *, void * ); 785 void ?{}( const void * volatile *, void * ); 786 void ?{}( const void * *, const void * ); 787 void ?{}( const void * volatile *, const void * ); 788 void ?{}( volatile void * *, void * ); 789 void ?{}( volatile void * volatile *, void * ); 790 void ?{}( volatile void * *, volatile void * ); 791 void ?{}( volatile void * volatile *, volatile void * ); 792 void ?{}( const volatile void * *, void * ); 793 void ?{}( const volatile void * volatile *, void * ); 794 void ?{}( const volatile void * *, const void * ); 795 void ?{}( const volatile void * volatile *, const void * ); 796 void ?{}( const volatile void * *, volatile void * ); 797 void ?{}( const volatile void * volatile *, volatile void * ); 798 void ?{}( const volatile void * *, const volatile void * ); 799 void ?{}( const volatile void * volatile *, const volatile void * ); 800 801 //forall( dtype DT ) void ?{}( DT * *, forall( dtype DT2 ) const DT2 * ); 802 //forall( dtype DT ) void ?{}( DT * volatile *, forall( dtype DT2 ) const DT2 * ); 803 forall( dtype DT ) void ?{}( const DT * *, forall( dtype DT2 ) const DT2 * ); 804 forall( dtype DT ) void ?{}( const DT * volatile *, forall( dtype DT2 ) const DT2 * ); 805 //forall( dtype DT ) void ?{}( volatile DT * *, forall( dtype DT2 ) const DT2 * ); 806 //forall( dtype DT ) void ?{}( volatile DT * volatile *, forall( dtype DT2 ) const DT2 * ); 807 forall( dtype DT ) void ?{}( const volatile DT * *, forall( dtype DT2 ) const DT2 * ); 808 forall( dtype DT ) void ?{}( const volatile DT * volatile *, forall( dtype DT2 ) const DT2 * ); 809 810 forall( ftype FT ) void ?{}( FT * *, forall( ftype FT2 ) FT2 * ); 811 forall( ftype FT ) void ?{}( FT * volatile *, forall( ftype FT2 ) FT2 * ); 812 813 // default ctors 814 forall( ftype FT ) void ?{}( FT * * ); 815 forall( ftype FT ) void ?{}( FT * volatile * ); 816 817 forall( dtype DT ) void ?{}( DT * *); 818 forall( dtype DT ) void ?{}( DT * volatile *); 819 forall( dtype DT ) void ?{}( const DT * *); 820 forall( dtype DT ) void ?{}( const DT * volatile *); 821 forall( dtype DT ) void ?{}( volatile DT * *); 822 forall( dtype DT ) void ?{}( volatile DT * volatile *); 823 forall( dtype DT ) void ?{}( const volatile DT * *); 824 forall( dtype DT ) void ?{}( const volatile DT * volatile *); 825 826 void ?{}( void * *); 827 void ?{}( void * volatile *); 828 void ?{}( const void * *); 829 void ?{}( const void * volatile *); 830 void ?{}( volatile void * *); 831 void ?{}( volatile void * volatile *); 832 void ?{}( const volatile void * *); 833 void ?{}( const volatile void * volatile *); 834 835 // dtors 836 forall( ftype FT ) void ^?{}( FT * * ); 837 forall( ftype FT ) void ^?{}( FT * volatile * ); 838 839 forall( dtype DT ) void ^?{}( DT * *); 840 forall( dtype DT ) void ^?{}( DT * volatile *); 841 forall( dtype DT ) void ^?{}( const DT * *); 842 forall( dtype DT ) void ^?{}( const DT * volatile *); 843 forall( dtype DT ) void ^?{}( volatile DT * *); 844 forall( dtype DT ) void ^?{}( volatile DT * volatile *); 845 forall( dtype DT ) void ^?{}( const volatile DT * *); 846 forall( dtype DT ) void ^?{}( const volatile DT * volatile *); 847 848 void ^?{}( void * *); 849 void ^?{}( void * volatile *); 850 void ^?{}( const void * *); 851 void ^?{}( const void * volatile *); 852 void ^?{}( volatile void * *); 853 void ^?{}( volatile void * volatile *); 854 void ^?{}( const volatile void * *); 855 void ^?{}( const volatile void * volatile *); -
src/main.cc
r3aba311 ra5a71d0 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // main.cc -- 7 // main.cc -- 8 8 // 9 9 // Author : Richard C. Bilson 10 10 // Created On : Fri May 15 23:12:02 2015 11 // Last Modified By : Peter A. Buhr12 // Last Modified On : Wed Jan 27 22:20:20201613 // Update Count : 19911 // Last Modified By : Rob Schluntz 12 // Last Modified On : Thu Mar 31 14:00:12 2016 13 // Update Count : 200 14 14 // 15 15 … … 41 41 #include "InitTweak/Mutate.h" 42 42 #include "InitTweak/RemoveInit.h" 43 #include "InitTweak/FixInit.h" 43 44 //#include "Explain/GenProlog.h" 44 45 //#include "Try/Visit.h" … … 60 61 astp = false, 61 62 bresolvep = false, 63 ctorinitp = false, 62 64 exprp = false, 63 65 expraltp = false, … … 74 76 codegenp = false; 75 77 76 enum { Ast, Bresolver, Expr, ExprAlt, Grammar, LibCFA, Nopreamble, Parse, Prototypes, Resolver, Symbol, Tree, Validate, };78 enum { Ast, Bresolver, CtorInitFix, Expr, ExprAlt, Grammar, LibCFA, Nopreamble, Parse, Prototypes, Resolver, Symbol, Tree, Validate, }; 77 79 78 80 static struct option long_opts[] = { 79 81 { "ast", no_argument, 0, Ast }, 80 82 { "before-resolver", no_argument, 0, Bresolver }, 83 { "ctorinitfix", no_argument, 0, CtorInitFix }, 81 84 { "expr", no_argument, 0, Expr }, 82 85 { "expralt", no_argument, 0, ExprAlt }, … … 100 103 101 104 opterr = 0; // prevent getopt from printing error messages 102 105 103 106 int c; 104 while ( (c = getopt_long( argc, argv, "ab efglnpqrstvyzD:", long_opts, &long_index )) != -1 ) {107 while ( (c = getopt_long( argc, argv, "abcefFglnpqrstvyzD:", long_opts, &long_index )) != -1 ) { 105 108 switch ( c ) { 106 109 case Ast: … … 111 114 case 'b': // print before resolver steps 112 115 bresolvep = true; 116 break; 117 case CtorInitFix: 118 case 'c': 119 ctorinitp = true; 113 120 break; 114 121 case Expr: … … 187 194 output = new ofstream( argv[ optind ] ); 188 195 } // if 189 196 190 197 Parser::get_parser().set_debug( grammarp ); 191 198 … … 208 215 exit( 1 ); 209 216 } // if 210 217 211 218 parse( prelude, LinkageSpec::Intrinsic ); 212 219 } // if 213 220 } // if 214 221 215 parse( input, libcfap ? LinkageSpec::Intrinsic : LinkageSpec::Cforall, grammarp ); 216 222 parse( input, libcfap ? LinkageSpec::Intrinsic : LinkageSpec::Cforall, grammarp ); 223 217 224 if ( parsep ) { 218 225 Parser::get_parser().get_parseTree()->printList( std::cout ); … … 249 256 OPTPRINT( "mutate" ) 250 257 ControlStruct::mutate( translationUnit ); 251 OPTPRINT( "fixNames" ) 258 OPTPRINT( "fixNames" ) 252 259 CodeGen::fixNames( translationUnit ); 253 OPTPRINT( "tweak " )260 OPTPRINT( "tweakInit" ) 254 261 InitTweak::tweak( translationUnit ); 255 262 … … 268 275 if ( exprp ) { 269 276 dump( translationUnit ); 277 return 0; 278 } 279 280 OPTPRINT( "fixInit" ) 281 // fix ObjectDecl - replaces ConstructorInit nodes 282 InitTweak::fix( translationUnit ); 283 if ( ctorinitp ) { 284 dump ( translationUnit ); 285 return 0; 270 286 } 271 287 … … 278 294 OPTPRINT( "box" ) 279 295 GenPoly::box( translationUnit ); 280 296 281 297 // print tree right before code generation 282 298 if ( codegenp ) { … … 314 330 } // try 315 331 332 deleteAll( translationUnit ); 316 333 return 0; 317 334 } // main … … 334 351 std::list< Declaration * > decls; 335 352 if ( noprotop ) { 336 filter( translationUnit.begin(), translationUnit.end(), 353 filter( translationUnit.begin(), translationUnit.end(), 337 354 std::back_inserter( decls ), notPrelude ); 338 355 } else {
Note: See TracChangeset
for help on using the changeset viewer.