|
|
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[] = "@(#)overwrite.c 5.3 (Berkeley) 6/30/88"; ! 21: #endif /* not lint */ ! 22: #endif /* not COHERENT */ ! 23: ! 24: # include "curses.ext" ! 25: # include <ctype.h> ! 26: ! 27: # define min(a,b) (a < b ? a : b) ! 28: # define max(a,b) (a > b ? a : b) ! 29: ! 30: /* ! 31: * This routine writes win1 on win2 destructively. ! 32: * ! 33: */ ! 34: overwrite(win1, win2) ! 35: reg WINDOW *win1, *win2; { ! 36: ! 37: reg int x, y, endy, endx, starty, startx; ! 38: ! 39: # ifdef DEBUG ! 40: fprintf(outf, "OVERWRITE(%0.2o, %0.2o);\n", win1, win2); ! 41: # endif ! 42: starty = max(win1->_begy, win2->_begy); ! 43: startx = max(win1->_begx, win2->_begx); ! 44: endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx); ! 45: endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx); ! 46: if (starty >= endy || startx >= endx) ! 47: return; ! 48: # ifdef DEBUG ! 49: fprintf(outf, "OVERWRITE:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx); ! 50: # endif ! 51: x = endx - startx; ! 52: for (y = starty; y < endy; y++) { ! 53: bcopy(&win1->_y[y - win1->_begy][startx - win1->_begx], ! 54: &win2->_y[y - win2->_begy][startx - win2->_begx], x); ! 55: touchline(win2, y, startx - win2->_begx, endx - win2->_begx); ! 56: } ! 57: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.