1 | /*
|
---|
2 | * Copyright (c) 2006 Jakub Jermar
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup genericadt
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /** @file
|
---|
33 | */
|
---|
34 |
|
---|
35 | #ifndef KERN_BITMAP_H_
|
---|
36 | #define KERN_BITMAP_H_
|
---|
37 |
|
---|
38 | #include <typedefs.h>
|
---|
39 |
|
---|
40 | #define BITMAP_ELEMENT 8
|
---|
41 | #define BITMAP_REMAINER 7
|
---|
42 |
|
---|
43 | typedef struct {
|
---|
44 | size_t elements;
|
---|
45 | uint8_t *bits;
|
---|
46 |
|
---|
47 | size_t block_size;
|
---|
48 | uint8_t *blocks;
|
---|
49 | } bitmap_t;
|
---|
50 |
|
---|
51 | static inline void bitmap_set(bitmap_t *bitmap, size_t element,
|
---|
52 | unsigned int value)
|
---|
53 | {
|
---|
54 | if (element < bitmap->elements) {
|
---|
55 | /*
|
---|
56 | * The 2nd level bitmap is conservative.
|
---|
57 | * Make sure we update it properly.
|
---|
58 | */
|
---|
59 |
|
---|
60 | if (value) {
|
---|
61 | bitmap->bits[element / BITMAP_ELEMENT] |=
|
---|
62 | (1 << (element & BITMAP_REMAINER));
|
---|
63 | } else {
|
---|
64 | bitmap->bits[element / BITMAP_ELEMENT] &=
|
---|
65 | ~(1 << (element & BITMAP_REMAINER));
|
---|
66 |
|
---|
67 | if (bitmap->block_size > 0) {
|
---|
68 | size_t block = element / bitmap->block_size;
|
---|
69 |
|
---|
70 | bitmap->blocks[block / BITMAP_ELEMENT] &=
|
---|
71 | ~(1 << (block & BITMAP_REMAINER));
|
---|
72 | }
|
---|
73 | }
|
---|
74 | }
|
---|
75 | }
|
---|
76 |
|
---|
77 | static inline unsigned int bitmap_get(bitmap_t *bitmap, size_t element)
|
---|
78 | {
|
---|
79 | if (element >= bitmap->elements)
|
---|
80 | return 0;
|
---|
81 |
|
---|
82 | return !!((bitmap->bits)[element / BITMAP_ELEMENT] &
|
---|
83 | (1 << (element & BITMAP_REMAINER)));
|
---|
84 | }
|
---|
85 |
|
---|
86 | extern size_t bitmap_size(size_t, size_t);
|
---|
87 | extern void bitmap_initialize(bitmap_t *, size_t, size_t, void *);
|
---|
88 |
|
---|
89 | extern void bitmap_set_range(bitmap_t *, size_t, size_t);
|
---|
90 | extern void bitmap_clear_range(bitmap_t *, size_t, size_t);
|
---|
91 |
|
---|
92 | extern int bitmap_find_range(bitmap_t *, size_t, size_t, size_t);
|
---|
93 | extern int bitmap_allocate_range(bitmap_t *, size_t, size_t, size_t, size_t *);
|
---|
94 | extern void bitmap_free_range(bitmap_t *, size_t, size_t);
|
---|
95 | extern void bitmap_copy(bitmap_t *, bitmap_t *, size_t);
|
---|
96 |
|
---|
97 | #endif
|
---|
98 |
|
---|
99 | /** @}
|
---|
100 | */
|
---|