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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
|
/*
* Motif Tools Library, Version 3.1
* $Id$
*
* Written by David Flanagan.
* Copyright (c) 1992-2001 by David Flanagan.
* All Rights Reserved. See the file COPYRIGHT for details.
* This is open source software. See the file LICENSE for details.
* There is no warranty for this software. See NO_WARRANTY for details.
*
* $Log$
* Revision 1.1.1.1 2001/07/18 11:06:02 root
* Initial checkin.
*
* Revision 1.2 2001/06/12 16:25:28 andre
* *** empty log message ***
*
*
*/
/*
* This file is derived from the X11R5 source code.
* See the file COPYRIGHT for the MIT and Digital copyrights.
*/
#include <Xmt/Xmt.h>
#include <Xmt/Hash.h>
typedef struct _Bucket { /* Stores one entry. */
XtPointer key;
XtPointer data;
struct _Bucket *next;
} Bucket;
typedef struct _XmtHashTableRec {
Bucket **table; /* Pointer to array of hash entries. */
long size; /* log2 of the size */
long mask; /* Current size of hash table minus 1. */
long numentries; /* Number of entries currently in table. */
} XmtHashTableRec;
#define Hash(ht,key) \
(ht)->table[(((long)(key)) >> 2) & (ht)->mask]
#if NeedFunctionPrototypes
static void ResizeTable(register XmtHashTable ht, Boolean grow)
#else
static void ResizeTable(ht, grow)
register XmtHashTable ht;
Boolean grow;
#endif
{
Bucket **otable;
long otablesize;
register Bucket *bucket, *next, **head;
register long i;
otable = ht->table;
otablesize = 1 << ht->size;
if (grow) ht->size++;
else if (ht->size > 2) ht->size--;
else return;
ht->table = (Bucket **) XtCalloc(1<<ht->size, sizeof(Bucket *));
ht->mask = (1<<ht->size) - 1;
for(i=0; i < otablesize; i++) {
for(bucket = otable[i]; bucket; bucket = next) {
next = bucket->next;
head = &Hash(ht, bucket->key);
bucket->next = *head;
*head = bucket;
}
}
XtFree((char *) otable);
}
#if NeedFunctionPrototypes
XmtHashTable XmtHashTableCreate(int size)
#else
XmtHashTable XmtHashTableCreate(size)
int size;
#endif
{
XmtHashTable ht = (XmtHashTable) XtMalloc(sizeof(XmtHashTableRec));
ht->size = size;
ht->mask = (1<<size)-1;
ht->table = (Bucket **)XtCalloc(ht->mask + 1, sizeof(Bucket *));
ht->numentries = 0;
return ht;
}
#if NeedFunctionPrototypes
void XmtHashTableDestroy(XmtHashTable ht)
#else
void XmtHashTableDestroy(ht)
XmtHashTable ht;
#endif
{
register long i;
register Bucket *bucket, *next;
for(i=0; i < ht->mask+1; i++) {
for (bucket = ht->table[i]; bucket; bucket = next) {
next = bucket->next;
XtFree((char *)bucket);
}
}
XtFree((char *) ht->table);
XtFree((char *) ht);
}
#if NeedFunctionPrototypes
void XmtHashTableForEach(XmtHashTable table, XmtHashTableForEachProc proc)
#else
void XmtHashTableForEach(table, proc)
XmtHashTable table;
XmtHashTableForEachProc proc;
#endif
{
register long i;
register Bucket *bucket;
for(i=0; i < table->mask+1; i++) {
for (bucket = table->table[i]; bucket; bucket = bucket->next)
(*proc)(table, bucket->key, &bucket->data);
}
}
#if NeedFunctionPrototypes
void XmtHashTableStore(XmtHashTable table, XtPointer key, XtPointer data)
#else
void XmtHashTableStore(table, key, data)
XmtHashTable table;
XtPointer key;
XtPointer data;
#endif
{
Bucket **head;
register Bucket *bucket;
head = &Hash(table, key);
for (bucket = *head; bucket; bucket = bucket->next) {
if (bucket->key == key) {
bucket->data = data;
return;
}
}
bucket = XtNew(Bucket);
bucket->key = key;
bucket->data = data;
bucket->next = *head;
*head = bucket;
table->numentries++;
if (table->numentries > table->mask)
ResizeTable(table, True);
return;
}
#if NeedFunctionPrototypes
Boolean XmtHashTableLookup(XmtHashTable table, XtPointer key, XtPointer *data)
#else
Boolean XmtHashTableLookup(table, key, data)
XmtHashTable table;
XtPointer key;
XtPointer *data;
#endif
{
register Bucket *bucket;
for (bucket = Hash(table, key); bucket; bucket = bucket->next)
{
if (bucket->key == key) {
*data = bucket->data;
return True;
}
}
return False;
}
#if NeedFunctionPrototypes
void XmtHashTableDelete(XmtHashTable table, XtPointer key)
#else
void XmtHashTableDelete(table, key)
XmtHashTable table;
XtPointer key;
#endif
{
register Bucket *bucket, **prev;
for (prev = &Hash(table, key); (bucket = *prev); prev = &bucket->next) {
if (bucket->key == key) {
*prev = bucket->next;
XtFree((char *) bucket);
table->numentries--;
if (table->numentries < (table->mask>>1))
ResizeTable(table, False);
return;
}
}
}
|
