/* $NetBSD: mem1.c,v 1.63 2022/05/20 21:18:55 rillig Exp $ */ /* * Copyright (c) 1994, 1995 Jochen Pohl * All Rights Reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by Jochen Pohl for * The NetBSD Project. * 4. The name of the author may not be used to endorse or promote products * derived from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ #if HAVE_NBTOOL_CONFIG_H #include "nbtool_config.h" #endif #include #if defined(__RCSID) __RCSID("$NetBSD: mem1.c,v 1.63 2022/05/20 21:18:55 rillig Exp $"); #endif #include #include #include #include "lint1.h" /* * Filenames allocated by record_filename are shared and have unlimited * lifetime. */ struct filename { const char *fn_name; size_t fn_len; int fn_id; struct filename *fn_next; }; static struct filename *filenames; /* null-terminated array */ static int next_filename_id; /* Find the given filename, or return NULL. */ static const struct filename * search_filename(const char *s, size_t len) { const struct filename *fn; for (fn = filenames; fn != NULL; fn = fn->fn_next) { if (fn->fn_len == len && memcmp(fn->fn_name, s, len) == 0) break; } return fn; } struct filename_replacement { const char *orig; size_t orig_len; const char *repl; const struct filename_replacement *next; }; static struct filename_replacement *filename_replacements; void add_directory_replacement(char *arg) { struct filename_replacement *r = xmalloc(sizeof(*r)); char *sep = strchr(arg, '='); if (sep == NULL) err(1, "Bad replacement directory spec `%s'", arg); *sep = '\0'; r->orig = arg; r->orig_len = sep - arg; r->repl = sep + 1; r->next = filename_replacements; filename_replacements = r; } const char * transform_filename(const char *name, size_t len) { static char buf[MAXPATHLEN]; const struct filename_replacement *r; for (r = filename_replacements; r != NULL; r = r->next) if (r->orig_len < len && memcmp(name, r->orig, r->orig_len) == 0) break; if (r == NULL) return name; (void)snprintf(buf, sizeof(buf), "%s%s", r->repl, name + r->orig_len); return buf; } /* * Return a copy of the filename s with unlimited lifetime. * If the filename is new, write it to the output file. */ const char * record_filename(const char *s, size_t slen) { const struct filename *existing_fn; struct filename *fn; char *name; if ((existing_fn = search_filename(s, slen)) != NULL) return existing_fn->fn_name; name = xmalloc(slen + 1); (void)memcpy(name, s, slen); name[slen] = '\0'; fn = xmalloc(sizeof(*fn)); fn->fn_name = name; fn->fn_len = slen; fn->fn_id = next_filename_id++; fn->fn_next = filenames; filenames = fn; /* Write the ID of this filename to the output file. */ outclr(); outint(fn->fn_id); outchar('s'); outstrg(transform_filename(fn->fn_name, fn->fn_len)); return fn->fn_name; } /* Get the ID of a filename. */ int get_filename_id(const char *s) { const struct filename *fn; if (s == NULL || (fn = search_filename(s, strlen(s))) == NULL) return -1; return fn->fn_id; } /* * Memory for declarations and other things that must be available * until the end of a block (or the end of the translation unit) * is associated with the corresponding mem_block_level, which may be 0. * Because this memory is allocated in large blocks associated with * a given level it can be freed easily at the end of a block. */ typedef struct memory_block { void *start; /* beginning of memory block */ void *first_free; /* first free byte */ size_t nfree; /* # of free bytes */ struct memory_block *next; } memory_block; static size_t mblk_size; /* size of newly allocated memory blocks */ /* Array of lists of memory blocks, indexed by mem_block_level. */ static memory_block **mblks; static size_t nmblks; /* number of elements in *mblks */ #define ML_INC ((size_t)32) /* Increment for length of *mblks */ /* Allocate new memory, initialized with zero. */ static void * xgetblk(memory_block **mbp, size_t s) { memory_block *mb; void *p; size_t worst_align = 2 * sizeof(long) - 1; s = (s + worst_align) & ~worst_align; if ((mb = *mbp) == NULL || mb->nfree < s) { size_t block_size = s > mblk_size ? s : mblk_size; mb = xmalloc(sizeof(*mb)); mb->start = xmalloc(block_size); mb->first_free = mb->start; mb->nfree = block_size; mb->next = *mbp; *mbp = mb; } p = mb->first_free; mb->first_free = (char *)mb->first_free + s; mb->nfree -= s; (void)memset(p, 0, s); return p; } /* Free all blocks from list *fmbp. */ static void xfreeblk(memory_block **fmbp) { memory_block *mb; while ((mb = *fmbp) != NULL) { *fmbp = mb->next; free(mb); } } void initmem(void) { mblk_size = mem_block_size(); mblks = xcalloc(nmblks = ML_INC, sizeof(*mblks)); } /* Allocate memory associated with level l, initialized with zero. */ void * level_zero_alloc(size_t l, size_t s) { while (l >= nmblks) { mblks = xrealloc(mblks, (nmblks + ML_INC) * sizeof(*mblks)); (void)memset(&mblks[nmblks], 0, ML_INC * sizeof(*mblks)); nmblks += ML_INC; } return xgetblk(&mblks[l], s); } /* Allocate memory that is freed at the end of the current block. */ void * block_zero_alloc(size_t s) { return level_zero_alloc(mem_block_level, s); } void level_free_all(size_t level) { xfreeblk(&mblks[level]); } static memory_block *tmblk; /* Allocate memory that is freed at the end of the current expression. */ void * expr_zero_alloc(size_t s) { return xgetblk(&tmblk, s); } static bool str_endswith(const char *haystack, const char *needle) { size_t hlen = strlen(haystack); size_t nlen = strlen(needle); return nlen <= hlen && memcmp(haystack + hlen - nlen, needle, nlen) == 0; } /* * Return a freshly allocated tree node that is freed at the end of the * current expression. * * The node records whether it comes from a system file, which makes strict * bool mode less restrictive. */ tnode_t * expr_alloc_tnode(void) { tnode_t *tn = expr_zero_alloc(sizeof(*tn)); /* * files named *.c that are different from the main translation unit * typically contain generated code that cannot be influenced, such * as a flex lexer or a yacc parser. */ tn->tn_sys = in_system_header || (curr_pos.p_file != csrc_pos.p_file && str_endswith(curr_pos.p_file, ".c")); return tn; } /* Free all memory which is allocated by the current expression. */ void expr_free_all(void) { xfreeblk(&tmblk); } /* * Save the memory which is used by the current expression. This memory * is not freed by the next expr_free_all() call. The pointer returned can be * used to restore the memory. */ memory_block * expr_save_memory(void) { memory_block *tmem; tmem = tmblk; tmblk = NULL; return tmem; } /* * Free all memory used for the current expression and restore the memory used * by a previous expression and saved by expr_save_memory(). The next call to * expr_free_all() frees the restored memory. */ void expr_restore_memory(memory_block *tmem) { expr_free_all(); if (tmblk != NULL) { free(tmblk->start); free(tmblk); } tmblk = tmem; }