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
|
/* $OpenBSD: tries.c,v 1.2 1998/01/17 16:27:38 millert Exp $ */
/******************************************************************************
* Copyright 1997 by Thomas E. Dickey <dickey@clark.net> *
* All Rights Reserved. *
* *
* Permission to use, copy, modify, and distribute this software and its *
* documentation for any purpose and without fee is hereby granted, provided *
* that the above copyright notice appear in all copies and that both that *
* copyright notice and this permission notice appear in supporting *
* documentation, and that the name of the above listed copyright holder(s) *
* not be used in advertising or publicity pertaining to distribution of the *
* software without specific, written prior permission. THE ABOVE LISTED *
* COPYRIGHT HOLDER(S) DISCLAIM ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, *
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO *
* EVENT SHALL THE ABOVE LISTED COPYRIGHT HOLDER(S) BE LIABLE FOR ANY *
* SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER *
* RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF *
* CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN *
* CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *
******************************************************************************/
/*
** tries.c
**
** Functions to manage the tree of partial-completions for keycodes.
**
*/
#include <curses.priv.h>
MODULE_ID("Id: tries.c,v 1.6 1997/12/28 00:15:04 tom Exp $")
#define SET_TRY(dst,src) if ((dst->ch = *src++) == 128) dst->ch = '\0'
#define CMP_TRY(a,b) ((a)? (a == b) : (b == 128))
void _nc_add_to_try(struct tries **tree, char *str, unsigned short code)
{
static bool out_of_memory = FALSE;
struct tries *ptr, *savedptr;
unsigned char *txt = (unsigned char *)str;
if (txt == 0 || *txt == '\0' || out_of_memory || code == 0)
return;
if ((*tree) != 0) {
ptr = savedptr = (*tree);
for (;;) {
unsigned char cmp = *txt;
while (!CMP_TRY(ptr->ch, cmp)
&& ptr->sibling != 0)
ptr = ptr->sibling;
if (CMP_TRY(ptr->ch, cmp)) {
if (*(++txt) == '\0') {
ptr->value = code;
return;
}
if (ptr->child != 0)
ptr = ptr->child;
else
break;
} else {
if ((ptr->sibling = typeCalloc(struct tries,1)) == 0) {
out_of_memory = TRUE;
return;
}
savedptr = ptr = ptr->sibling;
SET_TRY(ptr,txt);
ptr->value = 0;
break;
}
} /* end for (;;) */
} else { /* (*tree) == 0 :: First sequence to be added */
savedptr = ptr = (*tree) = typeCalloc(struct tries,1);
if (ptr == 0) {
out_of_memory = TRUE;
return;
}
SET_TRY(ptr,txt);
ptr->value = 0;
}
/* at this point, we are adding to the try. ptr->child == 0 */
while (*txt) {
ptr->child = typeCalloc(struct tries,1);
ptr = ptr->child;
if (ptr == 0) {
out_of_memory = TRUE;
while ((ptr = savedptr) != 0) {
savedptr = ptr->child;
free(ptr);
}
return;
}
SET_TRY(ptr,txt);
ptr->value = 0;
}
ptr->value = code;
return;
}
/*
* Expand a keycode into the string that it corresponds to, returning null if
* no match was found, otherwise allocating a string of the result.
*/
char *_nc_expand_try(struct tries *tree, unsigned short code, size_t len)
{
struct tries *ptr = tree;
char *result = 0;
if (code != 0) {
while (ptr != 0) {
if ((result = _nc_expand_try(ptr->child, code, len + 1)) != 0) {
break;
}
if (ptr->value == code) {
result = typeCalloc(char, len+2);
break;
}
ptr = ptr->sibling;
}
}
if (result != 0) {
if ((result[len] = ptr->ch) == 0)
*((unsigned char *)(result+len)) = 128;
#ifdef TRACE
if (len == 0)
_tracef("expand_key %s %s", _trace_key(code), _nc_visbuf(result));
#endif
}
return result;
}
/*
* Remove a code from the specified tree, freeing the unused nodes. Returns
* true if the code was found/removed.
*/
int _nc_remove_key(struct tries **tree, unsigned short code)
{
if (code == 0)
return FALSE;
while (*tree != 0) {
if (_nc_remove_key(&(*tree)->child, code)) {
return TRUE;
}
if ((*tree)->value == code) {
if((*tree)->child) {
/* don't cut the whole sub-tree */
(*tree)->value = 0;
} else {
struct tries *to_free = *tree;
*tree = (*tree)->sibling;
free(to_free);
}
return TRUE;
}
tree = &(*tree)->sibling;
}
return FALSE;
}
|
