|
|
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 COHERENT ! 19: #ifndef lint ! 20: static uchar sccsid[] = "@(#)mvwin.c 5.3 (Berkeley) 6/30/88"; ! 21: #endif /* not lint */ ! 22: #endif /* not COHERENT */ ! 23: ! 24: # include "curses.ext" ! 25: ! 26: /* ! 27: * relocate the starting position of a window ! 28: * ! 29: */ ! 30: ! 31: mvwin(win, by, bx) ! 32: reg WINDOW *win; ! 33: reg int by, bx; { ! 34: ! 35: register WINDOW *orig; ! 36: register int dy, dx; ! 37: ! 38: if (by + win->_maxy > LINES || bx + win->_maxx > COLS) ! 39: return ERR; ! 40: dy = by - win->_begy; ! 41: dx = bx - win->_begx; ! 42: orig = win->_orig; ! 43: if (orig == NULL) { ! 44: orig = win; ! 45: do { ! 46: win->_begy += dy; ! 47: win->_begx += dx; ! 48: _swflags_(win); ! 49: win = win->_nextp; ! 50: } while (win != orig); ! 51: } ! 52: else { ! 53: if (by < orig->_begy || win->_maxy + dy > orig->_maxy) ! 54: return ERR; ! 55: if (bx < orig->_begx || win->_maxx + dx > orig->_maxx) ! 56: return ERR; ! 57: win->_begy = by; ! 58: win->_begx = bx; ! 59: _swflags_(win); ! 60: _set_subwin_(orig, win); ! 61: } ! 62: touchwin(win); ! 63: return OK; ! 64: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.