softmagic.c 50 KB

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