diff options
author | YOSHIFUJI Hideaki / 吉藤英明 <yoshfuji@linux-ipv6.org> | 2010-03-26 21:24:16 -0400 |
---|---|---|
committer | David S. Miller <davem@davemloft.net> | 2010-03-31 02:28:47 -0400 |
commit | 02cdce53f3d0d3eee8188944c96150ee8c97100d (patch) | |
tree | 38ac636007de481c46f60e3848e80883e1235080 /net/ipv6/ip6_fib.c | |
parent | de7737e056d65ad6b0f135f7bb24d86458af0d47 (diff) |
ipv6 fib: Use "Sweezle" to optimize addr_bit_test().
addr_bit_test() is used in various places in IPv6 routing table
subsystem. It checks if the given fn_bit is set,
where fn_bit counts bits from MSB in words in network-order.
fn_bit : 0 .... 31 32 .... 64 65 .... 95 96 ....127
fn_bit >> 5 gives offset of word, and (~fn_bit & 0x1f) gives
count from LSB in the network-endian word in question.
fn_bit >> 5 : 0 1 2 3
~fn_bit & 0x1f: 31 .... 0 31 .... 0 31 .... 0 31 .... 0
Thus, the mask was generated as htonl(1 << (~fn_bit & 0x1f)).
This can be optimized by "sweezle" (See include/asm-generic/bitops/le.h).
In little-endian,
htonl(1 << bit) = 1 << (bit ^ BITOP_BE32_SWIZZLE)
where
BITOP_BE32_SWIZZLE is (0x1f & ~7)
So,
htonl(1 << (~fn_bit & 0x1f)) = 1 << ((~fn_bit & 0x1f) ^ (0x1f & ~7))
= 1 << ((~fn_bit ^ ~7) & 0x1f)
= 1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)
In big-endian, BITOP_BE32_SWIZZLE is equal to 0.
1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)
= 1 << ((~fn_bit) & 0x1f)
= htonl(1 << (~fn_bit & 0x1f))
Signed-off-by: YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'net/ipv6/ip6_fib.c')
-rw-r--r-- | net/ipv6/ip6_fib.c | 15 |
1 files changed, 13 insertions, 2 deletions
diff --git a/net/ipv6/ip6_fib.c b/net/ipv6/ip6_fib.c index 2f9847924fa5..68119ef62869 100644 --- a/net/ipv6/ip6_fib.c +++ b/net/ipv6/ip6_fib.c | |||
@@ -127,12 +127,23 @@ static __inline__ u32 fib6_new_sernum(void) | |||
127 | /* | 127 | /* |
128 | * test bit | 128 | * test bit |
129 | */ | 129 | */ |
130 | #if defined(__LITTLE_ENDIAN) | ||
131 | # define BITOP_BE32_SWIZZLE (0x1F & ~7) | ||
132 | #else | ||
133 | # define BITOP_BE32_SWIZZLE 0 | ||
134 | #endif | ||
130 | 135 | ||
131 | static __inline__ __be32 addr_bit_set(void *token, int fn_bit) | 136 | static __inline__ __be32 addr_bit_set(void *token, int fn_bit) |
132 | { | 137 | { |
133 | __be32 *addr = token; | 138 | __be32 *addr = token; |
134 | 139 | /* | |
135 | return htonl(1 << ((~fn_bit)&0x1F)) & addr[fn_bit>>5]; | 140 | * Here, |
141 | * 1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f) | ||
142 | * is optimized version of | ||
143 | * htonl(1 << ((~fn_bit)&0x1F)) | ||
144 | * See include/asm-generic/bitops/le.h. | ||
145 | */ | ||
146 | return (1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)) & addr[fn_bit >> 5]; | ||
136 | } | 147 | } |
137 | 148 | ||
138 | static __inline__ struct fib6_node * node_alloc(void) | 149 | static __inline__ struct fib6_node * node_alloc(void) |