ebpf.rs 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625
  1. // SPDX-License-Identifier: (Apache-2.0 OR MIT)
  2. // Copyright 2016 6WIND S.A. <quentin.monnet@6wind.com>
  3. //! This module contains all the definitions related to eBPF, and some functions permitting to
  4. //! manipulate eBPF instructions.
  5. //!
  6. //! The number of bytes in an instruction, the maximum number of instructions in a program, and
  7. //! also all operation codes are defined here as constants.
  8. //!
  9. //! The structure for an instruction used by this crate, as well as the function to extract it from
  10. //! a program, is also defined in the module.
  11. //!
  12. //! To learn more about these instructions, see the Linux kernel documentation:
  13. //! <https://www.kernel.org/doc/Documentation/networking/filter.txt>, or for a shorter version of
  14. //! the list of the operation codes: <https://github.com/iovisor/bpf-docs/blob/master/eBPF.md>
  15. use byteorder::{ByteOrder, LittleEndian};
  16. /// Maximum number of instructions in an eBPF program.
  17. pub const PROG_MAX_INSNS: usize = 4096;
  18. /// Size of an eBPF instructions, in bytes.
  19. pub const INSN_SIZE: usize = 8;
  20. /// Maximum size of an eBPF program, in bytes.
  21. pub const PROG_MAX_SIZE: usize = PROG_MAX_INSNS * INSN_SIZE;
  22. /// Stack for the eBPF stack, in bytes.
  23. pub const STACK_SIZE: usize = 512;
  24. // eBPF op codes.
  25. // See also https://www.kernel.org/doc/Documentation/networking/filter.txt
  26. // Three least significant bits are operation class:
  27. /// BPF operation class: load from immediate.
  28. pub const BPF_LD : u8 = 0x00;
  29. /// BPF operation class: load from register.
  30. pub const BPF_LDX : u8 = 0x01;
  31. /// BPF operation class: store immediate.
  32. pub const BPF_ST : u8 = 0x02;
  33. /// BPF operation class: store value from register.
  34. pub const BPF_STX : u8 = 0x03;
  35. /// BPF operation class: 32 bits arithmetic operation.
  36. pub const BPF_ALU : u8 = 0x04;
  37. /// BPF operation class: jump (64-bit wide operands for comparisons).
  38. pub const BPF_JMP : u8 = 0x05;
  39. /// BPF operation class: jump (32-bit wide operands for comparisons).
  40. pub const BPF_JMP32 : u8 = 0x06;
  41. // [ class 6 unused, reserved for future use ]
  42. /// BPF operation class: 64 bits arithmetic operation.
  43. pub const BPF_ALU64 : u8 = 0x07;
  44. // For load and store instructions:
  45. // +------------+--------+------------+
  46. // | 3 bits | 2 bits | 3 bits |
  47. // | mode | size | insn class |
  48. // +------------+--------+------------+
  49. // (MSB) (LSB)
  50. // Size modifiers:
  51. /// BPF size modifier: word (4 bytes).
  52. pub const BPF_W : u8 = 0x00;
  53. /// BPF size modifier: half-word (2 bytes).
  54. pub const BPF_H : u8 = 0x08;
  55. /// BPF size modifier: byte (1 byte).
  56. pub const BPF_B : u8 = 0x10;
  57. /// BPF size modifier: double word (8 bytes).
  58. pub const BPF_DW : u8 = 0x18;
  59. // Mode modifiers:
  60. /// BPF mode modifier: immediate value.
  61. pub const BPF_IMM : u8 = 0x00;
  62. /// BPF mode modifier: absolute load.
  63. pub const BPF_ABS : u8 = 0x20;
  64. /// BPF mode modifier: indirect load.
  65. pub const BPF_IND : u8 = 0x40;
  66. /// BPF mode modifier: load from / store to memory.
  67. pub const BPF_MEM : u8 = 0x60;
  68. // [ 0x80 reserved ]
  69. // [ 0xa0 reserved ]
  70. /// BPF mode modifier: exclusive add.
  71. pub const BPF_XADD : u8 = 0xc0;
  72. // For arithmetic (BPF_ALU/BPF_ALU64) and jump (BPF_JMP) instructions:
  73. // +----------------+--------+--------+
  74. // | 4 bits |1 b.| 3 bits |
  75. // | operation code | src| insn class |
  76. // +----------------+----+------------+
  77. // (MSB) (LSB)
  78. // Source modifiers:
  79. /// BPF source operand modifier: 32-bit immediate value.
  80. pub const BPF_K : u8 = 0x00;
  81. /// BPF source operand modifier: `src` register.
  82. pub const BPF_X : u8 = 0x08;
  83. // Operation codes -- BPF_ALU or BPF_ALU64 classes:
  84. /// BPF ALU/ALU64 operation code: addition.
  85. pub const BPF_ADD : u8 = 0x00;
  86. /// BPF ALU/ALU64 operation code: subtraction.
  87. pub const BPF_SUB : u8 = 0x10;
  88. /// BPF ALU/ALU64 operation code: multiplication.
  89. pub const BPF_MUL : u8 = 0x20;
  90. /// BPF ALU/ALU64 operation code: division.
  91. pub const BPF_DIV : u8 = 0x30;
  92. /// BPF ALU/ALU64 operation code: or.
  93. pub const BPF_OR : u8 = 0x40;
  94. /// BPF ALU/ALU64 operation code: and.
  95. pub const BPF_AND : u8 = 0x50;
  96. /// BPF ALU/ALU64 operation code: left shift.
  97. pub const BPF_LSH : u8 = 0x60;
  98. /// BPF ALU/ALU64 operation code: right shift.
  99. pub const BPF_RSH : u8 = 0x70;
  100. /// BPF ALU/ALU64 operation code: negation.
  101. pub const BPF_NEG : u8 = 0x80;
  102. /// BPF ALU/ALU64 operation code: modulus.
  103. pub const BPF_MOD : u8 = 0x90;
  104. /// BPF ALU/ALU64 operation code: exclusive or.
  105. pub const BPF_XOR : u8 = 0xa0;
  106. /// BPF ALU/ALU64 operation code: move.
  107. pub const BPF_MOV : u8 = 0xb0;
  108. /// BPF ALU/ALU64 operation code: sign extending right shift.
  109. pub const BPF_ARSH : u8 = 0xc0;
  110. /// BPF ALU/ALU64 operation code: endianness conversion.
  111. pub const BPF_END : u8 = 0xd0;
  112. // Operation codes -- BPF_JMP or BPF_JMP32 classes:
  113. /// BPF JMP operation code: jump.
  114. pub const BPF_JA : u8 = 0x00;
  115. /// BPF JMP operation code: jump if equal.
  116. pub const BPF_JEQ : u8 = 0x10;
  117. /// BPF JMP operation code: jump if greater than.
  118. pub const BPF_JGT : u8 = 0x20;
  119. /// BPF JMP operation code: jump if greater or equal.
  120. pub const BPF_JGE : u8 = 0x30;
  121. /// BPF JMP operation code: jump if `src` & `reg`.
  122. pub const BPF_JSET : u8 = 0x40;
  123. /// BPF JMP operation code: jump if not equal.
  124. pub const BPF_JNE : u8 = 0x50;
  125. /// BPF JMP operation code: jump if greater than (signed).
  126. pub const BPF_JSGT : u8 = 0x60;
  127. /// BPF JMP operation code: jump if greater or equal (signed).
  128. pub const BPF_JSGE : u8 = 0x70;
  129. /// BPF JMP operation code: helper function call.
  130. pub const BPF_CALL : u8 = 0x80;
  131. /// BPF JMP operation code: return from program.
  132. pub const BPF_EXIT : u8 = 0x90;
  133. /// BPF JMP operation code: jump if lower than.
  134. pub const BPF_JLT : u8 = 0xa0;
  135. /// BPF JMP operation code: jump if lower or equal.
  136. pub const BPF_JLE : u8 = 0xb0;
  137. /// BPF JMP operation code: jump if lower than (signed).
  138. pub const BPF_JSLT : u8 = 0xc0;
  139. /// BPF JMP operation code: jump if lower or equal (signed).
  140. pub const BPF_JSLE : u8 = 0xd0;
  141. // Op codes
  142. // (Following operation names are not “official”, but may be proper to rbpf; Linux kernel only
  143. // combines above flags and does not attribute a name per operation.)
  144. /// BPF opcode: `ldabsb src, dst, imm`.
  145. pub const LD_ABS_B : u8 = BPF_LD | BPF_ABS | BPF_B;
  146. /// BPF opcode: `ldabsh src, dst, imm`.
  147. pub const LD_ABS_H : u8 = BPF_LD | BPF_ABS | BPF_H;
  148. /// BPF opcode: `ldabsw src, dst, imm`.
  149. pub const LD_ABS_W : u8 = BPF_LD | BPF_ABS | BPF_W;
  150. /// BPF opcode: `ldabsdw src, dst, imm`.
  151. pub const LD_ABS_DW : u8 = BPF_LD | BPF_ABS | BPF_DW;
  152. /// BPF opcode: `ldindb src, dst, imm`.
  153. pub const LD_IND_B : u8 = BPF_LD | BPF_IND | BPF_B;
  154. /// BPF opcode: `ldindh src, dst, imm`.
  155. pub const LD_IND_H : u8 = BPF_LD | BPF_IND | BPF_H;
  156. /// BPF opcode: `ldindw src, dst, imm`.
  157. pub const LD_IND_W : u8 = BPF_LD | BPF_IND | BPF_W;
  158. /// BPF opcode: `ldinddw src, dst, imm`.
  159. pub const LD_IND_DW : u8 = BPF_LD | BPF_IND | BPF_DW;
  160. #[allow(unknown_lints)]
  161. #[allow(clippy::eq_op)]
  162. /// BPF opcode: `lddw dst, imm` /// `dst = imm`.
  163. pub const LD_DW_IMM : u8 = BPF_LD | BPF_IMM | BPF_DW;
  164. /// BPF opcode: `ldxb dst, [src + off]` /// `dst = (src + off) as u8`.
  165. pub const LD_B_REG : u8 = BPF_LDX | BPF_MEM | BPF_B;
  166. /// BPF opcode: `ldxh dst, [src + off]` /// `dst = (src + off) as u16`.
  167. pub const LD_H_REG : u8 = BPF_LDX | BPF_MEM | BPF_H;
  168. /// BPF opcode: `ldxw dst, [src + off]` /// `dst = (src + off) as u32`.
  169. pub const LD_W_REG : u8 = BPF_LDX | BPF_MEM | BPF_W;
  170. /// BPF opcode: `ldxdw dst, [src + off]` /// `dst = (src + off) as u64`.
  171. pub const LD_DW_REG : u8 = BPF_LDX | BPF_MEM | BPF_DW;
  172. /// BPF opcode: `stb [dst + off], imm` /// `(dst + offset) as u8 = imm`.
  173. pub const ST_B_IMM : u8 = BPF_ST | BPF_MEM | BPF_B;
  174. /// BPF opcode: `sth [dst + off], imm` /// `(dst + offset) as u16 = imm`.
  175. pub const ST_H_IMM : u8 = BPF_ST | BPF_MEM | BPF_H;
  176. /// BPF opcode: `stw [dst + off], imm` /// `(dst + offset) as u32 = imm`.
  177. pub const ST_W_IMM : u8 = BPF_ST | BPF_MEM | BPF_W;
  178. /// BPF opcode: `stdw [dst + off], imm` /// `(dst + offset) as u64 = imm`.
  179. pub const ST_DW_IMM : u8 = BPF_ST | BPF_MEM | BPF_DW;
  180. /// BPF opcode: `stxb [dst + off], src` /// `(dst + offset) as u8 = src`.
  181. pub const ST_B_REG : u8 = BPF_STX | BPF_MEM | BPF_B;
  182. /// BPF opcode: `stxh [dst + off], src` /// `(dst + offset) as u16 = src`.
  183. pub const ST_H_REG : u8 = BPF_STX | BPF_MEM | BPF_H;
  184. /// BPF opcode: `stxw [dst + off], src` /// `(dst + offset) as u32 = src`.
  185. pub const ST_W_REG : u8 = BPF_STX | BPF_MEM | BPF_W;
  186. /// BPF opcode: `stxdw [dst + off], src` /// `(dst + offset) as u64 = src`.
  187. pub const ST_DW_REG : u8 = BPF_STX | BPF_MEM | BPF_DW;
  188. /// BPF opcode: `stxxaddw [dst + off], src`.
  189. pub const ST_W_XADD : u8 = BPF_STX | BPF_XADD | BPF_W;
  190. /// BPF opcode: `stxxadddw [dst + off], src`.
  191. pub const ST_DW_XADD : u8 = BPF_STX | BPF_XADD | BPF_DW;
  192. /// BPF opcode: `add32 dst, imm` /// `dst += imm`.
  193. pub const ADD32_IMM : u8 = BPF_ALU | BPF_K | BPF_ADD;
  194. /// BPF opcode: `add32 dst, src` /// `dst += src`.
  195. pub const ADD32_REG : u8 = BPF_ALU | BPF_X | BPF_ADD;
  196. /// BPF opcode: `sub32 dst, imm` /// `dst -= imm`.
  197. pub const SUB32_IMM : u8 = BPF_ALU | BPF_K | BPF_SUB;
  198. /// BPF opcode: `sub32 dst, src` /// `dst -= src`.
  199. pub const SUB32_REG : u8 = BPF_ALU | BPF_X | BPF_SUB;
  200. /// BPF opcode: `mul32 dst, imm` /// `dst *= imm`.
  201. pub const MUL32_IMM : u8 = BPF_ALU | BPF_K | BPF_MUL;
  202. /// BPF opcode: `mul32 dst, src` /// `dst *= src`.
  203. pub const MUL32_REG : u8 = BPF_ALU | BPF_X | BPF_MUL;
  204. /// BPF opcode: `div32 dst, imm` /// `dst /= imm`.
  205. pub const DIV32_IMM : u8 = BPF_ALU | BPF_K | BPF_DIV;
  206. /// BPF opcode: `div32 dst, src` /// `dst /= src`.
  207. pub const DIV32_REG : u8 = BPF_ALU | BPF_X | BPF_DIV;
  208. /// BPF opcode: `or32 dst, imm` /// `dst |= imm`.
  209. pub const OR32_IMM : u8 = BPF_ALU | BPF_K | BPF_OR;
  210. /// BPF opcode: `or32 dst, src` /// `dst |= src`.
  211. pub const OR32_REG : u8 = BPF_ALU | BPF_X | BPF_OR;
  212. /// BPF opcode: `and32 dst, imm` /// `dst &= imm`.
  213. pub const AND32_IMM : u8 = BPF_ALU | BPF_K | BPF_AND;
  214. /// BPF opcode: `and32 dst, src` /// `dst &= src`.
  215. pub const AND32_REG : u8 = BPF_ALU | BPF_X | BPF_AND;
  216. /// BPF opcode: `lsh32 dst, imm` /// `dst <<= imm`.
  217. pub const LSH32_IMM : u8 = BPF_ALU | BPF_K | BPF_LSH;
  218. /// BPF opcode: `lsh32 dst, src` /// `dst <<= src`.
  219. pub const LSH32_REG : u8 = BPF_ALU | BPF_X | BPF_LSH;
  220. /// BPF opcode: `rsh32 dst, imm` /// `dst >>= imm`.
  221. pub const RSH32_IMM : u8 = BPF_ALU | BPF_K | BPF_RSH;
  222. /// BPF opcode: `rsh32 dst, src` /// `dst >>= src`.
  223. pub const RSH32_REG : u8 = BPF_ALU | BPF_X | BPF_RSH;
  224. /// BPF opcode: `neg32 dst` /// `dst = -dst`.
  225. pub const NEG32 : u8 = BPF_ALU | BPF_NEG;
  226. /// BPF opcode: `mod32 dst, imm` /// `dst %= imm`.
  227. pub const MOD32_IMM : u8 = BPF_ALU | BPF_K | BPF_MOD;
  228. /// BPF opcode: `mod32 dst, src` /// `dst %= src`.
  229. pub const MOD32_REG : u8 = BPF_ALU | BPF_X | BPF_MOD;
  230. /// BPF opcode: `xor32 dst, imm` /// `dst ^= imm`.
  231. pub const XOR32_IMM : u8 = BPF_ALU | BPF_K | BPF_XOR;
  232. /// BPF opcode: `xor32 dst, src` /// `dst ^= src`.
  233. pub const XOR32_REG : u8 = BPF_ALU | BPF_X | BPF_XOR;
  234. /// BPF opcode: `mov32 dst, imm` /// `dst = imm`.
  235. pub const MOV32_IMM : u8 = BPF_ALU | BPF_K | BPF_MOV;
  236. /// BPF opcode: `mov32 dst, src` /// `dst = src`.
  237. pub const MOV32_REG : u8 = BPF_ALU | BPF_X | BPF_MOV;
  238. /// BPF opcode: `arsh32 dst, imm` /// `dst >>= imm (arithmetic)`.
  239. ///
  240. /// <https://en.wikipedia.org/wiki/Arithmetic_shift>
  241. pub const ARSH32_IMM : u8 = BPF_ALU | BPF_K | BPF_ARSH;
  242. /// BPF opcode: `arsh32 dst, src` /// `dst >>= src (arithmetic)`.
  243. ///
  244. /// <https://en.wikipedia.org/wiki/Arithmetic_shift>
  245. pub const ARSH32_REG : u8 = BPF_ALU | BPF_X | BPF_ARSH;
  246. /// BPF opcode: `le dst` /// `dst = htole<imm>(dst), with imm in {16, 32, 64}`.
  247. pub const LE : u8 = BPF_ALU | BPF_K | BPF_END;
  248. /// BPF opcode: `be dst` /// `dst = htobe<imm>(dst), with imm in {16, 32, 64}`.
  249. pub const BE : u8 = BPF_ALU | BPF_X | BPF_END;
  250. /// BPF opcode: `add64 dst, imm` /// `dst += imm`.
  251. pub const ADD64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_ADD;
  252. /// BPF opcode: `add64 dst, src` /// `dst += src`.
  253. pub const ADD64_REG : u8 = BPF_ALU64 | BPF_X | BPF_ADD;
  254. /// BPF opcode: `sub64 dst, imm` /// `dst -= imm`.
  255. pub const SUB64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_SUB;
  256. /// BPF opcode: `sub64 dst, src` /// `dst -= src`.
  257. pub const SUB64_REG : u8 = BPF_ALU64 | BPF_X | BPF_SUB;
  258. /// BPF opcode: `div64 dst, imm` /// `dst /= imm`.
  259. pub const MUL64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_MUL;
  260. /// BPF opcode: `div64 dst, src` /// `dst /= src`.
  261. pub const MUL64_REG : u8 = BPF_ALU64 | BPF_X | BPF_MUL;
  262. /// BPF opcode: `div64 dst, imm` /// `dst /= imm`.
  263. pub const DIV64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_DIV;
  264. /// BPF opcode: `div64 dst, src` /// `dst /= src`.
  265. pub const DIV64_REG : u8 = BPF_ALU64 | BPF_X | BPF_DIV;
  266. /// BPF opcode: `or64 dst, imm` /// `dst |= imm`.
  267. pub const OR64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_OR;
  268. /// BPF opcode: `or64 dst, src` /// `dst |= src`.
  269. pub const OR64_REG : u8 = BPF_ALU64 | BPF_X | BPF_OR;
  270. /// BPF opcode: `and64 dst, imm` /// `dst &= imm`.
  271. pub const AND64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_AND;
  272. /// BPF opcode: `and64 dst, src` /// `dst &= src`.
  273. pub const AND64_REG : u8 = BPF_ALU64 | BPF_X | BPF_AND;
  274. /// BPF opcode: `lsh64 dst, imm` /// `dst <<= imm`.
  275. pub const LSH64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_LSH;
  276. /// BPF opcode: `lsh64 dst, src` /// `dst <<= src`.
  277. pub const LSH64_REG : u8 = BPF_ALU64 | BPF_X | BPF_LSH;
  278. /// BPF opcode: `rsh64 dst, imm` /// `dst >>= imm`.
  279. pub const RSH64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_RSH;
  280. /// BPF opcode: `rsh64 dst, src` /// `dst >>= src`.
  281. pub const RSH64_REG : u8 = BPF_ALU64 | BPF_X | BPF_RSH;
  282. /// BPF opcode: `neg64 dst, imm` /// `dst = -dst`.
  283. pub const NEG64 : u8 = BPF_ALU64 | BPF_NEG;
  284. /// BPF opcode: `mod64 dst, imm` /// `dst %= imm`.
  285. pub const MOD64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_MOD;
  286. /// BPF opcode: `mod64 dst, src` /// `dst %= src`.
  287. pub const MOD64_REG : u8 = BPF_ALU64 | BPF_X | BPF_MOD;
  288. /// BPF opcode: `xor64 dst, imm` /// `dst ^= imm`.
  289. pub const XOR64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_XOR;
  290. /// BPF opcode: `xor64 dst, src` /// `dst ^= src`.
  291. pub const XOR64_REG : u8 = BPF_ALU64 | BPF_X | BPF_XOR;
  292. /// BPF opcode: `mov64 dst, imm` /// `dst = imm`.
  293. pub const MOV64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_MOV;
  294. /// BPF opcode: `mov64 dst, src` /// `dst = src`.
  295. pub const MOV64_REG : u8 = BPF_ALU64 | BPF_X | BPF_MOV;
  296. /// BPF opcode: `arsh64 dst, imm` /// `dst >>= imm (arithmetic)`.
  297. ///
  298. /// <https://en.wikipedia.org/wiki/Arithmetic_shift>
  299. pub const ARSH64_IMM : u8 = BPF_ALU64 | BPF_K | BPF_ARSH;
  300. /// BPF opcode: `arsh64 dst, src` /// `dst >>= src (arithmetic)`.
  301. ///
  302. /// <https://en.wikipedia.org/wiki/Arithmetic_shift>
  303. pub const ARSH64_REG : u8 = BPF_ALU64 | BPF_X | BPF_ARSH;
  304. /// BPF opcode: `ja +off` /// `PC += off`.
  305. pub const JA : u8 = BPF_JMP | BPF_JA;
  306. /// BPF opcode: `jeq dst, imm, +off` /// `PC += off if dst == imm`.
  307. pub const JEQ_IMM : u8 = BPF_JMP | BPF_K | BPF_JEQ;
  308. /// BPF opcode: `jeq dst, src, +off` /// `PC += off if dst == src`.
  309. pub const JEQ_REG : u8 = BPF_JMP | BPF_X | BPF_JEQ;
  310. /// BPF opcode: `jgt dst, imm, +off` /// `PC += off if dst > imm`.
  311. pub const JGT_IMM : u8 = BPF_JMP | BPF_K | BPF_JGT;
  312. /// BPF opcode: `jgt dst, src, +off` /// `PC += off if dst > src`.
  313. pub const JGT_REG : u8 = BPF_JMP | BPF_X | BPF_JGT;
  314. /// BPF opcode: `jge dst, imm, +off` /// `PC += off if dst >= imm`.
  315. pub const JGE_IMM : u8 = BPF_JMP | BPF_K | BPF_JGE;
  316. /// BPF opcode: `jge dst, src, +off` /// `PC += off if dst >= src`.
  317. pub const JGE_REG : u8 = BPF_JMP | BPF_X | BPF_JGE;
  318. /// BPF opcode: `jlt dst, imm, +off` /// `PC += off if dst < imm`.
  319. pub const JLT_IMM : u8 = BPF_JMP | BPF_K | BPF_JLT;
  320. /// BPF opcode: `jlt dst, src, +off` /// `PC += off if dst < src`.
  321. pub const JLT_REG : u8 = BPF_JMP | BPF_X | BPF_JLT;
  322. /// BPF opcode: `jle dst, imm, +off` /// `PC += off if dst <= imm`.
  323. pub const JLE_IMM : u8 = BPF_JMP | BPF_K | BPF_JLE;
  324. /// BPF opcode: `jle dst, src, +off` /// `PC += off if dst <= src`.
  325. pub const JLE_REG : u8 = BPF_JMP | BPF_X | BPF_JLE;
  326. /// BPF opcode: `jset dst, imm, +off` /// `PC += off if dst & imm`.
  327. pub const JSET_IMM : u8 = BPF_JMP | BPF_K | BPF_JSET;
  328. /// BPF opcode: `jset dst, src, +off` /// `PC += off if dst & src`.
  329. pub const JSET_REG : u8 = BPF_JMP | BPF_X | BPF_JSET;
  330. /// BPF opcode: `jne dst, imm, +off` /// `PC += off if dst != imm`.
  331. pub const JNE_IMM : u8 = BPF_JMP | BPF_K | BPF_JNE;
  332. /// BPF opcode: `jne dst, src, +off` /// `PC += off if dst != src`.
  333. pub const JNE_REG : u8 = BPF_JMP | BPF_X | BPF_JNE;
  334. /// BPF opcode: `jsgt dst, imm, +off` /// `PC += off if dst > imm (signed)`.
  335. pub const JSGT_IMM : u8 = BPF_JMP | BPF_K | BPF_JSGT;
  336. /// BPF opcode: `jsgt dst, src, +off` /// `PC += off if dst > src (signed)`.
  337. pub const JSGT_REG : u8 = BPF_JMP | BPF_X | BPF_JSGT;
  338. /// BPF opcode: `jsge dst, imm, +off` /// `PC += off if dst >= imm (signed)`.
  339. pub const JSGE_IMM : u8 = BPF_JMP | BPF_K | BPF_JSGE;
  340. /// BPF opcode: `jsge dst, src, +off` /// `PC += off if dst >= src (signed)`.
  341. pub const JSGE_REG : u8 = BPF_JMP | BPF_X | BPF_JSGE;
  342. /// BPF opcode: `jslt dst, imm, +off` /// `PC += off if dst < imm (signed)`.
  343. pub const JSLT_IMM : u8 = BPF_JMP | BPF_K | BPF_JSLT;
  344. /// BPF opcode: `jslt dst, src, +off` /// `PC += off if dst < src (signed)`.
  345. pub const JSLT_REG : u8 = BPF_JMP | BPF_X | BPF_JSLT;
  346. /// BPF opcode: `jsle dst, imm, +off` /// `PC += off if dst <= imm (signed)`.
  347. pub const JSLE_IMM : u8 = BPF_JMP | BPF_K | BPF_JSLE;
  348. /// BPF opcode: `jsle dst, src, +off` /// `PC += off if dst <= src (signed)`.
  349. pub const JSLE_REG : u8 = BPF_JMP | BPF_X | BPF_JSLE;
  350. /// BPF opcode: `jeq dst, imm, +off` /// `PC += off if (dst as u32) == imm`.
  351. pub const JEQ_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JEQ;
  352. /// BPF opcode: `jeq dst, src, +off` /// `PC += off if (dst as u32) == (src as u32)`.
  353. pub const JEQ_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JEQ;
  354. /// BPF opcode: `jgt dst, imm, +off` /// `PC += off if (dst as u32) > imm`.
  355. pub const JGT_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JGT;
  356. /// BPF opcode: `jgt dst, src, +off` /// `PC += off if (dst as u32) > (src as u32)`.
  357. pub const JGT_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JGT;
  358. /// BPF opcode: `jge dst, imm, +off` /// `PC += off if (dst as u32) >= imm`.
  359. pub const JGE_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JGE;
  360. /// BPF opcode: `jge dst, src, +off` /// `PC += off if (dst as u32) >= (src as u32)`.
  361. pub const JGE_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JGE;
  362. /// BPF opcode: `jlt dst, imm, +off` /// `PC += off if (dst as u32) < imm`.
  363. pub const JLT_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JLT;
  364. /// BPF opcode: `jlt dst, src, +off` /// `PC += off if (dst as u32) < (src as u32)`.
  365. pub const JLT_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JLT;
  366. /// BPF opcode: `jle dst, imm, +off` /// `PC += off if (dst as u32) <= imm`.
  367. pub const JLE_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JLE;
  368. /// BPF opcode: `jle dst, src, +off` /// `PC += off if (dst as u32) <= (src as u32)`.
  369. pub const JLE_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JLE;
  370. /// BPF opcode: `jset dst, imm, +off` /// `PC += off if (dst as u32) & imm`.
  371. pub const JSET_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JSET;
  372. /// BPF opcode: `jset dst, src, +off` /// `PC += off if (dst as u32) & (src as u32)`.
  373. pub const JSET_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JSET;
  374. /// BPF opcode: `jne dst, imm, +off` /// `PC += off if (dst as u32) != imm`.
  375. pub const JNE_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JNE;
  376. /// BPF opcode: `jne dst, src, +off` /// `PC += off if (dst as u32) != (src as u32)`.
  377. pub const JNE_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JNE;
  378. /// BPF opcode: `jsgt dst, imm, +off` /// `PC += off if (dst as i32) > imm (signed)`.
  379. pub const JSGT_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JSGT;
  380. /// BPF opcode: `jsgt dst, src, +off` /// `PC += off if (dst as i32) > (src as i32) (signed)`.
  381. pub const JSGT_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JSGT;
  382. /// BPF opcode: `jsge dst, imm, +off` /// `PC += off if (dst as i32) >= imm (signed)`.
  383. pub const JSGE_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JSGE;
  384. /// BPF opcode: `jsge dst, src, +off` /// `PC += off if (dst as i32) >= (src as i32) (signed)`.
  385. pub const JSGE_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JSGE;
  386. /// BPF opcode: `jslt dst, imm, +off` /// `PC += off if (dst as i32) < imm (signed)`.
  387. pub const JSLT_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JSLT;
  388. /// BPF opcode: `jslt dst, src, +off` /// `PC += off if (dst as i32) < (src as i32) (signed)`.
  389. pub const JSLT_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JSLT;
  390. /// BPF opcode: `jsle dst, imm, +off` /// `PC += off if (dst as i32) <= imm (signed)`.
  391. pub const JSLE_IMM32 : u8 = BPF_JMP32 | BPF_K | BPF_JSLE;
  392. /// BPF opcode: `jsle dst, src, +off` /// `PC += off if (dst as i32) <= (src as i32) (signed)`.
  393. pub const JSLE_REG32 : u8 = BPF_JMP32 | BPF_X | BPF_JSLE;
  394. /// BPF opcode: `call imm` /// helper function call to helper with key `imm`.
  395. pub const CALL : u8 = BPF_JMP | BPF_CALL;
  396. /// BPF opcode: tail call.
  397. pub const TAIL_CALL : u8 = BPF_JMP | BPF_X | BPF_CALL;
  398. /// BPF opcode: `exit` /// `return r0`.
  399. pub const EXIT : u8 = BPF_JMP | BPF_EXIT;
  400. // Used in JIT
  401. /// Mask to extract the operation class from an operation code.
  402. pub const BPF_CLS_MASK : u8 = 0x07;
  403. /// Mask to extract the arithmetic operation code from an instruction operation code.
  404. pub const BPF_ALU_OP_MASK : u8 = 0xf0;
  405. /// Prototype of an eBPF helper function.
  406. pub type Helper = fn (u64, u64, u64, u64, u64) -> u64;
  407. /// An eBPF instruction.
  408. ///
  409. /// See <https://www.kernel.org/doc/Documentation/networking/filter.txt> for the Linux kernel
  410. /// documentation about eBPF, or <https://github.com/iovisor/bpf-docs/blob/master/eBPF.md> for a
  411. /// more concise version.
  412. #[derive(Debug, PartialEq, Eq, Clone)]
  413. pub struct Insn {
  414. /// Operation code.
  415. pub opc: u8,
  416. /// Destination register operand.
  417. pub dst: u8,
  418. /// Source register operand.
  419. pub src: u8,
  420. /// Offset operand.
  421. pub off: i16,
  422. /// Immediate value operand.
  423. pub imm: i32,
  424. }
  425. impl Insn {
  426. /// Turn an `Insn` back into an array of bytes.
  427. ///
  428. /// # Examples
  429. ///
  430. /// ```
  431. /// use rbpf::ebpf;
  432. ///
  433. /// let prog: &[u8] = &[
  434. /// 0xb7, 0x12, 0x56, 0x34, 0xde, 0xbc, 0x9a, 0x78,
  435. /// ];
  436. /// let insn = ebpf::Insn {
  437. /// opc: 0xb7,
  438. /// dst: 2,
  439. /// src: 1,
  440. /// off: 0x3456,
  441. /// imm: 0x789abcde
  442. /// };
  443. /// assert_eq!(insn.to_array(), prog);
  444. /// ```
  445. pub fn to_array(&self) -> [u8;INSN_SIZE] {
  446. [
  447. self.opc,
  448. self.src.wrapping_shl(4) | self.dst,
  449. (self.off & 0xff) as u8,
  450. self.off.wrapping_shr(8) as u8,
  451. (self.imm & 0xff) as u8,
  452. (self.imm & 0xff_00).wrapping_shr(8) as u8,
  453. (self.imm as u32 & 0xff_00_00).wrapping_shr(16) as u8,
  454. (self.imm as u32 & 0xff_00_00_00).wrapping_shr(24) as u8,
  455. ]
  456. }
  457. /// Turn an `Insn` into an vector of bytes.
  458. ///
  459. /// # Examples
  460. ///
  461. /// ```
  462. /// use rbpf::ebpf;
  463. ///
  464. /// let prog: Vec<u8> = vec![
  465. /// 0xb7, 0x12, 0x56, 0x34, 0xde, 0xbc, 0x9a, 0x78,
  466. /// ];
  467. /// let insn = ebpf::Insn {
  468. /// opc: 0xb7,
  469. /// dst: 2,
  470. /// src: 1,
  471. /// off: 0x3456,
  472. /// imm: 0x789abcde
  473. /// };
  474. /// assert_eq!(insn.to_vec(), prog);
  475. /// ```
  476. pub fn to_vec(&self) -> Vec<u8> {
  477. vec![
  478. self.opc,
  479. self.src.wrapping_shl(4) | self.dst,
  480. (self.off & 0xff) as u8,
  481. self.off.wrapping_shr(8) as u8,
  482. (self.imm & 0xff) as u8,
  483. (self.imm & 0xff_00).wrapping_shr(8) as u8,
  484. (self.imm as u32 & 0xff_00_00).wrapping_shr(16) as u8,
  485. (self.imm as u32 & 0xff_00_00_00).wrapping_shr(24) as u8,
  486. ]
  487. }
  488. }
  489. /// Get the instruction at `idx` of an eBPF program. `idx` is the index (number) of the
  490. /// instruction (not a byte offset). The first instruction has index 0.
  491. ///
  492. /// # Panics
  493. ///
  494. /// Panics if it is not possible to get the instruction (if idx is too high, or last instruction is
  495. /// incomplete).
  496. ///
  497. /// # Examples
  498. ///
  499. /// ```
  500. /// use rbpf::ebpf;
  501. ///
  502. /// let prog = &[
  503. /// 0xb7, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  504. /// 0x95, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
  505. /// ];
  506. /// let insn = ebpf::get_insn(prog, 1);
  507. /// assert_eq!(insn.opc, 0x95);
  508. /// ```
  509. ///
  510. /// The example below will panic, since the last instruction is not complete and cannot be loaded.
  511. ///
  512. /// ```rust,should_panic
  513. /// use rbpf::ebpf;
  514. ///
  515. /// let prog = &[
  516. /// 0xb7, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  517. /// 0x95, 0x00, 0x00, 0x00, 0x00, 0x00 // two bytes missing
  518. /// ];
  519. /// let insn = ebpf::get_insn(prog, 1);
  520. /// ```
  521. pub fn get_insn(prog: &[u8], idx: usize) -> Insn {
  522. // This guard should not be needed in most cases, since the verifier already checks the program
  523. // size, and indexes should be fine in the interpreter/JIT. But this function is publicly
  524. // available and user can call it with any `idx`, so we have to check anyway.
  525. if (idx + 1) * INSN_SIZE > prog.len() {
  526. panic!("Error: cannot reach instruction at index {:?} in program containing {:?} bytes",
  527. idx, prog.len());
  528. }
  529. Insn {
  530. opc: prog[INSN_SIZE * idx],
  531. dst: prog[INSN_SIZE * idx + 1] & 0x0f,
  532. src: (prog[INSN_SIZE * idx + 1] & 0xf0) >> 4,
  533. off: LittleEndian::read_i16(&prog[(INSN_SIZE * idx + 2) .. ]),
  534. imm: LittleEndian::read_i32(&prog[(INSN_SIZE * idx + 4) .. ]),
  535. }
  536. }
  537. /// Return a vector of `struct Insn` built from a program.
  538. ///
  539. /// This is provided as a convenience for users wishing to manipulate a vector of instructions, for
  540. /// example for dumping the program instruction after instruction with a custom format.
  541. ///
  542. /// Note that the two parts of `LD_DW_IMM` instructions (spanning on 64 bits) are considered as two
  543. /// distinct instructions.
  544. ///
  545. /// # Examples
  546. ///
  547. /// ```
  548. /// use rbpf::ebpf;
  549. ///
  550. /// let prog = &[
  551. /// 0x18, 0x00, 0x00, 0x00, 0x88, 0x77, 0x66, 0x55,
  552. /// 0x00, 0x00, 0x00, 0x00, 0x44, 0x33, 0x22, 0x11,
  553. /// 0x95, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
  554. /// ];
  555. ///
  556. /// let v = ebpf::to_insn_vec(prog);
  557. /// assert_eq!(v, vec![
  558. /// ebpf::Insn {
  559. /// opc: 0x18,
  560. /// dst: 0,
  561. /// src: 0,
  562. /// off: 0,
  563. /// imm: 0x55667788
  564. /// },
  565. /// ebpf::Insn {
  566. /// opc: 0,
  567. /// dst: 0,
  568. /// src: 0,
  569. /// off: 0,
  570. /// imm: 0x11223344
  571. /// },
  572. /// ebpf::Insn {
  573. /// opc: 0x95,
  574. /// dst: 0,
  575. /// src: 0,
  576. /// off: 0,
  577. /// imm: 0
  578. /// },
  579. /// ]);
  580. /// ```
  581. pub fn to_insn_vec(prog: &[u8]) -> Vec<Insn> {
  582. if prog.len() % INSN_SIZE != 0 {
  583. panic!("Error: eBPF program length must be a multiple of {:?} octets",
  584. INSN_SIZE);
  585. }
  586. let mut res = vec![];
  587. let mut insn_ptr:usize = 0;
  588. while insn_ptr * INSN_SIZE < prog.len() {
  589. let insn = get_insn(prog, insn_ptr);
  590. res.push(insn);
  591. insn_ptr += 1;
  592. };
  593. res
  594. }