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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1988 AT&T */
/* All Rights Reserved */
/*
* University Copyright- Copyright (c) 1982, 1986, 1988
* The Regents of the University of California
* All Rights Reserved
*
* University Acknowledgment- Portions of this document are derived from
* software developed by the University of California, Berkeley, and its
* contributors.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
*************************************************************************
* COPYRIGHT NOTICE *
*************************************************************************
* This software is copyright(C) 1982 by Pavel Curtis *
* *
* Permission is granted to reproduce and distribute *
* this file by any means so long as no fee is charged *
* above a nominal handling fee and so long as this *
* notice is always included in the copies. *
* *
* Other rights are reserved except as explicitly granted *
* by written permission of the author. *
* Pavel Curtis *
* Computer Science Dept. *
* 405 Upson Hall *
* Cornell University *
* Ithaca, NY 14853 *
* *
* Ph- (607) 256-4934 *
* *
* Pavel.Cornell@Udel-Relay(ARPAnet) *
* decvax!cornell!pavel(UUCPnet) *
*********************************************************************** */
/*
* comp_hash.c --- Routines to deal with the hashtable of capability
* names.
*
* $Log: RCS/comp_hash.v $
* Revision 2.1 82/10/25 14:45:34 pavel
* Added Copyright Notice
*
* Revision 2.0 82/10/24 15:16:34 pavel
* Beta-one Test Release
*
* Revision 1.3 82/08/23 22:29:33 pavel
* The REAL Alpha-one Release Version
*
* Revision 1.2 82/08/19 19:09:46 pavel
* Alpha Test Release One
*
* Revision 1.1 82/08/12 18:36:23 pavel
* Initial revision
*
*
*/
#include <strings.h>
#include "curses_inc.h"
#include "compiler.h"
static void make_nte(void);
static int hash_function(char *);
/*
* make_hash_table()
*
* Takes the entries in cap_table[] and hashes them into cap_hash_table[]
* by name. There are Captabsize entries in cap_table[] and Hashtabsize
* slots in cap_hash_table[].
*
*/
void
make_hash_table()
{
int i;
int hashvalue;
int collisions = 0;
make_nte();
for (i = 0; i < Captabsize; i++) {
hashvalue = hash_function(cap_table[i].nte_name);
DEBUG(9, "%d\n", hashvalue);
if (cap_hash_table[hashvalue] != (struct name_table_entry *) 0)
collisions++;
cap_table[i].nte_link = cap_hash_table[hashvalue];
cap_hash_table[hashvalue] = &cap_table[i];
}
DEBUG(3, "Hash table complete\n%d collisions ", collisions);
DEBUG(3, "out of %d entries\n", Captabsize);
return;
}
/*
* Make the name_table_entry from the capnames.c set of tables.
*/
static void
make_nte(void)
{
int i, n;
extern char *boolnames[], *numnames[], *strnames[];
n = 0;
for (i = 0; boolnames[i]; i++) {
cap_table[n].nte_link = NULL;
cap_table[n].nte_name = boolnames[i];
cap_table[n].nte_type = BOOLEAN;
cap_table[n].nte_index = i;
n++;
}
BoolCount = i;
for (i = 0; numnames[i]; i++) {
cap_table[n].nte_link = NULL;
cap_table[n].nte_name = numnames[i];
cap_table[n].nte_type = NUMBER;
cap_table[n].nte_index = i;
n++;
}
NumCount = i;
for (i = 0; strnames[i]; i++) {
cap_table[n].nte_link = NULL;
cap_table[n].nte_name = strnames[i];
cap_table[n].nte_type = STRING;
cap_table[n].nte_index = i;
n++;
}
StrCount = i;
Captabsize = n;
}
/*
* int hash_function(string)
*
* Computes the hashing function on the given string.
*
* The current hash function is the sum of each consectutive pair
* of characters, taken as two-byte integers, mod Hashtabsize.
*
*/
static int
hash_function(char *string)
{
long sum = 0;
while (*string) {
sum += *string + (*(string + 1) << 8);
string++;
}
return (sum % Hashtabsize);
}
/*
* struct name_table_entry *
* find_entry(string)
*
* Finds the entry for the given string in the hash table if present.
* Returns a pointer to the entry in the table or 0 if not found.
*
*/
struct name_table_entry *
find_entry(char *string)
{
int hashvalue;
struct name_table_entry *ptr;
hashvalue = hash_function(string);
ptr = cap_hash_table[hashvalue];
while (ptr != (struct name_table_entry *) 0 &&
strcmp(ptr->nte_name, string) != 0)
ptr = ptr->nte_link;
return (ptr);
}
|
