Lines Matching refs:next
26 TraverseRecursively(visited, instruction->next);
139 Instruction* next) {
141 // them are followed by exactly one "next" instruction.
142 // We allow callers to defer specifying "next", but then they must call
149 if (next && BPF_CLASS(code) == BPF_RET) {
154 Instruction* insn = new Instruction(code, 0, next, NULL);
159 Instruction* insn = new Instruction(code, k, next);
198 // a value for "next" when creating the instruction.
216 } else if (head->next) {
219 head->next = tail;
267 // This is a non-jump instruction, just continue to the next instruction
270 if (!insn->next != (BPF_CLASS(insn->code) == BPF_RET)) {
275 if (seen_instructions.find(insn->next) == seen_instructions.end()) {
276 insn = insn->next;
313 for (;; head = head->next) {
405 insn = insn->next;
553 ComputeIncomingBranches(targets_to_blocks.find(last_insn->next)->second,
602 // pick the next "first_block" from "last_insn->next", if possible.
604 iter = blocks.find(last_insn->next);
609 // Our basic block is supposed to be followed by "last_insn->next",
612 Instruction* ja = MakeInstruction(BPF_JMP + BPF_JA, 0, last_insn->next);
614 last_insn->next = ja;
697 targets_to_blocks.find(insn->next)->second != last_bb) {
701 // Proceed to next basic block.
