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