1 /* $NetBSD: mem1.c,v 1.2 1995/07/03 21:24:25 cgd Exp $ */
4 * Copyright (c) 1994, 1995 Jochen Pohl
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by Jochen Pohl for
19 * 4. The name of the author may not be used to endorse or promote products
20 * derived from this software without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 * $NetBSD: mem1.c,v 1.2 1995/07/03 21:24:25 cgd Exp $
34 * $DragonFly: src/usr.bin/xlint/lint1/mem1.c,v 1.4 2003/11/03 19:31:34 eirikn Exp $
37 #include <sys/types.h>
39 #include <sys/param.h>
48 * Filenames allocated by fnalloc() and fnnalloc() are shared.
59 static fn_t *srchfn(const char *, size_t);
62 * Look for a Filename of length l.
71 for (fn = fnames; fn != NULL; fn = fn->fn_nxt) {
72 if (fn->fn_len == len && memcmp(fn->fn_name, s, len) == 0)
79 * Return a shared string for filename s.
85 return (s != NULL ? fnnalloc(s, strlen(s)) : NULL);
95 static int nxt_id = 0;
100 if ((fn = srchfn(s, len)) == NULL) {
101 fn = xmalloc(sizeof (fn_t));
102 /* Do not used strdup() because string is not NUL-terminated.*/
103 fn->fn_name = xmalloc(len + 1);
104 (void)memcpy(fn->fn_name, s, len);
105 fn->fn_name[len] = '\0';
107 fn->fn_id = nxt_id++;
110 /* Write id of this filename to the output file. */
114 outstrg(fn->fn_name);
116 return (fn->fn_name);
120 * Get id of a filename.
128 if (s == NULL || (fn = srchfn(s, strlen(s))) == NULL)
134 * Memory for declarations and other things which must be available
135 * until the end of a block (or the end of the translation unit)
136 * are assoziated with the level (mblklev) of the block (or wiht 0).
137 * Because these memory is allocated in large blocks associated with
138 * a given level it can be freed easily at the end of a block.
140 #define ML_INC ((size_t)32) /* Increment for length of *mblks */
143 void *blk; /* beginning of memory block */
144 void *ffree; /* first free byte */
145 size_t nfree; /* # of free bytes */
146 size_t size; /* total size of memory block */
147 struct mbl *nxt; /* next block */
151 * Array of pointers to lists of memory blocks. mblklev is used as
152 * index into this array.
154 static mbl_t **mblks;
156 /* number of elements in *mblks */
157 static size_t nmblks;
159 /* free list for memory blocks */
160 static mbl_t *frmblks;
162 /* length of new allocated memory blocks */
163 static size_t mblklen;
165 static void *xgetblk(mbl_t **, size_t);
166 static void xfreeblk(mbl_t **);
167 static mbl_t *xnewblk(void);
175 mb = xmalloc(sizeof (mbl_t));
177 /* use mmap instead of malloc to avoid malloc's size overhead */
179 prot = PROT_READ | PROT_WRITE;
180 flags = MAP_ANON | MAP_PRIVATE;
181 mb->blk = mmap(NULL, mblklen, prot, flags, -1, (off_t)0);
182 if (mb->blk == (void *)MAP_FAILED)
183 err(1, "can't map memory");
184 if (ALIGN((u_long)mb->blk) != (u_long)mb->blk)
185 errx(1, "mapped address is not aligned");
193 * Allocate new memory. If the first block of the list has not enough
194 * free space, or there is no first block, get a new block. The new
195 * block is taken from the free list or, if there is no block on the
196 * free list, is allocated using xnewblk(). If a new block is allocated
197 * it is initialized with zero. Blocks taken from the free list are
198 * zero'd in xfreeblk().
209 if ((mb = *mbp) == NULL || mb->nfree < s) {
210 if ((mb = frmblks) == NULL) {
212 (void)memset(mb->blk, 0, mb->size);
217 mb->nfree = mb->size;;
222 mb->ffree = (char *)mb->ffree + s;
228 * Move all blocks from list *fmbp to free list. For each block, set all
229 * used memory to zero.
237 while ((mb = *fmbp) != NULL) {
241 (void)memset(mb->blk, 0, mb->size - mb->nfree);
250 pgsz = getpagesize();
251 mblklen = ((MBLKSIZ + pgsz - 1) / pgsz) * pgsz;
253 mblks = xcalloc(nmblks = ML_INC, sizeof (mbl_t *));
258 * Allocate memory associated with level l.
265 while (l >= nmblks) {
266 mblks = xrealloc(mblks, (nmblks + ML_INC) * sizeof (mbl_t *));
267 (void)memset(&mblks[nmblks], 0, ML_INC * sizeof (mbl_t *));
270 return (xgetblk(&mblks[l], s));
277 return (getlblk(mblklev, s));
281 * Free all memory associated with level l.
297 * tgetblk() returns memory which is associated with the current
306 return (xgetblk(&tmblk, s));
310 * Get memory for a new tree node.
315 return (tgetblk(sizeof (tnode_t)));
319 * Free all memory which is allocated by the the current expression.
328 * Save the memory which is used by the current expression. This memory
329 * is not freed by the next tfreeblk() call. The pointer returned can be
330 * used to restore the memory.
343 * Free all memory used for the current expression and the memory used
344 * be a previous expression and saved by tsave(). The next call to
345 * tfreeblk() frees the restored memory.