Home | History | Annotate | Line # | Download | only in libcurses
erase.c revision 1.3
      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.3  mycroft /*static char sccsid[] = "from: @(#)erase.c	5.4 (Berkeley) 6/1/90";*/
     36  1.3  mycroft static char rcsid[] = "$Id: erase.c,v 1.3 1993/08/01 18:35:43 mycroft Exp $";
     37  1.1      cgd #endif /* not lint */
     38  1.1      cgd 
     39  1.1      cgd # include	"curses.ext"
     40  1.1      cgd 
     41  1.1      cgd /*
     42  1.1      cgd  *	This routine erases everything on the window.
     43  1.1      cgd  *
     44  1.1      cgd  */
     45  1.1      cgd werase(win)
     46  1.1      cgd reg WINDOW	*win; {
     47  1.1      cgd 
     48  1.1      cgd 	reg int		y;
     49  1.2      alm 	reg chtype      *sp, *end, *start, *maxx;
     50  1.1      cgd 	reg int		minx;
     51  1.1      cgd 
     52  1.1      cgd # ifdef DEBUG
     53  1.1      cgd 	fprintf(outf, "WERASE(%0.2o)\n", win);
     54  1.1      cgd # endif
     55  1.1      cgd 	for (y = 0; y < win->_maxy; y++) {
     56  1.1      cgd 		minx = _NOCHANGE;
     57  1.1      cgd 		start = win->_y[y];
     58  1.1      cgd 		end = &start[win->_maxx];
     59  1.1      cgd 		for (sp = start; sp < end; sp++)
     60  1.1      cgd 			if (*sp != ' ') {
     61  1.1      cgd 				maxx = sp;
     62  1.1      cgd 				if (minx == _NOCHANGE)
     63  1.1      cgd 					minx = sp - start;
     64  1.1      cgd 				*sp = ' ';
     65  1.1      cgd 			}
     66  1.1      cgd 		if (minx != _NOCHANGE)
     67  1.1      cgd 			touchline(win, y, minx, maxx - win->_y[y]);
     68  1.1      cgd 	}
     69  1.1      cgd 	win->_curx = win->_cury = 0;
     70  1.1      cgd }
     71