|
|
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 the above copyright notice and this paragraph are
7: * duplicated in all such forms and that any documentation,
8: * advertising materials, and other materials related to such
9: * distribution and use acknowledge that the software was developed
10: * by the University of California, Berkeley. The name of the
11: * University may not be used to endorse or promote products derived
12: * from this software without specific prior written permission.
13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16: */
17:
18: #ifndef lint
19: static char sccsid[] = "@(#)id_subwins.c 5.3 (Berkeley) 6/30/88";
20: #endif /* not lint */
21:
22: # include "curses.ext"
23:
24: /*
25: * _id_subwins:
26: * Re-sync the pointers to _y for all the subwindows.
27: *
28: */
29: _id_subwins(orig)
30: register WINDOW *orig;
31: {
32: register WINDOW *win;
33: register int realy;
34: register int y, oy, x;
35:
36: realy = orig->_begy + orig->_cury;
37: for (win = orig->_nextp; win != orig; win = win->_nextp) {
38: /*
39: * If the window ends before our current position,
40: * don't need to do anything.
41: */
42: if (win->_begy + win->_maxy <= realy)
43: continue;
44:
45: oy = orig->_cury;
46: for (y = realy - win->_begy; y < win->_maxy; y++, oy++)
47: win->_y[y] = &orig->_y[oy][win->_ch_off];
48: }
49: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.