softmagic.c 50 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239
  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.180 2014/03/15 21:47:40 christos Exp $")
  34. #endif /* lint */
  35. #include "magic.h"
  36. #define F(a, b) fmtcheck((a), (b))
  37. #include <assert.h>
  38. #include <string.h>
  39. #include <ctype.h>
  40. #include <stdlib.h>
  41. #include <time.h>
  42. #if defined(HAVE_LOCALE_H)
  43. #include <locale.h>
  44. #endif
  45. private int match(struct magic_set *, struct magic *, uint32_t,
  46. const unsigned char *, size_t, size_t, int, int, int, int, int *, int *,
  47. int *);
  48. private int mget(struct magic_set *, const unsigned char *,
  49. struct magic *, size_t, size_t, unsigned int, int, int, int, int, int *,
  50. int *, int *);
  51. private int magiccheck(struct magic_set *, struct magic *);
  52. private int32_t mprint(struct magic_set *, struct magic *);
  53. private int32_t moffset(struct magic_set *, struct magic *);
  54. private void mdebug(uint32_t, const char *, size_t);
  55. private int mcopy(struct magic_set *, union VALUETYPE *, int, int,
  56. const unsigned char *, uint32_t, size_t, size_t);
  57. private int mconvert(struct magic_set *, struct magic *, int);
  58. private int print_sep(struct magic_set *, int);
  59. private int handle_annotation(struct magic_set *, struct magic *);
  60. private void cvt_8(union VALUETYPE *, const struct magic *);
  61. private void cvt_16(union VALUETYPE *, const struct magic *);
  62. private void cvt_32(union VALUETYPE *, const struct magic *);
  63. private void cvt_64(union VALUETYPE *, const struct magic *);
  64. #define OFFSET_OOB(n, o, i) ((n) < (o) || (i) > ((n) - (o)))
  65. /*
  66. * softmagic - lookup one file in parsed, in-memory copy of database
  67. * Passed the name and FILE * of one file to be typed.
  68. */
  69. /*ARGSUSED1*/ /* nbytes passed for regularity, maybe need later */
  70. protected int
  71. file_softmagic(struct magic_set *ms, const unsigned char *buf, size_t nbytes,
  72. size_t level, int mode, int text)
  73. {
  74. struct mlist *ml;
  75. int rv, printed_something = 0, need_separator = 0;
  76. for (ml = ms->mlist[0]->next; ml != ms->mlist[0]; ml = ml->next)
  77. if ((rv = match(ms, ml->magic, ml->nmagic, buf, nbytes, 0, mode,
  78. text, 0, level, &printed_something, &need_separator,
  79. NULL)) != 0)
  80. return rv;
  81. return 0;
  82. }
  83. /*
  84. * Go through the whole list, stopping if you find a match. Process all
  85. * the continuations of that match before returning.
  86. *
  87. * We support multi-level continuations:
  88. *
  89. * At any time when processing a successful top-level match, there is a
  90. * current continuation level; it represents the level of the last
  91. * successfully matched continuation.
  92. *
  93. * Continuations above that level are skipped as, if we see one, it
  94. * means that the continuation that controls them - i.e, the
  95. * lower-level continuation preceding them - failed to match.
  96. *
  97. * Continuations below that level are processed as, if we see one,
  98. * it means we've finished processing or skipping higher-level
  99. * continuations under the control of a successful or unsuccessful
  100. * lower-level continuation, and are now seeing the next lower-level
  101. * continuation and should process it. The current continuation
  102. * level reverts to the level of the one we're seeing.
  103. *
  104. * Continuations at the current level are processed as, if we see
  105. * one, there's no lower-level continuation that may have failed.
  106. *
  107. * If a continuation matches, we bump the current continuation level
  108. * so that higher-level continuations are processed.
  109. */
  110. private int
  111. match(struct magic_set *ms, struct magic *magic, uint32_t nmagic,
  112. const unsigned char *s, size_t nbytes, size_t offset, int mode, int text,
  113. int flip, int recursion_level, int *printed_something, int *need_separator,
  114. int *returnval)
  115. {
  116. uint32_t magindex = 0;
  117. unsigned int cont_level = 0;
  118. int returnvalv = 0, e; /* if a match is found it is set to 1*/
  119. int firstline = 1; /* a flag to print X\n X\n- X */
  120. int print = (ms->flags & (MAGIC_MIME|MAGIC_APPLE)) == 0;
  121. if (returnval == NULL)
  122. returnval = &returnvalv;
  123. if (file_check_mem(ms, cont_level) == -1)
  124. return -1;
  125. for (magindex = 0; magindex < nmagic; magindex++) {
  126. int flush = 0;
  127. struct magic *m = &magic[magindex];
  128. if (m->type != FILE_NAME)
  129. if ((IS_STRING(m->type) &&
  130. #define FLT (STRING_BINTEST | STRING_TEXTTEST)
  131. ((text && (m->str_flags & FLT) == STRING_BINTEST) ||
  132. (!text && (m->str_flags & FLT) == STRING_TEXTTEST))) ||
  133. (m->flag & mode) != mode) {
  134. /* Skip sub-tests */
  135. while (magindex + 1 < nmagic &&
  136. magic[magindex + 1].cont_level != 0 &&
  137. ++magindex)
  138. continue;
  139. continue; /* Skip to next top-level test*/
  140. }
  141. ms->offset = m->offset;
  142. ms->line = m->lineno;
  143. /* if main entry matches, print it... */
  144. switch (mget(ms, s, m, nbytes, offset, cont_level, mode, text,
  145. flip, recursion_level + 1, printed_something,
  146. need_separator, returnval)) {
  147. case -1:
  148. return -1;
  149. case 0:
  150. flush = m->reln != '!';
  151. break;
  152. default:
  153. if (m->type == FILE_INDIRECT)
  154. *returnval = 1;
  155. switch (magiccheck(ms, m)) {
  156. case -1:
  157. return -1;
  158. case 0:
  159. flush++;
  160. break;
  161. default:
  162. flush = 0;
  163. break;
  164. }
  165. break;
  166. }
  167. if (flush) {
  168. /*
  169. * main entry didn't match,
  170. * flush its continuations
  171. */
  172. while (magindex < nmagic - 1 &&
  173. magic[magindex + 1].cont_level != 0)
  174. magindex++;
  175. continue;
  176. }
  177. if ((e = handle_annotation(ms, m)) != 0) {
  178. *need_separator = 1;
  179. *printed_something = 1;
  180. *returnval = 1;
  181. return e;
  182. }
  183. /*
  184. * If we are going to print something, we'll need to print
  185. * a blank before we print something else.
  186. */
  187. if (*m->desc) {
  188. *need_separator = 1;
  189. *printed_something = 1;
  190. if (print_sep(ms, firstline) == -1)
  191. return -1;
  192. }
  193. if (print && mprint(ms, m) == -1)
  194. return -1;
  195. ms->c.li[cont_level].off = moffset(ms, m);
  196. /* and any continuations that match */
  197. if (file_check_mem(ms, ++cont_level) == -1)
  198. return -1;
  199. while (magic[magindex+1].cont_level != 0 &&
  200. ++magindex < nmagic) {
  201. m = &magic[magindex];
  202. ms->line = m->lineno; /* for messages */
  203. if (cont_level < m->cont_level)
  204. continue;
  205. if (cont_level > m->cont_level) {
  206. /*
  207. * We're at the end of the level
  208. * "cont_level" continuations.
  209. */
  210. cont_level = m->cont_level;
  211. }
  212. ms->offset = m->offset;
  213. if (m->flag & OFFADD) {
  214. ms->offset +=
  215. ms->c.li[cont_level - 1].off;
  216. }
  217. #ifdef ENABLE_CONDITIONALS
  218. if (m->cond == COND_ELSE ||
  219. m->cond == COND_ELIF) {
  220. if (ms->c.li[cont_level].last_match == 1)
  221. continue;
  222. }
  223. #endif
  224. switch (mget(ms, s, m, nbytes, offset, cont_level, mode,
  225. text, flip, recursion_level + 1, printed_something,
  226. need_separator, returnval)) {
  227. case -1:
  228. return -1;
  229. case 0:
  230. if (m->reln != '!')
  231. continue;
  232. flush = 1;
  233. break;
  234. default:
  235. if (m->type == FILE_INDIRECT)
  236. *returnval = 1;
  237. flush = 0;
  238. break;
  239. }
  240. switch (flush ? 1 : magiccheck(ms, m)) {
  241. case -1:
  242. return -1;
  243. case 0:
  244. #ifdef ENABLE_CONDITIONALS
  245. ms->c.li[cont_level].last_match = 0;
  246. #endif
  247. break;
  248. default:
  249. #ifdef ENABLE_CONDITIONALS
  250. ms->c.li[cont_level].last_match = 1;
  251. #endif
  252. if (m->type == FILE_CLEAR)
  253. ms->c.li[cont_level].got_match = 0;
  254. else if (ms->c.li[cont_level].got_match) {
  255. if (m->type == FILE_DEFAULT)
  256. break;
  257. } else
  258. ms->c.li[cont_level].got_match = 1;
  259. if ((e = handle_annotation(ms, m)) != 0) {
  260. *need_separator = 1;
  261. *printed_something = 1;
  262. *returnval = 1;
  263. return e;
  264. }
  265. /*
  266. * If we are going to print something,
  267. * make sure that we have a separator first.
  268. */
  269. if (*m->desc) {
  270. if (!*printed_something) {
  271. *printed_something = 1;
  272. if (print_sep(ms, firstline)
  273. == -1)
  274. return -1;
  275. }
  276. }
  277. /*
  278. * This continuation matched. Print
  279. * its message, with a blank before it
  280. * if the previous item printed and
  281. * this item isn't empty.
  282. */
  283. /* space if previous printed */
  284. if (*need_separator
  285. && ((m->flag & NOSPACE) == 0)
  286. && *m->desc) {
  287. if (print &&
  288. file_printf(ms, " ") == -1)
  289. return -1;
  290. *need_separator = 0;
  291. }
  292. if (print && mprint(ms, m) == -1)
  293. return -1;
  294. ms->c.li[cont_level].off = moffset(ms, m);
  295. if (*m->desc)
  296. *need_separator = 1;
  297. /*
  298. * If we see any continuations
  299. * at a higher level,
  300. * process them.
  301. */
  302. if (file_check_mem(ms, ++cont_level) == -1)
  303. return -1;
  304. break;
  305. }
  306. }
  307. if (*printed_something) {
  308. firstline = 0;
  309. if (print)
  310. *returnval = 1;
  311. }
  312. if ((ms->flags & MAGIC_CONTINUE) == 0 && *printed_something) {
  313. return *returnval; /* don't keep searching */
  314. }
  315. }
  316. return *returnval; /* This is hit if -k is set or there is no match */
  317. }
  318. private int
  319. check_fmt(struct magic_set *ms, struct magic *m)
  320. {
  321. regex_t rx;
  322. int rc, rv = -1;
  323. char *old_lc_ctype;
  324. if (strchr(m->desc, '%') == NULL)
  325. return 0;
  326. old_lc_ctype = setlocale(LC_CTYPE, NULL);
  327. assert(old_lc_ctype != NULL);
  328. old_lc_ctype = strdup(old_lc_ctype);
  329. assert(old_lc_ctype != NULL);
  330. (void)setlocale(LC_CTYPE, "C");
  331. rc = regcomp(&rx, "%[-0-9\\.]*s", REG_EXTENDED|REG_NOSUB);
  332. if (rc) {
  333. char errmsg[512];
  334. (void)regerror(rc, &rx, errmsg, sizeof(errmsg));
  335. file_magerror(ms, "regex error %d, (%s)", rc, errmsg);
  336. } else {
  337. rc = regexec(&rx, m->desc, 0, 0, 0);
  338. regfree(&rx);
  339. rv = !rc;
  340. }
  341. (void)setlocale(LC_CTYPE, old_lc_ctype);
  342. free(old_lc_ctype);
  343. return rv;
  344. }
  345. #ifndef HAVE_STRNDUP
  346. char * strndup(const char *, size_t);
  347. char *
  348. strndup(const char *str, size_t n)
  349. {
  350. size_t len;
  351. char *copy;
  352. for (len = 0; len < n && str[len]; len++)
  353. continue;
  354. if ((copy = malloc(len + 1)) == NULL)
  355. return NULL;
  356. (void)memcpy(copy, str, len);
  357. copy[len] = '\0';
  358. return copy;
  359. }
  360. #endif /* HAVE_STRNDUP */
  361. private int32_t
  362. mprint(struct magic_set *ms, struct magic *m)
  363. {
  364. uint64_t v;
  365. float vf;
  366. double vd;
  367. int64_t t = 0;
  368. char buf[128], tbuf[26];
  369. union VALUETYPE *p = &ms->ms_value;
  370. switch (m->type) {
  371. case FILE_BYTE:
  372. v = file_signextend(ms, m, (uint64_t)p->b);
  373. switch (check_fmt(ms, m)) {
  374. case -1:
  375. return -1;
  376. case 1:
  377. (void)snprintf(buf, sizeof(buf), "%c",
  378. (unsigned char)v);
  379. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  380. return -1;
  381. break;
  382. default:
  383. if (file_printf(ms, F(m->desc, "%c"),
  384. (unsigned char) v) == -1)
  385. return -1;
  386. break;
  387. }
  388. t = ms->offset + sizeof(char);
  389. break;
  390. case FILE_SHORT:
  391. case FILE_BESHORT:
  392. case FILE_LESHORT:
  393. v = file_signextend(ms, m, (uint64_t)p->h);
  394. switch (check_fmt(ms, m)) {
  395. case -1:
  396. return -1;
  397. case 1:
  398. (void)snprintf(buf, sizeof(buf), "%hu",
  399. (unsigned short)v);
  400. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  401. return -1;
  402. break;
  403. default:
  404. if (file_printf(ms, F(m->desc, "%hu"),
  405. (unsigned short) v) == -1)
  406. return -1;
  407. break;
  408. }
  409. t = ms->offset + sizeof(short);
  410. break;
  411. case FILE_LONG:
  412. case FILE_BELONG:
  413. case FILE_LELONG:
  414. case FILE_MELONG:
  415. v = file_signextend(ms, m, (uint64_t)p->l);
  416. switch (check_fmt(ms, m)) {
  417. case -1:
  418. return -1;
  419. case 1:
  420. (void)snprintf(buf, sizeof(buf), "%u", (uint32_t)v);
  421. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  422. return -1;
  423. break;
  424. default:
  425. if (file_printf(ms, F(m->desc, "%u"),
  426. (uint32_t) v) == -1)
  427. return -1;
  428. break;
  429. }
  430. t = ms->offset + sizeof(int32_t);
  431. break;
  432. case FILE_QUAD:
  433. case FILE_BEQUAD:
  434. case FILE_LEQUAD:
  435. v = file_signextend(ms, m, p->q);
  436. switch (check_fmt(ms, m)) {
  437. case -1:
  438. return -1;
  439. case 1:
  440. (void)snprintf(buf, sizeof(buf), "%llu",
  441. (unsigned long long)v);
  442. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  443. return -1;
  444. break;
  445. default:
  446. if (file_printf(ms, F(m->desc, "%llu"),
  447. (unsigned long long) v) == -1)
  448. return -1;
  449. break;
  450. }
  451. t = ms->offset + sizeof(int64_t);
  452. break;
  453. case FILE_STRING:
  454. case FILE_PSTRING:
  455. case FILE_BESTRING16:
  456. case FILE_LESTRING16:
  457. if (m->reln == '=' || m->reln == '!') {
  458. if (file_printf(ms, F(m->desc, "%s"), m->value.s) == -1)
  459. return -1;
  460. t = ms->offset + m->vallen;
  461. }
  462. else {
  463. char *str = p->s;
  464. /* compute t before we mangle the string? */
  465. t = ms->offset + strlen(str);
  466. if (*m->value.s == '\0')
  467. str[strcspn(str, "\n")] = '\0';
  468. if (m->str_flags & STRING_TRIM) {
  469. char *last;
  470. while (isspace((unsigned char)*str))
  471. str++;
  472. last = str;
  473. while (*last)
  474. last++;
  475. --last;
  476. while (isspace((unsigned char)*last))
  477. last--;
  478. *++last = '\0';
  479. }
  480. if (file_printf(ms, F(m->desc, "%s"), str) == -1)
  481. return -1;
  482. if (m->type == FILE_PSTRING)
  483. t += file_pstring_length_size(m);
  484. }
  485. break;
  486. case FILE_DATE:
  487. case FILE_BEDATE:
  488. case FILE_LEDATE:
  489. case FILE_MEDATE:
  490. if (file_printf(ms, F(m->desc, "%s"),
  491. file_fmttime(p->l, FILE_T_LOCAL, tbuf)) == -1)
  492. return -1;
  493. t = ms->offset + sizeof(uint32_t);
  494. break;
  495. case FILE_LDATE:
  496. case FILE_BELDATE:
  497. case FILE_LELDATE:
  498. case FILE_MELDATE:
  499. if (file_printf(ms, F(m->desc, "%s"),
  500. file_fmttime(p->l, 0, tbuf)) == -1)
  501. return -1;
  502. t = ms->offset + sizeof(uint32_t);
  503. break;
  504. case FILE_QDATE:
  505. case FILE_BEQDATE:
  506. case FILE_LEQDATE:
  507. if (file_printf(ms, F(m->desc, "%s"),
  508. file_fmttime(p->q, FILE_T_LOCAL, tbuf)) == -1)
  509. return -1;
  510. t = ms->offset + sizeof(uint64_t);
  511. break;
  512. case FILE_QLDATE:
  513. case FILE_BEQLDATE:
  514. case FILE_LEQLDATE:
  515. if (file_printf(ms, F(m->desc, "%s"),
  516. file_fmttime(p->q, 0, tbuf)) == -1)
  517. return -1;
  518. t = ms->offset + sizeof(uint64_t);
  519. break;
  520. case FILE_QWDATE:
  521. case FILE_BEQWDATE:
  522. case FILE_LEQWDATE:
  523. if (file_printf(ms, F(m->desc, "%s"),
  524. file_fmttime(p->q, FILE_T_WINDOWS, tbuf)) == -1)
  525. return -1;
  526. t = ms->offset + sizeof(uint64_t);
  527. break;
  528. case FILE_FLOAT:
  529. case FILE_BEFLOAT:
  530. case FILE_LEFLOAT:
  531. vf = p->f;
  532. switch (check_fmt(ms, m)) {
  533. case -1:
  534. return -1;
  535. case 1:
  536. (void)snprintf(buf, sizeof(buf), "%g", vf);
  537. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  538. return -1;
  539. break;
  540. default:
  541. if (file_printf(ms, F(m->desc, "%g"), vf) == -1)
  542. return -1;
  543. break;
  544. }
  545. t = ms->offset + sizeof(float);
  546. break;
  547. case FILE_DOUBLE:
  548. case FILE_BEDOUBLE:
  549. case FILE_LEDOUBLE:
  550. vd = p->d;
  551. switch (check_fmt(ms, m)) {
  552. case -1:
  553. return -1;
  554. case 1:
  555. (void)snprintf(buf, sizeof(buf), "%g", vd);
  556. if (file_printf(ms, F(m->desc, "%s"), buf) == -1)
  557. return -1;
  558. break;
  559. default:
  560. if (file_printf(ms, F(m->desc, "%g"), vd) == -1)
  561. return -1;
  562. break;
  563. }
  564. t = ms->offset + sizeof(double);
  565. break;
  566. case FILE_REGEX: {
  567. char *cp;
  568. int rval;
  569. cp = strndup((const char *)ms->search.s, ms->search.rm_len);
  570. if (cp == NULL) {
  571. file_oomem(ms, ms->search.rm_len);
  572. return -1;
  573. }
  574. rval = file_printf(ms, F(m->desc, "%s"), cp);
  575. free(cp);
  576. if (rval == -1)
  577. return -1;
  578. if ((m->str_flags & REGEX_OFFSET_START))
  579. t = ms->search.offset;
  580. else
  581. t = ms->search.offset + ms->search.rm_len;
  582. break;
  583. }
  584. case FILE_SEARCH:
  585. if (file_printf(ms, F(m->desc, "%s"), m->value.s) == -1)
  586. return -1;
  587. if ((m->str_flags & REGEX_OFFSET_START))
  588. t = ms->search.offset;
  589. else
  590. t = ms->search.offset + m->vallen;
  591. break;
  592. case FILE_DEFAULT:
  593. case FILE_CLEAR:
  594. if (file_printf(ms, "%s", m->desc) == -1)
  595. return -1;
  596. t = ms->offset;
  597. break;
  598. case FILE_INDIRECT:
  599. case FILE_USE:
  600. case FILE_NAME:
  601. t = ms->offset;
  602. break;
  603. default:
  604. file_magerror(ms, "invalid m->type (%d) in mprint()", m->type);
  605. return -1;
  606. }
  607. return (int32_t)t;
  608. }
  609. private int32_t
  610. moffset(struct magic_set *ms, struct magic *m)
  611. {
  612. switch (m->type) {
  613. case FILE_BYTE:
  614. return CAST(int32_t, (ms->offset + sizeof(char)));
  615. case FILE_SHORT:
  616. case FILE_BESHORT:
  617. case FILE_LESHORT:
  618. return CAST(int32_t, (ms->offset + sizeof(short)));
  619. case FILE_LONG:
  620. case FILE_BELONG:
  621. case FILE_LELONG:
  622. case FILE_MELONG:
  623. return CAST(int32_t, (ms->offset + sizeof(int32_t)));
  624. case FILE_QUAD:
  625. case FILE_BEQUAD:
  626. case FILE_LEQUAD:
  627. return CAST(int32_t, (ms->offset + sizeof(int64_t)));
  628. case FILE_STRING:
  629. case FILE_PSTRING:
  630. case FILE_BESTRING16:
  631. case FILE_LESTRING16:
  632. if (m->reln == '=' || m->reln == '!')
  633. return ms->offset + m->vallen;
  634. else {
  635. union VALUETYPE *p = &ms->ms_value;
  636. uint32_t t;
  637. if (*m->value.s == '\0')
  638. p->s[strcspn(p->s, "\n")] = '\0';
  639. t = CAST(uint32_t, (ms->offset + strlen(p->s)));
  640. if (m->type == FILE_PSTRING)
  641. t += (uint32_t)file_pstring_length_size(m);
  642. return t;
  643. }
  644. case FILE_DATE:
  645. case FILE_BEDATE:
  646. case FILE_LEDATE:
  647. case FILE_MEDATE:
  648. return CAST(int32_t, (ms->offset + sizeof(uint32_t)));
  649. case FILE_LDATE:
  650. case FILE_BELDATE:
  651. case FILE_LELDATE:
  652. case FILE_MELDATE:
  653. return CAST(int32_t, (ms->offset + sizeof(uint32_t)));
  654. case FILE_QDATE:
  655. case FILE_BEQDATE:
  656. case FILE_LEQDATE:
  657. return CAST(int32_t, (ms->offset + sizeof(uint64_t)));
  658. case FILE_QLDATE:
  659. case FILE_BEQLDATE:
  660. case FILE_LEQLDATE:
  661. return CAST(int32_t, (ms->offset + sizeof(uint64_t)));
  662. case FILE_FLOAT:
  663. case FILE_BEFLOAT:
  664. case FILE_LEFLOAT:
  665. return CAST(int32_t, (ms->offset + sizeof(float)));
  666. case FILE_DOUBLE:
  667. case FILE_BEDOUBLE:
  668. case FILE_LEDOUBLE:
  669. return CAST(int32_t, (ms->offset + sizeof(double)));
  670. case FILE_REGEX:
  671. if ((m->str_flags & REGEX_OFFSET_START) != 0)
  672. return CAST(int32_t, ms->search.offset);
  673. else
  674. return CAST(int32_t, (ms->search.offset +
  675. ms->search.rm_len));
  676. case FILE_SEARCH:
  677. if ((m->str_flags & REGEX_OFFSET_START) != 0)
  678. return CAST(int32_t, ms->search.offset);
  679. else
  680. return CAST(int32_t, (ms->search.offset + m->vallen));
  681. case FILE_CLEAR:
  682. case FILE_DEFAULT:
  683. case FILE_INDIRECT:
  684. return ms->offset;
  685. default:
  686. return 0;
  687. }
  688. }
  689. private int
  690. cvt_flip(int type, int flip)
  691. {
  692. if (flip == 0)
  693. return type;
  694. switch (type) {
  695. case FILE_BESHORT:
  696. return FILE_LESHORT;
  697. case FILE_BELONG:
  698. return FILE_LELONG;
  699. case FILE_BEDATE:
  700. return FILE_LEDATE;
  701. case FILE_BELDATE:
  702. return FILE_LELDATE;
  703. case FILE_BEQUAD:
  704. return FILE_LEQUAD;
  705. case FILE_BEQDATE:
  706. return FILE_LEQDATE;
  707. case FILE_BEQLDATE:
  708. return FILE_LEQLDATE;
  709. case FILE_BEQWDATE:
  710. return FILE_LEQWDATE;
  711. case FILE_LESHORT:
  712. return FILE_BESHORT;
  713. case FILE_LELONG:
  714. return FILE_BELONG;
  715. case FILE_LEDATE:
  716. return FILE_BEDATE;
  717. case FILE_LELDATE:
  718. return FILE_BELDATE;
  719. case FILE_LEQUAD:
  720. return FILE_BEQUAD;
  721. case FILE_LEQDATE:
  722. return FILE_BEQDATE;
  723. case FILE_LEQLDATE:
  724. return FILE_BEQLDATE;
  725. case FILE_LEQWDATE:
  726. return FILE_BEQWDATE;
  727. case FILE_BEFLOAT:
  728. return FILE_LEFLOAT;
  729. case FILE_LEFLOAT:
  730. return FILE_BEFLOAT;
  731. case FILE_BEDOUBLE:
  732. return FILE_LEDOUBLE;
  733. case FILE_LEDOUBLE:
  734. return FILE_BEDOUBLE;
  735. default:
  736. return type;
  737. }
  738. }
  739. #define DO_CVT(fld, cast) \
  740. if (m->num_mask) \
  741. switch (m->mask_op & FILE_OPS_MASK) { \
  742. case FILE_OPAND: \
  743. p->fld &= cast m->num_mask; \
  744. break; \
  745. case FILE_OPOR: \
  746. p->fld |= cast m->num_mask; \
  747. break; \
  748. case FILE_OPXOR: \
  749. p->fld ^= cast m->num_mask; \
  750. break; \
  751. case FILE_OPADD: \
  752. p->fld += cast m->num_mask; \
  753. break; \
  754. case FILE_OPMINUS: \
  755. p->fld -= cast m->num_mask; \
  756. break; \
  757. case FILE_OPMULTIPLY: \
  758. p->fld *= cast m->num_mask; \
  759. break; \
  760. case FILE_OPDIVIDE: \
  761. p->fld /= cast m->num_mask; \
  762. break; \
  763. case FILE_OPMODULO: \
  764. p->fld %= cast m->num_mask; \
  765. break; \
  766. } \
  767. if (m->mask_op & FILE_OPINVERSE) \
  768. p->fld = ~p->fld \
  769. private void
  770. cvt_8(union VALUETYPE *p, const struct magic *m)
  771. {
  772. DO_CVT(b, (uint8_t));
  773. }
  774. private void
  775. cvt_16(union VALUETYPE *p, const struct magic *m)
  776. {
  777. DO_CVT(h, (uint16_t));
  778. }
  779. private void
  780. cvt_32(union VALUETYPE *p, const struct magic *m)
  781. {
  782. DO_CVT(l, (uint32_t));
  783. }
  784. private void
  785. cvt_64(union VALUETYPE *p, const struct magic *m)
  786. {
  787. DO_CVT(q, (uint64_t));
  788. }
  789. #define DO_CVT2(fld, cast) \
  790. if (m->num_mask) \
  791. switch (m->mask_op & FILE_OPS_MASK) { \
  792. case FILE_OPADD: \
  793. p->fld += cast m->num_mask; \
  794. break; \
  795. case FILE_OPMINUS: \
  796. p->fld -= cast m->num_mask; \
  797. break; \
  798. case FILE_OPMULTIPLY: \
  799. p->fld *= cast m->num_mask; \
  800. break; \
  801. case FILE_OPDIVIDE: \
  802. p->fld /= cast m->num_mask; \
  803. break; \
  804. } \
  805. private void
  806. cvt_float(union VALUETYPE *p, const struct magic *m)
  807. {
  808. DO_CVT2(f, (float));
  809. }
  810. private void
  811. cvt_double(union VALUETYPE *p, const struct magic *m)
  812. {
  813. DO_CVT2(d, (double));
  814. }
  815. /*
  816. * Convert the byte order of the data we are looking at
  817. * While we're here, let's apply the mask operation
  818. * (unless you have a better idea)
  819. */
  820. private int
  821. mconvert(struct magic_set *ms, struct magic *m, int flip)
  822. {
  823. union VALUETYPE *p = &ms->ms_value;
  824. switch (cvt_flip(m->type, flip)) {
  825. case FILE_BYTE:
  826. cvt_8(p, m);
  827. return 1;
  828. case FILE_SHORT:
  829. cvt_16(p, m);
  830. return 1;
  831. case FILE_LONG:
  832. case FILE_DATE:
  833. case FILE_LDATE:
  834. cvt_32(p, m);
  835. return 1;
  836. case FILE_QUAD:
  837. case FILE_QDATE:
  838. case FILE_QLDATE:
  839. case FILE_QWDATE:
  840. cvt_64(p, m);
  841. return 1;
  842. case FILE_STRING:
  843. case FILE_BESTRING16:
  844. case FILE_LESTRING16: {
  845. /* Null terminate and eat *trailing* return */
  846. p->s[sizeof(p->s) - 1] = '\0';
  847. return 1;
  848. }
  849. case FILE_PSTRING: {
  850. char *ptr1 = p->s, *ptr2 = ptr1 + file_pstring_length_size(m);
  851. size_t len = file_pstring_get_length(m, ptr1);
  852. if (len >= sizeof(p->s))
  853. len = sizeof(p->s) - 1;
  854. while (len--)
  855. *ptr1++ = *ptr2++;
  856. *ptr1 = '\0';
  857. return 1;
  858. }
  859. case FILE_BESHORT:
  860. p->h = (short)((p->hs[0]<<8)|(p->hs[1]));
  861. cvt_16(p, m);
  862. return 1;
  863. case FILE_BELONG:
  864. case FILE_BEDATE:
  865. case FILE_BELDATE:
  866. p->l = (int32_t)
  867. ((p->hl[0]<<24)|(p->hl[1]<<16)|(p->hl[2]<<8)|(p->hl[3]));
  868. cvt_32(p, m);
  869. return 1;
  870. case FILE_BEQUAD:
  871. case FILE_BEQDATE:
  872. case FILE_BEQLDATE:
  873. case FILE_BEQWDATE:
  874. p->q = (uint64_t)
  875. (((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
  876. ((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
  877. ((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
  878. ((uint64_t)p->hq[6]<<8)|((uint64_t)p->hq[7]));
  879. cvt_64(p, m);
  880. return 1;
  881. case FILE_LESHORT:
  882. p->h = (short)((p->hs[1]<<8)|(p->hs[0]));
  883. cvt_16(p, m);
  884. return 1;
  885. case FILE_LELONG:
  886. case FILE_LEDATE:
  887. case FILE_LELDATE:
  888. p->l = (int32_t)
  889. ((p->hl[3]<<24)|(p->hl[2]<<16)|(p->hl[1]<<8)|(p->hl[0]));
  890. cvt_32(p, m);
  891. return 1;
  892. case FILE_LEQUAD:
  893. case FILE_LEQDATE:
  894. case FILE_LEQLDATE:
  895. case FILE_LEQWDATE:
  896. p->q = (uint64_t)
  897. (((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
  898. ((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
  899. ((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
  900. ((uint64_t)p->hq[1]<<8)|((uint64_t)p->hq[0]));
  901. cvt_64(p, m);
  902. return 1;
  903. case FILE_MELONG:
  904. case FILE_MEDATE:
  905. case FILE_MELDATE:
  906. p->l = (int32_t)
  907. ((p->hl[1]<<24)|(p->hl[0]<<16)|(p->hl[3]<<8)|(p->hl[2]));
  908. cvt_32(p, m);
  909. return 1;
  910. case FILE_FLOAT:
  911. cvt_float(p, m);
  912. return 1;
  913. case FILE_BEFLOAT:
  914. p->l = ((uint32_t)p->hl[0]<<24)|((uint32_t)p->hl[1]<<16)|
  915. ((uint32_t)p->hl[2]<<8) |((uint32_t)p->hl[3]);
  916. cvt_float(p, m);
  917. return 1;
  918. case FILE_LEFLOAT:
  919. p->l = ((uint32_t)p->hl[3]<<24)|((uint32_t)p->hl[2]<<16)|
  920. ((uint32_t)p->hl[1]<<8) |((uint32_t)p->hl[0]);
  921. cvt_float(p, m);
  922. return 1;
  923. case FILE_DOUBLE:
  924. cvt_double(p, m);
  925. return 1;
  926. case FILE_BEDOUBLE:
  927. p->q = ((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
  928. ((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
  929. ((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
  930. ((uint64_t)p->hq[6]<<8) |((uint64_t)p->hq[7]);
  931. cvt_double(p, m);
  932. return 1;
  933. case FILE_LEDOUBLE:
  934. p->q = ((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
  935. ((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
  936. ((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
  937. ((uint64_t)p->hq[1]<<8) |((uint64_t)p->hq[0]);
  938. cvt_double(p, m);
  939. return 1;
  940. case FILE_REGEX:
  941. case FILE_SEARCH:
  942. case FILE_DEFAULT:
  943. case FILE_CLEAR:
  944. case FILE_NAME:
  945. case FILE_USE:
  946. return 1;
  947. default:
  948. file_magerror(ms, "invalid type %d in mconvert()", m->type);
  949. return 0;
  950. }
  951. }
  952. private void
  953. mdebug(uint32_t offset, const char *str, size_t len)
  954. {
  955. (void) fprintf(stderr, "mget/%zu @%d: ", len, offset);
  956. file_showstr(stderr, str, len);
  957. (void) fputc('\n', stderr);
  958. (void) fputc('\n', stderr);
  959. }
  960. private int
  961. mcopy(struct magic_set *ms, union VALUETYPE *p, int type, int indir,
  962. const unsigned char *s, uint32_t offset, size_t nbytes, size_t linecnt)
  963. {
  964. /*
  965. * Note: FILE_SEARCH and FILE_REGEX do not actually copy
  966. * anything, but setup pointers into the source
  967. */
  968. if (indir == 0) {
  969. switch (type) {
  970. case FILE_SEARCH:
  971. ms->search.s = RCAST(const char *, s) + offset;
  972. ms->search.s_len = nbytes - offset;
  973. ms->search.offset = offset;
  974. return 0;
  975. case FILE_REGEX: {
  976. const char *b;
  977. const char *c;
  978. const char *last; /* end of search region */
  979. const char *buf; /* start of search region */
  980. const char *end;
  981. size_t lines;
  982. if (s == NULL) {
  983. ms->search.s_len = 0;
  984. ms->search.s = NULL;
  985. return 0;
  986. }
  987. buf = RCAST(const char *, s) + offset;
  988. end = last = RCAST(const char *, s) + nbytes;
  989. /* mget() guarantees buf <= last */
  990. for (lines = linecnt, b = buf; lines && b < end &&
  991. ((b = CAST(const char *,
  992. memchr(c = b, '\n', CAST(size_t, (end - b)))))
  993. || (b = CAST(const char *,
  994. memchr(c, '\r', CAST(size_t, (end - c))))));
  995. lines--, b++) {
  996. last = b;
  997. if (b[0] == '\r' && b[1] == '\n')
  998. b++;
  999. }
  1000. if (lines)
  1001. last = RCAST(const char *, s) + nbytes;
  1002. ms->search.s = buf;
  1003. ms->search.s_len = last - buf;
  1004. ms->search.offset = offset;
  1005. ms->search.rm_len = 0;
  1006. return 0;
  1007. }
  1008. case FILE_BESTRING16:
  1009. case FILE_LESTRING16: {
  1010. const unsigned char *src = s + offset;
  1011. const unsigned char *esrc = s + nbytes;
  1012. char *dst = p->s;
  1013. char *edst = &p->s[sizeof(p->s) - 1];
  1014. if (type == FILE_BESTRING16)
  1015. src++;
  1016. /* check that offset is within range */
  1017. if (offset >= nbytes)
  1018. break;
  1019. for (/*EMPTY*/; src < esrc; src += 2, dst++) {
  1020. if (dst < edst)
  1021. *dst = *src;
  1022. else
  1023. break;
  1024. if (*dst == '\0') {
  1025. if (type == FILE_BESTRING16 ?
  1026. *(src - 1) != '\0' :
  1027. *(src + 1) != '\0')
  1028. *dst = ' ';
  1029. }
  1030. }
  1031. *edst = '\0';
  1032. return 0;
  1033. }
  1034. case FILE_STRING: /* XXX - these two should not need */
  1035. case FILE_PSTRING: /* to copy anything, but do anyway. */
  1036. default:
  1037. break;
  1038. }
  1039. }
  1040. if (offset >= nbytes) {
  1041. (void)memset(p, '\0', sizeof(*p));
  1042. return 0;
  1043. }
  1044. if (nbytes - offset < sizeof(*p))
  1045. nbytes = nbytes - offset;
  1046. else
  1047. nbytes = sizeof(*p);
  1048. (void)memcpy(p, s + offset, nbytes);
  1049. /*
  1050. * the usefulness of padding with zeroes eludes me, it
  1051. * might even cause problems
  1052. */
  1053. if (nbytes < sizeof(*p))
  1054. (void)memset(((char *)(void *)p) + nbytes, '\0',
  1055. sizeof(*p) - nbytes);
  1056. return 0;
  1057. }
  1058. private int
  1059. mget(struct magic_set *ms, const unsigned char *s, struct magic *m,
  1060. size_t nbytes, size_t o, unsigned int cont_level, int mode, int text,
  1061. int flip, int recursion_level, int *printed_something,
  1062. int *need_separator, int *returnval)
  1063. {
  1064. uint32_t soffset, offset = ms->offset;
  1065. uint32_t count = m->str_range;
  1066. int rv, oneed_separator, in_type;
  1067. char *sbuf, *rbuf;
  1068. union VALUETYPE *p = &ms->ms_value;
  1069. struct mlist ml;
  1070. if (recursion_level >= 20) {
  1071. file_error(ms, 0, "recursion nesting exceeded");
  1072. return -1;
  1073. }
  1074. if (mcopy(ms, p, m->type, m->flag & INDIR, s, (uint32_t)(offset + o),
  1075. (uint32_t)nbytes, count) == -1)
  1076. return -1;
  1077. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1078. fprintf(stderr, "mget(type=%d, flag=%x, offset=%u, o=%zu, "
  1079. "nbytes=%zu, count=%u)\n", m->type, m->flag, offset, o,
  1080. nbytes, count);
  1081. mdebug(offset, (char *)(void *)p, sizeof(union VALUETYPE));
  1082. #ifndef COMPILE_ONLY
  1083. file_mdump(m);
  1084. #endif
  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, count) == -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. #ifndef COMPILE_ONLY
  1580. file_mdump(m);
  1581. #endif
  1582. }
  1583. }
  1584. /* Verify we have enough data to match magic type */
  1585. switch (m->type) {
  1586. case FILE_BYTE:
  1587. if (OFFSET_OOB(nbytes, offset, 1))
  1588. return 0;
  1589. break;
  1590. case FILE_SHORT:
  1591. case FILE_BESHORT:
  1592. case FILE_LESHORT:
  1593. if (OFFSET_OOB(nbytes, offset, 2))
  1594. return 0;
  1595. break;
  1596. case FILE_LONG:
  1597. case FILE_BELONG:
  1598. case FILE_LELONG:
  1599. case FILE_MELONG:
  1600. case FILE_DATE:
  1601. case FILE_BEDATE:
  1602. case FILE_LEDATE:
  1603. case FILE_MEDATE:
  1604. case FILE_LDATE:
  1605. case FILE_BELDATE:
  1606. case FILE_LELDATE:
  1607. case FILE_MELDATE:
  1608. case FILE_FLOAT:
  1609. case FILE_BEFLOAT:
  1610. case FILE_LEFLOAT:
  1611. if (OFFSET_OOB(nbytes, offset, 4))
  1612. return 0;
  1613. break;
  1614. case FILE_DOUBLE:
  1615. case FILE_BEDOUBLE:
  1616. case FILE_LEDOUBLE:
  1617. if (OFFSET_OOB(nbytes, offset, 8))
  1618. return 0;
  1619. break;
  1620. case FILE_STRING:
  1621. case FILE_PSTRING:
  1622. case FILE_SEARCH:
  1623. if (OFFSET_OOB(nbytes, offset, m->vallen))
  1624. return 0;
  1625. break;
  1626. case FILE_REGEX:
  1627. if (nbytes < offset)
  1628. return 0;
  1629. break;
  1630. case FILE_INDIRECT:
  1631. if (offset == 0)
  1632. return 0;
  1633. if (nbytes < offset)
  1634. return 0;
  1635. sbuf = ms->o.buf;
  1636. soffset = ms->offset;
  1637. ms->o.buf = NULL;
  1638. ms->offset = 0;
  1639. rv = file_softmagic(ms, s + offset, nbytes - offset,
  1640. recursion_level, BINTEST, text);
  1641. if ((ms->flags & MAGIC_DEBUG) != 0)
  1642. fprintf(stderr, "indirect @offs=%u[%d]\n", offset, rv);
  1643. rbuf = ms->o.buf;
  1644. ms->o.buf = sbuf;
  1645. ms->offset = soffset;
  1646. if (rv == 1) {
  1647. if ((ms->flags & (MAGIC_MIME|MAGIC_APPLE)) == 0 &&
  1648. file_printf(ms, F(m->desc, "%u"), offset) == -1) {
  1649. free(rbuf);
  1650. return -1;
  1651. }
  1652. if (file_printf(ms, "%s", rbuf) == -1) {
  1653. free(rbuf);
  1654. return -1;
  1655. }
  1656. }
  1657. free(rbuf);
  1658. return rv;
  1659. case FILE_USE:
  1660. if (nbytes < offset)
  1661. return 0;
  1662. sbuf = m->value.s;
  1663. if (*sbuf == '^') {
  1664. sbuf++;
  1665. flip = !flip;
  1666. }
  1667. if (file_magicfind(ms, sbuf, &ml) == -1) {
  1668. file_error(ms, 0, "cannot find entry `%s'", sbuf);
  1669. return -1;
  1670. }
  1671. oneed_separator = *need_separator;
  1672. if (m->flag & NOSPACE)
  1673. *need_separator = 0;
  1674. rv = match(ms, ml.magic, ml.nmagic, s, nbytes, offset + o,
  1675. mode, text, flip, recursion_level, printed_something,
  1676. need_separator, returnval);
  1677. if (rv != 1)
  1678. *need_separator = oneed_separator;
  1679. return rv;
  1680. case FILE_NAME:
  1681. if (file_printf(ms, "%s", m->desc) == -1)
  1682. return -1;
  1683. return 1;
  1684. case FILE_DEFAULT: /* nothing to check */
  1685. case FILE_CLEAR:
  1686. default:
  1687. break;
  1688. }
  1689. if (!mconvert(ms, m, flip))
  1690. return 0;
  1691. return 1;
  1692. }
  1693. private uint64_t
  1694. file_strncmp(const char *s1, const char *s2, size_t len, uint32_t flags)
  1695. {
  1696. /*
  1697. * Convert the source args to unsigned here so that (1) the
  1698. * compare will be unsigned as it is in strncmp() and (2) so
  1699. * the ctype functions will work correctly without extra
  1700. * casting.
  1701. */
  1702. const unsigned char *a = (const unsigned char *)s1;
  1703. const unsigned char *b = (const unsigned char *)s2;
  1704. uint64_t v;
  1705. /*
  1706. * What we want here is v = strncmp(s1, s2, len),
  1707. * but ignoring any nulls.
  1708. */
  1709. v = 0;
  1710. if (0L == flags) { /* normal string: do it fast */
  1711. while (len-- > 0)
  1712. if ((v = *b++ - *a++) != '\0')
  1713. break;
  1714. }
  1715. else { /* combine the others */
  1716. while (len-- > 0) {
  1717. if ((flags & STRING_IGNORE_LOWERCASE) &&
  1718. islower(*a)) {
  1719. if ((v = tolower(*b++) - *a++) != '\0')
  1720. break;
  1721. }
  1722. else if ((flags & STRING_IGNORE_UPPERCASE) &&
  1723. isupper(*a)) {
  1724. if ((v = toupper(*b++) - *a++) != '\0')
  1725. break;
  1726. }
  1727. else if ((flags & STRING_COMPACT_WHITESPACE) &&
  1728. isspace(*a)) {
  1729. a++;
  1730. if (isspace(*b++)) {
  1731. if (!isspace(*a))
  1732. while (isspace(*b))
  1733. b++;
  1734. }
  1735. else {
  1736. v = 1;
  1737. break;
  1738. }
  1739. }
  1740. else if ((flags & STRING_COMPACT_OPTIONAL_WHITESPACE) &&
  1741. isspace(*a)) {
  1742. a++;
  1743. while (isspace(*b))
  1744. b++;
  1745. }
  1746. else {
  1747. if ((v = *b++ - *a++) != '\0')
  1748. break;
  1749. }
  1750. }
  1751. }
  1752. return v;
  1753. }
  1754. private uint64_t
  1755. file_strncmp16(const char *a, const char *b, size_t len, uint32_t flags)
  1756. {
  1757. /*
  1758. * XXX - The 16-bit string compare probably needs to be done
  1759. * differently, especially if the flags are to be supported.
  1760. * At the moment, I am unsure.
  1761. */
  1762. flags = 0;
  1763. return file_strncmp(a, b, len, flags);
  1764. }
  1765. private int
  1766. magiccheck(struct magic_set *ms, struct magic *m)
  1767. {
  1768. uint64_t l = m->value.q;
  1769. uint64_t v;
  1770. float fl, fv;
  1771. double dl, dv;
  1772. int matched;
  1773. union VALUETYPE *p = &ms->ms_value;
  1774. char *old_lc_ctype;
  1775. switch (m->type) {
  1776. case FILE_BYTE:
  1777. v = p->b;
  1778. break;
  1779. case FILE_SHORT:
  1780. case FILE_BESHORT:
  1781. case FILE_LESHORT:
  1782. v = p->h;
  1783. break;
  1784. case FILE_LONG:
  1785. case FILE_BELONG:
  1786. case FILE_LELONG:
  1787. case FILE_MELONG:
  1788. case FILE_DATE:
  1789. case FILE_BEDATE:
  1790. case FILE_LEDATE:
  1791. case FILE_MEDATE:
  1792. case FILE_LDATE:
  1793. case FILE_BELDATE:
  1794. case FILE_LELDATE:
  1795. case FILE_MELDATE:
  1796. v = p->l;
  1797. break;
  1798. case FILE_QUAD:
  1799. case FILE_LEQUAD:
  1800. case FILE_BEQUAD:
  1801. case FILE_QDATE:
  1802. case FILE_BEQDATE:
  1803. case FILE_LEQDATE:
  1804. case FILE_QLDATE:
  1805. case FILE_BEQLDATE:
  1806. case FILE_LEQLDATE:
  1807. case FILE_QWDATE:
  1808. case FILE_BEQWDATE:
  1809. case FILE_LEQWDATE:
  1810. v = p->q;
  1811. break;
  1812. case FILE_FLOAT:
  1813. case FILE_BEFLOAT:
  1814. case FILE_LEFLOAT:
  1815. fl = m->value.f;
  1816. fv = p->f;
  1817. switch (m->reln) {
  1818. case 'x':
  1819. matched = 1;
  1820. break;
  1821. case '!':
  1822. matched = fv != fl;
  1823. break;
  1824. case '=':
  1825. matched = fv == fl;
  1826. break;
  1827. case '>':
  1828. matched = fv > fl;
  1829. break;
  1830. case '<':
  1831. matched = fv < fl;
  1832. break;
  1833. default:
  1834. matched = 0;
  1835. file_magerror(ms, "cannot happen with float: invalid relation `%c'",
  1836. m->reln);
  1837. return -1;
  1838. }
  1839. return matched;
  1840. case FILE_DOUBLE:
  1841. case FILE_BEDOUBLE:
  1842. case FILE_LEDOUBLE:
  1843. dl = m->value.d;
  1844. dv = p->d;
  1845. switch (m->reln) {
  1846. case 'x':
  1847. matched = 1;
  1848. break;
  1849. case '!':
  1850. matched = dv != dl;
  1851. break;
  1852. case '=':
  1853. matched = dv == dl;
  1854. break;
  1855. case '>':
  1856. matched = dv > dl;
  1857. break;
  1858. case '<':
  1859. matched = dv < dl;
  1860. break;
  1861. default:
  1862. matched = 0;
  1863. file_magerror(ms, "cannot happen with double: invalid relation `%c'", m->reln);
  1864. return -1;
  1865. }
  1866. return matched;
  1867. case FILE_DEFAULT:
  1868. case FILE_CLEAR:
  1869. l = 0;
  1870. v = 0;
  1871. break;
  1872. case FILE_STRING:
  1873. case FILE_PSTRING:
  1874. l = 0;
  1875. v = file_strncmp(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1876. break;
  1877. case FILE_BESTRING16:
  1878. case FILE_LESTRING16:
  1879. l = 0;
  1880. v = file_strncmp16(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1881. break;
  1882. case FILE_SEARCH: { /* search ms->search.s for the string m->value.s */
  1883. size_t slen;
  1884. size_t idx;
  1885. if (ms->search.s == NULL)
  1886. return 0;
  1887. slen = MIN(m->vallen, sizeof(m->value.s));
  1888. l = 0;
  1889. v = 0;
  1890. for (idx = 0; m->str_range == 0 || idx < m->str_range; idx++) {
  1891. if (slen + idx > ms->search.s_len)
  1892. break;
  1893. v = file_strncmp(m->value.s, ms->search.s + idx, slen, m->str_flags);
  1894. if (v == 0) { /* found match */
  1895. ms->search.offset += idx;
  1896. break;
  1897. }
  1898. }
  1899. break;
  1900. }
  1901. case FILE_REGEX: {
  1902. int rc;
  1903. regex_t rx;
  1904. char errmsg[512];
  1905. if (ms->search.s == NULL)
  1906. return 0;
  1907. old_lc_ctype = setlocale(LC_CTYPE, NULL);
  1908. assert(old_lc_ctype != NULL);
  1909. old_lc_ctype = strdup(old_lc_ctype);
  1910. assert(old_lc_ctype != NULL);
  1911. (void)setlocale(LC_CTYPE, "C");
  1912. l = 0;
  1913. rc = regcomp(&rx, m->value.s,
  1914. REG_EXTENDED|REG_NEWLINE|
  1915. ((m->str_flags & STRING_IGNORE_CASE) ? REG_ICASE : 0));
  1916. if (rc) {
  1917. (void)regerror(rc, &rx, errmsg, sizeof(errmsg));
  1918. file_magerror(ms, "regex error %d, (%s)",
  1919. rc, errmsg);
  1920. v = (uint64_t)-1;
  1921. }
  1922. else {
  1923. regmatch_t pmatch[1];
  1924. #ifndef REG_STARTEND
  1925. #define REG_STARTEND 0
  1926. size_t l = ms->search.s_len - 1;
  1927. char c = ms->search.s[l];
  1928. ((char *)(intptr_t)ms->search.s)[l] = '\0';
  1929. #else
  1930. pmatch[0].rm_so = 0;
  1931. pmatch[0].rm_eo = ms->search.s_len;
  1932. #endif
  1933. rc = regexec(&rx, (const char *)ms->search.s,
  1934. 1, pmatch, REG_STARTEND);
  1935. #if REG_STARTEND == 0
  1936. ((char *)(intptr_t)ms->search.s)[l] = c;
  1937. #endif
  1938. switch (rc) {
  1939. case 0:
  1940. ms->search.s += (int)pmatch[0].rm_so;
  1941. ms->search.offset += (size_t)pmatch[0].rm_so;
  1942. ms->search.rm_len =
  1943. (size_t)(pmatch[0].rm_eo - pmatch[0].rm_so);
  1944. v = 0;
  1945. break;
  1946. case REG_NOMATCH:
  1947. v = 1;
  1948. break;
  1949. default:
  1950. (void)regerror(rc, &rx, errmsg, sizeof(errmsg));
  1951. file_magerror(ms, "regexec error %d, (%s)",
  1952. rc, errmsg);
  1953. v = (uint64_t)-1;
  1954. break;
  1955. }
  1956. regfree(&rx);
  1957. }
  1958. (void)setlocale(LC_CTYPE, old_lc_ctype);
  1959. free(old_lc_ctype);
  1960. if (v == (uint64_t)-1)
  1961. return -1;
  1962. break;
  1963. }
  1964. case FILE_INDIRECT:
  1965. case FILE_USE:
  1966. case FILE_NAME:
  1967. return 1;
  1968. default:
  1969. file_magerror(ms, "invalid type %d in magiccheck()", m->type);
  1970. return -1;
  1971. }
  1972. v = file_signextend(ms, m, v);
  1973. switch (m->reln) {
  1974. case 'x':
  1975. if ((ms->flags & MAGIC_DEBUG) != 0)
  1976. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1977. "u == *any* = 1\n", (unsigned long long)v);
  1978. matched = 1;
  1979. break;
  1980. case '!':
  1981. matched = v != l;
  1982. if ((ms->flags & MAGIC_DEBUG) != 0)
  1983. (void) fprintf(stderr, "%" INT64_T_FORMAT "u != %"
  1984. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1985. (unsigned long long)l, matched);
  1986. break;
  1987. case '=':
  1988. matched = v == l;
  1989. if ((ms->flags & MAGIC_DEBUG) != 0)
  1990. (void) fprintf(stderr, "%" INT64_T_FORMAT "u == %"
  1991. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1992. (unsigned long long)l, matched);
  1993. break;
  1994. case '>':
  1995. if (m->flag & UNSIGNED) {
  1996. matched = v > l;
  1997. if ((ms->flags & MAGIC_DEBUG) != 0)
  1998. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1999. "u > %" INT64_T_FORMAT "u = %d\n",
  2000. (unsigned long long)v,
  2001. (unsigned long long)l, matched);
  2002. }
  2003. else {
  2004. matched = (int64_t) v > (int64_t) l;
  2005. if ((ms->flags & MAGIC_DEBUG) != 0)
  2006. (void) fprintf(stderr, "%" INT64_T_FORMAT
  2007. "d > %" INT64_T_FORMAT "d = %d\n",
  2008. (long long)v, (long long)l, matched);
  2009. }
  2010. break;
  2011. case '<':
  2012. if (m->flag & UNSIGNED) {
  2013. matched = v < l;
  2014. if ((ms->flags & MAGIC_DEBUG) != 0)
  2015. (void) fprintf(stderr, "%" INT64_T_FORMAT
  2016. "u < %" INT64_T_FORMAT "u = %d\n",
  2017. (unsigned long long)v,
  2018. (unsigned long long)l, matched);
  2019. }
  2020. else {
  2021. matched = (int64_t) v < (int64_t) l;
  2022. if ((ms->flags & MAGIC_DEBUG) != 0)
  2023. (void) fprintf(stderr, "%" INT64_T_FORMAT
  2024. "d < %" INT64_T_FORMAT "d = %d\n",
  2025. (long long)v, (long long)l, matched);
  2026. }
  2027. break;
  2028. case '&':
  2029. matched = (v & l) == l;
  2030. if ((ms->flags & MAGIC_DEBUG) != 0)
  2031. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  2032. INT64_T_FORMAT "x) == %" INT64_T_FORMAT
  2033. "x) = %d\n", (unsigned long long)v,
  2034. (unsigned long long)l, (unsigned long long)l,
  2035. matched);
  2036. break;
  2037. case '^':
  2038. matched = (v & l) != l;
  2039. if ((ms->flags & MAGIC_DEBUG) != 0)
  2040. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  2041. INT64_T_FORMAT "x) != %" INT64_T_FORMAT
  2042. "x) = %d\n", (unsigned long long)v,
  2043. (unsigned long long)l, (unsigned long long)l,
  2044. matched);
  2045. break;
  2046. default:
  2047. matched = 0;
  2048. file_magerror(ms, "cannot happen: invalid relation `%c'",
  2049. m->reln);
  2050. return -1;
  2051. }
  2052. return matched;
  2053. }
  2054. private int
  2055. handle_annotation(struct magic_set *ms, struct magic *m)
  2056. {
  2057. if (ms->flags & MAGIC_APPLE) {
  2058. if (file_printf(ms, "%.8s", m->apple) == -1)
  2059. return -1;
  2060. return 1;
  2061. }
  2062. if ((ms->flags & MAGIC_MIME_TYPE) && m->mimetype[0]) {
  2063. if (file_printf(ms, "%s", m->mimetype) == -1)
  2064. return -1;
  2065. return 1;
  2066. }
  2067. return 0;
  2068. }
  2069. private int
  2070. print_sep(struct magic_set *ms, int firstline)
  2071. {
  2072. if (ms->flags & MAGIC_MIME)
  2073. return 0;
  2074. if (firstline)
  2075. return 0;
  2076. /*
  2077. * we found another match
  2078. * put a newline and '-' to do some simple formatting
  2079. */
  2080. return file_printf(ms, "\n- ");
  2081. }