604        int allocated_slots = state->allocated_stack / BPF_REG_SIZE;  in is_spi_bounds_valid()
848 	for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in unmark_stack_slots_dynptr()
1438 	size_t n = src->allocated_stack / BPF_REG_SIZE;  in copy_stack_state()
1445 	dst->allocated_stack = src->allocated_stack;  in copy_stack_state()
1465 	size_t old_n = state->allocated_stack / BPF_REG_SIZE, n;  in grow_stack_state()
1478 	state->allocated_stack = size;  in grow_stack_state()
4527 			for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in mark_all_scalars_precise()
4557 		for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in mark_all_scalars_imprecise()
4786 				if (i >= func->allocated_stack / BPF_REG_SIZE) {  in __mark_chain_precision()
4788 						i, func->allocated_stack / BPF_REG_SIZE);  in __mark_chain_precision()
7321 		min_valid_off = -state->allocated_stack;  in check_stack_slot_within_bounds()
7969 			if (state->allocated_stack <= stack_off)  in check_stack_range_initialized()
7986 		if (state->allocated_stack <= slot) {  in check_stack_range_initialized()
8783 		for (i = 0; i < fold->allocated_stack / BPF_REG_SIZE; i++) {  in widen_imprecise_scalars()
16313 		for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in collect_linked_regs()
18213 	for (i = 0; i < st->allocated_stack / BPF_REG_SIZE; i++) {  in clean_func_state()
18483 	for (i = 0; i < old->allocated_stack; i++) {  in stacksafe()
18489 		    (i >= cur->allocated_stack ||  in stacksafe()
18511 		if (i >= cur->allocated_stack)  in stacksafe()
18812 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE &&  in propagate_liveness()
18813 			    i < parent->allocated_stack / BPF_REG_SIZE; i++) {  in propagate_liveness()
18855 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in propagate_precision()
18973 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in iter_active_depths_differ()
19310 		for (i = 0; i < frame->allocated_stack / BPF_REG_SIZE; i++) {  in is_state_visited()