|
|
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[] = "@(#)insch.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "curses.ext" ! 25: ! 26: /* ! 27: * This routine performs an insert-char on the line, leaving ! 28: * (_cury,_curx) unchanged. ! 29: * ! 30: */ ! 31: winsch(win, c) ! 32: reg WINDOW *win; ! 33: char c; { ! 34: ! 35: reg char *temp1, *temp2; ! 36: reg char *end; ! 37: ! 38: end = &win->_y[win->_cury][win->_curx]; ! 39: temp1 = &win->_y[win->_cury][win->_maxx - 1]; ! 40: temp2 = temp1 - 1; ! 41: while (temp1 > end) ! 42: *temp1-- = *temp2--; ! 43: *temp1 = c; ! 44: touchline(win, win->_cury, win->_curx, win->_maxx - 1); ! 45: if (win->_cury == LINES - 1 && win->_y[LINES-1][COLS-1] != ' ') ! 46: if (win->_scroll) { ! 47: wrefresh(win); ! 48: scroll(win); ! 49: win->_cury--; ! 50: } ! 51: else ! 52: return ERR; ! 53: return OK; ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.