[630a8ef] | 1 | /*
|
---|
| 2 | * Copyright (c) 2011 Jakub Jermar
|
---|
| 3 | * All rights reserved.
|
---|
| 4 | *
|
---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
---|
| 6 | * modification, are permitted provided that the following conditions
|
---|
| 7 | * are met:
|
---|
| 8 | *
|
---|
| 9 | * - Redistributions of source code must retain the above copyright
|
---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 13 | * documentation and/or other materials provided with the distribution.
|
---|
| 14 | * - The name of the author may not be used to endorse or promote products
|
---|
| 15 | * derived from this software without specific prior written permission.
|
---|
| 16 | *
|
---|
| 17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
| 18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
| 23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
| 24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
| 25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 27 | */
|
---|
| 28 |
|
---|
| 29 | /** @addtogroup genericmm
|
---|
| 30 | * @{
|
---|
| 31 | */
|
---|
| 32 |
|
---|
| 33 | /**
|
---|
| 34 | * @file
|
---|
| 35 | * @brief Memory reservations.
|
---|
| 36 | */
|
---|
| 37 |
|
---|
| 38 | #include <mm/reserve.h>
|
---|
| 39 | #include <mm/frame.h>
|
---|
[010be476] | 40 | #include <mm/slab.h>
|
---|
[e17f703] | 41 | #include <synch/spinlock.h>
|
---|
| 42 | #include <typedefs.h>
|
---|
| 43 | #include <arch/types.h>
|
---|
| 44 |
|
---|
| 45 | IRQ_SPINLOCK_STATIC_INITIALIZE_NAME(reserve_lock, "reserve_lock");
|
---|
| 46 | static ssize_t reserve = 0;
|
---|
[630a8ef] | 47 |
|
---|
[8d308b9] | 48 | /** Initialize memory reservations tracking.
|
---|
| 49 | *
|
---|
| 50 | * This function must be called after frame zones are created and merged
|
---|
| 51 | * and before any address space area is created.
|
---|
| 52 | */
|
---|
| 53 | void reserve_init(void)
|
---|
| 54 | {
|
---|
| 55 | reserve = frame_total_free_get();
|
---|
| 56 | }
|
---|
| 57 |
|
---|
[010be476] | 58 | /** Try to reserve memory.
|
---|
| 59 | *
|
---|
| 60 | * This function may not be called from contexts that do not allow memory
|
---|
| 61 | * reclaiming, such as some invocations of frame_alloc_generic().
|
---|
| 62 | *
|
---|
| 63 | * @param size Number of frames to reserve.
|
---|
| 64 | * @return True on success or false otherwise.
|
---|
| 65 | */
|
---|
[630a8ef] | 66 | bool reserve_try_alloc(size_t size)
|
---|
| 67 | {
|
---|
[e17f703] | 68 | bool reserved = false;
|
---|
| 69 |
|
---|
| 70 | irq_spinlock_lock(&reserve_lock, true);
|
---|
| 71 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
| 72 | reserve -= size;
|
---|
| 73 | reserved = true;
|
---|
[010be476] | 74 | } else {
|
---|
| 75 | /*
|
---|
| 76 | * Some reservable frames may be cached by the slab allocator.
|
---|
| 77 | * Try to reclaim some reservable memory. Try to be gentle for
|
---|
| 78 | * the first time. If it does not help, try to reclaim
|
---|
| 79 | * everything.
|
---|
| 80 | */
|
---|
| 81 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
| 82 | slab_reclaim(0);
|
---|
| 83 | irq_spinlock_lock(&reserve_lock, true);
|
---|
| 84 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
| 85 | reserve -= size;
|
---|
| 86 | reserved = true;
|
---|
| 87 | } else {
|
---|
| 88 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
| 89 | slab_reclaim(SLAB_RECLAIM_ALL);
|
---|
| 90 | irq_spinlock_lock(&reserve_lock, true);
|
---|
| 91 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
| 92 | reserve -= size;
|
---|
| 93 | reserved = true;
|
---|
| 94 | }
|
---|
| 95 | }
|
---|
[e17f703] | 96 | }
|
---|
| 97 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
| 98 |
|
---|
| 99 | return reserved;
|
---|
[630a8ef] | 100 | }
|
---|
| 101 |
|
---|
[010be476] | 102 | /** Reserve memory.
|
---|
| 103 | *
|
---|
| 104 | * This function simply marks the respective amount of memory frames reserved.
|
---|
| 105 | * It does not implement any sort of blocking for the case there is not enough
|
---|
| 106 | * reservable memory. It will simply take the reserve into negative numbers and
|
---|
| 107 | * leave the blocking up to the allocation phase.
|
---|
| 108 | *
|
---|
| 109 | * @param size Number of frames to reserve.
|
---|
| 110 | */
|
---|
[630a8ef] | 111 | void reserve_force_alloc(size_t size)
|
---|
| 112 | {
|
---|
[e17f703] | 113 | irq_spinlock_lock(&reserve_lock, true);
|
---|
| 114 | reserve -= size;
|
---|
| 115 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
[630a8ef] | 116 | }
|
---|
| 117 |
|
---|
[010be476] | 118 | /** Unreserve memory.
|
---|
| 119 | *
|
---|
| 120 | * @param size Number of frames to unreserve.
|
---|
| 121 | */
|
---|
[630a8ef] | 122 | void reserve_free(size_t size)
|
---|
| 123 | {
|
---|
[e17f703] | 124 | irq_spinlock_lock(&reserve_lock, true);
|
---|
| 125 | reserve += size;
|
---|
| 126 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
[630a8ef] | 127 | }
|
---|
| 128 |
|
---|
| 129 | /** @}
|
---|
| 130 | */
|
---|