Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1 | /* |
| 2 | * This program is free software; you can redistribute it and/or |
| 3 | * modify it under the terms of the GNU General Public License |
| 4 | * as published by the Free Software Foundation; either version |
| 5 | * 2 of the License, or (at your option) any later version. |
| 6 | * |
| 7 | * Robert Olsson <robert.olsson@its.uu.se> Uppsala Universitet |
| 8 | * & Swedish University of Agricultural Sciences. |
| 9 | * |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 10 | * Jens Laas <jens.laas@data.slu.se> Swedish University of |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 11 | * Agricultural Sciences. |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 12 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 13 | * Hans Liss <hans.liss@its.uu.se> Uppsala Universitet |
| 14 | * |
| 15 | * This work is based on the LPC-trie which is originally descibed in: |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 16 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 17 | * An experimental study of compression methods for dynamic tries |
| 18 | * Stefan Nilsson and Matti Tikkanen. Algorithmica, 33(1):19-33, 2002. |
| 19 | * http://www.nada.kth.se/~snilsson/public/papers/dyntrie2/ |
| 20 | * |
| 21 | * |
| 22 | * IP-address lookup using LC-tries. Stefan Nilsson and Gunnar Karlsson |
| 23 | * IEEE Journal on Selected Areas in Communications, 17(6):1083-1092, June 1999 |
| 24 | * |
| 25 | * Version: $Id: fib_trie.c,v 1.3 2005/06/08 14:20:01 robert Exp $ |
| 26 | * |
| 27 | * |
| 28 | * Code from fib_hash has been reused which includes the following header: |
| 29 | * |
| 30 | * |
| 31 | * INET An implementation of the TCP/IP protocol suite for the LINUX |
| 32 | * operating system. INET is implemented using the BSD Socket |
| 33 | * interface as the means of communication with the user level. |
| 34 | * |
| 35 | * IPv4 FIB: lookup engine and maintenance routines. |
| 36 | * |
| 37 | * |
| 38 | * Authors: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru> |
| 39 | * |
| 40 | * This program is free software; you can redistribute it and/or |
| 41 | * modify it under the terms of the GNU General Public License |
| 42 | * as published by the Free Software Foundation; either version |
| 43 | * 2 of the License, or (at your option) any later version. |
Robert Olsson | fd96625 | 2005-12-22 11:25:10 -0800 | [diff] [blame] | 44 | * |
| 45 | * Substantial contributions to this work comes from: |
| 46 | * |
| 47 | * David S. Miller, <davem@davemloft.net> |
| 48 | * Stephen Hemminger <shemminger@osdl.org> |
| 49 | * Paul E. McKenney <paulmck@us.ibm.com> |
| 50 | * Patrick McHardy <kaber@trash.net> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 51 | */ |
| 52 | |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 53 | #define VERSION "0.408" |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 54 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 55 | #include <asm/uaccess.h> |
| 56 | #include <asm/system.h> |
Jiri Slaby | 1977f03 | 2007-10-18 23:40:25 -0700 | [diff] [blame] | 57 | #include <linux/bitops.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 58 | #include <linux/types.h> |
| 59 | #include <linux/kernel.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 60 | #include <linux/mm.h> |
| 61 | #include <linux/string.h> |
| 62 | #include <linux/socket.h> |
| 63 | #include <linux/sockios.h> |
| 64 | #include <linux/errno.h> |
| 65 | #include <linux/in.h> |
| 66 | #include <linux/inet.h> |
Stephen Hemminger | cd8787a | 2006-01-03 14:38:34 -0800 | [diff] [blame] | 67 | #include <linux/inetdevice.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 68 | #include <linux/netdevice.h> |
| 69 | #include <linux/if_arp.h> |
| 70 | #include <linux/proc_fs.h> |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 71 | #include <linux/rcupdate.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 72 | #include <linux/skbuff.h> |
| 73 | #include <linux/netlink.h> |
| 74 | #include <linux/init.h> |
| 75 | #include <linux/list.h> |
Eric W. Biederman | 457c4cb | 2007-09-12 12:01:34 +0200 | [diff] [blame] | 76 | #include <net/net_namespace.h> |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 77 | #include <net/ip.h> |
| 78 | #include <net/protocol.h> |
| 79 | #include <net/route.h> |
| 80 | #include <net/tcp.h> |
| 81 | #include <net/sock.h> |
| 82 | #include <net/ip_fib.h> |
| 83 | #include "fib_lookup.h" |
| 84 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 85 | #define MAX_STAT_DEPTH 32 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 86 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 87 | #define KEYLENGTH (8*sizeof(t_key)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 88 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 89 | typedef unsigned int t_key; |
| 90 | |
| 91 | #define T_TNODE 0 |
| 92 | #define T_LEAF 1 |
| 93 | #define NODE_TYPE_MASK 0x1UL |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 94 | #define NODE_TYPE(node) ((node)->parent & NODE_TYPE_MASK) |
| 95 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 96 | #define IS_TNODE(n) (!(n->parent & T_LEAF)) |
| 97 | #define IS_LEAF(n) (n->parent & T_LEAF) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 98 | |
| 99 | struct node { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 100 | unsigned long parent; |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 101 | t_key key; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 102 | }; |
| 103 | |
| 104 | struct leaf { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 105 | unsigned long parent; |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 106 | t_key key; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 107 | struct hlist_head list; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 108 | struct rcu_head rcu; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 109 | }; |
| 110 | |
| 111 | struct leaf_info { |
| 112 | struct hlist_node hlist; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 113 | struct rcu_head rcu; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 114 | int plen; |
| 115 | struct list_head falh; |
| 116 | }; |
| 117 | |
| 118 | struct tnode { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 119 | unsigned long parent; |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 120 | t_key key; |
Eric Dumazet | 112d8cf | 2008-01-12 21:27:41 -0800 | [diff] [blame] | 121 | unsigned char pos; /* 2log(KEYLENGTH) bits needed */ |
| 122 | unsigned char bits; /* 2log(KEYLENGTH) bits needed */ |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 123 | unsigned int full_children; /* KEYLENGTH bits needed */ |
| 124 | unsigned int empty_children; /* KEYLENGTH bits needed */ |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame^] | 125 | union { |
| 126 | struct rcu_head rcu; |
| 127 | struct work_struct work; |
| 128 | }; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 129 | struct node *child[0]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 130 | }; |
| 131 | |
| 132 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 133 | struct trie_use_stats { |
| 134 | unsigned int gets; |
| 135 | unsigned int backtrack; |
| 136 | unsigned int semantic_match_passed; |
| 137 | unsigned int semantic_match_miss; |
| 138 | unsigned int null_node_hit; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 139 | unsigned int resize_node_skipped; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 140 | }; |
| 141 | #endif |
| 142 | |
| 143 | struct trie_stat { |
| 144 | unsigned int totdepth; |
| 145 | unsigned int maxdepth; |
| 146 | unsigned int tnodes; |
| 147 | unsigned int leaves; |
| 148 | unsigned int nullpointers; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 149 | unsigned int prefixes; |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 150 | unsigned int nodesizes[MAX_STAT_DEPTH]; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 151 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 152 | |
| 153 | struct trie { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 154 | struct node *trie; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 155 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 156 | struct trie_use_stats stats; |
| 157 | #endif |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 158 | }; |
| 159 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 160 | static void put_child(struct trie *t, struct tnode *tn, int i, struct node *n); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 161 | static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n, |
| 162 | int wasfull); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 163 | static struct node *resize(struct trie *t, struct tnode *tn); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 164 | static struct tnode *inflate(struct trie *t, struct tnode *tn); |
| 165 | static struct tnode *halve(struct trie *t, struct tnode *tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 166 | static void tnode_free(struct tnode *tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 167 | |
Christoph Lameter | e18b890 | 2006-12-06 20:33:20 -0800 | [diff] [blame] | 168 | static struct kmem_cache *fn_alias_kmem __read_mostly; |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 169 | static struct kmem_cache *trie_leaf_kmem __read_mostly; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 170 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 171 | static inline struct tnode *node_parent(struct node *node) |
| 172 | { |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 173 | return (struct tnode *)(node->parent & ~NODE_TYPE_MASK); |
| 174 | } |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 175 | |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 176 | static inline struct tnode *node_parent_rcu(struct node *node) |
| 177 | { |
| 178 | struct tnode *ret = node_parent(node); |
| 179 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 180 | return rcu_dereference(ret); |
| 181 | } |
| 182 | |
Stephen Hemminger | 6440cc9 | 2008-03-22 17:59:58 -0700 | [diff] [blame] | 183 | /* Same as rcu_assign_pointer |
| 184 | * but that macro() assumes that value is a pointer. |
| 185 | */ |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 186 | static inline void node_set_parent(struct node *node, struct tnode *ptr) |
| 187 | { |
Stephen Hemminger | 6440cc9 | 2008-03-22 17:59:58 -0700 | [diff] [blame] | 188 | smp_wmb(); |
| 189 | node->parent = (unsigned long)ptr | NODE_TYPE(node); |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 190 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 191 | |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 192 | static inline struct node *tnode_get_child(struct tnode *tn, unsigned int i) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 193 | { |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 194 | BUG_ON(i >= 1U << tn->bits); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 195 | |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 196 | return tn->child[i]; |
| 197 | } |
| 198 | |
| 199 | static inline struct node *tnode_get_child_rcu(struct tnode *tn, unsigned int i) |
| 200 | { |
| 201 | struct node *ret = tnode_get_child(tn, i); |
| 202 | |
| 203 | return rcu_dereference(ret); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 204 | } |
| 205 | |
Stephen Hemmigner | bb435b8 | 2005-08-09 20:25:39 -0700 | [diff] [blame] | 206 | static inline int tnode_child_length(const struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 207 | { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 208 | return 1 << tn->bits; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 209 | } |
| 210 | |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 211 | static inline t_key mask_pfx(t_key k, unsigned short l) |
| 212 | { |
| 213 | return (l == 0) ? 0 : k >> (KEYLENGTH-l) << (KEYLENGTH-l); |
| 214 | } |
| 215 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 216 | static inline t_key tkey_extract_bits(t_key a, int offset, int bits) |
| 217 | { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 218 | if (offset < KEYLENGTH) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 219 | return ((t_key)(a << offset)) >> (KEYLENGTH - bits); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 220 | else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 221 | return 0; |
| 222 | } |
| 223 | |
| 224 | static inline int tkey_equals(t_key a, t_key b) |
| 225 | { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 226 | return a == b; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 227 | } |
| 228 | |
| 229 | static inline int tkey_sub_equals(t_key a, int offset, int bits, t_key b) |
| 230 | { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 231 | if (bits == 0 || offset >= KEYLENGTH) |
| 232 | return 1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 233 | bits = bits > KEYLENGTH ? KEYLENGTH : bits; |
| 234 | return ((a ^ b) << offset) >> (KEYLENGTH - bits) == 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 235 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 236 | |
| 237 | static inline int tkey_mismatch(t_key a, int offset, t_key b) |
| 238 | { |
| 239 | t_key diff = a ^ b; |
| 240 | int i = offset; |
| 241 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 242 | if (!diff) |
| 243 | return 0; |
| 244 | while ((diff << i) >> (KEYLENGTH-1) == 0) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 245 | i++; |
| 246 | return i; |
| 247 | } |
| 248 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 249 | /* |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 250 | To understand this stuff, an understanding of keys and all their bits is |
| 251 | necessary. Every node in the trie has a key associated with it, but not |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 252 | all of the bits in that key are significant. |
| 253 | |
| 254 | Consider a node 'n' and its parent 'tp'. |
| 255 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 256 | If n is a leaf, every bit in its key is significant. Its presence is |
| 257 | necessitated by path compression, since during a tree traversal (when |
| 258 | searching for a leaf - unless we are doing an insertion) we will completely |
| 259 | ignore all skipped bits we encounter. Thus we need to verify, at the end of |
| 260 | a potentially successful search, that we have indeed been walking the |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 261 | correct key path. |
| 262 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 263 | Note that we can never "miss" the correct key in the tree if present by |
| 264 | following the wrong path. Path compression ensures that segments of the key |
| 265 | that are the same for all keys with a given prefix are skipped, but the |
| 266 | skipped part *is* identical for each node in the subtrie below the skipped |
| 267 | bit! trie_insert() in this implementation takes care of that - note the |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 268 | call to tkey_sub_equals() in trie_insert(). |
| 269 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 270 | if n is an internal node - a 'tnode' here, the various parts of its key |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 271 | have many different meanings. |
| 272 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 273 | Example: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 274 | _________________________________________________________________ |
| 275 | | i | i | i | i | i | i | i | N | N | N | S | S | S | S | S | C | |
| 276 | ----------------------------------------------------------------- |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 277 | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 278 | |
| 279 | _________________________________________________________________ |
| 280 | | C | C | C | u | u | u | u | u | u | u | u | u | u | u | u | u | |
| 281 | ----------------------------------------------------------------- |
| 282 | 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
| 283 | |
| 284 | tp->pos = 7 |
| 285 | tp->bits = 3 |
| 286 | n->pos = 15 |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 287 | n->bits = 4 |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 288 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 289 | First, let's just ignore the bits that come before the parent tp, that is |
| 290 | the bits from 0 to (tp->pos-1). They are *known* but at this point we do |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 291 | not use them for anything. |
| 292 | |
| 293 | The bits from (tp->pos) to (tp->pos + tp->bits - 1) - "N", above - are the |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 294 | index into the parent's child array. That is, they will be used to find |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 295 | 'n' among tp's children. |
| 296 | |
| 297 | The bits from (tp->pos + tp->bits) to (n->pos - 1) - "S" - are skipped bits |
| 298 | for the node n. |
| 299 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 300 | All the bits we have seen so far are significant to the node n. The rest |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 301 | of the bits are really not needed or indeed known in n->key. |
| 302 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 303 | The bits from (n->pos) to (n->pos + n->bits - 1) - "C" - are the index into |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 304 | n's child array, and will of course be different for each child. |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 305 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 306 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 307 | The rest of the bits, from (n->pos + n->bits) onward, are completely unknown |
| 308 | at this point. |
| 309 | |
| 310 | */ |
| 311 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 312 | static inline void check_tnode(const struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 313 | { |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 314 | WARN_ON(tn && tn->pos+tn->bits > 32); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 315 | } |
| 316 | |
Denis V. Lunev | f5026fa | 2007-12-13 09:47:57 -0800 | [diff] [blame] | 317 | static const int halve_threshold = 25; |
| 318 | static const int inflate_threshold = 50; |
| 319 | static const int halve_threshold_root = 8; |
| 320 | static const int inflate_threshold_root = 15; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 321 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 322 | |
| 323 | static void __alias_free_mem(struct rcu_head *head) |
| 324 | { |
| 325 | struct fib_alias *fa = container_of(head, struct fib_alias, rcu); |
| 326 | kmem_cache_free(fn_alias_kmem, fa); |
| 327 | } |
| 328 | |
| 329 | static inline void alias_free_mem_rcu(struct fib_alias *fa) |
| 330 | { |
| 331 | call_rcu(&fa->rcu, __alias_free_mem); |
| 332 | } |
| 333 | |
| 334 | static void __leaf_free_rcu(struct rcu_head *head) |
| 335 | { |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 336 | struct leaf *l = container_of(head, struct leaf, rcu); |
| 337 | kmem_cache_free(trie_leaf_kmem, l); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 338 | } |
| 339 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 340 | static void __leaf_info_free_rcu(struct rcu_head *head) |
| 341 | { |
| 342 | kfree(container_of(head, struct leaf_info, rcu)); |
| 343 | } |
| 344 | |
| 345 | static inline void free_leaf_info(struct leaf_info *leaf) |
| 346 | { |
| 347 | call_rcu(&leaf->rcu, __leaf_info_free_rcu); |
| 348 | } |
| 349 | |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 350 | static struct tnode *tnode_alloc(size_t size) |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 351 | { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 352 | if (size <= PAGE_SIZE) |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 353 | return kzalloc(size, GFP_KERNEL); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame^] | 354 | else |
| 355 | return __vmalloc(size, GFP_KERNEL | __GFP_ZERO, PAGE_KERNEL); |
| 356 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 357 | |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame^] | 358 | static void __tnode_vfree(struct work_struct *arg) |
| 359 | { |
| 360 | struct tnode *tn = container_of(arg, struct tnode, work); |
| 361 | vfree(tn); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 362 | } |
| 363 | |
| 364 | static void __tnode_free_rcu(struct rcu_head *head) |
| 365 | { |
| 366 | struct tnode *tn = container_of(head, struct tnode, rcu); |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 367 | size_t size = sizeof(struct tnode) + |
| 368 | (sizeof(struct node *) << tn->bits); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 369 | |
| 370 | if (size <= PAGE_SIZE) |
| 371 | kfree(tn); |
Stephen Hemminger | 15be75c | 2008-04-10 02:56:38 -0700 | [diff] [blame^] | 372 | else { |
| 373 | INIT_WORK(&tn->work, __tnode_vfree); |
| 374 | schedule_work(&tn->work); |
| 375 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 376 | } |
| 377 | |
| 378 | static inline void tnode_free(struct tnode *tn) |
| 379 | { |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 380 | if (IS_LEAF(tn)) { |
Robert Olsson | 550e29b | 2006-04-04 12:53:35 -0700 | [diff] [blame] | 381 | struct leaf *l = (struct leaf *) tn; |
| 382 | call_rcu_bh(&l->rcu, __leaf_free_rcu); |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 383 | } else |
Robert Olsson | 550e29b | 2006-04-04 12:53:35 -0700 | [diff] [blame] | 384 | call_rcu(&tn->rcu, __tnode_free_rcu); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 385 | } |
| 386 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 387 | static struct leaf *leaf_new(void) |
| 388 | { |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 389 | struct leaf *l = kmem_cache_alloc(trie_leaf_kmem, GFP_KERNEL); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 390 | if (l) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 391 | l->parent = T_LEAF; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 392 | INIT_HLIST_HEAD(&l->list); |
| 393 | } |
| 394 | return l; |
| 395 | } |
| 396 | |
| 397 | static struct leaf_info *leaf_info_new(int plen) |
| 398 | { |
| 399 | struct leaf_info *li = kmalloc(sizeof(struct leaf_info), GFP_KERNEL); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 400 | if (li) { |
| 401 | li->plen = plen; |
| 402 | INIT_LIST_HEAD(&li->falh); |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 403 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 404 | return li; |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 405 | } |
| 406 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 407 | static struct tnode *tnode_new(t_key key, int pos, int bits) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 408 | { |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 409 | size_t sz = sizeof(struct tnode) + (sizeof(struct node *) << bits); |
Patrick McHardy | f0e36f8 | 2005-07-05 14:44:55 -0700 | [diff] [blame] | 410 | struct tnode *tn = tnode_alloc(sz); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 411 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 412 | if (tn) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 413 | tn->parent = T_TNODE; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 414 | tn->pos = pos; |
| 415 | tn->bits = bits; |
| 416 | tn->key = key; |
| 417 | tn->full_children = 0; |
| 418 | tn->empty_children = 1<<bits; |
| 419 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 420 | |
Eric Dumazet | 8d96544 | 2008-01-13 22:31:44 -0800 | [diff] [blame] | 421 | pr_debug("AT %p s=%u %lu\n", tn, (unsigned int) sizeof(struct tnode), |
| 422 | (unsigned long) (sizeof(struct node) << bits)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 423 | return tn; |
| 424 | } |
| 425 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 426 | /* |
| 427 | * Check whether a tnode 'n' is "full", i.e. it is an internal node |
| 428 | * and no bits are skipped. See discussion in dyntree paper p. 6 |
| 429 | */ |
| 430 | |
Stephen Hemmigner | bb435b8 | 2005-08-09 20:25:39 -0700 | [diff] [blame] | 431 | static inline int tnode_full(const struct tnode *tn, const struct node *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 432 | { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 433 | if (n == NULL || IS_LEAF(n)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 434 | return 0; |
| 435 | |
| 436 | return ((struct tnode *) n)->pos == tn->pos + tn->bits; |
| 437 | } |
| 438 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 439 | static inline void put_child(struct trie *t, struct tnode *tn, int i, |
| 440 | struct node *n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 441 | { |
| 442 | tnode_put_child_reorg(tn, i, n, -1); |
| 443 | } |
| 444 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 445 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 446 | * Add a child at position i overwriting the old value. |
| 447 | * Update the value of full_children and empty_children. |
| 448 | */ |
| 449 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 450 | static void tnode_put_child_reorg(struct tnode *tn, int i, struct node *n, |
| 451 | int wasfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 452 | { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 453 | struct node *chi = tn->child[i]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 454 | int isfull; |
| 455 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 456 | BUG_ON(i >= 1<<tn->bits); |
| 457 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 458 | /* update emptyChildren */ |
| 459 | if (n == NULL && chi != NULL) |
| 460 | tn->empty_children++; |
| 461 | else if (n != NULL && chi == NULL) |
| 462 | tn->empty_children--; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 463 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 464 | /* update fullChildren */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 465 | if (wasfull == -1) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 466 | wasfull = tnode_full(tn, chi); |
| 467 | |
| 468 | isfull = tnode_full(tn, n); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 469 | if (wasfull && !isfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 470 | tn->full_children--; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 471 | else if (!wasfull && isfull) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 472 | tn->full_children++; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 473 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 474 | if (n) |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 475 | node_set_parent(n, tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 476 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 477 | rcu_assign_pointer(tn->child[i], n); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 478 | } |
| 479 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 480 | static struct node *resize(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 481 | { |
| 482 | int i; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 483 | int err = 0; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 484 | struct tnode *old_tn; |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 485 | int inflate_threshold_use; |
| 486 | int halve_threshold_use; |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 487 | int max_resize; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 488 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 489 | if (!tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 490 | return NULL; |
| 491 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 492 | pr_debug("In tnode_resize %p inflate_threshold=%d threshold=%d\n", |
| 493 | tn, inflate_threshold, halve_threshold); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 494 | |
| 495 | /* No children */ |
| 496 | if (tn->empty_children == tnode_child_length(tn)) { |
| 497 | tnode_free(tn); |
| 498 | return NULL; |
| 499 | } |
| 500 | /* One child */ |
| 501 | if (tn->empty_children == tnode_child_length(tn) - 1) |
| 502 | for (i = 0; i < tnode_child_length(tn); i++) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 503 | struct node *n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 504 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 505 | n = tn->child[i]; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 506 | if (!n) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 507 | continue; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 508 | |
| 509 | /* compress one level */ |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 510 | node_set_parent(n, NULL); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 511 | tnode_free(tn); |
| 512 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 513 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 514 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 515 | * Double as long as the resulting node has a number of |
| 516 | * nonempty nodes that are above the threshold. |
| 517 | */ |
| 518 | |
| 519 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 520 | * From "Implementing a dynamic compressed trie" by Stefan Nilsson of |
| 521 | * the Helsinki University of Technology and Matti Tikkanen of Nokia |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 522 | * Telecommunications, page 6: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 523 | * "A node is doubled if the ratio of non-empty children to all |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 524 | * children in the *doubled* node is at least 'high'." |
| 525 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 526 | * 'high' in this instance is the variable 'inflate_threshold'. It |
| 527 | * is expressed as a percentage, so we multiply it with |
| 528 | * tnode_child_length() and instead of multiplying by 2 (since the |
| 529 | * child array will be doubled by inflate()) and multiplying |
| 530 | * the left-hand side by 100 (to handle the percentage thing) we |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 531 | * multiply the left-hand side by 50. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 532 | * |
| 533 | * The left-hand side may look a bit weird: tnode_child_length(tn) |
| 534 | * - tn->empty_children is of course the number of non-null children |
| 535 | * in the current node. tn->full_children is the number of "full" |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 536 | * children, that is non-null tnodes with a skip value of 0. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 537 | * All of those will be doubled in the resulting inflated tnode, so |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 538 | * we just count them one extra time here. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 539 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 540 | * A clearer way to write this would be: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 541 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 542 | * to_be_doubled = tn->full_children; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 543 | * not_to_be_doubled = tnode_child_length(tn) - tn->empty_children - |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 544 | * tn->full_children; |
| 545 | * |
| 546 | * new_child_length = tnode_child_length(tn) * 2; |
| 547 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 548 | * new_fill_factor = 100 * (not_to_be_doubled + 2*to_be_doubled) / |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 549 | * new_child_length; |
| 550 | * if (new_fill_factor >= inflate_threshold) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 551 | * |
| 552 | * ...and so on, tho it would mess up the while () loop. |
| 553 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 554 | * anyway, |
| 555 | * 100 * (not_to_be_doubled + 2*to_be_doubled) / new_child_length >= |
| 556 | * inflate_threshold |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 557 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 558 | * avoid a division: |
| 559 | * 100 * (not_to_be_doubled + 2*to_be_doubled) >= |
| 560 | * inflate_threshold * new_child_length |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 561 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 562 | * expand not_to_be_doubled and to_be_doubled, and shorten: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 563 | * 100 * (tnode_child_length(tn) - tn->empty_children + |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 564 | * tn->full_children) >= inflate_threshold * new_child_length |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 565 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 566 | * expand new_child_length: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 567 | * 100 * (tnode_child_length(tn) - tn->empty_children + |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 568 | * tn->full_children) >= |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 569 | * inflate_threshold * tnode_child_length(tn) * 2 |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 570 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 571 | * shorten again: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 572 | * 50 * (tn->full_children + tnode_child_length(tn) - |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 573 | * tn->empty_children) >= inflate_threshold * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 574 | * tnode_child_length(tn) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 575 | * |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 576 | */ |
| 577 | |
| 578 | check_tnode(tn); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 579 | |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 580 | /* Keep root node larger */ |
| 581 | |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 582 | if (!tn->parent) |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 583 | inflate_threshold_use = inflate_threshold_root; |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 584 | else |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 585 | inflate_threshold_use = inflate_threshold; |
| 586 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 587 | err = 0; |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 588 | max_resize = 10; |
| 589 | while ((tn->full_children > 0 && max_resize-- && |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 590 | 50 * (tn->full_children + tnode_child_length(tn) |
| 591 | - tn->empty_children) |
| 592 | >= inflate_threshold_use * tnode_child_length(tn))) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 593 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 594 | old_tn = tn; |
| 595 | tn = inflate(t, tn); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 596 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 597 | if (IS_ERR(tn)) { |
| 598 | tn = old_tn; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 599 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 600 | t->stats.resize_node_skipped++; |
| 601 | #endif |
| 602 | break; |
| 603 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 604 | } |
| 605 | |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 606 | if (max_resize < 0) { |
| 607 | if (!tn->parent) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 608 | pr_warning("Fix inflate_threshold_root." |
| 609 | " Now=%d size=%d bits\n", |
| 610 | inflate_threshold_root, tn->bits); |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 611 | else |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 612 | pr_warning("Fix inflate_threshold." |
| 613 | " Now=%d size=%d bits\n", |
| 614 | inflate_threshold, tn->bits); |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 615 | } |
| 616 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 617 | check_tnode(tn); |
| 618 | |
| 619 | /* |
| 620 | * Halve as long as the number of empty children in this |
| 621 | * node is above threshold. |
| 622 | */ |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 623 | |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 624 | |
| 625 | /* Keep root node larger */ |
| 626 | |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 627 | if (!tn->parent) |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 628 | halve_threshold_use = halve_threshold_root; |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 629 | else |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 630 | halve_threshold_use = halve_threshold; |
| 631 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 632 | err = 0; |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 633 | max_resize = 10; |
| 634 | while (tn->bits > 1 && max_resize-- && |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 635 | 100 * (tnode_child_length(tn) - tn->empty_children) < |
Robert Olsson | e6308be | 2005-10-04 13:01:58 -0700 | [diff] [blame] | 636 | halve_threshold_use * tnode_child_length(tn)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 637 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 638 | old_tn = tn; |
| 639 | tn = halve(t, tn); |
| 640 | if (IS_ERR(tn)) { |
| 641 | tn = old_tn; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 642 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 643 | t->stats.resize_node_skipped++; |
| 644 | #endif |
| 645 | break; |
| 646 | } |
| 647 | } |
| 648 | |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 649 | if (max_resize < 0) { |
| 650 | if (!tn->parent) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 651 | pr_warning("Fix halve_threshold_root." |
| 652 | " Now=%d size=%d bits\n", |
| 653 | halve_threshold_root, tn->bits); |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 654 | else |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 655 | pr_warning("Fix halve_threshold." |
| 656 | " Now=%d size=%d bits\n", |
| 657 | halve_threshold, tn->bits); |
Robert Olsson | 05eee48 | 2007-03-19 16:27:37 -0700 | [diff] [blame] | 658 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 659 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 660 | /* Only one child remains */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 661 | if (tn->empty_children == tnode_child_length(tn) - 1) |
| 662 | for (i = 0; i < tnode_child_length(tn); i++) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 663 | struct node *n; |
| 664 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 665 | n = tn->child[i]; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 666 | if (!n) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 667 | continue; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 668 | |
| 669 | /* compress one level */ |
| 670 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 671 | node_set_parent(n, NULL); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 672 | tnode_free(tn); |
| 673 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 674 | } |
| 675 | |
| 676 | return (struct node *) tn; |
| 677 | } |
| 678 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 679 | static struct tnode *inflate(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 680 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 681 | struct tnode *oldtnode = tn; |
| 682 | int olen = tnode_child_length(tn); |
| 683 | int i; |
| 684 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 685 | pr_debug("In inflate\n"); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 686 | |
| 687 | tn = tnode_new(oldtnode->key, oldtnode->pos, oldtnode->bits + 1); |
| 688 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 689 | if (!tn) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 690 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 691 | |
| 692 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 693 | * Preallocate and store tnodes before the actual work so we |
| 694 | * don't get into an inconsistent state if memory allocation |
| 695 | * fails. In case of failure we return the oldnode and inflate |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 696 | * of tnode is ignored. |
| 697 | */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 698 | |
| 699 | for (i = 0; i < olen; i++) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 700 | struct tnode *inode; |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 701 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 702 | inode = (struct tnode *) tnode_get_child(oldtnode, i); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 703 | if (inode && |
| 704 | IS_TNODE(inode) && |
| 705 | inode->pos == oldtnode->pos + oldtnode->bits && |
| 706 | inode->bits > 1) { |
| 707 | struct tnode *left, *right; |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 708 | t_key m = ~0U << (KEYLENGTH - 1) >> inode->pos; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 709 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 710 | left = tnode_new(inode->key&(~m), inode->pos + 1, |
| 711 | inode->bits - 1); |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 712 | if (!left) |
| 713 | goto nomem; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 714 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 715 | right = tnode_new(inode->key|m, inode->pos + 1, |
| 716 | inode->bits - 1); |
| 717 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 718 | if (!right) { |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 719 | tnode_free(left); |
| 720 | goto nomem; |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 721 | } |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 722 | |
| 723 | put_child(t, tn, 2*i, (struct node *) left); |
| 724 | put_child(t, tn, 2*i+1, (struct node *) right); |
| 725 | } |
| 726 | } |
| 727 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 728 | for (i = 0; i < olen; i++) { |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 729 | struct tnode *inode; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 730 | struct node *node = tnode_get_child(oldtnode, i); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 731 | struct tnode *left, *right; |
| 732 | int size, j; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 733 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 734 | /* An empty child */ |
| 735 | if (node == NULL) |
| 736 | continue; |
| 737 | |
| 738 | /* A leaf or an internal node with skipped bits */ |
| 739 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 740 | if (IS_LEAF(node) || ((struct tnode *) node)->pos > |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 741 | tn->pos + tn->bits - 1) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 742 | if (tkey_extract_bits(node->key, |
| 743 | oldtnode->pos + oldtnode->bits, |
| 744 | 1) == 0) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 745 | put_child(t, tn, 2*i, node); |
| 746 | else |
| 747 | put_child(t, tn, 2*i+1, node); |
| 748 | continue; |
| 749 | } |
| 750 | |
| 751 | /* An internal node with two children */ |
| 752 | inode = (struct tnode *) node; |
| 753 | |
| 754 | if (inode->bits == 1) { |
| 755 | put_child(t, tn, 2*i, inode->child[0]); |
| 756 | put_child(t, tn, 2*i+1, inode->child[1]); |
| 757 | |
| 758 | tnode_free(inode); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 759 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 760 | } |
| 761 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 762 | /* An internal node with more than two children */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 763 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 764 | /* We will replace this node 'inode' with two new |
| 765 | * ones, 'left' and 'right', each with half of the |
| 766 | * original children. The two new nodes will have |
| 767 | * a position one bit further down the key and this |
| 768 | * means that the "significant" part of their keys |
| 769 | * (see the discussion near the top of this file) |
| 770 | * will differ by one bit, which will be "0" in |
| 771 | * left's key and "1" in right's key. Since we are |
| 772 | * moving the key position by one step, the bit that |
| 773 | * we are moving away from - the bit at position |
| 774 | * (inode->pos) - is the one that will differ between |
| 775 | * left and right. So... we synthesize that bit in the |
| 776 | * two new keys. |
| 777 | * The mask 'm' below will be a single "one" bit at |
| 778 | * the position (inode->pos) |
| 779 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 780 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 781 | /* Use the old key, but set the new significant |
| 782 | * bit to zero. |
| 783 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 784 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 785 | left = (struct tnode *) tnode_get_child(tn, 2*i); |
| 786 | put_child(t, tn, 2*i, NULL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 787 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 788 | BUG_ON(!left); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 789 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 790 | right = (struct tnode *) tnode_get_child(tn, 2*i+1); |
| 791 | put_child(t, tn, 2*i+1, NULL); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 792 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 793 | BUG_ON(!right); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 794 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 795 | size = tnode_child_length(left); |
| 796 | for (j = 0; j < size; j++) { |
| 797 | put_child(t, left, j, inode->child[j]); |
| 798 | put_child(t, right, j, inode->child[j + size]); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 799 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 800 | put_child(t, tn, 2*i, resize(t, left)); |
| 801 | put_child(t, tn, 2*i+1, resize(t, right)); |
| 802 | |
| 803 | tnode_free(inode); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 804 | } |
| 805 | tnode_free(oldtnode); |
| 806 | return tn; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 807 | nomem: |
| 808 | { |
| 809 | int size = tnode_child_length(tn); |
| 810 | int j; |
| 811 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 812 | for (j = 0; j < size; j++) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 813 | if (tn->child[j]) |
| 814 | tnode_free((struct tnode *)tn->child[j]); |
| 815 | |
| 816 | tnode_free(tn); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 817 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 818 | return ERR_PTR(-ENOMEM); |
| 819 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 820 | } |
| 821 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 822 | static struct tnode *halve(struct trie *t, struct tnode *tn) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 823 | { |
| 824 | struct tnode *oldtnode = tn; |
| 825 | struct node *left, *right; |
| 826 | int i; |
| 827 | int olen = tnode_child_length(tn); |
| 828 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 829 | pr_debug("In halve\n"); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 830 | |
| 831 | tn = tnode_new(oldtnode->key, oldtnode->pos, oldtnode->bits - 1); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 832 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 833 | if (!tn) |
| 834 | return ERR_PTR(-ENOMEM); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 835 | |
| 836 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 837 | * Preallocate and store tnodes before the actual work so we |
| 838 | * don't get into an inconsistent state if memory allocation |
| 839 | * fails. In case of failure we return the oldnode and halve |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 840 | * of tnode is ignored. |
| 841 | */ |
| 842 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 843 | for (i = 0; i < olen; i += 2) { |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 844 | left = tnode_get_child(oldtnode, i); |
| 845 | right = tnode_get_child(oldtnode, i+1); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 846 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 847 | /* Two nonempty children */ |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 848 | if (left && right) { |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 849 | struct tnode *newn; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 850 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 851 | newn = tnode_new(left->key, tn->pos + tn->bits, 1); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 852 | |
| 853 | if (!newn) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 854 | goto nomem; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 855 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 856 | put_child(t, tn, i/2, (struct node *)newn); |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 857 | } |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 858 | |
Robert Olsson | 2f36895 | 2005-07-05 15:02:40 -0700 | [diff] [blame] | 859 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 860 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 861 | for (i = 0; i < olen; i += 2) { |
| 862 | struct tnode *newBinNode; |
| 863 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 864 | left = tnode_get_child(oldtnode, i); |
| 865 | right = tnode_get_child(oldtnode, i+1); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 866 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 867 | /* At least one of the children is empty */ |
| 868 | if (left == NULL) { |
| 869 | if (right == NULL) /* Both are empty */ |
| 870 | continue; |
| 871 | put_child(t, tn, i/2, right); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 872 | continue; |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 873 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 874 | |
| 875 | if (right == NULL) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 876 | put_child(t, tn, i/2, left); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 877 | continue; |
| 878 | } |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 879 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 880 | /* Two nonempty children */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 881 | newBinNode = (struct tnode *) tnode_get_child(tn, i/2); |
| 882 | put_child(t, tn, i/2, NULL); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 883 | put_child(t, newBinNode, 0, left); |
| 884 | put_child(t, newBinNode, 1, right); |
| 885 | put_child(t, tn, i/2, resize(t, newBinNode)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 886 | } |
| 887 | tnode_free(oldtnode); |
| 888 | return tn; |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 889 | nomem: |
| 890 | { |
| 891 | int size = tnode_child_length(tn); |
| 892 | int j; |
| 893 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 894 | for (j = 0; j < size; j++) |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 895 | if (tn->child[j]) |
| 896 | tnode_free((struct tnode *)tn->child[j]); |
| 897 | |
| 898 | tnode_free(tn); |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 899 | |
Robert Olsson | 2f80b3c | 2005-08-09 20:25:06 -0700 | [diff] [blame] | 900 | return ERR_PTR(-ENOMEM); |
| 901 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 902 | } |
| 903 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 904 | /* readside must use rcu_read_lock currently dump routines |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 905 | via get_fa_head and dump */ |
| 906 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 907 | static struct leaf_info *find_leaf_info(struct leaf *l, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 908 | { |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 909 | struct hlist_head *head = &l->list; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 910 | struct hlist_node *node; |
| 911 | struct leaf_info *li; |
| 912 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 913 | hlist_for_each_entry_rcu(li, node, head, hlist) |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 914 | if (li->plen == plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 915 | return li; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 916 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 917 | return NULL; |
| 918 | } |
| 919 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 920 | static inline struct list_head *get_fa_head(struct leaf *l, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 921 | { |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 922 | struct leaf_info *li = find_leaf_info(l, plen); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 923 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 924 | if (!li) |
| 925 | return NULL; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 926 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 927 | return &li->falh; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 928 | } |
| 929 | |
| 930 | static void insert_leaf_info(struct hlist_head *head, struct leaf_info *new) |
| 931 | { |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 932 | struct leaf_info *li = NULL, *last = NULL; |
| 933 | struct hlist_node *node; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 934 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 935 | if (hlist_empty(head)) { |
| 936 | hlist_add_head_rcu(&new->hlist, head); |
| 937 | } else { |
| 938 | hlist_for_each_entry(li, node, head, hlist) { |
| 939 | if (new->plen > li->plen) |
| 940 | break; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 941 | |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 942 | last = li; |
| 943 | } |
| 944 | if (last) |
| 945 | hlist_add_after_rcu(&last->hlist, &new->hlist); |
| 946 | else |
| 947 | hlist_add_before_rcu(&new->hlist, &li->hlist); |
| 948 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 949 | } |
| 950 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 951 | /* rcu_read_lock needs to be hold by caller from readside */ |
| 952 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 953 | static struct leaf * |
| 954 | fib_find_node(struct trie *t, u32 key) |
| 955 | { |
| 956 | int pos; |
| 957 | struct tnode *tn; |
| 958 | struct node *n; |
| 959 | |
| 960 | pos = 0; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 961 | n = rcu_dereference(t->trie); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 962 | |
| 963 | while (n != NULL && NODE_TYPE(n) == T_TNODE) { |
| 964 | tn = (struct tnode *) n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 965 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 966 | check_tnode(tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 967 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 968 | if (tkey_sub_equals(tn->key, pos, tn->pos-pos, key)) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 969 | pos = tn->pos + tn->bits; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 970 | n = tnode_get_child_rcu(tn, |
| 971 | tkey_extract_bits(key, |
| 972 | tn->pos, |
| 973 | tn->bits)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 974 | } else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 975 | break; |
| 976 | } |
| 977 | /* Case we have found a leaf. Compare prefixes */ |
| 978 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 979 | if (n != NULL && IS_LEAF(n) && tkey_equals(key, n->key)) |
| 980 | return (struct leaf *)n; |
| 981 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 982 | return NULL; |
| 983 | } |
| 984 | |
| 985 | static struct node *trie_rebalance(struct trie *t, struct tnode *tn) |
| 986 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 987 | int wasfull; |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 988 | t_key cindex, key = tn->key; |
| 989 | struct tnode *tp; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 990 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 991 | while (tn != NULL && (tp = node_parent((struct node *)tn)) != NULL) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 992 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
| 993 | wasfull = tnode_full(tp, tnode_get_child(tp, cindex)); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 994 | tn = (struct tnode *) resize(t, (struct tnode *)tn); |
| 995 | |
| 996 | tnode_put_child_reorg((struct tnode *)tp, cindex, |
| 997 | (struct node *)tn, wasfull); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 998 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 999 | tp = node_parent((struct node *) tn); |
| 1000 | if (!tp) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1001 | break; |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1002 | tn = tp; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1003 | } |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1004 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1005 | /* Handle last (top) tnode */ |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1006 | if (IS_TNODE(tn)) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1007 | tn = (struct tnode *)resize(t, (struct tnode *)tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1008 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1009 | return (struct node *)tn; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1010 | } |
| 1011 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1012 | /* only used from updater-side */ |
| 1013 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1014 | static struct list_head *fib_insert_node(struct trie *t, u32 key, int plen) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1015 | { |
| 1016 | int pos, newpos; |
| 1017 | struct tnode *tp = NULL, *tn = NULL; |
| 1018 | struct node *n; |
| 1019 | struct leaf *l; |
| 1020 | int missbit; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1021 | struct list_head *fa_head = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1022 | struct leaf_info *li; |
| 1023 | t_key cindex; |
| 1024 | |
| 1025 | pos = 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1026 | n = t->trie; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1027 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1028 | /* If we point to NULL, stop. Either the tree is empty and we should |
| 1029 | * just put a new leaf in if, or we have reached an empty child slot, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1030 | * and we should just put our new leaf in that. |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1031 | * If we point to a T_TNODE, check if it matches our key. Note that |
| 1032 | * a T_TNODE might be skipping any number of bits - its 'pos' need |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1033 | * not be the parent's 'pos'+'bits'! |
| 1034 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1035 | * If it does match the current key, get pos/bits from it, extract |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1036 | * the index from our key, push the T_TNODE and walk the tree. |
| 1037 | * |
| 1038 | * If it doesn't, we have to replace it with a new T_TNODE. |
| 1039 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1040 | * If we point to a T_LEAF, it might or might not have the same key |
| 1041 | * as we do. If it does, just change the value, update the T_LEAF's |
| 1042 | * value, and return it. |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1043 | * If it doesn't, we need to replace it with a T_TNODE. |
| 1044 | */ |
| 1045 | |
| 1046 | while (n != NULL && NODE_TYPE(n) == T_TNODE) { |
| 1047 | tn = (struct tnode *) n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1048 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1049 | check_tnode(tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1050 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1051 | if (tkey_sub_equals(tn->key, pos, tn->pos-pos, key)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1052 | tp = tn; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1053 | pos = tn->pos + tn->bits; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1054 | n = tnode_get_child(tn, |
| 1055 | tkey_extract_bits(key, |
| 1056 | tn->pos, |
| 1057 | tn->bits)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1058 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1059 | BUG_ON(n && node_parent(n) != tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1060 | } else |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1061 | break; |
| 1062 | } |
| 1063 | |
| 1064 | /* |
| 1065 | * n ----> NULL, LEAF or TNODE |
| 1066 | * |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1067 | * tp is n's (parent) ----> NULL or TNODE |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1068 | */ |
| 1069 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1070 | BUG_ON(tp && IS_LEAF(tp)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1071 | |
| 1072 | /* Case 1: n is a leaf. Compare prefixes */ |
| 1073 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1074 | if (n != NULL && IS_LEAF(n) && tkey_equals(key, n->key)) { |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 1075 | l = (struct leaf *) n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1076 | li = leaf_info_new(plen); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1077 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1078 | if (!li) |
| 1079 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1080 | |
| 1081 | fa_head = &li->falh; |
| 1082 | insert_leaf_info(&l->list, li); |
| 1083 | goto done; |
| 1084 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1085 | l = leaf_new(); |
| 1086 | |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1087 | if (!l) |
| 1088 | return NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1089 | |
| 1090 | l->key = key; |
| 1091 | li = leaf_info_new(plen); |
| 1092 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1093 | if (!li) { |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1094 | tnode_free((struct tnode *) l); |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1095 | return NULL; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1096 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1097 | |
| 1098 | fa_head = &li->falh; |
| 1099 | insert_leaf_info(&l->list, li); |
| 1100 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1101 | if (t->trie && n == NULL) { |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1102 | /* Case 2: n is NULL, and will just insert a new leaf */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1103 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1104 | node_set_parent((struct node *)l, tp); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1105 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1106 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
| 1107 | put_child(t, (struct tnode *)tp, cindex, (struct node *)l); |
| 1108 | } else { |
| 1109 | /* Case 3: n is a LEAF or a TNODE and the key doesn't match. */ |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1110 | /* |
| 1111 | * Add a new tnode here |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1112 | * first tnode need some special handling |
| 1113 | */ |
| 1114 | |
| 1115 | if (tp) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1116 | pos = tp->pos+tp->bits; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1117 | else |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1118 | pos = 0; |
| 1119 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1120 | if (n) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1121 | newpos = tkey_mismatch(key, pos, n->key); |
| 1122 | tn = tnode_new(n->key, newpos, 1); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1123 | } else { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1124 | newpos = 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1125 | tn = tnode_new(key, newpos, 1); /* First tnode */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1126 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1127 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1128 | if (!tn) { |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1129 | free_leaf_info(li); |
| 1130 | tnode_free((struct tnode *) l); |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1131 | return NULL; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1132 | } |
| 1133 | |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1134 | node_set_parent((struct node *)tn, tp); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1135 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1136 | missbit = tkey_extract_bits(key, newpos, 1); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1137 | put_child(t, tn, missbit, (struct node *)l); |
| 1138 | put_child(t, tn, 1-missbit, n); |
| 1139 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1140 | if (tp) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1141 | cindex = tkey_extract_bits(key, tp->pos, tp->bits); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1142 | put_child(t, (struct tnode *)tp, cindex, |
| 1143 | (struct node *)tn); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1144 | } else { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1145 | rcu_assign_pointer(t->trie, (struct node *)tn); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1146 | tp = tn; |
| 1147 | } |
| 1148 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1149 | |
| 1150 | if (tp && tp->pos + tp->bits > 32) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1151 | pr_warning("fib_trie" |
| 1152 | " tp=%p pos=%d, bits=%d, key=%0x plen=%d\n", |
| 1153 | tp, tp->pos, tp->bits, key, plen); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1154 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1155 | /* Rebalance the trie */ |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1156 | |
| 1157 | rcu_assign_pointer(t->trie, trie_rebalance(t, tp)); |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1158 | done: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1159 | return fa_head; |
| 1160 | } |
| 1161 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1162 | /* |
| 1163 | * Caller must hold RTNL. |
| 1164 | */ |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1165 | static int fn_trie_insert(struct fib_table *tb, struct fib_config *cfg) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1166 | { |
| 1167 | struct trie *t = (struct trie *) tb->tb_data; |
| 1168 | struct fib_alias *fa, *new_fa; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1169 | struct list_head *fa_head = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1170 | struct fib_info *fi; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1171 | int plen = cfg->fc_dst_len; |
| 1172 | u8 tos = cfg->fc_tos; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1173 | u32 key, mask; |
| 1174 | int err; |
| 1175 | struct leaf *l; |
| 1176 | |
| 1177 | if (plen > 32) |
| 1178 | return -EINVAL; |
| 1179 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1180 | key = ntohl(cfg->fc_dst); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1181 | |
Patrick McHardy | 2dfe55b | 2006-08-10 23:08:33 -0700 | [diff] [blame] | 1182 | pr_debug("Insert table=%u %08x/%d\n", tb->tb_id, key, plen); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1183 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1184 | mask = ntohl(inet_make_mask(plen)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1185 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1186 | if (key & ~mask) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1187 | return -EINVAL; |
| 1188 | |
| 1189 | key = key & mask; |
| 1190 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1191 | fi = fib_create_info(cfg); |
| 1192 | if (IS_ERR(fi)) { |
| 1193 | err = PTR_ERR(fi); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1194 | goto err; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1195 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1196 | |
| 1197 | l = fib_find_node(t, key); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1198 | fa = NULL; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1199 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1200 | if (l) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1201 | fa_head = get_fa_head(l, plen); |
| 1202 | fa = fib_find_alias(fa_head, tos, fi->fib_priority); |
| 1203 | } |
| 1204 | |
| 1205 | /* Now fa, if non-NULL, points to the first fib alias |
| 1206 | * with the same keys [prefix,tos,priority], if such key already |
| 1207 | * exists or to the node before which we will insert new one. |
| 1208 | * |
| 1209 | * If fa is NULL, we will need to allocate a new one and |
| 1210 | * insert to the head of f. |
| 1211 | * |
| 1212 | * If f is NULL, no fib node matched the destination key |
| 1213 | * and we need to allocate a new one of those as well. |
| 1214 | */ |
| 1215 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1216 | if (fa && fa->fa_tos == tos && |
| 1217 | fa->fa_info->fib_priority == fi->fib_priority) { |
| 1218 | struct fib_alias *fa_first, *fa_match; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1219 | |
| 1220 | err = -EEXIST; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1221 | if (cfg->fc_nlflags & NLM_F_EXCL) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1222 | goto out; |
| 1223 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1224 | /* We have 2 goals: |
| 1225 | * 1. Find exact match for type, scope, fib_info to avoid |
| 1226 | * duplicate routes |
| 1227 | * 2. Find next 'fa' (or head), NLM_F_APPEND inserts before it |
| 1228 | */ |
| 1229 | fa_match = NULL; |
| 1230 | fa_first = fa; |
| 1231 | fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list); |
| 1232 | list_for_each_entry_continue(fa, fa_head, fa_list) { |
| 1233 | if (fa->fa_tos != tos) |
| 1234 | break; |
| 1235 | if (fa->fa_info->fib_priority != fi->fib_priority) |
| 1236 | break; |
| 1237 | if (fa->fa_type == cfg->fc_type && |
| 1238 | fa->fa_scope == cfg->fc_scope && |
| 1239 | fa->fa_info == fi) { |
| 1240 | fa_match = fa; |
| 1241 | break; |
| 1242 | } |
| 1243 | } |
| 1244 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1245 | if (cfg->fc_nlflags & NLM_F_REPLACE) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1246 | struct fib_info *fi_drop; |
| 1247 | u8 state; |
| 1248 | |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1249 | fa = fa_first; |
| 1250 | if (fa_match) { |
| 1251 | if (fa == fa_match) |
| 1252 | err = 0; |
Joonwoo Park | 6725033 | 2008-01-18 03:45:18 -0800 | [diff] [blame] | 1253 | goto out; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1254 | } |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1255 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1256 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1257 | if (new_fa == NULL) |
| 1258 | goto out; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1259 | |
| 1260 | fi_drop = fa->fa_info; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1261 | new_fa->fa_tos = fa->fa_tos; |
| 1262 | new_fa->fa_info = fi; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1263 | new_fa->fa_type = cfg->fc_type; |
| 1264 | new_fa->fa_scope = cfg->fc_scope; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1265 | state = fa->fa_state; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1266 | new_fa->fa_state = state & ~FA_S_ACCESSED; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1267 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1268 | list_replace_rcu(&fa->fa_list, &new_fa->fa_list); |
| 1269 | alias_free_mem_rcu(fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1270 | |
| 1271 | fib_release_info(fi_drop); |
| 1272 | if (state & FA_S_ACCESSED) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1273 | rt_cache_flush(-1); |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1274 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, |
| 1275 | tb->tb_id, &cfg->fc_nlinfo, NLM_F_REPLACE); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1276 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1277 | goto succeeded; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1278 | } |
| 1279 | /* Error if we find a perfect match which |
| 1280 | * uses the same scope, type, and nexthop |
| 1281 | * information. |
| 1282 | */ |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1283 | if (fa_match) |
| 1284 | goto out; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1285 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1286 | if (!(cfg->fc_nlflags & NLM_F_APPEND)) |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1287 | fa = fa_first; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1288 | } |
| 1289 | err = -ENOENT; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1290 | if (!(cfg->fc_nlflags & NLM_F_CREATE)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1291 | goto out; |
| 1292 | |
| 1293 | err = -ENOBUFS; |
Christoph Lameter | e94b176 | 2006-12-06 20:33:17 -0800 | [diff] [blame] | 1294 | new_fa = kmem_cache_alloc(fn_alias_kmem, GFP_KERNEL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1295 | if (new_fa == NULL) |
| 1296 | goto out; |
| 1297 | |
| 1298 | new_fa->fa_info = fi; |
| 1299 | new_fa->fa_tos = tos; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1300 | new_fa->fa_type = cfg->fc_type; |
| 1301 | new_fa->fa_scope = cfg->fc_scope; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1302 | new_fa->fa_state = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1303 | /* |
| 1304 | * Insert new entry to the list. |
| 1305 | */ |
| 1306 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1307 | if (!fa_head) { |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1308 | fa_head = fib_insert_node(t, key, plen); |
| 1309 | if (unlikely(!fa_head)) { |
| 1310 | err = -ENOMEM; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1311 | goto out_free_new_fa; |
Stephen Hemminger | fea86ad | 2008-01-12 20:57:07 -0800 | [diff] [blame] | 1312 | } |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1313 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1314 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1315 | list_add_tail_rcu(&new_fa->fa_list, |
| 1316 | (fa ? &fa->fa_list : fa_head)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1317 | |
| 1318 | rt_cache_flush(-1); |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1319 | rtmsg_fib(RTM_NEWROUTE, htonl(key), new_fa, plen, tb->tb_id, |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1320 | &cfg->fc_nlinfo, 0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1321 | succeeded: |
| 1322 | return 0; |
Robert Olsson | f835e47 | 2005-06-28 15:00:39 -0700 | [diff] [blame] | 1323 | |
| 1324 | out_free_new_fa: |
| 1325 | kmem_cache_free(fn_alias_kmem, new_fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1326 | out: |
| 1327 | fib_release_info(fi); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1328 | err: |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1329 | return err; |
| 1330 | } |
| 1331 | |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 1332 | /* should be called with rcu_read_lock */ |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1333 | static int check_leaf(struct trie *t, struct leaf *l, |
| 1334 | t_key key, const struct flowi *flp, |
| 1335 | struct fib_result *res) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1336 | { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1337 | struct leaf_info *li; |
| 1338 | struct hlist_head *hhead = &l->list; |
| 1339 | struct hlist_node *node; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1340 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1341 | hlist_for_each_entry_rcu(li, node, hhead, hlist) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1342 | int err; |
| 1343 | int plen = li->plen; |
| 1344 | __be32 mask = inet_make_mask(plen); |
| 1345 | |
Al Viro | 888454c | 2006-09-19 13:42:46 -0700 | [diff] [blame] | 1346 | if (l->key != (key & ntohl(mask))) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1347 | continue; |
| 1348 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1349 | err = fib_semantic_match(&li->falh, flp, res, |
| 1350 | htonl(l->key), mask, plen); |
| 1351 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1352 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1353 | if (err <= 0) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1354 | t->stats.semantic_match_passed++; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1355 | else |
| 1356 | t->stats.semantic_match_miss++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1357 | #endif |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1358 | if (err <= 0) |
| 1359 | return plen; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1360 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1361 | |
| 1362 | return -1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1363 | } |
| 1364 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1365 | static int fn_trie_lookup(struct fib_table *tb, const struct flowi *flp, |
| 1366 | struct fib_result *res) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1367 | { |
| 1368 | struct trie *t = (struct trie *) tb->tb_data; |
| 1369 | int plen, ret = 0; |
| 1370 | struct node *n; |
| 1371 | struct tnode *pn; |
| 1372 | int pos, bits; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1373 | t_key key = ntohl(flp->fl4_dst); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1374 | int chopped_off; |
| 1375 | t_key cindex = 0; |
| 1376 | int current_prefix_length = KEYLENGTH; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1377 | struct tnode *cn; |
| 1378 | t_key node_prefix, key_prefix, pref_mismatch; |
| 1379 | int mp; |
| 1380 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1381 | rcu_read_lock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1382 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1383 | n = rcu_dereference(t->trie); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1384 | if (!n) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1385 | goto failed; |
| 1386 | |
| 1387 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1388 | t->stats.gets++; |
| 1389 | #endif |
| 1390 | |
| 1391 | /* Just a leaf? */ |
| 1392 | if (IS_LEAF(n)) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1393 | plen = check_leaf(t, (struct leaf *)n, key, flp, res); |
| 1394 | if (plen < 0) |
| 1395 | goto failed; |
| 1396 | ret = 0; |
| 1397 | goto found; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1398 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1399 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1400 | pn = (struct tnode *) n; |
| 1401 | chopped_off = 0; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1402 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1403 | while (pn) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1404 | pos = pn->pos; |
| 1405 | bits = pn->bits; |
| 1406 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1407 | if (!chopped_off) |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 1408 | cindex = tkey_extract_bits(mask_pfx(key, current_prefix_length), |
| 1409 | pos, bits); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1410 | |
| 1411 | n = tnode_get_child(pn, cindex); |
| 1412 | |
| 1413 | if (n == NULL) { |
| 1414 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1415 | t->stats.null_node_hit++; |
| 1416 | #endif |
| 1417 | goto backtrace; |
| 1418 | } |
| 1419 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1420 | if (IS_LEAF(n)) { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1421 | plen = check_leaf(t, (struct leaf *)n, key, flp, res); |
| 1422 | if (plen < 0) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1423 | goto backtrace; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1424 | |
| 1425 | ret = 0; |
| 1426 | goto found; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1427 | } |
| 1428 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1429 | cn = (struct tnode *)n; |
| 1430 | |
| 1431 | /* |
| 1432 | * It's a tnode, and we can do some extra checks here if we |
| 1433 | * like, to avoid descending into a dead-end branch. |
| 1434 | * This tnode is in the parent's child array at index |
| 1435 | * key[p_pos..p_pos+p_bits] but potentially with some bits |
| 1436 | * chopped off, so in reality the index may be just a |
| 1437 | * subprefix, padded with zero at the end. |
| 1438 | * We can also take a look at any skipped bits in this |
| 1439 | * tnode - everything up to p_pos is supposed to be ok, |
| 1440 | * and the non-chopped bits of the index (se previous |
| 1441 | * paragraph) are also guaranteed ok, but the rest is |
| 1442 | * considered unknown. |
| 1443 | * |
| 1444 | * The skipped bits are key[pos+bits..cn->pos]. |
| 1445 | */ |
| 1446 | |
| 1447 | /* If current_prefix_length < pos+bits, we are already doing |
| 1448 | * actual prefix matching, which means everything from |
| 1449 | * pos+(bits-chopped_off) onward must be zero along some |
| 1450 | * branch of this subtree - otherwise there is *no* valid |
| 1451 | * prefix present. Here we can only check the skipped |
| 1452 | * bits. Remember, since we have already indexed into the |
| 1453 | * parent's child array, we know that the bits we chopped of |
| 1454 | * *are* zero. |
| 1455 | */ |
| 1456 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1457 | /* NOTA BENE: Checking only skipped bits |
| 1458 | for the new node here */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1459 | |
| 1460 | if (current_prefix_length < pos+bits) { |
| 1461 | if (tkey_extract_bits(cn->key, current_prefix_length, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1462 | cn->pos - current_prefix_length) |
| 1463 | || !(cn->child[0])) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1464 | goto backtrace; |
| 1465 | } |
| 1466 | |
| 1467 | /* |
| 1468 | * If chopped_off=0, the index is fully validated and we |
| 1469 | * only need to look at the skipped bits for this, the new, |
| 1470 | * tnode. What we actually want to do is to find out if |
| 1471 | * these skipped bits match our key perfectly, or if we will |
| 1472 | * have to count on finding a matching prefix further down, |
| 1473 | * because if we do, we would like to have some way of |
| 1474 | * verifying the existence of such a prefix at this point. |
| 1475 | */ |
| 1476 | |
| 1477 | /* The only thing we can do at this point is to verify that |
| 1478 | * any such matching prefix can indeed be a prefix to our |
| 1479 | * key, and if the bits in the node we are inspecting that |
| 1480 | * do not match our key are not ZERO, this cannot be true. |
| 1481 | * Thus, find out where there is a mismatch (before cn->pos) |
| 1482 | * and verify that all the mismatching bits are zero in the |
| 1483 | * new tnode's key. |
| 1484 | */ |
| 1485 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1486 | /* |
| 1487 | * Note: We aren't very concerned about the piece of |
| 1488 | * the key that precede pn->pos+pn->bits, since these |
| 1489 | * have already been checked. The bits after cn->pos |
| 1490 | * aren't checked since these are by definition |
| 1491 | * "unknown" at this point. Thus, what we want to see |
| 1492 | * is if we are about to enter the "prefix matching" |
| 1493 | * state, and in that case verify that the skipped |
| 1494 | * bits that will prevail throughout this subtree are |
| 1495 | * zero, as they have to be if we are to find a |
| 1496 | * matching prefix. |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1497 | */ |
| 1498 | |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 1499 | node_prefix = mask_pfx(cn->key, cn->pos); |
| 1500 | key_prefix = mask_pfx(key, cn->pos); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1501 | pref_mismatch = key_prefix^node_prefix; |
| 1502 | mp = 0; |
| 1503 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1504 | /* |
| 1505 | * In short: If skipped bits in this node do not match |
| 1506 | * the search key, enter the "prefix matching" |
| 1507 | * state.directly. |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1508 | */ |
| 1509 | if (pref_mismatch) { |
| 1510 | while (!(pref_mismatch & (1<<(KEYLENGTH-1)))) { |
| 1511 | mp++; |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1512 | pref_mismatch = pref_mismatch << 1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1513 | } |
| 1514 | key_prefix = tkey_extract_bits(cn->key, mp, cn->pos-mp); |
| 1515 | |
| 1516 | if (key_prefix != 0) |
| 1517 | goto backtrace; |
| 1518 | |
| 1519 | if (current_prefix_length >= cn->pos) |
| 1520 | current_prefix_length = mp; |
| 1521 | } |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1522 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1523 | pn = (struct tnode *)n; /* Descend */ |
| 1524 | chopped_off = 0; |
| 1525 | continue; |
| 1526 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1527 | backtrace: |
| 1528 | chopped_off++; |
| 1529 | |
| 1530 | /* As zero don't change the child key (cindex) */ |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1531 | while ((chopped_off <= pn->bits) |
| 1532 | && !(cindex & (1<<(chopped_off-1)))) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1533 | chopped_off++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1534 | |
| 1535 | /* Decrease current_... with bits chopped off */ |
| 1536 | if (current_prefix_length > pn->pos + pn->bits - chopped_off) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1537 | current_prefix_length = pn->pos + pn->bits |
| 1538 | - chopped_off; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1539 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1540 | /* |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1541 | * Either we do the actual chop off according or if we have |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1542 | * chopped off all bits in this tnode walk up to our parent. |
| 1543 | */ |
| 1544 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1545 | if (chopped_off <= pn->bits) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1546 | cindex &= ~(1 << (chopped_off-1)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1547 | } else { |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1548 | struct tnode *parent = node_parent((struct node *) pn); |
| 1549 | if (!parent) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1550 | goto failed; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1551 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1552 | /* Get Child's index */ |
Stephen Hemminger | 0680191 | 2007-08-10 15:22:13 -0700 | [diff] [blame] | 1553 | cindex = tkey_extract_bits(pn->key, parent->pos, parent->bits); |
| 1554 | pn = parent; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1555 | chopped_off = 0; |
| 1556 | |
| 1557 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 1558 | t->stats.backtrack++; |
| 1559 | #endif |
| 1560 | goto backtrace; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1561 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1562 | } |
| 1563 | failed: |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1564 | ret = 1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1565 | found: |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1566 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1567 | return ret; |
| 1568 | } |
| 1569 | |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1570 | /* |
| 1571 | * Remove the leaf and return parent. |
| 1572 | */ |
| 1573 | static void trie_leaf_remove(struct trie *t, struct leaf *l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1574 | { |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1575 | struct tnode *tp = node_parent((struct node *) l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1576 | |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1577 | pr_debug("entering trie_leaf_remove(%p)\n", l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1578 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1579 | if (tp) { |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1580 | t_key cindex = tkey_extract_bits(l->key, tp->pos, tp->bits); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1581 | put_child(t, (struct tnode *)tp, cindex, NULL); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1582 | rcu_assign_pointer(t->trie, trie_rebalance(t, tp)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1583 | } else |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1584 | rcu_assign_pointer(t->trie, NULL); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1585 | |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1586 | tnode_free((struct tnode *) l); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1587 | } |
| 1588 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1589 | /* |
| 1590 | * Caller must hold RTNL. |
| 1591 | */ |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1592 | static int fn_trie_delete(struct fib_table *tb, struct fib_config *cfg) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1593 | { |
| 1594 | struct trie *t = (struct trie *) tb->tb_data; |
| 1595 | u32 key, mask; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1596 | int plen = cfg->fc_dst_len; |
| 1597 | u8 tos = cfg->fc_tos; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1598 | struct fib_alias *fa, *fa_to_delete; |
| 1599 | struct list_head *fa_head; |
| 1600 | struct leaf *l; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1601 | struct leaf_info *li; |
| 1602 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1603 | if (plen > 32) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1604 | return -EINVAL; |
| 1605 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1606 | key = ntohl(cfg->fc_dst); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1607 | mask = ntohl(inet_make_mask(plen)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1608 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1609 | if (key & ~mask) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1610 | return -EINVAL; |
| 1611 | |
| 1612 | key = key & mask; |
| 1613 | l = fib_find_node(t, key); |
| 1614 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1615 | if (!l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1616 | return -ESRCH; |
| 1617 | |
| 1618 | fa_head = get_fa_head(l, plen); |
| 1619 | fa = fib_find_alias(fa_head, tos, 0); |
| 1620 | |
| 1621 | if (!fa) |
| 1622 | return -ESRCH; |
| 1623 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 1624 | pr_debug("Deleting %08x/%d tos=%d t=%p\n", key, plen, tos, t); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1625 | |
| 1626 | fa_to_delete = NULL; |
Julian Anastasov | 936f6f8 | 2008-01-28 21:18:06 -0800 | [diff] [blame] | 1627 | fa = list_entry(fa->fa_list.prev, struct fib_alias, fa_list); |
| 1628 | list_for_each_entry_continue(fa, fa_head, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1629 | struct fib_info *fi = fa->fa_info; |
| 1630 | |
| 1631 | if (fa->fa_tos != tos) |
| 1632 | break; |
| 1633 | |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1634 | if ((!cfg->fc_type || fa->fa_type == cfg->fc_type) && |
| 1635 | (cfg->fc_scope == RT_SCOPE_NOWHERE || |
| 1636 | fa->fa_scope == cfg->fc_scope) && |
| 1637 | (!cfg->fc_protocol || |
| 1638 | fi->fib_protocol == cfg->fc_protocol) && |
| 1639 | fib_nh_match(cfg, fi) == 0) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1640 | fa_to_delete = fa; |
| 1641 | break; |
| 1642 | } |
| 1643 | } |
| 1644 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1645 | if (!fa_to_delete) |
| 1646 | return -ESRCH; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1647 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1648 | fa = fa_to_delete; |
Thomas Graf | 4e902c5 | 2006-08-17 18:14:52 -0700 | [diff] [blame] | 1649 | rtmsg_fib(RTM_DELROUTE, htonl(key), fa, plen, tb->tb_id, |
Milan Kocian | b8f5583 | 2007-05-23 14:55:06 -0700 | [diff] [blame] | 1650 | &cfg->fc_nlinfo, 0); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1651 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1652 | l = fib_find_node(t, key); |
Robert Olsson | 772cb71 | 2005-09-19 15:31:18 -0700 | [diff] [blame] | 1653 | li = find_leaf_info(l, plen); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1654 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1655 | list_del_rcu(&fa->fa_list); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1656 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1657 | if (list_empty(fa_head)) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1658 | hlist_del_rcu(&li->hlist); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1659 | free_leaf_info(li); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1660 | } |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1661 | |
| 1662 | if (hlist_empty(&l->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1663 | trie_leaf_remove(t, l); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1664 | |
| 1665 | if (fa->fa_state & FA_S_ACCESSED) |
| 1666 | rt_cache_flush(-1); |
| 1667 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1668 | fib_release_info(fa->fa_info); |
| 1669 | alias_free_mem_rcu(fa); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1670 | return 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1671 | } |
| 1672 | |
| 1673 | static int trie_flush_list(struct trie *t, struct list_head *head) |
| 1674 | { |
| 1675 | struct fib_alias *fa, *fa_node; |
| 1676 | int found = 0; |
| 1677 | |
| 1678 | list_for_each_entry_safe(fa, fa_node, head, fa_list) { |
| 1679 | struct fib_info *fi = fa->fa_info; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1680 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1681 | if (fi && (fi->fib_flags & RTNH_F_DEAD)) { |
| 1682 | list_del_rcu(&fa->fa_list); |
| 1683 | fib_release_info(fa->fa_info); |
| 1684 | alias_free_mem_rcu(fa); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1685 | found++; |
| 1686 | } |
| 1687 | } |
| 1688 | return found; |
| 1689 | } |
| 1690 | |
| 1691 | static int trie_flush_leaf(struct trie *t, struct leaf *l) |
| 1692 | { |
| 1693 | int found = 0; |
| 1694 | struct hlist_head *lih = &l->list; |
| 1695 | struct hlist_node *node, *tmp; |
| 1696 | struct leaf_info *li = NULL; |
| 1697 | |
| 1698 | hlist_for_each_entry_safe(li, node, tmp, lih, hlist) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1699 | found += trie_flush_list(t, &li->falh); |
| 1700 | |
| 1701 | if (list_empty(&li->falh)) { |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1702 | hlist_del_rcu(&li->hlist); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1703 | free_leaf_info(li); |
| 1704 | } |
| 1705 | } |
| 1706 | return found; |
| 1707 | } |
| 1708 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1709 | /* |
| 1710 | * Scan for the next right leaf starting at node p->child[idx] |
| 1711 | * Since we have back pointer, no recursion necessary. |
| 1712 | */ |
| 1713 | static struct leaf *leaf_walk_rcu(struct tnode *p, struct node *c) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1714 | { |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1715 | do { |
| 1716 | t_key idx; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1717 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1718 | if (c) |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1719 | idx = tkey_extract_bits(c->key, p->pos, p->bits) + 1; |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1720 | else |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1721 | idx = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1722 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1723 | while (idx < 1u << p->bits) { |
| 1724 | c = tnode_get_child_rcu(p, idx++); |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1725 | if (!c) |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1726 | continue; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1727 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1728 | if (IS_LEAF(c)) { |
| 1729 | prefetch(p->child[idx]); |
| 1730 | return (struct leaf *) c; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1731 | } |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1732 | |
| 1733 | /* Rescan start scanning in new node */ |
| 1734 | p = (struct tnode *) c; |
| 1735 | idx = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1736 | } |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1737 | |
| 1738 | /* Node empty, walk back up to parent */ |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1739 | c = (struct node *) p; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1740 | } while ( (p = node_parent_rcu(c)) != NULL); |
| 1741 | |
| 1742 | return NULL; /* Root of trie */ |
| 1743 | } |
| 1744 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1745 | static struct leaf *trie_firstleaf(struct trie *t) |
| 1746 | { |
| 1747 | struct tnode *n = (struct tnode *) rcu_dereference(t->trie); |
| 1748 | |
| 1749 | if (!n) |
| 1750 | return NULL; |
| 1751 | |
| 1752 | if (IS_LEAF(n)) /* trie is just a leaf */ |
| 1753 | return (struct leaf *) n; |
| 1754 | |
| 1755 | return leaf_walk_rcu(n, NULL); |
| 1756 | } |
| 1757 | |
| 1758 | static struct leaf *trie_nextleaf(struct leaf *l) |
| 1759 | { |
| 1760 | struct node *c = (struct node *) l; |
| 1761 | struct tnode *p = node_parent(c); |
| 1762 | |
| 1763 | if (!p) |
| 1764 | return NULL; /* trie with just one leaf */ |
| 1765 | |
| 1766 | return leaf_walk_rcu(p, c); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1767 | } |
| 1768 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1769 | static struct leaf *trie_leafindex(struct trie *t, int index) |
| 1770 | { |
| 1771 | struct leaf *l = trie_firstleaf(t); |
| 1772 | |
Stephen Hemminger | ec28cf7 | 2008-02-11 21:12:49 -0800 | [diff] [blame] | 1773 | while (l && index-- > 0) |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1774 | l = trie_nextleaf(l); |
Stephen Hemminger | ec28cf7 | 2008-02-11 21:12:49 -0800 | [diff] [blame] | 1775 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1776 | return l; |
| 1777 | } |
| 1778 | |
| 1779 | |
Robert Olsson | d562f1f | 2007-03-26 14:22:22 -0700 | [diff] [blame] | 1780 | /* |
| 1781 | * Caller must hold RTNL. |
| 1782 | */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1783 | static int fn_trie_flush(struct fib_table *tb) |
| 1784 | { |
| 1785 | struct trie *t = (struct trie *) tb->tb_data; |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1786 | struct leaf *l, *ll = NULL; |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1787 | int found = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1788 | |
Stephen Hemminger | 82cfbb0 | 2008-01-22 21:55:32 -0800 | [diff] [blame] | 1789 | for (l = trie_firstleaf(t); l; l = trie_nextleaf(l)) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1790 | found += trie_flush_leaf(t, l); |
| 1791 | |
| 1792 | if (ll && hlist_empty(&ll->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1793 | trie_leaf_remove(t, ll); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1794 | ll = l; |
| 1795 | } |
| 1796 | |
| 1797 | if (ll && hlist_empty(&ll->list)) |
Stephen Hemminger | 9195bef | 2008-01-22 21:56:34 -0800 | [diff] [blame] | 1798 | trie_leaf_remove(t, ll); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1799 | |
Stephen Hemminger | 0c7770c | 2005-08-23 21:59:41 -0700 | [diff] [blame] | 1800 | pr_debug("trie_flush found=%d\n", found); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1801 | return found; |
| 1802 | } |
| 1803 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1804 | static void fn_trie_select_default(struct fib_table *tb, |
| 1805 | const struct flowi *flp, |
| 1806 | struct fib_result *res) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1807 | { |
| 1808 | struct trie *t = (struct trie *) tb->tb_data; |
| 1809 | int order, last_idx; |
| 1810 | struct fib_info *fi = NULL; |
| 1811 | struct fib_info *last_resort; |
| 1812 | struct fib_alias *fa = NULL; |
| 1813 | struct list_head *fa_head; |
| 1814 | struct leaf *l; |
| 1815 | |
| 1816 | last_idx = -1; |
| 1817 | last_resort = NULL; |
| 1818 | order = -1; |
| 1819 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1820 | rcu_read_lock(); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1821 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1822 | l = fib_find_node(t, 0); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1823 | if (!l) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1824 | goto out; |
| 1825 | |
| 1826 | fa_head = get_fa_head(l, 0); |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1827 | if (!fa_head) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1828 | goto out; |
| 1829 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 1830 | if (list_empty(fa_head)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1831 | goto out; |
| 1832 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1833 | list_for_each_entry_rcu(fa, fa_head, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1834 | struct fib_info *next_fi = fa->fa_info; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1835 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1836 | if (fa->fa_scope != res->scope || |
| 1837 | fa->fa_type != RTN_UNICAST) |
| 1838 | continue; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1839 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1840 | if (next_fi->fib_priority > res->fi->fib_priority) |
| 1841 | break; |
| 1842 | if (!next_fi->fib_nh[0].nh_gw || |
| 1843 | next_fi->fib_nh[0].nh_scope != RT_SCOPE_LINK) |
| 1844 | continue; |
| 1845 | fa->fa_state |= FA_S_ACCESSED; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1846 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1847 | if (fi == NULL) { |
| 1848 | if (next_fi != res->fi) |
| 1849 | break; |
| 1850 | } else if (!fib_detect_death(fi, order, &last_resort, |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1851 | &last_idx, tb->tb_default)) { |
Denis V. Lunev | a2bbe68 | 2007-12-08 00:31:44 -0800 | [diff] [blame] | 1852 | fib_result_assign(res, fi); |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1853 | tb->tb_default = order; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1854 | goto out; |
| 1855 | } |
| 1856 | fi = next_fi; |
| 1857 | order++; |
| 1858 | } |
| 1859 | if (order <= 0 || fi == NULL) { |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1860 | tb->tb_default = -1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1861 | goto out; |
| 1862 | } |
| 1863 | |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1864 | if (!fib_detect_death(fi, order, &last_resort, &last_idx, |
| 1865 | tb->tb_default)) { |
Denis V. Lunev | a2bbe68 | 2007-12-08 00:31:44 -0800 | [diff] [blame] | 1866 | fib_result_assign(res, fi); |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1867 | tb->tb_default = order; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1868 | goto out; |
| 1869 | } |
Denis V. Lunev | a2bbe68 | 2007-12-08 00:31:44 -0800 | [diff] [blame] | 1870 | if (last_idx >= 0) |
| 1871 | fib_result_assign(res, last_resort); |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 1872 | tb->tb_default = last_idx; |
| 1873 | out: |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1874 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1875 | } |
| 1876 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1877 | static int fn_trie_dump_fa(t_key key, int plen, struct list_head *fah, |
| 1878 | struct fib_table *tb, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1879 | struct sk_buff *skb, struct netlink_callback *cb) |
| 1880 | { |
| 1881 | int i, s_i; |
| 1882 | struct fib_alias *fa; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 1883 | __be32 xkey = htonl(key); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1884 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1885 | s_i = cb->args[5]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1886 | i = 0; |
| 1887 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1888 | /* rcu_read_lock is hold by caller */ |
| 1889 | |
| 1890 | list_for_each_entry_rcu(fa, fah, fa_list) { |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1891 | if (i < s_i) { |
| 1892 | i++; |
| 1893 | continue; |
| 1894 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1895 | |
| 1896 | if (fib_dump_info(skb, NETLINK_CB(cb->skb).pid, |
| 1897 | cb->nlh->nlmsg_seq, |
| 1898 | RTM_NEWROUTE, |
| 1899 | tb->tb_id, |
| 1900 | fa->fa_type, |
| 1901 | fa->fa_scope, |
Thomas Graf | be403ea | 2006-08-17 18:15:17 -0700 | [diff] [blame] | 1902 | xkey, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1903 | plen, |
| 1904 | fa->fa_tos, |
Stephen Hemminger | 64347f7 | 2008-01-22 21:55:01 -0800 | [diff] [blame] | 1905 | fa->fa_info, NLM_F_MULTI) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1906 | cb->args[5] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1907 | return -1; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1908 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1909 | i++; |
| 1910 | } |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1911 | cb->args[5] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1912 | return skb->len; |
| 1913 | } |
| 1914 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1915 | static int fn_trie_dump_leaf(struct leaf *l, struct fib_table *tb, |
| 1916 | struct sk_buff *skb, struct netlink_callback *cb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1917 | { |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1918 | struct leaf_info *li; |
| 1919 | struct hlist_node *node; |
| 1920 | int i, s_i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1921 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1922 | s_i = cb->args[4]; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1923 | i = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1924 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1925 | /* rcu_read_lock is hold by caller */ |
| 1926 | hlist_for_each_entry_rcu(li, node, &l->list, hlist) { |
| 1927 | if (i < s_i) { |
| 1928 | i++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1929 | continue; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1930 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1931 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1932 | if (i > s_i) |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1933 | cb->args[5] = 0; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 1934 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1935 | if (list_empty(&li->falh)) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1936 | continue; |
| 1937 | |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1938 | if (fn_trie_dump_fa(l->key, li->plen, &li->falh, tb, skb, cb) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1939 | cb->args[4] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1940 | return -1; |
| 1941 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1942 | i++; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1943 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1944 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1945 | cb->args[4] = i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1946 | return skb->len; |
| 1947 | } |
| 1948 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1949 | static int fn_trie_dump(struct fib_table *tb, struct sk_buff *skb, |
| 1950 | struct netlink_callback *cb) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1951 | { |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1952 | struct leaf *l; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1953 | struct trie *t = (struct trie *) tb->tb_data; |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1954 | t_key key = cb->args[2]; |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1955 | int count = cb->args[3]; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1956 | |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1957 | rcu_read_lock(); |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1958 | /* Dump starting at last key. |
| 1959 | * Note: 0.0.0.0/0 (ie default) is first key. |
| 1960 | */ |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1961 | if (count == 0) |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1962 | l = trie_firstleaf(t); |
| 1963 | else { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1964 | /* Normally, continue from last key, but if that is missing |
| 1965 | * fallback to using slow rescan |
| 1966 | */ |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1967 | l = fib_find_node(t, key); |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1968 | if (!l) |
| 1969 | l = trie_leafindex(t, count); |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1970 | } |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1971 | |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1972 | while (l) { |
| 1973 | cb->args[2] = l->key; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1974 | if (fn_trie_dump_leaf(l, tb, skb, cb) < 0) { |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1975 | cb->args[3] = count; |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1976 | rcu_read_unlock(); |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1977 | return -1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1978 | } |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1979 | |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1980 | ++count; |
Stephen Hemminger | d5ce8a0 | 2008-01-22 21:57:22 -0800 | [diff] [blame] | 1981 | l = trie_nextleaf(l); |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1982 | memset(&cb->args[4], 0, |
| 1983 | sizeof(cb->args) - 4*sizeof(cb->args[0])); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1984 | } |
Stephen Hemminger | 71d67e6 | 2008-01-31 16:45:47 -0800 | [diff] [blame] | 1985 | cb->args[3] = count; |
Robert Olsson | 2373ce1 | 2005-08-25 13:01:29 -0700 | [diff] [blame] | 1986 | rcu_read_unlock(); |
Stephen Hemminger | a88ee22 | 2008-01-22 21:56:11 -0800 | [diff] [blame] | 1987 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1988 | return skb->len; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 1989 | } |
| 1990 | |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 1991 | void __init fib_hash_init(void) |
| 1992 | { |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 1993 | fn_alias_kmem = kmem_cache_create("ip_fib_alias", |
| 1994 | sizeof(struct fib_alias), |
Stephen Hemminger | bc3c8c1 | 2008-01-22 21:51:50 -0800 | [diff] [blame] | 1995 | 0, SLAB_PANIC, NULL); |
| 1996 | |
| 1997 | trie_leaf_kmem = kmem_cache_create("ip_fib_trie", |
| 1998 | max(sizeof(struct leaf), |
| 1999 | sizeof(struct leaf_info)), |
| 2000 | 0, SLAB_PANIC, NULL); |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 2001 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2002 | |
Stephen Hemminger | 7f9b805 | 2008-01-14 23:14:20 -0800 | [diff] [blame] | 2003 | |
| 2004 | /* Fix more generic FIB names for init later */ |
| 2005 | struct fib_table *fib_hash_table(u32 id) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2006 | { |
| 2007 | struct fib_table *tb; |
| 2008 | struct trie *t; |
| 2009 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2010 | tb = kmalloc(sizeof(struct fib_table) + sizeof(struct trie), |
| 2011 | GFP_KERNEL); |
| 2012 | if (tb == NULL) |
| 2013 | return NULL; |
| 2014 | |
| 2015 | tb->tb_id = id; |
Denis V. Lunev | 971b893 | 2007-12-08 00:32:23 -0800 | [diff] [blame] | 2016 | tb->tb_default = -1; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2017 | tb->tb_lookup = fn_trie_lookup; |
| 2018 | tb->tb_insert = fn_trie_insert; |
| 2019 | tb->tb_delete = fn_trie_delete; |
| 2020 | tb->tb_flush = fn_trie_flush; |
| 2021 | tb->tb_select_default = fn_trie_select_default; |
| 2022 | tb->tb_dump = fn_trie_dump; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2023 | |
| 2024 | t = (struct trie *) tb->tb_data; |
Stephen Hemminger | c28a1cf | 2008-01-12 20:49:13 -0800 | [diff] [blame] | 2025 | memset(t, 0, sizeof(*t)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2026 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2027 | if (id == RT_TABLE_LOCAL) |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2028 | pr_info("IPv4 FIB: Using LC-trie version %s\n", VERSION); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2029 | |
| 2030 | return tb; |
| 2031 | } |
| 2032 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2033 | #ifdef CONFIG_PROC_FS |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2034 | /* Depth first Trie walk iterator */ |
| 2035 | struct fib_trie_iter { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2036 | struct seq_net_private p; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2037 | struct fib_table *tb; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2038 | struct tnode *tnode; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2039 | unsigned index; |
| 2040 | unsigned depth; |
| 2041 | }; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2042 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2043 | static struct node *fib_trie_get_next(struct fib_trie_iter *iter) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2044 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2045 | struct tnode *tn = iter->tnode; |
| 2046 | unsigned cindex = iter->index; |
| 2047 | struct tnode *p; |
| 2048 | |
Eric W. Biederman | 6640e69 | 2007-01-24 14:42:04 -0800 | [diff] [blame] | 2049 | /* A single entry routing table */ |
| 2050 | if (!tn) |
| 2051 | return NULL; |
| 2052 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2053 | pr_debug("get_next iter={node=%p index=%d depth=%d}\n", |
| 2054 | iter->tnode, iter->index, iter->depth); |
| 2055 | rescan: |
| 2056 | while (cindex < (1<<tn->bits)) { |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 2057 | struct node *n = tnode_get_child_rcu(tn, cindex); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2058 | |
| 2059 | if (n) { |
| 2060 | if (IS_LEAF(n)) { |
| 2061 | iter->tnode = tn; |
| 2062 | iter->index = cindex + 1; |
| 2063 | } else { |
| 2064 | /* push down one level */ |
| 2065 | iter->tnode = (struct tnode *) n; |
| 2066 | iter->index = 0; |
| 2067 | ++iter->depth; |
| 2068 | } |
| 2069 | return n; |
| 2070 | } |
| 2071 | |
| 2072 | ++cindex; |
| 2073 | } |
| 2074 | |
| 2075 | /* Current node exhausted, pop back up */ |
Eric Dumazet | b59cfbf | 2008-01-18 03:31:36 -0800 | [diff] [blame] | 2076 | p = node_parent_rcu((struct node *)tn); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2077 | if (p) { |
| 2078 | cindex = tkey_extract_bits(tn->key, p->pos, p->bits)+1; |
| 2079 | tn = p; |
| 2080 | --iter->depth; |
| 2081 | goto rescan; |
| 2082 | } |
| 2083 | |
| 2084 | /* got root? */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2085 | return NULL; |
| 2086 | } |
| 2087 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2088 | static struct node *fib_trie_get_first(struct fib_trie_iter *iter, |
| 2089 | struct trie *t) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2090 | { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2091 | struct node *n; |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2092 | |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2093 | if (!t) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2094 | return NULL; |
| 2095 | |
| 2096 | n = rcu_dereference(t->trie); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2097 | if (!n) |
Robert Olsson | 5ddf0eb | 2006-03-20 21:34:12 -0800 | [diff] [blame] | 2098 | return NULL; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2099 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2100 | if (IS_TNODE(n)) { |
| 2101 | iter->tnode = (struct tnode *) n; |
| 2102 | iter->index = 0; |
| 2103 | iter->depth = 1; |
| 2104 | } else { |
| 2105 | iter->tnode = NULL; |
| 2106 | iter->index = 0; |
| 2107 | iter->depth = 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2108 | } |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2109 | |
| 2110 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2111 | } |
| 2112 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2113 | static void trie_collect_stats(struct trie *t, struct trie_stat *s) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2114 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2115 | struct node *n; |
| 2116 | struct fib_trie_iter iter; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2117 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2118 | memset(s, 0, sizeof(*s)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2119 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2120 | rcu_read_lock(); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2121 | for (n = fib_trie_get_first(&iter, t); n; n = fib_trie_get_next(&iter)) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2122 | if (IS_LEAF(n)) { |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2123 | struct leaf *l = (struct leaf *)n; |
| 2124 | struct leaf_info *li; |
| 2125 | struct hlist_node *tmp; |
| 2126 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2127 | s->leaves++; |
| 2128 | s->totdepth += iter.depth; |
| 2129 | if (iter.depth > s->maxdepth) |
| 2130 | s->maxdepth = iter.depth; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2131 | |
| 2132 | hlist_for_each_entry_rcu(li, tmp, &l->list, hlist) |
| 2133 | ++s->prefixes; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2134 | } else { |
| 2135 | const struct tnode *tn = (const struct tnode *) n; |
| 2136 | int i; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2137 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2138 | s->tnodes++; |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2139 | if (tn->bits < MAX_STAT_DEPTH) |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 2140 | s->nodesizes[tn->bits]++; |
| 2141 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2142 | for (i = 0; i < (1<<tn->bits); i++) |
| 2143 | if (!tn->child[i]) |
| 2144 | s->nullpointers++; |
| 2145 | } |
| 2146 | } |
| 2147 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2148 | } |
| 2149 | |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2150 | /* |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2151 | * This outputs /proc/net/fib_triestats |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2152 | */ |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2153 | static void trie_show_stats(struct seq_file *seq, struct trie_stat *stat) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2154 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2155 | unsigned i, max, pointers, bytes, avdepth; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2156 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2157 | if (stat->leaves) |
| 2158 | avdepth = stat->totdepth*100 / stat->leaves; |
| 2159 | else |
| 2160 | avdepth = 0; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2161 | |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2162 | seq_printf(seq, "\tAver depth: %u.%02d\n", |
| 2163 | avdepth / 100, avdepth % 100); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2164 | seq_printf(seq, "\tMax depth: %u\n", stat->maxdepth); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2165 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2166 | seq_printf(seq, "\tLeaves: %u\n", stat->leaves); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2167 | bytes = sizeof(struct leaf) * stat->leaves; |
Stephen Hemminger | 9367229 | 2008-01-22 21:54:05 -0800 | [diff] [blame] | 2168 | |
| 2169 | seq_printf(seq, "\tPrefixes: %u\n", stat->prefixes); |
| 2170 | bytes += sizeof(struct leaf_info) * stat->prefixes; |
| 2171 | |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2172 | seq_printf(seq, "\tInternal nodes: %u\n\t", stat->tnodes); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2173 | bytes += sizeof(struct tnode) * stat->tnodes; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2174 | |
Robert Olsson | 06ef921 | 2006-03-20 21:35:01 -0800 | [diff] [blame] | 2175 | max = MAX_STAT_DEPTH; |
| 2176 | while (max > 0 && stat->nodesizes[max-1] == 0) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2177 | max--; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2178 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2179 | pointers = 0; |
| 2180 | for (i = 1; i <= max; i++) |
| 2181 | if (stat->nodesizes[i] != 0) { |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2182 | seq_printf(seq, " %u: %u", i, stat->nodesizes[i]); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2183 | pointers += (1<<i) * stat->nodesizes[i]; |
| 2184 | } |
| 2185 | seq_putc(seq, '\n'); |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2186 | seq_printf(seq, "\tPointers: %u\n", pointers); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2187 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2188 | bytes += sizeof(struct node *) * pointers; |
Stephen Hemminger | 187b518 | 2008-01-12 20:55:55 -0800 | [diff] [blame] | 2189 | seq_printf(seq, "Null ptrs: %u\n", stat->nullpointers); |
| 2190 | seq_printf(seq, "Total size: %u kB\n", (bytes + 1023) / 1024); |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2191 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2192 | |
| 2193 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2194 | static void trie_show_usage(struct seq_file *seq, |
| 2195 | const struct trie_use_stats *stats) |
| 2196 | { |
| 2197 | seq_printf(seq, "\nCounters:\n---------\n"); |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2198 | seq_printf(seq, "gets = %u\n", stats->gets); |
| 2199 | seq_printf(seq, "backtracks = %u\n", stats->backtrack); |
| 2200 | seq_printf(seq, "semantic match passed = %u\n", |
| 2201 | stats->semantic_match_passed); |
| 2202 | seq_printf(seq, "semantic match miss = %u\n", |
| 2203 | stats->semantic_match_miss); |
| 2204 | seq_printf(seq, "null node hit= %u\n", stats->null_node_hit); |
| 2205 | seq_printf(seq, "skipped node resize = %u\n\n", |
| 2206 | stats->resize_node_skipped); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2207 | } |
Stephen Hemminger | 66a2f7f | 2008-01-12 21:23:17 -0800 | [diff] [blame] | 2208 | #endif /* CONFIG_IP_FIB_TRIE_STATS */ |
| 2209 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2210 | static void fib_table_print(struct seq_file *seq, struct fib_table *tb) |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2211 | { |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2212 | if (tb->tb_id == RT_TABLE_LOCAL) |
| 2213 | seq_puts(seq, "Local:\n"); |
| 2214 | else if (tb->tb_id == RT_TABLE_MAIN) |
| 2215 | seq_puts(seq, "Main:\n"); |
| 2216 | else |
| 2217 | seq_printf(seq, "Id %d:\n", tb->tb_id); |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2218 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2219 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2220 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2221 | static int fib_triestat_seq_show(struct seq_file *seq, void *v) |
| 2222 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2223 | struct net *net = (struct net *)seq->private; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2224 | unsigned int h; |
Eric W. Biederman | 877a9bf | 2007-12-07 00:47:47 -0800 | [diff] [blame] | 2225 | |
Stephen Hemminger | d717a9a | 2008-01-14 23:11:54 -0800 | [diff] [blame] | 2226 | seq_printf(seq, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2227 | "Basic info: size of leaf:" |
| 2228 | " %Zd bytes, size of tnode: %Zd bytes.\n", |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2229 | sizeof(struct leaf), sizeof(struct tnode)); |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2230 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2231 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2232 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
| 2233 | struct hlist_node *node; |
| 2234 | struct fib_table *tb; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2235 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2236 | hlist_for_each_entry_rcu(tb, node, head, tb_hlist) { |
| 2237 | struct trie *t = (struct trie *) tb->tb_data; |
| 2238 | struct trie_stat stat; |
| 2239 | |
| 2240 | if (!t) |
| 2241 | continue; |
| 2242 | |
| 2243 | fib_table_print(seq, tb); |
| 2244 | |
| 2245 | trie_collect_stats(t, &stat); |
| 2246 | trie_show_stats(seq, &stat); |
| 2247 | #ifdef CONFIG_IP_FIB_TRIE_STATS |
| 2248 | trie_show_usage(seq, &t->stats); |
| 2249 | #endif |
| 2250 | } |
| 2251 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2252 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2253 | return 0; |
| 2254 | } |
| 2255 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2256 | static int fib_triestat_seq_open(struct inode *inode, struct file *file) |
| 2257 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2258 | int err; |
| 2259 | struct net *net; |
| 2260 | |
| 2261 | net = get_proc_net(inode); |
| 2262 | if (net == NULL) |
| 2263 | return -ENXIO; |
| 2264 | err = single_open(file, fib_triestat_seq_show, net); |
| 2265 | if (err < 0) { |
| 2266 | put_net(net); |
| 2267 | return err; |
| 2268 | } |
| 2269 | return 0; |
| 2270 | } |
| 2271 | |
| 2272 | static int fib_triestat_seq_release(struct inode *ino, struct file *f) |
| 2273 | { |
| 2274 | struct seq_file *seq = f->private_data; |
| 2275 | put_net(seq->private); |
| 2276 | return single_release(ino, f); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2277 | } |
| 2278 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2279 | static const struct file_operations fib_triestat_fops = { |
Stephen Hemminger | c877efb | 2005-07-19 14:01:51 -0700 | [diff] [blame] | 2280 | .owner = THIS_MODULE, |
| 2281 | .open = fib_triestat_seq_open, |
| 2282 | .read = seq_read, |
| 2283 | .llseek = seq_lseek, |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2284 | .release = fib_triestat_seq_release, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2285 | }; |
| 2286 | |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2287 | static struct node *fib_trie_get_idx(struct seq_file *seq, loff_t pos) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2288 | { |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2289 | struct fib_trie_iter *iter = seq->private; |
| 2290 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2291 | loff_t idx = 0; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2292 | unsigned int h; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2293 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2294 | for (h = 0; h < FIB_TABLE_HASHSZ; h++) { |
| 2295 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
| 2296 | struct hlist_node *node; |
| 2297 | struct fib_table *tb; |
| 2298 | |
| 2299 | hlist_for_each_entry_rcu(tb, node, head, tb_hlist) { |
| 2300 | struct node *n; |
| 2301 | |
| 2302 | for (n = fib_trie_get_first(iter, |
| 2303 | (struct trie *) tb->tb_data); |
| 2304 | n; n = fib_trie_get_next(iter)) |
| 2305 | if (pos == idx++) { |
| 2306 | iter->tb = tb; |
| 2307 | return n; |
| 2308 | } |
| 2309 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2310 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2311 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2312 | return NULL; |
| 2313 | } |
| 2314 | |
| 2315 | static void *fib_trie_seq_start(struct seq_file *seq, loff_t *pos) |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 2316 | __acquires(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2317 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2318 | rcu_read_lock(); |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2319 | return fib_trie_get_idx(seq, *pos); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2320 | } |
| 2321 | |
| 2322 | static void *fib_trie_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2323 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2324 | struct fib_trie_iter *iter = seq->private; |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2325 | struct net *net = seq_file_net(seq); |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2326 | struct fib_table *tb = iter->tb; |
| 2327 | struct hlist_node *tb_node; |
| 2328 | unsigned int h; |
| 2329 | struct node *n; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2330 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2331 | ++*pos; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2332 | /* next node in same table */ |
| 2333 | n = fib_trie_get_next(iter); |
| 2334 | if (n) |
| 2335 | return n; |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2336 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2337 | /* walk rest of this hash chain */ |
| 2338 | h = tb->tb_id & (FIB_TABLE_HASHSZ - 1); |
| 2339 | while ( (tb_node = rcu_dereference(tb->tb_hlist.next)) ) { |
| 2340 | tb = hlist_entry(tb_node, struct fib_table, tb_hlist); |
| 2341 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
| 2342 | if (n) |
| 2343 | goto found; |
| 2344 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2345 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2346 | /* new hash chain */ |
| 2347 | while (++h < FIB_TABLE_HASHSZ) { |
| 2348 | struct hlist_head *head = &net->ipv4.fib_table_hash[h]; |
| 2349 | hlist_for_each_entry_rcu(tb, tb_node, head, tb_hlist) { |
| 2350 | n = fib_trie_get_first(iter, (struct trie *) tb->tb_data); |
| 2351 | if (n) |
| 2352 | goto found; |
| 2353 | } |
| 2354 | } |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2355 | return NULL; |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2356 | |
| 2357 | found: |
| 2358 | iter->tb = tb; |
| 2359 | return n; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2360 | } |
| 2361 | |
| 2362 | static void fib_trie_seq_stop(struct seq_file *seq, void *v) |
Stephen Hemminger | c95aaf9 | 2008-01-12 21:25:02 -0800 | [diff] [blame] | 2363 | __releases(RCU) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2364 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2365 | rcu_read_unlock(); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2366 | } |
| 2367 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2368 | static void seq_indent(struct seq_file *seq, int n) |
| 2369 | { |
| 2370 | while (n-- > 0) seq_puts(seq, " "); |
| 2371 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2372 | |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2373 | static inline const char *rtn_scope(char *buf, size_t len, enum rt_scope_t s) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2374 | { |
Stephen Hemminger | 132adf5 | 2007-03-08 20:44:43 -0800 | [diff] [blame] | 2375 | switch (s) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2376 | case RT_SCOPE_UNIVERSE: return "universe"; |
| 2377 | case RT_SCOPE_SITE: return "site"; |
| 2378 | case RT_SCOPE_LINK: return "link"; |
| 2379 | case RT_SCOPE_HOST: return "host"; |
| 2380 | case RT_SCOPE_NOWHERE: return "nowhere"; |
| 2381 | default: |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2382 | snprintf(buf, len, "scope=%d", s); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2383 | return buf; |
| 2384 | } |
| 2385 | } |
| 2386 | |
| 2387 | static const char *rtn_type_names[__RTN_MAX] = { |
| 2388 | [RTN_UNSPEC] = "UNSPEC", |
| 2389 | [RTN_UNICAST] = "UNICAST", |
| 2390 | [RTN_LOCAL] = "LOCAL", |
| 2391 | [RTN_BROADCAST] = "BROADCAST", |
| 2392 | [RTN_ANYCAST] = "ANYCAST", |
| 2393 | [RTN_MULTICAST] = "MULTICAST", |
| 2394 | [RTN_BLACKHOLE] = "BLACKHOLE", |
| 2395 | [RTN_UNREACHABLE] = "UNREACHABLE", |
| 2396 | [RTN_PROHIBIT] = "PROHIBIT", |
| 2397 | [RTN_THROW] = "THROW", |
| 2398 | [RTN_NAT] = "NAT", |
| 2399 | [RTN_XRESOLVE] = "XRESOLVE", |
| 2400 | }; |
| 2401 | |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2402 | static inline const char *rtn_type(char *buf, size_t len, unsigned t) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2403 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2404 | if (t < __RTN_MAX && rtn_type_names[t]) |
| 2405 | return rtn_type_names[t]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2406 | snprintf(buf, len, "type %u", t); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2407 | return buf; |
| 2408 | } |
| 2409 | |
| 2410 | /* Pretty print the trie */ |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2411 | static int fib_trie_seq_show(struct seq_file *seq, void *v) |
| 2412 | { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2413 | const struct fib_trie_iter *iter = seq->private; |
| 2414 | struct node *n = v; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2415 | |
Stephen Hemminger | 3d3b2d2 | 2008-03-23 22:43:56 -0700 | [diff] [blame] | 2416 | if (!node_parent_rcu(n)) |
| 2417 | fib_table_print(seq, iter->tb); |
Robert Olsson | 095b850 | 2007-01-26 19:06:01 -0800 | [diff] [blame] | 2418 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2419 | if (IS_TNODE(n)) { |
| 2420 | struct tnode *tn = (struct tnode *) n; |
Stephen Hemminger | ab66b4a | 2007-08-10 15:22:58 -0700 | [diff] [blame] | 2421 | __be32 prf = htonl(mask_pfx(tn->key, tn->pos)); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2422 | |
Robert Olsson | 1d25cd6 | 2005-09-19 15:29:52 -0700 | [diff] [blame] | 2423 | seq_indent(seq, iter->depth-1); |
| 2424 | seq_printf(seq, " +-- %d.%d.%d.%d/%d %d %d %d\n", |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 2425 | NIPQUAD(prf), tn->pos, tn->bits, tn->full_children, |
Robert Olsson | 1d25cd6 | 2005-09-19 15:29:52 -0700 | [diff] [blame] | 2426 | tn->empty_children); |
YOSHIFUJI Hideaki | e905a9e | 2007-02-09 23:24:47 +0900 | [diff] [blame] | 2427 | |
Olof Johansson | 91b9a27 | 2005-08-09 20:24:39 -0700 | [diff] [blame] | 2428 | } else { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2429 | struct leaf *l = (struct leaf *) n; |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2430 | struct leaf_info *li; |
| 2431 | struct hlist_node *node; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2432 | __be32 val = htonl(l->key); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2433 | |
| 2434 | seq_indent(seq, iter->depth); |
| 2435 | seq_printf(seq, " |-- %d.%d.%d.%d\n", NIPQUAD(val)); |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2436 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2437 | hlist_for_each_entry_rcu(li, node, &l->list, hlist) { |
| 2438 | struct fib_alias *fa; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2439 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2440 | list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
| 2441 | char buf1[32], buf2[32]; |
Eric Dumazet | 28d36e3 | 2008-01-14 23:09:56 -0800 | [diff] [blame] | 2442 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2443 | seq_indent(seq, iter->depth+1); |
| 2444 | seq_printf(seq, " /%d %s %s", li->plen, |
| 2445 | rtn_scope(buf1, sizeof(buf1), |
| 2446 | fa->fa_scope), |
| 2447 | rtn_type(buf2, sizeof(buf2), |
| 2448 | fa->fa_type)); |
| 2449 | if (fa->fa_tos) |
Denis V. Lunev | b9c4d82 | 2008-02-05 02:58:45 -0800 | [diff] [blame] | 2450 | seq_printf(seq, " tos=%d", fa->fa_tos); |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2451 | seq_putc(seq, '\n'); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2452 | } |
| 2453 | } |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2454 | } |
| 2455 | |
| 2456 | return 0; |
| 2457 | } |
| 2458 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 2459 | static const struct seq_operations fib_trie_seq_ops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2460 | .start = fib_trie_seq_start, |
| 2461 | .next = fib_trie_seq_next, |
| 2462 | .stop = fib_trie_seq_stop, |
| 2463 | .show = fib_trie_seq_show, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2464 | }; |
| 2465 | |
| 2466 | static int fib_trie_seq_open(struct inode *inode, struct file *file) |
| 2467 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2468 | return seq_open_net(inode, file, &fib_trie_seq_ops, |
| 2469 | sizeof(struct fib_trie_iter)); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2470 | } |
| 2471 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2472 | static const struct file_operations fib_trie_fops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2473 | .owner = THIS_MODULE, |
| 2474 | .open = fib_trie_seq_open, |
| 2475 | .read = seq_read, |
| 2476 | .llseek = seq_lseek, |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2477 | .release = seq_release_net, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2478 | }; |
| 2479 | |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2480 | struct fib_route_iter { |
| 2481 | struct seq_net_private p; |
| 2482 | struct trie *main_trie; |
| 2483 | loff_t pos; |
| 2484 | t_key key; |
| 2485 | }; |
| 2486 | |
| 2487 | static struct leaf *fib_route_get_idx(struct fib_route_iter *iter, loff_t pos) |
| 2488 | { |
| 2489 | struct leaf *l = NULL; |
| 2490 | struct trie *t = iter->main_trie; |
| 2491 | |
| 2492 | /* use cache location of last found key */ |
| 2493 | if (iter->pos > 0 && pos >= iter->pos && (l = fib_find_node(t, iter->key))) |
| 2494 | pos -= iter->pos; |
| 2495 | else { |
| 2496 | iter->pos = 0; |
| 2497 | l = trie_firstleaf(t); |
| 2498 | } |
| 2499 | |
| 2500 | while (l && pos-- > 0) { |
| 2501 | iter->pos++; |
| 2502 | l = trie_nextleaf(l); |
| 2503 | } |
| 2504 | |
| 2505 | if (l) |
| 2506 | iter->key = pos; /* remember it */ |
| 2507 | else |
| 2508 | iter->pos = 0; /* forget it */ |
| 2509 | |
| 2510 | return l; |
| 2511 | } |
| 2512 | |
| 2513 | static void *fib_route_seq_start(struct seq_file *seq, loff_t *pos) |
| 2514 | __acquires(RCU) |
| 2515 | { |
| 2516 | struct fib_route_iter *iter = seq->private; |
| 2517 | struct fib_table *tb; |
| 2518 | |
| 2519 | rcu_read_lock(); |
YOSHIFUJI Hideaki | 1218854 | 2008-03-26 02:36:06 +0900 | [diff] [blame] | 2520 | tb = fib_get_table(seq_file_net(seq), RT_TABLE_MAIN); |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2521 | if (!tb) |
| 2522 | return NULL; |
| 2523 | |
| 2524 | iter->main_trie = (struct trie *) tb->tb_data; |
| 2525 | if (*pos == 0) |
| 2526 | return SEQ_START_TOKEN; |
| 2527 | else |
| 2528 | return fib_route_get_idx(iter, *pos - 1); |
| 2529 | } |
| 2530 | |
| 2531 | static void *fib_route_seq_next(struct seq_file *seq, void *v, loff_t *pos) |
| 2532 | { |
| 2533 | struct fib_route_iter *iter = seq->private; |
| 2534 | struct leaf *l = v; |
| 2535 | |
| 2536 | ++*pos; |
| 2537 | if (v == SEQ_START_TOKEN) { |
| 2538 | iter->pos = 0; |
| 2539 | l = trie_firstleaf(iter->main_trie); |
| 2540 | } else { |
| 2541 | iter->pos++; |
| 2542 | l = trie_nextleaf(l); |
| 2543 | } |
| 2544 | |
| 2545 | if (l) |
| 2546 | iter->key = l->key; |
| 2547 | else |
| 2548 | iter->pos = 0; |
| 2549 | return l; |
| 2550 | } |
| 2551 | |
| 2552 | static void fib_route_seq_stop(struct seq_file *seq, void *v) |
| 2553 | __releases(RCU) |
| 2554 | { |
| 2555 | rcu_read_unlock(); |
| 2556 | } |
| 2557 | |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2558 | static unsigned fib_flag_trans(int type, __be32 mask, const struct fib_info *fi) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2559 | { |
| 2560 | static unsigned type2flags[RTN_MAX + 1] = { |
| 2561 | [7] = RTF_REJECT, [8] = RTF_REJECT, |
| 2562 | }; |
| 2563 | unsigned flags = type2flags[type]; |
| 2564 | |
| 2565 | if (fi && fi->fib_nh->nh_gw) |
| 2566 | flags |= RTF_GATEWAY; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2567 | if (mask == htonl(0xFFFFFFFF)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2568 | flags |= RTF_HOST; |
| 2569 | flags |= RTF_UP; |
| 2570 | return flags; |
| 2571 | } |
| 2572 | |
| 2573 | /* |
| 2574 | * This outputs /proc/net/route. |
| 2575 | * The format of the file is not supposed to be changed |
| 2576 | * and needs to be same as fib_hash output to avoid breaking |
| 2577 | * legacy utilities |
| 2578 | */ |
| 2579 | static int fib_route_seq_show(struct seq_file *seq, void *v) |
| 2580 | { |
| 2581 | struct leaf *l = v; |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2582 | struct leaf_info *li; |
| 2583 | struct hlist_node *node; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2584 | |
| 2585 | if (v == SEQ_START_TOKEN) { |
| 2586 | seq_printf(seq, "%-127s\n", "Iface\tDestination\tGateway " |
| 2587 | "\tFlags\tRefCnt\tUse\tMetric\tMask\t\tMTU" |
| 2588 | "\tWindow\tIRTT"); |
| 2589 | return 0; |
| 2590 | } |
| 2591 | |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2592 | hlist_for_each_entry_rcu(li, node, &l->list, hlist) { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2593 | struct fib_alias *fa; |
Al Viro | 32ab5f8 | 2006-09-26 22:21:45 -0700 | [diff] [blame] | 2594 | __be32 mask, prefix; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2595 | |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2596 | mask = inet_make_mask(li->plen); |
| 2597 | prefix = htonl(l->key); |
| 2598 | |
| 2599 | list_for_each_entry_rcu(fa, &li->falh, fa_list) { |
Herbert Xu | 1371e37 | 2005-10-15 09:42:39 +1000 | [diff] [blame] | 2600 | const struct fib_info *fi = fa->fa_info; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2601 | unsigned flags = fib_flag_trans(fa->fa_type, mask, fi); |
Stephen Hemminger | 1328042 | 2008-01-22 21:54:37 -0800 | [diff] [blame] | 2602 | char bf[128]; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2603 | |
| 2604 | if (fa->fa_type == RTN_BROADCAST |
| 2605 | || fa->fa_type == RTN_MULTICAST) |
| 2606 | continue; |
| 2607 | |
| 2608 | if (fi) |
| 2609 | snprintf(bf, sizeof(bf), |
| 2610 | "%s\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u", |
| 2611 | fi->fib_dev ? fi->fib_dev->name : "*", |
| 2612 | prefix, |
| 2613 | fi->fib_nh->nh_gw, flags, 0, 0, |
| 2614 | fi->fib_priority, |
| 2615 | mask, |
Stephen Hemminger | a07f5f5 | 2008-01-22 21:53:36 -0800 | [diff] [blame] | 2616 | (fi->fib_advmss ? |
| 2617 | fi->fib_advmss + 40 : 0), |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2618 | fi->fib_window, |
| 2619 | fi->fib_rtt >> 3); |
| 2620 | else |
| 2621 | snprintf(bf, sizeof(bf), |
| 2622 | "*\t%08X\t%08X\t%04X\t%d\t%u\t%d\t%08X\t%d\t%u\t%u", |
| 2623 | prefix, 0, flags, 0, 0, 0, |
| 2624 | mask, 0, 0, 0); |
| 2625 | |
| 2626 | seq_printf(seq, "%-127s\n", bf); |
| 2627 | } |
| 2628 | } |
| 2629 | |
| 2630 | return 0; |
| 2631 | } |
| 2632 | |
Stephen Hemminger | f690808 | 2007-03-12 14:34:29 -0700 | [diff] [blame] | 2633 | static const struct seq_operations fib_route_seq_ops = { |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2634 | .start = fib_route_seq_start, |
| 2635 | .next = fib_route_seq_next, |
| 2636 | .stop = fib_route_seq_stop, |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2637 | .show = fib_route_seq_show, |
| 2638 | }; |
| 2639 | |
| 2640 | static int fib_route_seq_open(struct inode *inode, struct file *file) |
| 2641 | { |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2642 | return seq_open_net(inode, file, &fib_route_seq_ops, |
Stephen Hemminger | 8315f5d | 2008-02-11 21:14:39 -0800 | [diff] [blame] | 2643 | sizeof(struct fib_route_iter)); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2644 | } |
| 2645 | |
Arjan van de Ven | 9a32144 | 2007-02-12 00:55:35 -0800 | [diff] [blame] | 2646 | static const struct file_operations fib_route_fops = { |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2647 | .owner = THIS_MODULE, |
| 2648 | .open = fib_route_seq_open, |
| 2649 | .read = seq_read, |
| 2650 | .llseek = seq_lseek, |
Denis V. Lunev | 1c340b2 | 2008-01-10 03:27:17 -0800 | [diff] [blame] | 2651 | .release = seq_release_net, |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2652 | }; |
| 2653 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2654 | int __net_init fib_proc_init(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2655 | { |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2656 | if (!proc_net_fops_create(net, "fib_trie", S_IRUGO, &fib_trie_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2657 | goto out1; |
| 2658 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2659 | if (!proc_net_fops_create(net, "fib_triestat", S_IRUGO, |
| 2660 | &fib_triestat_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2661 | goto out2; |
| 2662 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2663 | if (!proc_net_fops_create(net, "route", S_IRUGO, &fib_route_fops)) |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2664 | goto out3; |
| 2665 | |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2666 | return 0; |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2667 | |
| 2668 | out3: |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2669 | proc_net_remove(net, "fib_triestat"); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2670 | out2: |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2671 | proc_net_remove(net, "fib_trie"); |
Stephen Hemminger | cb7b593 | 2005-09-09 13:35:42 -0700 | [diff] [blame] | 2672 | out1: |
| 2673 | return -ENOMEM; |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2674 | } |
| 2675 | |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2676 | void __net_exit fib_proc_exit(struct net *net) |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2677 | { |
Denis V. Lunev | 61a0265 | 2008-01-10 03:21:09 -0800 | [diff] [blame] | 2678 | proc_net_remove(net, "fib_trie"); |
| 2679 | proc_net_remove(net, "fib_triestat"); |
| 2680 | proc_net_remove(net, "route"); |
Robert Olsson | 19baf83 | 2005-06-21 12:43:18 -0700 | [diff] [blame] | 2681 | } |
| 2682 | |
| 2683 | #endif /* CONFIG_PROC_FS */ |