1*b30d1939SAndy Fiddaman /***********************************************************************
2*b30d1939SAndy Fiddaman * *
3*b30d1939SAndy Fiddaman * This software is part of the ast package *
4*b30d1939SAndy Fiddaman * Copyright (c) 1985-2011 AT&T Intellectual Property *
5*b30d1939SAndy Fiddaman * and is licensed under the *
6*b30d1939SAndy Fiddaman * Eclipse Public License, Version 1.0 *
7*b30d1939SAndy Fiddaman * by AT&T Intellectual Property *
8*b30d1939SAndy Fiddaman * *
9*b30d1939SAndy Fiddaman * A copy of the License is available at *
10*b30d1939SAndy Fiddaman * http://www.eclipse.org/org/documents/epl-v10.html *
11*b30d1939SAndy Fiddaman * (with md5 checksum b35adb5213ca9657e911e9befb180842) *
12*b30d1939SAndy Fiddaman * *
13*b30d1939SAndy Fiddaman * Information and Software Systems Research *
14*b30d1939SAndy Fiddaman * AT&T Research *
15*b30d1939SAndy Fiddaman * Florham Park NJ *
16*b30d1939SAndy Fiddaman * *
17*b30d1939SAndy Fiddaman * Glenn Fowler <gsf@research.att.com> *
18*b30d1939SAndy Fiddaman * David Korn <dgk@research.att.com> *
19*b30d1939SAndy Fiddaman * Phong Vo <kpv@research.att.com> *
20*b30d1939SAndy Fiddaman * *
21*b30d1939SAndy Fiddaman ***********************************************************************/
22*b30d1939SAndy Fiddaman /*
23*b30d1939SAndy Fiddaman * hsearch() for systems that have <search.h> but no hsearch()
24*b30d1939SAndy Fiddaman * why would such a system provide the interface but not the
25*b30d1939SAndy Fiddaman * implementation? that's what happens when one slimes their
26*b30d1939SAndy Fiddaman * way through standards compliance
27*b30d1939SAndy Fiddaman *
28*b30d1939SAndy Fiddaman * NOTE: please excuse the crude feature test
29*b30d1939SAndy Fiddaman */
30*b30d1939SAndy Fiddaman
31*b30d1939SAndy Fiddaman #if !_UWIN
32*b30d1939SAndy Fiddaman
_STUB_hsearch()33*b30d1939SAndy Fiddaman void _STUB_hsearch(){}
34*b30d1939SAndy Fiddaman
35*b30d1939SAndy Fiddaman #else
36*b30d1939SAndy Fiddaman
37*b30d1939SAndy Fiddaman #if _PACKAGE_ast
38*b30d1939SAndy Fiddaman #include <ast.h>
39*b30d1939SAndy Fiddaman #endif
40*b30d1939SAndy Fiddaman
41*b30d1939SAndy Fiddaman #define hcreate ______hcreate
42*b30d1939SAndy Fiddaman #define hdestroy ______hdestroy
43*b30d1939SAndy Fiddaman #define hsearch ______hsearch
44*b30d1939SAndy Fiddaman
45*b30d1939SAndy Fiddaman #include <search.h>
46*b30d1939SAndy Fiddaman
47*b30d1939SAndy Fiddaman #undef hcreate
48*b30d1939SAndy Fiddaman #undef hdestroy
49*b30d1939SAndy Fiddaman #undef hsearch
50*b30d1939SAndy Fiddaman
51*b30d1939SAndy Fiddaman #include "dthdr.h"
52*b30d1939SAndy Fiddaman
53*b30d1939SAndy Fiddaman #if defined(__EXPORT__)
54*b30d1939SAndy Fiddaman #define extern __EXPORT__
55*b30d1939SAndy Fiddaman #endif
56*b30d1939SAndy Fiddaman
57*b30d1939SAndy Fiddaman /* POSIX hsearch library based on libdt
58*b30d1939SAndy Fiddaman ** Written by Kiem-Phong Vo (AT&T Research, 07/19/95)
59*b30d1939SAndy Fiddaman */
60*b30d1939SAndy Fiddaman
61*b30d1939SAndy Fiddaman /* type of objects in hash table */
62*b30d1939SAndy Fiddaman typedef struct _hash_s
63*b30d1939SAndy Fiddaman { Dtlink_t link;
64*b30d1939SAndy Fiddaman ENTRY item;
65*b30d1939SAndy Fiddaman } Hash_t;
66*b30d1939SAndy Fiddaman
67*b30d1939SAndy Fiddaman /* object delete function */
68*b30d1939SAndy Fiddaman #if __STD_C
hashfree(Dt_t * dt,Void_t * obj,Dtdisc_t * disc)69*b30d1939SAndy Fiddaman static void hashfree(Dt_t* dt, Void_t* obj, Dtdisc_t* disc)
70*b30d1939SAndy Fiddaman #else
71*b30d1939SAndy Fiddaman static void hashfree(dt, obj, disc)
72*b30d1939SAndy Fiddaman Dt_t* dt;
73*b30d1939SAndy Fiddaman Void_t* obj;
74*b30d1939SAndy Fiddaman Dtdisc_t* disc;
75*b30d1939SAndy Fiddaman #endif
76*b30d1939SAndy Fiddaman {
77*b30d1939SAndy Fiddaman free(((Hash_t*)obj)->item.key);
78*b30d1939SAndy Fiddaman free(obj);
79*b30d1939SAndy Fiddaman }
80*b30d1939SAndy Fiddaman
81*b30d1939SAndy Fiddaman static Dt_t* Hashtab; /* object dictionary */
82*b30d1939SAndy Fiddaman static Dtdisc_t Hashdisc = /* discipline */
83*b30d1939SAndy Fiddaman { sizeof(Dtlink_t), -1,
84*b30d1939SAndy Fiddaman 0,
85*b30d1939SAndy Fiddaman NIL(Dtmake_f), hashfree,
86*b30d1939SAndy Fiddaman NIL(Dtcompar_f), /* always use strcmp */
87*b30d1939SAndy Fiddaman NIL(Dthash_f),
88*b30d1939SAndy Fiddaman NIL(Dtmemory_f),
89*b30d1939SAndy Fiddaman NIL(Dtevent_f)
90*b30d1939SAndy Fiddaman };
91*b30d1939SAndy Fiddaman
92*b30d1939SAndy Fiddaman extern
93*b30d1939SAndy Fiddaman #if __STD_C
hcreate(size_t nel)94*b30d1939SAndy Fiddaman int hcreate(size_t nel)
95*b30d1939SAndy Fiddaman #else
96*b30d1939SAndy Fiddaman int hcreate(nel)
97*b30d1939SAndy Fiddaman size_t nel;
98*b30d1939SAndy Fiddaman #endif
99*b30d1939SAndy Fiddaman {
100*b30d1939SAndy Fiddaman if(Hashtab) /* already opened */
101*b30d1939SAndy Fiddaman return 0;
102*b30d1939SAndy Fiddaman
103*b30d1939SAndy Fiddaman if(!(Hashtab = dtopen(&Hashdisc,Dtset)) )
104*b30d1939SAndy Fiddaman return 0;
105*b30d1939SAndy Fiddaman
106*b30d1939SAndy Fiddaman return 1;
107*b30d1939SAndy Fiddaman }
108*b30d1939SAndy Fiddaman
hdestroy()109*b30d1939SAndy Fiddaman extern void hdestroy()
110*b30d1939SAndy Fiddaman { if(Hashtab)
111*b30d1939SAndy Fiddaman dtclose(Hashtab);
112*b30d1939SAndy Fiddaman Hashtab = NIL(Dt_t*);
113*b30d1939SAndy Fiddaman }
114*b30d1939SAndy Fiddaman
115*b30d1939SAndy Fiddaman extern
116*b30d1939SAndy Fiddaman #if __STD_C
hsearch(ENTRY item,ACTION action)117*b30d1939SAndy Fiddaman ENTRY* hsearch(ENTRY item, ACTION action)
118*b30d1939SAndy Fiddaman #else
119*b30d1939SAndy Fiddaman ENTRY* hsearch(item, action)
120*b30d1939SAndy Fiddaman ENTRY item;
121*b30d1939SAndy Fiddaman ACTION action;
122*b30d1939SAndy Fiddaman #endif
123*b30d1939SAndy Fiddaman {
124*b30d1939SAndy Fiddaman reg Hash_t* o;
125*b30d1939SAndy Fiddaman
126*b30d1939SAndy Fiddaman if(!Hashtab)
127*b30d1939SAndy Fiddaman return NIL(ENTRY*);
128*b30d1939SAndy Fiddaman
129*b30d1939SAndy Fiddaman if(!(o = (Hash_t*)dtmatch(Hashtab,item.key)) && action == ENTER &&
130*b30d1939SAndy Fiddaman (o = (Hash_t*)malloc(sizeof(Hash_t)) ) )
131*b30d1939SAndy Fiddaman { o->item = item;
132*b30d1939SAndy Fiddaman o = (Hash_t*)dtinsert(Hashtab,o);
133*b30d1939SAndy Fiddaman }
134*b30d1939SAndy Fiddaman
135*b30d1939SAndy Fiddaman return o ? &(o->item) : NIL(ENTRY*);
136*b30d1939SAndy Fiddaman }
137*b30d1939SAndy Fiddaman
138*b30d1939SAndy Fiddaman #endif
139