Home
last modified time | relevance | path

Searched refs:MAX_BPF_REG (Results 1 – 8 of 8) sorted by relevance

/Linux-v6.1/include/linux/
Dbpf_verifier.h232 struct bpf_reg_state regs[MAX_BPF_REG];
272 #define BPF_ID_MAP_SIZE (MAX_BPF_REG + MAX_BPF_STACK / BPF_REG_SIZE)
361 for (___j = 0; ___j < MAX_BPF_REG; ___j++) { \
Dfilter.h61 #define BPF_REG_AX MAX_BPF_REG
62 #define MAX_BPF_EXT_REG (MAX_BPF_REG + 1)
/Linux-v6.1/drivers/net/ethernet/netronome/nfp/bpf/
Dverifier.c646 if (meta->insn.src_reg >= MAX_BPF_REG || in nfp_verify_insn()
647 meta->insn.dst_reg >= MAX_BPF_REG) { in nfp_verify_insn()
/Linux-v6.1/tools/include/uapi/linux/
Dbpf.h69 #define MAX_BPF_REG __MAX_BPF_REG macro
/Linux-v6.1/include/uapi/linux/
Dbpf.h69 #define MAX_BPF_REG __MAX_BPF_REG macro
/Linux-v6.1/kernel/bpf/
Dverifier.c846 for (i = 0; i < MAX_BPF_REG; i++) { in print_verifier_state()
1382 if (WARN_ON(regno >= MAX_BPF_REG)) { in mark_reg_known_zero()
1385 for (regno = 0; regno < MAX_BPF_REG; regno++) in mark_reg_known_zero()
1699 if (WARN_ON(regno >= MAX_BPF_REG)) { in mark_reg_unknown()
1719 if (WARN_ON(regno >= MAX_BPF_REG)) { in mark_reg_not_init()
1752 for (i = 0; i < MAX_BPF_REG; i++) { in init_reg_state()
2463 if (regno >= MAX_BPF_REG) { in check_reg_arg()
11718 for (i = 0; i < MAX_BPF_REG; i++) in func_states_equal()
11812 BUILD_BUG_ON(BPF_REG_FP + 1 != MAX_BPF_REG); in propagate_liveness()
11893 for (i = 0; i < MAX_BPF_REG; i++) in states_maybe_looping()
Dcore.c1223 BUILD_BUG_ON(MAX_BPF_REG + 1 != MAX_BPF_JIT_REG); in bpf_jit_blind_insn()
/Linux-v6.1/net/core/
Dfilter.c569 BUILD_BUG_ON(BPF_REG_FP + 1 != MAX_BPF_REG); in bpf_convert_filter()