Rev 533 | Rev 683 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 533 | Rev 534 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (C) 2005 Jakub Jermar |
2 | * Copyright (C) 2005 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
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 |
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. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
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 |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
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 |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
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 |
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. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | #include <mm/buddy.h> |
29 | #include <mm/buddy.h> |
30 | #include <mm/frame.h> |
30 | #include <mm/frame.h> |
31 | #include <mm/heap.h> |
31 | #include <mm/heap.h> |
32 | #include <arch/types.h> |
32 | #include <arch/types.h> |
33 | #include <typedefs.h> |
33 | #include <typedefs.h> |
34 | #include <list.h> |
34 | #include <list.h> |
35 | #include <debug.h> |
35 | #include <debug.h> |
36 | #include <print.h> |
36 | #include <print.h> |
37 | 37 | ||
38 | /** Create buddy system |
38 | /** Create buddy system |
39 | * |
39 | * |
40 | * Allocate memory for and initialize new buddy system. |
40 | * Allocate memory for and initialize new buddy system. |
41 | * |
41 | * |
42 | * @param max_order The biggest allocable size will be 2^max_order. |
42 | * @param max_order The biggest allocable size will be 2^max_order. |
43 | * @param op Operations for new buddy system. |
43 | * @param op Operations for new buddy system. |
44 | * @param data Pointer to be used by implementation. |
44 | * @param data Pointer to be used by implementation. |
45 | * |
45 | * |
46 | * @return New buddy system. |
46 | * @return New buddy system. |
47 | */ |
47 | */ |
48 | buddy_system_t *buddy_system_create(__u8 max_order, buddy_system_operations_t *op, void *data) |
48 | buddy_system_t *buddy_system_create(__u8 max_order, buddy_system_operations_t *op, void *data) |
49 | { |
49 | { |
50 | buddy_system_t *b; |
50 | buddy_system_t *b; |
51 | int i; |
51 | int i; |
52 | 52 | ||
53 | ASSERT(max_order < BUDDY_SYSTEM_INNER_BLOCK); |
53 | ASSERT(max_order < BUDDY_SYSTEM_INNER_BLOCK); |
54 | 54 | ||
55 | ASSERT(op->find_buddy); |
55 | ASSERT(op->find_buddy); |
56 | ASSERT(op->set_order); |
56 | ASSERT(op->set_order); |
57 | ASSERT(op->get_order); |
57 | ASSERT(op->get_order); |
58 | ASSERT(op->bisect); |
58 | ASSERT(op->bisect); |
59 | ASSERT(op->coalesce); |
59 | ASSERT(op->coalesce); |
60 | ASSERT(op->mark_busy); |
60 | ASSERT(op->mark_busy); |
61 | 61 | ||
62 | /* |
62 | /* |
63 | * Allocate memory for structure describing the whole buddy system. |
63 | * Allocate memory for structure describing the whole buddy system. |
64 | */ |
64 | */ |
65 | b = (buddy_system_t *) early_malloc(sizeof(buddy_system_t)); |
65 | b = (buddy_system_t *) early_malloc(sizeof(buddy_system_t)); |
66 | 66 | ||
67 | if (b) { |
67 | if (b) { |
68 | /* |
68 | /* |
69 | * Allocate memory for all orders this buddy system will work with. |
69 | * Allocate memory for all orders this buddy system will work with. |
70 | */ |
70 | */ |
71 | b->order = (link_t *) early_malloc(max_order * sizeof(link_t)); |
71 | b->order = (link_t *) early_malloc(max_order * sizeof(link_t)); |
72 | if (!b->order) { |
72 | if (!b->order) { |
73 | early_free(b); |
73 | early_free(b); |
74 | return NULL; |
74 | return NULL; |
75 | } |
75 | } |
76 | 76 | ||
77 | for (i = 0; i < max_order; i++) |
77 | for (i = 0; i < max_order; i++) |
78 | list_initialize(&b->order[i]); |
78 | list_initialize(&b->order[i]); |
79 | 79 | ||
80 | b->max_order = max_order; |
80 | b->max_order = max_order; |
81 | b->op = op; |
81 | b->op = op; |
82 | b->data = data; |
82 | b->data = data; |
83 | } |
83 | } |
84 | 84 | ||
85 | return b; |
85 | return b; |
86 | } |
86 | } |
87 | 87 | ||
88 | /** Check if buddy system can allocate block |
88 | /** Check if buddy system can allocate block |
89 | * |
89 | * |
90 | * @param b Buddy system pointer |
90 | * @param b Buddy system pointer |
91 | * @param i Size of the block (2^i) |
91 | * @param i Size of the block (2^i) |
92 | * |
92 | * |
93 | * @return True if block can be allocated |
93 | * @return True if block can be allocated |
94 | */ |
94 | */ |
95 | bool buddy_system_can_alloc(buddy_system_t *b, __u8 i) { |
95 | bool buddy_system_can_alloc(buddy_system_t *b, __u8 i) { |
96 | __u8 k; |
96 | __u8 k; |
97 | 97 | ||
98 | ASSERT(i < b->max_order); |
98 | ASSERT(i < b->max_order); |
99 | 99 | ||
100 | for (k=i; k < b->max_order; k++) { |
100 | for (k=i; k < b->max_order; k++) { |
101 | if (!list_empty(&b->order[k])) { |
101 | if (!list_empty(&b->order[k])) { |
102 | return true; |
102 | return true; |
103 | } |
103 | } |
104 | } |
104 | } |
105 | 105 | ||
106 | return false; |
106 | return false; |
107 | 107 | ||
108 | } |
108 | } |
109 | 109 | ||
110 | /** Allocate block from buddy system. |
110 | /** Allocate block from buddy system. |
111 | * |
111 | * |
112 | * @param b Buddy system pointer. |
112 | * @param b Buddy system pointer. |
113 | * @param i Returned block will be 2^i big. |
113 | * @param i Returned block will be 2^i big. |
114 | * |
114 | * |
115 | * @return Block of data represented by link_t. |
115 | * @return Block of data represented by link_t. |
116 | */ |
116 | */ |
117 | link_t *buddy_system_alloc(buddy_system_t *b, __u8 i) |
117 | link_t *buddy_system_alloc(buddy_system_t *b, __u8 i) |
118 | { |
118 | { |
119 | link_t *res, *hlp; |
119 | link_t *res, *hlp; |
120 | 120 | ||
121 | ASSERT(i < b->max_order); |
121 | ASSERT(i < b->max_order); |
122 | 122 | ||
123 | /* |
123 | /* |
124 | * If the list of order i is not empty, |
124 | * If the list of order i is not empty, |
125 | * the request can be immediatelly satisfied. |
125 | * the request can be immediatelly satisfied. |
126 | */ |
126 | */ |
127 | if (!list_empty(&b->order[i])) { |
127 | if (!list_empty(&b->order[i])) { |
128 | res = b->order[i].next; |
128 | res = b->order[i].next; |
129 | list_remove(res); |
129 | list_remove(res); |
130 | b->op->mark_busy(b, res); |
130 | b->op->mark_busy(b, res); |
131 | return res; |
131 | return res; |
132 | } |
132 | } |
133 | 133 | ||
134 | /* |
134 | /* |
135 | * If order i is already the maximal order, |
135 | * If order i is already the maximal order, |
136 | * the request cannot be satisfied. |
136 | * the request cannot be satisfied. |
137 | */ |
137 | */ |
138 | if (i == b->max_order - 1) |
138 | if (i == b->max_order - 1) |
139 | return NULL; |
139 | return NULL; |
140 | 140 | ||
141 | /* |
141 | /* |
142 | * Try to recursively satisfy the request from higher order lists. |
142 | * Try to recursively satisfy the request from higher order lists. |
143 | */ |
143 | */ |
144 | hlp = buddy_system_alloc(b, i + 1); |
144 | hlp = buddy_system_alloc(b, i + 1); |
145 | 145 | ||
146 | /* |
146 | /* |
147 | * The request could not be satisfied |
147 | * The request could not be satisfied |
148 | * from higher order lists. |
148 | * from higher order lists. |
149 | */ |
149 | */ |
150 | if (!hlp) |
150 | if (!hlp) |
151 | return NULL; |
151 | return NULL; |
152 | 152 | ||
153 | res = hlp; |
153 | res = hlp; |
154 | 154 | ||
155 | /* |
155 | /* |
156 | * Bisect the block and set order of both of its parts to i. |
156 | * Bisect the block and set order of both of its parts to i. |
157 | */ |
157 | */ |
158 | hlp = b->op->bisect(b, res); |
158 | hlp = b->op->bisect(b, res); |
159 | b->op->set_order(b, res, i); |
159 | b->op->set_order(b, res, i); |
160 | b->op->set_order(b, hlp, i); |
160 | b->op->set_order(b, hlp, i); |
161 | 161 | ||
162 | /* |
162 | /* |
163 | * Return the other half to buddy system. |
163 | * Return the other half to buddy system. |
164 | * PROBLEM!!!! FILL FIND OTHER PART AS BUDDY AND LINK TOGETHER |
164 | * PROBLEM!!!! FILL FIND OTHER PART AS BUDDY AND LINK TOGETHER |
165 | */ |
165 | */ |
166 | b->op->mark_busy(b, res); |
166 | b->op->mark_busy(b, res); |
167 | buddy_system_free(b, hlp); |
167 | buddy_system_free(b, hlp); |
168 | 168 | ||
169 | return res; |
169 | return res; |
170 | 170 | ||
171 | } |
171 | } |
172 | 172 | ||
173 | /** Return block to buddy system. |
173 | /** Return block to buddy system. |
174 | * |
174 | * |
175 | * @param b Buddy system pointer. |
175 | * @param b Buddy system pointer. |
176 | * @param block Block to return. |
176 | * @param block Block to return. |
177 | */ |
177 | */ |
178 | void buddy_system_free(buddy_system_t *b, link_t *block) |
178 | void buddy_system_free(buddy_system_t *b, link_t *block) |
179 | { |
179 | { |
180 | link_t *buddy, *hlp; |
180 | link_t *buddy, *hlp; |
181 | __u8 i; |
181 | __u8 i; |
182 | 182 | ||
183 | /* |
183 | /* |
184 | * Determine block's order. |
184 | * Determine block's order. |
185 | */ |
185 | */ |
186 | i = b->op->get_order(b, block); |
186 | i = b->op->get_order(b, block); |
187 | 187 | ||
188 | ASSERT(i < b->max_order); |
188 | ASSERT(i < b->max_order); |
189 | 189 | ||
190 | if (i != b->max_order - 1) { |
190 | if (i != b->max_order - 1) { |
191 | /* |
191 | /* |
192 | * See if there is any buddy in the list of order i. |
192 | * See if there is any buddy in the list of order i. |
193 | */ |
193 | */ |
194 | buddy = b->op->find_buddy(b, block); |
194 | buddy = b->op->find_buddy(b, block); |
195 | if (buddy) { |
195 | if (buddy) { |
196 | 196 | ||
197 | ASSERT(b->op->get_order(b, buddy) == i); |
197 | ASSERT(b->op->get_order(b, buddy) == i); |
198 | /* |
198 | /* |
199 | * Remove buddy from the list of order i. |
199 | * Remove buddy from the list of order i. |
200 | */ |
200 | */ |
201 | list_remove(buddy); |
201 | list_remove(buddy); |
202 | 202 | ||
203 | /* |
203 | /* |
204 | * Invalidate order of both block and buddy. |
204 | * Invalidate order of both block and buddy. |
205 | */ |
205 | */ |
206 | b->op->set_order(b, block, BUDDY_SYSTEM_INNER_BLOCK); |
206 | b->op->set_order(b, block, BUDDY_SYSTEM_INNER_BLOCK); |
207 | b->op->set_order(b, buddy, BUDDY_SYSTEM_INNER_BLOCK); |
207 | b->op->set_order(b, buddy, BUDDY_SYSTEM_INNER_BLOCK); |
208 | 208 | ||
209 | /* |
209 | /* |
210 | * Coalesce block and buddy into one block. |
210 | * Coalesce block and buddy into one block. |
211 | */ |
211 | */ |
212 | hlp = b->op->coalesce(b, block, buddy); |
212 | hlp = b->op->coalesce(b, block, buddy); |
213 | 213 | ||
214 | /* |
214 | /* |
215 | * Set order of the coalesced block to i + 1. |
215 | * Set order of the coalesced block to i + 1. |
216 | */ |
216 | */ |
217 | b->op->set_order(b, hlp, i + 1); |
217 | b->op->set_order(b, hlp, i + 1); |
218 | 218 | ||
219 | /* |
219 | /* |
220 | * Recursively add the coalesced block to the list of order i + 1. |
220 | * Recursively add the coalesced block to the list of order i + 1. |
221 | */ |
221 | */ |
222 | buddy_system_free(b, hlp); |
222 | buddy_system_free(b, hlp); |
223 | return; |
223 | return; |
224 | } |
224 | } |
225 | } |
225 | } |
226 | 226 | ||
227 | /* |
227 | /* |
228 | * Insert block into the list of order i. |
228 | * Insert block into the list of order i. |
229 | */ |
229 | */ |
230 | list_append(block, &b->order[i]); |
230 | list_append(block, &b->order[i]); |
231 | 231 | ||
232 | } |
232 | } |
233 | 233 |