/usr/include/hphp/hhbbc/bc.h is in hhvm-dev 3.11.1+dfsg-1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 | /*
+----------------------------------------------------------------------+
| HipHop for PHP |
+----------------------------------------------------------------------+
| Copyright (c) 2010-2015 Facebook, Inc. (http://www.facebook.com) |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| http://www.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
*/
#ifndef incl_HHBBC_BC_H_
#define incl_HHBBC_BC_H_
#include <vector>
#include <utility>
#include <type_traits>
#include <boost/mpl/has_xxx.hpp>
#include <algorithm>
#include <folly/Hash.h>
#include "hphp/util/tiny-vector.h"
#include "hphp/runtime/vm/hhbc.h"
#include "hphp/hhbbc/src-loc.h"
#include "hphp/hhbbc/misc.h"
#include "hphp/hhbbc/type-system.h"
namespace HPHP {
struct StringData;
struct ArrayData;
}
namespace HPHP { namespace HHBBC {
struct Bytecode;
namespace php {
struct Block;
struct Local;
struct Iter;
}
//////////////////////////////////////////////////////////////////////
/*
* The following creates a struct for each bytecode using the opcode
* table. Each opcode will be named bc::opcode, and has a single
* constructor that takes its immediate types in order.
*
* E.g.
*
* auto fpass = bc::FPassC { 2 }; // FPassC for arg 2
*/
//////////////////////////////////////////////////////////////////////
struct MElem {
MemberCode mcode;
union {
SString immStr;
int64_t immInt;
borrowed_ptr<php::Local> immLoc;
};
bool operator==(const MElem& o) const {
if (mcode != o.mcode) return false;
switch (mcode) {
case MEC: /* fallthrough */
case MPC: return true;
case MEL: /* fallthrough */
case MPL: return immLoc == o.immLoc;
case MET: /* fallthrough */
case MPT: /* fallthrough */
case MQT: return immStr == o.immStr;
case MEI: return immInt == o.immInt;
case MW: return true;
case InvalidMemberCode:
break;
}
not_reached();
}
bool operator!=(const MElem& o) const {
return !(*this == o);
}
};
struct MVector {
LocationCode lcode;
borrowed_ptr<php::Local> locBase;
std::vector<MElem> mcodes;
bool operator==(const MVector& o) const {
return lcode == o.lcode &&
locBase == o.locBase &&
mcodes == o.mcodes;
}
bool operator!=(const MVector& o) const {
return !(*this == o);
}
};
struct BCHashHelper {
static size_t hash(const MVector& vec) {
return vec.mcodes.size() | (static_cast<size_t>(vec.lcode) << 7);
}
static size_t hash(RepoAuthType rat) { return rat.hash(); }
static size_t hash(SString s) { return s->hash(); }
template<class T>
static size_t hash(const std::vector<T>& v) {
assert(!v.empty());
return v.size() && hash(v.front());
}
static size_t hash(std::pair<IterKind,borrowed_ptr<php::Iter>> kv) {
return std::hash<decltype(kv.second)>()(kv.second);
}
template<class T>
static typename std::enable_if<
std::is_enum<T>::value,
size_t
>::type hash(T t) {
using U = typename std::underlying_type<T>::type;
return std::hash<U>()(static_cast<U>(t));
}
template<class T>
static typename std::enable_if<
!std::is_enum<T>::value,
size_t
>::type hash(const T& t) { return std::hash<T>()(t); }
};
inline uint32_t numVecPops(const MVector& mvec) {
uint32_t ret = numLocationCodeStackVals(mvec.lcode);
for (auto& mc : mvec.mcodes) {
ret += mcodeStackVals(mc.mcode);
}
return ret;
}
using IterTabEnt = std::pair<IterKind,borrowed_ptr<php::Iter>>;
using IterTab = std::vector<IterTabEnt>;
using SwitchTab = std::vector<borrowed_ptr<php::Block>>;
// The final entry in the SSwitchTab is the default case, it will
// always have a nullptr for the string.
using SSwitchTabEnt = std::pair<SString,borrowed_ptr<php::Block>>;
using SSwitchTab = std::vector<SSwitchTabEnt>;
//////////////////////////////////////////////////////////////////////
namespace bc {
#define IMM_TY_MA MVector
#define IMM_TY_BLA SwitchTab
#define IMM_TY_SLA SSwitchTab
#define IMM_TY_ILA IterTab
#define IMM_TY_IVA int32_t
#define IMM_TY_I64A int64_t
#define IMM_TY_LA borrowed_ptr<php::Local>
#define IMM_TY_IA borrowed_ptr<php::Iter>
#define IMM_TY_DA double
#define IMM_TY_SA SString
#define IMM_TY_RATA RepoAuthType
#define IMM_TY_AA SArray
#define IMM_TY_BA borrowed_ptr<php::Block>
#define IMM_TY_OA(type) type
#define IMM_TY_VSA std::vector<SString>
#define IMM_NAME_MA(n) mvec
#define IMM_NAME_BLA(n) targets
#define IMM_NAME_SLA(n) targets
#define IMM_NAME_ILA(n) iterTab
#define IMM_NAME_IVA(n) arg##n
#define IMM_NAME_I64A(n) arg##n
#define IMM_NAME_LA(n) loc##n
#define IMM_NAME_IA(n) iter##n
#define IMM_NAME_DA(n) dbl##n
#define IMM_NAME_SA(n) str##n
#define IMM_NAME_RATA(n) rat
#define IMM_NAME_AA(n) arr##n
#define IMM_NAME_BA(n) target
#define IMM_NAME_OA_IMPL(n) subop##n
#define IMM_NAME_OA(type) IMM_NAME_OA_IMPL
#define IMM_NAME_VSA(n) keys
#define IMM_EXTRA_MA
#define IMM_EXTRA_BLA
#define IMM_EXTRA_SLA
#define IMM_EXTRA_ILA
#define IMM_EXTRA_IVA
#define IMM_EXTRA_I64A
#define IMM_EXTRA_LA
#define IMM_EXTRA_IA
#define IMM_EXTRA_DA
#define IMM_EXTRA_SA
#define IMM_EXTRA_RATA
#define IMM_EXTRA_AA
#define IMM_EXTRA_BA using has_target_flag = std::true_type;
#define IMM_EXTRA_OA(x)
#define IMM_EXTRA_VSA
#define IMM_MEM(which, n) IMM_TY_##which IMM_NAME_##which(n)
#define IMM_MEM_NA
#define IMM_MEM_ONE(x) IMM_MEM(x, 1);
#define IMM_MEM_TWO(x, y) IMM_MEM(x, 1); IMM_MEM(y, 2);
#define IMM_MEM_THREE(x, y, z) IMM_MEM(x, 1); IMM_MEM(y, 2); \
IMM_MEM(z, 3);
#define IMM_MEM_FOUR(x, y, z, l) IMM_MEM(x, 1); IMM_MEM(y, 2); \
IMM_MEM(z, 3); IMM_MEM(l, 4);
#define IMM_EQ(which, n) if (IMM_NAME_##which(n) != \
o.IMM_NAME_##which(n)) return false;
#define IMM_EQ_NA
#define IMM_EQ_ONE(x) IMM_EQ(x, 1);
#define IMM_EQ_TWO(x, y) IMM_EQ(x, 1); IMM_EQ(y, 2);
#define IMM_EQ_THREE(x, y, z) IMM_EQ(x, 1); IMM_EQ(y, 2); \
IMM_EQ(z, 3);
#define IMM_EQ_FOUR(x, y, z, l) IMM_EQ(x, 1); IMM_EQ(y, 2); \
IMM_EQ(z, 3); IMM_EQ(l, 4);
#define IMM_HASH_DO(...) folly::hash:: \
hash_combine_generic<BCHashHelper>( \
__VA_ARGS__)
#define IMM_HASH(which, n) IMM_NAME_##which(n)
#define IMM_HASH_NA 0
#define IMM_HASH_ONE(x) IMM_HASH_DO(IMM_HASH(x, 1))
#define IMM_HASH_TWO(x, y) IMM_HASH_DO(IMM_HASH(x, 1), \
IMM_HASH(y, 2))
#define IMM_HASH_THREE(x, y, z) IMM_HASH_DO(IMM_HASH(x, 1), \
IMM_HASH(y, 2), \
IMM_HASH(z, 3))
#define IMM_HASH_FOUR(x, y, z, l) IMM_HASH_DO(IMM_HASH(x, 1), \
IMM_HASH(y, 2), \
IMM_HASH(z, 3), \
IMM_HASH(l, 4))
#define IMM_EXTRA_NA
#define IMM_EXTRA_ONE(x) IMM_EXTRA_##x
#define IMM_EXTRA_TWO(x,y) IMM_EXTRA_ONE(x) IMM_EXTRA_ONE(y)
#define IMM_EXTRA_THREE(x,y,z) IMM_EXTRA_TWO(x,y) IMM_EXTRA_ONE(z)
#define IMM_EXTRA_FOUR(x,y,z,l) IMM_EXTRA_THREE(x,y,z) IMM_EXTRA_ONE(l)
#define IMM_CTOR(which, n) IMM_TY_##which IMM_NAME_##which(n)
#define IMM_CTOR_NA
#define IMM_CTOR_ONE(x) IMM_CTOR(x, 1)
#define IMM_CTOR_TWO(x, y) IMM_CTOR(x, 1), IMM_CTOR(y, 2)
#define IMM_CTOR_THREE(x, y, z) IMM_CTOR(x, 1), IMM_CTOR(y, 2), \
IMM_CTOR(z, 3)
#define IMM_CTOR_FOUR(x, y, z, l) IMM_CTOR(x, 1), IMM_CTOR(y, 2), \
IMM_CTOR(z, 3), IMM_CTOR(l, 4)
#define IMM_INIT(which, n) IMM_NAME_##which(n) ( IMM_NAME_##which(n) )
#define IMM_INIT_NA
#define IMM_INIT_ONE(x) : IMM_INIT(x, 1)
#define IMM_INIT_TWO(x, y) : IMM_INIT(x, 1), IMM_INIT(y, 2)
#define IMM_INIT_THREE(x, y, z) : IMM_INIT(x, 1), IMM_INIT(y, 2), \
IMM_INIT(z, 3)
#define IMM_INIT_FOUR(x, y, z, l) : IMM_INIT(x, 1), IMM_INIT(y, 2), \
IMM_INIT(z, 3), IMM_INIT(l, 4)
#define POP_UV if (i == 0) return Flavor::U
#define POP_CV if (i == 0) return Flavor::C
#define POP_AV if (i == 0) return Flavor::A
#define POP_VV if (i == 0) return Flavor::V
#define POP_FV if (i == 0) return Flavor::F
#define POP_RV if (i == 0) return Flavor::R
#define POP_NOV uint32_t numPop() const { return 0; } \
Flavor popFlavor(uint32_t) const { not_reached(); }
#define POP_ONE(x) uint32_t numPop() const { return 1; } \
Flavor popFlavor(uint32_t i) const { \
POP_##x; not_reached(); \
}
#define POP_TWO(x, y) uint32_t numPop() const { return 2; } \
Flavor popFlavor(uint32_t i) const { \
POP_##x; --i; POP_##y; not_reached(); \
}
#define POP_THREE(x, y, z) uint32_t numPop() const { return 3; } \
Flavor popFlavor(uint32_t i) const { \
POP_##x; --i; POP_##y; --i; POP_##z; \
not_reached(); \
}
#define POP_MMANY uint32_t numPop() const { return 0 + numVecPops(mvec); } \
Flavor popFlavor(uint32_t) const { not_reached(); }
#define POP_C_MMANY uint32_t numPop() const { return 1 + numVecPops(mvec); } \
Flavor popFlavor(uint32_t) const { not_reached(); }
#define POP_R_MMANY POP_C_MMANY
#define POP_V_MMANY POP_C_MMANY
#define POP_MFINAL uint32_t numPop() const { return arg1; } \
Flavor popFlavor(uint32_t) const { not_reached(); }
#define POP_C_MFINAL uint32_t numPop() const { return arg1 + 1; } \
Flavor popFlavor(uint32_t) const { not_reached(); }
#define POP_R_MFINAL POP_C_MFINAL
#define POP_V_MFINAL POP_C_MFINAL
#define POP_CMANY uint32_t numPop() const { return arg1; } \
Flavor popFlavor(uint32_t i) const { \
assert(i < numPop()); \
return Flavor::C; \
}
#define POP_SMANY uint32_t numPop() const { return keys.size(); } \
Flavor popFlavor(uint32_t i) const { \
assert(i < numPop()); \
return Flavor::C; \
}
#define POP_FMANY uint32_t numPop() const { return arg1; } \
Flavor popFlavor(uint32_t i) const { \
assert(i < numPop()); \
return Flavor::F; \
}
#define POP_CVMANY uint32_t numPop() const { return arg1; } \
Flavor popFlavor(uint32_t i) const { \
not_reached(); \
}
#define POP_CVUMANY uint32_t numPop() const { return arg1; } \
Flavor popFlavor(uint32_t i) const { \
return Flavor::CVU; \
}
#define POP_IDX_A uint32_t numPop() const { return arg2 + 1; } \
Flavor popFlavor(uint32_t i) const { \
return i == arg2 ? Flavor::C : Flavor::A; \
}
#define PUSH_NOV uint32_t numPush() const { return 0; }
#define PUSH_ONE(x) uint32_t numPush() const { return 1; }
#define PUSH_TWO(x, y) uint32_t numPush() const { return 2; }
#define PUSH_INS_1(...) uint32_t numPush() const { return 1; }
#define PUSH_INS_2(...) uint32_t numPush() const { return 1; }
#define PUSH_IDX_A uint32_t numPush() const { return arg2; }
#define O(opcode, imms, inputs, outputs, flags) \
struct opcode { \
static constexpr Op op = Op::opcode; \
explicit opcode ( IMM_CTOR_##imms ) \
IMM_INIT_##imms \
{} \
\
IMM_MEM_##imms \
IMM_EXTRA_##imms \
POP_##inputs \
PUSH_##outputs \
\
bool operator==(const opcode& o) const { \
IMM_EQ_##imms \
return true; \
} \
\
bool operator!=(const opcode& o) const { \
return !(*this == o); \
} \
\
size_t hash() const { \
return IMM_HASH_##imms; \
} \
};
OPCODES
#undef O
#undef PUSH_NOV
#undef PUSH_ONE
#undef PUSH_TWO
#undef PUSH_INS_1
#undef PUSH_INS_2
#undef PUSH_IDX_A
#undef POP_UV
#undef POP_CV
#undef POP_AV
#undef POP_VV
#undef POP_FV
#undef POP_RV
#undef POP_NOV
#undef POP_ONE
#undef POP_TWO
#undef POP_THREE
#undef POP_MMANY
#undef POP_C_MMANY
#undef POP_R_MMANY
#undef POP_V_MMANY
#undef POP_MFINAL
#undef POP_C_MFINAL
#undef POP_R_MFINAL
#undef POP_V_MFINAL
#undef POP_CMANY
#undef POP_SMANY
#undef POP_FMANY
#undef POP_CVMANY
#undef POP_CVUMANY
#undef POP_IDX_A
#undef IMM_TY_MA
#undef IMM_TY_BLA
#undef IMM_TY_SLA
#undef IMM_TY_ILA
#undef IMM_TY_IVA
#undef IMM_TY_I64A
#undef IMM_TY_LA
#undef IMM_TY_IA
#undef IMM_TY_DA
#undef IMM_TY_SA
#undef IMM_TY_RATA
#undef IMM_TY_AA
#undef IMM_TY_BA
#undef IMM_TY_OA
#undef IMM_TY_VSA
// These are deliberately not undefined, so they can be used in other
// places.
// #undef IMM_NAME_MA
// #undef IMM_NAME_BLA
// #undef IMM_NAME_SLA
// #undef IMM_NAME_ILA
// #undef IMM_NAME_IVA
// #undef IMM_NAME_I64A
// #undef IMM_NAME_LA
// #undef IMM_NAME_IA
// #undef IMM_NAME_DA
// #undef IMM_NAME_SA
// #undef IMM_NAME_RATA
// #undef IMM_NAME_AA
// #undef IMM_NAME_BA
// #undef IMM_NAME_OA
// #undef IMM_NAME_OA_IMPL
#undef IMM_EXTRA_MA
#undef IMM_EXTRA_BLA
#undef IMM_EXTRA_SLA
#undef IMM_EXTRA_ILA
#undef IMM_EXTRA_IVA
#undef IMM_EXTRA_I64A
#undef IMM_EXTRA_LA
#undef IMM_EXTRA_IA
#undef IMM_EXTRA_DA
#undef IMM_EXTRA_SA
#undef IMM_EXTRA_RATA
#undef IMM_EXTRA_AA
#undef IMM_EXTRA_BA
#undef IMM_EXTRA_OA
#undef IMM_MEM
#undef IMM_MEM_NA
#undef IMM_MEM_ONE
#undef IMM_MEM_TWO
#undef IMM_MEM_THREE
#undef IMM_MEM_FOUR
#undef IMM_EQ
#undef IMM_EQ_NA
#undef IMM_EQ_ONE
#undef IMM_EQ_TWO
#undef IMM_EQ_THREE
#undef IMM_EQ_FOUR
#undef IMM_HASH
#undef IMM_HASH_DO
#undef IMM_HASH_NA
#undef IMM_HASH_ONE
#undef IMM_HASH_TWO
#undef IMM_HASH_THREE
#undef IMM_HASH_FOUR
#undef IMM_CTOR
#undef IMM_CTOR_NA
#undef IMM_CTOR_ONE
#undef IMM_CTOR_TWO
#undef IMM_CTOR_THREE
#undef IMM_CTOR_FOUR
#undef IMM_INIT
#undef IMM_INIT_NA
#undef IMM_INIT_ONE
#undef IMM_INIT_TWO
#undef IMM_INIT_THREE
#undef IMM_INIT_FOUR
}
//////////////////////////////////////////////////////////////////////
/*
* Bytecode is a tagged-union that can hold any HHBC opcode struct
* defined above. You can visit a bytecode with a static_visitor
* using visit(), defined below.
*
* Each Bytecode also carries a corresponding SrcLoc that indicates
* which line of PHP code the bytecode was generated for.
*/
struct Bytecode {
// Default construction creates a Nop.
Bytecode()
: op(Op::Nop)
, Nop(bc::Nop{})
{}
#define O(opcode, ...) \
/* implicit */ Bytecode(bc::opcode data) \
: op(Op::opcode) \
{ \
new (&opcode) bc::opcode(std::move(data)); \
}
OPCODES
#undef O
// Note: assuming bc::Nop is empty and has trivial dtor/ctor.
Bytecode(const Bytecode& o) : op(Op::Nop) { *this = o; }
Bytecode(Bytecode&& o) noexcept : op(Op::Nop) { *this = std::move(o); }
Bytecode& operator=(const Bytecode& o) {
destruct();
op = Op::Nop;
srcLoc = o.srcLoc;
#define O(opcode, ...) \
case Op::opcode: new (&opcode) bc::opcode(o.opcode); break;
switch (o.op) { OPCODES }
#undef O
op = o.op;
return *this;
}
Bytecode& operator=(Bytecode&& o) {
destruct();
srcLoc = o.srcLoc;
#define O(opcode, ...) \
case Op::opcode: new (&opcode) bc::opcode(std::move(o.opcode)); break;
switch (o.op) { OPCODES }
#undef O
op = o.op;
return *this;
}
~Bytecode() { destruct(); }
uint32_t numPop() const {
#define O(opcode, ...) \
case Op::opcode: return opcode.numPop();
switch (op) { OPCODES }
#undef O
not_reached();
}
Flavor popFlavor(uint32_t i) const {
#define O(opcode, ...) \
case Op::opcode: return opcode.popFlavor(i);
switch (op) { OPCODES }
#undef O
not_reached();
}
uint32_t numPush() const {
#define O(opcode, ...) \
case Op::opcode: return opcode.numPush();
switch (op) { OPCODES }
#undef O
not_reached();
}
Op op;
php::SrcLoc srcLoc;
#define O(opcode, ...) bc::opcode opcode;
union { OPCODES };
#undef O
private:
void destruct() {
switch (op) {
#define O(opcode, ...) \
case Op::opcode: \
{ typedef bc::opcode X; \
this->opcode.~X(); } \
break;
OPCODES
#undef O
}
}
};
//////////////////////////////////////////////////////////////////////
inline bool operator==(const Bytecode& a, const Bytecode& b) {
if (a.op != b.op) return false;
#define O(opcode, ...) case Op::opcode: return a.opcode == b.opcode;
switch (a.op) { OPCODES }
#undef O
not_reached();
}
inline bool operator!=(const Bytecode& a, const Bytecode& b) {
return !(a == b);
}
inline size_t hash(const Bytecode& b) {
auto hash = 14695981039346656037ULL;
auto o = static_cast<size_t>(b.op);
hash ^= o;
#define O(opcode, ...) \
case Op::opcode: return folly::hash::hash_combine(b.opcode.hash(), hash);
switch (b.op) { OPCODES }
#undef O
not_reached();
}
//////////////////////////////////////////////////////////////////////
/*
* Helper for making a Bytecode with a given srcLoc.
*
* Ex:
* auto b = bc_with_loc(something.srcLoc, bc::Nop {});
*/
template<class T> Bytecode bc_with_loc(php::SrcLoc loc, const T& t) {
Bytecode b = t;
b.srcLoc = loc;
return b;
}
//////////////////////////////////////////////////////////////////////
/*
* Visit a bytecode using a StaticVisitor, similar to
* boost::apply_visitor or match().
*
* The `v' argument should be a function object that accepts a call
* operator for all the bc::Foo types, with a nested member typedef
* called result_type that indicates the return type of the call.
*/
template<class Visit>
typename Visit::result_type visit(const Bytecode& b, Visit v) {
#define O(opcode, ...) case Op::opcode: return v(b.opcode);
switch (b.op) { OPCODES }
#undef O
not_reached();
}
//////////////////////////////////////////////////////////////////////
BOOST_MPL_HAS_XXX_TRAIT_NAMED_DEF(has_target, has_target_flag, false);
//////////////////////////////////////////////////////////////////////
std::string show(const Bytecode& bc);
//////////////////////////////////////////////////////////////////////
}
}
#endif
|