Lines Matching refs:allocated_stack
666 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
1138 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
1273 size_t n = src->allocated_stack / BPF_REG_SIZE; in copy_stack_state()
1280 dst->allocated_stack = src->allocated_stack; in copy_stack_state()
1297 size_t old_n = state->allocated_stack / BPF_REG_SIZE, n = size / BPF_REG_SIZE; in grow_stack_state()
1306 state->allocated_stack = size; in grow_stack_state()
3060 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_precise()
3086 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_imprecise()
3323 if (i >= func->allocated_stack / BPF_REG_SIZE) { in __mark_chain_precision()
5222 min_valid_off = -state->allocated_stack; in check_stack_slot_within_bounds()
5735 if (state->allocated_stack <= stack_off) in check_stack_range_initialized()
5752 if (state->allocated_stack <= slot) in check_stack_range_initialized()
13742 for (i = 0; i < st->allocated_stack / BPF_REG_SIZE; i++) { in clean_func_state()
13927 for (i = 0; i < old->allocated_stack; i++) { in stacksafe()
13942 if (i >= cur->allocated_stack) in stacksafe()
14176 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE && in propagate_liveness()
14177 i < parent->allocated_stack / BPF_REG_SIZE; i++) { in propagate_liveness()
14213 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in propagate_precision()
14460 for (i = 0; i < frame->allocated_stack / BPF_REG_SIZE; i++) { in is_state_visited()