netfilter: connlimit: factor hlist search into new function
[deliverable/linux.git] / net / netfilter / xt_connlimit.c
CommitLineData
370786f9
JE
1/*
2 * netfilter module to limit the number of parallel tcp
3 * connections per IP address.
4 * (c) 2000 Gerd Knorr <kraxel@bytesex.org>
5 * Nov 2002: Martin Bene <martin.bene@icomedias.com>:
6 * only ignore TIME_WAIT or gone connections
ba5dc275 7 * (C) CC Computer Consultants GmbH, 2007
370786f9
JE
8 *
9 * based on ...
10 *
11 * Kernel module to match connection tracking information.
12 * GPL (C) 1999 Rusty Russell (rusty@rustcorp.com.au).
13 */
8bee4bad 14#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
370786f9
JE
15#include <linux/in.h>
16#include <linux/in6.h>
17#include <linux/ip.h>
18#include <linux/ipv6.h>
19#include <linux/jhash.h>
5a0e3ad6 20#include <linux/slab.h>
370786f9
JE
21#include <linux/list.h>
22#include <linux/module.h>
23#include <linux/random.h>
24#include <linux/skbuff.h>
25#include <linux/spinlock.h>
26#include <linux/netfilter/nf_conntrack_tcp.h>
27#include <linux/netfilter/x_tables.h>
28#include <linux/netfilter/xt_connlimit.h>
29#include <net/netfilter/nf_conntrack.h>
30#include <net/netfilter/nf_conntrack_core.h>
31#include <net/netfilter/nf_conntrack_tuple.h>
5d0aa2cc 32#include <net/netfilter/nf_conntrack_zones.h>
370786f9
JE
33
34/* we will save the tuples of all connections we care about */
35struct xt_connlimit_conn {
3e0d5149 36 struct hlist_node node;
8183e3a8
CG
37 struct nf_conntrack_tuple tuple;
38 union nf_inet_addr addr;
370786f9
JE
39};
40
41struct xt_connlimit_data {
3e0d5149
CG
42 struct hlist_head iphash[256];
43 spinlock_t lock;
370786f9
JE
44};
45
294188ae 46static u_int32_t connlimit_rnd __read_mostly;
370786f9 47
a34c4589 48static inline unsigned int connlimit_iphash(__be32 addr)
370786f9 49{
a34c4589 50 return jhash_1word((__force __u32)addr, connlimit_rnd) & 0xFF;
370786f9
JE
51}
52
53static inline unsigned int
643a2c15
JE
54connlimit_iphash6(const union nf_inet_addr *addr,
55 const union nf_inet_addr *mask)
370786f9 56{
643a2c15 57 union nf_inet_addr res;
370786f9
JE
58 unsigned int i;
59
370786f9
JE
60 for (i = 0; i < ARRAY_SIZE(addr->ip6); ++i)
61 res.ip6[i] = addr->ip6[i] & mask->ip6[i];
62
a34c4589 63 return jhash2((u32 *)res.ip6, ARRAY_SIZE(res.ip6), connlimit_rnd) & 0xFF;
370786f9
JE
64}
65
66static inline bool already_closed(const struct nf_conn *conn)
67{
5e8fbe2a 68 if (nf_ct_protonum(conn) == IPPROTO_TCP)
d2ee3f2c
DW
69 return conn->proto.tcp.state == TCP_CONNTRACK_TIME_WAIT ||
70 conn->proto.tcp.state == TCP_CONNTRACK_CLOSE;
370786f9
JE
71 else
72 return 0;
73}
74
75static inline unsigned int
643a2c15
JE
76same_source_net(const union nf_inet_addr *addr,
77 const union nf_inet_addr *mask,
76108cea 78 const union nf_inet_addr *u3, u_int8_t family)
370786f9 79{
ee999d8b 80 if (family == NFPROTO_IPV4) {
370786f9
JE
81 return (addr->ip & mask->ip) == (u3->ip & mask->ip);
82 } else {
643a2c15 83 union nf_inet_addr lh, rh;
370786f9
JE
84 unsigned int i;
85
86 for (i = 0; i < ARRAY_SIZE(addr->ip6); ++i) {
87 lh.ip6[i] = addr->ip6[i] & mask->ip6[i];
88 rh.ip6[i] = u3->ip6[i] & mask->ip6[i];
89 }
90
91 return memcmp(&lh.ip6, &rh.ip6, sizeof(lh.ip6)) == 0;
92 }
93}
94
15cfd528
FW
95static int count_hlist(struct net *net,
96 struct hlist_head *head,
97 const struct nf_conntrack_tuple *tuple,
98 const union nf_inet_addr *addr,
99 const union nf_inet_addr *mask,
100 u_int8_t family)
370786f9 101{
3cf93c96 102 const struct nf_conntrack_tuple_hash *found;
370786f9 103 struct xt_connlimit_conn *conn;
b67bfe0d 104 struct hlist_node *n;
ea781f19 105 struct nf_conn *found_ct;
370786f9
JE
106 bool addit = true;
107 int matches = 0;
108
76507f69 109 rcu_read_lock();
370786f9
JE
110
111 /* check the saved connections */
15cfd528 112 hlist_for_each_entry_safe(conn, n, head, node) {
5d0aa2cc
PM
113 found = nf_conntrack_find_get(net, NF_CT_DEFAULT_ZONE,
114 &conn->tuple);
370786f9
JE
115 found_ct = NULL;
116
117 if (found != NULL)
118 found_ct = nf_ct_tuplehash_to_ctrack(found);
119
120 if (found_ct != NULL &&
121 nf_ct_tuple_equal(&conn->tuple, tuple) &&
122 !already_closed(found_ct))
123 /*
124 * Just to be sure we have it only once in the list.
125 * We should not see tuples twice unless someone hooks
126 * this into a table without "-p tcp --syn".
127 */
128 addit = false;
129
130 if (found == NULL) {
131 /* this one is gone */
3e0d5149 132 hlist_del(&conn->node);
370786f9
JE
133 kfree(conn);
134 continue;
135 }
136
137 if (already_closed(found_ct)) {
138 /*
139 * we do not care about connections which are
140 * closed already -> ditch it
141 */
ea781f19 142 nf_ct_put(found_ct);
3e0d5149 143 hlist_del(&conn->node);
370786f9
JE
144 kfree(conn);
145 continue;
146 }
147
8183e3a8 148 if (same_source_net(addr, mask, &conn->addr, family))
370786f9
JE
149 /* same source network -> be counted! */
150 ++matches;
ea781f19 151 nf_ct_put(found_ct);
370786f9
JE
152 }
153
76507f69 154 rcu_read_unlock();
370786f9
JE
155
156 if (addit) {
157 /* save the new connection in our list */
0e23ca14 158 conn = kmalloc(sizeof(*conn), GFP_ATOMIC);
370786f9
JE
159 if (conn == NULL)
160 return -ENOMEM;
161 conn->tuple = *tuple;
8183e3a8 162 conn->addr = *addr;
15cfd528 163 hlist_add_head(&conn->node, head);
370786f9
JE
164 ++matches;
165 }
166
167 return matches;
168}
169
15cfd528
FW
170static int count_them(struct net *net,
171 struct xt_connlimit_data *data,
172 const struct nf_conntrack_tuple *tuple,
173 const union nf_inet_addr *addr,
174 const union nf_inet_addr *mask,
175 u_int8_t family)
176{
177 struct hlist_head *hhead;
178 int count;
179 u32 hash;
180
181 if (family == NFPROTO_IPV6)
182 hash = connlimit_iphash6(addr, mask);
183 else
184 hash = connlimit_iphash(addr->ip & mask->ip);
185
186 hhead = &data->iphash[hash];
187
188 spin_lock_bh(&data->lock);
189 count = count_hlist(net, hhead, tuple, addr, mask, family);
190 spin_unlock_bh(&data->lock);
191
192 return count;
193}
194
d3c5ee6d 195static bool
62fc8051 196connlimit_mt(const struct sk_buff *skb, struct xt_action_param *par)
370786f9 197{
83fc8102 198 struct net *net = dev_net(par->in ? par->in : par->out);
f7108a20 199 const struct xt_connlimit_info *info = par->matchinfo;
22c2d8bc 200 union nf_inet_addr addr;
370786f9
JE
201 struct nf_conntrack_tuple tuple;
202 const struct nf_conntrack_tuple *tuple_ptr = &tuple;
203 enum ip_conntrack_info ctinfo;
204 const struct nf_conn *ct;
205 int connections;
206
207 ct = nf_ct_get(skb, &ctinfo);
8183e3a8
CG
208 if (ct != NULL)
209 tuple_ptr = &ct->tuplehash[IP_CT_DIR_ORIGINAL].tuple;
210 else if (!nf_ct_get_tuplepr(skb, skb_network_offset(skb),
211 par->family, &tuple))
370786f9
JE
212 goto hotdrop;
213
92f3b2b1 214 if (par->family == NFPROTO_IPV6) {
370786f9 215 const struct ipv6hdr *iph = ipv6_hdr(skb);
cc4fc022
JE
216 memcpy(&addr.ip6, (info->flags & XT_CONNLIMIT_DADDR) ?
217 &iph->daddr : &iph->saddr, sizeof(addr.ip6));
370786f9
JE
218 } else {
219 const struct iphdr *iph = ip_hdr(skb);
cc4fc022
JE
220 addr.ip = (info->flags & XT_CONNLIMIT_DADDR) ?
221 iph->daddr : iph->saddr;
370786f9
JE
222 }
223
83fc8102 224 connections = count_them(net, info->data, tuple_ptr, &addr,
20b7975e 225 &info->mask, par->family);
370786f9 226
1cc34c30 227 if (connections < 0)
370786f9 228 /* kmalloc failed, drop it entirely */
1cc34c30 229 goto hotdrop;
370786f9 230
cc4fc022
JE
231 return (connections > info->limit) ^
232 !!(info->flags & XT_CONNLIMIT_INVERT);
370786f9
JE
233
234 hotdrop:
b4ba2611 235 par->hotdrop = true;
370786f9
JE
236 return false;
237}
238
b0f38452 239static int connlimit_mt_check(const struct xt_mtchk_param *par)
370786f9 240{
9b4fce7a 241 struct xt_connlimit_info *info = par->matchinfo;
370786f9 242 unsigned int i;
4a5a5c73 243 int ret;
370786f9 244
4656c4d6
CG
245 if (unlikely(!connlimit_rnd)) {
246 u_int32_t rand;
247
248 do {
249 get_random_bytes(&rand, sizeof(rand));
250 } while (!rand);
251 cmpxchg(&connlimit_rnd, 0, rand);
294188ae 252 }
4a5a5c73
JE
253 ret = nf_ct_l3proto_try_module_get(par->family);
254 if (ret < 0) {
8bee4bad
JE
255 pr_info("cannot load conntrack support for "
256 "address family %u\n", par->family);
4a5a5c73 257 return ret;
370786f9
JE
258 }
259
260 /* init private data */
261 info->data = kmalloc(sizeof(struct xt_connlimit_data), GFP_KERNEL);
262 if (info->data == NULL) {
92f3b2b1 263 nf_ct_l3proto_module_put(par->family);
4a5a5c73 264 return -ENOMEM;
370786f9
JE
265 }
266
267 spin_lock_init(&info->data->lock);
268 for (i = 0; i < ARRAY_SIZE(info->data->iphash); ++i)
3e0d5149 269 INIT_HLIST_HEAD(&info->data->iphash[i]);
370786f9 270
bd414ee6 271 return 0;
370786f9
JE
272}
273
6be3d859 274static void connlimit_mt_destroy(const struct xt_mtdtor_param *par)
370786f9 275{
6be3d859 276 const struct xt_connlimit_info *info = par->matchinfo;
370786f9 277 struct xt_connlimit_conn *conn;
b67bfe0d 278 struct hlist_node *n;
3e0d5149 279 struct hlist_head *hash = info->data->iphash;
370786f9
JE
280 unsigned int i;
281
92f3b2b1 282 nf_ct_l3proto_module_put(par->family);
370786f9
JE
283
284 for (i = 0; i < ARRAY_SIZE(info->data->iphash); ++i) {
b67bfe0d 285 hlist_for_each_entry_safe(conn, n, &hash[i], node) {
3e0d5149 286 hlist_del(&conn->node);
370786f9
JE
287 kfree(conn);
288 }
289 }
290
291 kfree(info->data);
292}
293
68c07cb6
CW
294static struct xt_match connlimit_mt_reg __read_mostly = {
295 .name = "connlimit",
296 .revision = 1,
297 .family = NFPROTO_UNSPEC,
298 .checkentry = connlimit_mt_check,
299 .match = connlimit_mt,
300 .matchsize = sizeof(struct xt_connlimit_info),
301 .destroy = connlimit_mt_destroy,
302 .me = THIS_MODULE,
370786f9
JE
303};
304
d3c5ee6d 305static int __init connlimit_mt_init(void)
370786f9 306{
68c07cb6 307 return xt_register_match(&connlimit_mt_reg);
370786f9
JE
308}
309
d3c5ee6d 310static void __exit connlimit_mt_exit(void)
370786f9 311{
68c07cb6 312 xt_unregister_match(&connlimit_mt_reg);
370786f9
JE
313}
314
d3c5ee6d
JE
315module_init(connlimit_mt_init);
316module_exit(connlimit_mt_exit);
92f3b2b1 317MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>");
2ae15b64 318MODULE_DESCRIPTION("Xtables: Number of connections matching");
370786f9
JE
319MODULE_LICENSE("GPL");
320MODULE_ALIAS("ipt_connlimit");
321MODULE_ALIAS("ip6t_connlimit");
This page took 0.458943 seconds and 5 git commands to generate.