source: src/AST/Stmt.hpp@ a50fdfb

ADT ast-experimental
Last change on this file since a50fdfb was c86b08d, checked in by caparsons <caparson@…>, 3 years ago

added support for the waituntil statement in the compiler

  • Property mode set to 100644
File size: 17.6 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
[f6e6a55]12// Last Modified On : Wed Apr 20 14:34:00 2022
13// Update Count : 36
[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"
26#include "Common/CodeLocation.h"
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 \
[99da267]30 template<typename node_t> friend node_t * mutate(const node_t * node); \
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
[89a5a1f]207// While loop: while (...) ... else ... or do ... while (...) else ...;
[3b0bc16]208class WhileDoStmt final : public Stmt {
[89a5a1f]209 public:
[1e97287]210 ptr<Expr> cond;
211 ptr<Stmt> body;
[3b0bc16]212 ptr<Stmt> else_;
[1e97287]213 std::vector<ptr<Stmt>> inits;
214 bool isDoWhile;
215
[3b0bc16]216 WhileDoStmt( const CodeLocation & loc, const Expr * cond, const Stmt * body,
[6180274]217 const std::vector<ptr<Stmt>> && inits, bool isDoWhile = false, const std::vector<Label> && labels = {} )
[3b0bc16]218 : Stmt(loc, std::move(labels)), cond(cond), body(body), else_(nullptr), inits(std::move(inits)), isDoWhile(isDoWhile) {}
219
220 WhileDoStmt( const CodeLocation & loc, const Expr * cond, const Stmt * body, const Stmt * else_,
[6180274]221 const std::vector<ptr<Stmt>> && inits, bool isDoWhile = false, const std::vector<Label> && labels = {} )
[3b0bc16]222 : Stmt(loc, std::move(labels)), cond(cond), body(body), else_(else_), inits(std::move(inits)), isDoWhile(isDoWhile) {}
[1e97287]223
[f3cc5b6]224 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]225 private:
[3b0bc16]226 WhileDoStmt * clone() const override { return new WhileDoStmt{ *this }; }
[f3cc5b6]227 MUTATE_FRIEND
[1e97287]228};
229
[89a5a1f]230// For loop: for (... ; ... ; ...) ... else ...
[1e97287]231class ForStmt final : public Stmt {
[89a5a1f]232 public:
[1e97287]233 std::vector<ptr<Stmt>> inits;
234 ptr<Expr> cond;
[8a5530c]235 ptr<Expr> inc;
[1e97287]236 ptr<Stmt> body;
[3b0bc16]237 ptr<Stmt> else_;
238
[6180274]239 ForStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * cond,
240 const Expr * inc, const Stmt * body, const std::vector<Label> && label = {} )
[3b0bc16]241 : Stmt(loc, std::move(label)), inits(std::move(inits)), cond(cond), inc(inc), body(body), else_(nullptr) {}
[1e97287]242
[6180274]243 ForStmt( const CodeLocation & loc, const std::vector<ptr<Stmt>> && inits, const Expr * cond,
244 const Expr * inc, const Stmt * body, const Stmt * else_, const std::vector<Label> && labels = {} )
[3b0bc16]245 : Stmt(loc, std::move(labels)), inits(std::move(inits)), cond(cond), inc(inc), body(body), else_(else_) {}
[1e97287]246
[f3cc5b6]247 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]248 private:
[f3cc5b6]249 ForStmt * clone() const override { return new ForStmt{ *this }; }
250 MUTATE_FRIEND
[1e97287]251};
252
[89a5a1f]253// Branch control flow statement: goto ... or break or continue or fallthru
[1e97287]254class BranchStmt final : public Stmt {
[89a5a1f]255 public:
[1e97287]256 enum Kind { Goto, Break, Continue, FallThrough, FallThroughDefault };
257 static constexpr size_t kindEnd = 1 + (size_t)FallThroughDefault;
258
259 const Label originalTarget;
260 Label target;
261 ptr<Expr> computedTarget;
262 Kind kind;
263
[6180274]264 BranchStmt( const CodeLocation & loc, Kind kind, Label target, const std::vector<Label> && labels = {} );
265 BranchStmt( const CodeLocation & loc, const Expr * computedTarget, const std::vector<Label> && labels = {} )
266 : Stmt(loc, std::move(labels)), originalTarget(loc), target(loc), computedTarget(computedTarget), kind(Goto) {}
[1e97287]267
[94b1f718]268 const char * kindName() const { return kindNames[kind]; }
[1e97287]269
[f3cc5b6]270 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]271 private:
[f3cc5b6]272 BranchStmt * clone() const override { return new BranchStmt{ *this }; }
273 MUTATE_FRIEND
[8a5530c]274
[1e97287]275 static const char * kindNames[kindEnd];
276};
277
[89a5a1f]278// Return statement: return ...
[1e97287]279class ReturnStmt final : public Stmt {
[89a5a1f]280 public:
[1e97287]281 ptr<Expr> expr;
282
[6180274]283 ReturnStmt( const CodeLocation & loc, const Expr * expr, const std::vector<Label> && labels = {} )
[89a5a1f]284 : Stmt(loc, std::move(labels)), expr(expr) {}
[1e97287]285
[f3cc5b6]286 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]287 private:
[f3cc5b6]288 ReturnStmt * clone() const override { return new ReturnStmt{ *this }; }
289 MUTATE_FRIEND
[1e97287]290};
291
[89a5a1f]292// Kind of exception
[6f4b7f2]293enum ExceptionKind { Terminate, Resume };
294
[89a5a1f]295// Throw statement: throw ...
[1e97287]296class ThrowStmt final : public Stmt {
[89a5a1f]297 public:
[1e97287]298 ptr<Expr> expr;
299 ptr<Expr> target;
[6f4b7f2]300 ExceptionKind kind;
[1e97287]301
[6180274]302 ThrowStmt( const CodeLocation & loc, ExceptionKind kind, const Expr * expr,
303 const Expr * target, const std::vector<Label> && labels = {} )
[89a5a1f]304 : Stmt(loc, std::move(labels)), expr(expr), target(target), kind(kind) {}
[1e97287]305
[f3cc5b6]306 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]307 private:
[f3cc5b6]308 ThrowStmt * clone() const override { return new ThrowStmt{ *this }; }
309 MUTATE_FRIEND
[1e97287]310};
311
[89a5a1f]312// Try statement: try { ... } ...
[1e97287]313class TryStmt final : public Stmt {
[89a5a1f]314 public:
[1e97287]315 ptr<CompoundStmt> body;
[400b8be]316 std::vector<ptr<CatchClause>> handlers;
317 ptr<FinallyClause> finally;
[1e97287]318
[6180274]319 TryStmt( const CodeLocation & loc, const CompoundStmt * body,
[400b8be]320 const std::vector<ptr<CatchClause>> && handlers, const FinallyClause * finally,
[6180274]321 const std::vector<Label> && labels = {} )
[89a5a1f]322 : Stmt(loc, std::move(labels)), body(body), handlers(std::move(handlers)), finally(finally) {}
[1e97287]323
[f3cc5b6]324 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]325 private:
[f3cc5b6]326 TryStmt * clone() const override { return new TryStmt{ *this }; }
327 MUTATE_FRIEND
[1e97287]328};
329
[89a5a1f]330// Catch clause of try statement
[400b8be]331class CatchClause final : public StmtClause {
[89a5a1f]332 public:
[1e97287]333 ptr<Decl> decl;
334 ptr<Expr> cond;
335 ptr<Stmt> body;
[6f4b7f2]336 ExceptionKind kind;
[1e97287]337
[400b8be]338 CatchClause( const CodeLocation & loc, ExceptionKind kind, const Decl * decl, const Expr * cond,
339 const Stmt * body )
340 : StmtClause(loc), decl(decl), cond(cond), body(body), kind(kind) {}
[1e97287]341
[400b8be]342 const CatchClause * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]343 private:
[400b8be]344 CatchClause * clone() const override { return new CatchClause{ *this }; }
[f3cc5b6]345 MUTATE_FRIEND
[1e97287]346};
347
[89a5a1f]348// Finally clause of try statement
[400b8be]349class FinallyClause final : public StmtClause {
[89a5a1f]350 public:
[1e97287]351 ptr<CompoundStmt> body;
352
[400b8be]353 FinallyClause( const CodeLocation & loc, const CompoundStmt * body )
354 : StmtClause(loc), body(body) {}
[1e97287]355
[400b8be]356 const FinallyClause * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]357 private:
[400b8be]358 FinallyClause * clone() const override { return new FinallyClause{ *this }; }
[f3cc5b6]359 MUTATE_FRIEND
[1e97287]360};
[2bb4a01]361
[89a5a1f]362// Suspend statement
[37cdd97]363class SuspendStmt final : public Stmt {
[89a5a1f]364 public:
[37cdd97]365 ptr<CompoundStmt> then;
366 enum Type { None, Coroutine, Generator } type = None;
367
[6180274]368 SuspendStmt( const CodeLocation & loc, const CompoundStmt * then, Type type, const std::vector<Label> && labels = {} )
[89a5a1f]369 : Stmt(loc, std::move(labels)), then(then), type(type) {}
[37cdd97]370
371 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]372 private:
[37cdd97]373 SuspendStmt * clone() const override { return new SuspendStmt{ *this }; }
374 MUTATE_FRIEND
375};
376
[c86b08d]377// Base class of WaitFor/WaitUntil statements
378// form: KEYWORD(...) ... timeout(...) ... else ...
379class WaitStmt : public Stmt {
[89a5a1f]380 public:
[c86b08d]381 ptr<Expr> timeout_time;
[f6e6a55]382 ptr<Stmt> timeout_stmt;
383 ptr<Expr> timeout_cond;
384 ptr<Stmt> else_stmt;
385 ptr<Expr> else_cond;
[1e97287]386
[c86b08d]387 WaitStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
[89a5a1f]388 : Stmt(loc, std::move(labels)) {}
[1e97287]389
[c86b08d]390 private:
391 WaitStmt * clone() const override = 0;
392 MUTATE_FRIEND
393};
394
395// Base class for WaitFor/WaitUntil clauses
396// form: when( when_cond ) KEYWORD( target ) stmt
397class WhenClause : public StmtClause {
398 public:
399 ptr<Expr> target;
400 ptr<Stmt> stmt;
401 ptr<Expr> when_cond;
402
403 WhenClause( const CodeLocation & loc )
404 : StmtClause( loc ) {}
405
406 const WhenClause * accept( Visitor & v ) const override { return v.visit( this ); }
407 private:
408 WhenClause * clone() const override { return new WhenClause{ *this }; }
409 MUTATE_FRIEND
410};
411
412// Waitfor statement: when (...) waitfor (... , ...) ... timeout(...) ... else ...
413class WaitForStmt final : public WaitStmt {
414 public:
415 std::vector<ptr<WaitForClause>> clauses;
416
417 WaitForStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
418 : WaitStmt(loc, std::move(labels)) {}
419
[f3cc5b6]420 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]421 private:
[f3cc5b6]422 WaitForStmt * clone() const override { return new WaitForStmt{ *this }; }
423 MUTATE_FRIEND
[1e97287]424};
425
[c86b08d]426class WaitForClause final : public WhenClause {
[f6e6a55]427 public:
[491bb81]428 std::vector<ptr<Expr>> target_args;
[f6e6a55]429
[491bb81]430 WaitForClause( const CodeLocation & loc )
[c86b08d]431 : WhenClause( loc ) {}
[f6e6a55]432
433 const WaitForClause * accept( Visitor & v ) const override { return v.visit( this ); }
434 private:
[491bb81]435 WaitForClause * clone() const override { return new WaitForClause{ *this }; }
436 MUTATE_FRIEND
[f6e6a55]437};
438
[c86b08d]439// waituntil statement: when (...) waituntil (...) ... timeout(...) ... else ...
440class WaitUntilStmt final : public WaitStmt {
441 public:
442 // Non-ast node used during compilation to store data needed to generate predicates
443 // and set initial status values for clauses
444 // Used to create a tree corresponding to the structure of the clauses in a WaitUntil
445 struct ClauseNode {
446 enum Op { AND, OR, LEFT_OR, LEAF, ELSE, TIMEOUT } op; // operation/type tag
447 // LEFT_OR used with TIMEOUT/ELSE to indicate that we ignore right hand side after parsing
448
449 ClauseNode * left;
450 ClauseNode * right;
451 WhenClause * leaf; // only set if this node is a leaf (points into vector of clauses)
452
453 bool ambiguousWhen; // used to paint nodes of predicate tree based on when() clauses
454 bool whenState; // used to track if when_cond is toggled on or off for generating init values
455 bool childOfAnd; // true on leaf nodes that are children of AND, false otherwise
456
457 ClauseNode( Op op, ClauseNode * left, ClauseNode * right )
458 : op(op), left(left), right(right), leaf(nullptr),
459 ambiguousWhen(false), whenState(true), childOfAnd(false) {}
460 ClauseNode( Op op, WhenClause * leaf )
461 : op(op), left(nullptr), right(nullptr), leaf(leaf),
462 ambiguousWhen(false), whenState(true), childOfAnd(false) {}
463 ClauseNode( WhenClause * leaf ) : ClauseNode(LEAF, leaf) {}
464
465 ~ClauseNode() {
466 if ( left ) delete left;
467 if ( right ) delete right;
468 }
469 };
470
471 std::vector<ptr<WhenClause>> clauses;
472 ClauseNode * predicateTree;
473
474 WaitUntilStmt( const CodeLocation & loc, const std::vector<Label> && labels = {} )
475 : WaitStmt(loc, std::move(labels)) {}
476
477 ~WaitUntilStmt() { delete predicateTree; }
478
479 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
480 private:
481 WaitUntilStmt * clone() const override { return new WaitUntilStmt{ *this }; }
482 MUTATE_FRIEND
483};
484
[89a5a1f]485// Any declaration in a (compound) statement.
[1e97287]486class DeclStmt final : public Stmt {
[89a5a1f]487 public:
[1e97287]488 ptr<Decl> decl;
489
[6180274]490 DeclStmt( const CodeLocation & loc, const Decl * decl, const std::vector<Label> && labels = {} )
[89a5a1f]491 : Stmt(loc, std::move(labels)), decl(decl) {}
[1e97287]492
[f3cc5b6]493 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]494 private:
[f3cc5b6]495 DeclStmt * clone() const override { return new DeclStmt{ *this }; }
496 MUTATE_FRIEND
[1e97287]497};
498
[89a5a1f]499// Represents an implicit application of a constructor or destructor.
[1e97287]500class ImplicitCtorDtorStmt final : public Stmt {
[89a5a1f]501 public:
[c570806]502 ptr<Stmt> callStmt;
[1e97287]503
[f3cc5b6]504 ImplicitCtorDtorStmt( const CodeLocation & loc, const Stmt * callStmt,
[89a5a1f]505 std::vector<Label> && labels = {} )
506 : Stmt(loc, std::move(labels)), callStmt(callStmt) {}
[1e97287]507
[f3cc5b6]508 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]509 private:
[f3cc5b6]510 ImplicitCtorDtorStmt * clone() const override { return new ImplicitCtorDtorStmt{ *this }; }
511 MUTATE_FRIEND
[1e97287]512};
[2bb4a01]513
[89a5a1f]514// Mutex Statement
[6cebfef]515class MutexStmt final : public Stmt {
[89a5a1f]516 public:
[6cebfef]517 ptr<Stmt> stmt;
518 std::vector<ptr<Expr>> mutexObjs;
519
520 MutexStmt( const CodeLocation & loc, const Stmt * stmt,
[6180274]521 const std::vector<ptr<Expr>> && mutexes, const std::vector<Label> && labels = {} )
[89a5a1f]522 : Stmt(loc, std::move(labels)), stmt(stmt), mutexObjs(std::move(mutexes)) {}
[6cebfef]523
524 const Stmt * accept( Visitor & v ) const override { return v.visit( this ); }
[89a5a1f]525 private:
[6cebfef]526 MutexStmt * clone() const override { return new MutexStmt{ *this }; }
527 MUTATE_FRIEND
528};
[89a5a1f]529} // namespace ast
[2bb4a01]530
[f3cc5b6]531#undef MUTATE_FRIEND
532
[2bb4a01]533// Local Variables: //
534// mode: c++ //
[1e97287]535// End: //
Note: See TracBrowser for help on using the repository browser.