softmagic.c 56 KB

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