Home
last modified time | relevance | path

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

/openbmc/linux/include/linux/
H A Dbpf_verifier.h318 int allocated_stack; member
417 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
424 iter < frame->allocated_stack / BPF_REG_SIZE; \
/openbmc/linux/tools/testing/selftests/bpf/progs/
H A Dverifier_search_pruning.c276 __naked void allocated_stack(void) in allocated_stack() function
/openbmc/linux/kernel/bpf/
H A Dverifier.c694 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
1019 for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()
1452 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
1624 size_t n = src->allocated_stack / BPF_REG_SIZE; in copy_stack_state()
1631 dst->allocated_stack = src->allocated_stack; in copy_stack_state()
1651 size_t old_n = state->allocated_stack / BPF_REG_SIZE, n = size / BPF_REG_SIZE; in grow_stack_state()
1660 state->allocated_stack = size; in grow_stack_state()
4012 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_precise()
4042 for (j = 0; j < func->allocated_stack / BPF_REG_SIZE; j++) { in mark_all_scalars_imprecise()
4105 if (i >= func->allocated_stack / BPF_REG_SIZE) in mark_precise_scalar_ids()
[all …]