OP
#define NEXT_TLV(OP, LEN) { \
if ((LEN) >= (8 + (OP)->attr_len)) { \
uint8_t *b1 = (uint8_t *)(OP); \
(LEN) -= (8 + (OP)->attr_len); \
b1 += (8 + (OP)->attr_len); \
(OP) = (isns_tlv_t *)b1; \
(OP) = NULL; \
#define NEXT_OP(OP, OP_LEN, OP_TYPE) \
NEXT_TLV((OP), (OP_LEN));\
(OP)->attr_id >= TAG_RANGE[OP_TYPE][0] &&\
(OP)->attr_id <= TAG_RANGE[OP_TYPE][2]);
#define FOR_EACH_OP(OP, OP_LEN, OP_TYPE, STMT) \
OP_TYPE = TLV2TYPE(OP);\
NEXT_OP((OP), (OP_LEN), (OP_TYPE));\
if ((op = OP(text[j])) & OP_ARITH_MEM_MASK) {
} else if (OP(text[j]) == 1) {
switch (OP(instructp)) {
int (*OP)();
OP = Pline; Pline = normline;
Pline = OP;
if (OP(g->strip[pc+OPND(s)]) != (sop)O_CH) {
assert(OP(g->strip[pc+OPND(s)]) == (sop)OOR2);
switch (OP(m->g->strip[es])) {
while (OP(m->g->strip[es]) != (sop)O_CH)
switch (OP(m->g->strip[ss])) {
assert(OP(m->g->strip[esub]) == OOR1);
assert(OP(m->g->strip[esub]) == OOR1);
assert(OP(m->g->strip[esub]) == OOR2);
if (OP(m->g->strip[esub]) == (sop)OOR2)
assert(OP(m->g->strip[esub]) == O_CH);
switch (OP(s = m->g->strip[ss])) {
assert(OP(s) == OOR2);
} while (OP(s = m->g->strip[ss]) != (sop)O_CH);
switch (OP(s)) {
assert(OP(m->g->strip[esub]) == OOR1);
if (OP(m->g->strip[esub]) == (sop)O_CH)
assert(OP(m->g->strip[esub]) == (sop)OOR2);
if (OP(m->g->strip[esub]) == (sop)OOR2)
assert(OP(m->g->strip[esub]) == O_CH);
switch (OP(s)) {
assert(OP(g->strip[pc+OPND(s)]) == (sop)OOR2);
OP(s = g->strip[pc+look]) != (sop)O_CH;
assert(OP(s) == (sop)OOR2);
p->strip[pos] = OP(p->strip[pos]) | value;
switch (OP(s)) {
if (OP(s) != (sop)O_QUEST &&
OP(s) != (sop)O_CH && OP(s) != (sop)OOR2) {
} while (OP(s) != (sop)O_QUEST && OP(s) != (sop)O_CH);
} while (OP(s) != OEND);
while (OP(s = *scan++) != OCHAR)
while (OP(s) != (sop)O_QUEST && OP(s) != (sop)O_CH) {
switch (OP(s)) {
if (OP(s) != (sop)O_QUEST &&
OP(s) != (sop)O_CH && OP(s) != (sop)OOR2)
} while (OP(s) != (sop)O_QUEST && OP(s) != (sop)O_CH);
switch (OP(s)) {
} while (OP(s) != OEND);
assert(OP(p->strip[p->pbegin[i]]) == OLPAREN);
assert(OP(p->strip[p->pend[i]]) == ORPAREN);
if (OP(text[i]) == OP_BRANCH) {
op = uap->uc_mcontext.fpregs.fp_reg_set.fpchip_state.state[OP] >> 16;
op = uap->uc_mcontext.fpregs.fp_reg_set.fpchip_state.state[OP] >> 16;
op = uap->uc_mcontext.fpregs.fp_reg_set.fpchip_state.state[OP] >> 16;
expr(A) ::= expr(X) likeop(OP) expr(Y). [LIKE] {
if( A ) A->op = OP;
expr(A) ::= expr(X) NOT likeop(OP) expr(Y). [LIKE] {
if( A ) A->op = OP;
#define OPCODE(OP,NG,SW,TF,N,FL) \
[OP_##OP] = { \
#define OPCODE_RANGE(OP,S,E)
SET_VAR_FIELD(cam_addr, VFC_CAM_ADDR, OP, VFC_OPCODE_CAM_RD);
SET_VAR_FIELD(ram_addr, VFC_RAM_ADDR, OP, VFC_OPCODE_RAM_RD);
#define VERIFY3_IMPL(LEFT, OP, RIGHT, TYPE) do { \
if (!(__left OP __right)) \
assfail3(#LEFT " " #OP " " #RIGHT, \
(uintmax_t)__left, #OP, (uintmax_t)__right, \
#define KT_ASSERT_IMPL(LEFT, OP, RIGHT, TYPE, ctx) do { \
const boolean_t __res = __left OP __right; \
(#LEFT), (#OP), (#RIGHT), \
(uintmax_t)__left, (#OP), (uintmax_t)__right); \
#define KT_ASSERTG_IMPL(LEFT, OP, RIGHT, TYPE, ctx, label) do { \
const boolean_t __res = __left OP __right; \
(#LEFT), (#OP), (#RIGHT), \
(uintmax_t)__left, (#OP), (uintmax_t)__right); \
#define KT_EASSERT_IMPL(LEFT, OP, RIGHT, TYPE, ctx) do { \
const boolean_t __res = __left OP __right; \
(#LEFT), (#OP), (#RIGHT), \
(uintmax_t)__left, #OP, (uintmax_t)__right); \
#define KT_EASSERTG_IMPL(LEFT, OP, RIGHT, TYPE, ctx, label) do { \
const boolean_t __res = __left OP __right; \
(#LEFT), (#OP), (#RIGHT), \
(uintmax_t)__left, #OP, (uintmax_t)__right); \
if (OP(instr) == 1) {
} else if (OP(instr) == 0) {
} else if (OP(instr) == 2) {
} else if (OP(instr) == 3) {
!(OP(instr) == 2 && OP3(instr) == OP3_RETURN)))