src/mime_header.cc

   1
   2 /*
   3  * $Id$
   4  *
   5  * DEBUG: section 25    MiME Header Parsing
   6  * AUTHOR: Harvest Derived
   7  *
   8  * SQUID Web Proxy Cache          http://www.squid-cache.org/
   9  * ----------------------------------------------------------
  10  *
  11  *  Squid is the result of efforts by numerous individuals from
  12  *  the Internet community; see the CONTRIBUTORS file for full
  13  *  details.   Many organizations have provided support for Squid's
  14  *  development; see the SPONSORS file for full details.  Squid is
  15  *  Copyrighted (C) 2001 by the Regents of the University of
  16  *  California; see the COPYRIGHT file for full details.  Squid
  17  *  incorporates software developed and/or copyrighted by other
  18  *  sources; see the CREDITS file for full details.
  19  *
  20  *  This program is free software; you can redistribute it and/or modify
  21  *  it under the terms of the GNU General Public License as published by
  22  *  the Free Software Foundation; either version 2 of the License, or
  23  *  (at your option) any later version.
  24  *
  25  *  This program is distributed in the hope that it will be useful,
  26  *  but WITHOUT ANY WARRANTY; without even the implied warranty of
  27  *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  28  *  GNU General Public License for more details.
  29  *
  30  *  You should have received a copy of the GNU General Public License
  31  *  along with this program; if not, write to the Free Software
  32  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
  33  *
  34  */
  35
  36 #include "squid.h"
  37
  38 #define GET_HDR_SZ 1024
  39 #include "Debug.h"
  40 #include "profiler/Profiler.h"
  41
  42 /*
  43  * returns a pointer to a field-value of the first matching field-name where
  44  * field-value matches prefix if any
  45  */
  46 char *
  47 mime_get_header_field(const char *mime, const char *name, const char *prefix)
  48 {
  49     LOCAL_ARRAY(char, header, GET_HDR_SZ);
  50     const char *p = NULL;
  51     char *q = NULL;
  52     char got = 0;
  53     const int namelen = name ? strlen(name) : 0;
  54     const int preflen = prefix ? strlen(prefix) : 0;
  55     int l;
  56
  57     if (NULL == mime)
  58         return NULL;
  59
  60     assert(NULL != name);
  61
  62     debugs(25, 5, "mime_get_header: looking for '" << name << "'");
  63
  64     for (p = mime; *p; p += strcspn(p, "\n\r")) {
  65         if (strcmp(p, "\r\n\r\n") == 0 || strcmp(p, "\n\n") == 0)
  66             return NULL;
  67
  68         while (xisspace(*p))
  69             ++p;
  70
  71         if (strncasecmp(p, name, namelen))
  72             continue;
  73
  74         if (!xisspace(p[namelen]) && p[namelen] != ':')
  75             continue;
  76
  77         l = strcspn(p, "\n\r") + 1;
  78
  79         if (l > GET_HDR_SZ)
  80             l = GET_HDR_SZ;
  81
  82         xstrncpy(header, p, l);
  83
  84         debugs(25, 5, "mime_get_header: checking '" << header << "'");
  85
  86         q = header;
  87
  88         q += namelen;
  89
  90         if (*q == ':') {
  91             ++q;
  92             got = 1;
  93         }
  94
  95         while (xisspace(*q)) {
  96             ++q;
  97             got = 1;
  98         }
  99
 100         if (got && prefix) {
 101             /* we could process list entries here if we had strcasestr(). */
 102             /* make sure we did not match a part of another field-value */
 103             got = !strncasecmp(q, prefix, preflen) && !xisalpha(q[preflen]);
 104         }
 105
 106         if (got) {
 107             debugs(25, 5, "mime_get_header: returning '" << q << "'");
 108             return q;
 109         }
 110     }
 111
 112     return NULL;
 113 }
 114
 115 /* returns a pointer to a field-value of the first matching field-name */
 116 char *
 117 mime_get_header(const char *mime, const char *name)
 118 {
 119     return mime_get_header_field(mime, name, NULL);
 120 }
 121
 122 size_t
 123 headersEnd(const char *mime, size_t l)
 124 {
 125     size_t e = 0;
 126     int state = 1;
 127
 128     PROF_start(headersEnd);
 129
 130     while (e < l && state < 3) {
 131         switch (state) {
 132
 133         case 0:
 134
 135             if ('\n' == mime[e])
 136                 state = 1;
 137
 138             break;
 139
 140         case 1:
 141             if ('\r' == mime[e])
 142                 state = 2;
 143             else if ('\n' == mime[e])
 144                 state = 3;
 145             else
 146                 state = 0;
 147
 148             break;
 149
 150         case 2:
 151             if ('\n' == mime[e])
 152                 state = 3;
 153             else
 154                 state = 0;
 155
 156             break;
 157
 158         default:
 159             break;
 160         }
 161
 162         ++e;
 163     }
 164     PROF_stop(headersEnd);
 165
 166     if (3 == state)
 167         return e;
 168
 169     return 0;
 170 }