1 |
< |
/* Copyright (c) 1991 Regents of the University of California */ |
1 |
> |
/* Copyright (c) 1992 Regents of the University of California */ |
2 |
|
|
3 |
|
#ifndef lint |
4 |
|
static char SCCSid[] = "$SunId$ LBL"; |
24 |
|
|
25 |
|
#include <errno.h> |
26 |
|
|
27 |
+ |
#ifndef BSD |
28 |
+ |
#define bcopy(s,d,n) (void)memcpy(d,s,n) |
29 |
+ |
#define bzero(d,n) (void)memset(d,0,n) |
30 |
+ |
#endif |
31 |
+ |
|
32 |
|
#ifdef MSTATS |
33 |
|
#include <stdio.h> |
34 |
< |
static unsigned b_nsbrked = 0; |
34 |
> |
static unsigned b_nsbrked = 0; |
35 |
|
static unsigned b_nalloced = 0; |
36 |
|
static unsigned b_nfreed = 0; |
37 |
|
static unsigned b_nscrounged = 0; |
70 |
|
|
71 |
|
static ALIGN dummy_mem; |
72 |
|
|
73 |
+ |
static char *memlim[2]; |
74 |
+ |
|
75 |
|
#define DUMMYLOC ((char *)&dummy_mem) |
76 |
|
|
77 |
+ |
#define BADPTR(p) ((p) < memlim[0] | (p) >= memlim[1]) |
78 |
+ |
|
79 |
|
#ifdef MCOMP /* memory compaction routines */ |
80 |
|
static char seedtab[1024]; /* seed for compaction table */ |
81 |
|
|
159 |
|
|
160 |
|
for ( ; ; ) { |
161 |
|
/* compact free lists */ |
162 |
< |
compactfree(); |
162 |
> |
while (compactfree()) |
163 |
> |
; |
164 |
|
/* find largest block */ |
165 |
|
tab = mtab(&cptab); tablen = mtablen(&cptab); |
166 |
|
big = tab; |
173 |
|
big->siz = 0; /* remove from table */ |
174 |
|
return(big->ptr); /* return it */ |
175 |
|
} |
176 |
< |
if (mtablen(big) < tablen+1) { |
176 |
> |
if (mtablen(big) <= tablen) { |
177 |
|
*np = 0; /* cannot grow table */ |
178 |
|
return(NULL); /* report failure */ |
179 |
|
} |
183 |
|
cptab.ptr = big->ptr; |
184 |
|
cptab.siz = big->siz; |
185 |
|
big->siz = 0; /* clear and copy */ |
176 |
– |
#ifdef BSD |
186 |
|
bcopy((char *)tab, (char *)(mtab(&cptab)+1), |
187 |
|
tablen*sizeof(struct mblk)); |
188 |
|
bzero((char *)(mtab(&cptab)+tablen+1), |
189 |
|
(mtablen(&cptab)-tablen-1)*sizeof(struct mblk)); |
181 |
– |
#else |
182 |
– |
(void)memcpy((char *)(mtab(&cptab)+1), (char *)tab, |
183 |
– |
tablen*sizeof(struct mblk)); |
184 |
– |
memset((char *)(mtab(&cptab)+tablen+1), 0, |
185 |
– |
(mtablen(&cptab)-tablen-1)*sizeof(struct mblk)); |
186 |
– |
#endif |
190 |
|
} /* next round */ |
191 |
|
} |
192 |
|
#endif /* MCOMP */ |
236 |
|
pagesz = amnt = getpagesize(); |
237 |
|
nrem = (int)sbrk(0); /* page align break */ |
238 |
|
nrem = pagesz - (nrem&(pagesz-1)); |
239 |
< |
bpos = sbrk(nrem); /* word aligned! */ |
239 |
> |
bpos = sbrk(nrem); |
240 |
|
if ((int)bpos == -1) |
241 |
|
return(NULL); |
242 |
|
#ifdef MSTATS |
243 |
|
b_nsbrked += nrem; |
244 |
|
#endif |
245 |
+ |
bpos += nrem & (BYTES_WORD-1); /* align pointer */ |
246 |
+ |
nrem &= ~(BYTES_WORD-1); |
247 |
+ |
memlim[0] = bpos; |
248 |
+ |
memlim[1] = bpos + nrem; |
249 |
|
} |
250 |
|
|
251 |
|
n = (n+(BYTES_WORD-1))&~(BYTES_WORD-1); /* word align rqst. */ |
252 |
|
|
253 |
|
if (n > nrem) { /* need more core */ |
254 |
+ |
tryagain: |
255 |
|
if (n > amnt) { /* big chunk */ |
256 |
|
thisamnt = (n+(pagesz-1))&~(pagesz-1); |
257 |
|
if (thisamnt <= MAXINCR) /* increase amnt */ |
260 |
|
thisamnt = amnt; |
261 |
|
p = sbrk(thisamnt); |
262 |
|
if ((int)p == -1) { /* uh-oh, ENOMEM */ |
263 |
< |
thisamnt = n; /* search free lists */ |
264 |
< |
p = mscrounge(&thisamnt); |
265 |
< |
if (p == NULL) /* we're really out */ |
263 |
> |
errno = 0; /* call cavalry */ |
264 |
> |
if (thisamnt >= n+pagesz) { |
265 |
> |
amnt = pagesz; /* minimize request */ |
266 |
> |
goto tryagain; |
267 |
> |
} |
268 |
> |
thisamnt = n; |
269 |
> |
p = mscrounge(&thisamnt); /* search free lists */ |
270 |
> |
if (p == NULL) { /* we're really out */ |
271 |
> |
errno = ENOMEM; |
272 |
|
return(NULL); |
273 |
+ |
} |
274 |
|
} |
275 |
|
#ifdef MSTATS |
276 |
|
else b_nsbrked += thisamnt; |
281 |
|
nrem = thisamnt; |
282 |
|
} else /* otherwise tack on */ |
283 |
|
nrem += thisamnt; |
284 |
+ |
if (bpos < memlim[0]) |
285 |
+ |
memlim[0] = bpos; |
286 |
+ |
if (bpos + nrem > memlim[1]) |
287 |
+ |
memlim[1] = bpos + nrem; |
288 |
|
} |
289 |
|
p = bpos; |
290 |
|
bpos += n; /* advance */ |
314 |
|
p += bsiz; |
315 |
|
n -= bsiz; |
316 |
|
} |
317 |
+ |
if (p < memlim[0]) |
318 |
+ |
memlim[0] = p; |
319 |
+ |
if (p + n > memlim[1]) |
320 |
+ |
memlim[1] = p + n; |
321 |
|
/* fill big buckets first */ |
322 |
|
for (bucket = NBUCKETS-1, bsiz = 1<<(NBUCKETS-1); |
323 |
|
bucket >= FIRSTBUCKET; bucket--, bsiz >>= 1) |
334 |
|
malloc(n) /* allocate n bytes of memory */ |
335 |
|
unsigned n; |
336 |
|
{ |
314 |
– |
extern int errno; |
337 |
|
register M_HEAD *mp; |
338 |
|
register int bucket; |
339 |
|
register unsigned bsiz; |
375 |
|
char *p; |
376 |
|
register unsigned on; |
377 |
|
/* get old size */ |
378 |
< |
if (op != NULL && op != DUMMYLOC && ((M_HEAD *)op-1)->a.magic == MAGIC) |
378 |
> |
if (op != DUMMYLOC && !BADPTR(op) && |
379 |
> |
((M_HEAD *)op-1)->a.magic == MAGIC) |
380 |
|
on = 1 << ((M_HEAD *)op-1)->a.bucket; |
381 |
|
else |
382 |
|
on = 0; |
383 |
|
if (n <= on && (n > on>>1 || on == 1<<FIRSTBUCKET)) |
384 |
|
return(op); /* same bucket */ |
385 |
|
if ((p = malloc(n)) == NULL) |
386 |
< |
return(NULL); |
386 |
> |
return(n<=on ? op : NULL); |
387 |
|
if (on) { |
365 |
– |
#ifdef BSD |
388 |
|
bcopy(op, p, n>on ? on : n); |
367 |
– |
#else |
368 |
– |
(void)memcpy(p, op, n>on ? on : n); |
369 |
– |
#endif |
389 |
|
free(op); |
390 |
|
} |
391 |
|
return(p); |
398 |
|
register M_HEAD *mp; |
399 |
|
register int bucket; |
400 |
|
|
401 |
< |
if (p == NULL || p == DUMMYLOC) |
401 |
> |
if (p == DUMMYLOC) |
402 |
|
return(1); |
403 |
+ |
if (BADPTR(p)) |
404 |
+ |
goto invalid; |
405 |
|
mp = (M_HEAD *)p - 1; |
406 |
|
if (mp->a.magic != MAGIC) /* sanity check */ |
407 |
< |
return(0); |
407 |
> |
goto invalid; |
408 |
|
bucket = mp->a.bucket; |
409 |
+ |
if (bucket < FIRSTBUCKET | bucket >= NBUCKETS) |
410 |
+ |
goto invalid; |
411 |
|
mp->next = free_list[bucket]; |
412 |
|
free_list[bucket] = mp; |
413 |
|
#ifdef MSTATS |
414 |
|
m_nfreed += (1 << bucket) + sizeof(M_HEAD); |
415 |
|
#endif |
416 |
|
return(1); |
417 |
+ |
invalid: |
418 |
+ |
errno = EINVAL; |
419 |
+ |
return(0); |
420 |
|
} |
421 |
|
|
422 |
|
|