xref: /illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/keypad.c (revision 7c478bd95313f5f23a4c958a745db2134aa0324)
1*7c478bd9Sstevel@tonic-gate /*
2*7c478bd9Sstevel@tonic-gate  * CDDL HEADER START
3*7c478bd9Sstevel@tonic-gate  *
4*7c478bd9Sstevel@tonic-gate  * The contents of this file are subject to the terms of the
5*7c478bd9Sstevel@tonic-gate  * Common Development and Distribution License, Version 1.0 only
6*7c478bd9Sstevel@tonic-gate  * (the "License").  You may not use this file except in compliance
7*7c478bd9Sstevel@tonic-gate  * with the License.
8*7c478bd9Sstevel@tonic-gate  *
9*7c478bd9Sstevel@tonic-gate  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*7c478bd9Sstevel@tonic-gate  * or http://www.opensolaris.org/os/licensing.
11*7c478bd9Sstevel@tonic-gate  * See the License for the specific language governing permissions
12*7c478bd9Sstevel@tonic-gate  * and limitations under the License.
13*7c478bd9Sstevel@tonic-gate  *
14*7c478bd9Sstevel@tonic-gate  * When distributing Covered Code, include this CDDL HEADER in each
15*7c478bd9Sstevel@tonic-gate  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*7c478bd9Sstevel@tonic-gate  * If applicable, add the following below this CDDL HEADER, with the
17*7c478bd9Sstevel@tonic-gate  * fields enclosed by brackets "[]" replaced with your own identifying
18*7c478bd9Sstevel@tonic-gate  * information: Portions Copyright [yyyy] [name of copyright owner]
19*7c478bd9Sstevel@tonic-gate  *
20*7c478bd9Sstevel@tonic-gate  * CDDL HEADER END
21*7c478bd9Sstevel@tonic-gate  */
22*7c478bd9Sstevel@tonic-gate /*
23*7c478bd9Sstevel@tonic-gate  * Copyright (c) 1995, by Sun Microsystems, Inc.
24*7c478bd9Sstevel@tonic-gate  * All rights reserved.
25*7c478bd9Sstevel@tonic-gate  */
26*7c478bd9Sstevel@tonic-gate 
27*7c478bd9Sstevel@tonic-gate #pragma ident	"%Z%%M%	%I%	%E% SMI"
28*7c478bd9Sstevel@tonic-gate 
29*7c478bd9Sstevel@tonic-gate /*
30*7c478bd9Sstevel@tonic-gate  * keypad.c
31*7c478bd9Sstevel@tonic-gate  *
32*7c478bd9Sstevel@tonic-gate  * XCurses Library
33*7c478bd9Sstevel@tonic-gate  *
34*7c478bd9Sstevel@tonic-gate  * Copyright 1990, 1995 by Mortice Kern Systems Inc.  All rights reserved.
35*7c478bd9Sstevel@tonic-gate  *
36*7c478bd9Sstevel@tonic-gate  */
37*7c478bd9Sstevel@tonic-gate 
38*7c478bd9Sstevel@tonic-gate #ifdef M_RCSID
39*7c478bd9Sstevel@tonic-gate #ifndef lint
40*7c478bd9Sstevel@tonic-gate static char rcsID[] = "$Header: /rd/src/libc/xcurses/rcs/keypad.c 1.3 1995/05/24 19:43:46 ant Exp $";
41*7c478bd9Sstevel@tonic-gate #endif
42*7c478bd9Sstevel@tonic-gate #endif
43*7c478bd9Sstevel@tonic-gate 
44*7c478bd9Sstevel@tonic-gate #include <private.h>
45*7c478bd9Sstevel@tonic-gate #include <stdlib.h>
46*7c478bd9Sstevel@tonic-gate 
47*7c478bd9Sstevel@tonic-gate /*f
48*7c478bd9Sstevel@tonic-gate  * Add a function key string to the decode tree.
49*7c478bd9Sstevel@tonic-gate  * Return -1 on error, else the length of the key sequence.
50*7c478bd9Sstevel@tonic-gate  */
51*7c478bd9Sstevel@tonic-gate static int
52*7c478bd9Sstevel@tonic-gate decode_add(root, str, code)
53*7c478bd9Sstevel@tonic-gate t_decode **root;
54*7c478bd9Sstevel@tonic-gate const char *str;
55*7c478bd9Sstevel@tonic-gate short code;
56*7c478bd9Sstevel@tonic-gate {
57*7c478bd9Sstevel@tonic-gate 	const char *start;
58*7c478bd9Sstevel@tonic-gate 	t_decode *node, *saved;
59*7c478bd9Sstevel@tonic-gate 
60*7c478bd9Sstevel@tonic-gate 	if (root == (t_decode **) 0)
61*7c478bd9Sstevel@tonic-gate 		return -1;
62*7c478bd9Sstevel@tonic-gate 
63*7c478bd9Sstevel@tonic-gate 	if (str == (char *) 0)
64*7c478bd9Sstevel@tonic-gate 		return 0;
65*7c478bd9Sstevel@tonic-gate 
66*7c478bd9Sstevel@tonic-gate 	start = str;
67*7c478bd9Sstevel@tonic-gate 	saved = (t_decode *) 0;
68*7c478bd9Sstevel@tonic-gate 
69*7c478bd9Sstevel@tonic-gate 	if (*root == (t_decode *) 0) {
70*7c478bd9Sstevel@tonic-gate 		/* First node of tree. */
71*7c478bd9Sstevel@tonic-gate 		node = (t_decode *) malloc(sizeof *node);
72*7c478bd9Sstevel@tonic-gate 		if (node == (t_decode *) 0)
73*7c478bd9Sstevel@tonic-gate 			return -1;
74*7c478bd9Sstevel@tonic-gate 
75*7c478bd9Sstevel@tonic-gate 		*root = saved = node;
76*7c478bd9Sstevel@tonic-gate 
77*7c478bd9Sstevel@tonic-gate 		node->child = node->sibling = (t_decode *) 0;
78*7c478bd9Sstevel@tonic-gate 		node->ch = *str++;
79*7c478bd9Sstevel@tonic-gate 		node->key = 0;
80*7c478bd9Sstevel@tonic-gate 	} else {
81*7c478bd9Sstevel@tonic-gate 		/* Find node to insert function key sequence into the tree. */
82*7c478bd9Sstevel@tonic-gate 		for (node = *root; *str != '\0'; ++str, node = node->child) {
83*7c478bd9Sstevel@tonic-gate 			while (node->ch != *str
84*7c478bd9Sstevel@tonic-gate 			&& node->sibling != (t_decode *)0)
85*7c478bd9Sstevel@tonic-gate 				node = node->sibling;
86*7c478bd9Sstevel@tonic-gate 
87*7c478bd9Sstevel@tonic-gate 			if (node->ch != *str) {
88*7c478bd9Sstevel@tonic-gate 				node->sibling = (t_decode *) malloc(
89*7c478bd9Sstevel@tonic-gate 					sizeof *node
90*7c478bd9Sstevel@tonic-gate 				);
91*7c478bd9Sstevel@tonic-gate 				if (node->sibling == (t_decode *) 0)
92*7c478bd9Sstevel@tonic-gate 					return -1;
93*7c478bd9Sstevel@tonic-gate 
94*7c478bd9Sstevel@tonic-gate 				saved = node = node->sibling;
95*7c478bd9Sstevel@tonic-gate 				node->child = node->sibling = (t_decode *) 0;
96*7c478bd9Sstevel@tonic-gate 				node->ch = *str++;
97*7c478bd9Sstevel@tonic-gate 				node->key = 0;
98*7c478bd9Sstevel@tonic-gate 				break;
99*7c478bd9Sstevel@tonic-gate 			}
100*7c478bd9Sstevel@tonic-gate 
101*7c478bd9Sstevel@tonic-gate 			if (node->child == (t_decode *) 0)
102*7c478bd9Sstevel@tonic-gate 				break;
103*7c478bd9Sstevel@tonic-gate 		}
104*7c478bd9Sstevel@tonic-gate 	}
105*7c478bd9Sstevel@tonic-gate 
106*7c478bd9Sstevel@tonic-gate 	/* Insert string into the tree; node->child == null. */
107*7c478bd9Sstevel@tonic-gate 	while (*str != '\0') {
108*7c478bd9Sstevel@tonic-gate 		node->child = (t_decode *) malloc(sizeof *node);
109*7c478bd9Sstevel@tonic-gate 		if (node->child == (t_decode *) 0) {
110*7c478bd9Sstevel@tonic-gate 			__m_decode_free(&saved);
111*7c478bd9Sstevel@tonic-gate 			return -1;
112*7c478bd9Sstevel@tonic-gate 		}
113*7c478bd9Sstevel@tonic-gate 
114*7c478bd9Sstevel@tonic-gate 		node = node->child;
115*7c478bd9Sstevel@tonic-gate 		node->child = node->sibling = (t_decode *) 0;
116*7c478bd9Sstevel@tonic-gate 		node->ch = *str++;
117*7c478bd9Sstevel@tonic-gate 		node->key = 0;
118*7c478bd9Sstevel@tonic-gate 	}
119*7c478bd9Sstevel@tonic-gate 
120*7c478bd9Sstevel@tonic-gate 	node->key = code;
121*7c478bd9Sstevel@tonic-gate 
122*7c478bd9Sstevel@tonic-gate 	return (int) (str - start);
123*7c478bd9Sstevel@tonic-gate }
124*7c478bd9Sstevel@tonic-gate 
125*7c478bd9Sstevel@tonic-gate void
126*7c478bd9Sstevel@tonic-gate __m_decode_free(tree)
127*7c478bd9Sstevel@tonic-gate t_decode **tree;
128*7c478bd9Sstevel@tonic-gate {
129*7c478bd9Sstevel@tonic-gate 	if (*tree != (t_decode *) 0) {
130*7c478bd9Sstevel@tonic-gate 		__m_decode_free(&(*tree)->sibling);
131*7c478bd9Sstevel@tonic-gate 		__m_decode_free(&(*tree)->child);
132*7c478bd9Sstevel@tonic-gate 		free(*tree);
133*7c478bd9Sstevel@tonic-gate 		*tree = (t_decode *) 0;
134*7c478bd9Sstevel@tonic-gate 	}
135*7c478bd9Sstevel@tonic-gate }
136*7c478bd9Sstevel@tonic-gate 
137*7c478bd9Sstevel@tonic-gate /*f
138*7c478bd9Sstevel@tonic-gate  * Initialise the function key decode tree.
139*7c478bd9Sstevel@tonic-gate  */
140*7c478bd9Sstevel@tonic-gate int
141*7c478bd9Sstevel@tonic-gate __m_decode_init(tree)
142*7c478bd9Sstevel@tonic-gate t_decode **tree;
143*7c478bd9Sstevel@tonic-gate {
144*7c478bd9Sstevel@tonic-gate 	int max, len;
145*7c478bd9Sstevel@tonic-gate 	short (*p)[2];
146*7c478bd9Sstevel@tonic-gate 
147*7c478bd9Sstevel@tonic-gate 	*tree = (t_decode *) 0;
148*7c478bd9Sstevel@tonic-gate 
149*7c478bd9Sstevel@tonic-gate 	for (max = -1, p = __m_keyindex; **p != -1; ++p) {
150*7c478bd9Sstevel@tonic-gate 		len = decode_add(tree, cur_term->_str[**p], (*p)[1]);
151*7c478bd9Sstevel@tonic-gate 		if (len < 0)
152*7c478bd9Sstevel@tonic-gate 			return -1;
153*7c478bd9Sstevel@tonic-gate 		if (max < len)
154*7c478bd9Sstevel@tonic-gate 			max = len;
155*7c478bd9Sstevel@tonic-gate 	}
156*7c478bd9Sstevel@tonic-gate 
157*7c478bd9Sstevel@tonic-gate 	return max;
158*7c478bd9Sstevel@tonic-gate }
159*7c478bd9Sstevel@tonic-gate 
160*7c478bd9Sstevel@tonic-gate /*f
161*7c478bd9Sstevel@tonic-gate  * When true for a given window, then multibyte function key processing
162*7c478bd9Sstevel@tonic-gate  * is done for all input throough that window, see wgetch().
163*7c478bd9Sstevel@tonic-gate  */
164*7c478bd9Sstevel@tonic-gate int
165*7c478bd9Sstevel@tonic-gate keypad(WINDOW *w, bool bf)
166*7c478bd9Sstevel@tonic-gate {
167*7c478bd9Sstevel@tonic-gate #ifdef M_CURSES_TRACE
168*7c478bd9Sstevel@tonic-gate 	__m_trace("keypad(%p, %d)", w, bf);
169*7c478bd9Sstevel@tonic-gate #endif
170*7c478bd9Sstevel@tonic-gate 
171*7c478bd9Sstevel@tonic-gate 	w->_flags &= ~W_USE_KEYPAD;
172*7c478bd9Sstevel@tonic-gate 
173*7c478bd9Sstevel@tonic-gate 	if (bf)
174*7c478bd9Sstevel@tonic-gate 		w->_flags |= W_USE_KEYPAD;
175*7c478bd9Sstevel@tonic-gate 
176*7c478bd9Sstevel@tonic-gate 	return __m_return_code("keypad", OK);
177*7c478bd9Sstevel@tonic-gate }
178*7c478bd9Sstevel@tonic-gate 
179