]>
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> |
457c4cbc | 23 | #include <net/net_namespace.h> |
77ab9cff MJ |
24 | |
25 | #include <net/netfilter/nf_conntrack.h> | |
26 | #include <net/netfilter/nf_conntrack_core.h> | |
27 | #include <net/netfilter/nf_conntrack_expect.h> | |
28 | #include <net/netfilter/nf_conntrack_helper.h> | |
29 | #include <net/netfilter/nf_conntrack_tuple.h> | |
30 | ||
a71c0855 PM |
31 | struct hlist_head *nf_ct_expect_hash __read_mostly; |
32 | EXPORT_SYMBOL_GPL(nf_ct_expect_hash); | |
33 | ||
34 | unsigned int nf_ct_expect_hsize __read_mostly; | |
35 | EXPORT_SYMBOL_GPL(nf_ct_expect_hsize); | |
36 | ||
37 | static unsigned int nf_ct_expect_hash_rnd __read_mostly; | |
38 | static unsigned int nf_ct_expect_count; | |
f264a7df | 39 | unsigned int nf_ct_expect_max __read_mostly; |
a71c0855 PM |
40 | static int nf_ct_expect_hash_rnd_initted __read_mostly; |
41 | static int nf_ct_expect_vmalloc; | |
42 | ||
e9c1b084 | 43 | static struct kmem_cache *nf_ct_expect_cachep __read_mostly; |
77ab9cff MJ |
44 | |
45 | /* nf_conntrack_expect helper functions */ | |
46 | void nf_ct_unlink_expect(struct nf_conntrack_expect *exp) | |
47 | { | |
48 | struct nf_conn_help *master_help = nfct_help(exp->master); | |
49 | ||
50 | NF_CT_ASSERT(master_help); | |
51 | NF_CT_ASSERT(!timer_pending(&exp->timeout)); | |
52 | ||
7d0742da | 53 | hlist_del_rcu(&exp->hnode); |
a71c0855 PM |
54 | nf_ct_expect_count--; |
55 | ||
b560580a | 56 | hlist_del(&exp->lnode); |
77ab9cff | 57 | master_help->expecting--; |
6823645d | 58 | nf_ct_expect_put(exp); |
b560580a PM |
59 | |
60 | NF_CT_STAT_INC(expect_delete); | |
77ab9cff | 61 | } |
13b18339 | 62 | EXPORT_SYMBOL_GPL(nf_ct_unlink_expect); |
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 | ||
a71c0855 PM |
78 | if (unlikely(!nf_ct_expect_hash_rnd_initted)) { |
79 | get_random_bytes(&nf_ct_expect_hash_rnd, 4); | |
80 | nf_ct_expect_hash_rnd_initted = 1; | |
81 | } | |
82 | ||
34498825 | 83 | hash = jhash2(tuple->dst.u3.all, ARRAY_SIZE(tuple->dst.u3.all), |
a71c0855 | 84 | (((tuple->dst.protonum ^ tuple->src.l3num) << 16) | |
34498825 PM |
85 | (__force __u16)tuple->dst.u.all) ^ nf_ct_expect_hash_rnd); |
86 | return ((u64)hash * nf_ct_expect_hsize) >> 32; | |
a71c0855 PM |
87 | } |
88 | ||
77ab9cff | 89 | struct nf_conntrack_expect * |
6823645d | 90 | __nf_ct_expect_find(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 | ||
96 | if (!nf_ct_expect_count) | |
97 | return NULL; | |
77ab9cff | 98 | |
a71c0855 | 99 | h = nf_ct_expect_dst_hash(tuple); |
7d0742da | 100 | hlist_for_each_entry_rcu(i, n, &nf_ct_expect_hash[h], hnode) { |
77ab9cff MJ |
101 | if (nf_ct_tuple_mask_cmp(tuple, &i->tuple, &i->mask)) |
102 | return i; | |
103 | } | |
104 | return NULL; | |
105 | } | |
6823645d | 106 | EXPORT_SYMBOL_GPL(__nf_ct_expect_find); |
77ab9cff MJ |
107 | |
108 | /* Just find a expectation corresponding to a tuple. */ | |
109 | struct nf_conntrack_expect * | |
6823645d | 110 | nf_ct_expect_find_get(const struct nf_conntrack_tuple *tuple) |
77ab9cff MJ |
111 | { |
112 | struct nf_conntrack_expect *i; | |
113 | ||
7d0742da | 114 | rcu_read_lock(); |
6823645d | 115 | i = __nf_ct_expect_find(tuple); |
7d0742da PM |
116 | if (i && !atomic_inc_not_zero(&i->use)) |
117 | i = NULL; | |
118 | rcu_read_unlock(); | |
77ab9cff MJ |
119 | |
120 | return i; | |
121 | } | |
6823645d | 122 | EXPORT_SYMBOL_GPL(nf_ct_expect_find_get); |
77ab9cff MJ |
123 | |
124 | /* If an expectation for this connection is found, it gets delete from | |
125 | * global list then returned. */ | |
126 | struct nf_conntrack_expect * | |
6823645d | 127 | nf_ct_find_expectation(const struct nf_conntrack_tuple *tuple) |
77ab9cff | 128 | { |
359b9ab6 PM |
129 | struct nf_conntrack_expect *i, *exp = NULL; |
130 | struct hlist_node *n; | |
131 | unsigned int h; | |
132 | ||
133 | if (!nf_ct_expect_count) | |
134 | return NULL; | |
ece00641 | 135 | |
359b9ab6 PM |
136 | h = nf_ct_expect_dst_hash(tuple); |
137 | hlist_for_each_entry(i, n, &nf_ct_expect_hash[h], hnode) { | |
138 | if (!(i->flags & NF_CT_EXPECT_INACTIVE) && | |
139 | nf_ct_tuple_mask_cmp(tuple, &i->tuple, &i->mask)) { | |
140 | exp = i; | |
141 | break; | |
142 | } | |
143 | } | |
ece00641 YK |
144 | if (!exp) |
145 | return NULL; | |
77ab9cff | 146 | |
77ab9cff MJ |
147 | /* If master is not in hash table yet (ie. packet hasn't left |
148 | this machine yet), how can other end know about expected? | |
149 | Hence these are not the droids you are looking for (if | |
150 | master ct never got confirmed, we'd hold a reference to it | |
151 | and weird things would happen to future packets). */ | |
ece00641 YK |
152 | if (!nf_ct_is_confirmed(exp->master)) |
153 | return NULL; | |
154 | ||
155 | if (exp->flags & NF_CT_EXPECT_PERMANENT) { | |
156 | atomic_inc(&exp->use); | |
157 | return exp; | |
158 | } else if (del_timer(&exp->timeout)) { | |
159 | nf_ct_unlink_expect(exp); | |
160 | return exp; | |
77ab9cff | 161 | } |
ece00641 | 162 | |
77ab9cff MJ |
163 | return NULL; |
164 | } | |
165 | ||
166 | /* delete all expectations for this conntrack */ | |
167 | void nf_ct_remove_expectations(struct nf_conn *ct) | |
168 | { | |
77ab9cff | 169 | struct nf_conn_help *help = nfct_help(ct); |
b560580a PM |
170 | struct nf_conntrack_expect *exp; |
171 | struct hlist_node *n, *next; | |
77ab9cff MJ |
172 | |
173 | /* Optimization: most connection never expect any others. */ | |
174 | if (!help || help->expecting == 0) | |
175 | return; | |
176 | ||
b560580a PM |
177 | hlist_for_each_entry_safe(exp, n, next, &help->expectations, lnode) { |
178 | if (del_timer(&exp->timeout)) { | |
179 | nf_ct_unlink_expect(exp); | |
180 | nf_ct_expect_put(exp); | |
601e68e1 | 181 | } |
77ab9cff MJ |
182 | } |
183 | } | |
13b18339 | 184 | EXPORT_SYMBOL_GPL(nf_ct_remove_expectations); |
77ab9cff MJ |
185 | |
186 | /* Would two expected things clash? */ | |
187 | static inline int expect_clash(const struct nf_conntrack_expect *a, | |
188 | const struct nf_conntrack_expect *b) | |
189 | { | |
190 | /* Part covered by intersection of masks must be unequal, | |
191 | otherwise they clash */ | |
d4156e8c | 192 | struct nf_conntrack_tuple_mask intersect_mask; |
77ab9cff MJ |
193 | int count; |
194 | ||
77ab9cff | 195 | intersect_mask.src.u.all = a->mask.src.u.all & b->mask.src.u.all; |
77ab9cff MJ |
196 | |
197 | for (count = 0; count < NF_CT_TUPLE_L3SIZE; count++){ | |
198 | intersect_mask.src.u3.all[count] = | |
199 | a->mask.src.u3.all[count] & b->mask.src.u3.all[count]; | |
200 | } | |
201 | ||
77ab9cff MJ |
202 | return nf_ct_tuple_mask_cmp(&a->tuple, &b->tuple, &intersect_mask); |
203 | } | |
204 | ||
205 | static inline int expect_matches(const struct nf_conntrack_expect *a, | |
206 | const struct nf_conntrack_expect *b) | |
207 | { | |
208 | return a->master == b->master | |
209 | && nf_ct_tuple_equal(&a->tuple, &b->tuple) | |
d4156e8c | 210 | && nf_ct_tuple_mask_equal(&a->mask, &b->mask); |
77ab9cff MJ |
211 | } |
212 | ||
213 | /* Generally a bad idea to call this: could have matched already. */ | |
6823645d | 214 | void nf_ct_unexpect_related(struct nf_conntrack_expect *exp) |
77ab9cff | 215 | { |
f8ba1aff | 216 | spin_lock_bh(&nf_conntrack_lock); |
4e1d4e6c PM |
217 | if (del_timer(&exp->timeout)) { |
218 | nf_ct_unlink_expect(exp); | |
219 | nf_ct_expect_put(exp); | |
77ab9cff | 220 | } |
f8ba1aff | 221 | spin_unlock_bh(&nf_conntrack_lock); |
77ab9cff | 222 | } |
6823645d | 223 | EXPORT_SYMBOL_GPL(nf_ct_unexpect_related); |
77ab9cff MJ |
224 | |
225 | /* We don't increase the master conntrack refcount for non-fulfilled | |
226 | * conntracks. During the conntrack destruction, the expectations are | |
227 | * always killed before the conntrack itself */ | |
6823645d | 228 | struct nf_conntrack_expect *nf_ct_expect_alloc(struct nf_conn *me) |
77ab9cff MJ |
229 | { |
230 | struct nf_conntrack_expect *new; | |
231 | ||
6823645d | 232 | new = kmem_cache_alloc(nf_ct_expect_cachep, GFP_ATOMIC); |
77ab9cff MJ |
233 | if (!new) |
234 | return NULL; | |
235 | ||
236 | new->master = me; | |
237 | atomic_set(&new->use, 1); | |
7d0742da | 238 | INIT_RCU_HEAD(&new->rcu); |
77ab9cff MJ |
239 | return new; |
240 | } | |
6823645d | 241 | EXPORT_SYMBOL_GPL(nf_ct_expect_alloc); |
77ab9cff | 242 | |
6823645d | 243 | void nf_ct_expect_init(struct nf_conntrack_expect *exp, int family, |
1d9d7522 PM |
244 | const union nf_inet_addr *saddr, |
245 | const union nf_inet_addr *daddr, | |
246 | u_int8_t proto, const __be16 *src, const __be16 *dst) | |
d6a9b650 PM |
247 | { |
248 | int len; | |
249 | ||
250 | if (family == AF_INET) | |
251 | len = 4; | |
252 | else | |
253 | len = 16; | |
254 | ||
255 | exp->flags = 0; | |
256 | exp->expectfn = NULL; | |
257 | exp->helper = NULL; | |
258 | exp->tuple.src.l3num = family; | |
259 | exp->tuple.dst.protonum = proto; | |
d6a9b650 PM |
260 | |
261 | if (saddr) { | |
262 | memcpy(&exp->tuple.src.u3, saddr, len); | |
263 | if (sizeof(exp->tuple.src.u3) > len) | |
264 | /* address needs to be cleared for nf_ct_tuple_equal */ | |
265 | memset((void *)&exp->tuple.src.u3 + len, 0x00, | |
266 | sizeof(exp->tuple.src.u3) - len); | |
267 | memset(&exp->mask.src.u3, 0xFF, len); | |
268 | if (sizeof(exp->mask.src.u3) > len) | |
269 | memset((void *)&exp->mask.src.u3 + len, 0x00, | |
270 | sizeof(exp->mask.src.u3) - len); | |
271 | } else { | |
272 | memset(&exp->tuple.src.u3, 0x00, sizeof(exp->tuple.src.u3)); | |
273 | memset(&exp->mask.src.u3, 0x00, sizeof(exp->mask.src.u3)); | |
274 | } | |
275 | ||
d6a9b650 | 276 | if (src) { |
a34c4589 AV |
277 | exp->tuple.src.u.all = *src; |
278 | exp->mask.src.u.all = htons(0xFFFF); | |
d6a9b650 PM |
279 | } else { |
280 | exp->tuple.src.u.all = 0; | |
281 | exp->mask.src.u.all = 0; | |
282 | } | |
283 | ||
d4156e8c PM |
284 | memcpy(&exp->tuple.dst.u3, daddr, len); |
285 | if (sizeof(exp->tuple.dst.u3) > len) | |
286 | /* address needs to be cleared for nf_ct_tuple_equal */ | |
287 | memset((void *)&exp->tuple.dst.u3 + len, 0x00, | |
288 | sizeof(exp->tuple.dst.u3) - len); | |
289 | ||
a34c4589 | 290 | exp->tuple.dst.u.all = *dst; |
d6a9b650 | 291 | } |
6823645d | 292 | EXPORT_SYMBOL_GPL(nf_ct_expect_init); |
d6a9b650 | 293 | |
7d0742da PM |
294 | static void nf_ct_expect_free_rcu(struct rcu_head *head) |
295 | { | |
296 | struct nf_conntrack_expect *exp; | |
297 | ||
298 | exp = container_of(head, struct nf_conntrack_expect, rcu); | |
299 | kmem_cache_free(nf_ct_expect_cachep, exp); | |
300 | } | |
301 | ||
6823645d | 302 | void nf_ct_expect_put(struct nf_conntrack_expect *exp) |
77ab9cff MJ |
303 | { |
304 | if (atomic_dec_and_test(&exp->use)) | |
7d0742da | 305 | call_rcu(&exp->rcu, nf_ct_expect_free_rcu); |
77ab9cff | 306 | } |
6823645d | 307 | EXPORT_SYMBOL_GPL(nf_ct_expect_put); |
77ab9cff | 308 | |
6823645d | 309 | static void nf_ct_expect_insert(struct nf_conntrack_expect *exp) |
77ab9cff MJ |
310 | { |
311 | struct nf_conn_help *master_help = nfct_help(exp->master); | |
a71c0855 | 312 | unsigned int h = nf_ct_expect_dst_hash(&exp->tuple); |
77ab9cff MJ |
313 | |
314 | atomic_inc(&exp->use); | |
b560580a PM |
315 | |
316 | hlist_add_head(&exp->lnode, &master_help->expectations); | |
77ab9cff | 317 | master_help->expecting++; |
a71c0855 | 318 | |
7d0742da | 319 | hlist_add_head_rcu(&exp->hnode, &nf_ct_expect_hash[h]); |
a71c0855 | 320 | nf_ct_expect_count++; |
77ab9cff | 321 | |
6823645d PM |
322 | setup_timer(&exp->timeout, nf_ct_expectation_timed_out, |
323 | (unsigned long)exp); | |
77ab9cff MJ |
324 | exp->timeout.expires = jiffies + master_help->helper->timeout * HZ; |
325 | add_timer(&exp->timeout); | |
326 | ||
77ab9cff MJ |
327 | atomic_inc(&exp->use); |
328 | NF_CT_STAT_INC(expect_create); | |
329 | } | |
330 | ||
331 | /* Race with expectations being used means we could have none to find; OK. */ | |
332 | static void evict_oldest_expect(struct nf_conn *master) | |
333 | { | |
b560580a PM |
334 | struct nf_conn_help *master_help = nfct_help(master); |
335 | struct nf_conntrack_expect *exp = NULL; | |
336 | struct hlist_node *n; | |
77ab9cff | 337 | |
b560580a PM |
338 | hlist_for_each_entry(exp, n, &master_help->expectations, lnode) |
339 | ; /* nothing */ | |
340 | ||
341 | if (exp && del_timer(&exp->timeout)) { | |
342 | nf_ct_unlink_expect(exp); | |
343 | nf_ct_expect_put(exp); | |
77ab9cff MJ |
344 | } |
345 | } | |
346 | ||
347 | static inline int refresh_timer(struct nf_conntrack_expect *i) | |
348 | { | |
349 | struct nf_conn_help *master_help = nfct_help(i->master); | |
350 | ||
351 | if (!del_timer(&i->timeout)) | |
352 | return 0; | |
353 | ||
354 | i->timeout.expires = jiffies + master_help->helper->timeout*HZ; | |
355 | add_timer(&i->timeout); | |
356 | return 1; | |
357 | } | |
358 | ||
6823645d | 359 | int nf_ct_expect_related(struct nf_conntrack_expect *expect) |
77ab9cff MJ |
360 | { |
361 | struct nf_conntrack_expect *i; | |
362 | struct nf_conn *master = expect->master; | |
363 | struct nf_conn_help *master_help = nfct_help(master); | |
a71c0855 PM |
364 | struct hlist_node *n; |
365 | unsigned int h; | |
77ab9cff MJ |
366 | int ret; |
367 | ||
368 | NF_CT_ASSERT(master_help); | |
369 | ||
f8ba1aff | 370 | spin_lock_bh(&nf_conntrack_lock); |
3c158f7f PM |
371 | if (!master_help->helper) { |
372 | ret = -ESHUTDOWN; | |
373 | goto out; | |
374 | } | |
a71c0855 PM |
375 | h = nf_ct_expect_dst_hash(&expect->tuple); |
376 | hlist_for_each_entry(i, n, &nf_ct_expect_hash[h], hnode) { | |
77ab9cff MJ |
377 | if (expect_matches(i, expect)) { |
378 | /* Refresh timer: if it's dying, ignore.. */ | |
379 | if (refresh_timer(i)) { | |
380 | ret = 0; | |
381 | goto out; | |
382 | } | |
383 | } else if (expect_clash(i, expect)) { | |
384 | ret = -EBUSY; | |
385 | goto out; | |
386 | } | |
387 | } | |
388 | /* Will be over limit? */ | |
389 | if (master_help->helper->max_expected && | |
390 | master_help->expecting >= master_help->helper->max_expected) | |
391 | evict_oldest_expect(master); | |
392 | ||
f264a7df PM |
393 | if (nf_ct_expect_count >= nf_ct_expect_max) { |
394 | if (net_ratelimit()) | |
395 | printk(KERN_WARNING | |
3d89e9cf | 396 | "nf_conntrack: expectation table full\n"); |
f264a7df PM |
397 | ret = -EMFILE; |
398 | goto out; | |
399 | } | |
400 | ||
6823645d PM |
401 | nf_ct_expect_insert(expect); |
402 | nf_ct_expect_event(IPEXP_NEW, expect); | |
77ab9cff MJ |
403 | ret = 0; |
404 | out: | |
f8ba1aff | 405 | spin_unlock_bh(&nf_conntrack_lock); |
77ab9cff MJ |
406 | return ret; |
407 | } | |
6823645d | 408 | EXPORT_SYMBOL_GPL(nf_ct_expect_related); |
77ab9cff MJ |
409 | |
410 | #ifdef CONFIG_PROC_FS | |
5d08ad44 PM |
411 | struct ct_expect_iter_state { |
412 | unsigned int bucket; | |
413 | }; | |
414 | ||
415 | static struct hlist_node *ct_expect_get_first(struct seq_file *seq) | |
77ab9cff | 416 | { |
5d08ad44 | 417 | struct ct_expect_iter_state *st = seq->private; |
7d0742da | 418 | struct hlist_node *n; |
77ab9cff | 419 | |
5d08ad44 | 420 | for (st->bucket = 0; st->bucket < nf_ct_expect_hsize; st->bucket++) { |
7d0742da PM |
421 | n = rcu_dereference(nf_ct_expect_hash[st->bucket].first); |
422 | if (n) | |
423 | return n; | |
5d08ad44 PM |
424 | } |
425 | return NULL; | |
426 | } | |
77ab9cff | 427 | |
5d08ad44 PM |
428 | static struct hlist_node *ct_expect_get_next(struct seq_file *seq, |
429 | struct hlist_node *head) | |
430 | { | |
431 | struct ct_expect_iter_state *st = seq->private; | |
77ab9cff | 432 | |
7d0742da | 433 | head = rcu_dereference(head->next); |
5d08ad44 PM |
434 | while (head == NULL) { |
435 | if (++st->bucket >= nf_ct_expect_hsize) | |
77ab9cff | 436 | return NULL; |
7d0742da | 437 | head = rcu_dereference(nf_ct_expect_hash[st->bucket].first); |
77ab9cff | 438 | } |
5d08ad44 | 439 | return head; |
77ab9cff MJ |
440 | } |
441 | ||
5d08ad44 | 442 | static struct hlist_node *ct_expect_get_idx(struct seq_file *seq, loff_t pos) |
77ab9cff | 443 | { |
5d08ad44 | 444 | struct hlist_node *head = ct_expect_get_first(seq); |
77ab9cff | 445 | |
5d08ad44 PM |
446 | if (head) |
447 | while (pos && (head = ct_expect_get_next(seq, head))) | |
448 | pos--; | |
449 | return pos ? NULL : head; | |
450 | } | |
77ab9cff | 451 | |
5d08ad44 | 452 | static void *exp_seq_start(struct seq_file *seq, loff_t *pos) |
7d0742da | 453 | __acquires(RCU) |
5d08ad44 | 454 | { |
7d0742da | 455 | rcu_read_lock(); |
5d08ad44 PM |
456 | return ct_expect_get_idx(seq, *pos); |
457 | } | |
77ab9cff | 458 | |
5d08ad44 PM |
459 | static void *exp_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
460 | { | |
461 | (*pos)++; | |
462 | return ct_expect_get_next(seq, v); | |
77ab9cff MJ |
463 | } |
464 | ||
5d08ad44 | 465 | static void exp_seq_stop(struct seq_file *seq, void *v) |
7d0742da | 466 | __releases(RCU) |
77ab9cff | 467 | { |
7d0742da | 468 | rcu_read_unlock(); |
77ab9cff MJ |
469 | } |
470 | ||
471 | static int exp_seq_show(struct seq_file *s, void *v) | |
472 | { | |
5d08ad44 PM |
473 | struct nf_conntrack_expect *expect; |
474 | struct hlist_node *n = v; | |
359b9ab6 | 475 | char *delim = ""; |
5d08ad44 PM |
476 | |
477 | expect = hlist_entry(n, struct nf_conntrack_expect, hnode); | |
77ab9cff MJ |
478 | |
479 | if (expect->timeout.function) | |
480 | seq_printf(s, "%ld ", timer_pending(&expect->timeout) | |
481 | ? (long)(expect->timeout.expires - jiffies)/HZ : 0); | |
482 | else | |
483 | seq_printf(s, "- "); | |
484 | seq_printf(s, "l3proto = %u proto=%u ", | |
485 | expect->tuple.src.l3num, | |
486 | expect->tuple.dst.protonum); | |
487 | print_tuple(s, &expect->tuple, | |
488 | __nf_ct_l3proto_find(expect->tuple.src.l3num), | |
605dcad6 | 489 | __nf_ct_l4proto_find(expect->tuple.src.l3num, |
77ab9cff | 490 | expect->tuple.dst.protonum)); |
4bb119ea | 491 | |
359b9ab6 PM |
492 | if (expect->flags & NF_CT_EXPECT_PERMANENT) { |
493 | seq_printf(s, "PERMANENT"); | |
494 | delim = ","; | |
495 | } | |
496 | if (expect->flags & NF_CT_EXPECT_INACTIVE) | |
497 | seq_printf(s, "%sINACTIVE", delim); | |
4bb119ea | 498 | |
77ab9cff MJ |
499 | return seq_putc(s, '\n'); |
500 | } | |
501 | ||
56b3d975 | 502 | static const struct seq_operations exp_seq_ops = { |
77ab9cff MJ |
503 | .start = exp_seq_start, |
504 | .next = exp_seq_next, | |
505 | .stop = exp_seq_stop, | |
506 | .show = exp_seq_show | |
507 | }; | |
508 | ||
509 | static int exp_open(struct inode *inode, struct file *file) | |
510 | { | |
e2da5913 PE |
511 | return seq_open_private(file, &exp_seq_ops, |
512 | sizeof(struct ct_expect_iter_state)); | |
77ab9cff MJ |
513 | } |
514 | ||
5d08ad44 | 515 | static const struct file_operations exp_file_ops = { |
77ab9cff MJ |
516 | .owner = THIS_MODULE, |
517 | .open = exp_open, | |
518 | .read = seq_read, | |
519 | .llseek = seq_lseek, | |
5d08ad44 | 520 | .release = seq_release_private, |
77ab9cff MJ |
521 | }; |
522 | #endif /* CONFIG_PROC_FS */ | |
e9c1b084 PM |
523 | |
524 | static int __init exp_proc_init(void) | |
525 | { | |
526 | #ifdef CONFIG_PROC_FS | |
527 | struct proc_dir_entry *proc; | |
528 | ||
457c4cbc | 529 | proc = proc_net_fops_create(&init_net, "nf_conntrack_expect", 0440, &exp_file_ops); |
e9c1b084 PM |
530 | if (!proc) |
531 | return -ENOMEM; | |
532 | #endif /* CONFIG_PROC_FS */ | |
533 | return 0; | |
534 | } | |
535 | ||
536 | static void exp_proc_remove(void) | |
537 | { | |
538 | #ifdef CONFIG_PROC_FS | |
457c4cbc | 539 | proc_net_remove(&init_net, "nf_conntrack_expect"); |
e9c1b084 PM |
540 | #endif /* CONFIG_PROC_FS */ |
541 | } | |
542 | ||
a71c0855 PM |
543 | module_param_named(expect_hashsize, nf_ct_expect_hsize, uint, 0600); |
544 | ||
e9c1b084 PM |
545 | int __init nf_conntrack_expect_init(void) |
546 | { | |
a71c0855 PM |
547 | int err = -ENOMEM; |
548 | ||
549 | if (!nf_ct_expect_hsize) { | |
550 | nf_ct_expect_hsize = nf_conntrack_htable_size / 256; | |
551 | if (!nf_ct_expect_hsize) | |
552 | nf_ct_expect_hsize = 1; | |
553 | } | |
f264a7df | 554 | nf_ct_expect_max = nf_ct_expect_hsize * 4; |
a71c0855 PM |
555 | |
556 | nf_ct_expect_hash = nf_ct_alloc_hashtable(&nf_ct_expect_hsize, | |
557 | &nf_ct_expect_vmalloc); | |
558 | if (nf_ct_expect_hash == NULL) | |
559 | goto err1; | |
e9c1b084 PM |
560 | |
561 | nf_ct_expect_cachep = kmem_cache_create("nf_conntrack_expect", | |
562 | sizeof(struct nf_conntrack_expect), | |
20c2df83 | 563 | 0, 0, NULL); |
e9c1b084 | 564 | if (!nf_ct_expect_cachep) |
a71c0855 | 565 | goto err2; |
e9c1b084 PM |
566 | |
567 | err = exp_proc_init(); | |
568 | if (err < 0) | |
a71c0855 | 569 | goto err3; |
e9c1b084 PM |
570 | |
571 | return 0; | |
572 | ||
a71c0855 PM |
573 | err3: |
574 | nf_ct_free_hashtable(nf_ct_expect_hash, nf_ct_expect_vmalloc, | |
575 | nf_ct_expect_hsize); | |
576 | err2: | |
e9c1b084 | 577 | kmem_cache_destroy(nf_ct_expect_cachep); |
a71c0855 | 578 | err1: |
e9c1b084 PM |
579 | return err; |
580 | } | |
581 | ||
582 | void nf_conntrack_expect_fini(void) | |
583 | { | |
584 | exp_proc_remove(); | |
585 | kmem_cache_destroy(nf_ct_expect_cachep); | |
a71c0855 PM |
586 | nf_ct_free_hashtable(nf_ct_expect_hash, nf_ct_expect_vmalloc, |
587 | nf_ct_expect_hsize); | |
e9c1b084 | 588 | } |