filter.h 10.7 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 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
/* Helper macros for filter block array initializers. */

/* ALU ops on registers, bpf_add|sub|...: A += X */

#define BPF_ALU64_REG(OP, A, X)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_X,	\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = 0 })

#define BPF_ALU32_REG(OP, A, X)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_OP(OP) | BPF_X,		\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = 0 })

/* ALU ops on immediates, bpf_add|sub|...: A += IMM */

#define BPF_ALU64_IMM(OP, A, IMM)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_K,	\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = IMM })

#define BPF_ALU32_IMM(OP, A, IMM)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_OP(OP) | BPF_K,		\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = IMM })

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

#define BPF_ENDIAN(TYPE, A, LEN)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_END | BPF_SRC(TYPE),	\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = LEN })

/* Short form of mov, A = X */

#define BPF_MOV64_REG(A, X)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_X,		\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = 0 })

#define BPF_MOV32_REG(A, X)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_X,		\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = 0 })

/* Short form of mov, A = IMM */

#define BPF_MOV64_IMM(A, IMM)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_K,		\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = IMM })

#define BPF_MOV32_IMM(A, IMM)					\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_K,		\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = IMM })

/* Short form of mov based on type, BPF_X: A = X,  BPF_K: A = IMM */

#define BPF_MOV64_RAW(TYPE, A, X, IMM)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE),	\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = IMM })

#define BPF_MOV32_RAW(TYPE, A, X, IMM)				\
	((struct sock_filter_int) {				\
		.code  = BPF_ALU | BPF_MOV | BPF_SRC(TYPE),	\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = IMM })

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

#define BPF_LD_ABS(SIZE, OFF)					\
	((struct sock_filter_int) {				\
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS,	\
		.a_reg = 0,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = OFF })

/* Indirect packet access, R0 = *(uint *) (skb->data + X + OFF) */

#define BPF_LD_IND(SIZE, X, OFF)				\
	((struct sock_filter_int) {				\
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_IND,	\
		.a_reg = 0,					\
		.x_reg = X,					\
		.off   = 0,					\
		.imm   = OFF })

/* Memory store, A = *(uint *) (X + OFF), and vice versa */

#define BPF_LDX_MEM(SIZE, A, X, OFF)				\
	((struct sock_filter_int) {				\
		.code  = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM,	\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = OFF,					\
		.imm   = 0 })

#define BPF_STX_MEM(SIZE, A, X, OFF)				\
	((struct sock_filter_int) {				\
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM,	\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = OFF,					\
		.imm   = 0 })

/* Conditional jumps against registers, if (A 'op' X) goto pc + OFF */

#define BPF_JMP_REG(OP, A, X, OFF)				\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_OP(OP) | BPF_X,		\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = OFF,					\
		.imm   = 0 })

/* Conditional jumps against immediates, if (A 'op' IMM) goto pc + OFF */

#define BPF_JMP_IMM(OP, A, IMM, OFF)				\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_OP(OP) | BPF_K,		\
		.a_reg = A,					\
		.x_reg = 0,					\
		.off   = OFF,					\
		.imm   = IMM })

/* Function call */

#define BPF_EMIT_CALL(FUNC)					\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_CALL,			\
		.a_reg = 0,					\
		.x_reg = 0,					\
		.off   = 0,					\
		.imm   = ((FUNC) - __bpf_call_base) })

/* Raw code statement block */

#define BPF_RAW_INSN(CODE, A, X, OFF, IMM)			\
	((struct sock_filter_int) {				\
		.code  = CODE,					\
		.a_reg = A,					\
		.x_reg = X,					\
		.off   = OFF,					\
		.imm   = IMM })

/* Program exit */

#define BPF_EXIT_INSN()						\
	((struct sock_filter_int) {				\
		.code  = BPF_JMP | BPF_EXIT,			\
		.a_reg = 0,					\
		.x_reg = 0,					\
		.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;						\
})
284

285 286
/* Macro to invoke filter function. */
#define SK_RUN_FILTER(filter, ctx)  (*filter->bpf_func)(ctx, filter->insnsi)
287 288 289 290 291 292 293 294 295 296 297

struct sock_filter_int {
	__u8	code;		/* opcode */
	__u8	a_reg:4;	/* dest register */
	__u8	x_reg:4;	/* source register */
	__s16	off;		/* signed offset */
	__s32	imm;		/* signed immediate constant */
};

#ifdef CONFIG_COMPAT
/* A struct sock_filter is architecture independent. */
298 299
struct compat_sock_fprog {
	u16		len;
300
	compat_uptr_t	filter;	/* struct sock_filter * */
301 302 303
};
#endif

304 305 306 307 308
struct sock_fprog_kern {
	u16			len;
	struct sock_filter	*filter;
};

309 310
struct sk_buff;
struct sock;
311
struct seccomp_data;
312

313
struct sk_filter {
314
	atomic_t		refcnt;
315 316
	u32			jited:1,	/* Is our filter JIT'ed? */
				len:31;		/* Number of filter blocks */
317
	struct sock_fprog_kern	*orig_prog;	/* Original BPF program */
318
	struct rcu_head		rcu;
319
	unsigned int		(*bpf_func)(const struct sk_buff *skb,
320
					    const struct sock_filter_int *filter);
321
	union {
322 323
		struct sock_filter	insns[0];
		struct sock_filter_int	insnsi[0];
324 325
		struct work_struct	work;
	};
326 327
};

328
static inline unsigned int sk_filter_size(unsigned int proglen)
329
{
330 331
	return max(sizeof(struct sk_filter),
		   offsetof(struct sk_filter, insns[proglen]));
332 333
}

334 335 336
#define sk_filter_proglen(fprog)			\
		(fprog->len * sizeof(fprog->filter[0]))

337
int sk_filter(struct sock *sk, struct sk_buff *skb);
338

339 340
void sk_filter_select_runtime(struct sk_filter *fp);
void sk_filter_free(struct sk_filter *fp);
341 342 343

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

345
int sk_unattached_filter_create(struct sk_filter **pfp,
346
				struct sock_fprog_kern *fprog);
347
void sk_unattached_filter_destroy(struct sk_filter *fp);
348

349 350
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
int sk_detach_filter(struct sock *sk);
351

352 353 354 355 356 357
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);
358

359 360 361
u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
void bpf_int_jit_compile(struct sk_filter *fp);

362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396
#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;
	}
}

397
#ifdef CONFIG_BPF_JIT
X
Xi Wang 已提交
398
#include <stdarg.h>
399 400 401
#include <linux/linkage.h>
#include <linux/printk.h>

402 403
void bpf_jit_compile(struct sk_filter *fp);
void bpf_jit_free(struct sk_filter *fp);
404 405 406 407

static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
				u32 pass, void *image)
{
408
	pr_err("flen=%u proglen=%u pass=%u image=%pK\n",
409 410
	       flen, proglen, pass, image);
	if (image)
411
		print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
412 413
			       16, 1, image, proglen, false);
}
414
#else
415
#include <linux/slab.h>
416

417 418 419
static inline void bpf_jit_compile(struct sk_filter *fp)
{
}
420

421 422
static inline void bpf_jit_free(struct sk_filter *fp)
{
423
	kfree(fp);
424
}
425
#endif /* CONFIG_BPF_JIT */
426

427 428
static inline int bpf_tell_extensions(void)
{
429
	return SKF_AD_MAX;
430 431
}

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