Context Navigation

source: src/CodeGen/CodeGenerator.cc @ e551c69

ADTaaron-thesisarm-ehast-experimentalcleanup-dtorsctordeferred_resndemanglerenumforall-pointer-decaygc_noraiijacob/cs343-translationjenkins-sandboxmemorynew-astnew-ast-unique-exprnew-envno_listpersistent-indexerpthread-emulationqualifiedEnumresolv-newstringwith_gc

Last change on this file since e551c69 was e551c69, checked in by Aaron Moss <a3moss@…>, 8 years ago
Fix code generation for offsetofexpr
Property mode set to `100644`
File size: 20.5 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 : Thu Sep 17 15:24:08 2015
13	// Update Count : 231
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 "utility.h"
29	#include "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
261	assert( false );
262	break;
263
264	case OT_PREFIX:
265	case OT_PREFIXASSIGN:
266	assert( applicationExpr->get_args().size() == 1 );
267	output << "(";
268	output << opInfo.symbol;
269	(arg)->accept( this );
270	output << ")";
271	break;
272
273	case OT_POSTFIX:
274	case OT_POSTFIXASSIGN:
275	assert( applicationExpr->get_args().size() == 1 );
276	(arg)->accept( this );
277	output << opInfo.symbol;
278	break;
279
280	case OT_INFIX:
281	case OT_INFIXASSIGN:
282	assert( applicationExpr->get_args().size() == 2 );
283	output << "(";
284	(arg++)->accept( this );
285	output << opInfo.symbol;
286	(arg)->accept( this );
287	output << ")";
288	break;
289
290	case OT_CONSTANT:
291	case OT_LABELADDRESS:
292	// there are no intrinsic definitions of 0/1 or label addresses as functions
293	assert( false );
294	}
295	} else {
296	varExpr->accept( *this );
297	output << "(";
298	genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() );
299	output << ")";
300	} // if
301	} else {
302	applicationExpr->get_function()->accept( *this );
303	output << "(";
304	genCommaList( applicationExpr->get_args().begin(), applicationExpr->get_args().end() );
305	output << ")";
306	} // if
307	}
308
309	void CodeGenerator::visit( UntypedExpr *untypedExpr ) {
310	if ( NameExpr nameExpr = dynamic_cast< NameExpr >( untypedExpr->get_function() ) ) {
311	OperatorInfo opInfo;
312	if ( operatorLookup( nameExpr->get_name(), opInfo ) ) {
313	std::list< Expression* >::iterator arg = untypedExpr->get_args().begin();
314	switch ( opInfo.type ) {
315	case OT_INDEX:
316	assert( untypedExpr->get_args().size() == 2 );
317	(arg++)->accept( this );
318	output << "[";
319	(arg)->accept( this );
320	output << "]";
321	break;
322
323	case OT_CALL:
324	assert( false );
325	break;
326
327	case OT_PREFIX:
328	case OT_PREFIXASSIGN:
329	case OT_LABELADDRESS:
330	assert( untypedExpr->get_args().size() == 1 );
331	output << "(";
332	output << opInfo.symbol;
333	(arg)->accept( this );
334	output << ")";
335	break;
336
337	case OT_POSTFIX:
338	case OT_POSTFIXASSIGN:
339	assert( untypedExpr->get_args().size() == 1 );
340	(arg)->accept( this );
341	output << opInfo.symbol;
342	break;
343
344	case OT_INFIX:
345	case OT_INFIXASSIGN:
346	assert( untypedExpr->get_args().size() == 2 );
347	output << "(";
348	(arg++)->accept( this );
349	output << opInfo.symbol;
350	(arg)->accept( this );
351	output << ")";
352	break;
353
354	case OT_CONSTANT:
355	// there are no intrinsic definitions of 0 or 1 as functions
356	assert( false );
357	}
358	} else {
359	nameExpr->accept( *this );
360	output << "(";
361	genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
362	output << ")";
363	} // if
364	} else {
365	untypedExpr->get_function()->accept( *this );
366	output << "(";
367	genCommaList( untypedExpr->get_args().begin(), untypedExpr->get_args().end() );
368	output << ")";
369	} // if
370	}
371
372	void CodeGenerator::visit( NameExpr *nameExpr ) {
373	OperatorInfo opInfo;
374	if ( operatorLookup( nameExpr->get_name(), opInfo ) ) {
375	assert( opInfo.type == OT_CONSTANT );
376	output << opInfo.symbol;
377	} else {
378	output << nameExpr->get_name();
379	} // if
380	}
381
382	void CodeGenerator::visit( AddressExpr *addressExpr ) {
383	output << "(&";
384	// this hack makes sure that we don't convert "constant_zero" to "0" if we're taking its address
385	if ( VariableExpr variableExpr = dynamic_cast< VariableExpr >( addressExpr->get_arg() ) ) {
386	output << mangleName( variableExpr->get_var() );
387	} else {
388	addressExpr->get_arg()->accept( *this );
389	} // if
390	output << ")";
391	}
392
393	void CodeGenerator::visit( CastExpr *castExpr ) {
394	// if the cast is to an lvalue type, then the cast
395	// should be dropped, since the result of a cast is
396	// never an lvalue in C
397	if ( castExpr->get_results().front()->get_isLvalue() ) {
398	castExpr->get_arg()->accept( *this );
399	} else {
400	output << "((";
401	if ( castExpr->get_results().empty() ) {
402	output << "void" ;
403	} else {
404	output << genType( castExpr->get_results().front(), "" );
405	} // if
406	output << ")";
407	castExpr->get_arg()->accept( *this );
408	output << ")";
409	}
410	}
411
412	void CodeGenerator::visit( UntypedMemberExpr *memberExpr ) {
413	assert( false );
414	}
415
416	void CodeGenerator::visit( MemberExpr *memberExpr ) {
417	memberExpr->get_aggregate()->accept( *this );
418	output << "." << mangleName( memberExpr->get_member() );
419	}
420
421	void CodeGenerator::visit( VariableExpr *variableExpr ) {
422	OperatorInfo opInfo;
423	if ( variableExpr->get_var()->get_linkage() == LinkageSpec::Intrinsic && operatorLookup( variableExpr->get_var()->get_name(), opInfo ) && opInfo.type == OT_CONSTANT ) {
424	output << opInfo.symbol;
425	} else {
426	output << mangleName( variableExpr->get_var() );
427	} // if
428	}
429
430	void CodeGenerator::visit( ConstantExpr *constantExpr ) {
431	assert( constantExpr->get_constant() );
432	constantExpr->get_constant()->accept( *this );
433	}
434
435	void CodeGenerator::visit( SizeofExpr *sizeofExpr ) {
436	output << "sizeof(";
437	if ( sizeofExpr->get_isType() ) {
438	output << genType( sizeofExpr->get_type(), "" );
439	} else {
440	sizeofExpr->get_expr()->accept( *this );
441	} // if
442	output << ")";
443	}
444
445	void CodeGenerator::visit( AlignofExpr *alignofExpr ) {
446	// use GCC extension to avoid bumping std to C11
447	output << "__alignof__(";
448	if ( alignofExpr->get_isType() ) {
449	output << genType( alignofExpr->get_type(), "" );
450	} else {
451	alignofExpr->get_expr()->accept( *this );
452	} // if
453	output << ")";
454	}
455
456	void CodeGenerator::visit( OffsetofExpr *offsetofExpr ) {
457	// use GCC builtin
458	output << "__builtin_offsetof(";
459	output << genType( offsetofExpr->get_type(), "" );
460	output << ", " << mangleName( offsetofExpr->get_member() );
461	output << ")";
462	}
463
464	void CodeGenerator::visit( LogicalExpr *logicalExpr ) {
465	output << "(";
466	logicalExpr->get_arg1()->accept( *this );
467	if ( logicalExpr->get_isAnd() ) {
468	output << " && ";
469	} else {
470	output << " \|\| ";
471	} // if
472	logicalExpr->get_arg2()->accept( *this );
473	output << ")";
474	}
475
476	void CodeGenerator::visit( ConditionalExpr *conditionalExpr ) {
477	output << "(";
478	conditionalExpr->get_arg1()->accept( *this );
479	output << " ? ";
480	conditionalExpr->get_arg2()->accept( *this );
481	output << " : ";
482	conditionalExpr->get_arg3()->accept( *this );
483	output << ")";
484	}
485
486	void CodeGenerator::visit( CommaExpr *commaExpr ) {
487	output << "(";
488	commaExpr->get_arg1()->accept( *this );
489	output << " , ";
490	commaExpr->get_arg2()->accept( *this );
491	output << ")";
492	}
493
494	void CodeGenerator::visit( TupleExpr *tupleExpr ) {}
495
496	void CodeGenerator::visit( TypeExpr *typeExpr ) {}
497
498	void CodeGenerator::visit( AsmExpr *asmExpr ) {
499	if ( asmExpr->get_inout() ) {
500	output << "[ ";
501	asmExpr->get_inout()->accept( *this );
502	output << " ] ";
503	} // if
504	asmExpr->get_constraint()->accept( *this );
505	output << " ( ";
506	asmExpr->get_operand()->accept( *this );
507	output << " )";
508	}
509
510	//*** Statements
511	void CodeGenerator::visit( CompoundStmt *compoundStmt ) {
512	std::list<Statement*> ks = compoundStmt->get_kids();
513	output << "{" << endl;
514
515	cur_indent += CodeGenerator::tabsize;
516
517	for ( std::list<Statement *>::iterator i = ks.begin(); i != ks.end(); i++ ) {
518	output << indent << printLabels( (*i)->get_labels() );
519	(i)->accept( this );
520
521	output << endl;
522	if ( wantSpacing( *i ) ) {
523	output << endl;
524	}
525	}
526	cur_indent -= CodeGenerator::tabsize;
527
528	output << indent << "}";
529	}
530
531	void CodeGenerator::visit( ExprStmt *exprStmt ) {
532	// I don't see why this check is necessary.
533	// If this starts to cause problems then put it back in,
534	// with an explanation
535	assert( exprStmt );
536
537	// if ( exprStmt != 0 ) {
538	exprStmt->get_expr()->accept( *this );
539	output << ";" ;
540	// } // if
541	}
542
543	void CodeGenerator::visit( AsmStmt *asmStmt ) {
544	output << "asm ";
545	if ( asmStmt->get_voltile() ) output << "volatile ";
546	if ( ! asmStmt->get_gotolabels().empty() ) output << "goto ";
547	output << "( ";
548	if ( asmStmt->get_instruction() ) asmStmt->get_instruction()->accept( *this );
549	output << " : ";
550	genCommaList( asmStmt->get_output().begin(), asmStmt->get_output().end() );
551	output << " : ";
552	genCommaList( asmStmt->get_input().begin(), asmStmt->get_input().end() );
553	output << " : ";
554	genCommaList( asmStmt->get_clobber().begin(), asmStmt->get_clobber().end() );
555	if ( ! asmStmt->get_gotolabels().empty() ) {
556	output << " : ";
557	for ( std::list<Label>::iterator begin = asmStmt->get_gotolabels().begin();; ) {
558	output << *begin++;
559	if ( begin == asmStmt->get_gotolabels().end() ) break;
560	output << ", ";
561	} // for
562	} // if
563	output << " );" ;
564	}
565
566	void CodeGenerator::visit( IfStmt *ifStmt ) {
567	output << "if ( ";
568	ifStmt->get_condition()->accept( *this );
569	output << " ) ";
570
571	ifStmt->get_thenPart()->accept( *this );
572
573	if ( ifStmt->get_elsePart() != 0) {
574	output << " else ";
575	ifStmt->get_elsePart()->accept( *this );
576	} // if
577	}
578
579	void CodeGenerator::visit( SwitchStmt *switchStmt ) {
580	output << "switch ( " ;
581	switchStmt->get_condition()->accept( *this );
582	output << " ) ";
583
584	output << "{" << std::endl;
585	cur_indent += CodeGenerator::tabsize;
586
587	acceptAll( switchStmt->get_branches(), *this );
588
589	cur_indent -= CodeGenerator::tabsize;
590
591	output << indent << "}";
592	}
593
594	void CodeGenerator::visit( CaseStmt *caseStmt ) {
595	output << indent;
596	if ( caseStmt->isDefault()) {
597	output << "default";
598	} else {
599	output << "case ";
600	caseStmt->get_condition()->accept( *this );
601	} // if
602	output << ":\n";
603
604	std::list<Statement *> sts = caseStmt->get_statements();
605
606	cur_indent += CodeGenerator::tabsize;
607	for ( std::list<Statement *>::iterator i = sts.begin(); i != sts.end(); i++) {
608	output << indent << printLabels( (*i)->get_labels() ) ;
609	(i)->accept( this );
610	output << endl;
611	}
612	cur_indent -= CodeGenerator::tabsize;
613	}
614
615	void CodeGenerator::visit( BranchStmt *branchStmt ) {
616	switch ( branchStmt->get_type()) {
617	case BranchStmt::Goto:
618	if ( ! branchStmt->get_target().empty() )
619	output << "goto " << branchStmt->get_target();
620	else {
621	if ( branchStmt->get_computedTarget() != 0 ) {
622	output << "goto *";
623	branchStmt->get_computedTarget()->accept( *this );
624	} // if
625	} // if
626	break;
627	case BranchStmt::Break:
628	output << "break";
629	break;
630	case BranchStmt::Continue:
631	output << "continue";
632	break;
633	}
634	output << ";";
635	}
636
637
638	void CodeGenerator::visit( ReturnStmt *returnStmt ) {
639	output << "return ";
640
641	// xxx -- check for null expression;
642	if ( returnStmt->get_expr() ) {
643	returnStmt->get_expr()->accept( *this );
644	} // if
645	output << ";";
646	}
647
648	void CodeGenerator::visit( WhileStmt *whileStmt ) {
649	if ( whileStmt->get_isDoWhile() )
650	output << "do" ;
651	else {
652	output << "while (" ;
653	whileStmt->get_condition()->accept( *this );
654	output << ")";
655	} // if
656	output << " ";
657
658	output << CodeGenerator::printLabels( whileStmt->get_body()->get_labels() );
659	whileStmt->get_body()->accept( *this );
660
661	output << indent;
662
663	if ( whileStmt->get_isDoWhile() ) {
664	output << " while (" ;
665	whileStmt->get_condition()->accept( *this );
666	output << ");";
667	} // if
668	}
669
670	void CodeGenerator::visit( ForStmt *forStmt ) {
671	// initialization is always hoisted, so don't
672	// bother doing anything with that
673	output << "for (;";
674
675	if ( forStmt->get_condition() != 0 )
676	forStmt->get_condition()->accept( *this );
677	output << ";";
678
679	if ( forStmt->get_increment() != 0 )
680	forStmt->get_increment()->accept( *this );
681	output << ") ";
682
683	if ( forStmt->get_body() != 0 ) {
684	output << CodeGenerator::printLabels( forStmt->get_body()->get_labels() );
685	forStmt->get_body()->accept( *this );
686	} // if
687	}
688
689	void CodeGenerator::visit( NullStmt *nullStmt ) {
690	//output << indent << CodeGenerator::printLabels( nullStmt->get_labels() );
691	output << "/* null statement */ ;";
692	}
693
694	void CodeGenerator::visit( DeclStmt *declStmt ) {
695	declStmt->get_decl()->accept( *this );
696
697	if ( doSemicolon( declStmt->get_decl() ) ) {
698	output << ";";
699	} // if
700	}
701
702	std::string CodeGenerator::printLabels( std::list< Label > &l ) {
703	std::string str( "" );
704	l.unique(); // assumes a sorted list. Why not use set?
705
706	for ( std::list< Label >::iterator i = l.begin(); i != l.end(); i++ )
707	str += *i + ": ";
708
709	return str;
710	}
711
712	void CodeGenerator::handleStorageClass( Declaration *decl ) {
713	switch ( decl->get_storageClass() ) {
714	case DeclarationNode::Extern:
715	output << "extern ";
716	break;
717	case DeclarationNode::Static:
718	output << "static ";
719	break;
720	case DeclarationNode::Auto:
721	// silently drop storage class
722	break;
723	case DeclarationNode::Register:
724	output << "register ";
725	break;
726	case DeclarationNode::Inline:
727	output << "inline ";
728	break;
729	case DeclarationNode::Fortran:
730	output << "fortran ";
731	break;
732	case DeclarationNode::Noreturn:
733	output << "_Noreturn ";
734	break;
735	case DeclarationNode::Threadlocal:
736	output << "_Thread_local ";
737	break;
738	case DeclarationNode::NoStorageClass:
739	break;
740	} // switch
741	}
742	} // namespace CodeGen
743
744	// Local Variables: //
745	// tab-width: 4 //
746	// mode: c++ //
747	// compile-command: "make install" //
748	// End: //

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

Download in other formats: