blob: 52ee1dced2ffe2ed28c86e6ef7dd355cfe18ee70 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +09002 * Linux INET6 implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07003 * Forwarding Information Database
4 *
5 * Authors:
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +09006 * Pedro Roque <roque@di.fc.ul.pt>
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07008 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License
10 * as published by the Free Software Foundation; either version
11 * 2 of the License, or (at your option) any later version.
12 */
13
14/*
15 * Changes:
16 * Yuji SEKIYA @USAGI: Support default route on router node;
17 * remove ip6_null_entry from the top of
18 * routing table.
YOSHIFUJI Hideakic0bece92006-08-23 17:23:25 -070019 * Ville Nuorvala: Fixed routing subtrees.
Linus Torvalds1da177e2005-04-16 15:20:36 -070020 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070021#include <linux/errno.h>
22#include <linux/types.h>
23#include <linux/net.h>
24#include <linux/route.h>
25#include <linux/netdevice.h>
26#include <linux/in6.h>
27#include <linux/init.h>
Thomas Grafc71099a2006-08-04 23:20:06 -070028#include <linux/list.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070029
30#ifdef CONFIG_PROC_FS
31#include <linux/proc_fs.h>
32#endif
33
34#include <net/ipv6.h>
35#include <net/ndisc.h>
36#include <net/addrconf.h>
37
38#include <net/ip6_fib.h>
39#include <net/ip6_route.h>
40
41#define RT6_DEBUG 2
42
43#if RT6_DEBUG >= 3
44#define RT6_TRACE(x...) printk(KERN_DEBUG x)
45#else
46#define RT6_TRACE(x...) do { ; } while (0)
47#endif
48
Christoph Lametere18b8902006-12-06 20:33:20 -080049static struct kmem_cache * fib6_node_kmem __read_mostly;
Linus Torvalds1da177e2005-04-16 15:20:36 -070050
51enum fib_walk_state_t
52{
53#ifdef CONFIG_IPV6_SUBTREES
54 FWS_S,
55#endif
56 FWS_L,
57 FWS_R,
58 FWS_C,
59 FWS_U
60};
61
62struct fib6_cleaner_t
63{
64 struct fib6_walker_t w;
Benjamin Theryec7d43c2008-03-03 23:31:57 -080065 struct net *net;
Linus Torvalds1da177e2005-04-16 15:20:36 -070066 int (*func)(struct rt6_info *, void *arg);
67 void *arg;
68};
69
Adrian Bunk90d41122006-08-14 23:49:16 -070070static DEFINE_RWLOCK(fib6_walker_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -070071
72#ifdef CONFIG_IPV6_SUBTREES
73#define FWS_INIT FWS_S
Linus Torvalds1da177e2005-04-16 15:20:36 -070074#else
75#define FWS_INIT FWS_L
Linus Torvalds1da177e2005-04-16 15:20:36 -070076#endif
77
Benjamin Theryec7d43c2008-03-03 23:31:57 -080078static void fib6_prune_clones(struct net *net, struct fib6_node *fn,
79 struct rt6_info *rt);
Daniel Lezcano8ed67782008-03-04 13:48:30 -080080static struct rt6_info *fib6_find_prefix(struct net *net, struct fib6_node *fn);
81static struct fib6_node *fib6_repair_tree(struct net *net, struct fib6_node *fn);
Adrian Bunk90d41122006-08-14 23:49:16 -070082static int fib6_walk(struct fib6_walker_t *w);
83static int fib6_walk_continue(struct fib6_walker_t *w);
Linus Torvalds1da177e2005-04-16 15:20:36 -070084
85/*
86 * A routing update causes an increase of the serial number on the
87 * affected subtree. This allows for cached routes to be asynchronously
88 * tested when modifications are made to the destination cache as a
89 * result of redirects, path MTU changes, etc.
90 */
91
92static __u32 rt_sernum;
93
Daniel Lezcano5b7c9312008-03-03 23:28:58 -080094static void fib6_gc_timer_cb(unsigned long arg);
95
Adrian Bunk90d41122006-08-14 23:49:16 -070096static struct fib6_walker_t fib6_walker_list = {
Linus Torvalds1da177e2005-04-16 15:20:36 -070097 .prev = &fib6_walker_list,
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +090098 .next = &fib6_walker_list,
Linus Torvalds1da177e2005-04-16 15:20:36 -070099};
100
101#define FOR_WALKERS(w) for ((w)=fib6_walker_list.next; (w) != &fib6_walker_list; (w)=(w)->next)
102
Adrian Bunk90d41122006-08-14 23:49:16 -0700103static inline void fib6_walker_link(struct fib6_walker_t *w)
104{
105 write_lock_bh(&fib6_walker_lock);
106 w->next = fib6_walker_list.next;
107 w->prev = &fib6_walker_list;
108 w->next->prev = w;
109 w->prev->next = w;
110 write_unlock_bh(&fib6_walker_lock);
111}
112
113static inline void fib6_walker_unlink(struct fib6_walker_t *w)
114{
115 write_lock_bh(&fib6_walker_lock);
116 w->next->prev = w->prev;
117 w->prev->next = w->next;
118 w->prev = w->next = w;
119 write_unlock_bh(&fib6_walker_lock);
120}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700121static __inline__ u32 fib6_new_sernum(void)
122{
123 u32 n = ++rt_sernum;
124 if ((__s32)n <= 0)
125 rt_sernum = n = 1;
126 return n;
127}
128
129/*
130 * Auxiliary address test functions for the radix tree.
131 *
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900132 * These assume a 32bit processor (although it will work on
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133 * 64bit processors)
134 */
135
136/*
137 * test bit
138 */
139
Al Viroe69a4ad2006-11-14 20:56:00 -0800140static __inline__ __be32 addr_bit_set(void *token, int fn_bit)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700141{
Al Viroe69a4ad2006-11-14 20:56:00 -0800142 __be32 *addr = token;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143
144 return htonl(1 << ((~fn_bit)&0x1F)) & addr[fn_bit>>5];
145}
146
Linus Torvalds1da177e2005-04-16 15:20:36 -0700147static __inline__ struct fib6_node * node_alloc(void)
148{
149 struct fib6_node *fn;
150
Robert P. J. Dayc3762222007-02-10 01:45:03 -0800151 fn = kmem_cache_zalloc(fib6_node_kmem, GFP_ATOMIC);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700152
153 return fn;
154}
155
156static __inline__ void node_free(struct fib6_node * fn)
157{
158 kmem_cache_free(fib6_node_kmem, fn);
159}
160
161static __inline__ void rt6_release(struct rt6_info *rt)
162{
163 if (atomic_dec_and_test(&rt->rt6i_ref))
164 dst_free(&rt->u.dst);
165}
166
Thomas Grafc71099a2006-08-04 23:20:06 -0700167#ifdef CONFIG_IPV6_MULTIPLE_TABLES
Patrick McHardy1b43af52006-08-10 23:11:17 -0700168#define FIB_TABLE_HASHSZ 256
169#else
170#define FIB_TABLE_HASHSZ 1
171#endif
Thomas Grafc71099a2006-08-04 23:20:06 -0700172
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800173static void fib6_link_table(struct net *net, struct fib6_table *tb)
Patrick McHardy1b43af52006-08-10 23:11:17 -0700174{
175 unsigned int h;
176
Thomas Graf375216a2006-10-21 20:20:54 -0700177 /*
178 * Initialize table lock at a single place to give lockdep a key,
179 * tables aren't visible prior to being linked to the list.
180 */
181 rwlock_init(&tb->tb6_lock);
182
Patrick McHardy1b43af52006-08-10 23:11:17 -0700183 h = tb->tb6_id & (FIB_TABLE_HASHSZ - 1);
184
185 /*
186 * No protection necessary, this is the only list mutatation
187 * operation, tables never disappear once they exist.
188 */
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800189 hlist_add_head_rcu(&tb->tb6_hlist, &net->ipv6.fib_table_hash[h]);
Patrick McHardy1b43af52006-08-10 23:11:17 -0700190}
191
192#ifdef CONFIG_IPV6_MULTIPLE_TABLES
Daniel Lezcanoe0b85592008-03-03 23:24:31 -0800193
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800194static struct fib6_table *fib6_alloc_table(struct net *net, u32 id)
Thomas Grafc71099a2006-08-04 23:20:06 -0700195{
196 struct fib6_table *table;
197
198 table = kzalloc(sizeof(*table), GFP_ATOMIC);
199 if (table != NULL) {
200 table->tb6_id = id;
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800201 table->tb6_root.leaf = net->ipv6.ip6_null_entry;
Thomas Grafc71099a2006-08-04 23:20:06 -0700202 table->tb6_root.fn_flags = RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO;
203 }
204
205 return table;
206}
207
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800208struct fib6_table *fib6_new_table(struct net *net, u32 id)
Thomas Grafc71099a2006-08-04 23:20:06 -0700209{
210 struct fib6_table *tb;
211
212 if (id == 0)
213 id = RT6_TABLE_MAIN;
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800214 tb = fib6_get_table(net, id);
Thomas Grafc71099a2006-08-04 23:20:06 -0700215 if (tb)
216 return tb;
217
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800218 tb = fib6_alloc_table(net, id);
Thomas Grafc71099a2006-08-04 23:20:06 -0700219 if (tb != NULL)
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800220 fib6_link_table(net, tb);
Thomas Grafc71099a2006-08-04 23:20:06 -0700221
222 return tb;
223}
224
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800225struct fib6_table *fib6_get_table(struct net *net, u32 id)
Thomas Grafc71099a2006-08-04 23:20:06 -0700226{
227 struct fib6_table *tb;
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800228 struct hlist_head *head;
Thomas Grafc71099a2006-08-04 23:20:06 -0700229 struct hlist_node *node;
230 unsigned int h;
231
232 if (id == 0)
233 id = RT6_TABLE_MAIN;
234 h = id & (FIB_TABLE_HASHSZ - 1);
235 rcu_read_lock();
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800236 head = &net->ipv6.fib_table_hash[h];
237 hlist_for_each_entry_rcu(tb, node, head, tb6_hlist) {
Thomas Grafc71099a2006-08-04 23:20:06 -0700238 if (tb->tb6_id == id) {
239 rcu_read_unlock();
240 return tb;
241 }
242 }
243 rcu_read_unlock();
244
245 return NULL;
246}
247
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800248static void fib6_tables_init(struct net *net)
Thomas Grafc71099a2006-08-04 23:20:06 -0700249{
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800250 fib6_link_table(net, net->ipv6.fib6_main_tbl);
251 fib6_link_table(net, net->ipv6.fib6_local_tbl);
Thomas Grafc71099a2006-08-04 23:20:06 -0700252}
Thomas Grafc71099a2006-08-04 23:20:06 -0700253#else
254
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800255struct fib6_table *fib6_new_table(struct net *net, u32 id)
Thomas Grafc71099a2006-08-04 23:20:06 -0700256{
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800257 return fib6_get_table(net, id);
Thomas Grafc71099a2006-08-04 23:20:06 -0700258}
259
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800260struct fib6_table *fib6_get_table(struct net *net, u32 id)
Thomas Grafc71099a2006-08-04 23:20:06 -0700261{
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800262 return net->ipv6.fib6_main_tbl;
Thomas Grafc71099a2006-08-04 23:20:06 -0700263}
264
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800265struct dst_entry *fib6_rule_lookup(struct net *net, struct flowi *fl,
266 int flags, pol_lookup_t lookup)
Thomas Grafc71099a2006-08-04 23:20:06 -0700267{
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800268 return (struct dst_entry *) lookup(net, net->ipv6.fib6_main_tbl, fl, flags);
Thomas Grafc71099a2006-08-04 23:20:06 -0700269}
270
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800271static void fib6_tables_init(struct net *net)
Thomas Grafc71099a2006-08-04 23:20:06 -0700272{
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800273 fib6_link_table(net, net->ipv6.fib6_main_tbl);
Thomas Grafc71099a2006-08-04 23:20:06 -0700274}
275
276#endif
277
Patrick McHardy1b43af52006-08-10 23:11:17 -0700278static int fib6_dump_node(struct fib6_walker_t *w)
279{
280 int res;
281 struct rt6_info *rt;
282
Eric Dumazet7cc48262007-02-09 16:22:57 -0800283 for (rt = w->leaf; rt; rt = rt->u.dst.rt6_next) {
Patrick McHardy1b43af52006-08-10 23:11:17 -0700284 res = rt6_dump_route(rt, w->args);
285 if (res < 0) {
286 /* Frame is full, suspend walking */
287 w->leaf = rt;
288 return 1;
289 }
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700290 WARN_ON(res == 0);
Patrick McHardy1b43af52006-08-10 23:11:17 -0700291 }
292 w->leaf = NULL;
293 return 0;
294}
295
296static void fib6_dump_end(struct netlink_callback *cb)
297{
298 struct fib6_walker_t *w = (void*)cb->args[2];
299
300 if (w) {
Herbert Xu7891cc82009-01-13 22:17:51 -0800301 if (cb->args[4]) {
302 cb->args[4] = 0;
303 fib6_walker_unlink(w);
304 }
Patrick McHardy1b43af52006-08-10 23:11:17 -0700305 cb->args[2] = 0;
306 kfree(w);
307 }
308 cb->done = (void*)cb->args[3];
309 cb->args[1] = 3;
310}
311
312static int fib6_dump_done(struct netlink_callback *cb)
313{
314 fib6_dump_end(cb);
315 return cb->done ? cb->done(cb) : 0;
316}
317
318static int fib6_dump_table(struct fib6_table *table, struct sk_buff *skb,
319 struct netlink_callback *cb)
320{
321 struct fib6_walker_t *w;
322 int res;
323
324 w = (void *)cb->args[2];
325 w->root = &table->tb6_root;
326
327 if (cb->args[4] == 0) {
328 read_lock_bh(&table->tb6_lock);
329 res = fib6_walk(w);
330 read_unlock_bh(&table->tb6_lock);
331 if (res > 0)
332 cb->args[4] = 1;
333 } else {
334 read_lock_bh(&table->tb6_lock);
335 res = fib6_walk_continue(w);
336 read_unlock_bh(&table->tb6_lock);
Herbert Xu7891cc82009-01-13 22:17:51 -0800337 if (res <= 0) {
338 fib6_walker_unlink(w);
339 cb->args[4] = 0;
Patrick McHardy1b43af52006-08-10 23:11:17 -0700340 }
Patrick McHardy1b43af52006-08-10 23:11:17 -0700341 }
Herbert Xu7891cc82009-01-13 22:17:51 -0800342
Patrick McHardy1b43af52006-08-10 23:11:17 -0700343 return res;
344}
345
Thomas Grafc127ea22007-03-22 11:58:32 -0700346static int inet6_dump_fib(struct sk_buff *skb, struct netlink_callback *cb)
Patrick McHardy1b43af52006-08-10 23:11:17 -0700347{
YOSHIFUJI Hideaki3b1e0a62008-03-26 02:26:21 +0900348 struct net *net = sock_net(skb->sk);
Patrick McHardy1b43af52006-08-10 23:11:17 -0700349 unsigned int h, s_h;
350 unsigned int e = 0, s_e;
351 struct rt6_rtnl_dump_arg arg;
352 struct fib6_walker_t *w;
353 struct fib6_table *tb;
354 struct hlist_node *node;
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800355 struct hlist_head *head;
Patrick McHardy1b43af52006-08-10 23:11:17 -0700356 int res = 0;
357
358 s_h = cb->args[0];
359 s_e = cb->args[1];
360
361 w = (void *)cb->args[2];
362 if (w == NULL) {
363 /* New dump:
364 *
365 * 1. hook callback destructor.
366 */
367 cb->args[3] = (long)cb->done;
368 cb->done = fib6_dump_done;
369
370 /*
371 * 2. allocate and initialize walker.
372 */
373 w = kzalloc(sizeof(*w), GFP_ATOMIC);
374 if (w == NULL)
375 return -ENOMEM;
376 w->func = fib6_dump_node;
377 cb->args[2] = (long)w;
378 }
379
380 arg.skb = skb;
381 arg.cb = cb;
Brian Haley191cd582008-08-14 15:33:21 -0700382 arg.net = net;
Patrick McHardy1b43af52006-08-10 23:11:17 -0700383 w->args = &arg;
384
385 for (h = s_h; h < FIB_TABLE_HASHSZ; h++, s_e = 0) {
386 e = 0;
Daniel Lezcano58f09b72008-03-03 23:25:27 -0800387 head = &net->ipv6.fib_table_hash[h];
388 hlist_for_each_entry(tb, node, head, tb6_hlist) {
Patrick McHardy1b43af52006-08-10 23:11:17 -0700389 if (e < s_e)
390 goto next;
391 res = fib6_dump_table(tb, skb, cb);
392 if (res != 0)
393 goto out;
394next:
395 e++;
396 }
397 }
398out:
399 cb->args[1] = e;
400 cb->args[0] = h;
401
402 res = res < 0 ? res : skb->len;
403 if (res <= 0)
404 fib6_dump_end(cb);
405 return res;
406}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700407
408/*
409 * Routing Table
410 *
411 * return the appropriate node for a routing tree "add" operation
412 * by either creating and inserting or by returning an existing
413 * node.
414 */
415
416static struct fib6_node * fib6_add_1(struct fib6_node *root, void *addr,
417 int addrlen, int plen,
418 int offset)
419{
420 struct fib6_node *fn, *in, *ln;
421 struct fib6_node *pn = NULL;
422 struct rt6key *key;
423 int bit;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900424 __be32 dir = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700425 __u32 sernum = fib6_new_sernum();
426
427 RT6_TRACE("fib6_add_1\n");
428
429 /* insert node in tree */
430
431 fn = root;
432
433 do {
434 key = (struct rt6key *)((u8 *)fn->leaf + offset);
435
436 /*
437 * Prefix match
438 */
439 if (plen < fn->fn_bit ||
440 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit))
441 goto insert_above;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900442
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 /*
444 * Exact match ?
445 */
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900446
Linus Torvalds1da177e2005-04-16 15:20:36 -0700447 if (plen == fn->fn_bit) {
448 /* clean up an intermediate node */
449 if ((fn->fn_flags & RTN_RTINFO) == 0) {
450 rt6_release(fn->leaf);
451 fn->leaf = NULL;
452 }
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900453
Linus Torvalds1da177e2005-04-16 15:20:36 -0700454 fn->fn_sernum = sernum;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900455
Linus Torvalds1da177e2005-04-16 15:20:36 -0700456 return fn;
457 }
458
459 /*
460 * We have more bits to go
461 */
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900462
Linus Torvalds1da177e2005-04-16 15:20:36 -0700463 /* Try to walk down on tree. */
464 fn->fn_sernum = sernum;
465 dir = addr_bit_set(addr, fn->fn_bit);
466 pn = fn;
467 fn = dir ? fn->right: fn->left;
468 } while (fn);
469
470 /*
471 * We walked to the bottom of tree.
472 * Create new leaf node without children.
473 */
474
475 ln = node_alloc();
476
477 if (ln == NULL)
478 return NULL;
479 ln->fn_bit = plen;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900480
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 ln->parent = pn;
482 ln->fn_sernum = sernum;
483
484 if (dir)
485 pn->right = ln;
486 else
487 pn->left = ln;
488
489 return ln;
490
491
492insert_above:
493 /*
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900494 * split since we don't have a common prefix anymore or
Linus Torvalds1da177e2005-04-16 15:20:36 -0700495 * we have a less significant route.
496 * we've to insert an intermediate node on the list
497 * this new node will point to the one we need to create
498 * and the current
499 */
500
501 pn = fn->parent;
502
503 /* find 1st bit in difference between the 2 addrs.
504
YOSHIFUJI Hideaki971f3592005-11-08 09:37:56 -0800505 See comment in __ipv6_addr_diff: bit may be an invalid value,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700506 but if it is >= plen, the value is ignored in any case.
507 */
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900508
YOSHIFUJI Hideaki971f3592005-11-08 09:37:56 -0800509 bit = __ipv6_addr_diff(addr, &key->addr, addrlen);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700510
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900511 /*
512 * (intermediate)[in]
Linus Torvalds1da177e2005-04-16 15:20:36 -0700513 * / \
514 * (new leaf node)[ln] (old node)[fn]
515 */
516 if (plen > bit) {
517 in = node_alloc();
518 ln = node_alloc();
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900519
Linus Torvalds1da177e2005-04-16 15:20:36 -0700520 if (in == NULL || ln == NULL) {
521 if (in)
522 node_free(in);
523 if (ln)
524 node_free(ln);
525 return NULL;
526 }
527
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900528 /*
529 * new intermediate node.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700530 * RTN_RTINFO will
531 * be off since that an address that chooses one of
532 * the branches would not match less specific routes
533 * in the other branch
534 */
535
536 in->fn_bit = bit;
537
538 in->parent = pn;
539 in->leaf = fn->leaf;
540 atomic_inc(&in->leaf->rt6i_ref);
541
542 in->fn_sernum = sernum;
543
544 /* update parent pointer */
545 if (dir)
546 pn->right = in;
547 else
548 pn->left = in;
549
550 ln->fn_bit = plen;
551
552 ln->parent = in;
553 fn->parent = in;
554
555 ln->fn_sernum = sernum;
556
557 if (addr_bit_set(addr, bit)) {
558 in->right = ln;
559 in->left = fn;
560 } else {
561 in->left = ln;
562 in->right = fn;
563 }
564 } else { /* plen <= bit */
565
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900566 /*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700567 * (new leaf node)[ln]
568 * / \
569 * (old node)[fn] NULL
570 */
571
572 ln = node_alloc();
573
574 if (ln == NULL)
575 return NULL;
576
577 ln->fn_bit = plen;
578
579 ln->parent = pn;
580
581 ln->fn_sernum = sernum;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +0900582
Linus Torvalds1da177e2005-04-16 15:20:36 -0700583 if (dir)
584 pn->right = ln;
585 else
586 pn->left = ln;
587
588 if (addr_bit_set(&key->addr, plen))
589 ln->right = fn;
590 else
591 ln->left = fn;
592
593 fn->parent = ln;
594 }
595 return ln;
596}
597
598/*
599 * Insert routing information in a node.
600 */
601
602static int fib6_add_rt2node(struct fib6_node *fn, struct rt6_info *rt,
Thomas Graf86872cb2006-08-22 00:01:08 -0700603 struct nl_info *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700604{
605 struct rt6_info *iter = NULL;
606 struct rt6_info **ins;
607
608 ins = &fn->leaf;
609
Eric Dumazet7cc48262007-02-09 16:22:57 -0800610 for (iter = fn->leaf; iter; iter=iter->u.dst.rt6_next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700611 /*
612 * Search for duplicates
613 */
614
615 if (iter->rt6i_metric == rt->rt6i_metric) {
616 /*
617 * Same priority level
618 */
619
620 if (iter->rt6i_dev == rt->rt6i_dev &&
621 iter->rt6i_idev == rt->rt6i_idev &&
622 ipv6_addr_equal(&iter->rt6i_gateway,
623 &rt->rt6i_gateway)) {
624 if (!(iter->rt6i_flags&RTF_EXPIRES))
625 return -EEXIST;
626 iter->rt6i_expires = rt->rt6i_expires;
627 if (!(rt->rt6i_flags&RTF_EXPIRES)) {
628 iter->rt6i_flags &= ~RTF_EXPIRES;
629 iter->rt6i_expires = 0;
630 }
631 return -EEXIST;
632 }
633 }
634
635 if (iter->rt6i_metric > rt->rt6i_metric)
636 break;
637
Eric Dumazet7cc48262007-02-09 16:22:57 -0800638 ins = &iter->u.dst.rt6_next;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700639 }
640
David S. Millerf11e6652007-03-24 20:36:25 -0700641 /* Reset round-robin state, if necessary */
642 if (ins == &fn->leaf)
643 fn->rr_ptr = NULL;
644
Linus Torvalds1da177e2005-04-16 15:20:36 -0700645 /*
646 * insert node
647 */
648
Eric Dumazet7cc48262007-02-09 16:22:57 -0800649 rt->u.dst.rt6_next = iter;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700650 *ins = rt;
651 rt->rt6i_node = fn;
652 atomic_inc(&rt->rt6i_ref);
Thomas Graf86872cb2006-08-22 00:01:08 -0700653 inet6_rt_notify(RTM_NEWROUTE, rt, info);
Benjamin Theryc5728722008-03-03 23:34:17 -0800654 info->nl_net->ipv6.rt6_stats->fib_rt_entries++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700655
656 if ((fn->fn_flags & RTN_RTINFO) == 0) {
Benjamin Theryc5728722008-03-03 23:34:17 -0800657 info->nl_net->ipv6.rt6_stats->fib_route_nodes++;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700658 fn->fn_flags |= RTN_RTINFO;
659 }
660
661 return 0;
662}
663
Daniel Lezcano63152fc2008-03-03 23:31:11 -0800664static __inline__ void fib6_start_gc(struct net *net, struct rt6_info *rt)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700665{
Stephen Hemminger417f28b2008-07-22 14:33:45 -0700666 if (!timer_pending(&net->ipv6.ip6_fib_timer) &&
Linus Torvalds1da177e2005-04-16 15:20:36 -0700667 (rt->rt6i_flags & (RTF_EXPIRES|RTF_CACHE)))
Stephen Hemminger417f28b2008-07-22 14:33:45 -0700668 mod_timer(&net->ipv6.ip6_fib_timer,
Stephen Hemminger847499c2008-07-21 13:21:35 -0700669 jiffies + net->ipv6.sysctl.ip6_rt_gc_interval);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700670}
671
Daniel Lezcano63152fc2008-03-03 23:31:11 -0800672void fib6_force_start_gc(struct net *net)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673{
Stephen Hemminger417f28b2008-07-22 14:33:45 -0700674 if (!timer_pending(&net->ipv6.ip6_fib_timer))
675 mod_timer(&net->ipv6.ip6_fib_timer,
Stephen Hemminger847499c2008-07-21 13:21:35 -0700676 jiffies + net->ipv6.sysctl.ip6_rt_gc_interval);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700677}
678
679/*
680 * Add routing information to the routing tree.
681 * <destination addr>/<source addr>
682 * with source addr info in sub-trees
683 */
684
Thomas Graf86872cb2006-08-22 00:01:08 -0700685int fib6_add(struct fib6_node *root, struct rt6_info *rt, struct nl_info *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700686{
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700687 struct fib6_node *fn, *pn = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700688 int err = -ENOMEM;
689
690 fn = fib6_add_1(root, &rt->rt6i_dst.addr, sizeof(struct in6_addr),
691 rt->rt6i_dst.plen, offsetof(struct rt6_info, rt6i_dst));
692
693 if (fn == NULL)
694 goto out;
695
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700696 pn = fn;
697
Linus Torvalds1da177e2005-04-16 15:20:36 -0700698#ifdef CONFIG_IPV6_SUBTREES
699 if (rt->rt6i_src.plen) {
700 struct fib6_node *sn;
701
702 if (fn->subtree == NULL) {
703 struct fib6_node *sfn;
704
705 /*
706 * Create subtree.
707 *
708 * fn[main tree]
709 * |
710 * sfn[subtree root]
711 * \
712 * sn[new leaf node]
713 */
714
715 /* Create subtree root node */
716 sfn = node_alloc();
717 if (sfn == NULL)
718 goto st_failure;
719
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800720 sfn->leaf = info->nl_net->ipv6.ip6_null_entry;
721 atomic_inc(&info->nl_net->ipv6.ip6_null_entry->rt6i_ref);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700722 sfn->fn_flags = RTN_ROOT;
723 sfn->fn_sernum = fib6_new_sernum();
724
725 /* Now add the first leaf node to new subtree */
726
727 sn = fib6_add_1(sfn, &rt->rt6i_src.addr,
728 sizeof(struct in6_addr), rt->rt6i_src.plen,
729 offsetof(struct rt6_info, rt6i_src));
730
731 if (sn == NULL) {
732 /* If it is failed, discard just allocated
733 root, and then (in st_failure) stale node
734 in main tree.
735 */
736 node_free(sfn);
737 goto st_failure;
738 }
739
740 /* Now link new subtree to main tree */
741 sfn->parent = fn;
742 fn->subtree = sfn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700743 } else {
744 sn = fib6_add_1(fn->subtree, &rt->rt6i_src.addr,
745 sizeof(struct in6_addr), rt->rt6i_src.plen,
746 offsetof(struct rt6_info, rt6i_src));
747
748 if (sn == NULL)
749 goto st_failure;
750 }
751
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700752 if (fn->leaf == NULL) {
753 fn->leaf = rt;
754 atomic_inc(&rt->rt6i_ref);
755 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700756 fn = sn;
757 }
758#endif
759
Thomas Graf86872cb2006-08-22 00:01:08 -0700760 err = fib6_add_rt2node(fn, rt, info);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700761
762 if (err == 0) {
Daniel Lezcano63152fc2008-03-03 23:31:11 -0800763 fib6_start_gc(info->nl_net, rt);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700764 if (!(rt->rt6i_flags&RTF_CACHE))
Benjamin Theryec7d43c2008-03-03 23:31:57 -0800765 fib6_prune_clones(info->nl_net, pn, rt);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700766 }
767
768out:
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700769 if (err) {
770#ifdef CONFIG_IPV6_SUBTREES
771 /*
772 * If fib6_add_1 has cleared the old leaf pointer in the
773 * super-tree leaf node we have to find a new one for it.
774 */
David S. Miller3c051232008-04-18 01:46:19 -0700775 if (pn != fn && pn->leaf == rt) {
776 pn->leaf = NULL;
777 atomic_dec(&rt->rt6i_ref);
778 }
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700779 if (pn != fn && !pn->leaf && !(pn->fn_flags & RTN_RTINFO)) {
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800780 pn->leaf = fib6_find_prefix(info->nl_net, pn);
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700781#if RT6_DEBUG >= 2
782 if (!pn->leaf) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700783 WARN_ON(pn->leaf == NULL);
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800784 pn->leaf = info->nl_net->ipv6.ip6_null_entry;
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700785 }
786#endif
787 atomic_inc(&pn->leaf->rt6i_ref);
788 }
789#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -0700790 dst_free(&rt->u.dst);
YOSHIFUJI Hideaki66729e12006-08-23 17:20:34 -0700791 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700792 return err;
793
794#ifdef CONFIG_IPV6_SUBTREES
795 /* Subtree creation failed, probably main tree node
796 is orphan. If it is, shoot it.
797 */
798st_failure:
799 if (fn && !(fn->fn_flags & (RTN_RTINFO|RTN_ROOT)))
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800800 fib6_repair_tree(info->nl_net, fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700801 dst_free(&rt->u.dst);
802 return err;
803#endif
804}
805
806/*
807 * Routing tree lookup
808 *
809 */
810
811struct lookup_args {
812 int offset; /* key offset on rt6_info */
813 struct in6_addr *addr; /* search key */
814};
815
816static struct fib6_node * fib6_lookup_1(struct fib6_node *root,
817 struct lookup_args *args)
818{
819 struct fib6_node *fn;
Al Viroe69a4ad2006-11-14 20:56:00 -0800820 __be32 dir;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700821
YOSHIFUJI Hideaki825e2882006-08-23 17:21:29 -0700822 if (unlikely(args->offset == 0))
823 return NULL;
824
Linus Torvalds1da177e2005-04-16 15:20:36 -0700825 /*
826 * Descend on a tree
827 */
828
829 fn = root;
830
831 for (;;) {
832 struct fib6_node *next;
833
834 dir = addr_bit_set(args->addr, fn->fn_bit);
835
836 next = dir ? fn->right : fn->left;
837
838 if (next) {
839 fn = next;
840 continue;
841 }
842
843 break;
844 }
845
YOSHIFUJI Hideaki3fc5e042006-08-23 17:21:12 -0700846 while(fn) {
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -0700847 if (FIB6_SUBTREE(fn) || fn->fn_flags & RTN_RTINFO) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700848 struct rt6key *key;
849
850 key = (struct rt6key *) ((u8 *) fn->leaf +
851 args->offset);
852
YOSHIFUJI Hideaki3fc5e042006-08-23 17:21:12 -0700853 if (ipv6_prefix_equal(&key->addr, args->addr, key->plen)) {
854#ifdef CONFIG_IPV6_SUBTREES
855 if (fn->subtree)
856 fn = fib6_lookup_1(fn->subtree, args + 1);
857#endif
858 if (!fn || fn->fn_flags & RTN_RTINFO)
859 return fn;
860 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700861 }
862
YOSHIFUJI Hideaki3fc5e042006-08-23 17:21:12 -0700863 if (fn->fn_flags & RTN_ROOT)
864 break;
865
Linus Torvalds1da177e2005-04-16 15:20:36 -0700866 fn = fn->parent;
867 }
868
869 return NULL;
870}
871
872struct fib6_node * fib6_lookup(struct fib6_node *root, struct in6_addr *daddr,
873 struct in6_addr *saddr)
874{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700875 struct fib6_node *fn;
YOSHIFUJI Hideaki825e2882006-08-23 17:21:29 -0700876 struct lookup_args args[] = {
877 {
878 .offset = offsetof(struct rt6_info, rt6i_dst),
879 .addr = daddr,
880 },
Linus Torvalds1da177e2005-04-16 15:20:36 -0700881#ifdef CONFIG_IPV6_SUBTREES
YOSHIFUJI Hideaki825e2882006-08-23 17:21:29 -0700882 {
883 .offset = offsetof(struct rt6_info, rt6i_src),
884 .addr = saddr,
885 },
Linus Torvalds1da177e2005-04-16 15:20:36 -0700886#endif
YOSHIFUJI Hideaki825e2882006-08-23 17:21:29 -0700887 {
888 .offset = 0, /* sentinel */
889 }
890 };
Linus Torvalds1da177e2005-04-16 15:20:36 -0700891
YOSHIFUJI Hideakifefc2a62006-08-23 17:21:50 -0700892 fn = fib6_lookup_1(root, daddr ? args : args + 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700893
894 if (fn == NULL || fn->fn_flags & RTN_TL_ROOT)
895 fn = root;
896
897 return fn;
898}
899
900/*
901 * Get node with specified destination prefix (and source prefix,
902 * if subtrees are used)
903 */
904
905
906static struct fib6_node * fib6_locate_1(struct fib6_node *root,
907 struct in6_addr *addr,
908 int plen, int offset)
909{
910 struct fib6_node *fn;
911
912 for (fn = root; fn ; ) {
913 struct rt6key *key = (struct rt6key *)((u8 *)fn->leaf + offset);
914
915 /*
916 * Prefix match
917 */
918 if (plen < fn->fn_bit ||
919 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit))
920 return NULL;
921
922 if (plen == fn->fn_bit)
923 return fn;
924
925 /*
926 * We have more bits to go
927 */
928 if (addr_bit_set(addr, fn->fn_bit))
929 fn = fn->right;
930 else
931 fn = fn->left;
932 }
933 return NULL;
934}
935
936struct fib6_node * fib6_locate(struct fib6_node *root,
937 struct in6_addr *daddr, int dst_len,
938 struct in6_addr *saddr, int src_len)
939{
940 struct fib6_node *fn;
941
942 fn = fib6_locate_1(root, daddr, dst_len,
943 offsetof(struct rt6_info, rt6i_dst));
944
945#ifdef CONFIG_IPV6_SUBTREES
946 if (src_len) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -0700947 WARN_ON(saddr == NULL);
YOSHIFUJI Hideaki3fc5e042006-08-23 17:21:12 -0700948 if (fn && fn->subtree)
949 fn = fib6_locate_1(fn->subtree, saddr, src_len,
Linus Torvalds1da177e2005-04-16 15:20:36 -0700950 offsetof(struct rt6_info, rt6i_src));
951 }
952#endif
953
954 if (fn && fn->fn_flags&RTN_RTINFO)
955 return fn;
956
957 return NULL;
958}
959
960
961/*
962 * Deletion
963 *
964 */
965
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800966static struct rt6_info *fib6_find_prefix(struct net *net, struct fib6_node *fn)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700967{
968 if (fn->fn_flags&RTN_ROOT)
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800969 return net->ipv6.ip6_null_entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700970
971 while(fn) {
972 if(fn->left)
973 return fn->left->leaf;
974
975 if(fn->right)
976 return fn->right->leaf;
977
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -0700978 fn = FIB6_SUBTREE(fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700979 }
980 return NULL;
981}
982
983/*
984 * Called to trim the tree of intermediate nodes when possible. "fn"
985 * is the node we want to try and remove.
986 */
987
Daniel Lezcano8ed67782008-03-04 13:48:30 -0800988static struct fib6_node *fib6_repair_tree(struct net *net,
989 struct fib6_node *fn)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700990{
991 int children;
992 int nstate;
993 struct fib6_node *child, *pn;
994 struct fib6_walker_t *w;
995 int iter = 0;
996
997 for (;;) {
998 RT6_TRACE("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter);
999 iter++;
1000
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001001 WARN_ON(fn->fn_flags & RTN_RTINFO);
1002 WARN_ON(fn->fn_flags & RTN_TL_ROOT);
1003 WARN_ON(fn->leaf != NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001004
1005 children = 0;
1006 child = NULL;
1007 if (fn->right) child = fn->right, children |= 1;
1008 if (fn->left) child = fn->left, children |= 2;
1009
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001010 if (children == 3 || FIB6_SUBTREE(fn)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001011#ifdef CONFIG_IPV6_SUBTREES
1012 /* Subtree root (i.e. fn) may have one child */
1013 || (children && fn->fn_flags&RTN_ROOT)
1014#endif
1015 ) {
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001016 fn->leaf = fib6_find_prefix(net, fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001017#if RT6_DEBUG >= 2
1018 if (fn->leaf==NULL) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001019 WARN_ON(!fn->leaf);
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001020 fn->leaf = net->ipv6.ip6_null_entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001021 }
1022#endif
1023 atomic_inc(&fn->leaf->rt6i_ref);
1024 return fn->parent;
1025 }
1026
1027 pn = fn->parent;
1028#ifdef CONFIG_IPV6_SUBTREES
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001029 if (FIB6_SUBTREE(pn) == fn) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001030 WARN_ON(!(fn->fn_flags & RTN_ROOT));
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001031 FIB6_SUBTREE(pn) = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001032 nstate = FWS_L;
1033 } else {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001034 WARN_ON(fn->fn_flags & RTN_ROOT);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001035#endif
1036 if (pn->right == fn) pn->right = child;
1037 else if (pn->left == fn) pn->left = child;
1038#if RT6_DEBUG >= 2
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001039 else
1040 WARN_ON(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001041#endif
1042 if (child)
1043 child->parent = pn;
1044 nstate = FWS_R;
1045#ifdef CONFIG_IPV6_SUBTREES
1046 }
1047#endif
1048
1049 read_lock(&fib6_walker_lock);
1050 FOR_WALKERS(w) {
1051 if (child == NULL) {
1052 if (w->root == fn) {
1053 w->root = w->node = NULL;
1054 RT6_TRACE("W %p adjusted by delroot 1\n", w);
1055 } else if (w->node == fn) {
1056 RT6_TRACE("W %p adjusted by delnode 1, s=%d/%d\n", w, w->state, nstate);
1057 w->node = pn;
1058 w->state = nstate;
1059 }
1060 } else {
1061 if (w->root == fn) {
1062 w->root = child;
1063 RT6_TRACE("W %p adjusted by delroot 2\n", w);
1064 }
1065 if (w->node == fn) {
1066 w->node = child;
1067 if (children&2) {
1068 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);
1069 w->state = w->state>=FWS_R ? FWS_U : FWS_INIT;
1070 } else {
1071 RT6_TRACE("W %p adjusted by delnode 2, s=%d\n", w, w->state);
1072 w->state = w->state>=FWS_C ? FWS_U : FWS_INIT;
1073 }
1074 }
1075 }
1076 }
1077 read_unlock(&fib6_walker_lock);
1078
1079 node_free(fn);
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001080 if (pn->fn_flags&RTN_RTINFO || FIB6_SUBTREE(pn))
Linus Torvalds1da177e2005-04-16 15:20:36 -07001081 return pn;
1082
1083 rt6_release(pn->leaf);
1084 pn->leaf = NULL;
1085 fn = pn;
1086 }
1087}
1088
1089static void fib6_del_route(struct fib6_node *fn, struct rt6_info **rtp,
Thomas Graf86872cb2006-08-22 00:01:08 -07001090 struct nl_info *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001091{
1092 struct fib6_walker_t *w;
1093 struct rt6_info *rt = *rtp;
Benjamin Theryc5728722008-03-03 23:34:17 -08001094 struct net *net = info->nl_net;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001095
1096 RT6_TRACE("fib6_del_route\n");
1097
1098 /* Unlink it */
Eric Dumazet7cc48262007-02-09 16:22:57 -08001099 *rtp = rt->u.dst.rt6_next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001100 rt->rt6i_node = NULL;
Benjamin Theryc5728722008-03-03 23:34:17 -08001101 net->ipv6.rt6_stats->fib_rt_entries--;
1102 net->ipv6.rt6_stats->fib_discarded_routes++;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001103
David S. Millerf11e6652007-03-24 20:36:25 -07001104 /* Reset round-robin state, if necessary */
1105 if (fn->rr_ptr == rt)
1106 fn->rr_ptr = NULL;
1107
Linus Torvalds1da177e2005-04-16 15:20:36 -07001108 /* Adjust walkers */
1109 read_lock(&fib6_walker_lock);
1110 FOR_WALKERS(w) {
1111 if (w->state == FWS_C && w->leaf == rt) {
1112 RT6_TRACE("walker %p adjusted by delroute\n", w);
Eric Dumazet7cc48262007-02-09 16:22:57 -08001113 w->leaf = rt->u.dst.rt6_next;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001114 if (w->leaf == NULL)
1115 w->state = FWS_U;
1116 }
1117 }
1118 read_unlock(&fib6_walker_lock);
1119
Eric Dumazet7cc48262007-02-09 16:22:57 -08001120 rt->u.dst.rt6_next = NULL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001121
Linus Torvalds1da177e2005-04-16 15:20:36 -07001122 /* If it was last route, expunge its radix tree node */
1123 if (fn->leaf == NULL) {
1124 fn->fn_flags &= ~RTN_RTINFO;
Benjamin Theryc5728722008-03-03 23:34:17 -08001125 net->ipv6.rt6_stats->fib_route_nodes--;
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001126 fn = fib6_repair_tree(net, fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001127 }
1128
1129 if (atomic_read(&rt->rt6i_ref) != 1) {
1130 /* This route is used as dummy address holder in some split
1131 * nodes. It is not leaked, but it still holds other resources,
1132 * which must be released in time. So, scan ascendant nodes
1133 * and replace dummy references to this route with references
1134 * to still alive ones.
1135 */
1136 while (fn) {
1137 if (!(fn->fn_flags&RTN_RTINFO) && fn->leaf == rt) {
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001138 fn->leaf = fib6_find_prefix(net, fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001139 atomic_inc(&fn->leaf->rt6i_ref);
1140 rt6_release(rt);
1141 }
1142 fn = fn->parent;
1143 }
1144 /* No more references are possible at this point. */
Pavel Emelyanov2df96af2008-02-18 20:50:42 -08001145 BUG_ON(atomic_read(&rt->rt6i_ref) != 1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001146 }
1147
Thomas Graf86872cb2006-08-22 00:01:08 -07001148 inet6_rt_notify(RTM_DELROUTE, rt, info);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001149 rt6_release(rt);
1150}
1151
Thomas Graf86872cb2006-08-22 00:01:08 -07001152int fib6_del(struct rt6_info *rt, struct nl_info *info)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001153{
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001154 struct net *net = info->nl_net;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001155 struct fib6_node *fn = rt->rt6i_node;
1156 struct rt6_info **rtp;
1157
1158#if RT6_DEBUG >= 2
1159 if (rt->u.dst.obsolete>0) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001160 WARN_ON(fn != NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 return -ENOENT;
1162 }
1163#endif
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001164 if (fn == NULL || rt == net->ipv6.ip6_null_entry)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001165 return -ENOENT;
1166
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001167 WARN_ON(!(fn->fn_flags & RTN_RTINFO));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001168
YOSHIFUJI Hideaki150730d2006-08-23 17:22:55 -07001169 if (!(rt->rt6i_flags&RTF_CACHE)) {
1170 struct fib6_node *pn = fn;
1171#ifdef CONFIG_IPV6_SUBTREES
1172 /* clones of this route might be in another subtree */
1173 if (rt->rt6i_src.plen) {
1174 while (!(pn->fn_flags&RTN_ROOT))
1175 pn = pn->parent;
1176 pn = pn->parent;
1177 }
1178#endif
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001179 fib6_prune_clones(info->nl_net, pn, rt);
YOSHIFUJI Hideaki150730d2006-08-23 17:22:55 -07001180 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001181
1182 /*
1183 * Walk the leaf entries looking for ourself
1184 */
1185
Eric Dumazet7cc48262007-02-09 16:22:57 -08001186 for (rtp = &fn->leaf; *rtp; rtp = &(*rtp)->u.dst.rt6_next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001187 if (*rtp == rt) {
Thomas Graf86872cb2006-08-22 00:01:08 -07001188 fib6_del_route(fn, rtp, info);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001189 return 0;
1190 }
1191 }
1192 return -ENOENT;
1193}
1194
1195/*
1196 * Tree traversal function.
1197 *
1198 * Certainly, it is not interrupt safe.
1199 * However, it is internally reenterable wrt itself and fib6_add/fib6_del.
1200 * It means, that we can modify tree during walking
1201 * and use this function for garbage collection, clone pruning,
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +09001202 * cleaning tree when a device goes down etc. etc.
Linus Torvalds1da177e2005-04-16 15:20:36 -07001203 *
1204 * It guarantees that every node will be traversed,
1205 * and that it will be traversed only once.
1206 *
1207 * Callback function w->func may return:
1208 * 0 -> continue walking.
1209 * positive value -> walking is suspended (used by tree dumps,
1210 * and probably by gc, if it will be split to several slices)
1211 * negative value -> terminate walking.
1212 *
1213 * The function itself returns:
1214 * 0 -> walk is complete.
1215 * >0 -> walk is incomplete (i.e. suspended)
1216 * <0 -> walk is terminated by an error.
1217 */
1218
Adrian Bunk90d41122006-08-14 23:49:16 -07001219static int fib6_walk_continue(struct fib6_walker_t *w)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001220{
1221 struct fib6_node *fn, *pn;
1222
1223 for (;;) {
1224 fn = w->node;
1225 if (fn == NULL)
1226 return 0;
1227
1228 if (w->prune && fn != w->root &&
1229 fn->fn_flags&RTN_RTINFO && w->state < FWS_C) {
1230 w->state = FWS_C;
1231 w->leaf = fn->leaf;
1232 }
1233 switch (w->state) {
1234#ifdef CONFIG_IPV6_SUBTREES
1235 case FWS_S:
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001236 if (FIB6_SUBTREE(fn)) {
1237 w->node = FIB6_SUBTREE(fn);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001238 continue;
1239 }
1240 w->state = FWS_L;
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +09001241#endif
Linus Torvalds1da177e2005-04-16 15:20:36 -07001242 case FWS_L:
1243 if (fn->left) {
1244 w->node = fn->left;
1245 w->state = FWS_INIT;
1246 continue;
1247 }
1248 w->state = FWS_R;
1249 case FWS_R:
1250 if (fn->right) {
1251 w->node = fn->right;
1252 w->state = FWS_INIT;
1253 continue;
1254 }
1255 w->state = FWS_C;
1256 w->leaf = fn->leaf;
1257 case FWS_C:
1258 if (w->leaf && fn->fn_flags&RTN_RTINFO) {
1259 int err = w->func(w);
1260 if (err)
1261 return err;
1262 continue;
1263 }
1264 w->state = FWS_U;
1265 case FWS_U:
1266 if (fn == w->root)
1267 return 0;
1268 pn = fn->parent;
1269 w->node = pn;
1270#ifdef CONFIG_IPV6_SUBTREES
YOSHIFUJI Hideaki7fc33162006-08-23 17:22:24 -07001271 if (FIB6_SUBTREE(pn) == fn) {
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001272 WARN_ON(!(fn->fn_flags & RTN_ROOT));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001273 w->state = FWS_L;
1274 continue;
1275 }
1276#endif
1277 if (pn->left == fn) {
1278 w->state = FWS_R;
1279 continue;
1280 }
1281 if (pn->right == fn) {
1282 w->state = FWS_C;
1283 w->leaf = w->node->leaf;
1284 continue;
1285 }
1286#if RT6_DEBUG >= 2
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001287 WARN_ON(1);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001288#endif
1289 }
1290 }
1291}
1292
Adrian Bunk90d41122006-08-14 23:49:16 -07001293static int fib6_walk(struct fib6_walker_t *w)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001294{
1295 int res;
1296
1297 w->state = FWS_INIT;
1298 w->node = w->root;
1299
1300 fib6_walker_link(w);
1301 res = fib6_walk_continue(w);
1302 if (res <= 0)
1303 fib6_walker_unlink(w);
1304 return res;
1305}
1306
1307static int fib6_clean_node(struct fib6_walker_t *w)
1308{
1309 int res;
1310 struct rt6_info *rt;
Benjamin Thery0a8891a2007-10-08 20:39:36 -07001311 struct fib6_cleaner_t *c = container_of(w, struct fib6_cleaner_t, w);
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001312 struct nl_info info = {
1313 .nl_net = c->net,
1314 };
Linus Torvalds1da177e2005-04-16 15:20:36 -07001315
Eric Dumazet7cc48262007-02-09 16:22:57 -08001316 for (rt = w->leaf; rt; rt = rt->u.dst.rt6_next) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001317 res = c->func(rt, c->arg);
1318 if (res < 0) {
1319 w->leaf = rt;
Denis V. Lunev528c4ce2007-12-13 09:45:12 -08001320 res = fib6_del(rt, &info);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001321 if (res) {
1322#if RT6_DEBUG >= 2
1323 printk(KERN_DEBUG "fib6_clean_node: del failed: rt=%p@%p err=%d\n", rt, rt->rt6i_node, res);
1324#endif
1325 continue;
1326 }
1327 return 0;
1328 }
Ilpo Järvinen547b7922008-07-25 21:43:18 -07001329 WARN_ON(res != 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001330 }
1331 w->leaf = rt;
1332 return 0;
1333}
1334
1335/*
1336 * Convenient frontend to tree walker.
YOSHIFUJI Hideaki1ab14572007-02-09 23:24:49 +09001337 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07001338 * func is called on each route.
1339 * It may return -1 -> delete this route.
1340 * 0 -> continue walking
1341 *
1342 * prune==1 -> only immediate children of node (certainly,
1343 * ignoring pure split nodes) will be scanned.
1344 */
1345
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001346static void fib6_clean_tree(struct net *net, struct fib6_node *root,
Adrian Bunk8ce11e62006-08-07 21:50:48 -07001347 int (*func)(struct rt6_info *, void *arg),
1348 int prune, void *arg)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001349{
1350 struct fib6_cleaner_t c;
1351
1352 c.w.root = root;
1353 c.w.func = fib6_clean_node;
1354 c.w.prune = prune;
1355 c.func = func;
1356 c.arg = arg;
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001357 c.net = net;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001358
1359 fib6_walk(&c.w);
1360}
1361
Daniel Lezcanof3db4852008-03-03 23:27:06 -08001362void fib6_clean_all(struct net *net, int (*func)(struct rt6_info *, void *arg),
Thomas Grafc71099a2006-08-04 23:20:06 -07001363 int prune, void *arg)
1364{
Thomas Grafc71099a2006-08-04 23:20:06 -07001365 struct fib6_table *table;
Patrick McHardy1b43af52006-08-10 23:11:17 -07001366 struct hlist_node *node;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001367 struct hlist_head *head;
Patrick McHardy1b43af52006-08-10 23:11:17 -07001368 unsigned int h;
Thomas Grafc71099a2006-08-04 23:20:06 -07001369
Patrick McHardy1b43af52006-08-10 23:11:17 -07001370 rcu_read_lock();
1371 for (h = 0; h < FIB_TABLE_HASHSZ; h++) {
Daniel Lezcanof3db4852008-03-03 23:27:06 -08001372 head = &net->ipv6.fib_table_hash[h];
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001373 hlist_for_each_entry_rcu(table, node, head, tb6_hlist) {
Thomas Grafc71099a2006-08-04 23:20:06 -07001374 write_lock_bh(&table->tb6_lock);
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001375 fib6_clean_tree(net, &table->tb6_root,
1376 func, prune, arg);
Thomas Grafc71099a2006-08-04 23:20:06 -07001377 write_unlock_bh(&table->tb6_lock);
1378 }
1379 }
Patrick McHardy1b43af52006-08-10 23:11:17 -07001380 rcu_read_unlock();
Thomas Grafc71099a2006-08-04 23:20:06 -07001381}
1382
Linus Torvalds1da177e2005-04-16 15:20:36 -07001383static int fib6_prune_clone(struct rt6_info *rt, void *arg)
1384{
1385 if (rt->rt6i_flags & RTF_CACHE) {
1386 RT6_TRACE("pruning clone %p\n", rt);
1387 return -1;
1388 }
1389
1390 return 0;
1391}
1392
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001393static void fib6_prune_clones(struct net *net, struct fib6_node *fn,
1394 struct rt6_info *rt)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001395{
Benjamin Theryec7d43c2008-03-03 23:31:57 -08001396 fib6_clean_tree(net, fn, fib6_prune_clone, 1, rt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001397}
1398
1399/*
1400 * Garbage collection
1401 */
1402
1403static struct fib6_gc_args
1404{
1405 int timeout;
1406 int more;
1407} gc_args;
1408
1409static int fib6_age(struct rt6_info *rt, void *arg)
1410{
1411 unsigned long now = jiffies;
1412
1413 /*
1414 * check addrconf expiration here.
1415 * Routes are expired even if they are in use.
1416 *
1417 * Also age clones. Note, that clones are aged out
1418 * only if they are not in use now.
1419 */
1420
1421 if (rt->rt6i_flags&RTF_EXPIRES && rt->rt6i_expires) {
1422 if (time_after(now, rt->rt6i_expires)) {
1423 RT6_TRACE("expiring %p\n", rt);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001424 return -1;
1425 }
1426 gc_args.more++;
1427 } else if (rt->rt6i_flags & RTF_CACHE) {
1428 if (atomic_read(&rt->u.dst.__refcnt) == 0 &&
1429 time_after_eq(now, rt->u.dst.lastuse + gc_args.timeout)) {
1430 RT6_TRACE("aging clone %p\n", rt);
1431 return -1;
1432 } else if ((rt->rt6i_flags & RTF_GATEWAY) &&
1433 (!(rt->rt6i_nexthop->flags & NTF_ROUTER))) {
1434 RT6_TRACE("purging route %p via non-router but gateway\n",
1435 rt);
1436 return -1;
1437 }
1438 gc_args.more++;
1439 }
1440
1441 return 0;
1442}
1443
1444static DEFINE_SPINLOCK(fib6_gc_lock);
1445
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001446void fib6_run_gc(unsigned long expires, struct net *net)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001447{
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001448 if (expires != ~0UL) {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001449 spin_lock_bh(&fib6_gc_lock);
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001450 gc_args.timeout = expires ? (int)expires :
1451 net->ipv6.sysctl.ip6_rt_gc_interval;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001452 } else {
Stephen Hemmingera76d7342008-07-22 14:34:35 -07001453 if (!spin_trylock_bh(&fib6_gc_lock)) {
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001454 mod_timer(&net->ipv6.ip6_fib_timer, jiffies + HZ);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001455 return;
1456 }
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001457 gc_args.timeout = net->ipv6.sysctl.ip6_rt_gc_interval;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001458 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001459
Stephen Hemminger3d0f24a2008-07-22 14:35:50 -07001460 gc_args.more = icmp6_dst_gc();
Daniel Lezcanof3db4852008-03-03 23:27:06 -08001461
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001462 fib6_clean_all(net, fib6_age, 0, NULL);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001463
1464 if (gc_args.more)
Stephen Hemmingerc8a45222008-07-22 14:34:09 -07001465 mod_timer(&net->ipv6.ip6_fib_timer,
1466 round_jiffies(jiffies
1467 + net->ipv6.sysctl.ip6_rt_gc_interval));
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001468 else
1469 del_timer(&net->ipv6.ip6_fib_timer);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001470 spin_unlock_bh(&fib6_gc_lock);
1471}
1472
Daniel Lezcano5b7c9312008-03-03 23:28:58 -08001473static void fib6_gc_timer_cb(unsigned long arg)
1474{
1475 fib6_run_gc(0, (struct net *)arg);
1476}
1477
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001478static int fib6_net_init(struct net *net)
1479{
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001480 setup_timer(&net->ipv6.ip6_fib_timer, fib6_gc_timer_cb, (unsigned long)net);
Daniel Lezcano63152fc2008-03-03 23:31:11 -08001481
Benjamin Theryc5728722008-03-03 23:34:17 -08001482 net->ipv6.rt6_stats = kzalloc(sizeof(*net->ipv6.rt6_stats), GFP_KERNEL);
1483 if (!net->ipv6.rt6_stats)
1484 goto out_timer;
1485
Stephen Hemminger75307c02008-07-22 14:35:07 -07001486 net->ipv6.fib_table_hash = kcalloc(FIB_TABLE_HASHSZ,
1487 sizeof(*net->ipv6.fib_table_hash),
1488 GFP_KERNEL);
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001489 if (!net->ipv6.fib_table_hash)
Benjamin Theryc5728722008-03-03 23:34:17 -08001490 goto out_rt6_stats;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001491
1492 net->ipv6.fib6_main_tbl = kzalloc(sizeof(*net->ipv6.fib6_main_tbl),
1493 GFP_KERNEL);
1494 if (!net->ipv6.fib6_main_tbl)
1495 goto out_fib_table_hash;
1496
1497 net->ipv6.fib6_main_tbl->tb6_id = RT6_TABLE_MAIN;
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001498 net->ipv6.fib6_main_tbl->tb6_root.leaf = net->ipv6.ip6_null_entry;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001499 net->ipv6.fib6_main_tbl->tb6_root.fn_flags =
1500 RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO;
1501
1502#ifdef CONFIG_IPV6_MULTIPLE_TABLES
1503 net->ipv6.fib6_local_tbl = kzalloc(sizeof(*net->ipv6.fib6_local_tbl),
1504 GFP_KERNEL);
1505 if (!net->ipv6.fib6_local_tbl)
1506 goto out_fib6_main_tbl;
1507 net->ipv6.fib6_local_tbl->tb6_id = RT6_TABLE_LOCAL;
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001508 net->ipv6.fib6_local_tbl->tb6_root.leaf = net->ipv6.ip6_null_entry;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001509 net->ipv6.fib6_local_tbl->tb6_root.fn_flags =
1510 RTN_ROOT | RTN_TL_ROOT | RTN_RTINFO;
1511#endif
1512 fib6_tables_init(net);
1513
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001514 return 0;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001515
1516#ifdef CONFIG_IPV6_MULTIPLE_TABLES
1517out_fib6_main_tbl:
1518 kfree(net->ipv6.fib6_main_tbl);
1519#endif
1520out_fib_table_hash:
1521 kfree(net->ipv6.fib_table_hash);
Benjamin Theryc5728722008-03-03 23:34:17 -08001522out_rt6_stats:
1523 kfree(net->ipv6.rt6_stats);
Daniel Lezcano63152fc2008-03-03 23:31:11 -08001524out_timer:
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001525 return -ENOMEM;
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001526 }
1527
1528static void fib6_net_exit(struct net *net)
1529{
Daniel Lezcano8ed67782008-03-04 13:48:30 -08001530 rt6_ifdown(net, NULL);
Stephen Hemminger417f28b2008-07-22 14:33:45 -07001531 del_timer_sync(&net->ipv6.ip6_fib_timer);
1532
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001533#ifdef CONFIG_IPV6_MULTIPLE_TABLES
1534 kfree(net->ipv6.fib6_local_tbl);
1535#endif
1536 kfree(net->ipv6.fib6_main_tbl);
1537 kfree(net->ipv6.fib_table_hash);
Benjamin Theryc5728722008-03-03 23:34:17 -08001538 kfree(net->ipv6.rt6_stats);
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001539}
1540
1541static struct pernet_operations fib6_net_ops = {
1542 .init = fib6_net_init,
1543 .exit = fib6_net_exit,
1544};
1545
Daniel Lezcanod63bddb2007-12-07 00:40:34 -08001546int __init fib6_init(void)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001547{
Daniel Lezcanoe0b85592008-03-03 23:24:31 -08001548 int ret = -ENOMEM;
Daniel Lezcano63152fc2008-03-03 23:31:11 -08001549
Linus Torvalds1da177e2005-04-16 15:20:36 -07001550 fib6_node_kmem = kmem_cache_create("fib6_nodes",
1551 sizeof(struct fib6_node),
Daniel Lezcanof845ab62007-12-07 00:45:16 -08001552 0, SLAB_HWCACHE_ALIGN,
Paul Mundt20c2df82007-07-20 10:11:58 +09001553 NULL);
Daniel Lezcanof845ab62007-12-07 00:45:16 -08001554 if (!fib6_node_kmem)
Daniel Lezcanoe0b85592008-03-03 23:24:31 -08001555 goto out;
1556
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001557 ret = register_pernet_subsys(&fib6_net_ops);
1558 if (ret)
Benjamin Theryc5728722008-03-03 23:34:17 -08001559 goto out_kmem_cache_create;
Daniel Lezcanoe0b85592008-03-03 23:24:31 -08001560
Daniel Lezcanod63bddb2007-12-07 00:40:34 -08001561 ret = __rtnl_register(PF_INET6, RTM_GETROUTE, NULL, inet6_dump_fib);
1562 if (ret)
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001563 goto out_unregister_subsys;
Daniel Lezcanod63bddb2007-12-07 00:40:34 -08001564out:
1565 return ret;
1566
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001567out_unregister_subsys:
1568 unregister_pernet_subsys(&fib6_net_ops);
Daniel Lezcanod63bddb2007-12-07 00:40:34 -08001569out_kmem_cache_create:
1570 kmem_cache_destroy(fib6_node_kmem);
1571 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001572}
1573
1574void fib6_gc_cleanup(void)
1575{
Daniel Lezcano58f09b72008-03-03 23:25:27 -08001576 unregister_pernet_subsys(&fib6_net_ops);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001577 kmem_cache_destroy(fib6_node_kmem);
1578}