PageRenderTime 32ms CodeModel.GetById 27ms RepoModel.GetById 0ms app.codeStats 1ms

/contrib/file/apprentice.c

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