xref: /netbsd/lib/libcurses/insch.c (revision bf9ec67e)
1 /*	$NetBSD: insch.c,v 1.16 2002/01/02 10:38:28 blymn Exp $	*/
2 
3 /*
4  * Copyright (c) 1981, 1993, 1994
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. All advertising materials mentioning features or use of this software
16  *    must display the following acknowledgement:
17  *	This product includes software developed by the University of
18  *	California, Berkeley and its contributors.
19  * 4. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #include <sys/cdefs.h>
37 #ifndef lint
38 #if 0
39 static char sccsid[] = "@(#)insch.c	8.2 (Berkeley) 5/4/94";
40 #else
41 __RCSID("$NetBSD: insch.c,v 1.16 2002/01/02 10:38:28 blymn Exp $");
42 #endif
43 #endif				/* not lint */
44 
45 #include <string.h>
46 
47 #include "curses.h"
48 #include "curses_private.h"
49 
50 #ifndef _CURSES_USE_MACROS
51 
52 /*
53  * insch --
54  *	Do an insert-char on the line, leaving (cury, curx) unchanged.
55  */
56 int
57 insch(chtype ch)
58 {
59 	return winsch(stdscr, ch);
60 }
61 
62 /*
63  * mvinsch --
64  *      Do an insert-char on the line at (y, x).
65  */
66 int
67 mvinsch(int y, int x, chtype ch)
68 {
69 	return mvwinsch(stdscr, y, x, ch);
70 }
71 
72 /*
73  * mvwinsch --
74  *      Do an insert-char on the line at (y, x) in the given window.
75  */
76 int
77 mvwinsch(WINDOW *win, int y, int x, chtype ch)
78 {
79 	if (wmove(win, y, x) == ERR)
80 		return ERR;
81 
82 	return winsch(stdscr, ch);
83 }
84 
85 #endif
86 
87 /*
88  * winsch --
89  *	Do an insert-char on the line, leaving (cury, curx) unchanged.
90  */
91 int
92 winsch(WINDOW *win, chtype ch)
93 {
94 
95 	__LDATA	*end, *temp1, *temp2;
96 
97 	end = &win->lines[win->cury]->line[win->curx];
98 	temp1 = &win->lines[win->cury]->line[win->maxx - 1];
99 	temp2 = temp1 - 1;
100 	while (temp1 > end) {
101 		(void) memcpy(temp1, temp2, sizeof(__LDATA));
102 		temp1--, temp2--;
103 	}
104 	temp1->ch = (wchar_t) ch & __CHARTEXT;
105 	temp1->bch = win->bch;
106 	temp1->attr = (attr_t) ch & __ATTRIBUTES;
107 	temp1->battr = win->battr;
108 	__touchline(win, (int) win->cury, (int) win->curx, (int) win->maxx - 1);
109 	if (win->cury == LINES - 1 &&
110 	    (win->lines[LINES - 1]->line[COLS - 1].ch != ' ' ||
111 	        win->lines[LINES - 1]->line[COLS - 1].bch != ' ' ||
112 		win->lines[LINES - 1]->line[COLS - 1].attr != 0 ||
113 		win->lines[LINES - 1]->line[COLS - 1].battr != 0)) {
114 		if (win->flags & __SCROLLOK) {
115 			wrefresh(win);
116 			scroll(win);
117 			win->cury--;
118 		} else
119 			return (ERR);
120 	}
121 	return (OK);
122 }
123