Merge commit 'pm-fixes-for-3.3-rc3' into pm-qos
[deliverable/linux.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
4677d4a5
BP
13extern unsigned int __sw_hweight8(unsigned int w);
14extern unsigned int __sw_hweight16(unsigned int w);
15extern unsigned int __sw_hweight32(unsigned int w);
16extern unsigned long __sw_hweight64(__u64 w);
17
1da177e4
LT
18/*
19 * Include this here because some architectures need generic_ffs/fls in
20 * scope
21 */
22#include <asm/bitops.h>
23
984b3f57 24#define for_each_set_bit(bit, addr, size) \
1e2ad28f
RR
25 for ((bit) = find_first_bit((addr), (size)); \
26 (bit) < (size); \
27 (bit) = find_next_bit((addr), (size), (bit) + 1))
28
29/* same as for_each_set_bit() but use bit as value to start with */
30#define for_each_set_bit_cont(bit, addr, size) \
31 for ((bit) = find_next_bit((addr), (size), (bit)); \
32 (bit) < (size); \
3e037454
SN
33 (bit) = find_next_bit((addr), (size), (bit) + 1))
34
1da177e4
LT
35static __inline__ int get_bitmask_order(unsigned int count)
36{
37 int order;
9f41699e 38
1da177e4
LT
39 order = fls(count);
40 return order; /* We could be slightly more clever with -1 here... */
41}
42
94605eff
SS
43static __inline__ int get_count_order(unsigned int count)
44{
45 int order;
9f41699e 46
94605eff
SS
47 order = fls(count) - 1;
48 if (count & (count - 1))
49 order++;
50 return order;
51}
52
1da177e4
LT
53static inline unsigned long hweight_long(unsigned long w)
54{
e9bebd6f 55 return sizeof(w) == 4 ? hweight32(w) : hweight64(w);
1da177e4
LT
56}
57
45f8bde0 58/**
1da177e4 59 * rol32 - rotate a 32-bit value left
1da177e4
LT
60 * @word: value to rotate
61 * @shift: bits to roll
62 */
63static inline __u32 rol32(__u32 word, unsigned int shift)
64{
65 return (word << shift) | (word >> (32 - shift));
66}
67
45f8bde0 68/**
1da177e4 69 * ror32 - rotate a 32-bit value right
1da177e4
LT
70 * @word: value to rotate
71 * @shift: bits to roll
72 */
73static inline __u32 ror32(__u32 word, unsigned int shift)
74{
75 return (word >> shift) | (word << (32 - shift));
76}
77
3afe3925
HH
78/**
79 * rol16 - rotate a 16-bit value left
80 * @word: value to rotate
81 * @shift: bits to roll
82 */
83static inline __u16 rol16(__u16 word, unsigned int shift)
84{
85 return (word << shift) | (word >> (16 - shift));
86}
87
88/**
89 * ror16 - rotate a 16-bit value right
90 * @word: value to rotate
91 * @shift: bits to roll
92 */
93static inline __u16 ror16(__u16 word, unsigned int shift)
94{
95 return (word >> shift) | (word << (16 - shift));
96}
97
98/**
99 * rol8 - rotate an 8-bit value left
100 * @word: value to rotate
101 * @shift: bits to roll
102 */
103static inline __u8 rol8(__u8 word, unsigned int shift)
104{
105 return (word << shift) | (word >> (8 - shift));
106}
107
108/**
109 * ror8 - rotate an 8-bit value right
110 * @word: value to rotate
111 * @shift: bits to roll
112 */
113static inline __u8 ror8(__u8 word, unsigned int shift)
114{
115 return (word >> shift) | (word << (8 - shift));
116}
7919a57b
AH
117
118/**
119 * sign_extend32 - sign extend a 32-bit value using specified bit as sign-bit
120 * @value: value to sign extend
121 * @index: 0 based bit index (0<=index<32) to sign bit
122 */
123static inline __s32 sign_extend32(__u32 value, int index)
124{
125 __u8 shift = 31 - index;
126 return (__s32)(value << shift) >> shift;
127}
3afe3925 128
962749af
AM
129static inline unsigned fls_long(unsigned long l)
130{
131 if (sizeof(l) == 4)
132 return fls(l);
133 return fls64(l);
134}
135
952043ac
SW
136/**
137 * __ffs64 - find first set bit in a 64 bit word
138 * @word: The 64 bit word
139 *
140 * On 64 bit arches this is a synomyn for __ffs
141 * The result is not defined if no bits are set, so check that @word
142 * is non-zero before calling this.
143 */
144static inline unsigned long __ffs64(u64 word)
145{
146#if BITS_PER_LONG == 32
147 if (((u32)word) == 0UL)
148 return __ffs((u32)(word >> 32)) + 32;
149#elif BITS_PER_LONG != 64
150#error BITS_PER_LONG not 32 or 64
151#endif
152 return __ffs((unsigned long)word);
153}
154
64970b68 155#ifdef __KERNEL__
77b9bd9c 156
19de85ef 157#ifndef find_last_bit
ab53d472
RR
158/**
159 * find_last_bit - find the last set bit in a memory region
160 * @addr: The address to start the search at
161 * @size: The maximum size to search
162 *
163 * Returns the bit number of the first set bit, or size.
164 */
165extern unsigned long find_last_bit(const unsigned long *addr,
166 unsigned long size);
19de85ef 167#endif
ab53d472 168
64970b68 169#endif /* __KERNEL__ */
1da177e4 170#endif
This page took 0.838383 seconds and 5 git commands to generate.