https://perl5.git.perl.org / perl5.git / blame
| Commit | Line | Data |
|---|---|---|
| e8edd1e6 TH |
1 | typedef char *pvcontents; |
| 2 | typedef char *strconst; | |
| 3 | typedef U32 PV; | |
| 4 | typedef char *op_tr_array; | |
| 5 | typedef int comment_t; | |
| 6 | typedef SV *svindex; | |
| 7 | typedef OP *opindex; | |
| 8 | typedef IV IV64; | |
| 9 | ||
| 10 | #define BGET_FREAD(argp, len, nelem) \ | |
| 4f63d024 GS |
11 | bs.pfread((char*)(argp),(len),(nelem),bs.data) |
| 12 | #define BGET_FGETC() bs.pfgetc(bs.data) | |
| e8edd1e6 TH |
13 | |
| 14 | #define BGET_U32(arg) \ | |
| 15 | BGET_FREAD(&arg, sizeof(U32), 1); arg = PerlSock_ntohl((U32)arg) | |
| e8edd1e6 TH |
16 | #define BGET_I32(arg) \ |
| 17 | BGET_FREAD(&arg, sizeof(I32), 1); arg = (I32)PerlSock_ntohl((U32)arg) | |
| 18 | #define BGET_U16(arg) \ | |
| 19 | BGET_FREAD(&arg, sizeof(U16), 1); arg = PerlSock_ntohs((U16)arg) | |
| 20 | #define BGET_U8(arg) arg = BGET_FGETC() | |
| 21 | ||
| 22 | #define BGET_PV(arg) STMT_START { \ | |
| 23 | BGET_U32(arg); \ | |
| 24 | if (arg) \ | |
| 4f63d024 | 25 | bs.pfreadpv(arg, bs.data, &bytecode_pv); \ |
| e8edd1e6 TH |
26 | else { \ |
| 27 | bytecode_pv.xpv_pv = 0; \ | |
| 28 | bytecode_pv.xpv_len = 0; \ | |
| 29 | bytecode_pv.xpv_cur = 0; \ | |
| 30 | } \ | |
| 31 | } STMT_END | |
| 32 | ||
| 33 | #define BGET_comment_t(arg) \ | |
| 34 | do { arg = BGET_FGETC(); } while (arg != '\n' && arg != EOF) | |
| 35 | ||
| 36 | /* | |
| 37 | * In the following, sizeof(IV)*4 is just a way of encoding 32 on 64-bit-IV | |
| 38 | * machines such that 32-bit machine compilers don't whine about the shift | |
| 39 | * count being too high even though the code is never reached there. | |
| 40 | */ | |
| 41 | #define BGET_IV64(arg) STMT_START { \ | |
| 42 | U32 hi, lo; \ | |
| 43 | BGET_U32(hi); \ | |
| 44 | BGET_U32(lo); \ | |
| 45 | if (sizeof(IV) == 8) \ | |
| 46 | arg = (IV) (hi << (sizeof(IV)*4) | lo); \ | |
| 47 | else if (((I32)hi == -1 && (I32)lo < 0) \ | |
| 48 | || ((I32)hi == 0 && (I32)lo >= 0)) { \ | |
| 49 | arg = (I32)lo; \ | |
| 50 | } \ | |
| 51 | else { \ | |
| 52 | bytecode_iv_overflows++; \ | |
| 53 | arg = 0; \ | |
| 54 | } \ | |
| 55 | } STMT_END | |
| 56 | ||
| 57 | #define BGET_op_tr_array(arg) do { \ | |
| 58 | unsigned short *ary; \ | |
| 59 | int i; \ | |
| 60 | New(666, ary, 256, unsigned short); \ | |
| 61 | BGET_FREAD(ary, 256, 2); \ | |
| 62 | for (i = 0; i < 256; i++) \ | |
| 63 | ary[i] = PerlSock_ntohs(ary[i]); \ | |
| 64 | arg = (char *) ary; \ | |
| 65 | } while (0) | |
| 66 | ||
| 67 | #define BGET_pvcontents(arg) arg = bytecode_pv.xpv_pv | |
| 68 | #define BGET_strconst(arg) STMT_START { \ | |
| 69 | for (arg = PL_tokenbuf; (*arg = BGET_FGETC()); arg++) /* nothing */; \ | |
| 70 | arg = PL_tokenbuf; \ | |
| 71 | } STMT_END | |
| 72 | ||
| 73 | #define BGET_double(arg) STMT_START { \ | |
| 74 | char *str; \ | |
| 75 | BGET_strconst(str); \ | |
| 76 | arg = atof(str); \ | |
| 77 | } STMT_END | |
| 78 | ||
| 79 | #define BGET_objindex(arg, type) STMT_START { \ | |
| 80 | U32 ix; \ | |
| 81 | BGET_U32(ix); \ | |
| 82 | arg = (type)bytecode_obj_list[ix]; \ | |
| 83 | } STMT_END | |
| 84 | #define BGET_svindex(arg) BGET_objindex(arg, svindex) | |
| 85 | #define BGET_opindex(arg) BGET_objindex(arg, opindex) | |
| 86 | ||
| 87 | #define BSET_ldspecsv(sv, arg) sv = specialsv_list[arg] | |
| 88 | ||
| 89 | #define BSET_sv_refcnt_add(svrefcnt, arg) svrefcnt += arg | |
| 90 | #define BSET_gp_refcnt_add(gprefcnt, arg) gprefcnt += arg | |
| 91 | #define BSET_gp_share(sv, arg) STMT_START { \ | |
| 92 | gp_free((GV*)sv); \ | |
| 93 | GvGP(sv) = GvGP(arg); \ | |
| 94 | } STMT_END | |
| 95 | ||
| 96 | #define BSET_gv_fetchpv(sv, arg) sv = (SV*)gv_fetchpv(arg, TRUE, SVt_PV) | |
| 97 | #define BSET_gv_stashpv(sv, arg) sv = (SV*)gv_stashpv(arg, TRUE) | |
| 98 | #define BSET_sv_magic(sv, arg) sv_magic(sv, Nullsv, arg, 0, 0) | |
| 99 | #define BSET_mg_pv(mg, arg) mg->mg_ptr = arg; mg->mg_len = bytecode_pv.xpv_cur | |
| 100 | #define BSET_sv_upgrade(sv, arg) (void)SvUPGRADE(sv, arg) | |
| 101 | #define BSET_xpv(sv) do { \ | |
| 102 | SvPV_set(sv, bytecode_pv.xpv_pv); \ | |
| 103 | SvCUR_set(sv, bytecode_pv.xpv_cur); \ | |
| 104 | SvLEN_set(sv, bytecode_pv.xpv_len); \ | |
| 105 | } while (0) | |
| 106 | #define BSET_av_extend(sv, arg) av_extend((AV*)sv, arg) | |
| 107 | ||
| 108 | #define BSET_av_push(sv, arg) av_push((AV*)sv, arg) | |
| 109 | #define BSET_hv_store(sv, arg) \ | |
| 110 | hv_store((HV*)sv, bytecode_pv.xpv_pv, bytecode_pv.xpv_cur, arg, 0) | |
| 111 | #define BSET_pv_free(pv) Safefree(pv.xpv_pv) | |
| 112 | #define BSET_pregcomp(o, arg) \ | |
| 113 | ((PMOP*)o)->op_pmregexp = arg ? \ | |
| cea2e8a9 | 114 | CALLREGCOMP(aTHX_ arg, arg + bytecode_pv.xpv_cur, ((PMOP*)o)) : 0 |
| e8edd1e6 TH |
115 | #define BSET_newsv(sv, arg) sv = NEWSV(666,0); SvUPGRADE(sv, arg) |
| 116 | #define BSET_newop(o, arg) o = (OP*)safemalloc(optype_size[arg]) | |
| 117 | #define BSET_newopn(o, arg) STMT_START { \ | |
| 118 | OP *oldop = o; \ | |
| 119 | BSET_newop(o, arg); \ | |
| 120 | oldop->op_next = o; \ | |
| 121 | } STMT_END | |
| 122 | ||
| 123 | #define BSET_ret(foo) return | |
| 124 | ||
| 125 | /* | |
| 126 | * Kludge special-case workaround for OP_MAPSTART | |
| 127 | * which needs the ppaddr for OP_GREPSTART. Blech. | |
| 128 | */ | |
| 129 | #define BSET_op_type(o, arg) STMT_START { \ | |
| 130 | o->op_type = arg; \ | |
| 131 | if (arg == OP_MAPSTART) \ | |
| 132 | arg = OP_GREPSTART; \ | |
| 133 | o->op_ppaddr = PL_ppaddr[arg]; \ | |
| 134 | } STMT_END | |
| cea2e8a9 | 135 | #define BSET_op_ppaddr(o, arg) Perl_croak(aTHX_ "op_ppaddr not yet implemented") |
| e8edd1e6 TH |
136 | #define BSET_curpad(pad, arg) STMT_START { \ |
| 137 | PL_comppad = (AV *)arg; \ | |
| 138 | pad = AvARRAY(arg); \ | |
| 139 | } STMT_END | |
| 140 | ||
| 141 | #define BSET_OBJ_STORE(obj, ix) \ | |
| 142 | (I32)ix > bytecode_obj_list_fill ? \ | |
| 0cb96387 | 143 | bset_obj_store(aTHXo_ obj, (I32)ix) : (bytecode_obj_list[ix] = obj) |