|
|
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 the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: */ ! 17: ! 18: #ifndef lint ! 19: static char sccsid[] = "@(#)insertln.c 5.3 (Berkeley) 6/30/88"; ! 20: #endif /* not lint */ ! 21: ! 22: # include "curses.ext" ! 23: ! 24: /* ! 25: * This routine performs an insert-line on the window, leaving ! 26: * (_cury,_curx) unchanged. ! 27: * ! 28: */ ! 29: winsertln(win) ! 30: reg WINDOW *win; { ! 31: ! 32: reg char *temp; ! 33: reg int y; ! 34: reg char *end; ! 35: reg int x; ! 36: ! 37: #ifdef DEBUG ! 38: fprintf(outf, "INSERTLN(%0.2o)\n", win); ! 39: #endif ! 40: if (win->_orig == NULL) ! 41: temp = win->_y[win->_maxy - 1]; ! 42: for (y = win->_maxy - 1; y > win->_cury; --y) { ! 43: if (win->_orig == NULL) ! 44: win->_y[y] = win->_y[y - 1]; ! 45: else ! 46: bcopy(win->_y[y - 1], win->_y[y], win->_maxx); ! 47: touchline(win, y, 0, win->_maxx - 1); ! 48: } ! 49: if (win->_orig == NULL) ! 50: win->_y[y] = temp; ! 51: else ! 52: temp = win->_y[y]; ! 53: for (end = &temp[win->_maxx]; temp < end; ) ! 54: *temp++ = ' '; ! 55: touchline(win, y, 0, win->_maxx - 1); ! 56: if (win->_orig == NULL) ! 57: _id_subwins(win); ! 58: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.