Home
last modified time | relevance | path

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

/linux-6.1.9/include/linux/
Dbpf_verifier.h197 #define BPF_REG_SIZE 8 /* size of eBPF register in bytes */ macro
199 #define BPF_DYNPTR_NR_SLOTS (BPF_DYNPTR_SIZE / BPF_REG_SIZE)
203 u8 slot_type[BPF_REG_SIZE];
272 #define BPF_ID_MAP_SIZE (MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE)
342 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \
349 iter < frame->allocated_stack / BPF_REG_SIZE; \
/linux-6.1.9/tools/perf/util/
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()
/linux-6.1.9/kernel/bpf/
Dverifier.c615 return (-off - 1) / BPF_REG_SIZE; in get_spi()
620 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()
712 for (i = 0; i < BPF_REG_SIZE; i++) { in mark_stack_slots_dynptr()
748 for (i = 0; i < BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()
776 for (i = 0; i < BPF_REG_SIZE; i++) { in is_dynptr_reg_valid_uninit()
796 for (i = 0; i < BPF_REG_SIZE; i++) { in is_dynptr_reg_valid_init()
827 return stack->slot_type[BPF_REG_SIZE - 1] == STACK_SPILL; in is_spilled_reg()
931 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in print_verifier_state()
932 char types_buf[BPF_REG_SIZE + 1]; in print_verifier_state()
936 for (j = 0; j < BPF_REG_SIZE; j++) { in print_verifier_state()
[all …]
/linux-6.1.9/drivers/net/ethernet/netronome/nfp/bpf/
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()