593        int allocated_slots = state->allocated_stack / BPF_REG_SIZE;  in is_spi_bounds_valid()
832 	for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in unmark_stack_slots_dynptr()
1274 	size_t n = src->allocated_stack / BPF_REG_SIZE;  in copy_stack_state()
1281 	dst->allocated_stack = src->allocated_stack;  in copy_stack_state()
1301 	size_t old_n = state->allocated_stack / BPF_REG_SIZE, n;  in grow_stack_state()
1314 	state->allocated_stack = size;  in grow_stack_state()
4146 			for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in mark_all_scalars_precise()
4176 		for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in mark_all_scalars_imprecise()
4404 				if (i >= func->allocated_stack / BPF_REG_SIZE) {  in __mark_chain_precision()
4406 						i, func->allocated_stack / BPF_REG_SIZE);  in __mark_chain_precision()
6812 		min_valid_off = -state->allocated_stack;  in check_stack_slot_within_bounds()
7358 			if (state->allocated_stack <= stack_off)  in check_stack_range_initialized()
7375 		if (state->allocated_stack <= slot) {  in check_stack_range_initialized()
8120 		for (i = 0; i < fold->allocated_stack / BPF_REG_SIZE; i++) {  in widen_imprecise_scalars()
15293 		for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) {  in collect_linked_regs()
17126 	for (i = 0; i < st->allocated_stack / BPF_REG_SIZE; i++) {  in clean_func_state()
17392 	for (i = 0; i < old->allocated_stack; i++) {  in stacksafe()
17398 		    (i >= cur->allocated_stack ||  in stacksafe()
17420 		if (i >= cur->allocated_stack)  in stacksafe()
17696 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE &&  in propagate_liveness()
17697 			    i < parent->allocated_stack / BPF_REG_SIZE; i++) {  in propagate_liveness()
17739 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in propagate_precision()
17857 		for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) {  in iter_active_depths_differ()
18209 		for (i = 0; i < frame->allocated_stack / BPF_REG_SIZE; i++) {  in is_state_visited()