Rev 2089 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2089 | Rev 4490 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2006 Jakub Jermar |
2 | * Copyright (c) 2006 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup genericadt |
29 | /** @addtogroup genericadt |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** |
32 | /** |
33 | * @file |
33 | * @file |
34 | * @brief Implementation of bitmap ADT. |
34 | * @brief Implementation of bitmap ADT. |
35 | * |
35 | * |
36 | * This file implements bitmap ADT and provides functions for |
36 | * This file implements bitmap ADT and provides functions for |
37 | * setting and clearing ranges of bits. |
37 | * setting and clearing ranges of bits. |
38 | */ |
38 | */ |
39 | 39 | ||
40 | #include <adt/bitmap.h> |
40 | #include <adt/bitmap.h> |
41 | #include <arch/types.h> |
41 | #include <arch/types.h> |
42 | #include <align.h> |
42 | #include <align.h> |
43 | #include <debug.h> |
43 | #include <debug.h> |
44 | #include <macros.h> |
44 | #include <macros.h> |
45 | 45 | ||
46 | #define ALL_ONES 0xff |
46 | #define ALL_ONES 0xff |
47 | #define ALL_ZEROES 0x00 |
47 | #define ALL_ZEROES 0x00 |
48 | 48 | ||
49 | /** Initialize bitmap. |
49 | /** Initialize bitmap. |
50 | * |
50 | * |
51 | * No portion of the bitmap is set or cleared by this function. |
51 | * No portion of the bitmap is set or cleared by this function. |
52 | * |
52 | * |
53 | * @param bitmap Bitmap structure. |
53 | * @param bitmap Bitmap structure. |
54 | * @param map Address of the memory used to hold the map. |
54 | * @param map Address of the memory used to hold the map. |
55 | * @param bits Number of bits stored in bitmap. |
55 | * @param bits Number of bits stored in bitmap. |
56 | */ |
56 | */ |
57 | void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, count_t bits) |
57 | void bitmap_initialize(bitmap_t *bitmap, uint8_t *map, size_t bits) |
58 | { |
58 | { |
59 | bitmap->map = map; |
59 | bitmap->map = map; |
60 | bitmap->bits = bits; |
60 | bitmap->bits = bits; |
61 | } |
61 | } |
62 | 62 | ||
63 | /** Set range of bits. |
63 | /** Set range of bits. |
64 | * |
64 | * |
65 | * @param bitmap Bitmap structure. |
65 | * @param bitmap Bitmap structure. |
66 | * @param start Starting bit. |
66 | * @param start Starting bit. |
67 | * @param bits Number of bits to set. |
67 | * @param bits Number of bits to set. |
68 | */ |
68 | */ |
69 | void bitmap_set_range(bitmap_t *bitmap, index_t start, count_t bits) |
69 | void bitmap_set_range(bitmap_t *bitmap, size_t start, size_t bits) |
70 | { |
70 | { |
71 | index_t i=0; |
71 | size_t i = 0; |
72 | index_t aligned_start; |
72 | size_t aligned_start; |
73 | count_t lub; /* leading unaligned bits */ |
73 | size_t lub; /* leading unaligned bits */ |
74 | count_t amb; /* aligned middle bits */ |
74 | size_t amb; /* aligned middle bits */ |
75 | count_t tab; /* trailing aligned bits */ |
75 | size_t tab; /* trailing aligned bits */ |
76 | 76 | ||
77 | ASSERT(start + bits <= bitmap->bits); |
77 | ASSERT(start + bits <= bitmap->bits); |
78 | 78 | ||
79 | aligned_start = ALIGN_UP(start, 8); |
79 | aligned_start = ALIGN_UP(start, 8); |
80 | lub = min(aligned_start - start, bits); |
80 | lub = min(aligned_start - start, bits); |
81 | amb = bits > lub ? bits - lub : 0; |
81 | amb = bits > lub ? bits - lub : 0; |
82 | tab = amb % 8; |
82 | tab = amb % 8; |
83 | 83 | ||
84 | if ( start + bits < aligned_start ) { |
84 | if ( start + bits < aligned_start ) { |
85 | /* |
85 | /* |
86 | * Set bits in the middle of byte |
86 | * Set bits in the middle of byte |
87 | */ |
87 | */ |
88 | bitmap->map[start / 8] |= ((1 << lub)-1) << (start&7); |
88 | bitmap->map[start / 8] |= ((1 << lub)-1) << (start&7); |
89 | return; |
89 | return; |
90 | } |
90 | } |
91 | 91 | ||
92 | if (lub) { |
92 | if (lub) { |
93 | /* |
93 | /* |
94 | * Make sure to set any leading unaligned bits. |
94 | * Make sure to set any leading unaligned bits. |
95 | */ |
95 | */ |
96 | bitmap->map[start / 8] |= ~((1 << (8 - lub)) - 1); |
96 | bitmap->map[start / 8] |= ~((1 << (8 - lub)) - 1); |
97 | } |
97 | } |
98 | for (i = 0; i < amb / 8; i++) { |
98 | for (i = 0; i < amb / 8; i++) { |
99 | /* |
99 | /* |
100 | * The middle bits can be set byte by byte. |
100 | * The middle bits can be set byte by byte. |
101 | */ |
101 | */ |
102 | bitmap->map[aligned_start / 8 + i] = ALL_ONES; |
102 | bitmap->map[aligned_start / 8 + i] = ALL_ONES; |
103 | } |
103 | } |
104 | if (tab) { |
104 | if (tab) { |
105 | /* |
105 | /* |
106 | * Make sure to set any trailing aligned bits. |
106 | * Make sure to set any trailing aligned bits. |
107 | */ |
107 | */ |
108 | bitmap->map[aligned_start / 8 + i] |= (1 << tab) - 1; |
108 | bitmap->map[aligned_start / 8 + i] |= (1 << tab) - 1; |
109 | } |
109 | } |
110 | 110 | ||
111 | } |
111 | } |
112 | 112 | ||
113 | /** Clear range of bits. |
113 | /** Clear range of bits. |
114 | * |
114 | * |
115 | * @param bitmap Bitmap structure. |
115 | * @param bitmap Bitmap structure. |
116 | * @param start Starting bit. |
116 | * @param start Starting bit. |
117 | * @param bits Number of bits to clear. |
117 | * @param bits Number of bits to clear. |
118 | */ |
118 | */ |
119 | void bitmap_clear_range(bitmap_t *bitmap, index_t start, count_t bits) |
119 | void bitmap_clear_range(bitmap_t *bitmap, size_t start, size_t bits) |
120 | { |
120 | { |
121 | index_t i=0; |
121 | size_t i = 0; |
122 | index_t aligned_start; |
122 | size_t aligned_start; |
123 | count_t lub; /* leading unaligned bits */ |
123 | size_t lub; /* leading unaligned bits */ |
124 | count_t amb; /* aligned middle bits */ |
124 | size_t amb; /* aligned middle bits */ |
125 | count_t tab; /* trailing aligned bits */ |
125 | size_t tab; /* trailing aligned bits */ |
126 | 126 | ||
127 | ASSERT(start + bits <= bitmap->bits); |
127 | ASSERT(start + bits <= bitmap->bits); |
128 | 128 | ||
129 | aligned_start = ALIGN_UP(start, 8); |
129 | aligned_start = ALIGN_UP(start, 8); |
130 | lub = min(aligned_start - start, bits); |
130 | lub = min(aligned_start - start, bits); |
131 | amb = bits > lub ? bits - lub : 0; |
131 | amb = bits > lub ? bits - lub : 0; |
132 | tab = amb % 8; |
132 | tab = amb % 8; |
133 | 133 | ||
134 | if ( start + bits < aligned_start ) |
134 | if ( start + bits < aligned_start ) |
135 | { |
135 | { |
136 | /* |
136 | /* |
137 | * Set bits in the middle of byte |
137 | * Set bits in the middle of byte |
138 | */ |
138 | */ |
139 | bitmap->map[start / 8] &= ~(((1 << lub)-1) << (start&7)); |
139 | bitmap->map[start / 8] &= ~(((1 << lub)-1) << (start&7)); |
140 | return; |
140 | return; |
141 | } |
141 | } |
142 | 142 | ||
143 | 143 | ||
144 | if (lub) { |
144 | if (lub) { |
145 | /* |
145 | /* |
146 | * Make sure to clear any leading unaligned bits. |
146 | * Make sure to clear any leading unaligned bits. |
147 | */ |
147 | */ |
148 | bitmap->map[start / 8] &= (1 << (8 - lub)) - 1; |
148 | bitmap->map[start / 8] &= (1 << (8 - lub)) - 1; |
149 | } |
149 | } |
150 | for (i = 0; i < amb / 8; i++) { |
150 | for (i = 0; i < amb / 8; i++) { |
151 | /* |
151 | /* |
152 | * The middle bits can be cleared byte by byte. |
152 | * The middle bits can be cleared byte by byte. |
153 | */ |
153 | */ |
154 | bitmap->map[aligned_start / 8 + i] = ALL_ZEROES; |
154 | bitmap->map[aligned_start / 8 + i] = ALL_ZEROES; |
155 | } |
155 | } |
156 | if (tab) { |
156 | if (tab) { |
157 | /* |
157 | /* |
158 | * Make sure to clear any trailing aligned bits. |
158 | * Make sure to clear any trailing aligned bits. |
159 | */ |
159 | */ |
160 | bitmap->map[aligned_start / 8 + i] &= ~((1 << tab) - 1); |
160 | bitmap->map[aligned_start / 8 + i] &= ~((1 << tab) - 1); |
161 | } |
161 | } |
162 | 162 | ||
163 | } |
163 | } |
164 | 164 | ||
165 | /** Copy portion of one bitmap into another bitmap. |
165 | /** Copy portion of one bitmap into another bitmap. |
166 | * |
166 | * |
167 | * @param dst Destination bitmap. |
167 | * @param dst Destination bitmap. |
168 | * @param src Source bitmap. |
168 | * @param src Source bitmap. |
169 | * @param bits Number of bits to copy. |
169 | * @param bits Number of bits to copy. |
170 | */ |
170 | */ |
171 | void bitmap_copy(bitmap_t *dst, bitmap_t *src, count_t bits) |
171 | void bitmap_copy(bitmap_t *dst, bitmap_t *src, size_t bits) |
172 | { |
172 | { |
173 | index_t i; |
173 | size_t i; |
174 | 174 | ||
175 | ASSERT(bits <= dst->bits); |
175 | ASSERT(bits <= dst->bits); |
176 | ASSERT(bits <= src->bits); |
176 | ASSERT(bits <= src->bits); |
177 | 177 | ||
178 | for (i = 0; i < bits / 8; i++) |
178 | for (i = 0; i < bits / 8; i++) |
179 | dst->map[i] = src->map[i]; |
179 | dst->map[i] = src->map[i]; |
180 | 180 | ||
181 | if (bits % 8) { |
181 | if (bits % 8) { |
182 | bitmap_clear_range(dst, i * 8, bits % 8); |
182 | bitmap_clear_range(dst, i * 8, bits % 8); |
183 | dst->map[i] |= src->map[i] & ((1 << (bits % 8)) - 1); |
183 | dst->map[i] |= src->map[i] & ((1 << (bits % 8)) - 1); |
184 | } |
184 | } |
185 | } |
185 | } |
186 | 186 | ||
187 | /** @} |
187 | /** @} |
188 | */ |
188 | */ |
189 | 189 |