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