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