]>
Commit | Line | Data |
---|---|---|
09e410de JE |
1 | /* |
2 | * xt_hashlimit - Netfilter module to limit the number of packets per time | |
3ad2f3fb | 3 | * separately for each hashbucket (sourceip/sourceport/dstip/dstport) |
1da177e4 | 4 | * |
09e410de | 5 | * (C) 2003-2004 by Harald Welte <laforge@netfilter.org> |
f229f6ce | 6 | * (C) 2006-2012 Patrick McHardy <kaber@trash.net> |
09e410de | 7 | * Copyright © CC Computer Consultants GmbH, 2007 - 2008 |
1da177e4 LT |
8 | * |
9 | * Development of this code was funded by Astaro AG, http://www.astaro.com/ | |
1da177e4 | 10 | */ |
8bee4bad | 11 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
1da177e4 | 12 | #include <linux/module.h> |
1da177e4 LT |
13 | #include <linux/spinlock.h> |
14 | #include <linux/random.h> | |
15 | #include <linux/jhash.h> | |
16 | #include <linux/slab.h> | |
17 | #include <linux/vmalloc.h> | |
1da177e4 LT |
18 | #include <linux/proc_fs.h> |
19 | #include <linux/seq_file.h> | |
20 | #include <linux/list.h> | |
39b46fc6 | 21 | #include <linux/skbuff.h> |
d7fe0f24 | 22 | #include <linux/mm.h> |
39b46fc6 PM |
23 | #include <linux/in.h> |
24 | #include <linux/ip.h> | |
c0cd1156 | 25 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
39b46fc6 | 26 | #include <linux/ipv6.h> |
193b23c5 | 27 | #include <net/ipv6.h> |
7b21e09d ED |
28 | #endif |
29 | ||
457c4cbc | 30 | #include <net/net_namespace.h> |
e89fc3f1 | 31 | #include <net/netns/generic.h> |
1da177e4 | 32 | |
39b46fc6 | 33 | #include <linux/netfilter/x_tables.h> |
1da177e4 | 34 | #include <linux/netfilter_ipv4/ip_tables.h> |
39b46fc6 PM |
35 | #include <linux/netfilter_ipv6/ip6_tables.h> |
36 | #include <linux/netfilter/xt_hashlimit.h> | |
14cc3e2b | 37 | #include <linux/mutex.h> |
1da177e4 LT |
38 | |
39 | MODULE_LICENSE("GPL"); | |
40 | MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>"); | |
408ffaa4 | 41 | MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>"); |
2ae15b64 | 42 | MODULE_DESCRIPTION("Xtables: per hash-bucket rate-limit match"); |
39b46fc6 PM |
43 | MODULE_ALIAS("ipt_hashlimit"); |
44 | MODULE_ALIAS("ip6t_hashlimit"); | |
1da177e4 | 45 | |
e89fc3f1 AD |
46 | struct hashlimit_net { |
47 | struct hlist_head htables; | |
48 | struct proc_dir_entry *ipt_hashlimit; | |
49 | struct proc_dir_entry *ip6t_hashlimit; | |
50 | }; | |
51 | ||
c7d03a00 | 52 | static unsigned int hashlimit_net_id; |
e89fc3f1 AD |
53 | static inline struct hashlimit_net *hashlimit_pernet(struct net *net) |
54 | { | |
55 | return net_generic(net, hashlimit_net_id); | |
56 | } | |
57 | ||
1da177e4 | 58 | /* need to declare this at the top */ |
0dc60a45 | 59 | static const struct file_operations dl_file_ops_v1; |
11d5f157 | 60 | static const struct file_operations dl_file_ops; |
1da177e4 LT |
61 | |
62 | /* hash table crap */ | |
1da177e4 | 63 | struct dsthash_dst { |
39b46fc6 PM |
64 | union { |
65 | struct { | |
66 | __be32 src; | |
67 | __be32 dst; | |
68 | } ip; | |
c0cd1156 | 69 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
39b46fc6 PM |
70 | struct { |
71 | __be32 src[4]; | |
72 | __be32 dst[4]; | |
73 | } ip6; | |
7b21e09d | 74 | #endif |
09e410de | 75 | }; |
6a19d614 AV |
76 | __be16 src_port; |
77 | __be16 dst_port; | |
1da177e4 LT |
78 | }; |
79 | ||
80 | struct dsthash_ent { | |
81 | /* static / read-only parts in the beginning */ | |
82 | struct hlist_node node; | |
83 | struct dsthash_dst dst; | |
84 | ||
85 | /* modified structure members in the end */ | |
02e4eb75 | 86 | spinlock_t lock; |
1da177e4 LT |
87 | unsigned long expires; /* precalculated expiry time */ |
88 | struct { | |
89 | unsigned long prev; /* last modification */ | |
11d5f157 VP |
90 | u_int64_t credit; |
91 | u_int64_t credit_cap, cost; | |
1da177e4 | 92 | } rateinfo; |
02e4eb75 | 93 | struct rcu_head rcu; |
1da177e4 LT |
94 | }; |
95 | ||
39b46fc6 | 96 | struct xt_hashlimit_htable { |
1da177e4 | 97 | struct hlist_node node; /* global list of all htables */ |
2eff25c1 | 98 | int use; |
76108cea | 99 | u_int8_t family; |
89bc7a0f | 100 | bool rnd_initialized; |
1da177e4 | 101 | |
11d5f157 | 102 | struct hashlimit_cfg2 cfg; /* config */ |
1da177e4 LT |
103 | |
104 | /* used internally */ | |
105 | spinlock_t lock; /* lock for list_head */ | |
106 | u_int32_t rnd; /* random seed for hash */ | |
39b46fc6 | 107 | unsigned int count; /* number entries in table */ |
7bd8490e | 108 | struct delayed_work gc_work; |
1da177e4 LT |
109 | |
110 | /* seq_file stuff */ | |
111 | struct proc_dir_entry *pde; | |
14b872f0 | 112 | const char *name; |
e89fc3f1 | 113 | struct net *net; |
1da177e4 LT |
114 | |
115 | struct hlist_head hash[0]; /* hashtable itself */ | |
116 | }; | |
117 | ||
11d5f157 VP |
118 | static int |
119 | cfg_copy(struct hashlimit_cfg2 *to, void *from, int revision) | |
120 | { | |
121 | if (revision == 1) { | |
122 | struct hashlimit_cfg1 *cfg = (struct hashlimit_cfg1 *)from; | |
123 | ||
124 | to->mode = cfg->mode; | |
125 | to->avg = cfg->avg; | |
126 | to->burst = cfg->burst; | |
127 | to->size = cfg->size; | |
128 | to->max = cfg->max; | |
129 | to->gc_interval = cfg->gc_interval; | |
130 | to->expire = cfg->expire; | |
131 | to->srcmask = cfg->srcmask; | |
132 | to->dstmask = cfg->dstmask; | |
133 | } else if (revision == 2) { | |
134 | memcpy(to, from, sizeof(struct hashlimit_cfg2)); | |
135 | } else { | |
136 | return -EINVAL; | |
137 | } | |
138 | ||
139 | return 0; | |
140 | } | |
141 | ||
2eff25c1 | 142 | static DEFINE_MUTEX(hashlimit_mutex); /* protects htables list */ |
e18b890b | 143 | static struct kmem_cache *hashlimit_cachep __read_mostly; |
1da177e4 | 144 | |
1d93a9cb | 145 | static inline bool dst_cmp(const struct dsthash_ent *ent, |
a47362a2 | 146 | const struct dsthash_dst *b) |
1da177e4 | 147 | { |
39b46fc6 | 148 | return !memcmp(&ent->dst, b, sizeof(ent->dst)); |
1da177e4 LT |
149 | } |
150 | ||
39b46fc6 PM |
151 | static u_int32_t |
152 | hash_dst(const struct xt_hashlimit_htable *ht, const struct dsthash_dst *dst) | |
1da177e4 | 153 | { |
e2f82ac3 ED |
154 | u_int32_t hash = jhash2((const u32 *)dst, |
155 | sizeof(*dst)/sizeof(u32), | |
156 | ht->rnd); | |
157 | /* | |
158 | * Instead of returning hash % ht->cfg.size (implying a divide) | |
159 | * we return the high 32 bits of the (hash * ht->cfg.size) that will | |
160 | * give results between [0 and cfg.size-1] and same hash distribution, | |
161 | * but using a multiply, less expensive than a divide | |
162 | */ | |
8fc54f68 | 163 | return reciprocal_scale(hash, ht->cfg.size); |
1da177e4 LT |
164 | } |
165 | ||
39b46fc6 | 166 | static struct dsthash_ent * |
a47362a2 JE |
167 | dsthash_find(const struct xt_hashlimit_htable *ht, |
168 | const struct dsthash_dst *dst) | |
1da177e4 LT |
169 | { |
170 | struct dsthash_ent *ent; | |
1da177e4 LT |
171 | u_int32_t hash = hash_dst(ht, dst); |
172 | ||
39b46fc6 | 173 | if (!hlist_empty(&ht->hash[hash])) { |
b67bfe0d | 174 | hlist_for_each_entry_rcu(ent, &ht->hash[hash], node) |
02e4eb75 ED |
175 | if (dst_cmp(ent, dst)) { |
176 | spin_lock(&ent->lock); | |
1da177e4 | 177 | return ent; |
02e4eb75 | 178 | } |
39b46fc6 | 179 | } |
1da177e4 LT |
180 | return NULL; |
181 | } | |
182 | ||
183 | /* allocate dsthash_ent, initialize dst, put in htable and lock it */ | |
184 | static struct dsthash_ent * | |
a47362a2 | 185 | dsthash_alloc_init(struct xt_hashlimit_htable *ht, |
09181842 | 186 | const struct dsthash_dst *dst, bool *race) |
1da177e4 LT |
187 | { |
188 | struct dsthash_ent *ent; | |
189 | ||
02e4eb75 | 190 | spin_lock(&ht->lock); |
09181842 PNA |
191 | |
192 | /* Two or more packets may race to create the same entry in the | |
193 | * hashtable, double check if this packet lost race. | |
194 | */ | |
195 | ent = dsthash_find(ht, dst); | |
196 | if (ent != NULL) { | |
197 | spin_unlock(&ht->lock); | |
198 | *race = true; | |
199 | return ent; | |
200 | } | |
201 | ||
1da177e4 LT |
202 | /* initialize hash with random val at the time we allocate |
203 | * the first hashtable entry */ | |
02e4eb75 | 204 | if (unlikely(!ht->rnd_initialized)) { |
af07d241 | 205 | get_random_bytes(&ht->rnd, sizeof(ht->rnd)); |
89bc7a0f | 206 | ht->rnd_initialized = true; |
bf0857ea | 207 | } |
1da177e4 | 208 | |
39b46fc6 | 209 | if (ht->cfg.max && ht->count >= ht->cfg.max) { |
1da177e4 | 210 | /* FIXME: do something. question is what.. */ |
e87cc472 | 211 | net_err_ratelimited("max count of %u reached\n", ht->cfg.max); |
02e4eb75 ED |
212 | ent = NULL; |
213 | } else | |
214 | ent = kmem_cache_alloc(hashlimit_cachep, GFP_ATOMIC); | |
0a9ee813 | 215 | if (ent) { |
02e4eb75 ED |
216 | memcpy(&ent->dst, dst, sizeof(ent->dst)); |
217 | spin_lock_init(&ent->lock); | |
1da177e4 | 218 | |
02e4eb75 ED |
219 | spin_lock(&ent->lock); |
220 | hlist_add_head_rcu(&ent->node, &ht->hash[hash_dst(ht, dst)]); | |
221 | ht->count++; | |
222 | } | |
223 | spin_unlock(&ht->lock); | |
1da177e4 LT |
224 | return ent; |
225 | } | |
226 | ||
02e4eb75 ED |
227 | static void dsthash_free_rcu(struct rcu_head *head) |
228 | { | |
229 | struct dsthash_ent *ent = container_of(head, struct dsthash_ent, rcu); | |
230 | ||
231 | kmem_cache_free(hashlimit_cachep, ent); | |
232 | } | |
233 | ||
39b46fc6 PM |
234 | static inline void |
235 | dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent) | |
1da177e4 | 236 | { |
02e4eb75 ED |
237 | hlist_del_rcu(&ent->node); |
238 | call_rcu_bh(&ent->rcu, dsthash_free_rcu); | |
39b46fc6 | 239 | ht->count--; |
1da177e4 | 240 | } |
7bd8490e | 241 | static void htable_gc(struct work_struct *work); |
1da177e4 | 242 | |
11d5f157 VP |
243 | static int htable_create(struct net *net, struct hashlimit_cfg2 *cfg, |
244 | const char *name, u_int8_t family, | |
245 | struct xt_hashlimit_htable **out_hinfo, | |
246 | int revision) | |
09e410de | 247 | { |
e89fc3f1 | 248 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(net); |
09e410de | 249 | struct xt_hashlimit_htable *hinfo; |
11d5f157 VP |
250 | unsigned int size, i; |
251 | int ret; | |
09e410de | 252 | |
11d5f157 VP |
253 | if (cfg->size) { |
254 | size = cfg->size; | |
09e410de | 255 | } else { |
4481374c | 256 | size = (totalram_pages << PAGE_SHIFT) / 16384 / |
09e410de | 257 | sizeof(struct list_head); |
4481374c | 258 | if (totalram_pages > 1024 * 1024 * 1024 / PAGE_SIZE) |
09e410de JE |
259 | size = 8192; |
260 | if (size < 16) | |
261 | size = 16; | |
262 | } | |
263 | /* FIXME: don't use vmalloc() here or anywhere else -HW */ | |
264 | hinfo = vmalloc(sizeof(struct xt_hashlimit_htable) + | |
265 | sizeof(struct list_head) * size); | |
85bc3f38 | 266 | if (hinfo == NULL) |
4a5a5c73 | 267 | return -ENOMEM; |
11d5f157 | 268 | *out_hinfo = hinfo; |
09e410de JE |
269 | |
270 | /* copy match config into hashtable config */ | |
11d5f157 VP |
271 | ret = cfg_copy(&hinfo->cfg, (void *)cfg, 2); |
272 | ||
273 | if (ret) | |
274 | return ret; | |
275 | ||
09e410de JE |
276 | hinfo->cfg.size = size; |
277 | if (hinfo->cfg.max == 0) | |
278 | hinfo->cfg.max = 8 * hinfo->cfg.size; | |
279 | else if (hinfo->cfg.max < hinfo->cfg.size) | |
280 | hinfo->cfg.max = hinfo->cfg.size; | |
281 | ||
282 | for (i = 0; i < hinfo->cfg.size; i++) | |
283 | INIT_HLIST_HEAD(&hinfo->hash[i]); | |
284 | ||
2eff25c1 | 285 | hinfo->use = 1; |
09e410de JE |
286 | hinfo->count = 0; |
287 | hinfo->family = family; | |
89bc7a0f | 288 | hinfo->rnd_initialized = false; |
11d5f157 | 289 | hinfo->name = kstrdup(name, GFP_KERNEL); |
14b872f0 AV |
290 | if (!hinfo->name) { |
291 | vfree(hinfo); | |
292 | return -ENOMEM; | |
293 | } | |
09e410de JE |
294 | spin_lock_init(&hinfo->lock); |
295 | ||
11d5f157 | 296 | hinfo->pde = proc_create_data(name, 0, |
ee999d8b | 297 | (family == NFPROTO_IPV4) ? |
e89fc3f1 | 298 | hashlimit_net->ipt_hashlimit : hashlimit_net->ip6t_hashlimit, |
11d5f157 VP |
299 | (revision == 1) ? &dl_file_ops_v1 : &dl_file_ops, |
300 | hinfo); | |
09e410de | 301 | if (hinfo->pde == NULL) { |
14b872f0 | 302 | kfree(hinfo->name); |
09e410de | 303 | vfree(hinfo); |
4a5a5c73 | 304 | return -ENOMEM; |
09e410de | 305 | } |
e89fc3f1 | 306 | hinfo->net = net; |
09e410de | 307 | |
7bd8490e ED |
308 | INIT_DEFERRABLE_WORK(&hinfo->gc_work, htable_gc); |
309 | queue_delayed_work(system_power_efficient_wq, &hinfo->gc_work, | |
310 | msecs_to_jiffies(hinfo->cfg.gc_interval)); | |
09e410de | 311 | |
e89fc3f1 | 312 | hlist_add_head(&hinfo->node, &hashlimit_net->htables); |
09e410de JE |
313 | |
314 | return 0; | |
315 | } | |
316 | ||
a47362a2 JE |
317 | static bool select_all(const struct xt_hashlimit_htable *ht, |
318 | const struct dsthash_ent *he) | |
1da177e4 LT |
319 | { |
320 | return 1; | |
321 | } | |
322 | ||
a47362a2 JE |
323 | static bool select_gc(const struct xt_hashlimit_htable *ht, |
324 | const struct dsthash_ent *he) | |
1da177e4 | 325 | { |
cbebc51f | 326 | return time_after_eq(jiffies, he->expires); |
1da177e4 LT |
327 | } |
328 | ||
39b46fc6 | 329 | static void htable_selective_cleanup(struct xt_hashlimit_htable *ht, |
a47362a2 JE |
330 | bool (*select)(const struct xt_hashlimit_htable *ht, |
331 | const struct dsthash_ent *he)) | |
1da177e4 | 332 | { |
39b46fc6 | 333 | unsigned int i; |
1da177e4 | 334 | |
1da177e4 LT |
335 | for (i = 0; i < ht->cfg.size; i++) { |
336 | struct dsthash_ent *dh; | |
b67bfe0d | 337 | struct hlist_node *n; |
7bd8490e ED |
338 | |
339 | spin_lock_bh(&ht->lock); | |
b67bfe0d | 340 | hlist_for_each_entry_safe(dh, n, &ht->hash[i], node) { |
1da177e4 | 341 | if ((*select)(ht, dh)) |
39b46fc6 | 342 | dsthash_free(ht, dh); |
1da177e4 | 343 | } |
7bd8490e ED |
344 | spin_unlock_bh(&ht->lock); |
345 | cond_resched(); | |
1da177e4 | 346 | } |
1da177e4 LT |
347 | } |
348 | ||
7bd8490e | 349 | static void htable_gc(struct work_struct *work) |
1da177e4 | 350 | { |
7bd8490e ED |
351 | struct xt_hashlimit_htable *ht; |
352 | ||
353 | ht = container_of(work, struct xt_hashlimit_htable, gc_work.work); | |
1da177e4 LT |
354 | |
355 | htable_selective_cleanup(ht, select_gc); | |
356 | ||
7bd8490e ED |
357 | queue_delayed_work(system_power_efficient_wq, |
358 | &ht->gc_work, msecs_to_jiffies(ht->cfg.gc_interval)); | |
1da177e4 LT |
359 | } |
360 | ||
b4ef4ce0 | 361 | static void htable_remove_proc_entry(struct xt_hashlimit_htable *hinfo) |
1da177e4 | 362 | { |
e89fc3f1 AD |
363 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(hinfo->net); |
364 | struct proc_dir_entry *parent; | |
365 | ||
e89fc3f1 AD |
366 | if (hinfo->family == NFPROTO_IPV4) |
367 | parent = hashlimit_net->ipt_hashlimit; | |
368 | else | |
369 | parent = hashlimit_net->ip6t_hashlimit; | |
32263dd1 | 370 | |
b4ef4ce0 | 371 | if (parent != NULL) |
14b872f0 | 372 | remove_proc_entry(hinfo->name, parent); |
b4ef4ce0 | 373 | } |
32263dd1 | 374 | |
b4ef4ce0 SP |
375 | static void htable_destroy(struct xt_hashlimit_htable *hinfo) |
376 | { | |
7bd8490e | 377 | cancel_delayed_work_sync(&hinfo->gc_work); |
b4ef4ce0 | 378 | htable_remove_proc_entry(hinfo); |
1da177e4 | 379 | htable_selective_cleanup(hinfo, select_all); |
14b872f0 | 380 | kfree(hinfo->name); |
1da177e4 LT |
381 | vfree(hinfo); |
382 | } | |
383 | ||
e89fc3f1 AD |
384 | static struct xt_hashlimit_htable *htable_find_get(struct net *net, |
385 | const char *name, | |
76108cea | 386 | u_int8_t family) |
1da177e4 | 387 | { |
e89fc3f1 | 388 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(net); |
39b46fc6 | 389 | struct xt_hashlimit_htable *hinfo; |
1da177e4 | 390 | |
b67bfe0d | 391 | hlist_for_each_entry(hinfo, &hashlimit_net->htables, node) { |
14b872f0 | 392 | if (!strcmp(name, hinfo->name) && |
39b46fc6 | 393 | hinfo->family == family) { |
2eff25c1 | 394 | hinfo->use++; |
1da177e4 LT |
395 | return hinfo; |
396 | } | |
397 | } | |
1da177e4 LT |
398 | return NULL; |
399 | } | |
400 | ||
39b46fc6 | 401 | static void htable_put(struct xt_hashlimit_htable *hinfo) |
1da177e4 | 402 | { |
2eff25c1 PM |
403 | mutex_lock(&hashlimit_mutex); |
404 | if (--hinfo->use == 0) { | |
1da177e4 | 405 | hlist_del(&hinfo->node); |
1da177e4 LT |
406 | htable_destroy(hinfo); |
407 | } | |
2eff25c1 | 408 | mutex_unlock(&hashlimit_mutex); |
1da177e4 LT |
409 | } |
410 | ||
1da177e4 LT |
411 | /* The algorithm used is the Simple Token Bucket Filter (TBF) |
412 | * see net/sched/sch_tbf.c in the linux source tree | |
413 | */ | |
414 | ||
415 | /* Rusty: This is my (non-mathematically-inclined) understanding of | |
416 | this algorithm. The `average rate' in jiffies becomes your initial | |
417 | amount of credit `credit' and the most credit you can ever have | |
418 | `credit_cap'. The `peak rate' becomes the cost of passing the | |
419 | test, `cost'. | |
420 | ||
421 | `prev' tracks the last packet hit: you gain one credit per jiffy. | |
422 | If you get credit balance more than this, the extra credit is | |
423 | discarded. Every time the match passes, you lose `cost' credits; | |
424 | if you don't have that many, the test fails. | |
425 | ||
426 | See Alexey's formal explanation in net/sched/sch_tbf.c. | |
427 | ||
428 | To get the maximum range, we multiply by this factor (ie. you get N | |
429 | credits per jiffy). We want to allow a rate as low as 1 per day | |
430 | (slowest userspace tool allows), which means | |
431 | CREDITS_PER_JIFFY*HZ*60*60*24 < 2^32 ie. | |
432 | */ | |
0dc60a45 | 433 | #define MAX_CPJ_v1 (0xFFFFFFFF / (HZ*60*60*24)) |
1b203c13 | 434 | #define MAX_CPJ (0xFFFFFFFFFFFFFFFFULL / (HZ*60*60*24)) |
1da177e4 LT |
435 | |
436 | /* Repeated shift and or gives us all 1s, final shift and add 1 gives | |
437 | * us the power of 2 below the theoretical max, so GCC simply does a | |
438 | * shift. */ | |
439 | #define _POW2_BELOW2(x) ((x)|((x)>>1)) | |
440 | #define _POW2_BELOW4(x) (_POW2_BELOW2(x)|_POW2_BELOW2((x)>>2)) | |
441 | #define _POW2_BELOW8(x) (_POW2_BELOW4(x)|_POW2_BELOW4((x)>>4)) | |
442 | #define _POW2_BELOW16(x) (_POW2_BELOW8(x)|_POW2_BELOW8((x)>>8)) | |
443 | #define _POW2_BELOW32(x) (_POW2_BELOW16(x)|_POW2_BELOW16((x)>>16)) | |
11d5f157 | 444 | #define _POW2_BELOW64(x) (_POW2_BELOW32(x)|_POW2_BELOW32((x)>>32)) |
1da177e4 | 445 | #define POW2_BELOW32(x) ((_POW2_BELOW32(x)>>1) + 1) |
11d5f157 | 446 | #define POW2_BELOW64(x) ((_POW2_BELOW64(x)>>1) + 1) |
1da177e4 | 447 | |
11d5f157 | 448 | #define CREDITS_PER_JIFFY POW2_BELOW64(MAX_CPJ) |
0dc60a45 | 449 | #define CREDITS_PER_JIFFY_v1 POW2_BELOW32(MAX_CPJ_v1) |
1da177e4 | 450 | |
0197dee7 FW |
451 | /* in byte mode, the lowest possible rate is one packet/second. |
452 | * credit_cap is used as a counter that tells us how many times we can | |
453 | * refill the "credits available" counter when it becomes empty. | |
454 | */ | |
455 | #define MAX_CPJ_BYTES (0xFFFFFFFF / HZ) | |
456 | #define CREDITS_PER_JIFFY_BYTES POW2_BELOW32(MAX_CPJ_BYTES) | |
457 | ||
458 | static u32 xt_hashlimit_len_to_chunks(u32 len) | |
459 | { | |
460 | return (len >> XT_HASHLIMIT_BYTE_SHIFT) + 1; | |
461 | } | |
462 | ||
1da177e4 | 463 | /* Precision saver. */ |
11d5f157 | 464 | static u64 user2credits(u64 user, int revision) |
1da177e4 | 465 | { |
11d5f157 VP |
466 | if (revision == 1) { |
467 | /* If multiplying would overflow... */ | |
468 | if (user > 0xFFFFFFFF / (HZ*CREDITS_PER_JIFFY_v1)) | |
469 | /* Divide first. */ | |
1f827f51 VP |
470 | return div64_u64(user, XT_HASHLIMIT_SCALE) |
471 | * HZ * CREDITS_PER_JIFFY_v1; | |
11d5f157 | 472 | |
1f827f51 VP |
473 | return div64_u64(user * HZ * CREDITS_PER_JIFFY_v1, |
474 | XT_HASHLIMIT_SCALE); | |
11d5f157 | 475 | } else { |
1b203c13 | 476 | if (user > 0xFFFFFFFFFFFFFFFFULL / (HZ*CREDITS_PER_JIFFY)) |
1f827f51 VP |
477 | return div64_u64(user, XT_HASHLIMIT_SCALE_v2) |
478 | * HZ * CREDITS_PER_JIFFY; | |
1da177e4 | 479 | |
1f827f51 VP |
480 | return div64_u64(user * HZ * CREDITS_PER_JIFFY, |
481 | XT_HASHLIMIT_SCALE_v2); | |
11d5f157 | 482 | } |
1da177e4 LT |
483 | } |
484 | ||
0197dee7 | 485 | static u32 user2credits_byte(u32 user) |
1da177e4 | 486 | { |
0197dee7 FW |
487 | u64 us = user; |
488 | us *= HZ * CREDITS_PER_JIFFY_BYTES; | |
489 | return (u32) (us >> 32); | |
490 | } | |
491 | ||
11d5f157 VP |
492 | static void rateinfo_recalc(struct dsthash_ent *dh, unsigned long now, |
493 | u32 mode, int revision) | |
0197dee7 FW |
494 | { |
495 | unsigned long delta = now - dh->rateinfo.prev; | |
11d5f157 | 496 | u64 cap, cpj; |
0197dee7 FW |
497 | |
498 | if (delta == 0) | |
499 | return; | |
500 | ||
39b46fc6 | 501 | dh->rateinfo.prev = now; |
0197dee7 FW |
502 | |
503 | if (mode & XT_HASHLIMIT_BYTES) { | |
11d5f157 | 504 | u64 tmp = dh->rateinfo.credit; |
0197dee7 FW |
505 | dh->rateinfo.credit += CREDITS_PER_JIFFY_BYTES * delta; |
506 | cap = CREDITS_PER_JIFFY_BYTES * HZ; | |
507 | if (tmp >= dh->rateinfo.credit) {/* overflow */ | |
508 | dh->rateinfo.credit = cap; | |
509 | return; | |
510 | } | |
511 | } else { | |
11d5f157 VP |
512 | cpj = (revision == 1) ? |
513 | CREDITS_PER_JIFFY_v1 : CREDITS_PER_JIFFY; | |
514 | dh->rateinfo.credit += delta * cpj; | |
0197dee7 FW |
515 | cap = dh->rateinfo.credit_cap; |
516 | } | |
517 | if (dh->rateinfo.credit > cap) | |
518 | dh->rateinfo.credit = cap; | |
39b46fc6 PM |
519 | } |
520 | ||
817e076f | 521 | static void rateinfo_init(struct dsthash_ent *dh, |
11d5f157 | 522 | struct xt_hashlimit_htable *hinfo, int revision) |
817e076f FW |
523 | { |
524 | dh->rateinfo.prev = jiffies; | |
0197dee7 FW |
525 | if (hinfo->cfg.mode & XT_HASHLIMIT_BYTES) { |
526 | dh->rateinfo.credit = CREDITS_PER_JIFFY_BYTES * HZ; | |
527 | dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg); | |
528 | dh->rateinfo.credit_cap = hinfo->cfg.burst; | |
529 | } else { | |
530 | dh->rateinfo.credit = user2credits(hinfo->cfg.avg * | |
11d5f157 VP |
531 | hinfo->cfg.burst, revision); |
532 | dh->rateinfo.cost = user2credits(hinfo->cfg.avg, revision); | |
0197dee7 FW |
533 | dh->rateinfo.credit_cap = dh->rateinfo.credit; |
534 | } | |
817e076f FW |
535 | } |
536 | ||
09e410de JE |
537 | static inline __be32 maskl(__be32 a, unsigned int l) |
538 | { | |
1b9b70ea | 539 | return l ? htonl(ntohl(a) & ~0 << (32 - l)) : 0; |
09e410de JE |
540 | } |
541 | ||
c0cd1156 | 542 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
09e410de JE |
543 | static void hashlimit_ipv6_mask(__be32 *i, unsigned int p) |
544 | { | |
545 | switch (p) { | |
1b9b70ea | 546 | case 0 ... 31: |
09e410de JE |
547 | i[0] = maskl(i[0], p); |
548 | i[1] = i[2] = i[3] = 0; | |
549 | break; | |
1b9b70ea | 550 | case 32 ... 63: |
09e410de JE |
551 | i[1] = maskl(i[1], p - 32); |
552 | i[2] = i[3] = 0; | |
553 | break; | |
1b9b70ea | 554 | case 64 ... 95: |
09e410de JE |
555 | i[2] = maskl(i[2], p - 64); |
556 | i[3] = 0; | |
8f599229 | 557 | break; |
1b9b70ea | 558 | case 96 ... 127: |
09e410de JE |
559 | i[3] = maskl(i[3], p - 96); |
560 | break; | |
561 | case 128: | |
562 | break; | |
563 | } | |
564 | } | |
3ed5df44 | 565 | #endif |
09e410de | 566 | |
39b46fc6 | 567 | static int |
a47362a2 JE |
568 | hashlimit_init_dst(const struct xt_hashlimit_htable *hinfo, |
569 | struct dsthash_dst *dst, | |
39b46fc6 PM |
570 | const struct sk_buff *skb, unsigned int protoff) |
571 | { | |
572 | __be16 _ports[2], *ports; | |
193b23c5 | 573 | u8 nexthdr; |
aca071c1 | 574 | int poff; |
39b46fc6 PM |
575 | |
576 | memset(dst, 0, sizeof(*dst)); | |
577 | ||
578 | switch (hinfo->family) { | |
ee999d8b | 579 | case NFPROTO_IPV4: |
39b46fc6 | 580 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP) |
09e410de JE |
581 | dst->ip.dst = maskl(ip_hdr(skb)->daddr, |
582 | hinfo->cfg.dstmask); | |
39b46fc6 | 583 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP) |
09e410de JE |
584 | dst->ip.src = maskl(ip_hdr(skb)->saddr, |
585 | hinfo->cfg.srcmask); | |
39b46fc6 PM |
586 | |
587 | if (!(hinfo->cfg.mode & | |
588 | (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT))) | |
589 | return 0; | |
eddc9ec5 | 590 | nexthdr = ip_hdr(skb)->protocol; |
39b46fc6 | 591 | break; |
c0cd1156 | 592 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
ee999d8b | 593 | case NFPROTO_IPV6: |
412662d2 SR |
594 | { |
595 | __be16 frag_off; | |
596 | ||
09e410de JE |
597 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP) { |
598 | memcpy(&dst->ip6.dst, &ipv6_hdr(skb)->daddr, | |
599 | sizeof(dst->ip6.dst)); | |
600 | hashlimit_ipv6_mask(dst->ip6.dst, hinfo->cfg.dstmask); | |
601 | } | |
602 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP) { | |
603 | memcpy(&dst->ip6.src, &ipv6_hdr(skb)->saddr, | |
604 | sizeof(dst->ip6.src)); | |
605 | hashlimit_ipv6_mask(dst->ip6.src, hinfo->cfg.srcmask); | |
606 | } | |
39b46fc6 PM |
607 | |
608 | if (!(hinfo->cfg.mode & | |
609 | (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT))) | |
610 | return 0; | |
193b23c5 | 611 | nexthdr = ipv6_hdr(skb)->nexthdr; |
75f2811c | 612 | protoff = ipv6_skip_exthdr(skb, sizeof(struct ipv6hdr), &nexthdr, &frag_off); |
193b23c5 | 613 | if ((int)protoff < 0) |
39b46fc6 PM |
614 | return -1; |
615 | break; | |
412662d2 | 616 | } |
39b46fc6 PM |
617 | #endif |
618 | default: | |
619 | BUG(); | |
620 | return 0; | |
621 | } | |
622 | ||
aca071c1 CG |
623 | poff = proto_ports_offset(nexthdr); |
624 | if (poff >= 0) { | |
625 | ports = skb_header_pointer(skb, protoff + poff, sizeof(_ports), | |
39b46fc6 | 626 | &_ports); |
aca071c1 | 627 | } else { |
39b46fc6 PM |
628 | _ports[0] = _ports[1] = 0; |
629 | ports = _ports; | |
39b46fc6 PM |
630 | } |
631 | if (!ports) | |
632 | return -1; | |
633 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SPT) | |
634 | dst->src_port = ports[0]; | |
635 | if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DPT) | |
636 | dst->dst_port = ports[1]; | |
637 | return 0; | |
1da177e4 LT |
638 | } |
639 | ||
0197dee7 FW |
640 | static u32 hashlimit_byte_cost(unsigned int len, struct dsthash_ent *dh) |
641 | { | |
642 | u64 tmp = xt_hashlimit_len_to_chunks(len); | |
643 | tmp = tmp * dh->rateinfo.cost; | |
644 | ||
645 | if (unlikely(tmp > CREDITS_PER_JIFFY_BYTES * HZ)) | |
646 | tmp = CREDITS_PER_JIFFY_BYTES * HZ; | |
647 | ||
648 | if (dh->rateinfo.credit < tmp && dh->rateinfo.credit_cap) { | |
649 | dh->rateinfo.credit_cap--; | |
650 | dh->rateinfo.credit = CREDITS_PER_JIFFY_BYTES * HZ; | |
651 | } | |
652 | return (u32) tmp; | |
653 | } | |
654 | ||
ccb79bdc | 655 | static bool |
11d5f157 VP |
656 | hashlimit_mt_common(const struct sk_buff *skb, struct xt_action_param *par, |
657 | struct xt_hashlimit_htable *hinfo, | |
658 | const struct hashlimit_cfg2 *cfg, int revision) | |
09e410de | 659 | { |
09e410de JE |
660 | unsigned long now = jiffies; |
661 | struct dsthash_ent *dh; | |
662 | struct dsthash_dst dst; | |
09181842 | 663 | bool race = false; |
11d5f157 | 664 | u64 cost; |
09e410de | 665 | |
f7108a20 | 666 | if (hashlimit_init_dst(hinfo, &dst, skb, par->thoff) < 0) |
09e410de JE |
667 | goto hotdrop; |
668 | ||
02e4eb75 | 669 | rcu_read_lock_bh(); |
09e410de JE |
670 | dh = dsthash_find(hinfo, &dst); |
671 | if (dh == NULL) { | |
09181842 | 672 | dh = dsthash_alloc_init(hinfo, &dst, &race); |
09e410de | 673 | if (dh == NULL) { |
02e4eb75 | 674 | rcu_read_unlock_bh(); |
09e410de | 675 | goto hotdrop; |
09181842 PNA |
676 | } else if (race) { |
677 | /* Already got an entry, update expiration timeout */ | |
678 | dh->expires = now + msecs_to_jiffies(hinfo->cfg.expire); | |
11d5f157 | 679 | rateinfo_recalc(dh, now, hinfo->cfg.mode, revision); |
09181842 PNA |
680 | } else { |
681 | dh->expires = jiffies + msecs_to_jiffies(hinfo->cfg.expire); | |
11d5f157 | 682 | rateinfo_init(dh, hinfo, revision); |
09e410de | 683 | } |
09e410de JE |
684 | } else { |
685 | /* update expiration timeout */ | |
686 | dh->expires = now + msecs_to_jiffies(hinfo->cfg.expire); | |
11d5f157 | 687 | rateinfo_recalc(dh, now, hinfo->cfg.mode, revision); |
09e410de JE |
688 | } |
689 | ||
11d5f157 | 690 | if (cfg->mode & XT_HASHLIMIT_BYTES) |
0197dee7 FW |
691 | cost = hashlimit_byte_cost(skb->len, dh); |
692 | else | |
693 | cost = dh->rateinfo.cost; | |
694 | ||
695 | if (dh->rateinfo.credit >= cost) { | |
09e410de | 696 | /* below the limit */ |
0197dee7 | 697 | dh->rateinfo.credit -= cost; |
02e4eb75 ED |
698 | spin_unlock(&dh->lock); |
699 | rcu_read_unlock_bh(); | |
11d5f157 | 700 | return !(cfg->mode & XT_HASHLIMIT_INVERT); |
09e410de JE |
701 | } |
702 | ||
02e4eb75 ED |
703 | spin_unlock(&dh->lock); |
704 | rcu_read_unlock_bh(); | |
09e410de | 705 | /* default match is underlimit - so over the limit, we need to invert */ |
11d5f157 | 706 | return cfg->mode & XT_HASHLIMIT_INVERT; |
09e410de JE |
707 | |
708 | hotdrop: | |
b4ba2611 | 709 | par->hotdrop = true; |
09e410de JE |
710 | return false; |
711 | } | |
712 | ||
11d5f157 VP |
713 | static bool |
714 | hashlimit_mt_v1(const struct sk_buff *skb, struct xt_action_param *par) | |
715 | { | |
716 | const struct xt_hashlimit_mtinfo1 *info = par->matchinfo; | |
717 | struct xt_hashlimit_htable *hinfo = info->hinfo; | |
718 | struct hashlimit_cfg2 cfg = {}; | |
719 | int ret; | |
720 | ||
721 | ret = cfg_copy(&cfg, (void *)&info->cfg, 1); | |
722 | ||
723 | if (ret) | |
724 | return ret; | |
725 | ||
726 | return hashlimit_mt_common(skb, par, hinfo, &cfg, 1); | |
727 | } | |
728 | ||
729 | static bool | |
730 | hashlimit_mt(const struct sk_buff *skb, struct xt_action_param *par) | |
731 | { | |
732 | const struct xt_hashlimit_mtinfo2 *info = par->matchinfo; | |
733 | struct xt_hashlimit_htable *hinfo = info->hinfo; | |
734 | ||
735 | return hashlimit_mt_common(skb, par, hinfo, &info->cfg, 2); | |
736 | } | |
737 | ||
738 | static int hashlimit_mt_check_common(const struct xt_mtchk_param *par, | |
739 | struct xt_hashlimit_htable **hinfo, | |
740 | struct hashlimit_cfg2 *cfg, | |
741 | const char *name, int revision) | |
09e410de | 742 | { |
e89fc3f1 | 743 | struct net *net = par->net; |
4a5a5c73 | 744 | int ret; |
09e410de | 745 | |
11d5f157 | 746 | if (cfg->gc_interval == 0 || cfg->expire == 0) |
bd414ee6 | 747 | return -EINVAL; |
aa5fa318 | 748 | if (par->family == NFPROTO_IPV4) { |
11d5f157 | 749 | if (cfg->srcmask > 32 || cfg->dstmask > 32) |
bd414ee6 | 750 | return -EINVAL; |
09e410de | 751 | } else { |
11d5f157 | 752 | if (cfg->srcmask > 128 || cfg->dstmask > 128) |
bd414ee6 | 753 | return -EINVAL; |
09e410de JE |
754 | } |
755 | ||
11d5f157 | 756 | if (cfg->mode & ~XT_HASHLIMIT_ALL) { |
0197dee7 | 757 | pr_info("Unknown mode mask %X, kernel too old?\n", |
11d5f157 | 758 | cfg->mode); |
0197dee7 FW |
759 | return -EINVAL; |
760 | } | |
761 | ||
762 | /* Check for overflow. */ | |
11d5f157 VP |
763 | if (cfg->mode & XT_HASHLIMIT_BYTES) { |
764 | if (user2credits_byte(cfg->avg) == 0) { | |
765 | pr_info("overflow, rate too high: %llu\n", cfg->avg); | |
0197dee7 FW |
766 | return -EINVAL; |
767 | } | |
11d5f157 VP |
768 | } else if (cfg->burst == 0 || |
769 | user2credits(cfg->avg * cfg->burst, revision) < | |
770 | user2credits(cfg->avg, revision)) { | |
771 | pr_info("overflow, try lower: %llu/%llu\n", | |
772 | cfg->avg, cfg->burst); | |
0197dee7 FW |
773 | return -ERANGE; |
774 | } | |
775 | ||
2eff25c1 | 776 | mutex_lock(&hashlimit_mutex); |
11d5f157 VP |
777 | *hinfo = htable_find_get(net, name, par->family); |
778 | if (*hinfo == NULL) { | |
779 | ret = htable_create(net, cfg, name, par->family, | |
780 | hinfo, revision); | |
4a5a5c73 JE |
781 | if (ret < 0) { |
782 | mutex_unlock(&hashlimit_mutex); | |
783 | return ret; | |
784 | } | |
09e410de | 785 | } |
2eff25c1 | 786 | mutex_unlock(&hashlimit_mutex); |
11d5f157 | 787 | |
bd414ee6 | 788 | return 0; |
09e410de JE |
789 | } |
790 | ||
11d5f157 VP |
791 | static int hashlimit_mt_check_v1(const struct xt_mtchk_param *par) |
792 | { | |
793 | struct xt_hashlimit_mtinfo1 *info = par->matchinfo; | |
794 | struct hashlimit_cfg2 cfg = {}; | |
795 | int ret; | |
796 | ||
797 | if (info->name[sizeof(info->name) - 1] != '\0') | |
798 | return -EINVAL; | |
799 | ||
800 | ret = cfg_copy(&cfg, (void *)&info->cfg, 1); | |
801 | ||
802 | if (ret) | |
803 | return ret; | |
804 | ||
805 | return hashlimit_mt_check_common(par, &info->hinfo, | |
806 | &cfg, info->name, 1); | |
807 | } | |
808 | ||
809 | static int hashlimit_mt_check(const struct xt_mtchk_param *par) | |
810 | { | |
811 | struct xt_hashlimit_mtinfo2 *info = par->matchinfo; | |
812 | ||
813 | if (info->name[sizeof(info->name) - 1] != '\0') | |
814 | return -EINVAL; | |
815 | ||
816 | return hashlimit_mt_check_common(par, &info->hinfo, &info->cfg, | |
817 | info->name, 2); | |
818 | } | |
819 | ||
0dc60a45 | 820 | static void hashlimit_mt_destroy_v1(const struct xt_mtdtor_param *par) |
09e410de | 821 | { |
6be3d859 | 822 | const struct xt_hashlimit_mtinfo1 *info = par->matchinfo; |
09e410de JE |
823 | |
824 | htable_put(info->hinfo); | |
825 | } | |
826 | ||
11d5f157 VP |
827 | static void hashlimit_mt_destroy(const struct xt_mtdtor_param *par) |
828 | { | |
829 | const struct xt_hashlimit_mtinfo2 *info = par->matchinfo; | |
830 | ||
831 | htable_put(info->hinfo); | |
832 | } | |
833 | ||
d3c5ee6d | 834 | static struct xt_match hashlimit_mt_reg[] __read_mostly = { |
09e410de JE |
835 | { |
836 | .name = "hashlimit", | |
837 | .revision = 1, | |
ee999d8b | 838 | .family = NFPROTO_IPV4, |
0dc60a45 | 839 | .match = hashlimit_mt_v1, |
09e410de | 840 | .matchsize = sizeof(struct xt_hashlimit_mtinfo1), |
0dc60a45 VP |
841 | .checkentry = hashlimit_mt_check_v1, |
842 | .destroy = hashlimit_mt_destroy_v1, | |
09e410de JE |
843 | .me = THIS_MODULE, |
844 | }, | |
11d5f157 VP |
845 | { |
846 | .name = "hashlimit", | |
847 | .revision = 2, | |
848 | .family = NFPROTO_IPV4, | |
849 | .match = hashlimit_mt, | |
850 | .matchsize = sizeof(struct xt_hashlimit_mtinfo2), | |
851 | .checkentry = hashlimit_mt_check, | |
852 | .destroy = hashlimit_mt_destroy, | |
853 | .me = THIS_MODULE, | |
854 | }, | |
c0cd1156 | 855 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
09e410de JE |
856 | { |
857 | .name = "hashlimit", | |
858 | .revision = 1, | |
ee999d8b | 859 | .family = NFPROTO_IPV6, |
0dc60a45 | 860 | .match = hashlimit_mt_v1, |
09e410de | 861 | .matchsize = sizeof(struct xt_hashlimit_mtinfo1), |
0dc60a45 VP |
862 | .checkentry = hashlimit_mt_check_v1, |
863 | .destroy = hashlimit_mt_destroy_v1, | |
09e410de JE |
864 | .me = THIS_MODULE, |
865 | }, | |
11d5f157 VP |
866 | { |
867 | .name = "hashlimit", | |
868 | .revision = 2, | |
869 | .family = NFPROTO_IPV6, | |
870 | .match = hashlimit_mt, | |
871 | .matchsize = sizeof(struct xt_hashlimit_mtinfo2), | |
872 | .checkentry = hashlimit_mt_check, | |
873 | .destroy = hashlimit_mt_destroy, | |
874 | .me = THIS_MODULE, | |
875 | }, | |
7b21e09d | 876 | #endif |
1da177e4 LT |
877 | }; |
878 | ||
879 | /* PROC stuff */ | |
1da177e4 | 880 | static void *dl_seq_start(struct seq_file *s, loff_t *pos) |
f4f6fb71 | 881 | __acquires(htable->lock) |
1da177e4 | 882 | { |
a1004d8e | 883 | struct xt_hashlimit_htable *htable = s->private; |
1da177e4 LT |
884 | unsigned int *bucket; |
885 | ||
886 | spin_lock_bh(&htable->lock); | |
887 | if (*pos >= htable->cfg.size) | |
888 | return NULL; | |
889 | ||
890 | bucket = kmalloc(sizeof(unsigned int), GFP_ATOMIC); | |
891 | if (!bucket) | |
892 | return ERR_PTR(-ENOMEM); | |
893 | ||
894 | *bucket = *pos; | |
895 | return bucket; | |
896 | } | |
897 | ||
898 | static void *dl_seq_next(struct seq_file *s, void *v, loff_t *pos) | |
899 | { | |
a1004d8e | 900 | struct xt_hashlimit_htable *htable = s->private; |
1da177e4 LT |
901 | unsigned int *bucket = (unsigned int *)v; |
902 | ||
903 | *pos = ++(*bucket); | |
904 | if (*pos >= htable->cfg.size) { | |
905 | kfree(v); | |
906 | return NULL; | |
907 | } | |
908 | return bucket; | |
909 | } | |
910 | ||
911 | static void dl_seq_stop(struct seq_file *s, void *v) | |
f4f6fb71 | 912 | __releases(htable->lock) |
1da177e4 | 913 | { |
a1004d8e | 914 | struct xt_hashlimit_htable *htable = s->private; |
1da177e4 LT |
915 | unsigned int *bucket = (unsigned int *)v; |
916 | ||
55e0d7cf ED |
917 | if (!IS_ERR(bucket)) |
918 | kfree(bucket); | |
1da177e4 LT |
919 | spin_unlock_bh(&htable->lock); |
920 | } | |
921 | ||
11d5f157 VP |
922 | static void dl_seq_print(struct dsthash_ent *ent, u_int8_t family, |
923 | struct seq_file *s) | |
1da177e4 | 924 | { |
39b46fc6 | 925 | switch (family) { |
ee999d8b | 926 | case NFPROTO_IPV4: |
11d5f157 | 927 | seq_printf(s, "%ld %pI4:%u->%pI4:%u %llu %llu %llu\n", |
e71456ae SRRH |
928 | (long)(ent->expires - jiffies)/HZ, |
929 | &ent->dst.ip.src, | |
930 | ntohs(ent->dst.src_port), | |
931 | &ent->dst.ip.dst, | |
932 | ntohs(ent->dst.dst_port), | |
933 | ent->rateinfo.credit, ent->rateinfo.credit_cap, | |
934 | ent->rateinfo.cost); | |
02e4eb75 | 935 | break; |
c0cd1156 | 936 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
ee999d8b | 937 | case NFPROTO_IPV6: |
11d5f157 | 938 | seq_printf(s, "%ld %pI6:%u->%pI6:%u %llu %llu %llu\n", |
e71456ae SRRH |
939 | (long)(ent->expires - jiffies)/HZ, |
940 | &ent->dst.ip6.src, | |
941 | ntohs(ent->dst.src_port), | |
942 | &ent->dst.ip6.dst, | |
943 | ntohs(ent->dst.dst_port), | |
944 | ent->rateinfo.credit, ent->rateinfo.credit_cap, | |
945 | ent->rateinfo.cost); | |
02e4eb75 | 946 | break; |
7b21e09d | 947 | #endif |
39b46fc6 PM |
948 | default: |
949 | BUG(); | |
39b46fc6 | 950 | } |
11d5f157 VP |
951 | } |
952 | ||
953 | static int dl_seq_real_show_v1(struct dsthash_ent *ent, u_int8_t family, | |
954 | struct seq_file *s) | |
955 | { | |
956 | const struct xt_hashlimit_htable *ht = s->private; | |
957 | ||
958 | spin_lock(&ent->lock); | |
959 | /* recalculate to show accurate numbers */ | |
960 | rateinfo_recalc(ent, jiffies, ht->cfg.mode, 1); | |
961 | ||
962 | dl_seq_print(ent, family, s); | |
963 | ||
964 | spin_unlock(&ent->lock); | |
965 | return seq_has_overflowed(s); | |
966 | } | |
967 | ||
968 | static int dl_seq_real_show(struct dsthash_ent *ent, u_int8_t family, | |
969 | struct seq_file *s) | |
970 | { | |
971 | const struct xt_hashlimit_htable *ht = s->private; | |
972 | ||
973 | spin_lock(&ent->lock); | |
974 | /* recalculate to show accurate numbers */ | |
975 | rateinfo_recalc(ent, jiffies, ht->cfg.mode, 2); | |
976 | ||
977 | dl_seq_print(ent, family, s); | |
978 | ||
02e4eb75 | 979 | spin_unlock(&ent->lock); |
e71456ae | 980 | return seq_has_overflowed(s); |
1da177e4 LT |
981 | } |
982 | ||
0dc60a45 | 983 | static int dl_seq_show_v1(struct seq_file *s, void *v) |
1da177e4 | 984 | { |
a1004d8e | 985 | struct xt_hashlimit_htable *htable = s->private; |
1da177e4 LT |
986 | unsigned int *bucket = (unsigned int *)v; |
987 | struct dsthash_ent *ent; | |
1da177e4 | 988 | |
39b46fc6 | 989 | if (!hlist_empty(&htable->hash[*bucket])) { |
b67bfe0d | 990 | hlist_for_each_entry(ent, &htable->hash[*bucket], node) |
0dc60a45 | 991 | if (dl_seq_real_show_v1(ent, htable->family, s)) |
683a04ce | 992 | return -1; |
39b46fc6 | 993 | } |
1da177e4 LT |
994 | return 0; |
995 | } | |
996 | ||
11d5f157 VP |
997 | static int dl_seq_show(struct seq_file *s, void *v) |
998 | { | |
999 | struct xt_hashlimit_htable *htable = s->private; | |
1000 | unsigned int *bucket = (unsigned int *)v; | |
1001 | struct dsthash_ent *ent; | |
1002 | ||
1003 | if (!hlist_empty(&htable->hash[*bucket])) { | |
1004 | hlist_for_each_entry(ent, &htable->hash[*bucket], node) | |
1005 | if (dl_seq_real_show(ent, htable->family, s)) | |
1006 | return -1; | |
1007 | } | |
1008 | return 0; | |
1009 | } | |
1010 | ||
0dc60a45 | 1011 | static const struct seq_operations dl_seq_ops_v1 = { |
1da177e4 LT |
1012 | .start = dl_seq_start, |
1013 | .next = dl_seq_next, | |
1014 | .stop = dl_seq_stop, | |
0dc60a45 | 1015 | .show = dl_seq_show_v1 |
1da177e4 LT |
1016 | }; |
1017 | ||
11d5f157 VP |
1018 | static const struct seq_operations dl_seq_ops = { |
1019 | .start = dl_seq_start, | |
1020 | .next = dl_seq_next, | |
1021 | .stop = dl_seq_stop, | |
1022 | .show = dl_seq_show | |
1023 | }; | |
1024 | ||
0dc60a45 | 1025 | static int dl_proc_open_v1(struct inode *inode, struct file *file) |
1da177e4 | 1026 | { |
0dc60a45 | 1027 | int ret = seq_open(file, &dl_seq_ops_v1); |
1da177e4 LT |
1028 | |
1029 | if (!ret) { | |
1030 | struct seq_file *sf = file->private_data; | |
d9dda78b | 1031 | sf->private = PDE_DATA(inode); |
1da177e4 LT |
1032 | } |
1033 | return ret; | |
1034 | } | |
1035 | ||
11d5f157 VP |
1036 | static int dl_proc_open(struct inode *inode, struct file *file) |
1037 | { | |
1038 | int ret = seq_open(file, &dl_seq_ops); | |
1039 | ||
1040 | if (!ret) { | |
1041 | struct seq_file *sf = file->private_data; | |
1042 | ||
1043 | sf->private = PDE_DATA(inode); | |
1044 | } | |
1045 | return ret; | |
1046 | } | |
1047 | ||
0dc60a45 | 1048 | static const struct file_operations dl_file_ops_v1 = { |
1da177e4 | 1049 | .owner = THIS_MODULE, |
0dc60a45 | 1050 | .open = dl_proc_open_v1, |
1da177e4 LT |
1051 | .read = seq_read, |
1052 | .llseek = seq_lseek, | |
1053 | .release = seq_release | |
1054 | }; | |
1055 | ||
11d5f157 VP |
1056 | static const struct file_operations dl_file_ops = { |
1057 | .owner = THIS_MODULE, | |
1058 | .open = dl_proc_open, | |
1059 | .read = seq_read, | |
1060 | .llseek = seq_lseek, | |
1061 | .release = seq_release | |
1062 | }; | |
1063 | ||
e89fc3f1 AD |
1064 | static int __net_init hashlimit_proc_net_init(struct net *net) |
1065 | { | |
1066 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(net); | |
1067 | ||
1068 | hashlimit_net->ipt_hashlimit = proc_mkdir("ipt_hashlimit", net->proc_net); | |
1069 | if (!hashlimit_net->ipt_hashlimit) | |
1070 | return -ENOMEM; | |
c0cd1156 | 1071 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
e89fc3f1 AD |
1072 | hashlimit_net->ip6t_hashlimit = proc_mkdir("ip6t_hashlimit", net->proc_net); |
1073 | if (!hashlimit_net->ip6t_hashlimit) { | |
ece31ffd | 1074 | remove_proc_entry("ipt_hashlimit", net->proc_net); |
e89fc3f1 AD |
1075 | return -ENOMEM; |
1076 | } | |
1077 | #endif | |
1078 | return 0; | |
1079 | } | |
1080 | ||
1081 | static void __net_exit hashlimit_proc_net_exit(struct net *net) | |
1082 | { | |
32263dd1 | 1083 | struct xt_hashlimit_htable *hinfo; |
32263dd1 VL |
1084 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(net); |
1085 | ||
b4ef4ce0 SP |
1086 | /* hashlimit_net_exit() is called before hashlimit_mt_destroy(). |
1087 | * Make sure that the parent ipt_hashlimit and ip6t_hashlimit proc | |
1088 | * entries is empty before trying to remove it. | |
32263dd1 VL |
1089 | */ |
1090 | mutex_lock(&hashlimit_mutex); | |
b67bfe0d | 1091 | hlist_for_each_entry(hinfo, &hashlimit_net->htables, node) |
b4ef4ce0 | 1092 | htable_remove_proc_entry(hinfo); |
32263dd1 VL |
1093 | hashlimit_net->ipt_hashlimit = NULL; |
1094 | hashlimit_net->ip6t_hashlimit = NULL; | |
1095 | mutex_unlock(&hashlimit_mutex); | |
1096 | ||
ece31ffd | 1097 | remove_proc_entry("ipt_hashlimit", net->proc_net); |
c0cd1156 | 1098 | #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES) |
ece31ffd | 1099 | remove_proc_entry("ip6t_hashlimit", net->proc_net); |
e89fc3f1 AD |
1100 | #endif |
1101 | } | |
1102 | ||
1103 | static int __net_init hashlimit_net_init(struct net *net) | |
1104 | { | |
1105 | struct hashlimit_net *hashlimit_net = hashlimit_pernet(net); | |
1106 | ||
1107 | INIT_HLIST_HEAD(&hashlimit_net->htables); | |
1108 | return hashlimit_proc_net_init(net); | |
1109 | } | |
1110 | ||
1111 | static void __net_exit hashlimit_net_exit(struct net *net) | |
1112 | { | |
e89fc3f1 AD |
1113 | hashlimit_proc_net_exit(net); |
1114 | } | |
1115 | ||
1116 | static struct pernet_operations hashlimit_net_ops = { | |
1117 | .init = hashlimit_net_init, | |
1118 | .exit = hashlimit_net_exit, | |
1119 | .id = &hashlimit_net_id, | |
1120 | .size = sizeof(struct hashlimit_net), | |
1121 | }; | |
1122 | ||
d3c5ee6d | 1123 | static int __init hashlimit_mt_init(void) |
1da177e4 | 1124 | { |
39b46fc6 | 1125 | int err; |
1da177e4 | 1126 | |
e89fc3f1 AD |
1127 | err = register_pernet_subsys(&hashlimit_net_ops); |
1128 | if (err < 0) | |
1129 | return err; | |
d3c5ee6d JE |
1130 | err = xt_register_matches(hashlimit_mt_reg, |
1131 | ARRAY_SIZE(hashlimit_mt_reg)); | |
39b46fc6 PM |
1132 | if (err < 0) |
1133 | goto err1; | |
1da177e4 | 1134 | |
39b46fc6 PM |
1135 | err = -ENOMEM; |
1136 | hashlimit_cachep = kmem_cache_create("xt_hashlimit", | |
1137 | sizeof(struct dsthash_ent), 0, 0, | |
20c2df83 | 1138 | NULL); |
1da177e4 | 1139 | if (!hashlimit_cachep) { |
b167a37c | 1140 | pr_warn("unable to create slab cache\n"); |
39b46fc6 | 1141 | goto err2; |
1da177e4 | 1142 | } |
e89fc3f1 AD |
1143 | return 0; |
1144 | ||
39b46fc6 | 1145 | err2: |
d3c5ee6d | 1146 | xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg)); |
39b46fc6 | 1147 | err1: |
e89fc3f1 | 1148 | unregister_pernet_subsys(&hashlimit_net_ops); |
39b46fc6 | 1149 | return err; |
1da177e4 | 1150 | |
1da177e4 LT |
1151 | } |
1152 | ||
d3c5ee6d | 1153 | static void __exit hashlimit_mt_exit(void) |
1da177e4 | 1154 | { |
d3c5ee6d | 1155 | xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg)); |
e89fc3f1 | 1156 | unregister_pernet_subsys(&hashlimit_net_ops); |
02e4eb75 ED |
1157 | |
1158 | rcu_barrier_bh(); | |
1159 | kmem_cache_destroy(hashlimit_cachep); | |
1da177e4 LT |
1160 | } |
1161 | ||
d3c5ee6d JE |
1162 | module_init(hashlimit_mt_init); |
1163 | module_exit(hashlimit_mt_exit); |