/* * Copyright (c) 2008 Carsten Schlote * See file CREDITS for list of people who contributed to this project. * * This file is part of barebox. * * barebox is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * barebox is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with barebox. If not, see . */ /** @file * Bitops helper functions and defines for M68k * * bit 0 is the LSB of addr; bit 32 is the HSB. * * Please note that the code in this file should never be included * from user space. Many of these are not implemented in assembler * since they would be too costly. Also, they require priviledged * instructions (which are not available from user mode) to ensure * that they are atomic. */ #ifndef __ASM_M68K_BITOPS_H #define __ASM_M68K_BITOPS_H /* * Function prototypes to keep gcc -Wall happy. */ extern void set_bit(int nr, volatile void * addr); static inline void __set_bit(int nr, volatile void *addr) { ((unsigned char *) addr)[nr >> 3] |= (1U << (nr & 7)); } extern void clear_bit(int nr, volatile void * addr); static inline void __clear_bit(int nr, volatile void *addr) { ((unsigned char *) addr)[nr >> 3] &= ~(1U << (nr & 7)); } extern void change_bit(int nr, volatile void * addr); static inline void __change_bit(int nr, volatile void *addr) { ((unsigned char *) addr)[nr >> 3] ^= (1U << (nr & 7)); } extern int test_and_set_bit(int nr, volatile void * addr); static inline int __test_and_set_bit(int nr, volatile void *addr) { unsigned int mask = 1 << (nr & 7); unsigned int oldval; oldval = ((unsigned char *) addr)[nr >> 3]; ((unsigned char *) addr)[nr >> 3] = oldval | mask; return oldval & mask; } extern int test_and_clear_bit(int nr, volatile void * addr); static inline int __test_and_clear_bit(int nr, volatile void *addr) { unsigned int mask = 1 << (nr & 7); unsigned int oldval; oldval = ((unsigned char *) addr)[nr >> 3]; ((unsigned char *) addr)[nr >> 3] = oldval & ~mask; return oldval & mask; } extern int test_and_change_bit(int nr, volatile void * addr); static inline int __test_and_change_bit(int nr, volatile void *addr) { unsigned int mask = 1 << (nr & 7); unsigned int oldval; oldval = ((unsigned char *) addr)[nr >> 3]; ((unsigned char *) addr)[nr >> 3] = oldval ^ mask; return oldval & mask; } extern int find_first_zero_bit(void * addr, unsigned size); extern int find_next_zero_bit(void * addr, int size, int offset); /* * This routine doesn't need to be atomic. */ static inline int test_bit(int nr, const void * addr) { return ((unsigned char *) addr)[nr >> 3] & (1U << (nr & 7)); } /* * ffz = Find First Zero in word. Undefined if no zero exists, * so code should check against ~0UL first.. */ static inline unsigned long ffz(unsigned long word) { int k; word = ~word; k = 31; if (word & 0x0000ffff) { k -= 16; word <<= 16; } if (word & 0x00ff0000) { k -= 8; word <<= 8; } if (word & 0x0f000000) { k -= 4; word <<= 4; } if (word & 0x30000000) { k -= 2; word <<= 2; } if (word & 0x40000000) { k -= 1; } return k; } #include #include #define ext2_set_bit test_and_set_bit #define ext2_clear_bit test_and_clear_bit #define ext2_test_bit test_bit #define ext2_find_first_zero_bit find_first_zero_bit #define ext2_find_next_zero_bit find_next_zero_bit /* Bitmap functions for the minix filesystem. */ #define minix_test_and_set_bit(nr,addr) test_and_set_bit(nr,addr) #define minix_set_bit(nr,addr) set_bit(nr,addr) #define minix_test_and_clear_bit(nr,addr) test_and_clear_bit(nr,addr) #define minix_test_bit(nr,addr) test_bit(nr,addr) #define minix_find_first_zero_bit(addr,size) find_first_zero_bit(addr,size) #endif /* __ASM_M68K_BITOPS_H */