Home
last modified time | relevance | path

Searched refs:BPF_REG_SIZE (Results 1 - 7 of 7) sorted by relevance

/kernel/linux/linux-5.10/include/linux/
H A Dbpf_verifier.h162 #define BPF_REG_SIZE 8 /* size of eBPF register in bytes */ macro
166 u8 slot_type[BPF_REG_SIZE];
215 #define BPF_ID_MAP_SIZE (MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE)
285 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
292 iter < frame->allocated_stack / BPF_REG_SIZE; \
/kernel/linux/linux-6.6/include/linux/
H A Dbpf_verifier.h242 #define BPF_REG_SIZE 8 /* size of eBPF register in bytes */ macro
249 #define BPF_DYNPTR_NR_SLOTS (BPF_DYNPTR_SIZE / BPF_REG_SIZE)
253 u8 slot_type[BPF_REG_SIZE];
329 #define BPF_ID_MAP_SIZE ((MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE) * MAX_CALL_FRAMES)
417 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
424 iter < frame->allocated_stack / BPF_REG_SIZE; \
/kernel/linux/linux-5.10/tools/perf/util/
H A Dbpf-prologue.c20 #define BPF_REG_SIZE 8 macro
156 ins(BPF_ALU64_IMM(BPF_MOV, BPF_REG_ARG2, BPF_REG_SIZE), pos); in gen_read_mem()
314 BPF_REG_FP, -BPF_REG_SIZE * (i + 1)), pos); in gen_prologue_slowpath()
/kernel/linux/linux-5.10/kernel/bpf/
H A Dverifier.c573 return stack->slot_type[BPF_REG_SIZE - 1] == STACK_SPILL; in is_spilled_reg()
668 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
669 char types_buf[BPF_REG_SIZE + 1]; in print_verifier_state()
673 for (j = 0; j < BPF_REG_SIZE; j++) { in print_verifier_state()
679 types_buf[BPF_REG_SIZE] = 0; in print_verifier_state()
682 verbose(env, " fp%d", (-i - 1) * BPF_REG_SIZE); in print_verifier_state()
723 COPY_STATE_FN(stack, allocated_stack, stack, BPF_REG_SIZE)
763 REALLOC_STATE_FN(stack, allocated_stack, stack, BPF_REG_SIZE)
1896 spi = (-insn->off - 1) / BPF_REG_SIZE; in backtrack_insn()
1913 spi = (-insn->off - 1) / BPF_REG_SIZE; in backtrack_insn()
[all...]
/kernel/linux/linux-6.6/kernel/bpf/
H A Dverifier.c681 return (-off - 1) / BPF_REG_SIZE; in __get_spi()
694 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
717 if (off % BPF_REG_SIZE) { in stack_slot_obj_get_spi()
921 for (i = 0; i < BPF_REG_SIZE; i++) { in mark_stack_slots_dynptr()
959 for (i = 0; i < BPF_REG_SIZE; i++) { in invalidate_dynptr()
1019 for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()
1077 for (i = 0; i < BPF_REG_SIZE; i++) { in destroy_if_dynptr_stack_slot()
1153 for (i = 0; i < BPF_REG_SIZE; i++) { in is_dynptr_reg_valid_init()
1214 for (j = 0; j < BPF_REG_SIZE; j++) in mark_stack_slots_iter()
1245 for (j = 0; j < BPF_REG_SIZE; in unmark_stack_slots_iter()
[all...]
/kernel/linux/linux-5.10/drivers/net/ethernet/netronome/nfp/bpf/
H A Dverifier.c108 stack_entry = &state->stack[soff / BPF_REG_SIZE]; in nfp_bpf_map_update_value_ok()
109 if (stack_entry->slot_type[soff % BPF_REG_SIZE] == STACK_ZERO) in nfp_bpf_map_update_value_ok()
786 nfp_prog->subprog[i].stack_depth += BPF_REG_SIZE * 4; in nfp_bpf_finalize()
/kernel/linux/linux-6.6/drivers/net/ethernet/netronome/nfp/bpf/
H A Dverifier.c108 stack_entry = &state->stack[soff / BPF_REG_SIZE]; in nfp_bpf_map_update_value_ok()
109 if (stack_entry->slot_type[soff % BPF_REG_SIZE] == STACK_ZERO) in nfp_bpf_map_update_value_ok()
791 nfp_prog->subprog[i].stack_depth += BPF_REG_SIZE * 4; in nfp_bpf_finalize()

Completed in 24 milliseconds