softmagic.c 57 KB

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