Home
last modified time | relevance | path

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

/linux-6.15/include/linux/
H A Dbpf_verifier.h342 int allocated_stack; member
477 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
484 iter < frame->allocated_stack / BPF_REG_SIZE; \
/linux-6.15/tools/testing/selftests/bpf/progs/
H A Dverifier_search_pruning.c277 __naked void allocated_stack(void) in allocated_stack() function
/linux-6.15/kernel/bpf/
H A Dverifier.c1438 size_t n = src->allocated_stack / BPF_REG_SIZE; in copy_stack_state()
1445 dst->allocated_stack = src->allocated_stack; in copy_stack_state()
1478 state->allocated_stack = size; in grow_stack_state()
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()
18483 for (i = 0; i < old->allocated_stack; i++) { in stacksafe()
18489 (i >= cur->allocated_stack || in stacksafe()
[all …]
H A Dlog.c777 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()