softmagic.c 57 KB

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