softmagic.c 44 KB

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