def.h revision 1.10 1 /* $NetBSD: def.h,v 1.10 1997/10/19 05:03:12 lukem Exp $ */
2 /*
3 * Copyright (c) 1980, 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by the University of
17 * California, Berkeley and its contributors.
18 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 *
34 * @(#)def.h 8.4 (Berkeley) 4/20/95
35 * $NetBSD: def.h,v 1.10 1997/10/19 05:03:12 lukem Exp $
36 */
37
38 /*
39 * Mail -- a mail program
40 *
41 * Author: Kurt Shoens (UCB) March 25, 1978
42 */
43
44 #include <sys/types.h>
45 #include <sys/file.h>
46 #include <sys/ioctl.h>
47 #include <sys/stat.h>
48 #include <sys/param.h>
49 #include <sys/time.h>
50 #include <sys/wait.h>
51
52 #include <ctype.h>
53 #include <err.h>
54 #include <errno.h>
55 #include <fcntl.h>
56 #include <paths.h>
57 #include <pwd.h>
58 #include <signal.h>
59 #include <stdio.h>
60 #include <stdlib.h>
61 #include <string.h>
62 #include <termios.h>
63 #include <unistd.h>
64 #include "pathnames.h"
65
66 #define APPEND /* New mail goes to end of mailbox */
67
68 #define ESCAPE '~' /* Default escape for sending */
69 #define NMLSIZE 1024 /* max names in a message list */
70 #define PATHSIZE MAXPATHLEN /* Size of pathnames throughout */
71 #define HSHSIZE 59 /* Hash size for aliases and vars */
72 #define LINESIZE BUFSIZ /* max readable line width */
73 #define STRINGSIZE ((unsigned) 128)/* Dynamic allocation units */
74 #define MAXARGC 1024 /* Maximum list of raw strings */
75 #define NOSTR ((char *) 0) /* Null string pointer */
76 #define MAXEXP 25 /* Maximum expansion of aliases */
77
78 #define equal(a, b) (strcmp(a,b)==0)/* A nice function to string compare */
79
80 struct message {
81 short m_flag; /* flags, see below */
82 long m_block; /* block number of this message */
83 short m_offset; /* offset in block of message */
84 long m_size; /* Bytes in the message */
85 long m_lines; /* Lines in the message */
86 };
87
88 /*
89 * flag bits.
90 */
91
92 #define MUSED (1<<0) /* entry is used, but this bit isn't */
93 #define MDELETED (1<<1) /* entry has been deleted */
94 #define MSAVED (1<<2) /* entry has been saved */
95 #define MTOUCH (1<<3) /* entry has been noticed */
96 #define MPRESERVE (1<<4) /* keep entry in sys mailbox */
97 #define MMARK (1<<5) /* message is marked! */
98 #define MODIFY (1<<6) /* message has been modified */
99 #define MNEW (1<<7) /* message has never been seen */
100 #define MREAD (1<<8) /* message has been read sometime. */
101 #define MSTATUS (1<<9) /* message status has changed */
102 #define MBOX (1<<10) /* Send this to mbox, regardless */
103
104 /*
105 * Given a file address, determine the block number it represents.
106 */
107 #define blockof(off) ((int) ((off) / 4096))
108 #define offsetof(off) ((int) ((off) % 4096))
109 #define positionof(block, offset) ((off_t)(block) * 4096 + (offset))
110
111 /*
112 * Format of the command description table.
113 * The actual table is declared and initialized
114 * in lex.c
115 */
116 struct cmd {
117 char *c_name; /* Name of command */
118 int (*c_func) __P((void *));/* Implementor of the command */
119 short c_argtype; /* Type of arglist (see below) */
120 short c_msgflag; /* Required flags of messages */
121 short c_msgmask; /* Relevant flags of messages */
122 };
123
124 /* Yechh, can't initialize unions */
125
126 #define c_minargs c_msgflag /* Minimum argcount for RAWLIST */
127 #define c_maxargs c_msgmask /* Max argcount for RAWLIST */
128
129 /*
130 * Argument types.
131 */
132
133 #define MSGLIST 0 /* Message list type */
134 #define STRLIST 1 /* A pure string */
135 #define RAWLIST 2 /* Shell string list */
136 #define NOLIST 3 /* Just plain 0 */
137 #define NDMLIST 4 /* Message list, no defaults */
138
139 #define P 040 /* Autoprint dot after command */
140 #define I 0100 /* Interactive command bit */
141 #define M 0200 /* Legal from send mode bit */
142 #define W 0400 /* Illegal when read only bit */
143 #define F 01000 /* Is a conditional command */
144 #define T 02000 /* Is a transparent command */
145 #define R 04000 /* Cannot be called from collect */
146
147 /*
148 * Oft-used mask values
149 */
150
151 #define MMNORM (MDELETED|MSAVED)/* Look at both save and delete bits */
152 #define MMNDEL MDELETED /* Look only at deleted bit */
153
154 /*
155 * Structure used to return a break down of a head
156 * line (hats off to Bill Joy!)
157 */
158
159 struct headline {
160 char *l_from; /* The name of the sender */
161 char *l_tty; /* His tty string (if any) */
162 char *l_date; /* The entire date string */
163 };
164
165 #define GTO 1 /* Grab To: line */
166 #define GSUBJECT 2 /* Likewise, Subject: line */
167 #define GCC 4 /* And the Cc: line */
168 #define GBCC 8 /* And also the Bcc: line */
169 #define GMASK (GTO|GSUBJECT|GCC|GBCC)
170 /* Mask of places from whence */
171
172 #define GNL 16 /* Print blank line after */
173 #define GDEL 32 /* Entity removed from list */
174 #define GCOMMA 64 /* detract puts in commas */
175
176 /*
177 * Structure used to pass about the current
178 * state of the user-typed message header.
179 */
180
181 struct header {
182 struct name *h_to; /* Dynamic "To:" string */
183 char *h_subject; /* Subject string */
184 struct name *h_cc; /* Carbon copies string */
185 struct name *h_bcc; /* Blind carbon copies */
186 struct name *h_smopts; /* Sendmail options */
187 };
188
189 /*
190 * Structure of namelist nodes used in processing
191 * the recipients of mail and aliases and all that
192 * kind of stuff.
193 */
194
195 struct name {
196 struct name *n_flink; /* Forward link in list. */
197 struct name *n_blink; /* Backward list link */
198 short n_type; /* From which list it came */
199 char *n_name; /* This fella's name */
200 };
201
202 /*
203 * Structure of a variable node. All variables are
204 * kept on a singly-linked list of these, rooted by
205 * "variables"
206 */
207
208 struct var {
209 struct var *v_link; /* Forward link to next variable */
210 char *v_name; /* The variable's name */
211 char *v_value; /* And it's current value */
212 };
213
214 struct group {
215 struct group *ge_link; /* Next person in this group */
216 char *ge_name; /* This person's user name */
217 };
218
219 struct grouphead {
220 struct grouphead *g_link; /* Next grouphead in list */
221 char *g_name; /* Name of this group */
222 struct group *g_list; /* Users in group. */
223 };
224
225 #define NIL ((struct name *) 0) /* The nil pointer for namelists */
226 #define NONE ((struct cmd *) 0) /* The nil pointer to command tab */
227 #define NOVAR ((struct var *) 0) /* The nil pointer to variables */
228 #define NOGRP ((struct grouphead *) 0)/* The nil grouphead pointer */
229 #define NOGE ((struct group *) 0) /* The nil group pointer */
230
231 /*
232 * Structure of the hash table of ignored header fields
233 */
234 struct ignoretab {
235 int i_count; /* Number of entries */
236 struct ignore {
237 struct ignore *i_link; /* Next ignored field in bucket */
238 char *i_field; /* This ignored field */
239 } *i_head[HSHSIZE];
240 };
241
242 /*
243 * Token values returned by the scanner used for argument lists.
244 * Also, sizes of scanner-related things.
245 */
246
247 #define TEOL 0 /* End of the command line */
248 #define TNUMBER 1 /* A message number */
249 #define TDASH 2 /* A simple dash */
250 #define TSTRING 3 /* A string (possibly containing -) */
251 #define TDOT 4 /* A "." */
252 #define TUP 5 /* An "^" */
253 #define TDOLLAR 6 /* A "$" */
254 #define TSTAR 7 /* A "*" */
255 #define TOPEN 8 /* An '(' */
256 #define TCLOSE 9 /* A ')' */
257 #define TPLUS 10 /* A '+' */
258 #define TERROR 11 /* A lexical error */
259
260 #define REGDEP 2 /* Maximum regret depth. */
261 #define STRINGLEN 1024 /* Maximum length of string token */
262
263 /*
264 * Constants for conditional commands. These describe whether
265 * we should be executing stuff or not.
266 */
267
268 #define CANY 0 /* Execute in send or receive mode */
269 #define CRCV 1 /* Execute in receive mode only */
270 #define CSEND 2 /* Execute in send mode only */
271
272 /*
273 * Kludges to handle the change from setexit / reset to setjmp / longjmp
274 */
275
276 #define setexit() setjmp(srbuf)
277 #define reset(x) longjmp(srbuf, x)
278
279 /*
280 * Truncate a file to the last character written. This is
281 * useful just before closing an old file that was opened
282 * for read/write.
283 */
284 #define trunc(stream) { \
285 (void)fflush(stream); \
286 (void)ftruncate(fileno(stream), (off_t)ftell(stream)); \
287 }
288