Return to overlay.c CVS log

Up to [CSRG BSD Unix] / 43BSDReno / lib / libcurses

Annotation of 43BSDReno/lib/libcurses/overlay.c, revision 1.1

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[] = "@(#)overlay.c  5.6 (Berkeley) 6/1/90";
        !            22: #endif /* not lint */
        !            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 non-destructively.
        !            32:  *
        !            33:  */
        !            34: overlay(win1, win2)
        !            35: reg WINDOW     *win1, *win2; {
        !            36: 
        !            37:        reg char        *sp, *end;
        !            38:        reg int         x, y, endy, endx, starty, startx;
        !            39:        reg int         y1,y2;
        !            40: 
        !            41: # ifdef DEBUG
        !            42:        fprintf(outf, "OVERLAY(%0.2o, %0.2o);\n", win1, win2);
        !            43: # endif
        !            44:        starty = max(win1->_begy, win2->_begy);
        !            45:        startx = max(win1->_begx, win2->_begx);
        !            46:        endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx);
        !            47:        endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx);
        !            48: # ifdef DEBUG
        !            49:        fprintf(outf, "OVERLAY:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx);
        !            50: # endif
        !            51:        if (starty >= endy || startx >= endx)
        !            52:                return;
        !            53:        y1 = starty - win1->_begy;
        !            54:        y2 = starty - win2->_begy;
        !            55:        for (y = starty; y < endy; y++, y1++, y2++) {
        !            56:                end = &win1->_y[y1][endx - win1->_begx];
        !            57:                x = startx - win2->_begx;
        !            58:                for (sp = &win1->_y[y1][startx - win1->_begx]; sp < end; sp++) {
        !            59:                        if (!isspace(*sp))
        !            60:                                mvwaddch(win2, y2, x, *sp);
        !            61:                        x++;
        !            62:                }
        !            63:        }
        !            64: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.