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 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463
|
/*
* Copyright (C) 2015 Cisco Systems, Inc. and/or its affiliates. All rights reserved.
* Copyright (C) 2007-2013 Sourcefire, Inc.
*
* Authors: Nigel Horne
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*
* $Log: text.c,v $
* Revision 1.25 2007/02/12 20:46:09 njh
* Various tidy
*
* Revision 1.24 2006/09/13 20:53:50 njh
* Added debug
*
* Revision 1.23 2006/07/14 12:13:08 njh
* Typo
*
* Revision 1.22 2006/07/01 21:03:36 njh
* Better use of destroy mode
*
* Revision 1.21 2006/07/01 16:17:35 njh
* Added destroy flag
*
* Revision 1.20 2006/07/01 03:47:50 njh
* Don't loop if binhex runs out of memory
*
* Revision 1.19 2006/05/19 11:02:12 njh
* Just include mbox.h
*
* Revision 1.18 2006/05/04 10:37:03 nigelhorne
* Speed up scanning of clean files
*
* Revision 1.17 2006/05/03 09:36:40 nigelhorne
* Pass full ctx into the mbox code
*
* Revision 1.16 2006/04/09 19:59:28 kojm
* update GPL headers with new address for FSF
*
* Revision 1.15 2005/03/10 08:50:49 nigelhorne
* Tidy
*
* Revision 1.14 2005/01/19 05:31:55 nigelhorne
* Added textIterate
*
* Revision 1.13 2004/12/08 19:03:41 nigelhorne
* Fix compilation error on Solaris
*
* Revision 1.12 2004/12/04 16:03:55 nigelhorne
* Text/plain now handled as no encoding
*
* Revision 1.11 2004/11/27 21:54:26 nigelhorne
* Tidy
*
* Revision 1.10 2004/08/22 10:34:24 nigelhorne
* Use fileblob
*
* Revision 1.9 2004/08/21 11:57:57 nigelhorne
* Use line.[ch]
*
* Revision 1.8 2004/07/20 14:35:29 nigelhorne
* Some MYDOOM.I were getting through
*
* Revision 1.7 2004/06/22 04:08:02 nigelhorne
* Optimise empty lines
*
* Revision 1.6 2004/05/05 09:37:52 nigelhorne
* Removed textClean - not needed in clamAV
*
* Revision 1.5 2004/03/25 22:40:46 nigelhorne
* Removed even more calls to realloc and some duplicated code
*
* Revision 1.4 2004/02/26 13:26:34 nigelhorne
* Handle spaces at the end of uuencoded lines
*
*/
#if HAVE_CONFIG_H
#include "clamav-config.h"
#endif
#include <stdlib.h>
#ifdef C_DARWIN
#include <sys/types.h>
#include <sys/malloc.h>
#else
#ifdef HAVE_MALLOC_H /* tk: FreeBSD-CURRENT doesn't support malloc.h */
#ifndef C_BSD /* BSD now uses stdlib.h */
#include <malloc.h>
#endif
#endif
#endif
#include <string.h>
#include <ctype.h>
#include <assert.h>
#include <stdio.h>
#include "clamav.h"
#include "others.h"
#include "mbox.h"
static text *textCopy(const text *t_head);
static text *textAdd(text *t_head, const text *t);
static void addToFileblob(const line_t *line, void *arg);
static void getLength(const line_t *line, void *arg);
static void addToBlob(const line_t *line, void *arg);
static void *textIterate(text *t_text, void (*cb)(const line_t *line, void *arg), void *arg, int destroy);
void
textDestroy(text *t_head)
{
while(t_head) {
text *t_next = t_head->t_next;
if(t_head->t_line)
(void)lineUnlink(t_head->t_line);
free(t_head);
t_head = t_next;
}
}
/* Clone the current object */
static text *
textCopy(const text *t_head)
{
text *first = NULL, *last = NULL;
while(t_head) {
if(first == NULL)
last = first = (text *)cli_malloc(sizeof(text));
else {
last->t_next = (text *)cli_malloc(sizeof(text));
last = last->t_next;
}
if(last == NULL) {
cli_errmsg("textCopy: Unable to allocate memory to clone object\n");
if(first)
textDestroy(first);
return NULL;
}
if(t_head->t_line)
last->t_line = lineLink(t_head->t_line);
else
last->t_line = NULL;
t_head = t_head->t_next;
}
if(first)
last->t_next = NULL;
return first;
}
/* Add a copy of a text to the end of the current object */
static text *
textAdd(text *t_head, const text *t)
{
text *ret;
int count;
if(t_head == NULL) {
if(t == NULL) {
cli_errmsg("textAdd fails sanity check\n");
return NULL;
}
return textCopy(t);
}
if(t == NULL)
return t_head;
ret = t_head;
count = 0;
while(t_head->t_next) {
count++;
t_head = t_head->t_next;
}
cli_dbgmsg("textAdd: count = %d\n", count);
while(t) {
t_head->t_next = (text *)cli_malloc(sizeof(text));
t_head = t_head->t_next;
assert(t_head != NULL);
if(t->t_line)
t_head->t_line = lineLink(t->t_line);
else
t_head->t_line = NULL;
t = t->t_next;
}
t_head->t_next = NULL;
return ret;
}
/*
* Add a message's content to the end of the current object
*/
text *
textAddMessage(text *aText, message *aMessage)
{
assert(aMessage != NULL);
if(messageGetEncoding(aMessage) == NOENCODING)
return textAdd(aText, messageGetBody(aMessage));
else {
text *anotherText = messageToText(aMessage);
if(aText) {
text *newHead = textMove(aText, anotherText);
free(anotherText);
return newHead;
}
return anotherText;
}
}
/*
* Put the contents of the given text at the end of the current object.
* The given text emptied; it can be used again if needed, though be warned that
* it will have an empty line at the start.
*/
text *
textMove(text *t_head, text *t)
{
text *ret;
if(t_head == NULL) {
if(t == NULL) {
cli_errmsg("textMove fails sanity check\n");
return NULL;
}
t_head = (text *)cli_malloc(sizeof(text));
if(t_head == NULL) {
cli_errmsg("textMove: Unable to allocate memory for head\n");
return NULL;
}
t_head->t_line = t->t_line;
t_head->t_next = t->t_next;
t->t_line = NULL;
t->t_next = NULL;
return t_head;
}
if(t == NULL)
return t_head;
ret = t_head;
while(t_head->t_next)
t_head = t_head->t_next;
/*
* Move the first line manually so that the caller is left clean but
* empty, the rest is moved by a simple pointer reassignment
*/
t_head->t_next = (text *)cli_malloc(sizeof(text));
if(t_head->t_next == NULL) {
cli_errmsg("textMove: Unable to allocate memory for head->next\n");
return NULL;
}
t_head = t_head->t_next;
assert(t_head != NULL);
if(t->t_line) {
t_head->t_line = t->t_line;
t->t_line = NULL;
} else
t_head->t_line = NULL;
t_head->t_next = t->t_next;
t->t_next = NULL;
return ret;
}
/*
* Transfer the contents of the text into a blob
* The caller must free the returned blob if b is NULL
*/
blob *
textToBlob(text *t, blob *b, int destroy)
{
size_t s;
blob *bin;
if(t == NULL)
return NULL;
s = 0;
(void)textIterate(t, getLength, &s, 0);
if(s == 0)
return b;
/*
* copy b. If b is NULL and an error occurs we know we need to free
* before returning
*/
bin = b;
if(b == NULL) {
b = blobCreate();
if(b == NULL)
return NULL;
}
if(blobGrow(b, s) != CL_SUCCESS) {
cli_warnmsg("Couldn't grow the blob: we may be low on memory\n");
#if 0
if(!destroy) {
if(bin == NULL)
blobDestroy(b);
return NULL;
}
/*
* We may be able to recover enough memory as we destroy to
* create the blob
*/
#else
if(bin == NULL)
blobDestroy(b);
return NULL;
#endif
}
(void)textIterate(t, addToBlob, b, destroy);
if(destroy && t->t_next) {
textDestroy(t->t_next);
t->t_next = NULL;
}
blobClose(b);
return b;
}
fileblob *
textToFileblob(text *t, fileblob *fb, int destroy)
{
assert(fb != NULL);
assert(t != NULL);
if(fb == NULL) {
cli_dbgmsg("textToFileBlob, destroy = %d\n", destroy);
fb = fileblobCreate();
if(fb == NULL)
return NULL;
} else {
cli_dbgmsg("textToFileBlob to %s, destroy = %d\n",
fileblobGetFilename(fb), destroy);
fb->ctx = NULL; /* no need to scan */
}
fb = textIterate(t, addToFileblob, fb, destroy);
if(destroy && t->t_next) {
textDestroy(t->t_next);
t->t_next = NULL;
}
return fb;
}
static void
getLength(const line_t *line, void *arg)
{
size_t *length = (size_t *)arg;
if(line)
*length += strlen(lineGetData(line)) + 1;
else
(*length)++;
}
static void
addToBlob(const line_t *line, void *arg)
{
blob *b = (blob *)arg;
if(line) {
const char *l = lineGetData(line);
blobAddData(b, (const unsigned char *)l, strlen(l));
}
blobAddData(b, (const unsigned char *)"\n", 1);
}
static void
addToFileblob(const line_t *line, void *arg)
{
fileblob *fb = (fileblob *)arg;
if(line) {
const char *l = lineGetData(line);
fileblobAddData(fb, (const unsigned char *)l, strlen(l));
}
fileblobAddData(fb, (const unsigned char *)"\n", 1);
}
static void *
textIterate(text *t_text, void (*cb)(const line_t *item, void *arg), void *arg, int destroy)
{
/*
* Have two loops rather than one, so that we're not checking the
* value of "destroy" lots and lots of times
*/
#if 0
while(t_text) {
(*cb)(t_text->t_line, arg);
if(destroy && t_text->t_line) {
lineUnlink(t_text->t_line);
t_text->t_line = NULL;
}
t_text = t_text->t_next;
}
#else
if(destroy)
while(t_text) {
(*cb)(t_text->t_line, arg);
if(t_text->t_line) {
lineUnlink(t_text->t_line);
t_text->t_line = NULL;
}
t_text = t_text->t_next;
}
else
while(t_text) {
(*cb)(t_text->t_line, arg);
t_text = t_text->t_next;
}
#endif
return arg;
}
|