HomeSort by: relevance | last modified time | path
    Searched refs:jf (Results 1 - 25 of 36) sorted by relevancy

1 2

  /src/external/bsd/libpcap/dist/
bpf_dump.c 46 insn->jt, insn->jf, insn->k);
53 insn->code, insn->jt, insn->jf, insn->k);
bpf_filter.c 246 pc += (A > pc->k) ? pc->jt : pc->jf;
250 pc += (A >= pc->k) ? pc->jt : pc->jf;
254 pc += (A == pc->k) ? pc->jt : pc->jf;
258 pc += (A & pc->k) ? pc->jt : pc->jf;
262 pc += (A > X) ? pc->jt : pc->jf;
266 pc += (A >= X) ? pc->jt : pc->jf;
270 pc += (A == X) ? pc->jt : pc->jf;
274 pc += (A & X) ? pc->jt : pc->jf;
514 if (from + p->jt >= (u_int)len || from + p->jf >= (u_int)len)
rpcap-protocol.h 337 uint8 jf; /* relative offset to jump to in case of 'false' */ member in struct:rpcap_filterbpf_insn
optimize.c 394 find_levels_r(opt_state, ic, JF(b));
395 level = MAX(JT(b)->level, JF(b)->level) + 1;
454 SET_INTERSECT(JF(b)->dom, b->dom, opt_state->nodewords);
527 SET_UNION(JF(b)->closure, b->closure, opt_state->nodewords);
706 p->out_use |= JT(p)->in_use | JF(p)->in_use;
890 JT(b) = JF(b);
891 JF(b) = tmp;
1127 JT(b) = JF(b);
1129 JF(b) = JT(b);
1170 if (JF(b) != JT(b))
2771 int jt, jf; local
    [all...]
gencode.c 938 * which of the jt and jf fields has been resolved and which is a pointer
952 next = JF(list);
953 JF(list) = target;
961 * which of jt and jf is the link.
970 p = !((*p)->sense) ? &JT(*p) : &JF(*p);
2592 sjeq_avs_cookie->s.jf = s2;
2602 sjcommon->s.jf = s2;
2879 sjset_data_frame_1->s.jf = snext;
2887 sjset_data_frame_2->s.jf = sjset_qos = new_stmt(cstate, JMP(BPF_JSET));
2931 sjset_qos->s.jf = s2 = new_stmt(cstate, BPF_LD|BPF_ABS|BPF_W)
    [all...]
gencode.h 227 struct slist *jf; /* only for relative jump in block */ member in struct:stmt
280 u_int longjf; /* jf branch requires long jump */
285 struct edge ef; /* edge corresponding to the jf branch */
420 #define JF(b) ((b)->ef.succ)
bpf_image.c 422 n, op, operand, n + 1 + p->jt, n + 1 + p->jf);
pcap-rpcap-unix.c 474 data[3] = prog->bf_insns[i].jf;
  /src/external/bsd/tcpdump/dist/
bpf_dump.c 47 insn->jt, insn->jf, insn->k);
54 insn->code, insn->jt, insn->jf, insn->k);
  /src/external/bsd/libpcap/dist/pcap/
bpf.h 249 u_char jf; member in struct:bpf_insn
270 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
  /src/usr.sbin/npf/npfctl/
npf_bpf_comp.c 93 * the jt and jf continuations in the first pass, and then, once
233 if (insn->jf == JUMP_MAGIC) {
234 insn->jf = fail_off;
240 insn->jt = insn->jf;
241 insn->jf = jt;
426 const uint8_t jf = ver ? JUMP_MAGIC : 0; local
445 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, ver, jt, jf),
480 const uint8_t jf = type ? JUMP_MAGIC : 0; local
498 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, type, jt, jf),
647 uint8_t jf; local
798 const unsigned jf = usingmask ? 3 : 2; local
    [all...]
  /src/external/bsd/ipf/bin/ipftest/
bpf_filter.c 356 pc += (A > pc->k) ? pc->jt : pc->jf;
360 pc += (A >= pc->k) ? pc->jt : pc->jf;
364 pc += (A == pc->k) ? pc->jt : pc->jf;
368 pc += (A & pc->k) ? pc->jt : pc->jf;
372 pc += (A > X) ? pc->jt : pc->jf;
376 pc += (A >= X) ? pc->jt : pc->jf;
380 pc += (A == X) ? pc->jt : pc->jf;
384 pc += (A & X) ? pc->jt : pc->jf;
579 if (from + p->jt >= len || from + p->jf >= len)
bpf-ipf.h 408 u_char jf; member in struct:bpf_insn
416 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
  /src/external/bsd/dhcpcd/dist/src/
bpf.c 70 (insn)->jf = 0; \
77 (insn)->jf = (f); \
363 uint8_t jt, jf; local
387 jf = 0;
390 jf = (uint8_t)njmps;
409 htonl(mac32), jt, jf);
416 htons(mac16), jt, jf);
422 *hwaddr, jt, jf);
426 if (jf)
427 jf = (uint8_t)(jf - 2)
    [all...]
  /src/sys/net/
bpf_filter.c 440 pc += (A > pc->k) ? pc->jt : pc->jf;
444 pc += (A >= pc->k) ? pc->jt : pc->jf;
448 pc += (A == pc->k) ? pc->jt : pc->jf;
452 pc += (A & pc->k) ? pc->jt : pc->jf;
456 pc += (A > X) ? pc->jt : pc->jf;
460 pc += (A >= X) ? pc->jt : pc->jf;
464 pc += (A == X) ? pc->jt : pc->jf;
468 pc += (A & X) ? pc->jt : pc->jf;
769 if (from + p->jt >= len || from + p->jf >= len)
777 mem[from + p->jf] |= invalid
    [all...]
bpfjit.c 173 * jtf[1] - when coming from jf path.
1288 uint32_t jt, jf; local
1423 jt = jf = insns[i].k;
1426 jf = insns[i].jf;
1430 jf >= insn_count - (i + 1)) {
1434 if (jt > 0 && jf > 0)
1438 jf += i + 1;
1446 if (jf != jt) {
1448 SLIST_INSERT_HEAD(&insn_dat[jf].bjumps
1715 uint32_t jt, jf; local
    [all...]
bpf.h 337 u_char jf; member in struct:bpf_insn
355 #define BPF_JUMP(code, k, jt, jf) { (uint16_t)(code), jt, jf, k }
  /src/external/bsd/wpa/dist/src/drivers/
driver_nl80211_monitor.c 305 if (insn->jf == PASS)
306 insn->jf = msock_filter.len - idx - 2;
307 else if (insn->jf == FAIL)
308 insn->jf = msock_filter.len - idx - 3;
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-prop.cc 2184 /* Assign to JF a pointer to ipa_bits structure with VALUE and MASK. Use hash
2188 ipa_set_jfunc_bits (ipa_jump_func *jf, const widest_int &value,
2191 jf->bits = ipa_get_ipa_bits_for_value (value, mask);
2222 /* Assign to JF a pointer to a value_range structure with TYPE, MIN and MAX and
2227 ipa_set_jfunc_vr (ipa_jump_func *jf, enum value_range_kind type,
2230 jf->m_vr = ipa_get_value_range (type, min, max);
2233 /* Assign to JF a pointer to a value_range just like TMP but either fetch a
2237 ipa_set_jfunc_vr (ipa_jump_func *jf, value_range *tmp)
2239 jf->m_vr = ipa_get_value_range (tmp);
4158 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i) local
4261 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i); local
4303 struct ipa_jump_func *jf; local
4410 struct ipa_jump_func *jf; local
    [all...]
ipa-prop.h 984 ipa_jump_func *jf; local
985 FOR_EACH_VEC_SAFE_ELT (jump_functions, i, jf)
986 vec_free (jf->agg.items);
ipa-modref.cc 4271 struct ipa_jump_func *jf local
4273 if (jf && callee_pi)
4276 jf,
4285 if (jf && jf->type == IPA_JF_PASS_THROUGH)
4288 = ipa_get_jf_pass_through_formal_id (jf);
4289 if (ipa_get_jf_pass_through_operation (jf) == NOP_EXPR)
4294 else if (ipa_get_jf_pass_through_operation (jf)
4296 && ptrdiff_tree_p (ipa_get_jf_pass_through_operand (jf),
4303 if (jf && jf->type == IPA_JF_ANCESTOR
4425 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, size_arg); local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
ipa-prop.cc 2290 /* Assign to JF a pointer to a range just like TMP but either fetch a
2294 ipa_set_jfunc_vr (ipa_jump_func *jf, const vrange &tmp)
2296 jf->m_vr = ipa_get_value_range (tmp);
2300 ipa_set_jfunc_vr (ipa_jump_func *jf, const ipa_vr &vr)
2304 ipa_set_jfunc_vr (jf, tmp);
4241 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i); local
4244 if (jf->type == IPA_JF_PASS_THROUGH
4245 && !ipa_get_jf_pass_through_refdesc_decremented (jf))
4248 src_idx = ipa_get_jf_pass_through_formal_id (jf);
4252 gcc_checking_assert (ipa_get_jf_pass_through_operation (jf)
4343 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, i); local
4385 struct ipa_jump_func *jf; local
4488 struct ipa_jump_func *jf; local
    [all...]
ipa-modref.cc 4327 struct ipa_jump_func *jf local
4329 if (jf && callee_pi)
4332 jf,
4341 if (jf && jf->type == IPA_JF_PASS_THROUGH)
4344 = ipa_get_jf_pass_through_formal_id (jf);
4345 if (ipa_get_jf_pass_through_operation (jf) == NOP_EXPR)
4350 else if (ipa_get_jf_pass_through_operation (jf)
4352 && ptrdiff_tree_p (ipa_get_jf_pass_through_operand (jf),
4359 if (jf && jf->type == IPA_JF_ANCESTOR
4481 struct ipa_jump_func *jf = ipa_get_ith_jump_func (args, size_arg); local
    [all...]
ipa-prop.h 1022 ipa_jump_func *jf; local
1023 FOR_EACH_VEC_SAFE_ELT (jump_functions, i, jf)
1024 vec_free (jf->agg.items);
  /src/external/mit/lua/dist/src/
lparser.c 1657 int jf; /* instruction to skip 'then' code (if condition is false) */ local
1673 jf = luaK_jump(fs);
1678 jf = v.f;
1685 luaK_patchtohere(fs, jf);

Completed in 46 milliseconds

1 2