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
|
/****************************************************************************
* Copyright 2019,2020 Thomas E. Dickey *
* Copyright 1998-2008,2009 Free Software Foundation, Inc. *
* *
* Permission is hereby granted, free of charge, to any person obtaining a *
* copy of this software and associated documentation files (the *
* "Software"), to deal in the Software without restriction, including *
* without limitation the rights to use, copy, modify, merge, publish, *
* distribute, distribute with modifications, sublicense, and/or sell *
* copies of the Software, and to permit persons to whom the Software is *
* furnished to do so, subject to the following conditions: *
* *
* The above copyright notice and this permission notice shall be included *
* in all copies or substantial portions of the Software. *
* *
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS *
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF *
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. *
* IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, *
* DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR *
* OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR *
* THE USE OR OTHER DEALINGS IN THE SOFTWARE. *
* *
* Except as contained in this notice, the name(s) of the above copyright *
* holders shall not be used in advertising or otherwise to promote the *
* sale, use or other dealings in this Software without prior written *
* authorization. *
****************************************************************************/
/****************************************************************************
* Author: Zeyd M. Ben-Halim <zmbenhal@netcom.com> 1992,1995 *
* and: Eric S. Raymond <esr@snark.thyrsus.com> *
* and: Thomas E. Dickey 1996-on *
****************************************************************************/
/*
* comp_hash.c --- Routines to deal with the hashtable of capability
* names.
*
*/
#define USE_TERMLIB 1
#include <curses.priv.h>
#include <tic.h>
#include <hashsize.h>
MODULE_ID("$Id: comp_hash.c,v 1.53 2020/02/02 23:34:34 tom Exp $")
/*
* 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.
*/
/* entrypoint used by tack 1.07 */
NCURSES_EXPORT(struct name_table_entry const *)
_nc_find_entry(const char *string,
const HashValue * hash_table)
{
bool termcap = (hash_table != _nc_get_hash_table(FALSE));
const HashData *data = _nc_get_hash_info(termcap);
int hashvalue;
struct name_table_entry const *ptr = 0;
struct name_table_entry const *real_table;
hashvalue = data->hash_of(string);
if (hashvalue >= 0
&& (unsigned) hashvalue < data->table_size
&& data->table_data[hashvalue] >= 0) {
real_table = _nc_get_table(termcap);
ptr = real_table + data->table_data[hashvalue];
while (!data->compare_names(ptr->nte_name, string)) {
if (ptr->nte_link < 0) {
ptr = 0;
break;
}
ptr = real_table + (ptr->nte_link
+ data->table_data[data->table_size]);
}
}
return (ptr);
}
/*
* Finds the entry for the given name with the given type in the given table if
* present (as distinct from _nc_find_entry, which finds the last entry
* regardless of type).
*
* Returns a pointer to the entry in the table or 0 if not found.
*/
NCURSES_EXPORT(struct name_table_entry const *)
_nc_find_type_entry(const char *string,
int type,
bool termcap)
{
struct name_table_entry const *ptr = NULL;
const HashData *data = _nc_get_hash_info(termcap);
int hashvalue = data->hash_of(string);
if (hashvalue >= 0
&& (unsigned) hashvalue < data->table_size
&& data->table_data[hashvalue] >= 0) {
const struct name_table_entry *const table = _nc_get_table(termcap);
ptr = table + data->table_data[hashvalue];
while (ptr->nte_type != type
|| !data->compare_names(ptr->nte_name, string)) {
if (ptr->nte_link < 0) {
ptr = 0;
break;
}
ptr = table + (ptr->nte_link + data->table_data[data->table_size]);
}
}
return ptr;
}
#if NCURSES_XNAMES
NCURSES_EXPORT(struct user_table_entry const *)
_nc_find_user_entry(const char *string)
{
const HashData *data = _nc_get_hash_user();
int hashvalue;
struct user_table_entry const *ptr = 0;
struct user_table_entry const *real_table;
hashvalue = data->hash_of(string);
if (hashvalue >= 0
&& (unsigned) hashvalue < data->table_size
&& data->table_data[hashvalue] >= 0) {
real_table = _nc_get_userdefs_table();
ptr = real_table + data->table_data[hashvalue];
while (!data->compare_names(ptr->ute_name, string)) {
if (ptr->ute_link < 0) {
ptr = 0;
break;
}
ptr = real_table + (ptr->ute_link
+ data->table_data[data->table_size]);
}
}
return (ptr);
}
#endif /* NCURSES_XNAMES */
|
