1*0Sstevel@tonic-gate /*
2*0Sstevel@tonic-gate * CDDL HEADER START
3*0Sstevel@tonic-gate *
4*0Sstevel@tonic-gate * The contents of this file are subject to the terms of the
5*0Sstevel@tonic-gate * Common Development and Distribution License, Version 1.0 only
6*0Sstevel@tonic-gate * (the "License"). You may not use this file except in compliance
7*0Sstevel@tonic-gate * with the License.
8*0Sstevel@tonic-gate *
9*0Sstevel@tonic-gate * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10*0Sstevel@tonic-gate * or http://www.opensolaris.org/os/licensing.
11*0Sstevel@tonic-gate * See the License for the specific language governing permissions
12*0Sstevel@tonic-gate * and limitations under the License.
13*0Sstevel@tonic-gate *
14*0Sstevel@tonic-gate * When distributing Covered Code, include this CDDL HEADER in each
15*0Sstevel@tonic-gate * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16*0Sstevel@tonic-gate * If applicable, add the following below this CDDL HEADER, with the
17*0Sstevel@tonic-gate * fields enclosed by brackets "[]" replaced with your own identifying
18*0Sstevel@tonic-gate * information: Portions Copyright [yyyy] [name of copyright owner]
19*0Sstevel@tonic-gate *
20*0Sstevel@tonic-gate * CDDL HEADER END
21*0Sstevel@tonic-gate */
22*0Sstevel@tonic-gate /*
23*0Sstevel@tonic-gate * Copyright 1997 Sun Microsystems, Inc. All rights reserved.
24*0Sstevel@tonic-gate * Use is subject to license terms.
25*0Sstevel@tonic-gate */
26*0Sstevel@tonic-gate
27*0Sstevel@tonic-gate /* Copyright (c) 1988 AT&T */
28*0Sstevel@tonic-gate /* All Rights Reserved */
29*0Sstevel@tonic-gate
30*0Sstevel@tonic-gate /*
31*0Sstevel@tonic-gate * University Copyright- Copyright (c) 1982, 1986, 1988
32*0Sstevel@tonic-gate * The Regents of the University of California
33*0Sstevel@tonic-gate * All Rights Reserved
34*0Sstevel@tonic-gate *
35*0Sstevel@tonic-gate * University Acknowledgment- Portions of this document are derived from
36*0Sstevel@tonic-gate * software developed by the University of California, Berkeley, and its
37*0Sstevel@tonic-gate * contributors.
38*0Sstevel@tonic-gate */
39*0Sstevel@tonic-gate
40*0Sstevel@tonic-gate #pragma ident "%Z%%M% %I% %E% SMI"
41*0Sstevel@tonic-gate
42*0Sstevel@tonic-gate /*LINTLIBRARY*/
43*0Sstevel@tonic-gate
44*0Sstevel@tonic-gate #include <stdlib.h>
45*0Sstevel@tonic-gate #include <string.h>
46*0Sstevel@tonic-gate #include <sys/types.h>
47*0Sstevel@tonic-gate #include "curses_inc.h"
48*0Sstevel@tonic-gate
49*0Sstevel@tonic-gate /*
50*0Sstevel@tonic-gate * Set a new key or a new macro.
51*0Sstevel@tonic-gate *
52*0Sstevel@tonic-gate * rcvchars: the pattern identifying the key
53*0Sstevel@tonic-gate * keyval: the value to return when the key is recognized
54*0Sstevel@tonic-gate * macro: if this is not a function key but a macro,
55*0Sstevel@tonic-gate * tgetch() will block on macros.
56*0Sstevel@tonic-gate */
57*0Sstevel@tonic-gate
58*0Sstevel@tonic-gate int
newkey(char * rcvchars,short keyval,bool macro)59*0Sstevel@tonic-gate newkey(char *rcvchars, short keyval, bool macro)
60*0Sstevel@tonic-gate {
61*0Sstevel@tonic-gate _KEY_MAP **keys, *key_info,
62*0Sstevel@tonic-gate **prev_keys = cur_term->_keys;
63*0Sstevel@tonic-gate short *numkeys = &cur_term->_ksz;
64*0Sstevel@tonic-gate char *str;
65*0Sstevel@tonic-gate size_t len;
66*0Sstevel@tonic-gate
67*0Sstevel@tonic-gate if ((!rcvchars) || (*rcvchars == '\0') || (keyval < 0) ||
68*0Sstevel@tonic-gate (((keys = (_KEY_MAP **) malloc(sizeof (_KEY_MAP *) *
69*0Sstevel@tonic-gate (*numkeys + 1))) == NULL))) {
70*0Sstevel@tonic-gate goto bad;
71*0Sstevel@tonic-gate }
72*0Sstevel@tonic-gate
73*0Sstevel@tonic-gate len = strlen(rcvchars) + 1;
74*0Sstevel@tonic-gate
75*0Sstevel@tonic-gate if ((key_info = (_KEY_MAP *) malloc(sizeof (_KEY_MAP) + len)) ==
76*0Sstevel@tonic-gate NULL) {
77*0Sstevel@tonic-gate free(keys);
78*0Sstevel@tonic-gate bad :
79*0Sstevel@tonic-gate term_errno = TERM_BAD_MALLOC;
80*0Sstevel@tonic-gate #ifdef DEBUG
81*0Sstevel@tonic-gate strcpy(term_parm_err, "newkey");
82*0Sstevel@tonic-gate #endif /* DEBUG */
83*0Sstevel@tonic-gate return (ERR);
84*0Sstevel@tonic-gate }
85*0Sstevel@tonic-gate
86*0Sstevel@tonic-gate if (macro) {
87*0Sstevel@tonic-gate (void) memcpy((char *) keys, (char *) prev_keys,
88*0Sstevel@tonic-gate (*numkeys * sizeof (_KEY_MAP *)));
89*0Sstevel@tonic-gate keys[*numkeys] = key_info;
90*0Sstevel@tonic-gate } else {
91*0Sstevel@tonic-gate short *first = &(cur_term->_first_macro);
92*0Sstevel@tonic-gate
93*0Sstevel@tonic-gate (void) memcpy((char *) keys, (char *) prev_keys,
94*0Sstevel@tonic-gate (*first * sizeof (_KEY_MAP *)));
95*0Sstevel@tonic-gate (void) memcpy((char *) &(keys[*first + 1]),
96*0Sstevel@tonic-gate (char *) &(prev_keys[*first]),
97*0Sstevel@tonic-gate ((*numkeys - *first) * sizeof (_KEY_MAP *)));
98*0Sstevel@tonic-gate keys[(*first)++] = key_info;
99*0Sstevel@tonic-gate cur_term->_lastmacro_ordered++;
100*0Sstevel@tonic-gate }
101*0Sstevel@tonic-gate if (prev_keys != NULL)
102*0Sstevel@tonic-gate free(prev_keys);
103*0Sstevel@tonic-gate cur_term->_keys = keys;
104*0Sstevel@tonic-gate
105*0Sstevel@tonic-gate (*numkeys)++;
106*0Sstevel@tonic-gate key_info->_sends = str = (char *) key_info + sizeof (_KEY_MAP);
107*0Sstevel@tonic-gate (void) memcpy(str, rcvchars, len);
108*0Sstevel@tonic-gate key_info->_keyval = keyval;
109*0Sstevel@tonic-gate cur_term->funckeystarter[*str] |= (macro ? _MACRO : _KEY);
110*0Sstevel@tonic-gate
111*0Sstevel@tonic-gate return (OK);
112*0Sstevel@tonic-gate }
113