2 * Copyright (c) 1983, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Edward Wang at The University of California, Berkeley.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)wwwrite.c 8.1 (Berkeley) 6/6/93
37 * $FreeBSD: src/usr.bin/window/wwwrite.c,v 1.2.14.1 2001/05/17 09:45:02 obrien Exp $
38 * $DragonFly: src/usr.bin/window/wwwrite.c,v 1.2 2003/06/17 04:29:34 dillon Exp $
46 if (!w->ww_noupdate && w->ww_cur.r >= 0 && w->ww_cur.r < wwnrow && \
47 wwtouched[w->ww_cur.r]) \
48 wwupdate1(w->ww_cur.r, w->ww_cur.r + 1)
51 * To support control character expansion, we save the old
52 * p and q values in r and s, and point p at the beginning
53 * of the expanded string, and q at some safe place beyond it
54 * (p + 10). At strategic points in the loops, we check
55 * for (r && !*p) and restore the saved values back into
56 * p and q. Essentially, we implement a stack of depth 2,
57 * to avoid recursion, which might be a better idea.
60 register struct ww
*w
;
61 register unsigned char *p
;
65 unsigned char *savep
= p
;
66 unsigned char *q
= p
+ n
;
71 s
= 0; /* define it before possible use */
73 if (hascursor
= w
->ww_hascursor
)
75 while (p
< q
&& !w
->ww_stopped
&& (!wwinterrupt() || w
->ww_nointr
)) {
82 if (w
->ww_wstate
== 0 &&
83 (isprt(*p
) || w
->ww_unctrl
&& isunctrl(*p
))) {
85 register union ww_char
*bp
;
88 if (w
->ww_insert
) { /* this is very slow */
92 (w
->ww_cur
.c
- w
->ww_w
.l
& 7);
101 wwinschar(w
, w
->ww_cur
.r
, w
->ww_cur
.c
,
106 bp
= &w
->ww_buf
[w
->ww_cur
.r
][w
->ww_cur
.c
];
108 while (i
< w
->ww_w
.r
&& p
< q
)
113 } else if (*p
== '\t') {
114 register tmp
= 8 - (i
- w
->ww_w
.l
& 7);
118 } else if (isprt(*p
)) {
120 | w
->ww_modes
<< WWC_MSHIFT
;
122 } else if (w
->ww_unctrl
&& isunctrl(*p
)) {
129 col
= MAX(w
->ww_cur
.c
, w
->ww_i
.l
);
130 col1
= MIN(i
, w
->ww_i
.r
);
132 if (w
->ww_cur
.r
>= w
->ww_i
.t
133 && w
->ww_cur
.r
< w
->ww_i
.b
) {
134 register union ww_char
*ns
= wwns
[w
->ww_cur
.r
];
135 register char *smap
= &wwsmap
[w
->ww_cur
.r
][col
];
136 register char *win
= w
->ww_win
[w
->ww_cur
.r
];
139 bp
= w
->ww_buf
[w
->ww_cur
.r
];
140 for (i
= col
; i
< col1
; i
++)
141 if (*smap
++ == w
->ww_index
) {
143 ns
[i
].c_w
= bp
[i
].c_w
144 ^ win
[i
] << WWC_MSHIFT
;
147 wwtouched
[w
->ww_cur
.r
] |= WWU_TOUCHED
;
150 if (w
->ww_cur
.c
>= w
->ww_w
.r
)
152 } else switch (w
->ww_wstate
) {
158 w
->ww_cur
.c
= w
->ww_w
.l
;
161 if (++w
->ww_cur
.r
>= w
->ww_w
.b
) {
162 w
->ww_cur
.r
= w
->ww_w
.b
- 1;
163 if (w
->ww_w
.b
< w
->ww_b
.b
) {
164 (void) wwscroll1(w
, w
->ww_i
.t
,
170 wwdelline(w
, w
->ww_b
.t
);
174 if (--w
->ww_cur
.c
< w
->ww_w
.l
) {
175 w
->ww_cur
.c
= w
->ww_w
.r
- 1;
180 w
->ww_cur
.c
= w
->ww_w
.l
;
199 if (--w
->ww_cur
.r
< w
->ww_w
.t
) {
200 w
->ww_cur
.r
= w
->ww_w
.t
;
201 if (w
->ww_w
.t
> w
->ww_b
.t
) {
202 (void) wwscroll1(w
, w
->ww_i
.t
,
208 wwinsline(w
, w
->ww_b
.t
);
218 w
->ww_buf
-= w
->ww_w
.t
- w
->ww_b
.t
;
219 w
->ww_b
.t
= w
->ww_w
.t
;
220 w
->ww_b
.b
= w
->ww_b
.t
+ w
->ww_b
.nr
;
221 w
->ww_cur
.r
= w
->ww_w
.t
;
222 w
->ww_cur
.c
= w
->ww_w
.l
;
223 wwclreos(w
, w
->ww_w
.t
, w
->ww_w
.l
);
227 w
->ww_cur
.r
= w
->ww_w
.t
;
228 w
->ww_cur
.c
= w
->ww_w
.l
;
231 wwclreos(w
, w
->ww_cur
.r
, w
->ww_cur
.c
);
234 wwclreol(w
, w
->ww_cur
.r
, w
->ww_cur
.c
);
238 wwinsline(w
, w
->ww_cur
.r
);
241 wwdelline(w
, w
->ww_cur
.r
);
244 wwdelchar(w
, w
->ww_cur
.r
, w
->ww_cur
.c
);
250 wwinschar(w
, w
->ww_cur
.r
, w
->ww_cur
.c
, ' ', 0);
272 w
->ww_cur
.r
= w
->ww_w
.t
+
273 (unsigned)(*p
++ - ' ') % w
->ww_w
.nr
;
277 w
->ww_cur
.c
= w
->ww_w
.l
+
278 (unsigned)(*p
++ - ' ') % w
->ww_w
.nc
;
282 w
->ww_modes
|= *p
++ & wwavailmodes
;
286 w
->ww_modes
&= ~*p
++;