|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1980 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted provided ! 6: * that: (1) source distributions retain this entire copyright notice and ! 7: * comment, and (2) distributions including binaries display the following ! 8: * acknowledgement: ``This product includes software developed by the ! 9: * University of California, Berkeley and its contributors'' in the ! 10: * documentation or other materials provided with the distribution and in ! 11: * all advertising materials mentioning features or use of this software. ! 12: * Neither the name of the University nor the names of its contributors may ! 13: * be used to endorse or promote products derived from this software without ! 14: * specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: * ! 19: * @(#)glob.h 5.20 (Berkeley) 6/25/90 ! 20: */ ! 21: ! 22: /* ! 23: * A bunch of global variable declarations lie herein. ! 24: * def.h must be included first. ! 25: */ ! 26: ! 27: int msgCount; /* Count of messages read in */ ! 28: int rcvmode; /* True if receiving mail */ ! 29: int sawcom; /* Set after first command */ ! 30: char *Tflag; /* -T temp file for netnews */ ! 31: int senderr; /* An error while checking */ ! 32: int edit; /* Indicates editing a file */ ! 33: int readonly; /* Will be unable to rewrite file */ ! 34: int noreset; /* String resets suspended */ ! 35: int sourcing; /* Currently reading variant file */ ! 36: int loading; /* Loading user definitions */ ! 37: int cond; /* Current state of conditional exc. */ ! 38: FILE *itf; /* Input temp file buffer */ ! 39: FILE *otf; /* Output temp file buffer */ ! 40: int image; /* File descriptor for image of msg */ ! 41: FILE *input; /* Current command input file */ ! 42: char mailname[PATHSIZE]; /* Name of current file */ ! 43: char prevfile[PATHSIZE]; /* Name of previous file */ ! 44: char *homedir; /* Path name of home directory */ ! 45: char *myname; /* My login name */ ! 46: off_t mailsize; /* Size of system mailbox */ ! 47: int lexnumber; /* Number of TNUMBER from scan() */ ! 48: char lexstring[STRINGLEN]; /* String from TSTRING, scan() */ ! 49: int regretp; /* Pointer to TOS of regret tokens */ ! 50: int regretstack[REGDEP]; /* Stack of regretted tokens */ ! 51: char *string_stack[REGDEP]; /* Stack of regretted strings */ ! 52: int numberstack[REGDEP]; /* Stack of regretted numbers */ ! 53: struct message *dot; /* Pointer to current message */ ! 54: struct message *message; /* The actual message structure */ ! 55: struct var *variables[HSHSIZE]; /* Pointer to active var list */ ! 56: struct grouphead *groups[HSHSIZE];/* Pointer to active groups */ ! 57: struct ignoretab ignore[2]; /* ignored and retained fields ! 58: 0 is ignore, 1 is retain */ ! 59: struct ignoretab saveignore[2]; /* ignored and retained fields ! 60: on save to folder */ ! 61: struct ignoretab ignoreall[2]; /* special, ignore all headers */ ! 62: char **altnames; /* List of alternate names for user */ ! 63: int debug; /* Debug flag set */ ! 64: int screenwidth; /* Screen width, or best guess */ ! 65: int screenheight; /* Screen height, or best guess, ! 66: for "header" command */ ! 67: int realscreenheight; /* the real screen height */ ! 68: ! 69: #include <setjmp.h> ! 70: ! 71: jmp_buf srbuf; ! 72: ! 73: ! 74: /* ! 75: * The pointers for the string allocation routines, ! 76: * there are NSPACE independent areas. ! 77: * The first holds STRINGSIZE bytes, the next ! 78: * twice as much, and so on. ! 79: */ ! 80: ! 81: #define NSPACE 25 /* Total number of string spaces */ ! 82: struct strings { ! 83: char *s_topFree; /* Beginning of this area */ ! 84: char *s_nextFree; /* Next alloctable place here */ ! 85: unsigned s_nleft; /* Number of bytes left here */ ! 86: } stringdope[NSPACE];
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.