mirror of
https://github.com/php/php-src.git
synced 2024-10-01 06:46:08 +00:00
b3709bfc52
* PHP-5.6: (27 commits) fix non-standard C update NEWS 5.4.41 next fix CVE num update NEWS Fix bug #69441 (Buffer Overflow when parsing tar/zip/phar in phar_set_inode) fix test fix type in fix for #69085 fix memory leak & add test Fix tests fix CVE num Fix bug #69337 (php_stream_url_wrap_http_ex() type-confusion vulnerability) Fix test Additional fix for bug #69324 More fixes for bug #69152 Fixed bug #69353 (Missing null byte checks for paths in various PHP extensions) Fixed bug #69324 (Buffer Over-read in unserialize when parsing Phar) Fixed bug #69316 (Use-after-free in php_curl related to CURLOPT_FILE/_INFILE/_WRITEHEADER) Fix bug #68486 and bug #69218 (segfault in apache2handler with apache 2.4) Fix bug #68819 (Fileinfo on specific file causes spurious OOM and/or segfault) ... Conflicts: Zend/zend_exceptions.c ext/curl/interface.c ext/dom/document.c ext/fileinfo/libmagic/softmagic.c ext/gd/gd.c ext/hash/hash.c ext/pgsql/pgsql.c ext/phar/phar.c ext/phar/phar_internal.h ext/standard/http_fopen_wrapper.c ext/standard/link.c ext/standard/streamsfuncs.c ext/xmlwriter/php_xmlwriter.c ext/zlib/zlib.c
2230 lines
51 KiB
C
2230 lines
51 KiB
C
/*
|
|
* Copyright (c) Ian F. Darwin 1986-1995.
|
|
* Software written by Ian F. Darwin and others;
|
|
* maintained 1995-present by Christos Zoulas and others.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice immediately at the beginning of the file, without modification,
|
|
* this list of conditions, and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
|
|
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
/*
|
|
* softmagic - interpret variable magic from MAGIC
|
|
*/
|
|
|
|
#include "file.h"
|
|
|
|
#ifndef lint
|
|
FILE_RCSID("@(#)$File: softmagic.c,v 1.212 2015/01/24 22:11:25 christos Exp $")
|
|
#endif /* lint */
|
|
|
|
#include "magic.h"
|
|
#include <string.h>
|
|
#include <ctype.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
#if defined(HAVE_LOCALE_H)
|
|
#include <locale.h>
|
|
#endif
|
|
|
|
#ifndef PREG_OFFSET_CAPTURE
|
|
# define PREG_OFFSET_CAPTURE (1<<8)
|
|
#endif
|
|
|
|
|
|
|
|
private int match(struct magic_set *, struct magic *, uint32_t,
|
|
const unsigned char *, size_t, size_t, int, int, int, uint16_t,
|
|
uint16_t *, int *, int *, int *);
|
|
private int mget(struct magic_set *, const unsigned char *,
|
|
struct magic *, size_t, size_t, unsigned int, int, int, int, uint16_t,
|
|
uint16_t *, int *, int *, int *);
|
|
private int magiccheck(struct magic_set *, struct magic *);
|
|
private int32_t mprint(struct magic_set *, struct magic *);
|
|
private int32_t moffset(struct magic_set *, struct magic *);
|
|
private void mdebug(uint32_t, const char *, size_t);
|
|
private int mcopy(struct magic_set *, union VALUETYPE *, int, int,
|
|
const unsigned char *, uint32_t, size_t, struct magic *);
|
|
private int mconvert(struct magic_set *, struct magic *, int);
|
|
private int print_sep(struct magic_set *, int);
|
|
private int handle_annotation(struct magic_set *, struct magic *);
|
|
private void cvt_8(union VALUETYPE *, const struct magic *);
|
|
private void cvt_16(union VALUETYPE *, const struct magic *);
|
|
private void cvt_32(union VALUETYPE *, const struct magic *);
|
|
private void cvt_64(union VALUETYPE *, const struct magic *);
|
|
|
|
#define OFFSET_OOB(n, o, i) ((n) < (o) || (i) > ((n) - (o)))
|
|
|
|
/*
|
|
* softmagic - lookup one file in parsed, in-memory copy of database
|
|
* Passed the name and FILE * of one file to be typed.
|
|
*/
|
|
/*ARGSUSED1*/ /* nbytes passed for regularity, maybe need later */
|
|
protected int
|
|
file_softmagic(struct magic_set *ms, const unsigned char *buf, size_t nbytes,
|
|
uint16_t indir_level, uint16_t *name_count, int mode, int text)
|
|
{
|
|
struct mlist *ml;
|
|
int rv, printed_something = 0, need_separator = 0;
|
|
uint16_t nc;
|
|
|
|
if (name_count == NULL) {
|
|
nc = 0;
|
|
name_count = &nc;
|
|
}
|
|
|
|
for (ml = ms->mlist[0]->next; ml != ms->mlist[0]; ml = ml->next)
|
|
if ((rv = match(ms, ml->magic, ml->nmagic, buf, nbytes, 0, mode,
|
|
text, 0, indir_level, name_count,
|
|
&printed_something, &need_separator, NULL)) != 0)
|
|
return rv;
|
|
|
|
return 0;
|
|
}
|
|
|
|
|
|
#if defined(FILE_FMTDEBUG) && defined(HAVE_FMTCHECK)
|
|
#define F(a, b, c) file_fmtcheck((a), (b), (c), __FILE__, __LINE__)
|
|
|
|
private const char * __attribute__((__format_arg__(3)))
|
|
file_fmtcheck(struct magic_set *ms, const struct magic *m, const char *def,
|
|
const char *file, size_t line)
|
|
{
|
|
const char *ptr = fmtcheck(m->desc, def);
|
|
if (ptr == def)
|
|
file_magerror(ms,
|
|
"%s, %" SIZE_T_FORMAT "u: format `%s' does not match"
|
|
" with `%s'", file, line, m->desc, def);
|
|
return ptr;
|
|
}
|
|
#elif defined(HAVE_FMTCHECK)
|
|
#define F(a, b, c) fmtcheck((b)->desc, (c))
|
|
#else
|
|
#define F(a, b, c) ((b)->desc)
|
|
#endif
|
|
|
|
/*
|
|
* Go through the whole list, stopping if you find a match. Process all
|
|
* the continuations of that match before returning.
|
|
*
|
|
* We support multi-level continuations:
|
|
*
|
|
* At any time when processing a successful top-level match, there is a
|
|
* current continuation level; it represents the level of the last
|
|
* successfully matched continuation.
|
|
*
|
|
* Continuations above that level are skipped as, if we see one, it
|
|
* means that the continuation that controls them - i.e, the
|
|
* lower-level continuation preceding them - failed to match.
|
|
*
|
|
* Continuations below that level are processed as, if we see one,
|
|
* it means we've finished processing or skipping higher-level
|
|
* continuations under the control of a successful or unsuccessful
|
|
* lower-level continuation, and are now seeing the next lower-level
|
|
* continuation and should process it. The current continuation
|
|
* level reverts to the level of the one we're seeing.
|
|
*
|
|
* Continuations at the current level are processed as, if we see
|
|
* one, there's no lower-level continuation that may have failed.
|
|
*
|
|
* If a continuation matches, we bump the current continuation level
|
|
* so that higher-level continuations are processed.
|
|
*/
|
|
private int
|
|
match(struct magic_set *ms, struct magic *magic, uint32_t nmagic,
|
|
const unsigned char *s, size_t nbytes, size_t offset, int mode, int text,
|
|
int flip, uint16_t indir_level, uint16_t *name_count,
|
|
int *printed_something, int *need_separator, int *returnval)
|
|
{
|
|
uint32_t magindex = 0;
|
|
unsigned int cont_level = 0;
|
|
int returnvalv = 0, e; /* if a match is found it is set to 1*/
|
|
int firstline = 1; /* a flag to print X\n X\n- X */
|
|
int print = (ms->flags & (MAGIC_MIME|MAGIC_APPLE)) == 0;
|
|
|
|
if (returnval == NULL)
|
|
returnval = &returnvalv;
|
|
|
|
if (file_check_mem(ms, cont_level) == -1)
|
|
return -1;
|
|
|
|
for (magindex = 0; magindex < nmagic; magindex++) {
|
|
int flush = 0;
|
|
struct magic *m = &magic[magindex];
|
|
|
|
if (m->type != FILE_NAME)
|
|
if ((IS_LIBMAGIC_STRING(m->type) &&
|
|
#define FLT (STRING_BINTEST | STRING_TEXTTEST)
|
|
((text && (m->str_flags & FLT) == STRING_BINTEST) ||
|
|
(!text && (m->str_flags & FLT) == STRING_TEXTTEST))) ||
|
|
(m->flag & mode) != mode) {
|
|
/* Skip sub-tests */
|
|
while (magindex + 1 < nmagic &&
|
|
magic[magindex + 1].cont_level != 0 &&
|
|
++magindex)
|
|
continue;
|
|
continue; /* Skip to next top-level test*/
|
|
}
|
|
|
|
ms->offset = m->offset;
|
|
ms->line = m->lineno;
|
|
|
|
/* if main entry matches, print it... */
|
|
switch (mget(ms, s, m, nbytes, offset, cont_level, mode, text,
|
|
flip, indir_level, name_count,
|
|
printed_something, need_separator, returnval)) {
|
|
case -1:
|
|
return -1;
|
|
case 0:
|
|
flush = m->reln != '!';
|
|
break;
|
|
default:
|
|
if (m->type == FILE_INDIRECT)
|
|
*returnval = 1;
|
|
|
|
switch (magiccheck(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 0:
|
|
flush++;
|
|
break;
|
|
default:
|
|
flush = 0;
|
|
break;
|
|
}
|
|
break;
|
|
}
|
|
if (flush) {
|
|
/*
|
|
* main entry didn't match,
|
|
* flush its continuations
|
|
*/
|
|
while (magindex < nmagic - 1 &&
|
|
magic[magindex + 1].cont_level != 0)
|
|
magindex++;
|
|
continue;
|
|
}
|
|
|
|
if ((e = handle_annotation(ms, m)) != 0) {
|
|
*need_separator = 1;
|
|
*printed_something = 1;
|
|
*returnval = 1;
|
|
return e;
|
|
}
|
|
/*
|
|
* If we are going to print something, we'll need to print
|
|
* a blank before we print something else.
|
|
*/
|
|
if (*m->desc) {
|
|
*need_separator = 1;
|
|
*printed_something = 1;
|
|
if (print_sep(ms, firstline) == -1)
|
|
return -1;
|
|
}
|
|
|
|
|
|
if (print && mprint(ms, m) == -1)
|
|
return -1;
|
|
|
|
ms->c.li[cont_level].off = moffset(ms, m);
|
|
|
|
/* and any continuations that match */
|
|
if (file_check_mem(ms, ++cont_level) == -1)
|
|
return -1;
|
|
|
|
while (magindex + 1 < nmagic &&
|
|
magic[magindex + 1].cont_level != 0) {
|
|
m = &magic[++magindex];
|
|
ms->line = m->lineno; /* for messages */
|
|
|
|
if (cont_level < m->cont_level)
|
|
continue;
|
|
if (cont_level > m->cont_level) {
|
|
/*
|
|
* We're at the end of the level
|
|
* "cont_level" continuations.
|
|
*/
|
|
cont_level = m->cont_level;
|
|
}
|
|
ms->offset = m->offset;
|
|
if (m->flag & OFFADD) {
|
|
ms->offset +=
|
|
ms->c.li[cont_level - 1].off;
|
|
}
|
|
|
|
#ifdef ENABLE_CONDITIONALS
|
|
if (m->cond == COND_ELSE ||
|
|
m->cond == COND_ELIF) {
|
|
if (ms->c.li[cont_level].last_match == 1)
|
|
continue;
|
|
}
|
|
#endif
|
|
switch (mget(ms, s, m, nbytes, offset, cont_level, mode,
|
|
text, flip, indir_level, name_count,
|
|
printed_something, need_separator, returnval)) {
|
|
case -1:
|
|
return -1;
|
|
case 0:
|
|
if (m->reln != '!')
|
|
continue;
|
|
flush = 1;
|
|
break;
|
|
default:
|
|
if (m->type == FILE_INDIRECT)
|
|
*returnval = 1;
|
|
flush = 0;
|
|
break;
|
|
}
|
|
|
|
switch (flush ? 1 : magiccheck(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 0:
|
|
#ifdef ENABLE_CONDITIONALS
|
|
ms->c.li[cont_level].last_match = 0;
|
|
#endif
|
|
break;
|
|
default:
|
|
#ifdef ENABLE_CONDITIONALS
|
|
ms->c.li[cont_level].last_match = 1;
|
|
#endif
|
|
if (m->type == FILE_CLEAR)
|
|
ms->c.li[cont_level].got_match = 0;
|
|
else if (ms->c.li[cont_level].got_match) {
|
|
if (m->type == FILE_DEFAULT)
|
|
break;
|
|
} else
|
|
ms->c.li[cont_level].got_match = 1;
|
|
if ((e = handle_annotation(ms, m)) != 0) {
|
|
*need_separator = 1;
|
|
*printed_something = 1;
|
|
*returnval = 1;
|
|
return e;
|
|
}
|
|
/*
|
|
* If we are going to print something,
|
|
* make sure that we have a separator first.
|
|
*/
|
|
if (*m->desc) {
|
|
if (!*printed_something) {
|
|
*printed_something = 1;
|
|
if (print_sep(ms, firstline)
|
|
== -1)
|
|
return -1;
|
|
}
|
|
}
|
|
/*
|
|
* This continuation matched. Print
|
|
* its message, with a blank before it
|
|
* if the previous item printed and
|
|
* this item isn't empty.
|
|
*/
|
|
/* space if previous printed */
|
|
if (*need_separator
|
|
&& ((m->flag & NOSPACE) == 0)
|
|
&& *m->desc) {
|
|
if (print &&
|
|
file_printf(ms, " ") == -1)
|
|
return -1;
|
|
*need_separator = 0;
|
|
}
|
|
if (print && mprint(ms, m) == -1)
|
|
return -1;
|
|
|
|
ms->c.li[cont_level].off = moffset(ms, m);
|
|
|
|
if (*m->desc)
|
|
*need_separator = 1;
|
|
|
|
/*
|
|
* If we see any continuations
|
|
* at a higher level,
|
|
* process them.
|
|
*/
|
|
if (file_check_mem(ms, ++cont_level) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
}
|
|
if (*printed_something) {
|
|
firstline = 0;
|
|
if (print)
|
|
*returnval = 1;
|
|
}
|
|
if ((ms->flags & MAGIC_CONTINUE) == 0 && *printed_something) {
|
|
return *returnval; /* don't keep searching */
|
|
}
|
|
cont_level = 0;
|
|
}
|
|
return *returnval; /* This is hit if -k is set or there is no match */
|
|
}
|
|
|
|
private int
|
|
check_fmt(struct magic_set *ms, struct magic *m)
|
|
{
|
|
pcre *pce;
|
|
int re_options, rv = -1;
|
|
pcre_extra *re_extra;
|
|
zend_string *pattern;
|
|
|
|
if (strchr(m->desc, '%') == NULL)
|
|
return 0;
|
|
|
|
(void)setlocale(LC_CTYPE, "C");
|
|
pattern = zend_string_init("~%[-0-9.]*s~", sizeof("~%[-0-9.]*s~") - 1, 0);
|
|
if ((pce = pcre_get_compiled_regex(pattern, &re_extra, &re_options)) == NULL) {
|
|
rv = -1;
|
|
} else {
|
|
rv = !pcre_exec(pce, re_extra, m->desc, strlen(m->desc), 0, re_options, NULL, 0);
|
|
}
|
|
zend_string_release(pattern);
|
|
(void)setlocale(LC_CTYPE, "");
|
|
return rv;
|
|
}
|
|
|
|
private int32_t
|
|
mprint(struct magic_set *ms, struct magic *m)
|
|
{
|
|
uint64_t v;
|
|
float vf;
|
|
double vd;
|
|
int64_t t = 0;
|
|
char buf[128], tbuf[26], sbuf[512];
|
|
union VALUETYPE *p = &ms->ms_value;
|
|
|
|
switch (m->type) {
|
|
case FILE_BYTE:
|
|
v = file_signextend(ms, m, (uint64_t)p->b);
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%d",
|
|
(unsigned char)v);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%d"),
|
|
(unsigned char) v) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(char);
|
|
break;
|
|
|
|
case FILE_SHORT:
|
|
case FILE_BESHORT:
|
|
case FILE_LESHORT:
|
|
v = file_signextend(ms, m, (uint64_t)p->h);
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%u",
|
|
(unsigned short)v);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%u"),
|
|
(unsigned short) v) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(short);
|
|
break;
|
|
|
|
case FILE_LONG:
|
|
case FILE_BELONG:
|
|
case FILE_LELONG:
|
|
case FILE_MELONG:
|
|
v = file_signextend(ms, m, (uint64_t)p->l);
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%u", (uint32_t) v);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%u"), (uint32_t) v) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(int32_t);
|
|
break;
|
|
|
|
case FILE_QUAD:
|
|
case FILE_BEQUAD:
|
|
case FILE_LEQUAD:
|
|
v = file_signextend(ms, m, p->q);
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%" INT64_T_FORMAT "u",
|
|
(unsigned long long)v);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%" INT64_T_FORMAT "u"),
|
|
(unsigned long long) v) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(int64_t);
|
|
break;
|
|
|
|
case FILE_STRING:
|
|
case FILE_PSTRING:
|
|
case FILE_BESTRING16:
|
|
case FILE_LESTRING16:
|
|
if (m->reln == '=' || m->reln == '!') {
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_printable(sbuf, sizeof(sbuf), m->value.s))
|
|
== -1)
|
|
return -1;
|
|
t = ms->offset + m->vallen;
|
|
}
|
|
else {
|
|
char *str = p->s;
|
|
|
|
/* compute t before we mangle the string? */
|
|
t = ms->offset + strlen(str);
|
|
|
|
if (*m->value.s == '\0')
|
|
str[strcspn(str, "\r\n")] = '\0';
|
|
|
|
if (m->str_flags & STRING_TRIM) {
|
|
char *last;
|
|
while (isspace((unsigned char)*str))
|
|
str++;
|
|
last = str;
|
|
while (*last)
|
|
last++;
|
|
--last;
|
|
while (isspace((unsigned char)*last))
|
|
last--;
|
|
*++last = '\0';
|
|
}
|
|
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_printable(sbuf, sizeof(sbuf), str)) == -1)
|
|
return -1;
|
|
|
|
if (m->type == FILE_PSTRING)
|
|
t += file_pstring_length_size(m);
|
|
}
|
|
break;
|
|
|
|
case FILE_DATE:
|
|
case FILE_BEDATE:
|
|
case FILE_LEDATE:
|
|
case FILE_MEDATE:
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_fmttime(p->l, 0, tbuf)) == -1)
|
|
return -1;
|
|
t = ms->offset + sizeof(uint32_t);
|
|
break;
|
|
|
|
case FILE_LDATE:
|
|
case FILE_BELDATE:
|
|
case FILE_LELDATE:
|
|
case FILE_MELDATE:
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_fmttime(p->l, FILE_T_LOCAL, tbuf)) == -1)
|
|
return -1;
|
|
t = ms->offset + sizeof(uint32_t);
|
|
break;
|
|
|
|
case FILE_QDATE:
|
|
case FILE_BEQDATE:
|
|
case FILE_LEQDATE:
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_fmttime(p->q, 0, tbuf)) == -1)
|
|
return -1;
|
|
t = ms->offset + sizeof(uint64_t);
|
|
break;
|
|
|
|
case FILE_QLDATE:
|
|
case FILE_BEQLDATE:
|
|
case FILE_LEQLDATE:
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_fmttime(p->q, FILE_T_LOCAL, tbuf)) == -1)
|
|
return -1;
|
|
t = ms->offset + sizeof(uint64_t);
|
|
break;
|
|
|
|
case FILE_QWDATE:
|
|
case FILE_BEQWDATE:
|
|
case FILE_LEQWDATE:
|
|
if (file_printf(ms, F(ms, m, "%s"),
|
|
file_fmttime(p->q, FILE_T_WINDOWS, tbuf)) == -1)
|
|
return -1;
|
|
t = ms->offset + sizeof(uint64_t);
|
|
break;
|
|
|
|
case FILE_FLOAT:
|
|
case FILE_BEFLOAT:
|
|
case FILE_LEFLOAT:
|
|
vf = p->f;
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%g", vf);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%g"), vf) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(float);
|
|
break;
|
|
|
|
case FILE_DOUBLE:
|
|
case FILE_BEDOUBLE:
|
|
case FILE_LEDOUBLE:
|
|
vd = p->d;
|
|
switch (check_fmt(ms, m)) {
|
|
case -1:
|
|
return -1;
|
|
case 1:
|
|
(void)snprintf(buf, sizeof(buf), "%g", vd);
|
|
if (file_printf(ms, F(ms, m, "%s"), buf) == -1)
|
|
return -1;
|
|
break;
|
|
default:
|
|
if (file_printf(ms, F(ms, m, "%g"), vd) == -1)
|
|
return -1;
|
|
break;
|
|
}
|
|
t = ms->offset + sizeof(double);
|
|
break;
|
|
|
|
case FILE_SEARCH:
|
|
case FILE_REGEX: {
|
|
char *cp;
|
|
int rval;
|
|
|
|
cp = estrndup((const char *)ms->search.s, ms->search.rm_len);
|
|
if (cp == NULL) {
|
|
file_oomem(ms, ms->search.rm_len);
|
|
return -1;
|
|
}
|
|
rval = file_printf(ms, F(ms, m, "%s"),
|
|
file_printable(sbuf, sizeof(sbuf), cp));
|
|
efree(cp);
|
|
|
|
if (rval == -1)
|
|
return -1;
|
|
|
|
if ((m->str_flags & REGEX_OFFSET_START))
|
|
t = ms->search.offset;
|
|
else
|
|
t = ms->search.offset + ms->search.rm_len;
|
|
break;
|
|
}
|
|
|
|
case FILE_DEFAULT:
|
|
case FILE_CLEAR:
|
|
if (file_printf(ms, "%s", m->desc) == -1)
|
|
return -1;
|
|
t = ms->offset;
|
|
break;
|
|
|
|
case FILE_INDIRECT:
|
|
case FILE_USE:
|
|
case FILE_NAME:
|
|
t = ms->offset;
|
|
break;
|
|
|
|
default:
|
|
file_magerror(ms, "invalid m->type (%d) in mprint()", m->type);
|
|
return -1;
|
|
}
|
|
return (int32_t)t;
|
|
}
|
|
|
|
private int32_t
|
|
moffset(struct magic_set *ms, struct magic *m)
|
|
{
|
|
switch (m->type) {
|
|
case FILE_BYTE:
|
|
return CAST(int32_t, (ms->offset + sizeof(char)));
|
|
|
|
case FILE_SHORT:
|
|
case FILE_BESHORT:
|
|
case FILE_LESHORT:
|
|
return CAST(int32_t, (ms->offset + sizeof(short)));
|
|
|
|
case FILE_LONG:
|
|
case FILE_BELONG:
|
|
case FILE_LELONG:
|
|
case FILE_MELONG:
|
|
return CAST(int32_t, (ms->offset + sizeof(int32_t)));
|
|
|
|
case FILE_QUAD:
|
|
case FILE_BEQUAD:
|
|
case FILE_LEQUAD:
|
|
return CAST(int32_t, (ms->offset + sizeof(int64_t)));
|
|
|
|
case FILE_STRING:
|
|
case FILE_PSTRING:
|
|
case FILE_BESTRING16:
|
|
case FILE_LESTRING16:
|
|
if (m->reln == '=' || m->reln == '!')
|
|
return ms->offset + m->vallen;
|
|
else {
|
|
union VALUETYPE *p = &ms->ms_value;
|
|
uint32_t t;
|
|
|
|
if (*m->value.s == '\0')
|
|
p->s[strcspn(p->s, "\r\n")] = '\0';
|
|
t = CAST(uint32_t, (ms->offset + strlen(p->s)));
|
|
if (m->type == FILE_PSTRING)
|
|
t += (uint32_t)file_pstring_length_size(m);
|
|
return t;
|
|
}
|
|
|
|
case FILE_DATE:
|
|
case FILE_BEDATE:
|
|
case FILE_LEDATE:
|
|
case FILE_MEDATE:
|
|
return CAST(int32_t, (ms->offset + sizeof(uint32_t)));
|
|
|
|
case FILE_LDATE:
|
|
case FILE_BELDATE:
|
|
case FILE_LELDATE:
|
|
case FILE_MELDATE:
|
|
return CAST(int32_t, (ms->offset + sizeof(uint32_t)));
|
|
|
|
case FILE_QDATE:
|
|
case FILE_BEQDATE:
|
|
case FILE_LEQDATE:
|
|
return CAST(int32_t, (ms->offset + sizeof(uint64_t)));
|
|
|
|
case FILE_QLDATE:
|
|
case FILE_BEQLDATE:
|
|
case FILE_LEQLDATE:
|
|
return CAST(int32_t, (ms->offset + sizeof(uint64_t)));
|
|
|
|
case FILE_FLOAT:
|
|
case FILE_BEFLOAT:
|
|
case FILE_LEFLOAT:
|
|
return CAST(int32_t, (ms->offset + sizeof(float)));
|
|
|
|
case FILE_DOUBLE:
|
|
case FILE_BEDOUBLE:
|
|
case FILE_LEDOUBLE:
|
|
return CAST(int32_t, (ms->offset + sizeof(double)));
|
|
|
|
case FILE_REGEX:
|
|
if ((m->str_flags & REGEX_OFFSET_START) != 0)
|
|
return CAST(int32_t, ms->search.offset);
|
|
else
|
|
return CAST(int32_t, (ms->search.offset +
|
|
ms->search.rm_len));
|
|
|
|
case FILE_SEARCH:
|
|
if ((m->str_flags & REGEX_OFFSET_START) != 0)
|
|
return CAST(int32_t, ms->search.offset);
|
|
else
|
|
return CAST(int32_t, (ms->search.offset + m->vallen));
|
|
|
|
case FILE_CLEAR:
|
|
case FILE_DEFAULT:
|
|
case FILE_INDIRECT:
|
|
return ms->offset;
|
|
|
|
default:
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
private int
|
|
cvt_flip(int type, int flip)
|
|
{
|
|
if (flip == 0)
|
|
return type;
|
|
switch (type) {
|
|
case FILE_BESHORT:
|
|
return FILE_LESHORT;
|
|
case FILE_BELONG:
|
|
return FILE_LELONG;
|
|
case FILE_BEDATE:
|
|
return FILE_LEDATE;
|
|
case FILE_BELDATE:
|
|
return FILE_LELDATE;
|
|
case FILE_BEQUAD:
|
|
return FILE_LEQUAD;
|
|
case FILE_BEQDATE:
|
|
return FILE_LEQDATE;
|
|
case FILE_BEQLDATE:
|
|
return FILE_LEQLDATE;
|
|
case FILE_BEQWDATE:
|
|
return FILE_LEQWDATE;
|
|
case FILE_LESHORT:
|
|
return FILE_BESHORT;
|
|
case FILE_LELONG:
|
|
return FILE_BELONG;
|
|
case FILE_LEDATE:
|
|
return FILE_BEDATE;
|
|
case FILE_LELDATE:
|
|
return FILE_BELDATE;
|
|
case FILE_LEQUAD:
|
|
return FILE_BEQUAD;
|
|
case FILE_LEQDATE:
|
|
return FILE_BEQDATE;
|
|
case FILE_LEQLDATE:
|
|
return FILE_BEQLDATE;
|
|
case FILE_LEQWDATE:
|
|
return FILE_BEQWDATE;
|
|
case FILE_BEFLOAT:
|
|
return FILE_LEFLOAT;
|
|
case FILE_LEFLOAT:
|
|
return FILE_BEFLOAT;
|
|
case FILE_BEDOUBLE:
|
|
return FILE_LEDOUBLE;
|
|
case FILE_LEDOUBLE:
|
|
return FILE_BEDOUBLE;
|
|
default:
|
|
return type;
|
|
}
|
|
}
|
|
#define DO_CVT(fld, cast) \
|
|
if (m->num_mask) \
|
|
switch (m->mask_op & FILE_OPS_MASK) { \
|
|
case FILE_OPAND: \
|
|
p->fld &= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPOR: \
|
|
p->fld |= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPXOR: \
|
|
p->fld ^= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPADD: \
|
|
p->fld += cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPMINUS: \
|
|
p->fld -= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPMULTIPLY: \
|
|
p->fld *= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPDIVIDE: \
|
|
p->fld /= cast m->num_mask; \
|
|
break; \
|
|
case FILE_OPMODULO: \
|
|
p->fld %= cast m->num_mask; \
|
|
break; \
|
|
} \
|
|
if (m->mask_op & FILE_OPINVERSE) \
|
|
p->fld = ~p->fld \
|
|
|
|
private void
|
|
cvt_8(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT(b, (uint8_t));
|
|
}
|
|
|
|
private void
|
|
cvt_16(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT(h, (uint16_t));
|
|
}
|
|
|
|
private void
|
|
cvt_32(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT(l, (uint32_t));
|
|
}
|
|
|
|
private void
|
|
cvt_64(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT(q, (uint64_t));
|
|
}
|
|
|
|
#define DO_CVT2(fld, cast) \
|
|
if (m->num_mask) \
|
|
switch (m->mask_op & FILE_OPS_MASK) { \
|
|
case FILE_OPADD: \
|
|
p->fld += cast (int64_t)m->num_mask; \
|
|
break; \
|
|
case FILE_OPMINUS: \
|
|
p->fld -= cast (int64_t)m->num_mask; \
|
|
break; \
|
|
case FILE_OPMULTIPLY: \
|
|
p->fld *= cast (int64_t)m->num_mask; \
|
|
break; \
|
|
case FILE_OPDIVIDE: \
|
|
p->fld /= cast (int64_t)m->num_mask; \
|
|
break; \
|
|
} \
|
|
|
|
private void
|
|
cvt_float(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT2(f, (float));
|
|
}
|
|
|
|
private void
|
|
cvt_double(union VALUETYPE *p, const struct magic *m)
|
|
{
|
|
DO_CVT2(d, (double));
|
|
}
|
|
|
|
/*
|
|
* Convert the byte order of the data we are looking at
|
|
* While we're here, let's apply the mask operation
|
|
* (unless you have a better idea)
|
|
*/
|
|
private int
|
|
mconvert(struct magic_set *ms, struct magic *m, int flip)
|
|
{
|
|
union VALUETYPE *p = &ms->ms_value;
|
|
uint8_t type;
|
|
|
|
switch (type = cvt_flip(m->type, flip)) {
|
|
case FILE_BYTE:
|
|
cvt_8(p, m);
|
|
return 1;
|
|
case FILE_SHORT:
|
|
cvt_16(p, m);
|
|
return 1;
|
|
case FILE_LONG:
|
|
case FILE_DATE:
|
|
case FILE_LDATE:
|
|
cvt_32(p, m);
|
|
return 1;
|
|
case FILE_QUAD:
|
|
case FILE_QDATE:
|
|
case FILE_QLDATE:
|
|
case FILE_QWDATE:
|
|
cvt_64(p, m);
|
|
return 1;
|
|
case FILE_STRING:
|
|
case FILE_BESTRING16:
|
|
case FILE_LESTRING16: {
|
|
/* Null terminate and eat *trailing* return */
|
|
p->s[sizeof(p->s) - 1] = '\0';
|
|
return 1;
|
|
}
|
|
case FILE_PSTRING: {
|
|
size_t sz = file_pstring_length_size(m);
|
|
char *ptr1 = p->s, *ptr2 = ptr1 + sz;
|
|
size_t len = file_pstring_get_length(m, ptr1);
|
|
sz = sizeof(p->s) - sz; /* maximum length of string */
|
|
if (len >= sz) {
|
|
/*
|
|
* The size of the pascal string length (sz)
|
|
* is 1, 2, or 4. We need at least 1 byte for NUL
|
|
* termination, but we've already truncated the
|
|
* string by p->s, so we need to deduct sz.
|
|
* Because we can use one of the bytes of the length
|
|
* after we shifted as NUL termination.
|
|
*/
|
|
len = sz;
|
|
}
|
|
while (len--)
|
|
*ptr1++ = *ptr2++;
|
|
*ptr1 = '\0';
|
|
return 1;
|
|
}
|
|
case FILE_BESHORT:
|
|
p->h = (short)((p->hs[0]<<8)|(p->hs[1]));
|
|
cvt_16(p, m);
|
|
return 1;
|
|
case FILE_BELONG:
|
|
case FILE_BEDATE:
|
|
case FILE_BELDATE:
|
|
p->l = (int32_t)
|
|
((p->hl[0]<<24)|(p->hl[1]<<16)|(p->hl[2]<<8)|(p->hl[3]));
|
|
cvt_32(p, m);
|
|
return 1;
|
|
case FILE_BEQUAD:
|
|
case FILE_BEQDATE:
|
|
case FILE_BEQLDATE:
|
|
case FILE_BEQWDATE:
|
|
p->q = (uint64_t)
|
|
(((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
|
|
((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
|
|
((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
|
|
((uint64_t)p->hq[6]<<8)|((uint64_t)p->hq[7]));
|
|
cvt_64(p, m);
|
|
return 1;
|
|
case FILE_LESHORT:
|
|
p->h = (short)((p->hs[1]<<8)|(p->hs[0]));
|
|
cvt_16(p, m);
|
|
return 1;
|
|
case FILE_LELONG:
|
|
case FILE_LEDATE:
|
|
case FILE_LELDATE:
|
|
p->l = (int32_t)
|
|
((p->hl[3]<<24)|(p->hl[2]<<16)|(p->hl[1]<<8)|(p->hl[0]));
|
|
cvt_32(p, m);
|
|
return 1;
|
|
case FILE_LEQUAD:
|
|
case FILE_LEQDATE:
|
|
case FILE_LEQLDATE:
|
|
case FILE_LEQWDATE:
|
|
p->q = (uint64_t)
|
|
(((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
|
|
((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
|
|
((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
|
|
((uint64_t)p->hq[1]<<8)|((uint64_t)p->hq[0]));
|
|
cvt_64(p, m);
|
|
return 1;
|
|
case FILE_MELONG:
|
|
case FILE_MEDATE:
|
|
case FILE_MELDATE:
|
|
p->l = (int32_t)
|
|
((p->hl[1]<<24)|(p->hl[0]<<16)|(p->hl[3]<<8)|(p->hl[2]));
|
|
cvt_32(p, m);
|
|
return 1;
|
|
case FILE_FLOAT:
|
|
cvt_float(p, m);
|
|
return 1;
|
|
case FILE_BEFLOAT:
|
|
p->l = ((uint32_t)p->hl[0]<<24)|((uint32_t)p->hl[1]<<16)|
|
|
((uint32_t)p->hl[2]<<8) |((uint32_t)p->hl[3]);
|
|
cvt_float(p, m);
|
|
return 1;
|
|
case FILE_LEFLOAT:
|
|
p->l = ((uint32_t)p->hl[3]<<24)|((uint32_t)p->hl[2]<<16)|
|
|
((uint32_t)p->hl[1]<<8) |((uint32_t)p->hl[0]);
|
|
cvt_float(p, m);
|
|
return 1;
|
|
case FILE_DOUBLE:
|
|
cvt_double(p, m);
|
|
return 1;
|
|
case FILE_BEDOUBLE:
|
|
p->q = ((uint64_t)p->hq[0]<<56)|((uint64_t)p->hq[1]<<48)|
|
|
((uint64_t)p->hq[2]<<40)|((uint64_t)p->hq[3]<<32)|
|
|
((uint64_t)p->hq[4]<<24)|((uint64_t)p->hq[5]<<16)|
|
|
((uint64_t)p->hq[6]<<8) |((uint64_t)p->hq[7]);
|
|
cvt_double(p, m);
|
|
return 1;
|
|
case FILE_LEDOUBLE:
|
|
p->q = ((uint64_t)p->hq[7]<<56)|((uint64_t)p->hq[6]<<48)|
|
|
((uint64_t)p->hq[5]<<40)|((uint64_t)p->hq[4]<<32)|
|
|
((uint64_t)p->hq[3]<<24)|((uint64_t)p->hq[2]<<16)|
|
|
((uint64_t)p->hq[1]<<8) |((uint64_t)p->hq[0]);
|
|
cvt_double(p, m);
|
|
return 1;
|
|
case FILE_REGEX:
|
|
case FILE_SEARCH:
|
|
case FILE_DEFAULT:
|
|
case FILE_CLEAR:
|
|
case FILE_NAME:
|
|
case FILE_USE:
|
|
return 1;
|
|
default:
|
|
file_magerror(ms, "invalid type %d in mconvert()", m->type);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
|
|
private void
|
|
mdebug(uint32_t offset, const char *str, size_t len)
|
|
{
|
|
(void) fprintf(stderr, "mget/%" SIZE_T_FORMAT "u @%d: ", len, offset);
|
|
file_showstr(stderr, str, len);
|
|
(void) fputc('\n', stderr);
|
|
(void) fputc('\n', stderr);
|
|
}
|
|
|
|
private int
|
|
mcopy(struct magic_set *ms, union VALUETYPE *p, int type, int indir,
|
|
const unsigned char *s, uint32_t offset, size_t nbytes, struct magic *m)
|
|
{
|
|
/*
|
|
* Note: FILE_SEARCH and FILE_REGEX do not actually copy
|
|
* anything, but setup pointers into the source
|
|
*/
|
|
if (indir == 0) {
|
|
switch (type) {
|
|
case FILE_SEARCH:
|
|
ms->search.s = RCAST(const char *, s) + offset;
|
|
ms->search.s_len = nbytes - offset;
|
|
ms->search.offset = offset;
|
|
return 0;
|
|
|
|
case FILE_REGEX: {
|
|
const char *b;
|
|
const char *c;
|
|
const char *last; /* end of search region */
|
|
const char *buf; /* start of search region */
|
|
const char *end;
|
|
size_t lines, linecnt, bytecnt;
|
|
|
|
if (s == NULL) {
|
|
ms->search.s_len = 0;
|
|
ms->search.s = NULL;
|
|
return 0;
|
|
}
|
|
|
|
/* bytecnt checks are to be kept for PHP, see cve-2014-3538.
|
|
PCRE might get stuck if the input buffer is too big. */
|
|
linecnt = m->str_range;
|
|
bytecnt = linecnt * 80;
|
|
|
|
if (bytecnt == 0) {
|
|
bytecnt = 1 << 14;
|
|
}
|
|
|
|
if (bytecnt > nbytes) {
|
|
bytecnt = nbytes;
|
|
}
|
|
if (offset > bytecnt) {
|
|
offset = bytecnt;
|
|
}
|
|
if (s == NULL) {
|
|
ms->search.s_len = 0;
|
|
ms->search.s = NULL;
|
|
return 0;
|
|
}
|
|
buf = RCAST(const char *, s) + offset;
|
|
end = last = RCAST(const char *, s) + bytecnt;
|
|
/* mget() guarantees buf <= last */
|
|
for (lines = linecnt, b = buf; lines && b < end &&
|
|
((b = CAST(const char *,
|
|
memchr(c = b, '\n', CAST(size_t, (end - b)))))
|
|
|| (b = CAST(const char *,
|
|
memchr(c, '\r', CAST(size_t, (end - c))))));
|
|
lines--, b++) {
|
|
last = b;
|
|
if (b[0] == '\r' && b[1] == '\n')
|
|
b++;
|
|
}
|
|
if (lines)
|
|
last = RCAST(const char *, s) + bytecnt;
|
|
|
|
ms->search.s = buf;
|
|
ms->search.s_len = last - buf;
|
|
ms->search.offset = offset;
|
|
ms->search.rm_len = 0;
|
|
return 0;
|
|
}
|
|
case FILE_BESTRING16:
|
|
case FILE_LESTRING16: {
|
|
const unsigned char *src = s + offset;
|
|
const unsigned char *esrc = s + nbytes;
|
|
char *dst = p->s;
|
|
char *edst = &p->s[sizeof(p->s) - 1];
|
|
|
|
if (type == FILE_BESTRING16)
|
|
src++;
|
|
|
|
/* check that offset is within range */
|
|
if (offset >= nbytes)
|
|
break;
|
|
for (/*EMPTY*/; src < esrc; src += 2, dst++) {
|
|
if (dst < edst)
|
|
*dst = *src;
|
|
else
|
|
break;
|
|
if (*dst == '\0') {
|
|
if (type == FILE_BESTRING16 ?
|
|
*(src - 1) != '\0' :
|
|
*(src + 1) != '\0')
|
|
*dst = ' ';
|
|
}
|
|
}
|
|
*edst = '\0';
|
|
return 0;
|
|
}
|
|
case FILE_STRING: /* XXX - these two should not need */
|
|
case FILE_PSTRING: /* to copy anything, but do anyway. */
|
|
default:
|
|
break;
|
|
}
|
|
}
|
|
|
|
if (offset >= nbytes) {
|
|
(void)memset(p, '\0', sizeof(*p));
|
|
return 0;
|
|
}
|
|
if (nbytes - offset < sizeof(*p))
|
|
nbytes = nbytes - offset;
|
|
else
|
|
nbytes = sizeof(*p);
|
|
|
|
(void)memcpy(p, s + offset, nbytes);
|
|
|
|
/*
|
|
* the usefulness of padding with zeroes eludes me, it
|
|
* might even cause problems
|
|
*/
|
|
if (nbytes < sizeof(*p))
|
|
(void)memset(((char *)(void *)p) + nbytes, '\0',
|
|
sizeof(*p) - nbytes);
|
|
return 0;
|
|
}
|
|
|
|
private int
|
|
mget(struct magic_set *ms, const unsigned char *s, struct magic *m,
|
|
size_t nbytes, size_t o, unsigned int cont_level, int mode, int text,
|
|
int flip, uint16_t indir_level, uint16_t *name_count,
|
|
int *printed_something, int *need_separator, int *returnval)
|
|
{
|
|
uint32_t offset = ms->offset;
|
|
uint32_t lhs;
|
|
file_pushbuf_t *pb;
|
|
int rv, oneed_separator, in_type;
|
|
char *rbuf;
|
|
union VALUETYPE *p = &ms->ms_value;
|
|
struct mlist ml;
|
|
|
|
if (indir_level >= ms->indir_max) {
|
|
file_error(ms, 0, "indirect recursion nesting (%hu) exceeded",
|
|
indir_level);
|
|
return -1;
|
|
}
|
|
|
|
if (*name_count >= ms->name_max) {
|
|
file_error(ms, 0, "name use count (%hu) exceeded",
|
|
*name_count);
|
|
return -1;
|
|
}
|
|
|
|
if (mcopy(ms, p, m->type, m->flag & INDIR, s, (uint32_t)(offset + o),
|
|
(uint32_t)nbytes, m) == -1)
|
|
return -1;
|
|
|
|
if ((ms->flags & MAGIC_DEBUG) != 0) {
|
|
fprintf(stderr, "mget(type=%d, flag=%x, offset=%u, o=%"
|
|
SIZE_T_FORMAT "u, " "nbytes=%" SIZE_T_FORMAT
|
|
"u, il=%hu, nc=%hu)\n",
|
|
m->type, m->flag, offset, o, nbytes,
|
|
indir_level, *name_count);
|
|
mdebug(offset, (char *)(void *)p, sizeof(union VALUETYPE));
|
|
}
|
|
|
|
if (m->flag & INDIR) {
|
|
int off = m->in_offset;
|
|
if (m->in_op & FILE_OPINDIRECT) {
|
|
const union VALUETYPE *q = CAST(const union VALUETYPE *,
|
|
((const void *)(s + offset + off)));
|
|
switch (cvt_flip(m->in_type, flip)) {
|
|
case FILE_BYTE:
|
|
off = q->b;
|
|
break;
|
|
case FILE_SHORT:
|
|
off = q->h;
|
|
break;
|
|
case FILE_BESHORT:
|
|
off = (short)((q->hs[0]<<8)|(q->hs[1]));
|
|
break;
|
|
case FILE_LESHORT:
|
|
off = (short)((q->hs[1]<<8)|(q->hs[0]));
|
|
break;
|
|
case FILE_LONG:
|
|
off = q->l;
|
|
break;
|
|
case FILE_BELONG:
|
|
case FILE_BEID3:
|
|
off = (int32_t)((q->hl[0]<<24)|(q->hl[1]<<16)|
|
|
(q->hl[2]<<8)|(q->hl[3]));
|
|
break;
|
|
case FILE_LEID3:
|
|
case FILE_LELONG:
|
|
off = (int32_t)((q->hl[3]<<24)|(q->hl[2]<<16)|
|
|
(q->hl[1]<<8)|(q->hl[0]));
|
|
break;
|
|
case FILE_MELONG:
|
|
off = (int32_t)((q->hl[1]<<24)|(q->hl[0]<<16)|
|
|
(q->hl[3]<<8)|(q->hl[2]));
|
|
break;
|
|
}
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
fprintf(stderr, "indirect offs=%u\n", off);
|
|
}
|
|
switch (in_type = cvt_flip(m->in_type, flip)) {
|
|
case FILE_BYTE:
|
|
if (OFFSET_OOB(nbytes, offset, 1))
|
|
return 0;
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = p->b & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = p->b | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = p->b ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = p->b + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = p->b - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = p->b * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = p->b / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = p->b % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = p->b;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_BESHORT:
|
|
if (OFFSET_OOB(nbytes, offset, 2))
|
|
return 0;
|
|
lhs = (p->hs[0] << 8) | p->hs[1];
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = lhs & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = lhs | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = lhs ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = lhs + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = lhs - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = lhs * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = lhs / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = lhs % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = lhs;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_LESHORT:
|
|
if (OFFSET_OOB(nbytes, offset, 2))
|
|
return 0;
|
|
lhs = (p->hs[1] << 8) | p->hs[0];
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = lhs & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = lhs | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = lhs ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = lhs + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = lhs - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = lhs * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = lhs / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = lhs % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = lhs;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_SHORT:
|
|
if (OFFSET_OOB(nbytes, offset, 2))
|
|
return 0;
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = p->h & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = p->h | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = p->h ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = p->h + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = p->h - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = p->h * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = p->h / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = p->h % off;
|
|
break;
|
|
}
|
|
}
|
|
else
|
|
offset = p->h;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_BELONG:
|
|
case FILE_BEID3:
|
|
if (OFFSET_OOB(nbytes, offset, 4))
|
|
return 0;
|
|
lhs = (p->hl[0] << 24) | (p->hl[1] << 16) |
|
|
(p->hl[2] << 8) | p->hl[3];
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = lhs & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = lhs | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = lhs ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = lhs + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = lhs - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = lhs * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = lhs / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = lhs % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = lhs;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_LELONG:
|
|
case FILE_LEID3:
|
|
if (OFFSET_OOB(nbytes, offset, 4))
|
|
return 0;
|
|
lhs = (p->hl[3] << 24) | (p->hl[2] << 16) |
|
|
(p->hl[1] << 8) | p->hl[0];
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = lhs & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = lhs | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = lhs ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = lhs + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = lhs - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = lhs * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = lhs / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = lhs % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = lhs;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_MELONG:
|
|
if (OFFSET_OOB(nbytes, offset, 4))
|
|
return 0;
|
|
lhs = (p->hl[1] << 24) | (p->hl[0] << 16) |
|
|
(p->hl[3] << 8) | p->hl[2];
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = lhs & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = lhs | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = lhs ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = lhs + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = lhs - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = lhs * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = lhs / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = lhs % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = lhs;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
case FILE_LONG:
|
|
if (OFFSET_OOB(nbytes, offset, 4))
|
|
return 0;
|
|
if (off) {
|
|
switch (m->in_op & FILE_OPS_MASK) {
|
|
case FILE_OPAND:
|
|
offset = p->l & off;
|
|
break;
|
|
case FILE_OPOR:
|
|
offset = p->l | off;
|
|
break;
|
|
case FILE_OPXOR:
|
|
offset = p->l ^ off;
|
|
break;
|
|
case FILE_OPADD:
|
|
offset = p->l + off;
|
|
break;
|
|
case FILE_OPMINUS:
|
|
offset = p->l - off;
|
|
break;
|
|
case FILE_OPMULTIPLY:
|
|
offset = p->l * off;
|
|
break;
|
|
case FILE_OPDIVIDE:
|
|
offset = p->l / off;
|
|
break;
|
|
case FILE_OPMODULO:
|
|
offset = p->l % off;
|
|
break;
|
|
}
|
|
} else
|
|
offset = p->l;
|
|
if (m->in_op & FILE_OPINVERSE)
|
|
offset = ~offset;
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
switch (in_type) {
|
|
case FILE_LEID3:
|
|
case FILE_BEID3:
|
|
offset = ((((offset >> 0) & 0x7f) << 0) |
|
|
(((offset >> 8) & 0x7f) << 7) |
|
|
(((offset >> 16) & 0x7f) << 14) |
|
|
(((offset >> 24) & 0x7f) << 21));
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
fprintf(stderr, "id3 offs=%u\n", offset);
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if (m->flag & INDIROFFADD) {
|
|
offset += ms->c.li[cont_level-1].off;
|
|
if (offset == 0) {
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
fprintf(stderr,
|
|
"indirect *zero* offset\n");
|
|
return 0;
|
|
}
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
fprintf(stderr, "indirect +offs=%u\n", offset);
|
|
}
|
|
if (mcopy(ms, p, m->type, 0, s, offset, nbytes, m) == -1)
|
|
return -1;
|
|
ms->offset = offset;
|
|
|
|
if ((ms->flags & MAGIC_DEBUG) != 0) {
|
|
mdebug(offset, (char *)(void *)p,
|
|
sizeof(union VALUETYPE));
|
|
}
|
|
}
|
|
|
|
/* Verify we have enough data to match magic type */
|
|
switch (m->type) {
|
|
case FILE_BYTE:
|
|
if (OFFSET_OOB(nbytes, offset, 1))
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_SHORT:
|
|
case FILE_BESHORT:
|
|
case FILE_LESHORT:
|
|
if (OFFSET_OOB(nbytes, offset, 2))
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_LONG:
|
|
case FILE_BELONG:
|
|
case FILE_LELONG:
|
|
case FILE_MELONG:
|
|
case FILE_DATE:
|
|
case FILE_BEDATE:
|
|
case FILE_LEDATE:
|
|
case FILE_MEDATE:
|
|
case FILE_LDATE:
|
|
case FILE_BELDATE:
|
|
case FILE_LELDATE:
|
|
case FILE_MELDATE:
|
|
case FILE_FLOAT:
|
|
case FILE_BEFLOAT:
|
|
case FILE_LEFLOAT:
|
|
if (OFFSET_OOB(nbytes, offset, 4))
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_DOUBLE:
|
|
case FILE_BEDOUBLE:
|
|
case FILE_LEDOUBLE:
|
|
if (OFFSET_OOB(nbytes, offset, 8))
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_STRING:
|
|
case FILE_PSTRING:
|
|
case FILE_SEARCH:
|
|
if (OFFSET_OOB(nbytes, offset, m->vallen))
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_REGEX:
|
|
if (nbytes < offset)
|
|
return 0;
|
|
break;
|
|
|
|
case FILE_INDIRECT:
|
|
if (m->str_flags & INDIRECT_RELATIVE)
|
|
offset += CAST(uint32_t, o);
|
|
if (offset == 0)
|
|
return 0;
|
|
|
|
if (nbytes < offset)
|
|
return 0;
|
|
|
|
if ((pb = file_push_buffer(ms)) == NULL)
|
|
return -1;
|
|
|
|
rv = file_softmagic(ms, s + offset, nbytes - offset,
|
|
indir_level + 1, name_count, BINTEST, text);
|
|
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
fprintf(stderr, "indirect @offs=%u[%d]\n", offset, rv);
|
|
|
|
rbuf = file_pop_buffer(ms, pb);
|
|
if (rbuf == NULL && ms->event_flags & EVENT_HAD_ERR)
|
|
return -1;
|
|
|
|
if (rv == 1) {
|
|
if ((ms->flags & (MAGIC_MIME|MAGIC_APPLE)) == 0 &&
|
|
file_printf(ms, F(ms, m, "%u"), offset) == -1) {
|
|
if (rbuf) efree(rbuf);
|
|
return -1;
|
|
}
|
|
if (file_printf(ms, "%s", rbuf) == -1) {
|
|
if (rbuf) efree(rbuf);
|
|
return -1;
|
|
}
|
|
}
|
|
if (rbuf) efree(rbuf);
|
|
return rv;
|
|
|
|
case FILE_USE:
|
|
if (nbytes < offset)
|
|
return 0;
|
|
rbuf = m->value.s;
|
|
if (*rbuf == '^') {
|
|
rbuf++;
|
|
flip = !flip;
|
|
}
|
|
if (file_magicfind(ms, rbuf, &ml) == -1) {
|
|
file_error(ms, 0, "cannot find entry `%s'", rbuf);
|
|
return -1;
|
|
}
|
|
(*name_count)++;
|
|
oneed_separator = *need_separator;
|
|
if (m->flag & NOSPACE)
|
|
*need_separator = 0;
|
|
rv = match(ms, ml.magic, ml.nmagic, s, nbytes, offset + o,
|
|
mode, text, flip, indir_level, name_count,
|
|
printed_something, need_separator, returnval);
|
|
if (rv != 1)
|
|
*need_separator = oneed_separator;
|
|
return rv;
|
|
|
|
case FILE_NAME:
|
|
if (file_printf(ms, "%s", m->desc) == -1)
|
|
return -1;
|
|
return 1;
|
|
case FILE_DEFAULT: /* nothing to check */
|
|
case FILE_CLEAR:
|
|
default:
|
|
break;
|
|
}
|
|
if (!mconvert(ms, m, flip))
|
|
return 0;
|
|
return 1;
|
|
}
|
|
|
|
private uint64_t
|
|
file_strncmp(const char *s1, const char *s2, size_t len, uint32_t flags)
|
|
{
|
|
/*
|
|
* Convert the source args to unsigned here so that (1) the
|
|
* compare will be unsigned as it is in strncmp() and (2) so
|
|
* the ctype functions will work correctly without extra
|
|
* casting.
|
|
*/
|
|
const unsigned char *a = (const unsigned char *)s1;
|
|
const unsigned char *b = (const unsigned char *)s2;
|
|
uint64_t v;
|
|
|
|
/*
|
|
* What we want here is v = strncmp(s1, s2, len),
|
|
* but ignoring any nulls.
|
|
*/
|
|
v = 0;
|
|
if (0L == flags) { /* normal string: do it fast */
|
|
while (len-- > 0)
|
|
if ((v = *b++ - *a++) != '\0')
|
|
break;
|
|
}
|
|
else { /* combine the others */
|
|
while (len-- > 0) {
|
|
if ((flags & STRING_IGNORE_LOWERCASE) &&
|
|
islower(*a)) {
|
|
if ((v = tolower(*b++) - *a++) != '\0')
|
|
break;
|
|
}
|
|
else if ((flags & STRING_IGNORE_UPPERCASE) &&
|
|
isupper(*a)) {
|
|
if ((v = toupper(*b++) - *a++) != '\0')
|
|
break;
|
|
}
|
|
else if ((flags & STRING_COMPACT_WHITESPACE) &&
|
|
isspace(*a)) {
|
|
a++;
|
|
if (isspace(*b++)) {
|
|
if (!isspace(*a))
|
|
while (isspace(*b))
|
|
b++;
|
|
}
|
|
else {
|
|
v = 1;
|
|
break;
|
|
}
|
|
}
|
|
else if ((flags & STRING_COMPACT_OPTIONAL_WHITESPACE) &&
|
|
isspace(*a)) {
|
|
a++;
|
|
while (isspace(*b))
|
|
b++;
|
|
}
|
|
else {
|
|
if ((v = *b++ - *a++) != '\0')
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
return v;
|
|
}
|
|
|
|
private uint64_t
|
|
file_strncmp16(const char *a, const char *b, size_t len, uint32_t flags)
|
|
{
|
|
/*
|
|
* XXX - The 16-bit string compare probably needs to be done
|
|
* differently, especially if the flags are to be supported.
|
|
* At the moment, I am unsure.
|
|
*/
|
|
flags = 0;
|
|
return file_strncmp(a, b, len, flags);
|
|
}
|
|
|
|
public void
|
|
convert_libmagic_pattern(zval *pattern, char *val, int len, int options)
|
|
{
|
|
int i, j=0;
|
|
zend_string *t;
|
|
|
|
t = zend_string_alloc(len * 2 + 4, 0);
|
|
|
|
t->val[j++] = '~';
|
|
|
|
for (i = 0; i < len; i++, j++) {
|
|
switch (val[i]) {
|
|
case '~':
|
|
t->val[j++] = '\\';
|
|
t->val[j] = '~';
|
|
break;
|
|
default:
|
|
t->val[j] = val[i];
|
|
break;
|
|
}
|
|
}
|
|
t->val[j++] = '~';
|
|
|
|
if (options & PCRE_CASELESS)
|
|
t->val[j++] = 'i';
|
|
|
|
if (options & PCRE_MULTILINE)
|
|
t->val[j++] = 'm';
|
|
|
|
t->val[j]='\0';
|
|
t->len = j;
|
|
|
|
ZVAL_NEW_STR(pattern, t);
|
|
}
|
|
|
|
private int
|
|
magiccheck(struct magic_set *ms, struct magic *m)
|
|
{
|
|
uint64_t l = m->value.q;
|
|
uint64_t v;
|
|
float fl, fv;
|
|
double dl, dv;
|
|
int matched;
|
|
union VALUETYPE *p = &ms->ms_value;
|
|
|
|
switch (m->type) {
|
|
case FILE_BYTE:
|
|
v = p->b;
|
|
break;
|
|
|
|
case FILE_SHORT:
|
|
case FILE_BESHORT:
|
|
case FILE_LESHORT:
|
|
v = p->h;
|
|
break;
|
|
|
|
case FILE_LONG:
|
|
case FILE_BELONG:
|
|
case FILE_LELONG:
|
|
case FILE_MELONG:
|
|
case FILE_DATE:
|
|
case FILE_BEDATE:
|
|
case FILE_LEDATE:
|
|
case FILE_MEDATE:
|
|
case FILE_LDATE:
|
|
case FILE_BELDATE:
|
|
case FILE_LELDATE:
|
|
case FILE_MELDATE:
|
|
v = p->l;
|
|
break;
|
|
|
|
case FILE_QUAD:
|
|
case FILE_LEQUAD:
|
|
case FILE_BEQUAD:
|
|
case FILE_QDATE:
|
|
case FILE_BEQDATE:
|
|
case FILE_LEQDATE:
|
|
case FILE_QLDATE:
|
|
case FILE_BEQLDATE:
|
|
case FILE_LEQLDATE:
|
|
case FILE_QWDATE:
|
|
case FILE_BEQWDATE:
|
|
case FILE_LEQWDATE:
|
|
v = p->q;
|
|
break;
|
|
|
|
case FILE_FLOAT:
|
|
case FILE_BEFLOAT:
|
|
case FILE_LEFLOAT:
|
|
fl = m->value.f;
|
|
fv = p->f;
|
|
switch (m->reln) {
|
|
case 'x':
|
|
matched = 1;
|
|
break;
|
|
|
|
case '!':
|
|
matched = fv != fl;
|
|
break;
|
|
|
|
case '=':
|
|
matched = fv == fl;
|
|
break;
|
|
|
|
case '>':
|
|
matched = fv > fl;
|
|
break;
|
|
|
|
case '<':
|
|
matched = fv < fl;
|
|
break;
|
|
|
|
default:
|
|
file_magerror(ms, "cannot happen with float: invalid relation `%c'",
|
|
m->reln);
|
|
return -1;
|
|
}
|
|
return matched;
|
|
|
|
case FILE_DOUBLE:
|
|
case FILE_BEDOUBLE:
|
|
case FILE_LEDOUBLE:
|
|
dl = m->value.d;
|
|
dv = p->d;
|
|
switch (m->reln) {
|
|
case 'x':
|
|
matched = 1;
|
|
break;
|
|
|
|
case '!':
|
|
matched = dv != dl;
|
|
break;
|
|
|
|
case '=':
|
|
matched = dv == dl;
|
|
break;
|
|
|
|
case '>':
|
|
matched = dv > dl;
|
|
break;
|
|
|
|
case '<':
|
|
matched = dv < dl;
|
|
break;
|
|
|
|
default:
|
|
file_magerror(ms, "cannot happen with double: invalid relation `%c'", m->reln);
|
|
return -1;
|
|
}
|
|
return matched;
|
|
|
|
case FILE_DEFAULT:
|
|
case FILE_CLEAR:
|
|
l = 0;
|
|
v = 0;
|
|
break;
|
|
|
|
case FILE_STRING:
|
|
case FILE_PSTRING:
|
|
l = 0;
|
|
v = file_strncmp(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
|
|
break;
|
|
|
|
case FILE_BESTRING16:
|
|
case FILE_LESTRING16:
|
|
l = 0;
|
|
v = file_strncmp16(m->value.s, p->s, (size_t)m->vallen, m->str_flags);
|
|
break;
|
|
|
|
case FILE_SEARCH: { /* search ms->search.s for the string m->value.s */
|
|
size_t slen;
|
|
size_t idx;
|
|
|
|
if (ms->search.s == NULL)
|
|
return 0;
|
|
|
|
slen = MIN(m->vallen, sizeof(m->value.s));
|
|
l = 0;
|
|
v = 0;
|
|
|
|
for (idx = 0; m->str_range == 0 || idx < m->str_range; idx++) {
|
|
if (slen + idx > ms->search.s_len)
|
|
break;
|
|
|
|
v = file_strncmp(m->value.s, ms->search.s + idx, slen,
|
|
m->str_flags);
|
|
if (v == 0) { /* found match */
|
|
ms->search.offset += idx;
|
|
ms->search.rm_len = m->str_range - idx;
|
|
break;
|
|
}
|
|
}
|
|
break;
|
|
}
|
|
case FILE_REGEX: {
|
|
zval pattern;
|
|
int options = 0;
|
|
pcre_cache_entry *pce;
|
|
|
|
options |= PCRE_MULTILINE;
|
|
|
|
if (m->str_flags & STRING_IGNORE_CASE) {
|
|
options |= PCRE_CASELESS;
|
|
}
|
|
|
|
convert_libmagic_pattern(&pattern, (char *)m->value.s, m->vallen, options);
|
|
|
|
l = v = 0;
|
|
if ((pce = pcre_get_compiled_regex_cache(Z_STR(pattern))) == NULL) {
|
|
zval_ptr_dtor(&pattern);
|
|
return -1;
|
|
} else {
|
|
/* pce now contains the compiled regex */
|
|
zval retval;
|
|
zval subpats;
|
|
char *haystack;
|
|
|
|
ZVAL_NULL(&retval);
|
|
ZVAL_NULL(&subpats);
|
|
|
|
/* Cut the search len from haystack, equals to REG_STARTEND */
|
|
haystack = estrndup(ms->search.s, ms->search.s_len);
|
|
|
|
/* match v = 0, no match v = 1 */
|
|
php_pcre_match_impl(pce, haystack, ms->search.s_len, &retval, &subpats, 1, 1, PREG_OFFSET_CAPTURE, 0);
|
|
/* Free haystack */
|
|
efree(haystack);
|
|
|
|
if (Z_LVAL(retval) < 0) {
|
|
zval_ptr_dtor(&subpats);
|
|
zval_ptr_dtor(&pattern);
|
|
return -1;
|
|
} else if ((Z_LVAL(retval) > 0) && (Z_TYPE(subpats) == IS_ARRAY)) {
|
|
/* Need to fetch global match which equals pmatch[0] */
|
|
zval *pzval;
|
|
HashTable *ht = Z_ARRVAL(subpats);
|
|
zval *pattern_match = NULL, *pattern_offset = NULL;
|
|
int first = 1, inner_first;
|
|
|
|
ZEND_HASH_FOREACH_VAL(ht, pzval) {
|
|
HashTable *inner_ht;
|
|
zval *match, *offset;
|
|
zval tmpcopy, matchcopy, offsetcopy;
|
|
|
|
if (first) {
|
|
first = 0;
|
|
continue;
|
|
}
|
|
ZVAL_DUP(&tmpcopy, pzval);
|
|
|
|
inner_ht = Z_ARRVAL(tmpcopy);
|
|
|
|
/* If everything goes according to the master plan
|
|
tmpcopy now contains two elements:
|
|
0 = the match
|
|
1 = starting position of the match */
|
|
inner_first = 1;
|
|
ZEND_HASH_FOREACH_VAL(inner_ht, match) {
|
|
if (inner_first) {
|
|
inner_first = 0;
|
|
continue;
|
|
}
|
|
ZVAL_DUP(&matchcopy, match);
|
|
convert_to_string(&matchcopy);
|
|
pattern_match = &matchcopy;
|
|
} ZEND_HASH_FOREACH_END();
|
|
|
|
inner_first = 1;
|
|
ZEND_HASH_FOREACH_VAL(inner_ht, offset) {
|
|
if (inner_first) {
|
|
inner_first = 0;
|
|
continue;
|
|
}
|
|
ZVAL_DUP(&offsetcopy, offset);
|
|
convert_to_long(&offsetcopy);
|
|
pattern_offset = &offsetcopy;
|
|
} ZEND_HASH_FOREACH_END();
|
|
|
|
zval_dtor(&tmpcopy);
|
|
|
|
if ((pattern_match != NULL) && (pattern_offset != NULL)) {
|
|
ms->search.s += Z_LVAL_P(pattern_offset); /* this is where the match starts */
|
|
ms->search.offset += Z_LVAL_P(pattern_offset); /* this is where the match starts as size_t */
|
|
ms->search.rm_len = Z_STRLEN_P(pattern_match) /* This is the length of the matched pattern */;
|
|
v = 0;
|
|
|
|
zval_ptr_dtor(pattern_match);
|
|
zval_ptr_dtor(pattern_offset);
|
|
} else {
|
|
zval_ptr_dtor(&subpats);
|
|
zval_ptr_dtor(&pattern);
|
|
return -1;
|
|
}
|
|
} ZEND_HASH_FOREACH_END();
|
|
} else {
|
|
v = 1;
|
|
}
|
|
zval_ptr_dtor(&subpats);
|
|
zval_ptr_dtor(&pattern);
|
|
}
|
|
break;
|
|
}
|
|
case FILE_INDIRECT:
|
|
case FILE_USE:
|
|
case FILE_NAME:
|
|
return 1;
|
|
default:
|
|
file_magerror(ms, "invalid type %d in magiccheck()", m->type);
|
|
return -1;
|
|
}
|
|
|
|
v = file_signextend(ms, m, v);
|
|
|
|
switch (m->reln) {
|
|
case 'x':
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT
|
|
"u == *any* = 1\n", (unsigned long long)v);
|
|
matched = 1;
|
|
break;
|
|
|
|
case '!':
|
|
matched = v != l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT "u != %"
|
|
INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
|
|
(unsigned long long)l, matched);
|
|
break;
|
|
|
|
case '=':
|
|
matched = v == l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT "u == %"
|
|
INT64_T_FORMAT "u = %d\n", (unsigned long long)v,
|
|
(unsigned long long)l, matched);
|
|
break;
|
|
|
|
case '>':
|
|
if (m->flag & UNSIGNED) {
|
|
matched = v > l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT
|
|
"u > %" INT64_T_FORMAT "u = %d\n",
|
|
(unsigned long long)v,
|
|
(unsigned long long)l, matched);
|
|
}
|
|
else {
|
|
matched = (int64_t) v > (int64_t) l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT
|
|
"d > %" INT64_T_FORMAT "d = %d\n",
|
|
(long long)v, (long long)l, matched);
|
|
}
|
|
break;
|
|
|
|
case '<':
|
|
if (m->flag & UNSIGNED) {
|
|
matched = v < l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT
|
|
"u < %" INT64_T_FORMAT "u = %d\n",
|
|
(unsigned long long)v,
|
|
(unsigned long long)l, matched);
|
|
}
|
|
else {
|
|
matched = (int64_t) v < (int64_t) l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "%" INT64_T_FORMAT
|
|
"d < %" INT64_T_FORMAT "d = %d\n",
|
|
(long long)v, (long long)l, matched);
|
|
}
|
|
break;
|
|
|
|
case '&':
|
|
matched = (v & l) == l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
|
|
INT64_T_FORMAT "x) == %" INT64_T_FORMAT
|
|
"x) = %d\n", (unsigned long long)v,
|
|
(unsigned long long)l, (unsigned long long)l,
|
|
matched);
|
|
break;
|
|
|
|
case '^':
|
|
matched = (v & l) != l;
|
|
if ((ms->flags & MAGIC_DEBUG) != 0)
|
|
(void) fprintf(stderr, "((%" INT64_T_FORMAT "x & %"
|
|
INT64_T_FORMAT "x) != %" INT64_T_FORMAT
|
|
"x) = %d\n", (unsigned long long)v,
|
|
(unsigned long long)l, (unsigned long long)l,
|
|
matched);
|
|
break;
|
|
|
|
default:
|
|
file_magerror(ms, "cannot happen: invalid relation `%c'",
|
|
m->reln);
|
|
return -1;
|
|
}
|
|
|
|
return matched;
|
|
}
|
|
|
|
private int
|
|
handle_annotation(struct magic_set *ms, struct magic *m)
|
|
{
|
|
if (ms->flags & MAGIC_APPLE) {
|
|
if (file_printf(ms, "%.8s", m->apple) == -1)
|
|
return -1;
|
|
return 1;
|
|
}
|
|
if ((ms->flags & MAGIC_MIME_TYPE) && m->mimetype[0]) {
|
|
if (file_printf(ms, "%s", m->mimetype) == -1)
|
|
return -1;
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
private int
|
|
print_sep(struct magic_set *ms, int firstline)
|
|
{
|
|
if (ms->flags & MAGIC_MIME)
|
|
return 0;
|
|
if (firstline)
|
|
return 0;
|
|
/*
|
|
* we found another match
|
|
* put a newline and '-' to do some simple formatting
|
|
*/
|
|
return file_printf(ms, "\n- ");
|
|
}
|