]>
Commit | Line | Data |
---|---|---|
77ab9cff MJ |
1 | /* Expectation handling for nf_conntrack. */ |
2 | ||
3 | /* (C) 1999-2001 Paul `Rusty' Russell | |
4 | * (C) 2002-2006 Netfilter Core Team <coreteam@netfilter.org> | |
5 | * (C) 2003,2004 USAGI/WIDE Project <http://www.linux-ipv6.org> | |
6 | * | |
7 | * This program is free software; you can redistribute it and/or modify | |
8 | * it under the terms of the GNU General Public License version 2 as | |
9 | * published by the Free Software Foundation. | |
10 | */ | |
11 | ||
12 | #include <linux/types.h> | |
13 | #include <linux/netfilter.h> | |
14 | #include <linux/skbuff.h> | |
15 | #include <linux/proc_fs.h> | |
16 | #include <linux/seq_file.h> | |
17 | #include <linux/stddef.h> | |
18 | #include <linux/slab.h> | |
19 | #include <linux/err.h> | |
20 | #include <linux/percpu.h> | |
21 | #include <linux/kernel.h> | |
a71c0855 | 22 | #include <linux/jhash.h> |
d9b93842 | 23 | #include <linux/moduleparam.h> |
bc3b2d7f | 24 | #include <linux/export.h> |
457c4cbc | 25 | #include <net/net_namespace.h> |
77ab9cff MJ |
26 | |
27 | #include <net/netfilter/nf_conntrack.h> | |
28 | #include <net/netfilter/nf_conntrack_core.h> | |
29 | #include <net/netfilter/nf_conntrack_expect.h> | |
30 | #include <net/netfilter/nf_conntrack_helper.h> | |
31 | #include <net/netfilter/nf_conntrack_tuple.h> | |
5d0aa2cc | 32 | #include <net/netfilter/nf_conntrack_zones.h> |
77ab9cff | 33 | |
a71c0855 PM |
34 | unsigned int nf_ct_expect_hsize __read_mostly; |
35 | EXPORT_SYMBOL_GPL(nf_ct_expect_hsize); | |
36 | ||
f264a7df | 37 | unsigned int nf_ct_expect_max __read_mostly; |
a71c0855 | 38 | |
e9c1b084 | 39 | static struct kmem_cache *nf_ct_expect_cachep __read_mostly; |
77ab9cff MJ |
40 | |
41 | /* nf_conntrack_expect helper functions */ | |
ebbf41df PNA |
42 | void nf_ct_unlink_expect_report(struct nf_conntrack_expect *exp, |
43 | u32 pid, int report) | |
77ab9cff MJ |
44 | { |
45 | struct nf_conn_help *master_help = nfct_help(exp->master); | |
9b03f38d | 46 | struct net *net = nf_ct_exp_net(exp); |
77ab9cff | 47 | |
3d058d7b | 48 | NF_CT_ASSERT(master_help); |
77ab9cff MJ |
49 | NF_CT_ASSERT(!timer_pending(&exp->timeout)); |
50 | ||
7d0742da | 51 | hlist_del_rcu(&exp->hnode); |
9b03f38d | 52 | net->ct.expect_count--; |
a71c0855 | 53 | |
b560580a | 54 | hlist_del(&exp->lnode); |
3d058d7b | 55 | master_help->expecting[exp->class]--; |
bc01befd | 56 | |
ebbf41df | 57 | nf_ct_expect_event_report(IPEXP_DESTROY, exp, pid, report); |
6823645d | 58 | nf_ct_expect_put(exp); |
b560580a | 59 | |
0d55af87 | 60 | NF_CT_STAT_INC(net, expect_delete); |
77ab9cff | 61 | } |
ebbf41df | 62 | EXPORT_SYMBOL_GPL(nf_ct_unlink_expect_report); |
77ab9cff | 63 | |
6823645d | 64 | static void nf_ct_expectation_timed_out(unsigned long ul_expect) |
77ab9cff MJ |
65 | { |
66 | struct nf_conntrack_expect *exp = (void *)ul_expect; | |
67 | ||
f8ba1aff | 68 | spin_lock_bh(&nf_conntrack_lock); |
77ab9cff | 69 | nf_ct_unlink_expect(exp); |
f8ba1aff | 70 | spin_unlock_bh(&nf_conntrack_lock); |
6823645d | 71 | nf_ct_expect_put(exp); |
77ab9cff MJ |
72 | } |
73 | ||
a71c0855 PM |
74 | static unsigned int nf_ct_expect_dst_hash(const struct nf_conntrack_tuple *tuple) |
75 | { | |
34498825 PM |
76 | unsigned int hash; |
77 | ||
f682cefa CG |
78 | if (unlikely(!nf_conntrack_hash_rnd)) { |
79 | init_nf_conntrack_hash_rnd(); | |
a71c0855 PM |
80 | } |
81 | ||
34498825 | 82 | hash = jhash2(tuple->dst.u3.all, ARRAY_SIZE(tuple->dst.u3.all), |
a71c0855 | 83 | (((tuple->dst.protonum ^ tuple->src.l3num) << 16) | |
f682cefa | 84 | (__force __u16)tuple->dst.u.all) ^ nf_conntrack_hash_rnd); |
34498825 | 85 | return ((u64)hash * nf_ct_expect_hsize) >> 32; |
a71c0855 PM |
86 | } |
87 | ||
77ab9cff | 88 | struct nf_conntrack_expect * |
5d0aa2cc PM |
89 | __nf_ct_expect_find(struct net *net, u16 zone, |
90 | const struct nf_conntrack_tuple *tuple) | |
77ab9cff MJ |
91 | { |
92 | struct nf_conntrack_expect *i; | |
a71c0855 PM |
93 | struct hlist_node *n; |
94 | unsigned int h; | |
95 | ||
9b03f38d | 96 | if (!net->ct.expect_count) |
a71c0855 | 97 | return NULL; |
77ab9cff | 98 | |
a71c0855 | 99 | h = nf_ct_expect_dst_hash(tuple); |
9b03f38d | 100 | hlist_for_each_entry_rcu(i, n, &net->ct.expect_hash[h], hnode) { |
5d0aa2cc PM |
101 | if (nf_ct_tuple_mask_cmp(tuple, &i->tuple, &i->mask) && |
102 | nf_ct_zone(i->master) == zone) | |
77ab9cff MJ |
103 | return i; |
104 | } | |
105 | return NULL; | |
106 | } | |
6823645d | 107 | EXPORT_SYMBOL_GPL(__nf_ct_expect_find); |
77ab9cff MJ |
108 | |
109 | /* Just find a expectation corresponding to a tuple. */ | |
110 | struct nf_conntrack_expect * | |
5d0aa2cc PM |
111 | nf_ct_expect_find_get(struct net *net, u16 zone, |
112 | const struct nf_conntrack_tuple *tuple) | |
77ab9cff MJ |
113 | { |
114 | struct nf_conntrack_expect *i; | |
115 | ||
7d0742da | 116 | rcu_read_lock(); |
5d0aa2cc | 117 | i = __nf_ct_expect_find(net, zone, tuple); |
7d0742da PM |
118 | if (i && !atomic_inc_not_zero(&i->use)) |
119 | i = NULL; | |
120 | rcu_read_unlock(); | |
77ab9cff MJ |
121 | |
122 | return i; | |
123 | } | |
6823645d | 124 | EXPORT_SYMBOL_GPL(nf_ct_expect_find_get); |
77ab9cff MJ |
125 | |
126 | /* If an expectation for this connection is found, it gets delete from | |
127 | * global list then returned. */ | |
128 | struct nf_conntrack_expect * | |
5d0aa2cc PM |
129 | nf_ct_find_expectation(struct net *net, u16 zone, |
130 | const struct nf_conntrack_tuple *tuple) | |
77ab9cff | 131 | { |
359b9ab6 PM |
132 | struct nf_conntrack_expect *i, *exp = NULL; |
133 | struct hlist_node *n; | |
134 | unsigned int h; | |
135 | ||
9b03f38d | 136 | if (!net->ct.expect_count) |
359b9ab6 | 137 | return NULL; |
ece00641 | 138 | |
359b9ab6 | 139 | h = nf_ct_expect_dst_hash(tuple); |
9b03f38d | 140 | hlist_for_each_entry(i, n, &net->ct.expect_hash[h], hnode) { |
359b9ab6 | 141 | if (!(i->flags & NF_CT_EXPECT_INACTIVE) && |
5d0aa2cc PM |
142 | nf_ct_tuple_mask_cmp(tuple, &i->tuple, &i->mask) && |
143 | nf_ct_zone(i->master) == zone) { | |
359b9ab6 PM |
144 | exp = i; |
145 | break; | |
146 | } | |
147 | } | |
ece00641 YK |
148 | if (!exp) |
149 | return NULL; | |
77ab9cff | 150 | |
77ab9cff MJ |
151 | /* If master is not in hash table yet (ie. packet hasn't left |
152 | this machine yet), how can other end know about expected? | |
153 | Hence these are not the droids you are looking for (if | |
154 | master ct never got confirmed, we'd hold a reference to it | |
155 | and weird things would happen to future packets). */ | |
ece00641 YK |
156 | if (!nf_ct_is_confirmed(exp->master)) |
157 | return NULL; | |
158 | ||
159 | if (exp->flags & NF_CT_EXPECT_PERMANENT) { | |
160 | atomic_inc(&exp->use); | |
161 | return exp; | |
162 | } else if (del_timer(&exp->timeout)) { | |
163 | nf_ct_unlink_expect(exp); | |
164 | return exp; | |
77ab9cff | 165 | } |
ece00641 | 166 | |
77ab9cff MJ |
167 | return NULL; |
168 | } | |
169 | ||
170 | /* delete all expectations for this conntrack */ | |
171 | void nf_ct_remove_expectations(struct nf_conn *ct) | |
172 | { | |
77ab9cff | 173 | struct nf_conn_help *help = nfct_help(ct); |
b560580a PM |
174 | struct nf_conntrack_expect *exp; |
175 | struct hlist_node *n, *next; | |
77ab9cff MJ |
176 | |
177 | /* Optimization: most connection never expect any others. */ | |
6002f266 | 178 | if (!help) |
77ab9cff MJ |
179 | return; |
180 | ||
b560580a PM |
181 | hlist_for_each_entry_safe(exp, n, next, &help->expectations, lnode) { |
182 | if (del_timer(&exp->timeout)) { | |
183 | nf_ct_unlink_expect(exp); | |
184 | nf_ct_expect_put(exp); | |
601e68e1 | 185 | } |
77ab9cff MJ |
186 | } |
187 | } | |
13b18339 | 188 | EXPORT_SYMBOL_GPL(nf_ct_remove_expectations); |
77ab9cff MJ |
189 | |
190 | /* Would two expected things clash? */ | |
191 | static inline int expect_clash(const struct nf_conntrack_expect *a, | |
192 | const struct nf_conntrack_expect *b) | |
193 | { | |
194 | /* Part covered by intersection of masks must be unequal, | |
195 | otherwise they clash */ | |
d4156e8c | 196 | struct nf_conntrack_tuple_mask intersect_mask; |
77ab9cff MJ |
197 | int count; |
198 | ||
77ab9cff | 199 | intersect_mask.src.u.all = a->mask.src.u.all & b->mask.src.u.all; |
77ab9cff MJ |
200 | |
201 | for (count = 0; count < NF_CT_TUPLE_L3SIZE; count++){ | |
202 | intersect_mask.src.u3.all[count] = | |
203 | a->mask.src.u3.all[count] & b->mask.src.u3.all[count]; | |
204 | } | |
205 | ||
77ab9cff MJ |
206 | return nf_ct_tuple_mask_cmp(&a->tuple, &b->tuple, &intersect_mask); |
207 | } | |
208 | ||
209 | static inline int expect_matches(const struct nf_conntrack_expect *a, | |
210 | const struct nf_conntrack_expect *b) | |
211 | { | |
f64f9e71 JP |
212 | return a->master == b->master && a->class == b->class && |
213 | nf_ct_tuple_equal(&a->tuple, &b->tuple) && | |
5d0aa2cc PM |
214 | nf_ct_tuple_mask_equal(&a->mask, &b->mask) && |
215 | nf_ct_zone(a->master) == nf_ct_zone(b->master); | |
77ab9cff MJ |
216 | } |
217 | ||
218 | /* Generally a bad idea to call this: could have matched already. */ | |
6823645d | 219 | void nf_ct_unexpect_related(struct nf_conntrack_expect *exp) |
77ab9cff | 220 | { |
f8ba1aff | 221 | spin_lock_bh(&nf_conntrack_lock); |
4e1d4e6c PM |
222 | if (del_timer(&exp->timeout)) { |
223 | nf_ct_unlink_expect(exp); | |
224 | nf_ct_expect_put(exp); | |
77ab9cff | 225 | } |
f8ba1aff | 226 | spin_unlock_bh(&nf_conntrack_lock); |
77ab9cff | 227 | } |
6823645d | 228 | EXPORT_SYMBOL_GPL(nf_ct_unexpect_related); |
77ab9cff MJ |
229 | |
230 | /* We don't increase the master conntrack refcount for non-fulfilled | |
231 | * conntracks. During the conntrack destruction, the expectations are | |
232 | * always killed before the conntrack itself */ | |
6823645d | 233 | struct nf_conntrack_expect *nf_ct_expect_alloc(struct nf_conn *me) |
77ab9cff MJ |
234 | { |
235 | struct nf_conntrack_expect *new; | |
236 | ||
6823645d | 237 | new = kmem_cache_alloc(nf_ct_expect_cachep, GFP_ATOMIC); |
77ab9cff MJ |
238 | if (!new) |
239 | return NULL; | |
240 | ||
241 | new->master = me; | |
242 | atomic_set(&new->use, 1); | |
243 | return new; | |
244 | } | |
6823645d | 245 | EXPORT_SYMBOL_GPL(nf_ct_expect_alloc); |
77ab9cff | 246 | |
6002f266 | 247 | void nf_ct_expect_init(struct nf_conntrack_expect *exp, unsigned int class, |
76108cea | 248 | u_int8_t family, |
1d9d7522 PM |
249 | const union nf_inet_addr *saddr, |
250 | const union nf_inet_addr *daddr, | |
251 | u_int8_t proto, const __be16 *src, const __be16 *dst) | |
d6a9b650 PM |
252 | { |
253 | int len; | |
254 | ||
255 | if (family == AF_INET) | |
256 | len = 4; | |
257 | else | |
258 | len = 16; | |
259 | ||
260 | exp->flags = 0; | |
6002f266 | 261 | exp->class = class; |
d6a9b650 PM |
262 | exp->expectfn = NULL; |
263 | exp->helper = NULL; | |
264 | exp->tuple.src.l3num = family; | |
265 | exp->tuple.dst.protonum = proto; | |
d6a9b650 PM |
266 | |
267 | if (saddr) { | |
268 | memcpy(&exp->tuple.src.u3, saddr, len); | |
269 | if (sizeof(exp->tuple.src.u3) > len) | |
270 | /* address needs to be cleared for nf_ct_tuple_equal */ | |
271 | memset((void *)&exp->tuple.src.u3 + len, 0x00, | |
272 | sizeof(exp->tuple.src.u3) - len); | |
273 | memset(&exp->mask.src.u3, 0xFF, len); | |
274 | if (sizeof(exp->mask.src.u3) > len) | |
275 | memset((void *)&exp->mask.src.u3 + len, 0x00, | |
276 | sizeof(exp->mask.src.u3) - len); | |
277 | } else { | |
278 | memset(&exp->tuple.src.u3, 0x00, sizeof(exp->tuple.src.u3)); | |
279 | memset(&exp->mask.src.u3, 0x00, sizeof(exp->mask.src.u3)); | |
280 | } | |
281 | ||
d6a9b650 | 282 | if (src) { |
a34c4589 AV |
283 | exp->tuple.src.u.all = *src; |
284 | exp->mask.src.u.all = htons(0xFFFF); | |
d6a9b650 PM |
285 | } else { |
286 | exp->tuple.src.u.all = 0; | |
287 | exp->mask.src.u.all = 0; | |
288 | } | |
289 | ||
d4156e8c PM |
290 | memcpy(&exp->tuple.dst.u3, daddr, len); |
291 | if (sizeof(exp->tuple.dst.u3) > len) | |
292 | /* address needs to be cleared for nf_ct_tuple_equal */ | |
293 | memset((void *)&exp->tuple.dst.u3 + len, 0x00, | |
294 | sizeof(exp->tuple.dst.u3) - len); | |
295 | ||
a34c4589 | 296 | exp->tuple.dst.u.all = *dst; |
d6a9b650 | 297 | } |
6823645d | 298 | EXPORT_SYMBOL_GPL(nf_ct_expect_init); |
d6a9b650 | 299 | |
7d0742da PM |
300 | static void nf_ct_expect_free_rcu(struct rcu_head *head) |
301 | { | |
302 | struct nf_conntrack_expect *exp; | |
303 | ||
304 | exp = container_of(head, struct nf_conntrack_expect, rcu); | |
305 | kmem_cache_free(nf_ct_expect_cachep, exp); | |
306 | } | |
307 | ||
6823645d | 308 | void nf_ct_expect_put(struct nf_conntrack_expect *exp) |
77ab9cff MJ |
309 | { |
310 | if (atomic_dec_and_test(&exp->use)) | |
7d0742da | 311 | call_rcu(&exp->rcu, nf_ct_expect_free_rcu); |
77ab9cff | 312 | } |
6823645d | 313 | EXPORT_SYMBOL_GPL(nf_ct_expect_put); |
77ab9cff | 314 | |
3d058d7b | 315 | static int nf_ct_expect_insert(struct nf_conntrack_expect *exp) |
77ab9cff MJ |
316 | { |
317 | struct nf_conn_help *master_help = nfct_help(exp->master); | |
3d058d7b | 318 | struct nf_conntrack_helper *helper; |
9b03f38d | 319 | struct net *net = nf_ct_exp_net(exp); |
a71c0855 | 320 | unsigned int h = nf_ct_expect_dst_hash(&exp->tuple); |
77ab9cff | 321 | |
3bfd45f9 ED |
322 | /* two references : one for hash insert, one for the timer */ |
323 | atomic_add(2, &exp->use); | |
b560580a | 324 | |
3d058d7b PNA |
325 | hlist_add_head(&exp->lnode, &master_help->expectations); |
326 | master_help->expecting[exp->class]++; | |
a71c0855 | 327 | |
9b03f38d AD |
328 | hlist_add_head_rcu(&exp->hnode, &net->ct.expect_hash[h]); |
329 | net->ct.expect_count++; | |
77ab9cff | 330 | |
6823645d PM |
331 | setup_timer(&exp->timeout, nf_ct_expectation_timed_out, |
332 | (unsigned long)exp); | |
3d058d7b PNA |
333 | helper = rcu_dereference_protected(master_help->helper, |
334 | lockdep_is_held(&nf_conntrack_lock)); | |
335 | if (helper) { | |
336 | exp->timeout.expires = jiffies + | |
337 | helper->expect_policy[exp->class].timeout * HZ; | |
bc01befd | 338 | } |
77ab9cff MJ |
339 | add_timer(&exp->timeout); |
340 | ||
0d55af87 | 341 | NF_CT_STAT_INC(net, expect_create); |
3d058d7b | 342 | return 0; |
77ab9cff MJ |
343 | } |
344 | ||
345 | /* Race with expectations being used means we could have none to find; OK. */ | |
6002f266 PM |
346 | static void evict_oldest_expect(struct nf_conn *master, |
347 | struct nf_conntrack_expect *new) | |
77ab9cff | 348 | { |
b560580a | 349 | struct nf_conn_help *master_help = nfct_help(master); |
6002f266 | 350 | struct nf_conntrack_expect *exp, *last = NULL; |
b560580a | 351 | struct hlist_node *n; |
77ab9cff | 352 | |
6002f266 PM |
353 | hlist_for_each_entry(exp, n, &master_help->expectations, lnode) { |
354 | if (exp->class == new->class) | |
355 | last = exp; | |
356 | } | |
b560580a | 357 | |
6002f266 PM |
358 | if (last && del_timer(&last->timeout)) { |
359 | nf_ct_unlink_expect(last); | |
360 | nf_ct_expect_put(last); | |
77ab9cff MJ |
361 | } |
362 | } | |
363 | ||
364 | static inline int refresh_timer(struct nf_conntrack_expect *i) | |
365 | { | |
366 | struct nf_conn_help *master_help = nfct_help(i->master); | |
6002f266 | 367 | const struct nf_conntrack_expect_policy *p; |
77ab9cff MJ |
368 | |
369 | if (!del_timer(&i->timeout)) | |
370 | return 0; | |
371 | ||
c5d277d2 ED |
372 | p = &rcu_dereference_protected( |
373 | master_help->helper, | |
374 | lockdep_is_held(&nf_conntrack_lock) | |
375 | )->expect_policy[i->class]; | |
6002f266 | 376 | i->timeout.expires = jiffies + p->timeout * HZ; |
77ab9cff MJ |
377 | add_timer(&i->timeout); |
378 | return 1; | |
379 | } | |
380 | ||
19abb7b0 | 381 | static inline int __nf_ct_expect_check(struct nf_conntrack_expect *expect) |
77ab9cff | 382 | { |
6002f266 | 383 | const struct nf_conntrack_expect_policy *p; |
77ab9cff MJ |
384 | struct nf_conntrack_expect *i; |
385 | struct nf_conn *master = expect->master; | |
386 | struct nf_conn_help *master_help = nfct_help(master); | |
3d058d7b | 387 | struct nf_conntrack_helper *helper; |
9b03f38d | 388 | struct net *net = nf_ct_exp_net(expect); |
a71c0855 PM |
389 | struct hlist_node *n; |
390 | unsigned int h; | |
83731671 | 391 | int ret = 1; |
77ab9cff | 392 | |
3d058d7b | 393 | if (!master_help) { |
3c158f7f PM |
394 | ret = -ESHUTDOWN; |
395 | goto out; | |
396 | } | |
a71c0855 | 397 | h = nf_ct_expect_dst_hash(&expect->tuple); |
9b03f38d | 398 | hlist_for_each_entry(i, n, &net->ct.expect_hash[h], hnode) { |
77ab9cff MJ |
399 | if (expect_matches(i, expect)) { |
400 | /* Refresh timer: if it's dying, ignore.. */ | |
401 | if (refresh_timer(i)) { | |
402 | ret = 0; | |
403 | goto out; | |
404 | } | |
405 | } else if (expect_clash(i, expect)) { | |
406 | ret = -EBUSY; | |
407 | goto out; | |
408 | } | |
409 | } | |
410 | /* Will be over limit? */ | |
3d058d7b PNA |
411 | helper = rcu_dereference_protected(master_help->helper, |
412 | lockdep_is_held(&nf_conntrack_lock)); | |
413 | if (helper) { | |
414 | p = &helper->expect_policy[expect->class]; | |
bc01befd PNA |
415 | if (p->max_expected && |
416 | master_help->expecting[expect->class] >= p->max_expected) { | |
417 | evict_oldest_expect(master, expect); | |
418 | if (master_help->expecting[expect->class] | |
419 | >= p->max_expected) { | |
420 | ret = -EMFILE; | |
421 | goto out; | |
422 | } | |
6002f266 PM |
423 | } |
424 | } | |
77ab9cff | 425 | |
9b03f38d | 426 | if (net->ct.expect_count >= nf_ct_expect_max) { |
f264a7df PM |
427 | if (net_ratelimit()) |
428 | printk(KERN_WARNING | |
3d89e9cf | 429 | "nf_conntrack: expectation table full\n"); |
f264a7df | 430 | ret = -EMFILE; |
f264a7df | 431 | } |
19abb7b0 PNA |
432 | out: |
433 | return ret; | |
434 | } | |
435 | ||
83731671 PNA |
436 | int nf_ct_expect_related_report(struct nf_conntrack_expect *expect, |
437 | u32 pid, int report) | |
19abb7b0 PNA |
438 | { |
439 | int ret; | |
440 | ||
441 | spin_lock_bh(&nf_conntrack_lock); | |
442 | ret = __nf_ct_expect_check(expect); | |
83731671 | 443 | if (ret <= 0) |
19abb7b0 | 444 | goto out; |
f264a7df | 445 | |
3d058d7b PNA |
446 | ret = nf_ct_expect_insert(expect); |
447 | if (ret < 0) | |
448 | goto out; | |
f8ba1aff | 449 | spin_unlock_bh(&nf_conntrack_lock); |
83731671 | 450 | nf_ct_expect_event_report(IPEXP_NEW, expect, pid, report); |
77ab9cff | 451 | return ret; |
19abb7b0 PNA |
452 | out: |
453 | spin_unlock_bh(&nf_conntrack_lock); | |
19abb7b0 PNA |
454 | return ret; |
455 | } | |
456 | EXPORT_SYMBOL_GPL(nf_ct_expect_related_report); | |
457 | ||
77ab9cff | 458 | #ifdef CONFIG_PROC_FS |
5d08ad44 | 459 | struct ct_expect_iter_state { |
dc5129f8 | 460 | struct seq_net_private p; |
5d08ad44 PM |
461 | unsigned int bucket; |
462 | }; | |
463 | ||
464 | static struct hlist_node *ct_expect_get_first(struct seq_file *seq) | |
77ab9cff | 465 | { |
dc5129f8 | 466 | struct net *net = seq_file_net(seq); |
5d08ad44 | 467 | struct ct_expect_iter_state *st = seq->private; |
7d0742da | 468 | struct hlist_node *n; |
77ab9cff | 469 | |
5d08ad44 | 470 | for (st->bucket = 0; st->bucket < nf_ct_expect_hsize; st->bucket++) { |
0e60ebe0 | 471 | n = rcu_dereference(hlist_first_rcu(&net->ct.expect_hash[st->bucket])); |
7d0742da PM |
472 | if (n) |
473 | return n; | |
5d08ad44 PM |
474 | } |
475 | return NULL; | |
476 | } | |
77ab9cff | 477 | |
5d08ad44 PM |
478 | static struct hlist_node *ct_expect_get_next(struct seq_file *seq, |
479 | struct hlist_node *head) | |
480 | { | |
dc5129f8 | 481 | struct net *net = seq_file_net(seq); |
5d08ad44 | 482 | struct ct_expect_iter_state *st = seq->private; |
77ab9cff | 483 | |
0e60ebe0 | 484 | head = rcu_dereference(hlist_next_rcu(head)); |
5d08ad44 PM |
485 | while (head == NULL) { |
486 | if (++st->bucket >= nf_ct_expect_hsize) | |
77ab9cff | 487 | return NULL; |
0e60ebe0 | 488 | head = rcu_dereference(hlist_first_rcu(&net->ct.expect_hash[st->bucket])); |
77ab9cff | 489 | } |
5d08ad44 | 490 | return head; |
77ab9cff MJ |
491 | } |
492 | ||
5d08ad44 | 493 | static struct hlist_node *ct_expect_get_idx(struct seq_file *seq, loff_t pos) |
77ab9cff | 494 | { |
5d08ad44 | 495 | struct hlist_node *head = ct_expect_get_first(seq); |
77ab9cff | 496 | |
5d08ad44 PM |
497 | if (head) |
498 | while (pos && (head = ct_expect_get_next(seq, head))) | |
499 | pos--; | |
500 | return pos ? NULL : head; | |
501 | } | |
77ab9cff | 502 | |
5d08ad44 | 503 | static void *exp_seq_start(struct seq_file *seq, loff_t *pos) |
7d0742da | 504 | __acquires(RCU) |
5d08ad44 | 505 | { |
7d0742da | 506 | rcu_read_lock(); |
5d08ad44 PM |
507 | return ct_expect_get_idx(seq, *pos); |
508 | } | |
77ab9cff | 509 | |
5d08ad44 PM |
510 | static void *exp_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
511 | { | |
512 | (*pos)++; | |
513 | return ct_expect_get_next(seq, v); | |
77ab9cff MJ |
514 | } |
515 | ||
5d08ad44 | 516 | static void exp_seq_stop(struct seq_file *seq, void *v) |
7d0742da | 517 | __releases(RCU) |
77ab9cff | 518 | { |
7d0742da | 519 | rcu_read_unlock(); |
77ab9cff MJ |
520 | } |
521 | ||
522 | static int exp_seq_show(struct seq_file *s, void *v) | |
523 | { | |
5d08ad44 | 524 | struct nf_conntrack_expect *expect; |
b87921bd | 525 | struct nf_conntrack_helper *helper; |
5d08ad44 | 526 | struct hlist_node *n = v; |
359b9ab6 | 527 | char *delim = ""; |
5d08ad44 PM |
528 | |
529 | expect = hlist_entry(n, struct nf_conntrack_expect, hnode); | |
77ab9cff MJ |
530 | |
531 | if (expect->timeout.function) | |
532 | seq_printf(s, "%ld ", timer_pending(&expect->timeout) | |
533 | ? (long)(expect->timeout.expires - jiffies)/HZ : 0); | |
534 | else | |
535 | seq_printf(s, "- "); | |
536 | seq_printf(s, "l3proto = %u proto=%u ", | |
537 | expect->tuple.src.l3num, | |
538 | expect->tuple.dst.protonum); | |
539 | print_tuple(s, &expect->tuple, | |
540 | __nf_ct_l3proto_find(expect->tuple.src.l3num), | |
605dcad6 | 541 | __nf_ct_l4proto_find(expect->tuple.src.l3num, |
77ab9cff | 542 | expect->tuple.dst.protonum)); |
4bb119ea | 543 | |
359b9ab6 PM |
544 | if (expect->flags & NF_CT_EXPECT_PERMANENT) { |
545 | seq_printf(s, "PERMANENT"); | |
546 | delim = ","; | |
547 | } | |
bc01befd | 548 | if (expect->flags & NF_CT_EXPECT_INACTIVE) { |
359b9ab6 | 549 | seq_printf(s, "%sINACTIVE", delim); |
bc01befd PNA |
550 | delim = ","; |
551 | } | |
552 | if (expect->flags & NF_CT_EXPECT_USERSPACE) | |
553 | seq_printf(s, "%sUSERSPACE", delim); | |
4bb119ea | 554 | |
b87921bd PM |
555 | helper = rcu_dereference(nfct_help(expect->master)->helper); |
556 | if (helper) { | |
557 | seq_printf(s, "%s%s", expect->flags ? " " : "", helper->name); | |
558 | if (helper->expect_policy[expect->class].name) | |
559 | seq_printf(s, "/%s", | |
560 | helper->expect_policy[expect->class].name); | |
561 | } | |
562 | ||
77ab9cff MJ |
563 | return seq_putc(s, '\n'); |
564 | } | |
565 | ||
56b3d975 | 566 | static const struct seq_operations exp_seq_ops = { |
77ab9cff MJ |
567 | .start = exp_seq_start, |
568 | .next = exp_seq_next, | |
569 | .stop = exp_seq_stop, | |
570 | .show = exp_seq_show | |
571 | }; | |
572 | ||
573 | static int exp_open(struct inode *inode, struct file *file) | |
574 | { | |
dc5129f8 | 575 | return seq_open_net(inode, file, &exp_seq_ops, |
e2da5913 | 576 | sizeof(struct ct_expect_iter_state)); |
77ab9cff MJ |
577 | } |
578 | ||
5d08ad44 | 579 | static const struct file_operations exp_file_ops = { |
77ab9cff MJ |
580 | .owner = THIS_MODULE, |
581 | .open = exp_open, | |
582 | .read = seq_read, | |
583 | .llseek = seq_lseek, | |
dc5129f8 | 584 | .release = seq_release_net, |
77ab9cff MJ |
585 | }; |
586 | #endif /* CONFIG_PROC_FS */ | |
e9c1b084 | 587 | |
dc5129f8 | 588 | static int exp_proc_init(struct net *net) |
e9c1b084 PM |
589 | { |
590 | #ifdef CONFIG_PROC_FS | |
591 | struct proc_dir_entry *proc; | |
592 | ||
dc5129f8 | 593 | proc = proc_net_fops_create(net, "nf_conntrack_expect", 0440, &exp_file_ops); |
e9c1b084 PM |
594 | if (!proc) |
595 | return -ENOMEM; | |
596 | #endif /* CONFIG_PROC_FS */ | |
597 | return 0; | |
598 | } | |
599 | ||
dc5129f8 | 600 | static void exp_proc_remove(struct net *net) |
e9c1b084 PM |
601 | { |
602 | #ifdef CONFIG_PROC_FS | |
dc5129f8 | 603 | proc_net_remove(net, "nf_conntrack_expect"); |
e9c1b084 PM |
604 | #endif /* CONFIG_PROC_FS */ |
605 | } | |
606 | ||
13ccdfc2 | 607 | module_param_named(expect_hashsize, nf_ct_expect_hsize, uint, 0400); |
a71c0855 | 608 | |
9b03f38d | 609 | int nf_conntrack_expect_init(struct net *net) |
e9c1b084 | 610 | { |
a71c0855 PM |
611 | int err = -ENOMEM; |
612 | ||
08f6547d AD |
613 | if (net_eq(net, &init_net)) { |
614 | if (!nf_ct_expect_hsize) { | |
d696c7bd | 615 | nf_ct_expect_hsize = net->ct.htable_size / 256; |
08f6547d AD |
616 | if (!nf_ct_expect_hsize) |
617 | nf_ct_expect_hsize = 1; | |
618 | } | |
619 | nf_ct_expect_max = nf_ct_expect_hsize * 4; | |
a71c0855 PM |
620 | } |
621 | ||
9b03f38d | 622 | net->ct.expect_count = 0; |
d862a662 | 623 | net->ct.expect_hash = nf_ct_alloc_hashtable(&nf_ct_expect_hsize, 0); |
9b03f38d | 624 | if (net->ct.expect_hash == NULL) |
a71c0855 | 625 | goto err1; |
e9c1b084 | 626 | |
08f6547d AD |
627 | if (net_eq(net, &init_net)) { |
628 | nf_ct_expect_cachep = kmem_cache_create("nf_conntrack_expect", | |
e9c1b084 | 629 | sizeof(struct nf_conntrack_expect), |
20c2df83 | 630 | 0, 0, NULL); |
08f6547d AD |
631 | if (!nf_ct_expect_cachep) |
632 | goto err2; | |
633 | } | |
e9c1b084 | 634 | |
dc5129f8 | 635 | err = exp_proc_init(net); |
e9c1b084 | 636 | if (err < 0) |
a71c0855 | 637 | goto err3; |
e9c1b084 PM |
638 | |
639 | return 0; | |
640 | ||
a71c0855 | 641 | err3: |
08f6547d AD |
642 | if (net_eq(net, &init_net)) |
643 | kmem_cache_destroy(nf_ct_expect_cachep); | |
12293bf9 | 644 | err2: |
d862a662 | 645 | nf_ct_free_hashtable(net->ct.expect_hash, nf_ct_expect_hsize); |
a71c0855 | 646 | err1: |
e9c1b084 PM |
647 | return err; |
648 | } | |
649 | ||
9b03f38d | 650 | void nf_conntrack_expect_fini(struct net *net) |
e9c1b084 | 651 | { |
dc5129f8 | 652 | exp_proc_remove(net); |
308ff823 JDB |
653 | if (net_eq(net, &init_net)) { |
654 | rcu_barrier(); /* Wait for call_rcu() before destroy */ | |
08f6547d | 655 | kmem_cache_destroy(nf_ct_expect_cachep); |
308ff823 | 656 | } |
d862a662 | 657 | nf_ct_free_hashtable(net->ct.expect_hash, nf_ct_expect_hsize); |
e9c1b084 | 658 | } |