apprentice.c 49 KB

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