nfp_bpf.h 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203
  1. /*
  2. * Copyright (C) 2016 Netronome Systems, Inc.
  3. *
  4. * This software is dual licensed under the GNU General License Version 2,
  5. * June 1991 as shown in the file COPYING in the top-level directory of this
  6. * source tree or the BSD 2-Clause License provided below. You have the
  7. * option to license this software under the complete terms of either license.
  8. *
  9. * The BSD 2-Clause License:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * 1. Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * 2. Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #ifndef __NFP_BPF_H__
  34. #define __NFP_BPF_H__ 1
  35. #include <linux/bitfield.h>
  36. #include <linux/bpf.h>
  37. #include <linux/list.h>
  38. #include <linux/types.h>
  39. #define FIELD_FIT(mask, val) (!((((u64)val) << __bf_shf(mask)) & ~(mask)))
  40. /* For branch fixup logic use up-most byte of branch instruction as scratch
  41. * area. Remember to clear this before sending instructions to HW!
  42. */
  43. #define OP_BR_SPECIAL 0xff00000000000000ULL
  44. enum br_special {
  45. OP_BR_NORMAL = 0,
  46. OP_BR_GO_OUT,
  47. OP_BR_GO_ABORT,
  48. };
  49. enum static_regs {
  50. STATIC_REG_PKT = 1,
  51. #define REG_PKT_BANK ALU_DST_A
  52. STATIC_REG_IMM = 2, /* Bank AB */
  53. };
  54. enum nfp_bpf_action_type {
  55. NN_ACT_TC_DROP,
  56. NN_ACT_TC_REDIR,
  57. NN_ACT_DIRECT,
  58. NN_ACT_XDP,
  59. };
  60. /* Software register representation, hardware encoding in asm.h */
  61. #define NN_REG_TYPE GENMASK(31, 24)
  62. #define NN_REG_VAL GENMASK(7, 0)
  63. enum nfp_bpf_reg_type {
  64. NN_REG_GPR_A = BIT(0),
  65. NN_REG_GPR_B = BIT(1),
  66. NN_REG_NNR = BIT(2),
  67. NN_REG_XFER = BIT(3),
  68. NN_REG_IMM = BIT(4),
  69. NN_REG_NONE = BIT(5),
  70. };
  71. #define NN_REG_GPR_BOTH (NN_REG_GPR_A | NN_REG_GPR_B)
  72. #define reg_both(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_GPR_BOTH))
  73. #define reg_a(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_GPR_A))
  74. #define reg_b(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_GPR_B))
  75. #define reg_nnr(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_NNR))
  76. #define reg_xfer(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_XFER))
  77. #define reg_imm(x) ((x) | FIELD_PREP(NN_REG_TYPE, NN_REG_IMM))
  78. #define reg_none() (FIELD_PREP(NN_REG_TYPE, NN_REG_NONE))
  79. #define pkt_reg(np) reg_a((np)->regs_per_thread - STATIC_REG_PKT)
  80. #define imm_a(np) reg_a((np)->regs_per_thread - STATIC_REG_IMM)
  81. #define imm_b(np) reg_b((np)->regs_per_thread - STATIC_REG_IMM)
  82. #define imm_both(np) reg_both((np)->regs_per_thread - STATIC_REG_IMM)
  83. #define NFP_BPF_ABI_FLAGS reg_nnr(0)
  84. #define NFP_BPF_ABI_FLAG_MARK 1
  85. #define NFP_BPF_ABI_MARK reg_nnr(1)
  86. #define NFP_BPF_ABI_PKT reg_nnr(2)
  87. #define NFP_BPF_ABI_LEN reg_nnr(3)
  88. struct nfp_prog;
  89. struct nfp_insn_meta;
  90. typedef int (*instr_cb_t)(struct nfp_prog *, struct nfp_insn_meta *);
  91. #define nfp_prog_first_meta(nfp_prog) \
  92. list_first_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
  93. #define nfp_prog_last_meta(nfp_prog) \
  94. list_last_entry(&(nfp_prog)->insns, struct nfp_insn_meta, l)
  95. #define nfp_meta_next(meta) list_next_entry(meta, l)
  96. #define nfp_meta_prev(meta) list_prev_entry(meta, l)
  97. /**
  98. * struct nfp_insn_meta - BPF instruction wrapper
  99. * @insn: BPF instruction
  100. * @off: index of first generated machine instruction (in nfp_prog.prog)
  101. * @n: eBPF instruction number
  102. * @skip: skip this instruction (optimized out)
  103. * @double_cb: callback for second part of the instruction
  104. * @l: link on nfp_prog->insns list
  105. */
  106. struct nfp_insn_meta {
  107. struct bpf_insn insn;
  108. unsigned int off;
  109. unsigned short n;
  110. bool skip;
  111. instr_cb_t double_cb;
  112. struct list_head l;
  113. };
  114. #define BPF_SIZE_MASK 0x18
  115. static inline u8 mbpf_class(const struct nfp_insn_meta *meta)
  116. {
  117. return BPF_CLASS(meta->insn.code);
  118. }
  119. static inline u8 mbpf_src(const struct nfp_insn_meta *meta)
  120. {
  121. return BPF_SRC(meta->insn.code);
  122. }
  123. static inline u8 mbpf_op(const struct nfp_insn_meta *meta)
  124. {
  125. return BPF_OP(meta->insn.code);
  126. }
  127. static inline u8 mbpf_mode(const struct nfp_insn_meta *meta)
  128. {
  129. return BPF_MODE(meta->insn.code);
  130. }
  131. /**
  132. * struct nfp_prog - nfp BPF program
  133. * @prog: machine code
  134. * @prog_len: number of valid instructions in @prog array
  135. * @__prog_alloc_len: alloc size of @prog array
  136. * @act: BPF program/action type (TC DA, TC with action, XDP etc.)
  137. * @num_regs: number of registers used by this program
  138. * @regs_per_thread: number of basic registers allocated per thread
  139. * @start_off: address of the first instruction in the memory
  140. * @tgt_out: jump target for normal exit
  141. * @tgt_abort: jump target for abort (e.g. access outside of packet buffer)
  142. * @tgt_done: jump target to get the next packet
  143. * @n_translated: number of successfully translated instructions (for errors)
  144. * @error: error code if something went wrong
  145. * @insns: list of BPF instruction wrappers (struct nfp_insn_meta)
  146. */
  147. struct nfp_prog {
  148. u64 *prog;
  149. unsigned int prog_len;
  150. unsigned int __prog_alloc_len;
  151. enum nfp_bpf_action_type act;
  152. unsigned int num_regs;
  153. unsigned int regs_per_thread;
  154. unsigned int start_off;
  155. unsigned int tgt_out;
  156. unsigned int tgt_abort;
  157. unsigned int tgt_done;
  158. unsigned int n_translated;
  159. int error;
  160. struct list_head insns;
  161. };
  162. struct nfp_bpf_result {
  163. unsigned int n_instr;
  164. bool dense_mode;
  165. };
  166. int
  167. nfp_bpf_jit(struct bpf_prog *filter, void *prog, enum nfp_bpf_action_type act,
  168. unsigned int prog_start, unsigned int prog_done,
  169. unsigned int prog_sz, struct nfp_bpf_result *res);
  170. int nfp_prog_verify(struct nfp_prog *nfp_prog, struct bpf_prog *prog);
  171. #endif