1 /* $NetBSD: apprentice.c,v 1.23 2019/05/22 17:26:05 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.283 2019/02/20 02:35:27 christos Exp $") 39 #else 40 __RCSID("$NetBSD: apprentice.c,v 1.23 2019/05/22 17:26:05 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 <stddef.h> 50 #include <string.h> 51 #include <assert.h> 52 #include <ctype.h> 53 #include <fcntl.h> 54 #ifdef QUICK 55 #include <sys/mman.h> 56 #endif 57 #include <dirent.h> 58 #include <limits.h> 59 60 61 #define EATAB {while (isascii(CAST(unsigned char, *l)) && \ 62 isspace(CAST(unsigned char, *l))) ++l;} 63 #define LOWCASE(l) (isupper(CAST(unsigned char, l)) ? \ 64 tolower(CAST(unsigned char, l)) : (l)) 65 /* 66 * Work around a bug in headers on Digital Unix. 67 * At least confirmed for: OSF1 V4.0 878 68 */ 69 #if defined(__osf__) && defined(__DECC) 70 #ifdef MAP_FAILED 71 #undef MAP_FAILED 72 #endif 73 #endif 74 75 #ifndef MAP_FAILED 76 #define MAP_FAILED (void *) -1 77 #endif 78 79 #ifndef MAP_FILE 80 #define MAP_FILE 0 81 #endif 82 83 #define ALLOC_CHUNK CAST(size_t, 10) 84 #define ALLOC_INCR CAST(size_t, 200) 85 86 #define MAP_TYPE_USER 0 87 #define MAP_TYPE_MALLOC 1 88 #define MAP_TYPE_MMAP 2 89 90 struct magic_entry { 91 struct magic *mp; 92 uint32_t cont_count; 93 uint32_t max_count; 94 }; 95 96 struct magic_entry_set { 97 struct magic_entry *me; 98 uint32_t count; 99 uint32_t max; 100 }; 101 102 struct magic_map { 103 void *p; 104 size_t len; 105 int type; 106 struct magic *magic[MAGIC_SETS]; 107 uint32_t nmagic[MAGIC_SETS]; 108 }; 109 110 int file_formats[FILE_NAMES_SIZE]; 111 const size_t file_nformats = FILE_NAMES_SIZE; 112 const char *file_names[FILE_NAMES_SIZE]; 113 const size_t file_nnames = FILE_NAMES_SIZE; 114 115 private int getvalue(struct magic_set *ms, struct magic *, const char **, int); 116 private int hextoint(int); 117 private const char *getstr(struct magic_set *, struct magic *, const char *, 118 int); 119 private int parse(struct magic_set *, struct magic_entry *, const char *, 120 size_t, int); 121 private void eatsize(const char **); 122 private int apprentice_1(struct magic_set *, const char *, int); 123 private size_t apprentice_magic_strength(const struct magic *); 124 private int apprentice_sort(const void *, const void *); 125 private void apprentice_list(struct mlist *, int ); 126 private struct magic_map *apprentice_load(struct magic_set *, 127 const char *, int); 128 private struct mlist *mlist_alloc(void); 129 private void mlist_free(struct mlist *); 130 private void byteswap(struct magic *, uint32_t); 131 private void bs1(struct magic *); 132 private uint16_t swap2(uint16_t); 133 private uint32_t swap4(uint32_t); 134 private uint64_t swap8(uint64_t); 135 private char *mkdbname(struct magic_set *, const char *, int); 136 private struct magic_map *apprentice_buf(struct magic_set *, struct magic *, 137 size_t); 138 private struct magic_map *apprentice_map(struct magic_set *, const char *); 139 private int check_buffer(struct magic_set *, struct magic_map *, const char *); 140 private void apprentice_unmap(struct magic_map *); 141 private int apprentice_compile(struct magic_set *, struct magic_map *, 142 const char *); 143 private int check_format_type(const char *, int, const char **); 144 private int check_format(struct magic_set *, struct magic *); 145 private int get_op(char); 146 private int parse_mime(struct magic_set *, struct magic_entry *, const char *); 147 private int parse_strength(struct magic_set *, struct magic_entry *, const char *); 148 private int parse_apple(struct magic_set *, struct magic_entry *, const char *); 149 private int parse_ext(struct magic_set *, struct magic_entry *, const char *); 150 151 152 private size_t magicsize = sizeof(struct magic); 153 154 private const char usg_hdr[] = "cont\toffset\ttype\topcode\tmask\tvalue\tdesc"; 155 156 private struct { 157 const char *name; 158 size_t len; 159 int (*fun)(struct magic_set *, struct magic_entry *, const char *); 160 } bang[] = { 161 #define DECLARE_FIELD(name) { # name, sizeof(# name) - 1, parse_ ## name } 162 DECLARE_FIELD(mime), 163 DECLARE_FIELD(apple), 164 DECLARE_FIELD(ext), 165 DECLARE_FIELD(strength), 166 #undef DECLARE_FIELD 167 { NULL, 0, NULL } 168 }; 169 170 #ifdef COMPILE_ONLY 171 172 int main(int, char *[]); 173 174 int 175 main(int argc, char *argv[]) 176 { 177 int ret; 178 struct magic_set *ms; 179 char *progname; 180 181 if ((progname = strrchr(argv[0], '/')) != NULL) 182 progname++; 183 else 184 progname = argv[0]; 185 186 if (argc != 2) { 187 (void)fprintf(stderr, "Usage: %s file\n", progname); 188 return 1; 189 } 190 191 if ((ms = magic_open(MAGIC_CHECK)) == NULL) { 192 (void)fprintf(stderr, "%s: %s\n", progname, strerror(errno)); 193 return 1; 194 } 195 ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0; 196 if (ret == 1) 197 (void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms)); 198 magic_close(ms); 199 return ret; 200 } 201 #endif /* COMPILE_ONLY */ 202 203 struct type_tbl_s { 204 const char name[16]; 205 const size_t len; 206 const int type; 207 const int format; 208 }; 209 210 /* 211 * XXX - the actual Single UNIX Specification says that "long" means "long", 212 * as in the C data type, but we treat it as meaning "4-byte integer". 213 * Given that the OS X version of file 5.04 did the same, I guess that passes 214 * the actual test; having "long" be dependent on how big a "long" is on 215 * the machine running "file" is silly. 216 */ 217 static const struct type_tbl_s type_tbl[] = { 218 # define XX(s) s, (sizeof(s) - 1) 219 # define XX_NULL "", 0 220 { XX("invalid"), FILE_INVALID, FILE_FMT_NONE }, 221 { XX("byte"), FILE_BYTE, FILE_FMT_NUM }, 222 { XX("short"), FILE_SHORT, FILE_FMT_NUM }, 223 { XX("default"), FILE_DEFAULT, FILE_FMT_NONE }, 224 { XX("long"), FILE_LONG, FILE_FMT_NUM }, 225 { XX("string"), FILE_STRING, FILE_FMT_STR }, 226 { XX("date"), FILE_DATE, FILE_FMT_STR }, 227 { XX("beshort"), FILE_BESHORT, FILE_FMT_NUM }, 228 { XX("belong"), FILE_BELONG, FILE_FMT_NUM }, 229 { XX("bedate"), FILE_BEDATE, FILE_FMT_STR }, 230 { XX("leshort"), FILE_LESHORT, FILE_FMT_NUM }, 231 { XX("lelong"), FILE_LELONG, FILE_FMT_NUM }, 232 { XX("ledate"), FILE_LEDATE, FILE_FMT_STR }, 233 { XX("pstring"), FILE_PSTRING, FILE_FMT_STR }, 234 { XX("ldate"), FILE_LDATE, FILE_FMT_STR }, 235 { XX("beldate"), FILE_BELDATE, FILE_FMT_STR }, 236 { XX("leldate"), FILE_LELDATE, FILE_FMT_STR }, 237 { XX("regex"), FILE_REGEX, FILE_FMT_STR }, 238 { XX("bestring16"), FILE_BESTRING16, FILE_FMT_STR }, 239 { XX("lestring16"), FILE_LESTRING16, FILE_FMT_STR }, 240 { XX("search"), FILE_SEARCH, FILE_FMT_STR }, 241 { XX("medate"), FILE_MEDATE, FILE_FMT_STR }, 242 { XX("meldate"), FILE_MELDATE, FILE_FMT_STR }, 243 { XX("melong"), FILE_MELONG, FILE_FMT_NUM }, 244 { XX("quad"), FILE_QUAD, FILE_FMT_QUAD }, 245 { XX("lequad"), FILE_LEQUAD, FILE_FMT_QUAD }, 246 { XX("bequad"), FILE_BEQUAD, FILE_FMT_QUAD }, 247 { XX("qdate"), FILE_QDATE, FILE_FMT_STR }, 248 { XX("leqdate"), FILE_LEQDATE, FILE_FMT_STR }, 249 { XX("beqdate"), FILE_BEQDATE, FILE_FMT_STR }, 250 { XX("qldate"), FILE_QLDATE, FILE_FMT_STR }, 251 { XX("leqldate"), FILE_LEQLDATE, FILE_FMT_STR }, 252 { XX("beqldate"), FILE_BEQLDATE, FILE_FMT_STR }, 253 { XX("float"), FILE_FLOAT, FILE_FMT_FLOAT }, 254 { XX("befloat"), FILE_BEFLOAT, FILE_FMT_FLOAT }, 255 { XX("lefloat"), FILE_LEFLOAT, FILE_FMT_FLOAT }, 256 { XX("double"), FILE_DOUBLE, FILE_FMT_DOUBLE }, 257 { XX("bedouble"), FILE_BEDOUBLE, FILE_FMT_DOUBLE }, 258 { XX("ledouble"), FILE_LEDOUBLE, FILE_FMT_DOUBLE }, 259 { XX("leid3"), FILE_LEID3, FILE_FMT_NUM }, 260 { XX("beid3"), FILE_BEID3, FILE_FMT_NUM }, 261 { XX("indirect"), FILE_INDIRECT, FILE_FMT_NUM }, 262 { XX("qwdate"), FILE_QWDATE, FILE_FMT_STR }, 263 { XX("leqwdate"), FILE_LEQWDATE, FILE_FMT_STR }, 264 { XX("beqwdate"), FILE_BEQWDATE, FILE_FMT_STR }, 265 { XX("name"), FILE_NAME, FILE_FMT_NONE }, 266 { XX("use"), FILE_USE, FILE_FMT_NONE }, 267 { XX("clear"), FILE_CLEAR, FILE_FMT_NONE }, 268 { XX("der"), FILE_DER, FILE_FMT_STR }, 269 { XX_NULL, FILE_INVALID, FILE_FMT_NONE }, 270 }; 271 272 /* 273 * These are not types, and cannot be preceded by "u" to make them 274 * unsigned. 275 */ 276 static const struct type_tbl_s special_tbl[] = { 277 { XX("der"), FILE_DER, FILE_FMT_STR }, 278 { XX("name"), FILE_NAME, FILE_FMT_STR }, 279 { XX("use"), FILE_USE, FILE_FMT_STR }, 280 { XX_NULL, FILE_INVALID, FILE_FMT_NONE }, 281 }; 282 # undef XX 283 # undef XX_NULL 284 285 private int 286 get_type(const struct type_tbl_s *tbl, const char *l, const char **t) 287 { 288 const struct type_tbl_s *p; 289 290 for (p = tbl; p->len; p++) { 291 if (strncmp(l, p->name, p->len) == 0) { 292 if (t) 293 *t = l + p->len; 294 break; 295 } 296 } 297 return p->type; 298 } 299 300 private off_t 301 maxoff_t(void) { 302 if (/*CONSTCOND*/sizeof(off_t) == sizeof(int)) 303 return CAST(off_t, INT_MAX); 304 if (/*CONSTCOND*/sizeof(off_t) == sizeof(long)) 305 return CAST(off_t, LONG_MAX); 306 return 0x7fffffff; 307 } 308 309 private int 310 get_standard_integer_type(const char *l, const char **t) 311 { 312 int type; 313 314 if (isalpha(CAST(unsigned char, l[1]))) { 315 switch (l[1]) { 316 case 'C': 317 /* "dC" and "uC" */ 318 type = FILE_BYTE; 319 break; 320 case 'S': 321 /* "dS" and "uS" */ 322 type = FILE_SHORT; 323 break; 324 case 'I': 325 case 'L': 326 /* 327 * "dI", "dL", "uI", and "uL". 328 * 329 * XXX - the actual Single UNIX Specification says 330 * that "L" means "long", as in the C data type, 331 * but we treat it as meaning "4-byte integer". 332 * Given that the OS X version of file 5.04 did 333 * the same, I guess that passes the actual SUS 334 * validation suite; having "dL" be dependent on 335 * how big a "long" is on the machine running 336 * "file" is silly. 337 */ 338 type = FILE_LONG; 339 break; 340 case 'Q': 341 /* "dQ" and "uQ" */ 342 type = FILE_QUAD; 343 break; 344 default: 345 /* "d{anything else}", "u{anything else}" */ 346 return FILE_INVALID; 347 } 348 l += 2; 349 } else if (isdigit(CAST(unsigned char, l[1]))) { 350 /* 351 * "d{num}" and "u{num}"; we only support {num} values 352 * of 1, 2, 4, and 8 - the Single UNIX Specification 353 * doesn't say anything about whether arbitrary 354 * values should be supported, but both the Solaris 10 355 * and OS X Mountain Lion versions of file passed the 356 * Single UNIX Specification validation suite, and 357 * neither of them support values bigger than 8 or 358 * non-power-of-2 values. 359 */ 360 if (isdigit(CAST(unsigned char, l[2]))) { 361 /* Multi-digit, so > 9 */ 362 return FILE_INVALID; 363 } 364 switch (l[1]) { 365 case '1': 366 type = FILE_BYTE; 367 break; 368 case '2': 369 type = FILE_SHORT; 370 break; 371 case '4': 372 type = FILE_LONG; 373 break; 374 case '8': 375 type = FILE_QUAD; 376 break; 377 default: 378 /* XXX - what about 3, 5, 6, or 7? */ 379 return FILE_INVALID; 380 } 381 l += 2; 382 } else { 383 /* 384 * "d" or "u" by itself. 385 */ 386 type = FILE_LONG; 387 ++l; 388 } 389 if (t) 390 *t = l; 391 return type; 392 } 393 394 private void 395 init_file_tables(void) 396 { 397 static int done = 0; 398 const struct type_tbl_s *p; 399 400 if (done) 401 return; 402 done++; 403 404 for (p = type_tbl; p->len; p++) { 405 assert(p->type < FILE_NAMES_SIZE); 406 file_names[p->type] = p->name; 407 file_formats[p->type] = p->format; 408 } 409 assert(p - type_tbl == FILE_NAMES_SIZE); 410 } 411 412 private int 413 add_mlist(struct mlist *mlp, struct magic_map *map, size_t idx) 414 { 415 struct mlist *ml; 416 417 mlp->map = NULL; 418 if ((ml = CAST(struct mlist *, malloc(sizeof(*ml)))) == NULL) 419 return -1; 420 421 ml->map = idx == 0 ? map : NULL; 422 ml->magic = map->magic[idx]; 423 ml->nmagic = map->nmagic[idx]; 424 425 mlp->prev->next = ml; 426 ml->prev = mlp->prev; 427 ml->next = mlp; 428 mlp->prev = ml; 429 return 0; 430 } 431 432 /* 433 * Handle one file or directory. 434 */ 435 private int 436 apprentice_1(struct magic_set *ms, const char *fn, int action) 437 { 438 struct magic_map *map; 439 #ifndef COMPILE_ONLY 440 struct mlist *ml; 441 size_t i; 442 #endif 443 444 if (magicsize != FILE_MAGICSIZE) { 445 file_error(ms, 0, "magic element size %lu != %lu", 446 CAST(unsigned long, sizeof(*map->magic[0])), 447 CAST(unsigned long, FILE_MAGICSIZE)); 448 return -1; 449 } 450 451 if (action == FILE_COMPILE) { 452 map = apprentice_load(ms, fn, action); 453 if (map == NULL) 454 return -1; 455 return apprentice_compile(ms, map, fn); 456 } 457 458 #ifndef COMPILE_ONLY 459 map = apprentice_map(ms, fn); 460 if (map == RCAST(struct magic_map *, -1)) 461 return -1; 462 if (map == NULL) { 463 if (ms->flags & MAGIC_CHECK) 464 file_magwarn(ms, "using regular magic file `%s'", fn); 465 map = apprentice_load(ms, fn, action); 466 if (map == NULL) 467 return -1; 468 } 469 470 for (i = 0; i < MAGIC_SETS; i++) { 471 if (add_mlist(ms->mlist[i], map, i) == -1) { 472 file_oomem(ms, sizeof(*ml)); 473 return -1; 474 } 475 } 476 477 if (action == FILE_LIST) { 478 for (i = 0; i < MAGIC_SETS; i++) { 479 printf("Set %" SIZE_T_FORMAT "u:\nBinary patterns:\n", 480 i); 481 apprentice_list(ms->mlist[i], BINTEST); 482 printf("Text patterns:\n"); 483 apprentice_list(ms->mlist[i], TEXTTEST); 484 } 485 } 486 return 0; 487 #else 488 return 0; 489 #endif /* COMPILE_ONLY */ 490 } 491 492 protected void 493 file_ms_free(struct magic_set *ms) 494 { 495 size_t i; 496 if (ms == NULL) 497 return; 498 for (i = 0; i < MAGIC_SETS; i++) 499 mlist_free(ms->mlist[i]); 500 free(ms->o.pbuf); 501 free(ms->o.buf); 502 free(ms->c.li); 503 free(ms); 504 } 505 506 protected struct magic_set * 507 file_ms_alloc(int flags) 508 { 509 struct magic_set *ms; 510 size_t i, len; 511 512 if ((ms = CAST(struct magic_set *, calloc(CAST(size_t, 1u), 513 sizeof(struct magic_set)))) == NULL) 514 return NULL; 515 516 if (magic_setflags(ms, flags) == -1) { 517 errno = EINVAL; 518 goto free; 519 } 520 521 ms->o.buf = ms->o.pbuf = NULL; 522 len = (ms->c.len = 10) * sizeof(*ms->c.li); 523 524 if ((ms->c.li = CAST(struct level_info *, malloc(len))) == NULL) 525 goto free; 526 527 ms->event_flags = 0; 528 ms->error = -1; 529 for (i = 0; i < MAGIC_SETS; i++) 530 ms->mlist[i] = NULL; 531 ms->file = "unknown"; 532 ms->line = 0; 533 ms->indir_max = FILE_INDIR_MAX; 534 ms->name_max = FILE_NAME_MAX; 535 ms->elf_shnum_max = FILE_ELF_SHNUM_MAX; 536 ms->elf_phnum_max = FILE_ELF_PHNUM_MAX; 537 ms->elf_notes_max = FILE_ELF_NOTES_MAX; 538 ms->regex_max = FILE_REGEX_MAX; 539 ms->bytes_max = FILE_BYTES_MAX; 540 return ms; 541 free: 542 free(ms); 543 return NULL; 544 } 545 546 private void 547 apprentice_unmap(struct magic_map *map) 548 { 549 size_t i; 550 if (map == NULL) 551 return; 552 553 switch (map->type) { 554 case MAP_TYPE_USER: 555 break; 556 case MAP_TYPE_MALLOC: 557 for (i = 0; i < MAGIC_SETS; i++) { 558 void *b = map->magic[i]; 559 void *p = map->p; 560 if (CAST(char *, b) >= CAST(char *, p) && 561 CAST(char *, b) <= CAST(char *, p) + map->len) 562 continue; 563 free(map->magic[i]); 564 } 565 free(map->p); 566 break; 567 #ifdef QUICK 568 case MAP_TYPE_MMAP: 569 if (map->p && map->p != MAP_FAILED) 570 (void)munmap(map->p, map->len); 571 break; 572 #endif 573 default: 574 abort(); 575 } 576 free(map); 577 } 578 579 private struct mlist * 580 mlist_alloc(void) 581 { 582 struct mlist *mlist; 583 if ((mlist = CAST(struct mlist *, calloc(1, sizeof(*mlist)))) == NULL) { 584 return NULL; 585 } 586 mlist->next = mlist->prev = mlist; 587 return mlist; 588 } 589 590 private void 591 mlist_free_one(struct mlist *ml) 592 { 593 if (ml->map) 594 apprentice_unmap(CAST(struct magic_map *, ml->map)); 595 free(ml); 596 } 597 598 private void 599 mlist_free(struct mlist *mlist) 600 { 601 struct mlist *ml, *next; 602 603 if (mlist == NULL) 604 return; 605 606 for (ml = mlist->next; ml != mlist; ml = next) { 607 next = ml->next; 608 mlist_free_one(ml); 609 } 610 mlist_free_one(mlist); 611 } 612 613 #ifndef COMPILE_ONLY 614 /* void **bufs: an array of compiled magic files */ 615 protected int 616 buffer_apprentice(struct magic_set *ms, struct magic **bufs, 617 size_t *sizes, size_t nbufs) 618 { 619 size_t i, j; 620 struct mlist *ml; 621 struct magic_map *map; 622 623 if (nbufs == 0) 624 return -1; 625 626 (void)file_reset(ms, 0); 627 628 init_file_tables(); 629 630 for (i = 0; i < MAGIC_SETS; i++) { 631 mlist_free(ms->mlist[i]); 632 if ((ms->mlist[i] = mlist_alloc()) == NULL) { 633 file_oomem(ms, sizeof(*ms->mlist[i])); 634 goto fail; 635 } 636 } 637 638 for (i = 0; i < nbufs; i++) { 639 map = apprentice_buf(ms, bufs[i], sizes[i]); 640 if (map == NULL) 641 goto fail; 642 643 for (j = 0; j < MAGIC_SETS; j++) { 644 if (add_mlist(ms->mlist[j], map, j) == -1) { 645 file_oomem(ms, sizeof(*ml)); 646 goto fail; 647 } 648 } 649 } 650 651 return 0; 652 fail: 653 for (i = 0; i < MAGIC_SETS; i++) { 654 mlist_free(ms->mlist[i]); 655 ms->mlist[i] = NULL; 656 } 657 return -1; 658 } 659 #endif 660 661 /* const char *fn: list of magic files and directories */ 662 protected int 663 file_apprentice(struct magic_set *ms, const char *fn, int action) 664 { 665 char *p, *mfn; 666 int fileerr, errs = -1; 667 size_t i; 668 669 (void)file_reset(ms, 0); 670 671 if ((fn = magic_getpath(fn, action)) == NULL) 672 return -1; 673 674 init_file_tables(); 675 676 if ((mfn = strdup(fn)) == NULL) { 677 file_oomem(ms, strlen(fn)); 678 return -1; 679 } 680 681 for (i = 0; i < MAGIC_SETS; i++) { 682 mlist_free(ms->mlist[i]); 683 if ((ms->mlist[i] = mlist_alloc()) == NULL) { 684 file_oomem(ms, sizeof(*ms->mlist[i])); 685 while (i-- > 0) { 686 mlist_free(ms->mlist[i]); 687 ms->mlist[i] = NULL; 688 } 689 free(mfn); 690 return -1; 691 } 692 } 693 fn = mfn; 694 695 while (fn) { 696 p = strchr(fn, PATHSEP); 697 if (p) 698 *p++ = '\0'; 699 if (*fn == '\0') 700 break; 701 fileerr = apprentice_1(ms, fn, action); 702 errs = MAX(errs, fileerr); 703 fn = p; 704 } 705 706 free(mfn); 707 708 if (errs == -1) { 709 for (i = 0; i < MAGIC_SETS; i++) { 710 mlist_free(ms->mlist[i]); 711 ms->mlist[i] = NULL; 712 } 713 file_error(ms, 0, "could not find any valid magic files!"); 714 return -1; 715 } 716 717 #if 0 718 /* 719 * Always leave the database loaded 720 */ 721 if (action == FILE_LOAD) 722 return 0; 723 724 for (i = 0; i < MAGIC_SETS; i++) { 725 mlist_free(ms->mlist[i]); 726 ms->mlist[i] = NULL; 727 } 728 #endif 729 730 switch (action) { 731 case FILE_LOAD: 732 case FILE_COMPILE: 733 case FILE_CHECK: 734 case FILE_LIST: 735 return 0; 736 default: 737 file_error(ms, 0, "Invalid action %d", action); 738 return -1; 739 } 740 } 741 742 /* 743 * Compute the real length of a magic expression, for the purposes 744 * of determining how "strong" a magic expression is (approximating 745 * how specific its matches are): 746 * - magic characters count 0 unless escaped. 747 * - [] expressions count 1 748 * - {} expressions count 0 749 * - regular characters or escaped magic characters count 1 750 * - 0 length expressions count as one 751 */ 752 private size_t 753 nonmagic(const char *str) 754 { 755 const char *p; 756 size_t rv = 0; 757 758 for (p = str; *p; p++) 759 switch (*p) { 760 case '\\': /* Escaped anything counts 1 */ 761 if (!*++p) 762 p--; 763 rv++; 764 continue; 765 case '?': /* Magic characters count 0 */ 766 case '*': 767 case '.': 768 case '+': 769 case '^': 770 case '$': 771 continue; 772 case '[': /* Bracketed expressions count 1 the ']' */ 773 while (*p && *p != ']') 774 p++; 775 p--; 776 continue; 777 case '{': /* Braced expressions count 0 */ 778 while (*p && *p != '}') 779 p++; 780 if (!*p) 781 p--; 782 continue; 783 default: /* Anything else counts 1 */ 784 rv++; 785 continue; 786 } 787 788 return rv == 0 ? 1 : rv; /* Return at least 1 */ 789 } 790 791 792 private size_t 793 typesize(int type) 794 { 795 switch (type) { 796 case FILE_BYTE: 797 return 1; 798 799 case FILE_SHORT: 800 case FILE_LESHORT: 801 case FILE_BESHORT: 802 return 2; 803 804 case FILE_LONG: 805 case FILE_LELONG: 806 case FILE_BELONG: 807 case FILE_MELONG: 808 return 4; 809 810 case FILE_DATE: 811 case FILE_LEDATE: 812 case FILE_BEDATE: 813 case FILE_MEDATE: 814 case FILE_LDATE: 815 case FILE_LELDATE: 816 case FILE_BELDATE: 817 case FILE_MELDATE: 818 case FILE_FLOAT: 819 case FILE_BEFLOAT: 820 case FILE_LEFLOAT: 821 return 4; 822 823 case FILE_QUAD: 824 case FILE_BEQUAD: 825 case FILE_LEQUAD: 826 case FILE_QDATE: 827 case FILE_LEQDATE: 828 case FILE_BEQDATE: 829 case FILE_QLDATE: 830 case FILE_LEQLDATE: 831 case FILE_BEQLDATE: 832 case FILE_QWDATE: 833 case FILE_LEQWDATE: 834 case FILE_BEQWDATE: 835 case FILE_DOUBLE: 836 case FILE_BEDOUBLE: 837 case FILE_LEDOUBLE: 838 return 8; 839 default: 840 return CAST(size_t, ~0); 841 } 842 } 843 844 /* 845 * Get weight of this magic entry, for sorting purposes. 846 */ 847 private size_t 848 apprentice_magic_strength(const struct magic *m) 849 { 850 #define MULT 10U 851 size_t ts, v; 852 ssize_t val = 2 * MULT; /* baseline strength */ 853 854 switch (m->type) { 855 case FILE_DEFAULT: /* make sure this sorts last */ 856 if (m->factor_op != FILE_FACTOR_OP_NONE) 857 abort(); 858 return 0; 859 860 case FILE_BYTE: 861 case FILE_SHORT: 862 case FILE_LESHORT: 863 case FILE_BESHORT: 864 case FILE_LONG: 865 case FILE_LELONG: 866 case FILE_BELONG: 867 case FILE_MELONG: 868 case FILE_DATE: 869 case FILE_LEDATE: 870 case FILE_BEDATE: 871 case FILE_MEDATE: 872 case FILE_LDATE: 873 case FILE_LELDATE: 874 case FILE_BELDATE: 875 case FILE_MELDATE: 876 case FILE_FLOAT: 877 case FILE_BEFLOAT: 878 case FILE_LEFLOAT: 879 case FILE_QUAD: 880 case FILE_BEQUAD: 881 case FILE_LEQUAD: 882 case FILE_QDATE: 883 case FILE_LEQDATE: 884 case FILE_BEQDATE: 885 case FILE_QLDATE: 886 case FILE_LEQLDATE: 887 case FILE_BEQLDATE: 888 case FILE_QWDATE: 889 case FILE_LEQWDATE: 890 case FILE_BEQWDATE: 891 case FILE_DOUBLE: 892 case FILE_BEDOUBLE: 893 case FILE_LEDOUBLE: 894 ts = typesize(m->type); 895 if (ts == CAST(size_t, ~0)) 896 abort(); 897 val += ts * MULT; 898 break; 899 900 case FILE_PSTRING: 901 case FILE_STRING: 902 val += m->vallen * MULT; 903 break; 904 905 case FILE_BESTRING16: 906 case FILE_LESTRING16: 907 val += m->vallen * MULT / 2; 908 break; 909 910 case FILE_SEARCH: 911 if (m->vallen == 0) 912 break; 913 val += m->vallen * MAX(MULT / m->vallen, 1); 914 break; 915 916 case FILE_REGEX: 917 v = nonmagic(m->value.s); 918 val += v * MAX(MULT / v, 1); 919 break; 920 921 case FILE_INDIRECT: 922 case FILE_NAME: 923 case FILE_USE: 924 break; 925 926 case FILE_DER: 927 val += MULT; 928 break; 929 930 default: 931 (void)fprintf(stderr, "Bad type %d\n", m->type); 932 abort(); 933 } 934 935 switch (m->reln) { 936 case 'x': /* matches anything penalize */ 937 case '!': /* matches almost anything penalize */ 938 val = 0; 939 break; 940 941 case '=': /* Exact match, prefer */ 942 val += MULT; 943 break; 944 945 case '>': 946 case '<': /* comparison match reduce strength */ 947 val -= 2 * MULT; 948 break; 949 950 case '^': 951 case '&': /* masking bits, we could count them too */ 952 val -= MULT; 953 break; 954 955 default: 956 (void)fprintf(stderr, "Bad relation %c\n", m->reln); 957 abort(); 958 } 959 960 switch (m->factor_op) { 961 case FILE_FACTOR_OP_NONE: 962 break; 963 case FILE_FACTOR_OP_PLUS: 964 val += m->factor; 965 break; 966 case FILE_FACTOR_OP_MINUS: 967 val -= m->factor; 968 break; 969 case FILE_FACTOR_OP_TIMES: 970 val *= m->factor; 971 break; 972 case FILE_FACTOR_OP_DIV: 973 val /= m->factor; 974 break; 975 default: 976 abort(); 977 } 978 979 if (val <= 0) /* ensure we only return 0 for FILE_DEFAULT */ 980 val = 1; 981 982 /* 983 * Magic entries with no description get a bonus because they depend 984 * on subsequent magic entries to print something. 985 */ 986 if (m->desc[0] == '\0') 987 val++; 988 return val; 989 } 990 991 /* 992 * Sort callback for sorting entries by "strength" (basically length) 993 */ 994 private int 995 apprentice_sort(const void *a, const void *b) 996 { 997 const struct magic_entry *ma = CAST(const struct magic_entry *, a); 998 const struct magic_entry *mb = CAST(const struct magic_entry *, b); 999 size_t sa = apprentice_magic_strength(ma->mp); 1000 size_t sb = apprentice_magic_strength(mb->mp); 1001 if (sa == sb) 1002 return 0; 1003 else if (sa > sb) 1004 return -1; 1005 else 1006 return 1; 1007 } 1008 1009 /* 1010 * Shows sorted patterns list in the order which is used for the matching 1011 */ 1012 private void 1013 apprentice_list(struct mlist *mlist, int mode) 1014 { 1015 uint32_t magindex = 0; 1016 struct mlist *ml; 1017 for (ml = mlist->next; ml != mlist; ml = ml->next) { 1018 for (magindex = 0; magindex < ml->nmagic; magindex++) { 1019 struct magic *m = &ml->magic[magindex]; 1020 if ((m->flag & mode) != mode) { 1021 /* Skip sub-tests */ 1022 while (magindex + 1 < ml->nmagic && 1023 ml->magic[magindex + 1].cont_level != 0) 1024 ++magindex; 1025 continue; /* Skip to next top-level test*/ 1026 } 1027 1028 /* 1029 * Try to iterate over the tree until we find item with 1030 * description/mimetype. 1031 */ 1032 while (magindex + 1 < ml->nmagic && 1033 ml->magic[magindex + 1].cont_level != 0 && 1034 *ml->magic[magindex].desc == '\0' && 1035 *ml->magic[magindex].mimetype == '\0') 1036 magindex++; 1037 1038 printf("Strength = %3" SIZE_T_FORMAT "u@%u: %s [%s]\n", 1039 apprentice_magic_strength(m), 1040 ml->magic[magindex].lineno, 1041 ml->magic[magindex].desc, 1042 ml->magic[magindex].mimetype); 1043 } 1044 } 1045 } 1046 1047 private void 1048 set_test_type(struct magic *mstart, struct magic *m) 1049 { 1050 switch (m->type) { 1051 case FILE_BYTE: 1052 case FILE_SHORT: 1053 case FILE_LONG: 1054 case FILE_DATE: 1055 case FILE_BESHORT: 1056 case FILE_BELONG: 1057 case FILE_BEDATE: 1058 case FILE_LESHORT: 1059 case FILE_LELONG: 1060 case FILE_LEDATE: 1061 case FILE_LDATE: 1062 case FILE_BELDATE: 1063 case FILE_LELDATE: 1064 case FILE_MEDATE: 1065 case FILE_MELDATE: 1066 case FILE_MELONG: 1067 case FILE_QUAD: 1068 case FILE_LEQUAD: 1069 case FILE_BEQUAD: 1070 case FILE_QDATE: 1071 case FILE_LEQDATE: 1072 case FILE_BEQDATE: 1073 case FILE_QLDATE: 1074 case FILE_LEQLDATE: 1075 case FILE_BEQLDATE: 1076 case FILE_QWDATE: 1077 case FILE_LEQWDATE: 1078 case FILE_BEQWDATE: 1079 case FILE_FLOAT: 1080 case FILE_BEFLOAT: 1081 case FILE_LEFLOAT: 1082 case FILE_DOUBLE: 1083 case FILE_BEDOUBLE: 1084 case FILE_LEDOUBLE: 1085 case FILE_DER: 1086 mstart->flag |= BINTEST; 1087 break; 1088 case FILE_STRING: 1089 case FILE_PSTRING: 1090 case FILE_BESTRING16: 1091 case FILE_LESTRING16: 1092 /* Allow text overrides */ 1093 if (mstart->str_flags & STRING_TEXTTEST) 1094 mstart->flag |= TEXTTEST; 1095 else 1096 mstart->flag |= BINTEST; 1097 break; 1098 case FILE_REGEX: 1099 case FILE_SEARCH: 1100 /* Check for override */ 1101 if (mstart->str_flags & STRING_BINTEST) 1102 mstart->flag |= BINTEST; 1103 if (mstart->str_flags & STRING_TEXTTEST) 1104 mstart->flag |= TEXTTEST; 1105 1106 if (mstart->flag & (TEXTTEST|BINTEST)) 1107 break; 1108 1109 /* binary test if pattern is not text */ 1110 if (file_looks_utf8(m->value.us, CAST(size_t, m->vallen), NULL, 1111 NULL) <= 0) 1112 mstart->flag |= BINTEST; 1113 else 1114 mstart->flag |= TEXTTEST; 1115 break; 1116 case FILE_DEFAULT: 1117 /* can't deduce anything; we shouldn't see this at the 1118 top level anyway */ 1119 break; 1120 case FILE_INVALID: 1121 default: 1122 /* invalid search type, but no need to complain here */ 1123 break; 1124 } 1125 } 1126 1127 private int 1128 addentry(struct magic_set *ms, struct magic_entry *me, 1129 struct magic_entry_set *mset) 1130 { 1131 size_t i = me->mp->type == FILE_NAME ? 1 : 0; 1132 if (mset[i].count == mset[i].max) { 1133 struct magic_entry *mp; 1134 1135 mset[i].max += ALLOC_INCR; 1136 if ((mp = CAST(struct magic_entry *, 1137 realloc(mset[i].me, sizeof(*mp) * mset[i].max))) == 1138 NULL) { 1139 file_oomem(ms, sizeof(*mp) * mset[i].max); 1140 return -1; 1141 } 1142 (void)memset(&mp[mset[i].count], 0, sizeof(*mp) * 1143 ALLOC_INCR); 1144 mset[i].me = mp; 1145 } 1146 mset[i].me[mset[i].count++] = *me; 1147 memset(me, 0, sizeof(*me)); 1148 return 0; 1149 } 1150 1151 /* 1152 * Load and parse one file. 1153 */ 1154 private void 1155 load_1(struct magic_set *ms, int action, const char *fn, int *errs, 1156 struct magic_entry_set *mset) 1157 { 1158 size_t lineno = 0, llen = 0; 1159 char *line = NULL; 1160 ssize_t len; 1161 struct magic_entry me; 1162 1163 FILE *f = fopen(ms->file = fn, "r"); 1164 if (f == NULL) { 1165 if (errno != ENOENT) 1166 file_error(ms, errno, "cannot read magic file `%s'", 1167 fn); 1168 (*errs)++; 1169 return; 1170 } 1171 1172 memset(&me, 0, sizeof(me)); 1173 /* read and parse this file */ 1174 for (ms->line = 1; (len = getline(&line, &llen, f)) != -1; 1175 ms->line++) { 1176 if (len == 0) /* null line, garbage, etc */ 1177 continue; 1178 if (line[len - 1] == '\n') { 1179 lineno++; 1180 line[len - 1] = '\0'; /* delete newline */ 1181 } 1182 switch (line[0]) { 1183 case '\0': /* empty, do not parse */ 1184 case '#': /* comment, do not parse */ 1185 continue; 1186 case '!': 1187 if (line[1] == ':') { 1188 size_t i; 1189 1190 for (i = 0; bang[i].name != NULL; i++) { 1191 if (CAST(size_t, len - 2) > bang[i].len && 1192 memcmp(bang[i].name, line + 2, 1193 bang[i].len) == 0) 1194 break; 1195 } 1196 if (bang[i].name == NULL) { 1197 file_error(ms, 0, 1198 "Unknown !: entry `%s'", line); 1199 (*errs)++; 1200 continue; 1201 } 1202 if (me.mp == NULL) { 1203 file_error(ms, 0, 1204 "No current entry for :!%s type", 1205 bang[i].name); 1206 (*errs)++; 1207 continue; 1208 } 1209 if ((*bang[i].fun)(ms, &me, 1210 line + bang[i].len + 2) != 0) { 1211 (*errs)++; 1212 continue; 1213 } 1214 continue; 1215 } 1216 /*FALLTHROUGH*/ 1217 default: 1218 again: 1219 switch (parse(ms, &me, line, lineno, action)) { 1220 case 0: 1221 continue; 1222 case 1: 1223 (void)addentry(ms, &me, mset); 1224 goto again; 1225 default: 1226 (*errs)++; 1227 break; 1228 } 1229 } 1230 } 1231 if (me.mp) 1232 (void)addentry(ms, &me, mset); 1233 free(line); 1234 (void)fclose(f); 1235 } 1236 1237 /* 1238 * parse a file or directory of files 1239 * const char *fn: name of magic file or directory 1240 */ 1241 private int 1242 cmpstrp(const void *p1, const void *p2) 1243 { 1244 return strcmp(*RCAST(char *const *, p1), *RCAST(char *const *, p2)); 1245 } 1246 1247 1248 private uint32_t 1249 set_text_binary(struct magic_set *ms, struct magic_entry *me, uint32_t nme, 1250 uint32_t starttest) 1251 { 1252 static const char text[] = "text"; 1253 static const char binary[] = "binary"; 1254 static const size_t len = sizeof(text); 1255 1256 uint32_t i = starttest; 1257 1258 do { 1259 set_test_type(me[starttest].mp, me[i].mp); 1260 if ((ms->flags & MAGIC_DEBUG) == 0) 1261 continue; 1262 (void)fprintf(stderr, "%s%s%s: %s\n", 1263 me[i].mp->mimetype, 1264 me[i].mp->mimetype[0] == '\0' ? "" : "; ", 1265 me[i].mp->desc[0] ? me[i].mp->desc : "(no description)", 1266 me[i].mp->flag & BINTEST ? binary : text); 1267 if (me[i].mp->flag & BINTEST) { 1268 char *p = strstr(me[i].mp->desc, text); 1269 if (p && (p == me[i].mp->desc || 1270 isspace(CAST(unsigned char, p[-1]))) && 1271 (p + len - me[i].mp->desc == MAXstring 1272 || (p[len] == '\0' || 1273 isspace(CAST(unsigned char, p[len]))))) 1274 (void)fprintf(stderr, "*** Possible " 1275 "binary test for text type\n"); 1276 } 1277 } while (++i < nme && me[i].mp->cont_level != 0); 1278 return i; 1279 } 1280 1281 private void 1282 set_last_default(struct magic_set *ms, struct magic_entry *me, uint32_t nme) 1283 { 1284 uint32_t i; 1285 for (i = 0; i < nme; i++) { 1286 if (me[i].mp->cont_level == 0 && 1287 me[i].mp->type == FILE_DEFAULT) { 1288 while (++i < nme) 1289 if (me[i].mp->cont_level == 0) 1290 break; 1291 if (i != nme) { 1292 /* XXX - Ugh! */ 1293 ms->line = me[i].mp->lineno; 1294 file_magwarn(ms, 1295 "level 0 \"default\" did not sort last"); 1296 } 1297 return; 1298 } 1299 } 1300 } 1301 1302 private int 1303 coalesce_entries(struct magic_set *ms, struct magic_entry *me, uint32_t nme, 1304 struct magic **ma, uint32_t *nma) 1305 { 1306 uint32_t i, mentrycount = 0; 1307 size_t slen; 1308 1309 for (i = 0; i < nme; i++) 1310 mentrycount += me[i].cont_count; 1311 1312 slen = sizeof(**ma) * mentrycount; 1313 if ((*ma = CAST(struct magic *, malloc(slen))) == NULL) { 1314 file_oomem(ms, slen); 1315 return -1; 1316 } 1317 1318 mentrycount = 0; 1319 for (i = 0; i < nme; i++) { 1320 (void)memcpy(*ma + mentrycount, me[i].mp, 1321 me[i].cont_count * sizeof(**ma)); 1322 mentrycount += me[i].cont_count; 1323 } 1324 *nma = mentrycount; 1325 return 0; 1326 } 1327 1328 private void 1329 magic_entry_free(struct magic_entry *me, uint32_t nme) 1330 { 1331 uint32_t i; 1332 if (me == NULL) 1333 return; 1334 for (i = 0; i < nme; i++) 1335 free(me[i].mp); 1336 free(me); 1337 } 1338 1339 private struct magic_map * 1340 apprentice_load(struct magic_set *ms, const char *fn, int action) 1341 { 1342 int errs = 0; 1343 uint32_t i, j; 1344 size_t files = 0, maxfiles = 0; 1345 char **filearr = NULL, *mfn; 1346 struct stat st; 1347 struct magic_map *map; 1348 struct magic_entry_set mset[MAGIC_SETS]; 1349 DIR *dir; 1350 struct dirent *d; 1351 1352 memset(mset, 0, sizeof(mset)); 1353 ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */ 1354 1355 1356 if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) 1357 { 1358 file_oomem(ms, sizeof(*map)); 1359 return NULL; 1360 } 1361 map->type = MAP_TYPE_MALLOC; 1362 1363 /* print silly verbose header for USG compat. */ 1364 if (action == FILE_CHECK) 1365 (void)fprintf(stderr, "%s\n", usg_hdr); 1366 1367 /* load directory or file */ 1368 if (stat(fn, &st) == 0 && S_ISDIR(st.st_mode)) { 1369 dir = opendir(fn); 1370 if (!dir) { 1371 errs++; 1372 goto out; 1373 } 1374 while ((d = readdir(dir)) != NULL) { 1375 if (d->d_name[0] == '.') 1376 continue; 1377 if (asprintf(&mfn, "%s/%s", fn, d->d_name) < 0) { 1378 file_oomem(ms, 1379 strlen(fn) + strlen(d->d_name) + 2); 1380 errs++; 1381 closedir(dir); 1382 goto out; 1383 } 1384 if (stat(mfn, &st) == -1 || !S_ISREG(st.st_mode)) { 1385 free(mfn); 1386 continue; 1387 } 1388 if (files >= maxfiles) { 1389 size_t mlen; 1390 maxfiles = (maxfiles + 1) * 2; 1391 mlen = maxfiles * sizeof(*filearr); 1392 if ((filearr = CAST(char **, 1393 realloc(filearr, mlen))) == NULL) { 1394 file_oomem(ms, mlen); 1395 free(mfn); 1396 closedir(dir); 1397 errs++; 1398 goto out; 1399 } 1400 } 1401 filearr[files++] = mfn; 1402 } 1403 closedir(dir); 1404 if (filearr) { 1405 qsort(filearr, files, sizeof(*filearr), cmpstrp); 1406 for (i = 0; i < files; i++) { 1407 load_1(ms, action, filearr[i], &errs, mset); 1408 free(filearr[i]); 1409 } 1410 free(filearr); 1411 } 1412 } else 1413 load_1(ms, action, fn, &errs, mset); 1414 if (errs) 1415 goto out; 1416 1417 for (j = 0; j < MAGIC_SETS; j++) { 1418 /* Set types of tests */ 1419 for (i = 0; i < mset[j].count; ) { 1420 if (mset[j].me[i].mp->cont_level != 0) { 1421 i++; 1422 continue; 1423 } 1424 i = set_text_binary(ms, mset[j].me, mset[j].count, i); 1425 } 1426 if (mset[j].me) 1427 qsort(mset[j].me, mset[j].count, sizeof(*mset[j].me), 1428 apprentice_sort); 1429 1430 /* 1431 * Make sure that any level 0 "default" line is last 1432 * (if one exists). 1433 */ 1434 set_last_default(ms, mset[j].me, mset[j].count); 1435 1436 /* coalesce per file arrays into a single one */ 1437 if (coalesce_entries(ms, mset[j].me, mset[j].count, 1438 &map->magic[j], &map->nmagic[j]) == -1) { 1439 errs++; 1440 goto out; 1441 } 1442 } 1443 1444 out: 1445 for (j = 0; j < MAGIC_SETS; j++) 1446 magic_entry_free(mset[j].me, mset[j].count); 1447 1448 if (errs) { 1449 apprentice_unmap(map); 1450 return NULL; 1451 } 1452 return map; 1453 } 1454 1455 /* 1456 * extend the sign bit if the comparison is to be signed 1457 */ 1458 protected uint64_t 1459 file_signextend(struct magic_set *ms, struct magic *m, uint64_t v) 1460 { 1461 if (!(m->flag & UNSIGNED)) { 1462 switch(m->type) { 1463 /* 1464 * Do not remove the casts below. They are 1465 * vital. When later compared with the data, 1466 * the sign extension must have happened. 1467 */ 1468 case FILE_BYTE: 1469 v = CAST(signed char, v); 1470 break; 1471 case FILE_SHORT: 1472 case FILE_BESHORT: 1473 case FILE_LESHORT: 1474 v = CAST(short, v); 1475 break; 1476 case FILE_DATE: 1477 case FILE_BEDATE: 1478 case FILE_LEDATE: 1479 case FILE_MEDATE: 1480 case FILE_LDATE: 1481 case FILE_BELDATE: 1482 case FILE_LELDATE: 1483 case FILE_MELDATE: 1484 case FILE_LONG: 1485 case FILE_BELONG: 1486 case FILE_LELONG: 1487 case FILE_MELONG: 1488 case FILE_FLOAT: 1489 case FILE_BEFLOAT: 1490 case FILE_LEFLOAT: 1491 v = CAST(int32_t, v); 1492 break; 1493 case FILE_QUAD: 1494 case FILE_BEQUAD: 1495 case FILE_LEQUAD: 1496 case FILE_QDATE: 1497 case FILE_QLDATE: 1498 case FILE_QWDATE: 1499 case FILE_BEQDATE: 1500 case FILE_BEQLDATE: 1501 case FILE_BEQWDATE: 1502 case FILE_LEQDATE: 1503 case FILE_LEQLDATE: 1504 case FILE_LEQWDATE: 1505 case FILE_DOUBLE: 1506 case FILE_BEDOUBLE: 1507 case FILE_LEDOUBLE: 1508 v = CAST(int64_t, v); 1509 break; 1510 case FILE_STRING: 1511 case FILE_PSTRING: 1512 case FILE_BESTRING16: 1513 case FILE_LESTRING16: 1514 case FILE_REGEX: 1515 case FILE_SEARCH: 1516 case FILE_DEFAULT: 1517 case FILE_INDIRECT: 1518 case FILE_NAME: 1519 case FILE_USE: 1520 case FILE_CLEAR: 1521 case FILE_DER: 1522 break; 1523 default: 1524 if (ms->flags & MAGIC_CHECK) 1525 file_magwarn(ms, "cannot happen: m->type=%d\n", 1526 m->type); 1527 return ~0U; 1528 } 1529 } 1530 return v; 1531 } 1532 1533 private int 1534 string_modifier_check(struct magic_set *ms, struct magic *m) 1535 { 1536 if ((ms->flags & MAGIC_CHECK) == 0) 1537 return 0; 1538 1539 if ((m->type != FILE_REGEX || (m->str_flags & REGEX_LINE_COUNT) == 0) && 1540 (m->type != FILE_PSTRING && (m->str_flags & PSTRING_LEN) != 0)) { 1541 file_magwarn(ms, 1542 "'/BHhLl' modifiers are only allowed for pascal strings\n"); 1543 return -1; 1544 } 1545 switch (m->type) { 1546 case FILE_BESTRING16: 1547 case FILE_LESTRING16: 1548 if (m->str_flags != 0) { 1549 file_magwarn(ms, 1550 "no modifiers allowed for 16-bit strings\n"); 1551 return -1; 1552 } 1553 break; 1554 case FILE_STRING: 1555 case FILE_PSTRING: 1556 if ((m->str_flags & REGEX_OFFSET_START) != 0) { 1557 file_magwarn(ms, 1558 "'/%c' only allowed on regex and search\n", 1559 CHAR_REGEX_OFFSET_START); 1560 return -1; 1561 } 1562 break; 1563 case FILE_SEARCH: 1564 if (m->str_range == 0) { 1565 file_magwarn(ms, 1566 "missing range; defaulting to %d\n", 1567 STRING_DEFAULT_RANGE); 1568 m->str_range = STRING_DEFAULT_RANGE; 1569 return -1; 1570 } 1571 break; 1572 case FILE_REGEX: 1573 if ((m->str_flags & STRING_COMPACT_WHITESPACE) != 0) { 1574 file_magwarn(ms, "'/%c' not allowed on regex\n", 1575 CHAR_COMPACT_WHITESPACE); 1576 return -1; 1577 } 1578 if ((m->str_flags & STRING_COMPACT_OPTIONAL_WHITESPACE) != 0) { 1579 file_magwarn(ms, "'/%c' not allowed on regex\n", 1580 CHAR_COMPACT_OPTIONAL_WHITESPACE); 1581 return -1; 1582 } 1583 break; 1584 default: 1585 file_magwarn(ms, "coding error: m->type=%d\n", 1586 m->type); 1587 return -1; 1588 } 1589 return 0; 1590 } 1591 1592 private int 1593 get_op(char c) 1594 { 1595 switch (c) { 1596 case '&': 1597 return FILE_OPAND; 1598 case '|': 1599 return FILE_OPOR; 1600 case '^': 1601 return FILE_OPXOR; 1602 case '+': 1603 return FILE_OPADD; 1604 case '-': 1605 return FILE_OPMINUS; 1606 case '*': 1607 return FILE_OPMULTIPLY; 1608 case '/': 1609 return FILE_OPDIVIDE; 1610 case '%': 1611 return FILE_OPMODULO; 1612 default: 1613 return -1; 1614 } 1615 } 1616 1617 #ifdef ENABLE_CONDITIONALS 1618 private int 1619 get_cond(const char *l, const char **t) 1620 { 1621 static const struct cond_tbl_s { 1622 char name[8]; 1623 size_t len; 1624 int cond; 1625 } cond_tbl[] = { 1626 { "if", 2, COND_IF }, 1627 { "elif", 4, COND_ELIF }, 1628 { "else", 4, COND_ELSE }, 1629 { "", 0, COND_NONE }, 1630 }; 1631 const struct cond_tbl_s *p; 1632 1633 for (p = cond_tbl; p->len; p++) { 1634 if (strncmp(l, p->name, p->len) == 0 && 1635 isspace(CAST(unsigned char, l[p->len]))) { 1636 if (t) 1637 *t = l + p->len; 1638 break; 1639 } 1640 } 1641 return p->cond; 1642 } 1643 1644 private int 1645 check_cond(struct magic_set *ms, int cond, uint32_t cont_level) 1646 { 1647 int last_cond; 1648 last_cond = ms->c.li[cont_level].last_cond; 1649 1650 switch (cond) { 1651 case COND_IF: 1652 if (last_cond != COND_NONE && last_cond != COND_ELIF) { 1653 if (ms->flags & MAGIC_CHECK) 1654 file_magwarn(ms, "syntax error: `if'"); 1655 return -1; 1656 } 1657 last_cond = COND_IF; 1658 break; 1659 1660 case COND_ELIF: 1661 if (last_cond != COND_IF && last_cond != COND_ELIF) { 1662 if (ms->flags & MAGIC_CHECK) 1663 file_magwarn(ms, "syntax error: `elif'"); 1664 return -1; 1665 } 1666 last_cond = COND_ELIF; 1667 break; 1668 1669 case COND_ELSE: 1670 if (last_cond != COND_IF && last_cond != COND_ELIF) { 1671 if (ms->flags & MAGIC_CHECK) 1672 file_magwarn(ms, "syntax error: `else'"); 1673 return -1; 1674 } 1675 last_cond = COND_NONE; 1676 break; 1677 1678 case COND_NONE: 1679 last_cond = COND_NONE; 1680 break; 1681 } 1682 1683 ms->c.li[cont_level].last_cond = last_cond; 1684 return 0; 1685 } 1686 #endif /* ENABLE_CONDITIONALS */ 1687 1688 private int 1689 parse_indirect_modifier(struct magic_set *ms, struct magic *m, const char **lp) 1690 { 1691 const char *l = *lp; 1692 1693 while (!isspace(CAST(unsigned char, *++l))) 1694 switch (*l) { 1695 case CHAR_INDIRECT_RELATIVE: 1696 m->str_flags |= INDIRECT_RELATIVE; 1697 break; 1698 default: 1699 if (ms->flags & MAGIC_CHECK) 1700 file_magwarn(ms, "indirect modifier `%c' " 1701 "invalid", *l); 1702 *lp = l; 1703 return -1; 1704 } 1705 *lp = l; 1706 return 0; 1707 } 1708 1709 private void 1710 parse_op_modifier(struct magic_set *ms, struct magic *m, const char **lp, 1711 int op) 1712 { 1713 const char *l = *lp; 1714 char *t; 1715 uint64_t val; 1716 1717 ++l; 1718 m->mask_op |= op; 1719 val = CAST(uint64_t, strtoull(l, &t, 0)); 1720 l = t; 1721 m->num_mask = file_signextend(ms, m, val); 1722 eatsize(&l); 1723 *lp = l; 1724 } 1725 1726 private int 1727 parse_string_modifier(struct magic_set *ms, struct magic *m, const char **lp) 1728 { 1729 const char *l = *lp; 1730 char *t; 1731 int have_range = 0; 1732 1733 while (!isspace(CAST(unsigned char, *++l))) { 1734 switch (*l) { 1735 case '0': case '1': case '2': 1736 case '3': case '4': case '5': 1737 case '6': case '7': case '8': 1738 case '9': 1739 if (have_range && (ms->flags & MAGIC_CHECK)) 1740 file_magwarn(ms, "multiple ranges"); 1741 have_range = 1; 1742 m->str_range = CAST(uint32_t, strtoul(l, &t, 0)); 1743 if (m->str_range == 0) 1744 file_magwarn(ms, "zero range"); 1745 l = t - 1; 1746 break; 1747 case CHAR_COMPACT_WHITESPACE: 1748 m->str_flags |= STRING_COMPACT_WHITESPACE; 1749 break; 1750 case CHAR_COMPACT_OPTIONAL_WHITESPACE: 1751 m->str_flags |= STRING_COMPACT_OPTIONAL_WHITESPACE; 1752 break; 1753 case CHAR_IGNORE_LOWERCASE: 1754 m->str_flags |= STRING_IGNORE_LOWERCASE; 1755 break; 1756 case CHAR_IGNORE_UPPERCASE: 1757 m->str_flags |= STRING_IGNORE_UPPERCASE; 1758 break; 1759 case CHAR_REGEX_OFFSET_START: 1760 m->str_flags |= REGEX_OFFSET_START; 1761 break; 1762 case CHAR_BINTEST: 1763 m->str_flags |= STRING_BINTEST; 1764 break; 1765 case CHAR_TEXTTEST: 1766 m->str_flags |= STRING_TEXTTEST; 1767 break; 1768 case CHAR_TRIM: 1769 m->str_flags |= STRING_TRIM; 1770 break; 1771 case CHAR_PSTRING_1_LE: 1772 #define SET_LENGTH(a) m->str_flags = (m->str_flags & ~PSTRING_LEN) | (a) 1773 if (m->type != FILE_PSTRING) 1774 goto bad; 1775 SET_LENGTH(PSTRING_1_LE); 1776 break; 1777 case CHAR_PSTRING_2_BE: 1778 if (m->type != FILE_PSTRING) 1779 goto bad; 1780 SET_LENGTH(PSTRING_2_BE); 1781 break; 1782 case CHAR_PSTRING_2_LE: 1783 if (m->type != FILE_PSTRING) 1784 goto bad; 1785 SET_LENGTH(PSTRING_2_LE); 1786 break; 1787 case CHAR_PSTRING_4_BE: 1788 if (m->type != FILE_PSTRING) 1789 goto bad; 1790 SET_LENGTH(PSTRING_4_BE); 1791 break; 1792 case CHAR_PSTRING_4_LE: 1793 switch (m->type) { 1794 case FILE_PSTRING: 1795 case FILE_REGEX: 1796 break; 1797 default: 1798 goto bad; 1799 } 1800 SET_LENGTH(PSTRING_4_LE); 1801 break; 1802 case CHAR_PSTRING_LENGTH_INCLUDES_ITSELF: 1803 if (m->type != FILE_PSTRING) 1804 goto bad; 1805 m->str_flags |= PSTRING_LENGTH_INCLUDES_ITSELF; 1806 break; 1807 default: 1808 bad: 1809 if (ms->flags & MAGIC_CHECK) 1810 file_magwarn(ms, "string modifier `%c' " 1811 "invalid", *l); 1812 goto out; 1813 } 1814 /* allow multiple '/' for readability */ 1815 if (l[1] == '/' && !isspace(CAST(unsigned char, l[2]))) 1816 l++; 1817 } 1818 if (string_modifier_check(ms, m) == -1) 1819 goto out; 1820 *lp = l; 1821 return 0; 1822 out: 1823 *lp = l; 1824 return -1; 1825 } 1826 1827 /* 1828 * parse one line from magic file, put into magic[index++] if valid 1829 */ 1830 private int 1831 parse(struct magic_set *ms, struct magic_entry *me, const char *line, 1832 size_t lineno, int action) 1833 { 1834 #ifdef ENABLE_CONDITIONALS 1835 static uint32_t last_cont_level = 0; 1836 #endif 1837 size_t i; 1838 struct magic *m; 1839 const char *l = line; 1840 char *t; 1841 int op; 1842 uint32_t cont_level; 1843 int32_t diff; 1844 1845 cont_level = 0; 1846 1847 /* 1848 * Parse the offset. 1849 */ 1850 while (*l == '>') { 1851 ++l; /* step over */ 1852 cont_level++; 1853 } 1854 #ifdef ENABLE_CONDITIONALS 1855 if (cont_level == 0 || cont_level > last_cont_level) 1856 if (file_check_mem(ms, cont_level) == -1) 1857 return -1; 1858 last_cont_level = cont_level; 1859 #endif 1860 if (cont_level != 0) { 1861 if (me->mp == NULL) { 1862 file_magerror(ms, "No current entry for continuation"); 1863 return -1; 1864 } 1865 if (me->cont_count == 0) { 1866 file_magerror(ms, "Continuations present with 0 count"); 1867 return -1; 1868 } 1869 m = &me->mp[me->cont_count - 1]; 1870 diff = CAST(int32_t, cont_level) - CAST(int32_t, m->cont_level); 1871 if (diff > 1) 1872 file_magwarn(ms, "New continuation level %u is more " 1873 "than one larger than current level %u", cont_level, 1874 m->cont_level); 1875 if (me->cont_count == me->max_count) { 1876 struct magic *nm; 1877 size_t cnt = me->max_count + ALLOC_CHUNK; 1878 if ((nm = CAST(struct magic *, realloc(me->mp, 1879 sizeof(*nm) * cnt))) == NULL) { 1880 file_oomem(ms, sizeof(*nm) * cnt); 1881 return -1; 1882 } 1883 me->mp = nm; 1884 me->max_count = CAST(uint32_t, cnt); 1885 } 1886 m = &me->mp[me->cont_count++]; 1887 (void)memset(m, 0, sizeof(*m)); 1888 m->cont_level = cont_level; 1889 } else { 1890 static const size_t len = sizeof(*m) * ALLOC_CHUNK; 1891 if (me->mp != NULL) 1892 return 1; 1893 if ((m = CAST(struct magic *, malloc(len))) == NULL) { 1894 file_oomem(ms, len); 1895 return -1; 1896 } 1897 me->mp = m; 1898 me->max_count = ALLOC_CHUNK; 1899 (void)memset(m, 0, sizeof(*m)); 1900 m->factor_op = FILE_FACTOR_OP_NONE; 1901 m->cont_level = 0; 1902 me->cont_count = 1; 1903 } 1904 m->lineno = CAST(uint32_t, lineno); 1905 1906 if (*l == '&') { /* m->cont_level == 0 checked below. */ 1907 ++l; /* step over */ 1908 m->flag |= OFFADD; 1909 } 1910 if (*l == '(') { 1911 ++l; /* step over */ 1912 m->flag |= INDIR; 1913 if (m->flag & OFFADD) 1914 m->flag = (m->flag & ~OFFADD) | INDIROFFADD; 1915 1916 if (*l == '&') { /* m->cont_level == 0 checked below */ 1917 ++l; /* step over */ 1918 m->flag |= OFFADD; 1919 } 1920 } 1921 /* Indirect offsets are not valid at level 0. */ 1922 if (m->cont_level == 0 && (m->flag & (OFFADD | INDIROFFADD))) { 1923 if (ms->flags & MAGIC_CHECK) 1924 file_magwarn(ms, "relative offset at level 0"); 1925 return -1; 1926 } 1927 1928 /* get offset, then skip over it */ 1929 m->offset = CAST(int32_t, strtol(l, &t, 0)); 1930 if (l == t) { 1931 if (ms->flags & MAGIC_CHECK) 1932 file_magwarn(ms, "offset `%s' invalid", l); 1933 return -1; 1934 } 1935 #if 0 1936 if (m->offset < 0 && cont_level != 0 && 1937 (m->flag & (OFFADD | INDIROFFADD)) == 0) { 1938 if (ms->flags & MAGIC_CHECK) { 1939 file_magwarn(ms, 1940 "negative direct offset `%s' at level %u", 1941 l, cont_level); 1942 } 1943 return -1; 1944 } 1945 #endif 1946 l = t; 1947 1948 if (m->flag & INDIR) { 1949 m->in_type = FILE_LONG; 1950 m->in_offset = 0; 1951 m->in_op = 0; 1952 /* 1953 * read [.,lbs][+-]nnnnn) 1954 */ 1955 if (*l == '.' || *l == ',') { 1956 if (*l == ',') 1957 m->in_op |= FILE_OPSIGNED; 1958 l++; 1959 switch (*l) { 1960 case 'l': 1961 m->in_type = FILE_LELONG; 1962 break; 1963 case 'L': 1964 m->in_type = FILE_BELONG; 1965 break; 1966 case 'm': 1967 m->in_type = FILE_MELONG; 1968 break; 1969 case 'h': 1970 case 's': 1971 m->in_type = FILE_LESHORT; 1972 break; 1973 case 'H': 1974 case 'S': 1975 m->in_type = FILE_BESHORT; 1976 break; 1977 case 'c': 1978 case 'b': 1979 case 'C': 1980 case 'B': 1981 m->in_type = FILE_BYTE; 1982 break; 1983 case 'e': 1984 case 'f': 1985 case 'g': 1986 m->in_type = FILE_LEDOUBLE; 1987 break; 1988 case 'E': 1989 case 'F': 1990 case 'G': 1991 m->in_type = FILE_BEDOUBLE; 1992 break; 1993 case 'i': 1994 m->in_type = FILE_LEID3; 1995 break; 1996 case 'I': 1997 m->in_type = FILE_BEID3; 1998 break; 1999 case 'q': 2000 m->in_type = FILE_LEQUAD; 2001 break; 2002 case 'Q': 2003 m->in_type = FILE_BEQUAD; 2004 break; 2005 default: 2006 if (ms->flags & MAGIC_CHECK) 2007 file_magwarn(ms, 2008 "indirect offset type `%c' invalid", 2009 *l); 2010 return -1; 2011 } 2012 l++; 2013 } 2014 2015 if (*l == '~') { 2016 m->in_op |= FILE_OPINVERSE; 2017 l++; 2018 } 2019 if ((op = get_op(*l)) != -1) { 2020 m->in_op |= op; 2021 l++; 2022 } 2023 if (*l == '(') { 2024 m->in_op |= FILE_OPINDIRECT; 2025 l++; 2026 } 2027 if (isdigit(CAST(unsigned char, *l)) || *l == '-') { 2028 m->in_offset = CAST(int32_t, strtol(l, &t, 0)); 2029 if (l == t) { 2030 if (ms->flags & MAGIC_CHECK) 2031 file_magwarn(ms, 2032 "in_offset `%s' invalid", l); 2033 return -1; 2034 } 2035 l = t; 2036 } 2037 if (*l++ != ')' || 2038 ((m->in_op & FILE_OPINDIRECT) && *l++ != ')')) { 2039 if (ms->flags & MAGIC_CHECK) 2040 file_magwarn(ms, 2041 "missing ')' in indirect offset"); 2042 return -1; 2043 } 2044 } 2045 EATAB; 2046 2047 #ifdef ENABLE_CONDITIONALS 2048 m->cond = get_cond(l, &l); 2049 if (check_cond(ms, m->cond, cont_level) == -1) 2050 return -1; 2051 2052 EATAB; 2053 #endif 2054 2055 /* 2056 * Parse the type. 2057 */ 2058 if (*l == 'u') { 2059 /* 2060 * Try it as a keyword type prefixed by "u"; match what 2061 * follows the "u". If that fails, try it as an SUS 2062 * integer type. 2063 */ 2064 m->type = get_type(type_tbl, l + 1, &l); 2065 if (m->type == FILE_INVALID) { 2066 /* 2067 * Not a keyword type; parse it as an SUS type, 2068 * 'u' possibly followed by a number or C/S/L. 2069 */ 2070 m->type = get_standard_integer_type(l, &l); 2071 } 2072 /* It's unsigned. */ 2073 if (m->type != FILE_INVALID) 2074 m->flag |= UNSIGNED; 2075 } else { 2076 /* 2077 * Try it as a keyword type. If that fails, try it as 2078 * an SUS integer type if it begins with "d" or as an 2079 * SUS string type if it begins with "s". In any case, 2080 * it's not unsigned. 2081 */ 2082 m->type = get_type(type_tbl, l, &l); 2083 if (m->type == FILE_INVALID) { 2084 /* 2085 * Not a keyword type; parse it as an SUS type, 2086 * either 'd' possibly followed by a number or 2087 * C/S/L, or just 's'. 2088 */ 2089 if (*l == 'd') 2090 m->type = get_standard_integer_type(l, &l); 2091 else if (*l == 's' 2092 && !isalpha(CAST(unsigned char, l[1]))) { 2093 m->type = FILE_STRING; 2094 ++l; 2095 } 2096 } 2097 } 2098 2099 if (m->type == FILE_INVALID) { 2100 /* Not found - try it as a special keyword. */ 2101 m->type = get_type(special_tbl, l, &l); 2102 } 2103 2104 if (m->type == FILE_INVALID) { 2105 if (ms->flags & MAGIC_CHECK) 2106 file_magwarn(ms, "type `%s' invalid", l); 2107 return -1; 2108 } 2109 2110 /* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */ 2111 /* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */ 2112 2113 m->mask_op = 0; 2114 if (*l == '~') { 2115 if (!IS_STRING(m->type)) 2116 m->mask_op |= FILE_OPINVERSE; 2117 else if (ms->flags & MAGIC_CHECK) 2118 file_magwarn(ms, "'~' invalid for string types"); 2119 ++l; 2120 } 2121 m->str_range = 0; 2122 m->str_flags = m->type == FILE_PSTRING ? PSTRING_1_LE : 0; 2123 if ((op = get_op(*l)) != -1) { 2124 if (IS_STRING(m->type)) { 2125 int r; 2126 2127 if (op != FILE_OPDIVIDE) { 2128 if (ms->flags & MAGIC_CHECK) 2129 file_magwarn(ms, 2130 "invalid string/indirect op: " 2131 "`%c'", *t); 2132 return -1; 2133 } 2134 2135 if (m->type == FILE_INDIRECT) 2136 r = parse_indirect_modifier(ms, m, &l); 2137 else 2138 r = parse_string_modifier(ms, m, &l); 2139 if (r == -1) 2140 return -1; 2141 } else 2142 parse_op_modifier(ms, m, &l, op); 2143 } 2144 2145 /* 2146 * We used to set mask to all 1's here, instead let's just not do 2147 * anything if mask = 0 (unless you have a better idea) 2148 */ 2149 EATAB; 2150 2151 switch (*l) { 2152 case '>': 2153 case '<': 2154 m->reln = *l; 2155 ++l; 2156 if (*l == '=') { 2157 if (ms->flags & MAGIC_CHECK) { 2158 file_magwarn(ms, "%c= not supported", 2159 m->reln); 2160 return -1; 2161 } 2162 ++l; 2163 } 2164 break; 2165 /* Old-style anding: "0 byte &0x80 dynamically linked" */ 2166 case '&': 2167 case '^': 2168 case '=': 2169 m->reln = *l; 2170 ++l; 2171 if (*l == '=') { 2172 /* HP compat: ignore &= etc. */ 2173 ++l; 2174 } 2175 break; 2176 case '!': 2177 m->reln = *l; 2178 ++l; 2179 break; 2180 default: 2181 m->reln = '='; /* the default relation */ 2182 if (*l == 'x' && ((isascii(CAST(unsigned char, l[1])) && 2183 isspace(CAST(unsigned char, l[1]))) || !l[1])) { 2184 m->reln = *l; 2185 ++l; 2186 } 2187 break; 2188 } 2189 /* 2190 * Grab the value part, except for an 'x' reln. 2191 */ 2192 if (m->reln != 'x' && getvalue(ms, m, &l, action)) 2193 return -1; 2194 2195 /* 2196 * TODO finish this macro and start using it! 2197 * #define offsetcheck {if (offset > ms->bytes_max -1) 2198 * magwarn("offset too big"); } 2199 */ 2200 2201 /* 2202 * Now get last part - the description 2203 */ 2204 EATAB; 2205 if (l[0] == '\b') { 2206 ++l; 2207 m->flag |= NOSPACE; 2208 } else if ((l[0] == '\\') && (l[1] == 'b')) { 2209 ++l; 2210 ++l; 2211 m->flag |= NOSPACE; 2212 } 2213 for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); ) 2214 continue; 2215 if (i == sizeof(m->desc)) { 2216 m->desc[sizeof(m->desc) - 1] = '\0'; 2217 if (ms->flags & MAGIC_CHECK) 2218 file_magwarn(ms, "description `%s' truncated", m->desc); 2219 } 2220 2221 /* 2222 * We only do this check while compiling, or if any of the magic 2223 * files were not compiled. 2224 */ 2225 if (ms->flags & MAGIC_CHECK) { 2226 if (check_format(ms, m) == -1) 2227 return -1; 2228 } 2229 #ifndef COMPILE_ONLY 2230 if (action == FILE_CHECK) { 2231 file_mdump(m); 2232 } 2233 #endif 2234 m->mimetype[0] = '\0'; /* initialise MIME type to none */ 2235 return 0; 2236 } 2237 2238 /* 2239 * parse a STRENGTH annotation line from magic file, put into magic[index - 1] 2240 * if valid 2241 */ 2242 private int 2243 parse_strength(struct magic_set *ms, struct magic_entry *me, const char *line) 2244 { 2245 const char *l = line; 2246 char *el; 2247 unsigned long factor; 2248 struct magic *m = &me->mp[0]; 2249 2250 if (m->factor_op != FILE_FACTOR_OP_NONE) { 2251 file_magwarn(ms, 2252 "Current entry already has a strength type: %c %d", 2253 m->factor_op, m->factor); 2254 return -1; 2255 } 2256 if (m->type == FILE_NAME) { 2257 file_magwarn(ms, "%s: Strength setting is not supported in " 2258 "\"name\" magic entries", m->value.s); 2259 return -1; 2260 } 2261 EATAB; 2262 switch (*l) { 2263 case FILE_FACTOR_OP_NONE: 2264 case FILE_FACTOR_OP_PLUS: 2265 case FILE_FACTOR_OP_MINUS: 2266 case FILE_FACTOR_OP_TIMES: 2267 case FILE_FACTOR_OP_DIV: 2268 m->factor_op = *l++; 2269 break; 2270 default: 2271 file_magwarn(ms, "Unknown factor op `%c'", *l); 2272 return -1; 2273 } 2274 EATAB; 2275 factor = strtoul(l, &el, 0); 2276 if (factor > 255) { 2277 file_magwarn(ms, "Too large factor `%lu'", factor); 2278 goto out; 2279 } 2280 if (*el && !isspace(CAST(unsigned char, *el))) { 2281 file_magwarn(ms, "Bad factor `%s'", l); 2282 goto out; 2283 } 2284 m->factor = CAST(uint8_t, factor); 2285 if (m->factor == 0 && m->factor_op == FILE_FACTOR_OP_DIV) { 2286 file_magwarn(ms, "Cannot have factor op `%c' and factor %u", 2287 m->factor_op, m->factor); 2288 goto out; 2289 } 2290 return 0; 2291 out: 2292 m->factor_op = FILE_FACTOR_OP_NONE; 2293 m->factor = 0; 2294 return -1; 2295 } 2296 2297 private int 2298 goodchar(unsigned char x, const char *extra) 2299 { 2300 return (isascii(x) && isalnum(x)) || strchr(extra, x); 2301 } 2302 2303 private int 2304 parse_extra(struct magic_set *ms, struct magic_entry *me, const char *line, 2305 off_t off, size_t len, const char *name, const char *extra, int nt) 2306 { 2307 size_t i; 2308 const char *l = line; 2309 struct magic *m = &me->mp[me->cont_count == 0 ? 0 : me->cont_count - 1]; 2310 char *buf = CAST(char *, CAST(void *, m)) + off; 2311 2312 if (buf[0] != '\0') { 2313 len = nt ? strlen(buf) : len; 2314 file_magwarn(ms, "Current entry already has a %s type " 2315 "`%.*s', new type `%s'", name, CAST(int, len), buf, l); 2316 return -1; 2317 } 2318 2319 if (*m->desc == '\0') { 2320 file_magwarn(ms, "Current entry does not yet have a " 2321 "description for adding a %s type", name); 2322 return -1; 2323 } 2324 2325 EATAB; 2326 for (i = 0; *l && i < len && goodchar(*l, extra); buf[i++] = *l++) 2327 continue; 2328 2329 if (i == len && *l) { 2330 if (nt) 2331 buf[len - 1] = '\0'; 2332 if (ms->flags & MAGIC_CHECK) 2333 file_magwarn(ms, "%s type `%s' truncated %" 2334 SIZE_T_FORMAT "u", name, line, i); 2335 } else { 2336 if (!isspace(CAST(unsigned char, *l)) && !goodchar(*l, extra)) 2337 file_magwarn(ms, "%s type `%s' has bad char '%c'", 2338 name, line, *l); 2339 if (nt) 2340 buf[i] = '\0'; 2341 } 2342 2343 if (i > 0) 2344 return 0; 2345 2346 file_magerror(ms, "Bad magic entry '%s'", line); 2347 return -1; 2348 } 2349 2350 /* 2351 * Parse an Apple CREATOR/TYPE annotation from magic file and put it into 2352 * magic[index - 1] 2353 */ 2354 private int 2355 parse_apple(struct magic_set *ms, struct magic_entry *me, const char *line) 2356 { 2357 struct magic *m = &me->mp[0]; 2358 2359 return parse_extra(ms, me, line, 2360 CAST(off_t, offsetof(struct magic, apple)), 2361 sizeof(m->apple), "APPLE", "!+-./?", 0); 2362 } 2363 2364 /* 2365 * Parse a comma-separated list of extensions 2366 */ 2367 private int 2368 parse_ext(struct magic_set *ms, struct magic_entry *me, const char *line) 2369 { 2370 struct magic *m = &me->mp[0]; 2371 2372 return parse_extra(ms, me, line, 2373 CAST(off_t, offsetof(struct magic, ext)), 2374 sizeof(m->ext), "EXTENSION", ",!+-/@?_$", 0); 2375 } 2376 2377 /* 2378 * parse a MIME annotation line from magic file, put into magic[index - 1] 2379 * if valid 2380 */ 2381 private int 2382 parse_mime(struct magic_set *ms, struct magic_entry *me, const char *line) 2383 { 2384 struct magic *m = &me->mp[0]; 2385 2386 return parse_extra(ms, me, line, 2387 CAST(off_t, offsetof(struct magic, mimetype)), 2388 sizeof(m->mimetype), "MIME", "+-/.$?:{}", 1); 2389 } 2390 2391 private int 2392 check_format_type(const char *ptr, int type, const char **estr) 2393 { 2394 int quad = 0, h; 2395 size_t len, cnt; 2396 if (*ptr == '\0') { 2397 /* Missing format string; bad */ 2398 *estr = "missing format spec"; 2399 return -1; 2400 } 2401 2402 switch (file_formats[type]) { 2403 case FILE_FMT_QUAD: 2404 quad = 1; 2405 /*FALLTHROUGH*/ 2406 case FILE_FMT_NUM: 2407 if (quad == 0) { 2408 switch (type) { 2409 case FILE_BYTE: 2410 h = 2; 2411 break; 2412 case FILE_SHORT: 2413 case FILE_BESHORT: 2414 case FILE_LESHORT: 2415 h = 1; 2416 break; 2417 case FILE_LONG: 2418 case FILE_BELONG: 2419 case FILE_LELONG: 2420 case FILE_MELONG: 2421 case FILE_LEID3: 2422 case FILE_BEID3: 2423 case FILE_INDIRECT: 2424 h = 0; 2425 break; 2426 default: 2427 abort(); 2428 } 2429 } else 2430 h = 0; 2431 if (*ptr == '-') 2432 ptr++; 2433 if (*ptr == '.') 2434 ptr++; 2435 if (*ptr == '#') 2436 ptr++; 2437 #define CHECKLEN() do { \ 2438 for (len = cnt = 0; isdigit(CAST(unsigned char, *ptr)); ptr++, cnt++) \ 2439 len = len * 10 + (*ptr - '0'); \ 2440 if (cnt > 5 || len > 1024) \ 2441 goto toolong; \ 2442 } while (/*CONSTCOND*/0) 2443 2444 CHECKLEN(); 2445 if (*ptr == '.') 2446 ptr++; 2447 CHECKLEN(); 2448 if (quad) { 2449 if (*ptr++ != 'l') 2450 goto invalid; 2451 if (*ptr++ != 'l') 2452 goto invalid; 2453 } 2454 2455 switch (*ptr++) { 2456 #ifdef STRICT_FORMAT /* "long" formats are int formats for us */ 2457 /* so don't accept the 'l' modifier */ 2458 case 'l': 2459 switch (*ptr++) { 2460 case 'i': 2461 case 'd': 2462 case 'u': 2463 case 'o': 2464 case 'x': 2465 case 'X': 2466 if (h == 0) 2467 return 0; 2468 /*FALLTHROUGH*/ 2469 default: 2470 goto invalid; 2471 } 2472 2473 /* 2474 * Don't accept h and hh modifiers. They make writing 2475 * magic entries more complicated, for very little benefit 2476 */ 2477 case 'h': 2478 if (h-- <= 0) 2479 goto invalid; 2480 switch (*ptr++) { 2481 case 'h': 2482 if (h-- <= 0) 2483 goto invalid; 2484 switch (*ptr++) { 2485 case 'i': 2486 case 'd': 2487 case 'u': 2488 case 'o': 2489 case 'x': 2490 case 'X': 2491 return 0; 2492 default: 2493 goto invalid; 2494 } 2495 case 'i': 2496 case 'd': 2497 case 'u': 2498 case 'o': 2499 case 'x': 2500 case 'X': 2501 if (h == 0) 2502 return 0; 2503 /*FALLTHROUGH*/ 2504 default: 2505 goto invalid; 2506 } 2507 #endif 2508 case 'c': 2509 if (h == 2) 2510 return 0; 2511 goto invalid; 2512 case 'i': 2513 case 'd': 2514 case 'u': 2515 case 'o': 2516 case 'x': 2517 case 'X': 2518 #ifdef STRICT_FORMAT 2519 if (h == 0) 2520 return 0; 2521 /*FALLTHROUGH*/ 2522 #else 2523 return 0; 2524 #endif 2525 default: 2526 goto invalid; 2527 } 2528 2529 case FILE_FMT_FLOAT: 2530 case FILE_FMT_DOUBLE: 2531 if (*ptr == '-') 2532 ptr++; 2533 if (*ptr == '.') 2534 ptr++; 2535 CHECKLEN(); 2536 if (*ptr == '.') 2537 ptr++; 2538 CHECKLEN(); 2539 switch (*ptr++) { 2540 case 'e': 2541 case 'E': 2542 case 'f': 2543 case 'F': 2544 case 'g': 2545 case 'G': 2546 return 0; 2547 2548 default: 2549 goto invalid; 2550 } 2551 2552 2553 case FILE_FMT_STR: 2554 if (*ptr == '-') 2555 ptr++; 2556 while (isdigit(CAST(unsigned char, *ptr))) 2557 ptr++; 2558 if (*ptr == '.') { 2559 ptr++; 2560 while (isdigit(CAST(unsigned char , *ptr))) 2561 ptr++; 2562 } 2563 2564 switch (*ptr++) { 2565 case 's': 2566 return 0; 2567 default: 2568 goto invalid; 2569 } 2570 2571 default: 2572 /* internal error */ 2573 abort(); 2574 } 2575 invalid: 2576 *estr = "not valid"; 2577 toolong: 2578 *estr = "too long"; 2579 return -1; 2580 } 2581 2582 /* 2583 * Check that the optional printf format in description matches 2584 * the type of the magic. 2585 */ 2586 private int 2587 check_format(struct magic_set *ms, struct magic *m) 2588 { 2589 char *ptr; 2590 const char *estr; 2591 2592 for (ptr = m->desc; *ptr; ptr++) 2593 if (*ptr == '%') 2594 break; 2595 if (*ptr == '\0') { 2596 /* No format string; ok */ 2597 return 1; 2598 } 2599 2600 assert(file_nformats == file_nnames); 2601 2602 if (m->type >= file_nformats) { 2603 file_magwarn(ms, "Internal error inconsistency between " 2604 "m->type and format strings"); 2605 return -1; 2606 } 2607 if (file_formats[m->type] == FILE_FMT_NONE) { 2608 file_magwarn(ms, "No format string for `%s' with description " 2609 "`%s'", m->desc, file_names[m->type]); 2610 return -1; 2611 } 2612 2613 ptr++; 2614 if (check_format_type(ptr, m->type, &estr) == -1) { 2615 /* 2616 * TODO: this error message is unhelpful if the format 2617 * string is not one character long 2618 */ 2619 file_magwarn(ms, "Printf format is %s for type " 2620 "`%s' in description `%s'", estr, 2621 file_names[m->type], m->desc); 2622 return -1; 2623 } 2624 2625 for (; *ptr; ptr++) { 2626 if (*ptr == '%') { 2627 file_magwarn(ms, 2628 "Too many format strings (should have at most one) " 2629 "for `%s' with description `%s'", 2630 file_names[m->type], m->desc); 2631 return -1; 2632 } 2633 } 2634 return 0; 2635 } 2636 2637 /* 2638 * Read a numeric value from a pointer, into the value union of a magic 2639 * pointer, according to the magic type. Update the string pointer to point 2640 * just after the number read. Return 0 for success, non-zero for failure. 2641 */ 2642 private int 2643 getvalue(struct magic_set *ms, struct magic *m, const char **p, int action) 2644 { 2645 char *ep; 2646 uint64_t ull; 2647 2648 switch (m->type) { 2649 case FILE_BESTRING16: 2650 case FILE_LESTRING16: 2651 case FILE_STRING: 2652 case FILE_PSTRING: 2653 case FILE_REGEX: 2654 case FILE_SEARCH: 2655 case FILE_NAME: 2656 case FILE_USE: 2657 case FILE_DER: 2658 *p = getstr(ms, m, *p, action == FILE_COMPILE); 2659 if (*p == NULL) { 2660 if (ms->flags & MAGIC_CHECK) 2661 file_magwarn(ms, "cannot get string from `%s'", 2662 m->value.s); 2663 return -1; 2664 } 2665 if (m->type == FILE_REGEX) { 2666 file_regex_t rx; 2667 int rc = file_regcomp(&rx, m->value.s, REG_EXTENDED); 2668 if (rc) { 2669 if (ms->flags & MAGIC_CHECK) 2670 file_regerror(&rx, rc, ms); 2671 } 2672 file_regfree(&rx); 2673 return rc ? -1 : 0; 2674 } 2675 return 0; 2676 default: 2677 if (m->reln == 'x') 2678 return 0; 2679 break; 2680 } 2681 2682 switch (m->type) { 2683 case FILE_FLOAT: 2684 case FILE_BEFLOAT: 2685 case FILE_LEFLOAT: 2686 errno = 0; 2687 #ifdef HAVE_STRTOF 2688 m->value.f = strtof(*p, &ep); 2689 #else 2690 m->value.f = (float)strtod(*p, &ep); 2691 #endif 2692 if (errno == 0) 2693 *p = ep; 2694 return 0; 2695 case FILE_DOUBLE: 2696 case FILE_BEDOUBLE: 2697 case FILE_LEDOUBLE: 2698 errno = 0; 2699 m->value.d = strtod(*p, &ep); 2700 if (errno == 0) 2701 *p = ep; 2702 return 0; 2703 default: 2704 errno = 0; 2705 ull = CAST(uint64_t, strtoull(*p, &ep, 0)); 2706 m->value.q = file_signextend(ms, m, ull); 2707 if (*p == ep) { 2708 file_magwarn(ms, "Unparseable number `%s'", *p); 2709 } else { 2710 size_t ts = typesize(m->type); 2711 uint64_t x; 2712 const char *q; 2713 2714 if (ts == CAST(size_t, ~0)) { 2715 file_magwarn(ms, 2716 "Expected numeric type got `%s'", 2717 type_tbl[m->type].name); 2718 } 2719 for (q = *p; isspace(CAST(unsigned char, *q)); q++) 2720 continue; 2721 if (*q == '-') 2722 ull = -CAST(int64_t, ull); 2723 switch (ts) { 2724 case 1: 2725 x = CAST(uint64_t, ull & ~0xffULL); 2726 break; 2727 case 2: 2728 x = CAST(uint64_t, ull & ~0xffffULL); 2729 break; 2730 case 4: 2731 x = CAST(uint64_t, ull & ~0xffffffffULL); 2732 break; 2733 case 8: 2734 x = 0; 2735 break; 2736 default: 2737 abort(); 2738 } 2739 if (x) { 2740 file_magwarn(ms, "Overflow for numeric" 2741 " type `%s' value %#" PRIx64, 2742 type_tbl[m->type].name, ull); 2743 } 2744 } 2745 if (errno == 0) { 2746 *p = ep; 2747 eatsize(p); 2748 } 2749 return 0; 2750 } 2751 } 2752 2753 /* 2754 * Convert a string containing C character escapes. Stop at an unescaped 2755 * space or tab. 2756 * Copy the converted version to "m->value.s", and the length in m->vallen. 2757 * Return updated scan pointer as function result. Warn if set. 2758 */ 2759 private const char * 2760 getstr(struct magic_set *ms, struct magic *m, const char *s, int warn) 2761 { 2762 const char *origs = s; 2763 char *p = m->value.s; 2764 size_t plen = sizeof(m->value.s); 2765 char *origp = p; 2766 char *pmax = p + plen - 1; 2767 int c; 2768 int val; 2769 2770 while ((c = *s++) != '\0') { 2771 if (isspace(CAST(unsigned char, c))) 2772 break; 2773 if (p >= pmax) { 2774 file_error(ms, 0, "string too long: `%s'", origs); 2775 return NULL; 2776 } 2777 if (c == '\\') { 2778 switch(c = *s++) { 2779 2780 case '\0': 2781 if (warn) 2782 file_magwarn(ms, "incomplete escape"); 2783 s--; 2784 goto out; 2785 2786 case '\t': 2787 if (warn) { 2788 file_magwarn(ms, 2789 "escaped tab found, use \\t instead"); 2790 warn = 0; /* already did */ 2791 } 2792 /*FALLTHROUGH*/ 2793 default: 2794 if (warn) { 2795 if (isprint(CAST(unsigned char, c))) { 2796 /* Allow escaping of 2797 * ``relations'' */ 2798 if (strchr("<>&^=!", c) == NULL 2799 && (m->type != FILE_REGEX || 2800 strchr("[]().*?^$|{}", c) 2801 == NULL)) { 2802 file_magwarn(ms, "no " 2803 "need to escape " 2804 "`%c'", c); 2805 } 2806 } else { 2807 file_magwarn(ms, 2808 "unknown escape sequence: " 2809 "\\%03o", c); 2810 } 2811 } 2812 /*FALLTHROUGH*/ 2813 /* space, perhaps force people to use \040? */ 2814 case ' ': 2815 #if 0 2816 /* 2817 * Other things people escape, but shouldn't need to, 2818 * so we disallow them 2819 */ 2820 case '\'': 2821 case '"': 2822 case '?': 2823 #endif 2824 /* Relations */ 2825 case '>': 2826 case '<': 2827 case '&': 2828 case '^': 2829 case '=': 2830 case '!': 2831 /* and baskslash itself */ 2832 case '\\': 2833 *p++ = CAST(char, c); 2834 break; 2835 2836 case 'a': 2837 *p++ = '\a'; 2838 break; 2839 2840 case 'b': 2841 *p++ = '\b'; 2842 break; 2843 2844 case 'f': 2845 *p++ = '\f'; 2846 break; 2847 2848 case 'n': 2849 *p++ = '\n'; 2850 break; 2851 2852 case 'r': 2853 *p++ = '\r'; 2854 break; 2855 2856 case 't': 2857 *p++ = '\t'; 2858 break; 2859 2860 case 'v': 2861 *p++ = '\v'; 2862 break; 2863 2864 /* \ and up to 3 octal digits */ 2865 case '0': 2866 case '1': 2867 case '2': 2868 case '3': 2869 case '4': 2870 case '5': 2871 case '6': 2872 case '7': 2873 val = c - '0'; 2874 c = *s++; /* try for 2 */ 2875 if (c >= '0' && c <= '7') { 2876 val = (val << 3) | (c - '0'); 2877 c = *s++; /* try for 3 */ 2878 if (c >= '0' && c <= '7') 2879 val = (val << 3) | (c-'0'); 2880 else 2881 --s; 2882 } 2883 else 2884 --s; 2885 *p++ = CAST(char, val); 2886 break; 2887 2888 /* \x and up to 2 hex digits */ 2889 case 'x': 2890 val = 'x'; /* Default if no digits */ 2891 c = hextoint(*s++); /* Get next char */ 2892 if (c >= 0) { 2893 val = c; 2894 c = hextoint(*s++); 2895 if (c >= 0) 2896 val = (val << 4) + c; 2897 else 2898 --s; 2899 } else 2900 --s; 2901 *p++ = CAST(char, val); 2902 break; 2903 } 2904 } else 2905 *p++ = CAST(char, c); 2906 } 2907 --s; 2908 out: 2909 *p = '\0'; 2910 m->vallen = CAST(unsigned char, (p - origp)); 2911 if (m->type == FILE_PSTRING) 2912 m->vallen += CAST(unsigned char, file_pstring_length_size(m)); 2913 return s; 2914 } 2915 2916 2917 /* Single hex char to int; -1 if not a hex char. */ 2918 private int 2919 hextoint(int c) 2920 { 2921 if (!isascii(CAST(unsigned char, c))) 2922 return -1; 2923 if (isdigit(CAST(unsigned char, c))) 2924 return c - '0'; 2925 if ((c >= 'a') && (c <= 'f')) 2926 return c + 10 - 'a'; 2927 if (( c>= 'A') && (c <= 'F')) 2928 return c + 10 - 'A'; 2929 return -1; 2930 } 2931 2932 2933 /* 2934 * Print a string containing C character escapes. 2935 */ 2936 protected void 2937 file_showstr(FILE *fp, const char *s, size_t len) 2938 { 2939 char c; 2940 2941 for (;;) { 2942 if (len == ~0U) { 2943 c = *s++; 2944 if (c == '\0') 2945 break; 2946 } 2947 else { 2948 if (len-- == 0) 2949 break; 2950 c = *s++; 2951 } 2952 if (c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */ 2953 (void) fputc(c, fp); 2954 else { 2955 (void) fputc('\\', fp); 2956 switch (c) { 2957 case '\a': 2958 (void) fputc('a', fp); 2959 break; 2960 2961 case '\b': 2962 (void) fputc('b', fp); 2963 break; 2964 2965 case '\f': 2966 (void) fputc('f', fp); 2967 break; 2968 2969 case '\n': 2970 (void) fputc('n', fp); 2971 break; 2972 2973 case '\r': 2974 (void) fputc('r', fp); 2975 break; 2976 2977 case '\t': 2978 (void) fputc('t', fp); 2979 break; 2980 2981 case '\v': 2982 (void) fputc('v', fp); 2983 break; 2984 2985 default: 2986 (void) fprintf(fp, "%.3o", c & 0377); 2987 break; 2988 } 2989 } 2990 } 2991 } 2992 2993 /* 2994 * eatsize(): Eat the size spec from a number [eg. 10UL] 2995 */ 2996 private void 2997 eatsize(const char **p) 2998 { 2999 const char *l = *p; 3000 3001 if (LOWCASE(*l) == 'u') 3002 l++; 3003 3004 switch (LOWCASE(*l)) { 3005 case 'l': /* long */ 3006 case 's': /* short */ 3007 case 'h': /* short */ 3008 case 'b': /* char/byte */ 3009 case 'c': /* char/byte */ 3010 l++; 3011 /*FALLTHROUGH*/ 3012 default: 3013 break; 3014 } 3015 3016 *p = l; 3017 } 3018 3019 /* 3020 * handle a buffer containing a compiled file. 3021 */ 3022 private struct magic_map * 3023 apprentice_buf(struct magic_set *ms, struct magic *buf, size_t len) 3024 { 3025 struct magic_map *map; 3026 3027 if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) { 3028 file_oomem(ms, sizeof(*map)); 3029 return NULL; 3030 } 3031 map->len = len; 3032 map->p = buf; 3033 map->type = MAP_TYPE_USER; 3034 if (check_buffer(ms, map, "buffer") != 0) { 3035 apprentice_unmap(map); 3036 return NULL; 3037 } 3038 return map; 3039 } 3040 3041 /* 3042 * handle a compiled file. 3043 */ 3044 3045 private struct magic_map * 3046 apprentice_map(struct magic_set *ms, const char *fn) 3047 { 3048 int fd; 3049 struct stat st; 3050 char *dbname = NULL; 3051 struct magic_map *map; 3052 struct magic_map *rv = NULL; 3053 3054 fd = -1; 3055 if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) { 3056 file_oomem(ms, sizeof(*map)); 3057 goto error; 3058 } 3059 map->type = MAP_TYPE_USER; /* unspecified */ 3060 3061 dbname = mkdbname(ms, fn, 0); 3062 if (dbname == NULL) 3063 goto error; 3064 3065 if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1) 3066 goto error; 3067 3068 if (fstat(fd, &st) == -1) { 3069 file_error(ms, errno, "cannot stat `%s'", dbname); 3070 goto error; 3071 } 3072 if (st.st_size < 8 || st.st_size > maxoff_t()) { 3073 file_error(ms, 0, "file `%s' is too %s", dbname, 3074 st.st_size < 8 ? "small" : "large"); 3075 goto error; 3076 } 3077 3078 map->len = CAST(size_t, st.st_size); 3079 #ifdef QUICK 3080 map->type = MAP_TYPE_MMAP; 3081 if ((map->p = mmap(0, CAST(size_t, st.st_size), PROT_READ|PROT_WRITE, 3082 MAP_PRIVATE|MAP_FILE, fd, CAST(off_t, 0))) == MAP_FAILED) { 3083 file_error(ms, errno, "cannot map `%s'", dbname); 3084 goto error; 3085 } 3086 #else 3087 map->type = MAP_TYPE_MALLOC; 3088 if ((map->p = CAST(void *, malloc(map->len))) == NULL) { 3089 file_oomem(ms, map->len); 3090 goto error; 3091 } 3092 if (read(fd, map->p, map->len) != (ssize_t)map->len) { 3093 file_badread(ms); 3094 goto error; 3095 } 3096 #define RET 1 3097 #endif 3098 (void)close(fd); 3099 fd = -1; 3100 3101 if (check_buffer(ms, map, dbname) != 0) { 3102 rv = RCAST(struct magic_map *, -1); 3103 goto error; 3104 } 3105 #ifdef QUICK 3106 if (mprotect(map->p, CAST(size_t, st.st_size), PROT_READ) == -1) { 3107 file_error(ms, errno, "cannot mprotect `%s'", dbname); 3108 goto error; 3109 } 3110 #endif 3111 3112 free(dbname); 3113 return map; 3114 3115 error: 3116 if (fd != -1) 3117 (void)close(fd); 3118 apprentice_unmap(map); 3119 free(dbname); 3120 return rv; 3121 } 3122 3123 private int 3124 check_buffer(struct magic_set *ms, struct magic_map *map, const char *dbname) 3125 { 3126 uint32_t *ptr; 3127 uint32_t entries, nentries; 3128 uint32_t version; 3129 int i, needsbyteswap; 3130 3131 ptr = CAST(uint32_t *, map->p); 3132 if (*ptr != MAGICNO) { 3133 if (swap4(*ptr) != MAGICNO) { 3134 file_error(ms, 0, "bad magic in `%s'", dbname); 3135 return -1; 3136 } 3137 needsbyteswap = 1; 3138 } else 3139 needsbyteswap = 0; 3140 if (needsbyteswap) 3141 version = swap4(ptr[1]); 3142 else 3143 version = ptr[1]; 3144 if (version != VERSIONNO) { 3145 file_error(ms, 0, "File %s supports only version %d magic " 3146 "files. `%s' is version %d", VERSION, 3147 VERSIONNO, dbname, version); 3148 return -1; 3149 } 3150 entries = CAST(uint32_t, map->len / sizeof(struct magic)); 3151 if ((entries * sizeof(struct magic)) != map->len) { 3152 file_error(ms, 0, "Size of `%s' %" SIZE_T_FORMAT "u is not " 3153 "a multiple of %" SIZE_T_FORMAT "u", 3154 dbname, map->len, sizeof(struct magic)); 3155 return -1; 3156 } 3157 map->magic[0] = CAST(struct magic *, map->p) + 1; 3158 nentries = 0; 3159 for (i = 0; i < MAGIC_SETS; i++) { 3160 if (needsbyteswap) 3161 map->nmagic[i] = swap4(ptr[i + 2]); 3162 else 3163 map->nmagic[i] = ptr[i + 2]; 3164 if (i != MAGIC_SETS - 1) 3165 map->magic[i + 1] = map->magic[i] + map->nmagic[i]; 3166 nentries += map->nmagic[i]; 3167 } 3168 if (entries != nentries + 1) { 3169 file_error(ms, 0, "Inconsistent entries in `%s' %u != %u", 3170 dbname, entries, nentries + 1); 3171 return -1; 3172 } 3173 if (needsbyteswap) 3174 for (i = 0; i < MAGIC_SETS; i++) 3175 byteswap(map->magic[i], map->nmagic[i]); 3176 return 0; 3177 } 3178 3179 /* 3180 * handle an mmaped file. 3181 */ 3182 private int 3183 apprentice_compile(struct magic_set *ms, struct magic_map *map, const char *fn) 3184 { 3185 static const size_t nm = sizeof(*map->nmagic) * MAGIC_SETS; 3186 static const size_t m = sizeof(**map->magic); 3187 int fd = -1; 3188 size_t len; 3189 char *dbname; 3190 int rv = -1; 3191 uint32_t i; 3192 union { 3193 struct magic m; 3194 uint32_t h[2 + MAGIC_SETS]; 3195 } hdr; 3196 3197 dbname = mkdbname(ms, fn, 1); 3198 3199 if (dbname == NULL) 3200 goto out; 3201 3202 if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1) 3203 { 3204 file_error(ms, errno, "cannot open `%s'", dbname); 3205 goto out; 3206 } 3207 memset(&hdr, 0, sizeof(hdr)); 3208 hdr.h[0] = MAGICNO; 3209 hdr.h[1] = VERSIONNO; 3210 memcpy(hdr.h + 2, map->nmagic, nm); 3211 3212 if (write(fd, &hdr, sizeof(hdr)) != CAST(ssize_t, sizeof(hdr))) { 3213 file_error(ms, errno, "error writing `%s'", dbname); 3214 goto out2; 3215 } 3216 3217 for (i = 0; i < MAGIC_SETS; i++) { 3218 len = m * map->nmagic[i]; 3219 if (write(fd, map->magic[i], len) != CAST(ssize_t, len)) { 3220 file_error(ms, errno, "error writing `%s'", dbname); 3221 goto out2; 3222 } 3223 } 3224 3225 rv = 0; 3226 out2: 3227 if (fd != -1) 3228 (void)close(fd); 3229 out: 3230 apprentice_unmap(map); 3231 free(dbname); 3232 return rv; 3233 } 3234 3235 private const char ext[] = ".mgc"; 3236 /* 3237 * make a dbname 3238 */ 3239 private char * 3240 mkdbname(struct magic_set *ms, const char *fn, int strip) 3241 { 3242 const char *p, *q; 3243 char *buf; 3244 3245 if (strip) { 3246 if ((p = strrchr(fn, '/')) != NULL) 3247 fn = ++p; 3248 } 3249 3250 for (q = fn; *q; q++) 3251 continue; 3252 /* Look for .mgc */ 3253 for (p = ext + sizeof(ext) - 1; p >= ext && q >= fn; p--, q--) 3254 if (*p != *q) 3255 break; 3256 3257 /* Did not find .mgc, restore q */ 3258 if (p >= ext) 3259 while (*q) 3260 q++; 3261 3262 q++; 3263 /* Compatibility with old code that looked in .mime */ 3264 if (ms->flags & MAGIC_MIME) { 3265 if (asprintf(&buf, "%.*s.mime%s", CAST(int, q - fn), fn, ext) 3266 < 0) 3267 return NULL; 3268 if (access(buf, R_OK) != -1) { 3269 ms->flags &= MAGIC_MIME_TYPE; 3270 return buf; 3271 } 3272 free(buf); 3273 } 3274 if (asprintf(&buf, "%.*s%s", CAST(int, q - fn), fn, ext) < 0) 3275 return NULL; 3276 3277 /* Compatibility with old code that looked in .mime */ 3278 if (strstr(fn, ".mime") != NULL) 3279 ms->flags &= MAGIC_MIME_TYPE; 3280 return buf; 3281 } 3282 3283 /* 3284 * Byteswap an mmap'ed file if needed 3285 */ 3286 private void 3287 byteswap(struct magic *magic, uint32_t nmagic) 3288 { 3289 uint32_t i; 3290 for (i = 0; i < nmagic; i++) 3291 bs1(&magic[i]); 3292 } 3293 3294 /* 3295 * swap a short 3296 */ 3297 private uint16_t 3298 swap2(uint16_t sv) 3299 { 3300 uint16_t rv; 3301 uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); 3302 uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); 3303 d[0] = s[1]; 3304 d[1] = s[0]; 3305 return rv; 3306 } 3307 3308 /* 3309 * swap an int 3310 */ 3311 private uint32_t 3312 swap4(uint32_t sv) 3313 { 3314 uint32_t rv; 3315 uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); 3316 uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); 3317 d[0] = s[3]; 3318 d[1] = s[2]; 3319 d[2] = s[1]; 3320 d[3] = s[0]; 3321 return rv; 3322 } 3323 3324 /* 3325 * swap a quad 3326 */ 3327 private uint64_t 3328 swap8(uint64_t sv) 3329 { 3330 uint64_t rv; 3331 uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); 3332 uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); 3333 #if 0 3334 d[0] = s[3]; 3335 d[1] = s[2]; 3336 d[2] = s[1]; 3337 d[3] = s[0]; 3338 d[4] = s[7]; 3339 d[5] = s[6]; 3340 d[6] = s[5]; 3341 d[7] = s[4]; 3342 #else 3343 d[0] = s[7]; 3344 d[1] = s[6]; 3345 d[2] = s[5]; 3346 d[3] = s[4]; 3347 d[4] = s[3]; 3348 d[5] = s[2]; 3349 d[6] = s[1]; 3350 d[7] = s[0]; 3351 #endif 3352 return rv; 3353 } 3354 3355 /* 3356 * byteswap a single magic entry 3357 */ 3358 private void 3359 bs1(struct magic *m) 3360 { 3361 m->cont_level = swap2(m->cont_level); 3362 m->offset = swap4(CAST(uint32_t, m->offset)); 3363 m->in_offset = swap4(CAST(uint32_t, m->in_offset)); 3364 m->lineno = swap4(CAST(uint32_t, m->lineno)); 3365 if (IS_STRING(m->type)) { 3366 m->str_range = swap4(m->str_range); 3367 m->str_flags = swap4(m->str_flags); 3368 } 3369 else { 3370 m->value.q = swap8(m->value.q); 3371 m->num_mask = swap8(m->num_mask); 3372 } 3373 } 3374 3375 protected size_t 3376 file_pstring_length_size(const struct magic *m) 3377 { 3378 switch (m->str_flags & PSTRING_LEN) { 3379 case PSTRING_1_LE: 3380 return 1; 3381 case PSTRING_2_LE: 3382 case PSTRING_2_BE: 3383 return 2; 3384 case PSTRING_4_LE: 3385 case PSTRING_4_BE: 3386 return 4; 3387 default: 3388 abort(); /* Impossible */ 3389 return 1; 3390 } 3391 } 3392 protected size_t 3393 file_pstring_get_length(const struct magic *m, const char *ss) 3394 { 3395 size_t len = 0; 3396 const unsigned char *s = RCAST(const unsigned char *, ss); 3397 unsigned int s3, s2, s1, s0; 3398 3399 switch (m->str_flags & PSTRING_LEN) { 3400 case PSTRING_1_LE: 3401 len = *s; 3402 break; 3403 case PSTRING_2_LE: 3404 s0 = s[0]; 3405 s1 = s[1]; 3406 len = (s1 << 8) | s0; 3407 break; 3408 case PSTRING_2_BE: 3409 s0 = s[0]; 3410 s1 = s[1]; 3411 len = (s0 << 8) | s1; 3412 break; 3413 case PSTRING_4_LE: 3414 s0 = s[0]; 3415 s1 = s[1]; 3416 s2 = s[2]; 3417 s3 = s[3]; 3418 len = (s3 << 24) | (s2 << 16) | (s1 << 8) | s0; 3419 break; 3420 case PSTRING_4_BE: 3421 s0 = s[0]; 3422 s1 = s[1]; 3423 s2 = s[2]; 3424 s3 = s[3]; 3425 len = (s0 << 24) | (s1 << 16) | (s2 << 8) | s3; 3426 break; 3427 default: 3428 abort(); /* Impossible */ 3429 } 3430 3431 if (m->str_flags & PSTRING_LENGTH_INCLUDES_ITSELF) 3432 len -= file_pstring_length_size(m); 3433 3434 return len; 3435 } 3436 3437 protected int 3438 file_magicfind(struct magic_set *ms, const char *name, struct mlist *v) 3439 { 3440 uint32_t i, j; 3441 struct mlist *mlist, *ml; 3442 3443 mlist = ms->mlist[1]; 3444 3445 for (ml = mlist->next; ml != mlist; ml = ml->next) { 3446 struct magic *ma = ml->magic; 3447 uint32_t nma = ml->nmagic; 3448 for (i = 0; i < nma; i++) { 3449 if (ma[i].type != FILE_NAME) 3450 continue; 3451 if (strcmp(ma[i].value.s, name) == 0) { 3452 v->magic = &ma[i]; 3453 for (j = i + 1; j < nma; j++) 3454 if (ma[j].cont_level == 0) 3455 break; 3456 v->nmagic = j - i; 3457 return 0; 3458 } 3459 } 3460 } 3461 return -1; 3462 } 3463