blob: 0dd6c2b654eb76cea75822ad3385049d7f17d399 [file] [log] [blame]
Travis Geiselbrecht1d0df692008-09-01 02:26:09 -07001/*
2 * Copyright (c) 2008 Travis Geiselbrecht
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining
5 * a copy of this software and associated documentation files
6 * (the "Software"), to deal in the Software without restriction,
7 * including without limitation the rights to use, copy, modify, merge,
8 * publish, distribute, sublicense, and/or sell copies of the Software,
9 * and to permit persons to whom the Software is furnished to do so,
10 * subject to the following conditions:
11 *
12 * The above copyright notice and this permission notice shall be
13 * included in all copies or substantial portions of the Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
16 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
17 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
18 * IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
19 * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
20 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
21 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
22 */
23#ifndef __BITS_H
24#define __BITS_H
25
Dima Zavinafa68392009-01-20 19:25:47 -080026#include <arch/ops.h>
27
Travis Geiselbrecht1d0df692008-09-01 02:26:09 -070028#define clz(x) __builtin_clz(x)
29
Shashank Mittalefb6c972011-06-24 17:12:57 -070030#define BIT(bit) (1 << (bit))
31#define BIT_GET(x, bit) ((x) & (1 << (bit)))
Travis Geiselbrecht1d0df692008-09-01 02:26:09 -070032#define BIT_SHIFT(x, bit) (((x) >> (bit)) & 1)
33#define BITS(x, high, low) ((x) & (((1<<((high)+1))-1) & ~((1<<(low))-1)))
34#define BITS_SHIFT(x, high, low) (((x) >> (low)) & ((1<<((high)-(low)+1))-1))
35#define BIT_SET(x, bit) (((x) & (1 << (bit))) ? 1 : 0)
36
Dima Zavinafa68392009-01-20 19:25:47 -080037#define BITMAP_BITS_PER_WORD (sizeof(unsigned long) * 8)
38#define BITMAP_NUM_WORDS(x) (((x) / BITMAP_BITS_PER_WORD) + 1)
39#define BITMAP_WORD(x) ((x) / BITMAP_BITS_PER_WORD)
40#define BITMAP_BIT_IN_WORD(x) ((x) & (BITMAP_BITS_PER_WORD - 1))
41
42static inline int bitmap_set(unsigned long *bitmap, int bit)
43{
44 unsigned long mask = 1 << BITMAP_BIT_IN_WORD(bit);
45 return atomic_or((int*)&bitmap[BITMAP_WORD(bit)], mask) & mask ? 1 : 0;
46}
47
48static inline int bitmap_clear(unsigned long *bitmap, int bit)
49{
50 unsigned long mask = 1 << BITMAP_BIT_IN_WORD(bit);
51
52 return atomic_and((int*)&bitmap[BITMAP_WORD(bit)], ~mask) & mask ? 1:0;
53}
54
55static inline int bitmap_test(unsigned long *bitmap, int bit)
56{
57 return BIT_SET(bitmap[BITMAP_WORD(bit)], BITMAP_BIT_IN_WORD(bit));
58}
59
Travis Geiselbrecht1d0df692008-09-01 02:26:09 -070060#endif