Searched refs:jf (Results 1 - 8 of 8) sorted by relevance
/linux-master/tools/include/uapi/linux/ |
H A D | filter.h | 27 __u8 jf; /* Jump false */ member in struct:sock_filter 52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k }
|
/linux-master/samples/seccomp/ |
H A D | bpf-helper.c | 35 switch ((instr->jt<<8)|instr->jf) { 45 instr->jf = 0; 56 instr->jf = 0; 94 printf("{ code=%u,jt=%u,jf=%u,k=%u },\n", 95 filter->code, filter->jt, filter->jf, filter->k);
|
/linux-master/include/uapi/linux/ |
H A D | filter.h | 27 __u8 jf; /* Jump false */ member in struct:sock_filter 52 #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k }
|
/linux-master/tools/bpf/ |
H A D | bpf_dbg.c | 433 i + 1 + f.jt, i + 1 + f.jf); 443 rl_printf("code: [%u] jt[%u] jf[%u] k[%u]\n", 444 f->code, f->jt, f->jf, f->k); 448 if (f->jt || f->jf) { 451 rl_printf("jf: "); 452 bpf_disasm(*(f + f->jf + 1), r->Pc + f->jf + 1); 492 rl_printf("/* { op, jt, jf, k }, */\n"); 495 f[i].code, f[i].jt, f[i].jf, f[i].k); 734 r->Pc += r->A > r->X ? f->jt : f->jf; [all...] |
H 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, 485 out[curr_instr].jf = jf; 579 out[i].jf = bpf_encode_jt_jf_offset(off, i); 597 out[i].jt, out[i].jf, out[i].k); 607 out[i].jt, out[i].jf, out[i].k);
|
/linux-master/arch/sparc/net/ |
H A D | bpf_jit_comp_32.c | 652 cond_branch: f_offset = addrs[i + filter[i].jf]; 656 if (filter[i].jt == filter[i].jf) { 693 if (filter[i].jf) 697 if (filter[i].jf) {
|
/linux-master/kernel/ |
H A D | seccomp.c | 786 pc += op_res ? insn->jt : insn->jf;
|
/linux-master/net/core/ |
H A D | filter.c | 742 if (fp->jf == 0) { 765 target = i + fp->jf + 1; 777 target = i + fp->jf + 1; 959 masks[pc + 1 + filter[pc].jf] &= memvalid; 1113 pc + ftest->jf + 1 >= flen)
|
Completed in 230 milliseconds