2 * U-boot - bitops.h Routines for bit operations
4 * Copyright (c) 2005 blackfin.uclinux.org
6 * See file CREDITS for list of people who contributed to this
9 * This program is free software; you can redistribute it and/or
10 * modify it under the terms of the GNU General Public License as
11 * published by the Free Software Foundation; either version 2 of
12 * the License, or (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
25 #ifndef _BLACKFIN_BITOPS_H
26 #define _BLACKFIN_BITOPS_H
29 * Copyright 1992, Linus Torvalds.
32 #include <linux/config.h>
33 #include <asm/byteorder.h>
34 #include <asm/system.h>
38 * Function prototypes to keep gcc -Wall happy
42 * The __ functions are not atomic
46 * ffz = Find First Zero in word. Undefined if no zero exists,
47 * so code should check against ~0UL first..
49 static __inline__ unsigned long ffz(unsigned long word)
51 unsigned long result = 0;
60 static __inline__ void set_bit(int nr, volatile void *addr)
62 int *a = (int *) addr;
67 mask = 1 << (nr & 0x1f);
73 static __inline__ void __set_bit(int nr, volatile void *addr)
75 int *a = (int *) addr;
79 mask = 1 << (nr & 0x1f);
84 * clear_bit() doesn't provide any barrier for the compiler.
86 #define smp_mb__before_clear_bit() barrier()
87 #define smp_mb__after_clear_bit() barrier()
89 static __inline__ void clear_bit(int nr, volatile void *addr)
91 int *a = (int *) addr;
96 mask = 1 << (nr & 0x1f);
102 static __inline__ void change_bit(int nr, volatile void *addr)
105 unsigned long *ADDR = (unsigned long *) addr;
108 mask = 1 << (nr & 31);
111 restore_flags(flags);
114 static __inline__ void __change_bit(int nr, volatile void *addr)
117 unsigned long *ADDR = (unsigned long *) addr;
120 mask = 1 << (nr & 31);
124 static __inline__ int test_and_set_bit(int nr, volatile void *addr)
127 volatile unsigned int *a = (volatile unsigned int *) addr;
131 mask = 1 << (nr & 0x1f);
133 retval = (mask & *a) != 0;
135 restore_flags(flags);
140 static __inline__ int __test_and_set_bit(int nr, volatile void *addr)
143 volatile unsigned int *a = (volatile unsigned int *) addr;
146 mask = 1 << (nr & 0x1f);
147 retval = (mask & *a) != 0;
152 static __inline__ int test_and_clear_bit(int nr, volatile void *addr)
155 volatile unsigned int *a = (volatile unsigned int *) addr;
159 mask = 1 << (nr & 0x1f);
161 retval = (mask & *a) != 0;
163 restore_flags(flags);
168 static __inline__ int __test_and_clear_bit(int nr, volatile void *addr)
171 volatile unsigned int *a = (volatile unsigned int *) addr;
174 mask = 1 << (nr & 0x1f);
175 retval = (mask & *a) != 0;
180 static __inline__ int test_and_change_bit(int nr, volatile void *addr)
183 volatile unsigned int *a = (volatile unsigned int *) addr;
187 mask = 1 << (nr & 0x1f);
189 retval = (mask & *a) != 0;
191 restore_flags(flags);
196 static __inline__ int __test_and_change_bit(int nr, volatile void *addr)
199 volatile unsigned int *a = (volatile unsigned int *) addr;
202 mask = 1 << (nr & 0x1f);
203 retval = (mask & *a) != 0;
209 * This routine doesn't need to be atomic.
211 static __inline__ int __constant_test_bit(int nr,
212 const volatile void *addr)
214 return ((1UL << (nr & 31)) &
215 (((const volatile unsigned int *) addr)[nr >> 5])) != 0;
218 static __inline__ int __test_bit(int nr, volatile void *addr)
220 int *a = (int *) addr;
224 mask = 1 << (nr & 0x1f);
225 return ((mask & *a) != 0);
228 #define test_bit(nr,addr) \
229 (__builtin_constant_p(nr) ? \
230 __constant_test_bit((nr),(addr)) : \
231 __test_bit((nr),(addr)))
233 #define find_first_zero_bit(addr, size) \
234 find_next_zero_bit((addr), (size), 0)
236 static __inline__ int find_next_zero_bit(void *addr, int size, int offset)
238 unsigned long *p = ((unsigned long *) addr) + (offset >> 5);
239 unsigned long result = offset & ~31UL;
248 tmp |= ~0UL >> (32 - offset);
256 while (size & ~31UL) {
269 return result + ffz(tmp);
273 * ffs: find first bit set. This is defined the same way as
274 * the libc and compiler builtin ffs routines, therefore
275 * differs in spirit from the above ffz (man ffs).
278 #define ffs(x) generic_ffs(x)
281 * hweightN: returns the hamming weight (i.e. the number
282 * of bits set) of a N-bit word
285 #define hweight32(x) generic_hweight32(x)
286 #define hweight16(x) generic_hweight16(x)
287 #define hweight8(x) generic_hweight8(x)
289 static __inline__ int ext2_set_bit(int nr, volatile void *addr)
293 volatile unsigned char *ADDR = (unsigned char *) addr;
296 mask = 1 << (nr & 0x07);
298 retval = (mask & *ADDR) != 0;
300 restore_flags(flags);
304 static __inline__ int ext2_clear_bit(int nr, volatile void *addr)
308 volatile unsigned char *ADDR = (unsigned char *) addr;
311 mask = 1 << (nr & 0x07);
313 retval = (mask & *ADDR) != 0;
315 restore_flags(flags);
319 static __inline__ int ext2_test_bit(int nr, const volatile void *addr)
322 const volatile unsigned char *ADDR = (const unsigned char *) addr;
325 mask = 1 << (nr & 0x07);
326 return ((mask & *ADDR) != 0);
329 #define ext2_find_first_zero_bit(addr, size) \
330 ext2_find_next_zero_bit((addr), (size), 0)
332 static __inline__ unsigned long ext2_find_next_zero_bit(void *addr,
337 unsigned long *p = ((unsigned long *) addr) + (offset >> 5);
338 unsigned long result = offset & ~31UL;
347 tmp |= ~0UL >> (32 - offset);
355 while (size & ~31UL) {
368 return result + ffz(tmp);
371 /* Bitmap functions for the minix filesystem. */
372 #define minix_test_and_set_bit(nr,addr) test_and_set_bit(nr,addr)
373 #define minix_set_bit(nr,addr) set_bit(nr,addr)
374 #define minix_test_and_clear_bit(nr,addr) test_and_clear_bit(nr,addr)
375 #define minix_test_bit(nr,addr) test_bit(nr,addr)
376 #define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size)