source: src/Parser/StatementNode.cc @ d67cdb7

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since d67cdb7 was d67cdb7, checked in by Peter A. Buhr <pabuhr@…>, 4 years ago

merge

  • Property mode set to 100644
File size: 11.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// 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 : Fri Sep  1 23:25:23 2017
13// Update Count     : 346
14//
15
16#include <cassert>                 // for assert, strict_dynamic_cast, assertf
17#include <list>                    // for list
18#include <memory>                  // for unique_ptr
19#include <string>                  // for string
20
21#include "Common/SemanticError.h"  // for SemanticError
22#include "Common/utility.h"        // for maybeMoveBuild, maybeBuild
23#include "ParseNode.h"             // for StatementNode, ExpressionNode, bui...
24#include "SynTree/Expression.h"    // for Expression, ConstantExpr
25#include "SynTree/Label.h"         // for Label, noLabels
26#include "SynTree/Declaration.h"
27#include "SynTree/Statement.h"     // for Statement, BranchStmt, CaseStmt
28#include "parserutility.h"         // for notZeroExpr
29
30class Declaration;
31
32using namespace std;
33
34
35StatementNode::StatementNode( DeclarationNode *decl ) {
36        assert( decl );
37        DeclarationNode *agg = decl->extractAggregate();
38        if ( agg ) {
39                StatementNode *nextStmt = new StatementNode( new DeclStmt( noLabels, maybeBuild< Declaration >( decl ) ) );
40                set_next( nextStmt );
41                if ( decl->get_next() ) {
42                        get_next()->set_next( new StatementNode( dynamic_cast< DeclarationNode * >(decl->get_next()) ) );
43                        decl->set_next( 0 );
44                } // if
45        } else {
46                if ( decl->get_next() ) {
47                        set_next( new StatementNode( dynamic_cast< DeclarationNode * >( decl->get_next() ) ) );
48                        decl->set_next( 0 );
49                } // if
50                agg = decl;
51        } // if
52        stmt.reset( new DeclStmt( noLabels, maybeMoveBuild< Declaration >(agg) ) );
53} // StatementNode::StatementNode
54
55StatementNode *StatementNode::append_last_case( StatementNode *stmt ) {
56        StatementNode *prev = this;
57        // find end of list and maintain previous pointer
58        for ( StatementNode * curr = prev; curr != nullptr; curr = (StatementNode *)curr->get_next() ) {
59                StatementNode *node = strict_dynamic_cast< StatementNode * >(curr);
60                assert( dynamic_cast< CaseStmt * >(node->stmt.get()) );
61                prev = curr;
62        } // for
63        // convert from StatementNode list to Statement list
64        StatementNode *node = dynamic_cast< StatementNode * >(prev);
65        std::list< Statement * > stmts;
66        buildMoveList( stmt, stmts );
67        // splice any new Statements to end of current Statements
68        CaseStmt * caseStmt = dynamic_cast< CaseStmt * >(node->stmt.get());
69        caseStmt->get_statements().splice( caseStmt->get_statements().end(), stmts );
70        return this;
71}
72
73Statement *build_expr( ExpressionNode *ctl ) {
74        Expression *e = maybeMoveBuild< Expression >( ctl );
75
76        if ( e )
77                return new ExprStmt( noLabels, e );
78        else
79                return new NullStmt( noLabels );
80}
81
82Statement *build_if( IfCtl * ctl, StatementNode *then_stmt, StatementNode *else_stmt ) {
83        Statement *thenb, *elseb = 0;
84        std::list< Statement * > branches;
85        buildMoveList< Statement, StatementNode >( then_stmt, branches );
86        assert( branches.size() == 1 );
87        thenb = branches.front();
88
89        if ( else_stmt ) {
90                std::list< Statement * > branches;
91                buildMoveList< Statement, StatementNode >( else_stmt, branches );
92                assert( branches.size() == 1 );
93                elseb = branches.front();
94        } // if
95
96        std::list< Statement * > init;
97        if ( ctl->init != 0 ) {
98                buildMoveList( ctl->init, init );
99        } // if
100
101        Expression * cond = nullptr;
102        if ( ctl->condition ) {
103                // compare the provided condition against 0
104                cond =  notZeroExpr( maybeMoveBuild< Expression >(ctl->condition) );
105        } else {
106                for ( Statement * stmt : init ) {
107                        // build the && of all of the declared variables compared against 0
108                        DeclStmt * declStmt = strict_dynamic_cast< DeclStmt * >( stmt );
109                        DeclarationWithType * dwt = strict_dynamic_cast< DeclarationWithType * >( declStmt->decl );
110                        Expression * nze = notZeroExpr( new VariableExpr( dwt ) );
111                        cond = cond ? new LogicalExpr( cond, nze, true ) : nze;
112                }
113        }
114        delete ctl;
115        return new IfStmt( noLabels, cond, thenb, elseb, init );
116}
117
118Statement *build_switch( ExpressionNode *ctl, StatementNode *stmt ) {
119        std::list< Statement * > branches;
120        buildMoveList< Statement, StatementNode >( stmt, branches );
121        // branches.size() == 0 for switch (...) {}, i.e., no declaration or statements
122        return new SwitchStmt( noLabels, maybeMoveBuild< Expression >(ctl), branches );
123}
124Statement *build_case( ExpressionNode *ctl ) {
125        std::list< Statement * > branches;
126        return new CaseStmt( noLabels, maybeMoveBuild< Expression >(ctl), branches );
127}
128Statement *build_default() {
129        std::list< Statement * > branches;
130        return new CaseStmt( noLabels, nullptr, branches, true );
131}
132
133Statement *build_while( ExpressionNode *ctl, StatementNode *stmt, bool kind ) {
134        std::list< Statement * > branches;
135        buildMoveList< Statement, StatementNode >( stmt, branches );
136        assert( branches.size() == 1 );
137        return new WhileStmt( noLabels, notZeroExpr( maybeMoveBuild< Expression >(ctl) ), branches.front(), kind );
138}
139
140Statement *build_for( ForCtl *forctl, StatementNode *stmt ) {
141        std::list< Statement * > branches;
142        buildMoveList< Statement, StatementNode >( stmt, branches );
143        assert( branches.size() == 1 );
144
145        std::list< Statement * > init;
146        if ( forctl->init != 0 ) {
147                buildMoveList( forctl->init, init );
148        } // if
149
150        Expression *cond = 0;
151        if ( forctl->condition != 0 )
152                cond = notZeroExpr( maybeMoveBuild< Expression >(forctl->condition) );
153
154        Expression *incr = 0;
155        if ( forctl->change != 0 )
156                incr = maybeMoveBuild< Expression >(forctl->change);
157
158        delete forctl;
159        return new ForStmt( noLabels, init, cond, incr, branches.front() );
160}
161
162Statement *build_branch( BranchStmt::Type kind ) {
163        Statement * ret = new BranchStmt( noLabels, "", kind );
164        return ret;
165}
166Statement *build_branch( std::string *identifier, BranchStmt::Type kind ) {
167        Statement * ret = new BranchStmt( noLabels, *identifier, kind );
168        delete identifier;                                                                      // allocated by lexer
169        return ret;
170}
171Statement *build_computedgoto( ExpressionNode *ctl ) {
172        return new BranchStmt( noLabels, maybeMoveBuild< Expression >(ctl), BranchStmt::Goto );
173}
174
175Statement *build_return( ExpressionNode *ctl ) {
176        std::list< Expression * > exps;
177        buildMoveList( ctl, exps );
178        return new ReturnStmt( noLabels, exps.size() > 0 ? exps.back() : nullptr );
179}
180
181Statement *build_throw( ExpressionNode *ctl ) {
182        std::list< Expression * > exps;
183        buildMoveList( ctl, exps );
184        assertf( exps.size() < 2, "This means we are leaking memory");
185        return new ThrowStmt( noLabels, ThrowStmt::Terminate, !exps.empty() ? exps.back() : nullptr );
186}
187
188Statement *build_resume( ExpressionNode *ctl ) {
189        std::list< Expression * > exps;
190        buildMoveList( ctl, exps );
191        assertf( exps.size() < 2, "This means we are leaking memory");
192        return new ThrowStmt( noLabels, ThrowStmt::Resume, !exps.empty() ? exps.back() : nullptr );
193}
194
195Statement *build_resume_at( ExpressionNode *ctl, ExpressionNode *target ) {
196        (void)ctl;
197        (void)target;
198        assertf( false, "resume at (non-local throw) is not yet supported," );
199}
200
201Statement *build_try( StatementNode *try_stmt, StatementNode *catch_stmt, StatementNode *finally_stmt ) {
202        std::list< CatchStmt * > branches;
203        buildMoveList< CatchStmt, StatementNode >( catch_stmt, branches );
204        CompoundStmt *tryBlock = strict_dynamic_cast< CompoundStmt * >(maybeMoveBuild< Statement >(try_stmt));
205        FinallyStmt *finallyBlock = dynamic_cast< FinallyStmt * >(maybeMoveBuild< Statement >(finally_stmt) );
206        return new TryStmt( noLabels, tryBlock, branches, finallyBlock );
207}
208Statement *build_catch( CatchStmt::Kind kind, DeclarationNode *decl, ExpressionNode *cond, StatementNode *body ) {
209        std::list< Statement * > branches;
210        buildMoveList< Statement, StatementNode >( body, branches );
211        assert( branches.size() == 1 );
212        return new CatchStmt( noLabels, kind, maybeMoveBuild< Declaration >(decl), maybeMoveBuild< Expression >(cond), branches.front() );
213}
214Statement *build_finally( StatementNode *stmt ) {
215        std::list< Statement * > branches;
216        buildMoveList< Statement, StatementNode >( stmt, branches );
217        assert( branches.size() == 1 );
218        return new FinallyStmt( noLabels, dynamic_cast< CompoundStmt * >( branches.front() ) );
219}
220
221WaitForStmt * build_waitfor( ExpressionNode * targetExpr, StatementNode * stmt, ExpressionNode * when ) {
222        auto node = new WaitForStmt();
223
224        WaitForStmt::Target target;
225        target.function = maybeBuild<Expression>( targetExpr );
226
227        ExpressionNode * next = dynamic_cast<ExpressionNode *>( targetExpr->get_next() );
228        targetExpr->set_next( nullptr );
229        buildMoveList< Expression >( next, target.arguments );
230
231        delete targetExpr;
232
233        node->clauses.push_back( WaitForStmt::Clause{
234                target,
235                maybeMoveBuild<Statement >( stmt ),
236                notZeroExpr( maybeMoveBuild<Expression>( when ) )
237        });
238
239        return node;
240}
241
242WaitForStmt * build_waitfor( ExpressionNode * targetExpr, StatementNode * stmt, ExpressionNode * when, WaitForStmt * node ) {
243        WaitForStmt::Target target;
244        target.function = maybeBuild<Expression>( targetExpr );
245
246        ExpressionNode * next = dynamic_cast<ExpressionNode *>( targetExpr->get_next() );
247        targetExpr->set_next( nullptr );
248        buildMoveList< Expression >( next, target.arguments );
249
250        delete targetExpr;
251
252        node->clauses.insert( node->clauses.begin(), WaitForStmt::Clause{
253                std::move( target ),
254                maybeMoveBuild<Statement >( stmt ),
255                notZeroExpr( maybeMoveBuild<Expression>( when ) )
256        });
257
258        return node;
259}
260
261WaitForStmt * build_waitfor_timeout( ExpressionNode * timeout, StatementNode * stmt, ExpressionNode * when ) {
262        auto node = new WaitForStmt();
263
264        if( timeout ) {
265                node->timeout.time      = maybeMoveBuild<Expression>( timeout );
266                node->timeout.statement = maybeMoveBuild<Statement >( stmt    );
267                node->timeout.condition = notZeroExpr( maybeMoveBuild<Expression>( when ) );
268        }
269        else {
270                node->orelse.statement  = maybeMoveBuild<Statement >( stmt );
271                node->orelse.condition  = notZeroExpr( maybeMoveBuild<Expression>( when ) );
272        }
273
274        return node;
275}
276
277WaitForStmt * build_waitfor_timeout( ExpressionNode * timeout, StatementNode * stmt, ExpressionNode * when,  StatementNode * else_stmt, ExpressionNode * else_when ) {
278        auto node = new WaitForStmt();
279
280        node->timeout.time      = maybeMoveBuild<Expression>( timeout );
281        node->timeout.statement = maybeMoveBuild<Statement >( stmt    );
282        node->timeout.condition = notZeroExpr( maybeMoveBuild<Expression>( when ) );
283
284        node->orelse.statement = maybeMoveBuild<Statement >( else_stmt );
285        node->orelse.condition  = notZeroExpr( maybeMoveBuild<Expression>( else_when ) );
286
287        return node;
288}
289
290Statement *build_compound( StatementNode *first ) {
291        CompoundStmt *cs = new CompoundStmt( noLabels );
292        buildMoveList( first, cs->get_kids() );
293        return cs;
294}
295
296Statement *build_asmstmt( bool voltile, Expression *instruction, ExpressionNode *output, ExpressionNode *input, ExpressionNode *clobber, LabelNode *gotolabels ) {
297        std::list< Expression * > out, in;
298        std::list< ConstantExpr * > clob;
299
300        buildMoveList( output, out );
301        buildMoveList( input, in );
302        buildMoveList( clobber, clob );
303        return new AsmStmt( noLabels, voltile, instruction, out, in, clob, gotolabels ? gotolabels->labels : noLabels );
304}
305
306// Local Variables: //
307// tab-width: 4 //
308// mode: c++ //
309// compile-command: "make install" //
310// End: //
Note: See TracBrowser for help on using the repository browser.