Changeset 9a8930f
- Timestamp:
- Jun 4, 2015, 2:07:40 PM (9 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, gc_noraii, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, string, with_gc
- Children:
- 0423f25, eb3261f
- Parents:
- a61fea9a (diff), 1136d96 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the(diff)
links above to see all the changes relative to each parent. - Location:
- src
- Files:
-
- 18 edited
Legend:
- Unmodified
- Added
- Removed
-
src/CodeGen/CodeGenerator.cc
ra61fea9a r9a8930f 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // CodeGenerator 2.cc --7 // CodeGenerator.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 : Peter A. Buhr 12 // Last Modified On : Wed Jun 3 11:53:32201513 // Update Count : 1 312 // Last Modified On : Thu Jun 4 14:05:45 2015 13 // Update Count : 120 14 14 // 15 15 … … 35 35 36 36 namespace CodeGen { 37 int CodeGenerator2::tabsize = 4; 38 39 CodeGenerator2::CodeGenerator2( std::ostream &os ) : cur_indent( 0 ), insideFunction( false ), before( os ), after() { } 40 41 CodeGenerator2::CodeGenerator2( std::ostream &os, std::string init, int indent, bool infunp ) 42 : cur_indent( indent ), insideFunction( infunp ), before( os ) { 43 //before << std::string( init ); 44 } 45 46 CodeGenerator2::CodeGenerator2( std::ostream &os, char *init, int indent, bool infunp ) 47 : cur_indent( indent ), insideFunction( infunp ), before( os ) { 48 //before << std::string( init ); 37 int CodeGenerator::tabsize = 4; 38 39 // the kinds of statements that would ideally be separated by more whitespace 40 bool wantSpacing( Statement * stmt) { 41 return dynamic_cast< IfStmt * >( stmt ) || dynamic_cast< CompoundStmt * >( stmt ) || 42 dynamic_cast< WhileStmt * >( stmt ) || dynamic_cast< ForStmt * > ( stmt ) || dynamic_cast< SwitchStmt *>( stmt ); 43 } 44 45 CodeGenerator::CodeGenerator( std::ostream &os ) : cur_indent( 0 ), insideFunction( false ), output( os ) { } 46 47 CodeGenerator::CodeGenerator( std::ostream &os, std::string init, int indent, bool infunp ) 48 : cur_indent( indent ), insideFunction( infunp ), output( os ) { 49 //output << std::string( init ); 50 } 51 52 CodeGenerator::CodeGenerator( std::ostream &os, char *init, int indent, bool infunp ) 53 : cur_indent( indent ), insideFunction( infunp ), output( os ) { 54 //output << std::string( init ); 49 55 } 50 56 … … 58 64 59 65 //*** Declarations 60 void CodeGenerator 2::visit( FunctionDecl *functionDecl ) {66 void CodeGenerator::visit( FunctionDecl *functionDecl ) { 61 67 handleStorageClass( functionDecl ); 62 68 if ( functionDecl->get_isInline() ) { 63 before<< "inline ";64 } // if 65 before<< genType( functionDecl->get_functionType(), mangleName( functionDecl ) );69 output << "inline "; 70 } // if 71 output << genType( functionDecl->get_functionType(), mangleName( functionDecl ) ); 66 72 67 73 // how to get this to the Functype? 68 74 std::list< Declaration * > olds = functionDecl->get_oldDecls(); 69 75 if ( ! olds.empty() ) { 70 before<< " /* function has old declaration */";76 output << " /* function has old declaration */"; 71 77 } // if 72 78 … … 77 83 } 78 84 79 void CodeGenerator 2::visit( ObjectDecl *objectDecl ) {85 void CodeGenerator::visit( ObjectDecl *objectDecl ) { 80 86 handleStorageClass( objectDecl ); 81 before<< genType( objectDecl->get_type(), mangleName( objectDecl ) );87 output << genType( objectDecl->get_type(), mangleName( objectDecl ) ); 82 88 83 89 if ( objectDecl->get_init() ) { 84 before<< " = ";90 output << " = "; 85 91 objectDecl->get_init()->accept( *this ); 86 92 } // if 87 93 if ( objectDecl->get_bitfieldWidth() ) { 88 before<< ":";94 output << ":"; 89 95 objectDecl->get_bitfieldWidth()->accept( *this ); 90 96 } // if 91 97 } 92 98 93 void CodeGenerator 2::handleAggregate( AggregateDecl *aggDecl ) {99 void CodeGenerator::handleAggregate( AggregateDecl *aggDecl ) { 94 100 if ( aggDecl->get_name() != "" ) 95 before<< aggDecl->get_name();101 output << aggDecl->get_name(); 96 102 97 103 std::list< Declaration * > &memb = aggDecl->get_members(); 98 104 99 105 if ( ! memb.empty() ) { 100 before<< endl << string( cur_indent, ' ' ) << "{" << endl;101 102 cur_indent += CodeGenerator 2::tabsize;106 output << endl << string( cur_indent, ' ' ) << "{" << endl; 107 108 cur_indent += CodeGenerator::tabsize; 103 109 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) { 104 before<< string( cur_indent, ' ' );110 output << string( cur_indent, ' ' ); 105 111 (*i)->accept(*this ); 106 before<< ";" << endl;112 output << ";" << endl; 107 113 } 108 114 109 cur_indent -= CodeGenerator 2::tabsize;110 111 before<< string( cur_indent, ' ' ) << "}";112 } // if 113 } 114 115 void CodeGenerator 2::visit( StructDecl *structDecl ) {116 before<< "struct ";115 cur_indent -= CodeGenerator::tabsize; 116 117 output << string( cur_indent, ' ' ) << "}"; 118 } // if 119 } 120 121 void CodeGenerator::visit( StructDecl *structDecl ) { 122 output << "struct "; 117 123 handleAggregate( structDecl ); 118 124 } 119 125 120 void CodeGenerator 2::visit( UnionDecl *aggregateDecl ) {121 before<< "union ";126 void CodeGenerator::visit( UnionDecl *aggregateDecl ) { 127 output << "union "; 122 128 handleAggregate( aggregateDecl ); 123 129 } 124 130 125 void CodeGenerator 2::visit( EnumDecl *aggDecl ) {126 before<< "enum ";131 void CodeGenerator::visit( EnumDecl *aggDecl ) { 132 output << "enum "; 127 133 128 134 if ( aggDecl->get_name() != "" ) 129 before<< aggDecl->get_name();135 output << aggDecl->get_name(); 130 136 131 137 std::list< Declaration* > &memb = aggDecl->get_members(); 132 138 133 139 if ( ! memb.empty() ) { 134 before<< endl << "{" << endl;135 136 cur_indent += CodeGenerator 2::tabsize;140 output << endl << "{" << endl; 141 142 cur_indent += CodeGenerator::tabsize; 137 143 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) { 138 144 ObjectDecl *obj = dynamic_cast< ObjectDecl* >( *i ); 139 145 assert( obj ); 140 before<< string( cur_indent, ' ' ) << mangleName( obj );146 output << string( cur_indent, ' ' ) << mangleName( obj ); 141 147 if ( obj->get_init() ) { 142 before<< " = ";148 output << " = "; 143 149 obj->get_init()->accept(*this ); 144 150 } // if 145 before<< "," << endl;151 output << "," << endl; 146 152 } // for 147 153 148 cur_indent -= CodeGenerator 2::tabsize;149 150 before<< "}" << endl;151 } // if 152 } 153 154 void CodeGenerator 2::visit( ContextDecl *aggregateDecl ) {}155 156 void CodeGenerator 2::visit( TypedefDecl *typeDecl ) {157 before<< "typedef ";158 before<< genType( typeDecl->get_base(), typeDecl->get_name() );159 } 160 161 void CodeGenerator 2::visit( TypeDecl *typeDecl ) {154 cur_indent -= CodeGenerator::tabsize; 155 156 output << "}" << endl; 157 } // if 158 } 159 160 void CodeGenerator::visit( ContextDecl *aggregateDecl ) {} 161 162 void CodeGenerator::visit( TypedefDecl *typeDecl ) { 163 output << "typedef "; 164 output << genType( typeDecl->get_base(), typeDecl->get_name() ); 165 } 166 167 void CodeGenerator::visit( TypeDecl *typeDecl ) { 162 168 // really, we should mutate this into something that isn't a TypeDecl but that requires large-scale changes, 163 169 // still to be done 164 before<< "extern unsigned long " << typeDecl->get_name();170 output << "extern unsigned long " << typeDecl->get_name(); 165 171 if ( typeDecl->get_base() ) { 166 before<< " = sizeof( " << genType( typeDecl->get_base(), "" ) << " )";167 } // if 168 } 169 170 void CodeGenerator 2::visit( SingleInit *init ) {172 output << " = sizeof( " << genType( typeDecl->get_base(), "" ) << " )"; 173 } // if 174 } 175 176 void CodeGenerator::visit( SingleInit *init ) { 171 177 init->get_value()->accept( *this ); 172 178 } 173 179 174 void CodeGenerator 2::visit( ListInit *init ) {175 before<< "{ ";180 void CodeGenerator::visit( ListInit *init ) { 181 output << "{ "; 176 182 genCommaList( init->begin_initializers(), init->end_initializers() ); 177 before<< " }";178 } 179 180 void CodeGenerator 2::visit( Constant *constant ) {181 before<< constant->get_value() ;183 output << " }"; 184 } 185 186 void CodeGenerator::visit( Constant *constant ) { 187 output << constant->get_value() ; 182 188 } 183 189 184 190 //*** Expressions 185 void CodeGenerator 2::visit( ApplicationExpr *applicationExpr ) {191 void CodeGenerator::visit( ApplicationExpr *applicationExpr ) { 186 192 if ( VariableExpr *varExpr = dynamic_cast< VariableExpr* >( applicationExpr->get_function() ) ) { 187 193 OperatorInfo opInfo; … … 214 220 assert( applicationExpr->get_args().size() == 2 ); 215 221 (*arg++)->accept( *this ); 216 before<< "[";217 (*arg)->accept( *this ); 218 before<< "]";222 output << "["; 223 (*arg)->accept( *this ); 224 output << "]"; 219 225 break; 220 226 … … 227 233 case OT_PREFIXASSIGN: 228 234 assert( applicationExpr->get_args().size() == 1 ); 229 before<< "(";230 before<< opInfo.symbol;231 (*arg)->accept( *this ); 232 before<< ")";235 output << "("; 236 output << opInfo.symbol; 237 (*arg)->accept( *this ); 238 output << ")"; 233 239 break; 234 240 … … 237 243 assert( applicationExpr->get_args().size() == 1 ); 238 244 (*arg)->accept( *this ); 239 before<< opInfo.symbol;245 output << opInfo.symbol; 240 246 break; 241 247 … … 243 249 case OT_INFIXASSIGN: 244 250 assert( applicationExpr->get_args().size() == 2 ); 245 before<< "(";251 output << "("; 246 252 (*arg++)->accept( *this ); 247 before<< opInfo.symbol;248 (*arg)->accept( *this ); 249 before<< ")";253 output << opInfo.symbol; 254 (*arg)->accept( *this ); 255 output << ")"; 250 256 break; 251 257 … … 256 262 } else { 257 263 varExpr->accept( *this ); 258 before<< "(";264 output << "("; 259 265 genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() ); 260 before<< ")";266 output << ")"; 261 267 } // if 262 268 } else { 263 269 applicationExpr->get_function()->accept( *this ); 264 before<< "(";270 output << "("; 265 271 genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() ); 266 before<< ")";267 } // if 268 } 269 270 void CodeGenerator 2::visit( UntypedExpr *untypedExpr ) {272 output << ")"; 273 } // if 274 } 275 276 void CodeGenerator::visit( UntypedExpr *untypedExpr ) { 271 277 if ( NameExpr *nameExpr = dynamic_cast< NameExpr* >( untypedExpr->get_function() ) ) { 272 278 OperatorInfo opInfo; … … 277 283 assert( untypedExpr->get_args().size() == 2 ); 278 284 (*arg++)->accept( *this ); 279 before<< "[";280 (*arg)->accept( *this ); 281 before<< "]";285 output << "["; 286 (*arg)->accept( *this ); 287 output << "]"; 282 288 break; 283 289 … … 289 295 case OT_PREFIXASSIGN: 290 296 assert( untypedExpr->get_args().size() == 1 ); 291 before<< "(";292 before<< opInfo.symbol;293 (*arg)->accept( *this ); 294 before<< ")";297 output << "("; 298 output << opInfo.symbol; 299 (*arg)->accept( *this ); 300 output << ")"; 295 301 break; 296 302 … … 299 305 assert( untypedExpr->get_args().size() == 1 ); 300 306 (*arg)->accept( *this ); 301 before<< opInfo.symbol;307 output << opInfo.symbol; 302 308 break; 303 309 … … 305 311 case OT_INFIXASSIGN: 306 312 assert( untypedExpr->get_args().size() == 2 ); 307 before<< "(";313 output << "("; 308 314 (*arg++)->accept( *this ); 309 before<< opInfo.symbol;310 (*arg)->accept( *this ); 311 before<< ")";315 output << opInfo.symbol; 316 (*arg)->accept( *this ); 317 output << ")"; 312 318 break; 313 319 … … 318 324 } else { 319 325 nameExpr->accept( *this ); 320 before<< "(";326 output << "("; 321 327 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() ); 322 before<< ")";328 output << ")"; 323 329 } // if 324 330 } else { 325 331 untypedExpr->get_function()->accept( *this ); 326 before<< "(";332 output << "("; 327 333 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() ); 328 before<< ")";329 } // if 330 } 331 332 void CodeGenerator 2::visit( NameExpr *nameExpr ) {334 output << ")"; 335 } // if 336 } 337 338 void CodeGenerator::visit( NameExpr *nameExpr ) { 333 339 OperatorInfo opInfo; 334 340 if ( operatorLookup( nameExpr->get_name(), opInfo ) ) { 335 341 assert( opInfo.type == OT_CONSTANT ); 336 before<< opInfo.symbol;337 } else { 338 before<< nameExpr->get_name();339 } // if 340 } 341 342 void CodeGenerator 2::visit( AddressExpr *addressExpr ) {343 before<< "(&";342 output << opInfo.symbol; 343 } else { 344 output << nameExpr->get_name(); 345 } // if 346 } 347 348 void CodeGenerator::visit( AddressExpr *addressExpr ) { 349 output << "(&"; 344 350 // this hack makes sure that we don't convert "constant_zero" to "0" if we're taking its address 345 351 if ( VariableExpr *variableExpr = dynamic_cast< VariableExpr* >( addressExpr->get_arg() ) ) { 346 before<< mangleName( variableExpr->get_var() );352 output << mangleName( variableExpr->get_var() ); 347 353 } else { 348 354 addressExpr->get_arg()->accept( *this ); 349 355 } // if 350 before<< ")";351 } 352 353 void CodeGenerator 2::visit( CastExpr *castExpr ) {354 before<< "((";356 output << ")"; 357 } 358 359 void CodeGenerator::visit( CastExpr *castExpr ) { 360 output << "(("; 355 361 if ( castExpr->get_results().empty() ) { 356 before<< "void" ;357 } else { 358 before<< genType( castExpr->get_results().front(), "" );359 } // if 360 before<< ")";362 output << "void" ; 363 } else { 364 output << genType( castExpr->get_results().front(), "" ); 365 } // if 366 output << ")"; 361 367 castExpr->get_arg()->accept( *this ); 362 before<< ")";363 } 364 365 void CodeGenerator 2::visit( UntypedMemberExpr *memberExpr ) {368 output << ")"; 369 } 370 371 void CodeGenerator::visit( UntypedMemberExpr *memberExpr ) { 366 372 assert( false ); 367 373 } 368 374 369 void CodeGenerator 2::visit( MemberExpr *memberExpr ) {375 void CodeGenerator::visit( MemberExpr *memberExpr ) { 370 376 memberExpr->get_aggregate()->accept( *this ); 371 before<< "." << mangleName( memberExpr->get_member() );372 } 373 374 void CodeGenerator 2::visit( VariableExpr *variableExpr ) {377 output << "." << mangleName( memberExpr->get_member() ); 378 } 379 380 void CodeGenerator::visit( VariableExpr *variableExpr ) { 375 381 OperatorInfo opInfo; 376 382 if ( variableExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( variableExpr->get_var()->get_name(), opInfo ) && opInfo.type == OT_CONSTANT ) { 377 before<< opInfo.symbol;378 } else { 379 before<< mangleName( variableExpr->get_var() );380 } // if 381 } 382 383 void CodeGenerator 2::visit( ConstantExpr *constantExpr ) {383 output << opInfo.symbol; 384 } else { 385 output << mangleName( variableExpr->get_var() ); 386 } // if 387 } 388 389 void CodeGenerator::visit( ConstantExpr *constantExpr ) { 384 390 assert( constantExpr->get_constant() ); 385 391 constantExpr->get_constant()->accept( *this ); 386 392 } 387 393 388 void CodeGenerator 2::visit( SizeofExpr *sizeofExpr ) {389 before<< "sizeof(";394 void CodeGenerator::visit( SizeofExpr *sizeofExpr ) { 395 output << "sizeof("; 390 396 if ( sizeofExpr->get_isType() ) { 391 before<< genType( sizeofExpr->get_type(), "" );397 output << genType( sizeofExpr->get_type(), "" ); 392 398 } else { 393 399 sizeofExpr->get_expr()->accept( *this ); 394 400 } // if 395 before<< ")";396 } 397 398 void CodeGenerator 2::visit( LogicalExpr *logicalExpr ) {399 before<< "(";401 output << ")"; 402 } 403 404 void CodeGenerator::visit( LogicalExpr *logicalExpr ) { 405 output << "("; 400 406 logicalExpr->get_arg1()->accept( *this ); 401 407 if ( logicalExpr->get_isAnd() ) { 402 before<< " && ";403 } else { 404 before<< " || ";408 output << " && "; 409 } else { 410 output << " || "; 405 411 } // if 406 412 logicalExpr->get_arg2()->accept( *this ); 407 before<< ")";408 } 409 410 void CodeGenerator 2::visit( ConditionalExpr *conditionalExpr ) {411 before<< "(";413 output << ")"; 414 } 415 416 void CodeGenerator::visit( ConditionalExpr *conditionalExpr ) { 417 output << "("; 412 418 conditionalExpr->get_arg1()->accept( *this ); 413 before<< " ? ";419 output << " ? "; 414 420 conditionalExpr->get_arg2()->accept( *this ); 415 before<< " : ";421 output << " : "; 416 422 conditionalExpr->get_arg3()->accept( *this ); 417 before<< ")";418 } 419 420 void CodeGenerator 2::visit( CommaExpr *commaExpr ) {421 before<< "(";423 output << ")"; 424 } 425 426 void CodeGenerator::visit( CommaExpr *commaExpr ) { 427 output << "("; 422 428 commaExpr->get_arg1()->accept( *this ); 423 before<< " , ";429 output << " , "; 424 430 commaExpr->get_arg2()->accept( *this ); 425 before << ")"; 426 } 427 428 void CodeGenerator2::visit( TupleExpr *tupleExpr ) {} 429 430 void CodeGenerator2::visit( TypeExpr *typeExpr ) {} 431 432 431 output << ")"; 432 } 433 434 void CodeGenerator::visit( TupleExpr *tupleExpr ) {} 435 436 void CodeGenerator::visit( TypeExpr *typeExpr ) {} 437 433 438 //*** Statements 434 void CodeGenerator 2::visit( CompoundStmt *compoundStmt ) {439 void CodeGenerator::visit( CompoundStmt *compoundStmt ) { 435 440 std::list<Statement*> ks = compoundStmt->get_kids(); 436 437 before << endl << string( cur_indent, ' ' ) << "{" << endl; 438 439 cur_indent += CodeGenerator2::tabsize; 441 output << "{" << endl; 442 443 cur_indent += CodeGenerator::tabsize; 440 444 441 445 for ( std::list<Statement *>::iterator i = ks.begin(); i != ks.end(); i++) { 442 before << string( cur_indent, ' ' ) << printLabels( (*i)->get_labels() );446 output << string( cur_indent, ' ' ) << printLabels( (*i)->get_labels() ); 443 447 (*i)->accept(*this ); 444 shift_left(); 445 before << endl; 448 449 output << endl; 450 if ( wantSpacing( *i ) ) { 451 output << endl; 452 } 446 453 } 447 cur_indent -= CodeGenerator2::tabsize; 448 449 before << string( cur_indent, ' ' ) << "}" << endl; 450 } 451 452 void CodeGenerator2::visit( ExprStmt *exprStmt ) { 453 if ( exprStmt != 0 ) { 454 exprStmt->get_expr()->accept( *this ); 455 shift_left(); 456 before << ";" ; 457 } // if 458 } 459 460 void CodeGenerator2::visit( IfStmt *ifStmt ) { 461 before << "if ("; 454 cur_indent -= CodeGenerator::tabsize; 455 456 output << string( cur_indent, ' ' ) << "}"; 457 } 458 459 void CodeGenerator::visit( ExprStmt *exprStmt ) { 460 // I don't see why this check is necessary. 461 // If this starts to cause problems then put it back in, 462 // with an explanation 463 assert( exprStmt ); 464 465 // if ( exprStmt != 0 ) { 466 exprStmt->get_expr()->accept( *this ); 467 output << ";" ; 468 // } // if 469 } 470 471 void CodeGenerator::visit( IfStmt *ifStmt ) { 472 output << "if ("; 462 473 ifStmt->get_condition()->accept(*this ); 463 after += ")\n"; 464 shift_left(); 465 466 cur_indent += CodeGenerator2::tabsize; 467 before << string( cur_indent, ' ' ); 474 output << ") "; 475 468 476 ifStmt->get_thenPart()->accept(*this ); 469 cur_indent -= CodeGenerator2::tabsize;470 shift_left(); before << endl;471 477 472 478 if ( ifStmt->get_elsePart() != 0) { 473 before << string( cur_indent, ' ' ) << " else " << endl ; 474 475 cur_indent += CodeGenerator2::tabsize; 479 output << " else "; 476 480 ifStmt->get_elsePart()->accept(*this ); 477 cur_indent -= CodeGenerator2::tabsize; 478 } // if 479 } 480 481 void CodeGenerator2::visit( SwitchStmt *switchStmt ) { 482 //before << /* "\r" << */ string( cur_indent, ' ' ) << CodeGenerator2::printLabels( switchStmt->get_labels() ) 483 before << "switch (" ; 481 } // if 482 } 483 484 void CodeGenerator::visit( SwitchStmt *switchStmt ) { 485 //output << /* "\r" << */ string( cur_indent, ' ' ) << CodeGenerator::printLabels( switchStmt->get_labels() ) 486 output << "switch (" ; 484 487 switchStmt->get_condition()->accept(*this ); 485 after += ")\n"; 486 shift_left(); 487 488 before << string( cur_indent, ' ' ) << "{" << std::endl; 489 cur_indent += CodeGenerator2::tabsize; 490 491 std::list< Statement * > stmts = switchStmt->get_branches(); 492 bool lastBreak = false; 493 494 // horrible, horrible hack 495 if ( dynamic_cast<BranchStmt *>( stmts.back() ) != 0 ) { 496 lastBreak = true; 497 stmts.pop_back(); 498 } // if 499 acceptAll( stmts, *this ); 500 if ( lastBreak ) { 501 Statement *st = switchStmt->get_branches().back(); 502 before << CodeGenerator2::printLabels( st->get_labels()); 503 st->accept( *this ); 504 } // if 505 506 cur_indent -= CodeGenerator2::tabsize; 507 508 before << /* "\r" << */ string( cur_indent, ' ' ) << "}" << endl ; 509 } 510 511 void CodeGenerator2::visit( CaseStmt *caseStmt ) { 512 before << string( cur_indent, ' ' ); 488 output << ") "; 489 490 output << "{" << std::endl; 491 cur_indent += CodeGenerator::tabsize; 492 493 acceptAll( switchStmt->get_branches(), *this ); 494 495 cur_indent -= CodeGenerator::tabsize; 496 497 output << string( cur_indent, ' ' ) << "}"; 498 } 499 500 void CodeGenerator::visit( CaseStmt *caseStmt ) { 501 output << string( cur_indent, ' ' ); 513 502 if ( caseStmt->isDefault()) 514 before << "default ";503 output << "default"; 515 504 else { 516 before << "case ";505 output << "case "; 517 506 caseStmt->get_condition()->accept(*this ); 518 507 } // if 519 after += ":\n"; 520 shift_left(); 521 508 output << ":\n"; 509 522 510 std::list<Statement *> sts = caseStmt->get_statements(); 523 511 524 cur_indent += CodeGenerator 2::tabsize;512 cur_indent += CodeGenerator::tabsize; 525 513 for ( std::list<Statement *>::iterator i = sts.begin(); i != sts.end(); i++) { 526 before<< /* "\r" << */ string( cur_indent, ' ' ) << printLabels( (*i)->get_labels() ) ;514 output << /* "\r" << */ string( cur_indent, ' ' ) << printLabels( (*i)->get_labels() ) ; 527 515 (*i)->accept(*this ); 528 shift_left(); 529 before << ";" << endl; 516 output << endl; 530 517 } 531 cur_indent -= CodeGenerator2::tabsize; 532 } 533 534 void CodeGenerator2::visit( BranchStmt *branchStmt ) { 518 cur_indent -= CodeGenerator::tabsize; 519 } 520 521 void CodeGenerator::visit( BranchStmt *branchStmt ) { 522 output << "\r" << string( cur_indent, ' ' ); 523 output << CodeGenerator::printLabels( branchStmt->get_labels()); 524 535 525 switch ( branchStmt->get_type()) { 536 526 case BranchStmt::Goto: 537 527 if ( ! branchStmt->get_target().empty() ) 538 before<< "goto " << branchStmt->get_target();528 output << "goto " << branchStmt->get_target(); 539 529 else { 540 530 if ( branchStmt->get_computedTarget() != 0 ) { 541 before<< "goto *";531 output << "goto *"; 542 532 branchStmt->get_computedTarget()->accept( *this ); 543 533 } // if … … 545 535 break; 546 536 case BranchStmt::Break: 547 before<< "break";537 output << "break"; 548 538 break; 549 539 case BranchStmt::Continue: 550 before<< "continue";540 output << "continue"; 551 541 break; 552 542 } 553 before<< ";";554 } 555 556 557 void CodeGenerator 2::visit( ReturnStmt *returnStmt ) {558 before<< "return ";543 output << ";"; 544 } 545 546 547 void CodeGenerator::visit( ReturnStmt *returnStmt ) { 548 output << "return "; 559 549 560 550 // xxx -- check for null expression; … … 562 552 returnStmt->get_expr()->accept( *this ); 563 553 } // if 564 after +=";";565 } 566 567 void CodeGenerator 2::visit( WhileStmt *whileStmt ) {554 output << ";"; 555 } 556 557 void CodeGenerator::visit( WhileStmt *whileStmt ) { 568 558 if ( whileStmt->get_isDoWhile() ) 569 before<< "do" ;559 output << "do" ; 570 560 else { 571 before<< "while (" ;561 output << "while (" ; 572 562 whileStmt->get_condition()->accept(*this ); 573 after +=")";574 } // if 575 after += "{\n";576 shift_left(); 577 563 output << ")"; 564 } // if 565 output << " "; 566 567 output << CodeGenerator::printLabels( whileStmt->get_body()->get_labels() ); 578 568 whileStmt->get_body()->accept( *this ); 579 569 580 before << /* "\r" << */ string( cur_indent, ' ' ) << "}";570 output << /* "\r" << */ string( cur_indent, ' ' ); 581 571 582 572 if ( whileStmt->get_isDoWhile() ) { 583 before<< " while (" ;573 output << " while (" ; 584 574 whileStmt->get_condition()->accept(*this ); 585 after += ");"; 586 } // if 587 588 after += "\n"; 589 } 590 591 void CodeGenerator2::visit( ForStmt *forStmt ) { 592 before << "for ("; 575 output << ");"; 576 } // if 577 } 578 579 void CodeGenerator::visit( ForStmt *forStmt ) { 580 output << "for ("; 593 581 594 582 if ( forStmt->get_initialization() != 0 ) 595 583 forStmt->get_initialization()->accept( *this ); 596 584 else 597 before << ";"; 598 shift_left(); 599 585 output << ";"; 586 600 587 if ( forStmt->get_condition() != 0 ) 601 588 forStmt->get_condition()->accept( *this ); 602 shift_left(); before<< ";";589 output << ";"; 603 590 604 591 if ( forStmt->get_increment() != 0 ) 605 592 forStmt->get_increment()->accept( *this ); 606 shift_left(); before << ")" << endl;593 output << ") "; 607 594 608 595 if ( forStmt->get_body() != 0 ) { 609 cur_indent += CodeGenerator2::tabsize; 610 before << string( cur_indent, ' ' ) << CodeGenerator2::printLabels( forStmt->get_body()->get_labels() ); 596 output << CodeGenerator::printLabels( forStmt->get_body()->get_labels() ); 611 597 forStmt->get_body()->accept( *this ); 612 cur_indent -= CodeGenerator2::tabsize; 613 } // if 614 } 615 616 void CodeGenerator2::visit( NullStmt *nullStmt ) { 617 //before << /* "\r" << */ string( cur_indent, ' ' ) << CodeGenerator2::printLabels( nullStmt->get_labels() ); 618 before << "/* null statement */ ;"; 619 } 620 621 void CodeGenerator2::visit( DeclStmt *declStmt ) { 598 } // if 599 } 600 601 void CodeGenerator::visit( NullStmt *nullStmt ) { 602 //output << /* "\r" << */ string( cur_indent, ' ' ) << CodeGenerator::printLabels( nullStmt->get_labels() ); 603 output << "/* null statement */ ;"; 604 } 605 606 void CodeGenerator::visit( DeclStmt *declStmt ) { 622 607 declStmt->get_decl()->accept( *this ); 623 608 624 609 if ( doSemicolon( declStmt->get_decl() ) ) { 625 after += ";"; 626 } // if 627 shift_left(); 628 } 629 630 std::string CodeGenerator2::printLabels( std::list< Label > &l ) { 610 output << ";"; 611 } // if 612 } 613 614 std::string CodeGenerator::printLabels( std::list< Label > &l ) { 631 615 std::string str( "" ); 632 l.unique(); 616 l.unique(); // assumes a sorted list. Why not use set? 633 617 634 618 for ( std::list< Label >::iterator i = l.begin(); i != l.end(); i++ ) … … 638 622 } 639 623 640 void CodeGenerator2::shift_left() { 641 before << after; 642 after = ""; 643 } 644 645 void CodeGenerator2::handleStorageClass( Declaration *decl ) { 624 void CodeGenerator::handleStorageClass( Declaration *decl ) { 646 625 switch ( decl->get_storageClass() ) { 647 626 case Declaration::NoStorageClass: 648 627 break; 649 628 case Declaration::Extern: 650 before<< "extern ";629 output << "extern "; 651 630 break; 652 631 case Declaration::Static: 653 before<< "static ";632 output << "static "; 654 633 break; 655 634 case Declaration::Auto: … … 657 636 break; 658 637 case Declaration::Register: 659 before<< "register ";638 output << "register "; 660 639 break; 661 640 case Declaration::Inline: -
src/CodeGen/CodeGenerator.h
ra61fea9a r9a8930f 5 5 // file "LICENCE" distributed with Cforall. 6 6 // 7 // CodeGenerator 2.h --7 // CodeGenerator.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 23:35:37201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue Jun 02 13:43:29 2015 13 // Update Count : 14 14 14 // 15 15 … … 25 25 26 26 namespace CodeGen { 27 class CodeGenerator 2: public Visitor {27 class CodeGenerator : public Visitor { 28 28 public: 29 29 static int tabsize; 30 30 31 CodeGenerator2( std::ostream &os ); 32 CodeGenerator2( std::ostream &os, std::string, int indent = 0, bool infun = false ); 33 CodeGenerator2( std::ostream &os, char *, int indent = 0, bool infun = false ); 34 35 CodeGenerator2( CodeGenerator2 & ); 31 CodeGenerator( std::ostream &os ); 32 CodeGenerator( std::ostream &os, std::string, int indent = 0, bool infun = false ); 33 CodeGenerator( std::ostream &os, char *, int indent = 0, bool infun = false ); 36 34 37 35 //*** Declaration … … 82 80 virtual void visit( DeclStmt * ); 83 81 84 std::string get_string( void );85 void add_string_left( std::string s ) { before << s; }86 void shift_left();87 82 template< class Iterator > void genCommaList( Iterator begin, Iterator end ); 88 83 private: 89 84 int cur_indent; 90 85 bool insideFunction; 91 std::ostream &before; 92 std::string after; 86 std::ostream &output; 93 87 94 88 static std::string printLabels ( std::list < Label > & ); … … 100 94 101 95 template< class Iterator > 102 void CodeGenerator 2::genCommaList( Iterator begin, Iterator end ) {96 void CodeGenerator::genCommaList( Iterator begin, Iterator end ) { 103 97 if ( begin == end ) return; 104 98 … … 106 100 (*begin++)->accept( *this ); 107 101 if ( begin == end ) return; 108 before<< ", ";102 output << ", "; 109 103 } // for 110 104 } -
src/CodeGen/GenType.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : T ue Jun 2 11:21:32201513 // Update Count : 312 // Last Modified On : Thu Jun 4 14:04:58 2015 13 // Update Count : 4 14 14 // 15 15 … … 97 97 } // if 98 98 if ( dimension != 0 ) { 99 CodeGenerator 2cg( os );99 CodeGenerator cg( os ); 100 100 dimension->accept( cg ); 101 101 } // if … … 148 148 } // if 149 149 } else { 150 CodeGenerator 2cg( os );150 CodeGenerator cg( os ); 151 151 os << "(" ; 152 152 -
src/CodeGen/Generate.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : T ue Jun 2 11:21:06201513 // Update Count : 212 // Last Modified On : Thu Jun 4 14:04:25 2015 13 // Update Count : 5 14 14 // 15 15 … … 27 27 namespace CodeGen { 28 28 void generate( std::list< Declaration* > translationUnit, std::ostream &os, bool doIntrinsics ) { 29 CodeGen::CodeGenerator 2cgv( os );29 CodeGen::CodeGenerator cgv( os ); 30 30 31 31 for ( std::list<Declaration *>::iterator i = translationUnit.begin(); i != translationUnit.end(); i++ ) { 32 32 if ( LinkageSpec::isGeneratable( (*i)->get_linkage() ) && (doIntrinsics || ! LinkageSpec::isBuiltin( (*i)->get_linkage() ) ) ) { 33 33 (*i)->accept(cgv); 34 cgv.shift_left();35 34 if ( doSemicolon( *i ) ) { 36 35 os << ";"; -
src/Common/utility.h
ra61fea9a r9a8930f 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 May 19 15:34:57201513 // Update Count : 311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Fri May 29 16:17:02 2015 13 // Update Count : 7 14 14 // 15 15 … … 198 198 } 199 199 200 // it's nice to actually be able to increment iterators by an arbitrary amount 201 template< typename Iterator > 202 Iterator operator+(Iterator i, int inc) { 203 while ( inc > 0 ) { 204 ++i; 205 --inc; 206 } 207 return i; 208 } 209 200 210 #endif // _UTILITY_H 201 211 -
src/ControlStruct/ChooseMutator.cc
ra61fea9a r9a8930f 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 : Tue May 19 15:31:39201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jun 03 15:30:20 2015 13 // Update Count : 5 14 14 // 15 15 … … 44 44 std::list< Statement * > &stmts = caseStmt->get_statements(); 45 45 46 // the difference between switch and choose is that switch has an implicit fallthrough 47 // to the next case, whereas choose has an implicit break at the end of the current case. 48 // thus to transform a choose statement into a switch, we only need to insert breaks at the 49 // end of any case that doesn't already end in a break and that doesn't end in a fallthru 50 46 51 if ( insideChoose ) { 47 52 BranchStmt *posBrk; -
src/ControlStruct/LabelFixer.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed May 27 16:16:14201513 // Update Count : 412 // Last Modified On : Tue Jun 02 15:30:32 2015 13 // Update Count : 93 14 14 // 15 15 … … 23 23 #include "utility.h" 24 24 25 #include <iostream> 26 25 27 namespace ControlStruct { 26 LabelFixer::Entry::Entry( Statement *to, Statement *from ) : definition ( to ) {28 LabelFixer::Entry::Entry( Statement *to, BranchStmt *from ) : definition ( to ) { 27 29 if ( from != 0 ) 28 30 usage.push_back( from ); … … 31 33 bool LabelFixer::Entry::insideLoop() { 32 34 return ( dynamic_cast< ForStmt * > ( definition ) || 33 35 dynamic_cast< WhileStmt * > ( definition ) ); 34 36 } 35 37 … … 46 48 } 47 49 50 // prune to at most one label definition for each statement 48 51 void LabelFixer::visit( Statement *stmt ) { 49 52 std::list< Label > &labels = stmt->get_labels(); 50 53 51 54 if ( ! labels.empty() ) { 55 // only remember one label for each statement 52 56 Label current = setLabelsDef( labels, stmt ); 53 57 labels.clear(); … … 57 61 58 62 void LabelFixer::visit( BranchStmt *branchStmt ) { 59 visit ( ( Statement * )branchStmt ); // the labels this statement might have63 visit ( ( Statement * )branchStmt ); 60 64 61 Label target; 62 if ( (target = branchStmt->get_target()) != "" ) { 65 // for labeled branches, add an entry to the label table 66 Label target = branchStmt->get_target(); 67 if ( target != "" ) { 63 68 setLabelsUsg( target, branchStmt ); 64 } //else /* computed goto or normal exit-loop statements */69 } 65 70 } 66 71 72 // sets the definition of the labelTable entry to be the provided 73 // statement for every label in the list parameter. Happens for every kind of statement 67 74 Label LabelFixer::setLabelsDef( std::list< Label > &llabel, Statement *definition ) { 68 75 assert( definition != 0 ); 69 Entry *entry = new Entry( definition ); 70 bool used = false; 76 assert( llabel.size() > 0 ); 71 77 72 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) 73 if ( labelTable.find( *i ) == labelTable.end() ) 74 { used = true; labelTable[ *i ] = entry; } // undefined and unused 75 else 76 if ( labelTable[ *i ]->defined() ) 77 throw SemanticError( "Duplicate definition of label: " + *i ); 78 else 79 labelTable[ *i ]->set_definition( definition ); 78 Entry * e = new Entry( definition ); 80 79 81 if ( ! used ) delete entry; 80 for ( std::list< Label >::iterator i = llabel.begin(); i != llabel.end(); i++ ) { 81 if ( labelTable.find( *i ) == labelTable.end() ) { 82 // all labels on this statement need to use the same entry, so this should only be created once 83 // undefined and unused until now, add an entry 84 labelTable[ *i ] = e; 85 } else if ( labelTable[ *i ]->defined() ) { 86 // defined twice, error 87 throw SemanticError( "Duplicate definition of label: " + *i ); 88 } else { 89 // used previously, but undefined until now -> link with this entry 90 Entry * oldEntry = labelTable[ *i ]; 91 e->add_uses( oldEntry->get_uses() ); 92 labelTable[ *i ] = e; 93 } // if 94 } // for 82 95 83 return labelTable[ llabel.front() ]->get_label(); // this *must* exist 96 // produce one of the labels attached to this statement to be 97 // temporarily used as the canonical label 98 return labelTable[ llabel.front() ]->get_label(); 84 99 } 85 100 86 Label LabelFixer::setLabelsUsg( Label orgValue, Statement *use ) { 101 // Remember all uses of a label. 102 void LabelFixer::setLabelsUsg( Label orgValue, BranchStmt *use ) { 87 103 assert( use != 0 ); 88 104 89 if ( labelTable.find( orgValue ) != labelTable.end() ) 90 labelTable[ orgValue ]->add_use( use ); // the label has been defined or used before 91 else 105 if ( labelTable.find( orgValue ) != labelTable.end() ) { 106 // the label has been defined or used before 107 labelTable[ orgValue ]->add_use( use ); 108 } else { 92 109 labelTable[ orgValue ] = new Entry( 0, use ); 93 94 return labelTable[ orgValue ]->get_label(); 110 } 95 111 } 96 112 113 // Ultimately builds a table that maps a label to its defining statement. 114 // In the process, 97 115 std::map<Label, Statement * > *LabelFixer::resolveJumps() throw ( SemanticError ) { 98 116 std::map< Statement *, Entry * > def_us; 99 117 100 for ( std::map< Label, Entry *>::iterator i = labelTable.begin(); i != labelTable.end(); i++ ) { 118 // combine the entries for all labels that target the same location 119 for ( std::map< Label, Entry *>::iterator i = labelTable.begin(); i != labelTable.end(); ++i ) { 101 120 Entry *e = i->second; 102 121 103 122 if ( def_us.find ( e->get_definition() ) == def_us.end() ) { 104 123 def_us[ e->get_definition() ] = e; 105 } else { 106 if ( e->used() ) 107 def_us[ e->get_definition() ]->add_uses( e->get_uses() ); 124 } else if ( e->used() ) { 125 def_us[ e->get_definition() ]->add_uses( e->get_uses() ); 108 126 } 109 127 } 110 128 111 // get rid of labelTable112 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); i++) {129 // create a unique label for each target location. 130 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); ++i ) { 113 131 Statement *to = (*i).first; 114 std::list< Statement *> &from = (*i).second->get_uses(); 115 Label finalLabel = generator->newLabel(); 116 (*i).second->set_label( finalLabel ); 132 Entry * entry = (*i).second; 133 std::list< BranchStmt *> &from = entry->get_uses(); 117 134 135 // no label definition found 118 136 if ( to == 0 ) { 119 BranchStmt *first_use = dynamic_cast<BranchStmt *>(from.back()); 120 Label undef(""); 121 if ( first_use != 0 ) 122 undef = first_use->get_target(); 137 Label undef = from.back()->get_target(); 123 138 throw SemanticError ( "'" + undef + "' label not defined"); 124 139 } 140 141 // generate a new label, and attach it to its defining statement 142 // as the only label on that statement 143 Label finalLabel = generator->newLabel(); 144 entry->set_label( finalLabel ); 125 145 126 146 to->get_labels().clear(); 127 147 to->get_labels().push_back( finalLabel ); 128 148 129 for ( std::list< Statement *>::iterator j = from.begin(); j != from.end(); j++ ) { 130 BranchStmt *jumpTo = dynamic_cast< BranchStmt * > ( *j ); 131 assert( jumpTo != 0 ); 132 jumpTo->set_target( finalLabel ); 149 // redirect each of the source branch statements to the new target label 150 for ( std::list< BranchStmt *>::iterator j = from.begin(); j != from.end(); ++j ) { 151 BranchStmt *jump = *j; 152 assert( jump != 0 ); 153 jump->set_target( finalLabel ); 133 154 } // for 134 155 } // for 135 156 136 // reverse table157 // create a table where each label maps to its defining statement 137 158 std::map< Label, Statement * > *ret = new std::map< Label, Statement * >(); 138 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); i++ )159 for ( std::map< Statement *, Entry * >::iterator i = def_us.begin(); i != def_us.end(); ++i ) { 139 160 (*ret)[ (*i).second->get_label() ] = (*i).first; 161 } 140 162 141 163 return ret; -
src/ControlStruct/LabelFixer.h
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue May 26 12:55:10201513 // Update Count : 412 // Last Modified On : Fri May 29 15:25:55 2015 13 // Update Count : 11 14 14 // 15 15 … … 55 55 56 56 Label setLabelsDef( std::list< Label > &, Statement *definition ); 57 Label setLabelsUsg( Label, Statement *usage = 0 );57 void setLabelsUsg( Label, BranchStmt *usage = 0 ); 58 58 59 59 private: 60 60 class Entry { 61 61 public: 62 Entry( Statement *to = 0, Statement *from = 0 );62 Entry( Statement *to = 0, BranchStmt *from = 0 ); 63 63 bool used() { return ( usage.empty() ); } 64 64 bool defined() { return ( definition != 0 ); } … … 71 71 void set_definition( Statement *def ) { definition = def; } 72 72 73 std::list< Statement *> &get_uses() { return usage; }74 void add_use ( Statement *use ) { usage.push_back( use ); }75 void add_uses ( std::list< Statement *> uses ) { usage.insert( usage.end(), uses.begin(), uses.end() ); }73 std::list< BranchStmt *> &get_uses() { return usage; } 74 void add_use ( BranchStmt *use ) { usage.push_back( use ); } 75 void add_uses ( std::list<BranchStmt *> uses ) { usage.insert( usage.end(), uses.begin(), uses.end() ); } 76 76 private: 77 77 Label label; 78 78 Statement *definition; 79 std::list< Statement *> usage;79 std::list<BranchStmt *> usage; 80 80 }; 81 81 -
src/ControlStruct/LabelGenerator.cc
ra61fea9a r9a8930f 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 : Tue May 19 15:32:04201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jun 03 14:23:26 2015 13 // Update Count : 9 14 14 // 15 15 … … 29 29 } 30 30 31 Label LabelGenerator::newLabel( ) {31 Label LabelGenerator::newLabel(std::string suffix) { 32 32 std::ostrstream os; 33 os << "__L" << current++ << "__" ;// << std::ends;33 os << "__L" << current++ << "__" << suffix; 34 34 os.freeze( false ); 35 35 std::string ret = std::string (os.str(), os.pcount()); -
src/ControlStruct/LabelGenerator.h
ra61fea9a r9a8930f 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 : Tue May 19 15:33:20201513 // Update Count : 311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jun 03 14:16:26 2015 13 // Update Count : 5 14 14 // 15 15 … … 18 18 19 19 #include "SynTree/SynTree.h" 20 #include <string> 20 21 21 22 namespace ControlStruct { … … 23 24 public: 24 25 static LabelGenerator *getGenerator(); 25 Label newLabel( );26 Label newLabel(std::string suffix = ""); 26 27 void reset() { current = 0; } 27 28 void rewind() { current--; } -
src/ControlStruct/MLEMutator.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed May 27 16:19:32201513 // Update Count : 4412 // Last Modified On : Wed Jun 03 15:09:27 2015 13 // Update Count : 170 14 14 // 15 15 … … 19 19 #include "MLEMutator.h" 20 20 #include "SynTree/Statement.h" 21 #include "SynTree/Expression.h" 21 22 22 23 namespace ControlStruct { … … 26 27 } 27 28 28 CompoundStmt* MLEMutator::mutate( CompoundStmt *cmpndStmt ) { 29 bool labeledBlock = false; 30 if ( !(cmpndStmt->get_labels().empty()) ) { 31 labeledBlock = true; 32 enclosingBlocks.push_back( Entry( cmpndStmt ) ); 33 } // if 34 35 std::list< Statement * > &kids = cmpndStmt->get_kids(); 29 // break labels have to come after the statement they break out of, 30 // so mutate a statement, then if they inform us through the breakLabel field 31 // tha they need a place to jump to on a break statement, add the break label 32 // to the body of statements 33 void MLEMutator::fixBlock( std::list< Statement * > &kids ) { 36 34 for ( std::list< Statement * >::iterator k = kids.begin(); k != kids.end(); k++ ) { 37 35 *k = (*k)->acceptMutator(*this); 38 36 39 37 if ( ! get_breakLabel().empty() ) { 40 std::list< Statement * >::iterator next = k ; next++;38 std::list< Statement * >::iterator next = k+1; 41 39 if ( next == kids.end() ) { 42 40 std::list<Label> ls; ls.push_back( get_breakLabel() ); … … 49 47 } // if 50 48 } // for 49 } 50 51 CompoundStmt* MLEMutator::mutate( CompoundStmt *cmpndStmt ) { 52 bool labeledBlock = !(cmpndStmt->get_labels().empty()); 53 if ( labeledBlock ) { 54 Label brkLabel = generator->newLabel(); 55 enclosingBlocks.push_back( Entry( cmpndStmt, brkLabel ) ); 56 } // if 57 58 // a child statement may set the break label 59 // - if they do, attach it to the next statement 60 std::list< Statement * > &kids = cmpndStmt->get_kids(); 61 fixBlock( kids ); 51 62 52 63 if ( labeledBlock ) { 53 64 assert( ! enclosingBlocks.empty() ); 54 if ( ! enclosingBlocks.back(). get_breakExit().empty() ) {55 set_breakLabel( enclosingBlocks.back(). get_breakExit() );65 if ( ! enclosingBlocks.back().useBreakExit().empty() ) { 66 set_breakLabel( enclosingBlocks.back().useBreakExit() ); 56 67 } 57 68 enclosingBlocks.pop_back(); 58 69 } // if 59 70 60 //mutateAll( cmpndStmt->get_kids(), *this );61 71 return cmpndStmt; 62 72 } 63 73 64 Statement *MLEMutator::mutate( WhileStmt *whileStmt ) { 65 enclosingLoops.push_back( Entry( whileStmt ) ); 66 whileStmt->set_body ( whileStmt->get_body()->acceptMutator( *this ) ); 67 74 template< typename LoopClass > 75 Statement *MLEMutator::handleLoopStmt( LoopClass *loopStmt ) { 76 // remember this as the most recent enclosing loop, then mutate 77 // the body of the loop -- this will do SOMETHING with branch statements 78 // and will recursively do the same to nested loops 79 Label brkLabel = generator->newLabel("loopBreak"); 80 Label contLabel = generator->newLabel("loopContinue"); 81 enclosingLoops.push_back( Entry( loopStmt, brkLabel, contLabel ) ); 82 loopStmt->set_body ( loopStmt->get_body()->acceptMutator( *this ) ); 83 84 // sanity check that the enclosing loops have been popped correctly 68 85 Entry &e = enclosingLoops.back(); 69 assert ( e == whileStmt ); 70 whileStmt->set_body( mutateLoop( whileStmt->get_body(), e ) ); 86 assert ( e == loopStmt ); 87 88 // generate labels as needed 89 loopStmt->set_body( mutateLoop( loopStmt->get_body(), e ) ); 71 90 enclosingLoops.pop_back(); 72 91 73 return whileStmt; 74 } 75 76 Statement *MLEMutator::mutate( ForStmt *forStmt ) { 77 enclosingLoops.push_back( Entry( forStmt ) ); 78 maybeMutate( forStmt->get_body(), *this ); 79 80 Entry &e = enclosingLoops.back(); 81 assert ( e == forStmt ); 82 forStmt->set_body( mutateLoop( forStmt->get_body(), e ) ); 83 enclosingLoops.pop_back(); 84 85 return forStmt; 92 return loopStmt; 93 } 94 95 Statement *MLEMutator::mutate( CaseStmt *caseStmt ) { 96 caseStmt->set_condition( maybeMutate( caseStmt->get_condition(), *this ) ); 97 fixBlock( caseStmt->get_statements() ); 98 99 return caseStmt; 100 } 101 102 template< typename SwitchClass > 103 Statement *MLEMutator::handleSwitchStmt( SwitchClass *switchStmt ) { 104 // generate a label for breaking out of a labeled switch 105 Label brkLabel = generator->newLabel("switchBreak"); 106 enclosingSwitches.push_back( Entry(switchStmt, brkLabel) ); 107 mutateAll( switchStmt->get_branches(), *this ); 108 109 Entry &e = enclosingSwitches.back(); 110 assert ( e == switchStmt ); 111 112 // only generate break label if labeled break is used 113 if (e.isBreakUsed()) { 114 // for the purposes of keeping switch statements uniform (i.e. all statements that are 115 // direct children of a switch should be CastStmts), append the exit label + break to the 116 // last case statement; create a default case if there are no cases 117 std::list< Statement * > &branches = switchStmt->get_branches(); 118 if ( branches.empty() ) { 119 branches.push_back( CaseStmt::makeDefault() ); 120 } 121 122 if ( CaseStmt * c = dynamic_cast< CaseStmt * >( branches.back() ) ) { 123 std::list<Label> temp; temp.push_back( brkLabel ); 124 c->get_statements().push_back( new BranchStmt( temp, Label(""), BranchStmt::Break ) ); 125 } else assert(0); // as of this point, all branches of a switch are still CaseStmts 126 } 127 128 assert ( enclosingSwitches.back() == switchStmt ); 129 enclosingSwitches.pop_back(); 130 return switchStmt; 86 131 } 87 132 … … 117 162 throw SemanticError("The target specified in the exit loop statement does not correspond to an enclosing control structure: " + originalTarget ); 118 163 164 // what about exiting innermost block or switch??? 119 165 if ( enclosingLoops.back() == (*check) ) 120 166 return branchStmt; // exit the innermost loop (labels unnecessary) 121 167 122 Label newLabel; 168 // branch error checks, get the appropriate label name and create a goto 169 Label exitLabel; 123 170 switch ( branchStmt->get_type() ) { 124 171 case BranchStmt::Break: 125 if ( check->get_breakExit() != "" ) { 126 newLabel = check->get_breakExit(); 127 } else { 128 newLabel = generator->newLabel(); 129 check->set_breakExit( newLabel ); 130 } // if 172 assert( check->useBreakExit() != ""); 173 exitLabel = check->useBreakExit(); 131 174 break; 132 175 case BranchStmt::Continue: 133 if ( check->get_contExit() != "" ) { 134 newLabel = check->get_contExit(); 135 } else { 136 newLabel = generator->newLabel(); 137 check->set_contExit( newLabel ); 138 } // if 176 assert( check->useContExit() != ""); 177 exitLabel = check->useContExit(); 139 178 break; 140 179 default: 141 return 0; // shouldn't be here180 assert(0); // shouldn't be here 142 181 } // switch 143 182 144 return new BranchStmt( std::list<Label>(), newLabel, BranchStmt::Goto ); 145 } 146 147 template< typename SwitchClass > 148 Statement *handleSwitchStmt( SwitchClass *switchStmt, MLEMutator &mutator ) { 149 // set up some aliases so that the rest of the code isn't messy 150 typedef MLEMutator::Entry Entry; 151 LabelGenerator *generator = mutator.generator; 152 std::list< Entry > &enclosingSwitches = mutator.enclosingSwitches; 153 154 Label brkLabel = generator->newLabel(); 155 enclosingSwitches.push_back( Entry(switchStmt, "", brkLabel) ); 156 mutateAll( switchStmt->get_branches(), mutator ); { 157 // check if this is necessary (if there is a break to this point, otherwise do not generate 158 std::list<Label> temp; temp.push_back( brkLabel ); 159 switchStmt->get_branches().push_back( new BranchStmt( temp, Label(""), BranchStmt::Break ) ); 160 } 161 assert ( enclosingSwitches.back() == switchStmt ); 162 enclosingSwitches.pop_back(); 163 return switchStmt; 164 } 165 166 Statement *MLEMutator::mutate( SwitchStmt *switchStmt ) { 167 return handleSwitchStmt( switchStmt, *this ); 168 } 169 170 Statement *MLEMutator::mutate( ChooseStmt *switchStmt ) { 171 return handleSwitchStmt( switchStmt, *this ); 183 return new BranchStmt( std::list<Label>(), exitLabel, BranchStmt::Goto ); 172 184 } 173 185 174 186 Statement *MLEMutator::mutateLoop( Statement *bodyLoop, Entry &e ) { 187 // ensure loop body is a block 175 188 CompoundStmt *newBody; 176 189 if ( ! (newBody = dynamic_cast<CompoundStmt *>( bodyLoop )) ) { … … 179 192 } // if 180 193 181 Label endLabel = e.get_contExit(); 182 183 if ( e.get_breakExit() != "" ) { 184 if ( endLabel == "" ) endLabel = generator->newLabel(); 185 // check for whether this label is used or not, so as to not generate extraneous gotos 186 if (e.breakExitUsed) 187 newBody->get_kids().push_back( new BranchStmt( std::list< Label >(), endLabel, BranchStmt::Goto ) ); 188 // xxx 189 //std::list< Label > ls; ls.push_back( e.get_breakExit() ); 190 set_breakLabel( e.get_breakExit() ); 191 //newBody->get_kids().push_back( new BranchStmt( ls, "", BranchStmt::Break ) ); 192 } // if 193 194 if ( e.get_breakExit() != "" || e.get_contExit() != "" ) { 195 if (dynamic_cast< NullStmt *>( newBody->get_kids().back() )) 196 newBody->get_kids().back()->get_labels().push_back( endLabel ); 197 else { 198 std::list < Label > ls; ls.push_back( endLabel ); 199 newBody->get_kids().push_back( new NullStmt( ls ) ); 200 } // if 201 } // if 194 // only generate these when needed 195 196 if ( e.isContUsed() ) { 197 // continue label goes in the body as the last statement 198 std::list< Label > labels; labels.push_back( e.useContExit() ); 199 newBody->get_kids().push_back( new NullStmt( labels ) ); 200 } 201 202 if ( e.isBreakUsed() ) { 203 // break label goes after the loop -- it'll get set by the 204 // outer mutator if we do this 205 set_breakLabel( e.useBreakExit() ); 206 } 202 207 203 208 return newBody; 204 209 } 205 210 206 //*** Entry's methods 207 void MLEMutator::Entry::set_contExit( Label l ) { 208 assert ( contExit == "" || contExit == l ); 209 contExit = l; 210 } 211 212 void MLEMutator::Entry::set_breakExit( Label l ) { 213 assert ( breakExit == "" || breakExit == l ); 214 breakExit = l; 215 } 211 Statement *MLEMutator::mutate( WhileStmt *whileStmt ) { 212 return handleLoopStmt( whileStmt ); 213 } 214 215 Statement *MLEMutator::mutate( ForStmt *forStmt ) { 216 return handleLoopStmt( forStmt ); 217 } 218 219 Statement *MLEMutator::mutate( SwitchStmt *switchStmt ) { 220 return handleSwitchStmt( switchStmt ); 221 } 222 223 Statement *MLEMutator::mutate( ChooseStmt *switchStmt ) { 224 return handleSwitchStmt( switchStmt ); 225 } 226 216 227 } // namespace ControlStruct 217 228 -
src/ControlStruct/MLEMutator.h
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Tue May 26 15:04:21201513 // Update Count : 712 // Last Modified On : Wed Jun 03 15:06:36 2015 13 // Update Count : 25 14 14 // 15 15 … … 38 38 Statement *mutate( BranchStmt *branchStmt ) throw ( SemanticError ); 39 39 40 Statement *mutate( CaseStmt *caseStmt ); 40 41 Statement *mutate( SwitchStmt *switchStmt ); 41 42 Statement *mutate( ChooseStmt *switchStmt ); … … 48 49 class Entry { 49 50 public: 50 explicit Entry( Statement *_loop = 0, Label _contExit = Label(""), Label _breakExit = Label("") ) :51 loop( _loop ), contExit( _contExit ), breakExit( _breakExit ), contExitUsed( false ), breakExitUsed( false) {}51 explicit Entry( Statement *_loop, Label _breakExit, Label _contExit = Label("") ) : 52 loop( _loop ), breakExit( _breakExit ), contExit( _contExit ), breakUsed(false), contUsed(false) {} 52 53 53 54 bool operator==( const Statement *stmt ) { return ( loop == stmt ); } … … 58 59 Statement *get_loop() const { return loop; } 59 60 60 Label get_contExit() const {return contExit; }61 void set_contExit( Label );61 Label useContExit() { contUsed = true; return contExit; } 62 Label useBreakExit() { breakUsed = true; return breakExit; } 62 63 63 Label get_breakExit() const { return breakExit; }64 void set_breakExit( Label );64 bool isContUsed() const { return contUsed; } 65 bool isBreakUsed() const { return breakUsed; } 65 66 66 67 private: 67 68 Statement *loop; 68 Label contExit, breakExit; 69 public: // hack, provide proper [sg]etters 70 bool contExitUsed, breakExitUsed; 69 Label breakExit, contExit; 70 bool breakUsed, contUsed; 71 71 }; 72 72 … … 76 76 LabelGenerator *generator; 77 77 78 template< typename LoopClass > 79 Statement *handleLoopStmt( LoopClass *loopStmt ); 80 78 81 template< typename SwitchClass > 79 friend Statement *handleSwitchStmt( SwitchClass *switchStmt, MLEMutator &mutator ); 82 Statement *handleSwitchStmt( SwitchClass *switchStmt ); 83 84 void fixBlock( std::list< Statement * > &kids ); 80 85 }; 81 86 } // namespace ControlStruct -
src/ControlStruct/Mutate.cc
ra61fea9a r9a8930f 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 : Tue May 19 15:32:52201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed Jun 03 23:08:43 2015 13 // Update Count : 5 14 14 // 15 15 … … 37 37 void mutate( std::list< Declaration * > translationUnit ) { 38 38 // ForExprMutator formut; 39 40 // normalizes label definitions and generates multi-level 41 // exit labels 39 42 LabelFixer lfix; 43 44 // transform choose statements into switch statements 40 45 ChooseMutator chmut; 46 47 // expand case ranges and turn fallthru into a null statement 41 48 CaseRangeMutator ranges; // has to run after ChooseMutator 49 42 50 //ExceptMutator exc; 43 51 // LabelTypeChecker lbl; -
src/SynTree/Mutator.h
ra61fea9a r9a8930f 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 10:12:28 201513 // Update Count : 311 // Last Modified By : Rob Schluntz 12 // Last Modified On : Fri May 29 16:34:08 2015 13 // Update Count : 4 14 14 // 15 15 #include <cassert> … … 104 104 assert( newnode ); 105 105 return newnode; 106 /// return tree->acceptMutator( mutator );107 106 } else { 108 107 return 0; -
src/SynTree/ObjectDecl.cc
ra61fea9a r9a8930f 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 10:14:18201513 // Update Count : 211 // Last Modified By : Rob Schluntz 12 // Last Modified On : Thu May 28 14:10:02 2015 13 // Update Count : 8 14 14 // 15 15 … … 65 65 66 66 void ObjectDecl::printShort( std::ostream &os, int indent ) const { 67 #if 0 68 if ( get_mangleName() != "") { 69 os << get_mangleName() << ": a "; 70 } else 71 #endif 67 72 if ( get_name() != "" ) { 68 73 os << get_name() << ": a "; -
src/SynTree/Statement.cc
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Rob Schluntz 12 // Last Modified On : Wed May 27 15:41:13201513 // Update Count : 812 // Last Modified On : Tue Jun 02 13:07:09 2015 13 // Update Count : 14 14 14 // 15 15 … … 124 124 CaseStmt::~CaseStmt() { 125 125 delete condition; 126 } 127 128 CaseStmt * CaseStmt::makeDefault( std::list<Label> labels, std::list<Statement *> branches ) { 129 return new CaseStmt( labels, 0, branches, true ); 126 130 } 127 131 -
src/SynTree/Statement.h
ra61fea9a r9a8930f 10 10 // Created On : Mon May 18 07:44:20 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Wed Jun 3 11:55:15201513 // Update Count : 612 // Last Modified On : Thu Jun 4 14:03:31 2015 13 // Update Count : 14 14 14 // 15 15 … … 149 149 std::list<Statement *> &stmts, bool isdef = false ) throw(SemanticError); 150 150 virtual ~CaseStmt(); 151 152 static CaseStmt * makeDefault( std::list<Label> labels = std::list<Label>(), 153 std::list<Statement *> stmts = std::list<Statement *>() ); 151 154 152 155 bool isDefault() { return _isDefault; } -
src/examples/control_structures.c
ra61fea9a r9a8930f 10 10 // Created On : Wed May 27 17:56:53 2015 11 11 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Jun 4 1 1:21:12201513 // Update Count : 2 312 // Last Modified On : Thu Jun 4 14:02:50 2015 13 // Update Count : 24 14 14 // 15 15
Note: See TracChangeset
for help on using the changeset viewer.