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

  /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/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/tests/lib/libbpfjit/
t_bpfjit.c 3465 insns[2*BPF_MEMWORDS+3*k+1].jf = 2;
3630 insns[2*BPF_MEMWORDS+3*k+1].jf = 2;
  /src/tests/net/bpfjit/
t_bpfjit.c 3300 insns[2*BPF_MEMWORDS+3*k+1].jf = 2;
3481 insns[2*BPF_MEMWORDS+3*k+1].jf = 2;

Completed in 31 milliseconds