refresh.c revision 1.8 1 1.8 mikel /* $NetBSD: refresh.c,v 1.8 1997/07/22 07:36:59 mikel Exp $ */
2 1.8 mikel
3 1.1 cgd /*
4 1.7 cgd * Copyright (c) 1981, 1993, 1994
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.8 mikel #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.8 mikel #if 0
39 1.7 cgd static char sccsid[] = "@(#)refresh.c 8.7 (Berkeley) 8/13/94";
40 1.8 mikel #else
41 1.8 mikel __RCSID("$NetBSD: refresh.c,v 1.8 1997/07/22 07:36:59 mikel Exp $");
42 1.8 mikel #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.4 mycroft #include <string.h>
46 1.1 cgd
47 1.7 cgd #include "curses.h"
48 1.7 cgd
49 1.4 mycroft static int curwin;
50 1.4 mycroft static short ly, lx;
51 1.1 cgd
52 1.4 mycroft static void domvcur __P((int, int, int, int));
53 1.4 mycroft static int makech __P((WINDOW *, int));
54 1.7 cgd static void quickch __P((WINDOW *));
55 1.5 cgd static void scrolln __P((WINDOW *, int, int, int, int, int));
56 1.1 cgd
57 1.4 mycroft /*
58 1.4 mycroft * wrefresh --
59 1.4 mycroft * Make the current screen look like "win" over the area coverd by
60 1.4 mycroft * win.
61 1.4 mycroft */
62 1.4 mycroft int
63 1.1 cgd wrefresh(win)
64 1.4 mycroft register WINDOW *win;
65 1.1 cgd {
66 1.5 cgd register __LINE *wlp;
67 1.4 mycroft register int retval;
68 1.4 mycroft register short wy;
69 1.5 cgd int dnum;
70 1.7 cgd
71 1.4 mycroft /* Initialize loop parameters. */
72 1.5 cgd ly = curscr->cury;
73 1.5 cgd lx = curscr->curx;
74 1.1 cgd wy = 0;
75 1.1 cgd curwin = (win == curscr);
76 1.1 cgd
77 1.5 cgd if (!curwin)
78 1.5 cgd for (wy = 0; wy < win->maxy; wy++) {
79 1.5 cgd wlp = win->lines[wy];
80 1.5 cgd if (wlp->flags & __ISDIRTY)
81 1.7 cgd wlp->hash = __hash((char *)wlp->line,
82 1.7 cgd win->maxx * __LDATASIZE);
83 1.5 cgd }
84 1.5 cgd
85 1.5 cgd if (win->flags & __CLEAROK || curscr->flags & __CLEAROK || curwin) {
86 1.5 cgd if ((win->flags & __FULLWIN) || curscr->flags & __CLEAROK) {
87 1.4 mycroft tputs(CL, 0, __cputchar);
88 1.1 cgd ly = 0;
89 1.1 cgd lx = 0;
90 1.1 cgd if (!curwin) {
91 1.5 cgd curscr->flags &= ~__CLEAROK;
92 1.5 cgd curscr->cury = 0;
93 1.5 cgd curscr->curx = 0;
94 1.1 cgd werase(curscr);
95 1.1 cgd }
96 1.5 cgd __touchwin(win);
97 1.1 cgd }
98 1.5 cgd win->flags &= ~__CLEAROK;
99 1.1 cgd }
100 1.1 cgd if (!CA) {
101 1.5 cgd if (win->curx != 0)
102 1.4 mycroft putchar('\n');
103 1.1 cgd if (!curwin)
104 1.1 cgd werase(curscr);
105 1.1 cgd }
106 1.4 mycroft #ifdef DEBUG
107 1.5 cgd __CTRACE("wrefresh: (%0.2o): curwin = %d\n", win, curwin);
108 1.5 cgd __CTRACE("wrefresh: \tfirstch\tlastch\n");
109 1.5 cgd #endif
110 1.5 cgd
111 1.5 cgd #ifndef NOQCH
112 1.5 cgd if ((win->flags & __FULLWIN) && !curwin) {
113 1.5 cgd /*
114 1.5 cgd * Invoke quickch() only if more than a quarter of the lines
115 1.5 cgd * in the window are dirty.
116 1.5 cgd */
117 1.5 cgd for (wy = 0, dnum = 0; wy < win->maxy; wy++)
118 1.5 cgd if (win->lines[wy]->flags & (__ISDIRTY | __FORCEPAINT))
119 1.5 cgd dnum++;
120 1.5 cgd if (!__noqch && dnum > (int) win->maxy / 4)
121 1.5 cgd quickch(win);
122 1.5 cgd }
123 1.4 mycroft #endif
124 1.5 cgd
125 1.5 cgd #ifdef DEBUG
126 1.5 cgd { int i, j;
127 1.5 cgd __CTRACE("#####################################\n");
128 1.5 cgd for (i = 0; i < curscr->maxy; i++) {
129 1.5 cgd __CTRACE("C: %d:", i);
130 1.5 cgd __CTRACE(" 0x%x \n", curscr->lines[i]->hash);
131 1.7 cgd for (j = 0; j < curscr->maxx; j++)
132 1.7 cgd __CTRACE("%c",
133 1.5 cgd curscr->lines[i]->line[j].ch);
134 1.5 cgd __CTRACE("\n");
135 1.7 cgd for (j = 0; j < curscr->maxx; j++)
136 1.7 cgd __CTRACE("%x",
137 1.5 cgd curscr->lines[i]->line[j].attr);
138 1.5 cgd __CTRACE("\n");
139 1.5 cgd __CTRACE("W: %d:", i);
140 1.5 cgd __CTRACE(" 0x%x \n", win->lines[i]->hash);
141 1.5 cgd __CTRACE(" 0x%x ", win->lines[i]->flags);
142 1.7 cgd for (j = 0; j < win->maxx; j++)
143 1.7 cgd __CTRACE("%c",
144 1.5 cgd win->lines[i]->line[j].ch);
145 1.5 cgd __CTRACE("\n");
146 1.7 cgd for (j = 0; j < win->maxx; j++)
147 1.7 cgd __CTRACE("%x",
148 1.5 cgd win->lines[i]->line[j].attr);
149 1.5 cgd __CTRACE("\n");
150 1.5 cgd }
151 1.5 cgd }
152 1.5 cgd #endif /* DEBUG */
153 1.5 cgd
154 1.5 cgd for (wy = 0; wy < win->maxy; wy++) {
155 1.4 mycroft #ifdef DEBUG
156 1.5 cgd __CTRACE("%d\t%d\t%d\n",
157 1.5 cgd wy, *win->lines[wy]->firstchp, *win->lines[wy]->lastchp);
158 1.4 mycroft #endif
159 1.5 cgd if (!curwin)
160 1.5 cgd curscr->lines[wy]->hash = win->lines[wy]->hash;
161 1.5 cgd if (win->lines[wy]->flags & (__ISDIRTY | __FORCEPAINT)) {
162 1.1 cgd if (makech(win, wy) == ERR)
163 1.4 mycroft return (ERR);
164 1.1 cgd else {
165 1.5 cgd if (*win->lines[wy]->firstchp >= win->ch_off)
166 1.5 cgd *win->lines[wy]->firstchp = win->maxx +
167 1.5 cgd win->ch_off;
168 1.5 cgd if (*win->lines[wy]->lastchp < win->maxx +
169 1.5 cgd win->ch_off)
170 1.5 cgd *win->lines[wy]->lastchp = win->ch_off;
171 1.7 cgd if (*win->lines[wy]->lastchp <
172 1.5 cgd *win->lines[wy]->firstchp) {
173 1.5 cgd #ifdef DEBUG
174 1.5 cgd __CTRACE("wrefresh: line %d notdirty \n", wy);
175 1.5 cgd #endif
176 1.5 cgd win->lines[wy]->flags &= ~__ISDIRTY;
177 1.5 cgd }
178 1.1 cgd }
179 1.5 cgd
180 1.5 cgd }
181 1.4 mycroft #ifdef DEBUG
182 1.7 cgd __CTRACE("\t%d\t%d\n", *win->lines[wy]->firstchp,
183 1.5 cgd *win->lines[wy]->lastchp);
184 1.4 mycroft #endif
185 1.1 cgd }
186 1.7 cgd
187 1.5 cgd #ifdef DEBUG
188 1.5 cgd __CTRACE("refresh: ly=%d, lx=%d\n", ly, lx);
189 1.5 cgd #endif
190 1.1 cgd
191 1.1 cgd if (win == curscr)
192 1.5 cgd domvcur(ly, lx, win->cury, win->curx);
193 1.1 cgd else {
194 1.5 cgd if (win->flags & __LEAVEOK) {
195 1.5 cgd curscr->cury = ly;
196 1.5 cgd curscr->curx = lx;
197 1.5 cgd ly -= win->begy;
198 1.5 cgd lx -= win->begx;
199 1.5 cgd if (ly >= 0 && ly < win->maxy && lx >= 0 &&
200 1.5 cgd lx < win->maxx) {
201 1.5 cgd win->cury = ly;
202 1.5 cgd win->curx = lx;
203 1.4 mycroft } else
204 1.5 cgd win->cury = win->curx = 0;
205 1.4 mycroft } else {
206 1.5 cgd domvcur(ly, lx, win->cury + win->begy,
207 1.5 cgd win->curx + win->begx);
208 1.5 cgd curscr->cury = win->cury + win->begy;
209 1.5 cgd curscr->curx = win->curx + win->begx;
210 1.1 cgd }
211 1.1 cgd }
212 1.1 cgd retval = OK;
213 1.4 mycroft
214 1.4 mycroft (void)fflush(stdout);
215 1.4 mycroft return (retval);
216 1.1 cgd }
217 1.1 cgd
218 1.1 cgd /*
219 1.4 mycroft * makech --
220 1.4 mycroft * Make a change on the screen.
221 1.1 cgd */
222 1.4 mycroft static int
223 1.1 cgd makech(win, wy)
224 1.4 mycroft register WINDOW *win;
225 1.4 mycroft int wy;
226 1.1 cgd {
227 1.5 cgd static __LDATA blank = {' ', 0};
228 1.7 cgd __LDATA *nsp, *csp, *cp, *cep;
229 1.5 cgd u_int force;
230 1.7 cgd int clsp, nlsp; /* Last space in lines. */
231 1.7 cgd int lch, wx, y;
232 1.5 cgd char *ce;
233 1.5 cgd
234 1.8 mikel #ifdef __GNUC__
235 1.8 mikel nlsp = 0; /* XXX gcc -Wuninitialized */
236 1.8 mikel #endif
237 1.5 cgd /* Is the cursor still on the end of the last line? */
238 1.5 cgd if (wy > 0 && win->lines[wy - 1]->flags & __ISPASTEOL) {
239 1.5 cgd domvcur(ly, lx, ly + 1, 0);
240 1.5 cgd ly++;
241 1.5 cgd lx = 0;
242 1.5 cgd }
243 1.5 cgd wx = *win->lines[wy]->firstchp - win->ch_off;
244 1.5 cgd if (wx < 0)
245 1.5 cgd wx = 0;
246 1.5 cgd else if (wx >= win->maxx)
247 1.4 mycroft return (OK);
248 1.5 cgd lch = *win->lines[wy]->lastchp - win->ch_off;
249 1.1 cgd if (lch < 0)
250 1.4 mycroft return (OK);
251 1.5 cgd else if (lch >= (int) win->maxx)
252 1.5 cgd lch = win->maxx - 1;
253 1.5 cgd y = wy + win->begy;
254 1.1 cgd
255 1.1 cgd if (curwin)
256 1.5 cgd csp = ␣
257 1.1 cgd else
258 1.5 cgd csp = &curscr->lines[wy + win->begy]->line[wx + win->begx];
259 1.1 cgd
260 1.5 cgd nsp = &win->lines[wy]->line[wx];
261 1.5 cgd force = win->lines[wy]->flags & __FORCEPAINT;
262 1.5 cgd win->lines[wy]->flags &= ~__FORCEPAINT;
263 1.1 cgd if (CE && !curwin) {
264 1.7 cgd for (cp = &win->lines[wy]->line[win->maxx - 1];
265 1.5 cgd cp->ch == ' ' && cp->attr == 0; cp--)
266 1.5 cgd if (cp <= win->lines[wy]->line)
267 1.1 cgd break;
268 1.5 cgd nlsp = cp - win->lines[wy]->line;
269 1.1 cgd }
270 1.1 cgd if (!curwin)
271 1.4 mycroft ce = CE;
272 1.1 cgd else
273 1.4 mycroft ce = NULL;
274 1.1 cgd
275 1.5 cgd if (force) {
276 1.5 cgd if (CM)
277 1.5 cgd tputs(tgoto(CM, lx, ly), 0, __cputchar);
278 1.5 cgd else {
279 1.5 cgd tputs(HO, 0, __cputchar);
280 1.5 cgd __mvcur(0, 0, ly, lx, 1);
281 1.5 cgd }
282 1.5 cgd }
283 1.7 cgd
284 1.1 cgd while (wx <= lch) {
285 1.5 cgd if (!force && memcmp(nsp, csp, sizeof(__LDATA)) == 0) {
286 1.4 mycroft if (wx <= lch) {
287 1.5 cgd while (wx <= lch &&
288 1.7 cgd memcmp(nsp, csp, sizeof(__LDATA)) == 0) {
289 1.7 cgd nsp++;
290 1.7 cgd if (!curwin)
291 1.7 cgd ++csp;
292 1.7 cgd ++wx;
293 1.7 cgd }
294 1.4 mycroft continue;
295 1.4 mycroft }
296 1.4 mycroft break;
297 1.4 mycroft }
298 1.5 cgd domvcur(ly, lx, y, wx + win->begx);
299 1.5 cgd
300 1.4 mycroft #ifdef DEBUG
301 1.7 cgd __CTRACE("makech: 1: wx = %d, ly= %d, lx = %d, newy = %d, newx = %d, force =%d\n",
302 1.5 cgd wx, ly, lx, y, wx + win->begx, force);
303 1.4 mycroft #endif
304 1.4 mycroft ly = y;
305 1.5 cgd lx = wx + win->begx;
306 1.7 cgd while ((force || memcmp(nsp, csp, sizeof(__LDATA)) != 0)
307 1.5 cgd && wx <= lch) {
308 1.5 cgd
309 1.7 cgd if (ce != NULL &&
310 1.7 cgd win->maxx + win->begx == curscr->maxx &&
311 1.7 cgd wx >= nlsp && nsp->ch == ' ' && nsp->attr == 0) {
312 1.4 mycroft /* Check for clear to end-of-line. */
313 1.5 cgd cep = &curscr->lines[wy]->line[win->maxx - 1];
314 1.5 cgd while (cep->ch == ' ' && cep->attr == 0)
315 1.5 cgd if (cep-- <= csp)
316 1.4 mycroft break;
317 1.7 cgd clsp = cep - curscr->lines[wy]->line -
318 1.5 cgd win->begx * __LDATASIZE;
319 1.4 mycroft #ifdef DEBUG
320 1.5 cgd __CTRACE("makech: clsp = %d, nlsp = %d\n", clsp, nlsp);
321 1.4 mycroft #endif
322 1.7 cgd if ((clsp - nlsp >= strlen(CE)
323 1.5 cgd && clsp < win->maxx * __LDATASIZE) ||
324 1.5 cgd wy == win->maxy - 1) {
325 1.7 cgd if (curscr->flags & __WSTANDOUT) {
326 1.7 cgd tputs(SE, 0, __cputchar);
327 1.7 cgd curscr->flags &= ~__WSTANDOUT;
328 1.7 cgd }
329 1.4 mycroft tputs(CE, 0, __cputchar);
330 1.5 cgd lx = wx + win->begx;
331 1.5 cgd while (wx++ <= clsp) {
332 1.5 cgd csp->ch = ' ';
333 1.5 cgd csp->attr = 0;
334 1.5 cgd csp++;
335 1.5 cgd }
336 1.4 mycroft return (OK);
337 1.1 cgd }
338 1.4 mycroft ce = NULL;
339 1.4 mycroft }
340 1.4 mycroft
341 1.7 cgd /*
342 1.7 cgd * Enter/exit standout mode as appropriate.
343 1.7 cgd * XXX
344 1.7 cgd * Should use UC if SO/SE not available.
345 1.7 cgd */
346 1.7 cgd if (nsp->attr & __STANDOUT) {
347 1.7 cgd if (!(curscr->flags & __WSTANDOUT) &&
348 1.7 cgd SO != NULL && SE != NULL) {
349 1.4 mycroft tputs(SO, 0, __cputchar);
350 1.5 cgd curscr->flags |= __WSTANDOUT;
351 1.7 cgd }
352 1.7 cgd } else
353 1.7 cgd if (curscr->flags & __WSTANDOUT &&
354 1.7 cgd SE != NULL) {
355 1.4 mycroft tputs(SE, 0, __cputchar);
356 1.5 cgd curscr->flags &= ~__WSTANDOUT;
357 1.1 cgd }
358 1.4 mycroft
359 1.4 mycroft wx++;
360 1.5 cgd if (wx >= win->maxx && wy == win->maxy - 1 && !curwin)
361 1.5 cgd if (win->flags & __SCROLLOK) {
362 1.5 cgd if (curscr->flags & __WSTANDOUT
363 1.5 cgd && win->flags & __ENDLINE)
364 1.4 mycroft if (!MS) {
365 1.4 mycroft tputs(SE, 0,
366 1.4 mycroft __cputchar);
367 1.5 cgd curscr->flags &=
368 1.5 cgd ~__WSTANDOUT;
369 1.4 mycroft }
370 1.5 cgd if (!(win->flags & __SCROLLWIN)) {
371 1.5 cgd if (!curwin) {
372 1.5 cgd csp->attr = nsp->attr;
373 1.5 cgd putchar(csp->ch = nsp->ch);
374 1.5 cgd } else
375 1.5 cgd putchar(nsp->ch);
376 1.5 cgd }
377 1.5 cgd if (wx + win->begx < curscr->maxx) {
378 1.7 cgd domvcur(ly, wx + win->begx,
379 1.5 cgd win->begy + win->maxy - 1,
380 1.5 cgd win->begx + win->maxx - 1);
381 1.5 cgd }
382 1.5 cgd ly = win->begy + win->maxy - 1;
383 1.5 cgd lx = win->begx + win->maxx - 1;
384 1.4 mycroft return (OK);
385 1.7 cgd }
386 1.7 cgd if (wx < win->maxx || wy < win->maxy - 1 ||
387 1.5 cgd !(win->flags & __SCROLLWIN)) {
388 1.5 cgd if (!curwin) {
389 1.5 cgd csp->attr = nsp->attr;
390 1.5 cgd putchar(csp->ch = nsp->ch);
391 1.5 cgd csp++;
392 1.7 cgd } else
393 1.5 cgd putchar(nsp->ch);
394 1.5 cgd }
395 1.4 mycroft #ifdef DEBUG
396 1.5 cgd __CTRACE("makech: putchar(%c)\n", nsp->ch & 0177);
397 1.4 mycroft #endif
398 1.5 cgd if (UC && (nsp->attr & __STANDOUT)) {
399 1.4 mycroft putchar('\b');
400 1.4 mycroft tputs(UC, 0, __cputchar);
401 1.1 cgd }
402 1.4 mycroft nsp++;
403 1.4 mycroft #ifdef DEBUG
404 1.5 cgd __CTRACE("makech: 2: wx = %d, lx = %d\n", wx, lx);
405 1.4 mycroft #endif
406 1.5 cgd }
407 1.5 cgd if (lx == wx + win->begx) /* If no change. */
408 1.4 mycroft break;
409 1.5 cgd lx = wx + win->begx;
410 1.5 cgd if (lx >= COLS && AM)
411 1.5 cgd lx = COLS - 1;
412 1.5 cgd else if (wx >= win->maxx) {
413 1.5 cgd domvcur(ly, lx, ly, win->maxx + win->begx - 1);
414 1.5 cgd lx = win->maxx + win->begx - 1;
415 1.1 cgd }
416 1.5 cgd
417 1.4 mycroft #ifdef DEBUG
418 1.5 cgd __CTRACE("makech: 3: wx = %d, lx = %d\n", wx, lx);
419 1.4 mycroft #endif
420 1.1 cgd }
421 1.7 cgd
422 1.7 cgd /* Don't leave the screen in standout mode. */
423 1.7 cgd if (curscr->flags & __WSTANDOUT) {
424 1.7 cgd tputs(SE, 0, __cputchar);
425 1.7 cgd curscr->flags &= ~__WSTANDOUT;
426 1.7 cgd }
427 1.4 mycroft return (OK);
428 1.1 cgd }
429 1.1 cgd
430 1.1 cgd /*
431 1.4 mycroft * domvcur --
432 1.4 mycroft * Do a mvcur, leaving standout mode if necessary.
433 1.1 cgd */
434 1.4 mycroft static void
435 1.1 cgd domvcur(oy, ox, ny, nx)
436 1.4 mycroft int oy, ox, ny, nx;
437 1.4 mycroft {
438 1.5 cgd if (curscr->flags & __WSTANDOUT && !MS) {
439 1.4 mycroft tputs(SE, 0, __cputchar);
440 1.5 cgd curscr->flags &= ~__WSTANDOUT;
441 1.5 cgd }
442 1.5 cgd
443 1.5 cgd __mvcur(oy, ox, ny, nx, 1);
444 1.5 cgd }
445 1.5 cgd
446 1.5 cgd /*
447 1.5 cgd * Quickch() attempts to detect a pattern in the change of the window
448 1.7 cgd * in order to optimize the change, e.g., scroll n lines as opposed to
449 1.5 cgd * repainting the screen line by line.
450 1.5 cgd */
451 1.5 cgd
452 1.5 cgd static void
453 1.5 cgd quickch(win)
454 1.5 cgd WINDOW *win;
455 1.5 cgd {
456 1.5 cgd #define THRESH (int) win->maxy / 4
457 1.5 cgd
458 1.5 cgd register __LINE *clp, *tmp1, *tmp2;
459 1.5 cgd register int bsize, curs, curw, starts, startw, i, j;
460 1.5 cgd int n, target, cur_period, bot, top, sc_region;
461 1.5 cgd __LDATA buf[1024];
462 1.5 cgd u_int blank_hash;
463 1.5 cgd
464 1.8 mikel #ifdef __GNUC__
465 1.8 mikel curs = curw = starts = startw = 0; /* XXX gcc -Wuninitialized */
466 1.8 mikel #endif
467 1.7 cgd /*
468 1.5 cgd * Find how many lines from the top of the screen are unchanged.
469 1.5 cgd */
470 1.7 cgd for (top = 0; top < win->maxy; top++)
471 1.5 cgd if (win->lines[top]->flags & __FORCEPAINT ||
472 1.7 cgd win->lines[top]->hash != curscr->lines[top]->hash
473 1.7 cgd || memcmp(win->lines[top]->line,
474 1.7 cgd curscr->lines[top]->line,
475 1.5 cgd win->maxx * __LDATASIZE) != 0)
476 1.5 cgd break;
477 1.5 cgd else
478 1.5 cgd win->lines[top]->flags &= ~__ISDIRTY;
479 1.5 cgd /*
480 1.7 cgd * Find how many lines from bottom of screen are unchanged.
481 1.5 cgd */
482 1.5 cgd for (bot = win->maxy - 1; bot >= 0; bot--)
483 1.5 cgd if (win->lines[bot]->flags & __FORCEPAINT ||
484 1.7 cgd win->lines[bot]->hash != curscr->lines[bot]->hash
485 1.7 cgd || memcmp(win->lines[bot]->line,
486 1.7 cgd curscr->lines[bot]->line,
487 1.5 cgd win->maxx * __LDATASIZE) != 0)
488 1.5 cgd break;
489 1.5 cgd else
490 1.5 cgd win->lines[bot]->flags &= ~__ISDIRTY;
491 1.5 cgd
492 1.5 cgd #ifdef NO_JERKINESS
493 1.5 cgd /*
494 1.5 cgd * If we have a bottom unchanged region return. Scrolling the
495 1.5 cgd * bottom region up and then back down causes a screen jitter.
496 1.5 cgd * This will increase the number of characters sent to the screen
497 1.5 cgd * but it looks better.
498 1.5 cgd */
499 1.5 cgd if (bot < win->maxy - 1)
500 1.5 cgd return;
501 1.5 cgd #endif /* NO_JERKINESS */
502 1.5 cgd
503 1.5 cgd /*
504 1.5 cgd * Search for the largest block of text not changed.
505 1.5 cgd * Invariants of the loop:
506 1.5 cgd * - Startw is the index of the beginning of the examined block in win.
507 1.7 cgd * - Starts is the index of the beginning of the examined block in
508 1.5 cgd * curscr.
509 1.5 cgd * - Curs is the index of one past the end of the exmined block in win.
510 1.7 cgd * - Curw is the index of one past the end of the exmined block in
511 1.5 cgd * curscr.
512 1.5 cgd * - bsize is the current size of the examined block.
513 1.5 cgd */
514 1.5 cgd for (bsize = bot - top; bsize >= THRESH; bsize--) {
515 1.5 cgd for (startw = top; startw <= bot - bsize; startw++)
516 1.7 cgd for (starts = top; starts <= bot - bsize;
517 1.5 cgd starts++) {
518 1.5 cgd for (curw = startw, curs = starts;
519 1.5 cgd curs < starts + bsize; curw++, curs++)
520 1.5 cgd if (win->lines[curw]->flags &
521 1.5 cgd __FORCEPAINT ||
522 1.5 cgd (win->lines[curw]->hash !=
523 1.5 cgd curscr->lines[curs]->hash ||
524 1.7 cgd memcmp(win->lines[curw]->line,
525 1.7 cgd curscr->lines[curs]->line,
526 1.5 cgd win->maxx * __LDATASIZE) != 0))
527 1.5 cgd break;
528 1.5 cgd if (curs == starts + bsize)
529 1.5 cgd goto done;
530 1.5 cgd }
531 1.5 cgd }
532 1.5 cgd done:
533 1.5 cgd /* Did not find anything */
534 1.7 cgd if (bsize < THRESH)
535 1.5 cgd return;
536 1.5 cgd
537 1.5 cgd #ifdef DEBUG
538 1.7 cgd __CTRACE("quickch:bsize=%d,starts=%d,startw=%d,curw=%d,curs=%d,top=%d,bot=%d\n",
539 1.5 cgd bsize, starts, startw, curw, curs, top, bot);
540 1.5 cgd #endif
541 1.5 cgd
542 1.7 cgd /*
543 1.7 cgd * Make sure that there is no overlap between the bottom and top
544 1.5 cgd * regions and the middle scrolled block.
545 1.5 cgd */
546 1.5 cgd if (bot < curs)
547 1.5 cgd bot = curs - 1;
548 1.5 cgd if (top > starts)
549 1.5 cgd top = starts;
550 1.5 cgd
551 1.5 cgd n = startw - starts;
552 1.5 cgd
553 1.5 cgd #ifdef DEBUG
554 1.5 cgd __CTRACE("#####################################\n");
555 1.5 cgd for (i = 0; i < curscr->maxy; i++) {
556 1.5 cgd __CTRACE("C: %d:", i);
557 1.5 cgd __CTRACE(" 0x%x \n", curscr->lines[i]->hash);
558 1.7 cgd for (j = 0; j < curscr->maxx; j++)
559 1.7 cgd __CTRACE("%c",
560 1.5 cgd curscr->lines[i]->line[j].ch);
561 1.5 cgd __CTRACE("\n");
562 1.7 cgd for (j = 0; j < curscr->maxx; j++)
563 1.7 cgd __CTRACE("%x",
564 1.5 cgd curscr->lines[i]->line[j].attr);
565 1.5 cgd __CTRACE("\n");
566 1.5 cgd __CTRACE("W: %d:", i);
567 1.5 cgd __CTRACE(" 0x%x \n", win->lines[i]->hash);
568 1.5 cgd __CTRACE(" 0x%x ", win->lines[i]->flags);
569 1.7 cgd for (j = 0; j < win->maxx; j++)
570 1.7 cgd __CTRACE("%c",
571 1.5 cgd win->lines[i]->line[j].ch);
572 1.5 cgd __CTRACE("\n");
573 1.7 cgd for (j = 0; j < win->maxx; j++)
574 1.7 cgd __CTRACE("%x",
575 1.5 cgd win->lines[i]->line[j].attr);
576 1.5 cgd __CTRACE("\n");
577 1.5 cgd }
578 1.7 cgd #endif
579 1.7 cgd
580 1.5 cgd /* So we don't have to call __hash() each time */
581 1.5 cgd for (i = 0; i < win->maxx; i++) {
582 1.5 cgd buf[i].ch = ' ';
583 1.5 cgd buf[i].attr = 0;
584 1.5 cgd }
585 1.5 cgd blank_hash = __hash((char *) buf, win->maxx * __LDATASIZE);
586 1.5 cgd
587 1.5 cgd /*
588 1.5 cgd * Perform the rotation to maintain the consistency of curscr.
589 1.5 cgd * This is hairy since we are doing an *in place* rotation.
590 1.5 cgd * Invariants of the loop:
591 1.5 cgd * - I is the index of the current line.
592 1.5 cgd * - Target is the index of the target of line i.
593 1.5 cgd * - Tmp1 points to current line (i).
594 1.5 cgd * - Tmp2 and points to target line (target);
595 1.7 cgd * - Cur_period is the index of the end of the current period.
596 1.5 cgd * (see below).
597 1.5 cgd *
598 1.5 cgd * There are 2 major issues here that make this rotation non-trivial:
599 1.5 cgd * 1. Scrolling in a scrolling region bounded by the top
600 1.5 cgd * and bottom regions determined (whose size is sc_region).
601 1.7 cgd * 2. As a result of the use of the mod function, there may be a
602 1.5 cgd * period introduced, i.e., 2 maps to 4, 4 to 6, n-2 to 0, and
603 1.5 cgd * 0 to 2, which then causes all odd lines not to be rotated.
604 1.7 cgd * To remedy this, an index of the end ( = beginning) of the
605 1.7 cgd * current 'period' is kept, cur_period, and when it is reached,
606 1.7 cgd * the next period is started from cur_period + 1 which is
607 1.5 cgd * guaranteed not to have been reached since that would mean that
608 1.5 cgd * all records would have been reached. (think about it...).
609 1.7 cgd *
610 1.5 cgd * Lines in the rotation can have 3 attributes which are marked on the
611 1.5 cgd * line so that curscr is consistent with the visual screen.
612 1.5 cgd * 1. Not dirty -- lines inside the scrolled block, top region or
613 1.5 cgd * bottom region.
614 1.7 cgd * 2. Blank lines -- lines in the differential of the scrolling
615 1.7 cgd * region adjacent to top and bot regions
616 1.5 cgd * depending on scrolling direction.
617 1.5 cgd * 3. Dirty line -- all other lines are marked dirty.
618 1.5 cgd */
619 1.5 cgd sc_region = bot - top + 1;
620 1.5 cgd i = top;
621 1.5 cgd tmp1 = curscr->lines[top];
622 1.5 cgd cur_period = top;
623 1.5 cgd for (j = top; j <= bot; j++) {
624 1.5 cgd target = (i - top + n + sc_region) % sc_region + top;
625 1.5 cgd tmp2 = curscr->lines[target];
626 1.5 cgd curscr->lines[target] = tmp1;
627 1.5 cgd /* Mark block as clean and blank out scrolled lines. */
628 1.5 cgd clp = curscr->lines[target];
629 1.5 cgd #ifdef DEBUG
630 1.5 cgd __CTRACE("quickch: n=%d startw=%d curw=%d i = %d target=%d ",
631 1.5 cgd n, startw, curw, i, target);
632 1.5 cgd #endif
633 1.7 cgd if ((target >= startw && target < curw) || target < top
634 1.5 cgd || target > bot) {
635 1.5 cgd #ifdef DEBUG
636 1.5 cgd __CTRACE("-- notdirty");
637 1.5 cgd #endif
638 1.5 cgd win->lines[target]->flags &= ~__ISDIRTY;
639 1.5 cgd } else if ((n > 0 && target >= top && target < top + n) ||
640 1.5 cgd (n < 0 && target <= bot && target > bot + n)) {
641 1.7 cgd if (clp->hash != blank_hash || memcmp(clp->line,
642 1.5 cgd buf, win->maxx * __LDATASIZE) !=0) {
643 1.5 cgd (void)memcpy(clp->line, buf,
644 1.5 cgd win->maxx * __LDATASIZE);
645 1.5 cgd #ifdef DEBUG
646 1.5 cgd __CTRACE("-- blanked out: dirty");
647 1.5 cgd #endif
648 1.5 cgd clp->hash = blank_hash;
649 1.5 cgd __touchline(win, target, 0, win->maxx - 1, 0);
650 1.5 cgd } else {
651 1.5 cgd __touchline(win, target, 0, win->maxx - 1, 0);
652 1.5 cgd #ifdef DEBUG
653 1.5 cgd __CTRACE(" -- blank line already: dirty");
654 1.5 cgd #endif
655 1.5 cgd }
656 1.5 cgd } else {
657 1.5 cgd #ifdef DEBUG
658 1.5 cgd __CTRACE(" -- dirty");
659 1.5 cgd #endif
660 1.5 cgd __touchline(win, target, 0, win->maxx - 1, 0);
661 1.5 cgd }
662 1.5 cgd #ifdef DEBUG
663 1.5 cgd __CTRACE("\n");
664 1.5 cgd #endif
665 1.5 cgd if (target == cur_period) {
666 1.5 cgd i = target + 1;
667 1.5 cgd tmp1 = curscr->lines[i];
668 1.5 cgd cur_period = i;
669 1.5 cgd } else {
670 1.5 cgd tmp1 = tmp2;
671 1.5 cgd i = target;
672 1.5 cgd }
673 1.5 cgd }
674 1.5 cgd #ifdef DEBUG
675 1.5 cgd __CTRACE("$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\n");
676 1.5 cgd for (i = 0; i < curscr->maxy; i++) {
677 1.5 cgd __CTRACE("C: %d:", i);
678 1.7 cgd for (j = 0; j < curscr->maxx; j++)
679 1.7 cgd __CTRACE("%c",
680 1.5 cgd curscr->lines[i]->line[j].ch);
681 1.5 cgd __CTRACE("\n");
682 1.5 cgd __CTRACE("W: %d:", i);
683 1.7 cgd for (j = 0; j < win->maxx; j++)
684 1.7 cgd __CTRACE("%c", win->lines[i]->line[j].ch);
685 1.5 cgd __CTRACE("\n");
686 1.5 cgd }
687 1.5 cgd #endif
688 1.5 cgd if (n != 0) {
689 1.5 cgd WINDOW *wp;
690 1.5 cgd scrolln(win, starts, startw, curs, bot, top);
691 1.5 cgd /*
692 1.5 cgd * Need to repoint any subwindow lines to the rotated
693 1.7 cgd * line structured.
694 1.5 cgd */
695 1.5 cgd for (wp = win->nextp; wp != win; wp = wp->nextp)
696 1.5 cgd __set_subwin(win, wp);
697 1.1 cgd }
698 1.5 cgd }
699 1.5 cgd
700 1.5 cgd /*
701 1.7 cgd * scrolln --
702 1.7 cgd * Scroll n lines, where n is starts - startw.
703 1.5 cgd */
704 1.5 cgd static void
705 1.5 cgd scrolln(win, starts, startw, curs, bot, top)
706 1.5 cgd WINDOW *win;
707 1.5 cgd int starts, startw, curs, bot, top;
708 1.5 cgd {
709 1.5 cgd int i, oy, ox, n;
710 1.5 cgd
711 1.5 cgd oy = curscr->cury;
712 1.5 cgd ox = curscr->curx;
713 1.5 cgd n = starts - startw;
714 1.5 cgd
715 1.7 cgd /*
716 1.7 cgd * XXX
717 1.7 cgd * The initial tests that set __noqch don't let us reach here unless
718 1.7 cgd * we have either CS + HO + SF/sf/SR/sr, or AL + DL. SF/sf and SR/sr
719 1.7 cgd * scrolling can only shift the entire scrolling region, not just a
720 1.7 cgd * part of it, which means that the quickch() routine is going to be
721 1.7 cgd * sadly disappointed in us if we don't have CS as well.
722 1.7 cgd *
723 1.7 cgd * If CS, HO and SF/sf are set, can use the scrolling region. Because
724 1.7 cgd * the cursor position after CS is undefined, we need HO which gives us
725 1.7 cgd * the ability to move to somewhere without knowledge of the current
726 1.7 cgd * location of the cursor. Still call __mvcur() anyway, to update its
727 1.7 cgd * idea of where the cursor is.
728 1.7 cgd *
729 1.7 cgd * When the scrolling region has been set, the cursor has to be at the
730 1.7 cgd * last line of the region to make the scroll happen.
731 1.7 cgd *
732 1.7 cgd * Doing SF/SR or AL/DL appears faster on the screen than either sf/sr
733 1.7 cgd * or al/dl, and, some terminals have AL/DL, sf/sr, and CS, but not
734 1.7 cgd * SF/SR. So, if we're scrolling almost all of the screen, try and use
735 1.7 cgd * AL/DL, otherwise use the scrolling region. The "almost all" is a
736 1.7 cgd * shameless hack for vi.
737 1.7 cgd */
738 1.5 cgd if (n > 0) {
739 1.7 cgd if (CS != NULL && HO != NULL && (SF != NULL ||
740 1.8 mikel ((AL == NULL || DL == NULL ||
741 1.8 mikel top > 3 || bot + 3 < win->maxy) && sf != NULL))) {
742 1.7 cgd tputs(__tscroll(CS, top, bot + 1), 0, __cputchar);
743 1.7 cgd __mvcur(oy, ox, 0, 0, 1);
744 1.7 cgd tputs(HO, 0, __cputchar);
745 1.7 cgd __mvcur(0, 0, bot, 0, 1);
746 1.7 cgd if (SF != NULL)
747 1.7 cgd tputs(__tscroll(SF, n, 0), 0, __cputchar);
748 1.7 cgd else
749 1.7 cgd for (i = 0; i < n; i++)
750 1.7 cgd tputs(sf, 0, __cputchar);
751 1.7 cgd tputs(__tscroll(CS, 0, win->maxy), 0, __cputchar);
752 1.7 cgd __mvcur(bot, 0, 0, 0, 1);
753 1.7 cgd tputs(HO, 0, __cputchar);
754 1.7 cgd __mvcur(0, 0, oy, ox, 1);
755 1.7 cgd return;
756 1.7 cgd }
757 1.7 cgd
758 1.7 cgd /* Scroll up the block. */
759 1.7 cgd if (SF != NULL && top == 0) {
760 1.7 cgd __mvcur(oy, ox, bot, 0, 1);
761 1.7 cgd tputs(__tscroll(SF, n, 0), 0, __cputchar);
762 1.7 cgd } else if (DL != NULL) {
763 1.7 cgd __mvcur(oy, ox, top, 0, 1);
764 1.7 cgd tputs(__tscroll(DL, n, 0), 0, __cputchar);
765 1.7 cgd } else if (dl != NULL) {
766 1.7 cgd __mvcur(oy, ox, top, 0, 1);
767 1.7 cgd for (i = 0; i < n; i++)
768 1.5 cgd tputs(dl, 0, __cputchar);
769 1.7 cgd } else if (sf != NULL && top == 0) {
770 1.7 cgd __mvcur(oy, ox, bot, 0, 1);
771 1.7 cgd for (i = 0; i < n; i++)
772 1.7 cgd tputs(sf, 0, __cputchar);
773 1.7 cgd } else
774 1.7 cgd abort();
775 1.5 cgd
776 1.7 cgd /* Push down the bottom region. */
777 1.5 cgd __mvcur(top, 0, bot - n + 1, 0, 1);
778 1.7 cgd if (AL != NULL)
779 1.7 cgd tputs(__tscroll(AL, n, 0), 0, __cputchar);
780 1.7 cgd else if (al != NULL)
781 1.7 cgd for (i = 0; i < n; i++)
782 1.7 cgd tputs(al, 0, __cputchar);
783 1.5 cgd else
784 1.7 cgd abort();
785 1.5 cgd __mvcur(bot - n + 1, 0, oy, ox, 1);
786 1.5 cgd } else {
787 1.7 cgd /*
788 1.7 cgd * !!!
789 1.7 cgd * n < 0
790 1.7 cgd *
791 1.7 cgd * If CS, HO and SR/sr are set, can use the scrolling region.
792 1.7 cgd * See the above comments for details.
793 1.7 cgd */
794 1.7 cgd if (CS != NULL && HO != NULL && (SR != NULL ||
795 1.8 mikel ((AL == NULL || DL == NULL ||
796 1.8 mikel top > 3 || bot + 3 < win->maxy) && sr != NULL))) {
797 1.7 cgd tputs(__tscroll(CS, top, bot + 1), 0, __cputchar);
798 1.7 cgd __mvcur(oy, ox, 0, 0, 1);
799 1.7 cgd tputs(HO, 0, __cputchar);
800 1.7 cgd __mvcur(0, 0, top, 0, 1);
801 1.7 cgd
802 1.7 cgd if (SR != NULL)
803 1.7 cgd tputs(__tscroll(SR, -n, 0), 0, __cputchar);
804 1.7 cgd else
805 1.7 cgd for (i = n; i < 0; i++)
806 1.7 cgd tputs(sr, 0, __cputchar);
807 1.7 cgd tputs(__tscroll(CS, 0, win->maxy), 0, __cputchar);
808 1.7 cgd __mvcur(top, 0, 0, 0, 1);
809 1.7 cgd tputs(HO, 0, __cputchar);
810 1.7 cgd __mvcur(0, 0, oy, ox, 1);
811 1.7 cgd return;
812 1.7 cgd }
813 1.7 cgd
814 1.7 cgd /* Preserve the bottom lines. */
815 1.7 cgd __mvcur(oy, ox, bot + n + 1, 0, 1);
816 1.7 cgd if (SR != NULL && bot == win->maxy)
817 1.7 cgd tputs(__tscroll(SR, -n, 0), 0, __cputchar);
818 1.7 cgd else if (DL != NULL)
819 1.7 cgd tputs(__tscroll(DL, -n, 0), 0, __cputchar);
820 1.7 cgd else if (dl != NULL)
821 1.7 cgd for (i = n; i < 0; i++)
822 1.7 cgd tputs(dl, 0, __cputchar);
823 1.7 cgd else if (sr != NULL && bot == win->maxy)
824 1.7 cgd for (i = n; i < 0; i++)
825 1.7 cgd tputs(sr, 0, __cputchar);
826 1.5 cgd else
827 1.7 cgd abort();
828 1.7 cgd
829 1.7 cgd /* Scroll the block down. */
830 1.5 cgd __mvcur(bot + n + 1, 0, top, 0, 1);
831 1.7 cgd if (AL != NULL)
832 1.7 cgd tputs(__tscroll(AL, -n, 0), 0, __cputchar);
833 1.7 cgd else if (al != NULL)
834 1.7 cgd for (i = n; i < 0; i++)
835 1.7 cgd tputs(al, 0, __cputchar);
836 1.5 cgd else
837 1.7 cgd abort();
838 1.5 cgd __mvcur(top, 0, oy, ox, 1);
839 1.7 cgd }
840 1.1 cgd }
841