Searched refs:BPF_REG_SIZE (Results 1 – 4 of 4) sorted by relevance
226 #define BPF_REG_SIZE 8 /* size of eBPF register in bytes */ macro285 #define BPF_DYNPTR_NR_SLOTS (BPF_DYNPTR_SIZE / BPF_REG_SIZE)289 u8 slot_type[BPF_REG_SIZE];414 #define BPF_ID_MAP_SIZE ((MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE) * MAX_CALL_FRAMES)501 (((slot < frame->allocated_stack / BPF_REG_SIZE) && \502 ((1 << frame->stack[slot].slot_type[BPF_REG_SIZE - 1]) & (mask))) \508 iter < frame->allocated_stack / BPF_REG_SIZE; \1104 return (-off - 1) / BPF_REG_SIZE; in bpf_get_spi()1130 return stack->slot_type[BPF_REG_SIZE - 1] == STACK_SPILL; in bpf_is_spilled_reg()1284 return !(off % BPF_REG_SIZE); in bpf_stack_narrow_access_ok()
518 int allocated_slots = state->allocated_stack / BPF_REG_SIZE; in is_spi_bounds_valid()541 if (off % BPF_REG_SIZE) { in stack_slot_obj_get_spi()670 for (i = 0; i < BPF_REG_SIZE; i++) { in mark_stack_slots_dynptr()705 for (i = 0; i < BPF_REG_SIZE; i++) { in invalidate_dynptr()750 for (i = 1; i < state->allocated_stack / BPF_REG_SIZE; i++) { in unmark_stack_slots_dynptr()808 for (i = 0; i < state->allocated_stack / BPF_REG_SIZE; i++) { in destroy_if_dynptr_stack_slot()827 for (i = 0; i < BPF_REG_SIZE; i++) { in destroy_if_dynptr_stack_slot()899 for (i = 0; i < BPF_REG_SIZE; i++) { in is_dynptr_reg_valid_init()970 for (j = 0; j < BPF_REG_SIZE; j++) in mark_stack_slots_iter()998 for (j = 0; j < BPF_REG_SIZE; j++) in unmark_stack_slots_iter()[all …]
2411 s32 r6_offset = stack_base + 0 * BPF_REG_SIZE; in inline_bpf_loop()2412 s32 r7_offset = stack_base + 1 * BPF_REG_SIZE; in inline_bpf_loop()2413 s32 r8_offset = stack_base + 2 * BPF_REG_SIZE; in inline_bpf_loop()2514 stack_depth_extra = BPF_REG_SIZE * 3 + stack_depth_roundup; in bpf_optimize_bpf_loop()
426 return -(spi + 1) * BPF_REG_SIZE; in spi_off()