apprentice.c 44 KB

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