| Commit | Line | Data |
|---|---|---|
| 2c872e05 | 1 | /* @(#)wwwrite.c 8.1 (Berkeley) 6/6/93 */ |
| abecab39 SW |
2 | /* $NetBSD: wwwrite.c,v 1.9 2009/04/14 08:50:06 lukem Exp $ */ |
| 3 | ||
| 984263bc MD |
4 | /* |
| 5 | * Copyright (c) 1983, 1993 | |
| 6 | * The Regents of the University of California. All rights reserved. | |
| 7 | * | |
| 8 | * This code is derived from software contributed to Berkeley by | |
| 9 | * Edward Wang at The University of California, Berkeley. | |
| 10 | * | |
| 11 | * Redistribution and use in source and binary forms, with or without | |
| 12 | * modification, are permitted provided that the following conditions | |
| 13 | * are met: | |
| 14 | * 1. Redistributions of source code must retain the above copyright | |
| 15 | * notice, this list of conditions and the following disclaimer. | |
| 16 | * 2. Redistributions in binary form must reproduce the above copyright | |
| 17 | * notice, this list of conditions and the following disclaimer in the | |
| 18 | * documentation and/or other materials provided with the distribution. | |
| abecab39 | 19 | * 3. Neither the name of the University nor the names of its contributors |
| 984263bc MD |
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 | ||
| 984263bc MD |
36 | #include "ww.h" |
| 37 | #include "tt.h" | |
| abecab39 | 38 | #include "xx.h" |
| 984263bc MD |
39 | #include "char.h" |
| 40 | ||
| 41 | #define UPDATE() \ | |
| abecab39 SW |
42 | if (!ISSET(w->ww_wflags, WWW_NOUPDATE) && w->ww_cur.r >= 0 && \ |
| 43 | w->ww_cur.r < wwnrow && wwtouched[w->ww_cur.r]) \ | |
| 984263bc MD |
44 | wwupdate1(w->ww_cur.r, w->ww_cur.r + 1) |
| 45 | ||
| 46 | /* | |
| 47 | * To support control character expansion, we save the old | |
| 48 | * p and q values in r and s, and point p at the beginning | |
| 49 | * of the expanded string, and q at some safe place beyond it | |
| 50 | * (p + 10). At strategic points in the loops, we check | |
| 51 | * for (r && !*p) and restore the saved values back into | |
| 52 | * p and q. Essentially, we implement a stack of depth 2, | |
| 53 | * to avoid recursion, which might be a better idea. | |
| 54 | */ | |
| abecab39 SW |
55 | int |
| 56 | wwwrite(struct ww *w, const char *p, int n) | |
| 984263bc | 57 | { |
| abecab39 SW |
58 | int hascursor; |
| 59 | const char *savep = p; | |
| 60 | const char *q = p + n; | |
| 61 | const char *r = 0; | |
| 62 | const char *s = 0; | |
| 984263bc MD |
63 | |
| 64 | #ifdef lint | |
| 65 | s = 0; /* define it before possible use */ | |
| 66 | #endif | |
| abecab39 SW |
67 | hascursor = ISSET(w->ww_wflags, WWW_HASCURSOR); |
| 68 | if (hascursor) | |
| 984263bc | 69 | wwcursor(w, 0); |
| abecab39 SW |
70 | while (p < q && !ISSET(w->ww_pflags, WWP_STOPPED) && |
| 71 | (!wwinterrupt() || ISSET(w->ww_wflags, WWW_NOINTR))) { | |
| 984263bc MD |
72 | if (r && !*p) { |
| 73 | p = r; | |
| 74 | q = s; | |
| 75 | r = 0; | |
| 76 | continue; | |
| 77 | } | |
| 78 | if (w->ww_wstate == 0 && | |
| abecab39 SW |
79 | (isprt(*p) || |
| 80 | (ISSET(w->ww_wflags, WWW_UNCTRL) && isunctrl(*p)))) { | |
| 81 | int i; | |
| 82 | union ww_char *bp; | |
| 984263bc MD |
83 | int col, col1; |
| 84 | ||
| abecab39 SW |
85 | if (ISSET(w->ww_wflags, WWW_INSERT)) { |
| 86 | /* this is very slow */ | |
| 984263bc MD |
87 | if (*p == '\t') { |
| 88 | p++; | |
| 89 | w->ww_cur.c += 8 - | |
| abecab39 | 90 | ((w->ww_cur.c - w->ww_w.l) & 7); |
| 984263bc MD |
91 | goto chklf; |
| 92 | } | |
| 93 | if (!isprt(*p)) { | |
| 94 | r = p + 1; | |
| 95 | s = q; | |
| 96 | p = unctrl(*p); | |
| 97 | q = p + 10; | |
| 98 | } | |
| 99 | wwinschar(w, w->ww_cur.r, w->ww_cur.c, | |
| 100 | *p++, w->ww_modes); | |
| 101 | goto right; | |
| 102 | } | |
| 103 | ||
| 104 | bp = &w->ww_buf[w->ww_cur.r][w->ww_cur.c]; | |
| 105 | i = w->ww_cur.c; | |
| 106 | while (i < w->ww_w.r && p < q) | |
| 107 | if (!*p && r) { | |
| 108 | p = r; | |
| 109 | q = s; | |
| 110 | r = 0; | |
| 111 | } else if (*p == '\t') { | |
| abecab39 | 112 | int tmp = 8 - ((i - w->ww_w.l) & 7); |
| 984263bc MD |
113 | p++; |
| 114 | i += tmp; | |
| 115 | bp += tmp; | |
| 116 | } else if (isprt(*p)) { | |
| 117 | bp++->c_w = *p++ | |
| 118 | | w->ww_modes << WWC_MSHIFT; | |
| 119 | i++; | |
| abecab39 SW |
120 | } else if (ISSET(w->ww_wflags, WWW_UNCTRL) && |
| 121 | isunctrl(*p)) { | |
| 984263bc MD |
122 | r = p + 1; |
| 123 | s = q; | |
| 124 | p = unctrl(*p); | |
| 125 | q = p + 10; | |
| 126 | } else | |
| 127 | break; | |
| 128 | col = MAX(w->ww_cur.c, w->ww_i.l); | |
| 129 | col1 = MIN(i, w->ww_i.r); | |
| 130 | w->ww_cur.c = i; | |
| 131 | if (w->ww_cur.r >= w->ww_i.t | |
| 132 | && w->ww_cur.r < w->ww_i.b) { | |
| abecab39 SW |
133 | union ww_char *ns = wwns[w->ww_cur.r]; |
| 134 | unsigned char *smap = | |
| 135 | &wwsmap[w->ww_cur.r][col]; | |
| 136 | char *win = w->ww_win[w->ww_cur.r]; | |
| 984263bc MD |
137 | int nchanged = 0; |
| 138 | ||
| 139 | bp = w->ww_buf[w->ww_cur.r]; | |
| 140 | for (i = col; i < col1; i++) | |
| 141 | if (*smap++ == w->ww_index) { | |
| 142 | nchanged++; | |
| 143 | ns[i].c_w = bp[i].c_w | |
| 144 | ^ win[i] << WWC_MSHIFT; | |
| 145 | } | |
| 146 | if (nchanged > 0) | |
| 147 | wwtouched[w->ww_cur.r] |= WWU_TOUCHED; | |
| 148 | } | |
| 149 | chklf: | |
| 150 | if (w->ww_cur.c >= w->ww_w.r) | |
| 151 | goto crlf; | |
| 152 | } else switch (w->ww_wstate) { | |
| 153 | case 0: | |
| 154 | switch (*p++) { | |
| 155 | case '\n': | |
| abecab39 | 156 | if (ISSET(w->ww_wflags, WWW_MAPNL)) |
| 984263bc MD |
157 | crlf: |
| 158 | w->ww_cur.c = w->ww_w.l; | |
| 159 | lf: | |
| 160 | UPDATE(); | |
| 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, | |
| 165 | w->ww_i.b, 1, 0); | |
| 166 | w->ww_buf++; | |
| 167 | w->ww_b.t--; | |
| 168 | w->ww_b.b--; | |
| 169 | } else | |
| 170 | wwdelline(w, w->ww_b.t); | |
| 171 | } | |
| 172 | break; | |
| 173 | case '\b': | |
| 174 | if (--w->ww_cur.c < w->ww_w.l) { | |
| 175 | w->ww_cur.c = w->ww_w.r - 1; | |
| 176 | goto up; | |
| 177 | } | |
| 178 | break; | |
| 179 | case '\r': | |
| 180 | w->ww_cur.c = w->ww_w.l; | |
| 181 | break; | |
| 182 | case ctrl('g'): | |
| 183 | ttputc(ctrl('g')); | |
| 184 | break; | |
| 185 | case ctrl('['): | |
| 186 | w->ww_wstate = 1; | |
| 187 | break; | |
| 188 | } | |
| 189 | break; | |
| 190 | case 1: | |
| 191 | w->ww_wstate = 0; | |
| 192 | switch (*p++) { | |
| 193 | case '@': | |
| abecab39 | 194 | SET(w->ww_wflags, WWW_INSERT); |
| 984263bc MD |
195 | break; |
| 196 | case 'A': | |
| 197 | up: | |
| 198 | UPDATE(); | |
| 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, | |
| 203 | w->ww_i.b, -1, 0); | |
| 204 | w->ww_buf--; | |
| 205 | w->ww_b.t++; | |
| 206 | w->ww_b.b++; | |
| 207 | } else | |
| 208 | wwinsline(w, w->ww_b.t); | |
| 209 | } | |
| 210 | break; | |
| 211 | case 'B': | |
| 212 | goto lf; | |
| 213 | case 'C': | |
| 214 | right: | |
| 215 | w->ww_cur.c++; | |
| 216 | goto chklf; | |
| 217 | case 'E': | |
| 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); | |
| 224 | break; | |
| 225 | case 'H': | |
| 226 | UPDATE(); | |
| 227 | w->ww_cur.r = w->ww_w.t; | |
| 228 | w->ww_cur.c = w->ww_w.l; | |
| 229 | break; | |
| 230 | case 'J': | |
| 231 | wwclreos(w, w->ww_cur.r, w->ww_cur.c); | |
| 232 | break; | |
| 233 | case 'K': | |
| 234 | wwclreol(w, w->ww_cur.r, w->ww_cur.c); | |
| 235 | break; | |
| 236 | case 'L': | |
| 237 | UPDATE(); | |
| 238 | wwinsline(w, w->ww_cur.r); | |
| 239 | break; | |
| 240 | case 'M': | |
| 241 | wwdelline(w, w->ww_cur.r); | |
| 242 | break; | |
| 243 | case 'N': | |
| 244 | wwdelchar(w, w->ww_cur.r, w->ww_cur.c); | |
| 245 | break; | |
| 246 | case 'O': | |
| abecab39 | 247 | CLR(w->ww_wflags, WWW_INSERT); |
| 984263bc MD |
248 | break; |
| 249 | case 'P': | |
| 250 | wwinschar(w, w->ww_cur.r, w->ww_cur.c, ' ', 0); | |
| 251 | break; | |
| 252 | case 'X': | |
| 253 | wwupdate(); | |
| 254 | break; | |
| 255 | case 'Y': | |
| 256 | UPDATE(); | |
| 257 | w->ww_wstate = 2; | |
| 258 | break; | |
| 259 | case 'Z': | |
| 260 | wwupdate(); | |
| 261 | xxflush(0); | |
| 262 | break; | |
| 263 | case 's': | |
| 264 | w->ww_wstate = 4; | |
| 265 | break; | |
| 266 | case 'r': | |
| 267 | w->ww_wstate = 5; | |
| 268 | break; | |
| 269 | } | |
| 270 | break; | |
| 271 | case 2: | |
| 272 | w->ww_cur.r = w->ww_w.t + | |
| 273 | (unsigned)(*p++ - ' ') % w->ww_w.nr; | |
| 274 | w->ww_wstate = 3; | |
| 275 | break; | |
| 276 | case 3: | |
| 277 | w->ww_cur.c = w->ww_w.l + | |
| 278 | (unsigned)(*p++ - ' ') % w->ww_w.nc; | |
| 279 | w->ww_wstate = 0; | |
| 280 | break; | |
| 281 | case 4: | |
| 282 | w->ww_modes |= *p++ & wwavailmodes; | |
| 283 | w->ww_wstate = 0; | |
| 284 | break; | |
| 285 | case 5: | |
| 286 | w->ww_modes &= ~*p++; | |
| 287 | w->ww_wstate = 0; | |
| 288 | break; | |
| 289 | } | |
| 290 | } | |
| 291 | if (hascursor) | |
| 292 | wwcursor(w, 1); | |
| 293 | wwnwwr++; | |
| 294 | wwnwwra += n; | |
| 295 | n = p - savep; | |
| 296 | wwnwwrc += n; | |
| 297 | return n; | |
| 298 | } |