source: mainline/kernel/generic/src/mm/frame.c@ 64f3d3b

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since 64f3d3b was 64f3d3b, checked in by Martin Decky <martin@…>, 12 years ago

basic optimizations of the bitmap allocator
(still not using the 2nd level bitmap)

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