Lines Matching defs:insn_off
207 * for insn_off to the jited_off mapping (insn_to_jit_off).
209 * The idx to this array is the insn_off. Hence, the insn_off
228 * insn_to_jit_off[linfo[i].insn_off - insn_start - 1]
243 insn_start = linfo[0].insn_off;
251 for (i = 1; i < nr_linfo && linfo[i].insn_off < insn_end; i++)
252 /* The verifier ensures that linfo[i].insn_off is
256 insn_to_jit_off[linfo[i].insn_off - insn_start - 1];
449 if (off < linfo[i].insn_off)
452 /* Push all off < linfo[i].insn_off by delta */
454 linfo[i].insn_off += delta;
3482 const struct bpf_line_info *bpf_find_linfo(const struct bpf_prog *prog, u32 insn_off)
3489 if (!nr_linfo || insn_off >= prog->len)
3493 /* Loop invariant: linfo[l].insn_off <= insns_off.
3494 * linfo[0].insn_off == 0 which always satisfies above condition.
3503 * l=1, r=2, linfo[l].insn_off <= insn_off, linfo[r].insn_off > insn_off,
3504 * then m=2, we see that linfo[m].insn_off > insn_off, and so
3510 if (linfo[m].insn_off <= insn_off)
3540 insn_start = linfo[0].insn_off;
3545 linfo[i].insn_off >= insn_start && linfo[i].insn_off < insn_end; i++) {