funcs.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368
  1. /*
  2. * Copyright (c) Christos Zoulas 2003.
  3. * All Rights Reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice immediately at the beginning of the file, without modification,
  10. * this list of conditions, and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  16. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  18. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
  19. * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  21. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  22. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  23. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  24. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  25. * SUCH DAMAGE.
  26. */
  27. #include "file.h"
  28. #include "magic.h"
  29. #include <stdarg.h>
  30. #include <stdlib.h>
  31. #include <string.h>
  32. #include <ctype.h>
  33. #if defined(HAVE_WCHAR_H)
  34. #include <wchar.h>
  35. #endif
  36. #if defined(HAVE_WCTYPE_H)
  37. #include <wctype.h>
  38. #endif
  39. #if defined(HAVE_LIMITS_H)
  40. #include <limits.h>
  41. #endif
  42. #ifndef SIZE_T_MAX
  43. #ifdef __LP64__
  44. #define SIZE_T_MAX (size_t)0xfffffffffffffffffU
  45. #else
  46. #define SIZE_T_MAX (size_t)0xffffffffU
  47. #endif
  48. #endif
  49. #ifndef lint
  50. FILE_RCSID("@(#)$File: funcs.c,v 1.32 2007/05/24 17:22:27 christos Exp $")
  51. #endif /* lint */
  52. #ifndef HAVE_VSNPRINTF
  53. int vsnprintf(char *, size_t, const char *, va_list);
  54. #endif
  55. /*
  56. * Like printf, only we print to a buffer and advance it.
  57. */
  58. protected int
  59. file_printf(struct magic_set *ms, const char *fmt, ...)
  60. {
  61. va_list ap;
  62. size_t len, size;
  63. char *buf;
  64. va_start(ap, fmt);
  65. if ((len = vsnprintf(ms->o.ptr, ms->o.left, fmt, ap)) >= ms->o.left) {
  66. long diff; /* XXX: really ptrdiff_t */
  67. va_end(ap);
  68. size = (ms->o.size - ms->o.left) + len + 1024;
  69. if ((buf = realloc(ms->o.buf, size)) == NULL) {
  70. file_oomem(ms, size);
  71. return -1;
  72. }
  73. diff = ms->o.ptr - ms->o.buf;
  74. ms->o.ptr = buf + diff;
  75. ms->o.buf = buf;
  76. ms->o.left = size - diff;
  77. ms->o.size = size;
  78. va_start(ap, fmt);
  79. len = vsnprintf(ms->o.ptr, ms->o.left, fmt, ap);
  80. }
  81. va_end(ap);
  82. ms->o.ptr += len;
  83. ms->o.left -= len;
  84. return 0;
  85. }
  86. /*
  87. * error - print best error message possible
  88. */
  89. /*VARARGS*/
  90. private void
  91. file_error_core(struct magic_set *ms, int error, const char *f, va_list va,
  92. uint32_t lineno)
  93. {
  94. size_t len;
  95. /* Only the first error is ok */
  96. if (ms->haderr)
  97. return;
  98. len = 0;
  99. if (lineno != 0) {
  100. (void)snprintf(ms->o.buf, ms->o.size, "line %u: ", lineno);
  101. len = strlen(ms->o.buf);
  102. }
  103. (void)vsnprintf(ms->o.buf + len, ms->o.size - len, f, va);
  104. if (error > 0) {
  105. len = strlen(ms->o.buf);
  106. (void)snprintf(ms->o.buf + len, ms->o.size - len, " (%s)",
  107. strerror(error));
  108. }
  109. ms->haderr++;
  110. ms->error = error;
  111. }
  112. /*VARARGS*/
  113. protected void
  114. file_error(struct magic_set *ms, int error, const char *f, ...)
  115. {
  116. va_list va;
  117. va_start(va, f);
  118. file_error_core(ms, error, f, va, 0);
  119. va_end(va);
  120. }
  121. /*
  122. * Print an error with magic line number.
  123. */
  124. /*VARARGS*/
  125. protected void
  126. file_magerror(struct magic_set *ms, const char *f, ...)
  127. {
  128. va_list va;
  129. va_start(va, f);
  130. file_error_core(ms, 0, f, va, ms->line);
  131. va_end(va);
  132. }
  133. protected void
  134. file_oomem(struct magic_set *ms, size_t len)
  135. {
  136. file_error(ms, errno, "cannot allocate %zu bytes", len);
  137. }
  138. protected void
  139. file_badseek(struct magic_set *ms)
  140. {
  141. file_error(ms, errno, "error seeking");
  142. }
  143. protected void
  144. file_badread(struct magic_set *ms)
  145. {
  146. file_error(ms, errno, "error reading");
  147. }
  148. #ifndef COMPILE_ONLY
  149. protected int
  150. file_buffer(struct magic_set *ms, int fd, const char *inname, const void *buf,
  151. size_t nb)
  152. {
  153. int m;
  154. #ifdef __EMX__
  155. if ((ms->flags & MAGIC_NO_CHECK_APPTYPE) == 0 && inname) {
  156. switch (file_os2_apptype(ms, inname, buf, nb)) {
  157. case -1:
  158. return -1;
  159. case 0:
  160. break;
  161. default:
  162. return 1;
  163. }
  164. }
  165. #endif
  166. /* try compression stuff */
  167. if ((ms->flags & MAGIC_NO_CHECK_COMPRESS) != 0 ||
  168. (m = file_zmagic(ms, fd, inname, buf, nb)) == 0) {
  169. /* Check if we have a tar file */
  170. if ((ms->flags & MAGIC_NO_CHECK_TAR) != 0 ||
  171. (m = file_is_tar(ms, buf, nb)) == 0) {
  172. /* try tests in /etc/magic (or surrogate magic file) */
  173. if ((ms->flags & MAGIC_NO_CHECK_SOFT) != 0 ||
  174. (m = file_softmagic(ms, buf, nb)) == 0) {
  175. /* try known keywords, check whether it is ASCII */
  176. if ((ms->flags & MAGIC_NO_CHECK_ASCII) != 0 ||
  177. (m = file_ascmagic(ms, buf, nb)) == 0) {
  178. /* abandon hope, all ye who remain here */
  179. if (file_printf(ms, ms->flags & MAGIC_MIME ?
  180. (nb ? "application/octet-stream" :
  181. "application/empty") :
  182. (nb ? "data" :
  183. "empty")) == -1)
  184. return -1;
  185. m = 1;
  186. }
  187. }
  188. }
  189. }
  190. #ifdef BUILTIN_ELF
  191. if ((ms->flags & MAGIC_NO_CHECK_ELF) == 0 && m == 1 && nb > 5 && fd != -1) {
  192. /*
  193. * We matched something in the file, so this *might*
  194. * be an ELF file, and the file is at least 5 bytes
  195. * long, so if it's an ELF file it has at least one
  196. * byte past the ELF magic number - try extracting
  197. * information from the ELF headers that cannot easily
  198. * be extracted with rules in the magic file.
  199. */
  200. (void)file_tryelf(ms, fd, buf, nb);
  201. }
  202. #endif
  203. return m;
  204. }
  205. #endif
  206. protected int
  207. file_reset(struct magic_set *ms)
  208. {
  209. if (ms->mlist == NULL) {
  210. file_error(ms, 0, "no magic files loaded");
  211. return -1;
  212. }
  213. ms->o.ptr = ms->o.buf;
  214. ms->o.left = ms->o.size;
  215. ms->haderr = 0;
  216. ms->error = -1;
  217. return 0;
  218. }
  219. #define OCTALIFY(n, o) \
  220. /*LINTED*/ \
  221. (void)(*(n)++ = '\\', \
  222. *(n)++ = (((uint32_t)*(o) >> 6) & 3) + '0', \
  223. *(n)++ = (((uint32_t)*(o) >> 3) & 7) + '0', \
  224. *(n)++ = (((uint32_t)*(o) >> 0) & 7) + '0', \
  225. (o)++)
  226. protected const char *
  227. file_getbuffer(struct magic_set *ms)
  228. {
  229. char *pbuf, *op, *np;
  230. size_t psize, len;
  231. if (ms->haderr)
  232. return NULL;
  233. if (ms->flags & MAGIC_RAW)
  234. return ms->o.buf;
  235. len = ms->o.size - ms->o.left;
  236. /* * 4 is for octal representation, + 1 is for NUL */
  237. if (len > (SIZE_T_MAX - 1) / 4) {
  238. file_oomem(ms, len);
  239. return NULL;
  240. }
  241. psize = len * 4 + 1;
  242. if (ms->o.psize < psize) {
  243. if ((pbuf = realloc(ms->o.pbuf, psize)) == NULL) {
  244. file_oomem(ms, psize);
  245. return NULL;
  246. }
  247. ms->o.psize = psize;
  248. ms->o.pbuf = pbuf;
  249. }
  250. #if defined(HAVE_WCHAR_H) && defined(HAVE_MBRTOWC) && defined(HAVE_WCWIDTH)
  251. {
  252. mbstate_t state;
  253. wchar_t nextchar;
  254. int mb_conv = 1;
  255. size_t bytesconsumed;
  256. char *eop;
  257. (void)memset(&state, 0, sizeof(mbstate_t));
  258. np = ms->o.pbuf;
  259. op = ms->o.buf;
  260. eop = op + strlen(ms->o.buf);
  261. while (op < eop) {
  262. bytesconsumed = mbrtowc(&nextchar, op,
  263. (size_t)(eop - op), &state);
  264. if (bytesconsumed == (size_t)(-1) ||
  265. bytesconsumed == (size_t)(-2)) {
  266. mb_conv = 0;
  267. break;
  268. }
  269. if (iswprint(nextchar)) {
  270. (void)memcpy(np, op, bytesconsumed);
  271. op += bytesconsumed;
  272. np += bytesconsumed;
  273. } else {
  274. while (bytesconsumed-- > 0)
  275. OCTALIFY(np, op);
  276. }
  277. }
  278. *np = '\0';
  279. /* Parsing succeeded as a multi-byte sequence */
  280. if (mb_conv != 0)
  281. return ms->o.pbuf;
  282. }
  283. #endif
  284. for (np = ms->o.pbuf, op = ms->o.buf; *op; op++) {
  285. if (isprint((unsigned char)*op)) {
  286. *np++ = *op;
  287. } else {
  288. OCTALIFY(np, op);
  289. }
  290. }
  291. *np = '\0';
  292. return ms->o.pbuf;
  293. }
  294. protected int
  295. file_check_mem(struct magic_set *ms, unsigned int level)
  296. {
  297. size_t len;
  298. if (level >= ms->c.len) {
  299. len = (ms->c.len += 20) * sizeof(*ms->c.li);
  300. ms->c.li = (ms->c.li == NULL) ? malloc(len) :
  301. realloc(ms->c.li, len);
  302. if (ms->c.li == NULL) {
  303. file_oomem(ms, len);
  304. return -1;
  305. }
  306. }
  307. ms->c.li[level].got_match = 0;
  308. #ifdef ENABLE_CONDITIONALS
  309. ms->c.li[level].last_match = 0;
  310. ms->c.li[level].last_cond = COND_NONE;
  311. #endif /* ENABLE_CONDITIONALS */
  312. return 0;
  313. }
  314. /*
  315. * Yes these wrappers suffer from buffer overflows, but if your OS does not
  316. * have the real functions, maybe you should consider replacing your OS?
  317. */
  318. #ifndef HAVE_VSNPRINTF
  319. int
  320. vsnprintf(char *buf, size_t len, const char *fmt, va_list ap)
  321. {
  322. return vsprintf(buf, fmt, ap);
  323. }
  324. #endif
  325. #ifndef HAVE_SNPRINTF
  326. /*ARGSUSED*/
  327. int
  328. snprintf(char *buf, size_t len, const char *fmt, ...)
  329. {
  330. int rv;
  331. va_list ap;
  332. va_start(ap, fmt);
  333. rv = vsprintf(buf, fmt, ap);
  334. va_end(ap);
  335. return rv;
  336. }
  337. #endif