diff options
Diffstat (limited to 'net/ipv6/ip6_fib.c')
-rw-r--r-- | net/ipv6/ip6_fib.c | 54 |
1 files changed, 2 insertions, 52 deletions
diff --git a/net/ipv6/ip6_fib.c b/net/ipv6/ip6_fib.c index 4fcc5a7acf6e..1bf6d9a769e6 100644 --- a/net/ipv6/ip6_fib.c +++ b/net/ipv6/ip6_fib.c | |||
@@ -127,56 +127,6 @@ static __inline__ int addr_bit_set(void *token, int fn_bit) | |||
127 | return htonl(1 << ((~fn_bit)&0x1F)) & addr[fn_bit>>5]; | 127 | return htonl(1 << ((~fn_bit)&0x1F)) & addr[fn_bit>>5]; |
128 | } | 128 | } |
129 | 129 | ||
130 | /* | ||
131 | * find the first different bit between two addresses | ||
132 | * length of address must be a multiple of 32bits | ||
133 | */ | ||
134 | |||
135 | static __inline__ int addr_diff(void *token1, void *token2, int addrlen) | ||
136 | { | ||
137 | __u32 *a1 = token1; | ||
138 | __u32 *a2 = token2; | ||
139 | int i; | ||
140 | |||
141 | addrlen >>= 2; | ||
142 | |||
143 | for (i = 0; i < addrlen; i++) { | ||
144 | __u32 xb; | ||
145 | |||
146 | xb = a1[i] ^ a2[i]; | ||
147 | |||
148 | if (xb) { | ||
149 | int j = 31; | ||
150 | |||
151 | xb = ntohl(xb); | ||
152 | |||
153 | while ((xb & (1 << j)) == 0) | ||
154 | j--; | ||
155 | |||
156 | return (i * 32 + 31 - j); | ||
157 | } | ||
158 | } | ||
159 | |||
160 | /* | ||
161 | * we should *never* get to this point since that | ||
162 | * would mean the addrs are equal | ||
163 | * | ||
164 | * However, we do get to it 8) And exacly, when | ||
165 | * addresses are equal 8) | ||
166 | * | ||
167 | * ip route add 1111::/128 via ... | ||
168 | * ip route add 1111::/64 via ... | ||
169 | * and we are here. | ||
170 | * | ||
171 | * Ideally, this function should stop comparison | ||
172 | * at prefix length. It does not, but it is still OK, | ||
173 | * if returned value is greater than prefix length. | ||
174 | * --ANK (980803) | ||
175 | */ | ||
176 | |||
177 | return addrlen<<5; | ||
178 | } | ||
179 | |||
180 | static __inline__ struct fib6_node * node_alloc(void) | 130 | static __inline__ struct fib6_node * node_alloc(void) |
181 | { | 131 | { |
182 | struct fib6_node *fn; | 132 | struct fib6_node *fn; |
@@ -296,11 +246,11 @@ insert_above: | |||
296 | 246 | ||
297 | /* find 1st bit in difference between the 2 addrs. | 247 | /* find 1st bit in difference between the 2 addrs. |
298 | 248 | ||
299 | See comment in addr_diff: bit may be an invalid value, | 249 | See comment in __ipv6_addr_diff: bit may be an invalid value, |
300 | but if it is >= plen, the value is ignored in any case. | 250 | but if it is >= plen, the value is ignored in any case. |
301 | */ | 251 | */ |
302 | 252 | ||
303 | bit = addr_diff(addr, &key->addr, addrlen); | 253 | bit = __ipv6_addr_diff(addr, &key->addr, addrlen); |
304 | 254 | ||
305 | /* | 255 | /* |
306 | * (intermediate)[in] | 256 | * (intermediate)[in] |