2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static char sccsid[] = "@(#)cmd2.c 8.1 (Berkeley) 6/6/93";
38 static const char rcsid[] =
47 * Mail -- a mail program
53 * If any arguments were given, go to the next applicable argument
54 * following dot, otherwise, go to the next applicable message.
55 * If given as first command with no arguments, print first message.
61 register struct message *mp;
62 register int *ip, *ip2;
68 * If some messages were supplied, find the
69 * first applicable one following dot using
73 mdot = dot - &message[0] + 1;
76 * Find the first message in the supplied
77 * message list which follows dot.
80 for (ip = msgvec; *ip != 0; ip++)
87 mp = &message[*ip2 - 1];
88 if ((mp->m_flag & MDELETED) == 0) {
97 printf("No messages applicable\n");
102 * If this is the first command, select message 1.
103 * Note that this must exist for us to get here at all.
110 * Just find the next good message after dot, no
114 for (mp = dot+1; mp < &message[msgCount]; mp++)
115 if ((mp->m_flag & (MDELETED|MSAVED)) == 0)
117 if (mp >= &message[msgCount]) {
127 list[0] = dot - &message[0] + 1;
133 * Save a message in a file. Mark the message as saved
134 * so we can discard when the user quits.
141 return save1(str, 1, "save", saveignore);
145 * Copy a message to a file without affected its saved-ness
152 return save1(str, 0, "copy", saveignore);
156 * Save/copy the indicated messages at the end of the passed file name.
157 * If mark is true, mark the message "saved."
160 save1(str, mark, cmd, ignore)
164 struct ignoretab *ignore;
167 register struct message *mp;
172 msgvec = (int *) salloc((msgCount + 2) * sizeof *msgvec);
173 if ((file = snarf(str, &f)) == NOSTR)
176 *msgvec = first(0, MMNORM);
178 printf("No messages to %s.\n", cmd);
183 if (f && getmsglist(str, msgvec, 0) < 0)
185 if ((file = expand(file)) == NOSTR)
187 printf("\"%s\" ", file);
189 if (access(file, 0) >= 0)
193 if ((obuf = Fopen(file, "a")) == NULL) {
197 for (ip = msgvec; *ip && ip-msgvec < msgCount; ip++) {
198 mp = &message[*ip - 1];
200 if (sendmessage(mp, obuf, ignore, NOSTR) < 0) {
206 mp->m_flag |= MSAVED;
212 printf("%s\n", disp);
217 * Write the indicated messages at the end of the passed
218 * file name, minus header and trailing blank line.
225 return save1(str, 1, "write", ignoreall);
229 * Snarf the file from the end of the command line and
230 * return a pointer to it. If there is no file attached,
231 * just return NOSTR. Put a null in front of the file
232 * name so that the message list processing won't see it,
233 * unless the file name is the only thing on the line, in
234 * which case, return 0 in the reference flag variable.
245 cp = strlen(linebuf) + linebuf - 1;
248 * Strip away trailing blanks.
251 while (cp > linebuf && isspace(*cp))
256 * Now search for the beginning of the file name.
259 while (cp > linebuf && !isspace(*cp))
262 printf("No file specified.\n");
284 * Delete messages, then type the new dot.
293 lastdot = dot - &message[0] + 1;
294 if (delm(msgvec) >= 0) {
295 list[0] = dot - &message[0] + 1;
296 if (list[0] > lastdot) {
303 printf("No more messages\n");
308 * Delete the indicated messages.
309 * Set dot to some nice place afterwards.
310 * Internal interface.
316 register struct message *mp;
321 for (ip = msgvec; *ip != 0; ip++) {
322 mp = &message[*ip - 1];
324 mp->m_flag |= MDELETED|MTOUCH;
325 mp->m_flag &= ~(MPRESERVE|MSAVED|MBOX);
329 dot = &message[last-1];
330 last = first(0, MDELETED);
332 dot = &message[last-1];
342 * Following can't happen -- it keeps lint happy
349 * Undelete the indicated messages.
352 undelete_messages(msgvec)
355 register struct message *mp;
358 for (ip = msgvec; *ip && ip-msgvec < msgCount; ip++) {
359 mp = &message[*ip - 1];
362 mp->m_flag &= ~MDELETED;
368 * Interactively dump core on "core"
374 extern int wait_status;
376 switch (pid = fork()) {
384 printf("Okie dokie");
387 if (WIFSIGNALED(wait_status) && WCOREDUMP(wait_status))
388 printf(" -- Core dumped.\n");
390 printf(" -- Can't dump core.\n");
395 * Clobber as many bytes of stack as the user requests.
406 times = (atoi(argv[0]) + 511) / 512;
423 for (cp = buf; cp < &buf[512]; *cp++ = 0xFF)
429 * Add the given header fields to the retained list.
430 * If no arguments, print the current list of retained fields.
437 return ignore1(list, ignore + 1, "retained");
441 * Add the given header fields to the ignored list.
442 * If no arguments, print the current list of ignored fields.
449 return ignore1(list, ignore, "ignored");
457 return ignore1(list, saveignore + 1, "retained");
465 return ignore1(list, saveignore, "ignored");
469 ignore1(list, tab, which)
471 struct ignoretab *tab;
474 char field[LINESIZE];
476 register struct ignore *igp;
480 return igshow(tab, which);
481 for (ap = list; *ap != 0; ap++) {
482 istrncpy(field, *ap, sizeof(field));
483 if (member(field, tab))
486 igp = (struct ignore *) calloc(1, sizeof (struct ignore));
487 igp->i_field = calloc((unsigned) strlen(field) + 1,
489 strcpy(igp->i_field, field);
490 igp->i_link = tab->i_head[h];
491 tab->i_head[h] = igp;
498 * Print out all currently retained fields.
502 struct ignoretab *tab;
510 if (tab->i_count == 0) {
511 printf("No fields currently being %s.\n", which);
514 ring = (char **) salloc((tab->i_count + 1) * sizeof (char *));
516 for (h = 0; h < HSHSIZE; h++)
517 for (igp = tab->i_head[h]; igp != 0; igp = igp->i_link)
518 *ap++ = igp->i_field;
520 qsort(ring, tab->i_count, sizeof (char *), igcomp);
521 for (ap = ring; *ap != 0; ap++)
527 * Compare two names for sorting ignored field list.
533 return (strcmp(*(char **)l, *(char **)r));