Searched refs:MAX_BPF_REG (Results 1 – 11 of 11) sorted by relevance
215 for (r = 0; r < MAX_BPF_REG; r++) { in const_reg_join()238 struct const_arg_info (*ci_in)[MAX_BPF_REG]; in bpf_compute_const_regs()239 struct const_arg_info ci_out[MAX_BPF_REG]; in bpf_compute_const_regs()253 for (r = 0; r < MAX_BPF_REG; r++) in bpf_compute_const_regs()
615 #define MAX_AT_TRACK_REGS (MAX_BPF_REG + MAX_STACK_ARG_SLOTS)807 if (r >= MAX_BPF_REG) in arg_track_join()808 verbose(env, "sa%d: ", r - MAX_BPF_REG); in arg_track_join()1038 for (i = 0; i < MAX_BPF_REG; i++) { in arg_track_log()1051 int ai = MAX_BPF_REG + i; in arg_track_log()1109 at_out[MAX_BPF_REG + slot] = at_out[insn->src_reg]; in arg_track_xfer()1111 at_out[MAX_BPF_REG + slot] = none; in arg_track_xfer()1452 err = record_arg_access(env, instance, insn, &at[MAX_BPF_REG + r], in record_call_access()1545 for (r = 0; r < MAX_BPF_REG - 1; r++) in print_subprog_arg_access()1549 if (arg_is_fp(&info->at_in[i][MAX_BPF_REG + r])) in print_subprog_arg_access()[all …]
957 for (i = 0; i < MAX_BPF_REG; i++) in func_states_equal()1125 for (i = 0; i < MAX_BPF_REG; i++) in states_maybe_looping()
709 for (i = 0; i < MAX_BPF_REG; i++) { in print_verifier_state()
1563 if (target->regno >= MAX_BPF_REG) in target_to_reg()1593 end = (unsigned long)(state->regs + MAX_BPF_REG); in reg_to_target()
2268 for (i = 0; i < MAX_BPF_REG; i++) { in init_reg_state()7856 for (i = 0; i < MAX_BPF_REG; i++) in widen_imprecise_scalars()19028 if (insn->dst_reg >= MAX_BPF_REG && in check_and_resolve_insns()19033 if (insn->src_reg >= MAX_BPF_REG && !is_stack_arg_ldx(insn)) { in check_and_resolve_insns()
349 struct bpf_reg_state regs[MAX_BPF_REG];445 #define BPF_ID_MAP_SIZE ((MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE + \571 for (___j = 0; ___j < MAX_BPF_REG; ___j++) { \
62 #define BPF_REG_PARAMS MAX_BPF_REG63 #define BPF_REG_AX (MAX_BPF_REG + 1)64 #define MAX_BPF_EXT_REG (MAX_BPF_REG + 2)
78 #define MAX_BPF_REG __MAX_BPF_REG macro
595 BUILD_BUG_ON(BPF_REG_FP + 1 != MAX_BPF_REG); in bpf_convert_filter()