apprentice.c 50 KB

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