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 /* Delete keys matching pat or key from the key map. */
50*0Sstevel@tonic-gate
51*0Sstevel@tonic-gate int
delkey(char * sends,int keyval)52*0Sstevel@tonic-gate delkey(char *sends, int keyval)
53*0Sstevel@tonic-gate {
54*0Sstevel@tonic-gate _KEY_MAP *kp, **kpp = cur_term->_keys, **fpp, **dpp;
55*0Sstevel@tonic-gate int mask = 0, cmp, numkeys = cur_term->_ksz;
56*0Sstevel@tonic-gate int counter = 0, i, num_deleted_keys = 0;
57*0Sstevel@tonic-gate short *lkorder = &(cur_term->_lastkey_ordered),
58*0Sstevel@tonic-gate *first_macro = &(cur_term->_first_macro),
59*0Sstevel@tonic-gate *lmorder = &(cur_term->_lastmacro_ordered);
60*0Sstevel@tonic-gate
61*0Sstevel@tonic-gate /* for ease of determination of key to delete */
62*0Sstevel@tonic-gate if (sends)
63*0Sstevel@tonic-gate mask |= 01;
64*0Sstevel@tonic-gate if (keyval >= 0)
65*0Sstevel@tonic-gate mask |= 02;
66*0Sstevel@tonic-gate
67*0Sstevel@tonic-gate /* check each key */
68*0Sstevel@tonic-gate while (++counter < numkeys) {
69*0Sstevel@tonic-gate kp = *kpp;
70*0Sstevel@tonic-gate cmp = 0;
71*0Sstevel@tonic-gate if (sends && (strcmp(sends, kp->_sends) == 0))
72*0Sstevel@tonic-gate cmp |= 01;
73*0Sstevel@tonic-gate if (kp->_keyval == keyval)
74*0Sstevel@tonic-gate cmp |= 02;
75*0Sstevel@tonic-gate
76*0Sstevel@tonic-gate /* found one to delete */
77*0Sstevel@tonic-gate if (cmp == mask) {
78*0Sstevel@tonic-gate num_deleted_keys++;
79*0Sstevel@tonic-gate /*
80*0Sstevel@tonic-gate * If it was an externally created key, then the address
81*0Sstevel@tonic-gate * of the sequence will be right after the structure.
82*0Sstevel@tonic-gate * See the malloc in newkey.
83*0Sstevel@tonic-gate */
84*0Sstevel@tonic-gate if (kp->_sends == ((char *)kp + sizeof (_KEY_MAP)))
85*0Sstevel@tonic-gate free(kp);
86*0Sstevel@tonic-gate
87*0Sstevel@tonic-gate /* shift left other keys */
88*0Sstevel@tonic-gate i = (numkeys - counter) - 1;
89*0Sstevel@tonic-gate for (fpp = kpp, dpp = kpp + 1; i > 0; i--, fpp++, dpp++)
90*0Sstevel@tonic-gate *fpp = *dpp;
91*0Sstevel@tonic-gate if (counter <= *lmorder) {
92*0Sstevel@tonic-gate if (counter < *first_macro) {
93*0Sstevel@tonic-gate if (counter <= *lkorder)
94*0Sstevel@tonic-gate (*lkorder)--;
95*0Sstevel@tonic-gate (*first_macro)--;
96*0Sstevel@tonic-gate }
97*0Sstevel@tonic-gate (*lmorder)--;
98*0Sstevel@tonic-gate }
99*0Sstevel@tonic-gate } else
100*0Sstevel@tonic-gate kpp++;
101*0Sstevel@tonic-gate }
102*0Sstevel@tonic-gate
103*0Sstevel@tonic-gate /* Check if we've crossed boundary and/or hit 0 */
104*0Sstevel@tonic-gate
105*0Sstevel@tonic-gate if ((cur_term->_ksz -= num_deleted_keys) == 0)
106*0Sstevel@tonic-gate (void) delkeymap(cur_term);
107*0Sstevel@tonic-gate else
108*0Sstevel@tonic-gate cur_term->_keys = (_KEY_MAP **) realloc((char *)
109*0Sstevel@tonic-gate cur_term->_keys, (unsigned)cur_term->_ksz);
110*0Sstevel@tonic-gate
111*0Sstevel@tonic-gate return (num_deleted_keys);
112*0Sstevel@tonic-gate }
113