Home | History | Annotate | Line # | Download | only in lint1
mem1.c revision 1.71
      1 /*	$NetBSD: mem1.c,v 1.71 2023/07/15 15:56:17 rillig Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1994, 1995 Jochen Pohl
      5  * All Rights Reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     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
     18  *	The NetBSD Project.
     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.
     21  *
     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.
     32  */
     33 
     34 #if HAVE_NBTOOL_CONFIG_H
     35 #include "nbtool_config.h"
     36 #endif
     37 
     38 #include <sys/cdefs.h>
     39 #if defined(__RCSID)
     40 __RCSID("$NetBSD: mem1.c,v 1.71 2023/07/15 15:56:17 rillig Exp $");
     41 #endif
     42 
     43 #include <sys/param.h>
     44 #include <stdlib.h>
     45 #include <string.h>
     46 
     47 #include "lint1.h"
     48 
     49 /*
     50  * Filenames allocated by record_filename are shared and have unlimited
     51  * lifetime.
     52  */
     53 struct filename {
     54 	const char *fn_name;
     55 	size_t	fn_len;
     56 	int	fn_id;
     57 	struct	filename *fn_next;
     58 };
     59 
     60 static struct filename *filenames;	/* null-terminated array */
     61 static int next_filename_id;
     62 
     63 /* Find the given filename, or return NULL. */
     64 static const struct filename *
     65 search_filename(const char *s, size_t len)
     66 {
     67 	const struct filename *fn;
     68 
     69 	for (fn = filenames; fn != NULL; fn = fn->fn_next) {
     70 		if (fn->fn_len == len && memcmp(fn->fn_name, s, len) == 0)
     71 			break;
     72 	}
     73 	return fn;
     74 }
     75 
     76 struct filename_replacement {
     77 	const char *orig;
     78 	size_t orig_len;
     79 	const char *repl;
     80 	const struct filename_replacement *next;
     81 };
     82 
     83 static struct filename_replacement *filename_replacements;
     84 
     85 void
     86 add_directory_replacement(char *arg)
     87 {
     88 	struct filename_replacement *r = xmalloc(sizeof(*r));
     89 
     90 	char *sep = strchr(arg, '=');
     91 	if (sep == NULL)
     92 		err(1, "Bad replacement directory spec `%s'", arg);
     93 	*sep = '\0';
     94 
     95 	r->orig = arg;
     96 	r->orig_len = (size_t)(sep - arg);
     97 	r->repl = sep + 1;
     98 	r->next = filename_replacements;
     99 	filename_replacements = r;
    100 }
    101 
    102 const char *
    103 transform_filename(const char *name, size_t len)
    104 {
    105 	static char buf[MAXPATHLEN];
    106 	const struct filename_replacement *r;
    107 
    108 	for (r = filename_replacements; r != NULL; r = r->next)
    109 		if (r->orig_len < len &&
    110 		    memcmp(name, r->orig, r->orig_len) == 0)
    111 			break;
    112 	if (r == NULL)
    113 		return name;
    114 	(void)snprintf(buf, sizeof(buf), "%s%s", r->repl, name + r->orig_len);
    115 	return buf;
    116 }
    117 
    118 /*
    119  * Return a copy of the filename s with unlimited lifetime.
    120  * If the filename is new, write it to the output file.
    121  */
    122 const char *
    123 record_filename(const char *s, size_t slen)
    124 {
    125 
    126 	const struct filename *existing_fn = search_filename(s, slen);
    127 	if (existing_fn != NULL)
    128 		return existing_fn->fn_name;
    129 
    130 	char *name = xmalloc(slen + 1);
    131 	(void)memcpy(name, s, slen);
    132 	name[slen] = '\0';
    133 
    134 	struct filename *fn = xmalloc(sizeof(*fn));
    135 	fn->fn_name = name;
    136 	fn->fn_len = slen;
    137 	fn->fn_id = next_filename_id++;
    138 	fn->fn_next = filenames;
    139 	filenames = fn;
    140 
    141 	/* Write the ID of this filename to the output file. */
    142 	outclr();
    143 	outint(fn->fn_id);
    144 	outchar('s');
    145 	outstrg(transform_filename(fn->fn_name, fn->fn_len));
    146 
    147 	return fn->fn_name;
    148 }
    149 
    150 /* Get the ID of a filename. */
    151 int
    152 get_filename_id(const char *s)
    153 {
    154 	const struct filename *fn;
    155 
    156 	if (s == NULL || (fn = search_filename(s, strlen(s))) == NULL)
    157 		return -1;
    158 	return fn->fn_id;
    159 }
    160 
    161 typedef struct memory_pools {
    162 	struct memory_pool *pools;
    163 	size_t	cap;
    164 } memory_pools;
    165 
    166 /* Array of memory pools, indexed by mem_block_level. */
    167 static memory_pools mpools;
    168 
    169 /* The pool for the current expression is independent of any block level. */
    170 static memory_pool expr_pool;
    171 
    172 static void
    173 mpool_add(memory_pool *pool, struct memory_pool_item item)
    174 {
    175 
    176 	if (pool->len >= pool->cap) {
    177 		pool->cap = 2 * pool->len + 16;
    178 		pool->items = xrealloc(pool->items,
    179 		    sizeof(*pool->items) * pool->cap);
    180 	}
    181 	pool->items[pool->len++] = item;
    182 }
    183 
    184 static void
    185 mpool_free(memory_pool *pool)
    186 {
    187 
    188 	for (; pool->len > 0; pool->len--) {
    189 		struct memory_pool_item *item = pool->items + pool->len - 1;
    190 		void *p = item->p;
    191 #ifdef DEBUG_MEM
    192 		if (strcmp(item->descr, "string") == 0)
    193 			debug_step("%s: freeing string '%s'",
    194 			    __func__, (const char *)p);
    195 		else if (strcmp(item->descr, "sym") == 0)
    196 			debug_step("%s: freeing symbol '%s'",
    197 			    __func__, ((const sym_t *)p)->s_name);
    198 		else if (strcmp(item->descr, "type") == 0)
    199 			debug_step("%s: freeing type '%s'",
    200 			    __func__, type_name(p));
    201 		else if (strcmp(item->descr, "tnode") == 0)
    202 			debug_step("%s: freeing node '%s' with type '%s'",
    203 			    __func__, op_name(((const tnode_t *)p)->tn_op),
    204 			    type_name(((const tnode_t *)p)->tn_type));
    205 		else
    206 			debug_step("%s: freeing '%s' with %zu bytes",
    207 			    __func__, item->descr, item->size);
    208 #endif
    209 		free(p);
    210 	}
    211 }
    212 
    213 static void *
    214 #ifdef DEBUG_MEM
    215 mpool_zero_alloc(memory_pool *pool, size_t size, const char *descr)
    216 #else
    217 mpool_zero_alloc(memory_pool *pool, size_t size)
    218 #endif
    219 {
    220 
    221 	void *mem = xmalloc(size);
    222 	memset(mem, 0, size);
    223 #if DEBUG_MEM
    224 	mpool_add(pool, (struct memory_pool_item){ mem, size, descr });
    225 #else
    226 	mpool_add(pool, (struct memory_pool_item){ mem });
    227 #endif
    228 	return mem;
    229 }
    230 
    231 static memory_pool *
    232 mpool_at(size_t level)
    233 {
    234 
    235 	if (level >= mpools.cap) {
    236 		size_t prev_cap = mpools.cap;
    237 		mpools.cap = level + 16;
    238 		mpools.pools = xrealloc(mpools.pools,
    239 		    sizeof(*mpools.pools) * mpools.cap);
    240 		for (size_t i = prev_cap; i < mpools.cap; i++)
    241 			mpools.pools[i] = (memory_pool){ NULL, 0, 0 };
    242 	}
    243 	return mpools.pools + level;
    244 }
    245 
    246 
    247 /* Allocate memory associated with the level, initialized with zero. */
    248 #ifdef DEBUG_MEM
    249 void *
    250 level_zero_alloc(size_t level, size_t size, const char *descr)
    251 {
    252 
    253 	debug_step("%s: %s at level %zu", __func__, descr, level);
    254 	return mpool_zero_alloc(mpool_at(level), size, descr);
    255 }
    256 #else
    257 void *
    258 (level_zero_alloc)(size_t level, size_t size)
    259 {
    260 
    261 	return mpool_zero_alloc(mpool_at(level), size);
    262 }
    263 #endif
    264 
    265 /* Allocate memory that is freed at the end of the current block. */
    266 #ifdef DEBUG_MEM
    267 void *
    268 block_zero_alloc(size_t size, const char *descr)
    269 {
    270 
    271 	return level_zero_alloc(mem_block_level, size, descr);
    272 }
    273 #else
    274 void *
    275 (block_zero_alloc)(size_t size)
    276 {
    277 
    278 	return (level_zero_alloc)(mem_block_level, size);
    279 }
    280 #endif
    281 
    282 void
    283 level_free_all(size_t level)
    284 {
    285 
    286 	debug_step("%s %zu", __func__, level);
    287 	mpool_free(mpool_at(level));
    288 }
    289 
    290 /* Allocate memory that is freed at the end of the current expression. */
    291 #if DEBUG_MEM
    292 void *
    293 expr_zero_alloc(size_t s, const char *descr)
    294 {
    295 
    296 	return mpool_zero_alloc(&expr_pool, s, descr);
    297 }
    298 #else
    299 void *
    300 (expr_zero_alloc)(size_t size)
    301 {
    302 
    303 	return mpool_zero_alloc(&expr_pool, size);
    304 }
    305 #endif
    306 
    307 static bool
    308 str_ends_with(const char *haystack, const char *needle)
    309 {
    310 	size_t hlen = strlen(haystack);
    311 	size_t nlen = strlen(needle);
    312 
    313 	return nlen <= hlen &&
    314 	       memcmp(haystack + hlen - nlen, needle, nlen) == 0;
    315 }
    316 
    317 /*
    318  * Return a freshly allocated tree node that is freed at the end of the
    319  * current expression.
    320  *
    321  * The node records whether it comes from a system file, which makes strict
    322  * bool mode less restrictive.
    323  */
    324 tnode_t *
    325 expr_alloc_tnode(void)
    326 {
    327 	tnode_t *tn = expr_zero_alloc(sizeof(*tn), "tnode");
    328 	/*
    329 	 * files named *.c that are different from the main translation unit
    330 	 * typically contain generated code that cannot be influenced, such
    331 	 * as a flex lexer or a yacc parser.
    332 	 */
    333 	tn->tn_sys = in_system_header ||
    334 		     (curr_pos.p_file != csrc_pos.p_file &&
    335 		      str_ends_with(curr_pos.p_file, ".c"));
    336 	return tn;
    337 }
    338 
    339 /* Free all memory which is allocated by the current expression. */
    340 void
    341 expr_free_all(void)
    342 {
    343 
    344 	debug_step("%s", __func__);
    345 	mpool_free(&expr_pool);
    346 }
    347 
    348 /*
    349  * Save the memory which is used by the current expression. This memory
    350  * is not freed by the next expr_free_all() call. The returned value can be
    351  * used to restore the memory.
    352  */
    353 memory_pool
    354 expr_save_memory(void)
    355 {
    356 
    357 	memory_pool saved_pool = expr_pool;
    358 	expr_pool = (memory_pool){ NULL, 0, 0 };
    359 	return saved_pool;
    360 }
    361 
    362 /*
    363  * Free all memory used for the current expression and restore the memory used
    364  * by a previous expression and saved by expr_save_memory(). The next call to
    365  * expr_free_all() frees the restored memory.
    366  */
    367 void
    368 expr_restore_memory(memory_pool saved_pool)
    369 {
    370 
    371 	expr_free_all();
    372 	free(expr_pool.items);
    373 	expr_pool = saved_pool;
    374 }
    375