filter.h 15.9 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__

7 8
#include <stdarg.h>

A
Arun Sharma 已提交
9
#include <linux/atomic.h>
10
#include <linux/compat.h>
11
#include <linux/skbuff.h>
12 13
#include <linux/linkage.h>
#include <linux/printk.h>
14
#include <linux/workqueue.h>
15
#include <linux/sched.h>
16
#include <net/sch_generic.h>
17

18
#include <asm/cacheflush.h>
19 20

#include <uapi/linux/filter.h>
21
#include <uapi/linux/bpf.h>
22 23 24 25

struct sk_buff;
struct sock;
struct seccomp_data;
26
struct bpf_prog_aux;
27

28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43
/* 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
44 45 46 47

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

48 49
/* Helper macros for filter block array initializers. */

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

52
#define BPF_ALU64_REG(OP, DST, SRC)				\
53
	((struct bpf_insn) {					\
54
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_X,	\
55 56
		.dst_reg = DST,					\
		.src_reg = SRC,					\
57 58 59
		.off   = 0,					\
		.imm   = 0 })

60
#define BPF_ALU32_REG(OP, DST, SRC)				\
61
	((struct bpf_insn) {					\
62
		.code  = BPF_ALU | BPF_OP(OP) | BPF_X,		\
63 64
		.dst_reg = DST,					\
		.src_reg = SRC,					\
65 66 67
		.off   = 0,					\
		.imm   = 0 })

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

70
#define BPF_ALU64_IMM(OP, DST, IMM)				\
71
	((struct bpf_insn) {					\
72
		.code  = BPF_ALU64 | BPF_OP(OP) | BPF_K,	\
73 74
		.dst_reg = DST,					\
		.src_reg = 0,					\
75 76 77
		.off   = 0,					\
		.imm   = IMM })

78
#define BPF_ALU32_IMM(OP, DST, IMM)				\
79
	((struct bpf_insn) {					\
80
		.code  = BPF_ALU | BPF_OP(OP) | BPF_K,		\
81 82
		.dst_reg = DST,					\
		.src_reg = 0,					\
83 84 85 86 87
		.off   = 0,					\
		.imm   = IMM })

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

88
#define BPF_ENDIAN(TYPE, DST, LEN)				\
89
	((struct bpf_insn) {					\
90
		.code  = BPF_ALU | BPF_END | BPF_SRC(TYPE),	\
91 92
		.dst_reg = DST,					\
		.src_reg = 0,					\
93 94 95
		.off   = 0,					\
		.imm   = LEN })

96
/* Short form of mov, dst_reg = src_reg */
97

98
#define BPF_MOV64_REG(DST, SRC)					\
99
	((struct bpf_insn) {					\
100
		.code  = BPF_ALU64 | BPF_MOV | BPF_X,		\
101 102
		.dst_reg = DST,					\
		.src_reg = SRC,					\
103 104 105
		.off   = 0,					\
		.imm   = 0 })

106
#define BPF_MOV32_REG(DST, SRC)					\
107
	((struct bpf_insn) {					\
108
		.code  = BPF_ALU | BPF_MOV | BPF_X,		\
109 110
		.dst_reg = DST,					\
		.src_reg = SRC,					\
111 112 113
		.off   = 0,					\
		.imm   = 0 })

114
/* Short form of mov, dst_reg = imm32 */
115

116
#define BPF_MOV64_IMM(DST, IMM)					\
117
	((struct bpf_insn) {					\
118
		.code  = BPF_ALU64 | BPF_MOV | BPF_K,		\
119 120
		.dst_reg = DST,					\
		.src_reg = 0,					\
121 122 123
		.off   = 0,					\
		.imm   = IMM })

124
#define BPF_MOV32_IMM(DST, IMM)					\
125
	((struct bpf_insn) {					\
126
		.code  = BPF_ALU | BPF_MOV | BPF_K,		\
127 128
		.dst_reg = DST,					\
		.src_reg = 0,					\
129 130 131
		.off   = 0,					\
		.imm   = IMM })

132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149
/* 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 })

150 151 152 153
/* pseudo BPF_LD_IMM64 insn used to refer to process-local map_fd */
#define BPF_LD_MAP_FD(DST, MAP_FD)				\
	BPF_LD_IMM64_RAW(DST, BPF_PSEUDO_MAP_FD, MAP_FD)

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

156
#define BPF_MOV64_RAW(TYPE, DST, SRC, IMM)			\
157
	((struct bpf_insn) {					\
158
		.code  = BPF_ALU64 | BPF_MOV | BPF_SRC(TYPE),	\
159 160
		.dst_reg = DST,					\
		.src_reg = SRC,					\
161 162 163
		.off   = 0,					\
		.imm   = IMM })

164
#define BPF_MOV32_RAW(TYPE, DST, SRC, IMM)			\
165
	((struct bpf_insn) {					\
166
		.code  = BPF_ALU | BPF_MOV | BPF_SRC(TYPE),	\
167 168
		.dst_reg = DST,					\
		.src_reg = SRC,					\
169 170 171
		.off   = 0,					\
		.imm   = IMM })

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

174
#define BPF_LD_ABS(SIZE, IMM)					\
175
	((struct bpf_insn) {					\
176
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_ABS,	\
177 178
		.dst_reg = 0,					\
		.src_reg = 0,					\
179
		.off   = 0,					\
180
		.imm   = IMM })
181

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

184
#define BPF_LD_IND(SIZE, SRC, IMM)				\
185
	((struct bpf_insn) {					\
186
		.code  = BPF_LD | BPF_SIZE(SIZE) | BPF_IND,	\
187 188
		.dst_reg = 0,					\
		.src_reg = SRC,					\
189
		.off   = 0,					\
190
		.imm   = IMM })
191

192
/* Memory load, dst_reg = *(uint *) (src_reg + off16) */
193

194
#define BPF_LDX_MEM(SIZE, DST, SRC, OFF)			\
195
	((struct bpf_insn) {					\
196
		.code  = BPF_LDX | BPF_SIZE(SIZE) | BPF_MEM,	\
197 198
		.dst_reg = DST,					\
		.src_reg = SRC,					\
199 200 201
		.off   = OFF,					\
		.imm   = 0 })

202 203 204
/* Memory store, *(uint *) (dst_reg + off16) = src_reg */

#define BPF_STX_MEM(SIZE, DST, SRC, OFF)			\
205
	((struct bpf_insn) {					\
206
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_MEM,	\
207 208
		.dst_reg = DST,					\
		.src_reg = SRC,					\
209 210 211
		.off   = OFF,					\
		.imm   = 0 })

212 213 214 215 216 217 218 219 220 221
/* Atomic memory add, *(uint *)(dst_reg + off16) += src_reg */

#define BPF_STX_XADD(SIZE, DST, SRC, OFF)			\
	((struct bpf_insn) {					\
		.code  = BPF_STX | BPF_SIZE(SIZE) | BPF_XADD,	\
		.dst_reg = DST,					\
		.src_reg = SRC,					\
		.off   = OFF,					\
		.imm   = 0 })

222 223 224
/* Memory store, *(uint *) (dst_reg + off16) = imm32 */

#define BPF_ST_MEM(SIZE, DST, OFF, IMM)				\
225
	((struct bpf_insn) {					\
226 227 228 229 230 231 232
		.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 */
233

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

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

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

/* Function call */

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

/* Raw code statement block */

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

/* Program exit */

#define BPF_EXIT_INSN()						\
275
	((struct bpf_insn) {					\
276
		.code  = BPF_JMP | BPF_EXIT,			\
277 278
		.dst_reg = 0,					\
		.src_reg = 0,					\
279 280 281
		.off   = 0,					\
		.imm   = 0 })

282 283 284 285 286 287 288 289
/* Internal classic blocks for direct assignment */

#define __BPF_STMT(CODE, K)					\
	((struct sock_filter) BPF_STMT(CODE, K))

#define __BPF_JUMP(CODE, K, JT, JF)				\
	((struct sock_filter) BPF_JUMP(CODE, K, JT, JF))

290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
#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;						\
})
305

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

314 315 316 317 318
struct sock_fprog_kern {
	u16			len;
	struct sock_filter	*filter;
};

319 320 321 322 323
struct bpf_binary_header {
	unsigned int pages;
	u8 image[];
};

324
struct bpf_prog {
325
	u16			pages;		/* Number of allocated pages */
326 327
	kmemcheck_bitfield_begin(meta);
	u16			jited:1,	/* Is our filter JIT'ed? */
328
				gpl_compatible:1, /* Is filter GPL compatible? */
329
				cb_access:1,	/* Is control block accessed? */
330
				dst_needed:1;	/* Do we need dst entry? */
331
	kmemcheck_bitfield_end(meta);
332
	u32			len;		/* Number of filter blocks */
333
	enum bpf_prog_type	type;		/* Type of BPF program */
334
	struct bpf_prog_aux	*aux;		/* Auxiliary fields */
335
	struct sock_fprog_kern	*orig_prog;	/* Original BPF program */
336
	unsigned int		(*bpf_func)(const struct sk_buff *skb,
337
					    const struct bpf_insn *filter);
338
	/* Instructions for interpreter */
339
	union {
340
		struct sock_filter	insns[0];
341
		struct bpf_insn		insnsi[0];
342
	};
343 344
};

345 346 347 348 349 350 351 352
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)

353 354
#define BPF_SKB_CB_LEN QDISC_CB_PRIV_LEN

355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370
struct bpf_skb_data_end {
	struct qdisc_skb_cb qdisc_cb;
	void *data_end;
};

/* compute the linear packet data range [data, data_end) which
 * will be accessed by cls_bpf and act_bpf programs
 */
static inline void bpf_compute_data_end(struct sk_buff *skb)
{
	struct bpf_skb_data_end *cb = (struct bpf_skb_data_end *)skb->cb;

	BUILD_BUG_ON(sizeof(*cb) > FIELD_SIZEOF(struct sk_buff, cb));
	cb->data_end = skb->data + skb_headlen(skb);
}

371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389
static inline u8 *bpf_skb_cb(struct sk_buff *skb)
{
	/* eBPF programs may read/write skb->cb[] area to transfer meta
	 * data between tail calls. Since this also needs to work with
	 * tc, that scratch memory is mapped to qdisc_skb_cb's data area.
	 *
	 * In some socket filter cases, the cb unfortunately needs to be
	 * saved/restored so that protocol specific skb->cb[] data won't
	 * be lost. In any case, due to unpriviledged eBPF programs
	 * attached to sockets, we need to clear the bpf_skb_cb() area
	 * to not leak previous contents to user space.
	 */
	BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) != BPF_SKB_CB_LEN);
	BUILD_BUG_ON(FIELD_SIZEOF(struct __sk_buff, cb) !=
		     FIELD_SIZEOF(struct qdisc_skb_cb, data));

	return qdisc_skb_cb(skb)->data;
}

390 391 392
static inline u32 bpf_prog_run_save_cb(const struct bpf_prog *prog,
				       struct sk_buff *skb)
{
393 394
	u8 *cb_data = bpf_skb_cb(skb);
	u8 cb_saved[BPF_SKB_CB_LEN];
395 396 397
	u32 res;

	if (unlikely(prog->cb_access)) {
398 399
		memcpy(cb_saved, cb_data, sizeof(cb_saved));
		memset(cb_data, 0, sizeof(cb_saved));
400 401 402 403 404
	}

	res = BPF_PROG_RUN(prog, skb);

	if (unlikely(prog->cb_access))
405
		memcpy(cb_data, cb_saved, sizeof(cb_saved));
406 407 408 409 410 411 412

	return res;
}

static inline u32 bpf_prog_run_clear_cb(const struct bpf_prog *prog,
					struct sk_buff *skb)
{
413
	u8 *cb_data = bpf_skb_cb(skb);
414 415

	if (unlikely(prog->cb_access))
416 417
		memset(cb_data, 0, BPF_SKB_CB_LEN);

418 419 420
	return BPF_PROG_RUN(prog, skb);
}

421
static inline unsigned int bpf_prog_size(unsigned int proglen)
422
{
423 424
	return max(sizeof(struct bpf_prog),
		   offsetof(struct bpf_prog, insns[proglen]));
425 426
}

427 428 429 430 431 432 433 434 435 436
static inline bool bpf_prog_was_classic(const struct bpf_prog *prog)
{
	/* When classic BPF programs have been loaded and the arch
	 * does not have a classic BPF JIT (anymore), they have been
	 * converted via bpf_migrate_filter() to eBPF and thus always
	 * have an unspec program type.
	 */
	return prog->type == BPF_PROG_TYPE_UNSPEC;
}

437
#define bpf_classic_proglen(fprog) (fprog->len * sizeof(fprog->filter[0]))
438

439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458
#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 */

459
int sk_filter(struct sock *sk, struct sk_buff *skb);
460

461
struct bpf_prog *bpf_prog_select_runtime(struct bpf_prog *fp, int *err);
462
void bpf_prog_free(struct bpf_prog *fp);
463

464 465 466 467 468 469 470 471 472 473 474
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);
}

475 476 477
typedef int (*bpf_aux_classic_check_t)(struct sock_filter *filter,
				       unsigned int flen);

478
int bpf_prog_create(struct bpf_prog **pfp, struct sock_fprog_kern *fprog);
479
int bpf_prog_create_from_user(struct bpf_prog **pfp, struct sock_fprog *fprog,
480
			      bpf_aux_classic_check_t trans, bool save_orig);
481
void bpf_prog_destroy(struct bpf_prog *fp);
482

483
int sk_attach_filter(struct sock_fprog *fprog, struct sock *sk);
484
int sk_attach_bpf(u32 ufd, struct sock *sk);
485 486
int sk_reuseport_attach_filter(struct sock_fprog *fprog, struct sock *sk);
int sk_reuseport_attach_bpf(u32 ufd, struct sock *sk);
487 488 489 490
int sk_detach_filter(struct sock *sk);
int sk_get_filter(struct sock *sk, struct sock_filter __user *filter,
		  unsigned int len);

491
bool sk_filter_charge(struct sock *sk, struct sk_filter *fp);
492
void sk_filter_uncharge(struct sock *sk, struct sk_filter *fp);
493

494
u64 __bpf_call_base(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5);
495 496

struct bpf_prog *bpf_int_jit_compile(struct bpf_prog *prog);
497
bool bpf_helper_changes_skb_data(void *func);
498

499 500 501
struct bpf_prog *bpf_patch_insn_single(struct bpf_prog *prog, u32 off,
				       const struct bpf_insn *patch, u32 len);

502
#ifdef CONFIG_BPF_JIT
503 504
extern int bpf_jit_enable;

505 506 507 508 509 510 511 512 513 514 515 516 517 518
typedef void (*bpf_jit_fill_hole_t)(void *area, unsigned int size);

struct bpf_binary_header *
bpf_jit_binary_alloc(unsigned int proglen, u8 **image_ptr,
		     unsigned int alignment,
		     bpf_jit_fill_hole_t bpf_fill_ill_insns);
void bpf_jit_binary_free(struct bpf_binary_header *hdr);

void bpf_jit_compile(struct bpf_prog *fp);
void bpf_jit_free(struct bpf_prog *fp);

static inline void bpf_jit_dump(unsigned int flen, unsigned int proglen,
				u32 pass, void *image)
{
519 520 521
	pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen,
	       proglen, pass, image, current->comm, task_pid_nr(current));

522 523 524 525 526 527 528 529 530 531 532 533 534 535 536
	if (image)
		print_hex_dump(KERN_ERR, "JIT code: ", DUMP_PREFIX_OFFSET,
			       16, 1, image, proglen, false);
}
#else
static inline void bpf_jit_compile(struct bpf_prog *fp)
{
}

static inline void bpf_jit_free(struct bpf_prog *fp)
{
	bpf_prog_unlock_free(fp);
}
#endif /* CONFIG_BPF_JIT */

537 538
#define BPF_ANC		BIT(15)

539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557
static inline bool bpf_needs_clear_a(const struct sock_filter *first)
{
	switch (first->code) {
	case BPF_RET | BPF_K:
	case BPF_LD | BPF_W | BPF_LEN:
		return false;

	case BPF_LD | BPF_W | BPF_ABS:
	case BPF_LD | BPF_H | BPF_ABS:
	case BPF_LD | BPF_B | BPF_ABS:
		if (first->k == SKF_AD_OFF + SKF_AD_ALU_XOR_X)
			return true;
		return false;

	default:
		return true;
	}
}

558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583
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);
584
		BPF_ANCILLARY(VLAN_TPID);
585 586 587 588 589 590 591
		}
		/* Fallthrough. */
	default:
		return ftest->code;
	}
}

592 593 594 595 596 597 598 599 600 601 602 603
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);
}

604 605
static inline int bpf_tell_extensions(void)
{
606
	return SKF_AD_MAX;
607 608
}

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