softmagic.c 49 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164
  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.209 2015/01/05 20:05:39 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_MIME|MAGIC_APPLE)) == 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 + m->num_mask, FILE_T_LOCAL, 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 + m->num_mask, 0, 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 + m->num_mask, FILE_T_LOCAL, 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 + m->num_mask, 0, 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 + m->num_mask, 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. if (type == FILE_BELONG)
  886. cvt_32(p, m);
  887. return 1;
  888. case FILE_BEQUAD:
  889. case FILE_BEQDATE:
  890. case FILE_BEQLDATE:
  891. case FILE_BEQWDATE:
  892. p->q = (uint64_t)
  893. (((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
  894. ((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
  895. ((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
  896. ((uint64_t)p->hq[6]<<8)|((uint64_t)p->hq[7]));
  897. if (type == FILE_BEQUAD)
  898. cvt_64(p, m);
  899. return 1;
  900. case FILE_LESHORT:
  901. p->h = (short)((p->hs[1]<<8)|(p->hs[0]));
  902. cvt_16(p, m);
  903. return 1;
  904. case FILE_LELONG:
  905. case FILE_LEDATE:
  906. case FILE_LELDATE:
  907. p->l = (int32_t)
  908. ((p->hl[3]<<24)|(p->hl[2]<<16)|(p->hl[1]<<8)|(p->hl[0]));
  909. if (type == FILE_LELONG)
  910. cvt_32(p, m);
  911. return 1;
  912. case FILE_LEQUAD:
  913. case FILE_LEQDATE:
  914. case FILE_LEQLDATE:
  915. case FILE_LEQWDATE:
  916. p->q = (uint64_t)
  917. (((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
  918. ((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
  919. ((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
  920. ((uint64_t)p->hq[1]<<8)|((uint64_t)p->hq[0]));
  921. if (type == FILE_LEQUAD)
  922. cvt_64(p, m);
  923. return 1;
  924. case FILE_MELONG:
  925. case FILE_MEDATE:
  926. case FILE_MELDATE:
  927. p->l = (int32_t)
  928. ((p->hl[1]<<24)|(p->hl[0]<<16)|(p->hl[3]<<8)|(p->hl[2]));
  929. if (type == FILE_MELONG)
  930. cvt_32(p, m);
  931. return 1;
  932. case FILE_FLOAT:
  933. cvt_float(p, m);
  934. return 1;
  935. case FILE_BEFLOAT:
  936. p->l = ((uint32_t)p->hl[0]<<24)|((uint32_t)p->hl[1]<<16)|
  937. ((uint32_t)p->hl[2]<<8) |((uint32_t)p->hl[3]);
  938. cvt_float(p, m);
  939. return 1;
  940. case FILE_LEFLOAT:
  941. p->l = ((uint32_t)p->hl[3]<<24)|((uint32_t)p->hl[2]<<16)|
  942. ((uint32_t)p->hl[1]<<8) |((uint32_t)p->hl[0]);
  943. cvt_float(p, m);
  944. return 1;
  945. case FILE_DOUBLE:
  946. cvt_double(p, m);
  947. return 1;
  948. case FILE_BEDOUBLE:
  949. p->q = ((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
  950. ((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
  951. ((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
  952. ((uint64_t)p->hq[6]<<8) |((uint64_t)p->hq[7]);
  953. cvt_double(p, m);
  954. return 1;
  955. case FILE_LEDOUBLE:
  956. p->q = ((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
  957. ((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
  958. ((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
  959. ((uint64_t)p->hq[1]<<8) |((uint64_t)p->hq[0]);
  960. cvt_double(p, m);
  961. return 1;
  962. case FILE_REGEX:
  963. case FILE_SEARCH:
  964. case FILE_DEFAULT:
  965. case FILE_CLEAR:
  966. case FILE_NAME:
  967. case FILE_USE:
  968. return 1;
  969. default:
  970. file_magerror(ms, "invalid type %d in mconvert()", m->type);
  971. return 0;
  972. }
  973. }
  974. private void
  975. mdebug(uint32_t offset, const char *str, size_t len)
  976. {
  977. (void) fprintf(stderr, "mget/%" SIZE_T_FORMAT "u @%d: ", len, offset);
  978. file_showstr(stderr, str, len);
  979. (void) fputc('\n', stderr);
  980. (void) fputc('\n', stderr);
  981. }
  982. private int
  983. mcopy(struct magic_set *ms, union VALUETYPE *p, int type, int indir,
  984. const unsigned char *s, uint32_t offset, size_t nbytes, struct magic *m)
  985. {
  986. /*
  987. * Note: FILE_SEARCH and FILE_REGEX do not actually copy
  988. * anything, but setup pointers into the source
  989. */
  990. if (indir == 0) {
  991. switch (type) {
  992. case FILE_SEARCH:
  993. ms->search.s = RCAST(const char *, s) + offset;
  994. ms->search.s_len = nbytes - offset;
  995. ms->search.offset = offset;
  996. return 0;
  997. case FILE_REGEX: {
  998. const char *b;
  999. const char *c;
  1000. const char *last; /* end of search region */
  1001. const char *buf; /* start of search region */
  1002. const char *end;
  1003. size_t lines, linecnt, bytecnt;
  1004. if (s == NULL) {
  1005. ms->search.s_len = 0;
  1006. ms->search.s = NULL;
  1007. return 0;
  1008. }
  1009. if (m->str_flags & REGEX_LINE_COUNT) {
  1010. linecnt = m->str_range;
  1011. bytecnt = linecnt * 80;
  1012. } else {
  1013. linecnt = 0;
  1014. bytecnt = m->str_range;
  1015. }
  1016. if (bytecnt == 0)
  1017. bytecnt = 8192;
  1018. if (bytecnt > nbytes)
  1019. bytecnt = nbytes;
  1020. buf = RCAST(const char *, s) + offset;
  1021. end = last = RCAST(const char *, s) + bytecnt;
  1022. /* mget() guarantees buf <= last */
  1023. for (lines = linecnt, b = buf; lines && b < end &&
  1024. ((b = CAST(const char *,
  1025. memchr(c = b, '\n', CAST(size_t, (end - b)))))
  1026. || (b = CAST(const char *,
  1027. memchr(c, '\r', CAST(size_t, (end - c))))));
  1028. lines--, b++) {
  1029. last = b;
  1030. if (b[0] == '\r' && b[1] == '\n')
  1031. b++;
  1032. }
  1033. if (lines)
  1034. last = RCAST(const char *, s) + bytecnt;
  1035. ms->search.s = buf;
  1036. ms->search.s_len = last - buf;
  1037. ms->search.offset = offset;
  1038. ms->search.rm_len = 0;
  1039. return 0;
  1040. }
  1041. case FILE_BESTRING16:
  1042. case FILE_LESTRING16: {
  1043. const unsigned char *src = s + offset;
  1044. const unsigned char *esrc = s + nbytes;
  1045. char *dst = p->s;
  1046. char *edst = &p->s[sizeof(p->s) - 1];
  1047. if (type == FILE_BESTRING16)
  1048. src++;
  1049. /* check that offset is within range */
  1050. if (offset >= nbytes)
  1051. break;
  1052. for (/*EMPTY*/; src < esrc; src += 2, dst++) {
  1053. if (dst < edst)
  1054. *dst = *src;
  1055. else
  1056. break;
  1057. if (*dst == '\0') {
  1058. if (type == FILE_BESTRING16 ?
  1059. *(src - 1) != '\0' :
  1060. *(src + 1) != '\0')
  1061. *dst = ' ';
  1062. }
  1063. }
  1064. *edst = '\0';
  1065. return 0;
  1066. }
  1067. case FILE_STRING: /* XXX - these two should not need */
  1068. case FILE_PSTRING: /* to copy anything, but do anyway. */
  1069. default:
  1070. break;
  1071. }
  1072. }
  1073. if (offset >= nbytes) {
  1074. (void)memset(p, '\0', sizeof(*p));
  1075. return 0;
  1076. }
  1077. if (nbytes - offset < sizeof(*p))
  1078. nbytes = nbytes - offset;
  1079. else
  1080. nbytes = sizeof(*p);
  1081. (void)memcpy(p, s + offset, nbytes);
  1082. /*
  1083. * the usefulness of padding with zeroes eludes me, it
  1084. * might even cause problems
  1085. */
  1086. if (nbytes < sizeof(*p))
  1087. (void)memset(((char *)(void *)p) + nbytes, '\0',
  1088. sizeof(*p) - nbytes);
  1089. return 0;
  1090. }
  1091. private int
  1092. mget(struct magic_set *ms, const unsigned char *s, struct magic *m,
  1093. size_t nbytes, size_t o, unsigned int cont_level, int mode, int text,
  1094. int flip, uint16_t indir_level, uint16_t *name_count,
  1095. int *printed_something, int *need_separator, int *returnval)
  1096. {
  1097. uint32_t offset = ms->offset;
  1098. uint32_t lhs;
  1099. file_pushbuf_t *pb;
  1100. int rv, oneed_separator, in_type;
  1101. char *rbuf;
  1102. union VALUETYPE *p = &ms->ms_value;
  1103. struct mlist ml;
  1104. if (indir_level >= ms->indir_max) {
  1105. file_error(ms, 0, "indirect recursion nesting (%hu) exceeded",
  1106. indir_level);
  1107. return -1;
  1108. }
  1109. if (*name_count >= ms->name_max) {
  1110. file_error(ms, 0, "name use count (%hu) exceeded",
  1111. *name_count);
  1112. return -1;
  1113. }
  1114. if (mcopy(ms, p, m->type, m->flag & INDIR, s, (uint32_t)(offset + o),
  1115. (uint32_t)nbytes, m) == -1)
  1116. return -1;
  1117. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1118. fprintf(stderr, "mget(type=%d, flag=%x, offset=%u, o=%"
  1119. SIZE_T_FORMAT "u, " "nbytes=%" SIZE_T_FORMAT
  1120. "u, il=%hu, nc=%hu)\n",
  1121. m->type, m->flag, offset, o, nbytes,
  1122. indir_level, *name_count);
  1123. mdebug(offset, (char *)(void *)p, sizeof(union VALUETYPE));
  1124. #ifndef COMPILE_ONLY
  1125. file_mdump(m);
  1126. #endif
  1127. }
  1128. if (m->flag & INDIR) {
  1129. int off = m->in_offset;
  1130. if (m->in_op & FILE_OPINDIRECT) {
  1131. const union VALUETYPE *q = CAST(const union VALUETYPE *,
  1132. ((const void *)(s + offset + off)));
  1133. switch (cvt_flip(m->in_type, flip)) {
  1134. case FILE_BYTE:
  1135. off = q->b;
  1136. break;
  1137. case FILE_SHORT:
  1138. off = q->h;
  1139. break;
  1140. case FILE_BESHORT:
  1141. off = (short)((q->hs[0]<<8)|(q->hs[1]));
  1142. break;
  1143. case FILE_LESHORT:
  1144. off = (short)((q->hs[1]<<8)|(q->hs[0]));
  1145. break;
  1146. case FILE_LONG:
  1147. off = q->l;
  1148. break;
  1149. case FILE_BELONG:
  1150. case FILE_BEID3:
  1151. off = (int32_t)((q->hl[0]<<24)|(q->hl[1]<<16)|
  1152. (q->hl[2]<<8)|(q->hl[3]));
  1153. break;
  1154. case FILE_LEID3:
  1155. case FILE_LELONG:
  1156. off = (int32_t)((q->hl[3]<<24)|(q->hl[2]<<16)|
  1157. (q->hl[1]<<8)|(q->hl[0]));
  1158. break;
  1159. case FILE_MELONG:
  1160. off = (int32_t)((q->hl[1]<<24)|(q->hl[0]<<16)|
  1161. (q->hl[3]<<8)|(q->hl[2]));
  1162. break;
  1163. }
  1164. if ((ms->flags & MAGIC_DEBUG) != 0)
  1165. fprintf(stderr, "indirect offs=%u\n", off);
  1166. }
  1167. switch (in_type = cvt_flip(m->in_type, flip)) {
  1168. case FILE_BYTE:
  1169. if (OFFSET_OOB(nbytes, offset, 1))
  1170. return 0;
  1171. if (off) {
  1172. switch (m->in_op & FILE_OPS_MASK) {
  1173. case FILE_OPAND:
  1174. offset = p->b & off;
  1175. break;
  1176. case FILE_OPOR:
  1177. offset = p->b | off;
  1178. break;
  1179. case FILE_OPXOR:
  1180. offset = p->b ^ off;
  1181. break;
  1182. case FILE_OPADD:
  1183. offset = p->b + off;
  1184. break;
  1185. case FILE_OPMINUS:
  1186. offset = p->b - off;
  1187. break;
  1188. case FILE_OPMULTIPLY:
  1189. offset = p->b * off;
  1190. break;
  1191. case FILE_OPDIVIDE:
  1192. offset = p->b / off;
  1193. break;
  1194. case FILE_OPMODULO:
  1195. offset = p->b % off;
  1196. break;
  1197. }
  1198. } else
  1199. offset = p->b;
  1200. if (m->in_op & FILE_OPINVERSE)
  1201. offset = ~offset;
  1202. break;
  1203. case FILE_BESHORT:
  1204. if (OFFSET_OOB(nbytes, offset, 2))
  1205. return 0;
  1206. lhs = (p->hs[0] << 8) | p->hs[1];
  1207. if (off) {
  1208. switch (m->in_op & FILE_OPS_MASK) {
  1209. case FILE_OPAND:
  1210. offset = lhs & off;
  1211. break;
  1212. case FILE_OPOR:
  1213. offset = lhs | off;
  1214. break;
  1215. case FILE_OPXOR:
  1216. offset = lhs ^ off;
  1217. break;
  1218. case FILE_OPADD:
  1219. offset = lhs + off;
  1220. break;
  1221. case FILE_OPMINUS:
  1222. offset = lhs - off;
  1223. break;
  1224. case FILE_OPMULTIPLY:
  1225. offset = lhs * off;
  1226. break;
  1227. case FILE_OPDIVIDE:
  1228. offset = lhs / off;
  1229. break;
  1230. case FILE_OPMODULO:
  1231. offset = lhs % off;
  1232. break;
  1233. }
  1234. } else
  1235. offset = lhs;
  1236. if (m->in_op & FILE_OPINVERSE)
  1237. offset = ~offset;
  1238. break;
  1239. case FILE_LESHORT:
  1240. if (OFFSET_OOB(nbytes, offset, 2))
  1241. return 0;
  1242. lhs = (p->hs[1] << 8) | p->hs[0];
  1243. if (off) {
  1244. switch (m->in_op & FILE_OPS_MASK) {
  1245. case FILE_OPAND:
  1246. offset = lhs & off;
  1247. break;
  1248. case FILE_OPOR:
  1249. offset = lhs | off;
  1250. break;
  1251. case FILE_OPXOR:
  1252. offset = lhs ^ off;
  1253. break;
  1254. case FILE_OPADD:
  1255. offset = lhs + off;
  1256. break;
  1257. case FILE_OPMINUS:
  1258. offset = lhs - off;
  1259. break;
  1260. case FILE_OPMULTIPLY:
  1261. offset = lhs * off;
  1262. break;
  1263. case FILE_OPDIVIDE:
  1264. offset = lhs / off;
  1265. break;
  1266. case FILE_OPMODULO:
  1267. offset = lhs % off;
  1268. break;
  1269. }
  1270. } else
  1271. offset = lhs;
  1272. if (m->in_op & FILE_OPINVERSE)
  1273. offset = ~offset;
  1274. break;
  1275. case FILE_SHORT:
  1276. if (OFFSET_OOB(nbytes, offset, 2))
  1277. return 0;
  1278. if (off) {
  1279. switch (m->in_op & FILE_OPS_MASK) {
  1280. case FILE_OPAND:
  1281. offset = p->h & off;
  1282. break;
  1283. case FILE_OPOR:
  1284. offset = p->h | off;
  1285. break;
  1286. case FILE_OPXOR:
  1287. offset = p->h ^ off;
  1288. break;
  1289. case FILE_OPADD:
  1290. offset = p->h + off;
  1291. break;
  1292. case FILE_OPMINUS:
  1293. offset = p->h - off;
  1294. break;
  1295. case FILE_OPMULTIPLY:
  1296. offset = p->h * off;
  1297. break;
  1298. case FILE_OPDIVIDE:
  1299. offset = p->h / off;
  1300. break;
  1301. case FILE_OPMODULO:
  1302. offset = p->h % off;
  1303. break;
  1304. }
  1305. }
  1306. else
  1307. offset = p->h;
  1308. if (m->in_op & FILE_OPINVERSE)
  1309. offset = ~offset;
  1310. break;
  1311. case FILE_BELONG:
  1312. case FILE_BEID3:
  1313. if (OFFSET_OOB(nbytes, offset, 4))
  1314. return 0;
  1315. lhs = (p->hl[0] << 24) | (p->hl[1] << 16) |
  1316. (p->hl[2] << 8) | p->hl[3];
  1317. if (off) {
  1318. switch (m->in_op & FILE_OPS_MASK) {
  1319. case FILE_OPAND:
  1320. offset = lhs & off;
  1321. break;
  1322. case FILE_OPOR:
  1323. offset = lhs | off;
  1324. break;
  1325. case FILE_OPXOR:
  1326. offset = lhs ^ off;
  1327. break;
  1328. case FILE_OPADD:
  1329. offset = lhs + off;
  1330. break;
  1331. case FILE_OPMINUS:
  1332. offset = lhs - off;
  1333. break;
  1334. case FILE_OPMULTIPLY:
  1335. offset = lhs * off;
  1336. break;
  1337. case FILE_OPDIVIDE:
  1338. offset = lhs / off;
  1339. break;
  1340. case FILE_OPMODULO:
  1341. offset = lhs % off;
  1342. break;
  1343. }
  1344. } else
  1345. offset = lhs;
  1346. if (m->in_op & FILE_OPINVERSE)
  1347. offset = ~offset;
  1348. break;
  1349. case FILE_LELONG:
  1350. case FILE_LEID3:
  1351. if (OFFSET_OOB(nbytes, offset, 4))
  1352. return 0;
  1353. lhs = (p->hl[3] << 24) | (p->hl[2] << 16) |
  1354. (p->hl[1] << 8) | p->hl[0];
  1355. if (off) {
  1356. switch (m->in_op & FILE_OPS_MASK) {
  1357. case FILE_OPAND:
  1358. offset = lhs & off;
  1359. break;
  1360. case FILE_OPOR:
  1361. offset = lhs | off;
  1362. break;
  1363. case FILE_OPXOR:
  1364. offset = lhs ^ off;
  1365. break;
  1366. case FILE_OPADD:
  1367. offset = lhs + off;
  1368. break;
  1369. case FILE_OPMINUS:
  1370. offset = lhs - off;
  1371. break;
  1372. case FILE_OPMULTIPLY:
  1373. offset = lhs * off;
  1374. break;
  1375. case FILE_OPDIVIDE:
  1376. offset = lhs / off;
  1377. break;
  1378. case FILE_OPMODULO:
  1379. offset = lhs % off;
  1380. break;
  1381. }
  1382. } else
  1383. offset = lhs;
  1384. if (m->in_op & FILE_OPINVERSE)
  1385. offset = ~offset;
  1386. break;
  1387. case FILE_MELONG:
  1388. if (OFFSET_OOB(nbytes, offset, 4))
  1389. return 0;
  1390. lhs = (p->hl[1] << 24) | (p->hl[0] << 16) |
  1391. (p->hl[3] << 8) | p->hl[2];
  1392. if (off) {
  1393. switch (m->in_op & FILE_OPS_MASK) {
  1394. case FILE_OPAND:
  1395. offset = lhs & off;
  1396. break;
  1397. case FILE_OPOR:
  1398. offset = lhs | off;
  1399. break;
  1400. case FILE_OPXOR:
  1401. offset = lhs ^ off;
  1402. break;
  1403. case FILE_OPADD:
  1404. offset = lhs + off;
  1405. break;
  1406. case FILE_OPMINUS:
  1407. offset = lhs - off;
  1408. break;
  1409. case FILE_OPMULTIPLY:
  1410. offset = lhs * off;
  1411. break;
  1412. case FILE_OPDIVIDE:
  1413. offset = lhs / off;
  1414. break;
  1415. case FILE_OPMODULO:
  1416. offset = lhs % off;
  1417. break;
  1418. }
  1419. } else
  1420. offset = lhs;
  1421. if (m->in_op & FILE_OPINVERSE)
  1422. offset = ~offset;
  1423. break;
  1424. case FILE_LONG:
  1425. if (OFFSET_OOB(nbytes, offset, 4))
  1426. return 0;
  1427. if (off) {
  1428. switch (m->in_op & FILE_OPS_MASK) {
  1429. case FILE_OPAND:
  1430. offset = p->l & off;
  1431. break;
  1432. case FILE_OPOR:
  1433. offset = p->l | off;
  1434. break;
  1435. case FILE_OPXOR:
  1436. offset = p->l ^ off;
  1437. break;
  1438. case FILE_OPADD:
  1439. offset = p->l + off;
  1440. break;
  1441. case FILE_OPMINUS:
  1442. offset = p->l - off;
  1443. break;
  1444. case FILE_OPMULTIPLY:
  1445. offset = p->l * off;
  1446. break;
  1447. case FILE_OPDIVIDE:
  1448. offset = p->l / off;
  1449. break;
  1450. case FILE_OPMODULO:
  1451. offset = p->l % off;
  1452. break;
  1453. }
  1454. } else
  1455. offset = p->l;
  1456. if (m->in_op & FILE_OPINVERSE)
  1457. offset = ~offset;
  1458. break;
  1459. default:
  1460. break;
  1461. }
  1462. switch (in_type) {
  1463. case FILE_LEID3:
  1464. case FILE_BEID3:
  1465. offset = ((((offset >> 0) & 0x7f) << 0) |
  1466. (((offset >> 8) & 0x7f) << 7) |
  1467. (((offset >> 16) & 0x7f) << 14) |
  1468. (((offset >> 24) & 0x7f) << 21)) + 10;
  1469. break;
  1470. default:
  1471. break;
  1472. }
  1473. if (m->flag & INDIROFFADD) {
  1474. offset += ms->c.li[cont_level-1].off;
  1475. if (offset == 0) {
  1476. if ((ms->flags & MAGIC_DEBUG) != 0)
  1477. fprintf(stderr,
  1478. "indirect *zero* offset\n");
  1479. return 0;
  1480. }
  1481. if ((ms->flags & MAGIC_DEBUG) != 0)
  1482. fprintf(stderr, "indirect +offs=%u\n", offset);
  1483. }
  1484. if (mcopy(ms, p, m->type, 0, s, offset, nbytes, m) == -1)
  1485. return -1;
  1486. ms->offset = offset;
  1487. if ((ms->flags & MAGIC_DEBUG) != 0) {
  1488. mdebug(offset, (char *)(void *)p,
  1489. sizeof(union VALUETYPE));
  1490. #ifndef COMPILE_ONLY
  1491. file_mdump(m);
  1492. #endif
  1493. }
  1494. }
  1495. /* Verify we have enough data to match magic type */
  1496. switch (m->type) {
  1497. case FILE_BYTE:
  1498. if (OFFSET_OOB(nbytes, offset, 1))
  1499. return 0;
  1500. break;
  1501. case FILE_SHORT:
  1502. case FILE_BESHORT:
  1503. case FILE_LESHORT:
  1504. if (OFFSET_OOB(nbytes, offset, 2))
  1505. return 0;
  1506. break;
  1507. case FILE_LONG:
  1508. case FILE_BELONG:
  1509. case FILE_LELONG:
  1510. case FILE_MELONG:
  1511. case FILE_DATE:
  1512. case FILE_BEDATE:
  1513. case FILE_LEDATE:
  1514. case FILE_MEDATE:
  1515. case FILE_LDATE:
  1516. case FILE_BELDATE:
  1517. case FILE_LELDATE:
  1518. case FILE_MELDATE:
  1519. case FILE_FLOAT:
  1520. case FILE_BEFLOAT:
  1521. case FILE_LEFLOAT:
  1522. if (OFFSET_OOB(nbytes, offset, 4))
  1523. return 0;
  1524. break;
  1525. case FILE_DOUBLE:
  1526. case FILE_BEDOUBLE:
  1527. case FILE_LEDOUBLE:
  1528. if (OFFSET_OOB(nbytes, offset, 8))
  1529. return 0;
  1530. break;
  1531. case FILE_STRING:
  1532. case FILE_PSTRING:
  1533. case FILE_SEARCH:
  1534. if (OFFSET_OOB(nbytes, offset, m->vallen))
  1535. return 0;
  1536. break;
  1537. case FILE_REGEX:
  1538. if (nbytes < offset)
  1539. return 0;
  1540. break;
  1541. case FILE_INDIRECT:
  1542. if (m->str_flags & INDIRECT_RELATIVE)
  1543. offset += CAST(uint32_t, o);
  1544. if (offset == 0)
  1545. return 0;
  1546. if (nbytes < offset)
  1547. return 0;
  1548. if ((pb = file_push_buffer(ms)) == NULL)
  1549. return -1;
  1550. rv = file_softmagic(ms, s + offset, nbytes - offset,
  1551. indir_level + 1, name_count, BINTEST, text);
  1552. if ((ms->flags & MAGIC_DEBUG) != 0)
  1553. fprintf(stderr, "indirect @offs=%u[%d]\n", offset, rv);
  1554. rbuf = file_pop_buffer(ms, pb);
  1555. if (rbuf == NULL && ms->event_flags & EVENT_HAD_ERR)
  1556. return -1;
  1557. if (rv == 1) {
  1558. if ((ms->flags & (MAGIC_MIME|MAGIC_APPLE)) == 0 &&
  1559. file_printf(ms, F(ms, m, "%u"), offset) == -1) {
  1560. free(rbuf);
  1561. return -1;
  1562. }
  1563. if (file_printf(ms, "%s", rbuf) == -1) {
  1564. free(rbuf);
  1565. return -1;
  1566. }
  1567. }
  1568. free(rbuf);
  1569. return rv;
  1570. case FILE_USE:
  1571. if (nbytes < offset)
  1572. return 0;
  1573. rbuf = m->value.s;
  1574. if (*rbuf == '^') {
  1575. rbuf++;
  1576. flip = !flip;
  1577. }
  1578. if (file_magicfind(ms, rbuf, &ml) == -1) {
  1579. file_error(ms, 0, "cannot find entry `%s'", rbuf);
  1580. return -1;
  1581. }
  1582. (*name_count)++;
  1583. oneed_separator = *need_separator;
  1584. if (m->flag & NOSPACE)
  1585. *need_separator = 0;
  1586. rv = match(ms, ml.magic, ml.nmagic, s, nbytes, offset + o,
  1587. mode, text, flip, indir_level, name_count,
  1588. printed_something, need_separator, returnval);
  1589. if (rv != 1)
  1590. *need_separator = oneed_separator;
  1591. return rv;
  1592. case FILE_NAME:
  1593. if (file_printf(ms, "%s", m->desc) == -1)
  1594. return -1;
  1595. return 1;
  1596. case FILE_DEFAULT: /* nothing to check */
  1597. case FILE_CLEAR:
  1598. default:
  1599. break;
  1600. }
  1601. if (!mconvert(ms, m, flip))
  1602. return 0;
  1603. return 1;
  1604. }
  1605. private uint64_t
  1606. file_strncmp(const char *s1, const char *s2, size_t len, uint32_t flags)
  1607. {
  1608. /*
  1609. * Convert the source args to unsigned here so that (1) the
  1610. * compare will be unsigned as it is in strncmp() and (2) so
  1611. * the ctype functions will work correctly without extra
  1612. * casting.
  1613. */
  1614. const unsigned char *a = (const unsigned char *)s1;
  1615. const unsigned char *b = (const unsigned char *)s2;
  1616. uint64_t v;
  1617. /*
  1618. * What we want here is v = strncmp(s1, s2, len),
  1619. * but ignoring any nulls.
  1620. */
  1621. v = 0;
  1622. if (0L == flags) { /* normal string: do it fast */
  1623. while (len-- > 0)
  1624. if ((v = *b++ - *a++) != '\0')
  1625. break;
  1626. }
  1627. else { /* combine the others */
  1628. while (len-- > 0) {
  1629. if ((flags & STRING_IGNORE_LOWERCASE) &&
  1630. islower(*a)) {
  1631. if ((v = tolower(*b++) - *a++) != '\0')
  1632. break;
  1633. }
  1634. else if ((flags & STRING_IGNORE_UPPERCASE) &&
  1635. isupper(*a)) {
  1636. if ((v = toupper(*b++) - *a++) != '\0')
  1637. break;
  1638. }
  1639. else if ((flags & STRING_COMPACT_WHITESPACE) &&
  1640. isspace(*a)) {
  1641. a++;
  1642. if (isspace(*b++)) {
  1643. if (!isspace(*a))
  1644. while (isspace(*b))
  1645. b++;
  1646. }
  1647. else {
  1648. v = 1;
  1649. break;
  1650. }
  1651. }
  1652. else if ((flags & STRING_COMPACT_OPTIONAL_WHITESPACE) &&
  1653. isspace(*a)) {
  1654. a++;
  1655. while (isspace(*b))
  1656. b++;
  1657. }
  1658. else {
  1659. if ((v = *b++ - *a++) != '\0')
  1660. break;
  1661. }
  1662. }
  1663. }
  1664. return v;
  1665. }
  1666. private uint64_t
  1667. file_strncmp16(const char *a, const char *b, size_t len, uint32_t flags)
  1668. {
  1669. /*
  1670. * XXX - The 16-bit string compare probably needs to be done
  1671. * differently, especially if the flags are to be supported.
  1672. * At the moment, I am unsure.
  1673. */
  1674. flags = 0;
  1675. return file_strncmp(a, b, len, flags);
  1676. }
  1677. private int
  1678. magiccheck(struct magic_set *ms, struct magic *m)
  1679. {
  1680. uint64_t l = m->value.q;
  1681. uint64_t v;
  1682. float fl, fv;
  1683. double dl, dv;
  1684. int matched;
  1685. union VALUETYPE *p = &ms->ms_value;
  1686. switch (m->type) {
  1687. case FILE_BYTE:
  1688. v = p->b;
  1689. break;
  1690. case FILE_SHORT:
  1691. case FILE_BESHORT:
  1692. case FILE_LESHORT:
  1693. v = p->h;
  1694. break;
  1695. case FILE_LONG:
  1696. case FILE_BELONG:
  1697. case FILE_LELONG:
  1698. case FILE_MELONG:
  1699. case FILE_DATE:
  1700. case FILE_BEDATE:
  1701. case FILE_LEDATE:
  1702. case FILE_MEDATE:
  1703. case FILE_LDATE:
  1704. case FILE_BELDATE:
  1705. case FILE_LELDATE:
  1706. case FILE_MELDATE:
  1707. v = p->l;
  1708. break;
  1709. case FILE_QUAD:
  1710. case FILE_LEQUAD:
  1711. case FILE_BEQUAD:
  1712. case FILE_QDATE:
  1713. case FILE_BEQDATE:
  1714. case FILE_LEQDATE:
  1715. case FILE_QLDATE:
  1716. case FILE_BEQLDATE:
  1717. case FILE_LEQLDATE:
  1718. case FILE_QWDATE:
  1719. case FILE_BEQWDATE:
  1720. case FILE_LEQWDATE:
  1721. v = p->q;
  1722. break;
  1723. case FILE_FLOAT:
  1724. case FILE_BEFLOAT:
  1725. case FILE_LEFLOAT:
  1726. fl = m->value.f;
  1727. fv = p->f;
  1728. switch (m->reln) {
  1729. case 'x':
  1730. matched = 1;
  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. case '<':
  1742. matched = fv < fl;
  1743. break;
  1744. default:
  1745. file_magerror(ms, "cannot happen with float: invalid relation `%c'",
  1746. m->reln);
  1747. return -1;
  1748. }
  1749. return matched;
  1750. case FILE_DOUBLE:
  1751. case FILE_BEDOUBLE:
  1752. case FILE_LEDOUBLE:
  1753. dl = m->value.d;
  1754. dv = p->d;
  1755. switch (m->reln) {
  1756. case 'x':
  1757. matched = 1;
  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. case '<':
  1769. matched = dv < dl;
  1770. break;
  1771. default:
  1772. file_magerror(ms, "cannot happen with double: invalid relation `%c'", m->reln);
  1773. return -1;
  1774. }
  1775. return matched;
  1776. case FILE_DEFAULT:
  1777. case FILE_CLEAR:
  1778. l = 0;
  1779. v = 0;
  1780. break;
  1781. case FILE_STRING:
  1782. case FILE_PSTRING:
  1783. l = 0;
  1784. v = file_strncmp(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1785. break;
  1786. case FILE_BESTRING16:
  1787. case FILE_LESTRING16:
  1788. l = 0;
  1789. v = file_strncmp16(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
  1790. break;
  1791. case FILE_SEARCH: { /* search ms->search.s for the string m->value.s */
  1792. size_t slen;
  1793. size_t idx;
  1794. if (ms->search.s == NULL)
  1795. return 0;
  1796. slen = MIN(m->vallen, sizeof(m->value.s));
  1797. l = 0;
  1798. v = 0;
  1799. for (idx = 0; m->str_range == 0 || idx < m->str_range; idx++) {
  1800. if (slen + idx > ms->search.s_len)
  1801. break;
  1802. v = file_strncmp(m->value.s, ms->search.s + idx, slen,
  1803. m->str_flags);
  1804. if (v == 0) { /* found match */
  1805. ms->search.offset += idx;
  1806. ms->search.rm_len = m->str_range - idx;
  1807. break;
  1808. }
  1809. }
  1810. break;
  1811. }
  1812. case FILE_REGEX: {
  1813. int rc;
  1814. file_regex_t rx;
  1815. const char *search;
  1816. if (ms->search.s == NULL)
  1817. return 0;
  1818. l = 0;
  1819. rc = file_regcomp(&rx, m->value.s,
  1820. REG_EXTENDED|REG_NEWLINE|
  1821. ((m->str_flags & STRING_IGNORE_CASE) ? REG_ICASE : 0));
  1822. if (rc) {
  1823. file_regerror(&rx, rc, ms);
  1824. v = (uint64_t)-1;
  1825. } else {
  1826. regmatch_t pmatch[1];
  1827. size_t slen = ms->search.s_len;
  1828. #ifndef REG_STARTEND
  1829. #define REG_STARTEND 0
  1830. char *copy;
  1831. if (slen != 0) {
  1832. copy = malloc(slen);
  1833. if (copy == NULL) {
  1834. file_error(ms, errno,
  1835. "can't allocate %" SIZE_T_FORMAT "u bytes",
  1836. slen);
  1837. return -1;
  1838. }
  1839. memcpy(copy, ms->search.s, slen);
  1840. copy[--slen] = '\0';
  1841. search = copy;
  1842. } else {
  1843. search = ms->search.s;
  1844. copy = NULL;
  1845. }
  1846. #else
  1847. search = ms->search.s;
  1848. pmatch[0].rm_so = 0;
  1849. pmatch[0].rm_eo = slen;
  1850. #endif
  1851. rc = file_regexec(&rx, (const char *)search,
  1852. 1, pmatch, REG_STARTEND);
  1853. #if REG_STARTEND == 0
  1854. free(copy);
  1855. #endif
  1856. switch (rc) {
  1857. case 0:
  1858. ms->search.s += (int)pmatch[0].rm_so;
  1859. ms->search.offset += (size_t)pmatch[0].rm_so;
  1860. ms->search.rm_len =
  1861. (size_t)(pmatch[0].rm_eo - pmatch[0].rm_so);
  1862. v = 0;
  1863. break;
  1864. case REG_NOMATCH:
  1865. v = 1;
  1866. break;
  1867. default:
  1868. file_regerror(&rx, rc, ms);
  1869. v = (uint64_t)-1;
  1870. break;
  1871. }
  1872. }
  1873. file_regfree(&rx);
  1874. if (v == (uint64_t)-1)
  1875. return -1;
  1876. break;
  1877. }
  1878. case FILE_INDIRECT:
  1879. case FILE_USE:
  1880. case FILE_NAME:
  1881. return 1;
  1882. default:
  1883. file_magerror(ms, "invalid type %d in magiccheck()", m->type);
  1884. return -1;
  1885. }
  1886. v = file_signextend(ms, m, v);
  1887. switch (m->reln) {
  1888. case 'x':
  1889. if ((ms->flags & MAGIC_DEBUG) != 0)
  1890. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1891. "u == *any* = 1\n", (unsigned long long)v);
  1892. matched = 1;
  1893. break;
  1894. case '!':
  1895. matched = v != l;
  1896. if ((ms->flags & MAGIC_DEBUG) != 0)
  1897. (void) fprintf(stderr, "%" INT64_T_FORMAT "u != %"
  1898. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1899. (unsigned long long)l, matched);
  1900. break;
  1901. case '=':
  1902. matched = v == l;
  1903. if ((ms->flags & MAGIC_DEBUG) != 0)
  1904. (void) fprintf(stderr, "%" INT64_T_FORMAT "u == %"
  1905. INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
  1906. (unsigned long long)l, matched);
  1907. break;
  1908. case '>':
  1909. if (m->flag & UNSIGNED) {
  1910. matched = v > l;
  1911. if ((ms->flags & MAGIC_DEBUG) != 0)
  1912. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1913. "u > %" INT64_T_FORMAT "u = %d\n",
  1914. (unsigned long long)v,
  1915. (unsigned long long)l, matched);
  1916. }
  1917. else {
  1918. matched = (int64_t) v > (int64_t) l;
  1919. if ((ms->flags & MAGIC_DEBUG) != 0)
  1920. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1921. "d > %" INT64_T_FORMAT "d = %d\n",
  1922. (long long)v, (long long)l, matched);
  1923. }
  1924. break;
  1925. case '<':
  1926. if (m->flag & UNSIGNED) {
  1927. matched = v < l;
  1928. if ((ms->flags & MAGIC_DEBUG) != 0)
  1929. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1930. "u < %" INT64_T_FORMAT "u = %d\n",
  1931. (unsigned long long)v,
  1932. (unsigned long long)l, matched);
  1933. }
  1934. else {
  1935. matched = (int64_t) v < (int64_t) l;
  1936. if ((ms->flags & MAGIC_DEBUG) != 0)
  1937. (void) fprintf(stderr, "%" INT64_T_FORMAT
  1938. "d < %" INT64_T_FORMAT "d = %d\n",
  1939. (long long)v, (long long)l, matched);
  1940. }
  1941. break;
  1942. case '&':
  1943. matched = (v & l) == l;
  1944. if ((ms->flags & MAGIC_DEBUG) != 0)
  1945. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  1946. INT64_T_FORMAT "x) == %" INT64_T_FORMAT
  1947. "x) = %d\n", (unsigned long long)v,
  1948. (unsigned long long)l, (unsigned long long)l,
  1949. matched);
  1950. break;
  1951. case '^':
  1952. matched = (v & l) != l;
  1953. if ((ms->flags & MAGIC_DEBUG) != 0)
  1954. (void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
  1955. INT64_T_FORMAT "x) != %" INT64_T_FORMAT
  1956. "x) = %d\n", (unsigned long long)v,
  1957. (unsigned long long)l, (unsigned long long)l,
  1958. matched);
  1959. break;
  1960. default:
  1961. file_magerror(ms, "cannot happen: invalid relation `%c'",
  1962. m->reln);
  1963. return -1;
  1964. }
  1965. return matched;
  1966. }
  1967. private int
  1968. handle_annotation(struct magic_set *ms, struct magic *m)
  1969. {
  1970. if (ms->flags & MAGIC_APPLE) {
  1971. if (file_printf(ms, "%.8s", m->apple) == -1)
  1972. return -1;
  1973. return 1;
  1974. }
  1975. if ((ms->flags & MAGIC_MIME_TYPE) && m->mimetype[0]) {
  1976. if (file_printf(ms, "%s", m->mimetype) == -1)
  1977. return -1;
  1978. return 1;
  1979. }
  1980. return 0;
  1981. }
  1982. private int
  1983. print_sep(struct magic_set *ms, int firstline)
  1984. {
  1985. if (ms->flags & MAGIC_MIME)
  1986. return 0;
  1987. if (firstline)
  1988. return 0;
  1989. /*
  1990. * we found another match
  1991. * put a newline and '-' to do some simple formatting
  1992. */
  1993. return file_printf(ms, "\n- ");
  1994. }