| 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>
|
|---|
| 40 | #include <mm/slab.h>
|
|---|
| 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;
|
|---|
| 47 |
|
|---|
| 48 | /** Try to reserve memory.
|
|---|
| 49 | *
|
|---|
| 50 | * This function may not be called from contexts that do not allow memory
|
|---|
| 51 | * reclaiming, such as some invocations of frame_alloc_generic().
|
|---|
| 52 | *
|
|---|
| 53 | * @param size Number of frames to reserve.
|
|---|
| 54 | * @return True on success or false otherwise.
|
|---|
| 55 | */
|
|---|
| 56 | bool reserve_try_alloc(size_t size)
|
|---|
| 57 | {
|
|---|
| 58 | bool reserved = false;
|
|---|
| 59 |
|
|---|
| 60 | irq_spinlock_lock(&reserve_lock, true);
|
|---|
| 61 | if (reserve >= 0 && (size_t) reserve >= size) {
|
|---|
| 62 | reserve -= size;
|
|---|
| 63 | reserved = true;
|
|---|
| 64 | } else {
|
|---|
| 65 | /*
|
|---|
| 66 | * Some reservable frames may be cached by the slab allocator.
|
|---|
| 67 | * Try to reclaim some reservable memory. Try to be gentle for
|
|---|
| 68 | * the first time. If it does not help, try to reclaim
|
|---|
| 69 | * everything.
|
|---|
| 70 | */
|
|---|
| 71 | irq_spinlock_unlock(&reserve_lock, true);
|
|---|
| 72 | slab_reclaim(0);
|
|---|
| 73 | irq_spinlock_lock(&reserve_lock, true);
|
|---|
| 74 | if (reserve >= 0 && (size_t) reserve >= size) {
|
|---|
| 75 | reserve -= size;
|
|---|
| 76 | reserved = true;
|
|---|
| 77 | } else {
|
|---|
| 78 | irq_spinlock_unlock(&reserve_lock, true);
|
|---|
| 79 | slab_reclaim(SLAB_RECLAIM_ALL);
|
|---|
| 80 | irq_spinlock_lock(&reserve_lock, true);
|
|---|
| 81 | if (reserve >= 0 && (size_t) reserve >= size) {
|
|---|
| 82 | reserve -= size;
|
|---|
| 83 | reserved = true;
|
|---|
| 84 | }
|
|---|
| 85 | }
|
|---|
| 86 | }
|
|---|
| 87 | irq_spinlock_unlock(&reserve_lock, true);
|
|---|
| 88 |
|
|---|
| 89 | return reserved;
|
|---|
| 90 | }
|
|---|
| 91 |
|
|---|
| 92 | /** Reserve memory.
|
|---|
| 93 | *
|
|---|
| 94 | * This function simply marks the respective amount of memory frames reserved.
|
|---|
| 95 | * It does not implement any sort of blocking for the case there is not enough
|
|---|
| 96 | * reservable memory. It will simply take the reserve into negative numbers and
|
|---|
| 97 | * leave the blocking up to the allocation phase.
|
|---|
| 98 | *
|
|---|
| 99 | * @param size Number of frames to reserve.
|
|---|
| 100 | */
|
|---|
| 101 | void reserve_force_alloc(size_t size)
|
|---|
| 102 | {
|
|---|
| 103 | irq_spinlock_lock(&reserve_lock, true);
|
|---|
| 104 | reserve -= size;
|
|---|
| 105 | irq_spinlock_unlock(&reserve_lock, true);
|
|---|
| 106 | }
|
|---|
| 107 |
|
|---|
| 108 | /** Unreserve memory.
|
|---|
| 109 | *
|
|---|
| 110 | * @param size Number of frames to unreserve.
|
|---|
| 111 | */
|
|---|
| 112 | void reserve_free(size_t size)
|
|---|
| 113 | {
|
|---|
| 114 | irq_spinlock_lock(&reserve_lock, true);
|
|---|
| 115 | reserve += size;
|
|---|
| 116 | irq_spinlock_unlock(&reserve_lock, true);
|
|---|
| 117 | }
|
|---|
| 118 |
|
|---|
| 119 | /** @}
|
|---|
| 120 | */
|
|---|