getch.c revision 1.59 1 1.59 roy /* $NetBSD: getch.c,v 1.59 2012/04/21 12:27:28 roy Exp $ */
2 1.8 mikel
3 1.1 cgd /*
4 1.7 cgd * Copyright (c) 1981, 1993, 1994
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.42 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd */
31 1.1 cgd
32 1.8 mikel #include <sys/cdefs.h>
33 1.1 cgd #ifndef lint
34 1.8 mikel #if 0
35 1.7 cgd static char sccsid[] = "@(#)getch.c 8.2 (Berkeley) 5/4/94";
36 1.8 mikel #else
37 1.59 roy __RCSID("$NetBSD: getch.c,v 1.59 2012/04/21 12:27:28 roy Exp $");
38 1.8 mikel #endif
39 1.10 mrg #endif /* not lint */
40 1.1 cgd
41 1.10 mrg #include <string.h>
42 1.10 mrg #include <stdlib.h>
43 1.10 mrg #include <unistd.h>
44 1.10 mrg #include <stdio.h>
45 1.7 cgd #include "curses.h"
46 1.16 blymn #include "curses_private.h"
47 1.48 blymn #include "keymap.h"
48 1.1 cgd
49 1.48 blymn short state; /* state of the inkey function */
50 1.10 mrg
51 1.13 simonb static const struct tcdata tc[] = {
52 1.55 roy {TICODE_kSAV, KEY_SSAVE},
53 1.55 roy {TICODE_kSPD, KEY_SSUSPEND},
54 1.55 roy {TICODE_kUND, KEY_SUNDO},
55 1.55 roy {TICODE_kHLP, KEY_SHELP},
56 1.55 roy {TICODE_kHOM, KEY_SHOME},
57 1.55 roy {TICODE_kIC, KEY_SIC},
58 1.55 roy {TICODE_kLFT, KEY_SLEFT},
59 1.55 roy {TICODE_krdo, KEY_REDO},
60 1.55 roy {TICODE_khlp, KEY_HELP},
61 1.55 roy {TICODE_kmrk, KEY_MARK},
62 1.55 roy {TICODE_kmsg, KEY_MESSAGE},
63 1.55 roy {TICODE_kmov, KEY_MOVE},
64 1.55 roy {TICODE_knxt, KEY_NEXT},
65 1.55 roy {TICODE_kopn, KEY_OPEN},
66 1.55 roy {TICODE_kopt, KEY_OPTIONS},
67 1.55 roy {TICODE_kprv, KEY_PREVIOUS},
68 1.55 roy {TICODE_kprt, KEY_PRINT},
69 1.55 roy {TICODE_kMSG, KEY_SMESSAGE},
70 1.55 roy {TICODE_kMOV, KEY_SMOVE},
71 1.55 roy {TICODE_kNXT, KEY_SNEXT},
72 1.55 roy {TICODE_kOPT, KEY_SOPTIONS},
73 1.55 roy {TICODE_kPRV, KEY_SPREVIOUS},
74 1.55 roy {TICODE_kPRT, KEY_SPRINT},
75 1.55 roy {TICODE_kRDO, KEY_SREDO},
76 1.55 roy {TICODE_kRPL, KEY_SREPLACE},
77 1.55 roy {TICODE_kRIT, KEY_SRIGHT},
78 1.55 roy {TICODE_kRES, KEY_SRSUME},
79 1.55 roy {TICODE_kCAN, KEY_SCANCEL},
80 1.55 roy {TICODE_kref, KEY_REFERENCE},
81 1.55 roy {TICODE_krfr, KEY_REFRESH},
82 1.55 roy {TICODE_krpl, KEY_REPLACE},
83 1.55 roy {TICODE_krst, KEY_RESTART},
84 1.55 roy {TICODE_kres, KEY_RESUME},
85 1.55 roy {TICODE_ksav, KEY_SAVE},
86 1.55 roy {TICODE_kspd, KEY_SUSPEND},
87 1.55 roy {TICODE_kund, KEY_UNDO},
88 1.55 roy {TICODE_kBEG, KEY_SBEG},
89 1.55 roy {TICODE_kFND, KEY_SFIND},
90 1.55 roy {TICODE_kCMD, KEY_SCOMMAND},
91 1.55 roy {TICODE_kCPY, KEY_SCOPY},
92 1.55 roy {TICODE_kCRT, KEY_SCREATE},
93 1.55 roy {TICODE_kDC, KEY_SDC},
94 1.55 roy {TICODE_kDL, KEY_SDL},
95 1.55 roy {TICODE_kslt, KEY_SELECT},
96 1.55 roy {TICODE_kEND, KEY_SEND},
97 1.55 roy {TICODE_kEOL, KEY_SEOL},
98 1.55 roy {TICODE_kEXT, KEY_SEXIT},
99 1.55 roy {TICODE_kfnd, KEY_FIND},
100 1.55 roy {TICODE_kbeg, KEY_BEG},
101 1.55 roy {TICODE_kcan, KEY_CANCEL},
102 1.55 roy {TICODE_kclo, KEY_CLOSE},
103 1.55 roy {TICODE_kcmd, KEY_COMMAND},
104 1.55 roy {TICODE_kcpy, KEY_COPY},
105 1.55 roy {TICODE_kcrt, KEY_CREATE},
106 1.55 roy {TICODE_kend, KEY_END},
107 1.55 roy {TICODE_kent, KEY_ENTER},
108 1.55 roy {TICODE_kext, KEY_EXIT},
109 1.55 roy {TICODE_kf11, KEY_F(11)},
110 1.55 roy {TICODE_kf12, KEY_F(12)},
111 1.55 roy {TICODE_kf13, KEY_F(13)},
112 1.55 roy {TICODE_kf14, KEY_F(14)},
113 1.55 roy {TICODE_kf15, KEY_F(15)},
114 1.55 roy {TICODE_kf16, KEY_F(16)},
115 1.55 roy {TICODE_kf17, KEY_F(17)},
116 1.55 roy {TICODE_kf18, KEY_F(18)},
117 1.55 roy {TICODE_kf19, KEY_F(19)},
118 1.55 roy {TICODE_kf20, KEY_F(20)},
119 1.55 roy {TICODE_kf21, KEY_F(21)},
120 1.55 roy {TICODE_kf22, KEY_F(22)},
121 1.55 roy {TICODE_kf23, KEY_F(23)},
122 1.55 roy {TICODE_kf24, KEY_F(24)},
123 1.55 roy {TICODE_kf25, KEY_F(25)},
124 1.55 roy {TICODE_kf26, KEY_F(26)},
125 1.55 roy {TICODE_kf27, KEY_F(27)},
126 1.55 roy {TICODE_kf28, KEY_F(28)},
127 1.55 roy {TICODE_kf29, KEY_F(29)},
128 1.55 roy {TICODE_kf30, KEY_F(30)},
129 1.55 roy {TICODE_kf31, KEY_F(31)},
130 1.55 roy {TICODE_kf32, KEY_F(32)},
131 1.55 roy {TICODE_kf33, KEY_F(33)},
132 1.55 roy {TICODE_kf34, KEY_F(34)},
133 1.55 roy {TICODE_kf35, KEY_F(35)},
134 1.55 roy {TICODE_kf36, KEY_F(36)},
135 1.55 roy {TICODE_kf37, KEY_F(37)},
136 1.55 roy {TICODE_kf38, KEY_F(38)},
137 1.55 roy {TICODE_kf39, KEY_F(39)},
138 1.55 roy {TICODE_kf40, KEY_F(40)},
139 1.55 roy {TICODE_kf41, KEY_F(41)},
140 1.55 roy {TICODE_kf42, KEY_F(42)},
141 1.55 roy {TICODE_kf43, KEY_F(43)},
142 1.55 roy {TICODE_kf44, KEY_F(44)},
143 1.55 roy {TICODE_kf45, KEY_F(45)},
144 1.55 roy {TICODE_kf46, KEY_F(46)},
145 1.55 roy {TICODE_kf47, KEY_F(47)},
146 1.55 roy {TICODE_kf48, KEY_F(48)},
147 1.55 roy {TICODE_kf49, KEY_F(49)},
148 1.55 roy {TICODE_kf50, KEY_F(50)},
149 1.55 roy {TICODE_kf51, KEY_F(51)},
150 1.55 roy {TICODE_kf52, KEY_F(52)},
151 1.55 roy {TICODE_kf53, KEY_F(53)},
152 1.55 roy {TICODE_kf54, KEY_F(54)},
153 1.55 roy {TICODE_kf55, KEY_F(55)},
154 1.55 roy {TICODE_kf56, KEY_F(56)},
155 1.55 roy {TICODE_kf57, KEY_F(57)},
156 1.55 roy {TICODE_kf58, KEY_F(58)},
157 1.55 roy {TICODE_kf59, KEY_F(59)},
158 1.55 roy {TICODE_kf60, KEY_F(60)},
159 1.55 roy {TICODE_kf61, KEY_F(61)},
160 1.55 roy {TICODE_kf62, KEY_F(62)},
161 1.55 roy {TICODE_kf63, KEY_F(63)},
162 1.55 roy {TICODE_ka1, KEY_A1},
163 1.55 roy {TICODE_kb2, KEY_B2},
164 1.55 roy {TICODE_ka3, KEY_A3},
165 1.55 roy {TICODE_kc1, KEY_C1},
166 1.55 roy {TICODE_kc3, KEY_C3},
167 1.55 roy {TICODE_kmous, KEY_MOUSE},
168 1.55 roy {TICODE_kf0, KEY_F0},
169 1.55 roy {TICODE_kf1, KEY_F(1)},
170 1.55 roy {TICODE_kf2, KEY_F(2)},
171 1.55 roy {TICODE_kf3, KEY_F(3)},
172 1.55 roy {TICODE_kf4, KEY_F(4)},
173 1.55 roy {TICODE_kf5, KEY_F(5)},
174 1.55 roy {TICODE_kf6, KEY_F(6)},
175 1.55 roy {TICODE_kf7, KEY_F(7)},
176 1.55 roy {TICODE_kf8, KEY_F(8)},
177 1.55 roy {TICODE_kf9, KEY_F(9)},
178 1.55 roy {TICODE_kf10, KEY_F(10)},
179 1.55 roy {TICODE_kil1, KEY_IL},
180 1.55 roy {TICODE_ktbc, KEY_CATAB},
181 1.55 roy {TICODE_kcbt, KEY_BTAB},
182 1.55 roy {TICODE_kbs, KEY_BACKSPACE},
183 1.55 roy {TICODE_kclr, KEY_CLEAR},
184 1.55 roy {TICODE_kdch1, KEY_DC},
185 1.55 roy {TICODE_kcud1, KEY_DOWN},
186 1.55 roy {TICODE_kel, KEY_EOL},
187 1.55 roy {TICODE_kind, KEY_SF},
188 1.55 roy {TICODE_kll, KEY_LL},
189 1.55 roy {TICODE_khome, KEY_HOME},
190 1.55 roy {TICODE_kich1, KEY_IC},
191 1.55 roy {TICODE_kdl1, KEY_DL},
192 1.55 roy {TICODE_kcub1, KEY_LEFT},
193 1.55 roy {TICODE_krmir, KEY_EIC},
194 1.55 roy {TICODE_knp, KEY_NPAGE},
195 1.55 roy {TICODE_kpp, KEY_PPAGE},
196 1.55 roy {TICODE_kri, KEY_SR},
197 1.55 roy {TICODE_kcuf1, KEY_RIGHT},
198 1.55 roy {TICODE_ked, KEY_EOS},
199 1.55 roy {TICODE_khts, KEY_STAB},
200 1.55 roy {TICODE_kctab, KEY_CTAB},
201 1.55 roy {TICODE_kcuu1, KEY_UP}
202 1.10 mrg };
203 1.10 mrg /* Number of TC entries .... */
204 1.13 simonb static const int num_tcs = (sizeof(tc) / sizeof(struct tcdata));
205 1.10 mrg
206 1.48 blymn int ESCDELAY = 300; /* Delay in ms between keys for esc seq's */
207 1.48 blymn
208 1.48 blymn /* Key buffer */
209 1.48 blymn #define INBUF_SZ 16 /* size of key buffer - must be larger than
210 1.48 blymn * longest multi-key sequence */
211 1.50 jdc static wchar_t inbuf[INBUF_SZ];
212 1.50 jdc static int start, end, working; /* pointers for manipulating inbuf data */
213 1.48 blymn
214 1.10 mrg /* prototypes for private functions */
215 1.37 blymn static void add_key_sequence(SCREEN *screen, char *sequence, int key_type);
216 1.48 blymn static key_entry_t *add_new_key(keymap_t *current, char ch, int key_type,
217 1.48 blymn int symbol);
218 1.37 blymn static void delete_key_sequence(keymap_t *current, int key_type);
219 1.37 blymn static void do_keyok(keymap_t *current, int key_type, bool flag, int *retval);
220 1.48 blymn static keymap_t *new_keymap(void); /* create a new keymap */
221 1.48 blymn static key_entry_t *new_key(void); /* create a new key entry */
222 1.20 blymn static wchar_t inkey(int to, int delay);
223 1.20 blymn
224 1.20 blymn /*
225 1.35 blymn * Free the storage associated with the given keymap
226 1.35 blymn */
227 1.35 blymn void
228 1.35 blymn _cursesi_free_keymap(keymap_t *map)
229 1.35 blymn {
230 1.35 blymn int i;
231 1.35 blymn
232 1.35 blymn /* check for, and free, child keymaps */
233 1.35 blymn for (i = 0; i < MAX_CHAR; i++) {
234 1.35 blymn if (map->mapping[i] >= 0) {
235 1.35 blymn if (map->key[map->mapping[i]]->type == KEYMAP_MULTI)
236 1.35 blymn _cursesi_free_keymap(
237 1.35 blymn map->key[map->mapping[i]]->value.next);
238 1.35 blymn }
239 1.35 blymn }
240 1.35 blymn
241 1.35 blymn /* now free any allocated keymap structs */
242 1.35 blymn for (i = 0; i < map->count; i += KEYMAP_ALLOC_CHUNK) {
243 1.35 blymn free(map->key[i]);
244 1.35 blymn }
245 1.36 blymn
246 1.35 blymn free(map->key);
247 1.35 blymn free(map);
248 1.35 blymn }
249 1.35 blymn
250 1.48 blymn
251 1.35 blymn /*
252 1.20 blymn * Add a new key entry to the keymap pointed to by current. Entry
253 1.20 blymn * contains the character to add to the keymap, type is the type of
254 1.20 blymn * entry to add (either multikey or leaf) and symbol is the symbolic
255 1.20 blymn * value for a leaf type entry. The function returns a pointer to the
256 1.20 blymn * new keymap entry.
257 1.20 blymn */
258 1.20 blymn static key_entry_t *
259 1.20 blymn add_new_key(keymap_t *current, char chr, int key_type, int symbol)
260 1.20 blymn {
261 1.20 blymn key_entry_t *the_key;
262 1.37 blymn int i, ki;
263 1.20 blymn
264 1.20 blymn #ifdef DEBUG
265 1.47 jdc __CTRACE(__CTRACE_MISC,
266 1.47 jdc "Adding character %s of type %d, symbol 0x%x\n",
267 1.47 jdc unctrl(chr), key_type, symbol);
268 1.20 blymn #endif
269 1.33 blymn if (current->mapping[(unsigned char) chr] < 0) {
270 1.37 blymn if (current->mapping[(unsigned char) chr] == MAPPING_UNUSED) {
271 1.37 blymn /* first time for this char */
272 1.37 blymn current->mapping[(unsigned char) chr] =
273 1.37 blymn current->count; /* map new entry */
274 1.37 blymn ki = current->count;
275 1.48 blymn
276 1.37 blymn /* make sure we have room in the key array first */
277 1.37 blymn if ((current->count & (KEYMAP_ALLOC_CHUNK - 1)) == 0)
278 1.37 blymn {
279 1.37 blymn if ((current->key =
280 1.37 blymn realloc(current->key,
281 1.37 blymn ki * sizeof(key_entry_t *)
282 1.37 blymn + KEYMAP_ALLOC_CHUNK * sizeof(key_entry_t *))) == NULL) {
283 1.37 blymn fprintf(stderr,
284 1.37 blymn "Could not malloc for key entry\n");
285 1.37 blymn exit(1);
286 1.37 blymn }
287 1.48 blymn
288 1.37 blymn the_key = new_key();
289 1.37 blymn for (i = 0; i < KEYMAP_ALLOC_CHUNK; i++) {
290 1.37 blymn current->key[ki + i] = &the_key[i];
291 1.37 blymn }
292 1.20 blymn }
293 1.37 blymn } else {
294 1.37 blymn /* the mapping was used but freed, reuse it */
295 1.37 blymn ki = - current->mapping[(unsigned char) chr];
296 1.37 blymn current->mapping[(unsigned char) chr] = ki;
297 1.37 blymn }
298 1.48 blymn
299 1.37 blymn current->count++;
300 1.48 blymn
301 1.37 blymn /* point at the current key array element to use */
302 1.37 blymn the_key = current->key[ki];
303 1.48 blymn
304 1.20 blymn the_key->type = key_type;
305 1.20 blymn
306 1.20 blymn switch (key_type) {
307 1.20 blymn case KEYMAP_MULTI:
308 1.20 blymn /* need for next key */
309 1.20 blymn #ifdef DEBUG
310 1.47 jdc __CTRACE(__CTRACE_MISC, "Creating new keymap\n");
311 1.20 blymn #endif
312 1.20 blymn the_key->value.next = new_keymap();
313 1.37 blymn the_key->enable = TRUE;
314 1.20 blymn break;
315 1.20 blymn
316 1.20 blymn case KEYMAP_LEAF:
317 1.20 blymn /* the associated symbol for the key */
318 1.20 blymn #ifdef DEBUG
319 1.47 jdc __CTRACE(__CTRACE_MISC, "Adding leaf key\n");
320 1.20 blymn #endif
321 1.20 blymn the_key->value.symbol = symbol;
322 1.37 blymn the_key->enable = TRUE;
323 1.20 blymn break;
324 1.20 blymn
325 1.20 blymn default:
326 1.20 blymn fprintf(stderr, "add_new_key: bad type passed\n");
327 1.20 blymn exit(1);
328 1.20 blymn }
329 1.20 blymn } else {
330 1.20 blymn /* the key is already known - just return the address. */
331 1.20 blymn #ifdef DEBUG
332 1.47 jdc __CTRACE(__CTRACE_MISC, "Keymap already known\n");
333 1.20 blymn #endif
334 1.33 blymn the_key = current->key[current->mapping[(unsigned char) chr]];
335 1.20 blymn }
336 1.20 blymn
337 1.20 blymn return the_key;
338 1.20 blymn }
339 1.10 mrg
340 1.10 mrg /*
341 1.37 blymn * Delete the given key symbol from the key mappings for the screen.
342 1.37 blymn *
343 1.37 blymn */
344 1.37 blymn void
345 1.37 blymn delete_key_sequence(keymap_t *current, int key_type)
346 1.37 blymn {
347 1.37 blymn key_entry_t *key;
348 1.37 blymn int i;
349 1.37 blymn
350 1.37 blymn /*
351 1.37 blymn * we need to iterate over all the keys as there may be
352 1.37 blymn * multiple instances of the leaf symbol.
353 1.37 blymn */
354 1.37 blymn for (i = 0; i < MAX_CHAR; i++) {
355 1.37 blymn if (current->mapping[i] < 0)
356 1.37 blymn continue; /* no mapping for the key, next! */
357 1.37 blymn
358 1.37 blymn key = current->key[current->mapping[i]];
359 1.37 blymn
360 1.37 blymn if (key->type == KEYMAP_MULTI) {
361 1.37 blymn /* have not found the leaf, recurse down */
362 1.37 blymn delete_key_sequence(key->value.next, key_type);
363 1.37 blymn /* if we deleted the last key in the map, free */
364 1.37 blymn if (key->value.next->count == 0)
365 1.37 blymn _cursesi_free_keymap(key->value.next);
366 1.37 blymn } else if ((key->type == KEYMAP_LEAF)
367 1.37 blymn && (key->value.symbol == key_type)) {
368 1.58 blymn #ifdef DEBUG
369 1.58 blymn __CTRACE(__CTRACE_INPUT, "delete_key_sequence: found keysym %d, deleting\n",
370 1.58 blymn key_type);
371 1.58 blymn #endif
372 1.58 blymn key->enable = FALSE;
373 1.37 blymn }
374 1.37 blymn }
375 1.37 blymn }
376 1.48 blymn
377 1.37 blymn /*
378 1.37 blymn * Add the sequence of characters given in sequence as the key mapping
379 1.37 blymn * for the given key symbol.
380 1.37 blymn */
381 1.37 blymn void
382 1.37 blymn add_key_sequence(SCREEN *screen, char *sequence, int key_type)
383 1.37 blymn {
384 1.37 blymn key_entry_t *tmp_key;
385 1.37 blymn keymap_t *current;
386 1.37 blymn int length, j, key_ent;
387 1.37 blymn
388 1.48 blymn #ifdef DEBUG
389 1.48 blymn __CTRACE(__CTRACE_MISC, "add_key_sequence: add key sequence: %s(%s)\n",
390 1.48 blymn sequence, keyname(key_type));
391 1.48 blymn #endif /* DEBUG */
392 1.37 blymn current = screen->base_keymap; /* always start with
393 1.37 blymn * base keymap. */
394 1.37 blymn length = (int) strlen(sequence);
395 1.37 blymn
396 1.49 blymn /*
397 1.49 blymn * OK - we really should never get a zero length string here, either
398 1.59 roy * the terminfo entry is there and it has a value or we are not called
399 1.59 roy * at all. Unfortunately, if someone assigns a terminfo string to the
400 1.49 blymn * ^@ value we get passed a null string which messes up our length.
401 1.49 blymn * So, if we get a null string then just insert a leaf value in
402 1.49 blymn * the 0th char position of the root keymap. Note that we are
403 1.49 blymn * totally screwed if someone terminates a multichar sequence
404 1.49 blymn * with ^@... oh well.
405 1.49 blymn */
406 1.49 blymn if (length == 0)
407 1.49 blymn length = 1;
408 1.49 blymn
409 1.37 blymn for (j = 0; j < length - 1; j++) {
410 1.37 blymn /* add the entry to the struct */
411 1.37 blymn tmp_key = add_new_key(current, sequence[j], KEYMAP_MULTI, 0);
412 1.48 blymn
413 1.37 blymn /* index into the key array - it's
414 1.37 blymn clearer if we stash this */
415 1.37 blymn key_ent = current->mapping[(unsigned char) sequence[j]];
416 1.37 blymn
417 1.37 blymn current->key[key_ent] = tmp_key;
418 1.48 blymn
419 1.37 blymn /* next key uses this map... */
420 1.37 blymn current = current->key[key_ent]->value.next;
421 1.37 blymn }
422 1.37 blymn
423 1.37 blymn /*
424 1.37 blymn * This is the last key in the sequence (it may have been the
425 1.37 blymn * only one but that does not matter) this means it is a leaf
426 1.37 blymn * key and should have a symbol associated with it.
427 1.37 blymn */
428 1.37 blymn tmp_key = add_new_key(current, sequence[length - 1], KEYMAP_LEAF,
429 1.37 blymn key_type);
430 1.37 blymn current->key[current->mapping[(int)sequence[length - 1]]] = tmp_key;
431 1.37 blymn }
432 1.37 blymn
433 1.37 blymn /*
434 1.10 mrg * Init_getch - initialise all the pointers & structures needed to make
435 1.10 mrg * getch work in keypad mode.
436 1.10 mrg *
437 1.10 mrg */
438 1.10 mrg void
439 1.35 blymn __init_getch(SCREEN *screen)
440 1.10 mrg {
441 1.27 blymn char entry[1024], *p;
442 1.55 roy const char *s;
443 1.37 blymn int i;
444 1.55 roy size_t limit, l;
445 1.20 blymn #ifdef DEBUG
446 1.37 blymn int k, length;
447 1.20 blymn #endif
448 1.10 mrg
449 1.10 mrg /* init the inkey state variable */
450 1.10 mrg state = INKEY_NORM;
451 1.10 mrg
452 1.10 mrg /* init the base keymap */
453 1.35 blymn screen->base_keymap = new_keymap();
454 1.10 mrg
455 1.10 mrg /* key input buffer pointers */
456 1.10 mrg start = end = working = 0;
457 1.10 mrg
458 1.55 roy /* now do the terminfo snarfing ... */
459 1.35 blymn
460 1.27 blymn for (i = 0; i < num_tcs; i++) {
461 1.27 blymn p = entry;
462 1.27 blymn limit = 1023;
463 1.55 roy s = screen->term->strs[tc[i].code];
464 1.55 roy if (s == NULL)
465 1.55 roy continue;
466 1.55 roy l = strlen(s) + 1;
467 1.57 joerg if (limit < l)
468 1.55 roy continue;
469 1.55 roy strlcpy(p, s, limit);
470 1.55 roy p += l;
471 1.55 roy limit -= l;
472 1.20 blymn #ifdef DEBUG
473 1.47 jdc __CTRACE(__CTRACE_INIT,
474 1.59 roy "Processing terminfo entry %d, sequence ",
475 1.55 roy tc[i].code);
476 1.37 blymn length = (int) strlen(entry);
477 1.27 blymn for (k = 0; k <= length -1; k++)
478 1.47 jdc __CTRACE(__CTRACE_INIT, "%s", unctrl(entry[k]));
479 1.47 jdc __CTRACE(__CTRACE_INIT, "\n");
480 1.27 blymn #endif
481 1.55 roy add_key_sequence(screen, entry, tc[i].symbol);
482 1.10 mrg }
483 1.10 mrg }
484 1.10 mrg
485 1.10 mrg
486 1.10 mrg /*
487 1.10 mrg * new_keymap - allocates & initialises a new keymap structure. This
488 1.10 mrg * function returns a pointer to the new keymap.
489 1.10 mrg *
490 1.10 mrg */
491 1.13 simonb static keymap_t *
492 1.10 mrg new_keymap(void)
493 1.10 mrg {
494 1.10 mrg int i;
495 1.10 mrg keymap_t *new_map;
496 1.10 mrg
497 1.10 mrg if ((new_map = malloc(sizeof(keymap_t))) == NULL) {
498 1.10 mrg perror("Inkey: Cannot allocate new keymap");
499 1.10 mrg exit(2);
500 1.10 mrg }
501 1.12 pk
502 1.12 pk /* Initialise the new map */
503 1.10 mrg new_map->count = 0;
504 1.10 mrg for (i = 0; i < MAX_CHAR; i++) {
505 1.37 blymn new_map->mapping[i] = MAPPING_UNUSED; /* no mapping for char */
506 1.10 mrg }
507 1.10 mrg
508 1.23 thorpej /* key array will be allocated when first key is added */
509 1.23 thorpej new_map->key = NULL;
510 1.23 thorpej
511 1.20 blymn return new_map;
512 1.10 mrg }
513 1.10 mrg
514 1.10 mrg /*
515 1.10 mrg * new_key - allocates & initialises a new key entry. This function returns
516 1.10 mrg * a pointer to the newly allocated key entry.
517 1.10 mrg *
518 1.10 mrg */
519 1.13 simonb static key_entry_t *
520 1.10 mrg new_key(void)
521 1.10 mrg {
522 1.10 mrg key_entry_t *new_one;
523 1.20 blymn int i;
524 1.36 blymn
525 1.20 blymn if ((new_one = malloc(KEYMAP_ALLOC_CHUNK * sizeof(key_entry_t)))
526 1.20 blymn == NULL) {
527 1.20 blymn perror("inkey: Cannot allocate new key entry chunk");
528 1.10 mrg exit(2);
529 1.10 mrg }
530 1.10 mrg
531 1.20 blymn for (i = 0; i < KEYMAP_ALLOC_CHUNK; i++) {
532 1.20 blymn new_one[i].type = 0;
533 1.20 blymn new_one[i].value.next = NULL;
534 1.20 blymn }
535 1.36 blymn
536 1.20 blymn return new_one;
537 1.10 mrg }
538 1.10 mrg
539 1.10 mrg /*
540 1.10 mrg * inkey - do the work to process keyboard input, check for multi-key
541 1.10 mrg * sequences and return the appropriate symbol if we get a match.
542 1.10 mrg *
543 1.10 mrg */
544 1.10 mrg
545 1.16 blymn wchar_t
546 1.20 blymn inkey(int to, int delay)
547 1.10 mrg {
548 1.21 jdc wchar_t k;
549 1.37 blymn int c, mapping;
550 1.35 blymn keymap_t *current = _cursesi_screen->base_keymap;
551 1.35 blymn FILE *infd = _cursesi_screen->infd;
552 1.10 mrg
553 1.25 jdc k = 0; /* XXX gcc -Wuninitialized */
554 1.25 jdc
555 1.46 christos #ifdef DEBUG
556 1.47 jdc __CTRACE(__CTRACE_INPUT, "inkey (%d, %d)\n", to, delay);
557 1.46 christos #endif
558 1.10 mrg for (;;) { /* loop until we get a complete key sequence */
559 1.10 mrg reread:
560 1.10 mrg if (state == INKEY_NORM) {
561 1.10 mrg if (delay && __timeout(delay) == ERR)
562 1.10 mrg return ERR;
563 1.54 dsl c = fgetc(infd);
564 1.44 jdc if (c == EOF) {
565 1.35 blymn clearerr(infd);
566 1.10 mrg return ERR;
567 1.22 blymn }
568 1.48 blymn
569 1.10 mrg if (delay && (__notimeout() == ERR))
570 1.10 mrg return ERR;
571 1.22 blymn
572 1.16 blymn k = (wchar_t) c;
573 1.10 mrg #ifdef DEBUG
574 1.47 jdc __CTRACE(__CTRACE_INPUT,
575 1.47 jdc "inkey (state normal) got '%s'\n", unctrl(k));
576 1.10 mrg #endif
577 1.10 mrg
578 1.10 mrg working = start;
579 1.10 mrg inbuf[working] = k;
580 1.10 mrg INC_POINTER(working);
581 1.10 mrg end = working;
582 1.10 mrg state = INKEY_ASSEMBLING; /* go to the assembling
583 1.10 mrg * state now */
584 1.12 pk } else if (state == INKEY_BACKOUT) {
585 1.12 pk k = inbuf[working];
586 1.12 pk INC_POINTER(working);
587 1.12 pk if (working == end) { /* see if we have run
588 1.12 pk * out of keys in the
589 1.12 pk * backlog */
590 1.12 pk
591 1.41 jdc /* if we have then switch to assembling */
592 1.12 pk state = INKEY_ASSEMBLING;
593 1.12 pk }
594 1.12 pk } else if (state == INKEY_ASSEMBLING) {
595 1.12 pk /* assembling a key sequence */
596 1.12 pk if (delay) {
597 1.41 jdc if (__timeout(to ? (ESCDELAY / 100) : delay)
598 1.41 jdc == ERR)
599 1.41 jdc return ERR;
600 1.12 pk } else {
601 1.41 jdc if (to && (__timeout(ESCDELAY / 100) == ERR))
602 1.10 mrg return ERR;
603 1.12 pk }
604 1.22 blymn
605 1.54 dsl c = fgetc(infd);
606 1.52 jdc if (ferror(infd)) {
607 1.35 blymn clearerr(infd);
608 1.12 pk return ERR;
609 1.22 blymn }
610 1.48 blymn
611 1.12 pk if ((to || delay) && (__notimeout() == ERR))
612 1.10 mrg return ERR;
613 1.14 simonb
614 1.10 mrg #ifdef DEBUG
615 1.47 jdc __CTRACE(__CTRACE_INPUT,
616 1.47 jdc "inkey (state assembling) got '%s'\n", unctrl(k));
617 1.10 mrg #endif
618 1.52 jdc if (feof(infd) || c == -1) { /* inter-char timeout,
619 1.52 jdc * start backing out */
620 1.35 blymn clearerr(infd);
621 1.12 pk if (start == end)
622 1.12 pk /* no chars in the buffer, restart */
623 1.12 pk goto reread;
624 1.12 pk
625 1.12 pk k = inbuf[start];
626 1.12 pk state = INKEY_TIMEOUT;
627 1.10 mrg } else {
628 1.52 jdc k = (wchar_t) c;
629 1.12 pk inbuf[working] = k;
630 1.12 pk INC_POINTER(working);
631 1.12 pk end = working;
632 1.10 mrg }
633 1.12 pk } else {
634 1.12 pk fprintf(stderr, "Inkey state screwed - exiting!!!");
635 1.12 pk exit(2);
636 1.12 pk }
637 1.10 mrg
638 1.37 blymn /*
639 1.37 blymn * Check key has no special meaning and we have not
640 1.37 blymn * timed out and the key has not been disabled
641 1.37 blymn */
642 1.37 blymn mapping = current->mapping[k];
643 1.37 blymn if (((state == INKEY_TIMEOUT) || (mapping < 0))
644 1.37 blymn || ((current->key[mapping]->type == KEYMAP_LEAF)
645 1.37 blymn && (current->key[mapping]->enable == FALSE))) {
646 1.12 pk /* return the first key we know about */
647 1.12 pk k = inbuf[start];
648 1.10 mrg
649 1.10 mrg INC_POINTER(start);
650 1.10 mrg working = start;
651 1.10 mrg
652 1.10 mrg if (start == end) { /* only one char processed */
653 1.10 mrg state = INKEY_NORM;
654 1.10 mrg } else {/* otherwise we must have more than one char
655 1.10 mrg * to backout */
656 1.10 mrg state = INKEY_BACKOUT;
657 1.10 mrg }
658 1.10 mrg return k;
659 1.10 mrg } else { /* must be part of a multikey sequence */
660 1.10 mrg /* check for completed key sequence */
661 1.10 mrg if (current->key[current->mapping[k]]->type == KEYMAP_LEAF) {
662 1.10 mrg start = working; /* eat the key sequence
663 1.10 mrg * in inbuf */
664 1.10 mrg
665 1.12 pk /* check if inbuf empty now */
666 1.12 pk if (start == end) {
667 1.12 pk /* if it is go back to normal */
668 1.12 pk state = INKEY_NORM;
669 1.12 pk } else {
670 1.12 pk /* otherwise go to backout state */
671 1.10 mrg state = INKEY_BACKOUT;
672 1.10 mrg }
673 1.10 mrg
674 1.10 mrg /* return the symbol */
675 1.10 mrg return current->key[current->mapping[k]]->value.symbol;
676 1.10 mrg
677 1.12 pk } else {
678 1.12 pk /*
679 1.12 pk * Step on to next part of the multi-key
680 1.12 pk * sequence.
681 1.12 pk */
682 1.10 mrg current = current->key[current->mapping[k]]->value.next;
683 1.10 mrg }
684 1.10 mrg }
685 1.10 mrg }
686 1.10 mrg }
687 1.10 mrg
688 1.18 blymn #ifndef _CURSES_USE_MACROS
689 1.18 blymn /*
690 1.18 blymn * getch --
691 1.18 blymn * Read in a character from stdscr.
692 1.18 blymn */
693 1.18 blymn int
694 1.18 blymn getch(void)
695 1.18 blymn {
696 1.18 blymn return wgetch(stdscr);
697 1.18 blymn }
698 1.18 blymn
699 1.18 blymn /*
700 1.18 blymn * mvgetch --
701 1.18 blymn * Read in a character from stdscr at the given location.
702 1.18 blymn */
703 1.18 blymn int
704 1.18 blymn mvgetch(int y, int x)
705 1.18 blymn {
706 1.18 blymn return mvwgetch(stdscr, y, x);
707 1.18 blymn }
708 1.18 blymn
709 1.18 blymn /*
710 1.18 blymn * mvwgetch --
711 1.18 blymn * Read in a character from stdscr at the given location in the
712 1.18 blymn * given window.
713 1.18 blymn */
714 1.18 blymn int
715 1.18 blymn mvwgetch(WINDOW *win, int y, int x)
716 1.18 blymn {
717 1.18 blymn if (wmove(win, y, x) == ERR)
718 1.18 blymn return ERR;
719 1.18 blymn
720 1.18 blymn return wgetch(win);
721 1.18 blymn }
722 1.18 blymn
723 1.18 blymn #endif
724 1.18 blymn
725 1.37 blymn /*
726 1.37 blymn * keyok --
727 1.37 blymn * Set the enable flag for a keysym, if the flag is false then
728 1.37 blymn * getch will not return this keysym even if the matching key sequence
729 1.37 blymn * is seen.
730 1.37 blymn */
731 1.37 blymn int
732 1.37 blymn keyok(int key_type, bool flag)
733 1.37 blymn {
734 1.37 blymn int result = ERR;
735 1.48 blymn
736 1.37 blymn do_keyok(_cursesi_screen->base_keymap, key_type, flag, &result);
737 1.37 blymn return result;
738 1.37 blymn }
739 1.37 blymn
740 1.37 blymn /*
741 1.37 blymn * do_keyok --
742 1.37 blymn * Does the actual work for keyok, we need to recurse through the
743 1.37 blymn * keymaps finding the passed key symbol.
744 1.37 blymn */
745 1.37 blymn void
746 1.37 blymn do_keyok(keymap_t *current, int key_type, bool flag, int *retval)
747 1.37 blymn {
748 1.37 blymn key_entry_t *key;
749 1.37 blymn int i;
750 1.37 blymn
751 1.37 blymn /*
752 1.37 blymn * we need to iterate over all the keys as there may be
753 1.37 blymn * multiple instances of the leaf symbol.
754 1.37 blymn */
755 1.37 blymn for (i = 0; i < MAX_CHAR; i++) {
756 1.37 blymn if (current->mapping[i] < 0)
757 1.37 blymn continue; /* no mapping for the key, next! */
758 1.37 blymn
759 1.37 blymn key = current->key[current->mapping[i]];
760 1.37 blymn
761 1.37 blymn if (key->type == KEYMAP_MULTI)
762 1.37 blymn do_keyok(key->value.next, key_type, flag, retval);
763 1.37 blymn else if ((key->type == KEYMAP_LEAF)
764 1.37 blymn && (key->value.symbol == key_type)) {
765 1.37 blymn key->enable = flag;
766 1.37 blymn *retval = OK; /* we found at least one instance, ok */
767 1.37 blymn }
768 1.37 blymn }
769 1.37 blymn }
770 1.37 blymn
771 1.37 blymn /*
772 1.37 blymn * define_key --
773 1.37 blymn * Add a custom mapping of a key sequence to key symbol.
774 1.37 blymn *
775 1.37 blymn */
776 1.37 blymn int
777 1.37 blymn define_key(char *sequence, int symbol)
778 1.37 blymn {
779 1.37 blymn
780 1.37 blymn if (symbol <= 0)
781 1.37 blymn return ERR;
782 1.37 blymn
783 1.58 blymn if (sequence == NULL) {
784 1.58 blymn #ifdef DEBUG
785 1.58 blymn __CTRACE(__CTRACE_INPUT, "define_key: deleting keysym %d\n",
786 1.58 blymn symbol);
787 1.58 blymn #endif
788 1.37 blymn delete_key_sequence(_cursesi_screen->base_keymap, symbol);
789 1.58 blymn } else
790 1.37 blymn add_key_sequence(_cursesi_screen, sequence, symbol);
791 1.37 blymn
792 1.37 blymn return OK;
793 1.37 blymn }
794 1.48 blymn
795 1.1 cgd /*
796 1.4 mycroft * wgetch --
797 1.4 mycroft * Read in a character from the window.
798 1.1 cgd */
799 1.4 mycroft int
800 1.18 blymn wgetch(WINDOW *win)
801 1.4 mycroft {
802 1.30 itojun int inp, weset;
803 1.30 itojun int c;
804 1.35 blymn FILE *infd = _cursesi_screen->infd;
805 1.1 cgd
806 1.51 jdc #ifdef DEBUG
807 1.51 jdc __CTRACE(__CTRACE_INPUT, "wgetch: win(%p)\n", win);
808 1.51 jdc #endif
809 1.5 cgd if (!(win->flags & __SCROLLOK) && (win->flags & __FULLWIN)
810 1.10 mrg && win->curx == win->maxx - 1 && win->cury == win->maxy - 1
811 1.10 mrg && __echoit)
812 1.4 mycroft return (ERR);
813 1.25 jdc
814 1.32 itojun if (is_wintouched(win))
815 1.32 itojun wrefresh(win);
816 1.4 mycroft #ifdef DEBUG
817 1.47 jdc __CTRACE(__CTRACE_INPUT, "wgetch: __echoit = %d, "
818 1.52 jdc "__rawmode = %d, __nl = %d, flags = %#.4x, delay = %d\n",
819 1.52 jdc __echoit, __rawmode, _cursesi_screen->nl, win->flags, win->delay);
820 1.4 mycroft #endif
821 1.50 jdc if (_cursesi_screen->resized) {
822 1.50 jdc _cursesi_screen->resized = 0;
823 1.51 jdc #ifdef DEBUG
824 1.51 jdc __CTRACE(__CTRACE_INPUT, "wgetch returning KEY_RESIZE\n");
825 1.51 jdc #endif
826 1.50 jdc return KEY_RESIZE;
827 1.50 jdc }
828 1.50 jdc if (_cursesi_screen->unget_pos) {
829 1.50 jdc #ifdef DEBUG
830 1.50 jdc __CTRACE(__CTRACE_INPUT, "wgetch returning char at %d\n",
831 1.50 jdc _cursesi_screen->unget_pos);
832 1.50 jdc #endif
833 1.50 jdc _cursesi_screen->unget_pos--;
834 1.50 jdc c = _cursesi_screen->unget_list[_cursesi_screen->unget_pos];
835 1.50 jdc if (__echoit)
836 1.50 jdc waddch(win, (chtype) c);
837 1.50 jdc return c;
838 1.50 jdc }
839 1.4 mycroft if (__echoit && !__rawmode) {
840 1.1 cgd cbreak();
841 1.4 mycroft weset = 1;
842 1.4 mycroft } else
843 1.4 mycroft weset = 0;
844 1.4 mycroft
845 1.10 mrg __save_termios();
846 1.10 mrg
847 1.10 mrg if (win->flags & __KEYPAD) {
848 1.10 mrg switch (win->delay)
849 1.10 mrg {
850 1.10 mrg case -1:
851 1.10 mrg inp = inkey (win->flags & __NOTIMEOUT ? 0 : 1, 0);
852 1.10 mrg break;
853 1.10 mrg case 0:
854 1.53 dsl if (__nodelay() == ERR)
855 1.19 jdc return ERR;
856 1.10 mrg inp = inkey(0, 0);
857 1.10 mrg break;
858 1.10 mrg default:
859 1.10 mrg inp = inkey(win->flags & __NOTIMEOUT ? 0 : 1, win->delay);
860 1.10 mrg break;
861 1.10 mrg }
862 1.10 mrg } else {
863 1.10 mrg switch (win->delay)
864 1.10 mrg {
865 1.10 mrg case -1:
866 1.53 dsl if (__delay() == ERR)
867 1.46 christos return ERR;
868 1.10 mrg break;
869 1.10 mrg case 0:
870 1.53 dsl if (__nodelay() == ERR)
871 1.10 mrg return ERR;
872 1.10 mrg break;
873 1.10 mrg default:
874 1.53 dsl if (__timeout(win->delay) == ERR)
875 1.10 mrg return ERR;
876 1.10 mrg break;
877 1.10 mrg }
878 1.12 pk
879 1.54 dsl c = fgetc(infd);
880 1.35 blymn if (feof(infd)) {
881 1.35 blymn clearerr(infd);
882 1.22 blymn __restore_termios();
883 1.22 blymn return ERR; /* we have timed out */
884 1.22 blymn }
885 1.48 blymn
886 1.35 blymn if (ferror(infd)) {
887 1.35 blymn clearerr(infd);
888 1.10 mrg inp = ERR;
889 1.12 pk } else {
890 1.30 itojun inp = c;
891 1.10 mrg }
892 1.10 mrg }
893 1.4 mycroft #ifdef DEBUG
894 1.15 simonb if (inp > 255)
895 1.20 blymn /* we have a key symbol - treat it differently */
896 1.20 blymn /* XXXX perhaps __unctrl should be expanded to include
897 1.20 blymn * XXXX the keysyms in the table....
898 1.20 blymn */
899 1.47 jdc __CTRACE(__CTRACE_INPUT, "wgetch assembled keysym 0x%x\n", inp);
900 1.15 simonb else
901 1.47 jdc __CTRACE(__CTRACE_INPUT, "wgetch got '%s'\n", unctrl(inp));
902 1.4 mycroft #endif
903 1.12 pk if (win->delay > -1) {
904 1.53 dsl if (__delay() == ERR)
905 1.10 mrg return ERR;
906 1.12 pk }
907 1.12 pk
908 1.10 mrg __restore_termios();
909 1.27 blymn
910 1.56 blymn if ((__echoit) && (inp < KEY_MIN))
911 1.16 blymn waddch(win, (chtype) inp);
912 1.27 blymn
913 1.1 cgd if (weset)
914 1.1 cgd nocbreak();
915 1.40 jdc
916 1.40 jdc if (_cursesi_screen->nl && inp == 13)
917 1.40 jdc inp = 10;
918 1.12 pk
919 1.10 mrg return ((inp < 0) || (inp == ERR) ? ERR : inp);
920 1.22 blymn }
921 1.22 blymn
922 1.22 blymn /*
923 1.22 blymn * ungetch --
924 1.22 blymn * Put the character back into the input queue.
925 1.22 blymn */
926 1.22 blymn int
927 1.22 blymn ungetch(int c)
928 1.22 blymn {
929 1.50 jdc return __unget((wint_t) c);
930 1.50 jdc }
931 1.50 jdc
932 1.50 jdc /*
933 1.50 jdc * __unget --
934 1.50 jdc * Do the work for ungetch() and unget_wch();
935 1.50 jdc */
936 1.50 jdc int
937 1.50 jdc __unget(wint_t c)
938 1.50 jdc {
939 1.50 jdc wchar_t *p;
940 1.50 jdc int len;
941 1.50 jdc
942 1.50 jdc #ifdef DEBUG
943 1.50 jdc __CTRACE(__CTRACE_INPUT, "__unget(%x)\n", c);
944 1.50 jdc #endif
945 1.50 jdc if (_cursesi_screen->unget_pos >= _cursesi_screen->unget_len) {
946 1.50 jdc len = _cursesi_screen->unget_len + 32;
947 1.50 jdc if ((p = realloc(_cursesi_screen->unget_list,
948 1.50 jdc sizeof(wchar_t) * len)) == NULL) {
949 1.50 jdc /* Can't realloc(), so just lose the oldest entry */
950 1.50 jdc memmove(_cursesi_screen->unget_list,
951 1.50 jdc _cursesi_screen->unget_list + sizeof(wchar_t),
952 1.50 jdc _cursesi_screen->unget_len - 1);
953 1.50 jdc _cursesi_screen->unget_list[_cursesi_screen->unget_len
954 1.50 jdc - 1] = c;
955 1.50 jdc _cursesi_screen->unget_pos =
956 1.50 jdc _cursesi_screen->unget_len;
957 1.50 jdc return OK;
958 1.50 jdc } else {
959 1.50 jdc _cursesi_screen->unget_pos =
960 1.50 jdc _cursesi_screen->unget_len;
961 1.50 jdc _cursesi_screen->unget_len = len;
962 1.50 jdc _cursesi_screen->unget_list = p;
963 1.50 jdc }
964 1.50 jdc }
965 1.50 jdc _cursesi_screen->unget_list[_cursesi_screen->unget_pos] = c;
966 1.50 jdc _cursesi_screen->unget_pos++;
967 1.50 jdc return OK;
968 1.1 cgd }
969