|
|
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[] = "@(#)id_subwins.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "curses.ext" ! 25: ! 26: /* ! 27: * _id_subwins: ! 28: * Re-sync the pointers to _y for all the subwindows. ! 29: * ! 30: */ ! 31: _id_subwins(orig) ! 32: register WINDOW *orig; ! 33: { ! 34: register WINDOW *win; ! 35: register int realy; ! 36: register int y, oy, x; ! 37: ! 38: realy = orig->_begy + orig->_cury; ! 39: for (win = orig->_nextp; win != orig; win = win->_nextp) { ! 40: /* ! 41: * If the window ends before our current position, ! 42: * don't need to do anything. ! 43: */ ! 44: if (win->_begy + win->_maxy <= realy) ! 45: continue; ! 46: ! 47: oy = orig->_cury; ! 48: for (y = realy - win->_begy; y < win->_maxy; y++, oy++) ! 49: win->_y[y] = &orig->_y[oy][win->_ch_off]; ! 50: } ! 51: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.