softmagic.c 52 KB

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