lib/libpcap/gencode.c

390

next = JT(list);

lib/libpcap/gencode.c

391

JT(list) = target;

lib/libpcap/gencode.c

411

p = !((*p)->sense) ? &JT(*p) : &JF(*p);

lib/libpcap/optimize.c

1187

return sense ? JT(child) : JF(child);

lib/libpcap/optimize.c

1207

if (JT(ep->succ) == 0)

lib/libpcap/optimize.c

1210

if (JT(ep->succ) == JF(ep->succ)) {

lib/libpcap/optimize.c

1217

ep->succ = JT(ep->succ);

lib/libpcap/optimize.c

1244

if (JT(target) != 0)

lib/libpcap/optimize.c

1277

if (JT(b->in_edges->pred) == b)

lib/libpcap/optimize.c

1278

diffp = &JT(b->in_edges->pred);

lib/libpcap/optimize.c

1287

if (JT(*diffp) != JT(b))

lib/libpcap/optimize.c

1304

if (JT(*samep) != JT(b))

lib/libpcap/optimize.c

1336

if (JT(ep->pred) == b)

lib/libpcap/optimize.c

1337

JT(ep->pred) = pull;

lib/libpcap/optimize.c

1368

if (JT(b->in_edges->pred) == b)

lib/libpcap/optimize.c

1369

diffp = &JT(b->in_edges->pred);

lib/libpcap/optimize.c

1387

diffp = &JT(*diffp);

lib/libpcap/optimize.c

1390

samep = &JT(*diffp);

lib/libpcap/optimize.c

1407

samep = &JT(*samep);

lib/libpcap/optimize.c

1417

*samep = JT(pull);

lib/libpcap/optimize.c

1418

JT(pull) = *diffp;

lib/libpcap/optimize.c

1427

if (JT(ep->pred) == b)

lib/libpcap/optimize.c

1428

JT(ep->pred) = pull;

lib/libpcap/optimize.c

1494

link_inedge(&b->et, JT(b));

lib/libpcap/optimize.c

1507

while (BPF_CLASS((*b)->s.code) == BPF_JMP && JT(*b) == JF(*b))

lib/libpcap/optimize.c

1508

*b = JT(*b);

lib/libpcap/optimize.c

1572

make_marks(JT(p));

lib/libpcap/optimize.c

1651

if (JT(p) == 0)

lib/libpcap/optimize.c

1653

if (JT(p)->link) {

lib/libpcap/optimize.c

1655

JT(p) = JT(p)->link;

lib/libpcap/optimize.c

1702

return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;

lib/libpcap/optimize.c

1722

number_blks_r(JT(p));

lib/libpcap/optimize.c

1738

n = count_stmts(JT(p)) + count_stmts(JF(p));

lib/libpcap/optimize.c

1891

if (convert_code_r(JT(p)) == 0)

lib/libpcap/optimize.c

1989

if (JT(p)) {

lib/libpcap/optimize.c

1991

off = JT(p)->offset - (p->offset + slen) - 1;

lib/libpcap/optimize.c

212

if (JT(b)) {

lib/libpcap/optimize.c

213

find_levels_r(JT(b));

lib/libpcap/optimize.c

215

level = MAX(JT(b)->level, JF(b)->level) + 1;

lib/libpcap/optimize.c

263

if (JT(b) == 0)

lib/libpcap/optimize.c

265

SET_INTERSECT(JT(b)->dom, b->dom, nodewords);

lib/libpcap/optimize.c

330

if (JT(b) == 0)

lib/libpcap/optimize.c

332

SET_UNION(JT(b)->closure, b->closure, nodewords);

lib/libpcap/optimize.c

476

p->out_use |= JT(p)->in_use | JF(p)->in_use;

lib/libpcap/optimize.c

628

struct block *tmp = JT(b);

lib/libpcap/optimize.c

630

JT(b) = JF(b);

lib/libpcap/optimize.c

751

struct block *t = JT(b);

lib/libpcap/optimize.c

752

JT(b) = JF(b);

lib/libpcap/optimize.c

780

struct block *t = JT(b);

lib/libpcap/optimize.c

781

JT(b) = JF(b);

lib/libpcap/optimize.c

827

if (JF(b) != JT(b))

lib/libpcap/optimize.c

830

JF(b) = JT(b);

lib/libpcap/optimize.c

832

JT(b) = JF(b);