softmagic.c 50 KB

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