?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
[IPV4]: Remove ip_fib_local_table and ip_fib_main_table defines.
[linux-2.6/linux-acpi-2.6/ibm-acpi-2.6.git] / net / ipv4 / fib_hash.c
blob638185eb315f8defe6e980448f35ac85cd235aed
1 /*
2 * INET An implementation of the TCP/IP protocol suite for the LINUX
3 * operating system. INET is implemented using the BSD Socket
4 * interface as the means of communication with the user level.
5 *
6 * IPv4 FIB: lookup engine and maintenance routines.
7 *
8 * Version: $Id: fib_hash.c,v 1.13 2001/10/31 21:55:54 davem Exp $
9 *
10 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
11 *
12 * This program is free software; you can redistribute it and/or
13 * modify it under the terms of the GNU General Public License
14 * as published by the Free Software Foundation; either version
15 * 2 of the License, or (at your option) any later version.
16 */
17
18 #include <asm/uaccess.h>
19 #include <asm/system.h>
20 #include <linux/bitops.h>
21 #include <linux/types.h>
22 #include <linux/kernel.h>
23 #include <linux/mm.h>
24 #include <linux/string.h>
25 #include <linux/socket.h>
26 #include <linux/sockios.h>
27 #include <linux/errno.h>
28 #include <linux/in.h>
29 #include <linux/inet.h>
30 #include <linux/inetdevice.h>
31 #include <linux/netdevice.h>
32 #include <linux/if_arp.h>
33 #include <linux/proc_fs.h>
34 #include <linux/skbuff.h>
35 #include <linux/netlink.h>
36 #include <linux/init.h>
37
38 #include <net/net_namespace.h>
39 #include <net/ip.h>
40 #include <net/protocol.h>
41 #include <net/route.h>
42 #include <net/tcp.h>
43 #include <net/sock.h>
44 #include <net/ip_fib.h>
45
46 #include "fib_lookup.h"
47
48 static struct kmem_cache *fn_hash_kmem __read_mostly;
49 static struct kmem_cache *fn_alias_kmem __read_mostly;
50
51 struct fib_node {
52 struct hlist_node fn_hash;
53 struct list_head fn_alias;
54 __be32 fn_key;
55 };
56
57 struct fn_zone {
58 struct fn_zone *fz_next; /* Next not empty zone */
59 struct hlist_head *fz_hash; /* Hash table pointer */
60 int fz_nent; /* Number of entries */
61
62 int fz_divisor; /* Hash divisor */
63 u32 fz_hashmask; /* (fz_divisor - 1) */
64 #define FZ_HASHMASK(fz) ((fz)->fz_hashmask)
65
66 int fz_order; /* Zone order */
67 __be32 fz_mask;
68 #define FZ_MASK(fz) ((fz)->fz_mask)
69 };
70
71 /* NOTE. On fast computers evaluation of fz_hashmask and fz_mask
72 * can be cheaper than memory lookup, so that FZ_* macros are used.
73 */
74
75 struct fn_hash {
76 struct fn_zone *fn_zones[33];
77 struct fn_zone *fn_zone_list;
78 };
79
80 static inline u32 fn_hash(__be32 key, struct fn_zone *fz)
81 {
82 u32 h = ntohl(key)>>(32 - fz->fz_order);
83 h ^= (h>>20);
84 h ^= (h>>10);
85 h ^= (h>>5);
86 h &= FZ_HASHMASK(fz);
87 return h;
88 }
89
90 static inline __be32 fz_key(__be32 dst, struct fn_zone *fz)
91 {
92 return dst & FZ_MASK(fz);
93 }
94
95 static DEFINE_RWLOCK(fib_hash_lock);
96 static unsigned int fib_hash_genid;
97
98 #define FZ_MAX_DIVISOR ((PAGE_SIZE<<MAX_ORDER) / sizeof(struct hlist_head))
99
100 static struct hlist_head *fz_hash_alloc(int divisor)
101 {
102 unsigned long size = divisor * sizeof(struct hlist_head);
103
104 if (size <= PAGE_SIZE) {
105 return kzalloc(size, GFP_KERNEL);
106 } else {
107 return (struct hlist_head *)
108 __get_free_pages(GFP_KERNEL | __GFP_ZERO, get_order(size));
109 }
110 }
111
112 /* The fib hash lock must be held when this is called. */
113 static inline void fn_rebuild_zone(struct fn_zone *fz,
114 struct hlist_head *old_ht,
115 int old_divisor)
116 {
117 int i;
118
119 for (i = 0; i < old_divisor; i++) {
120 struct hlist_node *node, *n;
121 struct fib_node *f;
122
123 hlist_for_each_entry_safe(f, node, n, &old_ht[i], fn_hash) {
124 struct hlist_head *new_head;
125
126 hlist_del(&f->fn_hash);
127
128 new_head = &fz->fz_hash[fn_hash(f->fn_key, fz)];
129 hlist_add_head(&f->fn_hash, new_head);
130 }
131 }
132 }
133
134 static void fz_hash_free(struct hlist_head *hash, int divisor)
135 {
136 unsigned long size = divisor * sizeof(struct hlist_head);
137
138 if (size <= PAGE_SIZE)
139 kfree(hash);
140 else
141 free_pages((unsigned long)hash, get_order(size));
142 }
143
144 static void fn_rehash_zone(struct fn_zone *fz)
145 {
146 struct hlist_head *ht, *old_ht;
147 int old_divisor, new_divisor;
148 u32 new_hashmask;
149
150 old_divisor = fz->fz_divisor;
151
152 switch (old_divisor) {
153 case 16:
154 new_divisor = 256;
155 break;
156 case 256:
157 new_divisor = 1024;
158 break;
159 default:
160 if ((old_divisor << 1) > FZ_MAX_DIVISOR) {
161 printk(KERN_CRIT "route.c: bad divisor %d!\n", old_divisor);
162 return;
163 }
164 new_divisor = (old_divisor << 1);
165 break;
166 }
167
168 new_hashmask = (new_divisor - 1);
169
170 #if RT_CACHE_DEBUG >= 2
171 printk("fn_rehash_zone: hash for zone %d grows from %d\n", fz->fz_order, old_divisor);
172 #endif
173
174 ht = fz_hash_alloc(new_divisor);
175
176 if (ht) {
177 write_lock_bh(&fib_hash_lock);
178 old_ht = fz->fz_hash;
179 fz->fz_hash = ht;
180 fz->fz_hashmask = new_hashmask;
181 fz->fz_divisor = new_divisor;
182 fn_rebuild_zone(fz, old_ht, old_divisor);
183 fib_hash_genid++;
184 write_unlock_bh(&fib_hash_lock);
185
186 fz_hash_free(old_ht, old_divisor);
187 }
188 }
189
190 static inline void fn_free_node(struct fib_node * f)
191 {
192 kmem_cache_free(fn_hash_kmem, f);
193 }
194
195 static inline void fn_free_alias(struct fib_alias *fa)
196 {
197 fib_release_info(fa->fa_info);
198 kmem_cache_free(fn_alias_kmem, fa);
199 }
200
201 static struct fn_zone *
202 fn_new_zone(struct fn_hash *table, int z)
203 {
204 int i;
205 struct fn_zone *fz = kzalloc(sizeof(struct fn_zone), GFP_KERNEL);
206 if (!fz)
207 return NULL;
208
209 if (z) {
210 fz->fz_divisor = 16;
211 } else {
212 fz->fz_divisor = 1;
213 }
214 fz->fz_hashmask = (fz->fz_divisor - 1);
215 fz->fz_hash = fz_hash_alloc(fz->fz_divisor);
216 if (!fz->fz_hash) {
217 kfree(fz);
218 return NULL;
219 }
220 fz->fz_order = z;
221 fz->fz_mask = inet_make_mask(z);
222
223 /* Find the first not empty zone with more specific mask */
224 for (i=z+1; i<=32; i++)
225 if (table->fn_zones[i])
226 break;
227 write_lock_bh(&fib_hash_lock);
228 if (i>32) {
229 /* No more specific masks, we are the first. */
230 fz->fz_next = table->fn_zone_list;
231 table->fn_zone_list = fz;
232 } else {
233 fz->fz_next = table->fn_zones[i]->fz_next;
234 table->fn_zones[i]->fz_next = fz;
235 }
236 table->fn_zones[z] = fz;
237 fib_hash_genid++;
238 write_unlock_bh(&fib_hash_lock);
239 return fz;
240 }
241
242 static int
243 fn_hash_lookup(struct fib_table *tb, const struct flowi *flp, struct fib_result *res)
244 {
245 int err;
246 struct fn_zone *fz;
247 struct fn_hash *t = (struct fn_hash*)tb->tb_data;
248
249 read_lock(&fib_hash_lock);
250 for (fz = t->fn_zone_list; fz; fz = fz->fz_next) {
251 struct hlist_head *head;
252 struct hlist_node *node;
253 struct fib_node *f;
254 __be32 k = fz_key(flp->fl4_dst, fz);
255
256 head = &fz->fz_hash[fn_hash(k, fz)];
257 hlist_for_each_entry(f, node, head, fn_hash) {
258 if (f->fn_key != k)
259 continue;
260
261 err = fib_semantic_match(&f->fn_alias,
262 flp, res,
263 f->fn_key, fz->fz_mask,
264 fz->fz_order);
265 if (err <= 0)
266 goto out;
267 }
268 }
269 err = 1;
270 out:
271 read_unlock(&fib_hash_lock);
272 return err;
273 }
274
275 static int fn_hash_last_dflt=-1;
276
277 static void
278 fn_hash_select_default(struct fib_table *tb, const struct flowi *flp, struct fib_result *res)
279 {
280 int order, last_idx;
281 struct hlist_node *node;
282 struct fib_node *f;
283 struct fib_info *fi = NULL;
284 struct fib_info *last_resort;
285 struct fn_hash *t = (struct fn_hash*)tb->tb_data;
286 struct fn_zone *fz = t->fn_zones[0];
287
288 if (fz == NULL)
289 return;
290
291 last_idx = -1;
292 last_resort = NULL;
293 order = -1;
294
295 read_lock(&fib_hash_lock);
296 hlist_for_each_entry(f, node, &fz->fz_hash[0], fn_hash) {
297 struct fib_alias *fa;
298
299 list_for_each_entry(fa, &f->fn_alias, fa_list) {
300 struct fib_info *next_fi = fa->fa_info;
301
302 if (fa->fa_scope != res->scope ||
303 fa->fa_type != RTN_UNICAST)
304 continue;
305
306 if (next_fi->fib_priority > res->fi->fib_priority)
307 break;
308 if (!next_fi->fib_nh[0].nh_gw ||
309 next_fi->fib_nh[0].nh_scope != RT_SCOPE_LINK)
310 continue;
311 fa->fa_state |= FA_S_ACCESSED;
312
313 if (fi == NULL) {
314 if (next_fi != res->fi)
315 break;
316 } else if (!fib_detect_death(fi, order, &last_resort,
317 &last_idx, &fn_hash_last_dflt)) {
318 if (res->fi)
319 fib_info_put(res->fi);
320 res->fi = fi;
321 atomic_inc(&fi->fib_clntref);
322 fn_hash_last_dflt = order;
323 goto out;
324 }
325 fi = next_fi;
326 order++;
327 }
328 }
329
330 if (order <= 0 || fi == NULL) {
331 fn_hash_last_dflt = -1;
332 goto out;
333 }
334
335 if (!fib_detect_death(fi, order, &last_resort, &last_idx, &fn_hash_last_dflt)) {
336 if (res->fi)
337 fib_info_put(res->fi);
338 res->fi = fi;
339 atomic_inc(&fi->fib_clntref);
340 fn_hash_last_dflt = order;
341 goto out;
342 }
343
344 if (last_idx >= 0) {
345 if (res->fi)
346 fib_info_put(res->fi);
347 res->fi = last_resort;
348 if (last_resort)
349 atomic_inc(&last_resort->fib_clntref);
350 }
351 fn_hash_last_dflt = last_idx;
352 out:
353 read_unlock(&fib_hash_lock);
354 }
355
356 /* Insert node F to FZ. */
357 static inline void fib_insert_node(struct fn_zone *fz, struct fib_node *f)
358 {
359 struct hlist_head *head = &fz->fz_hash[fn_hash(f->fn_key, fz)];
360
361 hlist_add_head(&f->fn_hash, head);
362 }
363
364 /* Return the node in FZ matching KEY. */
365 static struct fib_node *fib_find_node(struct fn_zone *fz, __be32 key)
366 {
367 struct hlist_head *head = &fz->fz_hash[fn_hash(key, fz)];
368 struct hlist_node *node;
369 struct fib_node *f;
370
371 hlist_for_each_entry(f, node, head, fn_hash) {
372 if (f->fn_key == key)
373 return f;
374 }
375
376 return NULL;
377 }
378
379 static int fn_hash_insert(struct fib_table *tb, struct fib_config *cfg)
380 {
381 struct fn_hash *table = (struct fn_hash *) tb->tb_data;
382 struct fib_node *new_f, *f;
383 struct fib_alias *fa, *new_fa;
384 struct fn_zone *fz;
385 struct fib_info *fi;
386 u8 tos = cfg->fc_tos;
387 __be32 key;
388 int err;
389
390 if (cfg->fc_dst_len > 32)
391 return -EINVAL;
392
393 fz = table->fn_zones[cfg->fc_dst_len];
394 if (!fz && !(fz = fn_new_zone(table, cfg->fc_dst_len)))
395 return -ENOBUFS;
396
397 key = 0;
398 if (cfg->fc_dst) {
399 if (cfg->fc_dst & ~FZ_MASK(fz))
400 return -EINVAL;
401 key = fz_key(cfg->fc_dst, fz);
402 }
403
404 fi = fib_create_info(cfg);
405 if (IS_ERR(fi))
406 return PTR_ERR(fi);
407
408 if (fz->fz_nent > (fz->fz_divisor<<1) &&
409 fz->fz_divisor < FZ_MAX_DIVISOR &&
410 (cfg->fc_dst_len == 32 ||
411 (1 << cfg->fc_dst_len) > fz->fz_divisor))
412 fn_rehash_zone(fz);
413
414 f = fib_find_node(fz, key);
415
416 if (!f)
417 fa = NULL;
418 else
419 fa = fib_find_alias(&f->fn_alias, tos, fi->fib_priority);
420
421 /* Now fa, if non-NULL, points to the first fib alias
422 * with the same keys [prefix,tos,priority], if such key already
423 * exists or to the node before which we will insert new one.
424 *
425 * If fa is NULL, we will need to allocate a new one and
426 * insert to the head of f.
427 *
428 * If f is NULL, no fib node matched the destination key
429 * and we need to allocate a new one of those as well.
430 */
431
432 if (fa && fa->fa_tos == tos &&
433 fa->fa_info->fib_priority == fi->fib_priority) {
434 struct fib_alias *fa_orig;
435
436 err = -EEXIST;
437 if (cfg->fc_nlflags & NLM_F_EXCL)
438 goto out;
439
440 if (cfg->fc_nlflags & NLM_F_REPLACE) {
441 struct fib_info *fi_drop;
442 u8 state;
443
444 if (fi->fib_treeref > 1)
445 goto out;
446
447 write_lock_bh(&fib_hash_lock);
448 fi_drop = fa->fa_info;
449 fa->fa_info = fi;
450 fa->fa_type = cfg->fc_type;
451 fa->fa_scope = cfg->fc_scope;
452 state = fa->fa_state;
453 fa->fa_state &= ~FA_S_ACCESSED;
454 fib_hash_genid++;
455 write_unlock_bh(&fib_hash_lock);
456
457 fib_release_info(fi_drop);
458 if (state & FA_S_ACCESSED)
459 rt_cache_flush(-1);
460 rtmsg_fib(RTM_NEWROUTE, key, fa, cfg->fc_dst_len, tb->tb_id,
461 &cfg->fc_nlinfo, NLM_F_REPLACE);
462 return 0;
463 }
464
465 /* Error if we find a perfect match which
466 * uses the same scope, type, and nexthop
467 * information.
468 */
469 fa_orig = fa;
470 fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list);
471 list_for_each_entry_continue(fa, &f->fn_alias, fa_list) {
472 if (fa->fa_tos != tos)
473 break;
474 if (fa->fa_info->fib_priority != fi->fib_priority)
475 break;
476 if (fa->fa_type == cfg->fc_type &&
477 fa->fa_scope == cfg->fc_scope &&
478 fa->fa_info == fi)
479 goto out;
480 }
481 if (!(cfg->fc_nlflags & NLM_F_APPEND))
482 fa = fa_orig;
483 }
484
485 err = -ENOENT;
486 if (!(cfg->fc_nlflags & NLM_F_CREATE))
487 goto out;
488
489 err = -ENOBUFS;
490 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
491 if (new_fa == NULL)
492 goto out;
493
494 new_f = NULL;
495 if (!f) {
496 new_f = kmem_cache_alloc(fn_hash_kmem, GFP_KERNEL);
497 if (new_f == NULL)
498 goto out_free_new_fa;
499
500 INIT_HLIST_NODE(&new_f->fn_hash);
501 INIT_LIST_HEAD(&new_f->fn_alias);
502 new_f->fn_key = key;
503 f = new_f;
504 }
505
506 new_fa->fa_info = fi;
507 new_fa->fa_tos = tos;
508 new_fa->fa_type = cfg->fc_type;
509 new_fa->fa_scope = cfg->fc_scope;
510 new_fa->fa_state = 0;
511
512 /*
513 * Insert new entry to the list.
514 */
515
516 write_lock_bh(&fib_hash_lock);
517 if (new_f)
518 fib_insert_node(fz, new_f);
519 list_add_tail(&new_fa->fa_list,
520 (fa ? &fa->fa_list : &f->fn_alias));
521 fib_hash_genid++;
522 write_unlock_bh(&fib_hash_lock);
523
524 if (new_f)
525 fz->fz_nent++;
526 rt_cache_flush(-1);
527
528 rtmsg_fib(RTM_NEWROUTE, key, new_fa, cfg->fc_dst_len, tb->tb_id,
529 &cfg->fc_nlinfo, 0);
530 return 0;
531
532 out_free_new_fa:
533 kmem_cache_free(fn_alias_kmem, new_fa);
534 out:
535 fib_release_info(fi);
536 return err;
537 }
538
539
540 static int fn_hash_delete(struct fib_table *tb, struct fib_config *cfg)
541 {
542 struct fn_hash *table = (struct fn_hash*)tb->tb_data;
543 struct fib_node *f;
544 struct fib_alias *fa, *fa_to_delete;
545 struct fn_zone *fz;
546 __be32 key;
547
548 if (cfg->fc_dst_len > 32)
549 return -EINVAL;
550
551 if ((fz = table->fn_zones[cfg->fc_dst_len]) == NULL)
552 return -ESRCH;
553
554 key = 0;
555 if (cfg->fc_dst) {
556 if (cfg->fc_dst & ~FZ_MASK(fz))
557 return -EINVAL;
558 key = fz_key(cfg->fc_dst, fz);
559 }
560
561 f = fib_find_node(fz, key);
562
563 if (!f)
564 fa = NULL;
565 else
566 fa = fib_find_alias(&f->fn_alias, cfg->fc_tos, 0);
567 if (!fa)
568 return -ESRCH;
569
570 fa_to_delete = NULL;
571 fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list);
572 list_for_each_entry_continue(fa, &f->fn_alias, fa_list) {
573 struct fib_info *fi = fa->fa_info;
574
575 if (fa->fa_tos != cfg->fc_tos)
576 break;
577
578 if ((!cfg->fc_type ||
579 fa->fa_type == cfg->fc_type) &&
580 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
581 fa->fa_scope == cfg->fc_scope) &&
582 (!cfg->fc_protocol ||
583 fi->fib_protocol == cfg->fc_protocol) &&
584 fib_nh_match(cfg, fi) == 0) {
585 fa_to_delete = fa;
586 break;
587 }
588 }
589
590 if (fa_to_delete) {
591 int kill_fn;
592
593 fa = fa_to_delete;
594 rtmsg_fib(RTM_DELROUTE, key, fa, cfg->fc_dst_len,
595 tb->tb_id, &cfg->fc_nlinfo, 0);
596
597 kill_fn = 0;
598 write_lock_bh(&fib_hash_lock);
599 list_del(&fa->fa_list);
600 if (list_empty(&f->fn_alias)) {
601 hlist_del(&f->fn_hash);
602 kill_fn = 1;
603 }
604 fib_hash_genid++;
605 write_unlock_bh(&fib_hash_lock);
606
607 if (fa->fa_state & FA_S_ACCESSED)
608 rt_cache_flush(-1);
609 fn_free_alias(fa);
610 if (kill_fn) {
611 fn_free_node(f);
612 fz->fz_nent--;
613 }
614
615 return 0;
616 }
617 return -ESRCH;
618 }
619
620 static int fn_flush_list(struct fn_zone *fz, int idx)
621 {
622 struct hlist_head *head = &fz->fz_hash[idx];
623 struct hlist_node *node, *n;
624 struct fib_node *f;
625 int found = 0;
626
627 hlist_for_each_entry_safe(f, node, n, head, fn_hash) {
628 struct fib_alias *fa, *fa_node;
629 int kill_f;
630
631 kill_f = 0;
632 list_for_each_entry_safe(fa, fa_node, &f->fn_alias, fa_list) {
633 struct fib_info *fi = fa->fa_info;
634
635 if (fi && (fi->fib_flags&RTNH_F_DEAD)) {
636 write_lock_bh(&fib_hash_lock);
637 list_del(&fa->fa_list);
638 if (list_empty(&f->fn_alias)) {
639 hlist_del(&f->fn_hash);
640 kill_f = 1;
641 }
642 fib_hash_genid++;
643 write_unlock_bh(&fib_hash_lock);
644
645 fn_free_alias(fa);
646 found++;
647 }
648 }
649 if (kill_f) {
650 fn_free_node(f);
651 fz->fz_nent--;
652 }
653 }
654 return found;
655 }
656
657 static int fn_hash_flush(struct fib_table *tb)
658 {
659 struct fn_hash *table = (struct fn_hash *) tb->tb_data;
660 struct fn_zone *fz;
661 int found = 0;
662
663 for (fz = table->fn_zone_list; fz; fz = fz->fz_next) {
664 int i;
665
666 for (i = fz->fz_divisor - 1; i >= 0; i--)
667 found += fn_flush_list(fz, i);
668 }
669 return found;
670 }
671
672
673 static inline int
674 fn_hash_dump_bucket(struct sk_buff *skb, struct netlink_callback *cb,
675 struct fib_table *tb,
676 struct fn_zone *fz,
677 struct hlist_head *head)
678 {
679 struct hlist_node *node;
680 struct fib_node *f;
681 int i, s_i;
682
683 s_i = cb->args[4];
684 i = 0;
685 hlist_for_each_entry(f, node, head, fn_hash) {
686 struct fib_alias *fa;
687
688 list_for_each_entry(fa, &f->fn_alias, fa_list) {
689 if (i < s_i)
690 goto next;
691
692 if (fib_dump_info(skb, NETLINK_CB(cb->skb).pid,
693 cb->nlh->nlmsg_seq,
694 RTM_NEWROUTE,
695 tb->tb_id,
696 fa->fa_type,
697 fa->fa_scope,
698 f->fn_key,
699 fz->fz_order,
700 fa->fa_tos,
701 fa->fa_info,
702 NLM_F_MULTI) < 0) {
703 cb->args[4] = i;
704 return -1;
705 }
706 next:
707 i++;
708 }
709 }
710 cb->args[4] = i;
711 return skb->len;
712 }
713
714 static inline int
715 fn_hash_dump_zone(struct sk_buff *skb, struct netlink_callback *cb,
716 struct fib_table *tb,
717 struct fn_zone *fz)
718 {
719 int h, s_h;
720
721 if (fz->fz_hash == NULL)
722 return skb->len;
723 s_h = cb->args[3];
724 for (h = s_h; h < fz->fz_divisor; h++) {
725 if (hlist_empty(&fz->fz_hash[h]))
726 continue;
727 if (fn_hash_dump_bucket(skb, cb, tb, fz, &fz->fz_hash[h]) < 0) {
728 cb->args[3] = h;
729 return -1;
730 }
731 memset(&cb->args[4], 0,
732 sizeof(cb->args) - 4*sizeof(cb->args[0]));
733 }
734 cb->args[3] = h;
735 return skb->len;
736 }
737
738 static int fn_hash_dump(struct fib_table *tb, struct sk_buff *skb, struct netlink_callback *cb)
739 {
740 int m, s_m;
741 struct fn_zone *fz;
742 struct fn_hash *table = (struct fn_hash*)tb->tb_data;
743
744 s_m = cb->args[2];
745 read_lock(&fib_hash_lock);
746 for (fz = table->fn_zone_list, m=0; fz; fz = fz->fz_next, m++) {
747 if (m < s_m) continue;
748 if (fn_hash_dump_zone(skb, cb, tb, fz) < 0) {
749 cb->args[2] = m;
750 read_unlock(&fib_hash_lock);
751 return -1;
752 }
753 memset(&cb->args[3], 0,
754 sizeof(cb->args) - 3*sizeof(cb->args[0]));
755 }
756 read_unlock(&fib_hash_lock);
757 cb->args[2] = m;
758 return skb->len;
759 }
760
761 #ifdef CONFIG_IP_MULTIPLE_TABLES
762 struct fib_table * fib_hash_init(u32 id)
763 #else
764 struct fib_table * __init fib_hash_init(u32 id)
765 #endif
766 {
767 struct fib_table *tb;
768
769 if (fn_hash_kmem == NULL)
770 fn_hash_kmem = kmem_cache_create("ip_fib_hash",
771 sizeof(struct fib_node),
772 0, SLAB_HWCACHE_ALIGN,
773 NULL);
774
775 if (fn_alias_kmem == NULL)
776 fn_alias_kmem = kmem_cache_create("ip_fib_alias",
777 sizeof(struct fib_alias),
778 0, SLAB_HWCACHE_ALIGN,
779 NULL);
780
781 tb = kmalloc(sizeof(struct fib_table) + sizeof(struct fn_hash),
782 GFP_KERNEL);
783 if (tb == NULL)
784 return NULL;
785
786 tb->tb_id = id;
787 tb->tb_lookup = fn_hash_lookup;
788 tb->tb_insert = fn_hash_insert;
789 tb->tb_delete = fn_hash_delete;
790 tb->tb_flush = fn_hash_flush;
791 tb->tb_select_default = fn_hash_select_default;
792 tb->tb_dump = fn_hash_dump;
793 memset(tb->tb_data, 0, sizeof(struct fn_hash));
794 return tb;
795 }
796
797 /* ------------------------------------------------------------------------ */
798 #ifdef CONFIG_PROC_FS
799
800 struct fib_iter_state {
801 struct fn_zone *zone;
802 int bucket;
803 struct hlist_head *hash_head;
804 struct fib_node *fn;
805 struct fib_alias *fa;
806 loff_t pos;
807 unsigned int genid;
808 int valid;
809 };
810
811 static struct fib_alias *fib_get_first(struct seq_file *seq)
812 {
813 struct fib_iter_state *iter = seq->private;
814 struct fib_table *main_table = fib_get_table(RT_TABLE_MAIN);
815 struct fn_hash *table = (struct fn_hash *)main_table->tb_data;
816
817 iter->bucket = 0;
818 iter->hash_head = NULL;
819 iter->fn = NULL;
820 iter->fa = NULL;
821 iter->pos = 0;
822 iter->genid = fib_hash_genid;
823 iter->valid = 1;
824
825 for (iter->zone = table->fn_zone_list; iter->zone;
826 iter->zone = iter->zone->fz_next) {
827 int maxslot;
828
829 if (!iter->zone->fz_nent)
830 continue;
831
832 iter->hash_head = iter->zone->fz_hash;
833 maxslot = iter->zone->fz_divisor;
834
835 for (iter->bucket = 0; iter->bucket < maxslot;
836 ++iter->bucket, ++iter->hash_head) {
837 struct hlist_node *node;
838 struct fib_node *fn;
839
840 hlist_for_each_entry(fn,node,iter->hash_head,fn_hash) {
841 struct fib_alias *fa;
842
843 list_for_each_entry(fa,&fn->fn_alias,fa_list) {
844 iter->fn = fn;
845 iter->fa = fa;
846 goto out;
847 }
848 }
849 }
850 }
851 out:
852 return iter->fa;
853 }
854
855 static struct fib_alias *fib_get_next(struct seq_file *seq)
856 {
857 struct fib_iter_state *iter = seq->private;
858 struct fib_node *fn;
859 struct fib_alias *fa;
860
861 /* Advance FA, if any. */
862 fn = iter->fn;
863 fa = iter->fa;
864 if (fa) {
865 BUG_ON(!fn);
866 list_for_each_entry_continue(fa, &fn->fn_alias, fa_list) {
867 iter->fa = fa;
868 goto out;
869 }
870 }
871
872 fa = iter->fa = NULL;
873
874 /* Advance FN. */
875 if (fn) {
876 struct hlist_node *node = &fn->fn_hash;
877 hlist_for_each_entry_continue(fn, node, fn_hash) {
878 iter->fn = fn;
879
880 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
881 iter->fa = fa;
882 goto out;
883 }
884 }
885 }
886
887 fn = iter->fn = NULL;
888
889 /* Advance hash chain. */
890 if (!iter->zone)
891 goto out;
892
893 for (;;) {
894 struct hlist_node *node;
895 int maxslot;
896
897 maxslot = iter->zone->fz_divisor;
898
899 while (++iter->bucket < maxslot) {
900 iter->hash_head++;
901
902 hlist_for_each_entry(fn, node, iter->hash_head, fn_hash) {
903 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
904 iter->fn = fn;
905 iter->fa = fa;
906 goto out;
907 }
908 }
909 }
910
911 iter->zone = iter->zone->fz_next;
912
913 if (!iter->zone)
914 goto out;
915
916 iter->bucket = 0;
917 iter->hash_head = iter->zone->fz_hash;
918
919 hlist_for_each_entry(fn, node, iter->hash_head, fn_hash) {
920 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
921 iter->fn = fn;
922 iter->fa = fa;
923 goto out;
924 }
925 }
926 }
927 out:
928 iter->pos++;
929 return fa;
930 }
931
932 static struct fib_alias *fib_get_idx(struct seq_file *seq, loff_t pos)
933 {
934 struct fib_iter_state *iter = seq->private;
935 struct fib_alias *fa;
936
937 if (iter->valid && pos >= iter->pos && iter->genid == fib_hash_genid) {
938 fa = iter->fa;
939 pos -= iter->pos;
940 } else
941 fa = fib_get_first(seq);
942
943 if (fa)
944 while (pos && (fa = fib_get_next(seq)))
945 --pos;
946 return pos ? NULL : fa;
947 }
948
949 static void *fib_seq_start(struct seq_file *seq, loff_t *pos)
950 {
951 void *v = NULL;
952
953 read_lock(&fib_hash_lock);
954 if (fib_get_table(RT_TABLE_MAIN))
955 v = *pos ? fib_get_idx(seq, *pos - 1) : SEQ_START_TOKEN;
956 return v;
957 }
958
959 static void *fib_seq_next(struct seq_file *seq, void *v, loff_t *pos)
960 {
961 ++*pos;
962 return v == SEQ_START_TOKEN ? fib_get_first(seq) : fib_get_next(seq);
963 }
964
965 static void fib_seq_stop(struct seq_file *seq, void *v)
966 {
967 read_unlock(&fib_hash_lock);
968 }
969
970 static unsigned fib_flag_trans(int type, __be32 mask, struct fib_info *fi)
971 {
972 static const unsigned type2flags[RTN_MAX + 1] = {
973 [7] = RTF_REJECT, [8] = RTF_REJECT,
974 };
975 unsigned flags = type2flags[type];
976
977 if (fi && fi->fib_nh->nh_gw)
978 flags |= RTF_GATEWAY;
979 if (mask == htonl(0xFFFFFFFF))
980 flags |= RTF_HOST;
981 flags |= RTF_UP;
982 return flags;
983 }
984
985 /*
986 * This outputs /proc/net/route.
987 *
988 * It always works in backward compatibility mode.
989 * The format of the file is not supposed to be changed.
990 */
991 static int fib_seq_show(struct seq_file *seq, void *v)
992 {
993 struct fib_iter_state *iter;
994 char bf[128];
995 __be32 prefix, mask;
996 unsigned flags;
997 struct fib_node *f;
998 struct fib_alias *fa;
999 struct fib_info *fi;
1000
1001 if (v == SEQ_START_TOKEN) {
1002 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
1003 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
1004 "\tWindow\tIRTT");
1005 goto out;
1006 }
1007
1008 iter = seq->private;
1009 f = iter->fn;
1010 fa = iter->fa;
1011 fi = fa->fa_info;
1012 prefix = f->fn_key;
1013 mask = FZ_MASK(iter->zone);
1014 flags = fib_flag_trans(fa->fa_type, mask, fi);
1015 if (fi)
1016 snprintf(bf, sizeof(bf),
1017 "%s\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u",
1018 fi->fib_dev ? fi->fib_dev->name : "*", prefix,
1019 fi->fib_nh->nh_gw, flags, 0, 0, fi->fib_priority,
1020 mask, (fi->fib_advmss ? fi->fib_advmss + 40 : 0),
1021 fi->fib_window,
1022 fi->fib_rtt >> 3);
1023 else
1024 snprintf(bf, sizeof(bf),
1025 "*\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u",
1026 prefix, 0, flags, 0, 0, 0, mask, 0, 0, 0);
1027 seq_printf(seq, "%-127s\n", bf);
1028 out:
1029 return 0;
1030 }
1031
1032 static const struct seq_operations fib_seq_ops = {
1033 .start = fib_seq_start,
1034 .next = fib_seq_next,
1035 .stop = fib_seq_stop,
1036 .show = fib_seq_show,
1037 };
1038
1039 static int fib_seq_open(struct inode *inode, struct file *file)
1040 {
1041 return seq_open_private(file, &fib_seq_ops,
1042 sizeof(struct fib_iter_state));
1043 }
1044
1045 static const struct file_operations fib_seq_fops = {
1046 .owner = THIS_MODULE,
1047 .open = fib_seq_open,
1048 .read = seq_read,
1049 .llseek = seq_lseek,
1050 .release = seq_release_private,
1051 };
1052
1053 int __init fib_proc_init(void)
1054 {
1055 if (!proc_net_fops_create(&init_net, "route", S_IRUGO, &fib_seq_fops))
1056 return -ENOMEM;
1057 return 0;
1058 }
1059
1060 void __init fib_proc_exit(void)
1061 {
1062 proc_net_remove(&init_net, "route");
1063 }
1064 #endif /* CONFIG_PROC_FS */
Linux 2.6 ibm-acpi/thinkpad-acpi driver git tree