1 |
/* Copyright (c) 1991 Regents of the University of California */ |
2 |
|
3 |
#ifndef lint |
4 |
static char SCCSid[] = "$SunId$ LBL"; |
5 |
#endif |
6 |
|
7 |
/* |
8 |
* Bmalloc provides basic memory allocation without overhead (no free lists). |
9 |
* Use only to take the load off of malloc for all those |
10 |
* piddling little requests that you never expect to free. |
11 |
* Bmalloc defers to malloc for big requests. |
12 |
* Bfree should hand memory to bmalloc, but it usually fails here. |
13 |
*/ |
14 |
|
15 |
#define NULL 0 |
16 |
|
17 |
#ifndef MBLKSIZ |
18 |
#define MBLKSIZ 16376 /* size of memory allocation block */ |
19 |
#endif |
20 |
#define WASTEFRAC 12 /* don't waste more than a fraction */ |
21 |
#ifndef ALIGN |
22 |
#define ALIGN int /* type for alignment */ |
23 |
#endif |
24 |
#define BYTES_WORD sizeof(ALIGN) |
25 |
|
26 |
extern char *malloc(); |
27 |
|
28 |
static char *bposition = NULL; |
29 |
static unsigned nremain = 0; |
30 |
|
31 |
|
32 |
char * |
33 |
bmalloc(n) /* allocate a block of n bytes, no refunds */ |
34 |
register unsigned n; |
35 |
{ |
36 |
if (n > nremain && (n > MBLKSIZ || nremain > MBLKSIZ/WASTEFRAC)) |
37 |
return(malloc(n)); /* too big */ |
38 |
|
39 |
n = (n+(BYTES_WORD-1))&~(BYTES_WORD-1); /* word align */ |
40 |
|
41 |
if (n > nremain) { |
42 |
if ((bposition = malloc((unsigned)MBLKSIZ)) == NULL) { |
43 |
nremain = 0; |
44 |
return(NULL); |
45 |
} |
46 |
nremain = MBLKSIZ; |
47 |
} |
48 |
bposition += n; |
49 |
nremain -= n; |
50 |
return(bposition - n); |
51 |
} |
52 |
|
53 |
|
54 |
bfree(p, n) /* free random memory */ |
55 |
register char *p; |
56 |
register unsigned n; |
57 |
{ |
58 |
register unsigned bsiz; |
59 |
/* check alignment */ |
60 |
bsiz = BYTES_WORD - ((unsigned)p&(BYTES_WORD-1)); |
61 |
if (bsiz < BYTES_WORD) { |
62 |
p += bsiz; |
63 |
n -= bsiz; |
64 |
} |
65 |
if (p + n == bposition) { /* just allocated? */ |
66 |
bposition = p; |
67 |
nremain += n; |
68 |
return; |
69 |
} |
70 |
if (n > nremain) { /* better than what we've got? */ |
71 |
bposition = p; |
72 |
nremain = n; |
73 |
return; |
74 |
} |
75 |
/* just throw it away, then */ |
76 |
} |