/src/xpdf-4.06/goo/GHash.cc

Source
//========================================================================
//
// GHash.cc
//
// Copyright 2001-2003 Glyph & Cog, LLC
//
//========================================================================

#include <aconf.h>

#include "gmem.h"
#include "gmempp.h"
#include "GString.h"
#include "GHash.h"

//------------------------------------------------------------------------

struct GHashBucket {
  GString *key;
  union {
    void *p;
    int i;
  } val;
  GHashBucket *next;
};

struct GHashIter {
  int h;
  GHashBucket *p;
};

//------------------------------------------------------------------------

GHash::GHash(GBool deleteKeysA) {
  int h;

  deleteKeys = deleteKeysA;
  size = 7;
  tab = (GHashBucket **)gmallocn(size, sizeof(GHashBucket *));
  for (h = 0; h < size; ++h) {
    tab[h] = NULL;
  }
  len = 0;
}

GHash::~GHash() {
  GHashBucket *p;
  int h;

  for (h = 0; h < size; ++h) {
    while (tab[h]) {
      p = tab[h];
      tab[h] = p->next;
      if (deleteKeys) {
  delete p->key;
      }
      delete p;
    }
  }
  gfree(tab);
}

void GHash::add(GString *key, void *val) {
  GHashBucket *p;
  int h;

  // expand the table if necessary
  if (len >= size) {
    expand();
  }

  // add the new symbol
  p = new GHashBucket;
  p->key = key;
  p->val.p = val;
  h = hash(key);
  p->next = tab[h];
  tab[h] = p;
  ++len;
}

void GHash::add(GString *key, int val) {
  GHashBucket *p;
  int h;

  // expand the table if necessary
  if (len >= size) {
    expand();
  }

  // add the new symbol
  p = new GHashBucket;
  p->key = key;
  p->val.i = val;
  h = hash(key);
  p->next = tab[h];
  tab[h] = p;
  ++len;
}

void GHash::replace(GString *key, void *val) {
  GHashBucket *p;
  int h;

  if ((p = find(key, &h))) {
    p->val.p = val;
    if (deleteKeys) {
      delete key;
    }
  } else {
    add(key, val);
  }
}

void GHash::replace(GString *key, int val) {
  GHashBucket *p;
  int h;

  if ((p = find(key, &h))) {
    p->val.i = val;
    if (deleteKeys) {
      delete key;
    }
  } else {
    add(key, val);
  }
}

void *GHash::lookup(GString *key) {
  GHashBucket *p;
  int h;

  if (!(p = find(key, &h))) {
    return NULL;
  }
  return p->val.p;
}

int GHash::lookupInt(GString *key) {
  GHashBucket *p;
  int h;

  if (!(p = find(key, &h))) {
    return 0;
  }
  return p->val.i;
}

void *GHash::lookup(const char *key) {
  GHashBucket *p;
  int h;

  if (!(p = find(key, &h))) {
    return NULL;
  }
  return p->val.p;
}

int GHash::lookupInt(const char *key) {
  GHashBucket *p;
  int h;

  if (!(p = find(key, &h))) {
    return 0;
  }
  return p->val.i;
}

void *GHash::remove(GString *key) {
  GHashBucket *p;
  GHashBucket **q;
  void *val;
  int h;

  if (!(p = find(key, &h))) {
    return NULL;
  }
  q = &tab[h];
  while (*q != p) {
    q = &((*q)->next);
  }
  *q = p->next;
  if (deleteKeys) {
    delete p->key;
  }
  val = p->val.p;
  delete p;
  --len;
  return val;
}

int GHash::removeInt(GString *key) {
  GHashBucket *p;
  GHashBucket **q;
  int val;
  int h;

  if (!(p = find(key, &h))) {
    return 0;
  }
  q = &tab[h];
  while (*q != p) {
    q = &((*q)->next);
  }
  *q = p->next;
  if (deleteKeys) {
    delete p->key;
  }
  val = p->val.i;
  delete p;
  --len;
  return val;
}

void *GHash::remove(const char *key) {
  GHashBucket *p;
  GHashBucket **q;
  void *val;
  int h;

  if (!(p = find(key, &h))) {
    return NULL;
  }
  q = &tab[h];
  while (*q != p) {
    q = &((*q)->next);
  }
  *q = p->next;
  if (deleteKeys) {
    delete p->key;
  }
  val = p->val.p;
  delete p;
  --len;
  return val;
}

int GHash::removeInt(const char *key) {
  GHashBucket *p;
  GHashBucket **q;
  int val;
  int h;

  if (!(p = find(key, &h))) {
    return 0;
  }
  q = &tab[h];
  while (*q != p) {
    q = &((*q)->next);
  }
  *q = p->next;
  if (deleteKeys) {
    delete p->key;
  }
  val = p->val.i;
  delete p;
  --len;
  return val;
}

void GHash::startIter(GHashIter **iter) {
  *iter = new GHashIter;
  (*iter)->h = -1;
  (*iter)->p = NULL;
}

GBool GHash::getNext(GHashIter **iter, GString **key, void **val) {
  if (!*iter) {
    return gFalse;
  }
  if ((*iter)->p) {
    (*iter)->p = (*iter)->p->next;
  }
  while (!(*iter)->p) {
    if (++(*iter)->h == size) {
      delete *iter;
      *iter = NULL;
      return gFalse;
    }
    (*iter)->p = tab[(*iter)->h];
  }
  *key = (*iter)->p->key;
  *val = (*iter)->p->val.p;
  return gTrue;
}

GBool GHash::getNext(GHashIter **iter, GString **key, int *val) {
  if (!*iter) {
    return gFalse;
  }
  if ((*iter)->p) {
    (*iter)->p = (*iter)->p->next;
  }
  while (!(*iter)->p) {
    if (++(*iter)->h == size) {
      delete *iter;
      *iter = NULL;
      return gFalse;
    }
    (*iter)->p = tab[(*iter)->h];
  }
  *key = (*iter)->p->key;
  *val = (*iter)->p->val.i;
  return gTrue;
}

void GHash::killIter(GHashIter **iter) {
  delete *iter;
  *iter = NULL;
}

void GHash::expand() {
  GHashBucket **oldTab;
  GHashBucket *p;
  int oldSize, h, i;

  oldSize = size;
  oldTab = tab;
  size = 2*size + 1;
  tab = (GHashBucket **)gmallocn(size, sizeof(GHashBucket *));
  for (h = 0; h < size; ++h) {
    tab[h] = NULL;
  }
  for (i = 0; i < oldSize; ++i) {
    while (oldTab[i]) {
      p = oldTab[i];
      oldTab[i] = oldTab[i]->next;
      h = hash(p->key);
      p->next = tab[h];
      tab[h] = p;
    }
  }
  gfree(oldTab);
}

GHashBucket *GHash::find(GString *key, int *h) {
  GHashBucket *p;

  *h = hash(key);
  for (p = tab[*h]; p; p = p->next) {
    if (!p->key->cmp(key)) {
      return p;
    }
  }
  return NULL;
}

GHashBucket *GHash::find(const char *key, int *h) {
  GHashBucket *p;

  *h = hash(key);
  for (p = tab[*h]; p; p = p->next) {
    if (!p->key->cmp(key)) {
      return p;
    }
  }
  return NULL;
}

int GHash::hash(GString *key) {
  const char *p;
  unsigned int h;
  int i;

  h = 0;
  for (p = key->getCString(), i = 0; i < key->getLength(); ++p, ++i) {
    h = 17 * h + (int)(*p & 0xff);
  }
  return (int)(h % size);
}

int GHash::hash(const char *key) {
  const char *p;
  unsigned int h;

  h = 0;
  for (p = key; *p; ++p) {
    h = 17 * h + (int)(*p & 0xff);
  }
  return (int)(h % size);
}

Coverage Report

Created: 2026-03-31 07:04

Line	Count	Source
1		//========================================================================
2		//
3		// GHash.cc
4		//
5		// Copyright 2001-2003 Glyph & Cog, LLC
6		//
7		//========================================================================
8
9		#include <aconf.h>
10
11		#include "gmem.h"
12		#include "gmempp.h"
13		#include "GString.h"
14		#include "GHash.h"
15
16		//------------------------------------------------------------------------
17
18		struct GHashBucket {
19		GString *key;
20		union {
21		void *p;
22		int i;
23		} val;
24		GHashBucket *next;
25		};
26
27		struct GHashIter {
28		int h;
29		GHashBucket *p;
30		};
31
32		//------------------------------------------------------------------------
33
34	2.82M	GHash::GHash(GBool deleteKeysA) {
35	2.82M	int h;
36
37	2.82M	deleteKeys = deleteKeysA;
38	2.82M	size = 7;
39	2.82M	tab = (GHashBucket *)gmallocn(size, sizeof(GHashBucket ));
40	22.6M	for (h = 0; h < size; ++h) {
41	19.8M	tab[h] = NULL;
42	19.8M	}
43	2.82M	len = 0;
44	2.82M	}
45
46	2.82M	GHash::~GHash() {
47	2.82M	GHashBucket *p;
48	2.82M	int h;
49
50	23.9M	for (h = 0; h < size; ++h) {
51	22.5M	while (tab[h]) {
52	1.40M	p = tab[h];
53	1.40M	tab[h] = p->next;
54	1.40M	if (deleteKeys) {
55	207k	delete p->key;
56	207k	}
57	1.40M	delete p;
58	1.40M	}
59	21.1M	}
60	2.82M	gfree(tab);
61	2.82M	}
62
63	1.30M	void GHash::add(GString key, void val) {
64	1.30M	GHashBucket *p;
65	1.30M	int h;
66
67		// expand the table if necessary
68	1.30M	if (len >= size) {
69	7.80k	expand();
70	7.80k	}
71
72		// add the new symbol
73	1.30M	p = new GHashBucket;
74	1.30M	p->key = key;
75	1.30M	p->val.p = val;
76	1.30M	h = hash(key);
77	1.30M	p->next = tab[h];
78	1.30M	tab[h] = p;
79	1.30M	++len;
80	1.30M	}
81
82	117k	void GHash::add(GString *key, int val) {
83	117k	GHashBucket *p;
84	117k	int h;
85
86		// expand the table if necessary
87	117k	if (len >= size) {
88	3.98k	expand();
89	3.98k	}
90
91		// add the new symbol
92	117k	p = new GHashBucket;
93	117k	p->key = key;
94	117k	p->val.i = val;
95	117k	h = hash(key);
96	117k	p->next = tab[h];
97	117k	tab[h] = p;
98	117k	++len;
99	117k	}
100
101	0	void GHash::replace(GString key, void val) {
102	0	GHashBucket *p;
103	0	int h;
104
105	0	if ((p = find(key, &h))) {
106	0	p->val.p = val;
107	0	if (deleteKeys) {
108	0	delete key;
109	0	}
110	0	} else {
111	0	add(key, val);
112	0	}
113	0	}
114
115	59.1k	void GHash::replace(GString *key, int val) {
116	59.1k	GHashBucket *p;
117	59.1k	int h;
118
119	59.1k	if ((p = find(key, &h))) {
120	20.2k	p->val.i = val;
121	20.2k	if (deleteKeys) {
122	0	delete key;
123	0	}
124	38.8k	} else {
125	38.8k	add(key, val);
126	38.8k	}
127	59.1k	}
128
129	160k	void GHash::lookup(GString key) {
130	160k	GHashBucket *p;
131	160k	int h;
132
133	160k	if (!(p = find(key, &h))) {
134	160k	return NULL;
135	160k	}
136	215	return p->val.p;
137	160k	}
138
139	64.5k	int GHash::lookupInt(GString *key) {
140	64.5k	GHashBucket *p;
141	64.5k	int h;
142
143	64.5k	if (!(p = find(key, &h))) {
144	44.2k	return 0;
145	44.2k	}
146	20.2k	return p->val.i;
147	64.5k	}
148
149	2.18M	void GHash::lookup(const char key) {
150	2.18M	GHashBucket *p;
151	2.18M	int h;
152
153	2.18M	if (!(p = find(key, &h))) {
154	2.06M	return NULL;
155	2.06M	}
156	123k	return p->val.p;
157	2.18M	}
158
159	728k	int GHash::lookupInt(const char *key) {
160	728k	GHashBucket *p;
161	728k	int h;
162
163	728k	if (!(p = find(key, &h))) {
164	655k	return 0;
165	655k	}
166	72.4k	return p->val.i;
167	728k	}
168
169	0	void GHash::remove(GString key) {
170	0	GHashBucket *p;
171	0	GHashBucket **q;
172	0	void *val;
173	0	int h;
174
175	0	if (!(p = find(key, &h))) {
176	0	return NULL;
177	0	}
178	0	q = &tab[h];
179	0	while (*q != p) {
180	0	q = &((*q)->next);
181	0	}
182	0	*q = p->next;
183	0	if (deleteKeys) {
184	0	delete p->key;
185	0	}
186	0	val = p->val.p;
187	0	delete p;
188	0	--len;
189	0	return val;
190	0	}
191
192	1.76k	int GHash::removeInt(GString *key) {
193	1.76k	GHashBucket *p;
194	1.76k	GHashBucket **q;
195	1.76k	int val;
196	1.76k	int h;
197
198	1.76k	if (!(p = find(key, &h))) {
199	125	return 0;
200	125	}
201	1.63k	q = &tab[h];
202	1.71k	while (*q != p) {
203	80	q = &((*q)->next);
204	80	}
205	1.63k	*q = p->next;
206	1.63k	if (deleteKeys) {
207	1.63k	delete p->key;
208	1.63k	}
209	1.63k	val = p->val.i;
210	1.63k	delete p;
211	1.63k	--len;
212	1.63k	return val;
213	1.76k	}
214
215	0	void GHash::remove(const char key) {
216	0	GHashBucket *p;
217	0	GHashBucket **q;
218	0	void *val;
219	0	int h;
220
221	0	if (!(p = find(key, &h))) {
222	0	return NULL;
223	0	}
224	0	q = &tab[h];
225	0	while (*q != p) {
226	0	q = &((*q)->next);
227	0	}
228	0	*q = p->next;
229	0	if (deleteKeys) {
230	0	delete p->key;
231	0	}
232	0	val = p->val.p;
233	0	delete p;
234	0	--len;
235	0	return val;
236	0	}
237
238	6.30k	int GHash::removeInt(const char *key) {
239	6.30k	GHashBucket *p;
240	6.30k	GHashBucket **q;
241	6.30k	int val;
242	6.30k	int h;
243
244	6.30k	if (!(p = find(key, &h))) {
245	198	return 0;
246	198	}
247	6.10k	q = &tab[h];
248	6.71k	while (*q != p) {
249	611	q = &((*q)->next);
250	611	}
251	6.10k	*q = p->next;
252	6.10k	if (deleteKeys) {
253	6.10k	delete p->key;
254	6.10k	}
255	6.10k	val = p->val.i;
256	6.10k	delete p;
257	6.10k	--len;
258	6.10k	return val;
259	6.30k	}
260
261	2.74M	void GHash::startIter(GHashIter **iter) {
262	2.74M	*iter = new GHashIter;
263	2.74M	(*iter)->h = -1;
264	2.74M	(*iter)->p = NULL;
265	2.74M	}
266
267	4.04M	GBool GHash::getNext(GHashIter iter, GString key, void **val) {
268	4.04M	if (!*iter) {
269	0	return gFalse;
270	0	}
271	4.04M	if ((*iter)->p) {
272	1.30M	(iter)->p = (iter)->p->next;
273	1.30M	}
274	24.5M	while (!(*iter)->p) {
275	23.2M	if (++(*iter)->h == size) {
276	2.74M	delete *iter;
277	2.74M	*iter = NULL;
278	2.74M	return gFalse;
279	2.74M	}
280	20.4M	(iter)->p = tab[(iter)->h];
281	20.4M	}
282	1.30M	key = (iter)->p->key;
283	1.30M	val = (iter)->p->val.p;
284	1.30M	return gTrue;
285	4.04M	}
286
287	0	GBool GHash::getNext(GHashIter iter, GString key, int *val) {
288	0	if (!*iter) {
289	0	return gFalse;
290	0	}
291	0	if ((*iter)->p) {
292	0	(iter)->p = (iter)->p->next;
293	0	}
294	0	while (!(*iter)->p) {
295	0	if (++(*iter)->h == size) {
296	0	delete *iter;
297	0	*iter = NULL;
298	0	return gFalse;
299	0	}
300	0	(iter)->p = tab[(iter)->h];
301	0	}
302	0	key = (iter)->p->key;
303	0	val = (iter)->p->val.i;
304	0	return gTrue;
305	0	}
306
307	7	void GHash::killIter(GHashIter **iter) {
308	7	delete *iter;
309	7	*iter = NULL;
310	7	}
311
312	11.7k	void GHash::expand() {
313	11.7k	GHashBucket **oldTab;
314	11.7k	GHashBucket *p;
315	11.7k	int oldSize, h, i;
316
317	11.7k	oldSize = size;
318	11.7k	oldTab = tab;
319	11.7k	size = 2*size + 1;
320	11.7k	tab = (GHashBucket *)gmallocn(size, sizeof(GHashBucket ));
321	2.70M	for (h = 0; h < size; ++h) {
322	2.69M	tab[h] = NULL;
323	2.69M	}
324	1.35M	for (i = 0; i < oldSize; ++i) {
325	2.68M	while (oldTab[i]) {
326	1.34M	p = oldTab[i];
327	1.34M	oldTab[i] = oldTab[i]->next;
328	1.34M	h = hash(p->key);
329	1.34M	p->next = tab[h];
330	1.34M	tab[h] = p;
331	1.34M	}
332	1.34M	}
333	11.7k	gfree(oldTab);
334	11.7k	}
335
336	285k	GHashBucket GHash::find(GString key, int *h) {
337	285k	GHashBucket *p;
338
339	285k	*h = hash(key);
340	307k	for (p = tab[*h]; p; p = p->next) {
341	64.1k	if (!p->key->cmp(key)) {
342	42.4k	return p;
343	42.4k	}
344	64.1k	}
345	243k	return NULL;
346	285k	}
347
348	2.92M	GHashBucket GHash::find(const char key, int *h) {
349	2.92M	GHashBucket *p;
350
351	2.92M	*h = hash(key);
352	3.01M	for (p = tab[*h]; p; p = p->next) {
353	295k	if (!p->key->cmp(key)) {
354	201k	return p;
355	201k	}
356	295k	}
357	2.72M	return NULL;
358	2.92M	}
359
360	3.04M	int GHash::hash(GString *key) {
361	3.04M	const char *p;
362	3.04M	unsigned int h;
363	3.04M	int i;
364
365	3.04M	h = 0;
366	31.7M	for (p = key->getCString(), i = 0; i < key->getLength(); ++p, ++i) {
367	28.6M	h = 17 * h + (int)(*p & 0xff);
368	28.6M	}
369	3.04M	return (int)(h % size);
370	3.04M	}
371
372	2.92M	int GHash::hash(const char *key) {
373	2.92M	const char *p;
374	2.92M	unsigned int h;
375
376	2.92M	h = 0;
377	34.7M	for (p = key; *p; ++p) {
378	31.8M	h = 17 * h + (int)(*p & 0xff);
379	31.8M	}
380	2.92M	return (int)(h % size);
381	2.92M	}