mem1.c revision 1.32 1 1.32 rillig /* $NetBSD: mem1.c,v 1.32 2021/03/27 12:01:49 rillig Exp $ */
2 1.2 cgd
3 1.1 cgd /*
4 1.1 cgd * Copyright (c) 1994, 1995 Jochen Pohl
5 1.1 cgd * All Rights Reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by Jochen Pohl for
18 1.1 cgd * The NetBSD Project.
19 1.1 cgd * 4. The name of the author may not be used to endorse or promote products
20 1.1 cgd * derived from this software without specific prior written permission.
21 1.1 cgd *
22 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
23 1.1 cgd * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
24 1.1 cgd * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 1.1 cgd * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
26 1.1 cgd * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
27 1.1 cgd * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 1.1 cgd * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 1.1 cgd * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 1.1 cgd * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
31 1.1 cgd * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.11 jmc #if HAVE_NBTOOL_CONFIG_H
35 1.11 jmc #include "nbtool_config.h"
36 1.11 jmc #endif
37 1.11 jmc
38 1.3 christos #include <sys/cdefs.h>
39 1.7 tv #if defined(__RCSID) && !defined(lint)
40 1.32 rillig __RCSID("$NetBSD: mem1.c,v 1.32 2021/03/27 12:01:49 rillig Exp $");
41 1.1 cgd #endif
42 1.1 cgd
43 1.1 cgd #include <sys/types.h>
44 1.1 cgd #include <sys/param.h>
45 1.1 cgd #include <stdlib.h>
46 1.1 cgd #include <string.h>
47 1.1 cgd #include <unistd.h>
48 1.1 cgd
49 1.1 cgd #include "lint1.h"
50 1.1 cgd
51 1.1 cgd /*
52 1.1 cgd * Filenames allocated by fnalloc() and fnnalloc() are shared.
53 1.1 cgd */
54 1.32 rillig struct filename {
55 1.1 cgd char *fn_name;
56 1.1 cgd size_t fn_len;
57 1.1 cgd int fn_id;
58 1.32 rillig struct filename *fn_next;
59 1.32 rillig };
60 1.1 cgd
61 1.32 rillig static struct filename *fnames;
62 1.1 cgd
63 1.26 rillig /* Find the given filename, or return NULL. */
64 1.32 rillig static struct filename *
65 1.5 lukem srchfn(const char *s, size_t len)
66 1.1 cgd {
67 1.32 rillig struct filename *fn;
68 1.1 cgd
69 1.21 rillig for (fn = fnames; fn != NULL; fn = fn->fn_next) {
70 1.1 cgd if (fn->fn_len == len && memcmp(fn->fn_name, s, len) == 0)
71 1.1 cgd break;
72 1.1 cgd }
73 1.20 rillig return fn;
74 1.1 cgd }
75 1.1 cgd
76 1.32 rillig struct filename_replacement {
77 1.18 christos char *orig;
78 1.18 christos char *repl;
79 1.18 christos size_t len;
80 1.32 rillig struct filename_replacement *next;
81 1.18 christos };
82 1.18 christos
83 1.32 rillig static struct filename_replacement *replist;
84 1.18 christos
85 1.18 christos void
86 1.30 rillig add_directory_replacement(char *arg)
87 1.18 christos {
88 1.32 rillig struct filename_replacement *r = xmalloc(sizeof *r);
89 1.19 rillig
90 1.18 christos r->orig = arg;
91 1.19 rillig if ((r->repl = strchr(arg, '=')) == NULL)
92 1.18 christos err(1, "Bad replacement directory spec `%s'", arg);
93 1.18 christos r->len = r->repl - r->orig;
94 1.18 christos *(r->repl)++ = '\0';
95 1.18 christos if (replist == NULL) {
96 1.18 christos r->next = NULL;
97 1.18 christos } else
98 1.18 christos r->next = replist;
99 1.18 christos replist = r;
100 1.18 christos }
101 1.18 christos
102 1.18 christos const char *
103 1.18 christos fnxform(const char *name, size_t len)
104 1.18 christos {
105 1.18 christos static char buf[MAXPATHLEN];
106 1.32 rillig struct filename_replacement *r;
107 1.18 christos
108 1.23 rillig for (r = replist; r != NULL; r = r->next)
109 1.18 christos if (r->len < len && memcmp(name, r->orig, r->len) == 0)
110 1.18 christos break;
111 1.18 christos if (r == NULL)
112 1.18 christos return name;
113 1.28 rillig snprintf(buf, sizeof buf, "%s%s", r->repl, name + r->len);
114 1.18 christos return buf;
115 1.18 christos }
116 1.18 christos
117 1.29 rillig /*
118 1.29 rillig * Return a copy of the filename s with unlimited lifetime.
119 1.29 rillig * If the filename is new, it is written to the output file.
120 1.29 rillig */
121 1.1 cgd const char *
122 1.5 lukem fnnalloc(const char *s, size_t len)
123 1.1 cgd {
124 1.32 rillig struct filename *fn;
125 1.1 cgd
126 1.1 cgd static int nxt_id = 0;
127 1.1 cgd
128 1.1 cgd if (s == NULL)
129 1.20 rillig return NULL;
130 1.1 cgd
131 1.31 rillig if ((fn = srchfn(s, len)) != NULL)
132 1.31 rillig return fn->fn_name;
133 1.31 rillig
134 1.31 rillig fn = xmalloc(sizeof *fn);
135 1.31 rillig /* Do not use strdup() because s is not NUL-terminated.*/
136 1.31 rillig fn->fn_name = xmalloc(len + 1);
137 1.31 rillig (void)memcpy(fn->fn_name, s, len);
138 1.31 rillig fn->fn_name[len] = '\0';
139 1.31 rillig fn->fn_len = len;
140 1.31 rillig fn->fn_id = nxt_id++;
141 1.31 rillig fn->fn_next = fnames;
142 1.31 rillig fnames = fn;
143 1.31 rillig
144 1.31 rillig /* Write id of this filename to the output file. */
145 1.31 rillig outclr();
146 1.31 rillig outint(fn->fn_id);
147 1.31 rillig outchar('s');
148 1.31 rillig outstrg(fnxform(fn->fn_name, fn->fn_len));
149 1.31 rillig
150 1.20 rillig return fn->fn_name;
151 1.1 cgd }
152 1.1 cgd
153 1.26 rillig /* Get the ID of a filename. */
154 1.1 cgd int
155 1.5 lukem getfnid(const char *s)
156 1.1 cgd {
157 1.32 rillig struct filename *fn;
158 1.1 cgd
159 1.1 cgd if (s == NULL || (fn = srchfn(s, strlen(s))) == NULL)
160 1.20 rillig return -1;
161 1.20 rillig return fn->fn_id;
162 1.1 cgd }
163 1.1 cgd
164 1.1 cgd /*
165 1.1 cgd * Memory for declarations and other things which must be available
166 1.1 cgd * until the end of a block (or the end of the translation unit)
167 1.27 rillig * are associated with the level (mem_block_level) of the block (or with 0).
168 1.13 wiz * Because this memory is allocated in large blocks associated with
169 1.1 cgd * a given level it can be freed easily at the end of a block.
170 1.1 cgd */
171 1.1 cgd #define ML_INC ((size_t)32) /* Increment for length of *mblks */
172 1.1 cgd
173 1.1 cgd typedef struct mbl {
174 1.1 cgd void *blk; /* beginning of memory block */
175 1.1 cgd void *ffree; /* first free byte */
176 1.1 cgd size_t nfree; /* # of free bytes */
177 1.1 cgd size_t size; /* total size of memory block */
178 1.1 cgd struct mbl *nxt; /* next block */
179 1.1 cgd } mbl_t;
180 1.1 cgd
181 1.1 cgd /*
182 1.27 rillig * Array of pointers to lists of memory blocks. mem_block_level is used as
183 1.1 cgd * index into this array.
184 1.1 cgd */
185 1.1 cgd static mbl_t **mblks;
186 1.1 cgd
187 1.1 cgd /* number of elements in *mblks */
188 1.1 cgd static size_t nmblks;
189 1.1 cgd
190 1.1 cgd /* free list for memory blocks */
191 1.1 cgd static mbl_t *frmblks;
192 1.1 cgd
193 1.1 cgd /* length of new allocated memory blocks */
194 1.1 cgd static size_t mblklen;
195 1.1 cgd
196 1.5 lukem static void *xgetblk(mbl_t **, size_t);
197 1.5 lukem static void xfreeblk(mbl_t **);
198 1.5 lukem static mbl_t *xnewblk(void);
199 1.1 cgd
200 1.1 cgd static mbl_t *
201 1.5 lukem xnewblk(void)
202 1.1 cgd {
203 1.28 rillig mbl_t *mb = xmalloc(sizeof *mb);
204 1.1 cgd
205 1.1 cgd /* use mmap instead of malloc to avoid malloc's size overhead */
206 1.10 christos mb->blk = xmapalloc(mblklen);
207 1.1 cgd mb->size = mblklen;
208 1.1 cgd
209 1.20 rillig return mb;
210 1.1 cgd }
211 1.1 cgd
212 1.22 rillig /* Allocate new memory, initialized with zero. */
213 1.1 cgd static void *
214 1.5 lukem xgetblk(mbl_t **mbp, size_t s)
215 1.1 cgd {
216 1.1 cgd mbl_t *mb;
217 1.1 cgd void *p;
218 1.8 jmc size_t t = 0;
219 1.1 cgd
220 1.22 rillig /*
221 1.22 rillig * If the first block of the list has not enough free space,
222 1.22 rillig * or there is no first block, get a new block. The new block
223 1.22 rillig * is taken from the free list or, if there is no block on the
224 1.22 rillig * free list, is allocated using xnewblk().
225 1.22 rillig *
226 1.22 rillig * If a new block is allocated it is initialized with zero.
227 1.22 rillig * Blocks taken from the free list are zero'd in xfreeblk().
228 1.22 rillig */
229 1.22 rillig
230 1.15 christos s = WORST_ALIGN(s);
231 1.1 cgd if ((mb = *mbp) == NULL || mb->nfree < s) {
232 1.14 christos if ((mb = frmblks) == NULL || mb->size < s) {
233 1.8 jmc if (s > mblklen) {
234 1.8 jmc t = mblklen;
235 1.8 jmc mblklen = s;
236 1.8 jmc }
237 1.1 cgd mb = xnewblk();
238 1.17 christos #ifndef BLKDEBUG
239 1.17 christos (void)memset(mb->blk, 0, mb->size);
240 1.17 christos #endif
241 1.23 rillig if (t > 0)
242 1.8 jmc mblklen = t;
243 1.1 cgd } else {
244 1.1 cgd frmblks = mb->nxt;
245 1.1 cgd }
246 1.1 cgd mb->ffree = mb->blk;
247 1.9 simonb mb->nfree = mb->size;
248 1.1 cgd mb->nxt = *mbp;
249 1.1 cgd *mbp = mb;
250 1.1 cgd }
251 1.1 cgd p = mb->ffree;
252 1.1 cgd mb->ffree = (char *)mb->ffree + s;
253 1.1 cgd mb->nfree -= s;
254 1.17 christos #ifdef BLKDEBUG
255 1.17 christos (void)memset(p, 0, s);
256 1.17 christos #endif
257 1.20 rillig return p;
258 1.1 cgd }
259 1.1 cgd
260 1.1 cgd /*
261 1.1 cgd * Move all blocks from list *fmbp to free list. For each block, set all
262 1.1 cgd * used memory to zero.
263 1.1 cgd */
264 1.1 cgd static void
265 1.5 lukem xfreeblk(mbl_t **fmbp)
266 1.1 cgd {
267 1.1 cgd mbl_t *mb;
268 1.1 cgd
269 1.1 cgd while ((mb = *fmbp) != NULL) {
270 1.1 cgd *fmbp = mb->nxt;
271 1.1 cgd mb->nxt = frmblks;
272 1.1 cgd frmblks = mb;
273 1.17 christos (void)memset(mb->blk, ZERO, mb->size - mb->nfree);
274 1.1 cgd }
275 1.1 cgd }
276 1.1 cgd
277 1.1 cgd void
278 1.5 lukem initmem(void)
279 1.1 cgd {
280 1.1 cgd int pgsz;
281 1.1 cgd
282 1.1 cgd pgsz = getpagesize();
283 1.1 cgd mblklen = ((MBLKSIZ + pgsz - 1) / pgsz) * pgsz;
284 1.1 cgd
285 1.28 rillig mblks = xcalloc(nmblks = ML_INC, sizeof *mblks);
286 1.1 cgd }
287 1.1 cgd
288 1.5 lukem
289 1.26 rillig /* Allocate memory associated with level l. */
290 1.1 cgd void *
291 1.12 christos getlblk(size_t l, size_t s)
292 1.1 cgd {
293 1.5 lukem
294 1.1 cgd while (l >= nmblks) {
295 1.28 rillig mblks = xrealloc(mblks, (nmblks + ML_INC) * sizeof *mblks);
296 1.28 rillig (void)memset(&mblks[nmblks], 0, ML_INC * sizeof *mblks);
297 1.1 cgd nmblks += ML_INC;
298 1.1 cgd }
299 1.20 rillig return xgetblk(&mblks[l], s);
300 1.1 cgd }
301 1.1 cgd
302 1.1 cgd void *
303 1.5 lukem getblk(size_t s)
304 1.1 cgd {
305 1.5 lukem
306 1.27 rillig return getlblk(mem_block_level, s);
307 1.1 cgd }
308 1.1 cgd
309 1.26 rillig /* Free all memory associated with level l. */
310 1.1 cgd void
311 1.5 lukem freelblk(int l)
312 1.1 cgd {
313 1.5 lukem
314 1.1 cgd xfreeblk(&mblks[l]);
315 1.1 cgd }
316 1.1 cgd
317 1.1 cgd void
318 1.5 lukem freeblk(void)
319 1.1 cgd {
320 1.5 lukem
321 1.27 rillig freelblk(mem_block_level);
322 1.1 cgd }
323 1.1 cgd
324 1.26 rillig static mbl_t *tmblk;
325 1.26 rillig
326 1.1 cgd /*
327 1.26 rillig * Return zero-initialized memory that is freed at the end of the current
328 1.1 cgd * expression.
329 1.1 cgd */
330 1.1 cgd void *
331 1.5 lukem tgetblk(size_t s)
332 1.1 cgd {
333 1.5 lukem
334 1.20 rillig return xgetblk(&tmblk, s);
335 1.1 cgd }
336 1.1 cgd
337 1.26 rillig /* Return a freshly allocated tree node. */
338 1.1 cgd tnode_t *
339 1.5 lukem getnode(void)
340 1.1 cgd {
341 1.25 rillig tnode_t *tn = tgetblk(sizeof *tn);
342 1.25 rillig tn->tn_from_system_header = in_system_header;
343 1.25 rillig return tn;
344 1.1 cgd }
345 1.1 cgd
346 1.26 rillig /* Free all memory which is allocated by the current expression. */
347 1.1 cgd void
348 1.5 lukem tfreeblk(void)
349 1.1 cgd {
350 1.5 lukem
351 1.1 cgd xfreeblk(&tmblk);
352 1.1 cgd }
353 1.1 cgd
354 1.1 cgd /*
355 1.1 cgd * Save the memory which is used by the current expression. This memory
356 1.1 cgd * is not freed by the next tfreeblk() call. The pointer returned can be
357 1.1 cgd * used to restore the memory.
358 1.1 cgd */
359 1.1 cgd mbl_t *
360 1.5 lukem tsave(void)
361 1.1 cgd {
362 1.1 cgd mbl_t *tmem;
363 1.1 cgd
364 1.1 cgd tmem = tmblk;
365 1.1 cgd tmblk = NULL;
366 1.20 rillig return tmem;
367 1.1 cgd }
368 1.1 cgd
369 1.1 cgd /*
370 1.1 cgd * Free all memory used for the current expression and the memory used
371 1.1 cgd * be a previous expression and saved by tsave(). The next call to
372 1.1 cgd * tfreeblk() frees the restored memory.
373 1.1 cgd */
374 1.1 cgd void
375 1.5 lukem trestor(mbl_t *tmem)
376 1.1 cgd {
377 1.5 lukem
378 1.1 cgd tfreeblk();
379 1.1 cgd if (tmblk != NULL) {
380 1.1 cgd free(tmblk->blk);
381 1.1 cgd free(tmblk);
382 1.1 cgd }
383 1.1 cgd tmblk = tmem;
384 1.1 cgd }
385