Home | History | Annotate | Line # | Download | only in lint2
hash.c revision 1.13
      1  1.13    rillig /*	$NetBSD: hash.c,v 1.13 2021/01/16 02:40:02 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.9       jmc #if HAVE_NBTOOL_CONFIG_H
     35   1.9       jmc #include "nbtool_config.h"
     36   1.9       jmc #endif
     37   1.9       jmc 
     38   1.4  christos #include <sys/cdefs.h>
     39   1.8        tv #if defined(__RCSID) && !defined(lint)
     40  1.13    rillig __RCSID("$NetBSD: hash.c,v 1.13 2021/01/16 02:40:02 rillig Exp $");
     41   1.1       cgd #endif
     42   1.1       cgd 
     43   1.3       cgd /*
     44   1.3       cgd  * XXX Really need a generalized hash table package
     45   1.3       cgd  */
     46   1.3       cgd 
     47   1.7        tv #include <limits.h>
     48   1.1       cgd #include <stddef.h>
     49   1.4  christos #include <stdlib.h>
     50   1.1       cgd #include <string.h>
     51   1.1       cgd 
     52   1.1       cgd #include "lint2.h"
     53   1.1       cgd 
     54   1.1       cgd /* pointer to hash table, initialized in inithash() */
     55   1.1       cgd static	hte_t	**htab;
     56   1.1       cgd 
     57   1.6     lukem static	int	hash(const char *);
     58   1.1       cgd 
     59   1.1       cgd /*
     60   1.1       cgd  * Initialize hash table.
     61   1.1       cgd  */
     62   1.1       cgd void
     63   1.6     lukem _inithash(hte_t ***tablep)
     64   1.1       cgd {
     65   1.3       cgd 
     66   1.3       cgd 	if (tablep == NULL)
     67   1.3       cgd 		tablep = &htab;
     68   1.3       cgd 
     69   1.3       cgd 	*tablep = xcalloc(HSHSIZ2, sizeof (hte_t *));
     70   1.1       cgd }
     71   1.1       cgd 
     72   1.1       cgd /*
     73   1.1       cgd  * Compute hash value from a string.
     74   1.1       cgd  */
     75   1.1       cgd static int
     76   1.6     lukem hash(const char *s)
     77   1.1       cgd {
     78   1.1       cgd 	u_int	v;
     79   1.1       cgd 	const	u_char *us;
     80   1.1       cgd 
     81   1.1       cgd 	v = 0;
     82   1.1       cgd 	for (us = (const u_char *)s; *us != '\0'; us++) {
     83   1.1       cgd 		v = (v << sizeof (v)) + *us;
     84   1.1       cgd 		v ^= v >> (sizeof (v) * CHAR_BIT - sizeof (v));
     85   1.1       cgd 	}
     86  1.12    rillig 	return v % HSHSIZ2;
     87   1.1       cgd }
     88   1.1       cgd 
     89   1.1       cgd /*
     90   1.1       cgd  * Look for a hash table entry. If no hash table entry for the
     91   1.1       cgd  * given name exists and mknew is set, create a new one.
     92   1.1       cgd  */
     93   1.1       cgd hte_t *
     94  1.13    rillig _hsearch(hte_t **table, const char *s, bool mknew)
     95   1.1       cgd {
     96   1.1       cgd 	int	h;
     97   1.1       cgd 	hte_t	*hte;
     98   1.1       cgd 
     99   1.3       cgd 	if (table == NULL)
    100   1.3       cgd 		table = htab;
    101   1.3       cgd 
    102   1.1       cgd 	h = hash(s);
    103   1.3       cgd 	for (hte = table[h]; hte != NULL; hte = hte->h_link) {
    104   1.1       cgd 		if (strcmp(hte->h_name, s) == 0)
    105   1.1       cgd 			break;
    106   1.1       cgd 	}
    107   1.1       cgd 
    108   1.1       cgd 	if (hte != NULL || !mknew)
    109  1.12    rillig 		return hte;
    110   1.1       cgd 
    111   1.1       cgd 	/* create a new hte */
    112   1.3       cgd 	hte = xmalloc(sizeof (hte_t));
    113   1.1       cgd 	hte->h_name = xstrdup(s);
    114  1.13    rillig 	hte->h_used = false;
    115  1.13    rillig 	hte->h_def = false;
    116  1.13    rillig 	hte->h_static = false;
    117   1.5   mycroft 	hte->h_syms = NULL;
    118   1.1       cgd 	hte->h_lsym = &hte->h_syms;
    119   1.5   mycroft 	hte->h_calls = NULL;
    120   1.1       cgd 	hte->h_lcall = &hte->h_calls;
    121   1.5   mycroft 	hte->h_usyms = NULL;
    122   1.1       cgd 	hte->h_lusym = &hte->h_usyms;
    123   1.3       cgd 	hte->h_link = table[h];
    124   1.3       cgd 	hte->h_hte = NULL;
    125   1.3       cgd 	table[h] = hte;
    126   1.1       cgd 
    127  1.12    rillig 	return hte;
    128   1.1       cgd }
    129   1.1       cgd 
    130   1.1       cgd /*
    131   1.1       cgd  * Call function f for each name in the hash table.
    132   1.1       cgd  */
    133   1.1       cgd void
    134   1.6     lukem _forall(hte_t **table, void (*f)(hte_t *))
    135   1.1       cgd {
    136   1.1       cgd 	int	i;
    137   1.1       cgd 	hte_t	*hte;
    138   1.1       cgd 
    139   1.3       cgd 	if (table == NULL)
    140   1.3       cgd 		table = htab;
    141   1.3       cgd 
    142   1.1       cgd 	for (i = 0; i < HSHSIZ2; i++) {
    143   1.3       cgd 		for (hte = table[i]; hte != NULL; hte = hte->h_link)
    144   1.1       cgd 			(*f)(hte);
    145   1.1       cgd 	}
    146   1.3       cgd }
    147   1.3       cgd 
    148   1.3       cgd /*
    149   1.3       cgd  * Free all contents of the hash table that this module allocated.
    150   1.3       cgd  */
    151   1.3       cgd void
    152   1.6     lukem _destroyhash(hte_t **table)
    153   1.3       cgd {
    154   1.3       cgd 	int	i;
    155   1.3       cgd 	hte_t	*hte, *nexthte;
    156   1.3       cgd 
    157   1.3       cgd 	if (table == NULL)
    158   1.3       cgd 		err(1, "_destroyhash called on main hash table");
    159   1.3       cgd 
    160   1.3       cgd 	for (i = 0; i < HSHSIZ2; i++) {
    161   1.3       cgd 		for (hte = table[i]; hte != NULL; hte = nexthte) {
    162  1.11  christos 			free(__UNCONST(hte->h_name));
    163   1.3       cgd 			nexthte = hte->h_link;
    164   1.3       cgd 			free(hte);
    165   1.3       cgd 		}
    166   1.3       cgd 	}
    167   1.3       cgd 	free(table);
    168   1.1       cgd }
    169