1 |
< |
/* RCSid: $Id$ */ |
1 |
> |
/* RCSid $Id$ */ |
2 |
|
/* |
3 |
|
* Header file for general associative table lookup routines |
4 |
|
*/ |
5 |
+ |
#ifndef _RAD_LOOKUP_H_ |
6 |
+ |
#define _RAD_LOOKUP_H_ |
7 |
|
|
8 |
< |
/* ==================================================================== |
9 |
< |
* The Radiance Software License, Version 1.0 |
10 |
< |
* |
9 |
< |
* Copyright (c) 1990 - 2002 The Regents of the University of California, |
10 |
< |
* through Lawrence Berkeley National Laboratory. All rights reserved. |
11 |
< |
* |
12 |
< |
* Redistribution and use in source and binary forms, with or without |
13 |
< |
* modification, are permitted provided that the following conditions |
14 |
< |
* are met: |
15 |
< |
* |
16 |
< |
* 1. Redistributions of source code must retain the above copyright |
17 |
< |
* notice, this list of conditions and the following disclaimer. |
18 |
< |
* |
19 |
< |
* 2. Redistributions in binary form must reproduce the above copyright |
20 |
< |
* notice, this list of conditions and the following disclaimer in |
21 |
< |
* the documentation and/or other materials provided with the |
22 |
< |
* distribution. |
23 |
< |
* |
24 |
< |
* 3. The end-user documentation included with the redistribution, |
25 |
< |
* if any, must include the following acknowledgment: |
26 |
< |
* "This product includes Radiance software |
27 |
< |
* (http://radsite.lbl.gov/) |
28 |
< |
* developed by the Lawrence Berkeley National Laboratory |
29 |
< |
* (http://www.lbl.gov/)." |
30 |
< |
* Alternately, this acknowledgment may appear in the software itself, |
31 |
< |
* if and wherever such third-party acknowledgments normally appear. |
32 |
< |
* |
33 |
< |
* 4. The names "Radiance," "Lawrence Berkeley National Laboratory" |
34 |
< |
* and "The Regents of the University of California" must |
35 |
< |
* not be used to endorse or promote products derived from this |
36 |
< |
* software without prior written permission. For written |
37 |
< |
* permission, please contact [email protected]. |
38 |
< |
* |
39 |
< |
* 5. Products derived from this software may not be called "Radiance", |
40 |
< |
* nor may "Radiance" appear in their name, without prior written |
41 |
< |
* permission of Lawrence Berkeley National Laboratory. |
42 |
< |
* |
43 |
< |
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED |
44 |
< |
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
45 |
< |
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
46 |
< |
* DISCLAIMED. IN NO EVENT SHALL Lawrence Berkeley National Laboratory OR |
47 |
< |
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
48 |
< |
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
49 |
< |
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF |
50 |
< |
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND |
51 |
< |
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
52 |
< |
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT |
53 |
< |
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
54 |
< |
* SUCH DAMAGE. |
55 |
< |
* ==================================================================== |
56 |
< |
* |
57 |
< |
* This software consists of voluntary contributions made by many |
58 |
< |
* individuals on behalf of Lawrence Berkeley National Laboratory. For more |
59 |
< |
* information on Lawrence Berkeley National Laboratory, please see |
60 |
< |
* <http://www.lbl.gov/>. |
61 |
< |
*/ |
8 |
> |
#ifdef __cplusplus |
9 |
> |
extern "C" { |
10 |
> |
#endif |
11 |
|
|
12 |
+ |
typedef void lut_free_t(void *p); |
13 |
+ |
typedef unsigned long lut_hashf_t(const void *); |
14 |
+ |
typedef int lut_keycmpf_t(const void *, const void *); |
15 |
+ |
|
16 |
|
typedef struct { |
17 |
|
char *key; /* key name */ |
18 |
|
unsigned long hval; /* key hash value (for efficiency) */ |
20 |
|
} LUENT; |
21 |
|
|
22 |
|
typedef struct { |
23 |
< |
unsigned long (*hashf)(); /* key hash function */ |
24 |
< |
int (*keycmp)(); /* key comparison function */ |
25 |
< |
void (*freek)(); /* free a key */ |
26 |
< |
void (*freed)(); /* free the data */ |
23 |
> |
lut_hashf_t *hashf; /* key hash function */ |
24 |
> |
lut_keycmpf_t *keycmp; /* key comparison function */ |
25 |
> |
lut_free_t *freek; /* free a key */ |
26 |
> |
lut_free_t *freed; /* free the data */ |
27 |
|
int tsiz; /* current table size */ |
28 |
|
LUENT *tabl; /* table, if allocated */ |
29 |
|
int ndel; /* number of deleted entries */ |
30 |
|
} LUTAB; |
31 |
|
|
79 |
– |
#undef strcmp |
80 |
– |
#define LU_SINIT(fk,fd) {lu_shash,strcmp,(void (*)())(fk),\ |
81 |
– |
(void (*)())(fd),0,NULL,0} |
32 |
|
|
33 |
|
/* |
34 |
|
* The lu_init routine is called to initialize a table. The number of |
77 |
|
* allocated table itself. |
78 |
|
*/ |
79 |
|
|
80 |
< |
extern int strcmp(); |
80 |
> |
typedef int lut_doallf_t(const LUENT *e, void *p); |
81 |
|
|
82 |
< |
#ifdef NOPROTO |
133 |
< |
|
134 |
< |
extern int lu_init(); |
135 |
< |
extern LUENT *lu_find(); |
136 |
< |
extern void lu_delete(); |
137 |
< |
extern int lu_doall(); |
138 |
< |
extern void lu_done(); |
139 |
< |
extern unsigned long lu_shash(); |
140 |
< |
|
141 |
< |
#else |
142 |
< |
|
82 |
> |
extern lut_keycmpf_t lu_strcmp; |
83 |
|
extern int lu_init(LUTAB *tbl, int nel); |
84 |
< |
extern unsigned long lu_shash(char *s); |
85 |
< |
extern LUENT *lu_find(LUTAB *tbl, char *key); |
86 |
< |
extern void lu_delete(LUTAB *tbl, char *key); |
87 |
< |
extern int lu_doall(LUTAB *tbl, int (*f)()); |
84 |
> |
extern unsigned long lu_shash(const void *s); |
85 |
> |
extern LUENT *lu_find(LUTAB *tbl, const char *key); |
86 |
> |
extern void lu_delete(LUTAB *tbl, const char *key); |
87 |
> |
extern int lu_doall(const LUTAB *tbl, lut_doallf_t *f, void *p); |
88 |
|
extern void lu_done(LUTAB *tbl); |
89 |
|
|
90 |
+ |
#define LU_SINIT(fk,fd) {lu_shash,lu_strcmp,fk,fd,0,NULL,0} |
91 |
+ |
|
92 |
+ |
#ifdef __cplusplus |
93 |
+ |
} |
94 |
|
#endif |
95 |
+ |
#endif /* _RAD_LOOKUP_H_ */ |
96 |
+ |
|