src/common/lookup.h

/* RCSid $Id: lookup.h,v 2.14 2004/05/25 22:04:13 greg Exp $ */
/*
 * Header file for general associative table lookup routines
 */
#ifndef _RAD_LOOKUP_H_
#define _RAD_LOOKUP_H_

#ifdef __cplusplus
extern "C" {
#endif

typedef void lut_free_t(void *p);
typedef unsigned long lut_hashf_t(const char *);
typedef int lut_keycmpf_t(const char *, const char *);

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

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


/*
 * 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.
 */

typedef int lut_doallf_t(const LUENT *e, void *p);

extern int      lu_init(LUTAB *tbl, int nel);
extern lut_hashf_t      lu_shash;
extern LUENT    *lu_find(LUTAB *tbl, const char *key);
extern void     lu_delete(LUTAB *tbl, const char *key);
extern int      lu_doall(const LUTAB *tbl, lut_doallf_t *f, void *p);
extern void     lu_done(LUTAB *tbl);

#define LU_SINIT(fk,fd) {lu_shash,strcmp,fk,fd,0,NULL,0}

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

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