softmagic.c 48 KB

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