alloc.c revision 1.5 1 1.5 christos /* $NetBSD: alloc.c,v 1.5 2011/05/19 03:09:47 christos Exp $ */
2 1.3 uwe
3 1.3 uwe /*-
4 1.3 uwe * Copyright (c) 1997 The NetBSD Foundation, Inc.
5 1.3 uwe * All rights reserved.
6 1.3 uwe *
7 1.3 uwe * This code is derived from software contributed to The NetBSD Foundation
8 1.3 uwe * by Jason R. Thorpe.
9 1.3 uwe *
10 1.3 uwe * Redistribution and use in source and binary forms, with or without
11 1.3 uwe * modification, are permitted provided that the following conditions
12 1.3 uwe * are met:
13 1.3 uwe * 1. Redistributions of source code must retain the above copyright
14 1.3 uwe * notice, this list of conditions and the following disclaimer.
15 1.3 uwe * 2. Redistributions in binary form must reproduce the above copyright
16 1.3 uwe * notice, this list of conditions and the following disclaimer in the
17 1.3 uwe * documentation and/or other materials provided with the distribution.
18 1.3 uwe *
19 1.3 uwe * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.3 uwe * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.3 uwe * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.3 uwe * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.3 uwe * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.3 uwe * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.3 uwe * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.3 uwe * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.3 uwe * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.3 uwe * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.3 uwe * POSSIBILITY OF SUCH DAMAGE.
30 1.3 uwe */
31 1.1 mrg
32 1.1 mrg /*
33 1.1 mrg * Copyright (c) 1997 Christopher G. Demetriou. All rights reserved.
34 1.1 mrg * Copyright (c) 1996
35 1.1 mrg * Matthias Drochner. All rights reserved.
36 1.1 mrg * Copyright (C) 1995, 1996 Wolfgang Solfrank.
37 1.1 mrg * Copyright (C) 1995, 1996 TooLs GmbH.
38 1.1 mrg * All rights reserved.
39 1.1 mrg *
40 1.1 mrg * Redistribution and use in source and binary forms, with or without
41 1.1 mrg * modification, are permitted provided that the following conditions
42 1.1 mrg * are met:
43 1.1 mrg * 1. Redistributions of source code must retain the above copyright
44 1.1 mrg * notice, this list of conditions and the following disclaimer.
45 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
46 1.1 mrg * notice, this list of conditions and the following disclaimer in the
47 1.1 mrg * documentation and/or other materials provided with the distribution.
48 1.1 mrg * 3. All advertising materials mentioning features or use of this software
49 1.1 mrg * must display the following acknowledgement:
50 1.1 mrg * This product includes software developed by TooLs GmbH.
51 1.1 mrg * 4. The name of TooLs GmbH may not be used to endorse or promote products
52 1.1 mrg * derived from this software without specific prior written permission.
53 1.1 mrg *
54 1.1 mrg * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
55 1.1 mrg * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
56 1.1 mrg * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
57 1.1 mrg * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
58 1.1 mrg * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
59 1.1 mrg * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
60 1.1 mrg * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
61 1.1 mrg * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
62 1.1 mrg * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
63 1.1 mrg * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
64 1.1 mrg */
65 1.1 mrg
66 1.1 mrg /*
67 1.1 mrg * Dynamic memory allocator suitable for use with OpenFirmware.
68 1.1 mrg *
69 1.1 mrg * Compile options:
70 1.1 mrg *
71 1.1 mrg * ALLOC_TRACE enable tracing of allocations/deallocations
72 1.1 mrg *
73 1.1 mrg * ALLOC_FIRST_FIT use a first-fit allocation algorithm, rather than
74 1.1 mrg * the default best-fit algorithm.
75 1.1 mrg *
76 1.1 mrg * DEBUG enable debugging sanity checks.
77 1.1 mrg */
78 1.1 mrg
79 1.1 mrg #include <sys/param.h>
80 1.1 mrg #include <sys/queue.h>
81 1.1 mrg
82 1.1 mrg #include <lib/libsa/stand.h>
83 1.1 mrg
84 1.1 mrg #include "openfirm.h"
85 1.5 christos #include "boot.h"
86 1.1 mrg
87 1.1 mrg /*
88 1.1 mrg * Each block actually has ALIGN(struct ml) + ALIGN(size) bytes allocated
89 1.1 mrg * to it, as follows:
90 1.1 mrg *
91 1.1 mrg * 0 ... (sizeof(struct ml) - 1)
92 1.1 mrg * allocated or unallocated: holds size of user-data part of block.
93 1.1 mrg *
94 1.1 mrg * sizeof(struct ml) ... (ALIGN(sizeof(struct ml)) - 1)
95 1.1 mrg * allocated: unused
96 1.1 mrg * unallocated: depends on packing of struct fl
97 1.1 mrg *
98 1.1 mrg * ALIGN(sizeof(struct ml)) ... (ALIGN(sizeof(struct ml)) +
99 1.1 mrg * ALIGN(data size) - 1)
100 1.1 mrg * allocated: user data
101 1.1 mrg * unallocated: depends on packing of struct fl
102 1.1 mrg *
103 1.1 mrg * 'next' is only used when the block is unallocated (i.e. on the free list).
104 1.1 mrg * However, note that ALIGN(sizeof(struct ml)) + ALIGN(data size) must
105 1.1 mrg * be at least 'sizeof(struct fl)', so that blocks can be used as structures
106 1.1 mrg * when on the free list.
107 1.1 mrg */
108 1.1 mrg
109 1.1 mrg /*
110 1.1 mrg * Memory lists.
111 1.1 mrg */
112 1.1 mrg struct ml {
113 1.1 mrg unsigned size;
114 1.1 mrg LIST_ENTRY(ml) list;
115 1.1 mrg };
116 1.1 mrg
117 1.1 mrg LIST_HEAD(, ml) freelist = LIST_HEAD_INITIALIZER(freelist);
118 1.1 mrg LIST_HEAD(, ml) allocatedlist = LIST_HEAD_INITIALIZER(allocatedlist);
119 1.1 mrg
120 1.1 mrg #define OVERHEAD ALIGN(sizeof (struct ml)) /* shorthand */
121 1.1 mrg
122 1.1 mrg void *
123 1.2 christos alloc(size_t size)
124 1.1 mrg {
125 1.1 mrg struct ml *f, *bestf;
126 1.3 uwe #ifndef ALLOC_FIRST_FIT
127 1.1 mrg unsigned bestsize = 0xffffffff; /* greater than any real size */
128 1.3 uwe #endif
129 1.1 mrg char *help;
130 1.1 mrg int failed;
131 1.1 mrg
132 1.1 mrg #ifdef ALLOC_TRACE
133 1.2 christos printf("alloc(%zu)", size);
134 1.1 mrg #endif
135 1.1 mrg
136 1.1 mrg /*
137 1.1 mrg * Account for overhead now, so that we don't get an
138 1.1 mrg * "exact fit" which doesn't have enough space.
139 1.1 mrg */
140 1.1 mrg size = ALIGN(size) + OVERHEAD;
141 1.1 mrg
142 1.1 mrg #ifdef ALLOC_FIRST_FIT
143 1.1 mrg /* scan freelist */
144 1.2 christos for (f = freelist.lh_first; f != NULL && (size_t)f->size < size;
145 1.1 mrg f = f->list.le_next)
146 1.1 mrg /* noop */ ;
147 1.1 mrg bestf = f;
148 1.3 uwe failed = (bestf == NULL);
149 1.1 mrg #else
150 1.1 mrg /* scan freelist */
151 1.3 uwe bestf = NULL; /* XXXGCC: -Wuninitialized */
152 1.1 mrg f = freelist.lh_first;
153 1.1 mrg while (f != NULL) {
154 1.2 christos if ((size_t)f->size >= size) {
155 1.2 christos if ((size_t)f->size == size) /* exact match */
156 1.1 mrg goto found;
157 1.1 mrg
158 1.1 mrg if (f->size < bestsize) {
159 1.1 mrg /* keep best fit */
160 1.1 mrg bestf = f;
161 1.1 mrg bestsize = f->size;
162 1.1 mrg }
163 1.1 mrg }
164 1.1 mrg f = f->list.le_next;
165 1.1 mrg }
166 1.1 mrg
167 1.1 mrg /* no match in freelist if bestsize unchanged */
168 1.1 mrg failed = (bestsize == 0xffffffff);
169 1.1 mrg #endif
170 1.1 mrg
171 1.1 mrg if (failed) { /* nothing found */
172 1.1 mrg /*
173 1.1 mrg * Allocate memory from the OpenFirmware, rounded
174 1.1 mrg * to page size, and record the chunk size.
175 1.1 mrg */
176 1.1 mrg size = roundup(size, NBPG);
177 1.3 uwe help = OF_claim(NULL, (unsigned)size, NBPG);
178 1.1 mrg if (help == (char *)-1)
179 1.1 mrg panic("alloc: out of memory");
180 1.1 mrg
181 1.1 mrg f = (struct ml *)help;
182 1.2 christos f->size = (unsigned)size;
183 1.1 mrg #ifdef ALLOC_TRACE
184 1.1 mrg printf("=%lx (new chunk size %u)\n",
185 1.1 mrg (u_long)(help + OVERHEAD), f->size);
186 1.1 mrg #endif
187 1.1 mrg goto out;
188 1.1 mrg }
189 1.1 mrg
190 1.1 mrg /* we take the best fit */
191 1.1 mrg f = bestf;
192 1.1 mrg
193 1.3 uwe #ifndef ALLOC_FIRST_FIT
194 1.1 mrg found:
195 1.3 uwe #endif
196 1.1 mrg /* remove from freelist */
197 1.1 mrg LIST_REMOVE(f, list);
198 1.1 mrg help = (char *)f;
199 1.1 mrg #ifdef ALLOC_TRACE
200 1.1 mrg printf("=%lx (origsize %u)\n", (u_long)(help + OVERHEAD), f->size);
201 1.1 mrg #endif
202 1.1 mrg out:
203 1.1 mrg /* place on allocated list */
204 1.1 mrg LIST_INSERT_HEAD(&allocatedlist, f, list);
205 1.1 mrg return (help + OVERHEAD);
206 1.1 mrg }
207 1.1 mrg
208 1.1 mrg void
209 1.3 uwe dealloc(void *ptr, size_t size)
210 1.1 mrg {
211 1.1 mrg register struct ml *a = (struct ml *)((char*)ptr - OVERHEAD);
212 1.1 mrg
213 1.1 mrg #ifdef ALLOC_TRACE
214 1.2 christos printf("dealloc(%lx, %zu) (origsize %u)\n", (u_long)ptr, size, a->size);
215 1.1 mrg #endif
216 1.1 mrg #ifdef DEBUG
217 1.2 christos if (size > (size_t)a->size)
218 1.2 christos printf("dealloc %zu bytes @%lx, should be <=%u\n",
219 1.1 mrg size, (u_long)ptr, a->size);
220 1.1 mrg #endif
221 1.1 mrg
222 1.1 mrg /* Remove from allocated list, place on freelist. */
223 1.1 mrg LIST_REMOVE(a, list);
224 1.1 mrg LIST_INSERT_HEAD(&freelist, a, list);
225 1.1 mrg }
226 1.1 mrg
227 1.1 mrg void
228 1.3 uwe freeall(void)
229 1.1 mrg {
230 1.1 mrg #ifdef __notyet__ /* Firmware bug ?! */
231 1.1 mrg struct ml *m;
232 1.1 mrg
233 1.1 mrg /* Release chunks on freelist... */
234 1.1 mrg while ((m = freelist.lh_first) != NULL) {
235 1.1 mrg LIST_REMOVE(m, list);
236 1.1 mrg OF_release(m, m->size);
237 1.1 mrg }
238 1.1 mrg
239 1.1 mrg /* ...and allocated list. */
240 1.1 mrg while ((m = allocatedlist.lh_first) != NULL) {
241 1.1 mrg LIST_REMOVE(m, list);
242 1.1 mrg OF_release(m, m->size);
243 1.1 mrg }
244 1.1 mrg #endif /* __notyet__ */
245 1.1 mrg }
246