1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292
|
/*
* Read MIME body-part, stopping on boundaries.
*/
/* (C) Copyright 1994 by Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify, distribute, and sell this software
* and its documentation for any purpose is hereby granted without
* fee, provided that the above copyright notice appear in all copies
* and that both that copyright notice and this permission notice
* appear in supporting documentation, and that the name of Carnegie
* Mellon University not be used in advertising or publicity
* pertaining to distribution of the software without specific,
* written prior permission. Carnegie Mellon University makes no
* representations about the suitability of this software for any
* purpose. It is provided "as is" without express or implied
* warranty.
*
* CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
* THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE
* FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN
* AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
* OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
* SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "part.h"
#include "xmalloc.h"
#define BUFSIZE 1024 /* must be > PART_MAX_BOUNDARY_LEN */
#define GROWBOUNDARY 20
static int pendingboundary(struct part *part);
/*
* Create, initialize, and return a new struct part pointer
* for the input file 'infile'.
*/
struct part *part_init(FILE *infile)
{
static struct part zeropart;
struct part *newpart;
newpart = (struct part *)xmalloc(sizeof(struct part));
*newpart = zeropart;
newpart->infile = infile;
newpart->buf = (unsigned char *)xmalloc(BUFSIZE);
newpart->buf_alloc = BUFSIZE;
return newpart;
}
/*
* Close and free 'part'.
*/
void part_close(struct part *part)
{
fclose(part->infile);
if (part->buf) free(part->buf);
if (part->boundary) free(part->boundary);
}
/*
* Return the multipart depth of 'part'. Top-level is '0'.
*/
int
part_depth(struct part *part)
{
return part->boundary_num;
}
/*
* Add to 'part' the multipart boundary 'boundary'.
*/
void part_addboundary(struct part *part, char *boundary)
{
/* Grow boundary array if necessary */
if (part->boundary_num == part->boundary_alloc) {
part->boundary_alloc += GROWBOUNDARY;
part->boundary = (char (*)[PART_MAX_BOUNDARY_LEN+1])
xrealloc((char *)part->boundary,
part->boundary_alloc * (PART_MAX_BOUNDARY_LEN+1));
part->boundary_length = (int *)
xrealloc((char *)part->boundary_length,
part->boundary_alloc * sizeof(int));
}
strncpy(part->boundary[part->boundary_num], boundary,
PART_MAX_BOUNDARY_LEN);
part->boundary[part->boundary_num][PART_MAX_BOUNDARY_LEN] = '\0';
part->boundary_length[part->boundary_num] =
strlen(part->boundary[part->boundary_num]);
part->boundary_num++;
if (part->boundary_seen+1 == part->boundary_num) {
part->boundary_seen++;
}
}
/*
* Private function that is only called from the part_getc() macro.
*
* Fills the input buffer for 'part' if necessary. Returns the next
* input character or EOF if at a boundary or end of file.
*/
int
part_fill(struct part *part)
{
/* part_getc() decremented this before calling us, put it back */
part->cnt++;
/* Return EOF if we saw a boundary */
if (part->boundary_seen < part->boundary_num) return EOF;
/* Fill buffer if it is empty */
if (part->cnt == 0) {
part->ptr = part->buf;
part->cnt = fread(part->buf, 1, part->buf_alloc, part->infile);
if (part->cnt == 0) {
part->boundary_seen = 0;
return EOF;
}
}
/* If there is a newline, see if it is followed by a boundary */
if (part->ptr[0] == '\n' && pendingboundary(part)) {
return EOF;
}
part->cnt--;
return *part->ptr++;
}
/*
* Read a line into the array 's', of size 'n', from 'part'.
* Reads until 'n'-1 characters are read, a newline is read, or
* an EOF is encountered. The array is then nul-terminated and returned.
* If the first character read is an EOF, then a null pointer is instead
* returned.
*/
char *
part_gets(char *s, int n, struct part *part)
{
int c;
char *p = s;
if (n == 0) return 0;
n--;
while (n-- && (c = part_getc(part)) != EOF) {
*p++ = c;
if (c == '\n') break;
}
if (p == s) return 0;
*p++ = '\0';
return s;
}
/*
* Push back the string 's' into the input buffer of 'part'.
* Leaves room in the input buffer to push back an additional single
* character using the prot_ungetc() macro.
*/
void part_ungets(char *s, struct part *part)
{
int len = strlen(s);
int i;
/* Grow buffer if necessary */
if (part->cnt + len + 1 > part->buf_alloc) {
i = part->ptr - part->buf;
part->buf_alloc = part->cnt + len + 1;
part->buf = (unsigned char *)
xrealloc((char *)part->buf, part->buf_alloc);
part->ptr = part->buf + i;
}
/* Move current data down to make room for new data if necessary */
if (len + 1 > part->ptr - part->buf) {
for (i = part->cnt-1; i >= 0; i--) {
part->buf[len+1+i] = part->ptr[i];
}
part->ptr = part->buf + len + 1;
}
/* Copy in the new data */
part->ptr -= len;
part->cnt += len;
for (i = 0; i < len; i++) {
part->ptr[i] = s[i];
}
}
/*
* Reset the saw-boundary state of 'part' and set up to read next
* body-part Returns nonzero iff the pending boundary was a final
* boundary of the current multipart.
*/
int
part_readboundary(struct part *part)
{
int c;
int sawfinal = 0;
if (part->boundary_seen < part->boundary_num-1) {
/* We saw an enclosing boundary. Signal end of multipart, but
* don't skip over the boundary.
*/
part->boundary_num--;
return 1;
}
/* Deal with EOF on input stream */
if (part->cnt == 0) return 1;
/* Skip over delimiter, reset the "saw boundary" state */
part->ptr += part->boundary_length[part->boundary_seen] + 3;
part->cnt -= part->boundary_length[part->boundary_seen] + 3;
part->boundary_seen = part->boundary_num;
/* Check for two dashes, which indicate a final delimiter */
c = part_getc(part);
if (c == '-') {
c = part_getc(part);
if (c == '-') {
sawfinal = 1;
part->boundary_num--;
}
}
/* Eat rest of the boundary line */
while (c != '\n' && c != EOF) {
c = part_getc(part);
}
return sawfinal;
}
/*
* Return nonzero and set the saw-boundary state iff 'part'
* is positioned at a boundary.
*/
static int
pendingboundary(struct part *part)
{
int bufleft;
int i;
/* Fill buffer if we don't have enough to do our look ahead */
if (part->cnt < 3 ||
(part->cnt < PART_MAX_BOUNDARY_LEN+3 && part->ptr[1] == '-' &&
part->ptr[2] == '-')) {
bufleft = part->buf_alloc - part->cnt - (part->ptr - part->buf);
/* If not enough room, move everything to beginning of buffer */
if (part->ptr!=part->buf && bufleft + part->cnt < PART_MAX_BOUNDARY_LEN+3) {
for (i = 0; i < part->cnt; i++) {
part->buf[i] = part->ptr[i];
}
part->ptr = part->buf;
bufleft = part->buf_alloc - part->cnt;
}
/* Read in more data */
part->cnt += fread(part->ptr+part->cnt, 1, bufleft, part->infile);
}
/* If no "--", it's not a boundary */
if (part->cnt < 3 || part->ptr[1] != '-' || part->ptr[2] != '-') {
return 0;
}
for (i = 0; i < part->boundary_num; i++) {
if (part->cnt - 3 >= part->boundary_length[i] &&
!strncmp((char *)part->ptr+3, part->boundary[i],
part->boundary_length[i])) {
break;
}
}
if (i == part->boundary_num) return 0;
/* Saw boundary, index 'i' */
part->boundary_seen = i;
return 1;
}
|