softmagic.c 47 KB

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