source: src/Parser/StatementNode.cc@ e0ff3e6

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 string with_gc
Last change on this file since e0ff3e6 was 59db689, checked in by Peter A. Buhr <pabuhr@…>, 10 years ago

constant types, first attempt
  • Property mode set to 100644
File size: 10.7 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// StatementNode.cc --
8//
9// Author : Rodolfo G. Esteves
10// Created On : Sat May 16 14:59:41 2015
11// Last Modified By : Peter A. Buhr
12// Last Modified On : Sat Jun 6 23:25:41 2015
13// Update Count : 19
14//
15
16#include <list>
17#include <algorithm>
18#include <cassert>
19
20#include "ParseNode.h"
21#include "SynTree/Statement.h"
22#include "SynTree/Expression.h"
23#include "parseutility.h"
24#include "utility.h"
25
26using namespace std;
27
28const char *StatementNode::StType[] = {
29 "Exp", "If", "Switch", "Case", "Default", "Choose", "Fallthru",
30 "While", "Do", "For",
31 "Goto", "Continue", "Break", "Return", "Throw",
32 "Try", "Catch", "Finally", "Asm",
33 "Decl"
34};
35
36StatementNode::StatementNode() : ParseNode(), control( 0 ), block( 0 ), labels( 0 ), target( 0 ), decl( 0 ), isCatchRest ( false ) {}
37
38StatementNode::StatementNode( const string *name_ ) : ParseNode( name_ ), control( 0 ), block( 0 ), labels( 0 ), target( 0 ), decl( 0 ), isCatchRest ( false ) {}
39
40StatementNode::StatementNode( DeclarationNode *decl ) : type( Decl ), control( 0 ), block( 0 ), labels( 0 ), target( 0 ), isCatchRest ( false ) {
41 if ( decl ) {
42 if ( DeclarationNode *agg = decl->extractAggregate() ) {
43 this->decl = agg;
44 StatementNode *nextStmt = new StatementNode;
45 nextStmt->type = Decl;
46 nextStmt->decl = decl;
47 next = nextStmt;
48 if ( decl->get_link() ) {
49 next->set_next( new StatementNode( dynamic_cast< DeclarationNode* >( decl->get_link() ) ) );
50 decl->set_next( 0 );
51 } // if
52 } else {
53 if ( decl->get_link() ) {
54 next = new StatementNode( dynamic_cast< DeclarationNode* >( decl->get_link() ) );
55 decl->set_next( 0 );
56 } // if
57 this->decl = decl;
58 } // if
59 } // if
60}
61
62StatementNode::StatementNode( Type t, ExpressionNode *ctrl_label, StatementNode *block_ ) :
63 type( t ), control( ctrl_label ), block( block_), labels( 0 ), target( 0 ), decl( 0 ), isCatchRest ( false ) {
64 if ( t == Default )
65 control = 0;
66}
67
68StatementNode::StatementNode( Type t, string *_target ) :
69 type( t ), control( 0 ), block( 0 ), labels( 0 ), target(_target ), decl( 0 ), isCatchRest ( false ) {}
70
71StatementNode::~StatementNode() {
72 delete control;
73 delete block;
74 delete labels;
75 delete target;
76 delete decl;
77}
78
79StatementNode * StatementNode::newCatchStmt( DeclarationNode *d, StatementNode *s, bool catchRestP ) {
80 StatementNode *ret = new StatementNode( StatementNode::Catch, 0, s );
81 ret->addDeclaration( d );
82 ret->setCatchRest( catchRestP );
83
84 return ret;
85}
86
87std::string StatementNode::get_target() const{
88 if ( target )
89 return *target;
90
91 return string("");
92}
93
94StatementNode * StatementNode::clone() const {
95 StatementNode *newnode = new StatementNode( type, maybeClone( control ), maybeClone( block ) );
96 if ( target ) {
97 newnode->target = new string( *target );
98 } else {
99 newnode->target = 0;
100 } // if
101 newnode->decl = maybeClone( decl );
102 return newnode;
103}
104
105void StatementNode::set_control( ExpressionNode *c ) {
106 control = c;
107}
108
109StatementNode * StatementNode::set_block( StatementNode *b ) {
110 block = b;
111
112 return this;
113}
114
115ExpressionNode *StatementNode::get_control() const {
116 return control;
117}
118
119StatementNode *StatementNode::get_block() const {
120 return block;
121}
122
123StatementNode::Type StatementNode::get_type() const {
124 return type;
125}
126
127StatementNode *StatementNode::add_label( const std::string *l ) {
128 if ( l != 0 ) {
129 if ( labels == 0 )
130 labels = new std::list<std::string>();
131
132 labels->push_front(*l );
133 delete l;
134 } // if
135 return this;
136}
137
138std::list<std::string> *StatementNode::get_labels() const { return labels; }
139
140StatementNode *StatementNode::add_controlexp( ExpressionNode *e ) {
141 if ( control && e )
142 control->add_to_list( e ); // xxx - check this
143
144 return this;
145}
146
147StatementNode *StatementNode::append_block( StatementNode *stmt ) {
148 if ( stmt != 0 ) {
149 if ( block == 0 )
150 block = stmt;
151 else
152 block->set_link( stmt );
153 } // if
154 return this;
155}
156
157StatementNode *StatementNode::append_last_case( StatementNode *stmt ) {
158 if ( stmt != 0 ) {
159 StatementNode *next = ( StatementNode *)get_link();
160 if ( next && ( next->get_type() == StatementNode::Case || next->get_type() == StatementNode::Default ) )
161 next->append_last_case ( stmt );
162 else
163 if ( block == 0 )
164 block = stmt;
165 else
166 block->set_link( stmt );
167 } // if
168 return this;
169}
170
171void StatementNode::print( std::ostream &os, int indent ) const {
172 if ( labels != 0 ) {
173 if ( ! labels->empty()) {
174 std::list<std::string>::const_iterator i;
175
176 os << string( indent, ' ' );
177 for ( i = labels->begin(); i != labels->end(); i++ )
178 os << *i << ":";
179 os << endl;
180 } // if
181 } // if
182
183 switch ( type ) {
184 case Decl:
185 decl->print( os, indent );
186 break;
187 case Exp:
188 if ( control ) {
189 os << string( indent, ' ' );
190 control->print( os, indent );
191 os << endl;
192 } else
193 os << string( indent, ' ' ) << "Null Statement" << endl;
194 break;
195 default:
196 os << string( indent, ' ' ) << StatementNode::StType[type] << endl;
197 if ( type == Catch ) {
198 if ( decl ) {
199 os << string( indent + ParseNode::indent_by, ' ' ) << "Declaration: " << endl;
200 decl->print( os, indent + 2*ParseNode::indent_by );
201 } else if ( isCatchRest ) {
202 os << string( indent + ParseNode::indent_by, ' ' ) << "Catches the rest " << endl;
203 } else {
204 ; // should never reach here
205 } // if
206 } // if
207 if ( control ) {
208 os << string( indent + ParseNode::indent_by, ' ' ) << "Expression: " << endl;
209 control->printList( os, indent + 2*ParseNode::indent_by );
210 } // if
211 if ( block ) {
212 os << string( indent + ParseNode::indent_by, ' ' ) << "Branches of execution: " << endl;
213 block->printList( os, indent + 2*ParseNode::indent_by );
214 } // if
215 if ( target ) {
216 os << string( indent + ParseNode::indent_by, ' ' ) << "Target: " << get_target() << endl;
217 } // if
218 break;
219 } // switch
220}
221
222Statement *StatementNode::build() const {
223 std::list<Statement *> branches;
224 std::list<Expression *> exps;
225 std::list<Label> labs;
226
227 if ( labels != 0 ) {
228 std::back_insert_iterator< std::list<Label> > lab_it( labs );
229 copy( labels->begin(), labels->end(), lab_it );
230 } // if
231
232 // try {
233 buildList<Statement, StatementNode>( get_block(), branches );
234
235 switch ( type ) {
236 case Decl:
237 return new DeclStmt( labs, maybeBuild< Declaration >( decl ) );
238 case Exp:
239 {
240 Expression *e = maybeBuild< Expression >( get_control() );
241
242 if ( e )
243 return new ExprStmt( labs, e );
244 else
245 return new NullStmt( labs );
246 }
247 case If:
248 {
249 Statement *thenb = 0, *elseb = 0;
250 assert( branches.size() >= 1 );
251
252 thenb = branches.front();
253 branches.pop_front();
254 if ( ! branches.empty() ) {
255 elseb = branches.front();
256 branches.pop_front();
257 } // if
258 return new IfStmt( labs, notZeroExpr( get_control()->build() ), thenb, elseb );
259 }
260 case While:
261 assert( branches.size() == 1 );
262 return new WhileStmt( labs, notZeroExpr( get_control()->build() ), branches.front() );
263 case Do:
264 assert( branches.size() == 1 );
265 return new WhileStmt( labs, notZeroExpr( get_control()->build() ), branches.front(), true );
266 case For:
267 {
268 assert( branches.size() == 1 );
269
270 ForCtlExprNode *ctl = dynamic_cast<ForCtlExprNode *>( get_control() );
271 assert( ctl != 0 );
272
273 Statement *stmt = 0;
274 if ( ctl->get_init() != 0 )
275 stmt = ctl->get_init()->build();
276
277 Expression *cond = 0;
278 if ( ctl->get_condition() != 0 )
279 cond = notZeroExpr( ctl->get_condition()->build() );
280
281 Expression *incr = 0;
282 if ( ctl->get_change() != 0 )
283 incr = ctl->get_change()->build();
284
285 return new ForStmt( labs, stmt, cond, incr, branches.front() );
286 }
287 case Switch:
288 return new SwitchStmt( labs, get_control()->build(), branches );
289 case Choose:
290 return new ChooseStmt( labs, get_control()->build(), branches );
291 case Fallthru:
292 return new FallthruStmt( labs );
293 case Case:
294 return new CaseStmt( labs, get_control()->build(), branches );
295 case Default:
296 return new CaseStmt( labs, 0, branches, true );
297 case Goto:
298 {
299 if ( get_target() == "" ) { // computed goto
300 assert( get_control() != 0 );
301 return new BranchStmt( labs, get_control()->build(), BranchStmt::Goto );
302 } // if
303
304 return new BranchStmt( labs, get_target(), BranchStmt::Goto );
305 }
306 case Break:
307 return new BranchStmt( labs, get_target(), BranchStmt::Break );
308 case Continue:
309 return new BranchStmt( labs, get_target(), BranchStmt::Continue );
310 case Return:
311 case Throw :
312 buildList( get_control(), exps );
313 if ( exps.size() ==0 )
314 return new ReturnStmt( labs, 0, type == Throw );
315 if ( exps.size() > 0 )
316 return new ReturnStmt( labs, exps.back(), type == Throw );
317 case Try:
318 {
319 assert( branches.size() >= 0 );
320 CompoundStmt *tryBlock = dynamic_cast<CompoundStmt *>( branches.front());
321 branches.pop_front();
322 FinallyStmt *finallyBlock = 0;
323 if ( ( finallyBlock = dynamic_cast<FinallyStmt *>( branches.back())) ) {
324 branches.pop_back();
325 } // if
326 return new TryStmt( labs, tryBlock, branches, finallyBlock );
327 }
328 case Catch:
329 {
330 assert( branches.size() == 1 );
331
332 return new CatchStmt( labs, maybeBuild< Declaration >( decl ), branches.front(), isCatchRest );
333 }
334 case Finally:
335 {
336 assert( branches.size() == 1 );
337 CompoundStmt *block = dynamic_cast<CompoundStmt *>( branches.front() );
338 assert( block != 0 );
339
340 return new FinallyStmt( labs, block );
341 }
342 default:
343 // shouldn't be here
344 return 0;
345 } // switch
346}
347
348CompoundStmtNode::CompoundStmtNode() : first( 0 ), last( 0 ) {}
349
350CompoundStmtNode::CompoundStmtNode( const string *name_ ) : StatementNode( name_ ), first( 0 ), last( 0 ) {}
351
352CompoundStmtNode::CompoundStmtNode( StatementNode *stmt ) : first( stmt ) {
353 if ( first ) {
354 last = ( StatementNode *)( stmt->get_last());
355 } else {
356 last = 0;
357 } // if
358}
359
360CompoundStmtNode::~CompoundStmtNode() {
361 delete first;
362}
363
364void CompoundStmtNode::add_statement( StatementNode *stmt ) {
365 if ( stmt != 0 ) {
366 last->set_link( stmt );
367 last = ( StatementNode *)( stmt->get_link());
368 } // if
369}
370
371void CompoundStmtNode::print( ostream &os, int indent ) const {
372 if ( first ) {
373 first->printList( os, indent+2 );
374 } // if
375}
376
377Statement *CompoundStmtNode::build() const {
378 std::list<Label> labs;
379 std::list<std::string> *labels = get_labels();
380
381 if ( labels != 0 ) {
382 std::back_insert_iterator< std::list<Label> > lab_it( labs );
383 copy( labels->begin(), labels->end(), lab_it );
384 } // if
385
386 CompoundStmt *cs = new CompoundStmt( labs );
387 buildList( first, cs->get_kids() );
388 return cs;
389}
390
391void NullStmtNode::print( ostream &os, int indent ) const {
392 os << string( indent, ' ' ) << "Null Statement:" << endl;
393}
394
395Statement *NullStmtNode::build() const {
396 return new NullStmt;
397}
398
399// Local Variables: //
400// tab-width: 4 //
401// mode: c++ //
402// compile-command: "make install" //
403// End: //
Note: See TracBrowser for help on using the repository browser.