Rev 788 | Rev 820 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 788 | Rev 814 | ||
---|---|---|---|
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 | /* |
|
- | 31 | * Locking order |
|
- | 32 | * |
|
- | 33 | * In order to access particular zone, the process must first lock |
|
- | 34 | * the zones.lock, then lock the zone and then unlock the zones.lock. |
|
- | 35 | * This insures, that we can fiddle with the zones in runtime without |
|
- | 36 | * affecting the processes. |
|
- | 37 | * |
|
- | 38 | */ |
|
- | 39 | ||
30 | #include <typedefs.h> |
40 | #include <typedefs.h> |
31 | #include <arch/types.h> |
41 | #include <arch/types.h> |
32 | #include <mm/heap.h> |
- | |
33 | #include <mm/frame.h> |
42 | #include <mm/frame.h> |
34 | #include <mm/as.h> |
43 | #include <mm/as.h> |
35 | #include <panic.h> |
44 | #include <panic.h> |
36 | #include <debug.h> |
45 | #include <debug.h> |
37 | #include <adt/list.h> |
46 | #include <adt/list.h> |
38 | #include <synch/spinlock.h> |
47 | #include <synch/spinlock.h> |
39 | #include <arch/asm.h> |
48 | #include <arch/asm.h> |
40 | #include <arch.h> |
49 | #include <arch.h> |
41 | #include <print.h> |
50 | #include <print.h> |
42 | #include <align.h> |
51 | #include <align.h> |
- | 52 | #include <mm/slab.h> |
|
43 | 53 | ||
- | 54 | typedef struct { |
|
- | 55 | count_t refcount; /**< tracking of shared frames */ |
|
- | 56 | __u8 buddy_order; /**< buddy system block order */ |
|
- | 57 | link_t buddy_link; /**< link to the next free block inside one order */ |
|
- | 58 | void *parent; /**< If allocated by slab, this points there */ |
|
- | 59 | }frame_t; |
|
- | 60 | ||
- | 61 | typedef struct { |
|
44 | SPINLOCK_INITIALIZE(zone_head_lock); /**< this lock protects zone_head list */ |
62 | SPINLOCK_DECLARE(lock); /**< this lock protects everything below */ |
- | 63 | pfn_t base; /**< frame_no of the first frame in the frames array */ |
|
45 | LIST_INITIALIZE(zone_head); /**< list of all zones in the system */ |
64 | pfn_t count; /**< Size of zone */ |
- | 65 | ||
- | 66 | frame_t *frames; /**< array of frame_t structures in this zone */ |
|
- | 67 | count_t free_count; /**< number of free frame_t structures */ |
|
- | 68 | count_t busy_count; /**< number of busy frame_t structures */ |
|
- | 69 | ||
- | 70 | buddy_system_t * buddy_system; /**< buddy system for the zone */ |
|
- | 71 | int flags; |
|
- | 72 | }zone_t; |
|
46 | 73 | ||
47 | /** Blacklist containing non-available areas of memory. |
- | |
48 | * |
74 | /* |
49 | * This blacklist is used to exclude frames that cannot be allocated |
75 | * The zoneinfo.lock must be locked when accessing zoneinfo structure. |
50 | * (e.g. kernel memory) from available memory map. |
76 | * Some of the attributes in zone_t structures are 'read-only' |
51 | */ |
77 | */ |
52 | region_t zone_blacklist[ZONE_BLACKLIST_SIZE]; |
- | |
53 | count_t zone_blacklist_count = 0; |
- | |
54 | 78 | ||
55 | static struct buddy_system_operations zone_buddy_system_operations = { |
- | |
56 | .find_buddy = zone_buddy_find_buddy, |
- | |
57 | .bisect = zone_buddy_bisect, |
79 | struct { |
58 | .coalesce = zone_buddy_coalesce, |
80 | SPINLOCK_DECLARE(lock); |
59 | .set_order = zone_buddy_set_order, |
81 | int count; |
60 | .get_order = zone_buddy_get_order, |
82 | zone_t *info[ZONES_MAX]; |
61 | .mark_busy = zone_buddy_mark_busy, |
- | |
62 | }; |
83 | }zones; |
63 | 84 | ||
- | 85 | ||
- | 86 | /*********************************/ |
|
- | 87 | /* Helper functions */ |
|
- | 88 | static inline index_t frame_index(zone_t *zone, frame_t *frame) |
|
- | 89 | { |
|
- | 90 | return (index_t)(frame - zone->frames); |
|
- | 91 | } |
|
- | 92 | static inline index_t frame_index_abs(zone_t *zone, frame_t *frame) |
|
- | 93 | { |
|
- | 94 | return (index_t)(frame - zone->frames) + zone->base; |
|
- | 95 | } |
|
- | 96 | static inline int frame_index_valid(zone_t *zone, index_t index) |
|
- | 97 | { |
|
- | 98 | return index >= 0 && index < zone->count; |
|
- | 99 | } |
|
- | 100 | ||
- | 101 | /** Compute pfn_t from frame_t pointer & zone pointer */ |
|
- | 102 | static pfn_t make_frame_index(zone_t *zone, frame_t *frame) |
|
- | 103 | { |
|
- | 104 | return frame - zone->frames; |
|
- | 105 | } |
|
- | 106 | ||
64 | /** Initialize physical memory management |
107 | /** Initialize frame structure |
65 | * |
108 | * |
66 | * Initialize physical memory managemnt. |
109 | * Initialize frame structure. |
- | 110 | * |
|
- | 111 | * @param frame Frame structure to be initialized. |
|
67 | */ |
112 | */ |
68 | void frame_init(void) |
113 | static void frame_initialize(frame_t *frame) |
69 | { |
114 | { |
70 | if (config.cpu_active == 1) { |
115 | frame->refcount = 1; |
71 | frame_region_not_free(KA2PA(config.base), config.kernel_size); |
- | |
72 | if (config.init_size > 0) |
116 | frame->buddy_order = 0; |
73 | frame_region_not_free(KA2PA(config.init_addr), config.init_size); |
- | |
74 | } |
117 | } |
75 | 118 | ||
- | 119 | /*************************************/ |
|
- | 120 | /* Zoneinfo functions */ |
|
- | 121 | ||
- | 122 | /** |
|
- | 123 | * Insert-sort zone into zones list |
|
- | 124 | */ |
|
- | 125 | static void zones_add_zone(zone_t *zone) |
|
- | 126 | { |
|
- | 127 | int i; |
|
- | 128 | ||
- | 129 | spinlock_lock(&zones.lock); |
|
76 | frame_arch_init(); |
130 | /* Try to merge */ |
- | 131 | if (zone->flags & ZONE_JOIN) { |
|
- | 132 | for (i=0; i < zones.count; i++) { |
|
- | 133 | spinlock_lock(&zones.info[i]->lock); |
|
- | 134 | ||
- | 135 | /* Join forward, join backward */ |
|
- | 136 | panic("Not implemented"); |
|
- | 137 | ||
- | 138 | spinlock_unlock(&zones.info[i]->lock); |
|
- | 139 | } |
|
- | 140 | spinlock_unlock(&zones.lock); |
|
- | 141 | } else { |
|
- | 142 | if (zones.count+1 == ZONES_MAX) |
|
- | 143 | panic("Maximum zone(%d) count exceeded.", ZONES_MAX); |
|
- | 144 | zones.info[zones.count++] = zone; |
|
- | 145 | } |
|
- | 146 | spinlock_unlock(&zones.lock); |
|
77 | } |
147 | } |
78 | 148 | ||
79 | /** |
149 | /** |
80 | * Find AND LOCK zone that can allocate order frames |
150 | * Try to find a zone where can we find the frame |
81 | * |
151 | * |
- | 152 | * @param hint Start searching in zone 'hint' |
|
- | 153 | * @param lock Lock zone if true |
|
- | 154 | * |
|
82 | * Assume zone_head_lock is locked. |
155 | * Assume interrupts disable |
83 | */ |
156 | */ |
84 | static zone_t * find_free_zone(__u8 order) |
157 | static zone_t * find_zone_and_lock(pfn_t frame, int *pzone) |
85 | { |
158 | { |
86 | link_t *cur; |
159 | int i; |
- | 160 | int hint = pzone ? *pzone : 0; |
|
87 | zone_t *z; |
161 | zone_t *z; |
88 | 162 | ||
89 | for (cur = zone_head.next; cur != &zone_head;cur = cur->next) { |
- | |
90 | z = list_get_instance(cur, zone_t, link); |
163 | spinlock_lock(&zones.lock); |
91 | 164 | ||
92 | spinlock_lock(&z->lock); |
165 | if (hint >= zones.count || hint < 0) |
- | 166 | hint = 0; |
|
93 | 167 | ||
- | 168 | i = hint; |
|
- | 169 | do { |
|
- | 170 | z = zones.info[i]; |
|
- | 171 | spinlock_lock(&z->lock); |
|
94 | /* Check if the zone has 2^order frames area available */ |
172 | if (z->base <= frame && z->base + z->count > frame) { |
95 | if (buddy_system_can_alloc(z->buddy_system, order)) |
173 | spinlock_unlock(&zones.lock); /* Unlock the global lock */ |
- | 174 | if (pzone) |
|
- | 175 | *pzone = i; |
|
96 | return z; |
176 | return z; |
97 | - | ||
98 | spinlock_unlock(&z->lock); |
- | |
99 | } |
177 | } |
- | 178 | spinlock_unlock(&z->lock); |
|
- | 179 | ||
- | 180 | i++; |
|
- | 181 | if (i >= zones.count) |
|
- | 182 | i = 0; |
|
- | 183 | } while(i != hint); |
|
- | 184 | ||
- | 185 | spinlock_unlock(&zones.lock); |
|
100 | return NULL; |
186 | return NULL; |
101 | } |
187 | } |
102 | 188 | ||
- | 189 | /** |
|
103 | /** Allocate power-of-two frames of physical memory. |
190 | * Find AND LOCK zone that can allocate order frames |
104 | * |
191 | * |
105 | * @param flags Flags for host zone selection and address processing. |
- | |
106 | * @param order Allocate exactly 2^order frames. |
192 | * Assume interrupts are disabled!! |
107 | * @param pzone Pointer to preferred zone pointer, on output it changes |
- | |
108 | * to the zone that the frame was really allocated to |
- | |
109 | * |
193 | * |
110 | * @return Allocated frame. |
194 | * @param pzone Pointer to preferred zone or NULL, on return contains zone number |
111 | */ |
195 | */ |
112 | __address frame_alloc_generic(__u8 order, int flags, int * status, zone_t **pzone) |
196 | static zone_t * find_free_zone_lock(__u8 order, int *pzone) |
113 | { |
197 | { |
114 | ipl_t ipl; |
198 | int i; |
115 | link_t *tmp; |
199 | zone_t *z; |
116 | zone_t *zone = NULL; |
200 | int hint = pzone ? *pzone : 0; |
117 | frame_t *frame = NULL; |
- | |
118 | int freed; |
- | |
119 | __address v; |
- | |
120 | 201 | ||
- | 202 | spinlock_lock(&zones.lock); |
|
- | 203 | if (hint >= zones.count) |
|
- | 204 | hint = 0; |
|
- | 205 | i = hint; |
|
121 | loop: |
206 | do { |
122 | ipl = interrupts_disable(); |
207 | z = zones.info[i]; |
123 | spinlock_lock(&zone_head_lock); |
- | |
124 | 208 | ||
125 | /* |
- | |
126 | * First, find suitable frame zone. |
- | |
127 | */ |
- | |
128 | if (pzone && *pzone) { |
- | |
129 | spinlock_lock(&(*pzone)->lock); |
209 | spinlock_lock(&z->lock); |
130 | if (!buddy_system_can_alloc((*pzone)->buddy_system, order)) |
- | |
131 | spinlock_unlock(&(*pzone)->lock); |
- | |
132 | else |
- | |
133 | zone = *pzone; |
- | |
134 | } |
210 | |
135 | if (!zone) { |
- | |
136 | zone = find_free_zone(order); |
- | |
137 | /* If no memory, reclaim some slab memory, |
- | |
138 | if it does not help, reclaim all */ |
211 | /* Check if the zone has 2^order frames area available */ |
139 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
212 | if (buddy_system_can_alloc(z->buddy_system, order)) { |
140 | spinlock_unlock(&zone_head_lock); |
213 | spinlock_unlock(&zones.lock); |
141 | freed = slab_reclaim(0); |
- | |
142 | spinlock_lock(&zone_head_lock); |
- | |
143 | if (freed) |
214 | if (pzone) |
144 | zone = find_free_zone(order); |
- | |
145 | if (!zone) { |
215 | *pzone = i; |
146 | spinlock_unlock(&zone_head_lock); |
- | |
147 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
- | |
148 | spinlock_lock(&zone_head_lock); |
- | |
149 | if (freed) |
216 | return z; |
150 | zone = find_free_zone(order); |
- | |
151 | } |
- | |
152 | } |
217 | } |
- | 218 | spinlock_unlock(&z->lock); |
|
- | 219 | if (++i >= zones.count) |
|
- | 220 | i = 0; |
|
- | 221 | } while(i != hint); |
|
- | 222 | spinlock_unlock(&zones.lock); |
|
- | 223 | return NULL; |
|
153 | } |
224 | } |
154 | 225 | ||
155 | if (!zone) { |
- | |
156 | if (flags & FRAME_PANIC) |
226 | /********************************************/ |
157 | panic("Can't allocate frame.\n"); |
227 | /* Buddy system functions */ |
158 | 228 | ||
- | 229 | /** Buddy system find_block implementation |
|
159 | /* |
230 | * |
160 | * TODO: Sleep until frames are available again. |
231 | * Find block that is parent of current list. |
- | 232 | * That means go to lower addresses, until such block is found |
|
- | 233 | * |
|
- | 234 | * @param order - Order of parent must be different then this parameter!! |
|
161 | */ |
235 | */ |
- | 236 | static link_t *zone_buddy_find_block(buddy_system_t *b, link_t *child, |
|
162 | spinlock_unlock(&zone_head_lock); |
237 | __u8 order) |
- | 238 | { |
|
- | 239 | frame_t * frame; |
|
163 | interrupts_restore(ipl); |
240 | zone_t * zone; |
- | 241 | index_t index; |
|
164 | 242 | ||
- | 243 | frame = list_get_instance(child, frame_t, buddy_link); |
|
165 | if (flags & FRAME_ATOMIC) { |
244 | zone = (zone_t *) b->data; |
- | 245 | ||
166 | ASSERT(status != NULL); |
246 | index = frame_index(zone, frame); |
- | 247 | do { |
|
- | 248 | if (zone->frames[index].buddy_order != order) { |
|
167 | *status = FRAME_NO_MEMORY; |
249 | return &zone->frames[index].buddy_link; |
- | 250 | } |
|
- | 251 | } while(index-- > 0); |
|
168 | return NULL; |
252 | return NULL; |
169 | } |
253 | } |
170 | 254 | ||
171 | panic("Sleep not implemented.\n"); |
- | |
172 | goto loop; |
- | |
173 | } |
- | |
174 | 255 | ||
175 | /* Allocate frames from zone buddy system */ |
- | |
176 | tmp = buddy_system_alloc(zone->buddy_system, order); |
- | |
177 | 256 | ||
- | 257 | /** Buddy system find_buddy implementation |
|
- | 258 | * |
|
- | 259 | * @param b Buddy system. |
|
- | 260 | * @param block Block for which buddy should be found |
|
- | 261 | * |
|
- | 262 | * @return Buddy for given block if found |
|
- | 263 | */ |
|
- | 264 | static link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) |
|
- | 265 | { |
|
- | 266 | frame_t * frame; |
|
- | 267 | zone_t * zone; |
|
178 | ASSERT(tmp); |
268 | index_t index; |
- | 269 | bool is_left, is_right; |
|
179 | 270 | ||
180 | /* Update zone information. */ |
271 | frame = list_get_instance(block, frame_t, buddy_link); |
181 | zone->free_count -= (1 << order); |
272 | zone = (zone_t *) b->data; |
182 | zone->busy_count += (1 << order); |
273 | ASSERT(IS_BUDDY_ORDER_OK(frame_index_abs(zone, frame), frame->buddy_order)); |
183 | 274 | ||
184 | /* Frame will be actually a first frame of the block. */ |
275 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
185 | frame = list_get_instance(tmp, frame_t, buddy_link); |
276 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
186 | 277 | ||
187 | /* get frame address */ |
278 | ASSERT(is_left ^ is_right); |
- | 279 | if (is_left) { |
|
- | 280 | index = (frame_index(zone, frame)) + (1 << frame->buddy_order); |
|
188 | v = FRAME2ADDR(zone, frame); |
281 | } else { // if (is_right) |
- | 282 | index = (frame_index(zone, frame)) - (1 << frame->buddy_order); |
|
- | 283 | } |
|
189 | 284 | ||
190 | spinlock_unlock(&zone->lock); |
- | |
191 | spinlock_unlock(&zone_head_lock); |
- | |
192 | interrupts_restore(ipl); |
- | |
193 | 285 | ||
194 | ASSERT(v == ALIGN_UP(v, FRAME_SIZE << order)); |
286 | if (frame_index_valid(zone, index)) { |
- | 287 | if (zone->frames[index].buddy_order == frame->buddy_order && |
|
- | 288 | zone->frames[index].refcount == 0) { |
|
- | 289 | return &zone->frames[index].buddy_link; |
|
- | 290 | } |
|
- | 291 | } |
|
195 | 292 | ||
196 | if (flags & FRAME_KA) |
- | |
197 | v = PA2KA(v); |
293 | return NULL; |
- | 294 | } |
|
198 | 295 | ||
- | 296 | /** Buddy system bisect implementation |
|
- | 297 | * |
|
199 | if (status) |
298 | * @param b Buddy system. |
- | 299 | * @param block Block to bisect |
|
- | 300 | * |
|
200 | *status = FRAME_OK; |
301 | * @return right block |
- | 302 | */ |
|
- | 303 | static link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
|
- | 304 | frame_t * frame_l, * frame_r; |
|
201 | 305 | ||
202 | if (pzone) |
306 | frame_l = list_get_instance(block, frame_t, buddy_link); |
203 | *pzone = zone; |
307 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
- | 308 | ||
204 | return v; |
309 | return &frame_r->buddy_link; |
205 | } |
310 | } |
206 | 311 | ||
207 | /** Convert address to zone pointer |
312 | /** Buddy system coalesce implementation |
208 | * |
313 | * |
- | 314 | * @param b Buddy system. |
|
- | 315 | * @param block_1 First block |
|
209 | * Assume zone_head_lock is held |
316 | * @param block_2 First block's buddy |
210 | * |
317 | * |
211 | * @param addr Physical address |
- | |
212 | * @param lock If true, lock the zone |
318 | * @return Coalesced block (actually block that represents lower address) |
213 | */ |
319 | */ |
214 | static zone_t * addr2zone(__address addr, int lock) |
320 | static link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, |
215 | { |
- | |
216 | link_t *cur; |
321 | link_t * block_2) { |
217 | zone_t *z = NULL; |
322 | frame_t *frame1, *frame2; |
218 | 323 | ||
219 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
324 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
220 | z = list_get_instance(cur, zone_t, link); |
325 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
221 | 326 | ||
222 | spinlock_lock(&z->lock); |
327 | return frame1 < frame2 ? block_1 : block_2; |
- | 328 | } |
|
223 | 329 | ||
- | 330 | /** Buddy system set_order implementation |
|
224 | /* |
331 | * |
- | 332 | * @param b Buddy system. |
|
- | 333 | * @param block Buddy system block |
|
225 | * Check if addr belongs to z. |
334 | * @param order Order to set |
226 | */ |
335 | */ |
227 | if ((addr >= z->base) && (addr <= z->base + (z->free_count + z->busy_count) * FRAME_SIZE)) { |
336 | static void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
228 | if (!lock) |
337 | frame_t * frame; |
229 | spinlock_unlock(&z->lock); |
338 | frame = list_get_instance(block, frame_t, buddy_link); |
230 | return z; |
339 | frame->buddy_order = order; |
231 | } |
340 | } |
232 | 341 | ||
- | 342 | /** Buddy system get_order implementation |
|
- | 343 | * |
|
- | 344 | * @param b Buddy system. |
|
233 | spinlock_unlock(&z->lock); |
345 | * @param block Buddy system block |
- | 346 | * |
|
- | 347 | * @return Order of block |
|
- | 348 | */ |
|
- | 349 | static __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
|
- | 350 | frame_t * frame; |
|
- | 351 | frame = list_get_instance(block, frame_t, buddy_link); |
|
- | 352 | return frame->buddy_order; |
|
234 | } |
353 | } |
235 | 354 | ||
- | 355 | /** Buddy system mark_busy implementation |
|
- | 356 | * |
|
- | 357 | * @param b Buddy system |
|
- | 358 | * @param block Buddy system block |
|
- | 359 | * |
|
- | 360 | */ |
|
- | 361 | static void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
|
- | 362 | frame_t * frame; |
|
236 | panic("Cannot find addr2zone: 0x%X", addr); |
363 | frame = list_get_instance(block, frame_t, buddy_link); |
- | 364 | frame->refcount = 1; |
|
237 | } |
365 | } |
238 | 366 | ||
239 | /** Return frame_t structure corresponding to address |
367 | /** Buddy system mark_available implementation |
240 | * |
368 | * |
- | 369 | * @param b Buddy system |
|
- | 370 | * @param block Buddy system block |
|
241 | * |
371 | * |
242 | */ |
372 | */ |
243 | frame_t * frame_addr2frame(__address addr) |
373 | static void zone_buddy_mark_available(buddy_system_t *b, link_t * block) { |
244 | { |
- | |
245 | ipl_t ipl; |
- | |
246 | frame_t *frame; |
374 | frame_t * frame; |
247 | zone_t *zone; |
- | |
248 | - | ||
249 | if (IS_KA(addr)) |
- | |
250 | addr = KA2PA(addr); |
- | |
251 | - | ||
252 | /* Disable interrupts to avoid deadlocks with interrupt handlers */ |
- | |
253 | ipl = interrupts_disable(); |
- | |
254 | spinlock_lock(&zone_head_lock); |
- | |
255 | - | ||
256 | zone = addr2zone(addr,0); |
- | |
257 | frame = ADDR2FRAME(zone, addr); |
375 | frame = list_get_instance(block, frame_t, buddy_link); |
258 | - | ||
259 | spinlock_unlock(&zone_head_lock); |
- | |
260 | interrupts_restore(ipl); |
376 | frame->refcount = 0; |
261 | - | ||
262 | return frame; |
- | |
263 | } |
377 | } |
264 | 378 | ||
- | 379 | static struct buddy_system_operations zone_buddy_system_operations = { |
|
- | 380 | .find_buddy = zone_buddy_find_buddy, |
|
- | 381 | .bisect = zone_buddy_bisect, |
|
- | 382 | .coalesce = zone_buddy_coalesce, |
|
- | 383 | .set_order = zone_buddy_set_order, |
|
- | 384 | .get_order = zone_buddy_get_order, |
|
- | 385 | .mark_busy = zone_buddy_mark_busy, |
|
- | 386 | .mark_available = zone_buddy_mark_available, |
|
- | 387 | .find_block = zone_buddy_find_block |
|
- | 388 | }; |
|
- | 389 | ||
- | 390 | /*************************************/ |
|
- | 391 | /* Zone functions */ |
|
265 | 392 | ||
266 | /** Free a frame. |
393 | /** Allocate frame in particular zone |
267 | * |
394 | * |
268 | * Find respective frame structrue for supplied addr. |
- | |
269 | * Decrement frame reference count. |
395 | * Assume zone is locked |
270 | * If it drops to zero, move the frame structure to free list. |
- | |
271 | * |
396 | * |
272 | * @param addr Address of the frame to be freed. It must be a multiple of FRAME_SIZE. |
397 | * @return Frame index in zone |
273 | */ |
398 | */ |
274 | void frame_free(__address addr) |
399 | static pfn_t zone_frame_alloc(zone_t *zone,__u8 order, int flags, int *status) |
275 | { |
400 | { |
276 | ipl_t ipl; |
401 | pfn_t v; |
277 | zone_t *zone; |
402 | link_t *tmp; |
278 | frame_t *frame; |
403 | frame_t *frame; |
279 | int order; |
- | |
280 | 404 | ||
- | 405 | /* Allocate frames from zone buddy system */ |
|
- | 406 | tmp = buddy_system_alloc(zone->buddy_system, order); |
|
- | 407 | ||
281 | ASSERT(addr % FRAME_SIZE == 0); |
408 | ASSERT(tmp); |
282 | 409 | ||
- | 410 | /* Update zone information. */ |
|
283 | if (IS_KA(addr)) |
411 | zone->free_count -= (1 << order); |
284 | addr = KA2PA(addr); |
412 | zone->busy_count += (1 << order); |
285 | 413 | ||
286 | ipl = interrupts_disable(); |
414 | /* Frame will be actually a first frame of the block. */ |
287 | spinlock_lock(&zone_head_lock); |
415 | frame = list_get_instance(tmp, frame_t, buddy_link); |
288 | 416 | ||
- | 417 | /* get frame address */ |
|
- | 418 | v = make_frame_index(zone, frame); |
|
- | 419 | return v; |
|
- | 420 | } |
|
- | 421 | ||
- | 422 | /** Free frame from zone |
|
289 | /* |
423 | * |
290 | * First, find host frame zone for addr. |
424 | * Assume zone is locked |
291 | */ |
425 | */ |
292 | zone = addr2zone(addr, 1); /* This locks the zone automatically */ |
426 | static void zone_frame_free(zone_t *zone, pfn_t frame_idx) |
- | 427 | { |
|
- | 428 | frame_t *frame; |
|
- | 429 | __u8 order; |
|
293 | 430 | ||
294 | frame = ADDR2FRAME(zone, addr); |
431 | frame = &zone->frames[frame_idx]; |
295 | 432 | ||
296 | /* remember frame order */ |
433 | /* remember frame order */ |
297 | order = frame->buddy_order; |
434 | order = frame->buddy_order; |
298 | 435 | ||
299 | ASSERT(frame->refcount); |
436 | ASSERT(frame->refcount); |
300 | 437 | ||
301 | if (!--frame->refcount) { |
438 | if (!--frame->refcount) { |
302 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
439 | buddy_system_free(zone->buddy_system, &frame->buddy_link); |
303 | } |
440 | } |
304 | 441 | ||
305 | /* Update zone information. */ |
442 | /* Update zone information. */ |
306 | zone->free_count += (1 << order); |
443 | zone->free_count += (1 << order); |
307 | zone->busy_count -= (1 << order); |
444 | zone->busy_count -= (1 << order); |
308 | - | ||
309 | spinlock_unlock(&zone->lock); |
- | |
310 | spinlock_unlock(&zone_head_lock); |
- | |
311 | interrupts_restore(ipl); |
- | |
312 | } |
445 | } |
313 | 446 | ||
314 | /** Mark frame region not free. |
447 | /** Return frame from zone */ |
315 | * |
- | |
316 | * Mark frame region not free. |
- | |
317 | * |
- | |
318 | * @param base Base address of non-available region. |
- | |
319 | * @param size Size of non-available region. |
- | |
320 | */ |
- | |
321 | void frame_region_not_free(__address base, size_t size) |
448 | static frame_t * zone_get_frame(zone_t *zone, pfn_t frame_idx) |
322 | { |
449 | { |
323 | index_t index; |
- | |
324 | index = zone_blacklist_count++; |
450 | ASSERT(frame_idx < zone->count); |
325 | - | ||
326 | /* Force base to the nearest lower address frame boundary. */ |
- | |
327 | base = ALIGN_DOWN(base, FRAME_SIZE); |
- | |
328 | /* Align size to frame boundary. */ |
451 | return &zone->frames[frame_idx]; |
329 | size = ALIGN_UP(size, FRAME_SIZE); |
- | |
330 | - | ||
331 | ASSERT(index < ZONE_BLACKLIST_SIZE); |
- | |
332 | zone_blacklist[index].base = base; |
- | |
333 | zone_blacklist[index].size = size; |
- | |
334 | } |
452 | } |
335 | 453 | ||
336 | /** Create frame zones in region of available memory. |
454 | /** Mark frame in zone unavailable to allocation */ |
337 | * |
- | |
338 | * Avoid any black listed areas of non-available memory. |
- | |
339 | * Assume that the black listed areas cannot overlap |
- | |
340 | * one another or cross available memory region boundaries. |
- | |
341 | * |
- | |
342 | * @param base Base address of available memory region. |
- | |
343 | * @param size Size of the region. |
- | |
344 | */ |
- | |
345 | void zone_create_in_region(__address base, size_t size) { |
455 | static void zone_mark_unavailable(zone_t *zone, pfn_t frame_idx) |
346 | int i; |
- | |
347 | zone_t * z; |
- | |
348 | __address s; |
- | |
349 | size_t sz; |
- | |
350 | - | ||
351 | ASSERT(base % FRAME_SIZE == 0); |
- | |
352 | ASSERT(size % FRAME_SIZE == 0); |
- | |
353 | 456 | { |
|
354 | if (!size) |
- | |
355 | return; |
457 | frame_t *frame; |
356 | - | ||
357 | for (i = 0; i < zone_blacklist_count; i++) { |
- | |
358 | if (zone_blacklist[i].base >= base && zone_blacklist[i].base < base + size) { |
- | |
359 | s = base; sz = zone_blacklist[i].base - base; |
- | |
360 | ASSERT(base != s || sz != size); |
- | |
361 | zone_create_in_region(s, sz); |
- | |
362 | - | ||
363 | s = 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); |
- | |
366 | zone_create_in_region(s, sz); |
- | |
367 | return; |
458 | link_t *link; |
368 | - | ||
369 | } |
- | |
370 | } |
- | |
371 | - | ||
372 | z = zone_create(base, size, 0); |
- | |
373 | - | ||
374 | if (!z) { |
- | |
375 | panic("Cannot allocate zone (base=%P, size=%d).\n", base, size); |
- | |
376 | } |
- | |
377 | 459 | ||
- | 460 | frame = zone_get_frame(zone, frame_idx); |
|
- | 461 | link = buddy_system_alloc_block(zone->buddy_system, |
|
- | 462 | &frame->buddy_link); |
|
- | 463 | ASSERT(link); |
|
378 | zone_attach(z); |
464 | zone->free_count--; |
379 | } |
465 | } |
380 | 466 | ||
381 | - | ||
382 | /** Create frame zone |
467 | /** Create frame zone |
383 | * |
468 | * |
384 | * Create new frame zone. |
469 | * Create new frame zone. |
385 | * |
470 | * |
386 | * @param start Physical address of the first frame within the zone. |
471 | * @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. |
472 | * @param size Size of the zone. Must be a multiple of FRAME_SIZE. |
- | 473 | * @param conffram Address of configuration frame |
|
388 | * @param flags Zone flags. |
474 | * @param flags Zone flags. |
389 | * |
475 | * |
390 | * @return Initialized zone. |
476 | * @return Initialized zone. |
391 | */ |
477 | */ |
392 | zone_t * zone_create(__address start, size_t size, int flags) |
478 | static zone_t * zone_construct(pfn_t start, pfn_t count, |
- | 479 | zone_t *z, int flags) |
|
393 | { |
480 | { |
394 | zone_t *z; |
- | |
395 | count_t cnt; |
- | |
396 | int i; |
481 | int i; |
397 | __u8 max_order; |
482 | __u8 max_order; |
398 | 483 | ||
399 | ASSERT(start % FRAME_SIZE == 0); |
- | |
400 | ASSERT(size % FRAME_SIZE == 0); |
- | |
401 | - | ||
402 | cnt = size / FRAME_SIZE; |
- | |
403 | - | ||
404 | z = (zone_t *) early_malloc(sizeof(zone_t)); |
- | |
405 | if (z) { |
- | |
406 | link_initialize(&z->link); |
- | |
407 | spinlock_initialize(&z->lock, "zone_lock"); |
484 | spinlock_initialize(&z->lock, "zone_lock"); |
408 | - | ||
409 | z->base = start; |
485 | z->base = start; |
410 | z->base_index = start / FRAME_SIZE; |
486 | z->count = count; |
411 | - | ||
412 | z->flags = flags; |
487 | z->flags = flags; |
413 | - | ||
414 | z->free_count = cnt; |
488 | z->free_count = count; |
415 | z->busy_count = 0; |
489 | z->busy_count = 0; |
416 | 490 | ||
417 | z->frames = (frame_t *) early_malloc(cnt * sizeof(frame_t)); |
- | |
418 | if (!z->frames) { |
- | |
419 | early_free(z); |
- | |
420 | return NULL; |
- | |
421 | } |
- | |
422 | - | ||
423 | for (i = 0; i<cnt; i++) { |
- | |
424 | frame_initialize(&z->frames[i], z); |
- | |
425 | } |
- | |
426 | - | ||
427 | /* |
491 | /* |
428 | * Create buddy system for the zone |
492 | * Compute order for buddy system, initialize |
429 | */ |
493 | */ |
430 | for (max_order = 0; cnt >> max_order; max_order++) |
494 | for (max_order = 0; count >> max_order; max_order++) |
431 | ; |
495 | ; |
- | 496 | z->buddy_system = (buddy_system_t *)&z[1]; |
|
- | 497 | ||
- | 498 | buddy_system_create(z->buddy_system, max_order, |
|
- | 499 | &zone_buddy_system_operations, |
|
- | 500 | (void *) z); |
|
- | 501 | ||
- | 502 | /* Allocate frames _after_ the conframe */ |
|
- | 503 | /* Check sizes */ |
|
432 | z->buddy_system = buddy_system_create(max_order, &zone_buddy_system_operations, (void *) z); |
504 | z->frames = (frame_t *)((void *)z->buddy_system+buddy_conf_size(max_order)); |
433 | 505 | ||
- | 506 | for (i = 0; i<count; i++) { |
|
- | 507 | frame_initialize(&z->frames[i]); |
|
- | 508 | } |
|
434 | /* Stuffing frames */ |
509 | /* Stuffing frames */ |
435 | for (i = 0; i<cnt; i++) { |
510 | for (i = 0; i < count; i++) { |
436 | z->frames[i].refcount = 0; |
511 | z->frames[i].refcount = 0; |
437 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
512 | buddy_system_free(z->buddy_system, &z->frames[i].buddy_link); |
438 | } |
513 | } |
439 | - | ||
440 | } |
- | |
441 | return z; |
514 | return z; |
442 | } |
515 | } |
443 | 516 | ||
- | 517 | ||
444 | /** Attach frame zone |
518 | /** Compute configuration data size for zone */ |
- | 519 | __address zone_conf_size(pfn_t start, pfn_t count) |
|
445 | * |
520 | { |
- | 521 | int size = sizeof(zone_t) + count*sizeof(frame_t); |
|
- | 522 | int max_order; |
|
- | 523 | ||
- | 524 | for (max_order = 0; count >> max_order; max_order++) |
|
- | 525 | ; |
|
- | 526 | size += buddy_conf_size(max_order); |
|
- | 527 | return size; |
|
- | 528 | } |
|
- | 529 | ||
446 | * Attach frame zone to zone list. |
530 | /** Create and add zone to system |
447 | * |
531 | * |
448 | * @param zone Zone to be attached. |
532 | * @param confframe Where configuration frame is supposed to be. |
- | 533 | * Always check, that we will not disturb kernel pages |
|
- | 534 | * the kernel and possibly init. |
|
- | 535 | * If confframe is given _outside_ this zone, it is expected, |
|
- | 536 | * that the area is already marked BUSY and big enough |
|
- | 537 | * to contain zone_conf_size() amount of data |
|
449 | */ |
538 | */ |
450 | void zone_attach(zone_t *zone) |
539 | void zone_create(pfn_t start, pfn_t count, pfn_t confframe, int flags) |
451 | { |
540 | { |
- | 541 | zone_t *z; |
|
- | 542 | __address addr,endaddr; |
|
- | 543 | pfn_t confcount; |
|
452 | ipl_t ipl; |
544 | int i; |
453 | 545 | ||
- | 546 | /* Theoretically we could have here 0, practically make sure |
|
- | 547 | * nobody tries to do that. If some platform requires, remove |
|
- | 548 | * the assert |
|
- | 549 | */ |
|
- | 550 | ASSERT(confframe); |
|
- | 551 | /* If conframe is supposed to be inside our zone, then make sure |
|
- | 552 | * it does not span kernel & init |
|
- | 553 | */ |
|
- | 554 | confcount = SIZE2PFN(zone_conf_size(start,count)); |
|
- | 555 | if (confframe >= start && confframe < start+count) { |
|
- | 556 | for (;confframe < start+count;confframe++) { |
|
454 | ipl = interrupts_disable(); |
557 | addr = PFN2ADDR(confframe); |
- | 558 | endaddr = PFN2ADDR (confframe + confcount); |
|
- | 559 | if (overlaps(addr, endaddr, KA2PA(config.base), |
|
- | 560 | KA2PA(config.base+config.kernel_size))) |
|
- | 561 | continue; |
|
455 | spinlock_lock(&zone_head_lock); |
562 | if (config.init_addr) |
- | 563 | if (overlaps(addr,endaddr, |
|
- | 564 | KA2PA(config.init_addr), |
|
- | 565 | KA2PA(config.init_addr+config.init_size))) |
|
- | 566 | continue; |
|
- | 567 | break; |
|
- | 568 | } |
|
- | 569 | if (confframe >= start+count) |
|
- | 570 | panic("Cannot find configuration data for zone."); |
|
- | 571 | } |
|
456 | 572 | ||
- | 573 | z = zone_construct(start, count, (zone_t *)PA2KA(PFN2ADDR(confframe)), flags); |
|
457 | list_append(&zone->link, &zone_head); |
574 | zones_add_zone(z); |
458 | 575 | ||
459 | spinlock_unlock(&zone_head_lock); |
576 | /* If confdata in zone, mark as unavailable */ |
- | 577 | if (confframe >= start && confframe < start+count) |
|
- | 578 | for (i=confframe; i<confframe+confcount; i++) { |
|
460 | interrupts_restore(ipl); |
579 | zone_mark_unavailable(z, i - z->base); |
- | 580 | } |
|
461 | } |
581 | } |
462 | 582 | ||
463 | /** Initialize frame structure |
583 | /***************************************/ |
464 | * |
- | |
465 | * Initialize frame structure. |
584 | /* Frame functions */ |
466 | * |
585 | |
467 | * @param frame Frame structure to be initialized. |
- | |
468 | * @param zone Host frame zone. |
586 | /** Set parent of frame */ |
469 | */ |
- | |
470 | void frame_initialize(frame_t *frame, zone_t *zone) |
587 | void frame_set_parent(pfn_t pfn, void *data, int hint) |
471 | { |
588 | { |
- | 589 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
|
- | 590 | ||
472 | frame->refcount = 1; |
591 | ASSERT(zone); |
- | 592 | ||
- | 593 | zone_get_frame(zone, pfn-zone->base)->parent = data; |
|
473 | frame->buddy_order = 0; |
594 | spinlock_unlock(&zone->lock); |
474 | } |
595 | } |
475 | 596 | ||
- | 597 | void * frame_get_parent(pfn_t pfn, int hint) |
|
- | 598 | { |
|
- | 599 | zone_t *zone = find_zone_and_lock(pfn, &hint); |
|
- | 600 | void *res; |
|
476 | 601 | ||
- | 602 | ASSERT(zone); |
|
- | 603 | res = zone_get_frame(zone, pfn - zone->base)->parent; |
|
- | 604 | ||
- | 605 | spinlock_unlock(&zone->lock); |
|
- | 606 | return res; |
|
- | 607 | } |
|
- | 608 | ||
477 | /** Buddy system find_buddy implementation |
609 | /** Allocate power-of-two frames of physical memory. |
478 | * |
610 | * |
- | 611 | * @param flags Flags for host zone selection and address processing. |
|
479 | * @param b Buddy system. |
612 | * @param order Allocate exactly 2^order frames. |
480 | * @param block Block for which buddy should be found |
613 | * @param pzone Preferred zone |
481 | * |
614 | * |
482 | * @return Buddy for given block if found |
615 | * @return Allocated frame. |
483 | */ |
616 | */ |
484 | link_t * zone_buddy_find_buddy(buddy_system_t *b, link_t * block) { |
617 | pfn_t frame_alloc_generic(__u8 order, int flags, int * status, int *pzone) |
- | 618 | { |
|
- | 619 | ipl_t ipl; |
|
485 | frame_t * frame; |
620 | int freed; |
- | 621 | pfn_t v; |
|
486 | zone_t * zone; |
622 | zone_t *zone; |
487 | index_t index; |
- | |
488 | bool is_left, is_right; |
- | |
489 | - | ||
490 | frame = list_get_instance(block, frame_t, buddy_link); |
- | |
491 | zone = (zone_t *) b->data; |
- | |
492 | ASSERT(IS_BUDDY_ORDER_OK(FRAME_INDEX_ABS(zone, frame), frame->buddy_order)); |
- | |
493 | 623 | ||
- | 624 | loop: |
|
- | 625 | ipl = interrupts_disable(); |
|
- | 626 | /* |
|
- | 627 | * First, find suitable frame zone. |
|
- | 628 | */ |
|
- | 629 | zone = find_free_zone_lock(order,pzone); |
|
- | 630 | /* If no memory, reclaim some slab memory, |
|
- | 631 | if it does not help, reclaim all */ |
|
- | 632 | if (!zone && !(flags & FRAME_NO_RECLAIM)) { |
|
- | 633 | freed = slab_reclaim(0); |
|
- | 634 | if (freed) |
|
- | 635 | zone = find_free_zone_lock(order,pzone); |
|
- | 636 | if (!zone) { |
|
- | 637 | freed = slab_reclaim(SLAB_RECLAIM_ALL); |
|
- | 638 | if (freed) |
|
- | 639 | zone = find_free_zone_lock(order,pzone); |
|
- | 640 | } |
|
- | 641 | } |
|
- | 642 | if (!zone) { |
|
- | 643 | if (flags & FRAME_PANIC) |
|
- | 644 | panic("Can't allocate frame.\n"); |
|
494 | 645 | ||
495 | is_left = IS_BUDDY_LEFT_BLOCK_ABS(zone, frame); |
- | |
- | 646 | /* |
|
496 | is_right = IS_BUDDY_RIGHT_BLOCK_ABS(zone, frame); |
647 | * TODO: Sleep until frames are available again. |
497 | 648 | */ |
|
498 | ASSERT(is_left ^ is_right); |
649 | interrupts_restore(ipl); |
499 | 650 | ||
500 | if (is_left) { |
651 | if (flags & FRAME_ATOMIC) { |
501 | index = (FRAME_INDEX(zone, frame)) + (1 << frame->buddy_order); |
652 | ASSERT(status != NULL); |
502 | } else { // if (is_right) |
653 | if (status) |
503 | index = (FRAME_INDEX(zone, frame)) - (1 << frame->buddy_order); |
654 | *status = FRAME_NO_MEMORY; |
- | 655 | return NULL; |
|
504 | } |
656 | } |
505 | 657 | ||
506 | if (FRAME_INDEX_VALID(zone, index)) { |
- | |
507 | if ( zone->frames[index].buddy_order == frame->buddy_order && |
- | |
508 | zone->frames[index].refcount == 0) { |
658 | panic("Sleep not implemented.\n"); |
509 | return &zone->frames[index].buddy_link; |
- | |
510 | } |
659 | goto loop; |
511 | } |
660 | } |
- | 661 | v = zone_frame_alloc(zone,order,flags,status); |
|
- | 662 | v += zone->base; |
|
512 | 663 | ||
- | 664 | spinlock_unlock(&zone->lock); |
|
- | 665 | interrupts_restore(ipl); |
|
- | 666 | ||
- | 667 | if (status) |
|
- | 668 | *status = FRAME_OK; |
|
513 | return NULL; |
669 | return v; |
514 | } |
670 | } |
515 | 671 | ||
516 | /** Buddy system bisect implementation |
672 | /** Free a frame. |
517 | * |
673 | * |
518 | * @param b Buddy system. |
674 | * Find respective frame structrue for supplied addr. |
519 | * @param block Block to bisect |
675 | * Decrement frame reference count. |
- | 676 | * If it drops to zero, move the frame structure to free list. |
|
520 | * |
677 | * |
521 | * @return right block |
678 | * @param frame Frame no to be freed. |
522 | */ |
679 | */ |
523 | link_t * zone_buddy_bisect(buddy_system_t *b, link_t * block) { |
- | |
524 | frame_t * frame_l, * frame_r; |
680 | void frame_free(pfn_t pfn) |
525 | 681 | { |
|
526 | frame_l = list_get_instance(block, frame_t, buddy_link); |
682 | ipl_t ipl; |
527 | frame_r = (frame_l + (1 << (frame_l->buddy_order - 1))); |
683 | zone_t *zone; |
528 | 684 | ||
529 | return &frame_r->buddy_link; |
685 | ipl = interrupts_disable(); |
530 | } |
- | |
531 | 686 | ||
532 | /** Buddy system coalesce implementation |
- | |
533 | * |
687 | /* |
534 | * @param b Buddy system. |
- | |
535 | * @param block_1 First block |
- | |
536 | * @param block_2 First block's buddy |
688 | * First, find host frame zone for addr. |
537 | * |
- | |
538 | * @return Coalesced block (actually block that represents lower address) |
- | |
539 | */ |
689 | */ |
540 | link_t * zone_buddy_coalesce(buddy_system_t *b, link_t * block_1, link_t * block_2) { |
690 | zone = find_zone_and_lock(pfn,NULL); |
541 | frame_t * frame1, * frame2; |
691 | ASSERT(zone); |
542 | 692 | ||
543 | frame1 = list_get_instance(block_1, frame_t, buddy_link); |
- | |
544 | frame2 = list_get_instance(block_2, frame_t, buddy_link); |
693 | zone_frame_free(zone, pfn-zone->base); |
545 | 694 | ||
546 | return frame1 < frame2 ? block_1 : block_2; |
695 | spinlock_unlock(&zone->lock); |
- | 696 | interrupts_restore(ipl); |
|
547 | } |
697 | } |
548 | 698 | ||
549 | /** Buddy system set_order implementation |
- | |
550 | * |
- | |
551 | * @param b Buddy system. |
- | |
552 | * @param block Buddy system block |
- | |
553 | * @param order Order to set |
- | |
554 | */ |
- | |
555 | void zone_buddy_set_order(buddy_system_t *b, link_t * block, __u8 order) { |
- | |
556 | frame_t * frame; |
- | |
557 | frame = list_get_instance(block, frame_t, buddy_link); |
- | |
558 | frame->buddy_order = order; |
- | |
559 | } |
- | |
560 | 699 | ||
561 | /** Buddy system get_order implementation |
- | |
562 | * |
700 | |
563 | * @param b Buddy system. |
701 | /** Mark given range unavailable in frame zones */ |
564 | * @param block Buddy system block |
702 | void frame_mark_unavailable(pfn_t start, pfn_t count) |
565 | * |
703 | { |
- | 704 | int i; |
|
- | 705 | zone_t *zone; |
|
566 | * @return Order of block |
706 | int prefzone = 0; |
567 | */ |
707 | |
- | 708 | for (i=0; i<count; i++) { |
|
568 | __u8 zone_buddy_get_order(buddy_system_t *b, link_t * block) { |
709 | zone = find_zone_and_lock(start+i,&prefzone); |
- | 710 | if (!zone) /* PFN not found */ |
|
569 | frame_t * frame; |
711 | continue; |
570 | frame = list_get_instance(block, frame_t, buddy_link); |
712 | zone_mark_unavailable(zone, start+i-zone->base); |
- | 713 | ||
571 | return frame->buddy_order; |
714 | spinlock_unlock(&zone->lock); |
- | 715 | } |
|
572 | } |
716 | } |
573 | 717 | ||
574 | /** Buddy system mark_busy implementation |
718 | /** Initialize physical memory management |
575 | * |
- | |
576 | * @param b Buddy system |
- | |
577 | * @param block Buddy system block |
- | |
578 | * |
719 | * |
- | 720 | * Initialize physical memory managemnt. |
|
579 | */ |
721 | */ |
580 | void zone_buddy_mark_busy(buddy_system_t *b, link_t * block) { |
- | |
581 | frame_t * frame; |
722 | void frame_init(void) |
- | 723 | { |
|
582 | frame = list_get_instance(block, frame_t, buddy_link); |
724 | if (config.cpu_active == 1) { |
583 | frame->refcount = 1; |
725 | zones.count = 0; |
- | 726 | spinlock_initialize(&zones.lock,"zones_glob_lock"); |
|
584 | } |
727 | } |
- | 728 | /* Tell the architecture to create some memory */ |
|
- | 729 | frame_arch_init(); |
|
- | 730 | if (config.cpu_active == 1) { |
|
- | 731 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)), |
|
- | 732 | SIZE2PFN(config.kernel_size)); |
|
- | 733 | if (config.init_size > 0) |
|
- | 734 | frame_mark_unavailable(ADDR2PFN(KA2PA(config.init_addr)), |
|
- | 735 | SIZE2PFN(config.init_size)); |
|
- | 736 | } |
|
- | 737 | } |
|
- | 738 | ||
- | 739 | ||
585 | 740 | ||
586 | /** Prints list of zones |
741 | /** Prints list of zones |
587 | * |
742 | * |
588 | */ |
743 | */ |
589 | void zone_print_list(void) { |
744 | void zone_print_list(void) { |
590 | zone_t *zone = NULL; |
745 | zone_t *zone = NULL; |
591 | link_t *cur; |
746 | int i; |
592 | ipl_t ipl; |
747 | ipl_t ipl; |
593 | 748 | ||
594 | ipl = interrupts_disable(); |
749 | ipl = interrupts_disable(); |
595 | spinlock_lock(&zone_head_lock); |
750 | spinlock_lock(&zones.lock); |
596 | printf("Base address\tFree Frames\tBusy Frames\n"); |
751 | printf("Base address\tFree Frames\tBusy Frames\n"); |
597 | printf("------------\t-----------\t-----------\n"); |
752 | printf("------------\t-----------\t-----------\n"); |
598 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
753 | for (i=0;i<zones.count;i++) { |
599 | zone = list_get_instance(cur, zone_t, link); |
754 | zone = zones.info[i]; |
600 | spinlock_lock(&zone->lock); |
755 | spinlock_lock(&zone->lock); |
- | 756 | printf("%L\t%d\t\t%d\n",PFN2ADDR(zone->base), |
|
601 | printf("%L\t%d\t\t%d\n",zone->base, zone->free_count, zone->busy_count); |
757 | zone->free_count, zone->busy_count); |
602 | spinlock_unlock(&zone->lock); |
758 | spinlock_unlock(&zone->lock); |
603 | } |
759 | } |
604 | spinlock_unlock(&zone_head_lock); |
760 | spinlock_unlock(&zones.lock); |
605 | interrupts_restore(ipl); |
761 | interrupts_restore(ipl); |
606 | } |
762 | } |
607 | 763 | ||
608 | /** Prints zone details |
764 | /** Prints zone details |
609 | * |
765 | * |
610 | * @param base Zone base address |
766 | * @param base Zone base address |
611 | */ |
767 | */ |
612 | void zone_print_one(__address base) { |
768 | void zone_print_one(int znum) { |
613 | zone_t *zone = NULL, *z ; |
769 | zone_t *zone = NULL; |
614 | link_t *cur; |
- | |
615 | ipl_t ipl; |
770 | ipl_t ipl; |
616 | 771 | ||
617 | ipl = interrupts_disable(); |
772 | ipl = interrupts_disable(); |
618 | spinlock_lock(&zone_head_lock); |
773 | spinlock_lock(&zones.lock); |
619 | 774 | ||
620 | for (cur = zone_head.next; cur != &zone_head; cur = cur->next) { |
775 | if (znum >= zones.count || znum < 0) { |
621 | z = list_get_instance(cur, zone_t, link); |
776 | printf("Zone number out of bounds.\n"); |
622 | if (base == z->base) { |
- | |
623 | zone = z; |
- | |
624 | break; |
- | |
625 | } |
- | |
626 | } |
- | |
627 | - | ||
628 | if (!zone) { |
- | |
629 | spinlock_unlock(&zone_head_lock); |
777 | spinlock_unlock(&zones.lock); |
630 | interrupts_restore(ipl); |
778 | interrupts_restore(ipl); |
631 | printf("No zone with address %X\n", base); |
- | |
632 | return; |
779 | return; |
633 | } |
780 | } |
634 | 781 | ||
- | 782 | zone = zones.info[znum]; |
|
- | 783 | ||
635 | spinlock_lock(&zone->lock); |
784 | spinlock_lock(&zone->lock); |
636 | printf("Memory zone information\n\n"); |
785 | printf("Memory zone information\n\n"); |
637 | printf("Zone base address: %P\n", zone->base); |
786 | printf("Zone base address: %P\n", PFN2ADDR(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); |
787 | printf("Zone size: %d frames (%dK)\n", zone->count, ((zone->count) * FRAME_SIZE) >> 10); |
639 | printf("Allocated space: %d frames (%dK)\n", zone->busy_count, (zone->busy_count * FRAME_SIZE) >> 10); |
788 | 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); |
789 | printf("Available space: %d (%dK)\n", zone->free_count, (zone->free_count * FRAME_SIZE) >> 10); |
641 | 790 | ||
642 | printf("\nBuddy allocator structures:\n\n"); |
791 | printf("\nBuddy allocator structures:\n\n"); |
643 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
792 | buddy_system_structure_print(zone->buddy_system, FRAME_SIZE); |
644 | 793 | ||
645 | spinlock_unlock(&zone->lock); |
794 | spinlock_unlock(&zone->lock); |
646 | spinlock_unlock(&zone_head_lock); |
795 | spinlock_unlock(&zones.lock); |
647 | interrupts_restore(ipl); |
796 | interrupts_restore(ipl); |
648 | } |
797 | } |
649 | 798 | ||
650 | 799 |