|
|
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[] = "@(#)erase.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "curses.ext" ! 25: ! 26: /* ! 27: * This routine erases everything on the window. ! 28: * ! 29: */ ! 30: werase(win) ! 31: reg WINDOW *win; { ! 32: ! 33: reg int y; ! 34: reg char *sp, *end, *start, *maxx; ! 35: reg int minx; ! 36: ! 37: # ifdef DEBUG ! 38: fprintf(outf, "WERASE(%0.2o)\n", win); ! 39: # endif ! 40: for (y = 0; y < win->_maxy; y++) { ! 41: minx = _NOCHANGE; ! 42: start = win->_y[y]; ! 43: end = &start[win->_maxx]; ! 44: for (sp = start; sp < end; sp++) ! 45: if (*sp != ' ') { ! 46: maxx = sp; ! 47: if (minx == _NOCHANGE) ! 48: minx = sp - start; ! 49: *sp = ' '; ! 50: } ! 51: if (minx != _NOCHANGE) ! 52: touchline(win, y, minx, maxx - win->_y[y]); ! 53: } ! 54: win->_curx = win->_cury = 0; ! 55: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.