Context Navigation

CodeGenerator.cc@ 7528ba1

Visit:

ADT aaron-thesis arm-eh ast-experimental cleanup-dtors ctor deferred_resn demangler enum forall-pointer-decay gc_noraii 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 7528ba1 was d63eeb0, checked in by Rob Schluntz <rschlunt@…>, 10 years ago

Merge branch 'master' into ctor

Conflicts:

src/CodeGen/CodeGenerator.cc
src/GenPoly/Box.cc
src/Makefile.in
src/Parser/ParseNode.h
src/Parser/parser.cc
src/Parser/parser.yy
src/SymTab/Validate.cc
src/SynTree/Initializer.h
src/SynTree/ObjectDecl.cc
src/SynTree/Visitor.h
src/main.cc

Property mode set to 100644

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

Note: See TracBrowser for help on using the repository browser.

Context Navigation

source: src/CodeGen/CodeGenerator.cc@ 7528ba1

Download in other formats: