1 /*
2  * CDDL HEADER START
3  *
4  * The contents of this file are subject to the terms of the
5  * Common Development and Distribution License, Version 1.0 only
6  * (the "License").  You may not use this file except in compliance
7  * with the License.
8  *
9  * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
10  * or http://www.opensolaris.org/os/licensing.
11  * See the License for the specific language governing permissions
12  * and limitations under the License.
13  *
14  * When distributing Covered Code, include this CDDL HEADER in each
15  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
16  * If applicable, add the following below this CDDL HEADER, with the
17  * fields enclosed by brackets "[]" replaced with your own identifying
18  * information: Portions Copyright [yyyy] [name of copyright owner]
19  *
20  * CDDL HEADER END
21  */
22 /*
23  * Copyright 1997 Sun Microsystems, Inc.  All rights reserved.
24  * Use is subject to license terms.
25  */
26 
27 /*	Copyright (c) 1988 AT&T	*/
28 /*	  All Rights Reserved	*/
29 
30 /*
31  * University Copyright- Copyright (c) 1982, 1986, 1988
32  * The Regents of the University of California
33  * All Rights Reserved
34  *
35  * University Acknowledgment- Portions of this document are derived from
36  * software developed by the University of California, Berkeley, and its
37  * contributors.
38  */
39 
40 /*LINTLIBRARY*/
41 
42 #include	<sys/types.h>
43 #include	"curses_inc.h"
44 
45 /* Clear the soft labels. */
46 
47 int
slk_clear(void)48 slk_clear(void)
49 {
50 	SLK_MAP	*slk;
51 	int	i;
52 	char *	spaces = "        ";
53 
54 	if ((slk = SP->slk) == NULL)
55 		return (ERR);
56 
57 	slk->_changed = 2;	/* This means no more soft labels. */
58 	if (slk->_win) {
59 		(void) werase(slk->_win);
60 		(void) wrefresh(slk->_win);
61 	} else {
62 		/* send hardware clear sequences */
63 		for (i = 0; i < slk->_num; i++)
64 			_PUTS(tparm_p2(plab_norm, i + 1,
65 			    (long) spaces), 1);
66 		_PUTS(label_off, 1);
67 		(void) fflush(SP->term_file);
68 	}
69 
70 	for (i = 0; i < slk->_num; ++i)
71 		slk->_lch[i] = FALSE;
72 
73 	return (OK);
74 }
75