Return to toucholap.c CVS log

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

Annotation of 43BSDReno/lib/libcurses/toucholap.c, revision 1.1.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[] = "@(#)toucholap.c        5.4 (Berkeley) 6/1/90";
                     22: #endif /* not lint */
                     23: 
                     24: # include      "curses.ext"
                     25: 
                     26: # define       min(a,b)        (a < b ? a : b)
                     27: # define       max(a,b)        (a > b ? a : b)
                     28: 
                     29: /*
                     30:  *     Touch, on win2, the part that overlaps with win1.
                     31:  *
                     32:  */
                     33: touchoverlap(win1, win2)
                     34: reg WINDOW     *win1, *win2; {
                     35: 
                     36:        reg int         x, y, endy, endx, starty, startx;
                     37: 
                     38: # ifdef DEBUG
                     39:        fprintf(outf, "TOUCHOVERLAP(%0.2o, %0.2o);\n", win1, win2);
                     40: # endif
                     41:        starty = max(win1->_begy, win2->_begy);
                     42:        startx = max(win1->_begx, win2->_begx);
                     43:        endy = min(win1->_maxy + win1->_begy, win2->_maxy + win2->_begx);
                     44:        endx = min(win1->_maxx + win1->_begx, win2->_maxx + win2->_begx);
                     45: # ifdef DEBUG
                     46:        fprintf(outf, "TOUCHOVERLAP:from (%d,%d) to (%d,%d)\n", starty, startx, endy, endx);
                     47:        fprintf(outf, "TOUCHOVERLAP:win1 (%d,%d) to (%d,%d)\n", win1->_begy, win1->_begx, win1->_begy + win1->_maxy, win1->_begx + win1->_maxx);
                     48:        fprintf(outf, "TOUCHOVERLAP:win2 (%d,%d) to (%d,%d)\n", win2->_begy, win2->_begx, win2->_begy + win2->_maxy, win2->_begx + win2->_maxx);
                     49: # endif
                     50:        if (starty >= endy || startx >= endx)
                     51:                return;
                     52:        starty -= win2->_begy;
                     53:        startx -= win2->_begx;
                     54:        endy -= win2->_begy;
                     55:        endx -= win2->_begx;
                     56:        endx--;
                     57:        for (y = starty; y < endy; y++)
                     58:                touchline(win2, y, startx, endx);
                     59: }

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