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