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, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 static char sccsid[] = "@(#)overlay.c 5.6 (Berkeley) 6/1/90"; 36 #endif /* not lint */ 37 38 # include "curses.ext" 39 40 # define min(a,b) (a < b ? a : b) 41 # define max(a,b) (a > b ? a : b) 42 43 /* 44 * This routine writes win1 on win2 non-destructively. 45 * 46 */ 47 overlay(win1, win2) 48 reg WINDOW *win1, *win2; { 49 50 reg chtype *sp, *end; 51 reg int x, y, endy, endx, starty, startx; 52 reg int y1,y2; 53 54 # ifdef DEBUG 55 fprintf(outf, "OVERLAY(%0.2o, %0.2o);\n", win1, win2); 56 # endif 57 starty = max(win1->_begy, win2->_begy); 58 startx = max(win1->_begx, win2->_begx); 59 endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx); 60 endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx); 61 # ifdef DEBUG 62 fprintf(outf, "OVERLAY:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx); 63 # endif 64 if (starty >= endy || startx >= endx) 65 return; 66 y1 = starty - win1->_begy; 67 y2 = starty - win2->_begy; 68 for (y = starty; y < endy; y++, y1++, y2++) { 69 end = &win1->_y[y1][endx - win1->_begx]; 70 x = startx - win2->_begx; 71 for (sp = &win1->_y[y1][startx - win1->_begx]; sp < end; sp++) { 72 if (*sp != ' ') 73 mvwaddch(win2, y2, x, *sp); 74 x++; 75 } 76 } 77 } 78