source: src/CodeGen/CodeGenerator.cc@ 064e3ff

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 064e3ff was 064e3ff, checked in by Peter A. Buhr <pabuhr@…>, 9 years ago

add new type for ranges and refactor parser code
  • 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 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 } // if
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 } // if
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 case OT_CTOR:
422 case OT_DTOR:
423 if ( untypedExpr->get_args().size() == 1 ) {
424 // the expression fed into a single parameter constructor or destructor may contain side
425 // effects, so must still output this expression
426 output << "(";
427 (*arg++)->accept( *this );
428 output << ") /* " << opInfo.inputName << " */";
429 } else if ( untypedExpr->get_args().size() == 2 ) {
430 // intrinsic two parameter constructors are essentially bitwise assignment
431 output << "(";
432 (*arg++)->accept( *this );
433 output << opInfo.symbol;
434 (*arg)->accept( *this );
435 output << ") /* " << opInfo.inputName << " */";
436 } else {
437 // no constructors with 0 or more than 2 parameters
438 assert( false );
439 } // if
440 break;
441
442 case OT_PREFIX:
443 case OT_PREFIXASSIGN:
444 case OT_LABELADDRESS:
445 assert( untypedExpr->get_args().size() == 1 );
446 output << "(";
447 output << opInfo.symbol;
448 (*arg)->accept( *this );
449 output << ")";
450 break;
451
452 case OT_POSTFIX:
453 case OT_POSTFIXASSIGN:
454 assert( untypedExpr->get_args().size() == 1 );
455 (*arg)->accept( *this );
456 output << opInfo.symbol;
457 break;
458
459 case OT_INFIX:
460 case OT_INFIXASSIGN:
461 assert( untypedExpr->get_args().size() == 2 );
462 output << "(";
463 (*arg++)->accept( *this );
464 output << opInfo.symbol;
465 (*arg)->accept( *this );
466 output << ")";
467 break;
468
469 case OT_CONSTANT:
470 // there are no intrinsic definitions of 0 or 1 as functions
471 assert( false );
472 } // switch
473 } else {
474 if ( nameExpr->get_name() == "..." ) { // case V1 ... V2 or case V1~V2
475 assert( untypedExpr->get_args().size() == 2 );
476 (*untypedExpr->get_args().begin())->accept( *this );
477 output << " ... ";
478 (*--untypedExpr->get_args().end())->accept( *this );
479 } else { // builtin routines
480 nameExpr->accept( *this );
481 output << "(";
482 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
483 output << ")";
484 } // if
485 } // if
486 } else {
487 untypedExpr->get_function()->accept( *this );
488 output << "(";
489 genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
490 output << ")";
491 } // if
492 }
493
494 void CodeGenerator::visit( RangeExpr * rangeExpr ) {
495 rangeExpr->get_low()->accept( *this );
496 output << " ... ";
497 rangeExpr->get_high()->accept( *this );
498 }
499
500 void CodeGenerator::visit( NameExpr * nameExpr ) {
501 extension( nameExpr );
502 OperatorInfo opInfo;
503 if ( operatorLookup( nameExpr->get_name(), opInfo ) ) {
504 assert( opInfo.type == OT_CONSTANT );
505 output << opInfo.symbol;
506 } else {
507 output << nameExpr->get_name();
508 } // if
509 }
510
511 void CodeGenerator::visit( AddressExpr * addressExpr ) {
512 extension( addressExpr );
513 output << "(&";
514 // this hack makes sure that we don't convert "constant_zero" to "0" if we're taking its address
515 if ( VariableExpr * variableExpr = dynamic_cast< VariableExpr* >( addressExpr->get_arg() ) ) {
516 output << mangleName( variableExpr->get_var() );
517 } else {
518 addressExpr->get_arg()->accept( *this );
519 } // if
520 output << ")";
521 }
522
523 void CodeGenerator::visit( CastExpr * castExpr ) {
524 extension( castExpr );
525 output << "(";
526 if ( castExpr->get_results().empty() ) {
527 output << "(void)" ;
528 } else if ( ! castExpr->get_results().front()->get_isLvalue() ) {
529 // at least one result type of cast, but not an lvalue
530 output << "(";
531 output << genType( castExpr->get_results().front(), "" );
532 output << ")";
533 } else {
534 // otherwise, the cast is to an lvalue type, so the cast should be dropped, since the result of a cast is
535 // never an lvalue in C
536 } // if
537 castExpr->get_arg()->accept( *this );
538 output << ")";
539 }
540
541 void CodeGenerator::visit( UntypedMemberExpr * memberExpr ) {
542 assert( false );
543 }
544
545 void CodeGenerator::visit( MemberExpr * memberExpr ) {
546 extension( memberExpr );
547 memberExpr->get_aggregate()->accept( *this );
548 output << "." << mangleName( memberExpr->get_member() );
549 }
550
551 void CodeGenerator::visit( VariableExpr * variableExpr ) {
552 extension( variableExpr );
553 OperatorInfo opInfo;
554 if ( variableExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( variableExpr->get_var()->get_name(), opInfo ) && opInfo.type == OT_CONSTANT ) {
555 output << opInfo.symbol;
556 } else {
557 output << mangleName( variableExpr->get_var() );
558 } // if
559 }
560
561 void CodeGenerator::visit( ConstantExpr * constantExpr ) {
562 assert( constantExpr->get_constant() );
563 extension( constantExpr );
564 constantExpr->get_constant()->accept( *this );
565 }
566
567 void CodeGenerator::visit( SizeofExpr * sizeofExpr ) {
568 extension( sizeofExpr );
569 output << "sizeof(";
570 if ( sizeofExpr->get_isType() ) {
571 output << genType( sizeofExpr->get_type(), "" );
572 } else {
573 sizeofExpr->get_expr()->accept( *this );
574 } // if
575 output << ")";
576 }
577
578 void CodeGenerator::visit( AlignofExpr * alignofExpr ) {
579 // use GCC extension to avoid bumping std to C11
580 extension( alignofExpr );
581 output << "__alignof__(";
582 if ( alignofExpr->get_isType() ) {
583 output << genType( alignofExpr->get_type(), "" );
584 } else {
585 alignofExpr->get_expr()->accept( *this );
586 } // if
587 output << ")";
588 }
589
590 void CodeGenerator::visit( UntypedOffsetofExpr * offsetofExpr ) {
591 assert( false && "UntypedOffsetofExpr should not reach code generation." );
592 }
593
594 void CodeGenerator::visit( OffsetofExpr * offsetofExpr ) {
595 // use GCC builtin
596 output << "__builtin_offsetof(";
597 output << genType( offsetofExpr->get_type(), "" );
598 output << ", " << mangleName( offsetofExpr->get_member() );
599 output << ")";
600 }
601
602 void CodeGenerator::visit( OffsetPackExpr * offsetPackExpr ) {
603 assert( false && "OffsetPackExpr should not reach code generation." );
604 }
605
606 void CodeGenerator::visit( LogicalExpr * logicalExpr ) {
607 extension( logicalExpr );
608 output << "(";
609 logicalExpr->get_arg1()->accept( *this );
610 if ( logicalExpr->get_isAnd() ) {
611 output << " && ";
612 } else {
613 output << " || ";
614 } // if
615 logicalExpr->get_arg2()->accept( *this );
616 output << ")";
617 }
618
619 void CodeGenerator::visit( ConditionalExpr * conditionalExpr ) {
620 extension( conditionalExpr );
621 output << "(";
622 conditionalExpr->get_arg1()->accept( *this );
623 output << " ? ";
624 conditionalExpr->get_arg2()->accept( *this );
625 output << " : ";
626 conditionalExpr->get_arg3()->accept( *this );
627 output << ")";
628 }
629
630 void CodeGenerator::visit( CommaExpr * commaExpr ) {
631 extension( commaExpr );
632 output << "(";
633 commaExpr->get_arg1()->accept( *this );
634 output << " , ";
635 commaExpr->get_arg2()->accept( *this );
636 output << ")";
637 }
638
639 void CodeGenerator::visit( TupleExpr * tupleExpr ) {}
640
641 void CodeGenerator::visit( TypeExpr * typeExpr ) {}
642
643 void CodeGenerator::visit( AsmExpr * asmExpr ) {
644 if ( asmExpr->get_inout() ) {
645 output << "[ ";
646 asmExpr->get_inout()->accept( *this );
647 output << " ] ";
648 } // if
649 asmExpr->get_constraint()->accept( *this );
650 output << " ( ";
651 asmExpr->get_operand()->accept( *this );
652 output << " )";
653 }
654
655 //*** Statements
656 void CodeGenerator::visit( CompoundStmt * compoundStmt ) {
657 std::list<Statement*> ks = compoundStmt->get_kids();
658 output << "{" << endl;
659
660 cur_indent += CodeGenerator::tabsize;
661
662 for ( std::list<Statement *>::iterator i = ks.begin(); i != ks.end(); i++ ) {
663 output << indent << printLabels( (*i)->get_labels() );
664 (*i)->accept( *this );
665
666 output << endl;
667 if ( wantSpacing( *i ) ) {
668 output << endl;
669 } // if
670 } // for
671 cur_indent -= CodeGenerator::tabsize;
672
673 output << indent << "}";
674 }
675
676 void CodeGenerator::visit( ExprStmt * exprStmt ) {
677 assert( exprStmt );
678 // cast the top-level expression to void to reduce gcc warnings.
679 Expression * expr = new CastExpr( exprStmt->get_expr() );
680 expr->accept( *this );
681 output << ";";
682 }
683
684 void CodeGenerator::visit( AsmStmt * asmStmt ) {
685 output << "asm ";
686 if ( asmStmt->get_voltile() ) output << "volatile ";
687 if ( ! asmStmt->get_gotolabels().empty() ) output << "goto ";
688 output << "( ";
689 if ( asmStmt->get_instruction() ) asmStmt->get_instruction()->accept( *this );
690 output << " : ";
691 genCommaList( asmStmt->get_output().begin(), asmStmt->get_output().end() );
692 output << " : ";
693 genCommaList( asmStmt->get_input().begin(), asmStmt->get_input().end() );
694 output << " : ";
695 genCommaList( asmStmt->get_clobber().begin(), asmStmt->get_clobber().end() );
696 if ( ! asmStmt->get_gotolabels().empty() ) {
697 output << " : ";
698 for ( std::list<Label>::iterator begin = asmStmt->get_gotolabels().begin();; ) {
699 output << *begin++;
700 if ( begin == asmStmt->get_gotolabels().end() ) break;
701 output << ", ";
702 } // for
703 } // if
704 output << " );" ;
705 }
706
707 void CodeGenerator::visit( IfStmt * ifStmt ) {
708 output << "if ( ";
709 ifStmt->get_condition()->accept( *this );
710 output << " ) ";
711
712 ifStmt->get_thenPart()->accept( *this );
713
714 if ( ifStmt->get_elsePart() != 0) {
715 output << " else ";
716 ifStmt->get_elsePart()->accept( *this );
717 } // if
718 }
719
720 void CodeGenerator::visit( SwitchStmt * switchStmt ) {
721 output << "switch ( " ;
722 switchStmt->get_condition()->accept( *this );
723 output << " ) ";
724
725 output << "{" << std::endl;
726 cur_indent += CodeGenerator::tabsize;
727 acceptAll( switchStmt->get_statements(), *this );
728 cur_indent -= CodeGenerator::tabsize;
729 output << indent << "}";
730 }
731
732 void CodeGenerator::visit( CaseStmt * caseStmt ) {
733 output << indent;
734 if ( caseStmt->isDefault()) {
735 output << "default";
736 } else {
737 output << "case ";
738 caseStmt->get_condition()->accept( *this );
739 } // if
740 output << ":\n";
741
742 std::list<Statement *> sts = caseStmt->get_statements();
743
744 cur_indent += CodeGenerator::tabsize;
745 for ( std::list<Statement *>::iterator i = sts.begin(); i != sts.end(); i++) {
746 output << indent << printLabels( (*i)->get_labels() ) ;
747 (*i)->accept( *this );
748 output << endl;
749 } // for
750 cur_indent -= CodeGenerator::tabsize;
751 }
752
753 void CodeGenerator::visit( BranchStmt * branchStmt ) {
754 switch ( branchStmt->get_type()) {
755 case BranchStmt::Goto:
756 if ( ! branchStmt->get_target().empty() )
757 output << "goto " << branchStmt->get_target();
758 else {
759 if ( branchStmt->get_computedTarget() != 0 ) {
760 output << "goto *";
761 branchStmt->get_computedTarget()->accept( *this );
762 } // if
763 } // if
764 break;
765 case BranchStmt::Break:
766 output << "break";
767 break;
768 case BranchStmt::Continue:
769 output << "continue";
770 break;
771 } // switch
772 output << ";";
773 }
774
775
776 void CodeGenerator::visit( ReturnStmt * returnStmt ) {
777 output << "return ";
778 maybeAccept( returnStmt->get_expr(), *this );
779 output << ";";
780 }
781
782 void CodeGenerator::visit( WhileStmt * whileStmt ) {
783 if ( whileStmt->get_isDoWhile() ) {
784 output << "do" ;
785 } else {
786 output << "while (" ;
787 whileStmt->get_condition()->accept( *this );
788 output << ")";
789 } // if
790 output << " ";
791
792 output << CodeGenerator::printLabels( whileStmt->get_body()->get_labels() );
793 whileStmt->get_body()->accept( *this );
794
795 output << indent;
796
797 if ( whileStmt->get_isDoWhile() ) {
798 output << " while (" ;
799 whileStmt->get_condition()->accept( *this );
800 output << ");";
801 } // if
802 }
803
804 void CodeGenerator::visit( ForStmt * forStmt ) {
805 // initialization is always hoisted, so don't bother doing anything with that
806 output << "for (;";
807
808 if ( forStmt->get_condition() != 0 ) {
809 forStmt->get_condition()->accept( *this );
810 } // if
811 output << ";";
812
813 if ( forStmt->get_increment() != 0 ) {
814 // cast the top-level expression to void to reduce gcc warnings.
815 Expression * expr = new CastExpr( forStmt->get_increment() );
816 expr->accept( *this );
817 } // if
818 output << ") ";
819
820 if ( forStmt->get_body() != 0 ) {
821 output << CodeGenerator::printLabels( forStmt->get_body()->get_labels() );
822 forStmt->get_body()->accept( *this );
823 } // if
824 }
825
826 void CodeGenerator::visit( NullStmt * nullStmt ) {
827 //output << indent << CodeGenerator::printLabels( nullStmt->get_labels() );
828 output << "/* null statement */ ;";
829 }
830
831 void CodeGenerator::visit( DeclStmt * declStmt ) {
832 declStmt->get_decl()->accept( *this );
833
834 if ( doSemicolon( declStmt->get_decl() ) ) {
835 output << ";";
836 } // if
837 }
838
839 void CodeGenerator::handleStorageClass( Declaration * decl ) {
840 switch ( decl->get_storageClass() ) {
841 case DeclarationNode::Extern:
842 output << "extern ";
843 break;
844 case DeclarationNode::Static:
845 output << "static ";
846 break;
847 case DeclarationNode::Auto:
848 // silently drop storage class
849 break;
850 case DeclarationNode::Register:
851 output << "register ";
852 break;
853 case DeclarationNode::Inline:
854 output << "inline ";
855 break;
856 case DeclarationNode::Fortran:
857 output << "fortran ";
858 break;
859 case DeclarationNode::Noreturn:
860 output << "_Noreturn ";
861 break;
862 case DeclarationNode::Threadlocal:
863 output << "_Thread_local ";
864 break;
865 case DeclarationNode::NoStorageClass:
866 break;
867 } // switch
868 }
869} // namespace CodeGen
870
871// Local Variables: //
872// tab-width: 4 //
873// mode: c++ //
874// compile-command: "make install" //
875// End: //
Note: See TracBrowser for help on using the repository browser.