]> bbs.cooldavid.org Git - net-next-2.6.git/blame - include/linux/bitops.h
bitops: Optimize hweight() by making use of compile-time evaluation
[net-next-2.6.git] / include / linux / bitops.h
CommitLineData
1da177e4
LT
1#ifndef _LINUX_BITOPS_H
2#define _LINUX_BITOPS_H
3#include <asm/types.h>
4
d05be13b 5#ifdef __KERNEL__
93043ece 6#define BIT(nr) (1UL << (nr))
d05be13b
JS
7#define BIT_MASK(nr) (1UL << ((nr) % BITS_PER_LONG))
8#define BIT_WORD(nr) ((nr) / BITS_PER_LONG)
d05be13b 9#define BITS_PER_BYTE 8
ede9c697 10#define BITS_TO_LONGS(nr) DIV_ROUND_UP(nr, BITS_PER_BYTE * sizeof(long))
d05be13b
JS
11#endif
12
1da177e4
LT
13/*
14 * Include this here because some architectures need generic_ffs/fls in
15 * scope
16 */
17#include <asm/bitops.h>
18
984b3f57 19#define for_each_set_bit(bit, addr, size) \
3e037454
SN
20 for ((bit) = find_first_bit((addr), (size)); \
21 (bit) < (size); \
22 (bit) = find_next_bit((addr), (size), (bit) + 1))
23
984b3f57
AM
24/* Temporary */
25#define for_each_bit(bit, addr, size) for_each_set_bit(bit, addr, size)
3e037454 26
1da177e4
LT
27static __inline__ int get_bitmask_order(unsigned int count)
28{
29 int order;
9f41699e 30
1da177e4
LT
31 order = fls(count);
32 return order; /* We could be slightly more clever with -1 here... */
33}
34
94605eff
SS
35static __inline__ int get_count_order(unsigned int count)
36{
37 int order;
9f41699e 38
94605eff
SS
39 order = fls(count) - 1;
40 if (count & (count - 1))
41 order++;
42 return order;
43}
44
1da177e4
LT
45static inline unsigned long hweight_long(unsigned long w)
46{
e9bebd6f 47 return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
1da177e4
LT
48}
49
45f8bde0 50/**
1da177e4 51 * rol32 - rotate a 32-bit value left
1da177e4
LT
52 * @word: value to rotate
53 * @shift: bits to roll
54 */
55static inline __u32 rol32(__u32 word, unsigned int shift)
56{
57 return (word << shift) | (word >> (32 - shift));
58}
59
45f8bde0 60/**
1da177e4 61 * ror32 - rotate a 32-bit value right
1da177e4
LT
62 * @word: value to rotate
63 * @shift: bits to roll
64 */
65static inline __u32 ror32(__u32 word, unsigned int shift)
66{
67 return (word >> shift) | (word << (32 - shift));
68}
69
3afe3925
HH
70/**
71 * rol16 - rotate a 16-bit value left
72 * @word: value to rotate
73 * @shift: bits to roll
74 */
75static inline __u16 rol16(__u16 word, unsigned int shift)
76{
77 return (word << shift) | (word >> (16 - shift));
78}
79
80/**
81 * ror16 - rotate a 16-bit value right
82 * @word: value to rotate
83 * @shift: bits to roll
84 */
85static inline __u16 ror16(__u16 word, unsigned int shift)
86{
87 return (word >> shift) | (word << (16 - shift));
88}
89
90/**
91 * rol8 - rotate an 8-bit value left
92 * @word: value to rotate
93 * @shift: bits to roll
94 */
95static inline __u8 rol8(__u8 word, unsigned int shift)
96{
97 return (word << shift) | (word >> (8 - shift));
98}
99
100/**
101 * ror8 - rotate an 8-bit value right
102 * @word: value to rotate
103 * @shift: bits to roll
104 */
105static inline __u8 ror8(__u8 word, unsigned int shift)
106{
107 return (word >> shift) | (word << (8 - shift));
108}
109
962749af
AM
110static inline unsigned fls_long(unsigned long l)
111{
112 if (sizeof(l) == 4)
113 return fls(l);
114 return fls64(l);
115}
116
952043ac
SW
117/**
118 * __ffs64 - find first set bit in a 64 bit word
119 * @word: The 64 bit word
120 *
121 * On 64 bit arches this is a synomyn for __ffs
122 * The result is not defined if no bits are set, so check that @word
123 * is non-zero before calling this.
124 */
125static inline unsigned long __ffs64(u64 word)
126{
127#if BITS_PER_LONG == 32
128 if (((u32)word) == 0UL)
129 return __ffs((u32)(word >> 32)) + 32;
130#elif BITS_PER_LONG != 64
131#error BITS_PER_LONG not 32 or 64
132#endif
133 return __ffs((unsigned long)word);
134}
135
64970b68 136#ifdef __KERNEL__
77b9bd9c 137#ifdef CONFIG_GENERIC_FIND_FIRST_BIT
77b9bd9c
AH
138
139/**
140 * find_first_bit - find the first set bit in a memory region
141 * @addr: The address to start the search at
142 * @size: The maximum size to search
143 *
144 * Returns the bit number of the first set bit.
145 */
fee4b19f
TG
146extern unsigned long find_first_bit(const unsigned long *addr,
147 unsigned long size);
77b9bd9c
AH
148
149/**
150 * find_first_zero_bit - find the first cleared bit in a memory region
151 * @addr: The address to start the search at
152 * @size: The maximum size to search
153 *
154 * Returns the bit number of the first cleared bit.
155 */
fee4b19f
TG
156extern unsigned long find_first_zero_bit(const unsigned long *addr,
157 unsigned long size);
77b9bd9c
AH
158#endif /* CONFIG_GENERIC_FIND_FIRST_BIT */
159
ab53d472
RR
160#ifdef CONFIG_GENERIC_FIND_LAST_BIT
161/**
162 * find_last_bit - find the last set bit in a memory region
163 * @addr: The address to start the search at
164 * @size: The maximum size to search
165 *
166 * Returns the bit number of the first set bit, or size.
167 */
168extern unsigned long find_last_bit(const unsigned long *addr,
169 unsigned long size);
170#endif /* CONFIG_GENERIC_FIND_LAST_BIT */
171
64970b68 172#ifdef CONFIG_GENERIC_FIND_NEXT_BIT
64970b68
AH
173
174/**
175 * find_next_bit - find the next set bit in a memory region
176 * @addr: The address to base the search on
177 * @offset: The bitnumber to start searching at
178 * @size: The bitmap size in bits
179 */
fee4b19f
TG
180extern unsigned long find_next_bit(const unsigned long *addr,
181 unsigned long size, unsigned long offset);
64970b68
AH
182
183/**
184 * find_next_zero_bit - find the next cleared bit in a memory region
185 * @addr: The address to base the search on
186 * @offset: The bitnumber to start searching at
187 * @size: The bitmap size in bits
188 */
fee4b19f
TG
189
190extern unsigned long find_next_zero_bit(const unsigned long *addr,
191 unsigned long size,
192 unsigned long offset);
193
64970b68
AH
194#endif /* CONFIG_GENERIC_FIND_NEXT_BIT */
195#endif /* __KERNEL__ */
1da177e4 196#endif