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.
6 * IPv4 FIB: lookup engine and maintenance routines.
8 * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public License
12 * as published by the Free Software Foundation; either version
13 * 2 of the License, or (at your option) any later version.
16 #include <asm/uaccess.h>
17 #include <asm/system.h>
18 #include <linux/bitops.h>
19 #include <linux/types.h>
20 #include <linux/kernel.h>
22 #include <linux/string.h>
23 #include <linux/socket.h>
24 #include <linux/sockios.h>
25 #include <linux/errno.h>
27 #include <linux/inet.h>
28 #include <linux/inetdevice.h>
29 #include <linux/netdevice.h>
30 #include <linux/if_arp.h>
31 #include <linux/proc_fs.h>
32 #include <linux/skbuff.h>
33 #include <linux/netlink.h>
34 #include <linux/init.h>
36 #include <net/net_namespace.h>
38 #include <net/protocol.h>
39 #include <net/route.h>
42 #include <net/ip_fib.h>
44 #include "fib_lookup.h"
46 static struct kmem_cache *fn_hash_kmem __read_mostly;
47 static struct kmem_cache *fn_alias_kmem __read_mostly;
50 struct hlist_node fn_hash;
51 struct list_head fn_alias;
53 struct fib_alias fn_embedded_alias;
57 struct fn_zone *fz_next; /* Next not empty zone */
58 struct hlist_head *fz_hash; /* Hash table pointer */
59 int fz_nent; /* Number of entries */
61 int fz_divisor; /* Hash divisor */
62 u32 fz_hashmask; /* (fz_divisor - 1) */
63 #define FZ_HASHMASK(fz) ((fz)->fz_hashmask)
65 int fz_order; /* Zone order */
67 #define FZ_MASK(fz) ((fz)->fz_mask)
70 /* NOTE. On fast computers evaluation of fz_hashmask and fz_mask
71 * can be cheaper than memory lookup, so that FZ_* macros are used.
75 struct fn_zone *fn_zones[33];
76 struct fn_zone *fn_zone_list;
79 static inline u32 fn_hash(__be32 key, struct fn_zone *fz)
81 u32 h = ntohl(key)>>(32 - fz->fz_order);
89 static inline __be32 fz_key(__be32 dst, struct fn_zone *fz)
91 return dst & FZ_MASK(fz);
94 static DEFINE_RWLOCK(fib_hash_lock);
95 static unsigned int fib_hash_genid;
97 #define FZ_MAX_DIVISOR ((PAGE_SIZE<<MAX_ORDER) / sizeof(struct hlist_head))
99 static struct hlist_head *fz_hash_alloc(int divisor)
101 unsigned long size = divisor * sizeof(struct hlist_head);
103 if (size <= PAGE_SIZE) {
104 return kzalloc(size, GFP_KERNEL);
106 return (struct hlist_head *)
107 __get_free_pages(GFP_KERNEL | __GFP_ZERO, get_order(size));
111 /* The fib hash lock must be held when this is called. */
112 static inline void fn_rebuild_zone(struct fn_zone *fz,
113 struct hlist_head *old_ht,
118 for (i = 0; i < old_divisor; i++) {
119 struct hlist_node *node, *n;
122 hlist_for_each_entry_safe(f, node, n, &old_ht[i], fn_hash) {
123 struct hlist_head *new_head;
125 hlist_del(&f->fn_hash);
127 new_head = &fz->fz_hash[fn_hash(f->fn_key, fz)];
128 hlist_add_head(&f->fn_hash, new_head);
133 static void fz_hash_free(struct hlist_head *hash, int divisor)
135 unsigned long size = divisor * sizeof(struct hlist_head);
137 if (size <= PAGE_SIZE)
140 free_pages((unsigned long)hash, get_order(size));
143 static void fn_rehash_zone(struct fn_zone *fz)
145 struct hlist_head *ht, *old_ht;
146 int old_divisor, new_divisor;
149 old_divisor = fz->fz_divisor;
151 switch (old_divisor) {
159 if ((old_divisor << 1) > FZ_MAX_DIVISOR) {
160 printk(KERN_CRIT "route.c: bad divisor %d!\n", old_divisor);
163 new_divisor = (old_divisor << 1);
167 new_hashmask = (new_divisor - 1);
169 #if RT_CACHE_DEBUG >= 2
170 printk(KERN_DEBUG "fn_rehash_zone: hash for zone %d grows from %d\n",
171 fz->fz_order, old_divisor);
174 ht = fz_hash_alloc(new_divisor);
177 write_lock_bh(&fib_hash_lock);
178 old_ht = fz->fz_hash;
180 fz->fz_hashmask = new_hashmask;
181 fz->fz_divisor = new_divisor;
182 fn_rebuild_zone(fz, old_ht, old_divisor);
184 write_unlock_bh(&fib_hash_lock);
186 fz_hash_free(old_ht, old_divisor);
190 static inline void fn_free_node(struct fib_node * f)
192 kmem_cache_free(fn_hash_kmem, f);
195 static inline void fn_free_alias(struct fib_alias *fa, struct fib_node *f)
197 fib_release_info(fa->fa_info);
198 if (fa == &f->fn_embedded_alias)
201 kmem_cache_free(fn_alias_kmem, fa);
204 static struct fn_zone *
205 fn_new_zone(struct fn_hash *table, int z)
208 struct fn_zone *fz = kzalloc(sizeof(struct fn_zone), GFP_KERNEL);
217 fz->fz_hashmask = (fz->fz_divisor - 1);
218 fz->fz_hash = fz_hash_alloc(fz->fz_divisor);
224 fz->fz_mask = inet_make_mask(z);
226 /* Find the first not empty zone with more specific mask */
227 for (i=z+1; i<=32; i++)
228 if (table->fn_zones[i])
230 write_lock_bh(&fib_hash_lock);
232 /* No more specific masks, we are the first. */
233 fz->fz_next = table->fn_zone_list;
234 table->fn_zone_list = fz;
236 fz->fz_next = table->fn_zones[i]->fz_next;
237 table->fn_zones[i]->fz_next = fz;
239 table->fn_zones[z] = fz;
241 write_unlock_bh(&fib_hash_lock);
246 fn_hash_lookup(struct fib_table *tb, const struct flowi *flp, struct fib_result *res)
250 struct fn_hash *t = (struct fn_hash *)tb->tb_data;
252 read_lock(&fib_hash_lock);
253 for (fz = t->fn_zone_list; fz; fz = fz->fz_next) {
254 struct hlist_head *head;
255 struct hlist_node *node;
257 __be32 k = fz_key(flp->fl4_dst, fz);
259 head = &fz->fz_hash[fn_hash(k, fz)];
260 hlist_for_each_entry(f, node, head, fn_hash) {
264 err = fib_semantic_match(&f->fn_alias,
273 read_unlock(&fib_hash_lock);
278 fn_hash_select_default(struct fib_table *tb, const struct flowi *flp, struct fib_result *res)
281 struct hlist_node *node;
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];
295 read_lock(&fib_hash_lock);
296 hlist_for_each_entry(f, node, &fz->fz_hash[0], fn_hash) {
297 struct fib_alias *fa;
299 list_for_each_entry(fa, &f->fn_alias, fa_list) {
300 struct fib_info *next_fi = fa->fa_info;
302 if (fa->fa_scope != res->scope ||
303 fa->fa_type != RTN_UNICAST)
306 if (next_fi->fib_priority > res->fi->fib_priority)
308 if (!next_fi->fib_nh[0].nh_gw ||
309 next_fi->fib_nh[0].nh_scope != RT_SCOPE_LINK)
311 fa->fa_state |= FA_S_ACCESSED;
314 if (next_fi != res->fi)
316 } else if (!fib_detect_death(fi, order, &last_resort,
317 &last_idx, tb->tb_default)) {
318 fib_result_assign(res, fi);
319 tb->tb_default = order;
327 if (order <= 0 || fi == NULL) {
332 if (!fib_detect_death(fi, order, &last_resort, &last_idx,
334 fib_result_assign(res, fi);
335 tb->tb_default = order;
340 fib_result_assign(res, last_resort);
341 tb->tb_default = last_idx;
343 read_unlock(&fib_hash_lock);
346 /* Insert node F to FZ. */
347 static inline void fib_insert_node(struct fn_zone *fz, struct fib_node *f)
349 struct hlist_head *head = &fz->fz_hash[fn_hash(f->fn_key, fz)];
351 hlist_add_head(&f->fn_hash, head);
354 /* Return the node in FZ matching KEY. */
355 static struct fib_node *fib_find_node(struct fn_zone *fz, __be32 key)
357 struct hlist_head *head = &fz->fz_hash[fn_hash(key, fz)];
358 struct hlist_node *node;
361 hlist_for_each_entry(f, node, head, fn_hash) {
362 if (f->fn_key == key)
369 static int fn_hash_insert(struct fib_table *tb, struct fib_config *cfg)
371 struct fn_hash *table = (struct fn_hash *) tb->tb_data;
372 struct fib_node *new_f = NULL;
374 struct fib_alias *fa, *new_fa;
377 u8 tos = cfg->fc_tos;
381 if (cfg->fc_dst_len > 32)
384 fz = table->fn_zones[cfg->fc_dst_len];
385 if (!fz && !(fz = fn_new_zone(table, cfg->fc_dst_len)))
390 if (cfg->fc_dst & ~FZ_MASK(fz))
392 key = fz_key(cfg->fc_dst, fz);
395 fi = fib_create_info(cfg);
399 if (fz->fz_nent > (fz->fz_divisor<<1) &&
400 fz->fz_divisor < FZ_MAX_DIVISOR &&
401 (cfg->fc_dst_len == 32 ||
402 (1 << cfg->fc_dst_len) > fz->fz_divisor))
405 f = fib_find_node(fz, key);
410 fa = fib_find_alias(&f->fn_alias, tos, fi->fib_priority);
412 /* Now fa, if non-NULL, points to the first fib alias
413 * with the same keys [prefix,tos,priority], if such key already
414 * exists or to the node before which we will insert new one.
416 * If fa is NULL, we will need to allocate a new one and
417 * insert to the head of f.
419 * If f is NULL, no fib node matched the destination key
420 * and we need to allocate a new one of those as well.
423 if (fa && fa->fa_tos == tos &&
424 fa->fa_info->fib_priority == fi->fib_priority) {
425 struct fib_alias *fa_first, *fa_match;
428 if (cfg->fc_nlflags & NLM_F_EXCL)
432 * 1. Find exact match for type, scope, fib_info to avoid
434 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
438 fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list);
439 list_for_each_entry_continue(fa, &f->fn_alias, fa_list) {
440 if (fa->fa_tos != tos)
442 if (fa->fa_info->fib_priority != fi->fib_priority)
444 if (fa->fa_type == cfg->fc_type &&
445 fa->fa_scope == cfg->fc_scope &&
452 if (cfg->fc_nlflags & NLM_F_REPLACE) {
453 struct fib_info *fi_drop;
462 write_lock_bh(&fib_hash_lock);
463 fi_drop = fa->fa_info;
465 fa->fa_type = cfg->fc_type;
466 fa->fa_scope = cfg->fc_scope;
467 state = fa->fa_state;
468 fa->fa_state &= ~FA_S_ACCESSED;
470 write_unlock_bh(&fib_hash_lock);
472 fib_release_info(fi_drop);
473 if (state & FA_S_ACCESSED)
474 rt_cache_flush(cfg->fc_nlinfo.nl_net, -1);
475 rtmsg_fib(RTM_NEWROUTE, key, fa, cfg->fc_dst_len, tb->tb_id,
476 &cfg->fc_nlinfo, NLM_F_REPLACE);
480 /* Error if we find a perfect match which
481 * uses the same scope, type, and nexthop
487 if (!(cfg->fc_nlflags & NLM_F_APPEND))
492 if (!(cfg->fc_nlflags & NLM_F_CREATE))
498 new_f = kmem_cache_zalloc(fn_hash_kmem, GFP_KERNEL);
502 INIT_HLIST_NODE(&new_f->fn_hash);
503 INIT_LIST_HEAD(&new_f->fn_alias);
508 new_fa = &f->fn_embedded_alias;
509 if (new_fa->fa_info != NULL) {
510 new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL);
514 new_fa->fa_info = fi;
515 new_fa->fa_tos = tos;
516 new_fa->fa_type = cfg->fc_type;
517 new_fa->fa_scope = cfg->fc_scope;
518 new_fa->fa_state = 0;
521 * Insert new entry to the list.
524 write_lock_bh(&fib_hash_lock);
526 fib_insert_node(fz, new_f);
527 list_add_tail(&new_fa->fa_list,
528 (fa ? &fa->fa_list : &f->fn_alias));
530 write_unlock_bh(&fib_hash_lock);
534 rt_cache_flush(cfg->fc_nlinfo.nl_net, -1);
536 rtmsg_fib(RTM_NEWROUTE, key, new_fa, cfg->fc_dst_len, tb->tb_id,
542 kmem_cache_free(fn_hash_kmem, new_f);
543 fib_release_info(fi);
548 static int fn_hash_delete(struct fib_table *tb, struct fib_config *cfg)
550 struct fn_hash *table = (struct fn_hash *)tb->tb_data;
552 struct fib_alias *fa, *fa_to_delete;
556 if (cfg->fc_dst_len > 32)
559 if ((fz = table->fn_zones[cfg->fc_dst_len]) == NULL)
564 if (cfg->fc_dst & ~FZ_MASK(fz))
566 key = fz_key(cfg->fc_dst, fz);
569 f = fib_find_node(fz, key);
574 fa = fib_find_alias(&f->fn_alias, cfg->fc_tos, 0);
579 fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list);
580 list_for_each_entry_continue(fa, &f->fn_alias, fa_list) {
581 struct fib_info *fi = fa->fa_info;
583 if (fa->fa_tos != cfg->fc_tos)
586 if ((!cfg->fc_type ||
587 fa->fa_type == cfg->fc_type) &&
588 (cfg->fc_scope == RT_SCOPE_NOWHERE ||
589 fa->fa_scope == cfg->fc_scope) &&
590 (!cfg->fc_protocol ||
591 fi->fib_protocol == cfg->fc_protocol) &&
592 fib_nh_match(cfg, fi) == 0) {
602 rtmsg_fib(RTM_DELROUTE, key, fa, cfg->fc_dst_len,
603 tb->tb_id, &cfg->fc_nlinfo, 0);
606 write_lock_bh(&fib_hash_lock);
607 list_del(&fa->fa_list);
608 if (list_empty(&f->fn_alias)) {
609 hlist_del(&f->fn_hash);
613 write_unlock_bh(&fib_hash_lock);
615 if (fa->fa_state & FA_S_ACCESSED)
616 rt_cache_flush(cfg->fc_nlinfo.nl_net, -1);
617 fn_free_alias(fa, f);
628 static int fn_flush_list(struct fn_zone *fz, int idx)
630 struct hlist_head *head = &fz->fz_hash[idx];
631 struct hlist_node *node, *n;
635 hlist_for_each_entry_safe(f, node, n, head, fn_hash) {
636 struct fib_alias *fa, *fa_node;
640 list_for_each_entry_safe(fa, fa_node, &f->fn_alias, fa_list) {
641 struct fib_info *fi = fa->fa_info;
643 if (fi && (fi->fib_flags&RTNH_F_DEAD)) {
644 write_lock_bh(&fib_hash_lock);
645 list_del(&fa->fa_list);
646 if (list_empty(&f->fn_alias)) {
647 hlist_del(&f->fn_hash);
651 write_unlock_bh(&fib_hash_lock);
653 fn_free_alias(fa, f);
665 static int fn_hash_flush(struct fib_table *tb)
667 struct fn_hash *table = (struct fn_hash *) tb->tb_data;
671 for (fz = table->fn_zone_list; fz; fz = fz->fz_next) {
674 for (i = fz->fz_divisor - 1; i >= 0; i--)
675 found += fn_flush_list(fz, i);
682 fn_hash_dump_bucket(struct sk_buff *skb, struct netlink_callback *cb,
683 struct fib_table *tb,
685 struct hlist_head *head)
687 struct hlist_node *node;
693 hlist_for_each_entry(f, node, head, fn_hash) {
694 struct fib_alias *fa;
696 list_for_each_entry(fa, &f->fn_alias, fa_list) {
700 if (fib_dump_info(skb, NETLINK_CB(cb->skb).pid,
723 fn_hash_dump_zone(struct sk_buff *skb, struct netlink_callback *cb,
724 struct fib_table *tb,
729 if (fz->fz_hash == NULL)
732 for (h = s_h; h < fz->fz_divisor; h++) {
733 if (hlist_empty(&fz->fz_hash[h]))
735 if (fn_hash_dump_bucket(skb, cb, tb, fz, &fz->fz_hash[h]) < 0) {
739 memset(&cb->args[4], 0,
740 sizeof(cb->args) - 4*sizeof(cb->args[0]));
746 static int fn_hash_dump(struct fib_table *tb, struct sk_buff *skb, struct netlink_callback *cb)
750 struct fn_hash *table = (struct fn_hash *)tb->tb_data;
753 read_lock(&fib_hash_lock);
754 for (fz = table->fn_zone_list, m=0; fz; fz = fz->fz_next, m++) {
755 if (m < s_m) continue;
756 if (fn_hash_dump_zone(skb, cb, tb, fz) < 0) {
758 read_unlock(&fib_hash_lock);
761 memset(&cb->args[3], 0,
762 sizeof(cb->args) - 3*sizeof(cb->args[0]));
764 read_unlock(&fib_hash_lock);
769 void __init fib_hash_init(void)
771 fn_hash_kmem = kmem_cache_create("ip_fib_hash", sizeof(struct fib_node),
772 0, SLAB_PANIC, NULL);
774 fn_alias_kmem = kmem_cache_create("ip_fib_alias", sizeof(struct fib_alias),
775 0, SLAB_PANIC, NULL);
779 struct fib_table *fib_hash_table(u32 id)
781 struct fib_table *tb;
783 tb = kmalloc(sizeof(struct fib_table) + sizeof(struct fn_hash),
790 tb->tb_lookup = fn_hash_lookup;
791 tb->tb_insert = fn_hash_insert;
792 tb->tb_delete = fn_hash_delete;
793 tb->tb_flush = fn_hash_flush;
794 tb->tb_select_default = fn_hash_select_default;
795 tb->tb_dump = fn_hash_dump;
796 memset(tb->tb_data, 0, sizeof(struct fn_hash));
800 /* ------------------------------------------------------------------------ */
801 #ifdef CONFIG_PROC_FS
803 struct fib_iter_state {
804 struct seq_net_private p;
805 struct fn_zone *zone;
807 struct hlist_head *hash_head;
809 struct fib_alias *fa;
815 static struct fib_alias *fib_get_first(struct seq_file *seq)
817 struct fib_iter_state *iter = seq->private;
818 struct fib_table *main_table;
819 struct fn_hash *table;
821 main_table = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN);
822 table = (struct fn_hash *)main_table->tb_data;
825 iter->hash_head = NULL;
829 iter->genid = fib_hash_genid;
832 for (iter->zone = table->fn_zone_list; iter->zone;
833 iter->zone = iter->zone->fz_next) {
836 if (!iter->zone->fz_nent)
839 iter->hash_head = iter->zone->fz_hash;
840 maxslot = iter->zone->fz_divisor;
842 for (iter->bucket = 0; iter->bucket < maxslot;
843 ++iter->bucket, ++iter->hash_head) {
844 struct hlist_node *node;
847 hlist_for_each_entry(fn, node, iter->hash_head, fn_hash) {
848 struct fib_alias *fa;
850 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
862 static struct fib_alias *fib_get_next(struct seq_file *seq)
864 struct fib_iter_state *iter = seq->private;
866 struct fib_alias *fa;
868 /* Advance FA, if any. */
873 list_for_each_entry_continue(fa, &fn->fn_alias, fa_list) {
879 fa = iter->fa = NULL;
883 struct hlist_node *node = &fn->fn_hash;
884 hlist_for_each_entry_continue(fn, node, fn_hash) {
887 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
894 fn = iter->fn = NULL;
896 /* Advance hash chain. */
901 struct hlist_node *node;
904 maxslot = iter->zone->fz_divisor;
906 while (++iter->bucket < maxslot) {
909 hlist_for_each_entry(fn, node, iter->hash_head, fn_hash) {
910 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
918 iter->zone = iter->zone->fz_next;
924 iter->hash_head = iter->zone->fz_hash;
926 hlist_for_each_entry(fn, node, iter->hash_head, fn_hash) {
927 list_for_each_entry(fa, &fn->fn_alias, fa_list) {
939 static struct fib_alias *fib_get_idx(struct seq_file *seq, loff_t pos)
941 struct fib_iter_state *iter = seq->private;
942 struct fib_alias *fa;
944 if (iter->valid && pos >= iter->pos && iter->genid == fib_hash_genid) {
948 fa = fib_get_first(seq);
951 while (pos && (fa = fib_get_next(seq)))
953 return pos ? NULL : fa;
956 static void *fib_seq_start(struct seq_file *seq, loff_t *pos)
957 __acquires(fib_hash_lock)
961 read_lock(&fib_hash_lock);
962 if (fib_get_table(seq_file_net(seq), RT_TABLE_MAIN))
963 v = *pos ? fib_get_idx(seq, *pos - 1) : SEQ_START_TOKEN;
967 static void *fib_seq_next(struct seq_file *seq, void *v, loff_t *pos)
970 return v == SEQ_START_TOKEN ? fib_get_first(seq) : fib_get_next(seq);
973 static void fib_seq_stop(struct seq_file *seq, void *v)
974 __releases(fib_hash_lock)
976 read_unlock(&fib_hash_lock);
979 static unsigned fib_flag_trans(int type, __be32 mask, struct fib_info *fi)
981 static const unsigned type2flags[RTN_MAX + 1] = {
982 [7] = RTF_REJECT, [8] = RTF_REJECT,
984 unsigned flags = type2flags[type];
986 if (fi && fi->fib_nh->nh_gw)
987 flags |= RTF_GATEWAY;
988 if (mask == htonl(0xFFFFFFFF))
995 * This outputs /proc/net/route.
997 * It always works in backward compatibility mode.
998 * The format of the file is not supposed to be changed.
1000 static int fib_seq_show(struct seq_file *seq, void *v)
1002 struct fib_iter_state *iter;
1004 __be32 prefix, mask;
1007 struct fib_alias *fa;
1008 struct fib_info *fi;
1010 if (v == SEQ_START_TOKEN) {
1011 seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway "
1012 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
1017 iter = seq->private;
1022 mask = FZ_MASK(iter->zone);
1023 flags = fib_flag_trans(fa->fa_type, mask, fi);
1026 "%s\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u%n",
1027 fi->fib_dev ? fi->fib_dev->name : "*", prefix,
1028 fi->fib_nh->nh_gw, flags, 0, 0, fi->fib_priority,
1029 mask, (fi->fib_advmss ? fi->fib_advmss + 40 : 0),
1031 fi->fib_rtt >> 3, &len);
1034 "*\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u%n",
1035 prefix, 0, flags, 0, 0, 0, mask, 0, 0, 0, &len);
1037 seq_printf(seq, "%*s\n", 127 - len, "");
1042 static const struct seq_operations fib_seq_ops = {
1043 .start = fib_seq_start,
1044 .next = fib_seq_next,
1045 .stop = fib_seq_stop,
1046 .show = fib_seq_show,
1049 static int fib_seq_open(struct inode *inode, struct file *file)
1051 return seq_open_net(inode, file, &fib_seq_ops,
1052 sizeof(struct fib_iter_state));
1055 static const struct file_operations fib_seq_fops = {
1056 .owner = THIS_MODULE,
1057 .open = fib_seq_open,
1059 .llseek = seq_lseek,
1060 .release = seq_release_net,
1063 int __net_init fib_proc_init(struct net *net)
1065 if (!proc_net_fops_create(net, "route", S_IRUGO, &fib_seq_fops))
1070 void __net_exit fib_proc_exit(struct net *net)
1072 proc_net_remove(net, "route");
1074 #endif /* CONFIG_PROC_FS */