source: src/CodeGen/CodeGenerator.cc@ 3778cb2

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay jacob/cs343-translation jenkins-sandbox memory 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 3778cb2 was 3778cb2, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago

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