jf                481 arch/powerpc/net/bpf_jit_comp.c 			if (filter[i].jt == filter[i].jf) {
jf                526 arch/powerpc/net/bpf_jit_comp.c 					addrs[i + 1 + filter[i].jf]);
jf                529 arch/powerpc/net/bpf_jit_comp.c 				if (filter[i].jf != 0)
jf                530 arch/powerpc/net/bpf_jit_comp.c 					PPC_JMP(addrs[i + 1 + filter[i].jf]);
jf                652 arch/sparc/net/bpf_jit_comp_32.c cond_branch:			f_offset = addrs[i + filter[i].jf];
jf                656 arch/sparc/net/bpf_jit_comp_32.c 				if (filter[i].jt == filter[i].jf) {
jf                693 arch/sparc/net/bpf_jit_comp_32.c 					if (filter[i].jf)
jf                697 arch/sparc/net/bpf_jit_comp_32.c 					if (filter[i].jf) {
jf                 27 include/uapi/linux/filter.h 	__u8	jf;	/* Jump false */
jf                 52 include/uapi/linux/filter.h #define BPF_JUMP(code, k, jt, jf) { (unsigned short)(code), jt, jf, k }
jf                714 net/core/filter.c 			if (fp->jf == 0) {
jf                737 net/core/filter.c 				target = i + fp->jf + 1;
jf                749 net/core/filter.c 			target = i + fp->jf + 1;
jf                931 net/core/filter.c 			masks[pc + 1 + filter[pc].jf] &= memvalid;
jf               1085 net/core/filter.c 			    pc + ftest->jf + 1 >= flen)
jf                 35 samples/seccomp/bpf-helper.c 		switch ((instr->jt<<8)|instr->jf) {
jf                 45 samples/seccomp/bpf-helper.c 			instr->jf = 0;
jf                 56 samples/seccomp/bpf-helper.c 			instr->jf = 0;
jf                 95 samples/seccomp/bpf-helper.c 			filter->code, filter->jt, filter->jf, filter->k);
jf                433 tools/bpf/bpf_dbg.c 			  i + 1 + f.jt, i + 1 + f.jf);
jf                444 tools/bpf/bpf_dbg.c 		  f->code, f->jt, f->jf, f->k);
jf                448 tools/bpf/bpf_dbg.c 	if (f->jt || f->jf) {
jf                452 tools/bpf/bpf_dbg.c 		bpf_disasm(*(f + f->jf + 1), r->Pc + f->jf + 1);
jf                495 tools/bpf/bpf_dbg.c 			  f[i].code, f[i].jt, f[i].jf, f[i].k);
jf                734 tools/bpf/bpf_dbg.c 		r->Pc += r->A > r->X ? f->jt : f->jf;
jf                737 tools/bpf/bpf_dbg.c 		r->Pc += r->A > K ? f->jt : f->jf;
jf                740 tools/bpf/bpf_dbg.c 		r->Pc += r->A >= r->X ? f->jt : f->jf;
jf                743 tools/bpf/bpf_dbg.c 		r->Pc += r->A >= K ? f->jt : f->jf;
jf                746 tools/bpf/bpf_dbg.c 		r->Pc += r->A == r->X ? f->jt : f->jf;
jf                749 tools/bpf/bpf_dbg.c 		r->Pc += r->A == K ? f->jt : f->jf;
jf                752 tools/bpf/bpf_dbg.c 		r->Pc += r->A & r->X ? f->jt : f->jf;
jf                755 tools/bpf/bpf_dbg.c 		r->Pc += r->A & K ? f->jt : f->jf;
jf               1027 tools/bpf/bpf_dbg.c 			   &tmp.code, &tmp.jt, &tmp.jf, &tmp.k) != 4) {
jf               1034 tools/bpf/bpf_dbg.c 		bpf_image[i].jf = tmp.jf;
jf                 43 tools/bpf/bpf_exp.y static void bpf_set_curr_instr(uint16_t op, uint8_t jt, uint8_t jf, uint32_t k);
jf                479 tools/bpf/bpf_exp.y static void bpf_set_curr_instr(uint16_t code, uint8_t jt, uint8_t jf,
jf                485 tools/bpf/bpf_exp.y 	out[curr_instr].jf = jf;
jf                567 tools/bpf/bpf_exp.y 			out[i].jf = (uint8_t) (off - i - 1);
jf                585 tools/bpf/bpf_exp.y 		       out[i].jt, out[i].jf, out[i].k);
jf                595 tools/bpf/bpf_exp.y 		       out[i].jt, out[i].jf, out[i].k);