Home
last modified time | relevance | path

Searched refs:allocated_stack (Results 1 – 7 of 7) sorted by relevance

/linux/kernel/bpf/
H A Dstates.c418 for (i = 0; i < st->allocated_stack / BPF_REG_SIZE; i++) { in __clean_func_state()
712 for (i = 0; i < old->allocated_stack; i++) { in stacksafe()
720 u8 cur_type = i < cur->allocated_stack ? in stacksafe()
728 if (i >= cur->allocated_stack || old_type != cur_type) in stacksafe()
743 if (i >= cur->allocated_stack) in stacksafe()
1049 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in propagate_precision()
1198 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in iter_active_depths_differ()
1228 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_imprecise()
H A Dbacktrack.c686 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in bpf_mark_all_scalars_precise()
925 if (verifier_bug_if(i >= func->allocated_stack / BPF_REG_SIZE, in bpf_mark_chain_precision()
927 i, func->allocated_stack / BPF_REG_SIZE)) in bpf_mark_chain_precision()
H A Dlog.c719 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
H A Ddiagnostics.c1571 if (target->spi >= state->allocated_stack / BPF_REG_SIZE) in target_to_reg()
1589 u32 nslots = state->allocated_stack / BPF_REG_SIZE; in reg_to_target()
H A Dverifier.c538 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
1337 size_t n = src->allocated_stack / BPF_REG_SIZE; in copy_stack_state()
1344 dst->allocated_stack = src->allocated_stack; in copy_stack_state()
1376 size_t old_n = state->allocated_stack / BPF_REG_SIZE, n; in grow_stack_state()
1389 state->allocated_stack = size; in grow_stack_state()
6185 min_valid_off = -state->allocated_stack; in check_stack_slot_within_bounds()
6904 if (state->allocated_stack <= slot) { in check_stack_range_initialized()
7861 num_slots = min(fold->allocated_stack / BPF_REG_SIZE, in widen_imprecise_scalars()
7862 fcur->allocated_stack / BPF_REG_SIZE); in widen_imprecise_scalars()
16713 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in collect_linked_regs()
/linux/tools/testing/selftests/bpf/progs/
H A Dverifier_search_pruning.c277 __naked void allocated_stack(void) in allocated_stack() function
/linux/include/linux/
H A Dbpf_verifier.h403 int allocated_stack; member
535 if (slot < frame->allocated_stack / BPF_REG_SIZE && in bpf_get_spilled_reg()
553 iter < frame->allocated_stack / BPF_REG_SIZE; \