1 /* $NetBSD: apprentice.c,v 1.5 2011/09/16 21:06:26 christos Exp $ */ 2 3 /* 4 * Copyright (c) Ian F. Darwin 1986-1995. 5 * Software written by Ian F. Darwin and others; 6 * maintained 1995-present by Christos Zoulas and others. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice immediately at the beginning of the file, without modification, 13 * this list of conditions, and the following disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR 22 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 */ 30 /* 31 * apprentice - make one pass through /etc/magic, learning its secrets. 32 */ 33 34 #include "file.h" 35 36 #ifndef lint 37 #if 0 38 FILE_RCSID("@(#)$File: apprentice.c,v 1.170 2011/06/10 09:23:28 christos Exp $") 39 #else 40 __RCSID("$NetBSD: apprentice.c,v 1.5 2011/09/16 21:06:26 christos Exp $"); 41 #endif 42 #endif /* lint */ 43 44 #include "magic.h" 45 #include <stdlib.h> 46 #ifdef HAVE_UNISTD_H 47 #include <unistd.h> 48 #endif 49 #include <string.h> 50 #include <assert.h> 51 #include <ctype.h> 52 #include <fcntl.h> 53 #ifdef QUICK 54 #include <sys/mman.h> 55 #endif 56 #include <dirent.h> 57 58 #define EATAB {while (isascii((unsigned char) *l) && \ 59 isspace((unsigned char) *l)) ++l;} 60 #define LOWCASE(l) (isupper((unsigned char) (l)) ? \ 61 tolower((unsigned char) (l)) : (l)) 62 /* 63 * Work around a bug in headers on Digital Unix. 64 * At least confirmed for: OSF1 V4.0 878 65 */ 66 #if defined(__osf__) && defined(__DECC) 67 #ifdef MAP_FAILED 68 #undef MAP_FAILED 69 #endif 70 #endif 71 72 #ifndef MAP_FAILED 73 #define MAP_FAILED (void *) -1 74 #endif 75 76 #ifndef MAP_FILE 77 #define MAP_FILE 0 78 #endif 79 80 struct magic_entry { 81 struct magic *mp; 82 uint32_t cont_count; 83 uint32_t max_count; 84 }; 85 86 int file_formats[FILE_NAMES_SIZE]; 87 const size_t file_nformats = FILE_NAMES_SIZE; 88 const char *file_names[FILE_NAMES_SIZE]; 89 const size_t file_nnames = FILE_NAMES_SIZE; 90 91 private int getvalue(struct magic_set *ms, struct magic *, const char **, int); 92 private int hextoint(int); 93 private const char *getstr(struct magic_set *, struct magic *, const char *, 94 int); 95 private int parse(struct magic_set *, struct magic_entry **, uint32_t *, 96 const char *, size_t, int); 97 private void eatsize(const char **); 98 private int apprentice_1(struct magic_set *, const char *, int, struct mlist *); 99 private size_t apprentice_magic_strength(const struct magic *); 100 private int apprentice_sort(const void *, const void *); 101 private void apprentice_list(struct mlist *, int ); 102 private int apprentice_load(struct magic_set *, struct magic **, uint32_t *, 103 const char *, int); 104 private void byteswap(struct magic *, uint32_t); 105 private void bs1(struct magic *); 106 private uint16_t swap2(uint16_t); 107 private uint32_t swap4(uint32_t); 108 private uint64_t swap8(uint64_t); 109 private char *mkdbname(struct magic_set *, const char *, int); 110 private int apprentice_map(struct magic_set *, struct magic **, uint32_t *, 111 const char *); 112 private int apprentice_compile(struct magic_set *, struct magic **, uint32_t *, 113 const char *); 114 private int check_format_type(const char *, int); 115 private int check_format(struct magic_set *, struct magic *); 116 private int get_op(char); 117 private int parse_mime(struct magic_set *, struct magic_entry *, const char *); 118 private int parse_strength(struct magic_set *, struct magic_entry *, const char *); 119 private int parse_apple(struct magic_set *, struct magic_entry *, const char *); 120 121 122 private size_t maxmagic = 0; 123 private size_t magicsize = sizeof(struct magic); 124 125 private const char usg_hdr[] = "cont\toffset\ttype\topcode\tmask\tvalue\tdesc"; 126 127 private struct { 128 const char *name; 129 size_t len; 130 int (*fun)(struct magic_set *, struct magic_entry *, const char *); 131 } bang[] = { 132 #define DECLARE_FIELD(name) { # name, sizeof(# name) - 1, parse_ ## name } 133 DECLARE_FIELD(mime), 134 DECLARE_FIELD(apple), 135 DECLARE_FIELD(strength), 136 #undef DECLARE_FIELD 137 { NULL, 0, NULL } 138 }; 139 140 #ifdef COMPILE_ONLY 141 142 int main(int, char *[]); 143 144 int 145 main(int argc, char *argv[]) 146 { 147 int ret; 148 struct magic_set *ms; 149 char *progname; 150 151 if ((progname = strrchr(argv[0], '/')) != NULL) 152 progname++; 153 else 154 progname = argv[0]; 155 156 if (argc != 2) { 157 (void)fprintf(stderr, "Usage: %s file\n", progname); 158 return 1; 159 } 160 161 if ((ms = magic_open(MAGIC_CHECK)) == NULL) { 162 (void)fprintf(stderr, "%s: %s\n", progname, strerror(errno)); 163 return 1; 164 } 165 ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0; 166 if (ret == 1) 167 (void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms)); 168 magic_close(ms); 169 return ret; 170 } 171 #endif /* COMPILE_ONLY */ 172 173 static const struct type_tbl_s { 174 const char name[16]; 175 const size_t len; 176 const int type; 177 const int format; 178 } type_tbl[] = { 179 # define XX(s) s, (sizeof(s) - 1) 180 # define XX_NULL "", 0 181 { XX("byte"), FILE_BYTE, FILE_FMT_NUM }, 182 { XX("short"), FILE_SHORT, FILE_FMT_NUM }, 183 { XX("default"), FILE_DEFAULT, FILE_FMT_STR }, 184 { XX("long"), FILE_LONG, FILE_FMT_NUM }, 185 { XX("string"), FILE_STRING, FILE_FMT_STR }, 186 { XX("date"), FILE_DATE, FILE_FMT_STR }, 187 { XX("beshort"), FILE_BESHORT, FILE_FMT_NUM }, 188 { XX("belong"), FILE_BELONG, FILE_FMT_NUM }, 189 { XX("bedate"), FILE_BEDATE, FILE_FMT_STR }, 190 { XX("leshort"), FILE_LESHORT, FILE_FMT_NUM }, 191 { XX("lelong"), FILE_LELONG, FILE_FMT_NUM }, 192 { XX("ledate"), FILE_LEDATE, FILE_FMT_STR }, 193 { XX("pstring"), FILE_PSTRING, FILE_FMT_STR }, 194 { XX("ldate"), FILE_LDATE, FILE_FMT_STR }, 195 { XX("beldate"), FILE_BELDATE, FILE_FMT_STR }, 196 { XX("leldate"), FILE_LELDATE, FILE_FMT_STR }, 197 { XX("regex"), FILE_REGEX, FILE_FMT_STR }, 198 { XX("bestring16"), FILE_BESTRING16, FILE_FMT_STR }, 199 { XX("lestring16"), FILE_LESTRING16, FILE_FMT_STR }, 200 { XX("search"), FILE_SEARCH, FILE_FMT_STR }, 201 { XX("medate"), FILE_MEDATE, FILE_FMT_STR }, 202 { XX("meldate"), FILE_MELDATE, FILE_FMT_STR }, 203 { XX("melong"), FILE_MELONG, FILE_FMT_NUM }, 204 { XX("quad"), FILE_QUAD, FILE_FMT_QUAD }, 205 { XX("lequad"), FILE_LEQUAD, FILE_FMT_QUAD }, 206 { XX("bequad"), FILE_BEQUAD, FILE_FMT_QUAD }, 207 { XX("qdate"), FILE_QDATE, FILE_FMT_STR }, 208 { XX("leqdate"), FILE_LEQDATE, FILE_FMT_STR }, 209 { XX("beqdate"), FILE_BEQDATE, FILE_FMT_STR }, 210 { XX("qldate"), FILE_QLDATE, FILE_FMT_STR }, 211 { XX("leqldate"), FILE_LEQLDATE, FILE_FMT_STR }, 212 { XX("beqldate"), FILE_BEQLDATE, FILE_FMT_STR }, 213 { XX("float"), FILE_FLOAT, FILE_FMT_FLOAT }, 214 { XX("befloat"), FILE_BEFLOAT, FILE_FMT_FLOAT }, 215 { XX("lefloat"), FILE_LEFLOAT, FILE_FMT_FLOAT }, 216 { XX("double"), FILE_DOUBLE, FILE_FMT_DOUBLE }, 217 { XX("bedouble"), FILE_BEDOUBLE, FILE_FMT_DOUBLE }, 218 { XX("ledouble"), FILE_LEDOUBLE, FILE_FMT_DOUBLE }, 219 { XX("leid3"), FILE_LEID3, FILE_FMT_NUM }, 220 { XX("beid3"), FILE_BEID3, FILE_FMT_NUM }, 221 { XX("indirect"), FILE_INDIRECT, FILE_FMT_NONE }, 222 { XX_NULL, FILE_INVALID, FILE_FMT_NONE }, 223 # undef XX 224 # undef XX_NULL 225 }; 226 227 private int 228 get_type(const char *l, const char **t) 229 { 230 const struct type_tbl_s *p; 231 232 for (p = type_tbl; p->len; p++) { 233 if (strncmp(l, p->name, p->len) == 0) { 234 if (t) 235 *t = l + p->len; 236 break; 237 } 238 } 239 return p->type; 240 } 241 242 private void 243 init_file_tables(void) 244 { 245 static int done = 0; 246 const struct type_tbl_s *p; 247 248 if (done) 249 return; 250 done++; 251 252 for (p = type_tbl; p->len; p++) { 253 assert(p->type < FILE_NAMES_SIZE); 254 file_names[p->type] = p->name; 255 file_formats[p->type] = p->format; 256 } 257 } 258 259 /* 260 * Handle one file or directory. 261 */ 262 private int 263 apprentice_1(struct magic_set *ms, const char *fn, int action, 264 struct mlist *mlist) 265 { 266 struct magic *magic = NULL; 267 uint32_t nmagic = 0; 268 struct mlist *ml; 269 int rv = -1; 270 int mapped; 271 272 if (magicsize != FILE_MAGICSIZE) { 273 file_error(ms, 0, "magic element size %lu != %lu", 274 (unsigned long)sizeof(*magic), 275 (unsigned long)FILE_MAGICSIZE); 276 return -1; 277 } 278 279 if (action == FILE_COMPILE) { 280 rv = apprentice_load(ms, &magic, &nmagic, fn, action); 281 if (rv != 0) 282 return -1; 283 rv = apprentice_compile(ms, &magic, &nmagic, fn); 284 free(magic); 285 return rv; 286 } 287 288 #ifndef COMPILE_ONLY 289 if ((rv = apprentice_map(ms, &magic, &nmagic, fn)) == -1) { 290 if (ms->flags & MAGIC_CHECK) 291 file_magwarn(ms, "using regular magic file `%s'", fn); 292 rv = apprentice_load(ms, &magic, &nmagic, fn, action); 293 if (rv != 0) 294 return -1; 295 } 296 297 mapped = rv; 298 299 if (magic == NULL) { 300 file_delmagic(magic, mapped, nmagic); 301 return -1; 302 } 303 304 if ((ml = CAST(struct mlist *, malloc(sizeof(*ml)))) == NULL) { 305 file_delmagic(magic, mapped, nmagic); 306 file_oomem(ms, sizeof(*ml)); 307 return -1; 308 } 309 310 ml->magic = magic; 311 ml->nmagic = nmagic; 312 ml->mapped = mapped; 313 314 mlist->prev->next = ml; 315 ml->prev = mlist->prev; 316 ml->next = mlist; 317 mlist->prev = ml; 318 319 if (action == FILE_LIST) { 320 printf("Binary patterns:\n"); 321 apprentice_list(mlist, BINTEST); 322 printf("Text patterns:\n"); 323 apprentice_list(mlist, TEXTTEST); 324 } 325 326 return 0; 327 #endif /* COMPILE_ONLY */ 328 } 329 330 protected void 331 file_delmagic(struct magic *p, int type, size_t entries) 332 { 333 if (p == NULL) 334 return; 335 switch (type) { 336 case 2: 337 #ifdef QUICK 338 p--; 339 (void)munmap((void *)p, sizeof(*p) * (entries + 1)); 340 break; 341 #else 342 (void)&entries; 343 abort(); 344 /*NOTREACHED*/ 345 #endif 346 case 1: 347 p--; 348 /*FALLTHROUGH*/ 349 case 0: 350 free(p); 351 break; 352 default: 353 abort(); 354 } 355 } 356 357 /* const char *fn: list of magic files and directories */ 358 protected struct mlist * 359 file_apprentice(struct magic_set *ms, const char *fn, int action) 360 { 361 char *p, *mfn; 362 int file_err, errs = -1; 363 struct mlist *mlist; 364 365 if ((fn = magic_getpath(fn, action)) == NULL) 366 return NULL; 367 368 init_file_tables(); 369 370 if ((mfn = strdup(fn)) == NULL) { 371 file_oomem(ms, strlen(fn)); 372 return NULL; 373 } 374 fn = mfn; 375 376 if ((mlist = CAST(struct mlist *, malloc(sizeof(*mlist)))) == NULL) { 377 free(mfn); 378 file_oomem(ms, sizeof(*mlist)); 379 return NULL; 380 } 381 mlist->next = mlist->prev = mlist; 382 383 while (fn) { 384 p = strchr(fn, PATHSEP); 385 if (p) 386 *p++ = '\0'; 387 if (*fn == '\0') 388 break; 389 file_err = apprentice_1(ms, fn, action, mlist); 390 errs = MAX(errs, file_err); 391 fn = p; 392 } 393 if (errs == -1) { 394 free(mfn); 395 free(mlist); 396 mlist = NULL; 397 file_error(ms, 0, "could not find any magic files!"); 398 return NULL; 399 } 400 free(mfn); 401 return mlist; 402 } 403 404 /* 405 * Get weight of this magic entry, for sorting purposes. 406 */ 407 private size_t 408 apprentice_magic_strength(const struct magic *m) 409 { 410 #define MULT 10 411 size_t val = 2 * MULT; /* baseline strength */ 412 413 switch (m->type) { 414 case FILE_DEFAULT: /* make sure this sorts last */ 415 if (m->factor_op != FILE_FACTOR_OP_NONE) 416 abort(); 417 return 0; 418 419 case FILE_BYTE: 420 val += 1 * MULT; 421 break; 422 423 case FILE_SHORT: 424 case FILE_LESHORT: 425 case FILE_BESHORT: 426 val += 2 * MULT; 427 break; 428 429 case FILE_LONG: 430 case FILE_LELONG: 431 case FILE_BELONG: 432 case FILE_MELONG: 433 val += 4 * MULT; 434 break; 435 436 case FILE_PSTRING: 437 case FILE_STRING: 438 val += m->vallen * MULT; 439 break; 440 441 case FILE_BESTRING16: 442 case FILE_LESTRING16: 443 val += m->vallen * MULT / 2; 444 break; 445 446 case FILE_SEARCH: 447 case FILE_REGEX: 448 val += m->vallen * MAX(MULT / m->vallen, 1); 449 break; 450 451 case FILE_DATE: 452 case FILE_LEDATE: 453 case FILE_BEDATE: 454 case FILE_MEDATE: 455 case FILE_LDATE: 456 case FILE_LELDATE: 457 case FILE_BELDATE: 458 case FILE_MELDATE: 459 case FILE_FLOAT: 460 case FILE_BEFLOAT: 461 case FILE_LEFLOAT: 462 val += 4 * MULT; 463 break; 464 465 case FILE_QUAD: 466 case FILE_BEQUAD: 467 case FILE_LEQUAD: 468 case FILE_QDATE: 469 case FILE_LEQDATE: 470 case FILE_BEQDATE: 471 case FILE_QLDATE: 472 case FILE_LEQLDATE: 473 case FILE_BEQLDATE: 474 case FILE_DOUBLE: 475 case FILE_BEDOUBLE: 476 case FILE_LEDOUBLE: 477 val += 8 * MULT; 478 break; 479 480 default: 481 val = 0; 482 (void)fprintf(stderr, "Bad type %d\n", m->type); 483 abort(); 484 } 485 486 switch (m->reln) { 487 case 'x': /* matches anything penalize */ 488 case '!': /* matches almost anything penalize */ 489 val = 0; 490 break; 491 492 case '=': /* Exact match, prefer */ 493 val += MULT; 494 break; 495 496 case '>': 497 case '<': /* comparison match reduce strength */ 498 val -= 2 * MULT; 499 break; 500 501 case '^': 502 case '&': /* masking bits, we could count them too */ 503 val -= MULT; 504 break; 505 506 default: 507 (void)fprintf(stderr, "Bad relation %c\n", m->reln); 508 abort(); 509 } 510 511 if (val == 0) /* ensure we only return 0 for FILE_DEFAULT */ 512 val = 1; 513 514 switch (m->factor_op) { 515 case FILE_FACTOR_OP_NONE: 516 break; 517 case FILE_FACTOR_OP_PLUS: 518 val += m->factor; 519 break; 520 case FILE_FACTOR_OP_MINUS: 521 val -= m->factor; 522 break; 523 case FILE_FACTOR_OP_TIMES: 524 val *= m->factor; 525 break; 526 case FILE_FACTOR_OP_DIV: 527 val /= m->factor; 528 break; 529 default: 530 abort(); 531 } 532 533 /* 534 * Magic entries with no description get a bonus because they depend 535 * on subsequent magic entries to print something. 536 */ 537 if (m->desc[0] == '\0') 538 val++; 539 return val; 540 } 541 542 /* 543 * Sort callback for sorting entries by "strength" (basically length) 544 */ 545 private int 546 apprentice_sort(const void *a, const void *b) 547 { 548 const struct magic_entry *ma = CAST(const struct magic_entry *, a); 549 const struct magic_entry *mb = CAST(const struct magic_entry *, b); 550 size_t sa = apprentice_magic_strength(ma->mp); 551 size_t sb = apprentice_magic_strength(mb->mp); 552 if (sa == sb) 553 return 0; 554 else if (sa > sb) 555 return -1; 556 else 557 return 1; 558 } 559 560 /* 561 * Shows sorted patterns list in the order which is used for the matching 562 */ 563 private void 564 apprentice_list(struct mlist *mlist, int mode) 565 { 566 uint32_t magindex = 0; 567 struct mlist *ml; 568 for (ml = mlist->next; ml != mlist; ml = ml->next) { 569 for (magindex = 0; magindex < ml->nmagic; magindex++) { 570 struct magic *m = &ml->magic[magindex]; 571 if ((m->flag & mode) != mode) { 572 /* Skip sub-tests */ 573 while (magindex + 1 < ml->nmagic && 574 ml->magic[magindex + 1].cont_level != 0) 575 ++magindex; 576 continue; /* Skip to next top-level test*/ 577 } 578 579 /* 580 * Try to iterate over the tree until we find item with 581 * description/mimetype. 582 */ 583 while (magindex + 1 < ml->nmagic && 584 ml->magic[magindex + 1].cont_level != 0 && 585 *ml->magic[magindex].desc == '\0' && 586 *ml->magic[magindex].mimetype == '\0') 587 magindex++; 588 589 printf("Strength = %3" SIZE_T_FORMAT "u : %s [%s]\n", 590 apprentice_magic_strength(m), 591 ml->magic[magindex].desc, 592 ml->magic[magindex].mimetype); 593 } 594 } 595 } 596 597 private void 598 set_test_type(struct magic *mstart, struct magic *m) 599 { 600 switch (m->type) { 601 case FILE_BYTE: 602 case FILE_SHORT: 603 case FILE_LONG: 604 case FILE_DATE: 605 case FILE_BESHORT: 606 case FILE_BELONG: 607 case FILE_BEDATE: 608 case FILE_LESHORT: 609 case FILE_LELONG: 610 case FILE_LEDATE: 611 case FILE_LDATE: 612 case FILE_BELDATE: 613 case FILE_LELDATE: 614 case FILE_MEDATE: 615 case FILE_MELDATE: 616 case FILE_MELONG: 617 case FILE_QUAD: 618 case FILE_LEQUAD: 619 case FILE_BEQUAD: 620 case FILE_QDATE: 621 case FILE_LEQDATE: 622 case FILE_BEQDATE: 623 case FILE_QLDATE: 624 case FILE_LEQLDATE: 625 case FILE_BEQLDATE: 626 case FILE_FLOAT: 627 case FILE_BEFLOAT: 628 case FILE_LEFLOAT: 629 case FILE_DOUBLE: 630 case FILE_BEDOUBLE: 631 case FILE_LEDOUBLE: 632 mstart->flag |= BINTEST; 633 break; 634 case FILE_STRING: 635 case FILE_PSTRING: 636 case FILE_BESTRING16: 637 case FILE_LESTRING16: 638 /* Allow text overrides */ 639 if (mstart->str_flags & STRING_TEXTTEST) 640 mstart->flag |= TEXTTEST; 641 else 642 mstart->flag |= BINTEST; 643 break; 644 case FILE_REGEX: 645 case FILE_SEARCH: 646 /* Check for override */ 647 if (mstart->str_flags & STRING_BINTEST) 648 mstart->flag |= BINTEST; 649 if (mstart->str_flags & STRING_TEXTTEST) 650 mstart->flag |= TEXTTEST; 651 652 if (mstart->flag & (TEXTTEST|BINTEST)) 653 break; 654 655 /* binary test if pattern is not text */ 656 if (file_looks_utf8(m->value.us, (size_t)m->vallen, NULL, 657 NULL) <= 0) 658 mstart->flag |= BINTEST; 659 else 660 mstart->flag |= TEXTTEST; 661 break; 662 case FILE_DEFAULT: 663 /* can't deduce anything; we shouldn't see this at the 664 top level anyway */ 665 break; 666 case FILE_INVALID: 667 default: 668 /* invalid search type, but no need to complain here */ 669 break; 670 } 671 } 672 673 /* 674 * Load and parse one file. 675 */ 676 private void 677 load_1(struct magic_set *ms, int action, const char *fn, int *errs, 678 struct magic_entry **marray, uint32_t *marraycount) 679 { 680 size_t lineno = 0, llen = 0; 681 char *line = NULL; 682 ssize_t len; 683 684 FILE *f = fopen(ms->file = fn, "r"); 685 if (f == NULL) { 686 if (errno != ENOENT) 687 file_error(ms, errno, "cannot read magic file `%s'", 688 fn); 689 (*errs)++; 690 return; 691 } 692 693 /* read and parse this file */ 694 for (ms->line = 1; (len = getline(&line, &llen, f)) != -1; 695 ms->line++) { 696 if (len == 0) /* null line, garbage, etc */ 697 continue; 698 if (line[len - 1] == '\n') { 699 lineno++; 700 line[len - 1] = '\0'; /* delete newline */ 701 } 702 switch (line[0]) { 703 case '\0': /* empty, do not parse */ 704 case '#': /* comment, do not parse */ 705 continue; 706 case '!': 707 if (line[1] == ':') { 708 size_t i; 709 710 for (i = 0; bang[i].name != NULL; i++) { 711 if ((size_t)(len - 2) > bang[i].len && 712 memcmp(bang[i].name, line + 2, 713 bang[i].len) == 0) 714 break; 715 } 716 if (bang[i].name == NULL) { 717 file_error(ms, 0, 718 "Unknown !: entry `%s'", line); 719 (*errs)++; 720 continue; 721 } 722 if (*marraycount == 0) { 723 file_error(ms, 0, 724 "No current entry for :!%s type", 725 bang[i].name); 726 (*errs)++; 727 continue; 728 } 729 if ((*bang[i].fun)(ms, 730 &(*marray)[*marraycount - 1], 731 line + bang[i].len + 2) != 0) { 732 (*errs)++; 733 continue; 734 } 735 continue; 736 } 737 /*FALLTHROUGH*/ 738 default: 739 if (parse(ms, marray, marraycount, line, lineno, 740 action) != 0) 741 (*errs)++; 742 break; 743 } 744 } 745 if (line) 746 free(line); 747 (void)fclose(f); 748 } 749 750 /* 751 * parse a file or directory of files 752 * const char *fn: name of magic file or directory 753 */ 754 private int 755 cmpstrp(const void *p1, const void *p2) 756 { 757 return strcmp(*(char *const *)p1, *(char *const *)p2); 758 } 759 760 private int 761 apprentice_load(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp, 762 const char *fn, int action) 763 { 764 int errs = 0; 765 struct magic_entry *marray; 766 uint32_t marraycount, i, mentrycount = 0, starttest; 767 size_t slen, files = 0, maxfiles = 0; 768 char **filearr = NULL, *mfn; 769 struct stat st; 770 DIR *dir; 771 struct dirent *d; 772 773 ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */ 774 775 maxmagic = MAXMAGIS; 776 if ((marray = CAST(struct magic_entry *, calloc(maxmagic, 777 sizeof(*marray)))) == NULL) { 778 file_oomem(ms, maxmagic * sizeof(*marray)); 779 return -1; 780 } 781 marraycount = 0; 782 783 /* print silly verbose header for USG compat. */ 784 if (action == FILE_CHECK) 785 (void)fprintf(stderr, "%s\n", usg_hdr); 786 787 /* load directory or file */ 788 if (stat(fn, &st) == 0 && S_ISDIR(st.st_mode)) { 789 dir = opendir(fn); 790 if (!dir) { 791 errs++; 792 goto out; 793 } 794 while ((d = readdir(dir)) != NULL) { 795 if (asprintf(&mfn, "%s/%s", fn, d->d_name) < 0) { 796 file_oomem(ms, 797 strlen(fn) + strlen(d->d_name) + 2); 798 errs++; 799 goto out; 800 } 801 if (stat(mfn, &st) == -1 || !S_ISREG(st.st_mode)) { 802 free(mfn); 803 continue; 804 } 805 if (files >= maxfiles) { 806 size_t mlen; 807 maxfiles = (maxfiles + 1) * 2; 808 mlen = maxfiles * sizeof(*filearr); 809 if ((filearr = CAST(char **, 810 realloc(filearr, mlen))) == NULL) { 811 file_oomem(ms, mlen); 812 free(mfn); 813 errs++; 814 goto out; 815 } 816 } 817 filearr[files++] = mfn; 818 } 819 closedir(dir); 820 qsort(filearr, files, sizeof(*filearr), cmpstrp); 821 for (i = 0; i < files; i++) { 822 load_1(ms, action, filearr[i], &errs, &marray, 823 &marraycount); 824 free(filearr[i]); 825 } 826 free(filearr); 827 } else 828 load_1(ms, action, fn, &errs, &marray, &marraycount); 829 if (errs) 830 goto out; 831 832 /* Set types of tests */ 833 for (i = 0; i < marraycount; ) { 834 if (marray[i].mp->cont_level != 0) { 835 i++; 836 continue; 837 } 838 839 starttest = i; 840 do { 841 static const char text[] = "text"; 842 static const char binary[] = "binary"; 843 static const size_t len = sizeof(text); 844 set_test_type(marray[starttest].mp, marray[i].mp); 845 if ((ms->flags & MAGIC_DEBUG) == 0) 846 continue; 847 (void)fprintf(stderr, "%s%s%s: %s\n", 848 marray[i].mp->mimetype, 849 marray[i].mp->mimetype[0] == '\0' ? "" : "; ", 850 marray[i].mp->desc[0] ? marray[i].mp->desc : 851 "(no description)", 852 marray[i].mp->flag & BINTEST ? binary : text); 853 if (marray[i].mp->flag & BINTEST) { 854 char *p = strstr(marray[i].mp->desc, text); 855 if (p && (p == marray[i].mp->desc || 856 isspace((unsigned char)p[-1])) && 857 (p + len - marray[i].mp->desc == 858 MAXstring || (p[len] == '\0' || 859 isspace((unsigned char)p[len])))) 860 (void)fprintf(stderr, "*** Possible " 861 "binary test for text type\n"); 862 } 863 } while (++i < marraycount && marray[i].mp->cont_level != 0); 864 } 865 866 qsort(marray, marraycount, sizeof(*marray), apprentice_sort); 867 868 /* 869 * Make sure that any level 0 "default" line is last (if one exists). 870 */ 871 for (i = 0; i < marraycount; i++) { 872 if (marray[i].mp->cont_level == 0 && 873 marray[i].mp->type == FILE_DEFAULT) { 874 while (++i < marraycount) 875 if (marray[i].mp->cont_level == 0) 876 break; 877 if (i != marraycount) { 878 /* XXX - Ugh! */ 879 ms->line = marray[i].mp->lineno; 880 file_magwarn(ms, 881 "level 0 \"default\" did not sort last"); 882 } 883 break; 884 } 885 } 886 887 for (i = 0; i < marraycount; i++) 888 mentrycount += marray[i].cont_count; 889 890 slen = sizeof(**magicp) * mentrycount; 891 if ((*magicp = CAST(struct magic *, malloc(slen))) == NULL) { 892 file_oomem(ms, slen); 893 errs++; 894 goto out; 895 } 896 897 mentrycount = 0; 898 for (i = 0; i < marraycount; i++) { 899 (void)memcpy(*magicp + mentrycount, marray[i].mp, 900 marray[i].cont_count * sizeof(**magicp)); 901 mentrycount += marray[i].cont_count; 902 } 903 out: 904 for (i = 0; i < marraycount; i++) 905 free(marray[i].mp); 906 free(marray); 907 if (errs) { 908 *magicp = NULL; 909 *nmagicp = 0; 910 return errs; 911 } else { 912 *nmagicp = mentrycount; 913 return 0; 914 } 915 916 } 917 918 /* 919 * extend the sign bit if the comparison is to be signed 920 */ 921 protected uint64_t 922 file_signextend(struct magic_set *ms, struct magic *m, uint64_t v) 923 { 924 if (!(m->flag & UNSIGNED)) { 925 switch(m->type) { 926 /* 927 * Do not remove the casts below. They are 928 * vital. When later compared with the data, 929 * the sign extension must have happened. 930 */ 931 case FILE_BYTE: 932 v = (char) v; 933 break; 934 case FILE_SHORT: 935 case FILE_BESHORT: 936 case FILE_LESHORT: 937 v = (short) v; 938 break; 939 case FILE_DATE: 940 case FILE_BEDATE: 941 case FILE_LEDATE: 942 case FILE_MEDATE: 943 case FILE_LDATE: 944 case FILE_BELDATE: 945 case FILE_LELDATE: 946 case FILE_MELDATE: 947 case FILE_LONG: 948 case FILE_BELONG: 949 case FILE_LELONG: 950 case FILE_MELONG: 951 case FILE_FLOAT: 952 case FILE_BEFLOAT: 953 case FILE_LEFLOAT: 954 v = (int32_t) v; 955 break; 956 case FILE_QUAD: 957 case FILE_BEQUAD: 958 case FILE_LEQUAD: 959 case FILE_QDATE: 960 case FILE_QLDATE: 961 case FILE_BEQDATE: 962 case FILE_BEQLDATE: 963 case FILE_LEQDATE: 964 case FILE_LEQLDATE: 965 case FILE_DOUBLE: 966 case FILE_BEDOUBLE: 967 case FILE_LEDOUBLE: 968 v = (int64_t) v; 969 break; 970 case FILE_STRING: 971 case FILE_PSTRING: 972 case FILE_BESTRING16: 973 case FILE_LESTRING16: 974 case FILE_REGEX: 975 case FILE_SEARCH: 976 case FILE_DEFAULT: 977 case FILE_INDIRECT: 978 break; 979 default: 980 if (ms->flags & MAGIC_CHECK) 981 file_magwarn(ms, "cannot happen: m->type=%d\n", 982 m->type); 983 return ~0U; 984 } 985 } 986 return v; 987 } 988 989 private int 990 string_modifier_check(struct magic_set *ms, struct magic *m) 991 { 992 if ((ms->flags & MAGIC_CHECK) == 0) 993 return 0; 994 995 if (m->type != FILE_PSTRING && (m->str_flags & PSTRING_LEN) != 0) { 996 file_magwarn(ms, 997 "'/BHhLl' modifiers are only allowed for pascal strings\n"); 998 return -1; 999 } 1000 switch (m->type) { 1001 case FILE_BESTRING16: 1002 case FILE_LESTRING16: 1003 if (m->str_flags != 0) { 1004 file_magwarn(ms, 1005 "no modifiers allowed for 16-bit strings\n"); 1006 return -1; 1007 } 1008 break; 1009 case FILE_STRING: 1010 case FILE_PSTRING: 1011 if ((m->str_flags & REGEX_OFFSET_START) != 0) { 1012 file_magwarn(ms, 1013 "'/%c' only allowed on regex and search\n", 1014 CHAR_REGEX_OFFSET_START); 1015 return -1; 1016 } 1017 break; 1018 case FILE_SEARCH: 1019 if (m->str_range == 0) { 1020 file_magwarn(ms, 1021 "missing range; defaulting to %d\n", 1022 STRING_DEFAULT_RANGE); 1023 m->str_range = STRING_DEFAULT_RANGE; 1024 return -1; 1025 } 1026 break; 1027 case FILE_REGEX: 1028 if ((m->str_flags & STRING_COMPACT_WHITESPACE) != 0) { 1029 file_magwarn(ms, "'/%c' not allowed on regex\n", 1030 CHAR_COMPACT_WHITESPACE); 1031 return -1; 1032 } 1033 if ((m->str_flags & STRING_COMPACT_OPTIONAL_WHITESPACE) != 0) { 1034 file_magwarn(ms, "'/%c' not allowed on regex\n", 1035 CHAR_COMPACT_OPTIONAL_WHITESPACE); 1036 return -1; 1037 } 1038 break; 1039 default: 1040 file_magwarn(ms, "coding error: m->type=%d\n", 1041 m->type); 1042 return -1; 1043 } 1044 return 0; 1045 } 1046 1047 private int 1048 get_op(char c) 1049 { 1050 switch (c) { 1051 case '&': 1052 return FILE_OPAND; 1053 case '|': 1054 return FILE_OPOR; 1055 case '^': 1056 return FILE_OPXOR; 1057 case '+': 1058 return FILE_OPADD; 1059 case '-': 1060 return FILE_OPMINUS; 1061 case '*': 1062 return FILE_OPMULTIPLY; 1063 case '/': 1064 return FILE_OPDIVIDE; 1065 case '%': 1066 return FILE_OPMODULO; 1067 default: 1068 return -1; 1069 } 1070 } 1071 1072 #ifdef ENABLE_CONDITIONALS 1073 private int 1074 get_cond(const char *l, const char **t) 1075 { 1076 static const struct cond_tbl_s { 1077 char name[8]; 1078 size_t len; 1079 int cond; 1080 } cond_tbl[] = { 1081 { "if", 2, COND_IF }, 1082 { "elif", 4, COND_ELIF }, 1083 { "else", 4, COND_ELSE }, 1084 { "", 0, COND_NONE }, 1085 }; 1086 const struct cond_tbl_s *p; 1087 1088 for (p = cond_tbl; p->len; p++) { 1089 if (strncmp(l, p->name, p->len) == 0 && 1090 isspace((unsigned char)l[p->len])) { 1091 if (t) 1092 *t = l + p->len; 1093 break; 1094 } 1095 } 1096 return p->cond; 1097 } 1098 1099 private int 1100 check_cond(struct magic_set *ms, int cond, uint32_t cont_level) 1101 { 1102 int last_cond; 1103 last_cond = ms->c.li[cont_level].last_cond; 1104 1105 switch (cond) { 1106 case COND_IF: 1107 if (last_cond != COND_NONE && last_cond != COND_ELIF) { 1108 if (ms->flags & MAGIC_CHECK) 1109 file_magwarn(ms, "syntax error: `if'"); 1110 return -1; 1111 } 1112 last_cond = COND_IF; 1113 break; 1114 1115 case COND_ELIF: 1116 if (last_cond != COND_IF && last_cond != COND_ELIF) { 1117 if (ms->flags & MAGIC_CHECK) 1118 file_magwarn(ms, "syntax error: `elif'"); 1119 return -1; 1120 } 1121 last_cond = COND_ELIF; 1122 break; 1123 1124 case COND_ELSE: 1125 if (last_cond != COND_IF && last_cond != COND_ELIF) { 1126 if (ms->flags & MAGIC_CHECK) 1127 file_magwarn(ms, "syntax error: `else'"); 1128 return -1; 1129 } 1130 last_cond = COND_NONE; 1131 break; 1132 1133 case COND_NONE: 1134 last_cond = COND_NONE; 1135 break; 1136 } 1137 1138 ms->c.li[cont_level].last_cond = last_cond; 1139 return 0; 1140 } 1141 #endif /* ENABLE_CONDITIONALS */ 1142 1143 /* 1144 * parse one line from magic file, put into magic[index++] if valid 1145 */ 1146 private int 1147 parse(struct magic_set *ms, struct magic_entry **mentryp, uint32_t *nmentryp, 1148 const char *line, size_t lineno, int action) 1149 { 1150 #ifdef ENABLE_CONDITIONALS 1151 static uint32_t last_cont_level = 0; 1152 #endif 1153 size_t i; 1154 struct magic_entry *me; 1155 struct magic *m; 1156 const char *l = line; 1157 char *t; 1158 int op; 1159 uint32_t cont_level; 1160 1161 cont_level = 0; 1162 1163 while (*l == '>') { 1164 ++l; /* step over */ 1165 cont_level++; 1166 } 1167 #ifdef ENABLE_CONDITIONALS 1168 if (cont_level == 0 || cont_level > last_cont_level) 1169 if (file_check_mem(ms, cont_level) == -1) 1170 return -1; 1171 last_cont_level = cont_level; 1172 #endif 1173 1174 #define ALLOC_CHUNK (size_t)10 1175 #define ALLOC_INCR (size_t)200 1176 1177 if (cont_level != 0) { 1178 if (*nmentryp == 0) { 1179 file_error(ms, 0, "No current entry for continuation"); 1180 return -1; 1181 } 1182 me = &(*mentryp)[*nmentryp - 1]; 1183 if (me->cont_count == me->max_count) { 1184 struct magic *nm; 1185 size_t cnt = me->max_count + ALLOC_CHUNK; 1186 if ((nm = CAST(struct magic *, realloc(me->mp, 1187 sizeof(*nm) * cnt))) == NULL) { 1188 file_oomem(ms, sizeof(*nm) * cnt); 1189 return -1; 1190 } 1191 me->mp = m = nm; 1192 me->max_count = CAST(uint32_t, cnt); 1193 } 1194 m = &me->mp[me->cont_count++]; 1195 (void)memset(m, 0, sizeof(*m)); 1196 m->cont_level = cont_level; 1197 } else { 1198 if (*nmentryp == maxmagic) { 1199 struct magic_entry *mp; 1200 1201 maxmagic += ALLOC_INCR; 1202 if ((mp = CAST(struct magic_entry *, 1203 realloc(*mentryp, sizeof(*mp) * maxmagic))) == 1204 NULL) { 1205 file_oomem(ms, sizeof(*mp) * maxmagic); 1206 return -1; 1207 } 1208 (void)memset(&mp[*nmentryp], 0, sizeof(*mp) * 1209 ALLOC_INCR); 1210 *mentryp = mp; 1211 } 1212 me = &(*mentryp)[*nmentryp]; 1213 if (me->mp == NULL) { 1214 size_t len = sizeof(*m) * ALLOC_CHUNK; 1215 if ((m = CAST(struct magic *, malloc(len))) == NULL) { 1216 file_oomem(ms, len); 1217 return -1; 1218 } 1219 me->mp = m; 1220 me->max_count = ALLOC_CHUNK; 1221 } else 1222 m = me->mp; 1223 (void)memset(m, 0, sizeof(*m)); 1224 m->factor_op = FILE_FACTOR_OP_NONE; 1225 m->cont_level = 0; 1226 me->cont_count = 1; 1227 } 1228 m->lineno = CAST(uint32_t, lineno); 1229 1230 if (*l == '&') { /* m->cont_level == 0 checked below. */ 1231 ++l; /* step over */ 1232 m->flag |= OFFADD; 1233 } 1234 if (*l == '(') { 1235 ++l; /* step over */ 1236 m->flag |= INDIR; 1237 if (m->flag & OFFADD) 1238 m->flag = (m->flag & ~OFFADD) | INDIROFFADD; 1239 1240 if (*l == '&') { /* m->cont_level == 0 checked below */ 1241 ++l; /* step over */ 1242 m->flag |= OFFADD; 1243 } 1244 } 1245 /* Indirect offsets are not valid at level 0. */ 1246 if (m->cont_level == 0 && (m->flag & (OFFADD | INDIROFFADD))) 1247 if (ms->flags & MAGIC_CHECK) 1248 file_magwarn(ms, "relative offset at level 0"); 1249 1250 /* get offset, then skip over it */ 1251 m->offset = (uint32_t)strtoul(l, &t, 0); 1252 if (l == t) 1253 if (ms->flags & MAGIC_CHECK) 1254 file_magwarn(ms, "offset `%s' invalid", l); 1255 l = t; 1256 1257 if (m->flag & INDIR) { 1258 m->in_type = FILE_LONG; 1259 m->in_offset = 0; 1260 /* 1261 * read [.lbs][+-]nnnnn) 1262 */ 1263 if (*l == '.') { 1264 l++; 1265 switch (*l) { 1266 case 'l': 1267 m->in_type = FILE_LELONG; 1268 break; 1269 case 'L': 1270 m->in_type = FILE_BELONG; 1271 break; 1272 case 'm': 1273 m->in_type = FILE_MELONG; 1274 break; 1275 case 'h': 1276 case 's': 1277 m->in_type = FILE_LESHORT; 1278 break; 1279 case 'H': 1280 case 'S': 1281 m->in_type = FILE_BESHORT; 1282 break; 1283 case 'c': 1284 case 'b': 1285 case 'C': 1286 case 'B': 1287 m->in_type = FILE_BYTE; 1288 break; 1289 case 'e': 1290 case 'f': 1291 case 'g': 1292 m->in_type = FILE_LEDOUBLE; 1293 break; 1294 case 'E': 1295 case 'F': 1296 case 'G': 1297 m->in_type = FILE_BEDOUBLE; 1298 break; 1299 case 'i': 1300 m->in_type = FILE_LEID3; 1301 break; 1302 case 'I': 1303 m->in_type = FILE_BEID3; 1304 break; 1305 default: 1306 if (ms->flags & MAGIC_CHECK) 1307 file_magwarn(ms, 1308 "indirect offset type `%c' invalid", 1309 *l); 1310 break; 1311 } 1312 l++; 1313 } 1314 1315 m->in_op = 0; 1316 if (*l == '~') { 1317 m->in_op |= FILE_OPINVERSE; 1318 l++; 1319 } 1320 if ((op = get_op(*l)) != -1) { 1321 m->in_op |= op; 1322 l++; 1323 } 1324 if (*l == '(') { 1325 m->in_op |= FILE_OPINDIRECT; 1326 l++; 1327 } 1328 if (isdigit((unsigned char)*l) || *l == '-') { 1329 m->in_offset = (int32_t)strtol(l, &t, 0); 1330 if (l == t) 1331 if (ms->flags & MAGIC_CHECK) 1332 file_magwarn(ms, 1333 "in_offset `%s' invalid", l); 1334 l = t; 1335 } 1336 if (*l++ != ')' || 1337 ((m->in_op & FILE_OPINDIRECT) && *l++ != ')')) 1338 if (ms->flags & MAGIC_CHECK) 1339 file_magwarn(ms, 1340 "missing ')' in indirect offset"); 1341 } 1342 EATAB; 1343 1344 #ifdef ENABLE_CONDITIONALS 1345 m->cond = get_cond(l, &l); 1346 if (check_cond(ms, m->cond, cont_level) == -1) 1347 return -1; 1348 1349 EATAB; 1350 #endif 1351 1352 if (*l == 'u') { 1353 ++l; 1354 m->flag |= UNSIGNED; 1355 } 1356 1357 m->type = get_type(l, &l); 1358 if (m->type == FILE_INVALID) { 1359 if (ms->flags & MAGIC_CHECK) 1360 file_magwarn(ms, "type `%s' invalid", l); 1361 return -1; 1362 } 1363 1364 /* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */ 1365 /* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */ 1366 1367 m->mask_op = 0; 1368 if (*l == '~') { 1369 if (!IS_STRING(m->type)) 1370 m->mask_op |= FILE_OPINVERSE; 1371 else if (ms->flags & MAGIC_CHECK) 1372 file_magwarn(ms, "'~' invalid for string types"); 1373 ++l; 1374 } 1375 m->str_range = 0; 1376 m->str_flags = m->type == FILE_PSTRING ? PSTRING_1_LE : 0; 1377 if ((op = get_op(*l)) != -1) { 1378 if (!IS_STRING(m->type)) { 1379 uint64_t val; 1380 ++l; 1381 m->mask_op |= op; 1382 val = (uint64_t)strtoull(l, &t, 0); 1383 l = t; 1384 m->num_mask = file_signextend(ms, m, val); 1385 eatsize(&l); 1386 } 1387 else if (op == FILE_OPDIVIDE) { 1388 int have_range = 0; 1389 while (!isspace((unsigned char)*++l)) { 1390 switch (*l) { 1391 case '0': case '1': case '2': 1392 case '3': case '4': case '5': 1393 case '6': case '7': case '8': 1394 case '9': 1395 if (have_range && 1396 (ms->flags & MAGIC_CHECK)) 1397 file_magwarn(ms, 1398 "multiple ranges"); 1399 have_range = 1; 1400 m->str_range = CAST(uint32_t, 1401 strtoul(l, &t, 0)); 1402 if (m->str_range == 0) 1403 file_magwarn(ms, 1404 "zero range"); 1405 l = t - 1; 1406 break; 1407 case CHAR_COMPACT_WHITESPACE: 1408 m->str_flags |= 1409 STRING_COMPACT_WHITESPACE; 1410 break; 1411 case CHAR_COMPACT_OPTIONAL_WHITESPACE: 1412 m->str_flags |= 1413 STRING_COMPACT_OPTIONAL_WHITESPACE; 1414 break; 1415 case CHAR_IGNORE_LOWERCASE: 1416 m->str_flags |= STRING_IGNORE_LOWERCASE; 1417 break; 1418 case CHAR_IGNORE_UPPERCASE: 1419 m->str_flags |= STRING_IGNORE_UPPERCASE; 1420 break; 1421 case CHAR_REGEX_OFFSET_START: 1422 m->str_flags |= REGEX_OFFSET_START; 1423 break; 1424 case CHAR_BINTEST: 1425 m->str_flags |= STRING_BINTEST; 1426 break; 1427 case CHAR_TEXTTEST: 1428 m->str_flags |= STRING_TEXTTEST; 1429 break; 1430 case CHAR_PSTRING_1_LE: 1431 if (m->type != FILE_PSTRING) 1432 goto bad; 1433 m->str_flags = (m->str_flags & ~PSTRING_LEN) | PSTRING_1_LE; 1434 break; 1435 case CHAR_PSTRING_2_BE: 1436 if (m->type != FILE_PSTRING) 1437 goto bad; 1438 m->str_flags = (m->str_flags & ~PSTRING_LEN) | PSTRING_2_BE; 1439 break; 1440 case CHAR_PSTRING_2_LE: 1441 if (m->type != FILE_PSTRING) 1442 goto bad; 1443 m->str_flags = (m->str_flags & ~PSTRING_LEN) | PSTRING_2_LE; 1444 break; 1445 case CHAR_PSTRING_4_BE: 1446 if (m->type != FILE_PSTRING) 1447 goto bad; 1448 m->str_flags = (m->str_flags & ~PSTRING_LEN) | PSTRING_4_BE; 1449 break; 1450 case CHAR_PSTRING_4_LE: 1451 if (m->type != FILE_PSTRING) 1452 goto bad; 1453 m->str_flags = (m->str_flags & ~PSTRING_LEN) | PSTRING_4_LE; 1454 break; 1455 case CHAR_PSTRING_LENGTH_INCLUDES_ITSELF: 1456 if (m->type != FILE_PSTRING) 1457 goto bad; 1458 m->str_flags |= PSTRING_LENGTH_INCLUDES_ITSELF; 1459 break; 1460 default: 1461 bad: 1462 if (ms->flags & MAGIC_CHECK) 1463 file_magwarn(ms, 1464 "string extension `%c' " 1465 "invalid", *l); 1466 return -1; 1467 } 1468 /* allow multiple '/' for readability */ 1469 if (l[1] == '/' && 1470 !isspace((unsigned char)l[2])) 1471 l++; 1472 } 1473 if (string_modifier_check(ms, m) == -1) 1474 return -1; 1475 } 1476 else { 1477 if (ms->flags & MAGIC_CHECK) 1478 file_magwarn(ms, "invalid string op: %c", *t); 1479 return -1; 1480 } 1481 } 1482 /* 1483 * We used to set mask to all 1's here, instead let's just not do 1484 * anything if mask = 0 (unless you have a better idea) 1485 */ 1486 EATAB; 1487 1488 switch (*l) { 1489 case '>': 1490 case '<': 1491 m->reln = *l; 1492 ++l; 1493 if (*l == '=') { 1494 if (ms->flags & MAGIC_CHECK) { 1495 file_magwarn(ms, "%c= not supported", 1496 m->reln); 1497 return -1; 1498 } 1499 ++l; 1500 } 1501 break; 1502 /* Old-style anding: "0 byte &0x80 dynamically linked" */ 1503 case '&': 1504 case '^': 1505 case '=': 1506 m->reln = *l; 1507 ++l; 1508 if (*l == '=') { 1509 /* HP compat: ignore &= etc. */ 1510 ++l; 1511 } 1512 break; 1513 case '!': 1514 m->reln = *l; 1515 ++l; 1516 break; 1517 default: 1518 m->reln = '='; /* the default relation */ 1519 if (*l == 'x' && ((isascii((unsigned char)l[1]) && 1520 isspace((unsigned char)l[1])) || !l[1])) { 1521 m->reln = *l; 1522 ++l; 1523 } 1524 break; 1525 } 1526 /* 1527 * Grab the value part, except for an 'x' reln. 1528 */ 1529 if (m->reln != 'x' && getvalue(ms, m, &l, action)) 1530 return -1; 1531 1532 /* 1533 * TODO finish this macro and start using it! 1534 * #define offsetcheck {if (offset > HOWMANY-1) 1535 * magwarn("offset too big"); } 1536 */ 1537 1538 /* 1539 * Now get last part - the description 1540 */ 1541 EATAB; 1542 if (l[0] == '\b') { 1543 ++l; 1544 m->flag |= NOSPACE; 1545 } else if ((l[0] == '\\') && (l[1] == 'b')) { 1546 ++l; 1547 ++l; 1548 m->flag |= NOSPACE; 1549 } 1550 for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); ) 1551 continue; 1552 if (i == sizeof(m->desc)) { 1553 m->desc[sizeof(m->desc) - 1] = '\0'; 1554 if (ms->flags & MAGIC_CHECK) 1555 file_magwarn(ms, "description `%s' truncated", m->desc); 1556 } 1557 1558 /* 1559 * We only do this check while compiling, or if any of the magic 1560 * files were not compiled. 1561 */ 1562 if (ms->flags & MAGIC_CHECK) { 1563 if (check_format(ms, m) == -1) 1564 return -1; 1565 } 1566 #ifndef COMPILE_ONLY 1567 if (action == FILE_CHECK) { 1568 file_mdump(m); 1569 } 1570 #endif 1571 m->mimetype[0] = '\0'; /* initialise MIME type to none */ 1572 if (m->cont_level == 0) 1573 ++(*nmentryp); /* make room for next */ 1574 return 0; 1575 } 1576 1577 /* 1578 * parse a STRENGTH annotation line from magic file, put into magic[index - 1] 1579 * if valid 1580 */ 1581 private int 1582 parse_strength(struct magic_set *ms, struct magic_entry *me, const char *line) 1583 { 1584 const char *l = line; 1585 char *el; 1586 unsigned long factor; 1587 struct magic *m = &me->mp[0]; 1588 1589 if (m->factor_op != FILE_FACTOR_OP_NONE) { 1590 file_magwarn(ms, 1591 "Current entry already has a strength type: %c %d", 1592 m->factor_op, m->factor); 1593 return -1; 1594 } 1595 EATAB; 1596 switch (*l) { 1597 case FILE_FACTOR_OP_NONE: 1598 case FILE_FACTOR_OP_PLUS: 1599 case FILE_FACTOR_OP_MINUS: 1600 case FILE_FACTOR_OP_TIMES: 1601 case FILE_FACTOR_OP_DIV: 1602 m->factor_op = *l++; 1603 break; 1604 default: 1605 file_magwarn(ms, "Unknown factor op `%c'", *l); 1606 return -1; 1607 } 1608 EATAB; 1609 factor = strtoul(l, &el, 0); 1610 if (factor > 255) { 1611 file_magwarn(ms, "Too large factor `%lu'", factor); 1612 goto out; 1613 } 1614 if (*el && !isspace((unsigned char)*el)) { 1615 file_magwarn(ms, "Bad factor `%s'", l); 1616 goto out; 1617 } 1618 m->factor = (uint8_t)factor; 1619 if (m->factor == 0 && m->factor_op == FILE_FACTOR_OP_DIV) { 1620 file_magwarn(ms, "Cannot have factor op `%c' and factor %u", 1621 m->factor_op, m->factor); 1622 goto out; 1623 } 1624 return 0; 1625 out: 1626 m->factor_op = FILE_FACTOR_OP_NONE; 1627 m->factor = 0; 1628 return -1; 1629 } 1630 1631 /* 1632 * Parse an Apple CREATOR/TYPE annotation from magic file and put it into 1633 * magic[index - 1] 1634 */ 1635 private int 1636 parse_apple(struct magic_set *ms, struct magic_entry *me, const char *line) 1637 { 1638 size_t i; 1639 const char *l = line; 1640 struct magic *m = &me->mp[me->cont_count == 0 ? 0 : me->cont_count - 1]; 1641 1642 if (m->apple[0] != '\0') { 1643 file_magwarn(ms, "Current entry already has a APPLE type " 1644 "`%.8s', new type `%s'", m->mimetype, l); 1645 return -1; 1646 } 1647 1648 EATAB; 1649 for (i = 0; *l && ((isascii((unsigned char)*l) && 1650 isalnum((unsigned char)*l)) || strchr("-+/.", *l)) && 1651 i < sizeof(m->apple); m->apple[i++] = *l++) 1652 continue; 1653 if (i == sizeof(m->apple) && *l) { 1654 /* We don't need to NUL terminate here, printing handles it */ 1655 if (ms->flags & MAGIC_CHECK) 1656 file_magwarn(ms, "APPLE type `%s' truncated %" 1657 SIZE_T_FORMAT "u", line, i); 1658 } 1659 1660 if (i > 0) 1661 return 0; 1662 else 1663 return -1; 1664 } 1665 1666 /* 1667 * parse a MIME annotation line from magic file, put into magic[index - 1] 1668 * if valid 1669 */ 1670 private int 1671 parse_mime(struct magic_set *ms, struct magic_entry *me, const char *line) 1672 { 1673 size_t i; 1674 const char *l = line; 1675 struct magic *m = &me->mp[me->cont_count == 0 ? 0 : me->cont_count - 1]; 1676 1677 if (m->mimetype[0] != '\0') { 1678 file_magwarn(ms, "Current entry already has a MIME type `%s'," 1679 " new type `%s'", m->mimetype, l); 1680 return -1; 1681 } 1682 1683 EATAB; 1684 for (i = 0; *l && ((isascii((unsigned char)*l) && 1685 isalnum((unsigned char)*l)) || strchr("-+/.", *l)) && 1686 i < sizeof(m->mimetype); m->mimetype[i++] = *l++) 1687 continue; 1688 if (i == sizeof(m->mimetype)) { 1689 m->mimetype[sizeof(m->mimetype) - 1] = '\0'; 1690 if (ms->flags & MAGIC_CHECK) 1691 file_magwarn(ms, "MIME type `%s' truncated %" 1692 SIZE_T_FORMAT "u", m->mimetype, i); 1693 } else 1694 m->mimetype[i] = '\0'; 1695 1696 if (i > 0) 1697 return 0; 1698 else 1699 return -1; 1700 } 1701 1702 private int 1703 check_format_type(const char *ptr, int type) 1704 { 1705 int quad = 0; 1706 if (*ptr == '\0') { 1707 /* Missing format string; bad */ 1708 return -1; 1709 } 1710 1711 switch (type) { 1712 case FILE_FMT_QUAD: 1713 quad = 1; 1714 /*FALLTHROUGH*/ 1715 case FILE_FMT_NUM: 1716 if (*ptr == '-') 1717 ptr++; 1718 if (*ptr == '.') 1719 ptr++; 1720 while (isdigit((unsigned char)*ptr)) ptr++; 1721 if (*ptr == '.') 1722 ptr++; 1723 while (isdigit((unsigned char)*ptr)) ptr++; 1724 if (quad) { 1725 if (*ptr++ != 'l') 1726 return -1; 1727 if (*ptr++ != 'l') 1728 return -1; 1729 } 1730 1731 switch (*ptr++) { 1732 case 'l': 1733 switch (*ptr++) { 1734 case 'i': 1735 case 'd': 1736 case 'u': 1737 case 'x': 1738 case 'X': 1739 return 0; 1740 default: 1741 return -1; 1742 } 1743 1744 case 'h': 1745 switch (*ptr++) { 1746 case 'h': 1747 switch (*ptr++) { 1748 case 'i': 1749 case 'd': 1750 case 'u': 1751 case 'x': 1752 case 'X': 1753 return 0; 1754 default: 1755 return -1; 1756 } 1757 case 'd': 1758 return 0; 1759 default: 1760 return -1; 1761 } 1762 1763 case 'i': 1764 case 'c': 1765 case 'd': 1766 case 'u': 1767 case 'x': 1768 case 'X': 1769 return 0; 1770 1771 default: 1772 return -1; 1773 } 1774 1775 case FILE_FMT_FLOAT: 1776 case FILE_FMT_DOUBLE: 1777 if (*ptr == '-') 1778 ptr++; 1779 if (*ptr == '.') 1780 ptr++; 1781 while (isdigit((unsigned char)*ptr)) ptr++; 1782 if (*ptr == '.') 1783 ptr++; 1784 while (isdigit((unsigned char)*ptr)) ptr++; 1785 1786 switch (*ptr++) { 1787 case 'e': 1788 case 'E': 1789 case 'f': 1790 case 'F': 1791 case 'g': 1792 case 'G': 1793 return 0; 1794 1795 default: 1796 return -1; 1797 } 1798 1799 1800 case FILE_FMT_STR: 1801 if (*ptr == '-') 1802 ptr++; 1803 while (isdigit((unsigned char )*ptr)) 1804 ptr++; 1805 if (*ptr == '.') { 1806 ptr++; 1807 while (isdigit((unsigned char )*ptr)) 1808 ptr++; 1809 } 1810 1811 switch (*ptr++) { 1812 case 's': 1813 return 0; 1814 default: 1815 return -1; 1816 } 1817 1818 default: 1819 /* internal error */ 1820 abort(); 1821 } 1822 /*NOTREACHED*/ 1823 return -1; 1824 } 1825 1826 /* 1827 * Check that the optional printf format in description matches 1828 * the type of the magic. 1829 */ 1830 private int 1831 check_format(struct magic_set *ms, struct magic *m) 1832 { 1833 char *ptr; 1834 1835 for (ptr = m->desc; *ptr; ptr++) 1836 if (*ptr == '%') 1837 break; 1838 if (*ptr == '\0') { 1839 /* No format string; ok */ 1840 return 1; 1841 } 1842 1843 assert(file_nformats == file_nnames); 1844 1845 if (m->type >= file_nformats) { 1846 file_magwarn(ms, "Internal error inconsistency between " 1847 "m->type and format strings"); 1848 return -1; 1849 } 1850 if (file_formats[m->type] == FILE_FMT_NONE) { 1851 file_magwarn(ms, "No format string for `%s' with description " 1852 "`%s'", m->desc, file_names[m->type]); 1853 return -1; 1854 } 1855 1856 ptr++; 1857 if (check_format_type(ptr, file_formats[m->type]) == -1) { 1858 /* 1859 * TODO: this error message is unhelpful if the format 1860 * string is not one character long 1861 */ 1862 file_magwarn(ms, "Printf format `%c' is not valid for type " 1863 "`%s' in description `%s'", *ptr ? *ptr : '?', 1864 file_names[m->type], m->desc); 1865 return -1; 1866 } 1867 1868 for (; *ptr; ptr++) { 1869 if (*ptr == '%') { 1870 file_magwarn(ms, 1871 "Too many format strings (should have at most one) " 1872 "for `%s' with description `%s'", 1873 file_names[m->type], m->desc); 1874 return -1; 1875 } 1876 } 1877 return 0; 1878 } 1879 1880 /* 1881 * Read a numeric value from a pointer, into the value union of a magic 1882 * pointer, according to the magic type. Update the string pointer to point 1883 * just after the number read. Return 0 for success, non-zero for failure. 1884 */ 1885 private int 1886 getvalue(struct magic_set *ms, struct magic *m, const char **p, int action) 1887 { 1888 switch (m->type) { 1889 case FILE_BESTRING16: 1890 case FILE_LESTRING16: 1891 case FILE_STRING: 1892 case FILE_PSTRING: 1893 case FILE_REGEX: 1894 case FILE_SEARCH: 1895 *p = getstr(ms, m, *p, action == FILE_COMPILE); 1896 if (*p == NULL) { 1897 if (ms->flags & MAGIC_CHECK) 1898 file_magwarn(ms, "cannot get string from `%s'", 1899 m->value.s); 1900 return -1; 1901 } 1902 return 0; 1903 case FILE_FLOAT: 1904 case FILE_BEFLOAT: 1905 case FILE_LEFLOAT: 1906 if (m->reln != 'x') { 1907 char *ep; 1908 #ifdef HAVE_STRTOF 1909 m->value.f = strtof(*p, &ep); 1910 #else 1911 m->value.f = (float)strtod(*p, &ep); 1912 #endif 1913 *p = ep; 1914 } 1915 return 0; 1916 case FILE_DOUBLE: 1917 case FILE_BEDOUBLE: 1918 case FILE_LEDOUBLE: 1919 if (m->reln != 'x') { 1920 char *ep; 1921 m->value.d = strtod(*p, &ep); 1922 *p = ep; 1923 } 1924 return 0; 1925 default: 1926 if (m->reln != 'x') { 1927 char *ep; 1928 m->value.q = file_signextend(ms, m, 1929 (uint64_t)strtoull(*p, &ep, 0)); 1930 *p = ep; 1931 eatsize(p); 1932 } 1933 return 0; 1934 } 1935 } 1936 1937 /* 1938 * Convert a string containing C character escapes. Stop at an unescaped 1939 * space or tab. 1940 * Copy the converted version to "m->value.s", and the length in m->vallen. 1941 * Return updated scan pointer as function result. Warn if set. 1942 */ 1943 private const char * 1944 getstr(struct magic_set *ms, struct magic *m, const char *s, int warn) 1945 { 1946 const char *origs = s; 1947 char *p = m->value.s; 1948 size_t plen = sizeof(m->value.s); 1949 char *origp = p; 1950 char *pmax = p + plen - 1; 1951 int c; 1952 int val; 1953 1954 while ((c = *s++) != '\0') { 1955 if (isspace((unsigned char) c)) 1956 break; 1957 if (p >= pmax) { 1958 file_error(ms, 0, "string too long: `%s'", origs); 1959 return NULL; 1960 } 1961 if (c == '\\') { 1962 switch(c = *s++) { 1963 1964 case '\0': 1965 if (warn) 1966 file_magwarn(ms, "incomplete escape"); 1967 goto out; 1968 1969 case '\t': 1970 if (warn) { 1971 file_magwarn(ms, 1972 "escaped tab found, use \\t instead"); 1973 warn = 0; /* already did */ 1974 } 1975 /*FALLTHROUGH*/ 1976 default: 1977 if (warn) { 1978 if (isprint((unsigned char)c)) { 1979 /* Allow escaping of 1980 * ``relations'' */ 1981 if (strchr("<>&^=!", c) == NULL 1982 && (m->type != FILE_REGEX || 1983 strchr("[]().*?^$|{}", c) 1984 == NULL)) { 1985 file_magwarn(ms, "no " 1986 "need to escape " 1987 "`%c'", c); 1988 } 1989 } else { 1990 file_magwarn(ms, 1991 "unknown escape sequence: " 1992 "\\%03o", c); 1993 } 1994 } 1995 /*FALLTHROUGH*/ 1996 /* space, perhaps force people to use \040? */ 1997 case ' ': 1998 #if 0 1999 /* 2000 * Other things people escape, but shouldn't need to, 2001 * so we disallow them 2002 */ 2003 case '\'': 2004 case '"': 2005 case '?': 2006 #endif 2007 /* Relations */ 2008 case '>': 2009 case '<': 2010 case '&': 2011 case '^': 2012 case '=': 2013 case '!': 2014 /* and baskslash itself */ 2015 case '\\': 2016 *p++ = (char) c; 2017 break; 2018 2019 case 'a': 2020 *p++ = '\a'; 2021 break; 2022 2023 case 'b': 2024 *p++ = '\b'; 2025 break; 2026 2027 case 'f': 2028 *p++ = '\f'; 2029 break; 2030 2031 case 'n': 2032 *p++ = '\n'; 2033 break; 2034 2035 case 'r': 2036 *p++ = '\r'; 2037 break; 2038 2039 case 't': 2040 *p++ = '\t'; 2041 break; 2042 2043 case 'v': 2044 *p++ = '\v'; 2045 break; 2046 2047 /* \ and up to 3 octal digits */ 2048 case '0': 2049 case '1': 2050 case '2': 2051 case '3': 2052 case '4': 2053 case '5': 2054 case '6': 2055 case '7': 2056 val = c - '0'; 2057 c = *s++; /* try for 2 */ 2058 if (c >= '0' && c <= '7') { 2059 val = (val << 3) | (c - '0'); 2060 c = *s++; /* try for 3 */ 2061 if (c >= '0' && c <= '7') 2062 val = (val << 3) | (c-'0'); 2063 else 2064 --s; 2065 } 2066 else 2067 --s; 2068 *p++ = (char)val; 2069 break; 2070 2071 /* \x and up to 2 hex digits */ 2072 case 'x': 2073 val = 'x'; /* Default if no digits */ 2074 c = hextoint(*s++); /* Get next char */ 2075 if (c >= 0) { 2076 val = c; 2077 c = hextoint(*s++); 2078 if (c >= 0) 2079 val = (val << 4) + c; 2080 else 2081 --s; 2082 } else 2083 --s; 2084 *p++ = (char)val; 2085 break; 2086 } 2087 } else 2088 *p++ = (char)c; 2089 } 2090 out: 2091 *p = '\0'; 2092 m->vallen = CAST(unsigned char, (p - origp)); 2093 if (m->type == FILE_PSTRING) 2094 m->vallen += (unsigned char)file_pstring_length_size(m); 2095 return s; 2096 } 2097 2098 2099 /* Single hex char to int; -1 if not a hex char. */ 2100 private int 2101 hextoint(int c) 2102 { 2103 if (!isascii((unsigned char) c)) 2104 return -1; 2105 if (isdigit((unsigned char) c)) 2106 return c - '0'; 2107 if ((c >= 'a') && (c <= 'f')) 2108 return c + 10 - 'a'; 2109 if (( c>= 'A') && (c <= 'F')) 2110 return c + 10 - 'A'; 2111 return -1; 2112 } 2113 2114 2115 /* 2116 * Print a string containing C character escapes. 2117 */ 2118 protected void 2119 file_showstr(FILE *fp, const char *s, size_t len) 2120 { 2121 char c; 2122 2123 for (;;) { 2124 if (len == ~0U) { 2125 c = *s++; 2126 if (c == '\0') 2127 break; 2128 } 2129 else { 2130 if (len-- == 0) 2131 break; 2132 c = *s++; 2133 } 2134 if (c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */ 2135 (void) fputc(c, fp); 2136 else { 2137 (void) fputc('\\', fp); 2138 switch (c) { 2139 case '\a': 2140 (void) fputc('a', fp); 2141 break; 2142 2143 case '\b': 2144 (void) fputc('b', fp); 2145 break; 2146 2147 case '\f': 2148 (void) fputc('f', fp); 2149 break; 2150 2151 case '\n': 2152 (void) fputc('n', fp); 2153 break; 2154 2155 case '\r': 2156 (void) fputc('r', fp); 2157 break; 2158 2159 case '\t': 2160 (void) fputc('t', fp); 2161 break; 2162 2163 case '\v': 2164 (void) fputc('v', fp); 2165 break; 2166 2167 default: 2168 (void) fprintf(fp, "%.3o", c & 0377); 2169 break; 2170 } 2171 } 2172 } 2173 } 2174 2175 /* 2176 * eatsize(): Eat the size spec from a number [eg. 10UL] 2177 */ 2178 private void 2179 eatsize(const char **p) 2180 { 2181 const char *l = *p; 2182 2183 if (LOWCASE(*l) == 'u') 2184 l++; 2185 2186 switch (LOWCASE(*l)) { 2187 case 'l': /* long */ 2188 case 's': /* short */ 2189 case 'h': /* short */ 2190 case 'b': /* char/byte */ 2191 case 'c': /* char/byte */ 2192 l++; 2193 /*FALLTHROUGH*/ 2194 default: 2195 break; 2196 } 2197 2198 *p = l; 2199 } 2200 2201 /* 2202 * handle a compiled file. 2203 */ 2204 private int 2205 apprentice_map(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp, 2206 const char *fn) 2207 { 2208 int fd; 2209 struct stat st; 2210 uint32_t *ptr; 2211 uint32_t version; 2212 int needsbyteswap; 2213 char *dbname = NULL; 2214 void *mm = NULL; 2215 2216 dbname = mkdbname(ms, fn, 0); 2217 if (dbname == NULL) 2218 goto error2; 2219 2220 if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1) 2221 goto error2; 2222 2223 if (fstat(fd, &st) == -1) { 2224 file_error(ms, errno, "cannot stat `%s'", dbname); 2225 goto error1; 2226 } 2227 if (st.st_size < 8) { 2228 file_error(ms, 0, "file `%s' is too small", dbname); 2229 goto error1; 2230 } 2231 2232 #ifdef QUICK 2233 if ((mm = mmap(0, (size_t)st.st_size, PROT_READ|PROT_WRITE, 2234 MAP_PRIVATE|MAP_FILE, fd, (off_t)0)) == MAP_FAILED) { 2235 file_error(ms, errno, "cannot map `%s'", dbname); 2236 goto error1; 2237 } 2238 #define RET 2 2239 #else 2240 if ((mm = CAST(void *, malloc((size_t)st.st_size))) == NULL) { 2241 file_oomem(ms, (size_t)st.st_size); 2242 goto error1; 2243 } 2244 if (read(fd, mm, (size_t)st.st_size) != (ssize_t)st.st_size) { 2245 file_badread(ms); 2246 goto error1; 2247 } 2248 #define RET 1 2249 #endif 2250 *magicp = CAST(struct magic *, mm); 2251 (void)close(fd); 2252 fd = -1; 2253 ptr = (uint32_t *)(void *)*magicp; 2254 if (*ptr != MAGICNO) { 2255 if (swap4(*ptr) != MAGICNO) { 2256 file_error(ms, 0, "bad magic in `%s'", dbname); 2257 goto error1; 2258 } 2259 needsbyteswap = 1; 2260 } else 2261 needsbyteswap = 0; 2262 if (needsbyteswap) 2263 version = swap4(ptr[1]); 2264 else 2265 version = ptr[1]; 2266 if (version != VERSIONNO) { 2267 file_error(ms, 0, "File %s supports only version %d magic " 2268 "files. `%s' is version %d", VERSION, 2269 VERSIONNO, dbname, version); 2270 goto error1; 2271 } 2272 *nmagicp = (uint32_t)(st.st_size / sizeof(struct magic)); 2273 if (*nmagicp > 0) 2274 (*nmagicp)--; 2275 (*magicp)++; 2276 if (needsbyteswap) 2277 byteswap(*magicp, *nmagicp); 2278 free(dbname); 2279 return RET; 2280 2281 error1: 2282 if (fd != -1) 2283 (void)close(fd); 2284 if (mm) { 2285 #ifdef QUICK 2286 (void)munmap((void *)mm, (size_t)st.st_size); 2287 #else 2288 free(mm); 2289 #endif 2290 } else { 2291 *magicp = NULL; 2292 *nmagicp = 0; 2293 } 2294 error2: 2295 free(dbname); 2296 return -1; 2297 } 2298 2299 private const uint32_t ar[] = { 2300 MAGICNO, VERSIONNO 2301 }; 2302 /* 2303 * handle an mmaped file. 2304 */ 2305 private int 2306 apprentice_compile(struct magic_set *ms, struct magic **magicp, 2307 uint32_t *nmagicp, const char *fn) 2308 { 2309 int fd; 2310 char *dbname; 2311 int rv = -1; 2312 2313 dbname = mkdbname(ms, fn, 1); 2314 2315 if (dbname == NULL) 2316 goto out; 2317 2318 if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1) { 2319 file_error(ms, errno, "cannot open `%s'", dbname); 2320 goto out; 2321 } 2322 2323 if (write(fd, ar, sizeof(ar)) != (ssize_t)sizeof(ar)) { 2324 file_error(ms, errno, "error writing `%s'", dbname); 2325 goto out; 2326 } 2327 2328 if (lseek(fd, (off_t)sizeof(struct magic), SEEK_SET) 2329 != sizeof(struct magic)) { 2330 file_error(ms, errno, "error seeking `%s'", dbname); 2331 goto out; 2332 } 2333 2334 if (write(fd, *magicp, (sizeof(struct magic) * *nmagicp)) 2335 != (ssize_t)(sizeof(struct magic) * *nmagicp)) { 2336 file_error(ms, errno, "error writing `%s'", dbname); 2337 goto out; 2338 } 2339 2340 (void)close(fd); 2341 rv = 0; 2342 out: 2343 free(dbname); 2344 return rv; 2345 } 2346 2347 private const char ext[] = ".mgc"; 2348 /* 2349 * make a dbname 2350 */ 2351 private char * 2352 mkdbname(struct magic_set *ms, const char *fn, int strip) 2353 { 2354 const char *p, *q; 2355 char *buf; 2356 2357 if (strip) { 2358 if ((p = strrchr(fn, '/')) != NULL) 2359 fn = ++p; 2360 } 2361 2362 for (q = fn; *q; q++) 2363 continue; 2364 /* Look for .mgc */ 2365 for (p = ext + sizeof(ext) - 1; p >= ext && q >= fn; p--, q--) 2366 if (*p != *q) 2367 break; 2368 2369 /* Did not find .mgc, restore q */ 2370 if (p >= ext) 2371 while (*q) 2372 q++; 2373 2374 q++; 2375 /* Compatibility with old code that looked in .mime */ 2376 if (ms->flags & MAGIC_MIME) { 2377 asprintf(&buf, "%.*s.mime%s", (int)(q - fn), fn, ext); 2378 if (access(buf, R_OK) != -1) { 2379 ms->flags &= MAGIC_MIME_TYPE; 2380 return buf; 2381 } 2382 free(buf); 2383 } 2384 asprintf(&buf, "%.*s%s", (int)(q - fn), fn, ext); 2385 2386 /* Compatibility with old code that looked in .mime */ 2387 if (strstr(p, ".mime") != NULL) 2388 ms->flags &= MAGIC_MIME_TYPE; 2389 return buf; 2390 } 2391 2392 /* 2393 * Byteswap an mmap'ed file if needed 2394 */ 2395 private void 2396 byteswap(struct magic *magic, uint32_t nmagic) 2397 { 2398 uint32_t i; 2399 for (i = 0; i < nmagic; i++) 2400 bs1(&magic[i]); 2401 } 2402 2403 /* 2404 * swap a short 2405 */ 2406 private uint16_t 2407 swap2(uint16_t sv) 2408 { 2409 uint16_t rv; 2410 uint8_t *s = (uint8_t *)(void *)&sv; 2411 uint8_t *d = (uint8_t *)(void *)&rv; 2412 d[0] = s[1]; 2413 d[1] = s[0]; 2414 return rv; 2415 } 2416 2417 /* 2418 * swap an int 2419 */ 2420 private uint32_t 2421 swap4(uint32_t sv) 2422 { 2423 uint32_t rv; 2424 uint8_t *s = (uint8_t *)(void *)&sv; 2425 uint8_t *d = (uint8_t *)(void *)&rv; 2426 d[0] = s[3]; 2427 d[1] = s[2]; 2428 d[2] = s[1]; 2429 d[3] = s[0]; 2430 return rv; 2431 } 2432 2433 /* 2434 * swap a quad 2435 */ 2436 private uint64_t 2437 swap8(uint64_t sv) 2438 { 2439 uint64_t rv; 2440 uint8_t *s = (uint8_t *)(void *)&sv; 2441 uint8_t *d = (uint8_t *)(void *)&rv; 2442 #if 0 2443 d[0] = s[3]; 2444 d[1] = s[2]; 2445 d[2] = s[1]; 2446 d[3] = s[0]; 2447 d[4] = s[7]; 2448 d[5] = s[6]; 2449 d[6] = s[5]; 2450 d[7] = s[4]; 2451 #else 2452 d[0] = s[7]; 2453 d[1] = s[6]; 2454 d[2] = s[5]; 2455 d[3] = s[4]; 2456 d[4] = s[3]; 2457 d[5] = s[2]; 2458 d[6] = s[1]; 2459 d[7] = s[0]; 2460 #endif 2461 return rv; 2462 } 2463 2464 /* 2465 * byteswap a single magic entry 2466 */ 2467 private void 2468 bs1(struct magic *m) 2469 { 2470 m->cont_level = swap2(m->cont_level); 2471 m->offset = swap4((uint32_t)m->offset); 2472 m->in_offset = swap4((uint32_t)m->in_offset); 2473 m->lineno = swap4((uint32_t)m->lineno); 2474 if (IS_STRING(m->type)) { 2475 m->str_range = swap4(m->str_range); 2476 m->str_flags = swap4(m->str_flags); 2477 } 2478 else { 2479 m->value.q = swap8(m->value.q); 2480 m->num_mask = swap8(m->num_mask); 2481 } 2482 } 2483 2484 protected size_t 2485 file_pstring_length_size(const struct magic *m) 2486 { 2487 switch (m->str_flags & PSTRING_LEN) { 2488 case PSTRING_1_LE: 2489 return 1; 2490 case PSTRING_2_LE: 2491 case PSTRING_2_BE: 2492 return 2; 2493 case PSTRING_4_LE: 2494 case PSTRING_4_BE: 2495 return 4; 2496 default: 2497 abort(); /* Impossible */ 2498 return 1; 2499 } 2500 } 2501 protected size_t 2502 file_pstring_get_length(const struct magic *m, const char *s) 2503 { 2504 size_t len = 0; 2505 2506 switch (m->str_flags & PSTRING_LEN) { 2507 case PSTRING_1_LE: 2508 len = *s; 2509 break; 2510 case PSTRING_2_LE: 2511 len = (s[1] << 8) | s[0]; 2512 break; 2513 case PSTRING_2_BE: 2514 len = (s[0] << 8) | s[1]; 2515 break; 2516 case PSTRING_4_LE: 2517 len = (s[3] << 24) | (s[2] << 16) | (s[1] << 8) | s[0]; 2518 break; 2519 case PSTRING_4_BE: 2520 len = (s[0] << 24) | (s[1] << 16) | (s[2] << 8) | s[3]; 2521 break; 2522 default: 2523 abort(); /* Impossible */ 2524 } 2525 2526 if (m->str_flags & PSTRING_LENGTH_INCLUDES_ITSELF) 2527 len -= file_pstring_length_size(m); 2528 2529 return len; 2530 } 2531