Home
last modified time | relevance | path

Searched refs:jf (Results 1 – 10 of 10) sorted by relevance

/Linux-v4.19/samples/seccomp/
Dbpf-helper.c35 switch ((instr->jt<<8)|instr->jf) { in bpf_resolve_jumps()
45 instr->jf = 0; in bpf_resolve_jumps()
56 instr->jf = 0; in bpf_resolve_jumps()
95 filter->code, filter->jt, filter->jf, filter->k); in seccomp_bpf_print()
/Linux-v4.19/include/uapi/linux/
Dfilter.h27 __u8 jf; /* Jump false */ member
52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
/Linux-v4.19/tools/bpf/
Dbpf_dbg.c433 i + 1 + f.jt, i + 1 + f.jf); in bpf_disasm()
444 f->code, f->jt, f->jf, f->k); in bpf_dump_curr()
448 if (f->jt || f->jf) { in bpf_dump_curr()
452 bpf_disasm(*(f + f->jf + 1), r->Pc + f->jf + 1); in bpf_dump_curr()
495 f[i].code, f[i].jt, f[i].jf, f[i].k); in bpf_dump_all()
734 r->Pc += r->A > r->X ? f->jt : f->jf; in bpf_single_step()
737 r->Pc += r->A > K ? f->jt : f->jf; in bpf_single_step()
740 r->Pc += r->A >= r->X ? f->jt : f->jf; in bpf_single_step()
743 r->Pc += r->A >= K ? f->jt : f->jf; in bpf_single_step()
746 r->Pc += r->A == r->X ? f->jt : f->jf; in bpf_single_step()
[all …]
Dbpf_exp.y43 static void bpf_set_curr_instr(uint16_t op, uint8_t jt, uint8_t jf, uint32_t k);
479 static void bpf_set_curr_instr(uint16_t code, uint8_t jt, uint8_t jf, in bpf_set_curr_instr() argument
485 out[curr_instr].jf = jf; in bpf_set_curr_instr()
567 out[i].jf = (uint8_t) (off - i - 1); in bpf_reduce_jf_jumps()
585 out[i].jt, out[i].jf, out[i].k); in bpf_pretty_print_c()
595 out[i].jt, out[i].jf, out[i].k); in bpf_pretty_print()
/Linux-v4.19/arch/powerpc/net/
Dbpf_jit_comp.c486 if (filter[i].jt == filter[i].jf) { in bpf_jit_build_body()
531 addrs[i + 1 + filter[i].jf]); in bpf_jit_build_body()
534 if (filter[i].jf != 0) in bpf_jit_build_body()
535 PPC_JMP(addrs[i + 1 + filter[i].jf]); in bpf_jit_build_body()
/Linux-v4.19/arch/mips/net/
Dbpf_jit.c678 __func__, inst->code, inst->jt, inst->jf, inst->k); in build_body()
971 b_off = b_imm(i + inst->jf + 1, ctx); in build_body()
984 b_off = b_imm(i + inst->jf + 1, ctx); in build_body()
1009 b_off = b_imm(i + inst->jf + 1, in build_body()
1023 b_off = b_imm(i + inst->jf + 1, ctx); in build_body()
1040 b_off = b_imm(i + inst->jf + 1, ctx); in build_body()
1053 b_off = b_imm(i + inst->jf + 1, ctx); in build_body()
/Linux-v4.19/arch/sparc/net/
Dbpf_jit_comp_32.c653 cond_branch: f_offset = addrs[i + filter[i].jf]; in bpf_jit_compile()
657 if (filter[i].jt == filter[i].jf) { in bpf_jit_compile()
694 if (filter[i].jf) in bpf_jit_compile()
698 if (filter[i].jf) { in bpf_jit_compile()
/Linux-v4.19/Documentation/networking/
Dfilter.txt67 __u8 jf; /* Jump false */
72 a code, jt, jf and k value. jt and jf are jump offsets and k a generic
191 op:16, jt:8, jf:8, k:32
194 encoded. jt and jf are two 8 bit wide jump targets, one for condition
407 /* { op, jt, jf, k }, */
429 code: [40] jt[0] jf[0] k[12] <-- plain BPF code of current instruction
660 - Conditional jt/jf targets replaced with jt/fall-through:
815 op:16, jt:8, jf:8, k:32 ==> op:8, dst_reg:4, src_reg:4, off:16, imm:32
/Linux-v4.19/Documentation/
D00-INDEX10 - Japanese, maintained by the JF Project (jf@listserv.linux.or.jp), at
/Linux-v4.19/net/core/
Dfilter.c712 if (fp->jf == 0) { in bpf_convert_filter()
735 target = i + fp->jf + 1; in bpf_convert_filter()
747 target = i + fp->jf + 1; in bpf_convert_filter()
929 masks[pc + 1 + filter[pc].jf] &= memvalid; in check_load_and_stores()
1083 pc + ftest->jf + 1 >= flen) in bpf_check_classic()