source: src/AST/Stmt.hpp@ 41f4e2d

Last change on this file since 41f4e2d was 525f7ad, checked in by JiadaL <j82liang@…>, 17 months ago
  1. Add count_e( enum_name ), a pseudo function that return the number of element in an enum; 2. Implementation of enum range loop.
  • Property mode set to 100644
File size: 18.9 KB
RevLine 
[2bb4a01]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// Stmt.hpp --
8//
9// Author : Aaron B. Moss
[1e97287]10// Created On : Wed May 8 13:00:00 2019
[400b8be]11// Last Modified By : Andrew Beach
[3e94a23]12// Last Modified On : Wed Apr 5 10:34:00 2023
13// Update Count : 37
[2bb4a01]14//
15
16#pragma once
17
18#include <list>
[89a5a1f]19#include <utility> // for move
[2bb4a01]20#include <vector>
21
22#include "Label.hpp"
[89a5a1f]23#include "Node.hpp" // for node, ptr
[2bb4a01]24#include "ParseNode.hpp"
25#include "Visitor.hpp"
[c92bdcc]26#include "Common/CodeLocation.hpp"
[2bb4a01]27
[f3cc5b6]28// Must be included in *all* AST classes; should be #undef'd at the end of the file
[89a5a1f]29#define MUTATE_FRIEND \
[a1da039]30 template<typename node_t> friend node_t * mutate(const node_t * node); \
[99da267]31 template<typename node_t> friend node_t * shallowCopy(const node_t * node);
[f3cc5b6]32
[2bb4a01]33namespace ast {
34class Expr;
35
[89a5a1f]36// Base statement node
[2bb4a01]37class Stmt : public ParseNode {
[89a5a1f]38 public:
[2bb4a01]39 std::vector<Label> labels;
40
[6180274]41 Stmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
[89a5a1f]42 : ParseNode(loc), labels(std::move(labels)) {}
[2bb4a01]43
[3b0bc16]44 Stmt(const Stmt & o) : ParseNode(o), labels(o.labels) {}
[2bb4a01]45
[f3cc5b6]46 const Stmt * accept( Visitor & v ) const override = 0;
[89a5a1f]47 private:
[f3cc5b6]48 Stmt * clone() const override = 0;
49 MUTATE_FRIEND
[2bb4a01]50};
51
[400b8be]52// Base statement component node (only serves to group them).
53class StmtClause : public ParseNode {
54 public:
55 // This is for non-statements that still belong with the statements,
56 // but are not statements, usually some sort of clause. Often these can
57 // (and should) be folded into the approprate parent node, but if they
58 // cannot be, they are sub-types of this type, for organization.
59
[491bb81]60 StmtClause( const CodeLocation & loc )
[400b8be]61 : ParseNode(loc) {}
62
63 private:
64 StmtClause * clone() const override = 0;
65 MUTATE_FRIEND
66};
67
[89a5a1f]68// Compound statement: { ... }
[2bb4a01]69class CompoundStmt final : public Stmt {
[89a5a1f]70 public:
[2bb4a01]71 std::list<ptr<Stmt>> kids;
72
[6180274]73 CompoundStmt(const CodeLocation & loc, const std::list<ptr<Stmt>> && ks = {}, const std::vector<Label> && labels = {} )
[89a5a1f]74 : Stmt(loc, std::move(labels)), kids(std::move(ks)) {}
[2bb4a01]75
[3b0bc16]76 CompoundStmt( const CompoundStmt & o );
77 CompoundStmt( CompoundStmt && o ) = default;
[2bb4a01]78
[b8524ca]79 void push_back( const Stmt * s ) { kids.emplace_back( s ); }
80 void push_front( const Stmt * s ) { kids.emplace_front( s ); }
[2bb4a01]81
[f3cc5b6]82 const CompoundStmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]83 private:
[f3cc5b6]84 CompoundStmt * clone() const override { return new CompoundStmt{ *this }; }
85 MUTATE_FRIEND
[2bb4a01]86};
87
[89a5a1f]88// Empty statment: ;
[2bb4a01]89class NullStmt final : public Stmt {
[89a5a1f]90 public:
[6180274]91 NullStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
[89a5a1f]92 : Stmt(loc, std::move(labels)) {}
[2bb4a01]93
[f3cc5b6]94 const NullStmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]95 private:
[f3cc5b6]96 NullStmt * clone() const override { return new NullStmt{ *this }; }
97 MUTATE_FRIEND
[2bb4a01]98};
99
[89a5a1f]100// Expression wrapped by statement
[2bb4a01]101class ExprStmt final : public Stmt {
[89a5a1f]102 public:
[2bb4a01]103 ptr<Expr> expr;
104
[6180274]105 ExprStmt( const CodeLocation & loc, const Expr* e, const std::vector<Label> && labels = {} )
[89a5a1f]106 : Stmt(loc, std::move(labels)), expr(e) {}
[2bb4a01]107
[f3cc5b6]108 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]109 private:
[23f99e1]110 ExprStmt * clone() const override { return new ExprStmt{ *this }; }
[f3cc5b6]111 MUTATE_FRIEND
[2bb4a01]112};
113
[89a5a1f]114// Assembly statement: asm ... ( "..." : ... )
[1e97287]115class AsmStmt final : public Stmt {
[89a5a1f]116 public:
[1e97287]117 bool isVolatile;
118 ptr<Expr> instruction;
119 std::vector<ptr<Expr>> output, input;
120 std::vector<ptr<ConstantExpr>> clobber;
121 std::vector<Label> gotoLabels;
122
[f3cc5b6]123 AsmStmt( const CodeLocation & loc, bool isVolatile, const Expr * instruction,
[6180274]124 const std::vector<ptr<Expr>> && output, const std::vector<ptr<Expr>> && input,
125 const std::vector<ptr<ConstantExpr>> && clobber, const std::vector<Label> && gotoLabels,
126 const std::vector<Label> && labels = {})
[89a5a1f]127 : Stmt(loc, std::move(labels)), isVolatile(isVolatile), instruction(instruction),
128 output(std::move(output)), input(std::move(input)), clobber(std::move(clobber)),
129 gotoLabels(std::move(gotoLabels)) {}
[1e97287]130
[f3cc5b6]131 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]132 private:
[f3cc5b6]133 AsmStmt * clone() const override { return new AsmStmt{ *this }; }
134 MUTATE_FRIEND
[1e97287]135};
136
[89a5a1f]137// C-preprocessor directive: #...
[1e97287]138class DirectiveStmt final : public Stmt {
[89a5a1f]139 public:
[1e97287]140 std::string directive;
141
[f3cc5b6]142 DirectiveStmt( const CodeLocation & loc, const std::string & directive,
[89a5a1f]143 std::vector<Label> && labels = {} )
144 : Stmt(loc, std::move(labels)), directive(directive) {}
[1e97287]145
[f3cc5b6]146 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]147 private:
[f3cc5b6]148 DirectiveStmt * clone() const override { return new DirectiveStmt{ *this }; }
149 MUTATE_FRIEND
[1e97287]150};
151
[89a5a1f]152// If statement: if (...) ... else ...
[1e97287]153class IfStmt final : public Stmt {
[89a5a1f]154 public:
[1e97287]155 ptr<Expr> cond;
[3b0bc16]156 ptr<Stmt> then;
157 ptr<Stmt> else_;
[1e97287]158 std::vector<ptr<Stmt>> inits;
159
[3b0bc16]160 IfStmt( const CodeLocation & loc, const Expr * cond, const Stmt * then,
[6180274]161 const Stmt * else_ = nullptr, const std::vector<ptr<Stmt>> && inits = {},
162 const std::vector<Label> && labels = {} )
[3b0bc16]163 : Stmt(loc, std::move(labels)), cond(cond), then(then), else_(else_),
[89a5a1f]164 inits(std::move(inits)) {}
[1e97287]165
[f3cc5b6]166 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]167 private:
[f3cc5b6]168 IfStmt * clone() const override { return new IfStmt{ *this }; }
169 MUTATE_FRIEND
[1e97287]170};
171
[89a5a1f]172// Switch or choose statement: switch (...) { ... }
[1e97287]173class SwitchStmt final : public Stmt {
[89a5a1f]174 public:
[1e97287]175 ptr<Expr> cond;
[400b8be]176 std::vector<ptr<CaseClause>> cases;
[1e97287]177
[400b8be]178 SwitchStmt( const CodeLocation & loc, const Expr * cond,
179 const std::vector<ptr<CaseClause>> && cases,
[6180274]180 const std::vector<Label> && labels = {} )
[400b8be]181 : Stmt(loc, std::move(labels)), cond(cond), cases(std::move(cases)) {}
[1e97287]182
[f3cc5b6]183 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]184 private:
[f3cc5b6]185 SwitchStmt * clone() const override { return new SwitchStmt{ *this }; }
186 MUTATE_FRIEND
[1e97287]187};
188
[89a5a1f]189// Case label: case ...: or default:
[400b8be]190class CaseClause final : public StmtClause {
[89a5a1f]191 public:
192 // Null for the default label.
[1e97287]193 ptr<Expr> cond;
194 std::vector<ptr<Stmt>> stmts;
195
[400b8be]196 CaseClause( const CodeLocation & loc, const Expr * cond, const std::vector<ptr<Stmt>> && stmts )
197 : StmtClause(loc), cond(cond), stmts(std::move(stmts)) {}
[1e97287]198
[675d816]199 bool isDefault() const { return !cond; }
[1e97287]200
[400b8be]201 const CaseClause * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]202 private:
[400b8be]203 CaseClause * clone() const override { return new CaseClause{ *this }; }
[f3cc5b6]204 MUTATE_FRIEND
[1e97287]205};
206
[3e94a23]207// A while loop or a do-while loop:
208enum WhileDoKind { While, DoWhile };
209
[89a5a1f]210// While loop: while (...) ... else ... or do ... while (...) else ...;
[3b0bc16]211class WhileDoStmt final : public Stmt {
[89a5a1f]212 public:
[1e97287]213 ptr<Expr> cond;
214 ptr<Stmt> body;
[3b0bc16]215 ptr<Stmt> else_;
[1e97287]216 std::vector<ptr<Stmt>> inits;
[3e94a23]217 WhileDoKind isDoWhile;
[1e97287]218
[3b0bc16]219 WhileDoStmt( const CodeLocation & loc, const Expr * cond, const Stmt * body,
[3e94a23]220 const std::vector<ptr<Stmt>> && inits, WhileDoKind isDoWhile = While, const std::vector<Label> && labels = {} )
[3b0bc16]221 : Stmt(loc, std::move(labels)), cond(cond), body(body), else_(nullptr), inits(std::move(inits)), isDoWhile(isDoWhile) {}
222
223 WhileDoStmt( const CodeLocation & loc, const Expr * cond, const Stmt * body, const Stmt * else_,
[3e94a23]224 const std::vector<ptr<Stmt>> && inits, WhileDoKind isDoWhile = While, const std::vector<Label> && labels = {} )
[3b0bc16]225 : Stmt(loc, std::move(labels)), cond(cond), body(body), else_(else_), inits(std::move(inits)), isDoWhile(isDoWhile) {}
[1e97287]226
[f3cc5b6]227 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]228 private:
[3b0bc16]229 WhileDoStmt * clone() const override { return new WhileDoStmt{ *this }; }
[f3cc5b6]230 MUTATE_FRIEND
[1e97287]231};
232
[89a5a1f]233// For loop: for (... ; ... ; ...) ... else ...
[1e97287]234class ForStmt final : public Stmt {
[89a5a1f]235 public:
[1e97287]236 std::vector<ptr<Stmt>> inits;
237 ptr<Expr> cond;
[8a5530c]238 ptr<Expr> inc;
[525f7ad]239 ptr<Expr> range_over;
[1e97287]240 ptr<Stmt> body;
[3b0bc16]241 ptr<Stmt> else_;
242
[6180274]243 ForStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * cond,
244 const Expr * inc, const Stmt * body, const std::vector<Label> && label = {} )
[525f7ad]245 : Stmt(loc, std::move(label)), inits(std::move(inits)), cond(cond), inc(inc),
246 range_over(nullptr), body(body), else_(nullptr) {}
[1e97287]247
[6180274]248 ForStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * cond,
249 const Expr * inc, const Stmt * body, const Stmt * else_, const std::vector<Label> && labels = {} )
[525f7ad]250 : Stmt(loc, std::move(labels)), inits(std::move(inits)), cond(cond), inc(inc),
251 range_over(nullptr), body(body), else_(else_) {}
252
253 ForStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * range_over,
254 const Stmt * body, const Stmt * else_ )
255 : Stmt(loc, std::move(labels)), inits(std::move(inits)), range_over(range_over), body(body), else_(else_) {}
[1e97287]256
[f3cc5b6]257 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]258 private:
[f3cc5b6]259 ForStmt * clone() const override { return new ForStmt{ *this }; }
260 MUTATE_FRIEND
[1e97287]261};
262
[89a5a1f]263// Branch control flow statement: goto ... or break or continue or fallthru
[1e97287]264class BranchStmt final : public Stmt {
[89a5a1f]265 public:
[1e97287]266 enum Kind { Goto, Break, Continue, FallThrough, FallThroughDefault };
267 static constexpr size_t kindEnd = 1 + (size_t)FallThroughDefault;
268
269 const Label originalTarget;
270 Label target;
271 ptr<Expr> computedTarget;
272 Kind kind;
273
[6180274]274 BranchStmt( const CodeLocation & loc, Kind kind, Label target, const std::vector<Label> && labels = {} );
275 BranchStmt( const CodeLocation & loc, const Expr * computedTarget, const std::vector<Label> && labels = {} )
276 : Stmt(loc, std::move(labels)), originalTarget(loc), target(loc), computedTarget(computedTarget), kind(Goto) {}
[1e97287]277
[94b1f718]278 const char * kindName() const { return kindNames[kind]; }
[1e97287]279
[f3cc5b6]280 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]281 private:
[f3cc5b6]282 BranchStmt * clone() const override { return new BranchStmt{ *this }; }
283 MUTATE_FRIEND
[8a5530c]284
[1e97287]285 static const char * kindNames[kindEnd];
286};
287
[89a5a1f]288// Return statement: return ...
[1e97287]289class ReturnStmt final : public Stmt {
[89a5a1f]290 public:
[1e97287]291 ptr<Expr> expr;
292
[6180274]293 ReturnStmt( const CodeLocation & loc, const Expr * expr, const std::vector<Label> && labels = {} )
[89a5a1f]294 : Stmt(loc, std::move(labels)), expr(expr) {}
[1e97287]295
[f3cc5b6]296 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]297 private:
[f3cc5b6]298 ReturnStmt * clone() const override { return new ReturnStmt{ *this }; }
299 MUTATE_FRIEND
[1e97287]300};
301
[89a5a1f]302// Kind of exception
[6f4b7f2]303enum ExceptionKind { Terminate, Resume };
304
[89a5a1f]305// Throw statement: throw ...
[1e97287]306class ThrowStmt final : public Stmt {
[89a5a1f]307 public:
[1e97287]308 ptr<Expr> expr;
309 ptr<Expr> target;
[6f4b7f2]310 ExceptionKind kind;
[1e97287]311
[6180274]312 ThrowStmt( const CodeLocation & loc, ExceptionKind kind, const Expr * expr,
313 const Expr * target, const std::vector<Label> && labels = {} )
[89a5a1f]314 : Stmt(loc, std::move(labels)), expr(expr), target(target), kind(kind) {}
[1e97287]315
[f3cc5b6]316 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]317 private:
[f3cc5b6]318 ThrowStmt * clone() const override { return new ThrowStmt{ *this }; }
319 MUTATE_FRIEND
[1e97287]320};
321
[89a5a1f]322// Try statement: try { ... } ...
[1e97287]323class TryStmt final : public Stmt {
[89a5a1f]324 public:
[1e97287]325 ptr<CompoundStmt> body;
[400b8be]326 std::vector<ptr<CatchClause>> handlers;
327 ptr<FinallyClause> finally;
[1e97287]328
[6180274]329 TryStmt( const CodeLocation & loc, const CompoundStmt * body,
[400b8be]330 const std::vector<ptr<CatchClause>> && handlers, const FinallyClause * finally,
[6180274]331 const std::vector<Label> && labels = {} )
[89a5a1f]332 : Stmt(loc, std::move(labels)), body(body), handlers(std::move(handlers)), finally(finally) {}
[1e97287]333
[f3cc5b6]334 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]335 private:
[f3cc5b6]336 TryStmt * clone() const override { return new TryStmt{ *this }; }
337 MUTATE_FRIEND
[1e97287]338};
339
[89a5a1f]340// Catch clause of try statement
[400b8be]341class CatchClause final : public StmtClause {
[89a5a1f]342 public:
[1e97287]343 ptr<Decl> decl;
344 ptr<Expr> cond;
345 ptr<Stmt> body;
[6f4b7f2]346 ExceptionKind kind;
[1e97287]347
[400b8be]348 CatchClause( const CodeLocation & loc, ExceptionKind kind, const Decl * decl, const Expr * cond,
[a1da039]349 const Stmt * body )
[400b8be]350 : StmtClause(loc), decl(decl), cond(cond), body(body), kind(kind) {}
[1e97287]351
[400b8be]352 const CatchClause * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]353 private:
[400b8be]354 CatchClause * clone() const override { return new CatchClause{ *this }; }
[f3cc5b6]355 MUTATE_FRIEND
[1e97287]356};
357
[89a5a1f]358// Finally clause of try statement
[400b8be]359class FinallyClause final : public StmtClause {
[89a5a1f]360 public:
[1e97287]361 ptr<CompoundStmt> body;
362
[400b8be]363 FinallyClause( const CodeLocation & loc, const CompoundStmt * body )
364 : StmtClause(loc), body(body) {}
[1e97287]365
[400b8be]366 const FinallyClause * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]367 private:
[400b8be]368 FinallyClause * clone() const override { return new FinallyClause{ *this }; }
[f3cc5b6]369 MUTATE_FRIEND
[1e97287]370};
[2bb4a01]371
[89a5a1f]372// Suspend statement
[37cdd97]373class SuspendStmt final : public Stmt {
[89a5a1f]374 public:
[37cdd97]375 ptr<CompoundStmt> then;
[835d6e8]376 enum Kind { None, Coroutine, Generator } kind = None;
[37cdd97]377
[835d6e8]378 SuspendStmt( const CodeLocation & loc, const CompoundStmt * then, Kind kind, const std::vector<Label> && labels = {} )
379 : Stmt(loc, std::move(labels)), then(then), kind(kind) {}
[37cdd97]380
381 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]382 private:
[37cdd97]383 SuspendStmt * clone() const override { return new SuspendStmt{ *this }; }
384 MUTATE_FRIEND
385};
386
[c86b08d]387// Base class of WaitFor/WaitUntil statements
388// form: KEYWORD(...) ... timeout(...) ... else ...
[a1da039]389class WaitStmt : public Stmt {
[89a5a1f]390 public:
[a1da039]391 ptr<Expr> timeout_time;
[f6e6a55]392 ptr<Stmt> timeout_stmt;
393 ptr<Expr> timeout_cond;
394 ptr<Stmt> else_stmt;
395 ptr<Expr> else_cond;
[1e97287]396
[a1da039]397 WaitStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
[89a5a1f]398 : Stmt(loc, std::move(labels)) {}
[1e97287]399
[c86b08d]400 private:
[a1da039]401 WaitStmt * clone() const override = 0;
[c86b08d]402 MUTATE_FRIEND
403};
404
405// Base class for WaitFor/WaitUntil clauses
406// form: when( when_cond ) KEYWORD( target ) stmt
407class WhenClause : public StmtClause {
408 public:
409 ptr<Expr> target;
410 ptr<Stmt> stmt;
411 ptr<Expr> when_cond;
412
413 WhenClause( const CodeLocation & loc )
414 : StmtClause( loc ) {}
415
416 const WhenClause * accept( Visitor & v ) const override { return v.visit( this ); }
417 private:
418 WhenClause * clone() const override { return new WhenClause{ *this }; }
419 MUTATE_FRIEND
420};
421
422// Waitfor statement: when (...) waitfor (... , ...) ... timeout(...) ... else ...
423class WaitForStmt final : public WaitStmt {
424 public:
425 std::vector<ptr<WaitForClause>> clauses;
426
427 WaitForStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
428 : WaitStmt(loc, std::move(labels)) {}
429
[f3cc5b6]430 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]431 private:
[f3cc5b6]432 WaitForStmt * clone() const override { return new WaitForStmt{ *this }; }
433 MUTATE_FRIEND
[1e97287]434};
435
[94c98f0e]436// Clause in a waitfor statement: waitfor (..., ...) ...
[c86b08d]437class WaitForClause final : public WhenClause {
[f6e6a55]438 public:
[491bb81]439 std::vector<ptr<Expr>> target_args;
[f6e6a55]440
[491bb81]441 WaitForClause( const CodeLocation & loc )
[c86b08d]442 : WhenClause( loc ) {}
[f6e6a55]443
444 const WaitForClause * accept( Visitor & v ) const override { return v.visit( this ); }
445 private:
[491bb81]446 WaitForClause * clone() const override { return new WaitForClause{ *this }; }
447 MUTATE_FRIEND
[f6e6a55]448};
449
[c86b08d]450// waituntil statement: when (...) waituntil (...) ... timeout(...) ... else ...
451class WaitUntilStmt final : public WaitStmt {
452 public:
[a1da039]453 // Non-ast node used during compilation to store data needed to generate predicates
454 // and set initial status values for clauses
455 // Used to create a tree corresponding to the structure of the clauses in a WaitUntil
456 struct ClauseNode {
457 enum Op { AND, OR, LEFT_OR, LEAF, ELSE, TIMEOUT } op; // operation/type tag
458 // LEFT_OR used with TIMEOUT/ELSE to indicate that we ignore right hand side after parsing
459
460 ClauseNode * left;
461 ClauseNode * right;
462 WhenClause * leaf; // only set if this node is a leaf (points into vector of clauses)
463
464 bool ambiguousWhen; // used to paint nodes of predicate tree based on when() clauses
465 bool whenState; // used to track if when_cond is toggled on or off for generating init values
466 bool childOfAnd; // true on leaf nodes that are children of AND, false otherwise
467
468 ClauseNode( Op op, ClauseNode * left, ClauseNode * right )
469 : op(op), left(left), right(right), leaf(nullptr),
470 ambiguousWhen(false), whenState(true), childOfAnd(false) {}
471 ClauseNode( Op op, WhenClause * leaf )
472 : op(op), left(nullptr), right(nullptr), leaf(leaf),
473 ambiguousWhen(false), whenState(true), childOfAnd(false) {}
474 ClauseNode( WhenClause * leaf ) : ClauseNode(LEAF, leaf) {}
475
476 ~ClauseNode() {
477 if ( left ) delete left;
478 if ( right ) delete right;
479 }
480 };
[c86b08d]481
482 std::vector<ptr<WhenClause>> clauses;
[a1da039]483 ClauseNode * predicateTree;
[c86b08d]484
485 WaitUntilStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
486 : WaitStmt(loc, std::move(labels)) {}
487
[a1da039]488 ~WaitUntilStmt() { delete predicateTree; }
[c86b08d]489
490 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
491 private:
492 WaitUntilStmt * clone() const override { return new WaitUntilStmt{ *this }; }
493 MUTATE_FRIEND
494};
495
[89a5a1f]496// Any declaration in a (compound) statement.
[1e97287]497class DeclStmt final : public Stmt {
[89a5a1f]498 public:
[1e97287]499 ptr<Decl> decl;
500
[6180274]501 DeclStmt( const CodeLocation & loc, const Decl * decl, const std::vector<Label> && labels = {} )
[89a5a1f]502 : Stmt(loc, std::move(labels)), decl(decl) {}
[1e97287]503
[f3cc5b6]504 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]505 private:
[f3cc5b6]506 DeclStmt * clone() const override { return new DeclStmt{ *this }; }
507 MUTATE_FRIEND
[1e97287]508};
509
[89a5a1f]510// Represents an implicit application of a constructor or destructor.
[1e97287]511class ImplicitCtorDtorStmt final : public Stmt {
[89a5a1f]512 public:
[c570806]513 ptr<Stmt> callStmt;
[1e97287]514
[f3cc5b6]515 ImplicitCtorDtorStmt( const CodeLocation & loc, const Stmt * callStmt,
[89a5a1f]516 std::vector<Label> && labels = {} )
517 : Stmt(loc, std::move(labels)), callStmt(callStmt) {}
[1e97287]518
[f3cc5b6]519 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]520 private:
[f3cc5b6]521 ImplicitCtorDtorStmt * clone() const override { return new ImplicitCtorDtorStmt{ *this }; }
522 MUTATE_FRIEND
[1e97287]523};
[2bb4a01]524
[89a5a1f]525// Mutex Statement
[6cebfef]526class MutexStmt final : public Stmt {
[89a5a1f]527 public:
[6cebfef]528 ptr<Stmt> stmt;
529 std::vector<ptr<Expr>> mutexObjs;
530
[a1da039]531 MutexStmt( const CodeLocation & loc, const Stmt * stmt,
[6180274]532 const std::vector<ptr<Expr>> && mutexes, const std::vector<Label> && labels = {} )
[89a5a1f]533 : Stmt(loc, std::move(labels)), stmt(stmt), mutexObjs(std::move(mutexes)) {}
[6cebfef]534
535 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]536 private:
[6cebfef]537 MutexStmt * clone() const override { return new MutexStmt{ *this }; }
538 MUTATE_FRIEND
539};
[94c98f0e]540
[eb779d5]541// Corun Statement
542class CorunStmt final : public Stmt {
543 public:
544 ptr<Stmt> stmt;
545
546 CorunStmt( const CodeLocation & loc, const Stmt * stmt, const std::vector<Label> && labels = {} )
547 : Stmt(loc, std::move(labels)), stmt(stmt) {}
548
549 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
550 private:
551 CorunStmt * clone() const override { return new CorunStmt{ *this }; }
552 MUTATE_FRIEND
553};
554
[3d9d017]555// Corun Statement
556class CoforStmt final : public Stmt {
557 public:
558 std::vector<ptr<Stmt>> inits;
559 ptr<Expr> cond;
560 ptr<Expr> inc;
561 ptr<Stmt> body;
562
563 CoforStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * cond,
564 const Expr * inc, const Stmt * body, const std::vector<Label> && label = {} )
565 : Stmt(loc, std::move(label)), inits(std::move(inits)), cond(cond), inc(inc), body(body) {}
566
567 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
568 private:
569 CoforStmt * clone() const override { return new CoforStmt{ *this }; }
570 MUTATE_FRIEND
571};
572
[89a5a1f]573} // namespace ast
[2bb4a01]574
[f3cc5b6]575#undef MUTATE_FRIEND
576
[2bb4a01]577// Local Variables: //
578// mode: c++ //
[1e97287]579// End: //
Note: See TracBrowser for help on using the repository browser.