filter.h 11.3 KB
Newer Older
L
Linus Torvalds 已提交
1 2 3 4 5 6
/*
 * Linux Socket Filter Data Structures
 */
#ifndef __LINUX_FILTER_H__
#define __LINUX_FILTER_H__

A
Arun Sharma 已提交
7
#include <linux/atomic.h>
8
#include <linux/compat.h>
9
#include <linux/workqueue.h>
10
#include <uapi/linux/filter.h>
11

12 13
/* Internally used and optimized filter representation with extended
 * instruction set based on top of classic BPF.
14
 */
15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

/* instruction classes */
#define BPF_ALU64	0x07	/* alu mode in double word width */

/* ld/ldx fields */
#define BPF_DW		0x18	/* double word */
#define BPF_XADD	0xc0	/* exclusive add */

/* alu/jmp fields */
#define BPF_MOV		0xb0	/* mov reg to reg */
#define BPF_ARSH	0xc0	/* sign extending arithmetic shift right */

/* change endianness of a register */
#define BPF_END		0xd0	/* flags for endianness conversion: */
#define BPF_TO_LE	0x00	/* convert to little-endian */
#define BPF_TO_BE	0x08	/* convert to big-endian */
#define BPF_FROM_LE	BPF_TO_LE
#define BPF_FROM_BE	BPF_TO_BE

#define BPF_JNE		0x50	/* jump != */
#define BPF_JSGT	0x60	/* SGT is signed '>', GT in x86 */
#define BPF_JSGE	0x70	/* SGE is signed '>=', GE in x86 */
#define BPF_CALL	0x80	/* function call */
#define BPF_EXIT	0x90	/* function return */

40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55
/* Register numbers */
enum {
	BPF_REG_0 = 0,
	BPF_REG_1,
	BPF_REG_2,
	BPF_REG_3,
	BPF_REG_4,
	BPF_REG_5,
	BPF_REG_6,
	BPF_REG_7,
	BPF_REG_8,
	BPF_REG_9,
	BPF_REG_10,
	__MAX_BPF_REG,
};

56
/* BPF has 10 general purpose 64-bit registers and stack frame. */
57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
#define MAX_BPF_REG	__MAX_BPF_REG

/* ArgX, context and stack frame pointer register positions. Note,
 * Arg1, Arg2, Arg3, etc are used as argument mappings of function
 * calls in BPF_CALL instruction.
 */
#define BPF_REG_ARG1	BPF_REG_1
#define BPF_REG_ARG2	BPF_REG_2
#define BPF_REG_ARG3	BPF_REG_3
#define BPF_REG_ARG4	BPF_REG_4
#define BPF_REG_ARG5	BPF_REG_5
#define BPF_REG_CTX	BPF_REG_6
#define BPF_REG_FP	BPF_REG_10

/* Additional register mappings for converted user programs. */
#define BPF_REG_A	BPF_REG_0
#define BPF_REG_X	BPF_REG_7
#define BPF_REG_TMP	BPF_REG_8
75 76 77 78

/* BPF program can access up to 512 bytes of stack space. */
#define MAX_BPF_STACK	512

79 80
/* Helper macros for filter block array initializers. */

81
/* ALU ops on registers, bpf_add|sub|...: dst_reg += src_reg */
82

83
#define BPF_ALU64_REG(OP, DST, SRC)				\
84 85
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_X,	\
86 87
		.dst_reg = DST,					\
		.src_reg = SRC,					\
88 89 90
		.off   = 0,					\
		.imm   = 0 })

91
#define BPF_ALU32_REG(OP, DST, SRC)				\
92 93
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_OP(OP) | BPF_X,		\
94 95
		.dst_reg = DST,					\
		.src_reg = SRC,					\
96 97 98
		.off   = 0,					\
		.imm   = 0 })

99
/* ALU ops on immediates, bpf_add|sub|...: dst_reg += imm32 */
100

101
#define BPF_ALU64_IMM(OP, DST, IMM)				\
102 103
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_K,	\
104 105
		.dst_reg = DST,					\
		.src_reg = 0,					\
106 107 108
		.off   = 0,					\
		.imm   = IMM })

109
#define BPF_ALU32_IMM(OP, DST, IMM)				\
110 111
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_OP(OP) | BPF_K,		\
112 113
		.dst_reg = DST,					\
		.src_reg = 0,					\
114 115 116 117 118
		.off   = 0,					\
		.imm   = IMM })

/* Endianess conversion, cpu_to_{l,b}e(), {l,b}e_to_cpu() */

119
#define BPF_ENDIAN(TYPE, DST, LEN)				\
120 121
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_END | BPF_SRC(TYPE),	\
122 123
		.dst_reg = DST,					\
		.src_reg = 0,					\
124 125 126
		.off   = 0,					\
		.imm   = LEN })

127
/* Short form of mov, dst_reg = src_reg */
128

129
#define BPF_MOV64_REG(DST, SRC)					\
130 131
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_X,		\
132 133
		.dst_reg = DST,					\
		.src_reg = SRC,					\
134 135 136
		.off   = 0,					\
		.imm   = 0 })

137
#define BPF_MOV32_REG(DST, SRC)					\
138 139
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_X,		\
140 141
		.dst_reg = DST,					\
		.src_reg = SRC,					\
142 143 144
		.off   = 0,					\
		.imm   = 0 })

145
/* Short form of mov, dst_reg = imm32 */
146

147
#define BPF_MOV64_IMM(DST, IMM)					\
148 149
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_K,		\
150 151
		.dst_reg = DST,					\
		.src_reg = 0,					\
152 153 154
		.off   = 0,					\
		.imm   = IMM })

155
#define BPF_MOV32_IMM(DST, IMM)					\
156 157
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_K,		\
158 159
		.dst_reg = DST,					\
		.src_reg = 0,					\
160 161 162
		.off   = 0,					\
		.imm   = IMM })

163
/* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
164

165
#define BPF_MOV64_RAW(TYPE, DST, SRC, IMM)			\
166 167
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE),	\
168 169
		.dst_reg = DST,					\
		.src_reg = SRC,					\
170 171 172
		.off   = 0,					\
		.imm   = IMM })

173
#define BPF_MOV32_RAW(TYPE, DST, SRC, IMM)			\
174 175
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_SRC(TYPE),	\
176 177
		.dst_reg = DST,					\
		.src_reg = SRC,					\
178 179 180
		.off   = 0,					\
		.imm   = IMM })

181
/* Direct packet access, R0 = *(uint *) (skb->data + imm32) */
182

183
#define BPF_LD_ABS(SIZE, IMM)					\
184 185
	((struct sock_filter_int) {				\
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS,	\
186 187
		.dst_reg = 0,					\
		.src_reg = 0,					\
188
		.off   = 0,					\
189
		.imm   = IMM })
190

191
/* Indirect packet access, R0 = *(uint *) (skb->data + src_reg + imm32) */
192

193
#define BPF_LD_IND(SIZE, SRC, IMM)				\
194 195
	((struct sock_filter_int) {				\
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_IND,	\
196 197
		.dst_reg = 0,					\
		.src_reg = SRC,					\
198
		.off   = 0,					\
199
		.imm   = IMM })
200

201
/* Memory load, dst_reg = *(uint *) (src_reg + off16) */
202

203
#define BPF_LDX_MEM(SIZE, DST, SRC, OFF)			\
204 205
	((struct sock_filter_int) {				\
		.code  = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM,	\
206 207
		.dst_reg = DST,					\
		.src_reg = SRC,					\
208 209 210
		.off   = OFF,					\
		.imm   = 0 })

211 212 213
/* Memory store, *(uint *) (dst_reg + off16) = src_reg */

#define BPF_STX_MEM(SIZE, DST, SRC, OFF)			\
214 215
	((struct sock_filter_int) {				\
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM,	\
216 217
		.dst_reg = DST,					\
		.src_reg = SRC,					\
218 219 220
		.off   = OFF,					\
		.imm   = 0 })

221 222 223 224 225 226 227 228 229 230 231
/* Memory store, *(uint *) (dst_reg + off16) = imm32 */

#define BPF_ST_MEM(SIZE, DST, OFF, IMM)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ST | BPF_SIZE(SIZE) | BPF_MEM,	\
		.dst_reg = DST,					\
		.src_reg = 0,					\
		.off   = OFF,					\
		.imm   = IMM })

/* Conditional jumps against registers, if (dst_reg 'op' src_reg) goto pc + off16 */
232

233
#define BPF_JMP_REG(OP, DST, SRC, OFF)				\
234 235
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_OP(OP) | BPF_X,		\
236 237
		.dst_reg = DST,					\
		.src_reg = SRC,					\
238 239 240
		.off   = OFF,					\
		.imm   = 0 })

241
/* Conditional jumps against immediates, if (dst_reg 'op' imm32) goto pc + off16 */
242

243
#define BPF_JMP_IMM(OP, DST, IMM, OFF)				\
244 245
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_OP(OP) | BPF_K,		\
246 247
		.dst_reg = DST,					\
		.src_reg = 0,					\
248 249 250 251 252 253 254 255
		.off   = OFF,					\
		.imm   = IMM })

/* Function call */

#define BPF_EMIT_CALL(FUNC)					\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_CALL,			\
256 257
		.dst_reg = 0,					\
		.src_reg = 0,					\
258 259 260 261 262
		.off   = 0,					\
		.imm   = ((FUNC) - __bpf_call_base) })

/* Raw code statement block */

263
#define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM)			\
264 265
	((struct sock_filter_int) {				\
		.code  = CODE,					\
266 267
		.dst_reg = DST,					\
		.src_reg = SRC,					\
268 269 270 271 272 273 274 275
		.off   = OFF,					\
		.imm   = IMM })

/* Program exit */

#define BPF_EXIT_INSN()						\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_EXIT,			\
276 277
		.dst_reg = 0,					\
		.src_reg = 0,					\
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295
		.off   = 0,					\
		.imm   = 0 })

#define bytes_to_bpf_size(bytes)				\
({								\
	int bpf_size = -EINVAL;					\
								\
	if (bytes == sizeof(u8))				\
		bpf_size = BPF_B;				\
	else if (bytes == sizeof(u16))				\
		bpf_size = BPF_H;				\
	else if (bytes == sizeof(u32))				\
		bpf_size = BPF_W;				\
	else if (bytes == sizeof(u64))				\
		bpf_size = BPF_DW;				\
								\
	bpf_size;						\
})
296

297 298
/* Macro to invoke filter function. */
#define SK_RUN_FILTER(filter, ctx)  (*filter->bpf_func)(ctx, filter->insnsi)
299 300 301

struct sock_filter_int {
	__u8	code;		/* opcode */
302 303
	__u8	dst_reg:4;	/* dest register */
	__u8	src_reg:4;	/* source register */
304 305 306 307 308 309
	__s16	off;		/* signed offset */
	__s32	imm;		/* signed immediate constant */
};

#ifdef CONFIG_COMPAT
/* A struct sock_filter is architecture independent. */
310 311
struct compat_sock_fprog {
	u16		len;
312
	compat_uptr_t	filter;	/* struct sock_filter * */
313 314 315
};
#endif

316 317 318 319 320
struct sock_fprog_kern {
	u16			len;
	struct sock_filter	*filter;
};

321 322
struct sk_buff;
struct sock;
323
struct seccomp_data;
324

325
struct sk_filter {
326
	atomic_t		refcnt;
327 328
	u32			jited:1,	/* Is our filter JIT'ed? */
				len:31;		/* Number of filter blocks */
329
	struct sock_fprog_kern	*orig_prog;	/* Original BPF program */
330
	struct rcu_head		rcu;
331
	unsigned int		(*bpf_func)(const struct sk_buff *skb,
332
					    const struct sock_filter_int *filter);
333
	union {
334 335
		struct sock_filter	insns[0];
		struct sock_filter_int	insnsi[0];
336 337
		struct work_struct	work;
	};
338 339
};

340
static inline unsigned int sk_filter_size(unsigned int proglen)
341
{
342 343
	return max(sizeof(struct sk_filter),
		   offsetof(struct sk_filter, insns[proglen]));
344 345
}

346 347 348
#define sk_filter_proglen(fprog)			\
		(fprog->len * sizeof(fprog->filter[0]))

349
int sk_filter(struct sock *sk, struct sk_buff *skb);
350

351 352
void sk_filter_select_runtime(struct sk_filter *fp);
void sk_filter_free(struct sk_filter *fp);
353 354 355

int sk_convert_filter(struct sock_filter *prog, int len,
		      struct sock_filter_int *new_prog, int *new_len);
356

357
int sk_unattached_filter_create(struct sk_filter **pfp,
358
				struct sock_fprog_kern *fprog);
359
void sk_unattached_filter_destroy(struct sk_filter *fp);
360

361 362
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
int sk_detach_filter(struct sock *sk);
363

364 365 366 367 368 369
int sk_chk_filter(struct sock_filter *filter, unsigned int flen);
int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
		  unsigned int len);

void sk_filter_charge(struct sock *sk, struct sk_filter *fp);
void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
370

371 372 373
u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
void bpf_int_jit_compile(struct sk_filter *fp);

374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408
#define BPF_ANC		BIT(15)

static inline u16 bpf_anc_helper(const struct sock_filter *ftest)
{
	BUG_ON(ftest->code & BPF_ANC);

	switch (ftest->code) {
	case BPF_LD | BPF_W | BPF_ABS:
	case BPF_LD | BPF_H | BPF_ABS:
	case BPF_LD | BPF_B | BPF_ABS:
#define BPF_ANCILLARY(CODE)	case SKF_AD_OFF + SKF_AD_##CODE:	\
				return BPF_ANC | SKF_AD_##CODE
		switch (ftest->k) {
		BPF_ANCILLARY(PROTOCOL);
		BPF_ANCILLARY(PKTTYPE);
		BPF_ANCILLARY(IFINDEX);
		BPF_ANCILLARY(NLATTR);
		BPF_ANCILLARY(NLATTR_NEST);
		BPF_ANCILLARY(MARK);
		BPF_ANCILLARY(QUEUE);
		BPF_ANCILLARY(HATYPE);
		BPF_ANCILLARY(RXHASH);
		BPF_ANCILLARY(CPU);
		BPF_ANCILLARY(ALU_XOR_X);
		BPF_ANCILLARY(VLAN_TAG);
		BPF_ANCILLARY(VLAN_TAG_PRESENT);
		BPF_ANCILLARY(PAY_OFFSET);
		BPF_ANCILLARY(RANDOM);
		}
		/* Fallthrough. */
	default:
		return ftest->code;
	}
}

409
#ifdef CONFIG_BPF_JIT
X
Xi Wang 已提交
410
#include <stdarg.h>
411 412 413
#include <linux/linkage.h>
#include <linux/printk.h>

414 415
void bpf_jit_compile(struct sk_filter *fp);
void bpf_jit_free(struct sk_filter *fp);
416 417 418 419

static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
				u32 pass, void *image)
{
420
	pr_err("flen=%u proglen=%u pass=%u image=%pK\n",
421 422
	       flen, proglen, pass, image);
	if (image)
423
		print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
424 425
			       16, 1, image, proglen, false);
}
426
#else
427
#include <linux/slab.h>
428

429 430 431
static inline void bpf_jit_compile(struct sk_filter *fp)
{
}
432

433 434
static inline void bpf_jit_free(struct sk_filter *fp)
{
435
	kfree(fp);
436
}
437
#endif /* CONFIG_BPF_JIT */
438

439 440
static inline int bpf_tell_extensions(void)
{
441
	return SKF_AD_MAX;
442 443
}

L
Linus Torvalds 已提交
444
#endif /* __LINUX_FILTER_H__ */