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
|
/* For copyright information, see olden_v1.0/COPYRIGHT */
#include "ssplain.h"
#ifdef SS_PLAIN
#include "mst.h"
#else SS_PLAIN
#include "hash.h"
#endif SS_PLAIN
#include <string.h>
#define assert(num,a) if (!(a)) {chatting("Assertion failure:%d in hash\n",num); exit(-1);}
#undef assert
#define assert(num,a)
#ifndef CCURED
#define __NOCUREBLOCK
#endif
#ifdef CCURED
#pragma ccuredalloc("localmalloc", nozero, sizein(1))
#endif
static char *localmalloc(int size);
static int remaining = 0;
static char *temp;
static char *localmalloc(int size) {
char *blah;
if (size>remaining)
{
temp = (char *) malloc(32768);
if (!temp) chatting("Error! malloc returns null\n");
remaining = 32768;
}
blah = temp;
temp += size;
remaining -= size;
return blah;
}
#define localfree(sz)
Hash MakeHash(int size, int (*map)(unsigned int))
{
Hash retval;
retval = (Hash) localmalloc(sizeof(*retval));
retval->array = (HashEntry *) localmalloc(size*sizeof(retval->array[0]));
{ __NOCUREBLOCK
memset((char*)retval->array, 0, size * sizeof(retval->array[0]));
}
retval->mapfunc = map;
retval->size = size;
retval->padding = 0;
return retval;
}
void *HashLookup(unsigned int key, Hash hash)
{
int j;
HashEntry ent;
j = (hash->mapfunc)(key);
assert(1,j>=0);
assert(2,j<hash->size);
for (ent = hash->array[j]; ent && ent->key!=key; ent=ent->next) ;
if (ent) return ent->entry;
return NULL;
}
void HashInsert(void *entry,unsigned int key,Hash hash)
{
HashEntry ent;
int j;
assert(3,!HashLookup(key,hash));
j = (hash->mapfunc)(key);
ent = (HashEntry) localmalloc(sizeof(*ent));
ent->next = hash->array[j];
hash->array[j]=ent;
ent->key = key;
ent->entry = entry;
}
void HashDelete(unsigned int key,Hash hash)
{
HashEntry *ent;
HashEntry tmp;
int j;
j = (hash->mapfunc)(key);
for (ent=&(hash->array[j]); (*ent) && (*ent)->key!=key; ent=&((*ent)->next));
assert(4,*ent);
tmp = *ent;
*ent = (*ent)->next;
localfree(tmp);
}
|
