Home | History | Annotate | Line # | Download | only in make
hash.h revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1988, 1989, 1990 The Regents of the University of California.
      3  1.1  cgd  * Copyright (c) 1988, 1989 by Adam de Boor
      4  1.1  cgd  * Copyright (c) 1989 by Berkeley Softworks
      5  1.1  cgd  * All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * This code is derived from software contributed to Berkeley by
      8  1.1  cgd  * Adam de Boor.
      9  1.1  cgd  *
     10  1.1  cgd  * Redistribution and use in source and binary forms, with or without
     11  1.1  cgd  * modification, are permitted provided that the following conditions
     12  1.1  cgd  * are met:
     13  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     15  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     16  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     17  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     18  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     19  1.1  cgd  *    must display the following acknowledgement:
     20  1.1  cgd  *	This product includes software developed by the University of
     21  1.1  cgd  *	California, Berkeley and its contributors.
     22  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     23  1.1  cgd  *    may be used to endorse or promote products derived from this software
     24  1.1  cgd  *    without specific prior written permission.
     25  1.1  cgd  *
     26  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  1.1  cgd  * SUCH DAMAGE.
     37  1.1  cgd  *
     38  1.1  cgd  *	@(#)hash.h	5.4 (Berkeley) 12/28/90
     39  1.1  cgd  */
     40  1.1  cgd 
     41  1.1  cgd /* hash.h --
     42  1.1  cgd  *
     43  1.1  cgd  * 	This file contains definitions used by the hash module,
     44  1.1  cgd  * 	which maintains hash tables.
     45  1.1  cgd  */
     46  1.1  cgd 
     47  1.1  cgd #ifndef	_HASH
     48  1.1  cgd #define	_HASH
     49  1.1  cgd 
     50  1.1  cgd /*
     51  1.1  cgd  * The following defines one entry in the hash table.
     52  1.1  cgd  */
     53  1.1  cgd 
     54  1.1  cgd typedef struct Hash_Entry {
     55  1.1  cgd     struct Hash_Entry *next;		/* Used to link together all the
     56  1.1  cgd     					 * entries associated with the same
     57  1.1  cgd 					 * bucket. */
     58  1.1  cgd     ClientData	      clientData;	/* Arbitrary piece of data associated
     59  1.1  cgd     					 * with key. */
     60  1.1  cgd     unsigned	      namehash;		/* hash value of key */
     61  1.1  cgd     char	      name[1];		/* key string */
     62  1.1  cgd } Hash_Entry;
     63  1.1  cgd 
     64  1.1  cgd typedef struct Hash_Table {
     65  1.1  cgd     struct Hash_Entry **bucketPtr;/* Pointers to Hash_Entry, one
     66  1.1  cgd     				 * for each bucket in the table. */
     67  1.1  cgd     int 	size;		/* Actual size of array. */
     68  1.1  cgd     int 	numEntries;	/* Number of entries in the table. */
     69  1.1  cgd     int 	mask;		/* Used to select bits for hashing. */
     70  1.1  cgd } Hash_Table;
     71  1.1  cgd 
     72  1.1  cgd /*
     73  1.1  cgd  * The following structure is used by the searching routines
     74  1.1  cgd  * to record where we are in the search.
     75  1.1  cgd  */
     76  1.1  cgd 
     77  1.1  cgd typedef struct Hash_Search {
     78  1.1  cgd     Hash_Table  *tablePtr;	/* Table being searched. */
     79  1.1  cgd     int 	nextIndex;	/* Next bucket to check (after current). */
     80  1.1  cgd     Hash_Entry 	*hashEntryPtr;	/* Next entry to check in current bucket. */
     81  1.1  cgd } Hash_Search;
     82  1.1  cgd 
     83  1.1  cgd /*
     84  1.1  cgd  * Macros.
     85  1.1  cgd  */
     86  1.1  cgd 
     87  1.1  cgd /*
     88  1.1  cgd  * ClientData Hash_GetValue(h)
     89  1.1  cgd  *     Hash_Entry *h;
     90  1.1  cgd  */
     91  1.1  cgd 
     92  1.1  cgd #define Hash_GetValue(h) ((h)->clientData)
     93  1.1  cgd 
     94  1.1  cgd /*
     95  1.1  cgd  * Hash_SetValue(h, val);
     96  1.1  cgd  *     Hash_Entry *h;
     97  1.1  cgd  *     char *val;
     98  1.1  cgd  */
     99  1.1  cgd 
    100  1.1  cgd #define Hash_SetValue(h, val) ((h)->clientData = (ClientData) (val))
    101  1.1  cgd 
    102  1.1  cgd /*
    103  1.1  cgd  * Hash_Size(n) returns the number of words in an object of n bytes
    104  1.1  cgd  */
    105  1.1  cgd 
    106  1.1  cgd #define	Hash_Size(n)	(((n) + sizeof (int) - 1) / sizeof (int))
    107  1.1  cgd 
    108  1.1  cgd /*
    109  1.1  cgd  * The following procedure declarations and macros
    110  1.1  cgd  * are the only things that should be needed outside
    111  1.1  cgd  * the implementation code.
    112  1.1  cgd  */
    113  1.1  cgd 
    114  1.1  cgd extern Hash_Entry *	Hash_CreateEntry();
    115  1.1  cgd extern void		Hash_DeleteTable();
    116  1.1  cgd extern void		Hash_DeleteEntry();
    117  1.1  cgd extern void		Hash_DeleteTable();
    118  1.1  cgd extern Hash_Entry *	Hash_EnumFirst();
    119  1.1  cgd extern Hash_Entry *	Hash_EnumNext();
    120  1.1  cgd extern Hash_Entry *	Hash_FindEntry();
    121  1.1  cgd extern void		Hash_InitTable();
    122  1.1  cgd extern void		Hash_PrintStats();
    123  1.1  cgd 
    124  1.1  cgd #endif _HASH
    125