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
,
266 f
->fn_key
, fz
->fz_mask
,
274 read_unlock(&fib_hash_lock
);
279 fn_hash_select_default(struct fib_table
*tb
, const struct flowi
*flp
, struct fib_result
*res
)
282 struct hlist_node
*node
;
284 struct fib_info
*fi
= NULL
;
285 struct fib_info
*last_resort
;
286 struct fn_hash
*t
= (struct fn_hash
*)tb
->tb_data
;
287 struct fn_zone
*fz
= t
->fn_zones
[0];
296 read_lock(&fib_hash_lock
);
297 hlist_for_each_entry(f
, node
, &fz
->fz_hash
[0], fn_hash
) {
298 struct fib_alias
*fa
;
300 list_for_each_entry(fa
, &f
->fn_alias
, fa_list
) {
301 struct fib_info
*next_fi
= fa
->fa_info
;
303 if (fa
->fa_scope
!= res
->scope
||
304 fa
->fa_type
!= RTN_UNICAST
)
307 if (next_fi
->fib_priority
> res
->fi
->fib_priority
)
309 if (!next_fi
->fib_nh
[0].nh_gw
||
310 next_fi
->fib_nh
[0].nh_scope
!= RT_SCOPE_LINK
)
312 fa
->fa_state
|= FA_S_ACCESSED
;
315 if (next_fi
!= res
->fi
)
317 } else if (!fib_detect_death(fi
, order
, &last_resort
,
318 &last_idx
, tb
->tb_default
)) {
319 fib_result_assign(res
, fi
);
320 tb
->tb_default
= order
;
328 if (order
<= 0 || fi
== NULL
) {
333 if (!fib_detect_death(fi
, order
, &last_resort
, &last_idx
,
335 fib_result_assign(res
, fi
);
336 tb
->tb_default
= order
;
341 fib_result_assign(res
, last_resort
);
342 tb
->tb_default
= last_idx
;
344 read_unlock(&fib_hash_lock
);
347 /* Insert node F to FZ. */
348 static inline void fib_insert_node(struct fn_zone
*fz
, struct fib_node
*f
)
350 struct hlist_head
*head
= &fz
->fz_hash
[fn_hash(f
->fn_key
, fz
)];
352 hlist_add_head(&f
->fn_hash
, head
);
355 /* Return the node in FZ matching KEY. */
356 static struct fib_node
*fib_find_node(struct fn_zone
*fz
, __be32 key
)
358 struct hlist_head
*head
= &fz
->fz_hash
[fn_hash(key
, fz
)];
359 struct hlist_node
*node
;
362 hlist_for_each_entry(f
, node
, head
, fn_hash
) {
363 if (f
->fn_key
== key
)
370 static int fn_hash_insert(struct fib_table
*tb
, struct fib_config
*cfg
)
372 struct fn_hash
*table
= (struct fn_hash
*) tb
->tb_data
;
373 struct fib_node
*new_f
= NULL
;
375 struct fib_alias
*fa
, *new_fa
;
378 u8 tos
= cfg
->fc_tos
;
382 if (cfg
->fc_dst_len
> 32)
385 fz
= table
->fn_zones
[cfg
->fc_dst_len
];
386 if (!fz
&& !(fz
= fn_new_zone(table
, cfg
->fc_dst_len
)))
391 if (cfg
->fc_dst
& ~FZ_MASK(fz
))
393 key
= fz_key(cfg
->fc_dst
, fz
);
396 fi
= fib_create_info(cfg
);
400 if (fz
->fz_nent
> (fz
->fz_divisor
<<1) &&
401 fz
->fz_divisor
< FZ_MAX_DIVISOR
&&
402 (cfg
->fc_dst_len
== 32 ||
403 (1 << cfg
->fc_dst_len
) > fz
->fz_divisor
))
406 f
= fib_find_node(fz
, key
);
411 fa
= fib_find_alias(&f
->fn_alias
, tos
, fi
->fib_priority
);
413 /* Now fa, if non-NULL, points to the first fib alias
414 * with the same keys [prefix,tos,priority], if such key already
415 * exists or to the node before which we will insert new one.
417 * If fa is NULL, we will need to allocate a new one and
418 * insert to the head of f.
420 * If f is NULL, no fib node matched the destination key
421 * and we need to allocate a new one of those as well.
424 if (fa
&& fa
->fa_tos
== tos
&&
425 fa
->fa_info
->fib_priority
== fi
->fib_priority
) {
426 struct fib_alias
*fa_first
, *fa_match
;
429 if (cfg
->fc_nlflags
& NLM_F_EXCL
)
433 * 1. Find exact match for type, scope, fib_info to avoid
435 * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it
439 fa
= list_entry(fa
->fa_list
.prev
, struct fib_alias
, fa_list
);
440 list_for_each_entry_continue(fa
, &f
->fn_alias
, fa_list
) {
441 if (fa
->fa_tos
!= tos
)
443 if (fa
->fa_info
->fib_priority
!= fi
->fib_priority
)
445 if (fa
->fa_type
== cfg
->fc_type
&&
446 fa
->fa_scope
== cfg
->fc_scope
&&
453 if (cfg
->fc_nlflags
& NLM_F_REPLACE
) {
454 struct fib_info
*fi_drop
;
463 write_lock_bh(&fib_hash_lock
);
464 fi_drop
= fa
->fa_info
;
466 fa
->fa_type
= cfg
->fc_type
;
467 fa
->fa_scope
= cfg
->fc_scope
;
468 state
= fa
->fa_state
;
469 fa
->fa_state
&= ~FA_S_ACCESSED
;
471 write_unlock_bh(&fib_hash_lock
);
473 fib_release_info(fi_drop
);
474 if (state
& FA_S_ACCESSED
)
475 rt_cache_flush(cfg
->fc_nlinfo
.nl_net
, -1);
476 rtmsg_fib(RTM_NEWROUTE
, key
, fa
, cfg
->fc_dst_len
, tb
->tb_id
,
477 &cfg
->fc_nlinfo
, NLM_F_REPLACE
);
481 /* Error if we find a perfect match which
482 * uses the same scope, type, and nexthop
488 if (!(cfg
->fc_nlflags
& NLM_F_APPEND
))
493 if (!(cfg
->fc_nlflags
& NLM_F_CREATE
))
499 new_f
= kmem_cache_zalloc(fn_hash_kmem
, GFP_KERNEL
);
503 INIT_HLIST_NODE(&new_f
->fn_hash
);
504 INIT_LIST_HEAD(&new_f
->fn_alias
);
509 new_fa
= &f
->fn_embedded_alias
;
510 if (new_fa
->fa_info
!= NULL
) {
511 new_fa
= kmem_cache_alloc(fn_alias_kmem
, GFP_KERNEL
);
515 new_fa
->fa_info
= fi
;
516 new_fa
->fa_tos
= tos
;
517 new_fa
->fa_type
= cfg
->fc_type
;
518 new_fa
->fa_scope
= cfg
->fc_scope
;
519 new_fa
->fa_state
= 0;
522 * Insert new entry to the list.
525 write_lock_bh(&fib_hash_lock
);
527 fib_insert_node(fz
, new_f
);
528 list_add_tail(&new_fa
->fa_list
,
529 (fa
? &fa
->fa_list
: &f
->fn_alias
));
531 write_unlock_bh(&fib_hash_lock
);
535 rt_cache_flush(cfg
->fc_nlinfo
.nl_net
, -1);
537 rtmsg_fib(RTM_NEWROUTE
, key
, new_fa
, cfg
->fc_dst_len
, tb
->tb_id
,
543 kmem_cache_free(fn_hash_kmem
, new_f
);
544 fib_release_info(fi
);
549 static int fn_hash_delete(struct fib_table
*tb
, struct fib_config
*cfg
)
551 struct fn_hash
*table
= (struct fn_hash
*)tb
->tb_data
;
553 struct fib_alias
*fa
, *fa_to_delete
;
557 if (cfg
->fc_dst_len
> 32)
560 if ((fz
= table
->fn_zones
[cfg
->fc_dst_len
]) == NULL
)
565 if (cfg
->fc_dst
& ~FZ_MASK(fz
))
567 key
= fz_key(cfg
->fc_dst
, fz
);
570 f
= fib_find_node(fz
, key
);
575 fa
= fib_find_alias(&f
->fn_alias
, cfg
->fc_tos
, 0);
580 fa
= list_entry(fa
->fa_list
.prev
, struct fib_alias
, fa_list
);
581 list_for_each_entry_continue(fa
, &f
->fn_alias
, fa_list
) {
582 struct fib_info
*fi
= fa
->fa_info
;
584 if (fa
->fa_tos
!= cfg
->fc_tos
)
587 if ((!cfg
->fc_type
||
588 fa
->fa_type
== cfg
->fc_type
) &&
589 (cfg
->fc_scope
== RT_SCOPE_NOWHERE
||
590 fa
->fa_scope
== cfg
->fc_scope
) &&
591 (!cfg
->fc_protocol
||
592 fi
->fib_protocol
== cfg
->fc_protocol
) &&
593 fib_nh_match(cfg
, fi
) == 0) {
603 rtmsg_fib(RTM_DELROUTE
, key
, fa
, cfg
->fc_dst_len
,
604 tb
->tb_id
, &cfg
->fc_nlinfo
, 0);
607 write_lock_bh(&fib_hash_lock
);
608 list_del(&fa
->fa_list
);
609 if (list_empty(&f
->fn_alias
)) {
610 hlist_del(&f
->fn_hash
);
614 write_unlock_bh(&fib_hash_lock
);
616 if (fa
->fa_state
& FA_S_ACCESSED
)
617 rt_cache_flush(cfg
->fc_nlinfo
.nl_net
, -1);
618 fn_free_alias(fa
, f
);
629 static int fn_flush_list(struct fn_zone
*fz
, int idx
)
631 struct hlist_head
*head
= &fz
->fz_hash
[idx
];
632 struct hlist_node
*node
, *n
;
636 hlist_for_each_entry_safe(f
, node
, n
, head
, fn_hash
) {
637 struct fib_alias
*fa
, *fa_node
;
641 list_for_each_entry_safe(fa
, fa_node
, &f
->fn_alias
, fa_list
) {
642 struct fib_info
*fi
= fa
->fa_info
;
644 if (fi
&& (fi
->fib_flags
&RTNH_F_DEAD
)) {
645 write_lock_bh(&fib_hash_lock
);
646 list_del(&fa
->fa_list
);
647 if (list_empty(&f
->fn_alias
)) {
648 hlist_del(&f
->fn_hash
);
652 write_unlock_bh(&fib_hash_lock
);
654 fn_free_alias(fa
, f
);
666 static int fn_hash_flush(struct fib_table
*tb
)
668 struct fn_hash
*table
= (struct fn_hash
*) tb
->tb_data
;
672 for (fz
= table
->fn_zone_list
; fz
; fz
= fz
->fz_next
) {
675 for (i
= fz
->fz_divisor
- 1; i
>= 0; i
--)
676 found
+= fn_flush_list(fz
, i
);
683 fn_hash_dump_bucket(struct sk_buff
*skb
, struct netlink_callback
*cb
,
684 struct fib_table
*tb
,
686 struct hlist_head
*head
)
688 struct hlist_node
*node
;
694 hlist_for_each_entry(f
, node
, head
, fn_hash
) {
695 struct fib_alias
*fa
;
697 list_for_each_entry(fa
, &f
->fn_alias
, fa_list
) {
701 if (fib_dump_info(skb
, NETLINK_CB(cb
->skb
).pid
,
724 fn_hash_dump_zone(struct sk_buff
*skb
, struct netlink_callback
*cb
,
725 struct fib_table
*tb
,
730 if (fz
->fz_hash
== NULL
)
733 for (h
= s_h
; h
< fz
->fz_divisor
; h
++) {
734 if (hlist_empty(&fz
->fz_hash
[h
]))
736 if (fn_hash_dump_bucket(skb
, cb
, tb
, fz
, &fz
->fz_hash
[h
]) < 0) {
740 memset(&cb
->args
[4], 0,
741 sizeof(cb
->args
) - 4*sizeof(cb
->args
[0]));
747 static int fn_hash_dump(struct fib_table
*tb
, struct sk_buff
*skb
, struct netlink_callback
*cb
)
751 struct fn_hash
*table
= (struct fn_hash
*)tb
->tb_data
;
754 read_lock(&fib_hash_lock
);
755 for (fz
= table
->fn_zone_list
, m
=0; fz
; fz
= fz
->fz_next
, m
++) {
756 if (m
< s_m
) continue;
757 if (fn_hash_dump_zone(skb
, cb
, tb
, fz
) < 0) {
759 read_unlock(&fib_hash_lock
);
762 memset(&cb
->args
[3], 0,
763 sizeof(cb
->args
) - 3*sizeof(cb
->args
[0]));
765 read_unlock(&fib_hash_lock
);
770 void __init
fib_hash_init(void)
772 fn_hash_kmem
= kmem_cache_create("ip_fib_hash", sizeof(struct fib_node
),
773 0, SLAB_PANIC
, NULL
);
775 fn_alias_kmem
= kmem_cache_create("ip_fib_alias", sizeof(struct fib_alias
),
776 0, SLAB_PANIC
, NULL
);
780 struct fib_table
*fib_hash_table(u32 id
)
782 struct fib_table
*tb
;
784 tb
= kmalloc(sizeof(struct fib_table
) + sizeof(struct fn_hash
),
791 tb
->tb_lookup
= fn_hash_lookup
;
792 tb
->tb_insert
= fn_hash_insert
;
793 tb
->tb_delete
= fn_hash_delete
;
794 tb
->tb_flush
= fn_hash_flush
;
795 tb
->tb_select_default
= fn_hash_select_default
;
796 tb
->tb_dump
= fn_hash_dump
;
797 memset(tb
->tb_data
, 0, sizeof(struct fn_hash
));
801 /* ------------------------------------------------------------------------ */
802 #ifdef CONFIG_PROC_FS
804 struct fib_iter_state
{
805 struct seq_net_private p
;
806 struct fn_zone
*zone
;
808 struct hlist_head
*hash_head
;
810 struct fib_alias
*fa
;
816 static struct fib_alias
*fib_get_first(struct seq_file
*seq
)
818 struct fib_iter_state
*iter
= seq
->private;
819 struct fib_table
*main_table
;
820 struct fn_hash
*table
;
822 main_table
= fib_get_table(seq_file_net(seq
), RT_TABLE_MAIN
);
823 table
= (struct fn_hash
*)main_table
->tb_data
;
826 iter
->hash_head
= NULL
;
830 iter
->genid
= fib_hash_genid
;
833 for (iter
->zone
= table
->fn_zone_list
; iter
->zone
;
834 iter
->zone
= iter
->zone
->fz_next
) {
837 if (!iter
->zone
->fz_nent
)
840 iter
->hash_head
= iter
->zone
->fz_hash
;
841 maxslot
= iter
->zone
->fz_divisor
;
843 for (iter
->bucket
= 0; iter
->bucket
< maxslot
;
844 ++iter
->bucket
, ++iter
->hash_head
) {
845 struct hlist_node
*node
;
848 hlist_for_each_entry(fn
,node
,iter
->hash_head
,fn_hash
) {
849 struct fib_alias
*fa
;
851 list_for_each_entry(fa
,&fn
->fn_alias
,fa_list
) {
863 static struct fib_alias
*fib_get_next(struct seq_file
*seq
)
865 struct fib_iter_state
*iter
= seq
->private;
867 struct fib_alias
*fa
;
869 /* Advance FA, if any. */
874 list_for_each_entry_continue(fa
, &fn
->fn_alias
, fa_list
) {
880 fa
= iter
->fa
= NULL
;
884 struct hlist_node
*node
= &fn
->fn_hash
;
885 hlist_for_each_entry_continue(fn
, node
, fn_hash
) {
888 list_for_each_entry(fa
, &fn
->fn_alias
, fa_list
) {
895 fn
= iter
->fn
= NULL
;
897 /* Advance hash chain. */
902 struct hlist_node
*node
;
905 maxslot
= iter
->zone
->fz_divisor
;
907 while (++iter
->bucket
< maxslot
) {
910 hlist_for_each_entry(fn
, node
, iter
->hash_head
, fn_hash
) {
911 list_for_each_entry(fa
, &fn
->fn_alias
, fa_list
) {
919 iter
->zone
= iter
->zone
->fz_next
;
925 iter
->hash_head
= iter
->zone
->fz_hash
;
927 hlist_for_each_entry(fn
, node
, iter
->hash_head
, fn_hash
) {
928 list_for_each_entry(fa
, &fn
->fn_alias
, fa_list
) {
940 static struct fib_alias
*fib_get_idx(struct seq_file
*seq
, loff_t pos
)
942 struct fib_iter_state
*iter
= seq
->private;
943 struct fib_alias
*fa
;
945 if (iter
->valid
&& pos
>= iter
->pos
&& iter
->genid
== fib_hash_genid
) {
949 fa
= fib_get_first(seq
);
952 while (pos
&& (fa
= fib_get_next(seq
)))
954 return pos
? NULL
: fa
;
957 static void *fib_seq_start(struct seq_file
*seq
, loff_t
*pos
)
958 __acquires(fib_hash_lock
)
962 read_lock(&fib_hash_lock
);
963 if (fib_get_table(seq_file_net(seq
), RT_TABLE_MAIN
))
964 v
= *pos
? fib_get_idx(seq
, *pos
- 1) : SEQ_START_TOKEN
;
968 static void *fib_seq_next(struct seq_file
*seq
, void *v
, loff_t
*pos
)
971 return v
== SEQ_START_TOKEN
? fib_get_first(seq
) : fib_get_next(seq
);
974 static void fib_seq_stop(struct seq_file
*seq
, void *v
)
975 __releases(fib_hash_lock
)
977 read_unlock(&fib_hash_lock
);
980 static unsigned fib_flag_trans(int type
, __be32 mask
, struct fib_info
*fi
)
982 static const unsigned type2flags
[RTN_MAX
+ 1] = {
983 [7] = RTF_REJECT
, [8] = RTF_REJECT
,
985 unsigned flags
= type2flags
[type
];
987 if (fi
&& fi
->fib_nh
->nh_gw
)
988 flags
|= RTF_GATEWAY
;
989 if (mask
== htonl(0xFFFFFFFF))
996 * This outputs /proc/net/route.
998 * It always works in backward compatibility mode.
999 * The format of the file is not supposed to be changed.
1001 static int fib_seq_show(struct seq_file
*seq
, void *v
)
1003 struct fib_iter_state
*iter
;
1005 __be32 prefix
, mask
;
1008 struct fib_alias
*fa
;
1009 struct fib_info
*fi
;
1011 if (v
== SEQ_START_TOKEN
) {
1012 seq_printf(seq
, "%-127s\n", "Iface\tDestination\tGateway "
1013 "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU"
1018 iter
= seq
->private;
1023 mask
= FZ_MASK(iter
->zone
);
1024 flags
= fib_flag_trans(fa
->fa_type
, mask
, fi
);
1027 "%s\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u%n",
1028 fi
->fib_dev
? fi
->fib_dev
->name
: "*", prefix
,
1029 fi
->fib_nh
->nh_gw
, flags
, 0, 0, fi
->fib_priority
,
1030 mask
, (fi
->fib_advmss
? fi
->fib_advmss
+ 40 : 0),
1032 fi
->fib_rtt
>> 3, &len
);
1035 "*\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u%n",
1036 prefix
, 0, flags
, 0, 0, 0, mask
, 0, 0, 0, &len
);
1038 seq_printf(seq
, "%*s\n", 127 - len
, "");
1043 static const struct seq_operations fib_seq_ops
= {
1044 .start
= fib_seq_start
,
1045 .next
= fib_seq_next
,
1046 .stop
= fib_seq_stop
,
1047 .show
= fib_seq_show
,
1050 static int fib_seq_open(struct inode
*inode
, struct file
*file
)
1052 return seq_open_net(inode
, file
, &fib_seq_ops
,
1053 sizeof(struct fib_iter_state
));
1056 static const struct file_operations fib_seq_fops
= {
1057 .owner
= THIS_MODULE
,
1058 .open
= fib_seq_open
,
1060 .llseek
= seq_lseek
,
1061 .release
= seq_release_net
,
1064 int __net_init
fib_proc_init(struct net
*net
)
1066 if (!proc_net_fops_create(net
, "route", S_IRUGO
, &fib_seq_fops
))
1071 void __net_exit
fib_proc_exit(struct net
*net
)
1073 proc_net_remove(net
, "route");
1075 #endif /* CONFIG_PROC_FS */