softmagic.c 47 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076
  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. * softmagic - interpret variable magic from MAGIC
  30. */
  31. #include "file.h"
  32. #ifndef lint
  33. FILE_RCSID("@(#)$File: softmagic.c,v 1.249 2017/06/19 18:30:25 christos Exp $")
  34. #endif /* lint */
  35. #include "magic.h"
  36. #include <assert.h>
  37. #include <string.h>
  38. #include <ctype.h>
  39. #include <stdlib.h>
  40. #include <time.h>
  41. #include "der.h"
  42. private int match(struct magic_set *, struct magic *, uint32_t,
  43. const unsigned char *, size_t, size_t, int, int, int, uint16_t *,
  44. uint16_t *, int *, int *, int *);
  45. private int mget(struct magic_set *, const unsigned char *,
  46. struct magic *, size_t, size_t, unsigned int, int, int, int, uint16_t *,
  47. uint16_t *, int *, int *, int *);
  48. private int magiccheck(struct magic_set *, struct magic *);
  49. private int32_t mprint(struct magic_set *, struct magic *);
  50. private int moffset(struct magic_set *, struct magic *, size_t, int32_t *);
  51. private void mdebug(uint32_t, const char *, size_t);
  52. private int mcopy(struct magic_set *, union VALUETYPE *, int, int,
  53. const unsigned char *, uint32_t, size_t, struct magic *);
  54. private int mconvert(struct magic_set *, struct magic *, int);
  55. private int print_sep(struct magic_set *, int);
  56. private int handle_annotation(struct magic_set *, struct magic *, int);
  57. private int cvt_8(union VALUETYPE *, const struct magic *);
  58. private int cvt_16(union VALUETYPE *, const struct magic *);
  59. private int cvt_32(union VALUETYPE *, const struct magic *);
  60. private int cvt_64(union VALUETYPE *, const struct magic *);
  61. #define OFFSET_OOB(n, o, i) ((n) < (uint32_t)(o) || (i) > ((n) - (o)))
  62. #define BE64(p) (((uint64_t)(p)->hq[0]<<56)|((uint64_t)(p)->hq[1]<<48)| \
  63. ((uint64_t)(p)->hq[2]<<40)|((uint64_t)(p)->hq[3]<<32)| \
  64. ((uint64_t)(p)->hq[4]<<24)|((uint64_t)(p)->hq[5]<<16)| \
  65. ((uint64_t)(p)->hq[6]<<8)|((uint64_t)(p)->hq[7]))
  66. #define LE64(p) (((uint64_t)(p)->hq[7]<<56)|((uint64_t)(p)->hq[6]<<48)| \
  67. ((uint64_t)(p)->hq[5]<<40)|((uint64_t)(p)->hq[4]<<32)| \
  68. ((uint64_t)(p)->hq[3]<<24)|((uint64_t)(p)->hq[2]<<16)| \
  69. ((uint64_t)(p)->hq[1]<<8)|((uint64_t)(p)->hq[0]))
  70. #define LE32(p) (((uint32_t)(p)->hl[3]<<24)|((uint32_t)(p)->hl[2]<<16)| \
  71. ((uint32_t)(p)->hl[1]<<8)|((uint32_t)(p)->hl[0]))
  72. #define BE32(p) (((uint32_t)(p)->hl[0]<<24)|((uint32_t)(p)->hl[1]<<16)| \
  73. ((uint32_t)(p)->hl[2]<<8)|((uint32_t)(p)->hl[3]))
  74. #define ME32(p) (((uint32_t)(p)->hl[1]<<24)|((uint32_t)(p)->hl[0]<<16)| \
  75. ((uint32_t)(p)->hl[3]<<8)|((uint32_t)(p)->hl[2]))
  76. #define BE16(p) (((uint16_t)(p)->hs[0]<<8)|((uint16_t)(p)->hs[1]))
  77. #define LE16(p) (((uint16_t)(p)->hs[1]<<8)|((uint16_t)(p)->hs[0]))
  78. #define SEXT(s,v,p) ((s)?(intmax_t)(int##v##_t)(p):(intmax_t)(uint##v##_t)(p))
  79. /*
  80. * softmagic - lookup one file in parsed, in-memory copy of database
  81. * Passed the name and FILE * of one file to be typed.
  82. */
  83. /*ARGSUSED1*/ /* nbytes passed for regularity, maybe need later */
  84. protected int
  85. file_softmagic(struct magic_set *ms, const unsigned char *buf, size_t nbytes,
  86. uint16_t *indir_count, uint16_t *name_count, int mode, int text)
  87. {
  88. struct mlist *ml;
  89. int rv, printed_something = 0, need_separator = 0;
  90. uint16_t nc, ic;
  91. if (name_count == NULL) {
  92. nc = 0;
  93. name_count = &nc;
  94. }
  95. if (indir_count == NULL) {
  96. ic = 0;
  97. indir_count = &ic;
  98. }
  99. for (ml = ms->mlist[0]->next; ml != ms->mlist[0]; ml = ml->next)
  100. if ((rv = match(ms, ml->magic, ml->nmagic, buf, nbytes, 0, mode,
  101. text, 0, indir_count, name_count,
  102. &printed_something, &need_separator, NULL)) != 0)
  103. return rv;
  104. return 0;
  105. }
  106. #define FILE_FMTDEBUG
  107. #ifdef FILE_FMTDEBUG
  108. #define F(a, b, c) file_fmtcheck((a), (b), (c), __FILE__, __LINE__)
  109. private const char * __attribute__((__format_arg__(3)))
  110. file_fmtcheck(struct magic_set *ms, const struct magic *m, const char *def,
  111. const char *file, size_t line)
  112. {
  113. const char *ptr = fmtcheck(m->desc, def);
  114. if (ptr == def)
  115. file_magerror(ms,
  116. "%s, %" SIZE_T_FORMAT "u: format `%s' does not match"
  117. " with `%s'", file, line, m->desc, def);
  118. return ptr;
  119. }
  120. #else
  121. #define F(a, b, c) fmtcheck((b)->desc, (c))
  122. #endif
  123. /*
  124. * Go through the whole list, stopping if you find a match. Process all
  125. * the continuations of that match before returning.
  126. *
  127. * We support multi-level continuations:
  128. *
  129. * At any time when processing a successful top-level match, there is a
  130. * current continuation level; it represents the level of the last
  131. * successfully matched continuation.
  132. *
  133. * Continuations above that level are skipped as, if we see one, it
  134. * means that the continuation that controls them - i.e, the
  135. * lower-level continuation preceding them - failed to match.
  136. *
  137. * Continuations below that level are processed as, if we see one,
  138. * it means we've finished processing or skipping higher-level
  139. * continuations under the control of a successful or unsuccessful
  140. * lower-level continuation, and are now seeing the next lower-level
  141. * continuation and should process it. The current continuation
  142. * level reverts to the level of the one we're seeing.
  143. *
  144. * Continuations at the current level are processed as, if we see
  145. * one, there's no lower-level continuation that may have failed.
  146. *
  147. * If a continuation matches, we bump the current continuation level
  148. * so that higher-level continuations are processed.
  149. */
  150. private int
  151. match(struct magic_set *ms, struct magic *magic, uint32_t nmagic,
  152. const unsigned char *s, size_t nbytes, size_t offset, int mode, int text,
  153. int flip, uint16_t *indir_count, uint16_t *name_count,
  154. int *printed_something, int *need_separator, int *returnval)
  155. {
  156. uint32_t magindex = 0;
  157. unsigned int cont_level = 0;
  158. int returnvalv = 0, e; /* if a match is found it is set to 1*/
  159. int firstline = 1; /* a flag to print X\n X\n- X */
  160. int print = (ms->flags & MAGIC_NODESC) == 0;
  161. if (returnval == NULL)
  162. returnval = &returnvalv;
  163. if (file_check_mem(ms, cont_level) == -1)
  164. return -1;
  165. for (magindex = 0; magindex < nmagic; magindex++) {
  166. int flush = 0;
  167. struct magic *m = &magic[magindex];
  168. if (m->type != FILE_NAME)
  169. if ((IS_STRING(m->type) &&
  170. #define FLT (STRING_BINTEST | STRING_TEXTTEST)
  171. ((text && (m->str_flags & FLT) == STRING_BINTEST) ||
  172. (!text && (m->str_flags & FLT) == STRING_TEXTTEST))) ||
  173. (m->flag & mode) != mode) {
  174. flush:
  175. /* Skip sub-tests */
  176. while (magindex < nmagic - 1 &&
  177. magic[magindex + 1].cont_level != 0)
  178. magindex++;
  179. cont_level = 0;
  180. continue; /* Skip to next top-level test*/
  181. }
  182. ms->offset = m->offset;
  183. ms->line = m->lineno;
  184. /* if main entry matches, print it... */
  185. switch (mget(ms, s, m, nbytes, offset, cont_level, mode, text,
  186. flip, indir_count, name_count,
  187. printed_something, need_separator, returnval)) {
  188. case -1:
  189. return -1;
  190. case 0:
  191. flush = m->reln != '!';
  192. break;
  193. default:
  194. if (m->type == FILE_INDIRECT)
  195. *returnval = 1;
  196. switch (magiccheck(ms, m)) {
  197. case -1:
  198. return -1;
  199. case 0:
  200. flush++;
  201. break;
  202. default:
  203. flush = 0;
  204. break;
  205. }
  206. break;
  207. }
  208. if (flush) {
  209. /*
  210. * main entry didn't match,
  211. * flush its continuations
  212. */
  213. goto flush;
  214. }
  215. if ((e = handle_annotation(ms, m, firstline)) != 0) {
  216. *need_separator = 1;
  217. *printed_something = 1;
  218. *returnval = 1;
  219. return e;
  220. }
  221. /*
  222. * If we are going to print something, we'll need to print
  223. * a blank before we print something else.
  224. */
  225. if (*m->desc) {
  226. *need_separator = 1;
  227. *printed_something = 1;
  228. if (print_sep(ms, firstline) == -1)
  229. return -1;
  230. }
  231. if (print && mprint(ms, m) == -1)
  232. return -1;
  233. switch (moffset(ms, m, nbytes, &ms->c.li[cont_level].off)) {
  234. case -1:
  235. case 0:
  236. goto flush;
  237. default:
  238. break;
  239. }
  240. /* and any continuations that match */
  241. if (file_check_mem(ms, ++cont_level) == -1)
  242. return -1;
  243. while (magindex + 1 < nmagic &&
  244. magic[magindex + 1].cont_level != 0) {
  245. m = &magic[++magindex];
  246. ms->line = m->lineno; /* for messages */
  247. if (cont_level < m->cont_level)
  248. continue;
  249. if (cont_level > m->cont_level) {
  250. /*
  251. * We're at the end of the level
  252. * "cont_level" continuations.
  253. */
  254. cont_level = m->cont_level;
  255. }
  256. ms->offset = m->offset;
  257. if (m->flag & OFFADD) {
  258. ms->offset +=
  259. ms->c.li[cont_level - 1].off;
  260. }
  261. #ifdef ENABLE_CONDITIONALS
  262. if (m->cond == COND_ELSE ||
  263. m->cond == COND_ELIF) {
  264. if (ms->c.li[cont_level].last_match == 1)
  265. continue;
  266. }
  267. #endif
  268. switch (mget(ms, s, m, nbytes, offset, cont_level, mode,
  269. text, flip, indir_count, name_count,
  270. printed_something, need_separator, returnval)) {
  271. case -1:
  272. return -1;
  273. case 0:
  274. if (m->reln != '!')
  275. continue;
  276. flush = 1;
  277. break;
  278. default:
  279. if (m->type == FILE_INDIRECT)
  280. *returnval = 1;
  281. flush = 0;
  282. break;
  283. }
  284. switch (flush ? 1 : magiccheck(ms, m)) {
  285. case -1:
  286. return -1;
  287. case 0:
  288. #ifdef ENABLE_CONDITIONALS
  289. ms->c.li[cont_level].last_match = 0;
  290. #endif
  291. break;
  292. default:
  293. #ifdef ENABLE_CONDITIONALS
  294. ms->c.li[cont_level].last_match = 1;
  295. #endif
  296. if (m->type == FILE_CLEAR)
  297. ms->c.li[cont_level].got_match = 0;
  298. else if (ms->c.li[cont_level].got_match) {
  299. if (m->type == FILE_DEFAULT)
  300. break;
  301. } else
  302. ms->c.li[cont_level].got_match = 1;
  303. if ((e = handle_annotation(ms, m, firstline)) != 0) {
  304. *need_separator = 1;
  305. *printed_something = 1;
  306. *returnval = 1;
  307. return e;
  308. }
  309. /*
  310. * If we are going to print something,
  311. * make sure that we have a separator first.
  312. */
  313. if (*m->desc) {
  314. if (!*printed_something) {
  315. *printed_something = 1;
  316. if (print_sep(ms, firstline)
  317. == -1)
  318. return -1;
  319. }
  320. }
  321. /*
  322. * This continuation matched. Print
  323. * its message, with a blank before it
  324. * if the previous item printed and
  325. * this item isn't empty.
  326. */
  327. /* space if previous printed */
  328. if (*need_separator
  329. && ((m->flag & NOSPACE) == 0)
  330. && *m->desc) {
  331. if (print &&
  332. file_printf(ms, " ") == -1)
  333. return -1;
  334. *need_separator = 0;
  335. }
  336. if (print && mprint(ms, m) == -1)
  337. return -1;
  338. switch (moffset(ms, m, nbytes,
  339. &ms->c.li[cont_level].off)) {
  340. case -1:
  341. case 0:
  342. flush = 1;
  343. cont_level--;
  344. break;
  345. default:
  346. break;
  347. }
  348. if (*m->desc)
  349. *need_separator = 1;
  350. /*
  351. * If we see any continuations
  352. * at a higher level,
  353. * process them.
  354. */
  355. if (file_check_mem(ms, ++cont_level) == -1)
  356. return -1;
  357. break;
  358. }
  359. }
  360. if (*printed_something) {
  361. firstline = 0;
  362. if (print)
  363. *returnval = 1;
  364. }
  365. if ((ms->flags & MAGIC_CONTINUE) == 0 && *printed_something) {
  366. return *returnval; /* don't keep searching */
  367. }
  368. cont_level = 0;
  369. }
  370. return *returnval; /* This is hit if -k is set or there is no match */
  371. }
  372. private int
  373. check_fmt(struct magic_set *ms, struct magic *m)
  374. {
  375. file_regex_t rx;
  376. int rc, rv = -1;
  377. if (strchr(m->desc, '%') == NULL)
  378. return 0;
  379. rc = file_regcomp(&rx, "%[-0-9\\.]*s", REG_EXTENDED|REG_NOSUB);
  380. if (rc) {
  381. file_regerror(&rx, rc, ms);
  382. } else {
  383. rc = file_regexec(&rx, m->desc, 0, 0, 0);
  384. rv = !rc;
  385. }
  386. file_regfree(&rx);
  387. return rv;
  388. }
  389. #ifndef HAVE_STRNDUP
  390. char * strndup(const char *, size_t);
  391. char *
  392. strndup(const char *str, size_t n)
  393. {
  394. size_t len;
  395. char *copy;
  396. for (len = 0; len < n && str[len]; len++)
  397. continue;
  398. if ((copy = malloc(len + 1)) == NULL)
  399. return NULL;
  400. (void)memcpy(copy, str, len);
  401. copy[len] = '\0';
  402. return copy;
  403. }
  404. #endif /* HAVE_STRNDUP */
  405. private int32_t
  406. mprint(struct magic_set *ms, struct magic *m)
  407. {
  408. uint64_t v;
  409. float vf;
  410. double vd;
  411. int64_t t = 0;
  412. char buf[128], tbuf[26], sbuf[512];
  413. union VALUETYPE *p = &ms->ms_value;
  414. switch (m->type) {
  415. case FILE_BYTE:
  416. v = file_signextend(ms, m, (uint64_t)p->b);
  417. switch (check_fmt(ms, m)) {
  418. case -1:
  419. return -1;
  420. case 1:
  421. (void)snprintf(buf, sizeof(buf), "%d",
  422. (unsigned char)v);
  423. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  424. return -1;
  425. break;
  426. default:
  427. if (file_printf(ms, F(ms, m, "%d"),
  428. (unsigned char) v) == -1)
  429. return -1;
  430. break;
  431. }
  432. t = ms->offset + sizeof(char);
  433. break;
  434. case FILE_SHORT:
  435. case FILE_BESHORT:
  436. case FILE_LESHORT:
  437. v = file_signextend(ms, m, (uint64_t)p->h);
  438. switch (check_fmt(ms, m)) {
  439. case -1:
  440. return -1;
  441. case 1:
  442. (void)snprintf(buf, sizeof(buf), "%u",
  443. (unsigned short)v);
  444. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  445. return -1;
  446. break;
  447. default:
  448. if (file_printf(ms, F(ms, m, "%u"),
  449. (unsigned short) v) == -1)
  450. return -1;
  451. break;
  452. }
  453. t = ms->offset + sizeof(short);
  454. break;
  455. case FILE_LONG:
  456. case FILE_BELONG:
  457. case FILE_LELONG:
  458. case FILE_MELONG:
  459. v = file_signextend(ms, m, (uint64_t)p->l);
  460. switch (check_fmt(ms, m)) {
  461. case -1:
  462. return -1;
  463. case 1:
  464. (void)snprintf(buf, sizeof(buf), "%u", (uint32_t) v);
  465. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  466. return -1;
  467. break;
  468. default:
  469. if (file_printf(ms, F(ms, m, "%u"), (uint32_t) v) == -1)
  470. return -1;
  471. break;
  472. }
  473. t = ms->offset + sizeof(int32_t);
  474. break;
  475. case FILE_QUAD:
  476. case FILE_BEQUAD:
  477. case FILE_LEQUAD:
  478. v = file_signextend(ms, m, p->q);
  479. switch (check_fmt(ms, m)) {
  480. case -1:
  481. return -1;
  482. case 1:
  483. (void)snprintf(buf, sizeof(buf), "%" INT64_T_FORMAT "u",
  484. (unsigned long long)v);
  485. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  486. return -1;
  487. break;
  488. default:
  489. if (file_printf(ms, F(ms, m, "%" INT64_T_FORMAT "u"),
  490. (unsigned long long) v) == -1)
  491. return -1;
  492. break;
  493. }
  494. t = ms->offset + sizeof(int64_t);
  495. break;
  496. case FILE_STRING:
  497. case FILE_PSTRING:
  498. case FILE_BESTRING16:
  499. case FILE_LESTRING16:
  500. if (m->reln == '=' || m->reln == '!') {
  501. if (file_printf(ms, F(ms, m, "%s"),
  502. file_printable(sbuf, sizeof(sbuf), m->value.s))
  503. == -1)
  504. return -1;
  505. t = ms->offset + m->vallen;
  506. }
  507. else {
  508. char *str = p->s;
  509. /* compute t before we mangle the string? */
  510. t = ms->offset + strlen(str);
  511. if (*m->value.s == '\0')
  512. str[strcspn(str, "\r\n")] = '\0';
  513. if (m->str_flags & STRING_TRIM) {
  514. char *last;
  515. while (isspace((unsigned char)*str))
  516. str++;
  517. last = str;
  518. while (*last)
  519. last++;
  520. --last;
  521. while (isspace((unsigned char)*last))
  522. last--;
  523. *++last = '\0';
  524. }
  525. if (file_printf(ms, F(ms, m, "%s"),
  526. file_printable(sbuf, sizeof(sbuf), str)) == -1)
  527. return -1;
  528. if (m->type == FILE_PSTRING)
  529. t += file_pstring_length_size(m);
  530. }
  531. break;
  532. case FILE_DATE:
  533. case FILE_BEDATE:
  534. case FILE_LEDATE:
  535. case FILE_MEDATE:
  536. if (file_printf(ms, F(ms, m, "%s"),
  537. file_fmttime(p->l, 0, tbuf)) == -1)
  538. return -1;
  539. t = ms->offset + sizeof(uint32_t);
  540. break;
  541. case FILE_LDATE:
  542. case FILE_BELDATE:
  543. case FILE_LELDATE:
  544. case FILE_MELDATE:
  545. if (file_printf(ms, F(ms, m, "%s"),
  546. file_fmttime(p->l, FILE_T_LOCAL, tbuf)) == -1)
  547. return -1;
  548. t = ms->offset + sizeof(uint32_t);
  549. break;
  550. case FILE_QDATE:
  551. case FILE_BEQDATE:
  552. case FILE_LEQDATE:
  553. if (file_printf(ms, F(ms, m, "%s"),
  554. file_fmttime(p->q, 0, tbuf)) == -1)
  555. return -1;
  556. t = ms->offset + sizeof(uint64_t);
  557. break;
  558. case FILE_QLDATE:
  559. case FILE_BEQLDATE:
  560. case FILE_LEQLDATE:
  561. if (file_printf(ms, F(ms, m, "%s"),
  562. file_fmttime(p->q, FILE_T_LOCAL, tbuf)) == -1)
  563. return -1;
  564. t = ms->offset + sizeof(uint64_t);
  565. break;
  566. case FILE_QWDATE:
  567. case FILE_BEQWDATE:
  568. case FILE_LEQWDATE:
  569. if (file_printf(ms, F(ms, m, "%s"),
  570. file_fmttime(p->q, FILE_T_WINDOWS, tbuf)) == -1)
  571. return -1;
  572. t = ms->offset + sizeof(uint64_t);
  573. break;
  574. case FILE_FLOAT:
  575. case FILE_BEFLOAT:
  576. case FILE_LEFLOAT:
  577. vf = p->f;
  578. switch (check_fmt(ms, m)) {
  579. case -1:
  580. return -1;
  581. case 1:
  582. (void)snprintf(buf, sizeof(buf), "%g", vf);
  583. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  584. return -1;
  585. break;
  586. default:
  587. if (file_printf(ms, F(ms, m, "%g"), vf) == -1)
  588. return -1;
  589. break;
  590. }
  591. t = ms->offset + sizeof(float);
  592. break;
  593. case FILE_DOUBLE:
  594. case FILE_BEDOUBLE:
  595. case FILE_LEDOUBLE:
  596. vd = p->d;
  597. switch (check_fmt(ms, m)) {
  598. case -1:
  599. return -1;
  600. case 1:
  601. (void)snprintf(buf, sizeof(buf), "%g", vd);
  602. if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
  603. return -1;
  604. break;
  605. default:
  606. if (file_printf(ms, F(ms, m, "%g"), vd) == -1)
  607. return -1;
  608. break;
  609. }
  610. t = ms->offset + sizeof(double);
  611. break;
  612. case FILE_SEARCH:
  613. case FILE_REGEX: {
  614. char *cp;
  615. int rval;
  616. cp = strndup((const char *)ms->search.s, ms->search.rm_len);
  617. if (cp == NULL) {
  618. file_oomem(ms, ms->search.rm_len);
  619. return -1;
  620. }
  621. rval = file_printf(ms, F(ms, m, "%s"),
  622. file_printable(sbuf, sizeof(sbuf), cp));
  623. free(cp);
  624. if (rval == -1)
  625. return -1;
  626. if ((m->str_flags & REGEX_OFFSET_START))
  627. t = ms->search.offset;
  628. else
  629. t = ms->search.offset + ms->search.rm_len;
  630. break;
  631. }
  632. case FILE_DEFAULT:
  633. case FILE_CLEAR:
  634. if (file_printf(ms, "%s", m->desc) == -1)
  635. return -1;
  636. t = ms->offset;
  637. break;
  638. case FILE_INDIRECT:
  639. case FILE_USE:
  640. case FILE_NAME:
  641. t = ms->offset;
  642. break;
  643. case FILE_DER:
  644. if (file_printf(ms, F(ms, m, "%s"),
  645. file_printable(sbuf, sizeof(sbuf), ms->ms_value.s)) == -1)
  646. return -1;
  647. t = ms->offset;
  648. break;
  649. default:
  650. file_magerror(ms, "invalid m->type (%d) in mprint()", m->type);
  651. return -1;
  652. }
  653. return (int32_t)t;
  654. }
  655. private int
  656. moffset(struct magic_set *ms, struct magic *m, size_t nbytes, int32_t *op)
  657. {
  658. int32_t o;
  659. switch (m->type) {
  660. case FILE_BYTE:
  661. o = CAST(int32_t, (ms->offset + sizeof(char)));
  662. break;
  663. case FILE_SHORT:
  664. case FILE_BESHORT:
  665. case FILE_LESHORT:
  666. o = CAST(int32_t, (ms->offset + sizeof(short)));
  667. break;
  668. case FILE_LONG:
  669. case FILE_BELONG:
  670. case FILE_LELONG:
  671. case FILE_MELONG:
  672. o = CAST(int32_t, (ms->offset + sizeof(int32_t)));
  673. break;
  674. case FILE_QUAD:
  675. case FILE_BEQUAD:
  676. case FILE_LEQUAD:
  677. o = CAST(int32_t, (ms->offset + sizeof(int64_t)));
  678. break;
  679. case FILE_STRING:
  680. case FILE_PSTRING:
  681. case FILE_BESTRING16:
  682. case FILE_LESTRING16:
  683. if (m->reln == '=' || m->reln == '!') {
  684. o = ms->offset + m->vallen;
  685. } else {
  686. union VALUETYPE *p = &ms->ms_value;
  687. if (*m->value.s == '\0')
  688. p->s[strcspn(p->s, "\r\n")] = '\0';
  689. o = CAST(uint32_t, (ms->offset + strlen(p->s)));
  690. if (m->type == FILE_PSTRING)
  691. o += (uint32_t)file_pstring_length_size(m);
  692. }
  693. break;
  694. case FILE_DATE:
  695. case FILE_BEDATE:
  696. case FILE_LEDATE:
  697. case FILE_MEDATE:
  698. o = CAST(int32_t, (ms->offset + sizeof(uint32_t)));
  699. break;
  700. case FILE_LDATE:
  701. case FILE_BELDATE:
  702. case FILE_LELDATE:
  703. case FILE_MELDATE:
  704. o = CAST(int32_t, (ms->offset + sizeof(uint32_t)));
  705. break;
  706. case FILE_QDATE:
  707. case FILE_BEQDATE:
  708. case FILE_LEQDATE:
  709. o = CAST(int32_t, (ms->offset + sizeof(uint64_t)));
  710. break;
  711. case FILE_QLDATE:
  712. case FILE_BEQLDATE:
  713. case FILE_LEQLDATE:
  714. o = CAST(int32_t, (ms->offset + sizeof(uint64_t)));
  715. break;
  716. case FILE_FLOAT:
  717. case FILE_BEFLOAT:
  718. case FILE_LEFLOAT:
  719. o = CAST(int32_t, (ms->offset + sizeof(float)));
  720. break;
  721. case FILE_DOUBLE:
  722. case FILE_BEDOUBLE:
  723. case FILE_LEDOUBLE:
  724. o = CAST(int32_t, (ms->offset + sizeof(double)));
  725. break;
  726. case FILE_REGEX:
  727. if ((m->str_flags & REGEX_OFFSET_START) != 0)
  728. o = CAST(int32_t, ms->search.offset);
  729. else
  730. o = CAST(int32_t,
  731. (ms->search.offset + ms->search.rm_len));
  732. break;
  733. case FILE_SEARCH:
  734. if ((m->str_flags & REGEX_OFFSET_START) != 0)
  735. o = CAST(int32_t, ms->search.offset);
  736. else
  737. o = CAST(int32_t, (ms->search.offset + m->vallen));
  738. break;
  739. case FILE_CLEAR:
  740. case FILE_DEFAULT:
  741. case FILE_INDIRECT:
  742. o = ms->offset;
  743. break;
  744. case FILE_DER:
  745. {
  746. o = der_offs(ms, m, nbytes);
  747. if (o == -1 || (size_t)o > nbytes) {
  748. if ((ms->flags & MAGIC_DEBUG) != 0) {
  749. (void)fprintf(stderr,
  750. "Bad DER offset %d nbytes=%zu",
  751. o, nbytes);
  752. }
  753. *op = 0;
  754. return 0;
  755. }
  756. break;
  757. }
  758. default:
  759. o = 0;
  760. break;
  761. }
  762. if ((size_t)o > nbytes) {
  763. #if 0
  764. file_error(ms, 0, "Offset out of range %zu > %zu",
  765. (size_t)o, nbytes);
  766. #endif
  767. return -1;
  768. }
  769. *op = o;
  770. return 1;
  771. }
  772. private uint32_t
  773. cvt_id3(struct magic_set *ms, uint32_t v)
  774. {
  775. v = ((((v >> 0) & 0x7f) << 0) |
  776. (((v >> 8) & 0x7f) << 7) |
  777. (((v >> 16) & 0x7f) << 14) |
  778. (((v >> 24) & 0x7f) << 21));
  779. if ((ms->flags & MAGIC_DEBUG) != 0)
  780. fprintf(stderr, "id3 offs=%u\n", v);
  781. return v;
  782. }
  783. private int
  784. cvt_flip(int type, int flip)
  785. {
  786. if (flip == 0)
  787. return type;
  788. switch (type) {
  789. case FILE_BESHORT:
  790. return FILE_LESHORT;
  791. case FILE_BELONG:
  792. return FILE_LELONG;
  793. case FILE_BEDATE:
  794. return FILE_LEDATE;
  795. case FILE_BELDATE:
  796. return FILE_LELDATE;
  797. case FILE_BEQUAD:
  798. return FILE_LEQUAD;
  799. case FILE_BEQDATE:
  800. return FILE_LEQDATE;
  801. case FILE_BEQLDATE:
  802. return FILE_LEQLDATE;
  803. case FILE_BEQWDATE:
  804. return FILE_LEQWDATE;
  805. case FILE_LESHORT:
  806. return FILE_BESHORT;
  807. case FILE_LELONG:
  808. return FILE_BELONG;
  809. case FILE_LEDATE:
  810. return FILE_BEDATE;
  811. case FILE_LELDATE:
  812. return FILE_BELDATE;
  813. case FILE_LEQUAD:
  814. return FILE_BEQUAD;
  815. case FILE_LEQDATE:
  816. return FILE_BEQDATE;
  817. case FILE_LEQLDATE:
  818. return FILE_BEQLDATE;
  819. case FILE_LEQWDATE:
  820. return FILE_BEQWDATE;
  821. case FILE_BEFLOAT:
  822. return FILE_LEFLOAT;
  823. case FILE_LEFLOAT:
  824. return FILE_BEFLOAT;
  825. case FILE_BEDOUBLE:
  826. return FILE_LEDOUBLE;
  827. case FILE_LEDOUBLE:
  828. return FILE_BEDOUBLE;
  829. default:
  830. return type;
  831. }
  832. }
  833. #define DO_CVT(fld, cast) \
  834. if (m->num_mask) \
  835. switch (m->mask_op & FILE_OPS_MASK) { \
  836. case FILE_OPAND: \
  837. p->fld &= cast m->num_mask; \
  838. break; \
  839. case FILE_OPOR: \
  840. p->fld |= cast m->num_mask; \
  841. break; \
  842. case FILE_OPXOR: \
  843. p->fld ^= cast m->num_mask; \
  844. break; \
  845. case FILE_OPADD: \
  846. p->fld += cast m->num_mask; \
  847. break; \
  848. case FILE_OPMINUS: \
  849. p->fld -= cast m->num_mask; \
  850. break; \
  851. case FILE_OPMULTIPLY: \
  852. p->fld *= cast m->num_mask; \
  853. break; \
  854. case FILE_OPDIVIDE: \
  855. if (cast m->num_mask == 0) \
  856. return -1; \
  857. p->fld /= cast m->num_mask; \
  858. break; \
  859. case FILE_OPMODULO: \
  860. if (cast m->num_mask == 0) \
  861. return -1; \
  862. p->fld %= cast m->num_mask; \
  863. break; \
  864. } \
  865. if (m->mask_op & FILE_OPINVERSE) \
  866. p->fld = ~p->fld \
  867. private int
  868. cvt_8(union VALUETYPE *p, const struct magic *m)
  869. {
  870. DO_CVT(b, (uint8_t));
  871. return 0;
  872. }
  873. private int
  874. cvt_16(union VALUETYPE *p, const struct magic *m)
  875. {
  876. DO_CVT(h, (uint16_t));
  877. return 0;
  878. }
  879. private int
  880. cvt_32(union VALUETYPE *p, const struct magic *m)
  881. {
  882. DO_CVT(l, (uint32_t));
  883. return 0;
  884. }
  885. private int
  886. cvt_64(union VALUETYPE *p, const struct magic *m)
  887. {
  888. DO_CVT(q, (uint64_t));
  889. return 0;
  890. }
  891. #define DO_CVT2(fld, cast) \
  892. if (m->num_mask) \
  893. switch (m->mask_op & FILE_OPS_MASK) { \
  894. case FILE_OPADD: \
  895. p->fld += cast m->num_mask; \
  896. break; \
  897. case FILE_OPMINUS: \
  898. p->fld -= cast m->num_mask; \
  899. break; \
  900. case FILE_OPMULTIPLY: \
  901. p->fld *= cast m->num_mask; \
  902. break; \
  903. case FILE_OPDIVIDE: \
  904. if (cast m->num_mask == 0) \
  905. return -1; \
  906. p->fld /= cast m->num_mask; \
  907. break; \
  908. } \
  909. private int
  910. cvt_float(union VALUETYPE *p, const struct magic *m)
  911. {
  912. DO_CVT2(f, (float));
  913. return 0;
  914. }
  915. private int
  916. cvt_double(union VALUETYPE *p, const struct magic *m)
  917. {
  918. DO_CVT2(d, (double));
  919. return 0;
  920. }
  921. /*
  922. * Convert the byte order of the data we are looking at
  923. * While we're here, let's apply the mask operation
  924. * (unless you have a better idea)
  925. */
  926. private int
  927. mconvert(struct magic_set *ms, struct magic *m, int flip)
  928. {
  929. union VALUETYPE *p = &ms->ms_value;
  930. switch (cvt_flip(m->type, flip)) {
  931. case FILE_BYTE:
  932. if (cvt_8(p, m) == -1)
  933. goto out;
  934. return 1;
  935. case FILE_SHORT:
  936. if (cvt_16(p, m) == -1)
  937. goto out;
  938. return 1;
  939. case FILE_LONG:
  940. case FILE_DATE:
  941. case FILE_LDATE:
  942. if (cvt_32(p, m) == -1)
  943. goto out;
  944. return 1;
  945. case FILE_QUAD:
  946. case FILE_QDATE:
  947. case FILE_QLDATE:
  948. case FILE_QWDATE:
  949. if (cvt_64(p, m) == -1)
  950. goto out;
  951. return 1;
  952. case FILE_STRING:
  953. case FILE_BESTRING16:
  954. case FILE_LESTRING16: {
  955. /* Null terminate and eat *trailing* return */
  956. p->s[sizeof(p->s) - 1] = '\0';
  957. return 1;
  958. }
  959. case FILE_PSTRING: {
  960. size_t sz = file_pstring_length_size(m);
  961. char *ptr1 = p->s, *ptr2 = ptr1 + sz;
  962. size_t len = file_pstring_get_length(m, ptr1);
  963. sz = sizeof(p->s) - sz; /* maximum length of string */
  964. if (len >= sz) {
  965. /*
  966. * The size of the pascal string length (sz)
  967. * is 1, 2, or 4. We need at least 1 byte for NUL
  968. * termination, but we've already truncated the
  969. * string by p->s, so we need to deduct sz.
  970. * Because we can use one of the bytes of the length
  971. * after we shifted as NUL termination.
  972. */
  973. len = sz;
  974. }
  975. while (len--)
  976. *ptr1++ = *ptr2++;
  977. *ptr1 = '\0';
  978. return 1;
  979. }
  980. case FILE_BESHORT:
  981. p->h = (short)BE16(p);
  982. if (cvt_16(p, m) == -1)
  983. goto out;
  984. return 1;
  985. case FILE_BELONG:
  986. case FILE_BEDATE:
  987. case FILE_BELDATE:
  988. p->l = (int32_t)BE32(p);
  989. if (cvt_32(p, m) == -1)
  990. goto out;
  991. return 1;
  992. case FILE_BEQUAD:
  993. case FILE_BEQDATE:
  994. case FILE_BEQLDATE:
  995. case FILE_BEQWDATE:
  996. p->q = (uint64_t)BE64(p);
  997. if (cvt_64(p, m) == -1)
  998. goto out;
  999. return 1;
  1000. case FILE_LESHORT:
  1001. p->h = (short)LE16(p);
  1002. if (cvt_16(p, m) == -1)
  1003. goto out;
  1004. return 1;
  1005. case FILE_LELONG:
  1006. case FILE_LEDATE:
  1007. case FILE_LELDATE:
  1008. p->l = (int32_t)LE32(p);
  1009. if (cvt_32(p, m) == -1)
  1010. goto out;
  1011. return 1;
  1012. case FILE_LEQUAD:
  1013. case FILE_LEQDATE:
  1014. case FILE_LEQLDATE:
  1015. case FILE_LEQWDATE:
  1016. p->q = (uint64_t)LE64(p);
  1017. if (cvt_64(p, m) == -1)
  1018. goto out;
  1019. return 1;
  1020. case FILE_MELONG:
  1021. case FILE_MEDATE:
  1022. case FILE_MELDATE:
  1023. p->l = (int32_t)ME32(p);
  1024. if (cvt_32(p, m) == -1)
  1025. goto out;
  1026. return 1;
  1027. case FILE_FLOAT:
  1028. if (cvt_float(p, m) == -1)
  1029. goto out;
  1030. return 1;
  1031. case FILE_BEFLOAT:
  1032. p->l = BE32(p);
  1033. if (cvt_float(p, m) == -1)
  1034. goto out;
  1035. return 1;
  1036. case FILE_LEFLOAT:
  1037. p->l = LE32(p);
  1038. if (cvt_float(p, m) == -1)
  1039. goto out;
  1040. return 1;
  1041. case FILE_DOUBLE:
  1042. if (cvt_double(p, m) == -1)
  1043. goto out;
  1044. return 1;
  1045. case FILE_BEDOUBLE:
  1046. p->q = BE64(p);
  1047. if (cvt_double(p, m) == -1)
  1048. goto out;
  1049. return 1;
  1050. case FILE_LEDOUBLE:
  1051. p->q = LE64(p);
  1052. if (cvt_double(p, m) == -1)
  1053. goto out;
  1054. return 1;
  1055. case FILE_REGEX:
  1056. case FILE_SEARCH:
  1057. case FILE_DEFAULT:
  1058. case FILE_CLEAR:
  1059. case FILE_NAME:
  1060. case FILE_USE:
  1061. case FILE_DER:
  1062. return 1;
  1063. default:
  1064. file_magerror(ms, "invalid type %d in mconvert()", m->type);
  1065. return 0;
  1066. }
  1067. out:
  1068. file_magerror(ms, "zerodivide in mconvert()");
  1069. return 0;
  1070. }
  1071. private void
  1072. mdebug(uint32_t offset, const char *str, size_t len)
  1073. {
  1074. (void) fprintf(stderr, "mget/%" SIZE_T_FORMAT "u @%d: ", len, offset);
  1075. file_showstr(stderr, str, len);
  1076. (void) fputc('\n', stderr);
  1077. (void) fputc('\n', stderr);
  1078. }
  1079. private int
  1080. mcopy(struct magic_set *ms, union VALUETYPE *p, int type, int indir,
  1081. const unsigned char *s, uint32_t offset, size_t nbytes, struct magic *m)
  1082. {
  1083. /*
  1084. * Note: FILE_SEARCH and FILE_REGEX do not actually copy
  1085. * anything, but setup pointers into the source
  1086. */
  1087. if (indir == 0) {
  1088. switch (type) {
  1089. case FILE_DER:
  1090. case FILE_SEARCH:
  1091. if (offset > nbytes)
  1092. offset = CAST(uint32_t, nbytes);
  1093. ms->search.s = RCAST(const char *, s) + offset;
  1094. ms->search.s_len = nbytes - offset;
  1095. ms->search.offset = offset;
  1096. return 0;
  1097. case FILE_REGEX: {
  1098. const char *b;
  1099. const char *c;
  1100. const char *last; /* end of search region */
  1101. const char *buf; /* start of search region */
  1102. const char *end;
  1103. size_t lines, linecnt, bytecnt;
  1104. if (s == NULL || nbytes < offset) {
  1105. ms->search.s_len = 0;
  1106. ms->search.s = NULL;
  1107. return 0;
  1108. }
  1109. if (m->str_flags & REGEX_LINE_COUNT) {
  1110. linecnt = m->str_range;
  1111. bytecnt = linecnt * 80;
  1112. } else {
  1113. linecnt = 0;
  1114. bytecnt = m->str_range;
  1115. }
  1116. if (bytecnt == 0 || bytecnt > nbytes - offset)
  1117. bytecnt = nbytes - offset;
  1118. if (bytecnt > ms->regex_max)
  1119. bytecnt = ms->regex_max;
  1120. buf = RCAST(const char *, s) + offset;
  1121. end = last = RCAST(const char *, s) + bytecnt + offset;
  1122. /* mget() guarantees buf <= last */
  1123. for (lines = linecnt, b = buf; lines && b < end &&
  1124. ((b = CAST(const char *,
  1125. memchr(c = b, '\n', CAST(size_t, (end - b)))))
  1126. || (b = CAST(const char *,
  1127. memchr(c, '\r', CAST(size_t, (end - c))))));
  1128. lines--, b++) {
  1129. last = b;
  1130. if (b < end - 1 && b[0] == '\r' && b[1] == '\n')
  1131. b++;
  1132. }
  1133. if (lines)
  1134. last = RCAST(const char *, s) + bytecnt;
  1135. ms->search.s = buf;
  1136. ms->search.s_len = last - buf;
  1137. ms->search.offset = offset;
  1138. ms->search.rm_len = 0;
  1139. return 0;
  1140. }
  1141. case FILE_BESTRING16:
  1142. case FILE_LESTRING16: {
  1143. const unsigned char *src = s + offset;
  1144. const unsigned char *esrc = s + nbytes;
  1145. char *dst = p->s;
  1146. char *edst = &p->s[sizeof(p->s) - 1];
  1147. if (type == FILE_BESTRING16)
  1148. src++;
  1149. /* check that offset is within range */
  1150. if (offset >= nbytes)
  1151. break;
  1152. for (/*EMPTY*/; src < esrc; src += 2, dst++) {
  1153. if (dst < edst)
  1154. *dst = *src;
  1155. else
  1156. break;
  1157. if (*dst == '\0') {
  1158. if (type == FILE_BESTRING16 ?
  1159. *(src - 1) != '\0' :
  1160. ((src + 1 < esrc) &&
  1161. *(src + 1) != '\0'))
  1162. *dst = ' ';
  1163. }
  1164. }
  1165. *edst = '\0';
  1166. return 0;
  1167. }
  1168. case FILE_STRING: /* XXX - these two should not need */
  1169. case FILE_PSTRING: /* to copy anything, but do anyway. */
  1170. default:
  1171. break;
  1172. }
  1173. }
  1174. if (offset >= nbytes) {
  1175. (void)memset(p, '\0', sizeof(*p));
  1176. return 0;
  1177. }
  1178. if (nbytes - offset < sizeof(*p))
  1179. nbytes = nbytes - offset;
  1180. else
  1181. nbytes = sizeof(*p);
  1182. (void)memcpy(p, s + offset, nbytes);
  1183. /*
  1184. * the usefulness of padding with zeroes eludes me, it
  1185. * might even cause problems
  1186. */
  1187. if (nbytes < sizeof(*p))
  1188. (void)memset(((char *)(void *)p) + nbytes, '\0',
  1189. sizeof(*p) - nbytes);
  1190. return 0;
  1191. }
  1192. private uint32_t
  1193. do_ops(struct magic *m, intmax_t lhs, intmax_t off)
  1194. {
  1195. intmax_t offset;
  1196. if (off) {
  1197. switch (m->in_op & FILE_OPS_MASK) {
  1198. case FILE_OPAND:
  1199. offset = lhs & off;
  1200. break;
  1201. case FILE_OPOR:
  1202. offset = lhs | off;
  1203. break;
  1204. case FILE_OPXOR:
  1205. offset = lhs ^ off;
  1206. break;
  1207. case FILE_OPADD:
  1208. offset = lhs + off;
  1209. break;
  1210. case FILE_OPMINUS:
  1211. offset = lhs - off;
  1212. break;
  1213. case FILE_OPMULTIPLY:
  1214. offset = lhs * off;
  1215. break;
  1216. case FILE_OPDIVIDE:
  1217. offset = lhs / off;
  1218. break;
  1219. case FILE_OPMODULO:
  1220. offset = lhs % off;
  1221. break;
  1222. }
  1223. } else
  1224. offset = lhs;
  1225. if (m->in_op & FILE_OPINVERSE)
  1226. offset = ~offset;
  1227. return (uint32_t)offset;
  1228. }
  1229. private int
  1230. mget(struct magic_set *ms, const unsigned char *s, struct magic *m,
  1231. size_t nbytes, size_t o, unsigned int cont_level, int mode, int text,
  1232. int flip, uint16_t *indir_count, uint16_t *name_count,
  1233. int *printed_something, int *need_separator, int *returnval)
  1234. {
  1235. uint32_t offset = ms->offset;
  1236. intmax_t lhs;
  1237. file_pushbuf_t *pb;
  1238. int rv, oneed_separator, in_type;
  1239. char *rbuf;
  1240. union VALUETYPE *p = &ms->ms_value;
  1241. struct mlist ml;
  1242. if (*indir_count >= ms->indir_max) {
  1243. file_error(ms, 0, "indirect count (%hu) exceeded",
  1244. *indir_count);
  1245. return -1;
  1246. }
  1247. if (*name_count >= ms->name_max) {
  1248. file_error(ms, 0, "name use count (%hu) exceeded",
  1249. *name_count);
  1250. return -1;
  1251. }
  1252. if (mcopy(ms, p, m->type, m->flag & INDIR, s, (uint32_t)(offset + o),
  1253. (uint32_t)nbytes, m) == -1)
  1254. return -1;
  1255. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1256. fprintf(stderr, "mget(type=%d, flag=%#x, offset=%u, o=%"
  1257. SIZE_T_FORMAT "u, " "nbytes=%" SIZE_T_FORMAT
  1258. "u, il=%hu, nc=%hu)\n",
  1259. m->type, m->flag, offset, o, nbytes,
  1260. *indir_count, *name_count);
  1261. mdebug(offset, (char *)(void *)p, sizeof(union VALUETYPE));
  1262. #ifndef COMPILE_ONLY
  1263. file_mdump(m);
  1264. #endif
  1265. }
  1266. if (m->flag & INDIR) {
  1267. intmax_t off = m->in_offset;
  1268. const int sgn = m->in_op & FILE_OPSIGNED;
  1269. if (m->in_op & FILE_OPINDIRECT) {
  1270. const union VALUETYPE *q = CAST(const union VALUETYPE *,
  1271. ((const void *)(s + offset + off)));
  1272. if (OFFSET_OOB(nbytes, offset + off, sizeof(*q)))
  1273. return 0;
  1274. switch (cvt_flip(m->in_type, flip)) {
  1275. case FILE_BYTE:
  1276. off = SEXT(sgn,8,q->b);
  1277. break;
  1278. case FILE_SHORT:
  1279. off = SEXT(sgn,16,q->h);
  1280. break;
  1281. case FILE_BESHORT:
  1282. off = SEXT(sgn,16,BE16(q));
  1283. break;
  1284. case FILE_LESHORT:
  1285. off = SEXT(sgn,16,LE16(q));
  1286. break;
  1287. case FILE_LONG:
  1288. off = SEXT(sgn,32,q->l);
  1289. break;
  1290. case FILE_BELONG:
  1291. case FILE_BEID3:
  1292. off = SEXT(sgn,32,BE32(q));
  1293. break;
  1294. case FILE_LEID3:
  1295. case FILE_LELONG:
  1296. off = SEXT(sgn,32,LE32(q));
  1297. break;
  1298. case FILE_MELONG:
  1299. off = SEXT(sgn,32,ME32(q));
  1300. break;
  1301. }
  1302. if ((ms->flags & MAGIC_DEBUG) != 0)
  1303. fprintf(stderr, "indirect offs=%jd\n", off);
  1304. }
  1305. switch (in_type = cvt_flip(m->in_type, flip)) {
  1306. case FILE_BYTE:
  1307. if (OFFSET_OOB(nbytes, offset, 1))
  1308. return 0;
  1309. offset = do_ops(m, SEXT(sgn,8,p->b), off);
  1310. break;
  1311. case FILE_BESHORT:
  1312. if (OFFSET_OOB(nbytes, offset, 2))
  1313. return 0;
  1314. offset = do_ops(m, SEXT(sgn,16,BE16(p)), off);
  1315. break;
  1316. case FILE_LESHORT:
  1317. if (OFFSET_OOB(nbytes, offset, 2))
  1318. return 0;
  1319. offset = do_ops(m, SEXT(sgn,16,LE16(p)), off);
  1320. break;
  1321. case FILE_SHORT:
  1322. if (OFFSET_OOB(nbytes, offset, 2))
  1323. return 0;
  1324. offset = do_ops(m, SEXT(sgn,16,p->h), off);
  1325. break;
  1326. case FILE_BELONG:
  1327. case FILE_BEID3:
  1328. if (OFFSET_OOB(nbytes, offset, 4))
  1329. return 0;
  1330. lhs = BE32(p);
  1331. if (in_type == FILE_BEID3)
  1332. lhs = cvt_id3(ms, (uint32_t)lhs);
  1333. offset = do_ops(m, SEXT(sgn,32,lhs), off);
  1334. break;
  1335. case FILE_LELONG:
  1336. case FILE_LEID3:
  1337. if (OFFSET_OOB(nbytes, offset, 4))
  1338. return 0;
  1339. lhs = LE32(p);
  1340. if (in_type == FILE_LEID3)
  1341. lhs = cvt_id3(ms, (uint32_t)lhs);
  1342. offset = do_ops(m, SEXT(sgn,32,lhs), off);
  1343. break;
  1344. case FILE_MELONG:
  1345. if (OFFSET_OOB(nbytes, offset, 4))
  1346. return 0;
  1347. offset = do_ops(m, SEXT(sgn,32,ME32(p)), off);
  1348. break;
  1349. case FILE_LONG:
  1350. if (OFFSET_OOB(nbytes, offset, 4))
  1351. return 0;
  1352. offset = do_ops(m, SEXT(sgn,32,p->l), off);
  1353. break;
  1354. default:
  1355. break;
  1356. }
  1357. if (m->flag & INDIROFFADD) {
  1358. offset += ms->c.li[cont_level-1].off;
  1359. if (offset == 0) {
  1360. if ((ms->flags & MAGIC_DEBUG) != 0)
  1361. fprintf(stderr,
  1362. "indirect *zero* offset\n");
  1363. return 0;
  1364. }
  1365. if ((ms->flags & MAGIC_DEBUG) != 0)
  1366. fprintf(stderr, "indirect +offs=%u\n", offset);
  1367. }
  1368. if (mcopy(ms, p, m->type, 0, s, offset, nbytes, m) == -1)
  1369. return -1;
  1370. ms->offset = offset;
  1371. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1372. mdebug(offset, (char *)(void *)p,
  1373. sizeof(union VALUETYPE));
  1374. #ifndef COMPILE_ONLY
  1375. file_mdump(m);
  1376. #endif
  1377. }
  1378. }
  1379. /* Verify we have enough data to match magic type */
  1380. switch (m->type) {
  1381. case FILE_BYTE:
  1382. if (OFFSET_OOB(nbytes, offset, 1))
  1383. return 0;
  1384. break;
  1385. case FILE_SHORT:
  1386. case FILE_BESHORT:
  1387. case FILE_LESHORT:
  1388. if (OFFSET_OOB(nbytes, offset, 2))
  1389. return 0;
  1390. break;
  1391. case FILE_LONG:
  1392. case FILE_BELONG:
  1393. case FILE_LELONG:
  1394. case FILE_MELONG:
  1395. case FILE_DATE:
  1396. case FILE_BEDATE:
  1397. case FILE_LEDATE:
  1398. case FILE_MEDATE:
  1399. case FILE_LDATE:
  1400. case FILE_BELDATE:
  1401. case FILE_LELDATE:
  1402. case FILE_MELDATE:
  1403. case FILE_FLOAT:
  1404. case FILE_BEFLOAT:
  1405. case FILE_LEFLOAT:
  1406. if (OFFSET_OOB(nbytes, offset, 4))
  1407. return 0;
  1408. break;
  1409. case FILE_DOUBLE:
  1410. case FILE_BEDOUBLE:
  1411. case FILE_LEDOUBLE:
  1412. if (OFFSET_OOB(nbytes, offset, 8))
  1413. return 0;
  1414. break;
  1415. case FILE_STRING:
  1416. case FILE_PSTRING:
  1417. case FILE_SEARCH:
  1418. if (OFFSET_OOB(nbytes, offset, m->vallen))
  1419. return 0;
  1420. break;
  1421. case FILE_REGEX:
  1422. if (nbytes < offset)
  1423. return 0;
  1424. break;
  1425. case FILE_INDIRECT:
  1426. if (m->str_flags & INDIRECT_RELATIVE)
  1427. offset += CAST(uint32_t, o);
  1428. if (offset == 0)
  1429. return 0;
  1430. if (nbytes < offset)
  1431. return 0;
  1432. if ((pb = file_push_buffer(ms)) == NULL)
  1433. return -1;
  1434. (*indir_count)++;
  1435. rv = file_softmagic(ms, s + offset, nbytes - offset,
  1436. indir_count, name_count, BINTEST, text);
  1437. if ((ms->flags & MAGIC_DEBUG) != 0)
  1438. fprintf(stderr, "indirect @offs=%u[%d]\n", offset, rv);
  1439. rbuf = file_pop_buffer(ms, pb);
  1440. if (rbuf == NULL && ms->event_flags & EVENT_HAD_ERR)
  1441. return -1;
  1442. if (rv == 1) {
  1443. if ((ms->flags & MAGIC_NODESC) == 0 &&
  1444. file_printf(ms, F(ms, m, "%u"), offset) == -1) {
  1445. free(rbuf);
  1446. return -1;
  1447. }
  1448. if (file_printf(ms, "%s", rbuf) == -1) {
  1449. free(rbuf);
  1450. return -1;
  1451. }
  1452. }
  1453. free(rbuf);
  1454. return rv;
  1455. case FILE_USE:
  1456. if (nbytes < offset)
  1457. return 0;
  1458. rbuf = m->value.s;
  1459. if (*rbuf == '^') {
  1460. rbuf++;
  1461. flip = !flip;
  1462. }
  1463. if (file_magicfind(ms, rbuf, &ml) == -1) {
  1464. file_error(ms, 0, "cannot find entry `%s'", rbuf);
  1465. return -1;
  1466. }
  1467. (*name_count)++;
  1468. oneed_separator = *need_separator;
  1469. if (m->flag & NOSPACE)
  1470. *need_separator = 0;
  1471. rv = match(ms, ml.magic, ml.nmagic, s, nbytes, offset + o,
  1472. mode, text, flip, indir_count, name_count,
  1473. printed_something, need_separator, returnval);
  1474. if (rv != 1)
  1475. *need_separator = oneed_separator;
  1476. return 1;
  1477. case FILE_NAME:
  1478. if (ms->flags & MAGIC_NODESC)
  1479. return 1;
  1480. if (file_printf(ms, "%s", m->desc) == -1)
  1481. return -1;
  1482. return 1;
  1483. case FILE_DER:
  1484. case FILE_DEFAULT: /* nothing to check */
  1485. case FILE_CLEAR:
  1486. default:
  1487. break;
  1488. }
  1489. if (!mconvert(ms, m, flip))
  1490. return 0;
  1491. return 1;
  1492. }
  1493. private uint64_t
  1494. file_strncmp(const char *s1, const char *s2, size_t len, uint32_t flags)
  1495. {
  1496. /*
  1497. * Convert the source args to unsigned here so that (1) the
  1498. * compare will be unsigned as it is in strncmp() and (2) so
  1499. * the ctype functions will work correctly without extra
  1500. * casting.
  1501. */
  1502. const unsigned char *a = (const unsigned char *)s1;
  1503. const unsigned char *b = (const unsigned char *)s2;
  1504. const unsigned char *eb = b + len;
  1505. uint64_t v;
  1506. /*
  1507. * What we want here is v = strncmp(s1, s2, len),
  1508. * but ignoring any nulls.
  1509. */
  1510. v = 0;
  1511. if (0L == flags) { /* normal string: do it fast */
  1512. while (len-- > 0)
  1513. if ((v = *b++ - *a++) != '\0')
  1514. break;
  1515. }
  1516. else { /* combine the others */
  1517. while (len-- > 0) {
  1518. if (b >= eb) {
  1519. v = 1;
  1520. break;
  1521. }
  1522. if ((flags & STRING_IGNORE_LOWERCASE) &&
  1523. islower(*a)) {
  1524. if ((v = tolower(*b++) - *a++) != '\0')
  1525. break;
  1526. }
  1527. else if ((flags & STRING_IGNORE_UPPERCASE) &&
  1528. isupper(*a)) {
  1529. if ((v = toupper(*b++) - *a++) != '\0')
  1530. break;
  1531. }
  1532. else if ((flags & STRING_COMPACT_WHITESPACE) &&
  1533. isspace(*a)) {
  1534. a++;
  1535. if (isspace(*b++)) {
  1536. if (!isspace(*a))
  1537. while (b < eb && isspace(*b))
  1538. b++;
  1539. }
  1540. else {
  1541. v = 1;
  1542. break;
  1543. }
  1544. }
  1545. else if ((flags & STRING_COMPACT_OPTIONAL_WHITESPACE) &&
  1546. isspace(*a)) {
  1547. a++;
  1548. while (b < eb && isspace(*b))
  1549. b++;
  1550. }
  1551. else {
  1552. if ((v = *b++ - *a++) != '\0')
  1553. break;
  1554. }
  1555. }
  1556. }
  1557. return v;
  1558. }
  1559. private uint64_t
  1560. file_strncmp16(const char *a, const char *b, size_t len, uint32_t flags)
  1561. {
  1562. /*
  1563. * XXX - The 16-bit string compare probably needs to be done
  1564. * differently, especially if the flags are to be supported.
  1565. * At the moment, I am unsure.
  1566. */
  1567. flags = 0;
  1568. return file_strncmp(a, b, len, flags);
  1569. }
  1570. private int
  1571. magiccheck(struct magic_set *ms, struct magic *m)
  1572. {
  1573. uint64_t l = m->value.q;
  1574. uint64_t v;
  1575. float fl, fv;
  1576. double dl, dv;
  1577. int matched;
  1578. union VALUETYPE *p = &ms->ms_value;
  1579. switch (m->type) {
  1580. case FILE_BYTE:
  1581. v = p->b;
  1582. break;
  1583. case FILE_SHORT:
  1584. case FILE_BESHORT:
  1585. case FILE_LESHORT:
  1586. v = p->h;
  1587. break;
  1588. case FILE_LONG:
  1589. case FILE_BELONG:
  1590. case FILE_LELONG:
  1591. case FILE_MELONG:
  1592. case FILE_DATE:
  1593. case FILE_BEDATE:
  1594. case FILE_LEDATE:
  1595. case FILE_MEDATE:
  1596. case FILE_LDATE:
  1597. case FILE_BELDATE:
  1598. case FILE_LELDATE:
  1599. case FILE_MELDATE:
  1600. v = p->l;
  1601. break;
  1602. case FILE_QUAD:
  1603. case FILE_LEQUAD:
  1604. case FILE_BEQUAD:
  1605. case FILE_QDATE:
  1606. case FILE_BEQDATE:
  1607. case FILE_LEQDATE:
  1608. case FILE_QLDATE:
  1609. case FILE_BEQLDATE:
  1610. case FILE_LEQLDATE:
  1611. case FILE_QWDATE:
  1612. case FILE_BEQWDATE:
  1613. case FILE_LEQWDATE:
  1614. v = p->q;
  1615. break;
  1616. case FILE_FLOAT:
  1617. case FILE_BEFLOAT:
  1618. case FILE_LEFLOAT:
  1619. fl = m->value.f;
  1620. fv = p->f;
  1621. switch (m->reln) {
  1622. case 'x':
  1623. matched = 1;
  1624. break;
  1625. case '!':
  1626. matched = fv != fl;
  1627. break;
  1628. case '=':
  1629. matched = fv == fl;
  1630. break;
  1631. case '>':
  1632. matched = fv > fl;
  1633. break;
  1634. case '<':
  1635. matched = fv < fl;
  1636. break;
  1637. default:
  1638. file_magerror(ms, "cannot happen with float: invalid relation `%c'",
  1639. m->reln);
  1640. return -1;
  1641. }
  1642. return matched;
  1643. case FILE_DOUBLE:
  1644. case FILE_BEDOUBLE:
  1645. case FILE_LEDOUBLE:
  1646. dl = m->value.d;
  1647. dv = p->d;
  1648. switch (m->reln) {
  1649. case 'x':
  1650. matched = 1;
  1651. break;
  1652. case '!':
  1653. matched = dv != dl;
  1654. break;
  1655. case '=':
  1656. matched = dv == dl;
  1657. break;
  1658. case '>':
  1659. matched = dv > dl;
  1660. break;
  1661. case '<':
  1662. matched = dv < dl;
  1663. break;
  1664. default:
  1665. file_magerror(ms, "cannot happen with double: invalid relation `%c'", m->reln);
  1666. return -1;
  1667. }
  1668. return matched;
  1669. case FILE_DEFAULT:
  1670. case FILE_CLEAR:
  1671. l = 0;
  1672. v = 0;
  1673. break;
  1674. case FILE_STRING:
  1675. case FILE_PSTRING:
  1676. l = 0;
  1677. v = file_strncmp(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1678. break;
  1679. case FILE_BESTRING16:
  1680. case FILE_LESTRING16:
  1681. l = 0;
  1682. v = file_strncmp16(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1683. break;
  1684. case FILE_SEARCH: { /* search ms->search.s for the string m->value.s */
  1685. size_t slen;
  1686. size_t idx;
  1687. if (ms->search.s == NULL)
  1688. return 0;
  1689. slen = MIN(m->vallen, sizeof(m->value.s));
  1690. l = 0;
  1691. v = 0;
  1692. for (idx = 0; m->str_range == 0 || idx < m->str_range; idx++) {
  1693. if (slen + idx > ms->search.s_len)
  1694. return 0;
  1695. v = file_strncmp(m->value.s, ms->search.s + idx, slen,
  1696. m->str_flags);
  1697. if (v == 0) { /* found match */
  1698. ms->search.offset += idx;
  1699. ms->search.rm_len = ms->search.s_len - idx;
  1700. break;
  1701. }
  1702. }
  1703. break;
  1704. }
  1705. case FILE_REGEX: {
  1706. int rc;
  1707. file_regex_t rx;
  1708. const char *search;
  1709. if (ms->search.s == NULL)
  1710. return 0;
  1711. l = 0;
  1712. rc = file_regcomp(&rx, m->value.s,
  1713. REG_EXTENDED|REG_NEWLINE|
  1714. ((m->str_flags & STRING_IGNORE_CASE) ? REG_ICASE : 0));
  1715. if (rc) {
  1716. file_regerror(&rx, rc, ms);
  1717. v = (uint64_t)-1;
  1718. } else {
  1719. regmatch_t pmatch;
  1720. size_t slen = ms->search.s_len;
  1721. char *copy;
  1722. if (slen != 0) {
  1723. copy = CAST(char *, malloc(slen));
  1724. if (copy == NULL) {
  1725. file_regfree(&rx);
  1726. file_error(ms, errno,
  1727. "can't allocate %" SIZE_T_FORMAT "u bytes",
  1728. slen);
  1729. return -1;
  1730. }
  1731. memcpy(copy, ms->search.s, slen);
  1732. copy[--slen] = '\0';
  1733. search = copy;
  1734. } else {
  1735. search = CCAST(char *, "");
  1736. copy = NULL;
  1737. }
  1738. rc = file_regexec(&rx, (const char *)search,
  1739. 1, &pmatch, 0);
  1740. free(copy);
  1741. switch (rc) {
  1742. case 0:
  1743. ms->search.s += (int)pmatch.rm_so;
  1744. ms->search.offset += (size_t)pmatch.rm_so;
  1745. ms->search.rm_len =
  1746. (size_t)(pmatch.rm_eo - pmatch.rm_so);
  1747. v = 0;
  1748. break;
  1749. case REG_NOMATCH:
  1750. v = 1;
  1751. break;
  1752. default:
  1753. file_regerror(&rx, rc, ms);
  1754. v = (uint64_t)-1;
  1755. break;
  1756. }
  1757. }
  1758. file_regfree(&rx);
  1759. if (v == (uint64_t)-1)
  1760. return -1;
  1761. break;
  1762. }
  1763. case FILE_INDIRECT:
  1764. case FILE_USE:
  1765. case FILE_NAME:
  1766. return 1;
  1767. case FILE_DER:
  1768. matched = der_cmp(ms, m);
  1769. if (matched == -1) {
  1770. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1771. (void) fprintf(stderr,
  1772. "EOF comparing DER entries");
  1773. }
  1774. return 0;
  1775. }
  1776. return matched;
  1777. default:
  1778. file_magerror(ms, "invalid type %d in magiccheck()", m->type);
  1779. return -1;
  1780. }
  1781. v = file_signextend(ms, m, v);
  1782. switch (m->reln) {
  1783. case 'x':
  1784. if ((ms->flags & MAGIC_DEBUG) != 0)
  1785. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1786. "u == *any* = 1\n", (unsigned long long)v);
  1787. matched = 1;
  1788. break;
  1789. case '!':
  1790. matched = v != l;
  1791. if ((ms->flags & MAGIC_DEBUG) != 0)
  1792. (void) fprintf(stderr, "%" INT64_T_FORMAT "u != %"
  1793. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1794. (unsigned long long)l, matched);
  1795. break;
  1796. case '=':
  1797. matched = v == l;
  1798. if ((ms->flags & MAGIC_DEBUG) != 0)
  1799. (void) fprintf(stderr, "%" INT64_T_FORMAT "u == %"
  1800. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1801. (unsigned long long)l, matched);
  1802. break;
  1803. case '>':
  1804. if (m->flag & UNSIGNED) {
  1805. matched = v > l;
  1806. if ((ms->flags & MAGIC_DEBUG) != 0)
  1807. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1808. "u > %" INT64_T_FORMAT "u = %d\n",
  1809. (unsigned long long)v,
  1810. (unsigned long long)l, matched);
  1811. }
  1812. else {
  1813. matched = (int64_t) v > (int64_t) l;
  1814. if ((ms->flags & MAGIC_DEBUG) != 0)
  1815. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1816. "d > %" INT64_T_FORMAT "d = %d\n",
  1817. (long long)v, (long long)l, matched);
  1818. }
  1819. break;
  1820. case '<':
  1821. if (m->flag & UNSIGNED) {
  1822. matched = v < l;
  1823. if ((ms->flags & MAGIC_DEBUG) != 0)
  1824. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1825. "u < %" INT64_T_FORMAT "u = %d\n",
  1826. (unsigned long long)v,
  1827. (unsigned long long)l, matched);
  1828. }
  1829. else {
  1830. matched = (int64_t) v < (int64_t) l;
  1831. if ((ms->flags & MAGIC_DEBUG) != 0)
  1832. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1833. "d < %" INT64_T_FORMAT "d = %d\n",
  1834. (long long)v, (long long)l, matched);
  1835. }
  1836. break;
  1837. case '&':
  1838. matched = (v & l) == l;
  1839. if ((ms->flags & MAGIC_DEBUG) != 0)
  1840. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  1841. INT64_T_FORMAT "x) == %" INT64_T_FORMAT
  1842. "x) = %d\n", (unsigned long long)v,
  1843. (unsigned long long)l, (unsigned long long)l,
  1844. matched);
  1845. break;
  1846. case '^':
  1847. matched = (v & l) != l;
  1848. if ((ms->flags & MAGIC_DEBUG) != 0)
  1849. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  1850. INT64_T_FORMAT "x) != %" INT64_T_FORMAT
  1851. "x) = %d\n", (unsigned long long)v,
  1852. (unsigned long long)l, (unsigned long long)l,
  1853. matched);
  1854. break;
  1855. default:
  1856. file_magerror(ms, "cannot happen: invalid relation `%c'",
  1857. m->reln);
  1858. return -1;
  1859. }
  1860. return matched;
  1861. }
  1862. private int
  1863. handle_annotation(struct magic_set *ms, struct magic *m, int firstline)
  1864. {
  1865. if ((ms->flags & MAGIC_APPLE) && m->apple[0]) {
  1866. if (!firstline && file_printf(ms, "\n- ") == -1)
  1867. return -1;
  1868. if (file_printf(ms, "%.8s", m->apple) == -1)
  1869. return -1;
  1870. return 1;
  1871. }
  1872. if ((ms->flags & MAGIC_EXTENSION) && m->ext[0]) {
  1873. if (!firstline && file_printf(ms, "\n- ") == -1)
  1874. return -1;
  1875. if (file_printf(ms, "%s", m->ext) == -1)
  1876. return -1;
  1877. return 1;
  1878. }
  1879. if ((ms->flags & MAGIC_MIME_TYPE) && m->mimetype[0]) {
  1880. if (!firstline && file_printf(ms, "\n- ") == -1)
  1881. return -1;
  1882. if (file_printf(ms, "%s", m->mimetype) == -1)
  1883. return -1;
  1884. return 1;
  1885. }
  1886. return 0;
  1887. }
  1888. private int
  1889. print_sep(struct magic_set *ms, int firstline)
  1890. {
  1891. // if (ms->flags & MAGIC_NODESC)
  1892. // return 0;
  1893. if (firstline)
  1894. return 0;
  1895. /*
  1896. * we found another match
  1897. * put a newline and '-' to do some simple formatting
  1898. */
  1899. return file_printf(ms, "\n- ");
  1900. }