2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * Mail -- a mail program
39 * Message list handling.
43 * Convert the user string of message numbers and
44 * store the numbers into vector.
46 * Returns the count of messages picked up or -1 on error.
49 getmsglist(char *buf, int *vector, int flags)
58 if (markall(buf, flags) < 0)
61 for (mp = &message[0]; mp < &message[msgCount]; mp++)
62 if (mp->m_flag & MMARK)
63 *ip++ = mp - &message[0] + 1;
69 * Mark all messages that the user wanted from the command
70 * line in the message structure. Return 0 on success, -1
75 * Bit values for colon modifiers.
78 #define CMNEW 01 /* New messages */
79 #define CMOLD 02 /* Old messages */
80 #define CMUNREAD 04 /* Unread messages */
81 #define CMDELETED 010 /* Deleted messages */
82 #define CMREAD 020 /* Read messages */
85 * The following table describes the letters which can follow
86 * the colon and gives the corresponding modifier bit.
89 static struct coltab {
90 char co_char; /* What to find past : */
91 int co_bit; /* Associated modifier bit */
92 int co_mask; /* m_status bits to mask */
93 int co_equal; /* ... must equal this */
95 { 'n', CMNEW, MNEW, MNEW },
96 { 'o', CMOLD, MNEW, 0 },
97 { 'u', CMUNREAD, MREAD, 0 },
98 { 'd', CMDELETED, MDELETED, MDELETED},
99 { 'r', CMREAD, MREAD, MREAD },
103 static int lastcolmod;
106 markall(char buf[], int f)
111 char *namelist[NMLSIZE], *bufp;
112 int tok, beg, mc, star, other, valdot, colmod, colresult;
114 valdot = dot - &message[0] + 1;
116 for (i = 1; i <= msgCount; i++)
126 while (tok != TEOL) {
131 printf("No numbers mixed with *\n");
137 if (check(lexnumber, f))
139 for (i = beg; i <= lexnumber; i++)
140 if (f == MDELETED || (message[i - 1].m_flag & MDELETED) == 0)
158 printf("Non-numeric second argument\n");
165 printf("Referencing beyond EOF\n");
168 } while ((message[i - 1].m_flag & MDELETED) != f);
178 printf("Referencing before 1\n");
181 } while ((message[i - 1].m_flag & MDELETED) != f);
188 printf("Non-numeric second argument\n");
192 if (lexstring[0] == ':') {
193 colresult = evalcol(lexstring[1]);
194 if (colresult == 0) {
195 printf("Unknown colon modifier \"%s\"\n",
202 *np++ = savestr(lexstring);
208 lexnumber = metamess(lexstring[0], f);
215 printf("Can't mix \"*\" with anything\n");
230 for (i = 0; i < msgCount; i++)
231 if ((message[i].m_flag & MDELETED) == f) {
236 printf("No applicable messages.\n");
243 * If no numbers were given, mark all of the messages,
244 * so that we can unmark any whose sender was not selected
245 * if any user names were given.
248 if ((np > namelist || colmod != 0) && mc == 0)
249 for (i = 1; i <= msgCount; i++)
250 if ((message[i-1].m_flag & MDELETED) == f)
254 * If any names were given, go through and eliminate any
255 * messages whose senders were not requested.
259 for (i = 1; i <= msgCount; i++) {
260 for (mc = 0, np = &namelist[0]; *np != NULL; np++)
262 if (matchfield(*np, i)) {
268 if (matchsender(*np, i)) {
278 * Make sure we got some decent messages.
282 for (i = 1; i <= msgCount; i++)
283 if (message[i-1].m_flag & MMARK) {
288 printf("No applicable messages from {%s",
290 for (np = &namelist[1]; *np != NULL; np++)
298 * If any colon modifiers were given, go through and
299 * unmark any messages which do not satisfy the modifiers.
303 for (i = 1; i <= msgCount; i++) {
306 mp = &message[i - 1];
307 for (colp = &coltab[0]; colp->co_char != '\0'; colp++)
308 if (colp->co_bit & colmod)
309 if ((mp->m_flag & colp->co_mask)
314 for (mp = &message[0]; mp < &message[msgCount]; mp++)
315 if (mp->m_flag & MMARK)
317 if (mp >= &message[msgCount]) {
320 printf("No messages satisfy");
321 for (colp = &coltab[0]; colp->co_char != '\0'; colp++)
322 if (colp->co_bit & colmod)
323 printf(" :%c", colp->co_char);
332 * Turn the character after a colon modifier into a bit
342 for (colp = &coltab[0]; colp->co_char != '\0'; colp++)
343 if (colp->co_char == col)
344 return (colp->co_bit);
349 * Check the passed message number for legality and proper flags.
350 * If f is MDELETED, then either kind will do. Otherwise, the message
351 * has to be undeleted.
354 check(int mesg, int f)
358 if (mesg < 1 || mesg > msgCount) {
359 printf("%d: Invalid message number\n", mesg);
362 mp = &message[mesg-1];
363 if (f != MDELETED && (mp->m_flag & MDELETED) != 0) {
364 printf("%d: Inappropriate message\n", mesg);
371 * Scan out the list of string arguments, shell style
375 getrawlist(char line[], char **argv, int argc)
377 char c, *cp, *cp2, quotec;
380 size_t linebufsize = BUFSIZ;
382 if ((linebuf = malloc(linebufsize)) == NULL)
383 err(1, "Out of memory");
388 for (; *cp == ' ' || *cp == '\t'; cp++)
392 if (argn >= argc - 1) {
394 "Too many elements in the list; excess discarded.\n");
399 while ((c = *cp) != '\0') {
400 /* Allocate more space if necessary */
401 if (cp2 - linebuf == linebufsize - 1) {
402 linebufsize += BUFSIZ;
403 if ((linebuf = realloc(linebuf, linebufsize)) == NULL)
404 err(1, "Out of memory");
405 cp2 = linebuf + linebufsize - BUFSIZ - 1;
408 if (quotec != '\0') {
417 case '0': case '1': case '2': case '3':
418 case '4': case '5': case '6': case '7':
420 if (*cp >= '0' && *cp <= '7')
421 c = c * 8 + *cp++ - '0';
422 if (*cp >= '0' && *cp <= '7')
423 c = c * 8 + *cp++ - '0';
451 /* null doesn't show up anyway */
452 else if ((c >= 'A' && c <= '_') ||
453 (c >= 'a' && c <= 'z'))
461 } else if (c == '"' || c == '\'')
463 else if (c == ' ' || c == '\t')
469 argv[argn++] = savestr(linebuf);
477 * scan out a single lexical item and return its token number,
478 * updating the string pointer passed **p. Also, store the value
479 * of the number or string scanned in lexnumber or lexstring as
480 * appropriate. In any event, store the scanned `thing' in lexstring.
507 strcpy(lexstring, string_stack[regretp]);
508 lexnumber = numberstack[regretp];
509 return (regretstack[regretp--]);
516 * strip away leading white space.
519 while (c == ' ' || c == '\t')
523 * If no characters remain, we are at end of line,
533 * If the leading character is a digit, scan
534 * the number and convert it on the fly.
535 * Return TNUMBER when done.
538 if (isdigit((unsigned char)c)) {
540 while (isdigit((unsigned char)c)) {
541 lexnumber = lexnumber*10 + c - '0';
551 * Check for single character tokens; return such
555 for (lp = &singles[0]; lp->l_char != '\0'; lp++)
556 if (c == lp->l_char) {
560 return (lp->l_token);
564 * We've got a string! Copy all the characters
565 * of the string into lexstring, until we see
566 * a null, space, or tab.
567 * If the lead character is a " or ', save it
568 * and scan until you get another.
572 if (c == '\'' || c == '"') {
581 if (quotec == 0 && (c == ' ' || c == '\t'))
583 if (cp2 - lexstring < STRINGLEN-1)
587 if (quotec && c == '\0') {
588 fprintf(stderr, "Missing %c\n", quotec);
597 * Unscan the named token by pushing it onto the regret stack.
602 if (++regretp >= REGDEP)
603 errx(1, "Too many regrets");
604 regretstack[regretp] = token;
605 lexstring[STRINGLEN-1] = '\0';
606 string_stack[regretp] = savestr(lexstring);
607 numberstack[regretp] = lexnumber;
611 * Reset all the scanner global variables.
620 * Find the first message whose flags & m == f and return
621 * its message number.
632 for (mp = dot; mp < &message[msgCount]; mp++)
633 if ((mp->m_flag & m) == f)
634 return (mp - message + 1);
635 for (mp = dot-1; mp >= &message[0]; mp--)
636 if ((mp->m_flag & m) == f)
637 return (mp - message + 1);
642 * See if the passed name sent the passed message number. Return true
646 matchsender(char *str, int mesg)
650 /* null string matches nothing instead of everything */
654 cp = nameof(&message[mesg - 1], 0);
655 return (strcasestr(cp, str) != NULL);
659 * See if the passed name received the passed message number. Return true
663 static char *to_fields[] = { "to", "cc", "bcc", NULL };
666 matchto(char *str, int mesg)
673 /* null string matches nothing instead of everything */
677 mp = &message[mesg - 1];
679 for (to = to_fields; *to != NULL; to++) {
680 cp = hfield(*to, mp);
681 if (cp != NULL && strcasestr(cp, str) != NULL)
688 * See if the given substring is contained within the specified field. If
689 * 'searchheaders' is set, then the form '/x:y' will be accepted and matches
690 * any message with the substring 'y' in field 'x'. If 'x' is omitted or
691 * 'searchheaders' is not set, then the search matches any messages
692 * with the substring 'y' in the 'Subject'. The search is case insensitive.
694 * The form '/to:y' is a special case, and will match all messages
695 * containing the substring 'y' in the 'To', 'Cc', or 'Bcc' header
696 * fields. The search for 'to' is case sensitive, so that '/To:y' can
697 * be used to limit the search to just the 'To' field.
700 static char lastscan[STRINGLEN];
702 matchfield(char *str, int mesg)
711 strlcpy(lastscan, str, sizeof(lastscan));
712 mp = &message[mesg-1];
715 * Now look, ignoring case, for the word in the string.
718 if (value("searchheaders") && (cp = strchr(str, ':')) != NULL) {
719 /* Check for special case "/to:" */
720 if (strncmp(str, "to:", 3) == 0)
721 return (matchto(cp, mesg));
723 cp2 = hfield(*str != '\0' ? str : "subject", mp);
728 cp = hfield("subject", mp);
733 return (strcasestr(cp, str) != NULL);
737 * Mark the named message by setting its mark bit.
745 if (i < 1 || i > msgCount)
746 errx(1, "Bad message number to mark");
747 message[i-1].m_flag |= MMARK;
751 * Unmark the named message.
759 if (i < 1 || i > msgCount)
760 errx(1, "Bad message number to unmark");
761 message[i-1].m_flag &= ~MMARK;
765 * Return the message number corresponding to the passed meta character.
768 metamess(int meta, int f)
777 * First 'good' message left.
779 for (mp = &message[0]; mp < &message[msgCount]; mp++)
780 if ((mp->m_flag & MDELETED) == f)
781 return (mp - &message[0] + 1);
782 printf("No applicable messages\n");
787 * Last 'good message left.
789 for (mp = &message[msgCount-1]; mp >= &message[0]; mp--)
790 if ((mp->m_flag & MDELETED) == f)
791 return (mp - &message[0] + 1);
792 printf("No applicable messages\n");
799 m = dot - &message[0] + 1;
800 if ((dot->m_flag & MDELETED) != f) {
801 printf("%d: Inappropriate message\n", m);
807 printf("Unknown metachar (%c)\n", c);