softmagic.c 50 KB

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