Searched refs:curframe (Results 1 – 3 of 3) sorted by relevance
92 u32 curframe; /* depth of callsites and sp_starts arrays */ member121 u32 curframe; member148 if (i < st->curframe) in compute_callchain()151 callchain->curframe = frameno; in compute_callchain()152 callchain->callsites[callchain->curframe] = callchain->sp_starts[callchain->curframe]; in compute_callchain()157 return jhash2(callchain->callsites, callchain->curframe, 0); in hash_callchain()164 if (a->curframe != b->curframe) in same_callsites()166 for (i = a->curframe; i >= 0; i--) in same_callsites()190 subprog = bpf_find_containing_subprog(env, callchain->sp_starts[callchain->curframe]); in __lookup_instance()236 for (i = 0; i <= instance->callchain.curframe; i++) in bpf_stack_liveness_free()[all …]
1693 for (i = 0; i <= state->curframe; i++) { in free_verifier_state()1760 for (i = src->curframe + 1; i <= dst_state->curframe; i++) { in copy_verifier_state()1770 dst_state->curframe = src->curframe; in copy_verifier_state()1779 for (i = 0; i <= src->curframe; i++) { in copy_verifier_state()1802 struct bpf_func_state *state = cur->frame[cur->curframe]; in explored_state()1811 if (a->curframe != b->curframe) in same_callsites()1814 for (fr = a->curframe; fr >= 0; fr--) in same_callsites()1824 return frame == st->curframe in frame_insn_idx()1849 for (i = 0; i <= st->curframe; i++) { in compute_scc_callchain()1855 } else if (i < st->curframe) { in compute_scc_callchain()[all …]
350 if (reg->frameno != env->cur_state->curframe) in nfp_bpf_check_stack_access()