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 | #include <debug.h>
|
---|
45 |
|
---|
46 | static bool reserve_initialized = false;
|
---|
47 |
|
---|
48 | IRQ_SPINLOCK_STATIC_INITIALIZE_NAME(reserve_lock, "reserve_lock");
|
---|
49 | static ssize_t reserve = 0;
|
---|
50 |
|
---|
51 | /** Initialize memory reservations tracking.
|
---|
52 | *
|
---|
53 | * This function must be called after frame zones are created and merged
|
---|
54 | * and before any address space area is created.
|
---|
55 | */
|
---|
56 | void reserve_init(void)
|
---|
57 | {
|
---|
58 | reserve = frame_total_free_get();
|
---|
59 | reserve_initialized = true;
|
---|
60 | }
|
---|
61 |
|
---|
62 | /** Try to reserve memory.
|
---|
63 | *
|
---|
64 | * This function may not be called from contexts that do not allow memory
|
---|
65 | * reclaiming, such as some invocations of frame_alloc_generic().
|
---|
66 | *
|
---|
67 | * @param size Number of frames to reserve.
|
---|
68 | * @return True on success or false otherwise.
|
---|
69 | */
|
---|
70 | bool reserve_try_alloc(size_t size)
|
---|
71 | {
|
---|
72 | bool reserved = false;
|
---|
73 |
|
---|
74 | ASSERT(reserve_initialized);
|
---|
75 |
|
---|
76 | irq_spinlock_lock(&reserve_lock, true);
|
---|
77 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
78 | reserve -= size;
|
---|
79 | reserved = true;
|
---|
80 | } else {
|
---|
81 | /*
|
---|
82 | * Some reservable frames may be cached by the slab allocator.
|
---|
83 | * Try to reclaim some reservable memory. Try to be gentle for
|
---|
84 | * the first time. If it does not help, try to reclaim
|
---|
85 | * everything.
|
---|
86 | */
|
---|
87 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
88 | slab_reclaim(0);
|
---|
89 | irq_spinlock_lock(&reserve_lock, true);
|
---|
90 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
91 | reserve -= size;
|
---|
92 | reserved = true;
|
---|
93 | } else {
|
---|
94 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
95 | slab_reclaim(SLAB_RECLAIM_ALL);
|
---|
96 | irq_spinlock_lock(&reserve_lock, true);
|
---|
97 | if (reserve >= 0 && (size_t) reserve >= size) {
|
---|
98 | reserve -= size;
|
---|
99 | reserved = true;
|
---|
100 | }
|
---|
101 | }
|
---|
102 | }
|
---|
103 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
104 |
|
---|
105 | return reserved;
|
---|
106 | }
|
---|
107 |
|
---|
108 | /** Reserve memory.
|
---|
109 | *
|
---|
110 | * This function simply marks the respective amount of memory frames reserved.
|
---|
111 | * It does not implement any sort of blocking for the case there is not enough
|
---|
112 | * reservable memory. It will simply take the reserve into negative numbers and
|
---|
113 | * leave the blocking up to the allocation phase.
|
---|
114 | *
|
---|
115 | * @param size Number of frames to reserve.
|
---|
116 | */
|
---|
117 | void reserve_force_alloc(size_t size)
|
---|
118 | {
|
---|
119 | if (!reserve_initialized)
|
---|
120 | return;
|
---|
121 |
|
---|
122 | irq_spinlock_lock(&reserve_lock, true);
|
---|
123 | reserve -= size;
|
---|
124 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
125 | }
|
---|
126 |
|
---|
127 | /** Unreserve memory.
|
---|
128 | *
|
---|
129 | * @param size Number of frames to unreserve.
|
---|
130 | */
|
---|
131 | void reserve_free(size_t size)
|
---|
132 | {
|
---|
133 | if (!reserve_initialized)
|
---|
134 | return;
|
---|
135 |
|
---|
136 | irq_spinlock_lock(&reserve_lock, true);
|
---|
137 | reserve += size;
|
---|
138 | irq_spinlock_unlock(&reserve_lock, true);
|
---|
139 | }
|
---|
140 |
|
---|
141 | /** @}
|
---|
142 | */
|
---|