blob: a8df0a9d68e65af3da5cde4138c4c6bc282e234e [file] [log] [blame]
Willem de Bruijne6f30c72013-01-18 07:17:30 +00001/* Xtables module to match packets using a BPF filter.
2 * Copyright 2013 Google Inc.
3 * Written by Willem de Bruijn <willemb@google.com>
4 *
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation.
8 */
9
10#include <linux/module.h>
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030011#include <linux/syscalls.h>
Willem de Bruijne6f30c72013-01-18 07:17:30 +000012#include <linux/skbuff.h>
13#include <linux/filter.h>
Willem de Bruijneb8925e2016-12-06 16:25:02 -050014#include <linux/bpf.h>
Willem de Bruijne6f30c72013-01-18 07:17:30 +000015
16#include <linux/netfilter/xt_bpf.h>
17#include <linux/netfilter/x_tables.h>
18
19MODULE_AUTHOR("Willem de Bruijn <willemb@google.com>");
20MODULE_DESCRIPTION("Xtables: BPF filter match");
21MODULE_LICENSE("GPL");
22MODULE_ALIAS("ipt_bpf");
23MODULE_ALIAS("ip6t_bpf");
24
Willem de Bruijneb8925e2016-12-06 16:25:02 -050025static int __bpf_mt_check_bytecode(struct sock_filter *insns, __u16 len,
26 struct bpf_prog **ret)
Willem de Bruijne6f30c72013-01-18 07:17:30 +000027{
Daniel Borkmannb1fcd352014-05-23 18:43:58 +020028 struct sock_fprog_kern program;
Willem de Bruijne6f30c72013-01-18 07:17:30 +000029
Jann Horn52447002017-12-01 01:46:07 +010030 if (len > XT_BPF_MAX_NUM_INSTR)
31 return -EINVAL;
32
Willem de Bruijneb8925e2016-12-06 16:25:02 -050033 program.len = len;
34 program.filter = insns;
Daniel Borkmannb1fcd352014-05-23 18:43:58 +020035
Willem de Bruijneb8925e2016-12-06 16:25:02 -050036 if (bpf_prog_create(ret, &program)) {
Willem de Bruijne6f30c72013-01-18 07:17:30 +000037 pr_info("bpf: check failed: parse error\n");
38 return -EINVAL;
39 }
40
41 return 0;
42}
43
Willem de Bruijneb8925e2016-12-06 16:25:02 -050044static int __bpf_mt_check_fd(int fd, struct bpf_prog **ret)
45{
46 struct bpf_prog *prog;
47
48 prog = bpf_prog_get_type(fd, BPF_PROG_TYPE_SOCKET_FILTER);
49 if (IS_ERR(prog))
50 return PTR_ERR(prog);
51
52 *ret = prog;
53 return 0;
54}
55
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030056static int __bpf_mt_check_path(const char *path, struct bpf_prog **ret)
57{
Jann Horn52447002017-12-01 01:46:07 +010058 if (strnlen(path, XT_BPF_PATH_MAX) == XT_BPF_PATH_MAX)
59 return -EINVAL;
60
Al Viro7dc12f72017-12-02 20:20:38 -050061 *ret = bpf_prog_get_type_path(path, BPF_PROG_TYPE_SOCKET_FILTER);
62 return PTR_ERR_OR_ZERO(*ret);
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030063
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030064}
65
Willem de Bruijneb8925e2016-12-06 16:25:02 -050066static int bpf_mt_check(const struct xt_mtchk_param *par)
67{
68 struct xt_bpf_info *info = par->matchinfo;
69
70 return __bpf_mt_check_bytecode(info->bpf_program,
71 info->bpf_program_num_elem,
72 &info->filter);
73}
74
75static int bpf_mt_check_v1(const struct xt_mtchk_param *par)
76{
77 struct xt_bpf_info_v1 *info = par->matchinfo;
78
79 if (info->mode == XT_BPF_MODE_BYTECODE)
80 return __bpf_mt_check_bytecode(info->bpf_program,
81 info->bpf_program_num_elem,
82 &info->filter);
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030083 else if (info->mode == XT_BPF_MODE_FD_ELF)
Willem de Bruijneb8925e2016-12-06 16:25:02 -050084 return __bpf_mt_check_fd(info->fd, &info->filter);
Shmulik Ladkani7e3c72f2017-10-09 15:27:15 +030085 else if (info->mode == XT_BPF_MODE_PATH_PINNED)
86 return __bpf_mt_check_path(info->path, &info->filter);
Willem de Bruijneb8925e2016-12-06 16:25:02 -050087 else
88 return -EINVAL;
89}
90
Willem de Bruijne6f30c72013-01-18 07:17:30 +000091static bool bpf_mt(const struct sk_buff *skb, struct xt_action_param *par)
92{
93 const struct xt_bpf_info *info = par->matchinfo;
94
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -070095 return BPF_PROG_RUN(info->filter, skb);
Willem de Bruijne6f30c72013-01-18 07:17:30 +000096}
97
Willem de Bruijneb8925e2016-12-06 16:25:02 -050098static bool bpf_mt_v1(const struct sk_buff *skb, struct xt_action_param *par)
99{
100 const struct xt_bpf_info_v1 *info = par->matchinfo;
101
102 return !!bpf_prog_run_save_cb(info->filter, (struct sk_buff *) skb);
103}
104
Willem de Bruijne6f30c72013-01-18 07:17:30 +0000105static void bpf_mt_destroy(const struct xt_mtdtor_param *par)
106{
107 const struct xt_bpf_info *info = par->matchinfo;
Willem de Bruijneb8925e2016-12-06 16:25:02 -0500108
Alexei Starovoitov7ae457c2014-07-30 20:34:16 -0700109 bpf_prog_destroy(info->filter);
Willem de Bruijne6f30c72013-01-18 07:17:30 +0000110}
111
Willem de Bruijneb8925e2016-12-06 16:25:02 -0500112static void bpf_mt_destroy_v1(const struct xt_mtdtor_param *par)
113{
114 const struct xt_bpf_info_v1 *info = par->matchinfo;
115
116 bpf_prog_destroy(info->filter);
117}
118
119static struct xt_match bpf_mt_reg[] __read_mostly = {
120 {
121 .name = "bpf",
122 .revision = 0,
123 .family = NFPROTO_UNSPEC,
124 .checkentry = bpf_mt_check,
125 .match = bpf_mt,
126 .destroy = bpf_mt_destroy,
127 .matchsize = sizeof(struct xt_bpf_info),
128 .me = THIS_MODULE,
129 },
130 {
131 .name = "bpf",
132 .revision = 1,
133 .family = NFPROTO_UNSPEC,
134 .checkentry = bpf_mt_check_v1,
135 .match = bpf_mt_v1,
136 .destroy = bpf_mt_destroy_v1,
137 .matchsize = sizeof(struct xt_bpf_info_v1),
138 .me = THIS_MODULE,
139 },
Willem de Bruijne6f30c72013-01-18 07:17:30 +0000140};
141
142static int __init bpf_mt_init(void)
143{
Willem de Bruijneb8925e2016-12-06 16:25:02 -0500144 return xt_register_matches(bpf_mt_reg, ARRAY_SIZE(bpf_mt_reg));
Willem de Bruijne6f30c72013-01-18 07:17:30 +0000145}
146
147static void __exit bpf_mt_exit(void)
148{
Willem de Bruijneb8925e2016-12-06 16:25:02 -0500149 xt_unregister_matches(bpf_mt_reg, ARRAY_SIZE(bpf_mt_reg));
Willem de Bruijne6f30c72013-01-18 07:17:30 +0000150}
151
152module_init(bpf_mt_init);
153module_exit(bpf_mt_exit);