source: src/CodeGen/CodeGenerator.cc@ 1b0020a

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 1b0020a was 1b0020a, checked in by Rob Schluntz <rschlunt@…>, 9 years ago

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