filter.h 13.1 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/skbuff.h>
10
#include <linux/workqueue.h>
11
#include <uapi/linux/filter.h>
12 13 14 15 16
#include <asm/cacheflush.h>

struct sk_buff;
struct sock;
struct seccomp_data;
17

18 19
/* Internally used and optimized filter representation with extended
 * instruction set based on top of classic BPF.
20
 */
21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45

/* 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 */

46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
/* 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,
};

62
/* BPF has 10 general purpose 64-bit registers and stack frame. */
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
#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
81 82 83 84

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

85 86
/* Helper macros for filter block array initializers. */

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

89
#define BPF_ALU64_REG(OP, DST, SRC)				\
90
	((struct bpf_insn) {					\
91
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_X,	\
92 93
		.dst_reg = DST,					\
		.src_reg = SRC,					\
94 95 96
		.off   = 0,					\
		.imm   = 0 })

97
#define BPF_ALU32_REG(OP, DST, SRC)				\
98
	((struct bpf_insn) {					\
99
		.code  = BPF_ALU | BPF_OP(OP) | BPF_X,		\
100 101
		.dst_reg = DST,					\
		.src_reg = SRC,					\
102 103 104
		.off   = 0,					\
		.imm   = 0 })

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

107
#define BPF_ALU64_IMM(OP, DST, IMM)				\
108
	((struct bpf_insn) {					\
109
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_K,	\
110 111
		.dst_reg = DST,					\
		.src_reg = 0,					\
112 113 114
		.off   = 0,					\
		.imm   = IMM })

115
#define BPF_ALU32_IMM(OP, DST, IMM)				\
116
	((struct bpf_insn) {					\
117
		.code  = BPF_ALU | BPF_OP(OP) | BPF_K,		\
118 119
		.dst_reg = DST,					\
		.src_reg = 0,					\
120 121 122 123 124
		.off   = 0,					\
		.imm   = IMM })

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

125
#define BPF_ENDIAN(TYPE, DST, LEN)				\
126
	((struct bpf_insn) {					\
127
		.code  = BPF_ALU | BPF_END | BPF_SRC(TYPE),	\
128 129
		.dst_reg = DST,					\
		.src_reg = 0,					\
130 131 132
		.off   = 0,					\
		.imm   = LEN })

133
/* Short form of mov, dst_reg = src_reg */
134

135
#define BPF_MOV64_REG(DST, SRC)					\
136
	((struct bpf_insn) {					\
137
		.code  = BPF_ALU64 | BPF_MOV | BPF_X,		\
138 139
		.dst_reg = DST,					\
		.src_reg = SRC,					\
140 141 142
		.off   = 0,					\
		.imm   = 0 })

143
#define BPF_MOV32_REG(DST, SRC)					\
144
	((struct bpf_insn) {					\
145
		.code  = BPF_ALU | BPF_MOV | BPF_X,		\
146 147
		.dst_reg = DST,					\
		.src_reg = SRC,					\
148 149 150
		.off   = 0,					\
		.imm   = 0 })

151
/* Short form of mov, dst_reg = imm32 */
152

153
#define BPF_MOV64_IMM(DST, IMM)					\
154
	((struct bpf_insn) {					\
155
		.code  = BPF_ALU64 | BPF_MOV | BPF_K,		\
156 157
		.dst_reg = DST,					\
		.src_reg = 0,					\
158 159 160
		.off   = 0,					\
		.imm   = IMM })

161
#define BPF_MOV32_IMM(DST, IMM)					\
162
	((struct bpf_insn) {					\
163
		.code  = BPF_ALU | BPF_MOV | BPF_K,		\
164 165
		.dst_reg = DST,					\
		.src_reg = 0,					\
166 167 168
		.off   = 0,					\
		.imm   = IMM })

169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
/* BPF_LD_IMM64 macro encodes single 'load 64-bit immediate' insn */
#define BPF_LD_IMM64(DST, IMM)					\
	BPF_LD_IMM64_RAW(DST, 0, IMM)

#define BPF_LD_IMM64_RAW(DST, SRC, IMM)				\
	((struct bpf_insn) {					\
		.code  = BPF_LD | BPF_DW | BPF_IMM,		\
		.dst_reg = DST,					\
		.src_reg = SRC,					\
		.off   = 0,					\
		.imm   = (__u32) (IMM) }),			\
	((struct bpf_insn) {					\
		.code  = 0, /* zero is reserved opcode */	\
		.dst_reg = 0,					\
		.src_reg = 0,					\
		.off   = 0,					\
		.imm   = ((__u64) (IMM)) >> 32 })

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

189
#define BPF_MOV64_RAW(TYPE, DST, SRC, IMM)			\
190
	((struct bpf_insn) {					\
191
		.code  = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE),	\
192 193
		.dst_reg = DST,					\
		.src_reg = SRC,					\
194 195 196
		.off   = 0,					\
		.imm   = IMM })

197
#define BPF_MOV32_RAW(TYPE, DST, SRC, IMM)			\
198
	((struct bpf_insn) {					\
199
		.code  = BPF_ALU | BPF_MOV | BPF_SRC(TYPE),	\
200 201
		.dst_reg = DST,					\
		.src_reg = SRC,					\
202 203 204
		.off   = 0,					\
		.imm   = IMM })

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

207
#define BPF_LD_ABS(SIZE, IMM)					\
208
	((struct bpf_insn) {					\
209
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS,	\
210 211
		.dst_reg = 0,					\
		.src_reg = 0,					\
212
		.off   = 0,					\
213
		.imm   = IMM })
214

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

217
#define BPF_LD_IND(SIZE, SRC, IMM)				\
218
	((struct bpf_insn) {					\
219
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_IND,	\
220 221
		.dst_reg = 0,					\
		.src_reg = SRC,					\
222
		.off   = 0,					\
223
		.imm   = IMM })
224

225
/* Memory load, dst_reg = *(uint *) (src_reg + off16) */
226

227
#define BPF_LDX_MEM(SIZE, DST, SRC, OFF)			\
228
	((struct bpf_insn) {					\
229
		.code  = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM,	\
230 231
		.dst_reg = DST,					\
		.src_reg = SRC,					\
232 233 234
		.off   = OFF,					\
		.imm   = 0 })

235 236 237
/* Memory store, *(uint *) (dst_reg + off16) = src_reg */

#define BPF_STX_MEM(SIZE, DST, SRC, OFF)			\
238
	((struct bpf_insn) {					\
239
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM,	\
240 241
		.dst_reg = DST,					\
		.src_reg = SRC,					\
242 243 244
		.off   = OFF,					\
		.imm   = 0 })

245 246 247
/* Memory store, *(uint *) (dst_reg + off16) = imm32 */

#define BPF_ST_MEM(SIZE, DST, OFF, IMM)				\
248
	((struct bpf_insn) {					\
249 250 251 252 253 254 255
		.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 */
256

257
#define BPF_JMP_REG(OP, DST, SRC, OFF)				\
258
	((struct bpf_insn) {					\
259
		.code  = BPF_JMP | BPF_OP(OP) | BPF_X,		\
260 261
		.dst_reg = DST,					\
		.src_reg = SRC,					\
262 263 264
		.off   = OFF,					\
		.imm   = 0 })

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

267
#define BPF_JMP_IMM(OP, DST, IMM, OFF)				\
268
	((struct bpf_insn) {					\
269
		.code  = BPF_JMP | BPF_OP(OP) | BPF_K,		\
270 271
		.dst_reg = DST,					\
		.src_reg = 0,					\
272 273 274 275 276 277
		.off   = OFF,					\
		.imm   = IMM })

/* Function call */

#define BPF_EMIT_CALL(FUNC)					\
278
	((struct bpf_insn) {					\
279
		.code  = BPF_JMP | BPF_CALL,			\
280 281
		.dst_reg = 0,					\
		.src_reg = 0,					\
282 283 284 285 286
		.off   = 0,					\
		.imm   = ((FUNC) - __bpf_call_base) })

/* Raw code statement block */

287
#define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM)			\
288
	((struct bpf_insn) {					\
289
		.code  = CODE,					\
290 291
		.dst_reg = DST,					\
		.src_reg = SRC,					\
292 293 294 295 296 297
		.off   = OFF,					\
		.imm   = IMM })

/* Program exit */

#define BPF_EXIT_INSN()						\
298
	((struct bpf_insn) {					\
299
		.code  = BPF_JMP | BPF_EXIT,			\
300 301
		.dst_reg = 0,					\
		.src_reg = 0,					\
302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319
		.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;						\
})
320

321
/* Macro to invoke filter function. */
322 323
#define SK_RUN_FILTER(filter, ctx) \
	(*filter->prog->bpf_func)(ctx, filter->prog->insnsi)
324

325
struct bpf_insn {
326
	__u8	code;		/* opcode */
327 328
	__u8	dst_reg:4;	/* dest register */
	__u8	src_reg:4;	/* source register */
329 330 331 332 333 334
	__s16	off;		/* signed offset */
	__s32	imm;		/* signed immediate constant */
};

#ifdef CONFIG_COMPAT
/* A struct sock_filter is architecture independent. */
335 336
struct compat_sock_fprog {
	u16		len;
337
	compat_uptr_t	filter;	/* struct sock_filter * */
338 339 340
};
#endif

341 342 343 344 345
struct sock_fprog_kern {
	u16			len;
	struct sock_filter	*filter;
};

346 347 348 349
struct bpf_work_struct {
	struct bpf_prog *prog;
	struct work_struct work;
};
350

351
struct bpf_prog {
352
	u32			pages;		/* Number of allocated pages */
353 354
	u32			jited:1,	/* Is our filter JIT'ed? */
				len:31;		/* Number of filter blocks */
355
	struct sock_fprog_kern	*orig_prog;	/* Original BPF program */
356
	struct bpf_work_struct	*work;		/* Deferred free work struct */
357
	unsigned int		(*bpf_func)(const struct sk_buff *skb,
358
					    const struct bpf_insn *filter);
359
	/* Instructions for interpreter */
360
	union {
361
		struct sock_filter	insns[0];
362
		struct bpf_insn		insnsi[0];
363
	};
364 365
};

366 367 368 369 370 371 372 373 374
struct sk_filter {
	atomic_t	refcnt;
	struct rcu_head	rcu;
	struct bpf_prog	*prog;
};

#define BPF_PROG_RUN(filter, ctx)  (*filter->bpf_func)(ctx, filter->insnsi)

static inline unsigned int bpf_prog_size(unsigned int proglen)
375
{
376 377
	return max(sizeof(struct bpf_prog),
		   offsetof(struct bpf_prog, insns[proglen]));
378 379
}

380
#define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
381

382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401
#ifdef CONFIG_DEBUG_SET_MODULE_RONX
static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
{
	set_memory_ro((unsigned long)fp, fp->pages);
}

static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
{
	set_memory_rw((unsigned long)fp, fp->pages);
}
#else
static inline void bpf_prog_lock_ro(struct bpf_prog *fp)
{
}

static inline void bpf_prog_unlock_ro(struct bpf_prog *fp)
{
}
#endif /* CONFIG_DEBUG_SET_MODULE_RONX */

402
int sk_filter(struct sock *sk, struct sk_buff *skb);
403

404 405
void bpf_prog_select_runtime(struct bpf_prog *fp);
void bpf_prog_free(struct bpf_prog *fp);
406

407 408
int bpf_convert_filter(struct sock_filter *prog, int len,
		       struct bpf_insn *new_prog, int *new_len);
409

410 411 412 413 414 415 416 417 418 419 420
struct bpf_prog *bpf_prog_alloc(unsigned int size, gfp_t gfp_extra_flags);
struct bpf_prog *bpf_prog_realloc(struct bpf_prog *fp_old, unsigned int size,
				  gfp_t gfp_extra_flags);
void __bpf_prog_free(struct bpf_prog *fp);

static inline void bpf_prog_unlock_free(struct bpf_prog *fp)
{
	bpf_prog_unlock_ro(fp);
	__bpf_prog_free(fp);
}

421 422
int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
void bpf_prog_destroy(struct bpf_prog *fp);
423

424 425
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
int sk_detach_filter(struct sock *sk);
426

427
int bpf_check_classic(const struct sock_filter *filter, unsigned int flen);
428 429 430
int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
		  unsigned int len);

431
bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
432
void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
433

434
u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
435
void bpf_int_jit_compile(struct bpf_prog *fp);
436

437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
#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;
	}
}

472 473 474 475 476 477 478 479 480 481 482 483
void *bpf_internal_load_pointer_neg_helper(const struct sk_buff *skb,
					   int k, unsigned int size);

static inline void *bpf_load_pointer(const struct sk_buff *skb, int k,
				     unsigned int size, void *buffer)
{
	if (k >= 0)
		return skb_header_pointer(skb, k, size, buffer);

	return bpf_internal_load_pointer_neg_helper(skb, k, size);
}

484
#ifdef CONFIG_BPF_JIT
X
Xi Wang 已提交
485
#include <stdarg.h>
486 487 488
#include <linux/linkage.h>
#include <linux/printk.h>

489 490
void bpf_jit_compile(struct bpf_prog *fp);
void bpf_jit_free(struct bpf_prog *fp);
491 492 493 494

static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
				u32 pass, void *image)
{
495
	pr_err("flen=%u proglen=%u pass=%u image=%pK\n",
496 497
	       flen, proglen, pass, image);
	if (image)
498
		print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
499 500
			       16, 1, image, proglen, false);
}
501
#else
502
#include <linux/slab.h>
503

504
static inline void bpf_jit_compile(struct bpf_prog *fp)
505 506
{
}
507

508
static inline void bpf_jit_free(struct bpf_prog *fp)
509
{
510
	bpf_prog_unlock_free(fp);
511
}
512
#endif /* CONFIG_BPF_JIT */
513

514 515
static inline int bpf_tell_extensions(void)
{
516
	return SKF_AD_MAX;
517 518
}

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