Searched refs:BPF_REG_SIZE (Results 1 – 3 of 3) sorted by relevance
242 #define BPF_REG_SIZE 8 /* size of eBPF register in bytes */ macro249 #define BPF_DYNPTR_NR_SLOTS (BPF_DYNPTR_SIZE / BPF_REG_SIZE)253 u8 slot_type[BPF_REG_SIZE];318 #define BPF_ID_MAP_SIZE ((MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE) * MAX_CALL_FRAMES)389 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \396 iter < frame->allocated_stack / BPF_REG_SIZE; \
670 return (-off - 1) / BPF_REG_SIZE; in __get_spi()683 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()706 if (off % BPF_REG_SIZE) { in stack_slot_obj_get_spi()910 for (i = 0; i < BPF_REG_SIZE; i++) { in mark_stack_slots_dynptr()948 for (i = 0; i < BPF_REG_SIZE; i++) { in invalidate_dynptr()1008 for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()1066 for (i = 0; i < BPF_REG_SIZE; i++) { in destroy_if_dynptr_stack_slot()1142 for (i = 0; i < BPF_REG_SIZE; i++) { in is_dynptr_reg_valid_init()1203 for (j = 0; j < BPF_REG_SIZE; j++) in mark_stack_slots_iter()1234 for (j = 0; j < BPF_REG_SIZE; j++) in unmark_stack_slots_iter()[all …]
108 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()
