source: mainline/kernel/generic/src/mm/frame.c@ 0705fc5

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 0705fc5 was 0705fc5, checked in by Jakub Jermar <jakub@…>, 7 years ago

Fix warnings in non-debug build

  • Property mode set to 100644
File size: 36.4 KB
RevLine 
[f761f1eb]1/*
[df4ed85]2 * Copyright (c) 2001-2005 Jakub Jermar
3 * Copyright (c) 2005 Sergey Bondari
[5f0f29ce]4 * Copyright (c) 2009 Martin Decky
[f761f1eb]5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 *
11 * - Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * - Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * - The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
[174156fd]31/** @addtogroup kernel_generic_mm
[b45c443]32 * @{
33 */
34
[9179d0a]35/**
[b45c443]36 * @file
[5f0f29ce]37 * @brief Physical frame allocator.
[9179d0a]38 *
39 * This file contains the physical frame allocator and memory zone management.
[b0c2075]40 * The frame allocator is built on top of the two-level bitmap structure.
[9179d0a]41 *
42 */
43
[d99c1d2]44#include <typedefs.h>
[f761f1eb]45#include <mm/frame.h>
[89bcb520]46#include <mm/reserve.h>
[20d50a1]47#include <mm/as.h>
[f761f1eb]48#include <panic.h>
[63e27ef]49#include <assert.h>
[5c9a08b]50#include <adt/list.h>
[1a1744e]51#include <synch/mutex.h>
52#include <synch/condvar.h>
[18e0a6c]53#include <arch/asm.h>
[9c0a9b3]54#include <arch.h>
[bab75df6]55#include <stdio.h>
[b2fa1204]56#include <log.h>
[9ebc238]57#include <align.h>
[085d973]58#include <mm/slab.h>
[bb68433]59#include <bitops.h>
[93165be]60#include <macros.h>
[d630139]61#include <config.h>
[933cadf]62#include <str.h>
[1066041]63#include <proc/thread.h> /* THREAD */
[18e0a6c]64
[e49e234]65zones_t zones;
[f761f1eb]66
[1a1744e]67/*
68 * Synchronization primitives used to sleep when there is no memory
69 * available.
70 */
[da1bafb]71static mutex_t mem_avail_mtx;
72static condvar_t mem_avail_cv;
73static size_t mem_avail_req = 0; /**< Number of frames requested. */
74static size_t mem_avail_gen = 0; /**< Generation counter. */
[a294ad0]75
[deaf8d5]76/** Initialize frame structure.
[84dd253]77 *
[5f0f29ce]78 * @param frame Frame structure to be initialized.
79 *
[f761f1eb]80 */
[7a0359b]81NO_TRACE static void frame_initialize(frame_t *frame)
[f761f1eb]82{
[b0c2075]83 frame->refcount = 0;
84 frame->parent = NULL;
[f761f1eb]85}
86
[5f0f29ce]87/*******************/
88/* Zones functions */
89/*******************/
[085d973]90
[deaf8d5]91/** Insert-sort zone into zones list.
[bb68433]92 *
[5f0f29ce]93 * Assume interrupts are disabled and zones lock is
94 * locked.
95 *
96 * @param base Base frame of the newly inserted zone.
97 * @param count Number of frames of the newly inserted zone.
98 *
99 * @return Zone number on success, -1 on error.
100 *
[84dd253]101 */
[e2650d3]102NO_TRACE static size_t zones_insert_zone(pfn_t base, size_t count,
103 zone_flags_t flags)
[f761f1eb]104{
[71eef11]105 if (zones.count + 1 == ZONES_MAX) {
[b2fa1204]106 log(LF_OTHER, LVL_ERROR, "Maximum zone count %u exceeded!",
107 ZONES_MAX);
[98000fb]108 return (size_t) -1;
[71eef11]109 }
[a35b458]110
[98000fb]111 size_t i;
[b6b576c]112 for (i = 0; i < zones.count; i++) {
[5f0f29ce]113 /* Check for overlap */
[e2650d3]114 if (overlaps(zones.info[i].base, zones.info[i].count,
115 base, count)) {
[a35b458]116
[e2650d3]117 /*
118 * If the overlaping zones are of the same type
119 * and the new zone is completely within the previous
120 * one, then quietly ignore the new zone.
121 *
122 */
[a35b458]123
[e2650d3]124 if ((zones.info[i].flags != flags) ||
125 (!iswithin(zones.info[i].base, zones.info[i].count,
126 base, count))) {
[b2fa1204]127 log(LF_OTHER, LVL_WARN,
128 "Zone (%p, %p) overlaps "
129 "with previous zone (%p %p)!",
[7e752b2]130 (void *) PFN2ADDR(base), (void *) PFN2ADDR(count),
131 (void *) PFN2ADDR(zones.info[i].base),
132 (void *) PFN2ADDR(zones.info[i].count));
[e2650d3]133 }
[a35b458]134
[98000fb]135 return (size_t) -1;
[085d973]136 }
[5f0f29ce]137 if (base < zones.info[i].base)
[bb68433]138 break;
[085d973]139 }
[a35b458]140
[bb68433]141 /* Move other zones up */
[b0c2075]142 for (size_t j = zones.count; j > i; j--)
[e49e234]143 zones.info[j] = zones.info[j - 1];
[a35b458]144
[bb68433]145 zones.count++;
[a35b458]146
[bb68433]147 return i;
[f761f1eb]148}
[fcacfb7]149
[5f0f29ce]150/** Get total available frames.
151 *
152 * Assume interrupts are disabled and zones lock is
153 * locked.
[71eef11]154 *
[5f0f29ce]155 * @return Total number of available frames.
[71eef11]156 *
[eef75f6]157 */
[8d308b9]158NO_TRACE static size_t frame_total_free_get_internal(void)
[085d973]159{
[98000fb]160 size_t total = 0;
161 size_t i;
[8d308b9]162
[5f0f29ce]163 for (i = 0; i < zones.count; i++)
164 total += zones.info[i].free_count;
[a35b458]165
[5f0f29ce]166 return total;
167}
[8d308b9]168
169NO_TRACE size_t frame_total_free_get(void)
170{
171 size_t total;
172
173 irq_spinlock_lock(&zones.lock, true);
174 total = frame_total_free_get_internal();
175 irq_spinlock_unlock(&zones.lock, true);
176
177 return total;
178}
179
[e49e234]180/** Find a zone with a given frames.
[5f0f29ce]181 *
182 * Assume interrupts are disabled and zones lock is
183 * locked.
184 *
185 * @param frame Frame number contained in zone.
[e49e234]186 * @param count Number of frames to look for.
[5f0f29ce]187 * @param hint Used as zone hint.
188 *
189 * @return Zone index or -1 if not found.
190 *
191 */
[97bdb4a]192NO_TRACE size_t find_zone(pfn_t frame, size_t count, size_t hint)
[5f0f29ce]193{
[6c441cf8]194 if (hint >= zones.count)
[085d973]195 hint = 0;
[a35b458]196
[98000fb]197 size_t i = hint;
[085d973]198 do {
[3bacee1]199 if ((zones.info[i].base <= frame) &&
200 (zones.info[i].base + zones.info[i].count >= frame + count))
[5f0f29ce]201 return i;
[a35b458]202
[085d973]203 i++;
204 if (i >= zones.count)
205 i = 0;
[a35b458]206
[5f7a0ef]207 } while (i != hint);
[a35b458]208
[98000fb]209 return (size_t) -1;
[085d973]210}
[328f2934]211
[b0c2075]212/** @return True if zone can allocate specified number of frames */
213NO_TRACE static bool zone_can_alloc(zone_t *zone, size_t count,
214 pfn_t constraint)
[bb68433]215{
[b0c2075]216 /*
217 * The function bitmap_allocate_range() does not modify
218 * the bitmap if the last argument is NULL.
219 */
[a35b458]220
[e6c4b94]221 return ((zone->flags & ZONE_AVAILABLE) &&
[b0c2075]222 bitmap_allocate_range(&zone->bitmap, count, zone->base,
[f72906c]223 FRAME_LOWPRIO, constraint, NULL));
224}
225
226/** Find a zone that can allocate specified number of frames
227 *
228 * This function searches among all zones. Assume interrupts are
229 * disabled and zones lock is locked.
230 *
231 * @param count Number of free frames we are trying to find.
232 * @param flags Required flags of the zone.
233 * @param constraint Indication of bits that cannot be set in the
234 * physical frame number of the first allocated frame.
235 * @param hint Preferred zone.
236 *
237 * @return Zone that can allocate specified number of frames.
238 * @return -1 if no zone can satisfy the request.
239 *
240 */
241NO_TRACE static size_t find_free_zone_all(size_t count, zone_flags_t flags,
242 pfn_t constraint, size_t hint)
243{
244 for (size_t pos = 0; pos < zones.count; pos++) {
245 size_t i = (pos + hint) % zones.count;
[a35b458]246
[f72906c]247 /* Check whether the zone meets the search criteria. */
248 if (!ZONE_FLAGS_MATCH(zones.info[i].flags, flags))
249 continue;
[a35b458]250
[f72906c]251 /* Check if the zone can satisfy the allocation request. */
252 if (zone_can_alloc(&zones.info[i], count, constraint))
253 return i;
254 }
[a35b458]255
[f72906c]256 return (size_t) -1;
257}
258
259/** Check if frame range priority memory
260 *
261 * @param pfn Starting frame.
262 * @param count Number of frames.
263 *
264 * @return True if the range contains only priority memory.
265 *
266 */
267NO_TRACE static bool is_high_priority(pfn_t base, size_t count)
268{
269 return (base + count <= FRAME_LOWPRIO);
270}
271
272/** Find a zone that can allocate specified number of frames
273 *
274 * This function ignores zones that contain only high-priority
275 * memory. Assume interrupts are disabled and zones lock is locked.
276 *
277 * @param count Number of free frames we are trying to find.
278 * @param flags Required flags of the zone.
279 * @param constraint Indication of bits that cannot be set in the
280 * physical frame number of the first allocated frame.
281 * @param hint Preferred zone.
282 *
283 * @return Zone that can allocate specified number of frames.
284 * @return -1 if no low-priority zone can satisfy the request.
285 *
286 */
287NO_TRACE static size_t find_free_zone_lowprio(size_t count, zone_flags_t flags,
288 pfn_t constraint, size_t hint)
[1b20da0]289{
[f72906c]290 for (size_t pos = 0; pos < zones.count; pos++) {
291 size_t i = (pos + hint) % zones.count;
[a35b458]292
[f72906c]293 /* Skip zones containing only high-priority memory. */
294 if (is_high_priority(zones.info[i].base, zones.info[i].count))
295 continue;
[a35b458]296
[f72906c]297 /* Check whether the zone meets the search criteria. */
298 if (!ZONE_FLAGS_MATCH(zones.info[i].flags, flags))
299 continue;
[a35b458]300
[f72906c]301 /* Check if the zone can satisfy the allocation request. */
302 if (zone_can_alloc(&zones.info[i], count, constraint))
303 return i;
304 }
[a35b458]305
[f72906c]306 return (size_t) -1;
[bb68433]307}
308
[b0c2075]309/** Find a zone that can allocate specified number of frames
[5f0f29ce]310 *
311 * Assume interrupts are disabled and zones lock is
312 * locked.
[fcacfb7]313 *
[b0c2075]314 * @param count Number of free frames we are trying to find.
315 * @param flags Required flags of the target zone.
316 * @param constraint Indication of bits that cannot be set in the
317 * physical frame number of the first allocated frame.
[f72906c]318 * @param hint Preferred zone.
319 *
320 * @return Zone that can allocate specified number of frames.
321 * @return -1 if no zone can satisfy the request.
[fcacfb7]322 *
323 */
[b0c2075]324NO_TRACE static size_t find_free_zone(size_t count, zone_flags_t flags,
325 pfn_t constraint, size_t hint)
[fcacfb7]326{
[085d973]327 if (hint >= zones.count)
328 hint = 0;
[a35b458]329
[f72906c]330 /*
331 * Prefer zones with low-priority memory over
332 * zones with high-priority memory.
333 */
[a35b458]334
[f72906c]335 size_t znum = find_free_zone_lowprio(count, flags, constraint, hint);
336 if (znum != (size_t) -1)
337 return znum;
[a35b458]338
[f72906c]339 /* Take all zones into account */
340 return find_free_zone_all(count, flags, constraint, hint);
[fcacfb7]341}
342
[b0c2075]343/******************/
344/* Zone functions */
345/******************/
[6e8b3c8]346
[b0c2075]347/** Return frame from zone. */
348NO_TRACE static frame_t *zone_get_frame(zone_t *zone, size_t index)
[bb68433]349{
[63e27ef]350 assert(index < zone->count);
[a35b458]351
[b0c2075]352 return &zone->frames[index];
[6e8b3c8]353}
354
[deaf8d5]355/** Allocate frame in particular zone.
[085d973]356 *
[5f0f29ce]357 * Assume zone is locked and is available for allocation.
[9a68b34d]358 * Panics if allocation is impossible.
359 *
[b0c2075]360 * @param zone Zone to allocate from.
361 * @param count Number of frames to allocate
362 * @param constraint Indication of bits that cannot be set in the
363 * physical frame number of the first allocated frame.
[085d973]364 *
[5f0f29ce]365 * @return Frame index in zone.
[9a68b34d]366 *
[085d973]367 */
[b0c2075]368NO_TRACE static size_t zone_frame_alloc(zone_t *zone, size_t count,
369 pfn_t constraint)
[085d973]370{
[63e27ef]371 assert(zone->flags & ZONE_AVAILABLE);
[a35b458]372
[b0c2075]373 /* Allocate frames from zone */
[566da7f8]374 size_t index = (size_t) -1;
[b0c2075]375 int avail = bitmap_allocate_range(&zone->bitmap, count, zone->base,
[f72906c]376 FRAME_LOWPRIO, constraint, &index);
[a35b458]377
[0705fc5]378 (void) avail;
[63e27ef]379 assert(avail);
380 assert(index != (size_t) -1);
[a35b458]381
[b0c2075]382 /* Update frame reference count */
383 for (size_t i = 0; i < count; i++) {
384 frame_t *frame = zone_get_frame(zone, index + i);
[a35b458]385
[63e27ef]386 assert(frame->refcount == 0);
[b0c2075]387 frame->refcount = 1;
388 }
[a35b458]389
[085d973]390 /* Update zone information. */
[b0c2075]391 zone->free_count -= count;
392 zone->busy_count += count;
[a35b458]393
[b0c2075]394 return index;
[085d973]395}
396
[deaf8d5]397/** Free frame from zone.
[085d973]398 *
[5f0f29ce]399 * Assume zone is locked and is available for deallocation.
400 *
[b0c2075]401 * @param zone Pointer to zone from which the frame is to be freed.
402 * @param index Frame index relative to zone.
[eb3d379]403 *
[b0c2075]404 * @return Number of freed frames.
[89bcb520]405 *
[085d973]406 */
[b0c2075]407NO_TRACE static size_t zone_frame_free(zone_t *zone, size_t index)
[085d973]408{
[63e27ef]409 assert(zone->flags & ZONE_AVAILABLE);
[a35b458]410
[b0c2075]411 frame_t *frame = zone_get_frame(zone, index);
[a35b458]412
[63e27ef]413 assert(frame->refcount > 0);
[a35b458]414
[085d973]415 if (!--frame->refcount) {
[64f3d3b]416 bitmap_set(&zone->bitmap, index, 0);
[a35b458]417
[d3dfa42]418 /* Update zone information. */
[b0c2075]419 zone->free_count++;
420 zone->busy_count--;
[a35b458]421
[5df1963]422 return 1;
[085d973]423 }
[a35b458]424
[5df1963]425 return 0;
[085d973]426}
427
[deaf8d5]428/** Mark frame in zone unavailable to allocation. */
[b0c2075]429NO_TRACE static void zone_mark_unavailable(zone_t *zone, size_t index)
[085d973]430{
[63e27ef]431 assert(zone->flags & ZONE_AVAILABLE);
[a35b458]432
[b0c2075]433 frame_t *frame = zone_get_frame(zone, index);
434 if (frame->refcount > 0)
[bb68433]435 return;
[a35b458]436
[cd3b380]437 frame->refcount = 1;
[b0c2075]438 bitmap_set_range(&zone->bitmap, index, 1);
[a35b458]439
[085d973]440 zone->free_count--;
[d060900]441 reserve_force_alloc(1);
[085d973]442}
443
[5f0f29ce]444/** Merge two zones.
[bb68433]445 *
[5f0f29ce]446 * Assume z1 & z2 are locked and compatible and zones lock is
447 * locked.
[bb68433]448 *
[b0c2075]449 * @param z1 First zone to merge.
450 * @param z2 Second zone to merge.
451 * @param old_z1 Original data of the first zone.
452 * @param confdata Merged zone configuration data.
[eb3d379]453 *
[bb68433]454 */
[7a0359b]455NO_TRACE static void zone_merge_internal(size_t z1, size_t z2, zone_t *old_z1,
[b0c2075]456 void *confdata)
[bb68433]457{
[63e27ef]458 assert(zones.info[z1].flags & ZONE_AVAILABLE);
459 assert(zones.info[z2].flags & ZONE_AVAILABLE);
460 assert(zones.info[z1].flags == zones.info[z2].flags);
461 assert(zones.info[z1].base < zones.info[z2].base);
462 assert(!overlaps(zones.info[z1].base, zones.info[z1].count,
[5f0f29ce]463 zones.info[z2].base, zones.info[z2].count));
[a35b458]464
[5f0f29ce]465 /* Difference between zone bases */
466 pfn_t base_diff = zones.info[z2].base - zones.info[z1].base;
[a35b458]467
[5f0f29ce]468 zones.info[z1].count = base_diff + zones.info[z2].count;
469 zones.info[z1].free_count += zones.info[z2].free_count;
470 zones.info[z1].busy_count += zones.info[z2].busy_count;
[a35b458]471
[b0c2075]472 bitmap_initialize(&zones.info[z1].bitmap, zones.info[z1].count,
[c5396c1]473 confdata + (sizeof(frame_t) * zones.info[z1].count));
[adb252c0]474 bitmap_clear_range(&zones.info[z1].bitmap, 0, zones.info[z1].count);
[a35b458]475
[b0c2075]476 zones.info[z1].frames = (frame_t *) confdata;
[a35b458]477
[b0c2075]478 /*
479 * Copy frames and bits from both zones to preserve parents, etc.
[bb68433]480 */
[a35b458]481
[b0c2075]482 for (size_t i = 0; i < old_z1->count; i++) {
483 bitmap_set(&zones.info[z1].bitmap, i,
484 bitmap_get(&old_z1->bitmap, i));
485 zones.info[z1].frames[i] = old_z1->frames[i];
[bb68433]486 }
[a35b458]487
[b0c2075]488 for (size_t i = 0; i < zones.info[z2].count; i++) {
489 bitmap_set(&zones.info[z1].bitmap, base_diff + i,
490 bitmap_get(&zones.info[z2].bitmap, i));
491 zones.info[z1].frames[base_diff + i] =
492 zones.info[z2].frames[i];
[bb68433]493 }
494}
495
[deaf8d5]496/** Return old configuration frames into the zone.
[bb68433]497 *
[5f0f29ce]498 * We have two cases:
499 * - The configuration data is outside the zone
500 * -> do nothing (perhaps call frame_free?)
501 * - The configuration data was created by zone_create
502 * or updated by reduce_region -> free every frame
503 *
504 * @param znum The actual zone where freeing should occur.
505 * @param pfn Old zone configuration frame.
506 * @param count Old zone frame count.
[874878a]507 *
[bb68433]508 */
[7a0359b]509NO_TRACE static void return_config_frames(size_t znum, pfn_t pfn, size_t count)
[bb68433]510{
[63e27ef]511 assert(zones.info[znum].flags & ZONE_AVAILABLE);
[a35b458]512
[98000fb]513 size_t cframes = SIZE2FRAMES(zone_conf_size(count));
[a35b458]514
[b0c2075]515 if ((pfn < zones.info[znum].base) ||
516 (pfn >= zones.info[znum].base + zones.info[znum].count))
[bb68433]517 return;
[a35b458]518
[b0c2075]519 for (size_t i = 0; i < cframes; i++)
[89bcb520]520 (void) zone_frame_free(&zones.info[znum],
[5f0f29ce]521 pfn - zones.info[znum].base + i);
[874878a]522}
523
[deaf8d5]524/** Merge zones z1 and z2.
[bb68433]525 *
[5f0f29ce]526 * The merged zones must be 2 zones with no zone existing in between
527 * (which means that z2 = z1 + 1). Both zones must be available zones
528 * with the same flags.
529 *
530 * When you create a new zone, the frame allocator configuration does
531 * not to be 2^order size. Once the allocator is running it is no longer
532 * possible, merged configuration data occupies more space :-/
533 *
[bb68433]534 */
[98000fb]535bool zone_merge(size_t z1, size_t z2)
[bb68433]536{
[da1bafb]537 irq_spinlock_lock(&zones.lock, true);
[a35b458]538
[5f0f29ce]539 bool ret = true;
[a35b458]540
[b0c2075]541 /*
542 * We can join only 2 zones with none existing inbetween,
[5f0f29ce]543 * the zones have to be available and with the same
544 * set of flags
545 */
[e6c4b94]546 if ((z1 >= zones.count) || (z2 >= zones.count) || (z2 - z1 != 1) ||
547 (zones.info[z1].flags != zones.info[z2].flags)) {
[5f0f29ce]548 ret = false;
[bb68433]549 goto errout;
[5f0f29ce]550 }
[a35b458]551
[5f0f29ce]552 pfn_t cframes = SIZE2FRAMES(zone_conf_size(
[3bacee1]553 zones.info[z2].base - zones.info[z1].base +
554 zones.info[z2].count));
[a35b458]555
[5f0f29ce]556 /* Allocate merged zone data inside one of the zones */
557 pfn_t pfn;
[b0c2075]558 if (zone_can_alloc(&zones.info[z1], cframes, 0)) {
559 pfn = zones.info[z1].base +
560 zone_frame_alloc(&zones.info[z1], cframes, 0);
561 } else if (zone_can_alloc(&zones.info[z2], cframes, 0)) {
562 pfn = zones.info[z2].base +
563 zone_frame_alloc(&zones.info[z2], cframes, 0);
[5f0f29ce]564 } else {
565 ret = false;
566 goto errout;
567 }
[a35b458]568
[5f0f29ce]569 /* Preserve original data from z1 */
570 zone_t old_z1 = zones.info[z1];
[a35b458]571
[5f0f29ce]572 /* Do zone merging */
[b0c2075]573 zone_merge_internal(z1, z2, &old_z1, (void *) PA2KA(PFN2ADDR(pfn)));
[a35b458]574
[bb68433]575 /* Subtract zone information from busy frames */
[5f0f29ce]576 zones.info[z1].busy_count -= cframes;
[a35b458]577
[5f0f29ce]578 /* Free old zone information */
579 return_config_frames(z1,
580 ADDR2PFN(KA2PA((uintptr_t) old_z1.frames)), old_z1.count);
581 return_config_frames(z1,
582 ADDR2PFN(KA2PA((uintptr_t) zones.info[z2].frames)),
583 zones.info[z2].count);
[a35b458]584
[e49e234]585 /* Move zones down */
[b0c2075]586 for (size_t i = z2 + 1; i < zones.count; i++)
[b6b576c]587 zones.info[i - 1] = zones.info[i];
[a35b458]588
[bb68433]589 zones.count--;
[a35b458]590
[bb68433]591errout:
[da1bafb]592 irq_spinlock_unlock(&zones.lock, true);
[a35b458]593
[5f0f29ce]594 return ret;
[bb68433]595}
596
[5f0f29ce]597/** Merge all mergeable zones into one big zone.
598 *
599 * It is reasonable to do this on systems where
600 * BIOS reports parts in chunks, so that we could
601 * have 1 zone (it's faster).
[bb68433]602 *
603 */
604void zone_merge_all(void)
605{
[b0c2075]606 size_t i = 1;
[a35b458]607
[5f0f29ce]608 while (i < zones.count) {
[b0c2075]609 if (!zone_merge(i - 1, i))
[5f0f29ce]610 i++;
[bb68433]611 }
612}
613
[deaf8d5]614/** Create new frame zone.
[085d973]615 *
[b0c2075]616 * @param zone Zone to construct.
617 * @param start Physical address of the first frame within the zone.
618 * @param count Count of frames in zone.
619 * @param flags Zone flags.
620 * @param confdata Configuration data of the zone.
[5f0f29ce]621 *
622 * @return Initialized zone.
[085d973]623 *
624 */
[b0c2075]625NO_TRACE static void zone_construct(zone_t *zone, pfn_t start, size_t count,
626 zone_flags_t flags, void *confdata)
[085d973]627{
[5f0f29ce]628 zone->base = start;
629 zone->count = count;
630 zone->flags = flags;
631 zone->free_count = count;
632 zone->busy_count = 0;
[a35b458]633
[e6c4b94]634 if (flags & ZONE_AVAILABLE) {
[5f0f29ce]635 /*
[b0c2075]636 * Initialize frame bitmap (located after the array of
637 * frame_t structures in the configuration space).
[5f0f29ce]638 */
[a35b458]639
[c5396c1]640 bitmap_initialize(&zone->bitmap, count, confdata +
641 (sizeof(frame_t) * count));
[adb252c0]642 bitmap_clear_range(&zone->bitmap, 0, count);
[a35b458]643
[b0c2075]644 /*
645 * Initialize the array of frame_t structures.
646 */
[a35b458]647
[b0c2075]648 zone->frames = (frame_t *) confdata;
[a35b458]649
[b0c2075]650 for (size_t i = 0; i < count; i++)
651 frame_initialize(&zone->frames[i]);
652 } else {
[c5396c1]653 bitmap_initialize(&zone->bitmap, 0, NULL);
[5f0f29ce]654 zone->frames = NULL;
[b0c2075]655 }
[085d973]656}
657
[deaf8d5]658/** Compute configuration data size for zone.
[eb3d379]659 *
[5f0f29ce]660 * @param count Size of zone in frames.
661 *
662 * @return Size of zone configuration info (in bytes).
663 *
[eb3d379]664 */
[bbfdf62]665size_t zone_conf_size(size_t count)
[085d973]666{
[c5396c1]667 return (count * sizeof(frame_t) + bitmap_size(count));
[085d973]668}
669
[8bdcffa]670/** Allocate external configuration frames from low memory. */
671pfn_t zone_external_conf_alloc(size_t count)
672{
[b0c2075]673 size_t frames = SIZE2FRAMES(zone_conf_size(count));
[a35b458]674
[b0c2075]675 return ADDR2PFN((uintptr_t)
676 frame_alloc(frames, FRAME_LOWMEM | FRAME_ATOMIC, 0));
[8bdcffa]677}
678
[deaf8d5]679/** Create and add zone to system.
[085d973]680 *
[5f0f29ce]681 * @param start First frame number (absolute).
682 * @param count Size of zone in frames.
683 * @param confframe Where configuration frames are supposed to be.
[b0c2075]684 * Automatically checks that we will not disturb the
[5f0f29ce]685 * kernel and possibly init. If confframe is given
686 * _outside_ this zone, it is expected, that the area is
687 * already marked BUSY and big enough to contain
688 * zone_conf_size() amount of data. If the confframe is
689 * inside the area, the zone free frame information is
690 * modified not to include it.
691 *
692 * @return Zone number or -1 on error.
693 *
[085d973]694 */
[da1bafb]695size_t zone_create(pfn_t start, size_t count, pfn_t confframe,
696 zone_flags_t flags)
[085d973]697{
[da1bafb]698 irq_spinlock_lock(&zones.lock, true);
[a35b458]699
[e6c4b94]700 if (flags & ZONE_AVAILABLE) { /* Create available zone */
[b0c2075]701 /*
702 * Theoretically we could have NULL here, practically make sure
[5f0f29ce]703 * nobody tries to do that. If some platform requires, remove
704 * the assert
705 */
[3bacee1]706 assert(confframe != ADDR2PFN((uintptr_t) NULL));
[a35b458]707
[40c8c17]708 /* Update the known end of physical memory. */
709 config.physmem_end = max(config.physmem_end, PFN2ADDR(start + count));
[a35b458]710
[b0c2075]711 /*
712 * If confframe is supposed to be inside our zone, then make sure
[5f0f29ce]713 * it does not span kernel & init
714 */
[98000fb]715 size_t confcount = SIZE2FRAMES(zone_conf_size(count));
[a35b458]716
[5f0f29ce]717 if ((confframe >= start) && (confframe < start + count)) {
718 for (; confframe < start + count; confframe++) {
719 uintptr_t addr = PFN2ADDR(confframe);
720 if (overlaps(addr, PFN2ADDR(confcount),
721 KA2PA(config.base), config.kernel_size))
722 continue;
[a35b458]723
[4638401]724 if (overlaps(addr, PFN2ADDR(confcount),
[5f0f29ce]725 KA2PA(config.stack_base), config.stack_size))
726 continue;
[a35b458]727
[5f0f29ce]728 bool overlap = false;
[b0c2075]729 for (size_t i = 0; i < init.cnt; i++) {
[5f0f29ce]730 if (overlaps(addr, PFN2ADDR(confcount),
[32817cc]731 init.tasks[i].paddr,
[5f0f29ce]732 init.tasks[i].size)) {
733 overlap = true;
734 break;
735 }
[b0c2075]736 }
[a35b458]737
[5f0f29ce]738 if (overlap)
739 continue;
[a35b458]740
[5f0f29ce]741 break;
742 }
[a35b458]743
[b0c2075]744 if (confframe >= start + count)
745 panic("Cannot find configuration data for zone.");
[085d973]746 }
[a35b458]747
[e2650d3]748 size_t znum = zones_insert_zone(start, count, flags);
[98000fb]749 if (znum == (size_t) -1) {
[da1bafb]750 irq_spinlock_unlock(&zones.lock, true);
[98000fb]751 return (size_t) -1;
[5f0f29ce]752 }
[a35b458]753
[b0c2075]754 void *confdata = (void *) PA2KA(PFN2ADDR(confframe));
755 zone_construct(&zones.info[znum], start, count, flags, confdata);
[a35b458]756
[5f0f29ce]757 /* If confdata in zone, mark as unavailable */
758 if ((confframe >= start) && (confframe < start + count)) {
[b0c2075]759 for (size_t i = confframe; i < confframe + confcount; i++)
[5f0f29ce]760 zone_mark_unavailable(&zones.info[znum],
761 i - zones.info[znum].base);
[085d973]762 }
[a35b458]763
[da1bafb]764 irq_spinlock_unlock(&zones.lock, true);
[a35b458]765
[5f0f29ce]766 return znum;
767 }
[a35b458]768
[5f0f29ce]769 /* Non-available zone */
[e2650d3]770 size_t znum = zones_insert_zone(start, count, flags);
[98000fb]771 if (znum == (size_t) -1) {
[da1bafb]772 irq_spinlock_unlock(&zones.lock, true);
[98000fb]773 return (size_t) -1;
[5f0f29ce]774 }
[a35b458]775
[b0c2075]776 zone_construct(&zones.info[znum], start, count, flags, NULL);
[a35b458]777
[da1bafb]778 irq_spinlock_unlock(&zones.lock, true);
[a35b458]779
[bb68433]780 return znum;
[085d973]781}
782
[5f0f29ce]783/*******************/
[085d973]784/* Frame functions */
[5f0f29ce]785/*******************/
[085d973]786
[deaf8d5]787/** Set parent of frame. */
[98000fb]788void frame_set_parent(pfn_t pfn, void *data, size_t hint)
[085d973]789{
[da1bafb]790 irq_spinlock_lock(&zones.lock, true);
[a35b458]791
[98000fb]792 size_t znum = find_zone(pfn, 1, hint);
[a35b458]793
[63e27ef]794 assert(znum != (size_t) -1);
[a35b458]795
[5f0f29ce]796 zone_get_frame(&zones.info[znum],
797 pfn - zones.info[znum].base)->parent = data;
[a35b458]798
[da1bafb]799 irq_spinlock_unlock(&zones.lock, true);
[085d973]800}
801
[98000fb]802void *frame_get_parent(pfn_t pfn, size_t hint)
[085d973]803{
[da1bafb]804 irq_spinlock_lock(&zones.lock, true);
[a35b458]805
[98000fb]806 size_t znum = find_zone(pfn, 1, hint);
[a35b458]807
[63e27ef]808 assert(znum != (size_t) -1);
[a35b458]809
[5f0f29ce]810 void *res = zone_get_frame(&zones.info[znum],
811 pfn - zones.info[znum].base)->parent;
[a35b458]812
[da1bafb]813 irq_spinlock_unlock(&zones.lock, true);
[a35b458]814
[085d973]815 return res;
816}
817
[482f968]818static size_t try_find_zone(size_t count, bool lowmem,
819 pfn_t frame_constraint, size_t hint)
820{
821 if (!lowmem) {
822 size_t znum = find_free_zone(count,
823 ZONE_HIGHMEM | ZONE_AVAILABLE, frame_constraint, hint);
824 if (znum != (size_t) -1)
825 return znum;
826 }
827
828 return find_free_zone(count, ZONE_LOWMEM | ZONE_AVAILABLE,
829 frame_constraint, hint);
830}
831
[b0c2075]832/** Allocate frames of physical memory.
[085d973]833 *
[b0c2075]834 * @param count Number of continuous frames to allocate.
835 * @param flags Flags for host zone selection and address processing.
836 * @param constraint Indication of physical address bits that cannot be
837 * set in the address of the first allocated frame.
838 * @param pzone Preferred zone.
[085d973]839 *
[5f0f29ce]840 * @return Physical address of the allocated frame.
[9a68b34d]841 *
[085d973]842 */
[b0c2075]843uintptr_t frame_alloc_generic(size_t count, frame_flags_t flags,
[8cbf1c3]844 uintptr_t constraint, size_t *pzone)
[085d973]845{
[63e27ef]846 assert(count > 0);
[a35b458]847
[98000fb]848 size_t hint = pzone ? (*pzone) : 0;
[b0c2075]849 pfn_t frame_constraint = ADDR2PFN(constraint);
[a35b458]850
[89bcb520]851 /*
852 * If not told otherwise, we must first reserve the memory.
853 */
[b0c2075]854 if (!(flags & FRAME_NO_RESERVE))
855 reserve_force_alloc(count);
[a35b458]856
[085d973]857loop:
[da1bafb]858 irq_spinlock_lock(&zones.lock, true);
[a35b458]859
[482f968]860 // TODO: Print diagnostic if neither is explicitly specified.
861 bool lowmem = (flags & FRAME_LOWMEM) || !(flags & FRAME_HIGHMEM);
862
[085d973]863 /*
864 * First, find suitable frame zone.
865 */
[482f968]866 size_t znum = try_find_zone(count, lowmem, frame_constraint, hint);
[a35b458]867
[b0c2075]868 /*
869 * If no memory, reclaim some slab memory,
870 * if it does not help, reclaim all.
871 */
[98000fb]872 if ((znum == (size_t) -1) && (!(flags & FRAME_NO_RECLAIM))) {
[da1bafb]873 irq_spinlock_unlock(&zones.lock, true);
[98000fb]874 size_t freed = slab_reclaim(0);
[da1bafb]875 irq_spinlock_lock(&zones.lock, true);
[a35b458]876
[5f0f29ce]877 if (freed > 0)
[482f968]878 znum = try_find_zone(count, lowmem,
[b0c2075]879 frame_constraint, hint);
[a35b458]880
[98000fb]881 if (znum == (size_t) -1) {
[da1bafb]882 irq_spinlock_unlock(&zones.lock, true);
[085d973]883 freed = slab_reclaim(SLAB_RECLAIM_ALL);
[da1bafb]884 irq_spinlock_lock(&zones.lock, true);
[a35b458]885
[5f0f29ce]886 if (freed > 0)
[482f968]887 znum = try_find_zone(count, lowmem,
[b0c2075]888 frame_constraint, hint);
[085d973]889 }
890 }
[a35b458]891
[98000fb]892 if (znum == (size_t) -1) {
[1a1744e]893 if (flags & FRAME_ATOMIC) {
[da1bafb]894 irq_spinlock_unlock(&zones.lock, true);
[a35b458]895
[89bcb520]896 if (!(flags & FRAME_NO_RESERVE))
[b0c2075]897 reserve_free(count);
[a35b458]898
[8cbf1c3]899 return 0;
[1a1744e]900 }
[a35b458]901
[8d308b9]902 size_t avail = frame_total_free_get_internal();
[a35b458]903
[da1bafb]904 irq_spinlock_unlock(&zones.lock, true);
[a35b458]905
[05411e8]906 if (!THREAD)
[adb252c0]907 panic("Cannot wait for %zu frames to become available "
908 "(%zu available).", count, avail);
[a35b458]909
[5f0f29ce]910 /*
911 * Sleep until some frames are available again.
912 */
[a35b458]913
[5f0f29ce]914#ifdef CONFIG_DEBUG
[b2fa1204]915 log(LF_OTHER, LVL_DEBUG,
916 "Thread %" PRIu64 " waiting for %zu frames "
917 "%zu available.", THREAD->tid, count, avail);
[5f0f29ce]918#endif
[a35b458]919
[905721b]920 /*
[b0c2075]921 * Since the mem_avail_mtx is an active mutex, we need to
922 * disable interrupts to prevent deadlock with TLB shootdown.
[905721b]923 */
924 ipl_t ipl = interrupts_disable();
[1bb3766]925 mutex_lock(&mem_avail_mtx);
[a35b458]926
[5f0f29ce]927 if (mem_avail_req > 0)
[b0c2075]928 mem_avail_req = min(mem_avail_req, count);
[5f0f29ce]929 else
[b0c2075]930 mem_avail_req = count;
[a35b458]931
[98000fb]932 size_t gen = mem_avail_gen;
[a35b458]933
[5f0f29ce]934 while (gen == mem_avail_gen)
[1bb3766]935 condvar_wait(&mem_avail_cv, &mem_avail_mtx);
[a35b458]936
[1bb3766]937 mutex_unlock(&mem_avail_mtx);
[905721b]938 interrupts_restore(ipl);
[a35b458]939
[1a1744e]940#ifdef CONFIG_DEBUG
[b2fa1204]941 log(LF_OTHER, LVL_DEBUG, "Thread %" PRIu64 " woken up.",
942 THREAD->tid);
[1a1744e]943#endif
[a35b458]944
[085d973]945 goto loop;
946 }
[a35b458]947
[b0c2075]948 pfn_t pfn = zone_frame_alloc(&zones.info[znum], count,
949 frame_constraint) + zones.info[znum].base;
[a35b458]950
[da1bafb]951 irq_spinlock_unlock(&zones.lock, true);
[a35b458]952
[5f0f29ce]953 if (pzone)
954 *pzone = znum;
[a35b458]955
[8cbf1c3]956 return PFN2ADDR(pfn);
[085d973]957}
958
[b0c2075]959uintptr_t frame_alloc(size_t count, frame_flags_t flags, uintptr_t constraint)
[0139747]960{
[b0c2075]961 return frame_alloc_generic(count, flags, constraint, NULL);
[0139747]962}
963
[5df1963]964/** Free frames of physical memory.
[085d973]965 *
[5df1963]966 * Find respective frame structures for supplied physical frames.
967 * Decrement each frame reference count. If it drops to zero, mark
968 * the frames as available.
[5f0f29ce]969 *
[5df1963]970 * @param start Physical Address of the first frame to be freed.
971 * @param count Number of frames to free.
[c32e6bc]972 * @param flags Flags to control memory reservation.
[085d973]973 *
974 */
[5df1963]975void frame_free_generic(uintptr_t start, size_t count, frame_flags_t flags)
[085d973]976{
[5df1963]977 size_t freed = 0;
[a35b458]978
[5df1963]979 irq_spinlock_lock(&zones.lock, true);
[a35b458]980
[5df1963]981 for (size_t i = 0; i < count; i++) {
982 /*
983 * First, find host frame zone for addr.
984 */
985 pfn_t pfn = ADDR2PFN(start) + i;
986 size_t znum = find_zone(pfn, 1, 0);
[a35b458]987
[63e27ef]988 assert(znum != (size_t) -1);
[a35b458]989
[5df1963]990 freed += zone_frame_free(&zones.info[znum],
991 pfn - zones.info[znum].base);
992 }
[a35b458]993
[da1bafb]994 irq_spinlock_unlock(&zones.lock, true);
[a35b458]995
[1a1744e]996 /*
997 * Signal that some memory has been freed.
[5df1963]998 * Since the mem_avail_mtx is an active mutex,
999 * we need to disable interruptsto prevent deadlock
1000 * with TLB shootdown.
[905721b]1001 */
[a35b458]1002
[905721b]1003 ipl_t ipl = interrupts_disable();
[1bb3766]1004 mutex_lock(&mem_avail_mtx);
[a35b458]1005
[5f0f29ce]1006 if (mem_avail_req > 0)
[5df1963]1007 mem_avail_req -= min(mem_avail_req, freed);
[a35b458]1008
[5f0f29ce]1009 if (mem_avail_req == 0) {
1010 mem_avail_gen++;
1011 condvar_broadcast(&mem_avail_cv);
1012 }
[a35b458]1013
[1bb3766]1014 mutex_unlock(&mem_avail_mtx);
[905721b]1015 interrupts_restore(ipl);
[a35b458]1016
[89bcb520]1017 if (!(flags & FRAME_NO_RESERVE))
[5df1963]1018 reserve_free(freed);
[085d973]1019}
1020
[5df1963]1021void frame_free(uintptr_t frame, size_t count)
[c32e6bc]1022{
[5df1963]1023 frame_free_generic(frame, count, 0);
[c32e6bc]1024}
1025
[5df1963]1026void frame_free_noreserve(uintptr_t frame, size_t count)
[e608cbe]1027{
[5df1963]1028 frame_free_generic(frame, count, FRAME_NO_RESERVE);
[e608cbe]1029}
1030
[f3ac636]1031/** Add reference to frame.
1032 *
1033 * Find respective frame structure for supplied PFN and
1034 * increment frame reference count.
1035 *
[5f0f29ce]1036 * @param pfn Frame number of the frame to be freed.
1037 *
[f3ac636]1038 */
[97bdb4a]1039NO_TRACE void frame_reference_add(pfn_t pfn)
[f3ac636]1040{
[da1bafb]1041 irq_spinlock_lock(&zones.lock, true);
[a35b458]1042
[f3ac636]1043 /*
1044 * First, find host frame zone for addr.
1045 */
[0b4a67a]1046 size_t znum = find_zone(pfn, 1, 0);
[a35b458]1047
[63e27ef]1048 assert(znum != (size_t) -1);
[a35b458]1049
[5f0f29ce]1050 zones.info[znum].frames[pfn - zones.info[znum].base].refcount++;
[a35b458]1051
[da1bafb]1052 irq_spinlock_unlock(&zones.lock, true);
[f3ac636]1053}
[085d973]1054
[da1bafb]1055/** Mark given range unavailable in frame zones.
1056 *
1057 */
[97bdb4a]1058NO_TRACE void frame_mark_unavailable(pfn_t start, size_t count)
[085d973]1059{
[da1bafb]1060 irq_spinlock_lock(&zones.lock, true);
[a35b458]1061
[b0c2075]1062 for (size_t i = 0; i < count; i++) {
[98000fb]1063 size_t znum = find_zone(start + i, 1, 0);
[a35b458]1064
[98000fb]1065 if (znum == (size_t) -1) /* PFN not found */
[085d973]1066 continue;
[a35b458]1067
[5f0f29ce]1068 zone_mark_unavailable(&zones.info[znum],
1069 start + i - zones.info[znum].base);
[085d973]1070 }
[a35b458]1071
[da1bafb]1072 irq_spinlock_unlock(&zones.lock, true);
[085d973]1073}
1074
[da1bafb]1075/** Initialize physical memory management.
1076 *
1077 */
[085d973]1078void frame_init(void)
1079{
1080 if (config.cpu_active == 1) {
1081 zones.count = 0;
[da1bafb]1082 irq_spinlock_initialize(&zones.lock, "frame.zones.lock");
[1bb3766]1083 mutex_initialize(&mem_avail_mtx, MUTEX_ACTIVE);
1084 condvar_initialize(&mem_avail_cv);
[085d973]1085 }
[a35b458]1086
[085d973]1087 /* Tell the architecture to create some memory */
[ddcc8a0]1088 frame_low_arch_init();
[a35b458]1089
[085d973]1090 if (config.cpu_active == 1) {
[4638401]1091 frame_mark_unavailable(ADDR2PFN(KA2PA(config.base)),
1092 SIZE2FRAMES(config.kernel_size));
1093 frame_mark_unavailable(ADDR2PFN(KA2PA(config.stack_base)),
1094 SIZE2FRAMES(config.stack_size));
[a35b458]1095
[b0c2075]1096 for (size_t i = 0; i < init.cnt; i++)
1097 frame_mark_unavailable(ADDR2PFN(init.tasks[i].paddr),
[4638401]1098 SIZE2FRAMES(init.tasks[i].size));
[a35b458]1099
[61e90dd]1100 if (ballocs.size)
[4638401]1101 frame_mark_unavailable(ADDR2PFN(KA2PA(ballocs.base)),
1102 SIZE2FRAMES(ballocs.size));
[a35b458]1103
[b0c2075]1104 /*
1105 * Blacklist first frame, as allocating NULL would
[5f0f29ce]1106 * fail in some places
1107 */
[bffa0b06]1108 frame_mark_unavailable(0, 1);
[085d973]1109 }
[a35b458]1110
[ddcc8a0]1111 frame_high_arch_init();
[085d973]1112}
1113
[ad12b5ea]1114/** Adjust bounds of physical memory region according to low/high memory split.
1115 *
[b0c2075]1116 * @param low[in] If true, the adjustment is performed to make the region
1117 * fit in the low memory. Otherwise the adjustment is
1118 * performed to make the region fit in the high memory.
1119 * @param basep[inout] Pointer to a variable which contains the region's base
1120 * address and which may receive the adjusted base address.
1121 * @param sizep[inout] Pointer to a variable which contains the region's size
1122 * and which may receive the adjusted size.
1123 *
1124 * @return True if the region still exists even after the adjustment.
1125 * @return False otherwise.
1126 *
[ad12b5ea]1127 */
1128bool frame_adjust_zone_bounds(bool low, uintptr_t *basep, size_t *sizep)
1129{
[2cc7f16]1130 uintptr_t limit = KA2PA(config.identity_base) + config.identity_size;
[a35b458]1131
[ad12b5ea]1132 if (low) {
1133 if (*basep > limit)
1134 return false;
[a35b458]1135
[ad12b5ea]1136 if (*basep + *sizep > limit)
1137 *sizep = limit - *basep;
1138 } else {
1139 if (*basep + *sizep <= limit)
1140 return false;
[a35b458]1141
[ad12b5ea]1142 if (*basep <= limit) {
1143 *sizep -= limit - *basep;
1144 *basep = limit;
1145 }
1146 }
[a35b458]1147
[ad12b5ea]1148 return true;
1149}
1150
[da1bafb]1151/** Return total size of all zones.
1152 *
1153 */
[9dae191e]1154uint64_t zones_total_size(void)
[deaf8d5]1155{
[da1bafb]1156 irq_spinlock_lock(&zones.lock, true);
[a35b458]1157
[5f0f29ce]1158 uint64_t total = 0;
[a35b458]1159
[b0c2075]1160 for (size_t i = 0; i < zones.count; i++)
[5f0f29ce]1161 total += (uint64_t) FRAMES2SIZE(zones.info[i].count);
[a35b458]1162
[da1bafb]1163 irq_spinlock_unlock(&zones.lock, true);
[a35b458]1164
[71eef11]1165 return total;
1166}
1167
[9dae191e]1168void zones_stats(uint64_t *total, uint64_t *unavail, uint64_t *busy,
1169 uint64_t *free)
[516adce]1170{
[63e27ef]1171 assert(total != NULL);
1172 assert(unavail != NULL);
1173 assert(busy != NULL);
1174 assert(free != NULL);
[a35b458]1175
[da1bafb]1176 irq_spinlock_lock(&zones.lock, true);
[a35b458]1177
[9dae191e]1178 *total = 0;
1179 *unavail = 0;
1180 *busy = 0;
1181 *free = 0;
[a35b458]1182
[b0c2075]1183 for (size_t i = 0; i < zones.count; i++) {
[9dae191e]1184 *total += (uint64_t) FRAMES2SIZE(zones.info[i].count);
[a35b458]1185
[e6c4b94]1186 if (zones.info[i].flags & ZONE_AVAILABLE) {
[9dae191e]1187 *busy += (uint64_t) FRAMES2SIZE(zones.info[i].busy_count);
1188 *free += (uint64_t) FRAMES2SIZE(zones.info[i].free_count);
1189 } else
1190 *unavail += (uint64_t) FRAMES2SIZE(zones.info[i].count);
[516adce]1191 }
[a35b458]1192
[da1bafb]1193 irq_spinlock_unlock(&zones.lock, true);
[516adce]1194}
1195
[da1bafb]1196/** Prints list of zones.
1197 *
1198 */
[9dae191e]1199void zones_print_list(void)
[deaf8d5]1200{
[5f0f29ce]1201#ifdef __32_BITS__
[74c5a1ca]1202 printf("[nr] [base addr] [frames ] [flags ] [free frames ] [busy frames ]\n");
[2b8b0ca]1203#endif
1204
1205#ifdef __64_BITS__
[74c5a1ca]1206 printf("[nr] [base address ] [frames ] [flags ] [free frames ] [busy frames ]\n");
[2b8b0ca]1207#endif
[a35b458]1208
[000350f8]1209 /*
1210 * Because printing may require allocation of memory, we may not hold
[f72906c]1211 * the frame allocator locks when printing zone statistics. Therefore,
[000350f8]1212 * we simply gather the statistics under the protection of the locks and
1213 * print the statistics when the locks have been released.
1214 *
1215 * When someone adds/removes zones while we are printing the statistics,
1216 * we may end up with inaccurate output (e.g. a zone being skipped from
1217 * the listing).
1218 */
[a35b458]1219
[f72906c]1220 size_t free_lowmem = 0;
1221 size_t free_highmem = 0;
1222 size_t free_highprio = 0;
[a35b458]1223
[3bacee1]1224 for (size_t i = 0; ; i++) {
[da1bafb]1225 irq_spinlock_lock(&zones.lock, true);
[a35b458]1226
[000350f8]1227 if (i >= zones.count) {
[da1bafb]1228 irq_spinlock_unlock(&zones.lock, true);
[000350f8]1229 break;
1230 }
[a35b458]1231
[f72906c]1232 pfn_t fbase = zones.info[i].base;
1233 uintptr_t base = PFN2ADDR(fbase);
[98000fb]1234 size_t count = zones.info[i].count;
[5f0f29ce]1235 zone_flags_t flags = zones.info[i].flags;
[98000fb]1236 size_t free_count = zones.info[i].free_count;
1237 size_t busy_count = zones.info[i].busy_count;
[a35b458]1238
[e6c4b94]1239 bool available = ((flags & ZONE_AVAILABLE) != 0);
[f72906c]1240 bool lowmem = ((flags & ZONE_LOWMEM) != 0);
1241 bool highmem = ((flags & ZONE_HIGHMEM) != 0);
1242 bool highprio = is_high_priority(fbase, count);
[a35b458]1243
[f72906c]1244 if (available) {
1245 if (lowmem)
1246 free_lowmem += free_count;
[a35b458]1247
[f72906c]1248 if (highmem)
1249 free_highmem += free_count;
[a35b458]1250
[f72906c]1251 if (highprio) {
1252 free_highprio += free_count;
1253 } else {
1254 /*
1255 * Walk all frames of the zone and examine
1256 * all high priority memory to get accurate
1257 * statistics.
1258 */
[a35b458]1259
[f72906c]1260 for (size_t index = 0; index < count; index++) {
1261 if (is_high_priority(fbase + index, 0)) {
1262 if (!bitmap_get(&zones.info[i].bitmap, index))
1263 free_highprio++;
1264 } else
1265 break;
1266 }
1267 }
1268 }
[a35b458]1269
[f72906c]1270 irq_spinlock_unlock(&zones.lock, true);
[a35b458]1271
[7e752b2]1272 printf("%-4zu", i);
[a35b458]1273
[2b8b0ca]1274#ifdef __32_BITS__
[7e752b2]1275 printf(" %p", (void *) base);
[2b8b0ca]1276#endif
[a35b458]1277
[2b8b0ca]1278#ifdef __64_BITS__
[7e752b2]1279 printf(" %p", (void *) base);
[e49e234]1280#endif
[a35b458]1281
[e6c4b94]1282 printf(" %12zu %c%c%c%c%c ", count,
1283 available ? 'A' : '-',
1284 (flags & ZONE_RESERVED) ? 'R' : '-',
1285 (flags & ZONE_FIRMWARE) ? 'F' : '-',
1286 (flags & ZONE_LOWMEM) ? 'L' : '-',
1287 (flags & ZONE_HIGHMEM) ? 'H' : '-');
[a35b458]1288
[5f0f29ce]1289 if (available)
[7e752b2]1290 printf("%14zu %14zu",
[5f0f29ce]1291 free_count, busy_count);
[a35b458]1292
[5f0f29ce]1293 printf("\n");
[dfd9186]1294 }
[a35b458]1295
[f72906c]1296 printf("\n");
[a35b458]1297
[f72906c]1298 uint64_t size;
1299 const char *size_suffix;
[a35b458]1300
[f72906c]1301 bin_order_suffix(FRAMES2SIZE(free_lowmem), &size, &size_suffix,
1302 false);
1303 printf("Available low memory: %zu frames (%" PRIu64 " %s)\n",
1304 free_lowmem, size, size_suffix);
[a35b458]1305
[f72906c]1306 bin_order_suffix(FRAMES2SIZE(free_highmem), &size, &size_suffix,
1307 false);
1308 printf("Available high memory: %zu frames (%" PRIu64 " %s)\n",
1309 free_highmem, size, size_suffix);
[a35b458]1310
[f72906c]1311 bin_order_suffix(FRAMES2SIZE(free_highprio), &size, &size_suffix,
1312 false);
1313 printf("Available high priority: %zu frames (%" PRIu64 " %s)\n",
1314 free_highprio, size, size_suffix);
[dfd9186]1315}
1316
[abbc16e]1317/** Prints zone details.
[96cacc1]1318 *
[5f0f29ce]1319 * @param num Zone base address or zone number.
1320 *
[96cacc1]1321 */
[98000fb]1322void zone_print_one(size_t num)
[deaf8d5]1323{
[da1bafb]1324 irq_spinlock_lock(&zones.lock, true);
[98000fb]1325 size_t znum = (size_t) -1;
[a35b458]1326
[b0c2075]1327 for (size_t i = 0; i < zones.count; i++) {
[5f0f29ce]1328 if ((i == num) || (PFN2ADDR(zones.info[i].base) == num)) {
1329 znum = i;
[bb68433]1330 break;
1331 }
1332 }
[a35b458]1333
[98000fb]1334 if (znum == (size_t) -1) {
[da1bafb]1335 irq_spinlock_unlock(&zones.lock, true);
[bb68433]1336 printf("Zone not found.\n");
[2ec725f]1337 return;
[dfd9186]1338 }
[a35b458]1339
[f72906c]1340 size_t free_lowmem = 0;
1341 size_t free_highmem = 0;
1342 size_t free_highprio = 0;
[a35b458]1343
[f72906c]1344 pfn_t fbase = zones.info[znum].base;
1345 uintptr_t base = PFN2ADDR(fbase);
[b0c2075]1346 zone_flags_t flags = zones.info[znum].flags;
1347 size_t count = zones.info[znum].count;
1348 size_t free_count = zones.info[znum].free_count;
1349 size_t busy_count = zones.info[znum].busy_count;
[a35b458]1350
[e6c4b94]1351 bool available = ((flags & ZONE_AVAILABLE) != 0);
[f72906c]1352 bool lowmem = ((flags & ZONE_LOWMEM) != 0);
1353 bool highmem = ((flags & ZONE_HIGHMEM) != 0);
1354 bool highprio = is_high_priority(fbase, count);
[a35b458]1355
[f72906c]1356 if (available) {
1357 if (lowmem)
1358 free_lowmem = free_count;
[a35b458]1359
[f72906c]1360 if (highmem)
1361 free_highmem = free_count;
[a35b458]1362
[f72906c]1363 if (highprio) {
1364 free_highprio = free_count;
1365 } else {
1366 /*
1367 * Walk all frames of the zone and examine
1368 * all high priority memory to get accurate
1369 * statistics.
1370 */
[a35b458]1371
[f72906c]1372 for (size_t index = 0; index < count; index++) {
1373 if (is_high_priority(fbase + index, 0)) {
1374 if (!bitmap_get(&zones.info[znum].bitmap, index))
1375 free_highprio++;
1376 } else
1377 break;
1378 }
1379 }
1380 }
[a35b458]1381
[f72906c]1382 irq_spinlock_unlock(&zones.lock, true);
[a35b458]1383
[933cadf]1384 uint64_t size;
1385 const char *size_suffix;
[a35b458]1386
[933cadf]1387 bin_order_suffix(FRAMES2SIZE(count), &size, &size_suffix, false);
[a35b458]1388
[f72906c]1389 printf("Zone number: %zu\n", znum);
1390 printf("Zone base address: %p\n", (void *) base);
1391 printf("Zone size: %zu frames (%" PRIu64 " %s)\n", count,
[933cadf]1392 size, size_suffix);
[f72906c]1393 printf("Zone flags: %c%c%c%c%c\n",
[e6c4b94]1394 available ? 'A' : '-',
1395 (flags & ZONE_RESERVED) ? 'R' : '-',
1396 (flags & ZONE_FIRMWARE) ? 'F' : '-',
1397 (flags & ZONE_LOWMEM) ? 'L' : '-',
1398 (flags & ZONE_HIGHMEM) ? 'H' : '-');
[a35b458]1399
[5f0f29ce]1400 if (available) {
[933cadf]1401 bin_order_suffix(FRAMES2SIZE(busy_count), &size, &size_suffix,
1402 false);
[f72906c]1403 printf("Allocated space: %zu frames (%" PRIu64 " %s)\n",
[933cadf]1404 busy_count, size, size_suffix);
[a35b458]1405
[933cadf]1406 bin_order_suffix(FRAMES2SIZE(free_count), &size, &size_suffix,
1407 false);
[f72906c]1408 printf("Available space: %zu frames (%" PRIu64 " %s)\n",
[933cadf]1409 free_count, size, size_suffix);
[a35b458]1410
[f72906c]1411 bin_order_suffix(FRAMES2SIZE(free_lowmem), &size, &size_suffix,
1412 false);
1413 printf("Available low memory: %zu frames (%" PRIu64 " %s)\n",
1414 free_lowmem, size, size_suffix);
[a35b458]1415
[f72906c]1416 bin_order_suffix(FRAMES2SIZE(free_highmem), &size, &size_suffix,
1417 false);
1418 printf("Available high memory: %zu frames (%" PRIu64 " %s)\n",
1419 free_highmem, size, size_suffix);
[a35b458]1420
[f72906c]1421 bin_order_suffix(FRAMES2SIZE(free_highprio), &size, &size_suffix,
1422 false);
1423 printf("Available high priority: %zu frames (%" PRIu64 " %s)\n",
1424 free_highprio, size, size_suffix);
[5f0f29ce]1425 }
[dfd9186]1426}
1427
[cc73a8a1]1428/** @}
[b45c443]1429 */
Note: See TracBrowser for help on using the repository browser.