Changeset 8688ce1 for src/CodeGen
- Timestamp:
- Aug 4, 2016, 12:29:54 PM (8 years ago)
- Branches:
- ADT, aaron-thesis, arm-eh, ast-experimental, cleanup-dtors, ctor, deferred_resn, demangler, enum, forall-pointer-decay, jacob/cs343-translation, jenkins-sandbox, master, memory, new-ast, new-ast-unique-expr, new-env, no_list, persistent-indexer, pthread-emulation, qualifiedEnum, resolv-new, with_gc
- Children:
- 76e8c55
- Parents:
- e80ebe5
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/CodeGen/CodeGenerator.cc
re80ebe5 r8688ce1 9 9 // Author : Richard C. Bilson 10 10 // Created On : Mon May 18 07:44:20 2015 11 // Last Modified By : 12 // Last Modified On : Sun Jul 31 08:42:18201613 // Update Count : 3 4511 // Last Modified By : Peter A. Buhr 12 // Last Modified On : Thu Aug 4 11:16:21 2016 13 // Update Count : 351 14 14 // 15 15 … … 48 48 } 49 49 50 void CodeGenerator::extension( Expression * expr ) {50 void CodeGenerator::extension( Expression * expr ) { 51 51 if ( expr->get_extension() ) { 52 52 output << "__extension__ "; … … 54 54 } // extension 55 55 56 void CodeGenerator::extension( Declaration * decl ) {56 void CodeGenerator::extension( Declaration * decl ) { 57 57 if ( decl->get_extension() ) { 58 58 output << "__extension__ "; … … 73 73 } 74 74 75 ostream & operator<<( ostream & output, CodeGenerator::LabelPrinter & printLabels ) {75 ostream & operator<<( ostream & output, CodeGenerator::LabelPrinter & printLabels ) { 76 76 std::list< Label > & labs = *printLabels.labels; 77 77 // l.unique(); // assumes a sorted list. Why not use set? Does order matter? … … 79 79 output << l.get_name() + ": "; 80 80 printLabels.cg.genAttributes( l.get_attributes() ); 81 } 81 } // for 82 82 return output; 83 83 } 84 84 85 CodeGenerator::CodeGenerator( std::ostream & os ) : indent( *this), cur_indent( 0 ), insideFunction( false ), output( os ), printLabels( *this ) {}86 87 CodeGenerator::CodeGenerator( std::ostream & os, std::string init, int indentation, bool infunp )85 CodeGenerator::CodeGenerator( std::ostream & os ) : indent( *this), cur_indent( 0 ), insideFunction( false ), output( os ), printLabels( *this ) {} 86 87 CodeGenerator::CodeGenerator( std::ostream & os, std::string init, int indentation, bool infunp ) 88 88 : indent( *this), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) { 89 89 //output << std::string( init ); 90 90 } 91 91 92 CodeGenerator::CodeGenerator( std::ostream & os, char *init, int indentation, bool infunp )92 CodeGenerator::CodeGenerator( std::ostream & os, char * init, int indentation, bool infunp ) 93 93 : indent( *this ), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) { 94 94 //output << std::string( init ); 95 95 } 96 96 97 string mangleName( DeclarationWithType * decl ) {97 string mangleName( DeclarationWithType * decl ) { 98 98 if ( decl->get_mangleName() != "" ) { 99 99 // need to incorporate scope level in order to differentiate names for destructors … … 112 112 genCommaList( attr->get_parameters().begin(), attr->get_parameters().end() ); 113 113 output << ")"; 114 } 114 } // if 115 115 output << ","; 116 } 116 } // for 117 117 output << ")) "; 118 } 118 } // if 119 119 } 120 120 121 121 122 122 //*** Declarations 123 void CodeGenerator::visit( FunctionDecl * functionDecl ) {123 void CodeGenerator::visit( FunctionDecl * functionDecl ) { 124 124 extension( functionDecl ); 125 125 genAttributes( functionDecl->get_attributes() ); … … 146 146 } 147 147 148 void CodeGenerator::visit( ObjectDecl * objectDecl ) {148 void CodeGenerator::visit( ObjectDecl * objectDecl ) { 149 149 extension( objectDecl ); 150 150 handleStorageClass( objectDecl ); … … 162 162 } 163 163 164 void CodeGenerator::handleAggregate( AggregateDecl * aggDecl ) {164 void CodeGenerator::handleAggregate( AggregateDecl * aggDecl ) { 165 165 if ( aggDecl->get_name() != "" ) 166 166 output << aggDecl->get_name(); 167 167 168 std::list< Declaration * > & memb = aggDecl->get_members();168 std::list< Declaration * > & memb = aggDecl->get_members(); 169 169 if ( ! memb.empty() ) { 170 170 // if ( aggDecl->has_body() ) { 171 // std::list< Declaration * > & memb = aggDecl->get_members();171 // std::list< Declaration * > & memb = aggDecl->get_members(); 172 172 output << " {" << endl; 173 173 … … 185 185 } 186 186 187 void CodeGenerator::visit( StructDecl * structDecl ) {187 void CodeGenerator::visit( StructDecl * structDecl ) { 188 188 extension( structDecl ); 189 189 output << "struct "; … … 191 191 } 192 192 193 void CodeGenerator::visit( UnionDecl * unionDecl ) {193 void CodeGenerator::visit( UnionDecl * unionDecl ) { 194 194 extension( unionDecl ); 195 195 output << "union "; … … 197 197 } 198 198 199 void CodeGenerator::visit( EnumDecl * enumDecl ) {199 void CodeGenerator::visit( EnumDecl * enumDecl ) { 200 200 extension( enumDecl ); 201 201 output << "enum "; … … 211 211 cur_indent += CodeGenerator::tabsize; 212 212 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) { 213 ObjectDecl * obj = dynamic_cast< ObjectDecl* >( *i );213 ObjectDecl * obj = dynamic_cast< ObjectDecl* >( *i ); 214 214 assert( obj ); 215 215 output << indent << mangleName( obj ); … … 227 227 } 228 228 229 void CodeGenerator::visit( TraitDecl * traitDecl ) {}230 231 void CodeGenerator::visit( TypedefDecl * typeDecl ) {229 void CodeGenerator::visit( TraitDecl * traitDecl ) {} 230 231 void CodeGenerator::visit( TypedefDecl * typeDecl ) { 232 232 assert( false && "Typedefs are removed and substituted in earlier passes." ); 233 233 //output << "typedef "; … … 235 235 } 236 236 237 void CodeGenerator::visit( TypeDecl * typeDecl ) {237 void CodeGenerator::visit( TypeDecl * typeDecl ) { 238 238 // really, we should mutate this into something that isn't a TypeDecl but that requires large-scale changes, 239 239 // still to be done … … 263 263 } 264 264 265 void CodeGenerator::visit( SingleInit * init ) {265 void CodeGenerator::visit( SingleInit * init ) { 266 266 printDesignators( init->get_designators() ); 267 267 init->get_value()->accept( *this ); 268 268 } 269 269 270 void CodeGenerator::visit( ListInit * init ) {270 void CodeGenerator::visit( ListInit * init ) { 271 271 printDesignators( init->get_designators() ); 272 272 output << "{ "; … … 276 276 } else { 277 277 genCommaList( init->begin_initializers(), init->end_initializers() ); 278 } 278 } // if 279 279 output << " }"; 280 280 } 281 281 282 void CodeGenerator::visit( Constant * constant ) {282 void CodeGenerator::visit( Constant * constant ) { 283 283 output << constant->get_value() ; 284 284 } 285 285 286 286 //*** Expressions 287 void CodeGenerator::visit( ApplicationExpr * applicationExpr ) {287 void CodeGenerator::visit( ApplicationExpr * applicationExpr ) { 288 288 extension( applicationExpr ); 289 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr* >( applicationExpr->get_function() ) ) {289 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr* >( applicationExpr->get_function() ) ) { 290 290 OperatorInfo opInfo; 291 291 if ( varExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( varExpr->get_var()->get_name(), opInfo ) ) { … … 299 299 { 300 300 assert( arg != applicationExpr->get_args().end() ); 301 if ( AddressExpr * addrExpr = dynamic_cast< AddressExpr * >( *arg ) ) {301 if ( AddressExpr * addrExpr = dynamic_cast< AddressExpr * >( *arg ) ) { 302 302 // remove & from first assignment/ctor argument 303 303 *arg = addrExpr->get_arg(); 304 304 } else { 305 305 // no address-of operator, so must be a pointer - add dereference 306 UntypedExpr * newExpr = new UntypedExpr( new NameExpr( "*?" ) );306 UntypedExpr * newExpr = new UntypedExpr( new NameExpr( "*?" ) ); 307 307 newExpr->get_args().push_back( *arg ); 308 308 assert( (*arg)->get_results().size() == 1 ); … … 352 352 // no constructors with 0 or more than 2 parameters 353 353 assert( false ); 354 } 354 } // if 355 355 break; 356 356 … … 401 401 } 402 402 403 void CodeGenerator::visit( UntypedExpr * untypedExpr ) {403 void CodeGenerator::visit( UntypedExpr * untypedExpr ) { 404 404 extension( untypedExpr ); 405 if ( NameExpr * nameExpr = dynamic_cast< NameExpr* >( untypedExpr->get_function() ) ) {405 if ( NameExpr * nameExpr = dynamic_cast< NameExpr* >( untypedExpr->get_function() ) ) { 406 406 OperatorInfo opInfo; 407 407 if ( operatorLookup( nameExpr->get_name(), opInfo ) ) { … … 472 472 } // switch 473 473 } else { 474 if ( nameExpr->get_name() == " Range" ) { // case V1 ... V2 or case V1~V2474 if ( nameExpr->get_name() == "..." ) { // case V1 ... V2 or case V1~V2 475 475 assert( untypedExpr->get_args().size() == 2 ); 476 476 (*untypedExpr->get_args().begin())->accept( *this ); … … 492 492 } 493 493 494 void CodeGenerator::visit( NameExpr * nameExpr ) {494 void CodeGenerator::visit( NameExpr * nameExpr ) { 495 495 extension( nameExpr ); 496 496 OperatorInfo opInfo; … … 503 503 } 504 504 505 void CodeGenerator::visit( AddressExpr * addressExpr ) {505 void CodeGenerator::visit( AddressExpr * addressExpr ) { 506 506 extension( addressExpr ); 507 507 output << "(&"; 508 508 // this hack makes sure that we don't convert "constant_zero" to "0" if we're taking its address 509 if ( VariableExpr * variableExpr = dynamic_cast< VariableExpr* >( addressExpr->get_arg() ) ) {509 if ( VariableExpr * variableExpr = dynamic_cast< VariableExpr* >( addressExpr->get_arg() ) ) { 510 510 output << mangleName( variableExpr->get_var() ); 511 511 } else { … … 515 515 } 516 516 517 void CodeGenerator::visit( CastExpr * castExpr ) {517 void CodeGenerator::visit( CastExpr * castExpr ) { 518 518 extension( castExpr ); 519 519 output << "("; … … 533 533 } 534 534 535 void CodeGenerator::visit( UntypedMemberExpr * memberExpr ) {535 void CodeGenerator::visit( UntypedMemberExpr * memberExpr ) { 536 536 assert( false ); 537 537 } 538 538 539 void CodeGenerator::visit( MemberExpr * memberExpr ) {539 void CodeGenerator::visit( MemberExpr * memberExpr ) { 540 540 extension( memberExpr ); 541 541 memberExpr->get_aggregate()->accept( *this ); … … 543 543 } 544 544 545 void CodeGenerator::visit( VariableExpr * variableExpr ) {545 void CodeGenerator::visit( VariableExpr * variableExpr ) { 546 546 extension( variableExpr ); 547 547 OperatorInfo opInfo; … … 553 553 } 554 554 555 void CodeGenerator::visit( ConstantExpr * constantExpr ) {555 void CodeGenerator::visit( ConstantExpr * constantExpr ) { 556 556 assert( constantExpr->get_constant() ); 557 557 extension( constantExpr ); … … 559 559 } 560 560 561 void CodeGenerator::visit( SizeofExpr * sizeofExpr ) {561 void CodeGenerator::visit( SizeofExpr * sizeofExpr ) { 562 562 extension( sizeofExpr ); 563 563 output << "sizeof("; … … 570 570 } 571 571 572 void CodeGenerator::visit( AlignofExpr * alignofExpr ) {572 void CodeGenerator::visit( AlignofExpr * alignofExpr ) { 573 573 // use GCC extension to avoid bumping std to C11 574 574 extension( alignofExpr ); … … 582 582 } 583 583 584 void CodeGenerator::visit( UntypedOffsetofExpr * offsetofExpr ) {584 void CodeGenerator::visit( UntypedOffsetofExpr * offsetofExpr ) { 585 585 assert( false && "UntypedOffsetofExpr should not reach code generation." ); 586 586 } 587 587 588 void CodeGenerator::visit( OffsetofExpr * offsetofExpr ) {588 void CodeGenerator::visit( OffsetofExpr * offsetofExpr ) { 589 589 // use GCC builtin 590 590 output << "__builtin_offsetof("; … … 594 594 } 595 595 596 void CodeGenerator::visit( OffsetPackExpr * offsetPackExpr ) {596 void CodeGenerator::visit( OffsetPackExpr * offsetPackExpr ) { 597 597 assert( false && "OffsetPackExpr should not reach code generation." ); 598 598 } 599 599 600 void CodeGenerator::visit( LogicalExpr * logicalExpr ) {600 void CodeGenerator::visit( LogicalExpr * logicalExpr ) { 601 601 extension( logicalExpr ); 602 602 output << "("; … … 611 611 } 612 612 613 void CodeGenerator::visit( ConditionalExpr * conditionalExpr ) {613 void CodeGenerator::visit( ConditionalExpr * conditionalExpr ) { 614 614 extension( conditionalExpr ); 615 615 output << "("; … … 622 622 } 623 623 624 void CodeGenerator::visit( CommaExpr * commaExpr ) {624 void CodeGenerator::visit( CommaExpr * commaExpr ) { 625 625 extension( commaExpr ); 626 626 output << "("; … … 631 631 } 632 632 633 void CodeGenerator::visit( TupleExpr * tupleExpr ) {}634 635 void CodeGenerator::visit( TypeExpr * typeExpr ) {}636 637 void CodeGenerator::visit( AsmExpr * asmExpr ) {633 void CodeGenerator::visit( TupleExpr * tupleExpr ) {} 634 635 void CodeGenerator::visit( TypeExpr * typeExpr ) {} 636 637 void CodeGenerator::visit( AsmExpr * asmExpr ) { 638 638 if ( asmExpr->get_inout() ) { 639 639 output << "[ "; … … 648 648 649 649 //*** Statements 650 void CodeGenerator::visit( CompoundStmt * compoundStmt ) {650 void CodeGenerator::visit( CompoundStmt * compoundStmt ) { 651 651 std::list<Statement*> ks = compoundStmt->get_kids(); 652 652 output << "{" << endl; … … 662 662 output << endl; 663 663 } // if 664 } 664 } // for 665 665 cur_indent -= CodeGenerator::tabsize; 666 666 … … 668 668 } 669 669 670 void CodeGenerator::visit( ExprStmt * exprStmt ) {670 void CodeGenerator::visit( ExprStmt * exprStmt ) { 671 671 assert( exprStmt ); 672 672 // cast the top-level expression to void to reduce gcc warnings. … … 676 676 } 677 677 678 void CodeGenerator::visit( AsmStmt * asmStmt ) {678 void CodeGenerator::visit( AsmStmt * asmStmt ) { 679 679 output << "asm "; 680 680 if ( asmStmt->get_voltile() ) output << "volatile "; … … 699 699 } 700 700 701 void CodeGenerator::visit( IfStmt * ifStmt ) {701 void CodeGenerator::visit( IfStmt * ifStmt ) { 702 702 output << "if ( "; 703 703 ifStmt->get_condition()->accept( *this ); … … 712 712 } 713 713 714 void CodeGenerator::visit( SwitchStmt * switchStmt ) {714 void CodeGenerator::visit( SwitchStmt * switchStmt ) { 715 715 output << "switch ( " ; 716 716 switchStmt->get_condition()->accept( *this ); … … 719 719 output << "{" << std::endl; 720 720 cur_indent += CodeGenerator::tabsize; 721 722 acceptAll( switchStmt->get_branches(), *this ); 723 721 acceptAll( switchStmt->get_statements(), *this ); 724 722 cur_indent -= CodeGenerator::tabsize; 725 726 723 output << indent << "}"; 727 724 } 728 725 729 void CodeGenerator::visit( CaseStmt * caseStmt ) {726 void CodeGenerator::visit( CaseStmt * caseStmt ) { 730 727 output << indent; 731 728 if ( caseStmt->isDefault()) { … … 748 745 } 749 746 750 void CodeGenerator::visit( BranchStmt * branchStmt ) {747 void CodeGenerator::visit( BranchStmt * branchStmt ) { 751 748 switch ( branchStmt->get_type()) { 752 749 case BranchStmt::Goto: … … 771 768 772 769 773 void CodeGenerator::visit( ReturnStmt * returnStmt ) {770 void CodeGenerator::visit( ReturnStmt * returnStmt ) { 774 771 output << "return "; 775 772 maybeAccept( returnStmt->get_expr(), *this ); … … 777 774 } 778 775 779 void CodeGenerator::visit( WhileStmt * whileStmt ) {776 void CodeGenerator::visit( WhileStmt * whileStmt ) { 780 777 if ( whileStmt->get_isDoWhile() ) { 781 778 output << "do" ; … … 799 796 } 800 797 801 void CodeGenerator::visit( ForStmt * forStmt ) {798 void CodeGenerator::visit( ForStmt * forStmt ) { 802 799 // initialization is always hoisted, so don't bother doing anything with that 803 800 output << "for (;"; … … 821 818 } 822 819 823 void CodeGenerator::visit( NullStmt * nullStmt ) {820 void CodeGenerator::visit( NullStmt * nullStmt ) { 824 821 //output << indent << CodeGenerator::printLabels( nullStmt->get_labels() ); 825 822 output << "/* null statement */ ;"; 826 823 } 827 824 828 void CodeGenerator::visit( DeclStmt * declStmt ) {825 void CodeGenerator::visit( DeclStmt * declStmt ) { 829 826 declStmt->get_decl()->accept( *this ); 830 827 … … 834 831 } 835 832 836 void CodeGenerator::handleStorageClass( Declaration * decl ) {833 void CodeGenerator::handleStorageClass( Declaration * decl ) { 837 834 switch ( decl->get_storageClass() ) { 838 835 case DeclarationNode::Extern:
Note: See TracChangeset
for help on using the changeset viewer.