filter.h 12.6 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
/* Short form of mov based on type, BPF_X: dst_reg = src_reg, BPF_K: dst_reg = imm32 */
170

171
#define BPF_MOV64_RAW(TYPE, DST, SRC, IMM)			\
172
	((struct bpf_insn) {					\
173
		.code  = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE),	\
174 175
		.dst_reg = DST,					\
		.src_reg = SRC,					\
176 177 178
		.off   = 0,					\
		.imm   = IMM })

179
#define BPF_MOV32_RAW(TYPE, DST, SRC, IMM)			\
180
	((struct bpf_insn) {					\
181
		.code  = BPF_ALU | BPF_MOV | BPF_SRC(TYPE),	\
182 183
		.dst_reg = DST,					\
		.src_reg = SRC,					\
184 185 186
		.off   = 0,					\
		.imm   = IMM })

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

189
#define BPF_LD_ABS(SIZE, IMM)					\
190
	((struct bpf_insn) {					\
191
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS,	\
192 193
		.dst_reg = 0,					\
		.src_reg = 0,					\
194
		.off   = 0,					\
195
		.imm   = IMM })
196

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

199
#define BPF_LD_IND(SIZE, SRC, IMM)				\
200
	((struct bpf_insn) {					\
201
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_IND,	\
202 203
		.dst_reg = 0,					\
		.src_reg = SRC,					\
204
		.off   = 0,					\
205
		.imm   = IMM })
206

207
/* Memory load, dst_reg = *(uint *) (src_reg + off16) */
208

209
#define BPF_LDX_MEM(SIZE, DST, SRC, OFF)			\
210
	((struct bpf_insn) {					\
211
		.code  = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM,	\
212 213
		.dst_reg = DST,					\
		.src_reg = SRC,					\
214 215 216
		.off   = OFF,					\
		.imm   = 0 })

217 218 219
/* Memory store, *(uint *) (dst_reg + off16) = src_reg */

#define BPF_STX_MEM(SIZE, DST, SRC, OFF)			\
220
	((struct bpf_insn) {					\
221
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM,	\
222 223
		.dst_reg = DST,					\
		.src_reg = SRC,					\
224 225 226
		.off   = OFF,					\
		.imm   = 0 })

227 228 229
/* Memory store, *(uint *) (dst_reg + off16) = imm32 */

#define BPF_ST_MEM(SIZE, DST, OFF, IMM)				\
230
	((struct bpf_insn) {					\
231 232 233 234 235 236 237
		.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 */
238

239
#define BPF_JMP_REG(OP, DST, SRC, OFF)				\
240
	((struct bpf_insn) {					\
241
		.code  = BPF_JMP | BPF_OP(OP) | BPF_X,		\
242 243
		.dst_reg = DST,					\
		.src_reg = SRC,					\
244 245 246
		.off   = OFF,					\
		.imm   = 0 })

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

249
#define BPF_JMP_IMM(OP, DST, IMM, OFF)				\
250
	((struct bpf_insn) {					\
251
		.code  = BPF_JMP | BPF_OP(OP) | BPF_K,		\
252 253
		.dst_reg = DST,					\
		.src_reg = 0,					\
254 255 256 257 258 259
		.off   = OFF,					\
		.imm   = IMM })

/* Function call */

#define BPF_EMIT_CALL(FUNC)					\
260
	((struct bpf_insn) {					\
261
		.code  = BPF_JMP | BPF_CALL,			\
262 263
		.dst_reg = 0,					\
		.src_reg = 0,					\
264 265 266 267 268
		.off   = 0,					\
		.imm   = ((FUNC) - __bpf_call_base) })

/* Raw code statement block */

269
#define BPF_RAW_INSN(CODE, DST, SRC, OFF, IMM)			\
270
	((struct bpf_insn) {					\
271
		.code  = CODE,					\
272 273
		.dst_reg = DST,					\
		.src_reg = SRC,					\
274 275 276 277 278 279
		.off   = OFF,					\
		.imm   = IMM })

/* Program exit */

#define BPF_EXIT_INSN()						\
280
	((struct bpf_insn) {					\
281
		.code  = BPF_JMP | BPF_EXIT,			\
282 283
		.dst_reg = 0,					\
		.src_reg = 0,					\
284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301
		.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;						\
})
302

303
/* Macro to invoke filter function. */
304 305
#define SK_RUN_FILTER(filter, ctx) \
	(*filter->prog->bpf_func)(ctx, filter->prog->insnsi)
306

307
struct bpf_insn {
308
	__u8	code;		/* opcode */
309 310
	__u8	dst_reg:4;	/* dest register */
	__u8	src_reg:4;	/* source register */
311 312 313 314 315 316
	__s16	off;		/* signed offset */
	__s32	imm;		/* signed immediate constant */
};

#ifdef CONFIG_COMPAT
/* A struct sock_filter is architecture independent. */
317 318
struct compat_sock_fprog {
	u16		len;
319
	compat_uptr_t	filter;	/* struct sock_filter * */
320 321 322
};
#endif

323 324 325 326 327
struct sock_fprog_kern {
	u16			len;
	struct sock_filter	*filter;
};

328 329 330 331
struct bpf_work_struct {
	struct bpf_prog *prog;
	struct work_struct work;
};
332

333
struct bpf_prog {
334
	u32			pages;		/* Number of allocated pages */
335 336
	u32			jited:1,	/* Is our filter JIT'ed? */
				len:31;		/* Number of filter blocks */
337
	struct sock_fprog_kern	*orig_prog;	/* Original BPF program */
338
	struct bpf_work_struct	*work;		/* Deferred free work struct */
339
	unsigned int		(*bpf_func)(const struct sk_buff *skb,
340
					    const struct bpf_insn *filter);
341
	/* Instructions for interpreter */
342
	union {
343
		struct sock_filter	insns[0];
344
		struct bpf_insn		insnsi[0];
345
	};
346 347
};

348 349 350 351 352 353 354 355 356
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)
357
{
358 359
	return max(sizeof(struct bpf_prog),
		   offsetof(struct bpf_prog, insns[proglen]));
360 361
}

362
#define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
363

364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383
#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 */

384
int sk_filter(struct sock *sk, struct sk_buff *skb);
385

386 387
void bpf_prog_select_runtime(struct bpf_prog *fp);
void bpf_prog_free(struct bpf_prog *fp);
388

389 390
int bpf_convert_filter(struct sock_filter *prog, int len,
		       struct bpf_insn *new_prog, int *new_len);
391

392 393 394 395 396 397 398 399 400 401 402
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);
}

403 404
int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
void bpf_prog_destroy(struct bpf_prog *fp);
405

406 407
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
int sk_detach_filter(struct sock *sk);
408

409
int bpf_check_classic(const struct sock_filter *filter, unsigned int flen);
410 411 412
int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
		  unsigned int len);

413
bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
414
void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
415

416
u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
417
void bpf_int_jit_compile(struct bpf_prog *fp);
418

419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453
#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;
	}
}

454 455 456 457 458 459 460 461 462 463 464 465
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);
}

466
#ifdef CONFIG_BPF_JIT
X
Xi Wang 已提交
467
#include <stdarg.h>
468 469 470
#include <linux/linkage.h>
#include <linux/printk.h>

471 472
void bpf_jit_compile(struct bpf_prog *fp);
void bpf_jit_free(struct bpf_prog *fp);
473 474 475 476

static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
				u32 pass, void *image)
{
477
	pr_err("flen=%u proglen=%u pass=%u image=%pK\n",
478 479
	       flen, proglen, pass, image);
	if (image)
480
		print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
481 482
			       16, 1, image, proglen, false);
}
483
#else
484
#include <linux/slab.h>
485

486
static inline void bpf_jit_compile(struct bpf_prog *fp)
487 488
{
}
489

490
static inline void bpf_jit_free(struct bpf_prog *fp)
491
{
492
	bpf_prog_unlock_free(fp);
493
}
494
#endif /* CONFIG_BPF_JIT */
495

496 497
static inline int bpf_tell_extensions(void)
{
498
	return SKF_AD_MAX;
499 500
}

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