2 * Linux INET6 implementation
3 * Forwarding Information Database
6 * Pedro Roque <roque@di.fc.ul.pt>
8 * $Id: ip6_fib.c,v 1.1.1.1 2005/04/11 02:51:13 jack Exp $
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.
18 * Yuji SEKIYA @USAGI: Support default route on router node;
19 * remove ip6_null_entry from the top of
22 #include <linux/config.h>
23 #include <linux/errno.h>
24 #include <linux/types.h>
25 #include <linux/net.h>
26 #include <linux/route.h>
27 #include <linux/netdevice.h>
28 #include <linux/in6.h>
29 #include <linux/init.h>
32 #include <linux/proc_fs.h>
36 #include <net/ndisc.h>
37 #include <net/addrconf.h>
39 #include <net/ip6_fib.h>
40 #include <net/ip6_route.h>
43 #undef CONFIG_IPV6_SUBTREES
46 #define RT6_TRACE(x...) printk(KERN_DEBUG x)
48 #define RT6_TRACE(x...) do { ; } while (0)
51 struct rt6_statistics rt6_stats;
53 static kmem_cache_t * fib6_node_kmem;
57 #ifdef CONFIG_IPV6_SUBTREES
68 struct fib6_walker_t w;
69 int (*func)(struct rt6_info *, void *arg);
73 rwlock_t fib6_walker_lock = RW_LOCK_UNLOCKED;
76 #ifdef CONFIG_IPV6_SUBTREES
77 #define FWS_INIT FWS_S
78 #define SUBTREE(fn) ((fn)->subtree)
80 #define FWS_INIT FWS_L
81 #define SUBTREE(fn) NULL
84 static void fib6_prune_clones(struct fib6_node *fn, struct rt6_info *rt);
85 static struct fib6_node * fib6_repair_tree(struct fib6_node *fn);
88 * A routing update causes an increase of the serial number on the
89 * afected subtree. This allows for cached routes to be asynchronously
90 * tested when modifications are made to the destination cache as a
91 * result of redirects, path MTU changes, etc.
94 static __u32 rt_sernum = 0;
96 static struct timer_list ip6_fib_timer = { function: fib6_run_gc };
98 static struct fib6_walker_t fib6_walker_list = {
99 &fib6_walker_list, &fib6_walker_list,
102 #define FOR_WALKERS(w) for ((w)=fib6_walker_list.next; (w) != &fib6_walker_list; (w)=(w)->next)
104 static __inline__ u32 fib6_new_sernum(void)
113 * Auxiliary address test functions for the radix tree.
115 * These assume a 32bit processor (although it will work on
120 * compare "prefix length" bits of an address
123 static __inline__ int addr_match(void *token1, void *token2, int prefixlen)
130 pdw = prefixlen >> 5; /* num of whole __u32 in prefix */
131 pbi = prefixlen & 0x1f; /* num of bits in incomplete u32 in prefix */
134 if (memcmp(a1, a2, pdw << 2))
140 mask = htonl((0xffffffff) << (32 - pbi));
142 if ((a1[pdw] ^ a2[pdw]) & mask)
153 static __inline__ int addr_bit_set(void *token, int fn_bit)
157 return htonl(1 << ((~fn_bit)&0x1F)) & addr[fn_bit>>5];
161 * find the first different bit between two addresses
162 * length of address must be a multiple of 32bits
165 static __inline__ int addr_diff(void *token1, void *token2, int addrlen)
173 for (i = 0; i < addrlen; i++) {
183 while ((xb & (1 << j)) == 0)
186 return (i * 32 + 31 - j);
191 * we should *never* get to this point since that
192 * would mean the addrs are equal
194 * However, we do get to it 8) And exacly, when
195 * addresses are equal 8)
197 * ip route add 1111::/128 via ...
198 * ip route add 1111::/64 via ...
201 * Ideally, this function should stop comparison
202 * at prefix length. It does not, but it is still OK,
203 * if returned value is greater than prefix length.
210 static __inline__ struct fib6_node * node_alloc(void)
212 struct fib6_node *fn;
214 if ((fn = kmem_cache_alloc(fib6_node_kmem, SLAB_ATOMIC)) != NULL)
215 memset(fn, 0, sizeof(struct fib6_node));
220 static __inline__ void node_free(struct fib6_node * fn)
222 kmem_cache_free(fib6_node_kmem, fn);
225 static __inline__ void rt6_release(struct rt6_info *rt)
227 if (atomic_dec_and_test(&rt->rt6i_ref))
228 dst_free(&rt->u.dst);
235 * return the apropriate node for a routing tree "add" operation
236 * by either creating and inserting or by returning an existing
240 static struct fib6_node * fib6_add_1(struct fib6_node *root, void *addr,
241 int addrlen, int plen,
244 struct fib6_node *fn, *in, *ln;
245 struct fib6_node *pn = NULL;
249 __u32 sernum = fib6_new_sernum();
251 RT6_TRACE("fib6_add_1\n");
253 /* insert node in tree */
258 key = (struct rt6key *)((u8 *)fn->leaf + offset);
263 if (plen < fn->fn_bit ||
264 !addr_match(&key->addr, addr, fn->fn_bit))
271 if (plen == fn->fn_bit) {
272 /* clean up an intermediate node */
273 if ((fn->fn_flags & RTN_RTINFO) == 0) {
274 rt6_release(fn->leaf);
278 fn->fn_sernum = sernum;
284 * We have more bits to go
287 /* Try to walk down on tree. */
288 fn->fn_sernum = sernum;
289 dir = addr_bit_set(addr, fn->fn_bit);
291 fn = dir ? fn->right: fn->left;
295 * We walked to the bottom of tree.
296 * Create new leaf node without children.
306 ln->fn_sernum = sernum;
318 * split since we don't have a common prefix anymore or
319 * we have a less significant route.
320 * we've to insert an intermediate node on the list
321 * this new node will point to the one we need to create
327 /* find 1st bit in difference between the 2 addrs.
329 See comment in addr_diff: bit may be an invalid value,
330 but if it is >= plen, the value is ignored in any case.
333 bit = addr_diff(addr, &key->addr, addrlen);
338 * (new leaf node)[ln] (old node)[fn]
344 if (in == NULL || ln == NULL) {
353 * new intermediate node.
355 * be off since that an address that chooses one of
356 * the branches would not match less specific routes
357 * in the other branch
364 atomic_inc(&in->leaf->rt6i_ref);
366 in->fn_sernum = sernum;
368 /* update parent pointer */
379 ln->fn_sernum = sernum;
381 if (addr_bit_set(addr, bit)) {
388 } else { /* plen <= bit */
391 * (new leaf node)[ln]
393 * (old node)[fn] NULL
405 ln->fn_sernum = sernum;
412 if (addr_bit_set(&key->addr, plen))
423 * Insert routing information in a node.
426 static int fib6_add_rt2node(struct fib6_node *fn, struct rt6_info *rt)
428 struct rt6_info *iter = NULL;
429 struct rt6_info **ins;
433 if (fn->fn_flags&RTN_TL_ROOT &&
434 fn->leaf == &ip6_null_entry &&
435 !(rt->rt6i_flags & (RTF_DEFAULT | RTF_ADDRCONF | RTF_ALLONLINK)) ){
437 * The top fib of ip6 routing table includes ip6_null_entry.
444 for (iter = fn->leaf; iter; iter=iter->u.next) {
446 * Search for duplicates
449 if (iter->rt6i_metric == rt->rt6i_metric) {
451 * Same priority level
454 if ((iter->rt6i_dev == rt->rt6i_dev) &&
455 (iter->rt6i_flowr == rt->rt6i_flowr) &&
456 (ipv6_addr_cmp(&iter->rt6i_gateway,
457 &rt->rt6i_gateway) == 0)) {
458 if (!(iter->rt6i_flags&RTF_EXPIRES))
460 iter->rt6i_expires = rt->rt6i_expires;
461 if (!(rt->rt6i_flags&RTF_EXPIRES)) {
462 iter->rt6i_flags &= ~RTF_EXPIRES;
463 iter->rt6i_expires = 0;
469 if (iter->rt6i_metric > rt->rt6i_metric)
483 atomic_inc(&rt->rt6i_ref);
484 inet6_rt_notify(RTM_NEWROUTE, rt);
485 rt6_stats.fib_rt_entries++;
487 if ((fn->fn_flags & RTN_RTINFO) == 0) {
488 rt6_stats.fib_route_nodes++;
489 fn->fn_flags |= RTN_RTINFO;
495 static __inline__ void fib6_start_gc(struct rt6_info *rt)
497 if (ip6_fib_timer.expires == 0 &&
498 (rt->rt6i_flags & (RTF_EXPIRES|RTF_CACHE)))
499 mod_timer(&ip6_fib_timer, jiffies + ip6_rt_gc_interval);
503 * Add routing information to the routing tree.
504 * <destination addr>/<source addr>
505 * with source addr info in sub-trees
508 int fib6_add(struct fib6_node *root, struct rt6_info *rt)
510 struct fib6_node *fn;
513 fn = fib6_add_1(root, &rt->rt6i_dst.addr, sizeof(struct in6_addr),
514 rt->rt6i_dst.plen, (u8*) &rt->rt6i_dst - (u8*) rt);
519 #ifdef CONFIG_IPV6_SUBTREES
520 if (rt->rt6i_src.plen) {
521 struct fib6_node *sn;
523 if (fn->subtree == NULL) {
524 struct fib6_node *sfn;
536 /* Create subtree root node */
541 sfn->leaf = &ip6_null_entry;
542 atomic_inc(&ip6_null_entry.rt6i_ref);
543 sfn->fn_flags = RTN_ROOT;
544 sfn->fn_sernum = fib6_new_sernum();
546 /* Now add the first leaf node to new subtree */
548 sn = fib6_add_1(sfn, &rt->rt6i_src.addr,
549 sizeof(struct in6_addr), rt->rt6i_src.plen,
550 (u8*) &rt->rt6i_src - (u8*) rt);
553 /* If it is failed, discard just allocated
554 root, and then (in st_failure) stale node
561 /* Now link new subtree to main tree */
564 if (fn->leaf == NULL) {
566 atomic_inc(&rt->rt6i_ref);
569 sn = fib6_add_1(fn->subtree, &rt->rt6i_src.addr,
570 sizeof(struct in6_addr), rt->rt6i_src.plen,
571 (u8*) &rt->rt6i_src - (u8*) rt);
581 err = fib6_add_rt2node(fn, rt);
585 if (!(rt->rt6i_flags&RTF_CACHE))
586 fib6_prune_clones(fn, rt);
591 dst_free(&rt->u.dst);
594 #ifdef CONFIG_IPV6_SUBTREES
595 /* Subtree creation failed, probably main tree node
596 is orphan. If it is, shot it.
599 if (fn && !(fn->fn_flags&RTN_RTINFO|RTN_ROOT))
601 dst_free(&rt->u.dst);
607 * Routing tree lookup
612 int offset; /* key offset on rt6_info */
613 struct in6_addr *addr; /* search key */
616 static struct fib6_node * fib6_lookup_1(struct fib6_node *root,
617 struct lookup_args *args)
619 struct fib6_node *fn;
629 struct fib6_node *next;
631 dir = addr_bit_set(args->addr, fn->fn_bit);
633 next = dir ? fn->right : fn->left;
643 while ((fn->fn_flags & RTN_ROOT) == 0) {
644 #ifdef CONFIG_IPV6_SUBTREES
646 struct fib6_node *st;
647 struct lookup_args *narg;
652 st = fib6_lookup_1(fn->subtree, narg);
654 if (st && !(st->fn_flags & RTN_ROOT))
660 if (fn->fn_flags & RTN_RTINFO) {
663 key = (struct rt6key *) ((u8 *) fn->leaf +
666 if (addr_match(&key->addr, args->addr, key->plen))
676 struct fib6_node * fib6_lookup(struct fib6_node *root, struct in6_addr *daddr,
677 struct in6_addr *saddr)
679 struct lookup_args args[2];
680 struct rt6_info *rt = NULL;
681 struct fib6_node *fn;
683 args[0].offset = (u8*) &rt->rt6i_dst - (u8*) rt;
684 args[0].addr = daddr;
686 #ifdef CONFIG_IPV6_SUBTREES
687 args[1].offset = (u8*) &rt->rt6i_src - (u8*) rt;
688 args[1].addr = saddr;
691 fn = fib6_lookup_1(root, args);
693 if (fn == NULL || fn->fn_flags & RTN_TL_ROOT)
700 * Get node with sepciafied destination prefix (and source prefix,
701 * if subtrees are used)
705 static struct fib6_node * fib6_locate_1(struct fib6_node *root,
706 struct in6_addr *addr,
707 int plen, int offset)
709 struct fib6_node *fn;
711 for (fn = root; fn ; ) {
712 struct rt6key *key = (struct rt6key *)((u8 *)fn->leaf + offset);
717 if (plen < fn->fn_bit ||
718 !addr_match(&key->addr, addr, fn->fn_bit))
721 if (plen == fn->fn_bit)
725 * We have more bits to go
727 if (addr_bit_set(addr, fn->fn_bit))
735 struct fib6_node * fib6_locate(struct fib6_node *root,
736 struct in6_addr *daddr, int dst_len,
737 struct in6_addr *saddr, int src_len)
739 struct rt6_info *rt = NULL;
740 struct fib6_node *fn;
742 fn = fib6_locate_1(root, daddr, dst_len,
743 (u8*) &rt->rt6i_dst - (u8*) rt);
745 #ifdef CONFIG_IPV6_SUBTREES
747 BUG_TRAP(saddr!=NULL);
751 fn = fib6_locate_1(fn, saddr, src_len,
752 (u8*) &rt->rt6i_src - (u8*) rt);
756 if (fn && fn->fn_flags&RTN_RTINFO)
768 static struct rt6_info * fib6_find_prefix(struct fib6_node *fn)
770 if (fn->fn_flags&RTN_ROOT)
771 return &ip6_null_entry;
775 return fn->left->leaf;
778 return fn->right->leaf;
786 * Called to trim the tree of intermediate nodes when possible. "fn"
787 * is the node we want to try and remove.
790 static struct fib6_node * fib6_repair_tree(struct fib6_node *fn)
794 struct fib6_node *child, *pn;
795 struct fib6_walker_t *w;
799 RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter);
802 BUG_TRAP(!(fn->fn_flags&RTN_RTINFO));
803 BUG_TRAP(!(fn->fn_flags&RTN_TL_ROOT));
804 BUG_TRAP(fn->leaf==NULL);
808 if (fn->right) child = fn->right, children |= 1;
809 if (fn->left) child = fn->left, children |= 2;
811 if (children == 3 || SUBTREE(fn)
812 #ifdef CONFIG_IPV6_SUBTREES
813 /* Subtree root (i.e. fn) may have one child */
814 || (children && fn->fn_flags&RTN_ROOT)
817 fn->leaf = fib6_find_prefix(fn);
819 if (fn->leaf==NULL) {
821 fn->leaf = &ip6_null_entry;
824 atomic_inc(&fn->leaf->rt6i_ref);
829 #ifdef CONFIG_IPV6_SUBTREES
830 if (SUBTREE(pn) == fn) {
831 BUG_TRAP(fn->fn_flags&RTN_ROOT);
835 BUG_TRAP(!(fn->fn_flags&RTN_ROOT));
837 if (pn->right == fn) pn->right = child;
838 else if (pn->left == fn) pn->left = child;
845 #ifdef CONFIG_IPV6_SUBTREES
849 read_lock(&fib6_walker_lock);
853 w->root = w->node = NULL;
854 RT6_TRACE("W %p adjusted by delroot 1\n", w);
855 } else if (w->node == fn) {
856 RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate);
863 RT6_TRACE("W %p adjusted by delroot 2\n", w);
868 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);
869 w->state = w->state>=FWS_R ? FWS_U : FWS_INIT;
871 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);
872 w->state = w->state>=FWS_C ? FWS_U : FWS_INIT;
877 read_unlock(&fib6_walker_lock);
880 if (pn->fn_flags&RTN_RTINFO || SUBTREE(pn))
883 rt6_release(pn->leaf);
889 static void fib6_del_route(struct fib6_node *fn, struct rt6_info **rtp)
891 struct fib6_walker_t *w;
892 struct rt6_info *rt = *rtp;
894 RT6_TRACE("fib6_del_route\n");
898 rt->rt6i_node = NULL;
899 rt6_stats.fib_rt_entries--;
902 read_lock(&fib6_walker_lock);
904 if (w->state == FWS_C && w->leaf == rt) {
905 RT6_TRACE("walker %p adjusted by delroute\n", w);
906 w->leaf = rt->u.next;
911 read_unlock(&fib6_walker_lock);
915 if (fn->leaf == NULL && fn->fn_flags&RTN_TL_ROOT)
916 fn->leaf = &ip6_null_entry;
918 /* If it was last route, expunge its radix tree node */
919 if (fn->leaf == NULL) {
920 fn->fn_flags &= ~RTN_RTINFO;
921 rt6_stats.fib_route_nodes--;
922 fn = fib6_repair_tree(fn);
925 if (atomic_read(&rt->rt6i_ref) != 1) {
926 /* This route is used as dummy address holder in some split
927 * nodes. It is not leaked, but it still holds other resources,
928 * which must be released in time. So, scan ascendant nodes
929 * and replace dummy references to this route with references
930 * to still alive ones.
933 if (!(fn->fn_flags&RTN_RTINFO) && fn->leaf == rt) {
934 fn->leaf = fib6_find_prefix(fn);
935 atomic_inc(&fn->leaf->rt6i_ref);
940 /* No more references are possiible at this point. */
941 if (atomic_read(&rt->rt6i_ref) != 1) BUG();
944 inet6_rt_notify(RTM_DELROUTE, rt);
948 int fib6_del(struct rt6_info *rt)
950 struct fib6_node *fn = rt->rt6i_node;
951 struct rt6_info **rtp;
954 if (rt->u.dst.obsolete>0) {
955 BUG_TRAP(fn==NULL || rt->u.dst.obsolete<=0);
959 if (fn == NULL || rt == &ip6_null_entry)
962 BUG_TRAP(fn->fn_flags&RTN_RTINFO);
964 if (!(rt->rt6i_flags&RTF_CACHE))
965 fib6_prune_clones(fn, rt);
968 * Walk the leaf entries looking for ourself
971 for (rtp = &fn->leaf; *rtp; rtp = &(*rtp)->u.next) {
973 fib6_del_route(fn, rtp);
981 * Tree transversal function.
983 * Certainly, it is not interrupt safe.
984 * However, it is internally reenterable wrt itself and fib6_add/fib6_del.
985 * It means, that we can modify tree during walking
986 * and use this function for garbage collection, clone pruning,
987 * cleaning tree when a device goes down etc. etc.
989 * It guarantees that every node will be traversed,
990 * and that it will be traversed only once.
992 * Callback function w->func may return:
993 * 0 -> continue walking.
994 * positive value -> walking is suspended (used by tree dumps,
995 * and probably by gc, if it will be split to several slices)
996 * negative value -> terminate walking.
998 * The function itself returns:
999 * 0 -> walk is complete.
1000 * >0 -> walk is incomplete (i.e. suspended)
1001 * <0 -> walk is terminated by an error.
1004 int fib6_walk_continue(struct fib6_walker_t *w)
1006 struct fib6_node *fn, *pn;
1013 if (w->prune && fn != w->root &&
1014 fn->fn_flags&RTN_RTINFO && w->state < FWS_C) {
1019 #ifdef CONFIG_IPV6_SUBTREES
1022 w->node = SUBTREE(fn);
1030 w->state = FWS_INIT;
1036 w->node = fn->right;
1037 w->state = FWS_INIT;
1043 if (w->leaf && fn->fn_flags&RTN_RTINFO) {
1044 int err = w->func(w);
1055 #ifdef CONFIG_IPV6_SUBTREES
1056 if (SUBTREE(pn) == fn) {
1057 BUG_TRAP(fn->fn_flags&RTN_ROOT);
1062 if (pn->left == fn) {
1066 if (pn->right == fn) {
1068 w->leaf = w->node->leaf;
1078 int fib6_walk(struct fib6_walker_t *w)
1082 w->state = FWS_INIT;
1085 fib6_walker_link(w);
1086 res = fib6_walk_continue(w);
1088 fib6_walker_unlink(w);
1092 static int fib6_clean_node(struct fib6_walker_t *w)
1095 struct rt6_info *rt;
1096 struct fib6_cleaner_t *c = (struct fib6_cleaner_t*)w;
1098 for (rt = w->leaf; rt; rt = rt->u.next) {
1099 res = c->func(rt, c->arg);
1105 printk(KERN_DEBUG "fib6_clean_node: del failed: rt=%p@%p err=%d\n", rt, rt->rt6i_node, res);
1118 * Convenient frontend to tree walker.
1120 * func is called on each route.
1121 * It may return -1 -> delete this route.
1122 * 0 -> continue walking
1124 * prune==1 -> only immediate children of node (certainly,
1125 * ignoring pure split nodes) will be scanned.
1128 void fib6_clean_tree(struct fib6_node *root,
1129 int (*func)(struct rt6_info *, void *arg),
1130 int prune, void *arg)
1132 struct fib6_cleaner_t c;
1135 c.w.func = fib6_clean_node;
1143 static int fib6_prune_clone(struct rt6_info *rt, void *arg)
1145 if (rt->rt6i_flags & RTF_CACHE) {
1146 RT6_TRACE("pruning clone %p\n", rt);
1153 static void fib6_prune_clones(struct fib6_node *fn, struct rt6_info *rt)
1155 fib6_clean_tree(fn, fib6_prune_clone, 1, rt);
1159 * Garbage collection
1162 static struct fib6_gc_args
1168 static int fib6_age(struct rt6_info *rt, void *arg)
1170 unsigned long now = jiffies;
1172 /* Age clones. Note, that clones are aged out
1173 only if they are not in use now.
1177 * check addrconf expiration here.
1178 * They are expired even if they are in use.
1181 if (rt->rt6i_flags&RTF_EXPIRES && rt->rt6i_expires) {
1182 if ((long)(now - rt->rt6i_expires) > 0) {
1183 RT6_TRACE("expiring %p\n", rt);
1187 } else if (rt->rt6i_flags & RTF_CACHE) {
1188 if (atomic_read(&rt->u.dst.__refcnt) == 0 &&
1189 (long)(now - rt->u.dst.lastuse) >= gc_args.timeout) {
1190 RT6_TRACE("aging clone %p\n", rt);
1199 static spinlock_t fib6_gc_lock = SPIN_LOCK_UNLOCKED;
1201 void fib6_run_gc(unsigned long dummy)
1203 if (dummy != ~0UL) {
1204 spin_lock_bh(&fib6_gc_lock);
1205 gc_args.timeout = (int)dummy;
1208 if (!spin_trylock(&fib6_gc_lock)) {
1209 mod_timer(&ip6_fib_timer, jiffies + HZ);
1213 gc_args.timeout = ip6_rt_gc_interval;
1218 write_lock_bh(&rt6_lock);
1219 fib6_clean_tree(&ip6_routing_table, fib6_age, 0, NULL);
1220 write_unlock_bh(&rt6_lock);
1223 mod_timer(&ip6_fib_timer, jiffies + ip6_rt_gc_interval);
1225 del_timer(&ip6_fib_timer);
1226 ip6_fib_timer.expires = 0;
1228 spin_unlock_bh(&fib6_gc_lock);
1231 void __init fib6_init(void)
1233 if (!fib6_node_kmem)
1234 fib6_node_kmem = kmem_cache_create("fib6_nodes",
1235 sizeof(struct fib6_node),
1236 0, SLAB_HWCACHE_ALIGN,
1241 void fib6_gc_cleanup(void)
1243 del_timer(&ip6_fib_timer);