Rev 786 | Rev 814 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 786 | Rev 788 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2001-2005 Jakub Jermar |
2 | * Copyright (C) 2001-2005 Jakub Jermar |
3 | * Copyright (C) 2005 Sergey Bondari |
3 | * Copyright (C) 2005 Sergey Bondari |
4 | * All rights reserved. |
4 | * All rights reserved. |
5 | * |
5 | * |
6 | * Redistribution and use in source and binary forms, with or without |
6 | * Redistribution and use in source and binary forms, with or without |
7 | * modification, are permitted provided that the following conditions |
7 | * modification, are permitted provided that the following conditions |
8 | * are met: |
8 | * are met: |
9 | * |
9 | * |
10 | * - Redistributions of source code must retain the above copyright |
10 | * - Redistributions of source code must retain the above copyright |
11 | * notice, this list of conditions and the following disclaimer. |
11 | * notice, this list of conditions and the following disclaimer. |
12 | * - Redistributions in binary form must reproduce the above copyright |
12 | * - Redistributions in binary form must reproduce the above copyright |
13 | * notice, this list of conditions and the following disclaimer in the |
13 | * notice, this list of conditions and the following disclaimer in the |
14 | * documentation and/or other materials provided with the distribution. |
14 | * documentation and/or other materials provided with the distribution. |
15 | * - The name of the author may not be used to endorse or promote products |
15 | * - The name of the author may not be used to endorse or promote products |
16 | * derived from this software without specific prior written permission. |
16 | * derived from this software without specific prior written permission. |
17 | * |
17 | * |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
28 | */ |
28 | */ |
29 | 29 | ||
30 | #include <typedefs.h> |
30 | #include <typedefs.h> |
31 | #include <arch/types.h> |
31 | #include <arch/types.h> |
32 | #include <mm/heap.h> |
32 | #include <mm/heap.h> |
33 | #include <mm/frame.h> |
33 | #include <mm/frame.h> |
34 | #include <mm/as.h> |
34 | #include <mm/as.h> |
35 | #include <panic.h> |
35 | #include <panic.h> |
36 | #include <debug.h> |
36 | #include <debug.h> |
37 | #include <list.h> |
37 | #include <adt/list.h> |
38 | #include <synch/spinlock.h> |
38 | #include <synch/spinlock.h> |
39 | #include <arch/asm.h> |
39 | #include <arch/asm.h> |
40 | #include <arch.h> |
40 | #include <arch.h> |
41 | #include <print.h> |
41 | #include <print.h> |
42 | #include <align.h> |
42 | #include <align.h> |
43 | 43 | ||
44 | SPINLOCK_INITIALIZE(zone_head_lock); /**< this lock protects zone_head list */ |
44 | SPINLOCK_INITIALIZE(zone_head_lock); /**< this lock protects zone_head list */ |
45 | LIST_INITIALIZE(zone_head); /**< list of all zones in the system */ |
45 | LIST_INITIALIZE(zone_head); /**< list of all zones in the system */ |
46 | 46 | ||
47 | /** Blacklist containing non-available areas of memory. |
47 | /** Blacklist containing non-available areas of memory. |
48 | * |
48 | * |
49 | * This blacklist is used to exclude frames that cannot be allocated |
49 | * This blacklist is used to exclude frames that cannot be allocated |
50 | * (e.g. kernel memory) from available memory map. |
50 | * (e.g. kernel memory) from available memory map. |
51 | */ |
51 | */ |
52 | region_t zone_blacklist[ZONE_BLACKLIST_SIZE]; |
52 | region_t zone_blacklist[ZONE_BLACKLIST_SIZE]; |
53 | count_t zone_blacklist_count = 0; |
53 | count_t zone_blacklist_count = 0; |
54 | 54 | ||
55 | static struct buddy_system_operations zone_buddy_system_operations = { |
55 | static struct buddy_system_operations zone_buddy_system_operations = { |
56 | .find_buddy = zone_buddy_find_buddy, |
56 | .find_buddy = zone_buddy_find_buddy, |
57 | .bisect = zone_buddy_bisect, |
57 | .bisect = zone_buddy_bisect, |
58 | .coalesce = zone_buddy_coalesce, |
58 | .coalesce = zone_buddy_coalesce, |
59 | .set_order = zone_buddy_set_order, |
59 | .set_order = zone_buddy_set_order, |
60 | .get_order = zone_buddy_get_order, |
60 | .get_order = zone_buddy_get_order, |
61 | .mark_busy = zone_buddy_mark_busy, |
61 | .mark_busy = zone_buddy_mark_busy, |
62 | }; |
62 | }; |
63 | 63 | ||
64 | /** Initialize physical memory management |
64 | /** Initialize physical memory management |
65 | * |
65 | * |
66 | * Initialize physical memory managemnt. |
66 | * Initialize physical memory managemnt. |
67 | */ |
67 | */ |
68 | void frame_init(void) |
68 | void frame_init(void) |
69 | { |
69 | { |
70 | if (config.cpu_active == 1) { |
70 | if (config.cpu_active == 1) { |
71 | frame_region_not_free(KA2PA(config.base), config.kernel_size); |
71 | frame_region_not_free(KA2PA(config.base), config.kernel_size); |
72 | if (config.init_size > 0) |
72 | if (config.init_size > 0) |
73 | frame_region_not_free(KA2PA(config.init_addr), config.init_size); |
73 | frame_region_not_free(KA2PA(config.init_addr), config.init_size); |
74 | } |
74 | } |
75 | 75 | ||
76 | frame_arch_init(); |
76 | frame_arch_init(); |
77 | } |
77 | } |
78 | 78 | ||
79 | /** |
79 | /** |
80 | * Find AND LOCK zone that can allocate order frames |
80 | * Find AND LOCK zone that can allocate order frames |
81 | * |
81 | * |
82 | * Assume zone_head_lock is locked. |
82 | * Assume zone_head_lock is locked. |
83 | */ |
83 | */ |
84 | static zone_t * find_free_zone(__u8 order) |
84 | static zone_t * find_free_zone(__u8 order) |
85 | { |
85 | { |
86 | link_t *cur; |
86 | link_t *cur; |
87 | zone_t *z; |
87 | zone_t *z; |
88 | 88 | ||
89 | for (cur = zone_head.next; cur != &zone_head;cur = cur->next) { |
89 | for (cur = zone_head.next; cur != &zone_head;cur = cur->next) { |
90 | z = list_get_instance(cur, zone_t, link); |
90 | z = list_get_instance(cur, zone_t, link); |
91 | 91 | ||
92 | spinlock_lock(&z->lock); |
92 | spinlock_lock(&z->lock); |
93 | 93 | ||
94 | /* Check if the zone has 2^order frames area available */ |
94 | /* Check if the zone has 2^order frames area available */ |
95 | if (buddy_system_can_alloc(z->buddy_system, order)) |
95 | if (buddy_system_can_alloc(z->buddy_system, order)) |
96 | return z; |
96 | return z; |
97 | 97 | ||
98 | spinlock_unlock(&z->lock); |
98 | spinlock_unlock(&z->lock); |
99 | } |
99 | } |
100 | return NULL; |
100 | return NULL; |
101 | } |
101 | } |
102 | 102 | ||
103 | /** Allocate power-of-two frames of physical memory. |
103 | /** Allocate power-of-two frames of physical memory. |
104 | * |
104 | * |
105 | * @param flags Flags for host zone selection and address processing. |
105 | * @param flags Flags for host zone selection and address processing. |
106 | * @param order Allocate exactly 2^order frames. |
106 | * @param order Allocate exactly 2^order frames. |
107 | * @param pzone Pointer to preferred zone pointer, on output it changes |
107 | * @param pzone Pointer to preferred zone pointer, on output it changes |
108 | * to the zone that the frame was really allocated to |
108 | * to the zone that the frame was really allocated to |
109 | * |
109 | * |
110 | * @return Allocated frame. |
110 | * @return Allocated frame. |
111 | */ |
111 | */ |
112 | __address frame_alloc_generic(__u8 order, int flags, int * status, zone_t **pzone) |
112 | __address frame_alloc_generic(__u8 order, int flags, int * status, zone_t **pzone) |
113 | { |
113 | { |
114 | ipl_t ipl; |
114 | ipl_t ipl; |
115 | link_t *tmp; |
115 | link_t *tmp; |
116 | zone_t *zone = NULL; |
116 | zone_t *zone = NULL; |
117 | frame_t *frame = NULL; |
117 | frame_t *frame = NULL; |
118 | int freed; |
118 | int freed; |
119 | __address v; |
119 | __address v; |
120 | 120 | ||
121 | loop: |
121 | loop: |
122 | ipl = interrupts_disable(); |
122 | ipl = interrupts_disable(); |
123 | spinlock_lock(&zone_head_lock); |
123 | spinlock_lock(&zone_head_lock); |
124 | 124 | ||
125 | /* |
125 | /* |
126 | * First, find suitable frame zone. |
126 | * First, find suitable frame zone. |
127 | */ |
127 | */ |
128 | if (pzone && *pzone) { |
128 | if (pzone && *pzone) { |
129 | spinlock_lock(&(*pzone)->lock); |
129 | spinlock_lock(&(*pzone)->lock); |
130 | if (!buddy_system_can_alloc((*pzone)->buddy_system, order)) |
130 | if (!buddy_system_can_alloc((*pzone)->buddy_system, order)) |
131 | spinlock_unlock(&(*pzone)->lock); |
131 | spinlock_unlock(&(*pzone)->lock); |
132 | else |
132 | else |
133 | zone = *pzone; |
133 | zone = *pzone; |
134 | } |
134 | } |
135 | if (!zone) { |
135 | if (!zone) { |
136 | zone = find_free_zone(order); |
136 | zone = find_free_zone(order); |
137 | /* If no memory, reclaim some slab memory, |
137 | /* If no memory, reclaim some slab memory, |
138 | if it does not help, reclaim all */ |
138 | if it does not help, reclaim all */ |
139 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
139 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
140 | spinlock_unlock(&zone_head_lock); |
140 | spinlock_unlock(&zone_head_lock); |
141 | freed = slab_reclaim(0); |
141 | freed = slab_reclaim(0); |
142 | spinlock_lock(&zone_head_lock); |
142 | spinlock_lock(&zone_head_lock); |
143 | if (freed) |
143 | if (freed) |
144 | zone = find_free_zone(order); |
144 | zone = find_free_zone(order); |
145 | if (!zone) { |
145 | if (!zone) { |
146 | spinlock_unlock(&zone_head_lock); |
146 | spinlock_unlock(&zone_head_lock); |
147 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
147 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
148 | spinlock_lock(&zone_head_lock); |
148 | spinlock_lock(&zone_head_lock); |
149 | if (freed) |
149 | if (freed) |
150 | zone = find_free_zone(order); |
150 | zone = find_free_zone(order); |
151 | } |
151 | } |
152 | } |
152 | } |
153 | } |
153 | } |
154 | 154 | ||
155 | if (!zone) { |
155 | if (!zone) { |
156 | if (flags & FRAME_PANIC) |
156 | if (flags & FRAME_PANIC) |
157 | panic("Can't allocate frame.\n"); |
157 | panic("Can't allocate frame.\n"); |
158 | 158 | ||
159 | /* |
159 | /* |
160 | * TODO: Sleep until frames are available again. |
160 | * TODO: Sleep until frames are available again. |
161 | */ |
161 | */ |
162 | spinlock_unlock(&zone_head_lock); |
162 | spinlock_unlock(&zone_head_lock); |
163 | interrupts_restore(ipl); |
163 | interrupts_restore(ipl); |
164 | 164 | ||
165 | if (flags & FRAME_ATOMIC) { |
165 | if (flags & FRAME_ATOMIC) { |
166 | ASSERT(status != NULL); |
166 | ASSERT(status != NULL); |
167 | *status = FRAME_NO_MEMORY; |
167 | *status = FRAME_NO_MEMORY; |
168 | return NULL; |
168 | return NULL; |
169 | } |
169 | } |
170 | 170 | ||
171 | panic("Sleep not implemented.\n"); |
171 | panic("Sleep not implemented.\n"); |
172 | goto loop; |
172 | goto loop; |
173 | } |
173 | } |
174 | 174 | ||
175 | /* Allocate frames from zone buddy system */ |
175 | /* Allocate frames from zone buddy system */ |
176 | tmp = buddy_system_alloc(zone->buddy_system, order); |
176 | tmp = buddy_system_alloc(zone->buddy_system, order); |
177 | 177 | ||
178 | ASSERT(tmp); |
178 | ASSERT(tmp); |
179 | 179 | ||
180 | /* Update zone information. */ |
180 | /* Update zone information. */ |
181 | zone->free_count -= (1 << order); |
181 | zone->free_count -= (1 << order); |
182 | zone->busy_count += (1 << order); |
182 | zone->busy_count += (1 << order); |
183 | 183 | ||
184 | /* Frame will be actually a first frame of the block. */ |
184 | /* Frame will be actually a first frame of the block. */ |
185 | frame = list_get_instance(tmp, frame_t, buddy_link); |
185 | frame = list_get_instance(tmp, frame_t, buddy_link); |
186 | 186 | ||
187 | /* get frame address */ |
187 | /* get frame address */ |
188 | v = FRAME2ADDR(zone, frame); |
188 | v = FRAME2ADDR(zone, frame); |
189 | 189 | ||
190 | spinlock_unlock(&zone->lock); |
190 | spinlock_unlock(&zone->lock); |
191 | spinlock_unlock(&zone_head_lock); |
191 | spinlock_unlock(&zone_head_lock); |
192 | interrupts_restore(ipl); |
192 | interrupts_restore(ipl); |
193 | 193 | ||
194 | ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order)); |
194 | ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order)); |
195 | 195 | ||
196 | if (flags & FRAME_KA) |
196 | if (flags & FRAME_KA) |
197 | v = PA2KA(v); |
197 | v = PA2KA(v); |
198 | 198 | ||
199 | if (status) |
199 | if (status) |
200 | *status = FRAME_OK; |
200 | *status = FRAME_OK; |
201 | 201 | ||
202 | if (pzone) |
202 | if (pzone) |
203 | *pzone = zone; |
203 | *pzone = zone; |
204 | return v; |
204 | return v; |
205 | } |
205 | } |
206 | 206 | ||
207 | /** Convert address to zone pointer |
207 | /** Convert address to zone pointer |
208 | * |
208 | * |
209 | * Assume zone_head_lock is held |
209 | * Assume zone_head_lock is held |
210 | * |
210 | * |
211 | * @param addr Physical address |
211 | * @param addr Physical address |
212 | * @param lock If true, lock the zone |
212 | * @param lock If true, lock the zone |
213 | */ |
213 | */ |
214 | static zone_t * addr2zone(__address addr, int lock) |
214 | static zone_t * addr2zone(__address addr, int lock) |
215 | { |
215 | { |
216 | link_t *cur; |
216 | link_t *cur; |
217 | zone_t *z = NULL; |
217 | zone_t *z = NULL; |
218 | 218 | ||
219 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
219 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
220 | z = list_get_instance(cur, zone_t, link); |
220 | z = list_get_instance(cur, zone_t, link); |
221 | 221 | ||
222 | spinlock_lock(&z->lock); |
222 | spinlock_lock(&z->lock); |
223 | 223 | ||
224 | /* |
224 | /* |
225 | * Check if addr belongs to z. |
225 | * Check if addr belongs to z. |
226 | */ |
226 | */ |
227 | if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) { |
227 | if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) { |
228 | if (!lock) |
228 | if (!lock) |
229 | spinlock_unlock(&z->lock); |
229 | spinlock_unlock(&z->lock); |
230 | return z; |
230 | return z; |
231 | } |
231 | } |
232 | 232 | ||
233 | spinlock_unlock(&z->lock); |
233 | spinlock_unlock(&z->lock); |
234 | } |
234 | } |
235 | 235 | ||
236 | panic("Cannot find addr2zone: 0x%X", addr); |
236 | panic("Cannot find addr2zone: 0x%X", addr); |
237 | } |
237 | } |
238 | 238 | ||
239 | /** Return frame_t structure corresponding to address |
239 | /** Return frame_t structure corresponding to address |
240 | * |
240 | * |
241 | * |
241 | * |
242 | */ |
242 | */ |
243 | frame_t * frame_addr2frame(__address addr) |
243 | frame_t * frame_addr2frame(__address addr) |
244 | { |
244 | { |
245 | ipl_t ipl; |
245 | ipl_t ipl; |
246 | frame_t *frame; |
246 | frame_t *frame; |
247 | zone_t *zone; |
247 | zone_t *zone; |
248 | 248 | ||
249 | if (IS_KA(addr)) |
249 | if (IS_KA(addr)) |
250 | addr = KA2PA(addr); |
250 | addr = KA2PA(addr); |
251 | 251 | ||
252 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
252 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
253 | ipl = interrupts_disable(); |
253 | ipl = interrupts_disable(); |
254 | spinlock_lock(&zone_head_lock); |
254 | spinlock_lock(&zone_head_lock); |
255 | 255 | ||
256 | zone = addr2zone(addr,0); |
256 | zone = addr2zone(addr,0); |
257 | frame = ADDR2FRAME(zone, addr); |
257 | frame = ADDR2FRAME(zone, addr); |
258 | 258 | ||
259 | spinlock_unlock(&zone_head_lock); |
259 | spinlock_unlock(&zone_head_lock); |
260 | interrupts_restore(ipl); |
260 | interrupts_restore(ipl); |
261 | 261 | ||
262 | return frame; |
262 | return frame; |
263 | } |
263 | } |
264 | 264 | ||
265 | 265 | ||
266 | /** Free a frame. |
266 | /** Free a frame. |
267 | * |
267 | * |
268 | * Find respective frame structrue for supplied addr. |
268 | * Find respective frame structrue for supplied addr. |
269 | * Decrement frame reference count. |
269 | * Decrement frame reference count. |
270 | * If it drops to zero, move the frame structure to free list. |
270 | * If it drops to zero, move the frame structure to free list. |
271 | * |
271 | * |
272 | * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE. |
272 | * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE. |
273 | */ |
273 | */ |
274 | void frame_free(__address addr) |
274 | void frame_free(__address addr) |
275 | { |
275 | { |
276 | ipl_t ipl; |
276 | ipl_t ipl; |
277 | zone_t *zone; |
277 | zone_t *zone; |
278 | frame_t *frame; |
278 | frame_t *frame; |
279 | int order; |
279 | int order; |
280 | 280 | ||
281 | ASSERT(addr % FRAME_SIZE == 0); |
281 | ASSERT(addr % FRAME_SIZE == 0); |
282 | 282 | ||
283 | if (IS_KA(addr)) |
283 | if (IS_KA(addr)) |
284 | addr = KA2PA(addr); |
284 | addr = KA2PA(addr); |
285 | 285 | ||
286 | ipl = interrupts_disable(); |
286 | ipl = interrupts_disable(); |
287 | spinlock_lock(&zone_head_lock); |
287 | spinlock_lock(&zone_head_lock); |
288 | 288 | ||
289 | /* |
289 | /* |
290 | * First, find host frame zone for addr. |
290 | * First, find host frame zone for addr. |
291 | */ |
291 | */ |
292 | zone = addr2zone(addr, 1); /* This locks the zone automatically */ |
292 | zone = addr2zone(addr, 1); /* This locks the zone automatically */ |
293 | 293 | ||
294 | frame = ADDR2FRAME(zone, addr); |
294 | frame = ADDR2FRAME(zone, addr); |
295 | 295 | ||
296 | /* remember frame order */ |
296 | /* remember frame order */ |
297 | order = frame->buddy_order; |
297 | order = frame->buddy_order; |
298 | 298 | ||
299 | ASSERT(frame->refcount); |
299 | ASSERT(frame->refcount); |
300 | 300 | ||
301 | if (!--frame->refcount) { |
301 | if (!--frame->refcount) { |
302 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
302 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
303 | } |
303 | } |
304 | 304 | ||
305 | /* Update zone information. */ |
305 | /* Update zone information. */ |
306 | zone->free_count += (1 << order); |
306 | zone->free_count += (1 << order); |
307 | zone->busy_count -= (1 << order); |
307 | zone->busy_count -= (1 << order); |
308 | 308 | ||
309 | spinlock_unlock(&zone->lock); |
309 | spinlock_unlock(&zone->lock); |
310 | spinlock_unlock(&zone_head_lock); |
310 | spinlock_unlock(&zone_head_lock); |
311 | interrupts_restore(ipl); |
311 | interrupts_restore(ipl); |
312 | } |
312 | } |
313 | 313 | ||
314 | /** Mark frame region not free. |
314 | /** Mark frame region not free. |
315 | * |
315 | * |
316 | * Mark frame region not free. |
316 | * Mark frame region not free. |
317 | * |
317 | * |
318 | * @param base Base address of non-available region. |
318 | * @param base Base address of non-available region. |
319 | * @param size Size of non-available region. |
319 | * @param size Size of non-available region. |
320 | */ |
320 | */ |
321 | void frame_region_not_free(__address base, size_t size) |
321 | void frame_region_not_free(__address base, size_t size) |
322 | { |
322 | { |
323 | index_t index; |
323 | index_t index; |
324 | index = zone_blacklist_count++; |
324 | index = zone_blacklist_count++; |
325 | 325 | ||
326 | /* Force base to the nearest lower address frame boundary. */ |
326 | /* Force base to the nearest lower address frame boundary. */ |
327 | base = ALIGN_DOWN(base, FRAME_SIZE); |
327 | base = ALIGN_DOWN(base, FRAME_SIZE); |
328 | /* Align size to frame boundary. */ |
328 | /* Align size to frame boundary. */ |
329 | size = ALIGN_UP(size, FRAME_SIZE); |
329 | size = ALIGN_UP(size, FRAME_SIZE); |
330 | 330 | ||
331 | ASSERT(index < ZONE_BLACKLIST_SIZE); |
331 | ASSERT(index < ZONE_BLACKLIST_SIZE); |
332 | zone_blacklist[index].base = base; |
332 | zone_blacklist[index].base = base; |
333 | zone_blacklist[index].size = size; |
333 | zone_blacklist[index].size = size; |
334 | } |
334 | } |
335 | 335 | ||
336 | /** Create frame zones in region of available memory. |
336 | /** Create frame zones in region of available memory. |
337 | * |
337 | * |
338 | * Avoid any black listed areas of non-available memory. |
338 | * Avoid any black listed areas of non-available memory. |
339 | * Assume that the black listed areas cannot overlap |
339 | * Assume that the black listed areas cannot overlap |
340 | * one another or cross available memory region boundaries. |
340 | * one another or cross available memory region boundaries. |
341 | * |
341 | * |
342 | * @param base Base address of available memory region. |
342 | * @param base Base address of available memory region. |
343 | * @param size Size of the region. |
343 | * @param size Size of the region. |
344 | */ |
344 | */ |
345 | void zone_create_in_region(__address base, size_t size) { |
345 | void zone_create_in_region(__address base, size_t size) { |
346 | int i; |
346 | int i; |
347 | zone_t * z; |
347 | zone_t * z; |
348 | __address s; |
348 | __address s; |
349 | size_t sz; |
349 | size_t sz; |
350 | 350 | ||
351 | ASSERT(base % FRAME_SIZE == 0); |
351 | ASSERT(base % FRAME_SIZE == 0); |
352 | ASSERT(size % FRAME_SIZE == 0); |
352 | ASSERT(size % FRAME_SIZE == 0); |
353 | 353 | ||
354 | if (!size) |
354 | if (!size) |
355 | return; |
355 | return; |
356 | 356 | ||
357 | for (i = 0; i < zone_blacklist_count; i++) { |
357 | for (i = 0; i < zone_blacklist_count; i++) { |
358 | if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) { |
358 | if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) { |
359 | s = base; sz = zone_blacklist[i].base - base; |
359 | s = base; sz = zone_blacklist[i].base - base; |
360 | ASSERT(base != s || sz != size); |
360 | ASSERT(base != s || sz != size); |
361 | zone_create_in_region(s, sz); |
361 | zone_create_in_region(s, sz); |
362 | 362 | ||
363 | s = zone_blacklist[i].base + zone_blacklist[i].size; |
363 | s = zone_blacklist[i].base + zone_blacklist[i].size; |
364 | sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size); |
364 | sz = (base + size) - (zone_blacklist[i].base + zone_blacklist[i].size); |
365 | ASSERT(base != s || sz != size); |
365 | ASSERT(base != s || sz != size); |
366 | zone_create_in_region(s, sz); |
366 | zone_create_in_region(s, sz); |
367 | return; |
367 | return; |
368 | 368 | ||
369 | } |
369 | } |
370 | } |
370 | } |
371 | 371 | ||
372 | z = zone_create(base, size, 0); |
372 | z = zone_create(base, size, 0); |
373 | 373 | ||
374 | if (!z) { |
374 | if (!z) { |
375 | panic("Cannot allocate zone (base=%P, size=%d).\n", base, size); |
375 | panic("Cannot allocate zone (base=%P, size=%d).\n", base, size); |
376 | } |
376 | } |
377 | 377 | ||
378 | zone_attach(z); |
378 | zone_attach(z); |
379 | } |
379 | } |
380 | 380 | ||
381 | 381 | ||
382 | /** Create frame zone |
382 | /** Create frame zone |
383 | * |
383 | * |
384 | * Create new frame zone. |
384 | * Create new frame zone. |
385 | * |
385 | * |
386 | * @param start Physical address of the first frame within the zone. |
386 | * @param start Physical address of the first frame within the zone. |
387 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
387 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
388 | * @param flags Zone flags. |
388 | * @param flags Zone flags. |
389 | * |
389 | * |
390 | * @return Initialized zone. |
390 | * @return Initialized zone. |
391 | */ |
391 | */ |
392 | zone_t * zone_create(__address start, size_t size, int flags) |
392 | zone_t * zone_create(__address start, size_t size, int flags) |
393 | { |
393 | { |
394 | zone_t *z; |
394 | zone_t *z; |
395 | count_t cnt; |
395 | count_t cnt; |
396 | int i; |
396 | int i; |
397 | __u8 max_order; |
397 | __u8 max_order; |
398 | 398 | ||
399 | ASSERT(start % FRAME_SIZE == 0); |
399 | ASSERT(start % FRAME_SIZE == 0); |
400 | ASSERT(size % FRAME_SIZE == 0); |
400 | ASSERT(size % FRAME_SIZE == 0); |
401 | 401 | ||
402 | cnt = size / FRAME_SIZE; |
402 | cnt = size / FRAME_SIZE; |
403 | 403 | ||
404 | z = (zone_t *) early_malloc(sizeof(zone_t)); |
404 | z = (zone_t *) early_malloc(sizeof(zone_t)); |
405 | if (z) { |
405 | if (z) { |
406 | link_initialize(&z->link); |
406 | link_initialize(&z->link); |
407 | spinlock_initialize(&z->lock, "zone_lock"); |
407 | spinlock_initialize(&z->lock, "zone_lock"); |
408 | 408 | ||
409 | z->base = start; |
409 | z->base = start; |
410 | z->base_index = start / FRAME_SIZE; |
410 | z->base_index = start / FRAME_SIZE; |
411 | 411 | ||
412 | z->flags = flags; |
412 | z->flags = flags; |
413 | 413 | ||
414 | z->free_count = cnt; |
414 | z->free_count = cnt; |
415 | z->busy_count = 0; |
415 | z->busy_count = 0; |
416 | 416 | ||
417 | z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t)); |
417 | z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t)); |
418 | if (!z->frames) { |
418 | if (!z->frames) { |
419 | early_free(z); |
419 | early_free(z); |
420 | return NULL; |
420 | return NULL; |
421 | } |
421 | } |
422 | 422 | ||
423 | for (i = 0; i<cnt; i++) { |
423 | for (i = 0; i<cnt; i++) { |
424 | frame_initialize(&z->frames[i], z); |
424 | frame_initialize(&z->frames[i], z); |
425 | } |
425 | } |
426 | 426 | ||
427 | /* |
427 | /* |
428 | * Create buddy system for the zone |
428 | * Create buddy system for the zone |
429 | */ |
429 | */ |
430 | for (max_order = 0; cnt >> max_order; max_order++) |
430 | for (max_order = 0; cnt >> max_order; max_order++) |
431 | ; |
431 | ; |
432 | z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z); |
432 | z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z); |
433 | 433 | ||
434 | /* Stuffing frames */ |
434 | /* Stuffing frames */ |
435 | for (i = 0; i<cnt; i++) { |
435 | for (i = 0; i<cnt; i++) { |
436 | z->frames[i].refcount = 0; |
436 | z->frames[i].refcount = 0; |
437 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
437 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
438 | } |
438 | } |
439 | 439 | ||
440 | } |
440 | } |
441 | return z; |
441 | return z; |
442 | } |
442 | } |
443 | 443 | ||
444 | /** Attach frame zone |
444 | /** Attach frame zone |
445 | * |
445 | * |
446 | * Attach frame zone to zone list. |
446 | * Attach frame zone to zone list. |
447 | * |
447 | * |
448 | * @param zone Zone to be attached. |
448 | * @param zone Zone to be attached. |
449 | */ |
449 | */ |
450 | void zone_attach(zone_t *zone) |
450 | void zone_attach(zone_t *zone) |
451 | { |
451 | { |
452 | ipl_t ipl; |
452 | ipl_t ipl; |
453 | 453 | ||
454 | ipl = interrupts_disable(); |
454 | ipl = interrupts_disable(); |
455 | spinlock_lock(&zone_head_lock); |
455 | spinlock_lock(&zone_head_lock); |
456 | 456 | ||
457 | list_append(&zone->link, &zone_head); |
457 | list_append(&zone->link, &zone_head); |
458 | 458 | ||
459 | spinlock_unlock(&zone_head_lock); |
459 | spinlock_unlock(&zone_head_lock); |
460 | interrupts_restore(ipl); |
460 | interrupts_restore(ipl); |
461 | } |
461 | } |
462 | 462 | ||
463 | /** Initialize frame structure |
463 | /** Initialize frame structure |
464 | * |
464 | * |
465 | * Initialize frame structure. |
465 | * Initialize frame structure. |
466 | * |
466 | * |
467 | * @param frame Frame structure to be initialized. |
467 | * @param frame Frame structure to be initialized. |
468 | * @param zone Host frame zone. |
468 | * @param zone Host frame zone. |
469 | */ |
469 | */ |
470 | void frame_initialize(frame_t *frame, zone_t *zone) |
470 | void frame_initialize(frame_t *frame, zone_t *zone) |
471 | { |
471 | { |
472 | frame->refcount = 1; |
472 | frame->refcount = 1; |
473 | frame->buddy_order = 0; |
473 | frame->buddy_order = 0; |
474 | } |
474 | } |
475 | 475 | ||
476 | 476 | ||
477 | /** Buddy system find_buddy implementation |
477 | /** Buddy system find_buddy implementation |
478 | * |
478 | * |
479 | * @param b Buddy system. |
479 | * @param b Buddy system. |
480 | * @param block Block for which buddy should be found |
480 | * @param block Block for which buddy should be found |
481 | * |
481 | * |
482 | * @return Buddy for given block if found |
482 | * @return Buddy for given block if found |
483 | */ |
483 | */ |
484 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) { |
484 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) { |
485 | frame_t * frame; |
485 | frame_t * frame; |
486 | zone_t * zone; |
486 | zone_t * zone; |
487 | index_t index; |
487 | index_t index; |
488 | bool is_left, is_right; |
488 | bool is_left, is_right; |
489 | 489 | ||
490 | frame = list_get_instance(block, frame_t, buddy_link); |
490 | frame = list_get_instance(block, frame_t, buddy_link); |
491 | zone = (zone_t *) b->data; |
491 | zone = (zone_t *) b->data; |
492 | ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order)); |
492 | ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order)); |
493 | 493 | ||
494 | 494 | ||
495 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
495 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
496 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
496 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
497 | 497 | ||
498 | ASSERT(is_left ^ is_right); |
498 | ASSERT(is_left ^ is_right); |
499 | 499 | ||
500 | if (is_left) { |
500 | if (is_left) { |
501 | index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order); |
501 | index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order); |
502 | } else { // if (is_right) |
502 | } else { // if (is_right) |
503 | index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order); |
503 | index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order); |
504 | } |
504 | } |
505 | 505 | ||
506 | if (FRAME_INDEX_VALID(zone, index)) { |
506 | if (FRAME_INDEX_VALID(zone, index)) { |
507 | if ( zone->frames[index].buddy_order == frame->buddy_order && |
507 | if ( zone->frames[index].buddy_order == frame->buddy_order && |
508 | zone->frames[index].refcount == 0) { |
508 | zone->frames[index].refcount == 0) { |
509 | return &zone->frames[index].buddy_link; |
509 | return &zone->frames[index].buddy_link; |
510 | } |
510 | } |
511 | } |
511 | } |
512 | 512 | ||
513 | return NULL; |
513 | return NULL; |
514 | } |
514 | } |
515 | 515 | ||
516 | /** Buddy system bisect implementation |
516 | /** Buddy system bisect implementation |
517 | * |
517 | * |
518 | * @param b Buddy system. |
518 | * @param b Buddy system. |
519 | * @param block Block to bisect |
519 | * @param block Block to bisect |
520 | * |
520 | * |
521 | * @return right block |
521 | * @return right block |
522 | */ |
522 | */ |
523 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
523 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
524 | frame_t * frame_l, * frame_r; |
524 | frame_t * frame_l, * frame_r; |
525 | 525 | ||
526 | frame_l = list_get_instance(block, frame_t, buddy_link); |
526 | frame_l = list_get_instance(block, frame_t, buddy_link); |
527 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
527 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
528 | 528 | ||
529 | return &frame_r->buddy_link; |
529 | return &frame_r->buddy_link; |
530 | } |
530 | } |
531 | 531 | ||
532 | /** Buddy system coalesce implementation |
532 | /** Buddy system coalesce implementation |
533 | * |
533 | * |
534 | * @param b Buddy system. |
534 | * @param b Buddy system. |
535 | * @param block_1 First block |
535 | * @param block_1 First block |
536 | * @param block_2 First block's buddy |
536 | * @param block_2 First block's buddy |
537 | * |
537 | * |
538 | * @return Coalesced block (actually block that represents lower address) |
538 | * @return Coalesced block (actually block that represents lower address) |
539 | */ |
539 | */ |
540 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) { |
540 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) { |
541 | frame_t * frame1, * frame2; |
541 | frame_t * frame1, * frame2; |
542 | 542 | ||
543 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
543 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
544 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
544 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
545 | 545 | ||
546 | return frame1 < frame2 ? block_1 : block_2; |
546 | return frame1 < frame2 ? block_1 : block_2; |
547 | } |
547 | } |
548 | 548 | ||
549 | /** Buddy system set_order implementation |
549 | /** Buddy system set_order implementation |
550 | * |
550 | * |
551 | * @param b Buddy system. |
551 | * @param b Buddy system. |
552 | * @param block Buddy system block |
552 | * @param block Buddy system block |
553 | * @param order Order to set |
553 | * @param order Order to set |
554 | */ |
554 | */ |
555 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
555 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
556 | frame_t * frame; |
556 | frame_t * frame; |
557 | frame = list_get_instance(block, frame_t, buddy_link); |
557 | frame = list_get_instance(block, frame_t, buddy_link); |
558 | frame->buddy_order = order; |
558 | frame->buddy_order = order; |
559 | } |
559 | } |
560 | 560 | ||
561 | /** Buddy system get_order implementation |
561 | /** Buddy system get_order implementation |
562 | * |
562 | * |
563 | * @param b Buddy system. |
563 | * @param b Buddy system. |
564 | * @param block Buddy system block |
564 | * @param block Buddy system block |
565 | * |
565 | * |
566 | * @return Order of block |
566 | * @return Order of block |
567 | */ |
567 | */ |
568 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
568 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
569 | frame_t * frame; |
569 | frame_t * frame; |
570 | frame = list_get_instance(block, frame_t, buddy_link); |
570 | frame = list_get_instance(block, frame_t, buddy_link); |
571 | return frame->buddy_order; |
571 | return frame->buddy_order; |
572 | } |
572 | } |
573 | 573 | ||
574 | /** Buddy system mark_busy implementation |
574 | /** Buddy system mark_busy implementation |
575 | * |
575 | * |
576 | * @param b Buddy system |
576 | * @param b Buddy system |
577 | * @param block Buddy system block |
577 | * @param block Buddy system block |
578 | * |
578 | * |
579 | */ |
579 | */ |
580 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
580 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
581 | frame_t * frame; |
581 | frame_t * frame; |
582 | frame = list_get_instance(block, frame_t, buddy_link); |
582 | frame = list_get_instance(block, frame_t, buddy_link); |
583 | frame->refcount = 1; |
583 | frame->refcount = 1; |
584 | } |
584 | } |
585 | 585 | ||
586 | /** Prints list of zones |
586 | /** Prints list of zones |
587 | * |
587 | * |
588 | */ |
588 | */ |
589 | void zone_print_list(void) { |
589 | void zone_print_list(void) { |
590 | zone_t *zone = NULL; |
590 | zone_t *zone = NULL; |
591 | link_t *cur; |
591 | link_t *cur; |
592 | ipl_t ipl; |
592 | ipl_t ipl; |
593 | 593 | ||
594 | ipl = interrupts_disable(); |
594 | ipl = interrupts_disable(); |
595 | spinlock_lock(&zone_head_lock); |
595 | spinlock_lock(&zone_head_lock); |
596 | printf("Base address\tFree Frames\tBusy Frames\n"); |
596 | printf("Base address\tFree Frames\tBusy Frames\n"); |
597 | printf("------------\t-----------\t-----------\n"); |
597 | printf("------------\t-----------\t-----------\n"); |
598 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
598 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
599 | zone = list_get_instance(cur, zone_t, link); |
599 | zone = list_get_instance(cur, zone_t, link); |
600 | spinlock_lock(&zone->lock); |
600 | spinlock_lock(&zone->lock); |
601 | printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count); |
601 | printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count); |
602 | spinlock_unlock(&zone->lock); |
602 | spinlock_unlock(&zone->lock); |
603 | } |
603 | } |
604 | spinlock_unlock(&zone_head_lock); |
604 | spinlock_unlock(&zone_head_lock); |
605 | interrupts_restore(ipl); |
605 | interrupts_restore(ipl); |
606 | } |
606 | } |
607 | 607 | ||
608 | /** Prints zone details |
608 | /** Prints zone details |
609 | * |
609 | * |
610 | * @param base Zone base address |
610 | * @param base Zone base address |
611 | */ |
611 | */ |
612 | void zone_print_one(__address base) { |
612 | void zone_print_one(__address base) { |
613 | zone_t *zone = NULL, *z ; |
613 | zone_t *zone = NULL, *z ; |
614 | link_t *cur; |
614 | link_t *cur; |
615 | ipl_t ipl; |
615 | ipl_t ipl; |
616 | 616 | ||
617 | ipl = interrupts_disable(); |
617 | ipl = interrupts_disable(); |
618 | spinlock_lock(&zone_head_lock); |
618 | spinlock_lock(&zone_head_lock); |
619 | 619 | ||
620 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
620 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
621 | z = list_get_instance(cur, zone_t, link); |
621 | z = list_get_instance(cur, zone_t, link); |
622 | if (base == z->base) { |
622 | if (base == z->base) { |
623 | zone = z; |
623 | zone = z; |
624 | break; |
624 | break; |
625 | } |
625 | } |
626 | } |
626 | } |
627 | 627 | ||
628 | if (!zone) { |
628 | if (!zone) { |
629 | spinlock_unlock(&zone_head_lock); |
629 | spinlock_unlock(&zone_head_lock); |
630 | interrupts_restore(ipl); |
630 | interrupts_restore(ipl); |
631 | printf("No zone with address %X\n", base); |
631 | printf("No zone with address %X\n", base); |
632 | return; |
632 | return; |
633 | } |
633 | } |
634 | 634 | ||
635 | spinlock_lock(&zone->lock); |
635 | spinlock_lock(&zone->lock); |
636 | printf("Memory zone information\n\n"); |
636 | printf("Memory zone information\n\n"); |
637 | printf("Zone base address: %P\n", zone->base); |
637 | printf("Zone base address: %P\n", zone->base); |
638 | printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10); |
638 | printf("Zone size: %d frames (%dK)\n", zone->free_count + zone->busy_count, ((zone->free_count + zone->busy_count) * FRAME_SIZE) >> 10); |
639 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10); |
639 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10); |
640 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10); |
640 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10); |
641 | 641 | ||
642 | printf("\nBuddy allocator structures:\n\n"); |
642 | printf("\nBuddy allocator structures:\n\n"); |
643 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
643 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
644 | 644 | ||
645 | spinlock_unlock(&zone->lock); |
645 | spinlock_unlock(&zone->lock); |
646 | spinlock_unlock(&zone_head_lock); |
646 | spinlock_unlock(&zone_head_lock); |
647 | interrupts_restore(ipl); |
647 | interrupts_restore(ipl); |
648 | } |
648 | } |
649 | 649 | ||
650 | 650 |