src/common/lookup.h

/* RCSid $Id: lookup.h,v 2.8 2003/06/06 16:38:47 schorsch Exp $ */
/*
 * Header file for general associative table lookup routines
 */
#ifndef _RAD_LOOKUP_H_
#define _RAD_LOOKUP_H_
#ifdef __cplusplus
extern "C" {
#endif

typedef struct {
        char    *key;                   /* key name */
        unsigned long   hval;           /* key hash value (for efficiency) */
        char    *data;                  /* pointer to client data */
} LUENT;

typedef struct {
        unsigned long   (*hashf)();     /* key hash function */
        int     (*keycmp)();            /* key comparison function */
        void    (*freek)();             /* free a key */
        void    (*freed)();             /* free the data */
        int     tsiz;                   /* current table size */
        LUENT   *tabl;                  /* table, if allocated */
        int     ndel;                   /* number of deleted entries */
} LUTAB;

#undef strcmp
#define LU_SINIT(fk,fd)         {lu_shash,strcmp,(void (*)())(fk),\
                                (void (*)())(fd),0,NULL,0}

/*
 * The lu_init routine is called to initialize a table.  The number of
 * elements passed is not a limiting factor, as a table can grow to
 * any size permitted by memory.  However, access will be more efficient
 * if this number strikes a reasonable balance between default memory use
 * and the expected (minimum) table size.  The value returned is the
 * actual allocated table size (or zero if there was insufficient memory).
 *
 * The hashf, keycmp, freek and freed member functions must be assigned
 * separately.  If the hash value is sufficient to guarantee equality
 * between keys, then the keycmp pointer may be NULL.  Otherwise, it
 * should return 0 if the two passed keys match.  If it is not necessary
 * (or possible) to free the key and/or data values, then the freek and/or
 * freed member functions may be NULL.
 *
 * It isn't fully necessary to call lu_init to initialize the LUTAB structure.
 * If tsiz is 0, then the first call to lu_find will allocate a minimal table.
 * The LU_SINIT macro provides a convenient static declaration for character
 * string keys.
 *
 * The lu_find routine returns the entry corresponding to the given
 * key.  If the entry does not exist, the corresponding key field will
 * be NULL.  If the entry has been previously deleted but not yet freed,
 * then only the data field will be NULL.  It is the caller's
 * responsibility to (allocate and) assign the key and data fields when
 * creating a new entry.  The only case where lu_find returns NULL is when
 * the system has run out of memory.
 *
 * The lu_delete routine frees an entry's data (if any) by calling
 * the freed member function, but does not free the key field.  This
 * will be freed later during (or instead of) table reallocation.
 * It is therefore an error to reuse or do anything with the key
 * field after calling lu_delete.
 *
 * The lu_doall routine loops through every filled table entry, calling
 * the given function once on each entry.  If a NULL pointer is passed
 * for this function, then lu_doall simply returns the total number of
 * active entries.  Otherwise, it returns the sum of all the function
 * evaluations.
 *
 * The lu_done routine calls the given free function once for each
 * assigned table entry (i.e. each entry with an assigned key value).
 * The user must define these routines to free the key and the data
 * in the LU_TAB structure.  The final action of lu_done is to free the
 * allocated table itself.
 */

#include <string.h> /* strcmp() */

extern int      lu_init(LUTAB *tbl, int nel);
extern unsigned long    lu_shash(char *s);
extern LUENT    *lu_find(LUTAB *tbl, char *key);
extern void     lu_delete(LUTAB *tbl, char *key);
extern int      lu_doall(LUTAB *tbl, int (*f)());
extern void     lu_done(LUTAB *tbl);


#ifdef __cplusplus
}
#endif
#endif /* _RAD_LOOKUP_H_ */

Revision:	2.9
Committed:	Fri Jun 27 06:53:21 2003 UTC (20 years, 10 months ago) by greg
Content type:	text/plain
Branch:	MAIN
Changes since 2.8:	+1 -4 lines
Log Message:	Broke standard.h into rtio.h, rterror.h, rtmath.h, and rtmisc.h
#	User	Rev	Content
1	greg	2.9	/* RCSid $Id: lookup.h,v 2.8 2003/06/06 16:38:47 schorsch Exp $ */
2	greg	2.1	/*
3			* Header file for general associative table lookup routines
4			*/
5	schorsch	2.8	#ifndef _RAD_LOOKUP_H_
6			#define _RAD_LOOKUP_H_
7			#ifdef __cplusplus
8			extern "C" {
9			#endif
10	greg	2.6
11	greg	2.1	typedef struct {
12	gwlarson	2.5	char key; / key name */
13			unsigned long hval; /* key hash value (for efficiency) */
14			char data; / pointer to client data */
15	greg	2.1	} LUENT;
16
17			typedef struct {
18	gwlarson	2.5	unsigned long (hashf)(); / key hash function */
19			int (keycmp)(); / key comparison function */
20			void (freek)(); / free a key */
21			void (freed)(); / free the data */
22			int tsiz; /* current table size */
23			LUENT tabl; / table, if allocated */
24			int ndel; /* number of deleted entries */
25	greg	2.1	} LUTAB;
26
27	gregl	2.3	#undef strcmp
28	greg	2.1	#define LU_SINIT(fk,fd) {lu_shash,strcmp,(void (*)())(fk),\
29			(void (*)())(fd),0,NULL,0}
30
31			/*
32			* The lu_init routine is called to initialize a table. The number of
33			* elements passed is not a limiting factor, as a table can grow to
34			* any size permitted by memory. However, access will be more efficient
35			* if this number strikes a reasonable balance between default memory use
36			* and the expected (minimum) table size. The value returned is the
37			* actual allocated table size (or zero if there was insufficient memory).
38			*
39			* The hashf, keycmp, freek and freed member functions must be assigned
40			* separately. If the hash value is sufficient to guarantee equality
41			* between keys, then the keycmp pointer may be NULL. Otherwise, it
42			* should return 0 if the two passed keys match. If it is not necessary
43			* (or possible) to free the key and/or data values, then the freek and/or
44			* freed member functions may be NULL.
45			*
46			* It isn't fully necessary to call lu_init to initialize the LUTAB structure.
47			* If tsiz is 0, then the first call to lu_find will allocate a minimal table.
48			* The LU_SINIT macro provides a convenient static declaration for character
49			* string keys.
50			*
51			* The lu_find routine returns the entry corresponding to the given
52			* key. If the entry does not exist, the corresponding key field will
53			* be NULL. If the entry has been previously deleted but not yet freed,
54			* then only the data field will be NULL. It is the caller's
55			* responsibility to (allocate and) assign the key and data fields when
56			* creating a new entry. The only case where lu_find returns NULL is when
57			* the system has run out of memory.
58			*
59			* The lu_delete routine frees an entry's data (if any) by calling
60			* the freed member function, but does not free the key field. This
61			* will be freed later during (or instead of) table reallocation.
62	greg	2.2	* It is therefore an error to reuse or do anything with the key
63			* field after calling lu_delete.
64	greg	2.1	*
65	gwlarson	2.4	* The lu_doall routine loops through every filled table entry, calling
66			* the given function once on each entry. If a NULL pointer is passed
67			* for this function, then lu_doall simply returns the total number of
68			* active entries. Otherwise, it returns the sum of all the function
69			* evaluations.
70			*
71	greg	2.1	* The lu_done routine calls the given free function once for each
72			* assigned table entry (i.e. each entry with an assigned key value).
73			* The user must define these routines to free the key and the data
74			* in the LU_TAB structure. The final action of lu_done is to free the
75			* allocated table itself.
76			*/
77
78	schorsch	2.8	#include <string.h> /* strcmp() */
79	greg	2.6
80			extern int lu_init(LUTAB *tbl, int nel);
81			extern unsigned long lu_shash(char *s);
82			extern LUENT lu_find(LUTAB tbl, char *key);
83			extern void lu_delete(LUTAB tbl, char key);
84			extern int lu_doall(LUTAB tbl, int (f)());
85			extern void lu_done(LUTAB *tbl);
86
87	schorsch	2.8
88			#ifdef __cplusplus
89			}
90	greg	2.6	#endif
91	schorsch	2.8	#endif /* _RAD_LOOKUP_H_ */
92