Searched refs:curframe (Results 1 – 2 of 2) sorted by relevance
1562 for (i = 0; i <= state->curframe; i++) { in bpf_free_verifier_state()1598 for (i = src->curframe + 1; i <= dst_state->curframe; i++) { in bpf_copy_verifier_state()1607 dst_state->curframe = src->curframe; in bpf_copy_verifier_state()1616 for (i = 0; i <= src->curframe; i++) { in bpf_copy_verifier_state()1639 struct bpf_func_state *state = cur->frame[cur->curframe]; in bpf_explored_state()1648 if (a->curframe != b->curframe) in same_callsites()1651 for (fr = a->curframe; fr >= 0; fr--) in same_callsites()3490 struct bpf_func_state *state = vstate->frame[vstate->curframe]; in check_reg_arg()3833 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_fixed_off()3955 cur = env->cur_state->frame[env->cur_state->curframe]; in check_stack_write_var_off()[all …]
39 u32 curframe; member346 for (frame = 0; frame <= st->curframe; frame++) { in bpf_live_stack_query_init()352 if (frame < st->curframe) in bpf_live_stack_query_init()355 q->curframe = st->curframe; in bpf_live_stack_query_init()374 curframe_instance = q->instances[q->curframe]; in bpf_stack_slot_alive()377 cur_delta = (int)curframe_instance->depth - (int)q->curframe; in bpf_stack_slot_alive()385 for (i = frameno; i < q->curframe; i++) { in bpf_stack_slot_alive()