HomeSort by relevance Sort by last modified time
    Searched full:jt_ptr (Results 1 - 3 of 3) sorted by null

  /external/chromium_org/sandbox/linux/seccomp-bpf/
instruction.h 34 : code(c), jt_ptr(jt), jf_ptr(jf), k(parm) {}
49 Instruction* jt_ptr, *jf_ptr; member in struct:sandbox::Instruction::__anon15179::__anon15181
codegen.cc 29 TraverseRecursively(visited, instruction->jt_ptr);
218 ++(*branch_targets)[insn->jt_ptr];
224 if (seen_instructions.find(insn->jt_ptr) == seen_instructions.end()) {
228 insn = insn->jt_ptr;
265 if (seen_instructions.find(insn->jt_ptr) == seen_instructions.end()) {
350 insn = insn->jt_ptr;
456 // jt_ptr and jf_ptr fields. Anything else can continue to the next
478 return PointerCompare(blocks.find(insn1.jt_ptr)->second,
479 blocks.find(insn2.jt_ptr)->second,
528 ComputeIncomingBranches(targets_to_blocks.find(last_insn->jt_ptr)->second
    [all...]
codegen_unittest.cc 109 SANDBOX_ASSERT(insn2->jt_ptr == insn1);
123 SANDBOX_ASSERT(insn4->jt_ptr == insn2);
282 target_instructions.insert(insn->jt_ptr);
283 SANDBOX_ASSERT(insn->jt_ptr != NULL);
284 SANDBOX_ASSERT(branch_targets.find(insn->jt_ptr) != end);
291 insn = insn->jt_ptr;
423 bb = all_blocks[insn->jt_ptr];
475 next = insn->jt_ptr;
479 next = insn->jt_ptr;

Completed in 1293 milliseconds