source: src/CodeGen/CodeGenerator.cc@ 37efaf56

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox new-ast new-ast-unique-expr new-env no_list persistent-indexer pthread-emulation qualifiedEnum resolv-new with_gc
Last change on this file since 37efaf56 was 58dd019, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago

add asm_name clause to declarations
  • Property mode set to 100644
File size: 27.1 KB
RevLine 
[51587aa]1//
2// Cforall Version 1.0.0 Copyright (C) 2015 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
[71f4e4f]7// CodeGenerator.cc --
[51587aa]8//
9// Author : Richard C. Bilson
10// Created On : Mon May 18 07:44:20 2015
[8688ce1]11// Last Modified By : Peter A. Buhr
[58dd019]12// Last Modified On : Tue Dec 13 14:51:27 2016
13// Update Count : 362
[51587aa]14//
15
[51b73452]16#include <algorithm>
17#include <iostream>
18#include <cassert>
19#include <list>
20
[68cd1ce]21#include "Parser/ParseNode.h"
22
[e8032b0]23#include "SynTree/Declaration.h"
[51b73452]24#include "SynTree/Expression.h"
25#include "SynTree/Initializer.h"
[68cd1ce]26#include "SynTree/Statement.h"
[e8032b0]27#include "SynTree/Type.h"
[7baed7d]28#include "SynTree/Attribute.h"
[51b73452]29
[d3b7937]30#include "Common/utility.h"
31#include "Common/UnimplementedError.h"
[51b73452]32
[a61fea9a]33#include "CodeGenerator.h"
[51b73452]34#include "OperatorTable.h"
35#include "GenType.h"
36
[10a7775]37#include "InitTweak/InitTweak.h"
38
[51b73452]39using namespace std;
40
41namespace CodeGen {
[6c4ff37]42 int CodeGenerator::tabsize = 4;
[51587aa]43
[145f1fc]44 // the kinds of statements that would ideally be followed by whitespace
[2b6c1e0]45 bool wantSpacing( Statement * stmt) {
46 return dynamic_cast< IfStmt * >( stmt ) || dynamic_cast< CompoundStmt * >( stmt ) ||
[08061589]47 dynamic_cast< WhileStmt * >( stmt ) || dynamic_cast< ForStmt * >( stmt ) || dynamic_cast< SwitchStmt *>( stmt );
[2b6c1e0]48 }
49
[8688ce1]50 void CodeGenerator::extension( Expression * expr ) {
[8e9cbb2]51 if ( expr->get_extension() ) {
52 output << "__extension__ ";
53 } // if
54 } // extension
55
[8688ce1]56 void CodeGenerator::extension( Declaration * decl ) {
[8e9cbb2]57 if ( decl->get_extension() ) {
58 output << "__extension__ ";
59 } // if
60 } // extension
61
[58dd019]62 void CodeGenerator::asmName( DeclarationWithType * decl ) {
63 if ( ConstantExpr * asmName = decl->get_asmName() ) {
64 output << " asm ( " << asmName->get_constant()->get_value() << " )";
65 } // if
66 } // extension
67
[888cbe4]68 ostream & CodeGenerator::Indenter::operator()( ostream & output ) const {
[cda48b6]69 return output << string( cg.cur_indent, ' ' );
70 }
71
[888cbe4]72 ostream & operator<<( ostream & output, const CodeGenerator::Indenter &indent ) {
[cda48b6]73 return indent( output );
74 }
[51587aa]75
[888cbe4]76 CodeGenerator::LabelPrinter & CodeGenerator::LabelPrinter::operator()( std::list< Label > & l ) {
77 labels = &l;
78 return *this;
79 }
80
[8688ce1]81 ostream & operator<<( ostream & output, CodeGenerator::LabelPrinter & printLabels ) {
[888cbe4]82 std::list< Label > & labs = *printLabels.labels;
83 // l.unique(); // assumes a sorted list. Why not use set? Does order matter?
84 for ( Label & l : labs ) {
85 output << l.get_name() + ": ";
86 printLabels.cg.genAttributes( l.get_attributes() );
[8688ce1]87 } // for
[888cbe4]88 return output;
89 }
90
[486341f]91 CodeGenerator::CodeGenerator( std::ostream & os, bool mangle ) : indent( *this), cur_indent( 0 ), insideFunction( false ), output( os ), printLabels( *this ), mangle( mangle ) {}
[cda48b6]92
[8688ce1]93 CodeGenerator::CodeGenerator( std::ostream & os, std::string init, int indentation, bool infunp )
[888cbe4]94 : indent( *this), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) {
[6c4ff37]95 //output << std::string( init );
[51587aa]96 }
97
[8688ce1]98 CodeGenerator::CodeGenerator( std::ostream & os, char * init, int indentation, bool infunp )
[888cbe4]99 : indent( *this ), cur_indent( indentation ), insideFunction( infunp ), output( os ), printLabels( *this ) {
[6c4ff37]100 //output << std::string( init );
[51587aa]101 }
102
[486341f]103 string CodeGenerator::mangleName( DeclarationWithType * decl ) {
104 if ( ! mangle ) return decl->get_name();
[51587aa]105 if ( decl->get_mangleName() != "" ) {
[f326f99]106 // need to incorporate scope level in order to differentiate names for destructors
107 return decl->get_scopedMangleName();
[51587aa]108 } else {
109 return decl->get_name();
110 } // if
111 }
[94b4364]112
[7baed7d]113 void CodeGenerator::genAttributes( std::list< Attribute * > & attributes ) {
114 if ( ! attributes.empty() ) {
115 output << "__attribute__ ((";
116 for ( Attribute *& attr : attributes ) {
117 if ( ! attr->empty() ) {
118 output << attr->get_name() << "(";
119 genCommaList( attr->get_parameters().begin(), attr->get_parameters().end() );
120 output << ")";
[8688ce1]121 } // if
[7baed7d]122 output << ",";
[8688ce1]123 } // for
[7baed7d]124 output << ")) ";
[8688ce1]125 } // if
[7baed7d]126 }
127
128
129 //*** Declarations
[8688ce1]130 void CodeGenerator::visit( FunctionDecl * functionDecl ) {
[8e9cbb2]131 extension( functionDecl );
[7baed7d]132 genAttributes( functionDecl->get_attributes() );
133
[51587aa]134 handleStorageClass( functionDecl );
[f38c8d9]135 if ( functionDecl->get_isInline() ) {
[6c4ff37]136 output << "inline ";
[f38c8d9]137 } // if
[de62360d]138 if ( functionDecl->get_isNoreturn() ) {
139 output << "_Noreturn ";
140 } // if
[6c4ff37]141 output << genType( functionDecl->get_functionType(), mangleName( functionDecl ) );
[51587aa]142
143 // how to get this to the Functype?
144 std::list< Declaration * > olds = functionDecl->get_oldDecls();
145 if ( ! olds.empty() ) {
[6c4ff37]146 output << " /* function has old declaration */";
[51587aa]147 } // if
148
[58dd019]149 asmName( functionDecl );
150
[51587aa]151 // acceptAll( functionDecl->get_oldDecls(), *this );
152 if ( functionDecl->get_statements() ) {
[7f5566b]153 functionDecl->get_statements()->accept( *this );
[51587aa]154 } // if
155 }
156
[8688ce1]157 void CodeGenerator::visit( ObjectDecl * objectDecl ) {
[8e9cbb2]158 extension( objectDecl );
[f9cebb5]159 genAttributes( objectDecl->get_attributes() );
160
[51587aa]161 handleStorageClass( objectDecl );
[6c4ff37]162 output << genType( objectDecl->get_type(), mangleName( objectDecl ) );
[71f4e4f]163
[58dd019]164 asmName( objectDecl );
165
[51587aa]166 if ( objectDecl->get_init() ) {
[6c4ff37]167 output << " = ";
[51587aa]168 objectDecl->get_init()->accept( *this );
169 } // if
[3778cb2]170
[51587aa]171 if ( objectDecl->get_bitfieldWidth() ) {
[6c4ff37]172 output << ":";
[51587aa]173 objectDecl->get_bitfieldWidth()->accept( *this );
174 } // if
175 }
176
[8688ce1]177 void CodeGenerator::handleAggregate( AggregateDecl * aggDecl ) {
[51587aa]178 if ( aggDecl->get_name() != "" )
[6c4ff37]179 output << aggDecl->get_name();
[71f4e4f]180
[8688ce1]181 std::list< Declaration * > & memb = aggDecl->get_members();
[51587aa]182 if ( ! memb.empty() ) {
[5d125e4]183// if ( aggDecl->has_body() ) {
[8688ce1]184// std::list< Declaration * > & memb = aggDecl->get_members();
[94b4364]185 output << " {" << endl;
[51587aa]186
[71f4e4f]187 cur_indent += CodeGenerator::tabsize;
[3778cb2]188 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++ ) {
[71f4e4f]189 output << indent;
[7f5566b]190 (*i)->accept( *this );
[6c4ff37]191 output << ";" << endl;
[3778cb2]192 } // for
[51587aa]193
[71f4e4f]194 cur_indent -= CodeGenerator::tabsize;
[51587aa]195
[cda48b6]196 output << indent << "}";
[17cd4eb]197 } // if
[51587aa]198 }
[17cd4eb]199
[8688ce1]200 void CodeGenerator::visit( StructDecl * structDecl ) {
[8e9cbb2]201 extension( structDecl );
[6c4ff37]202 output << "struct ";
[51587aa]203 handleAggregate( structDecl );
204 }
[17cd4eb]205
[8688ce1]206 void CodeGenerator::visit( UnionDecl * unionDecl ) {
[8e9cbb2]207 extension( unionDecl );
[6c4ff37]208 output << "union ";
[8e9cbb2]209 handleAggregate( unionDecl );
[51587aa]210 }
[71f4e4f]211
[8688ce1]212 void CodeGenerator::visit( EnumDecl * enumDecl ) {
[8e9cbb2]213 extension( enumDecl );
[6c4ff37]214 output << "enum ";
[51587aa]215
[8e9cbb2]216 if ( enumDecl->get_name() != "" )
217 output << enumDecl->get_name();
[71f4e4f]218
[8e9cbb2]219 std::list< Declaration* > &memb = enumDecl->get_members();
[51587aa]220
221 if ( ! memb.empty() ) {
[cda48b6]222 output << " {" << endl;
[51587aa]223
[71f4e4f]224 cur_indent += CodeGenerator::tabsize;
[51587aa]225 for ( std::list< Declaration* >::iterator i = memb.begin(); i != memb.end(); i++) {
[8688ce1]226 ObjectDecl * obj = dynamic_cast< ObjectDecl* >( *i );
[51587aa]227 assert( obj );
[71f4e4f]228 output << indent << mangleName( obj );
[51587aa]229 if ( obj->get_init() ) {
[6c4ff37]230 output << " = ";
[7f5566b]231 obj->get_init()->accept( *this );
[51587aa]232 } // if
[6c4ff37]233 output << "," << endl;
[51587aa]234 } // for
235
[71f4e4f]236 cur_indent -= CodeGenerator::tabsize;
[51587aa]237
[cda48b6]238 output << indent << "}";
[51587aa]239 } // if
240 }
[71f4e4f]241
[8688ce1]242 void CodeGenerator::visit( TraitDecl * traitDecl ) {}
[71f4e4f]243
[8688ce1]244 void CodeGenerator::visit( TypedefDecl * typeDecl ) {
[8e9cbb2]245 assert( false && "Typedefs are removed and substituted in earlier passes." );
246 //output << "typedef ";
247 //output << genType( typeDecl->get_base(), typeDecl->get_name() );
[51587aa]248 }
[71f4e4f]249
[8688ce1]250 void CodeGenerator::visit( TypeDecl * typeDecl ) {
[51587aa]251 // really, we should mutate this into something that isn't a TypeDecl but that requires large-scale changes,
252 // still to be done
[8e9cbb2]253 extension( typeDecl );
[6c4ff37]254 output << "extern unsigned long " << typeDecl->get_name();
[51587aa]255 if ( typeDecl->get_base() ) {
[6c4ff37]256 output << " = sizeof( " << genType( typeDecl->get_base(), "" ) << " )";
[51587aa]257 } // if
258 }
259
[e45215c]260 void CodeGenerator::printDesignators( std::list< Expression * > & designators ) {
261 typedef std::list< Expression * > DesignatorList;
262 if ( designators.size() == 0 ) return;
263 for ( DesignatorList::iterator iter = designators.begin(); iter != designators.end(); ++iter ) {
[8a4da06]264 if ( dynamic_cast< NameExpr * >( *iter ) ) {
[f32c7f4]265 // if expression is a name, then initializing aggregate member
266 output << ".";
267 (*iter)->accept( *this );
268 } else {
269 // if not a simple name, it has to be a constant expression, i.e. an array designator
[e45215c]270 output << "[";
271 (*iter)->accept( *this );
272 output << "]";
[3778cb2]273 } // if
274 } // for
[e45215c]275 output << " = ";
276 }
277
[8688ce1]278 void CodeGenerator::visit( SingleInit * init ) {
[e45215c]279 printDesignators( init->get_designators() );
[51587aa]280 init->get_value()->accept( *this );
281 }
282
[8688ce1]283 void CodeGenerator::visit( ListInit * init ) {
[e45215c]284 printDesignators( init->get_designators() );
[6c4ff37]285 output << "{ ";
[4d2434a]286 if ( init->begin() == init->end() ) {
[8e9cbb2]287 // illegal to leave initializer list empty for scalar initializers, but always legal to have 0
[5b40f30]288 output << "0";
289 } else {
[4d2434a]290 genCommaList( init->begin(), init->end() );
[8688ce1]291 } // if
[6c4ff37]292 output << " }";
[51587aa]293 }
294
[8688ce1]295 void CodeGenerator::visit( Constant * constant ) {
[6c4ff37]296 output << constant->get_value() ;
[51587aa]297 }
298
299 //*** Expressions
[8688ce1]300 void CodeGenerator::visit( ApplicationExpr * applicationExpr ) {
[e04ef3a]301 extension( applicationExpr );
[8688ce1]302 if ( VariableExpr * varExpr = dynamic_cast< VariableExpr* >( applicationExpr->get_function() ) ) {
[51587aa]303 OperatorInfo opInfo;
304 if ( varExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( varExpr->get_var()->get_name(), opInfo ) ) {
305 std::list< Expression* >::iterator arg = applicationExpr->get_args().begin();
306 switch ( opInfo.type ) {
307 case OT_PREFIXASSIGN:
308 case OT_POSTFIXASSIGN:
309 case OT_INFIXASSIGN:
[356189a]310 case OT_CTOR:
[c2ce2350]311 case OT_DTOR:
[51587aa]312 {
313 assert( arg != applicationExpr->get_args().end() );
[8688ce1]314 if ( AddressExpr * addrExpr = dynamic_cast< AddressExpr * >( *arg ) ) {
[356189a]315 // remove & from first assignment/ctor argument
[51587aa]316 *arg = addrExpr->get_arg();
317 } else {
[356189a]318 // no address-of operator, so must be a pointer - add dereference
[066d77a]319 // NOTE: if the assertion starts to trigger, check that the application expr isn't being shared.
320 // Since its arguments are modified here, this assertion most commonly triggers when the application
321 // is visited multiple times.
[8688ce1]322 UntypedExpr * newExpr = new UntypedExpr( new NameExpr( "*?" ) );
[51587aa]323 newExpr->get_args().push_back( *arg );
[906e24d]324 Type * type = InitTweak::getPointerBase( (*arg)->get_result() );
[066d77a]325 assertf( type, "First argument to a derefence must be a pointer. Ensure that expressions are not being shared." );
[906e24d]326 newExpr->set_result( type->clone() );
[51587aa]327 *arg = newExpr;
328 } // if
329 break;
330 }
[71f4e4f]331
[51587aa]332 default:
333 // do nothing
334 ;
[3778cb2]335 } // switch
[71f4e4f]336
[51587aa]337 switch ( opInfo.type ) {
338 case OT_INDEX:
339 assert( applicationExpr->get_args().size() == 2 );
340 (*arg++)->accept( *this );
[6c4ff37]341 output << "[";
[51587aa]342 (*arg)->accept( *this );
[6c4ff37]343 output << "]";
[51587aa]344 break;
[71f4e4f]345
[51587aa]346 case OT_CALL:
[356189a]347 // there are no intrinsic definitions of the function call operator
[51587aa]348 assert( false );
349 break;
[71f4e4f]350
[f1e012b]351 case OT_CTOR:
[c2ce2350]352 case OT_DTOR:
[356189a]353 if ( applicationExpr->get_args().size() == 1 ) {
[8e9cbb2]354 // the expression fed into a single parameter constructor or destructor may contain side
355 // effects, so must still output this expression
[64071c2]356 output << "(";
[356189a]357 (*arg++)->accept( *this );
[64071c2]358 output << ") /* " << opInfo.inputName << " */";
[356189a]359 } else if ( applicationExpr->get_args().size() == 2 ) {
[c2ce2350]360 // intrinsic two parameter constructors are essentially bitwise assignment
[356189a]361 output << "(";
362 (*arg++)->accept( *this );
363 output << opInfo.symbol;
364 (*arg)->accept( *this );
[c2ce2350]365 output << ") /* " << opInfo.inputName << " */";
[356189a]366 } else {
[c2ce2350]367 // no constructors with 0 or more than 2 parameters
[356189a]368 assert( false );
[8688ce1]369 } // if
[356189a]370 break;
[f1e012b]371
[51587aa]372 case OT_PREFIX:
373 case OT_PREFIXASSIGN:
374 assert( applicationExpr->get_args().size() == 1 );
[6c4ff37]375 output << "(";
376 output << opInfo.symbol;
[51587aa]377 (*arg)->accept( *this );
[6c4ff37]378 output << ")";
[51587aa]379 break;
[71f4e4f]380
[51587aa]381 case OT_POSTFIX:
382 case OT_POSTFIXASSIGN:
383 assert( applicationExpr->get_args().size() == 1 );
384 (*arg)->accept( *this );
[6c4ff37]385 output << opInfo.symbol;
[51587aa]386 break;
387
[f1e012b]388
[51587aa]389 case OT_INFIX:
390 case OT_INFIXASSIGN:
391 assert( applicationExpr->get_args().size() == 2 );
[6c4ff37]392 output << "(";
[51587aa]393 (*arg++)->accept( *this );
[6c4ff37]394 output << opInfo.symbol;
[51587aa]395 (*arg)->accept( *this );
[6c4ff37]396 output << ")";
[51587aa]397 break;
[71f4e4f]398
[51587aa]399 case OT_CONSTANT:
[721f17a]400 case OT_LABELADDRESS:
401 // there are no intrinsic definitions of 0/1 or label addresses as functions
[51587aa]402 assert( false );
[3778cb2]403 } // switch
[17cd4eb]404 } else {
[51587aa]405 varExpr->accept( *this );
[6c4ff37]406 output << "(";
[51587aa]407 genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() );
[6c4ff37]408 output << ")";
[17cd4eb]409 } // if
[51587aa]410 } else {
411 applicationExpr->get_function()->accept( *this );
[6c4ff37]412 output << "(";
[51587aa]413 genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() );
[6c4ff37]414 output << ")";
[51587aa]415 } // if
416 }
[71f4e4f]417
[8688ce1]418 void CodeGenerator::visit( UntypedExpr * untypedExpr ) {
[e04ef3a]419 extension( untypedExpr );
[8688ce1]420 if ( NameExpr * nameExpr = dynamic_cast< NameExpr* >( untypedExpr->get_function() ) ) {
[51587aa]421 OperatorInfo opInfo;
422 if ( operatorLookup( nameExpr->get_name(), opInfo ) ) {
423 std::list< Expression* >::iterator arg = untypedExpr->get_args().begin();
424 switch ( opInfo.type ) {
425 case OT_INDEX:
426 assert( untypedExpr->get_args().size() == 2 );
427 (*arg++)->accept( *this );
[6c4ff37]428 output << "[";
[51587aa]429 (*arg)->accept( *this );
[6c4ff37]430 output << "]";
[51587aa]431 break;
[71f4e4f]432
[51587aa]433 case OT_CALL:
[f1e012b]434 assert( false );
435
[c2ce2350]436 case OT_CTOR:
437 case OT_DTOR:
438 if ( untypedExpr->get_args().size() == 1 ) {
[8e9cbb2]439 // the expression fed into a single parameter constructor or destructor may contain side
440 // effects, so must still output this expression
[64071c2]441 output << "(";
[c2ce2350]442 (*arg++)->accept( *this );
[64071c2]443 output << ") /* " << opInfo.inputName << " */";
[c2ce2350]444 } else if ( untypedExpr->get_args().size() == 2 ) {
445 // intrinsic two parameter constructors are essentially bitwise assignment
446 output << "(";
447 (*arg++)->accept( *this );
448 output << opInfo.symbol;
449 (*arg)->accept( *this );
450 output << ") /* " << opInfo.inputName << " */";
451 } else {
452 // no constructors with 0 or more than 2 parameters
453 assert( false );
[3778cb2]454 } // if
[51587aa]455 break;
[71f4e4f]456
[51587aa]457 case OT_PREFIX:
458 case OT_PREFIXASSIGN:
[de62360d]459 case OT_LABELADDRESS:
[51587aa]460 assert( untypedExpr->get_args().size() == 1 );
[6c4ff37]461 output << "(";
462 output << opInfo.symbol;
[51587aa]463 (*arg)->accept( *this );
[6c4ff37]464 output << ")";
[51587aa]465 break;
[71f4e4f]466
[51587aa]467 case OT_POSTFIX:
468 case OT_POSTFIXASSIGN:
469 assert( untypedExpr->get_args().size() == 1 );
470 (*arg)->accept( *this );
[6c4ff37]471 output << opInfo.symbol;
[51587aa]472 break;
[71f4e4f]473
[51587aa]474 case OT_INFIX:
475 case OT_INFIXASSIGN:
476 assert( untypedExpr->get_args().size() == 2 );
[6c4ff37]477 output << "(";
[51587aa]478 (*arg++)->accept( *this );
[6c4ff37]479 output << opInfo.symbol;
[51587aa]480 (*arg)->accept( *this );
[6c4ff37]481 output << ")";
[51587aa]482 break;
[71f4e4f]483
[51587aa]484 case OT_CONSTANT:
485 // there are no intrinsic definitions of 0 or 1 as functions
486 assert( false );
[3778cb2]487 } // switch
[51587aa]488 } else {
[8688ce1]489 if ( nameExpr->get_name() == "..." ) { // case V1 ... V2 or case V1~V2
[ac911f4]490 assert( untypedExpr->get_args().size() == 2 );
491 (*untypedExpr->get_args().begin())->accept( *this );
492 output << " ... ";
493 (*--untypedExpr->get_args().end())->accept( *this );
[057b34f]494 } else { // builtin routines
495 nameExpr->accept( *this );
496 output << "(";
497 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
498 output << ")";
[66d12f7]499 } // if
[51587aa]500 } // if
501 } else {
502 untypedExpr->get_function()->accept( *this );
[6c4ff37]503 output << "(";
[51587aa]504 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
[6c4ff37]505 output << ")";
[51587aa]506 } // if
507 }
[71f4e4f]508
[064e3ff]509 void CodeGenerator::visit( RangeExpr * rangeExpr ) {
510 rangeExpr->get_low()->accept( *this );
511 output << " ... ";
512 rangeExpr->get_high()->accept( *this );
513 }
514
[8688ce1]515 void CodeGenerator::visit( NameExpr * nameExpr ) {
[e04ef3a]516 extension( nameExpr );
[51587aa]517 OperatorInfo opInfo;
518 if ( operatorLookup( nameExpr->get_name(), opInfo ) ) {
519 assert( opInfo.type == OT_CONSTANT );
[6c4ff37]520 output << opInfo.symbol;
[51587aa]521 } else {
[6c4ff37]522 output << nameExpr->get_name();
[51587aa]523 } // if
524 }
[71f4e4f]525
[8688ce1]526 void CodeGenerator::visit( AddressExpr * addressExpr ) {
[e04ef3a]527 extension( addressExpr );
[6c4ff37]528 output << "(&";
[51587aa]529 // this hack makes sure that we don't convert "constant_zero" to "0" if we're taking its address
[8688ce1]530 if ( VariableExpr * variableExpr = dynamic_cast< VariableExpr* >( addressExpr->get_arg() ) ) {
[6c4ff37]531 output << mangleName( variableExpr->get_var() );
[51587aa]532 } else {
533 addressExpr->get_arg()->accept( *this );
534 } // if
[6c4ff37]535 output << ")";
[51587aa]536 }
537
[8688ce1]538 void CodeGenerator::visit( CastExpr * castExpr ) {
[e04ef3a]539 extension( castExpr );
[803deb1]540 output << "(";
[906e24d]541 if ( castExpr->get_result()->isVoid() ) {
[803deb1]542 output << "(void)" ;
[906e24d]543 } else if ( ! castExpr->get_result()->get_isLvalue() ) {
[803deb1]544 // at least one result type of cast, but not an lvalue
545 output << "(";
[906e24d]546 output << genType( castExpr->get_result(), "" );
[71f4e4f]547 output << ")";
[803deb1]548 } else {
[8e9cbb2]549 // otherwise, the cast is to an lvalue type, so the cast should be dropped, since the result of a cast is
[803deb1]550 // never an lvalue in C
[3778cb2]551 } // if
[803deb1]552 castExpr->get_arg()->accept( *this );
553 output << ")";
[51587aa]554 }
[71f4e4f]555
[8688ce1]556 void CodeGenerator::visit( UntypedMemberExpr * memberExpr ) {
[51587aa]557 assert( false );
558 }
[71f4e4f]559
[8688ce1]560 void CodeGenerator::visit( MemberExpr * memberExpr ) {
[e04ef3a]561 extension( memberExpr );
[51587aa]562 memberExpr->get_aggregate()->accept( *this );
[6c4ff37]563 output << "." << mangleName( memberExpr->get_member() );
[51587aa]564 }
[71f4e4f]565
[8688ce1]566 void CodeGenerator::visit( VariableExpr * variableExpr ) {
[e04ef3a]567 extension( variableExpr );
[51587aa]568 OperatorInfo opInfo;
569 if ( variableExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( variableExpr->get_var()->get_name(), opInfo ) && opInfo.type == OT_CONSTANT ) {
[6c4ff37]570 output << opInfo.symbol;
[51587aa]571 } else {
[6c4ff37]572 output << mangleName( variableExpr->get_var() );
[51587aa]573 } // if
574 }
[71f4e4f]575
[8688ce1]576 void CodeGenerator::visit( ConstantExpr * constantExpr ) {
[51587aa]577 assert( constantExpr->get_constant() );
[e04ef3a]578 extension( constantExpr );
[51587aa]579 constantExpr->get_constant()->accept( *this );
580 }
[71f4e4f]581
[8688ce1]582 void CodeGenerator::visit( SizeofExpr * sizeofExpr ) {
[e04ef3a]583 extension( sizeofExpr );
[6c4ff37]584 output << "sizeof(";
[51587aa]585 if ( sizeofExpr->get_isType() ) {
[6c4ff37]586 output << genType( sizeofExpr->get_type(), "" );
[51587aa]587 } else {
588 sizeofExpr->get_expr()->accept( *this );
589 } // if
[6c4ff37]590 output << ")";
[51587aa]591 }
[47534159]592
[8688ce1]593 void CodeGenerator::visit( AlignofExpr * alignofExpr ) {
[47534159]594 // use GCC extension to avoid bumping std to C11
[8e9cbb2]595 extension( alignofExpr );
[47534159]596 output << "__alignof__(";
[25a054f]597 if ( alignofExpr->get_isType() ) {
598 output << genType( alignofExpr->get_type(), "" );
[47534159]599 } else {
[25a054f]600 alignofExpr->get_expr()->accept( *this );
[47534159]601 } // if
602 output << ")";
603 }
[71f4e4f]604
[8688ce1]605 void CodeGenerator::visit( UntypedOffsetofExpr * offsetofExpr ) {
[8e9cbb2]606 assert( false && "UntypedOffsetofExpr should not reach code generation." );
[2a4b088]607 }
608
[8688ce1]609 void CodeGenerator::visit( OffsetofExpr * offsetofExpr ) {
[25a054f]610 // use GCC builtin
611 output << "__builtin_offsetof(";
612 output << genType( offsetofExpr->get_type(), "" );
[e551c69]613 output << ", " << mangleName( offsetofExpr->get_member() );
[25a054f]614 output << ")";
615 }
[d63eeb0]616
[8688ce1]617 void CodeGenerator::visit( OffsetPackExpr * offsetPackExpr ) {
[8e9cbb2]618 assert( false && "OffsetPackExpr should not reach code generation." );
[afc1045]619 }
[70a06f6]620
[8688ce1]621 void CodeGenerator::visit( LogicalExpr * logicalExpr ) {
[e04ef3a]622 extension( logicalExpr );
[6c4ff37]623 output << "(";
[51587aa]624 logicalExpr->get_arg1()->accept( *this );
625 if ( logicalExpr->get_isAnd() ) {
[6c4ff37]626 output << " && ";
[51587aa]627 } else {
[6c4ff37]628 output << " || ";
[51587aa]629 } // if
630 logicalExpr->get_arg2()->accept( *this );
[6c4ff37]631 output << ")";
[51587aa]632 }
[71f4e4f]633
[8688ce1]634 void CodeGenerator::visit( ConditionalExpr * conditionalExpr ) {
[e04ef3a]635 extension( conditionalExpr );
[6c4ff37]636 output << "(";
[51587aa]637 conditionalExpr->get_arg1()->accept( *this );
[6c4ff37]638 output << " ? ";
[51587aa]639 conditionalExpr->get_arg2()->accept( *this );
[6c4ff37]640 output << " : ";
[51587aa]641 conditionalExpr->get_arg3()->accept( *this );
[6c4ff37]642 output << ")";
[51587aa]643 }
[71f4e4f]644
[8688ce1]645 void CodeGenerator::visit( CommaExpr * commaExpr ) {
[e04ef3a]646 extension( commaExpr );
[6c4ff37]647 output << "(";
[51587aa]648 commaExpr->get_arg1()->accept( *this );
[6c4ff37]649 output << " , ";
[51587aa]650 commaExpr->get_arg2()->accept( *this );
[6c4ff37]651 output << ")";
[51587aa]652 }
[71f4e4f]653
[3c13c03]654 void CodeGenerator::visit( TupleExpr * tupleExpr ) { assert( false ); }
[71f4e4f]655
[8688ce1]656 void CodeGenerator::visit( TypeExpr * typeExpr ) {}
[2b6c1e0]657
[8688ce1]658 void CodeGenerator::visit( AsmExpr * asmExpr ) {
[7f5566b]659 if ( asmExpr->get_inout() ) {
660 output << "[ ";
661 asmExpr->get_inout()->accept( *this );
662 output << " ] ";
663 } // if
664 asmExpr->get_constraint()->accept( *this );
665 output << " ( ";
666 asmExpr->get_operand()->accept( *this );
667 output << " )";
668 }
669
[3c13c03]670 void CodeGenerator::visit( CompoundLiteralExpr *compLitExpr ) {
671 assert( compLitExpr->get_type() && dynamic_cast< ListInit * > ( compLitExpr->get_initializer() ) );
672 output << "(" << genType( compLitExpr->get_type(), "" ) << ")";
673 compLitExpr->get_initializer()->accept( *this );
674 }
675
[6eb8948]676 void CodeGenerator::visit( StmtExpr * stmtExpr ) {
[3c13c03]677 std::list< Statement * > & stmts = stmtExpr->get_statements()->get_kids();
678 output << "({" << std::endl;
679 cur_indent += CodeGenerator::tabsize;
680 unsigned int numStmts = stmts.size();
681 unsigned int i = 0;
682 for ( Statement * stmt : stmts ) {
683 output << indent << printLabels( stmt->get_labels() );
684 if ( i+1 == numStmts ) {
685 // last statement in a statement expression needs to be handled specially -
686 // cannot cast to void, otherwise the expression statement has no value
687 if ( ExprStmt * exprStmt = dynamic_cast< ExprStmt * >( stmt ) ) {
688 exprStmt->get_expr()->accept( *this );
689 output << ";" << endl;
690 ++i;
691 break;
692 }
693 }
694 stmt->accept( *this );
695 output << endl;
696 if ( wantSpacing( stmt ) ) {
697 output << endl;
698 } // if
699 ++i;
700 }
701 cur_indent -= CodeGenerator::tabsize;
702 output << indent << "})";
[6eb8948]703 }
704
[51587aa]705 //*** Statements
[8688ce1]706 void CodeGenerator::visit( CompoundStmt * compoundStmt ) {
[51587aa]707 std::list<Statement*> ks = compoundStmt->get_kids();
[2b6c1e0]708 output << "{" << endl;
[51587aa]709
[2b6c1e0]710 cur_indent += CodeGenerator::tabsize;
[51587aa]711
[7f5566b]712 for ( std::list<Statement *>::iterator i = ks.begin(); i != ks.end(); i++ ) {
[cda48b6]713 output << indent << printLabels( (*i)->get_labels() );
[7f5566b]714 (*i)->accept( *this );
[2b6c1e0]715
[6c4ff37]716 output << endl;
[2b6c1e0]717 if ( wantSpacing( *i ) ) {
718 output << endl;
[3778cb2]719 } // if
[8688ce1]720 } // for
[71f4e4f]721 cur_indent -= CodeGenerator::tabsize;
[51587aa]722
[cda48b6]723 output << indent << "}";
[51587aa]724 }
725
[8688ce1]726 void CodeGenerator::visit( ExprStmt * exprStmt ) {
[6c4ff37]727 assert( exprStmt );
[321a2481]728 // cast the top-level expression to void to reduce gcc warnings.
729 Expression * expr = new CastExpr( exprStmt->get_expr() );
730 expr->accept( *this );
731 output << ";";
[51587aa]732 }
733
[8688ce1]734 void CodeGenerator::visit( AsmStmt * asmStmt ) {
[7f5566b]735 output << "asm ";
736 if ( asmStmt->get_voltile() ) output << "volatile ";
737 if ( ! asmStmt->get_gotolabels().empty() ) output << "goto ";
738 output << "( ";
739 if ( asmStmt->get_instruction() ) asmStmt->get_instruction()->accept( *this );
740 output << " : ";
741 genCommaList( asmStmt->get_output().begin(), asmStmt->get_output().end() );
742 output << " : ";
743 genCommaList( asmStmt->get_input().begin(), asmStmt->get_input().end() );
744 output << " : ";
745 genCommaList( asmStmt->get_clobber().begin(), asmStmt->get_clobber().end() );
746 if ( ! asmStmt->get_gotolabels().empty() ) {
747 output << " : ";
748 for ( std::list<Label>::iterator begin = asmStmt->get_gotolabels().begin();; ) {
749 output << *begin++;
750 if ( begin == asmStmt->get_gotolabels().end() ) break;
751 output << ", ";
752 } // for
753 } // if
754 output << " );" ;
755 }
756
[8688ce1]757 void CodeGenerator::visit( IfStmt * ifStmt ) {
[7f5566b]758 output << "if ( ";
759 ifStmt->get_condition()->accept( *this );
760 output << " ) ";
[51587aa]761
[7f5566b]762 ifStmt->get_thenPart()->accept( *this );
[51587aa]763
764 if ( ifStmt->get_elsePart() != 0) {
[2b6c1e0]765 output << " else ";
[7f5566b]766 ifStmt->get_elsePart()->accept( *this );
[51587aa]767 } // if
768 }
769
[8688ce1]770 void CodeGenerator::visit( SwitchStmt * switchStmt ) {
[7f5566b]771 output << "switch ( " ;
772 switchStmt->get_condition()->accept( *this );
773 output << " ) ";
[71f4e4f]774
[2b6c1e0]775 output << "{" << std::endl;
[6c4ff37]776 cur_indent += CodeGenerator::tabsize;
[8688ce1]777 acceptAll( switchStmt->get_statements(), *this );
[6c4ff37]778 cur_indent -= CodeGenerator::tabsize;
[cda48b6]779 output << indent << "}";
[51587aa]780 }
781
[8688ce1]782 void CodeGenerator::visit( CaseStmt * caseStmt ) {
[cda48b6]783 output << indent;
[eb3261f]784 if ( caseStmt->isDefault()) {
[2b6c1e0]785 output << "default";
[eb3261f]786 } else {
[2b6c1e0]787 output << "case ";
[7f5566b]788 caseStmt->get_condition()->accept( *this );
[17cd4eb]789 } // if
[6c4ff37]790 output << ":\n";
[71f4e4f]791
[51587aa]792 std::list<Statement *> sts = caseStmt->get_statements();
793
[6c4ff37]794 cur_indent += CodeGenerator::tabsize;
[51587aa]795 for ( std::list<Statement *>::iterator i = sts.begin(); i != sts.end(); i++) {
[cda48b6]796 output << indent << printLabels( (*i)->get_labels() ) ;
[7f5566b]797 (*i)->accept( *this );
[6c4ff37]798 output << endl;
[3778cb2]799 } // for
[6c4ff37]800 cur_indent -= CodeGenerator::tabsize;
[51587aa]801 }
802
[8688ce1]803 void CodeGenerator::visit( BranchStmt * branchStmt ) {
[51587aa]804 switch ( branchStmt->get_type()) {
805 case BranchStmt::Goto:
806 if ( ! branchStmt->get_target().empty() )
[6c4ff37]807 output << "goto " << branchStmt->get_target();
[71f4e4f]808 else {
[51587aa]809 if ( branchStmt->get_computedTarget() != 0 ) {
[6c4ff37]810 output << "goto *";
[51587aa]811 branchStmt->get_computedTarget()->accept( *this );
812 } // if
813 } // if
814 break;
815 case BranchStmt::Break:
[6c4ff37]816 output << "break";
[51587aa]817 break;
818 case BranchStmt::Continue:
[6c4ff37]819 output << "continue";
[51587aa]820 break;
[3778cb2]821 } // switch
[2b6c1e0]822 output << ";";
[51587aa]823 }
824
825
[8688ce1]826 void CodeGenerator::visit( ReturnStmt * returnStmt ) {
[6c4ff37]827 output << "return ";
[4b2589a]828 maybeAccept( returnStmt->get_expr(), *this );
[6c4ff37]829 output << ";";
[51587aa]830 }
831
[8688ce1]832 void CodeGenerator::visit( WhileStmt * whileStmt ) {
[321a2481]833 if ( whileStmt->get_isDoWhile() ) {
[6c4ff37]834 output << "do" ;
[321a2481]835 } else {
[6c4ff37]836 output << "while (" ;
[7f5566b]837 whileStmt->get_condition()->accept( *this );
[6c4ff37]838 output << ")";
[51587aa]839 } // if
[2b6c1e0]840 output << " ";
[51587aa]841
[2b6c1e0]842 output << CodeGenerator::printLabels( whileStmt->get_body()->get_labels() );
[51587aa]843 whileStmt->get_body()->accept( *this );
844
[cda48b6]845 output << indent;
[51587aa]846
847 if ( whileStmt->get_isDoWhile() ) {
[6c4ff37]848 output << " while (" ;
[7f5566b]849 whileStmt->get_condition()->accept( *this );
[6c4ff37]850 output << ");";
[51587aa]851 } // if
852 }
853
[8688ce1]854 void CodeGenerator::visit( ForStmt * forStmt ) {
[8e9cbb2]855 // initialization is always hoisted, so don't bother doing anything with that
[145f1fc]856 output << "for (;";
[51587aa]857
[321a2481]858 if ( forStmt->get_condition() != 0 ) {
[51587aa]859 forStmt->get_condition()->accept( *this );
[3778cb2]860 } // if
[6c4ff37]861 output << ";";
[51587aa]862
[321a2481]863 if ( forStmt->get_increment() != 0 ) {
864 // cast the top-level expression to void to reduce gcc warnings.
865 Expression * expr = new CastExpr( forStmt->get_increment() );
866 expr->accept( *this );
[3778cb2]867 } // if
[2b6c1e0]868 output << ") ";
[51587aa]869
870 if ( forStmt->get_body() != 0 ) {
[2b6c1e0]871 output << CodeGenerator::printLabels( forStmt->get_body()->get_labels() );
[51587aa]872 forStmt->get_body()->accept( *this );
873 } // if
874 }
875
[8688ce1]876 void CodeGenerator::visit( NullStmt * nullStmt ) {
[cda48b6]877 //output << indent << CodeGenerator::printLabels( nullStmt->get_labels() );
[6c4ff37]878 output << "/* null statement */ ;";
[51587aa]879 }
880
[8688ce1]881 void CodeGenerator::visit( DeclStmt * declStmt ) {
[51587aa]882 declStmt->get_decl()->accept( *this );
[71f4e4f]883
[51587aa]884 if ( doSemicolon( declStmt->get_decl() ) ) {
[6c4ff37]885 output << ";";
[51587aa]886 } // if
887 }
888
[8688ce1]889 void CodeGenerator::handleStorageClass( Declaration * decl ) {
[51587aa]890 switch ( decl->get_storageClass() ) {
[68cd1ce]891 case DeclarationNode::Extern:
[6c4ff37]892 output << "extern ";
[51587aa]893 break;
[68cd1ce]894 case DeclarationNode::Static:
[6c4ff37]895 output << "static ";
[51587aa]896 break;
[68cd1ce]897 case DeclarationNode::Auto:
[51587aa]898 // silently drop storage class
899 break;
[68cd1ce]900 case DeclarationNode::Register:
[6c4ff37]901 output << "register ";
[51587aa]902 break;
[68cd1ce]903 case DeclarationNode::Inline:
[de62360d]904 output << "inline ";
[f38c8d9]905 break;
[68cd1ce]906 case DeclarationNode::Fortran:
907 output << "fortran ";
908 break;
909 case DeclarationNode::Noreturn:
910 output << "_Noreturn ";
911 break;
912 case DeclarationNode::Threadlocal:
913 output << "_Thread_local ";
914 break;
915 case DeclarationNode::NoStorageClass:
[f38c8d9]916 break;
[843054c2]917 } // switch
[51587aa]918 }
[51b73452]919} // namespace CodeGen
[51587aa]920
921// Local Variables: //
922// tab-width: 4 //
923// mode: c++ //
924// compile-command: "make install" //
925// End: //
Note: See TracBrowser for help on using the repository browser.