|
|
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[] = "@(#)box.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "curses.ext" ! 25: ! 26: /* ! 27: * This routine draws a box around the given window with "vert" ! 28: * as the vertical delimiting char, and "hor", as the horizontal one. ! 29: * ! 30: */ ! 31: box(win, vert, hor) ! 32: reg WINDOW *win; ! 33: char vert, hor; { ! 34: ! 35: reg int i; ! 36: reg int endy, endx; ! 37: reg char *fp, *lp; ! 38: ! 39: endx = win->_maxx; ! 40: endy = win->_maxy - 1; ! 41: fp = win->_y[0]; ! 42: lp = win->_y[endy]; ! 43: for (i = 0; i < endx; i++) ! 44: fp[i] = lp[i] = hor; ! 45: endx--; ! 46: for (i = 0; i <= endy; i++) ! 47: win->_y[i][0] = (win->_y[i][endx] = vert); ! 48: if (!win->_scroll && (win->_flags&_SCROLLWIN)) ! 49: fp[0] = fp[endx] = lp[0] = lp[endx] = ' '; ! 50: touchwin(win); ! 51: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.