|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 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: * @(#)defs.h 3.18 (Berkeley) 6/29/88 ! 18: */ ! 19: ! 20: #include "ww.h" ! 21: #include <sys/time.h> ! 22: ! 23: #define NWINDOW 9 ! 24: ! 25: struct timeval starttime; ! 26: ! 27: struct ww *window[NWINDOW]; /* the windows */ ! 28: struct ww *selwin; /* the selected window */ ! 29: struct ww *lastselwin; /* the last selected window */ ! 30: struct ww *cmdwin; /* the command window */ ! 31: struct ww *framewin; /* the window for framing */ ! 32: struct ww *boxwin; /* the window for the box */ ! 33: struct ww *fgwin; /* the last foreground window */ ! 34: ! 35: #define isfg(w) ((w)->ww_order <= fgwin->ww_order) ! 36: ! 37: char *shell[128]; /* the shell argv */ ! 38: char *shellfile; /* the shell program */ ! 39: int nbufline; /* default buffer size for new windows */ ! 40: char escapec; /* the escape character */ ! 41: ! 42: /* flags */ ! 43: char quit; /* quit command issued */ ! 44: char terse; /* terse mode */ ! 45: char debug; /* debug mode */ ! 46: char incmd; /* in command mode */ ! 47: ! 48: struct ww *getwin(); ! 49: struct ww *openwin(); ! 50: struct ww *vtowin(); ! 51: struct ww *openiwin();
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.