diff options
Diffstat (limited to 'net/netfilter/xt_quota2.c')
-rw-r--r-- | net/netfilter/xt_quota2.c | 381 |
1 files changed, 381 insertions, 0 deletions
diff --git a/net/netfilter/xt_quota2.c b/net/netfilter/xt_quota2.c new file mode 100644 index 00000000000..3c72bea2dd6 --- /dev/null +++ b/net/netfilter/xt_quota2.c | |||
@@ -0,0 +1,381 @@ | |||
1 | /* | ||
2 | * xt_quota2 - enhanced xt_quota that can count upwards and in packets | ||
3 | * as a minimal accounting match. | ||
4 | * by Jan Engelhardt <jengelh@medozas.de>, 2008 | ||
5 | * | ||
6 | * Originally based on xt_quota.c: | ||
7 | * netfilter module to enforce network quotas | ||
8 | * Sam Johnston <samj@samj.net> | ||
9 | * | ||
10 | * This program is free software; you can redistribute it and/or modify | ||
11 | * it under the terms of the GNU General Public License; either | ||
12 | * version 2 of the License, as published by the Free Software Foundation. | ||
13 | */ | ||
14 | #include <linux/list.h> | ||
15 | #include <linux/proc_fs.h> | ||
16 | #include <linux/skbuff.h> | ||
17 | #include <linux/spinlock.h> | ||
18 | #include <asm/atomic.h> | ||
19 | |||
20 | #include <linux/netfilter/x_tables.h> | ||
21 | #include <linux/netfilter/xt_quota2.h> | ||
22 | #ifdef CONFIG_NETFILTER_XT_MATCH_QUOTA2_LOG | ||
23 | #include <linux/netfilter_ipv4/ipt_ULOG.h> | ||
24 | #endif | ||
25 | |||
26 | /** | ||
27 | * @lock: lock to protect quota writers from each other | ||
28 | */ | ||
29 | struct xt_quota_counter { | ||
30 | u_int64_t quota; | ||
31 | spinlock_t lock; | ||
32 | struct list_head list; | ||
33 | atomic_t ref; | ||
34 | char name[sizeof(((struct xt_quota_mtinfo2 *)NULL)->name)]; | ||
35 | struct proc_dir_entry *procfs_entry; | ||
36 | }; | ||
37 | |||
38 | #ifdef CONFIG_NETFILTER_XT_MATCH_QUOTA2_LOG | ||
39 | /* Harald's favorite number +1 :D From ipt_ULOG.C */ | ||
40 | static int qlog_nl_event = 112; | ||
41 | module_param_named(event_num, qlog_nl_event, uint, S_IRUGO | S_IWUSR); | ||
42 | MODULE_PARM_DESC(event_num, | ||
43 | "Event number for NETLINK_NFLOG message. 0 disables log." | ||
44 | "111 is what ipt_ULOG uses."); | ||
45 | static struct sock *nflognl; | ||
46 | #endif | ||
47 | |||
48 | static LIST_HEAD(counter_list); | ||
49 | static DEFINE_SPINLOCK(counter_list_lock); | ||
50 | |||
51 | static struct proc_dir_entry *proc_xt_quota; | ||
52 | static unsigned int quota_list_perms = S_IRUGO | S_IWUSR; | ||
53 | static unsigned int quota_list_uid = 0; | ||
54 | static unsigned int quota_list_gid = 0; | ||
55 | module_param_named(perms, quota_list_perms, uint, S_IRUGO | S_IWUSR); | ||
56 | module_param_named(uid, quota_list_uid, uint, S_IRUGO | S_IWUSR); | ||
57 | module_param_named(gid, quota_list_gid, uint, S_IRUGO | S_IWUSR); | ||
58 | |||
59 | |||
60 | #ifdef CONFIG_NETFILTER_XT_MATCH_QUOTA2_LOG | ||
61 | static void quota2_log(unsigned int hooknum, | ||
62 | const struct sk_buff *skb, | ||
63 | const struct net_device *in, | ||
64 | const struct net_device *out, | ||
65 | const char *prefix) | ||
66 | { | ||
67 | ulog_packet_msg_t *pm; | ||
68 | struct sk_buff *log_skb; | ||
69 | size_t size; | ||
70 | struct nlmsghdr *nlh; | ||
71 | |||
72 | if (!qlog_nl_event) | ||
73 | return; | ||
74 | |||
75 | size = NLMSG_SPACE(sizeof(*pm)); | ||
76 | size = max(size, (size_t)NLMSG_GOODSIZE); | ||
77 | log_skb = alloc_skb(size, GFP_ATOMIC); | ||
78 | if (!log_skb) { | ||
79 | pr_err("xt_quota2: cannot alloc skb for logging\n"); | ||
80 | return; | ||
81 | } | ||
82 | |||
83 | /* NLMSG_PUT() uses "goto nlmsg_failure" */ | ||
84 | nlh = NLMSG_PUT(log_skb, /*pid*/0, /*seq*/0, qlog_nl_event, | ||
85 | sizeof(*pm)); | ||
86 | pm = NLMSG_DATA(nlh); | ||
87 | if (skb->tstamp.tv64 == 0) | ||
88 | __net_timestamp((struct sk_buff *)skb); | ||
89 | pm->data_len = 0; | ||
90 | pm->hook = hooknum; | ||
91 | if (prefix != NULL) | ||
92 | strlcpy(pm->prefix, prefix, sizeof(pm->prefix)); | ||
93 | else | ||
94 | *(pm->prefix) = '\0'; | ||
95 | if (in) | ||
96 | strlcpy(pm->indev_name, in->name, sizeof(pm->indev_name)); | ||
97 | else | ||
98 | pm->indev_name[0] = '\0'; | ||
99 | |||
100 | if (out) | ||
101 | strlcpy(pm->outdev_name, out->name, sizeof(pm->outdev_name)); | ||
102 | else | ||
103 | pm->outdev_name[0] = '\0'; | ||
104 | |||
105 | NETLINK_CB(log_skb).dst_group = 1; | ||
106 | pr_debug("throwing 1 packets to netlink group 1\n"); | ||
107 | netlink_broadcast(nflognl, log_skb, 0, 1, GFP_ATOMIC); | ||
108 | |||
109 | nlmsg_failure: /* Used within NLMSG_PUT() */ | ||
110 | pr_debug("xt_quota2: error during NLMSG_PUT\n"); | ||
111 | } | ||
112 | #else | ||
113 | static void quota2_log(unsigned int hooknum, | ||
114 | const struct sk_buff *skb, | ||
115 | const struct net_device *in, | ||
116 | const struct net_device *out, | ||
117 | const char *prefix) | ||
118 | { | ||
119 | } | ||
120 | #endif /* if+else CONFIG_NETFILTER_XT_MATCH_QUOTA2_LOG */ | ||
121 | |||
122 | static int quota_proc_read(char *page, char **start, off_t offset, | ||
123 | int count, int *eof, void *data) | ||
124 | { | ||
125 | struct xt_quota_counter *e = data; | ||
126 | int ret; | ||
127 | |||
128 | spin_lock_bh(&e->lock); | ||
129 | ret = snprintf(page, PAGE_SIZE, "%llu\n", e->quota); | ||
130 | spin_unlock_bh(&e->lock); | ||
131 | return ret; | ||
132 | } | ||
133 | |||
134 | static int quota_proc_write(struct file *file, const char __user *input, | ||
135 | unsigned long size, void *data) | ||
136 | { | ||
137 | struct xt_quota_counter *e = data; | ||
138 | char buf[sizeof("18446744073709551616")]; | ||
139 | |||
140 | if (size > sizeof(buf)) | ||
141 | size = sizeof(buf); | ||
142 | if (copy_from_user(buf, input, size) != 0) | ||
143 | return -EFAULT; | ||
144 | buf[sizeof(buf)-1] = '\0'; | ||
145 | |||
146 | spin_lock_bh(&e->lock); | ||
147 | e->quota = simple_strtoull(buf, NULL, 0); | ||
148 | spin_unlock_bh(&e->lock); | ||
149 | return size; | ||
150 | } | ||
151 | |||
152 | static struct xt_quota_counter * | ||
153 | q2_new_counter(const struct xt_quota_mtinfo2 *q, bool anon) | ||
154 | { | ||
155 | struct xt_quota_counter *e; | ||
156 | unsigned int size; | ||
157 | |||
158 | /* Do not need all the procfs things for anonymous counters. */ | ||
159 | size = anon ? offsetof(typeof(*e), list) : sizeof(*e); | ||
160 | e = kmalloc(size, GFP_KERNEL); | ||
161 | if (e == NULL) | ||
162 | return NULL; | ||
163 | |||
164 | e->quota = q->quota; | ||
165 | spin_lock_init(&e->lock); | ||
166 | if (!anon) { | ||
167 | INIT_LIST_HEAD(&e->list); | ||
168 | atomic_set(&e->ref, 1); | ||
169 | strlcpy(e->name, q->name, sizeof(e->name)); | ||
170 | } | ||
171 | return e; | ||
172 | } | ||
173 | |||
174 | /** | ||
175 | * q2_get_counter - get ref to counter or create new | ||
176 | * @name: name of counter | ||
177 | */ | ||
178 | static struct xt_quota_counter * | ||
179 | q2_get_counter(const struct xt_quota_mtinfo2 *q) | ||
180 | { | ||
181 | struct proc_dir_entry *p; | ||
182 | struct xt_quota_counter *e = NULL; | ||
183 | struct xt_quota_counter *new_e; | ||
184 | |||
185 | if (*q->name == '\0') | ||
186 | return q2_new_counter(q, true); | ||
187 | |||
188 | /* No need to hold a lock while getting a new counter */ | ||
189 | new_e = q2_new_counter(q, false); | ||
190 | if (new_e == NULL) | ||
191 | goto out; | ||
192 | |||
193 | spin_lock_bh(&counter_list_lock); | ||
194 | list_for_each_entry(e, &counter_list, list) | ||
195 | if (strcmp(e->name, q->name) == 0) { | ||
196 | atomic_inc(&e->ref); | ||
197 | spin_unlock_bh(&counter_list_lock); | ||
198 | kfree(new_e); | ||
199 | pr_debug("xt_quota2: old counter name=%s", e->name); | ||
200 | return e; | ||
201 | } | ||
202 | e = new_e; | ||
203 | pr_debug("xt_quota2: new_counter name=%s", e->name); | ||
204 | list_add_tail(&e->list, &counter_list); | ||
205 | /* The entry having a refcount of 1 is not directly destructible. | ||
206 | * This func has not yet returned the new entry, thus iptables | ||
207 | * has not references for destroying this entry. | ||
208 | * For another rule to try to destroy it, it would 1st need for this | ||
209 | * func* to be re-invoked, acquire a new ref for the same named quota. | ||
210 | * Nobody will access the e->procfs_entry either. | ||
211 | * So release the lock. */ | ||
212 | spin_unlock_bh(&counter_list_lock); | ||
213 | |||
214 | /* create_proc_entry() is not spin_lock happy */ | ||
215 | p = e->procfs_entry = create_proc_entry(e->name, quota_list_perms, | ||
216 | proc_xt_quota); | ||
217 | |||
218 | if (IS_ERR_OR_NULL(p)) { | ||
219 | spin_lock_bh(&counter_list_lock); | ||
220 | list_del(&e->list); | ||
221 | spin_unlock_bh(&counter_list_lock); | ||
222 | goto out; | ||
223 | } | ||
224 | p->data = e; | ||
225 | p->read_proc = quota_proc_read; | ||
226 | p->write_proc = quota_proc_write; | ||
227 | p->uid = quota_list_uid; | ||
228 | p->gid = quota_list_gid; | ||
229 | return e; | ||
230 | |||
231 | out: | ||
232 | kfree(e); | ||
233 | return NULL; | ||
234 | } | ||
235 | |||
236 | static int quota_mt2_check(const struct xt_mtchk_param *par) | ||
237 | { | ||
238 | struct xt_quota_mtinfo2 *q = par->matchinfo; | ||
239 | |||
240 | pr_debug("xt_quota2: check() flags=0x%04x", q->flags); | ||
241 | |||
242 | if (q->flags & ~XT_QUOTA_MASK) | ||
243 | return -EINVAL; | ||
244 | |||
245 | q->name[sizeof(q->name)-1] = '\0'; | ||
246 | if (*q->name == '.' || strchr(q->name, '/') != NULL) { | ||
247 | printk(KERN_ERR "xt_quota.3: illegal name\n"); | ||
248 | return -EINVAL; | ||
249 | } | ||
250 | |||
251 | q->master = q2_get_counter(q); | ||
252 | if (q->master == NULL) { | ||
253 | printk(KERN_ERR "xt_quota.3: memory alloc failure\n"); | ||
254 | return -ENOMEM; | ||
255 | } | ||
256 | |||
257 | return 0; | ||
258 | } | ||
259 | |||
260 | static void quota_mt2_destroy(const struct xt_mtdtor_param *par) | ||
261 | { | ||
262 | struct xt_quota_mtinfo2 *q = par->matchinfo; | ||
263 | struct xt_quota_counter *e = q->master; | ||
264 | |||
265 | if (*q->name == '\0') { | ||
266 | kfree(e); | ||
267 | return; | ||
268 | } | ||
269 | |||
270 | spin_lock_bh(&counter_list_lock); | ||
271 | if (!atomic_dec_and_test(&e->ref)) { | ||
272 | spin_unlock_bh(&counter_list_lock); | ||
273 | return; | ||
274 | } | ||
275 | |||
276 | list_del(&e->list); | ||
277 | remove_proc_entry(e->name, proc_xt_quota); | ||
278 | spin_unlock_bh(&counter_list_lock); | ||
279 | kfree(e); | ||
280 | } | ||
281 | |||
282 | static bool | ||
283 | quota_mt2(const struct sk_buff *skb, struct xt_action_param *par) | ||
284 | { | ||
285 | struct xt_quota_mtinfo2 *q = (void *)par->matchinfo; | ||
286 | struct xt_quota_counter *e = q->master; | ||
287 | bool ret = q->flags & XT_QUOTA_INVERT; | ||
288 | |||
289 | spin_lock_bh(&e->lock); | ||
290 | if (q->flags & XT_QUOTA_GROW) { | ||
291 | /* | ||
292 | * While no_change is pointless in "grow" mode, we will | ||
293 | * implement it here simply to have a consistent behavior. | ||
294 | */ | ||
295 | if (!(q->flags & XT_QUOTA_NO_CHANGE)) { | ||
296 | e->quota += (q->flags & XT_QUOTA_PACKET) ? 1 : skb->len; | ||
297 | } | ||
298 | ret = true; | ||
299 | } else { | ||
300 | if (e->quota >= skb->len) { | ||
301 | if (!(q->flags & XT_QUOTA_NO_CHANGE)) | ||
302 | e->quota -= (q->flags & XT_QUOTA_PACKET) ? 1 : skb->len; | ||
303 | ret = !ret; | ||
304 | } else { | ||
305 | /* We are transitioning, log that fact. */ | ||
306 | if (e->quota) { | ||
307 | quota2_log(par->hooknum, | ||
308 | skb, | ||
309 | par->in, | ||
310 | par->out, | ||
311 | q->name); | ||
312 | } | ||
313 | /* we do not allow even small packets from now on */ | ||
314 | e->quota = 0; | ||
315 | } | ||
316 | } | ||
317 | spin_unlock_bh(&e->lock); | ||
318 | return ret; | ||
319 | } | ||
320 | |||
321 | static struct xt_match quota_mt2_reg[] __read_mostly = { | ||
322 | { | ||
323 | .name = "quota2", | ||
324 | .revision = 3, | ||
325 | .family = NFPROTO_IPV4, | ||
326 | .checkentry = quota_mt2_check, | ||
327 | .match = quota_mt2, | ||
328 | .destroy = quota_mt2_destroy, | ||
329 | .matchsize = sizeof(struct xt_quota_mtinfo2), | ||
330 | .me = THIS_MODULE, | ||
331 | }, | ||
332 | { | ||
333 | .name = "quota2", | ||
334 | .revision = 3, | ||
335 | .family = NFPROTO_IPV6, | ||
336 | .checkentry = quota_mt2_check, | ||
337 | .match = quota_mt2, | ||
338 | .destroy = quota_mt2_destroy, | ||
339 | .matchsize = sizeof(struct xt_quota_mtinfo2), | ||
340 | .me = THIS_MODULE, | ||
341 | }, | ||
342 | }; | ||
343 | |||
344 | static int __init quota_mt2_init(void) | ||
345 | { | ||
346 | int ret; | ||
347 | pr_debug("xt_quota2: init()"); | ||
348 | |||
349 | #ifdef CONFIG_NETFILTER_XT_MATCH_QUOTA2_LOG | ||
350 | nflognl = netlink_kernel_create(&init_net, | ||
351 | NETLINK_NFLOG, 1, NULL, | ||
352 | NULL, THIS_MODULE); | ||
353 | if (!nflognl) | ||
354 | return -ENOMEM; | ||
355 | #endif | ||
356 | |||
357 | proc_xt_quota = proc_mkdir("xt_quota", init_net.proc_net); | ||
358 | if (proc_xt_quota == NULL) | ||
359 | return -EACCES; | ||
360 | |||
361 | ret = xt_register_matches(quota_mt2_reg, ARRAY_SIZE(quota_mt2_reg)); | ||
362 | if (ret < 0) | ||
363 | remove_proc_entry("xt_quota", init_net.proc_net); | ||
364 | pr_debug("xt_quota2: init() %d", ret); | ||
365 | return ret; | ||
366 | } | ||
367 | |||
368 | static void __exit quota_mt2_exit(void) | ||
369 | { | ||
370 | xt_unregister_matches(quota_mt2_reg, ARRAY_SIZE(quota_mt2_reg)); | ||
371 | remove_proc_entry("xt_quota", init_net.proc_net); | ||
372 | } | ||
373 | |||
374 | module_init(quota_mt2_init); | ||
375 | module_exit(quota_mt2_exit); | ||
376 | MODULE_DESCRIPTION("Xtables: countdown quota match; up counter"); | ||
377 | MODULE_AUTHOR("Sam Johnston <samj@samj.net>"); | ||
378 | MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>"); | ||
379 | MODULE_LICENSE("GPL"); | ||
380 | MODULE_ALIAS("ipt_quota2"); | ||
381 | MODULE_ALIAS("ip6t_quota2"); | ||