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