Searched refs:jf (Results 1 – 10 of 10) sorted by relevance
| /linux-6.3-rc2/samples/seccomp/ |
| A 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.3-rc2/tools/include/uapi/linux/ |
| A 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.3-rc2/include/uapi/linux/ |
| A 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.3-rc2/tools/bpf/ |
| A 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()
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()
743 r->Pc += r->A >= K ? f->jt : f->jf; in bpf_single_step()
749 r->Pc += r->A == K ? f->jt : f->jf; in bpf_single_step()
752 r->Pc += r->A & r->X ? f->jt : f->jf; in bpf_single_step()
755 r->Pc += r->A & K ? f->jt : f->jf; in bpf_single_step()
[all …]
|
| A 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.3-rc2/arch/sparc/net/ |
| A 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.3-rc2/Documentation/networking/ |
| A 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.3-rc2/Documentation/bpf/ |
| A 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.3-rc2/kernel/ |
| A D | seccomp.c | 777 pc += op_res ? insn->jt : insn->jf; in seccomp_is_const_allow()
|
| /linux-6.3-rc2/net/core/ |
| A D | filter.c | 737 if (fp->jf == 0) { in bpf_convert_filter()
760 target = i + fp->jf + 1; in bpf_convert_filter()
772 target = i + fp->jf + 1; in bpf_convert_filter()
954 masks[pc + 1 + filter[pc].jf] &= memvalid; in check_load_and_stores()
1108 pc + ftest->jf + 1 >= flen) in bpf_check_classic()
|
Completed in 40 milliseconds