apprentice.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542
  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. #include "magic.h"
  33. #include <stdlib.h>
  34. #ifdef HAVE_UNISTD_H
  35. #include <unistd.h>
  36. #endif
  37. #include <string.h>
  38. #include <assert.h>
  39. #include <ctype.h>
  40. #include <fcntl.h>
  41. #include <sys/stat.h>
  42. #include <sys/param.h>
  43. #ifdef QUICK
  44. #include <sys/mman.h>
  45. #endif
  46. #ifndef lint
  47. FILE_RCSID("@(#)$Id: apprentice.c,v 1.100 2006/12/11 21:48:49 christos Exp $")
  48. #endif /* lint */
  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. #define IS_PLAINSTRING(t) ((t) == FILE_STRING || (t) == FILE_PSTRING || \
  72. (t) == FILE_BESTRING16 || (t) == FILE_LESTRING16)
  73. #define IS_STRING(t) (IS_PLAINSTRING(t) || (t) == FILE_REGEX || \
  74. (t) == FILE_SEARCH)
  75. struct magic_entry {
  76. struct magic *mp;
  77. uint32_t cont_count;
  78. uint32_t max_count;
  79. };
  80. const int file_formats[] = { FILE_FORMAT_STRING };
  81. const size_t file_nformats = sizeof(file_formats) / sizeof(file_formats[0]);
  82. const char *file_names[] = { FILE_FORMAT_NAME };
  83. const size_t file_nnames = sizeof(file_names) / sizeof(file_names[0]);
  84. private int getvalue(struct magic_set *ms, struct magic *, const char **);
  85. private int hextoint(int);
  86. private const char *getstr(struct magic_set *, const char *, char *, int,
  87. int *);
  88. private int parse(struct magic_set *, struct magic_entry **, uint32_t *,
  89. const char *, size_t, int);
  90. private void eatsize(const char **);
  91. private int apprentice_1(struct magic_set *, const char *, int, struct mlist *);
  92. private size_t apprentice_magic_strength(const struct magic *);
  93. private int apprentice_sort(const void *, const void *);
  94. private int apprentice_file(struct magic_set *, struct magic **, uint32_t *,
  95. const char *, int);
  96. private void byteswap(struct magic *, uint32_t);
  97. private void bs1(struct magic *);
  98. private uint16_t swap2(uint16_t);
  99. private uint32_t swap4(uint32_t);
  100. private uint64_t swap8(uint64_t);
  101. private char *mkdbname(const char *, char *, size_t, int);
  102. private int apprentice_map(struct magic_set *, struct magic **, uint32_t *,
  103. const char *);
  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 size_t maxmagic = 0;
  109. private size_t magicsize = sizeof(struct magic);
  110. #ifdef COMPILE_ONLY
  111. int main(int, char *[]);
  112. int
  113. main(int argc, char *argv[])
  114. {
  115. int ret;
  116. struct magic_set *ms;
  117. char *progname;
  118. if ((progname = strrchr(argv[0], '/')) != NULL)
  119. progname++;
  120. else
  121. progname = argv[0];
  122. if (argc != 2) {
  123. (void)fprintf(stderr, "Usage: %s file\n", progname);
  124. return 1;
  125. }
  126. if ((ms = magic_open(MAGIC_CHECK)) == NULL) {
  127. (void)fprintf(stderr, "%s: %s\n", progname, strerror(errno));
  128. return 1;
  129. }
  130. ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0;
  131. if (ret == 1)
  132. (void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms));
  133. magic_close(ms);
  134. return ret;
  135. }
  136. #endif /* COMPILE_ONLY */
  137. /*
  138. * Handle one file.
  139. */
  140. private int
  141. apprentice_1(struct magic_set *ms, const char *fn, int action,
  142. struct mlist *mlist)
  143. {
  144. struct magic *magic = NULL;
  145. uint32_t nmagic = 0;
  146. struct mlist *ml;
  147. int rv = -1;
  148. int mapped;
  149. if (magicsize != FILE_MAGICSIZE) {
  150. file_error(ms, 0, "magic element size %lu != %lu",
  151. (unsigned long)sizeof(*magic),
  152. (unsigned long)FILE_MAGICSIZE);
  153. return -1;
  154. }
  155. if (action == FILE_COMPILE) {
  156. rv = apprentice_file(ms, &magic, &nmagic, fn, action);
  157. if (rv != 0)
  158. return -1;
  159. rv = apprentice_compile(ms, &magic, &nmagic, fn);
  160. free(magic);
  161. return rv;
  162. }
  163. #ifndef COMPILE_ONLY
  164. if ((rv = apprentice_map(ms, &magic, &nmagic, fn)) == -1) {
  165. if (ms->flags & MAGIC_CHECK)
  166. file_magwarn(ms, "using regular magic file `%s'", fn);
  167. rv = apprentice_file(ms, &magic, &nmagic, fn, action);
  168. if (rv != 0)
  169. return -1;
  170. mapped = 0;
  171. }
  172. mapped = rv;
  173. if (magic == NULL || nmagic == 0) {
  174. file_delmagic(magic, mapped, nmagic);
  175. return -1;
  176. }
  177. if ((ml = malloc(sizeof(*ml))) == NULL) {
  178. file_delmagic(magic, mapped, nmagic);
  179. file_oomem(ms, sizeof(*ml));
  180. return -1;
  181. }
  182. ml->magic = magic;
  183. ml->nmagic = nmagic;
  184. ml->mapped = mapped;
  185. mlist->prev->next = ml;
  186. ml->prev = mlist->prev;
  187. ml->next = mlist;
  188. mlist->prev = ml;
  189. return 0;
  190. #endif /* COMPILE_ONLY */
  191. }
  192. protected void
  193. file_delmagic(struct magic *p, int type, size_t entries)
  194. {
  195. if (p == NULL)
  196. return;
  197. switch (type) {
  198. case 2:
  199. p--;
  200. (void)munmap((void *)p, sizeof(*p) * (entries + 1));
  201. break;
  202. case 1:
  203. p--;
  204. /*FALLTHROUGH*/
  205. case 0:
  206. free(p);
  207. break;
  208. default:
  209. abort();
  210. }
  211. }
  212. /* const char *fn: list of magic files */
  213. protected struct mlist *
  214. file_apprentice(struct magic_set *ms, const char *fn, int action)
  215. {
  216. char *p, *mfn, *afn = NULL;
  217. int file_err, errs = -1;
  218. struct mlist *mlist;
  219. static const char mime[] = ".mime";
  220. if (fn == NULL)
  221. fn = getenv("MAGIC");
  222. if (fn == NULL)
  223. fn = MAGIC;
  224. if ((fn = mfn = strdup(fn)) == NULL) {
  225. file_oomem(ms, strlen(fn));
  226. return NULL;
  227. }
  228. if ((mlist = malloc(sizeof(*mlist))) == NULL) {
  229. free(mfn);
  230. file_oomem(ms, sizeof(*mlist));
  231. return NULL;
  232. }
  233. mlist->next = mlist->prev = mlist;
  234. while (fn) {
  235. p = strchr(fn, PATHSEP);
  236. if (p)
  237. *p++ = '\0';
  238. if (*fn == '\0')
  239. break;
  240. if (ms->flags & MAGIC_MIME) {
  241. size_t len = strlen(fn) + sizeof(mime);
  242. if ((afn = malloc(len)) == NULL) {
  243. free(mfn);
  244. free(mlist);
  245. file_oomem(ms, len);
  246. return NULL;
  247. }
  248. (void)strcpy(afn, fn);
  249. (void)strcat(afn, mime);
  250. fn = afn;
  251. }
  252. file_err = apprentice_1(ms, fn, action, mlist);
  253. if (file_err > errs)
  254. errs = file_err;
  255. if (afn) {
  256. free(afn);
  257. afn = NULL;
  258. }
  259. fn = p;
  260. }
  261. if (errs == -1) {
  262. free(mfn);
  263. free(mlist);
  264. mlist = NULL;
  265. file_error(ms, 0, "could not find any magic files!");
  266. return NULL;
  267. }
  268. free(mfn);
  269. return mlist;
  270. }
  271. /*
  272. * Get weight of this magic entry, for sorting purposes.
  273. */
  274. private size_t
  275. apprentice_magic_strength(const struct magic *m)
  276. {
  277. #define MULT 10
  278. size_t val = 2 * MULT; /* baseline strength */
  279. switch (m->type) {
  280. case FILE_BYTE:
  281. val += 1 * MULT;
  282. break;
  283. case FILE_SHORT:
  284. case FILE_LESHORT:
  285. case FILE_BESHORT:
  286. val += 2 * MULT;
  287. break;
  288. case FILE_LONG:
  289. case FILE_LELONG:
  290. case FILE_BELONG:
  291. case FILE_MELONG:
  292. val += 4 * MULT;
  293. break;
  294. case FILE_PSTRING:
  295. case FILE_STRING:
  296. val += m->vallen * MULT;
  297. break;
  298. case FILE_BESTRING16:
  299. case FILE_LESTRING16:
  300. val += m->vallen * MULT / 2;
  301. break;
  302. case FILE_SEARCH:
  303. case FILE_REGEX:
  304. val += m->vallen;
  305. break;
  306. case FILE_DATE:
  307. case FILE_LEDATE:
  308. case FILE_BEDATE:
  309. case FILE_MEDATE:
  310. case FILE_LDATE:
  311. case FILE_LELDATE:
  312. case FILE_BELDATE:
  313. case FILE_MELDATE:
  314. val += 4 * MULT;
  315. break;
  316. case FILE_QUAD:
  317. case FILE_BEQUAD:
  318. case FILE_LEQUAD:
  319. case FILE_QDATE:
  320. case FILE_LEQDATE:
  321. case FILE_BEQDATE:
  322. case FILE_QLDATE:
  323. case FILE_LEQLDATE:
  324. case FILE_BEQLDATE:
  325. val += 8 * MULT;
  326. break;
  327. default:
  328. val = 0;
  329. (void)fprintf(stderr, "Bad type %d\n", m->type);
  330. abort();
  331. }
  332. switch (m->reln) {
  333. case 'x': /* matches anything penalize */
  334. val = 0;
  335. break;
  336. case '!':
  337. case '=': /* Exact match, prefer */
  338. val += MULT;
  339. break;
  340. case '>':
  341. case '<': /* comparison match reduce strength */
  342. val -= 2 * MULT;
  343. break;
  344. case '^':
  345. case '&': /* masking bits, we could count them too */
  346. val -= MULT;
  347. break;
  348. default:
  349. (void)fprintf(stderr, "Bad relation %c\n", m->reln);
  350. abort();
  351. }
  352. return val;
  353. }
  354. /*
  355. * Sort callback for sorting entries by "strength" (basically length)
  356. */
  357. private int
  358. apprentice_sort(const void *a, const void *b)
  359. {
  360. const struct magic_entry *ma = a;
  361. const struct magic_entry *mb = b;
  362. size_t sa = apprentice_magic_strength(ma->mp);
  363. size_t sb = apprentice_magic_strength(mb->mp);
  364. if (sa == sb)
  365. return 0;
  366. else if (sa > sb)
  367. return -1;
  368. else
  369. return 1;
  370. }
  371. /*
  372. * parse from a file
  373. * const char *fn: name of magic file
  374. */
  375. private int
  376. apprentice_file(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp,
  377. const char *fn, int action)
  378. {
  379. private const char hdr[] =
  380. "cont\toffset\ttype\topcode\tmask\tvalue\tdesc";
  381. FILE *f;
  382. char line[BUFSIZ+1];
  383. int errs = 0;
  384. struct magic_entry *marray;
  385. uint32_t marraycount, i, mentrycount = 0;
  386. size_t lineno = 0;
  387. ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */
  388. f = fopen(ms->file = fn, "r");
  389. if (f == NULL) {
  390. if (errno != ENOENT)
  391. file_error(ms, errno, "cannot read magic file `%s'",
  392. fn);
  393. return -1;
  394. }
  395. maxmagic = MAXMAGIS;
  396. if ((marray = calloc(maxmagic, sizeof(*marray))) == NULL) {
  397. (void)fclose(f);
  398. file_oomem(ms, maxmagic * sizeof(*marray));
  399. return -1;
  400. }
  401. marraycount = 0;
  402. /* print silly verbose header for USG compat. */
  403. if (action == FILE_CHECK)
  404. (void)fprintf(stderr, "%s\n", hdr);
  405. /* read and parse this file */
  406. for (ms->line = 1; fgets(line, BUFSIZ, f) != NULL; ms->line++) {
  407. size_t len;
  408. len = strlen(line);
  409. if (len == 0) /* null line, garbage, etc */
  410. continue;
  411. if (line[len - 1] == '\n') {
  412. lineno++;
  413. line[len - 1] = '\0'; /* delete newline */
  414. }
  415. if (line[0] == '\0') /* empty, do not parse */
  416. continue;
  417. if (line[0] == '#') /* comment, do not parse */
  418. continue;
  419. if (parse(ms, &marray, &marraycount, line, lineno, action) != 0)
  420. errs++;
  421. }
  422. (void)fclose(f);
  423. if (errs)
  424. goto out;
  425. #ifndef NOORDER
  426. qsort(marray, marraycount, sizeof(*marray), apprentice_sort);
  427. #endif
  428. for (i = 0; i < marraycount; i++)
  429. mentrycount += marray[i].cont_count;
  430. if ((*magicp = malloc(sizeof(**magicp) * mentrycount)) == NULL) {
  431. file_oomem(ms, sizeof(**magicp) * mentrycount);
  432. errs++;
  433. goto out;
  434. }
  435. mentrycount = 0;
  436. for (i = 0; i < marraycount; i++) {
  437. (void)memcpy(*magicp + mentrycount, marray[i].mp,
  438. marray[i].cont_count * sizeof(**magicp));
  439. mentrycount += marray[i].cont_count;
  440. }
  441. out:
  442. for (i = 0; i < marraycount; i++)
  443. free(marray[i].mp);
  444. free(marray);
  445. if (errs) {
  446. *magicp = NULL;
  447. *nmagicp = 0;
  448. return errs;
  449. } else {
  450. *nmagicp = mentrycount;
  451. return 0;
  452. }
  453. }
  454. /*
  455. * extend the sign bit if the comparison is to be signed
  456. */
  457. protected uint64_t
  458. file_signextend(struct magic_set *ms, struct magic *m, uint64_t v)
  459. {
  460. if (!(m->flag & UNSIGNED))
  461. switch(m->type) {
  462. /*
  463. * Do not remove the casts below. They are
  464. * vital. When later compared with the data,
  465. * the sign extension must have happened.
  466. */
  467. case FILE_BYTE:
  468. v = (char) v;
  469. break;
  470. case FILE_SHORT:
  471. case FILE_BESHORT:
  472. case FILE_LESHORT:
  473. v = (short) v;
  474. break;
  475. case FILE_DATE:
  476. case FILE_BEDATE:
  477. case FILE_LEDATE:
  478. case FILE_MEDATE:
  479. case FILE_LDATE:
  480. case FILE_BELDATE:
  481. case FILE_LELDATE:
  482. case FILE_MELDATE:
  483. case FILE_LONG:
  484. case FILE_BELONG:
  485. case FILE_LELONG:
  486. case FILE_MELONG:
  487. v = (int32_t) v;
  488. break;
  489. case FILE_QUAD:
  490. case FILE_BEQUAD:
  491. case FILE_LEQUAD:
  492. case FILE_QDATE:
  493. case FILE_QLDATE:
  494. case FILE_BEQDATE:
  495. case FILE_BEQLDATE:
  496. case FILE_LEQDATE:
  497. case FILE_LEQLDATE:
  498. v = (int64_t) v;
  499. break;
  500. case FILE_STRING:
  501. case FILE_PSTRING:
  502. case FILE_BESTRING16:
  503. case FILE_LESTRING16:
  504. case FILE_REGEX:
  505. case FILE_SEARCH:
  506. break;
  507. default:
  508. if (ms->flags & MAGIC_CHECK)
  509. file_magwarn(ms, "cannot happen: m->type=%d\n",
  510. m->type);
  511. return ~0U;
  512. }
  513. return v;
  514. }
  515. /*
  516. * parse one line from magic file, put into magic[index++] if valid
  517. */
  518. private int
  519. parse(struct magic_set *ms, struct magic_entry **mentryp, uint32_t *nmentryp,
  520. const char *line, size_t lineno, int action)
  521. {
  522. size_t i;
  523. struct magic_entry *me;
  524. struct magic *m;
  525. const char *l = line;
  526. char *t;
  527. private const char *fops = FILE_OPS;
  528. uint64_t val;
  529. uint32_t cont_level;
  530. cont_level = 0;
  531. while (*l == '>') {
  532. ++l; /* step over */
  533. cont_level++;
  534. }
  535. #define ALLOC_CHUNK (size_t)10
  536. #define ALLOC_INCR (size_t)200
  537. if (cont_level != 0) {
  538. if (*nmentryp == 0) {
  539. file_error(ms, 0, "No current entry for continuation");
  540. return -1;
  541. }
  542. me = &(*mentryp)[*nmentryp - 1];
  543. if (me->cont_count == me->max_count) {
  544. struct magic *nm;
  545. size_t cnt = me->max_count + ALLOC_CHUNK;
  546. if ((nm = realloc(me->mp, sizeof(*nm) * cnt)) == NULL) {
  547. file_oomem(ms, sizeof(*nm) * cnt);
  548. return -1;
  549. }
  550. me->mp = m = nm;
  551. me->max_count = cnt;
  552. }
  553. m = &me->mp[me->cont_count++];
  554. memset(m, 0, sizeof(*m));
  555. m->cont_level = cont_level;
  556. } else {
  557. if (*nmentryp == maxmagic) {
  558. struct magic_entry *mp;
  559. maxmagic += ALLOC_INCR;
  560. if ((mp = realloc(*mentryp, sizeof(*mp) * maxmagic)) ==
  561. NULL) {
  562. file_oomem(ms, sizeof(*mp) * maxmagic);
  563. return -1;
  564. }
  565. (void)memset(&mp[*nmentryp], 0, sizeof(*mp) *
  566. ALLOC_INCR);
  567. *mentryp = mp;
  568. }
  569. me = &(*mentryp)[*nmentryp];
  570. if (me->mp == NULL) {
  571. if ((m = malloc(sizeof(*m) * ALLOC_CHUNK)) == NULL) {
  572. file_oomem(ms, sizeof(*m) * ALLOC_CHUNK);
  573. return -1;
  574. }
  575. me->mp = m;
  576. me->max_count = ALLOC_CHUNK;
  577. } else
  578. m = me->mp;
  579. memset(m, 0, sizeof(*m));
  580. m->cont_level = 0;
  581. me->cont_count = 1;
  582. }
  583. m->lineno = lineno;
  584. if (m->cont_level != 0 && *l == '&') {
  585. ++l; /* step over */
  586. m->flag |= OFFADD;
  587. }
  588. if (m->cont_level != 0 && *l == '(') {
  589. ++l; /* step over */
  590. m->flag |= INDIR;
  591. if (m->flag & OFFADD)
  592. m->flag = (m->flag & ~OFFADD) | INDIROFFADD;
  593. }
  594. if (m->cont_level != 0 && *l == '&') {
  595. ++l; /* step over */
  596. m->flag |= OFFADD;
  597. }
  598. /* get offset, then skip over it */
  599. m->offset = (uint32_t)strtoul(l, &t, 0);
  600. if (l == t)
  601. if (ms->flags & MAGIC_CHECK)
  602. file_magwarn(ms, "offset `%s' invalid", l);
  603. l = t;
  604. if (m->flag & INDIR) {
  605. m->in_type = FILE_LONG;
  606. m->in_offset = 0;
  607. /*
  608. * read [.lbs][+-]nnnnn)
  609. */
  610. if (*l == '.') {
  611. l++;
  612. switch (*l) {
  613. case 'l':
  614. m->in_type = FILE_LELONG;
  615. break;
  616. case 'L':
  617. m->in_type = FILE_BELONG;
  618. break;
  619. case 'm':
  620. m->in_type = FILE_MELONG;
  621. break;
  622. case 'h':
  623. case 's':
  624. m->in_type = FILE_LESHORT;
  625. break;
  626. case 'H':
  627. case 'S':
  628. m->in_type = FILE_BESHORT;
  629. break;
  630. case 'c':
  631. case 'b':
  632. case 'C':
  633. case 'B':
  634. m->in_type = FILE_BYTE;
  635. break;
  636. default:
  637. if (ms->flags & MAGIC_CHECK)
  638. file_magwarn(ms,
  639. "indirect offset type `%c' invalid",
  640. *l);
  641. break;
  642. }
  643. l++;
  644. }
  645. if (*l == '~') {
  646. m->in_op |= FILE_OPINVERSE;
  647. l++;
  648. }
  649. switch (*l) {
  650. case '&':
  651. m->in_op |= FILE_OPAND;
  652. l++;
  653. break;
  654. case '|':
  655. m->in_op |= FILE_OPOR;
  656. l++;
  657. break;
  658. case '^':
  659. m->in_op |= FILE_OPXOR;
  660. l++;
  661. break;
  662. case '+':
  663. m->in_op |= FILE_OPADD;
  664. l++;
  665. break;
  666. case '-':
  667. m->in_op |= FILE_OPMINUS;
  668. l++;
  669. break;
  670. case '*':
  671. m->in_op |= FILE_OPMULTIPLY;
  672. l++;
  673. break;
  674. case '/':
  675. m->in_op |= FILE_OPDIVIDE;
  676. l++;
  677. break;
  678. case '%':
  679. m->in_op |= FILE_OPMODULO;
  680. l++;
  681. break;
  682. }
  683. if (*l == '(') {
  684. m->in_op |= FILE_OPINDIRECT;
  685. l++;
  686. }
  687. if (isdigit((unsigned char)*l) || *l == '-') {
  688. m->in_offset = (int32_t)strtol(l, &t, 0);
  689. l = t;
  690. }
  691. if (*l++ != ')' ||
  692. ((m->in_op & FILE_OPINDIRECT) && *l++ != ')'))
  693. if (ms->flags & MAGIC_CHECK)
  694. file_magwarn(ms,
  695. "missing ')' in indirect offset");
  696. }
  697. while (isascii((unsigned char)*l) && isdigit((unsigned char)*l))
  698. ++l;
  699. EATAB;
  700. if (*l == 'u') {
  701. ++l;
  702. m->flag |= UNSIGNED;
  703. }
  704. /* get type, skip it */
  705. for (i = 0; i < file_nnames; i++) {
  706. size_t len = strlen(file_names[i]);
  707. if (strncmp(l, file_names[i], len) == 0) {
  708. m->type = i;
  709. l+= len;
  710. break;
  711. }
  712. }
  713. if (i == file_nnames) {
  714. if (ms->flags & MAGIC_CHECK)
  715. file_magwarn(ms, "type `%s' invalid", l);
  716. return -1;
  717. }
  718. /* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */
  719. /* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */
  720. if (*l == '~') {
  721. if (!IS_STRING(m->type))
  722. m->mask_op |= FILE_OPINVERSE;
  723. ++l;
  724. }
  725. if ((t = strchr(fops, *l)) != NULL) {
  726. uint32_t op = (uint32_t)(t - fops);
  727. if (op != FILE_OPDIVIDE || !IS_PLAINSTRING(m->type)) {
  728. ++l;
  729. m->mask_op |= op;
  730. val = (uint64_t)strtoull(l, &t, 0);
  731. l = t;
  732. m->mask = file_signextend(ms, m, val);
  733. eatsize(&l);
  734. } else {
  735. m->mask = 0L;
  736. while (!isspace((unsigned char)*++l)) {
  737. switch (*l) {
  738. case CHAR_IGNORE_LOWERCASE:
  739. m->mask |= STRING_IGNORE_LOWERCASE;
  740. break;
  741. case CHAR_COMPACT_BLANK:
  742. m->mask |= STRING_COMPACT_BLANK;
  743. break;
  744. case CHAR_COMPACT_OPTIONAL_BLANK:
  745. m->mask |=
  746. STRING_COMPACT_OPTIONAL_BLANK;
  747. break;
  748. default:
  749. if (ms->flags & MAGIC_CHECK)
  750. file_magwarn(ms,
  751. "string extension `%c' invalid",
  752. *l);
  753. return -1;
  754. }
  755. }
  756. ++l;
  757. }
  758. }
  759. /*
  760. * We used to set mask to all 1's here, instead let's just not do
  761. * anything if mask = 0 (unless you have a better idea)
  762. */
  763. EATAB;
  764. switch (*l) {
  765. case '>':
  766. case '<':
  767. /* Old-style anding: "0 byte &0x80 dynamically linked" */
  768. case '&':
  769. case '^':
  770. case '=':
  771. m->reln = *l;
  772. ++l;
  773. if (*l == '=') {
  774. /* HP compat: ignore &= etc. */
  775. ++l;
  776. }
  777. break;
  778. case '!':
  779. m->reln = *l;
  780. ++l;
  781. break;
  782. default:
  783. if (*l == 'x' && ((isascii((unsigned char)l[1]) &&
  784. isspace((unsigned char)l[1])) || !l[1])) {
  785. m->reln = *l;
  786. ++l;
  787. goto GetDesc; /* Bill The Cat */
  788. }
  789. m->reln = '=';
  790. break;
  791. }
  792. EATAB;
  793. if (getvalue(ms, m, &l))
  794. return -1;
  795. /*
  796. * TODO finish this macro and start using it!
  797. * #define offsetcheck {if (offset > HOWMANY-1)
  798. * magwarn("offset too big"); }
  799. */
  800. /*
  801. * now get last part - the description
  802. */
  803. GetDesc:
  804. EATAB;
  805. if (l[0] == '\b') {
  806. ++l;
  807. m->nospflag = 1;
  808. } else if ((l[0] == '\\') && (l[1] == 'b')) {
  809. ++l;
  810. ++l;
  811. m->nospflag = 1;
  812. } else
  813. m->nospflag = 0;
  814. for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); )
  815. continue;
  816. if (i == sizeof(m->desc)) {
  817. m->desc[sizeof(m->desc) - 1] = '\0';
  818. if (ms->flags & MAGIC_CHECK)
  819. file_magwarn(ms, "description `%s' truncated", m->desc);
  820. }
  821. /*
  822. * We only do this check while compiling, or if any of the magic
  823. * files were not compiled.
  824. */
  825. if (ms->flags & MAGIC_CHECK) {
  826. if (check_format(ms, m) == -1)
  827. return -1;
  828. }
  829. #ifndef COMPILE_ONLY
  830. if (action == FILE_CHECK) {
  831. file_mdump(m);
  832. }
  833. #endif
  834. if (m->cont_level == 0)
  835. ++(*nmentryp); /* make room for next */
  836. return 0;
  837. }
  838. private int
  839. check_format_type(const char *ptr, int type)
  840. {
  841. int quad = 0;
  842. if (*ptr == '\0') {
  843. /* Missing format string; bad */
  844. return -1;
  845. }
  846. switch (type) {
  847. case FILE_FMT_QUAD:
  848. quad = 1;
  849. /*FALLTHROUGH*/
  850. case FILE_FMT_NUM:
  851. if (*ptr == '-')
  852. ptr++;
  853. if (*ptr == '.')
  854. ptr++;
  855. while (isdigit((unsigned char)*ptr)) ptr++;
  856. if (*ptr == '.')
  857. ptr++;
  858. while (isdigit((unsigned char)*ptr)) ptr++;
  859. if (quad) {
  860. if (*ptr++ != 'l')
  861. return -1;
  862. if (*ptr++ != 'l')
  863. return -1;
  864. }
  865. switch (*ptr++) {
  866. case 'l':
  867. switch (*ptr++) {
  868. case 'i':
  869. case 'd':
  870. case 'u':
  871. case 'x':
  872. case 'X':
  873. return 0;
  874. default:
  875. return -1;
  876. }
  877. case 'h':
  878. switch (*ptr++) {
  879. case 'h':
  880. switch (*ptr++) {
  881. case 'i':
  882. case 'd':
  883. case 'u':
  884. case 'x':
  885. case 'X':
  886. return 0;
  887. default:
  888. return -1;
  889. }
  890. case 'd':
  891. return 0;
  892. default:
  893. return -1;
  894. }
  895. case 'i':
  896. case 'c':
  897. case 'd':
  898. case 'u':
  899. case 'x':
  900. case 'X':
  901. return 0;
  902. default:
  903. return -1;
  904. }
  905. case FILE_FMT_STR:
  906. if (*ptr == '-')
  907. ptr++;
  908. while (isdigit((unsigned char )*ptr))
  909. ptr++;
  910. if (*ptr == '.') {
  911. ptr++;
  912. while (isdigit((unsigned char )*ptr))
  913. ptr++;
  914. }
  915. switch (*ptr++) {
  916. case 's':
  917. return 0;
  918. default:
  919. return -1;
  920. }
  921. default:
  922. /* internal error */
  923. abort();
  924. }
  925. /*NOTREACHED*/
  926. return -1;
  927. }
  928. /*
  929. * Check that the optional printf format in description matches
  930. * the type of the magic.
  931. */
  932. private int
  933. check_format(struct magic_set *ms, struct magic *m)
  934. {
  935. char *ptr;
  936. for (ptr = m->desc; *ptr; ptr++)
  937. if (*ptr == '%')
  938. break;
  939. if (*ptr == '\0') {
  940. /* No format string; ok */
  941. return 1;
  942. }
  943. assert(file_nformats == file_nnames);
  944. if (m->type >= file_nformats) {
  945. file_error(ms, 0, "Internal error inconsistency between "
  946. "m->type and format strings");
  947. return -1;
  948. }
  949. if (file_formats[m->type] == FILE_FMT_NONE) {
  950. file_error(ms, 0, "No format string for `%s' with description "
  951. "`%s'", m->desc, file_names[m->type]);
  952. return -1;
  953. }
  954. ptr++;
  955. if (check_format_type(ptr, file_formats[m->type]) == -1) {
  956. /*
  957. * TODO: this error message is unhelpful if the format
  958. * string is not one character long
  959. */
  960. file_error(ms, 0, "Printf format `%c' is not valid for type "
  961. " `%s' in description `%s'", *ptr,
  962. file_names[m->type], m->desc);
  963. return -1;
  964. }
  965. for (; *ptr; ptr++) {
  966. if (*ptr == '%') {
  967. file_error(ms, 0,
  968. "Too many format strings (should have at most one) "
  969. "for `%s' with description `%s'",
  970. file_names[m->type], m->desc);
  971. return -1;
  972. }
  973. }
  974. return 0;
  975. }
  976. /*
  977. * Read a numeric value from a pointer, into the value union of a magic
  978. * pointer, according to the magic type. Update the string pointer to point
  979. * just after the number read. Return 0 for success, non-zero for failure.
  980. */
  981. private int
  982. getvalue(struct magic_set *ms, struct magic *m, const char **p)
  983. {
  984. int slen;
  985. switch (m->type) {
  986. case FILE_BESTRING16:
  987. case FILE_LESTRING16:
  988. case FILE_STRING:
  989. case FILE_PSTRING:
  990. case FILE_REGEX:
  991. case FILE_SEARCH:
  992. *p = getstr(ms, *p, m->value.s, sizeof(m->value.s), &slen);
  993. if (*p == NULL) {
  994. if (ms->flags & MAGIC_CHECK)
  995. file_magwarn(ms, "cannot get string from `%s'",
  996. m->value.s);
  997. return -1;
  998. }
  999. m->vallen = slen;
  1000. return 0;
  1001. default:
  1002. if (m->reln != 'x') {
  1003. char *ep;
  1004. m->value.q = file_signextend(ms, m,
  1005. (uint64_t)strtoull(*p, &ep, 0));
  1006. *p = ep;
  1007. eatsize(p);
  1008. }
  1009. return 0;
  1010. }
  1011. }
  1012. /*
  1013. * Convert a string containing C character escapes. Stop at an unescaped
  1014. * space or tab.
  1015. * Copy the converted version to "p", returning its length in *slen.
  1016. * Return updated scan pointer as function result.
  1017. */
  1018. private const char *
  1019. getstr(struct magic_set *ms, const char *s, char *p, int plen, int *slen)
  1020. {
  1021. const char *origs = s;
  1022. char *origp = p;
  1023. char *pmax = p + plen - 1;
  1024. int c;
  1025. int val;
  1026. while ((c = *s++) != '\0') {
  1027. if (isspace((unsigned char) c))
  1028. break;
  1029. if (p >= pmax) {
  1030. file_error(ms, 0, "string too long: `%s'", origs);
  1031. return NULL;
  1032. }
  1033. if(c == '\\') {
  1034. switch(c = *s++) {
  1035. case '\0':
  1036. goto out;
  1037. default:
  1038. *p++ = (char) c;
  1039. break;
  1040. case 'n':
  1041. *p++ = '\n';
  1042. break;
  1043. case 'r':
  1044. *p++ = '\r';
  1045. break;
  1046. case 'b':
  1047. *p++ = '\b';
  1048. break;
  1049. case 't':
  1050. *p++ = '\t';
  1051. break;
  1052. case 'f':
  1053. *p++ = '\f';
  1054. break;
  1055. case 'v':
  1056. *p++ = '\v';
  1057. break;
  1058. /* \ and up to 3 octal digits */
  1059. case '0':
  1060. case '1':
  1061. case '2':
  1062. case '3':
  1063. case '4':
  1064. case '5':
  1065. case '6':
  1066. case '7':
  1067. val = c - '0';
  1068. c = *s++; /* try for 2 */
  1069. if(c >= '0' && c <= '7') {
  1070. val = (val<<3) | (c - '0');
  1071. c = *s++; /* try for 3 */
  1072. if(c >= '0' && c <= '7')
  1073. val = (val<<3) | (c-'0');
  1074. else
  1075. --s;
  1076. }
  1077. else
  1078. --s;
  1079. *p++ = (char)val;
  1080. break;
  1081. /* \x and up to 2 hex digits */
  1082. case 'x':
  1083. val = 'x'; /* Default if no digits */
  1084. c = hextoint(*s++); /* Get next char */
  1085. if (c >= 0) {
  1086. val = c;
  1087. c = hextoint(*s++);
  1088. if (c >= 0)
  1089. val = (val << 4) + c;
  1090. else
  1091. --s;
  1092. } else
  1093. --s;
  1094. *p++ = (char)val;
  1095. break;
  1096. }
  1097. } else
  1098. *p++ = (char)c;
  1099. }
  1100. out:
  1101. *p = '\0';
  1102. *slen = p - origp;
  1103. return s;
  1104. }
  1105. /* Single hex char to int; -1 if not a hex char. */
  1106. private int
  1107. hextoint(int c)
  1108. {
  1109. if (!isascii((unsigned char) c))
  1110. return -1;
  1111. if (isdigit((unsigned char) c))
  1112. return c - '0';
  1113. if ((c >= 'a')&&(c <= 'f'))
  1114. return c + 10 - 'a';
  1115. if (( c>= 'A')&&(c <= 'F'))
  1116. return c + 10 - 'A';
  1117. return -1;
  1118. }
  1119. /*
  1120. * Print a string containing C character escapes.
  1121. */
  1122. protected void
  1123. file_showstr(FILE *fp, const char *s, size_t len)
  1124. {
  1125. char c;
  1126. for (;;) {
  1127. c = *s++;
  1128. if (len == ~0U) {
  1129. if (c == '\0')
  1130. break;
  1131. }
  1132. else {
  1133. if (len-- == 0)
  1134. break;
  1135. }
  1136. if(c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */
  1137. (void) fputc(c, fp);
  1138. else {
  1139. (void) fputc('\\', fp);
  1140. switch (c) {
  1141. case '\n':
  1142. (void) fputc('n', fp);
  1143. break;
  1144. case '\r':
  1145. (void) fputc('r', fp);
  1146. break;
  1147. case '\b':
  1148. (void) fputc('b', fp);
  1149. break;
  1150. case '\t':
  1151. (void) fputc('t', fp);
  1152. break;
  1153. case '\f':
  1154. (void) fputc('f', fp);
  1155. break;
  1156. case '\v':
  1157. (void) fputc('v', fp);
  1158. break;
  1159. default:
  1160. (void) fprintf(fp, "%.3o", c & 0377);
  1161. break;
  1162. }
  1163. }
  1164. }
  1165. }
  1166. /*
  1167. * eatsize(): Eat the size spec from a number [eg. 10UL]
  1168. */
  1169. private void
  1170. eatsize(const char **p)
  1171. {
  1172. const char *l = *p;
  1173. if (LOWCASE(*l) == 'u')
  1174. l++;
  1175. switch (LOWCASE(*l)) {
  1176. case 'l': /* long */
  1177. case 's': /* short */
  1178. case 'h': /* short */
  1179. case 'b': /* char/byte */
  1180. case 'c': /* char/byte */
  1181. l++;
  1182. /*FALLTHROUGH*/
  1183. default:
  1184. break;
  1185. }
  1186. *p = l;
  1187. }
  1188. /*
  1189. * handle a compiled file.
  1190. */
  1191. private int
  1192. apprentice_map(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp,
  1193. const char *fn)
  1194. {
  1195. int fd;
  1196. struct stat st;
  1197. uint32_t *ptr;
  1198. uint32_t version;
  1199. int needsbyteswap;
  1200. char buf[MAXPATHLEN];
  1201. char *dbname = mkdbname(fn, buf, sizeof(buf), 0);
  1202. void *mm = NULL;
  1203. if (dbname == NULL)
  1204. return -1;
  1205. if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1)
  1206. return -1;
  1207. if (fstat(fd, &st) == -1) {
  1208. file_error(ms, errno, "cannot stat `%s'", dbname);
  1209. goto error;
  1210. }
  1211. if (st.st_size < 16) {
  1212. file_error(ms, 0, "file `%s' is too small", dbname);
  1213. goto error;
  1214. }
  1215. #ifdef QUICK
  1216. if ((mm = mmap(0, (size_t)st.st_size, PROT_READ|PROT_WRITE,
  1217. MAP_PRIVATE|MAP_FILE, fd, (off_t)0)) == MAP_FAILED) {
  1218. file_error(ms, errno, "cannot map `%s'", dbname);
  1219. goto error;
  1220. }
  1221. #define RET 2
  1222. #else
  1223. if ((mm = malloc((size_t)st.st_size)) == NULL) {
  1224. file_oomem(ms, (size_t)st.st_size);
  1225. goto error;
  1226. }
  1227. if (read(fd, mm, (size_t)st.st_size) != (size_t)st.st_size) {
  1228. file_badread(ms);
  1229. goto error;
  1230. }
  1231. #define RET 1
  1232. #endif
  1233. *magicp = mm;
  1234. (void)close(fd);
  1235. fd = -1;
  1236. ptr = (uint32_t *)(void *)*magicp;
  1237. if (*ptr != MAGICNO) {
  1238. if (swap4(*ptr) != MAGICNO) {
  1239. file_error(ms, 0, "bad magic in `%s'");
  1240. goto error;
  1241. }
  1242. needsbyteswap = 1;
  1243. } else
  1244. needsbyteswap = 0;
  1245. if (needsbyteswap)
  1246. version = swap4(ptr[1]);
  1247. else
  1248. version = ptr[1];
  1249. if (version != VERSIONNO) {
  1250. file_error(ms, 0, "version mismatch (%d != %d) in `%s'",
  1251. version, VERSIONNO, dbname);
  1252. goto error;
  1253. }
  1254. *nmagicp = (uint32_t)(st.st_size / sizeof(struct magic)) - 1;
  1255. (*magicp)++;
  1256. if (needsbyteswap)
  1257. byteswap(*magicp, *nmagicp);
  1258. return RET;
  1259. error:
  1260. if (fd != -1)
  1261. (void)close(fd);
  1262. if (mm) {
  1263. #ifdef QUICK
  1264. (void)munmap((void *)mm, (size_t)st.st_size);
  1265. #else
  1266. free(mm);
  1267. #endif
  1268. } else {
  1269. *magicp = NULL;
  1270. *nmagicp = 0;
  1271. }
  1272. return -1;
  1273. }
  1274. private const uint32_t ar[] = {
  1275. MAGICNO, VERSIONNO
  1276. };
  1277. /*
  1278. * handle an mmaped file.
  1279. */
  1280. private int
  1281. apprentice_compile(struct magic_set *ms, struct magic **magicp,
  1282. uint32_t *nmagicp, const char *fn)
  1283. {
  1284. int fd;
  1285. char buf[MAXPATHLEN];
  1286. char *dbname = mkdbname(fn, buf, sizeof(buf), 1);
  1287. if (dbname == NULL)
  1288. return -1;
  1289. if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1) {
  1290. file_error(ms, errno, "cannot open `%s'", dbname);
  1291. return -1;
  1292. }
  1293. if (write(fd, ar, sizeof(ar)) != (ssize_t)sizeof(ar)) {
  1294. file_error(ms, errno, "error writing `%s'", dbname);
  1295. return -1;
  1296. }
  1297. if (lseek(fd, (off_t)sizeof(struct magic), SEEK_SET)
  1298. != sizeof(struct magic)) {
  1299. file_error(ms, errno, "error seeking `%s'", dbname);
  1300. return -1;
  1301. }
  1302. if (write(fd, *magicp, (sizeof(struct magic) * *nmagicp))
  1303. != (ssize_t)(sizeof(struct magic) * *nmagicp)) {
  1304. file_error(ms, errno, "error writing `%s'", dbname);
  1305. return -1;
  1306. }
  1307. (void)close(fd);
  1308. return 0;
  1309. }
  1310. private const char ext[] = ".mgc";
  1311. /*
  1312. * make a dbname
  1313. */
  1314. private char *
  1315. mkdbname(const char *fn, char *buf, size_t bufsiz, int strip)
  1316. {
  1317. if (strip) {
  1318. const char *p;
  1319. if ((p = strrchr(fn, '/')) != NULL)
  1320. fn = ++p;
  1321. }
  1322. (void)snprintf(buf, bufsiz, "%s%s", fn, ext);
  1323. return buf;
  1324. }
  1325. /*
  1326. * Byteswap an mmap'ed file if needed
  1327. */
  1328. private void
  1329. byteswap(struct magic *magic, uint32_t nmagic)
  1330. {
  1331. uint32_t i;
  1332. for (i = 0; i < nmagic; i++)
  1333. bs1(&magic[i]);
  1334. }
  1335. /*
  1336. * swap a short
  1337. */
  1338. private uint16_t
  1339. swap2(uint16_t sv)
  1340. {
  1341. uint16_t rv;
  1342. uint8_t *s = (uint8_t *)(void *)&sv;
  1343. uint8_t *d = (uint8_t *)(void *)&rv;
  1344. d[0] = s[1];
  1345. d[1] = s[0];
  1346. return rv;
  1347. }
  1348. /*
  1349. * swap an int
  1350. */
  1351. private uint32_t
  1352. swap4(uint32_t sv)
  1353. {
  1354. uint32_t rv;
  1355. uint8_t *s = (uint8_t *)(void *)&sv;
  1356. uint8_t *d = (uint8_t *)(void *)&rv;
  1357. d[0] = s[3];
  1358. d[1] = s[2];
  1359. d[2] = s[1];
  1360. d[3] = s[0];
  1361. return rv;
  1362. }
  1363. /*
  1364. * swap a quad
  1365. */
  1366. private uint64_t
  1367. swap8(uint64_t sv)
  1368. {
  1369. uint32_t rv;
  1370. uint8_t *s = (uint8_t *)(void *)&sv;
  1371. uint8_t *d = (uint8_t *)(void *)&rv;
  1372. d[0] = s[3];
  1373. d[1] = s[2];
  1374. d[2] = s[1];
  1375. d[3] = s[0];
  1376. d[4] = s[7];
  1377. d[5] = s[6];
  1378. d[6] = s[5];
  1379. d[7] = s[4];
  1380. return rv;
  1381. }
  1382. /*
  1383. * byteswap a single magic entry
  1384. */
  1385. private void
  1386. bs1(struct magic *m)
  1387. {
  1388. m->cont_level = swap2(m->cont_level);
  1389. m->offset = swap4((uint32_t)m->offset);
  1390. m->in_offset = swap4((uint32_t)m->in_offset);
  1391. if (!IS_STRING(m->type))
  1392. m->value.q = swap8(m->value.q);
  1393. m->mask = swap8(m->mask);
  1394. }