|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Edward Wang at The University of California, Berkeley.
7: *
8: * Redistribution and use in source and binary forms are permitted provided
9: * that: (1) source distributions retain this entire copyright notice and
10: * comment, and (2) distributions including binaries display the following
11: * acknowledgement: ``This product includes software developed by the
12: * University of California, Berkeley and its contributors'' in the
13: * documentation or other materials provided with the distribution and in
14: * all advertising materials mentioning features or use of this software.
15: * Neither the name of the University nor the names of its contributors may
16: * be used to endorse or promote products derived from this software without
17: * specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #ifndef lint
24: static char sccsid[] = "@(#)wwinsline.c 3.12 (Berkeley) 6/6/90";
25: #endif /* not lint */
26:
27: #include "ww.h"
28:
29: wwinsline(w, row)
30: register struct ww *w;
31: int row;
32: {
33: register i;
34: register union ww_char **cpp, **cqq;
35: register union ww_char *cp;
36: int row1, row2;
37: char deleted;
38: int visible;
39:
40: /*
41: * Scroll first.
42: */
43: if ((row1 = row) < w->ww_i.t) {
44: row1 = w->ww_i.t;
45: visible = 0;
46: } else
47: visible = 1;
48: if ((row2 = w->ww_b.b) > w->ww_i.b) {
49: row2 = w->ww_i.b;
50: }
51: deleted = wwscroll1(w, row1, row2, -1, visible);
52:
53: /*
54: * Fix the buffer.
55: * But leave clearing the last line for wwclreol().
56: */
57: cpp = &w->ww_buf[w->ww_b.b];
58: cqq = cpp - 1;
59: cp = *cqq;
60: for (i = w->ww_b.b - row; --i > 0;)
61: *--cpp = *--cqq;
62: *cqq = cp;
63:
64: /*
65: * Now clear the last line.
66: */
67: if (visible)
68: wwclreol1(w, row, w->ww_b.l, deleted);
69: else {
70: cp += w->ww_b.l;
71: for (i = w->ww_b.nc; --i >= 0;)
72: cp++->c_w = ' ';
73: }
74: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.