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
|
/* This file is part of the Project Athena Zephyr Notification System.
* It contains the main loop of the Zephyr server
*
* Created by: Lucien W. Van Elsen
*
* $Id: e7d0820e5563e293aca2abede3b04f235804fc0b $
*
* Copyright (c) 1991 by the Massachusetts Institute of Technology.
* For copying and distribution information, see the file
* "mit-copyright.h".
*/
#include <zephyr/mit-copyright.h>
#include "zserver.h"
#ifndef lint
#ifndef SABER
static const char rcsid_zstring_c[] =
"$Id: e7d0820e5563e293aca2abede3b04f235804fc0b $";
#endif
#endif
static String *zhash[STRING_HASH_TABLE_SIZE];
static int
valid_utf8_p(const char* s)
{
ssize_t len;
int32_t uc;
while ((len = utf8proc_iterate((const unsigned char *)s, -1, &uc))) {
if (len <=0) return 0; /* Not valid UTF-8 encoding. */
if (!(utf8proc_codepoint_valid(uc))) return 0; /* Not valid unicode codepoint. */
if (uc == 0) return 1; /* NULL, we're done. */
s += len;
}
return 0; /* We shouldn't get here. */
}
static char *zdowncase(const char* s)
{
unsigned char *new_s_u; /* Avoid strict aliasing violation */
char *new_s, *p;
if (valid_utf8_p(s)) {
/* Use utf8proc if we're dealing with UTF-8.
* Rather than downcase, casefold and normalize to NFKC.
*/
utf8proc_map((const unsigned char *)s, 0, (unsigned char **)&new_s_u,
UTF8PROC_NULLTERM | UTF8PROC_STABLE
| UTF8PROC_CASEFOLD | UTF8PROC_COMPAT
| UTF8PROC_COMPOSE);
new_s = (char *)new_s_u;
} else {
/* If not, fall back to old methods. */
new_s = strsave(s);
p = new_s;
while(*p) {
if (isascii(*p) && isupper(*p))
*p = tolower(*p);
p++;
}
}
return new_s;
}
String *
make_string(char *s,
int downcase)
{
char *new_s;
String *new_z,*hp;
int i;
if (downcase) {
new_s = zdowncase(s);
} else {
new_s = s;
}
new_z = find_string(new_s,0);
if (new_z != NULL) {
if (downcase)
free(new_s);
new_z->ref_count++;
return(new_z);
}
/* Initialize new String */
if (!downcase)
new_s = strsave(s);
new_z = (String *) malloc(sizeof(String));
new_z->string = new_s;
new_z->ref_count = 1;
/* Add to beginning of hash table */
new_z->hash_val = hash(new_s);
i = new_z->hash_val % STRING_HASH_TABLE_SIZE;
hp = zhash[i];
new_z->next = hp;
if (hp != NULL)
hp->prev = new_z;
new_z->prev = NULL;
zhash[i] = new_z;
return new_z;
}
void
free_string(String *z)
{
if (z == (String *) NULL)
return;
z->ref_count--;
if (z->ref_count > 0)
return;
/* delete string completely */
if(z->prev == NULL)
zhash[hash(z->string) % STRING_HASH_TABLE_SIZE] = z->next;
else
z->prev->next = z->next;
if (z->next != NULL)
z->next->prev = z->prev;
free(z->string);
free(z);
}
String *
find_string(char *s,
int downcase)
{
char *new_s;
String *z;
if (downcase) {
new_s = zdowncase(s);
} else {
new_s = s;
}
z = zhash[hash(new_s) % STRING_HASH_TABLE_SIZE];
while (z != NULL) {
if (strcmp(new_s, z->string) == 0)
break;
z = z->next;
}
if (downcase)
free(new_s);
return z;
}
int
comp_string(String *a,
String *b)
{
if (a->hash_val > b->hash_val)
return 1;
if (a->hash_val < b->hash_val)
return -1;
return strcmp(a->string,b->string);
}
void
print_string_table(FILE *f)
{
String *p;
int i;
for(i = 0; i < STRING_HASH_TABLE_SIZE; i++) {
p = zhash[i];
while (p != (String *) NULL) {
fprintf(f,"[%d] %s\n",p->ref_count,p->string);
p = p->next;
}
}
}
String *
dup_string(String *z)
{
z->ref_count++;
return z;
}
|
