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
38 static char sccsid[] = "@(#)wwwrite.c 8.1 (Berkeley) 6/6/93";
39 static char rcsid[] = "@(#)$FreeBSD$";
47 if (!w->ww_noupdate && w->ww_cur.r >= 0 && w->ww_cur.r < wwnrow && \
48 wwtouched[w->ww_cur.r]) \
49 wwupdate1(w->ww_cur.r, w->ww_cur.r + 1)
52 * To support control character expansion, we save the old
53 * p and q values in r and s, and point p at the beginning
54 * of the expanded string, and q at some safe place beyond it
55 * (p + 10). At strategic points in the loops, we check
56 * for (r && !*p) and restore the saved values back into
57 * p and q. Essentially, we implement a stack of depth 2,
58 * to avoid recursion, which might be a better idea.
61 register struct ww *w;
62 register unsigned char *p;
66 unsigned char *savep = p;
67 unsigned char *q = p + n;
72 s = 0; /* define it before possible use */
74 if (hascursor = w->ww_hascursor)
76 while (p < q && !w->ww_stopped && (!wwinterrupt() || w->ww_nointr)) {
83 if (w->ww_wstate == 0 &&
84 (isprt(*p) || w->ww_unctrl && isunctrl(*p))) {
86 register union ww_char *bp;
89 if (w->ww_insert) { /* this is very slow */
93 (w->ww_cur.c - w->ww_w.l & 7);
102 wwinschar(w, w->ww_cur.r, w->ww_cur.c,
107 bp = &w->ww_buf[w->ww_cur.r][w->ww_cur.c];
109 while (i < w->ww_w.r && p < q)
114 } else if (*p == '\t') {
115 register tmp = 8 - (i - w->ww_w.l & 7);
119 } else if (isprt(*p)) {
121 | w->ww_modes << WWC_MSHIFT;
123 } else if (w->ww_unctrl && isunctrl(*p)) {
130 col = MAX(w->ww_cur.c, w->ww_i.l);
131 col1 = MIN(i, w->ww_i.r);
133 if (w->ww_cur.r >= w->ww_i.t
134 && w->ww_cur.r < w->ww_i.b) {
135 register union ww_char *ns = wwns[w->ww_cur.r];
136 register char *smap = &wwsmap[w->ww_cur.r][col];
137 register char *win = w->ww_win[w->ww_cur.r];
140 bp = w->ww_buf[w->ww_cur.r];
141 for (i = col; i < col1; i++)
142 if (*smap++ == w->ww_index) {
144 ns[i].c_w = bp[i].c_w
145 ^ win[i] << WWC_MSHIFT;
148 wwtouched[w->ww_cur.r] |= WWU_TOUCHED;
151 if (w->ww_cur.c >= w->ww_w.r)
153 } else switch (w->ww_wstate) {
159 w->ww_cur.c = w->ww_w.l;
162 if (++w->ww_cur.r >= w->ww_w.b) {
163 w->ww_cur.r = w->ww_w.b - 1;
164 if (w->ww_w.b < w->ww_b.b) {
165 (void) wwscroll1(w, w->ww_i.t,
171 wwdelline(w, w->ww_b.t);
175 if (--w->ww_cur.c < w->ww_w.l) {
176 w->ww_cur.c = w->ww_w.r - 1;
181 w->ww_cur.c = w->ww_w.l;
200 if (--w->ww_cur.r < w->ww_w.t) {
201 w->ww_cur.r = w->ww_w.t;
202 if (w->ww_w.t > w->ww_b.t) {
203 (void) wwscroll1(w, w->ww_i.t,
209 wwinsline(w, w->ww_b.t);
219 w->ww_buf -= w->ww_w.t - w->ww_b.t;
220 w->ww_b.t = w->ww_w.t;
221 w->ww_b.b = w->ww_b.t + w->ww_b.nr;
222 w->ww_cur.r = w->ww_w.t;
223 w->ww_cur.c = w->ww_w.l;
224 wwclreos(w, w->ww_w.t, w->ww_w.l);
228 w->ww_cur.r = w->ww_w.t;
229 w->ww_cur.c = w->ww_w.l;
232 wwclreos(w, w->ww_cur.r, w->ww_cur.c);
235 wwclreol(w, w->ww_cur.r, w->ww_cur.c);
239 wwinsline(w, w->ww_cur.r);
242 wwdelline(w, w->ww_cur.r);
245 wwdelchar(w, w->ww_cur.r, w->ww_cur.c);
251 wwinschar(w, w->ww_cur.r, w->ww_cur.c, ' ', 0);
273 w->ww_cur.r = w->ww_w.t +
274 (unsigned)(*p++ - ' ') % w->ww_w.nr;
278 w->ww_cur.c = w->ww_w.l +
279 (unsigned)(*p++ - ' ') % w->ww_w.nc;
283 w->ww_modes |= *p++ & wwavailmodes;
287 w->ww_modes &= ~*p++;