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