Searched refs:BPF_JA (Results 1 – 11 of 11) sorted by relevance
26 if (BPF_OP(instruction->code) != BPF_JA) { in TraverseRecursively()98 if (BPF_OP(iter->code) == BPF_JA) { in PrintProgram()154 if (BPF_CLASS(code) == BPF_JMP && BPF_OP(code) != BPF_JA) { in MakeInstruction()181 if (BPF_CLASS(code) != BPF_JMP || BPF_OP(code) == BPF_JA) { in MakeInstruction()219 if (BPF_OP(insn->code) != BPF_JA) { in FindBranchTargets()347 if (BPF_OP(insn->code) != BPF_JA) { in CutGraphIntoBasicBlocks()470 if (BPF_OP(insn1.code) != BPF_JA) { in PointerCompare()531 if (BPF_OP(last_insn->code) != BPF_JA) { in ComputeIncomingBranches()574 if (BPF_OP(last_insn->code) != BPF_JA) { in TopoSortBasicBlocks()597 Instruction* ja = MakeInstruction(BPF_JMP + BPF_JA, 0, last_insn->next); in TopoSortBasicBlocks()[all …]
106 Instruction* insn2 = codegen->MakeInstruction(BPF_JMP + BPF_JA, 0, insn1); in SampleProgramComplex()108 SANDBOX_ASSERT(insn2->code == BPF_JMP + BPF_JA); in SampleProgramComplex()285 if (BPF_OP(insn->code) != BPF_JA) { in FindBranchTargets()402 BPF_OP((*iter)->code) != BPF_JA) { in MergeTails()420 if (BPF_OP(insn->code) != BPF_JA) { in MergeTails()473 if (BPF_OP(insn->code) == BPF_JA) { in CompileAndCompare()510 if (BPF_OP(insn.code) == BPF_JA) { in CompileAndCompare()
190 if (BPF_OP(insn.code) == BPF_JA) { in Jmp()
153 case BPF_JMP|BPF_JA:295 if (BPF_CLASS(p->code) == BPF_JMP && BPF_OP(p->code) != BPF_JA) {
407 case BPF_JMP|BPF_JA:658 case BPF_JA:
2044 if (BPF_CLASS(src->s.code) != BPF_JMP || src->s.code == (BPF_JMP|BPF_JA)) { in convert_code_r()2121 dst[extrajmps].code = BPF_JMP|BPF_JA; in convert_code_r()2138 dst[extrajmps].code = BPF_JMP|BPF_JA; in convert_code_r()
2169 sjcommon = new_stmt(JMP(BPF_JA)); in gen_load_prism_llprefixlen()5653 s[i] = new_stmt(BPF_JMP|BPF_JA);5728 s[i] = new_stmt(BPF_JMP|BPF_JA);
76 #define BPF_JA 0x00 macro
1287 #define BPF_JA 0x00 macro
8339 if (insn->code == (BPF_JMP|BPF_JA)) { in add_monitor_filter()