softmagic.c 54 KB

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