/linux-6.12.1/samples/seccomp/ |
D | bpf-helper.c | 35 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-6.12.1/tools/include/uapi/linux/ |
D | filter.h | 27 __u8 jf; /* Jump false */ member 52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
|
/linux-6.12.1/include/uapi/linux/ |
D | filter.h | 27 __u8 jf; /* Jump false */ member 52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
|
/linux-6.12.1/tools/bpf/ |
D | bpf_dbg.c | 433 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 …]
|
D | bpf_exp.y | 43 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() 579 out[i].jf = bpf_encode_jt_jf_offset(off, i); in bpf_reduce_jf_jumps() 597 out[i].jt, out[i].jf, out[i].k); in bpf_pretty_print_c() 607 out[i].jt, out[i].jf, out[i].k); in bpf_pretty_print()
|
/linux-6.12.1/arch/sparc/net/ |
D | bpf_jit_comp_32.c | 652 cond_branch: f_offset = addrs[i + filter[i].jf]; in bpf_jit_compile() 656 if (filter[i].jt == filter[i].jf) { in bpf_jit_compile() 693 if (filter[i].jf) in bpf_jit_compile() 697 if (filter[i].jf) { in bpf_jit_compile()
|
/linux-6.12.1/Documentation/networking/ |
D | filter.rst | 79 __u8 jf; /* Jump false */ 84 a code, jt, jf and k value. jt and jf are jump offsets and k a generic 207 op:16, jt:8, jf:8, k:32 210 encoded. jt and jf are two 8 bit wide jump targets, one for condition 446 /* { op, jt, jf, k }, */ 475 code: [40] jt[0] jf[0] k[12] <-- plain BPF code of current instruction
|
/linux-6.12.1/Documentation/driver-api/cxl/ |
D | maturity-map.rst | 200 <http://lore.kernel.org/r/66035c2e8ba17_770232948b@dwillia2-xfh.jf.intel.com.notmuch>`_
|
/linux-6.12.1/Documentation/bpf/ |
D | classic_vs_extended.rst | 55 - Conditional jt/jf targets replaced with jt/fall-through: 212 op:16, jt:8, jf:8, k:32 ==> op:8, dst_reg:4, src_reg:4, off:16, imm:32
|
/linux-6.12.1/kernel/ |
D | seccomp.c | 799 pc += op_res ? insn->jt : insn->jf; in seccomp_is_const_allow()
|
/linux-6.12.1/net/core/ |
D | filter.c | 746 if (fp->jf == 0) { in bpf_convert_filter() 769 target = i + fp->jf + 1; in bpf_convert_filter() 781 target = i + fp->jf + 1; in bpf_convert_filter() 963 masks[pc + 1 + filter[pc].jf] &= memvalid; in check_load_and_stores() 1117 pc + ftest->jf + 1 >= flen) in bpf_check_classic()
|