|
|
1.1 root 1: /*
2: * Copyright (c) 1981 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #ifndef lint
21: static char sccsid[] = "@(#)insertln.c 5.4 (Berkeley) 6/1/90";
22: #endif /* not lint */
23:
24: # include "curses.ext"
25:
26: /*
27: * This routine performs an insert-line on the window, leaving
28: * (_cury,_curx) unchanged.
29: *
30: */
31: winsertln(win)
32: reg WINDOW *win; {
33:
34: reg char *temp;
35: reg int y;
36: reg char *end;
37: reg int x;
38:
39: #ifdef DEBUG
40: fprintf(outf, "INSERTLN(%0.2o)\n", win);
41: #endif
42: if (win->_orig == NULL)
43: temp = win->_y[win->_maxy - 1];
44: for (y = win->_maxy - 1; y > win->_cury; --y) {
45: if (win->_orig == NULL)
46: win->_y[y] = win->_y[y - 1];
47: else
48: bcopy(win->_y[y - 1], win->_y[y], win->_maxx);
49: touchline(win, y, 0, win->_maxx - 1);
50: }
51: if (win->_orig == NULL)
52: win->_y[y] = temp;
53: else
54: temp = win->_y[y];
55: for (end = &temp[win->_maxx]; temp < end; )
56: *temp++ = ' ';
57: touchline(win, y, 0, win->_maxx - 1);
58: if (win->_orig == NULL)
59: _id_subwins(win);
60: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.