Home
last modified time | relevance | path

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

/Linux-v6.6/include/linux/
Dbpf_verifier.h307 int allocated_stack; member
389 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
396 iter < frame->allocated_stack / BPF_REG_SIZE; \
/Linux-v6.6/tools/testing/selftests/bpf/progs/
Dverifier_search_pruning.c276 __naked void allocated_stack(void) in allocated_stack() function
/Linux-v6.6/kernel/bpf/
Dverifier.c683 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
1008 for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()
1441 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
1612 size_t n = src->allocated_stack / BPF_REG_SIZE; in copy_stack_state()
1619 dst->allocated_stack = src->allocated_stack; in copy_stack_state()
1636 size_t old_n = state->allocated_stack / BPF_REG_SIZE, n = size / BPF_REG_SIZE; in grow_stack_state()
1645 state->allocated_stack = size; in grow_stack_state()
3749 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_precise()
3779 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_imprecise()
3842 if (i >= func->allocated_stack / BPF_REG_SIZE) in mark_precise_scalar_ids()
[all …]