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
|
#!/bin/sh
##############################################################################
# Copyright (c) 2007-2010,2011 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. #
##############################################################################
# $Id: MKcaptab.sh,v 1.14 2011/10/22 16:34:50 tom Exp $
AWK=${1-awk}
OPT1=${2-0}
OPT2=${3-tinfo/MKcaptab.awk}
DATA=${4-../include/Caps}
cat <<EOF
/*
* generated by $0
*/
EOF
cat <<'EOF'
/*
* comp_captab.c -- The names of the capabilities indexed via a hash
* table for the compiler.
*
*/
#include <curses.priv.h>
#include <tic.h>
#include <hashsize.h>
EOF
./make_hash 1 info $OPT1 <$DATA
./make_hash 3 cap $OPT1 <$DATA
$AWK -f $OPT2 bigstrings=$OPT1 tablename=capalias <$DATA
$AWK -f $OPT2 bigstrings=$OPT1 tablename=infoalias <$DATA
cat <<EOF
#if $OPT1
static void
next_string(const char *strings, unsigned *offset)
{
*offset += (unsigned) strlen(strings + *offset) + 1;
}
static const struct name_table_entry *
_nc_build_names(struct name_table_entry **actual,
const name_table_data *source,
const char *strings)
{
if (*actual == 0) {
*actual = typeCalloc(struct name_table_entry, CAPTABSIZE);
if (*actual != 0) {
unsigned n;
unsigned len = 0;
for (n = 0; n < CAPTABSIZE; ++n) {
(*actual)[n].nte_name = strings + len;
(*actual)[n].nte_type = source[n].nte_type;
(*actual)[n].nte_index = source[n].nte_index;
(*actual)[n].nte_link = source[n].nte_link;
next_string(strings, &len);
}
}
}
return *actual;
}
#define add_alias(field) \\
if (source[n].field >= 0) { \\
(*actual)[n].field = strings + source[n].field; \\
}
static const struct alias *
_nc_build_alias(struct alias **actual,
const alias_table_data *source,
const char *strings,
size_t tablesize)
{
if (*actual == 0) {
*actual = typeCalloc(struct alias, tablesize + 1);
if (*actual != 0) {
size_t n;
for (n = 0; n < tablesize; ++n) {
add_alias(from);
add_alias(to);
add_alias(source);
}
}
}
return *actual;
}
#define build_names(root) _nc_build_names(&_nc_##root##_table, \\
root##_names_data, \\
root##_names_text)
#define build_alias(root) _nc_build_alias(&_nc_##root##alias_table, \\
root##alias_data, \\
root##alias_text, \\
SIZEOF(root##alias_data))
#else
#define build_names(root) _nc_ ## root ## _table
#define build_alias(root) _nc_ ## root ## alias_table
#endif
NCURSES_EXPORT(const struct name_table_entry *) _nc_get_table (bool termcap)
{
return termcap ? build_names(cap) : build_names(info) ;
}
/* entrypoint used by tack (do not alter) */
NCURSES_EXPORT(const HashValue *) _nc_get_hash_table (bool termcap)
{
return termcap ? _nc_cap_hash_table: _nc_info_hash_table ;
}
NCURSES_EXPORT(const struct alias *) _nc_get_alias_table (bool termcap)
{
return termcap ? build_alias(cap) : build_alias(info) ;
}
static HashValue
info_hash(const char *string)
{
long sum = 0;
DEBUG(9, ("hashing %s", string));
while (*string) {
sum += (long) (*string + (*(string + 1) << 8));
string++;
}
DEBUG(9, ("sum is %ld", sum));
return (HashValue) (sum % HASHTABSIZE);
}
#define TCAP_LEN 2 /* only 1- or 2-character names are used */
static HashValue
tcap_hash(const char *string)
{
char temp[TCAP_LEN + 1];
int limit = 0;
while (*string) {
temp[limit++] = *string++;
if (limit >= TCAP_LEN)
break;
}
temp[limit] = '\0';
return info_hash(temp);
}
static int
compare_tcap_names(const char *a, const char *b)
{
return !strncmp(a, b, (size_t) TCAP_LEN);
}
static int
compare_info_names(const char *a, const char *b)
{
return !strcmp(a, b);
}
static const HashData hash_data[2] = {
{ HASHTABSIZE, _nc_info_hash_table, info_hash, compare_info_names },
{ HASHTABSIZE, _nc_cap_hash_table, tcap_hash, compare_tcap_names }
};
NCURSES_EXPORT(const HashData *) _nc_get_hash_info (bool termcap)
{
return &hash_data[(termcap != FALSE)];
}
#if NO_LEAKS
NCURSES_EXPORT(void) _nc_comp_captab_leaks(void)
{
#if $OPT1
FreeIfNeeded(_nc_cap_table);
FreeIfNeeded(_nc_info_table);
FreeIfNeeded(_nc_capalias_table);
FreeIfNeeded(_nc_infoalias_table);
#endif
}
#endif /* NO_LEAKS */
EOF
|
