softmagic.c 49 KB

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