1 | /*␊ |
2 | * Copyright (c) 1999-2003 Apple Computer, Inc. All rights reserved.␊ |
3 | *␊ |
4 | * @APPLE_LICENSE_HEADER_START@␊ |
5 | * ␊ |
6 | * Portions Copyright (c) 1999-2003 Apple Computer, Inc. All Rights␊ |
7 | * Reserved. This file contains Original Code and/or Modifications of␊ |
8 | * Original Code as defined in and that are subject to the Apple Public␊ |
9 | * Source License Version 2.0 (the "License"). You may not use this file␊ |
10 | * except in compliance with the License. Please obtain a copy of the␊ |
11 | * License at http://www.apple.com/publicsource and read it before using␊ |
12 | * this file.␊ |
13 | * ␊ |
14 | * The Original Code and all software distributed under the License are␊ |
15 | * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER␊ |
16 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,␊ |
17 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,␊ |
18 | * FITNESS FOR A PARTICULAR PURPOSE OR NON- INFRINGEMENT. Please see the␊ |
19 | * License for the specific language governing rights and limitations␊ |
20 | * under the License.␊ |
21 | * ␊ |
22 | * @APPLE_LICENSE_HEADER_END@␊ |
23 | */␊ |
24 | /*␊ |
25 | * Copyright 1993 NeXT Computer, Inc.␊ |
26 | * All rights reserved.␊ |
27 | *␊ |
28 | * Sam's simple memory allocator.␊ |
29 | *␊ |
30 | */␊ |
31 | ␊ |
32 | #include "libsa.h"␊ |
33 | //#include "saio_internal.h" - Azi: needed for ZDEBUG (printf)␊ |
34 | #include "memory.h"␊ |
35 | ␊ |
36 | #define ZDEBUG 0 //Azi: booter doesn't load with this enabled; instant reboot at "boot1: ..."␊ |
37 | ␊ |
38 | #if ZDEBUG␊ |
39 | int zout;␊ |
40 | #endif␊ |
41 | ␊ |
42 | typedef struct {␊ |
43 | ␉char * start;␊ |
44 | ␉size_t size;␊ |
45 | } zmem;␊ |
46 | ␊ |
47 | static zmem * zalloced;␊ |
48 | static zmem * zavailable;␊ |
49 | static short availableNodes, allocedNodes, totalNodes;␊ |
50 | static char * zalloc_base;␊ |
51 | static char * zalloc_end;␊ |
52 | static void (*zerror)(char *, size_t, const char *, int);␊ |
53 | ␊ |
54 | static void zallocate(char * start,int size);␊ |
55 | static void zinsert(zmem * zp, int ndx);␊ |
56 | static void zdelete(zmem * zp, int ndx);␊ |
57 | static void zcoalesce(void);␊ |
58 | ␊ |
59 | #if ZDEBUG␊ |
60 | ␉size_t zalloced_size;␊ |
61 | #endif␊ |
62 | ␊ |
63 | #define ZALLOC_NODES␉32767 /* was 16384 */␊ |
64 | ␊ |
65 | static void malloc_error(char *addr, size_t size, const char *file, int line)␊ |
66 | {␊ |
67 | #ifdef i386␊ |
68 | ␉asm volatile ("hlt");␊ |
69 | #endif␊ |
70 | }␊ |
71 | ␊ |
72 | // define the block of memory that the allocator will use␊ |
73 | void malloc_init(char * start, int size, int nodes, void (*malloc_err_fn)(char *, size_t, const char *, int))␊ |
74 | {␊ |
75 | ␉zalloc_base = start ? start : (char *)ZALLOC_ADDR;␊ |
76 | ␉totalNodes = nodes ? nodes : ZALLOC_NODES;␊ |
77 | ␉zalloced = (zmem *) zalloc_base;␊ |
78 | ␉zavailable = (zmem *) (zalloc_base + sizeof(zmem) * totalNodes);␊ |
79 | ␉zavailable[0].start = (char *)zavailable + sizeof(zmem) * totalNodes;␊ |
80 | ␊ |
81 | ␉if (size == 0)␊ |
82 | ␉{␊ |
83 | ␉␉size = ZALLOC_LEN;␊ |
84 | ␉}␊ |
85 | ␊ |
86 | ␉zavailable[0].size = size - (zavailable[0].start - zalloc_base);␊ |
87 | ␉zalloc_end = zalloc_base + size;␊ |
88 | ␉availableNodes = 1;␊ |
89 | ␉allocedNodes = 0;␊ |
90 | ␉zerror = malloc_err_fn ? malloc_err_fn : malloc_error;␊ |
91 | }␊ |
92 | ␊ |
93 | #define BEST_FIT 1␊ |
94 | ␊ |
95 | void * safe_malloc(size_t size, const char *file, int line)␊ |
96 | {␊ |
97 | ␉int i;␊ |
98 | #if BEST_FIT␊ |
99 | ␉int bestFit;␊ |
100 | ␉size_t smallestSize;␊ |
101 | #endif␊ |
102 | ␉char * ret = 0;␊ |
103 | ␊ |
104 | ␉if ( !zalloc_base )␊ |
105 | ␉{␊ |
106 | ␉␉// this used to follow the bss but some bios' corrupted it...␊ |
107 | ␉␉malloc_init((char *)ZALLOC_ADDR, ZALLOC_LEN, ZALLOC_NODES, malloc_error);␊ |
108 | ␉}␊ |
109 | ␊ |
110 | ␉size = ((size + 0xf) & ~0xf);␊ |
111 | ␊ |
112 | ␉if (size == 0)␊ |
113 | ␉{␊ |
114 | ␉␉if (zerror)␊ |
115 | ␉␉{␊ |
116 | ␉␉␉(*zerror)((char *)0xdeadbeef, 0, file, line);␊ |
117 | ␉}␊ |
118 | }␊ |
119 | #if BEST_FIT␊ |
120 | ␉smallestSize = 0;␊ |
121 | ␉bestFit = -1;␊ |
122 | #endif␊ |
123 | ␊ |
124 | ␉for (i = 0; i < availableNodes; i++)␊ |
125 | ␉{␊ |
126 | ␉␉// find node with equal size, or if not found,␊ |
127 | // then smallest node that fits.␊ |
128 | ␉␉if (zavailable[i].size == size)␊ |
129 | ␉␉{␊ |
130 | ␉␉␉zallocate(ret = zavailable[i].start, size);␊ |
131 | ␉␉␉zdelete(zavailable, i); availableNodes--;␊ |
132 | ␉␉␉goto done;␊ |
133 | ␉␉}␊ |
134 | #if BEST_FIT␊ |
135 | ␉␉else {␊ |
136 | ␉␉␉if ((zavailable[i].size > size) && ((smallestSize == 0) || (zavailable[i].size < smallestSize))) {␊ |
137 | ␉␉␉␉bestFit = i;␊ |
138 | ␉␉␉␉smallestSize = zavailable[i].size;␊ |
139 | ␉␉␉}␊ |
140 | ␉␉}␊ |
141 | #else␊ |
142 | ␉␉else if (zavailable[i].size > size)␊ |
143 | ␉␉{␊ |
144 | ␉␉␉zallocate(ret = zavailable[i].start, size);␊ |
145 | ␉␉␉zavailable[i].start += size;␊ |
146 | ␉␉␉zavailable[i].size -= size;␊ |
147 | ␉␉␉goto done;␊ |
148 | ␉␉}␊ |
149 | #endif␊ |
150 | ␉}␊ |
151 | #if BEST_FIT␊ |
152 | ␉if (bestFit != -1) {␊ |
153 | ␉␉zallocate(ret = zavailable[bestFit].start, size);␊ |
154 | ␉␉zavailable[bestFit].start += size;␊ |
155 | ␉␉zavailable[bestFit].size -= size;␊ |
156 | ␉}␊ |
157 | #endif␊ |
158 | ␊ |
159 | done:␊ |
160 | ␉if ((ret == 0) || (ret + size >= zalloc_end))␊ |
161 | ␉{␊ |
162 | ␉␉if (zerror)␊ |
163 | ␉␉{␊ |
164 | ␉␉␉(*zerror)(ret, size, file, line);␊ |
165 | ␉␉}␊ |
166 | ␉}␊ |
167 | ␊ |
168 | ␉if (ret != 0)␊ |
169 | ␉{␊ |
170 | ␉␉bzero(ret, size);␊ |
171 | ␉}␊ |
172 | #if ZDEBUG␊ |
173 | ␉zalloced_size += size;␊ |
174 | #endif␊ |
175 | ␉return (void *) ret;␊ |
176 | }␊ |
177 | ␊ |
178 | void free(void * pointer)␊ |
179 | {␊ |
180 | ␉unsigned long rp;␊ |
181 | ␉int i, found = 0;␊ |
182 | ␉size_t tsize = 0;␊ |
183 | ␉char * start = pointer;␊ |
184 | ␊ |
185 | #if i386 ␊ |
186 | ␉// Get return address of our caller,␊ |
187 | ␉// in case we have to report an error below.␊ |
188 | ␉asm volatile ("movl %%esp, %%eax\n\t"␊ |
189 | "subl $4, %%eax\n\t"␊ |
190 | "movl 0(%%eax), %%eax" : "=a" (rp));␊ |
191 | #else␊ |
192 | rp = 0;␊ |
193 | #endif␊ |
194 | ␊ |
195 | ␉if (!start)␊ |
196 | ␉{␊ |
197 | ␉␉return;␊ |
198 | ␉}␊ |
199 | ␊ |
200 | ␉for (i = 0; i < allocedNodes; i++)␊ |
201 | ␉{␊ |
202 | ␉␉if (zalloced[i].start == start)␊ |
203 | ␉␉{␊ |
204 | ␉␉␉tsize = zalloced[i].size;␊ |
205 | #if ZDEBUG␊ |
206 | ␉␉␉zout -= tsize;␊ |
207 | ␉␉␉printf(" zz out %d\n", zout);␊ |
208 | #endif␊ |
209 | ␉␉␉zdelete(zalloced, i); allocedNodes--;␊ |
210 | ␉␉␉found = 1;␊ |
211 | #if ZDEBUG␊ |
212 | ␉␉␉memset(pointer, 0x5A, tsize);␊ |
213 | #endif␊ |
214 | ␉␉␉break;␊ |
215 | ␉␉}␊ |
216 | ␉}␊ |
217 | ␉if (!found)␊ |
218 | ␉{␊ |
219 | ␉␉if (zerror)␊ |
220 | ␉␉{␊ |
221 | ␉␉␉(*zerror)(pointer, rp, "free", 0);␊ |
222 | ␉␉} else {␊ |
223 | ␉␉␉return;␊ |
224 | ␉␉}␊ |
225 | ␉}␊ |
226 | #if ZDEBUG␊ |
227 | zalloced_size -= tsize;␊ |
228 | #endif␊ |
229 | ␊ |
230 | ␉for (i = 0; i < availableNodes; i++)␊ |
231 | ␉{␊ |
232 | ␉␉if ((start + tsize) == zavailable[i].start) // merge it in␊ |
233 | ␉␉{␊ |
234 | ␉␉␉zavailable[i].start = start;␊ |
235 | ␉␉␉zavailable[i].size += tsize;␊ |
236 | ␉␉␉zcoalesce();␊ |
237 | ␉␉␉return;␊ |
238 | ␉␉}␊ |
239 | ␊ |
240 | ␉␉if ((i > 0) && (zavailable[i-1].start + zavailable[i-1].size == start))␊ |
241 | ␉␉{␊ |
242 | ␉␉␉zavailable[i-1].size += tsize;␊ |
243 | ␉␉␉zcoalesce();␊ |
244 | ␉␉␉return;␊ |
245 | ␉␉}␊ |
246 | ␊ |
247 | ␉␉if ((start + tsize) < zavailable[i].start)␊ |
248 | ␉␉{␊ |
249 | if (++availableNodes > totalNodes)␊ |
250 | ␉␉␉{␊ |
251 | ␉␉␉␉if (zerror)␊ |
252 | ␉␉␉␉{␊ |
253 | ␉␉␉␉␉(*zerror)((char *)0xf000f000, 0, "free", 0);␊ |
254 | ␉␉␉␉}␊ |
255 | ␉␉␉}␊ |
256 | ␉␉␉zinsert(zavailable, i); ␊ |
257 | ␉␉␉zavailable[i].start = start;␊ |
258 | ␉␉␉zavailable[i].size = tsize;␊ |
259 | ␉␉␉return;␊ |
260 | ␉␉}␊ |
261 | ␉}␊ |
262 | ␊ |
263 | ␉if (++availableNodes > totalNodes)␊ |
264 | ␉{␊ |
265 | ␉␉if (zerror)␊ |
266 | ␉␉{␊ |
267 | ␉␉␉(*zerror)((char *)0xf000f000, 1, "free", 0);␊ |
268 | ␉␉}␊ |
269 | ␉}␊ |
270 | ␉zavailable[i].start = start;␊ |
271 | ␉zavailable[i].size = tsize;␊ |
272 | ␉zcoalesce();␊ |
273 | ␊ |
274 | ␉return;␊ |
275 | }␊ |
276 | ␊ |
277 | static void␊ |
278 | zallocate(char * start,int size)␊ |
279 | {␊ |
280 | ␊ |
281 | #if ZDEBUG␊ |
282 | ␉zout += size;␊ |
283 | ␉printf(" alloc %d, total 0x%x\n",size,zout);␊ |
284 | #endif␊ |
285 | ␊ |
286 | ␉zalloced[allocedNodes].start = start;␊ |
287 | ␉zalloced[allocedNodes].size = size;␊ |
288 | ␊ |
289 | ␉if (++allocedNodes > totalNodes)␊ |
290 | ␉{␊ |
291 | ␉␉if (zerror)␊ |
292 | ␉␉{␊ |
293 | ␉␉␉(*zerror)((char *)0xf000f000, 2, "zallocate", 0);␊ |
294 | ␉␉}␊ |
295 | ␉};␊ |
296 | }␊ |
297 | ␊ |
298 | static void␊ |
299 | zinsert(zmem * zp, int ndx)␊ |
300 | {␊ |
301 | ␉int i;␊ |
302 | ␉zmem *z1, *z2;␊ |
303 | ␊ |
304 | ␉i = totalNodes-2;␊ |
305 | ␉z1 = zp + i;␊ |
306 | ␉z2 = z1 + 1;␊ |
307 | ␊ |
308 | ␉for (; i >= ndx; i--, z1--, z2--)␊ |
309 | ␉{␊ |
310 | ␉␉*z2 = *z1;␊ |
311 | ␉}␊ |
312 | }␊ |
313 | ␊ |
314 | static void␊ |
315 | zdelete(zmem * zp, int ndx)␊ |
316 | {␊ |
317 | ␉int i;␊ |
318 | ␉zmem *z1, *z2;␊ |
319 | ␊ |
320 | ␉z1 = zp + ndx;␊ |
321 | ␉z2 = z1 + 1;␊ |
322 | ␊ |
323 | ␉for (i = ndx; i < totalNodes - 1; i++, z1++, z2++)␊ |
324 | ␉{␊ |
325 | ␉␉*z1 = *z2;␊ |
326 | ␉}␊ |
327 | }␊ |
328 | ␊ |
329 | static void␊ |
330 | zcoalesce(void)␊ |
331 | {␊ |
332 | ␉int i;␊ |
333 | ␊ |
334 | ␉for (i = 0; i < availableNodes-1; i++)␊ |
335 | ␉{␊ |
336 | ␉␉if ( zavailable[i].start + zavailable[i].size == zavailable[i + 1].start )␊ |
337 | ␉␉{␊ |
338 | ␉␉␉zavailable[i].size += zavailable[i + 1].size;␊ |
339 | ␉␉␉zdelete(zavailable, i + 1); availableNodes--;␊ |
340 | ␉␉␉return;␊ |
341 | ␉␉}␊ |
342 | ␉}␉␊ |
343 | }␊ |
344 | ␊ |
345 | /* This is the simplest way possible. Should fix this. */␊ |
346 | void * realloc(void * start, size_t newsize)␊ |
347 | {␊ |
348 | void * newstart = safe_malloc(newsize, __FILE__, __LINE__);␊ |
349 | bcopy(start, newstart, newsize);␊ |
350 | free(start);␊ |
351 | return newstart;␊ |
352 | }␊ |
353 | |