Home
last modified time | relevance | path

Searched refs:jt (Results 1 – 13 of 13) sorted by relevance

/linux-6.1.9/samples/seccomp/
Dbpf-helper.h55 #define SYSCALL(nr, jt) \ argument
57 jt
76 #define JEQ(x, jt) JEQ32(x, EXPAND(jt)) argument
77 #define JNE(x, jt) JNE32(x, EXPAND(jt)) argument
78 #define JGT(x, jt) JGT32(x, EXPAND(jt)) argument
79 #define JLT(x, jt) JLT32(x, EXPAND(jt)) argument
80 #define JGE(x, jt) JGE32(x, EXPAND(jt)) argument
81 #define JLE(x, jt) JLE32(x, EXPAND(jt)) argument
82 #define JA(x, jt) JA32(x, EXPAND(jt)) argument
103 #define JEQ(x, jt) \ argument
[all …]
Dbpf-helper.c35 switch ((instr->jt<<8)|instr->jf) { in bpf_resolve_jumps()
44 instr->jt = 0; in bpf_resolve_jumps()
55 instr->jt = 0; in bpf_resolve_jumps()
95 filter->code, filter->jt, filter->jf, filter->k); in seccomp_bpf_print()
/linux-6.1.9/tools/include/uapi/linux/
Dfilter.h26 __u8 jt; /* Jump true */ member
52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
/linux-6.1.9/include/uapi/linux/
Dfilter.h26 __u8 jt; /* Jump true */ member
52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k } argument
/linux-6.1.9/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()
450 bpf_disasm(*(f + f->jt + 1), r->Pc + f->jt + 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
484 out[curr_instr].jt = jt; in bpf_set_curr_instr()
567 out[i].jt = bpf_encode_jt_jf_offset(off, i); in bpf_reduce_jt_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.1.9/tools/testing/selftests/net/mptcp/
Dsimult_flows.sh176 ./mptcp_connect -jt ${timeout_poll} -l -p $port -T $time \
184 ./mptcp_connect -jt ${timeout_poll} -p $port -T $time \
/linux-6.1.9/Documentation/networking/
Dfilter.rst78 __u8 jt; /* Jump true */
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.1.9/arch/sparc/net/
Dbpf_jit_comp_32.c653 t_offset = addrs[i + filter[i].jt]; in bpf_jit_compile()
656 if (filter[i].jt == filter[i].jf) { in bpf_jit_compile()
692 if (filter[i].jt != 0) { in bpf_jit_compile()
/linux-6.1.9/Documentation/bpf/
Dclassic_vs_extended.rst55 - 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.1.9/kernel/
Dseccomp.c777 pc += op_res ? insn->jt : insn->jf; in seccomp_is_const_allow()
/linux-6.1.9/net/core/
Dfilter.c739 target = i + fp->jt + 1; in bpf_convert_filter()
745 if (fp->jt == 0) { in bpf_convert_filter()
766 target = i + fp->jt + 1; in bpf_convert_filter()
953 masks[pc + 1 + filter[pc].jt] &= memvalid; in check_load_and_stores()
1107 if (pc + ftest->jt + 1 >= flen || in bpf_check_classic()
/linux-6.1.9/
D.mailmap199 Jean Tourrilhes <jt@hpl.hp.com>