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 1997 Sun Microsystems, Inc. All rights reserved.
24*7c478bd9Sstevel@tonic-gate * Use is subject to license terms.
25*7c478bd9Sstevel@tonic-gate */
26*7c478bd9Sstevel@tonic-gate
27*7c478bd9Sstevel@tonic-gate /* Copyright (c) 1988 AT&T */
28*7c478bd9Sstevel@tonic-gate /* All Rights Reserved */
29*7c478bd9Sstevel@tonic-gate
30*7c478bd9Sstevel@tonic-gate /*
31*7c478bd9Sstevel@tonic-gate * University Copyright- Copyright (c) 1982, 1986, 1988
32*7c478bd9Sstevel@tonic-gate * The Regents of the University of California
33*7c478bd9Sstevel@tonic-gate * All Rights Reserved
34*7c478bd9Sstevel@tonic-gate *
35*7c478bd9Sstevel@tonic-gate * University Acknowledgment- Portions of this document are derived from
36*7c478bd9Sstevel@tonic-gate * software developed by the University of California, Berkeley, and its
37*7c478bd9Sstevel@tonic-gate * contributors.
38*7c478bd9Sstevel@tonic-gate */
39*7c478bd9Sstevel@tonic-gate
40*7c478bd9Sstevel@tonic-gate /*LINTLIBRARY*/
41*7c478bd9Sstevel@tonic-gate
42*7c478bd9Sstevel@tonic-gate #include <stdlib.h>
43*7c478bd9Sstevel@tonic-gate #include <string.h>
44*7c478bd9Sstevel@tonic-gate #include <sys/types.h>
45*7c478bd9Sstevel@tonic-gate #include "curses_inc.h"
46*7c478bd9Sstevel@tonic-gate
47*7c478bd9Sstevel@tonic-gate /* Delete keys matching pat or key from the key map. */
48*7c478bd9Sstevel@tonic-gate
49*7c478bd9Sstevel@tonic-gate int
delkey(char * sends,int keyval)50*7c478bd9Sstevel@tonic-gate delkey(char *sends, int keyval)
51*7c478bd9Sstevel@tonic-gate {
52*7c478bd9Sstevel@tonic-gate _KEY_MAP *kp, **kpp = cur_term->_keys, **fpp, **dpp;
53*7c478bd9Sstevel@tonic-gate int mask = 0, cmp, numkeys = cur_term->_ksz;
54*7c478bd9Sstevel@tonic-gate int counter = 0, i, num_deleted_keys = 0;
55*7c478bd9Sstevel@tonic-gate short *lkorder = &(cur_term->_lastkey_ordered),
56*7c478bd9Sstevel@tonic-gate *first_macro = &(cur_term->_first_macro),
57*7c478bd9Sstevel@tonic-gate *lmorder = &(cur_term->_lastmacro_ordered);
58*7c478bd9Sstevel@tonic-gate
59*7c478bd9Sstevel@tonic-gate /* for ease of determination of key to delete */
60*7c478bd9Sstevel@tonic-gate if (sends)
61*7c478bd9Sstevel@tonic-gate mask |= 01;
62*7c478bd9Sstevel@tonic-gate if (keyval >= 0)
63*7c478bd9Sstevel@tonic-gate mask |= 02;
64*7c478bd9Sstevel@tonic-gate
65*7c478bd9Sstevel@tonic-gate /* check each key */
66*7c478bd9Sstevel@tonic-gate while (++counter < numkeys) {
67*7c478bd9Sstevel@tonic-gate kp = *kpp;
68*7c478bd9Sstevel@tonic-gate cmp = 0;
69*7c478bd9Sstevel@tonic-gate if (sends && (strcmp(sends, kp->_sends) == 0))
70*7c478bd9Sstevel@tonic-gate cmp |= 01;
71*7c478bd9Sstevel@tonic-gate if (kp->_keyval == keyval)
72*7c478bd9Sstevel@tonic-gate cmp |= 02;
73*7c478bd9Sstevel@tonic-gate
74*7c478bd9Sstevel@tonic-gate /* found one to delete */
75*7c478bd9Sstevel@tonic-gate if (cmp == mask) {
76*7c478bd9Sstevel@tonic-gate num_deleted_keys++;
77*7c478bd9Sstevel@tonic-gate /*
78*7c478bd9Sstevel@tonic-gate * If it was an externally created key, then the address
79*7c478bd9Sstevel@tonic-gate * of the sequence will be right after the structure.
80*7c478bd9Sstevel@tonic-gate * See the malloc in newkey.
81*7c478bd9Sstevel@tonic-gate */
82*7c478bd9Sstevel@tonic-gate if (kp->_sends == ((char *)kp + sizeof (_KEY_MAP)))
83*7c478bd9Sstevel@tonic-gate free(kp);
84*7c478bd9Sstevel@tonic-gate
85*7c478bd9Sstevel@tonic-gate /* shift left other keys */
86*7c478bd9Sstevel@tonic-gate i = (numkeys - counter) - 1;
87*7c478bd9Sstevel@tonic-gate for (fpp = kpp, dpp = kpp + 1; i > 0; i--, fpp++, dpp++)
88*7c478bd9Sstevel@tonic-gate *fpp = *dpp;
89*7c478bd9Sstevel@tonic-gate if (counter <= *lmorder) {
90*7c478bd9Sstevel@tonic-gate if (counter < *first_macro) {
91*7c478bd9Sstevel@tonic-gate if (counter <= *lkorder)
92*7c478bd9Sstevel@tonic-gate (*lkorder)--;
93*7c478bd9Sstevel@tonic-gate (*first_macro)--;
94*7c478bd9Sstevel@tonic-gate }
95*7c478bd9Sstevel@tonic-gate (*lmorder)--;
96*7c478bd9Sstevel@tonic-gate }
97*7c478bd9Sstevel@tonic-gate } else
98*7c478bd9Sstevel@tonic-gate kpp++;
99*7c478bd9Sstevel@tonic-gate }
100*7c478bd9Sstevel@tonic-gate
101*7c478bd9Sstevel@tonic-gate /* Check if we've crossed boundary and/or hit 0 */
102*7c478bd9Sstevel@tonic-gate
103*7c478bd9Sstevel@tonic-gate if ((cur_term->_ksz -= num_deleted_keys) == 0)
104*7c478bd9Sstevel@tonic-gate (void) delkeymap(cur_term);
105*7c478bd9Sstevel@tonic-gate else
106*7c478bd9Sstevel@tonic-gate cur_term->_keys = (_KEY_MAP **) realloc((char *)
107*7c478bd9Sstevel@tonic-gate cur_term->_keys, (unsigned)cur_term->_ksz);
108*7c478bd9Sstevel@tonic-gate
109*7c478bd9Sstevel@tonic-gate return (num_deleted_keys);
110*7c478bd9Sstevel@tonic-gate }
111