head.c revision 228992
124120Smpp/* 224120Smpp * Copyright (c) 1980, 1993 324120Smpp * The Regents of the University of California. All rights reserved. 424120Smpp * 524120Smpp * Redistribution and use in source and binary forms, with or without 624120Smpp * modification, are permitted provided that the following conditions 724120Smpp * are met: 824120Smpp * 1. Redistributions of source code must retain the above copyright 924120Smpp * notice, this list of conditions and the following disclaimer. 1024120Smpp * 2. Redistributions in binary form must reproduce the above copyright 1124120Smpp * notice, this list of conditions and the following disclaimer in the 1224120Smpp * documentation and/or other materials provided with the distribution. 1324120Smpp * 4. Neither the name of the University nor the names of its contributors 1424120Smpp * may be used to endorse or promote products derived from this software 1524120Smpp * without specific prior written permission. 1624120Smpp * 1724120Smpp * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 1824120Smpp * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 1924120Smpp * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2024120Smpp * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2124120Smpp * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2224120Smpp * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2324120Smpp * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2424120Smpp * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2524120Smpp * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 2624120Smpp * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 2724120Smpp * SUCH DAMAGE. 2824120Smpp */ 2924120Smpp 3050476Speter#ifndef lint 3148795Snik#if 0 3224120Smppstatic char sccsid[] = "@(#)head.c 8.2 (Berkeley) 4/20/95"; 3324121Smpp#endif 3479538Sru#endif /* not lint */ 3524120Smpp#include <sys/cdefs.h> 3624120Smpp__FBSDID("$FreeBSD: head/usr.bin/mail/head.c 228992 2011-12-30 11:02:40Z uqs $"); 3724120Smpp 3824120Smpp#include "rcv.h" 3924120Smpp#include "extern.h" 4088509Sdavidc 4188509Sdavidc/* 4284306Sru * Mail -- a mail program 4384306Sru * 4424120Smpp * Routines for processing and detecting headlines. 45109630Salfred */ 4624120Smpp 47109630Salfred/* 4824120Smpp * See if the passed line buffer is a mail header. 4924120Smpp * Return true if yes. Note the extreme pains to 5024120Smpp * accommodate all funny formats. 5124120Smpp */ 5224120Smppint 5324120Smppishead(char linebuf[]) 5424120Smpp{ 5524120Smpp struct headline hl; 5624120Smpp char parbuf[BUFSIZ]; 5724120Smpp 5824120Smpp if (strncmp(linebuf, "From ", 5) != 0) 5924120Smpp return (0); 6024120Smpp parse(linebuf, &hl, parbuf); 6152644Sphk if (hl.l_date == NULL) { 6252644Sphk fail(linebuf, "No date field"); 6379727Sschweikh return (0); 6424120Smpp } 6579727Sschweikh if (!isdate(hl.l_date)) { 6624120Smpp fail(linebuf, "Date field not legal date"); 6724120Smpp return (0); 6824120Smpp } 6924120Smpp /* 7024120Smpp * I guess we got it! 7157731Ssheldonh */ 7257731Ssheldonh return (1); 7324120Smpp} 7424120Smpp 7524120Smppvoid 7679727Sschweikhfail(const char *linebuf __unused, const char *reason __unused) 7752644Sphk{ 7824120Smpp 7957731Ssheldonh /* 8057731Ssheldonh if (value("debug") == NULL) 8124120Smpp return; 8279727Sschweikh fprintf(stderr, "\"%s\"\nnot a header because %s\n", linebuf, reason); 8352644Sphk */ 84} 85 86/* 87 * Split a headline into its useful components. 88 * Copy the line into dynamic string space, then set 89 * pointers into the copied line in the passed headline 90 * structure. Actually, it scans. 91 */ 92void 93parse(char line[], struct headline *hl, char pbuf[]) 94{ 95 char *cp, *sp; 96 char word[LINESIZE]; 97 98 hl->l_from = NULL; 99 hl->l_tty = NULL; 100 hl->l_date = NULL; 101 cp = line; 102 sp = pbuf; 103 /* 104 * Skip over "From" first. 105 */ 106 cp = nextword(cp, word); 107 /* 108 * Check for missing return-path. 109 */ 110 if (isdate(cp)) { 111 hl->l_date = copyin(cp, &sp); 112 return; 113 } 114 cp = nextword(cp, word); 115 if (strlen(word) > 0) 116 hl->l_from = copyin(word, &sp); 117 if (cp != NULL && strncmp(cp, "tty", 3) == 0) { 118 cp = nextword(cp, word); 119 hl->l_tty = copyin(word, &sp); 120 } 121 if (cp != NULL) 122 hl->l_date = copyin(cp, &sp); 123} 124 125/* 126 * Copy the string on the left into the string on the right 127 * and bump the right (reference) string pointer by the length. 128 * Thus, dynamically allocate space in the right string, copying 129 * the left string into it. 130 */ 131char * 132copyin(char *src, char **space) 133{ 134 char *cp, *top; 135 136 top = cp = *space; 137 while ((*cp++ = *src++) != '\0') 138 ; 139 *space = cp; 140 return (top); 141} 142 143/* 144 * Test to see if the passed string is a ctime(3) generated 145 * date string as documented in the manual. The template 146 * below is used as the criterion of correctness. 147 * Also, we check for a possible trailing time zone using 148 * the tmztype template. 149 * 150 * If the mail file is created by Sys V (Solaris), there are 151 * no seconds in the time. If the mail is created by another 152 * program such as imapd, it might have timezone as 153 * <-|+>nnnn (-0800 for instance) at the end. 154 */ 155 156/* 157 * 'A' An upper case char 158 * 'a' A lower case char 159 * ' ' A space 160 * '0' A digit 161 * 'O' A digit or space 162 * 'p' A punctuation char 163 * 'P' A punctuation char or space 164 * ':' A colon 165 * 'N' A new line 166 */ 167 168static char *date_formats[] = { 169 "Aaa Aaa O0 00:00:00 0000", /* Mon Jan 01 23:59:59 2001 */ 170 "Aaa Aaa O0 00:00:00 AAA 0000", /* Mon Jan 01 23:59:59 PST 2001 */ 171 "Aaa Aaa O0 00:00:00 0000 p0000", /* Mon Jan 01 23:59:59 2001 -0800 */ 172 "Aaa Aaa O0 00:00 0000", /* Mon Jan 01 23:59 2001 */ 173 "Aaa Aaa O0 00:00 AAA 0000", /* Mon Jan 01 23:59 PST 2001 */ 174 "Aaa Aaa O0 00:00 0000 p0000", /* Mon Jan 01 23:59 2001 -0800 */ 175 NULL 176}; 177 178int 179isdate(char date[]) 180{ 181 int i; 182 183 for(i = 0; date_formats[i] != NULL; i++) { 184 if (cmatch(date, date_formats[i])) 185 return (1); 186 } 187 return (0); 188} 189 190/* 191 * Match the given string (cp) against the given template (tp). 192 * Return 1 if they match, 0 if they don't 193 */ 194int 195cmatch(char *cp, char *tp) 196{ 197 198 while (*cp != '\0' && *tp != '\0') 199 switch (*tp++) { 200 case 'a': 201 if (!islower((unsigned char)*cp++)) 202 return (0); 203 break; 204 case 'A': 205 if (!isupper((unsigned char)*cp++)) 206 return (0); 207 break; 208 case ' ': 209 if (*cp++ != ' ') 210 return (0); 211 break; 212 case '0': 213 if (!isdigit((unsigned char)*cp++)) 214 return (0); 215 break; 216 case 'O': 217 if (*cp != ' ' && !isdigit((unsigned char)*cp)) 218 return (0); 219 cp++; 220 break; 221 case 'p': 222 if (!ispunct((unsigned char)*cp++)) 223 return (0); 224 break; 225 case 'P': 226 if (*cp != ' ' && !ispunct((unsigned char)*cp)) 227 return (0); 228 cp++; 229 break; 230 case ':': 231 if (*cp++ != ':') 232 return (0); 233 break; 234 case 'N': 235 if (*cp++ != '\n') 236 return (0); 237 break; 238 } 239 if (*cp != '\0' || *tp != '\0') 240 return (0); 241 return (1); 242} 243 244/* 245 * Collect a liberal (space, tab delimited) word into the word buffer 246 * passed. Also, return a pointer to the next word following that, 247 * or NULL if none follow. 248 */ 249char * 250nextword(char *wp, char *wbuf) 251{ 252 int c; 253 254 if (wp == NULL) { 255 *wbuf = '\0'; 256 return (NULL); 257 } 258 while ((c = *wp++) != '\0' && c != ' ' && c != '\t') { 259 *wbuf++ = c; 260 if (c == '"') { 261 while ((c = *wp++) != '\0' && c != '"') 262 *wbuf++ = c; 263 if (c == '"') 264 *wbuf++ = c; 265 else 266 wp--; 267 } 268 } 269 *wbuf = '\0'; 270 for (; c == ' ' || c == '\t'; c = *wp++) 271 ; 272 if (c == '\0') 273 return (NULL); 274 return (wp - 1); 275} 276