ncurses 4.2
[ncurses.git] / ncurses / tinfo / add_tries.c
1 /****************************************************************************
2  * Copyright (c) 1998 Free Software Foundation, Inc.                        *
3  *                                                                          *
4  * Permission is hereby granted, free of charge, to any person obtaining a  *
5  * copy of this software and associated documentation files (the            *
6  * "Software"), to deal in the Software without restriction, including      *
7  * without limitation the rights to use, copy, modify, merge, publish,      *
8  * distribute, distribute with modifications, sublicense, and/or sell       *
9  * copies of the Software, and to permit persons to whom the Software is    *
10  * furnished to do so, subject to the following conditions:                 *
11  *                                                                          *
12  * The above copyright notice and this permission notice shall be included  *
13  * in all copies or substantial portions of the Software.                   *
14  *                                                                          *
15  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
16  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
17  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
18  * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
19  * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
20  * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
21  * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
22  *                                                                          *
23  * Except as contained in this notice, the name(s) of the above copyright   *
24  * holders shall not be used in advertising or otherwise to promote the     *
25  * sale, use or other dealings in this Software without prior written       *
26  * authorization.                                                           *
27  ****************************************************************************/
28
29 /****************************************************************************
30  *  Author: Thomas E. Dickey <dickey@clark.net> 1998                        *
31  ****************************************************************************/
32
33 /*
34 **      add_tries.c
35 **
36 **      Add keycode/string to tries-tree.
37 **
38 */
39
40 #include <curses.priv.h>
41
42 MODULE_ID("$Id: add_tries.c,v 1.1 1998/11/08 00:04:18 tom Exp $")
43
44 #define SET_TRY(dst,src) if ((dst->ch = *src++) == 128) dst->ch = '\0'
45 #define CMP_TRY(a,b) ((a)? (a == b) : (b == 128))
46
47 void _nc_add_to_try(struct tries **tree, char *str, unsigned short code)
48 {
49         static bool     out_of_memory = FALSE;
50         struct tries    *ptr, *savedptr;
51         unsigned char   *txt = (unsigned char *)str;
52
53         if (txt == 0 || *txt == '\0' || out_of_memory || code == 0)
54                 return;
55
56         if ((*tree) != 0) {
57                 ptr = savedptr = (*tree);
58
59                 for (;;) {
60                         unsigned char cmp = *txt;
61
62                         while (!CMP_TRY(ptr->ch, cmp)
63                                &&  ptr->sibling != 0)
64                                 ptr = ptr->sibling;
65         
66                         if (CMP_TRY(ptr->ch, cmp)) {
67                                 if (*(++txt) == '\0') {
68                                         ptr->value = code;
69                                         return;
70                                 }
71                                 if (ptr->child != 0)
72                                         ptr = ptr->child;
73                                 else
74                                         break;
75                         } else {
76                                 if ((ptr->sibling = typeCalloc(struct tries,1)) == 0) {
77                                         out_of_memory = TRUE;
78                                         return;
79                                 }
80
81                                 savedptr = ptr = ptr->sibling;
82                                 SET_TRY(ptr,txt);
83                                 ptr->value = 0;
84
85                                 break;
86                         }
87                 } /* end for (;;) */
88         } else {   /* (*tree) == 0 :: First sequence to be added */
89                 savedptr = ptr = (*tree) = typeCalloc(struct tries,1);
90
91                 if (ptr == 0) {
92                         out_of_memory = TRUE;
93                         return;
94                 }
95
96                 SET_TRY(ptr,txt);
97                 ptr->value = 0;
98         }
99
100             /* at this point, we are adding to the try.  ptr->child == 0 */
101
102         while (*txt) {
103                 ptr->child = typeCalloc(struct tries,1);
104
105                 ptr = ptr->child;
106
107                 if (ptr == 0) {
108                         out_of_memory = TRUE;
109
110                         while ((ptr = savedptr) != 0) {
111                                 savedptr = ptr->child;
112                                 free(ptr);
113                         }
114
115                         return;
116                 }
117
118                 SET_TRY(ptr,txt);
119                 ptr->value = 0;
120         }
121
122         ptr->value = code;
123         return;
124 }