2004-08-09 08:45:41 +00:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
1994-09-03 19:16:28 +00:00
|
|
|
/*
|
|
|
|
* apprentice - make one pass through /etc/magic, learning its secrets.
|
|
|
|
*/
|
|
|
|
|
2001-07-30 03:09:46 +00:00
|
|
|
#include "file.h"
|
2004-08-09 08:45:41 +00:00
|
|
|
#include "magic.h"
|
1994-09-03 19:16:28 +00:00
|
|
|
#include <stdlib.h>
|
2001-10-08 22:50:54 +00:00
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
1994-09-03 19:16:28 +00:00
|
|
|
#include <string.h>
|
2007-05-24 16:12:23 +00:00
|
|
|
#include <assert.h>
|
1994-09-03 19:16:28 +00:00
|
|
|
#include <ctype.h>
|
2001-03-25 18:37:04 +00:00
|
|
|
#include <fcntl.h>
|
2004-08-09 08:45:41 +00:00
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/param.h>
|
2002-09-16 05:54:26 +00:00
|
|
|
#ifdef QUICK
|
2001-03-25 18:37:04 +00:00
|
|
|
#include <sys/mman.h>
|
|
|
|
#endif
|
1994-09-03 19:16:28 +00:00
|
|
|
|
|
|
|
#ifndef lint
|
2007-05-24 16:12:23 +00:00
|
|
|
FILE_RCSID("@(#)$Id: apprentice.c,v 1.100 2006/12/11 21:48:49 christos Exp $")
|
1994-09-03 19:16:28 +00:00
|
|
|
#endif /* lint */
|
|
|
|
|
|
|
|
#define EATAB {while (isascii((unsigned char) *l) && \
|
|
|
|
isspace((unsigned char) *l)) ++l;}
|
1996-01-23 12:29:07 +00:00
|
|
|
#define LOWCASE(l) (isupper((unsigned char) (l)) ? \
|
|
|
|
tolower((unsigned char) (l)) : (l))
|
2001-04-25 07:41:21 +00:00
|
|
|
/*
|
|
|
|
* Work around a bug in headers on Digital Unix.
|
|
|
|
* At least confirmed for: OSF1 V4.0 878
|
|
|
|
*/
|
|
|
|
#if defined(__osf__) && defined(__DECC)
|
|
|
|
#ifdef MAP_FAILED
|
|
|
|
#undef MAP_FAILED
|
|
|
|
#endif
|
|
|
|
#endif
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2001-04-25 07:41:21 +00:00
|
|
|
#ifndef MAP_FAILED
|
|
|
|
#define MAP_FAILED (void *) -1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef MAP_FILE
|
|
|
|
#define MAP_FILE 0
|
|
|
|
#endif
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
#ifndef MAXPATHLEN
|
|
|
|
#define MAXPATHLEN 1024
|
2000-11-05 08:33:55 +00:00
|
|
|
#endif
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
#define IS_PLAINSTRING(t) ((t) == FILE_STRING || (t) == FILE_PSTRING || \
|
2004-12-28 04:31:47 +00:00
|
|
|
(t) == FILE_BESTRING16 || (t) == FILE_LESTRING16)
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
#define IS_STRING(t) (IS_PLAINSTRING(t) || (t) == FILE_REGEX || \
|
|
|
|
(t) == FILE_SEARCH)
|
|
|
|
|
|
|
|
struct magic_entry {
|
|
|
|
struct magic *mp;
|
|
|
|
uint32_t cont_count;
|
|
|
|
uint32_t max_count;
|
|
|
|
};
|
2004-12-28 04:31:47 +00:00
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
const int file_formats[] = { FILE_FORMAT_STRING };
|
|
|
|
const size_t file_nformats = sizeof(file_formats) / sizeof(file_formats[0]);
|
|
|
|
const char *file_names[] = { FILE_FORMAT_NAME };
|
|
|
|
const size_t file_nnames = sizeof(file_names) / sizeof(file_names[0]);
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
private int getvalue(struct magic_set *ms, struct magic *, const char **);
|
2004-08-09 08:45:41 +00:00
|
|
|
private int hextoint(int);
|
2006-06-19 07:52:15 +00:00
|
|
|
private const char *getstr(struct magic_set *, const char *, char *, int,
|
|
|
|
int *);
|
|
|
|
private int parse(struct magic_set *, struct magic_entry **, uint32_t *,
|
2007-05-24 16:12:23 +00:00
|
|
|
const char *, size_t, int);
|
2006-06-19 07:52:15 +00:00
|
|
|
private void eatsize(const char **);
|
2004-08-09 08:45:41 +00:00
|
|
|
private int apprentice_1(struct magic_set *, const char *, int, struct mlist *);
|
2006-06-19 07:52:15 +00:00
|
|
|
private size_t apprentice_magic_strength(const struct magic *);
|
|
|
|
private int apprentice_sort(const void *, const void *);
|
2004-08-09 08:45:41 +00:00
|
|
|
private int apprentice_file(struct magic_set *, struct magic **, uint32_t *,
|
|
|
|
const char *, int);
|
|
|
|
private void byteswap(struct magic *, uint32_t);
|
|
|
|
private void bs1(struct magic *);
|
|
|
|
private uint16_t swap2(uint16_t);
|
|
|
|
private uint32_t swap4(uint32_t);
|
2007-05-24 16:12:23 +00:00
|
|
|
private uint64_t swap8(uint64_t);
|
2004-12-28 04:31:47 +00:00
|
|
|
private char *mkdbname(const char *, char *, size_t, int);
|
2004-08-09 08:45:41 +00:00
|
|
|
private int apprentice_map(struct magic_set *, struct magic **, uint32_t *,
|
|
|
|
const char *);
|
|
|
|
private int apprentice_compile(struct magic_set *, struct magic **, uint32_t *,
|
|
|
|
const char *);
|
2007-05-24 16:12:23 +00:00
|
|
|
private int check_format_type(const char *, int);
|
2004-12-28 04:31:47 +00:00
|
|
|
private int check_format(struct magic_set *, struct magic *);
|
2004-08-09 08:45:41 +00:00
|
|
|
|
|
|
|
private size_t maxmagic = 0;
|
|
|
|
private size_t magicsize = sizeof(struct magic);
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
|
2001-07-30 03:09:46 +00:00
|
|
|
#ifdef COMPILE_ONLY
|
|
|
|
|
2002-09-16 05:54:26 +00:00
|
|
|
int main(int, char *[]);
|
2001-07-30 03:09:46 +00:00
|
|
|
|
|
|
|
int
|
2002-09-16 05:54:26 +00:00
|
|
|
main(int argc, char *argv[])
|
2001-07-30 03:09:46 +00:00
|
|
|
{
|
|
|
|
int ret;
|
2004-08-09 08:45:41 +00:00
|
|
|
struct magic_set *ms;
|
|
|
|
char *progname;
|
2001-07-30 03:09:46 +00:00
|
|
|
|
|
|
|
if ((progname = strrchr(argv[0], '/')) != NULL)
|
|
|
|
progname++;
|
|
|
|
else
|
|
|
|
progname = argv[0];
|
|
|
|
|
|
|
|
if (argc != 2) {
|
2004-08-09 08:45:41 +00:00
|
|
|
(void)fprintf(stderr, "Usage: %s file\n", progname);
|
|
|
|
return 1;
|
2001-07-30 03:09:46 +00:00
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if ((ms = magic_open(MAGIC_CHECK)) == NULL) {
|
|
|
|
(void)fprintf(stderr, "%s: %s\n", progname, strerror(errno));
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0;
|
|
|
|
if (ret == 1)
|
|
|
|
(void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms));
|
|
|
|
magic_close(ms);
|
|
|
|
return ret;
|
2001-07-30 03:09:46 +00:00
|
|
|
}
|
|
|
|
#endif /* COMPILE_ONLY */
|
|
|
|
|
2001-03-25 18:37:04 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle one file.
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
|
|
|
apprentice_1(struct magic_set *ms, const char *fn, int action,
|
|
|
|
struct mlist *mlist)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
|
|
|
struct magic *magic = NULL;
|
2002-09-16 05:54:26 +00:00
|
|
|
uint32_t nmagic = 0;
|
2001-03-25 18:37:04 +00:00
|
|
|
struct mlist *ml;
|
|
|
|
int rv = -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
int mapped;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (magicsize != FILE_MAGICSIZE) {
|
|
|
|
file_error(ms, 0, "magic element size %lu != %lu",
|
|
|
|
(unsigned long)sizeof(*magic),
|
|
|
|
(unsigned long)FILE_MAGICSIZE);
|
|
|
|
return -1;
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
|
|
|
|
if (action == FILE_COMPILE) {
|
|
|
|
rv = apprentice_file(ms, &magic, &nmagic, fn, action);
|
|
|
|
if (rv != 0)
|
|
|
|
return -1;
|
|
|
|
rv = apprentice_compile(ms, &magic, &nmagic, fn);
|
|
|
|
free(magic);
|
2001-03-25 18:37:04 +00:00
|
|
|
return rv;
|
2004-08-09 08:45:41 +00:00
|
|
|
}
|
2006-06-19 07:52:15 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
#ifndef COMPILE_ONLY
|
|
|
|
if ((rv = apprentice_map(ms, &magic, &nmagic, fn)) == -1) {
|
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms, "using regular magic file `%s'", fn);
|
2004-08-09 08:45:41 +00:00
|
|
|
rv = apprentice_file(ms, &magic, &nmagic, fn, action);
|
|
|
|
if (rv != 0)
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
mapped = 0;
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
mapped = rv;
|
|
|
|
|
|
|
|
if (magic == NULL || nmagic == 0) {
|
|
|
|
file_delmagic(magic, mapped, nmagic);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((ml = malloc(sizeof(*ml))) == NULL) {
|
|
|
|
file_delmagic(magic, mapped, nmagic);
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(*ml));
|
2004-08-09 08:45:41 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2001-03-25 18:37:04 +00:00
|
|
|
|
|
|
|
ml->magic = magic;
|
|
|
|
ml->nmagic = nmagic;
|
2004-08-09 08:45:41 +00:00
|
|
|
ml->mapped = mapped;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
mlist->prev->next = ml;
|
|
|
|
ml->prev = mlist->prev;
|
|
|
|
ml->next = mlist;
|
|
|
|
mlist->prev = ml;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
return 0;
|
2001-07-30 03:09:46 +00:00
|
|
|
#endif /* COMPILE_ONLY */
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
protected void
|
|
|
|
file_delmagic(struct magic *p, int type, size_t entries)
|
|
|
|
{
|
|
|
|
if (p == NULL)
|
|
|
|
return;
|
|
|
|
switch (type) {
|
|
|
|
case 2:
|
|
|
|
p--;
|
|
|
|
(void)munmap((void *)p, sizeof(*p) * (entries + 1));
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
p--;
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
case 0:
|
|
|
|
free(p);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1996-01-23 12:29:07 +00:00
|
|
|
|
2002-09-16 05:54:26 +00:00
|
|
|
/* const char *fn: list of magic files */
|
2004-08-09 08:45:41 +00:00
|
|
|
protected struct mlist *
|
|
|
|
file_apprentice(struct magic_set *ms, const char *fn, int action)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
2004-08-09 08:45:41 +00:00
|
|
|
char *p, *mfn, *afn = NULL;
|
1996-01-23 12:29:07 +00:00
|
|
|
int file_err, errs = -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
struct mlist *mlist;
|
2007-05-24 16:12:23 +00:00
|
|
|
static const char mime[] = ".mime";
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (fn == NULL)
|
|
|
|
fn = getenv("MAGIC");
|
|
|
|
if (fn == NULL)
|
|
|
|
fn = MAGIC;
|
|
|
|
|
|
|
|
if ((fn = mfn = strdup(fn)) == NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, strlen(fn));
|
2004-08-09 08:45:41 +00:00
|
|
|
return NULL;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
|
|
|
|
if ((mlist = malloc(sizeof(*mlist))) == NULL) {
|
|
|
|
free(mfn);
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(*mlist));
|
2004-08-09 08:45:41 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
mlist->next = mlist->prev = mlist;
|
|
|
|
|
1996-01-23 12:29:07 +00:00
|
|
|
while (fn) {
|
2000-11-05 08:33:55 +00:00
|
|
|
p = strchr(fn, PATHSEP);
|
1996-01-23 12:29:07 +00:00
|
|
|
if (p)
|
|
|
|
*p++ = '\0';
|
2004-08-09 08:45:41 +00:00
|
|
|
if (*fn == '\0')
|
|
|
|
break;
|
|
|
|
if (ms->flags & MAGIC_MIME) {
|
2007-05-24 16:12:23 +00:00
|
|
|
size_t len = strlen(fn) + sizeof(mime);
|
|
|
|
if ((afn = malloc(len)) == NULL) {
|
2004-08-09 08:45:41 +00:00
|
|
|
free(mfn);
|
|
|
|
free(mlist);
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, len);
|
2004-08-09 08:45:41 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
(void)strcpy(afn, fn);
|
2007-05-24 16:12:23 +00:00
|
|
|
(void)strcat(afn, mime);
|
2004-08-09 08:45:41 +00:00
|
|
|
fn = afn;
|
|
|
|
}
|
|
|
|
file_err = apprentice_1(ms, fn, action, mlist);
|
1996-01-23 12:29:07 +00:00
|
|
|
if (file_err > errs)
|
|
|
|
errs = file_err;
|
2004-08-09 08:45:41 +00:00
|
|
|
if (afn) {
|
|
|
|
free(afn);
|
|
|
|
afn = NULL;
|
|
|
|
}
|
1996-01-23 12:29:07 +00:00
|
|
|
fn = p;
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
if (errs == -1) {
|
|
|
|
free(mfn);
|
|
|
|
free(mlist);
|
|
|
|
mlist = NULL;
|
|
|
|
file_error(ms, 0, "could not find any magic files!");
|
|
|
|
return NULL;
|
|
|
|
}
|
1996-01-23 12:29:07 +00:00
|
|
|
free(mfn);
|
2004-08-09 08:45:41 +00:00
|
|
|
return mlist;
|
1996-01-23 12:29:07 +00:00
|
|
|
}
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
/*
|
|
|
|
* Get weight of this magic entry, for sorting purposes.
|
|
|
|
*/
|
2006-06-19 07:52:15 +00:00
|
|
|
private size_t
|
|
|
|
apprentice_magic_strength(const struct magic *m)
|
|
|
|
{
|
2007-05-24 16:12:23 +00:00
|
|
|
#define MULT 10
|
|
|
|
size_t val = 2 * MULT; /* baseline strength */
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
switch (m->type) {
|
|
|
|
case FILE_BYTE:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += 1 * MULT;
|
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
case FILE_SHORT:
|
|
|
|
case FILE_LESHORT:
|
|
|
|
case FILE_BESHORT:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += 2 * MULT;
|
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
case FILE_LONG:
|
|
|
|
case FILE_LELONG:
|
|
|
|
case FILE_BELONG:
|
|
|
|
case FILE_MELONG:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += 4 * MULT;
|
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
case FILE_PSTRING:
|
|
|
|
case FILE_STRING:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += m->vallen * MULT;
|
|
|
|
break;
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_BESTRING16:
|
|
|
|
case FILE_LESTRING16:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += m->vallen * MULT / 2;
|
|
|
|
break;
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_SEARCH:
|
2007-05-24 16:12:23 +00:00
|
|
|
case FILE_REGEX:
|
|
|
|
val += m->vallen;
|
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
case FILE_DATE:
|
|
|
|
case FILE_LEDATE:
|
|
|
|
case FILE_BEDATE:
|
|
|
|
case FILE_MEDATE:
|
|
|
|
case FILE_LDATE:
|
|
|
|
case FILE_LELDATE:
|
|
|
|
case FILE_BELDATE:
|
|
|
|
case FILE_MELDATE:
|
2007-05-24 16:12:23 +00:00
|
|
|
val += 4 * MULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case FILE_QUAD:
|
|
|
|
case FILE_BEQUAD:
|
|
|
|
case FILE_LEQUAD:
|
|
|
|
case FILE_QDATE:
|
|
|
|
case FILE_LEQDATE:
|
|
|
|
case FILE_BEQDATE:
|
|
|
|
case FILE_QLDATE:
|
|
|
|
case FILE_LEQLDATE:
|
|
|
|
case FILE_BEQLDATE:
|
|
|
|
val += 8 * MULT;
|
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
|
|
|
|
default:
|
2007-05-24 16:12:23 +00:00
|
|
|
val = 0;
|
|
|
|
(void)fprintf(stderr, "Bad type %d\n", m->type);
|
|
|
|
abort();
|
2006-06-19 07:52:15 +00:00
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
|
|
|
|
switch (m->reln) {
|
|
|
|
case 'x': /* matches anything penalize */
|
|
|
|
val = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '!':
|
|
|
|
case '=': /* Exact match, prefer */
|
|
|
|
val += MULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '>':
|
|
|
|
case '<': /* comparison match reduce strength */
|
|
|
|
val -= 2 * MULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '^':
|
|
|
|
case '&': /* masking bits, we could count them too */
|
|
|
|
val -= MULT;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
(void)fprintf(stderr, "Bad relation %c\n", m->reln);
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
return val;
|
2006-06-19 07:52:15 +00:00
|
|
|
}
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
/*
|
|
|
|
* Sort callback for sorting entries by "strength" (basically length)
|
|
|
|
*/
|
2006-06-19 07:52:15 +00:00
|
|
|
private int
|
|
|
|
apprentice_sort(const void *a, const void *b)
|
|
|
|
{
|
|
|
|
const struct magic_entry *ma = a;
|
|
|
|
const struct magic_entry *mb = b;
|
|
|
|
size_t sa = apprentice_magic_strength(ma->mp);
|
|
|
|
size_t sb = apprentice_magic_strength(mb->mp);
|
|
|
|
if (sa == sb)
|
|
|
|
return 0;
|
|
|
|
else if (sa > sb)
|
|
|
|
return -1;
|
|
|
|
else
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2001-03-25 18:37:04 +00:00
|
|
|
/*
|
|
|
|
* parse from a file
|
2002-09-16 05:54:26 +00:00
|
|
|
* const char *fn: name of magic file
|
2001-03-25 18:37:04 +00:00
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
|
|
|
apprentice_file(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp,
|
|
|
|
const char *fn, int action)
|
1996-01-23 12:29:07 +00:00
|
|
|
{
|
2004-08-09 08:45:41 +00:00
|
|
|
private const char hdr[] =
|
1996-01-23 12:29:07 +00:00
|
|
|
"cont\toffset\ttype\topcode\tmask\tvalue\tdesc";
|
|
|
|
FILE *f;
|
|
|
|
char line[BUFSIZ+1];
|
|
|
|
int errs = 0;
|
2006-06-19 07:52:15 +00:00
|
|
|
struct magic_entry *marray;
|
2007-05-24 16:12:23 +00:00
|
|
|
uint32_t marraycount, i, mentrycount = 0;
|
|
|
|
size_t lineno = 0;
|
|
|
|
|
|
|
|
ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */
|
1996-01-23 12:29:07 +00:00
|
|
|
|
2004-12-28 04:31:47 +00:00
|
|
|
f = fopen(ms->file = fn, "r");
|
2001-03-25 18:37:04 +00:00
|
|
|
if (f == NULL) {
|
1996-01-23 12:29:07 +00:00
|
|
|
if (errno != ENOENT)
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, errno, "cannot read magic file `%s'",
|
|
|
|
fn);
|
1996-01-23 12:29:07 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
maxmagic = MAXMAGIS;
|
2006-06-21 09:28:00 +00:00
|
|
|
if ((marray = calloc(maxmagic, sizeof(*marray))) == NULL) {
|
2004-08-09 08:45:41 +00:00
|
|
|
(void)fclose(f);
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, maxmagic * sizeof(*marray));
|
2004-08-09 08:45:41 +00:00
|
|
|
return -1;
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|
2006-06-19 07:52:15 +00:00
|
|
|
marraycount = 0;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
/* print silly verbose header for USG compat. */
|
|
|
|
if (action == FILE_CHECK)
|
|
|
|
(void)fprintf(stderr, "%s\n", hdr);
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
/* read and parse this file */
|
2004-12-28 04:31:47 +00:00
|
|
|
for (ms->line = 1; fgets(line, BUFSIZ, f) != NULL; ms->line++) {
|
|
|
|
size_t len;
|
|
|
|
len = strlen(line);
|
2007-05-24 16:12:23 +00:00
|
|
|
if (len == 0) /* null line, garbage, etc */
|
1994-09-03 19:16:28 +00:00
|
|
|
continue;
|
2007-05-24 16:12:23 +00:00
|
|
|
if (line[len - 1] == '\n') {
|
|
|
|
lineno++;
|
2006-06-19 07:52:15 +00:00
|
|
|
line[len - 1] = '\0'; /* delete newline */
|
2007-05-24 16:12:23 +00:00
|
|
|
}
|
|
|
|
if (line[0] == '\0') /* empty, do not parse */
|
|
|
|
continue;
|
|
|
|
if (line[0] == '#') /* comment, do not parse */
|
|
|
|
continue;
|
|
|
|
if (parse(ms, &marray, &marraycount, line, lineno, action) != 0)
|
2006-06-19 07:52:15 +00:00
|
|
|
errs++;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
(void)fclose(f);
|
2006-06-19 07:52:15 +00:00
|
|
|
if (errs)
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
#ifndef NOORDER
|
|
|
|
qsort(marray, marraycount, sizeof(*marray), apprentice_sort);
|
|
|
|
#endif
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
for (i = 0; i < marraycount; i++)
|
2006-06-19 07:52:15 +00:00
|
|
|
mentrycount += marray[i].cont_count;
|
|
|
|
|
|
|
|
if ((*magicp = malloc(sizeof(**magicp) * mentrycount)) == NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(**magicp) * mentrycount);
|
2006-06-19 07:52:15 +00:00
|
|
|
errs++;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
mentrycount = 0;
|
|
|
|
for (i = 0; i < marraycount; i++) {
|
|
|
|
(void)memcpy(*magicp + mentrycount, marray[i].mp,
|
|
|
|
marray[i].cont_count * sizeof(**magicp));
|
|
|
|
mentrycount += marray[i].cont_count;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
for (i = 0; i < marraycount; i++)
|
|
|
|
free(marray[i].mp);
|
|
|
|
free(marray);
|
2001-03-25 18:37:04 +00:00
|
|
|
if (errs) {
|
|
|
|
*magicp = NULL;
|
|
|
|
*nmagicp = 0;
|
2006-06-19 07:52:15 +00:00
|
|
|
return errs;
|
|
|
|
} else {
|
|
|
|
*nmagicp = mentrycount;
|
|
|
|
return 0;
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|
2006-06-19 07:52:15 +00:00
|
|
|
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* extend the sign bit if the comparison is to be signed
|
|
|
|
*/
|
2007-05-24 16:12:23 +00:00
|
|
|
protected uint64_t
|
|
|
|
file_signextend(struct magic_set *ms, struct magic *m, uint64_t v)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
|
|
|
if (!(m->flag & UNSIGNED))
|
|
|
|
switch(m->type) {
|
|
|
|
/*
|
|
|
|
* Do not remove the casts below. They are
|
|
|
|
* vital. When later compared with the data,
|
|
|
|
* the sign extension must have happened.
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_BYTE:
|
1994-09-03 19:16:28 +00:00
|
|
|
v = (char) v;
|
|
|
|
break;
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_SHORT:
|
|
|
|
case FILE_BESHORT:
|
|
|
|
case FILE_LESHORT:
|
1994-09-03 19:16:28 +00:00
|
|
|
v = (short) v;
|
|
|
|
break;
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_DATE:
|
|
|
|
case FILE_BEDATE:
|
|
|
|
case FILE_LEDATE:
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_MEDATE:
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_LDATE:
|
|
|
|
case FILE_BELDATE:
|
|
|
|
case FILE_LELDATE:
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_MELDATE:
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_LONG:
|
|
|
|
case FILE_BELONG:
|
|
|
|
case FILE_LELONG:
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_MELONG:
|
2002-09-16 05:54:26 +00:00
|
|
|
v = (int32_t) v;
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
2007-05-24 16:12:23 +00:00
|
|
|
case FILE_QUAD:
|
|
|
|
case FILE_BEQUAD:
|
|
|
|
case FILE_LEQUAD:
|
|
|
|
case FILE_QDATE:
|
|
|
|
case FILE_QLDATE:
|
|
|
|
case FILE_BEQDATE:
|
|
|
|
case FILE_BEQLDATE:
|
|
|
|
case FILE_LEQDATE:
|
|
|
|
case FILE_LEQLDATE:
|
|
|
|
v = (int64_t) v;
|
|
|
|
break;
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_STRING:
|
|
|
|
case FILE_PSTRING:
|
2004-12-28 04:31:47 +00:00
|
|
|
case FILE_BESTRING16:
|
|
|
|
case FILE_LESTRING16:
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_REGEX:
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_SEARCH:
|
2002-09-16 05:54:26 +00:00
|
|
|
break;
|
1994-09-03 19:16:28 +00:00
|
|
|
default:
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms, "cannot happen: m->type=%d\n",
|
2004-08-09 08:45:41 +00:00
|
|
|
m->type);
|
|
|
|
return ~0U;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* parse one line from magic file, put into magic[index++] if valid
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
2006-06-19 07:52:15 +00:00
|
|
|
parse(struct magic_set *ms, struct magic_entry **mentryp, uint32_t *nmentryp,
|
2007-05-24 16:12:23 +00:00
|
|
|
const char *line, size_t lineno, int action)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
2007-05-24 16:12:23 +00:00
|
|
|
size_t i;
|
2006-06-19 07:52:15 +00:00
|
|
|
struct magic_entry *me;
|
1994-09-03 19:16:28 +00:00
|
|
|
struct magic *m;
|
2006-06-19 07:52:15 +00:00
|
|
|
const char *l = line;
|
2001-10-08 22:50:54 +00:00
|
|
|
char *t;
|
2004-08-09 08:45:41 +00:00
|
|
|
private const char *fops = FILE_OPS;
|
2007-05-24 16:12:23 +00:00
|
|
|
uint64_t val;
|
2006-06-21 09:28:00 +00:00
|
|
|
uint32_t cont_level;
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
cont_level = 0;
|
1994-09-03 19:16:28 +00:00
|
|
|
|
|
|
|
while (*l == '>') {
|
|
|
|
++l; /* step over */
|
2006-06-19 07:52:15 +00:00
|
|
|
cont_level++;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define ALLOC_CHUNK (size_t)10
|
|
|
|
#define ALLOC_INCR (size_t)200
|
|
|
|
|
|
|
|
if (cont_level != 0) {
|
|
|
|
if (*nmentryp == 0) {
|
|
|
|
file_error(ms, 0, "No current entry for continuation");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
me = &(*mentryp)[*nmentryp - 1];
|
|
|
|
if (me->cont_count == me->max_count) {
|
|
|
|
struct magic *nm;
|
|
|
|
size_t cnt = me->max_count + ALLOC_CHUNK;
|
|
|
|
if ((nm = realloc(me->mp, sizeof(*nm) * cnt)) == NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(*nm) * cnt);
|
2006-06-19 07:52:15 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
me->mp = m = nm;
|
|
|
|
me->max_count = cnt;
|
|
|
|
}
|
|
|
|
m = &me->mp[me->cont_count++];
|
|
|
|
memset(m, 0, sizeof(*m));
|
|
|
|
m->cont_level = cont_level;
|
|
|
|
} else {
|
|
|
|
if (*nmentryp == maxmagic) {
|
|
|
|
struct magic_entry *mp;
|
|
|
|
|
|
|
|
maxmagic += ALLOC_INCR;
|
|
|
|
if ((mp = realloc(*mentryp, sizeof(*mp) * maxmagic)) ==
|
|
|
|
NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(*mp) * maxmagic);
|
2006-06-19 07:52:15 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
(void)memset(&mp[*nmentryp], 0, sizeof(*mp) *
|
|
|
|
ALLOC_INCR);
|
|
|
|
*mentryp = mp;
|
|
|
|
}
|
|
|
|
me = &(*mentryp)[*nmentryp];
|
|
|
|
if (me->mp == NULL) {
|
|
|
|
if ((m = malloc(sizeof(*m) * ALLOC_CHUNK)) == NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, sizeof(*m) * ALLOC_CHUNK);
|
2006-06-19 07:52:15 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
me->mp = m;
|
|
|
|
me->max_count = ALLOC_CHUNK;
|
|
|
|
} else
|
|
|
|
m = me->mp;
|
|
|
|
memset(m, 0, sizeof(*m));
|
|
|
|
m->cont_level = 0;
|
|
|
|
me->cont_count = 1;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
m->lineno = lineno;
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
if (m->cont_level != 0 && *l == '&') {
|
|
|
|
++l; /* step over */
|
|
|
|
m->flag |= OFFADD;
|
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
if (m->cont_level != 0 && *l == '(') {
|
|
|
|
++l; /* step over */
|
|
|
|
m->flag |= INDIR;
|
2006-06-19 07:52:15 +00:00
|
|
|
if (m->flag & OFFADD)
|
|
|
|
m->flag = (m->flag & ~OFFADD) | INDIROFFADD;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
1997-03-18 18:00:03 +00:00
|
|
|
if (m->cont_level != 0 && *l == '&') {
|
|
|
|
++l; /* step over */
|
2001-07-30 03:09:46 +00:00
|
|
|
m->flag |= OFFADD;
|
1997-03-18 18:00:03 +00:00
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
|
|
|
|
/* get offset, then skip over it */
|
2004-08-09 08:45:41 +00:00
|
|
|
m->offset = (uint32_t)strtoul(l, &t, 0);
|
1994-09-03 19:16:28 +00:00
|
|
|
if (l == t)
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms, "offset `%s' invalid", l);
|
1994-09-03 19:16:28 +00:00
|
|
|
l = t;
|
|
|
|
|
|
|
|
if (m->flag & INDIR) {
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_LONG;
|
2001-03-25 18:37:04 +00:00
|
|
|
m->in_offset = 0;
|
1994-09-03 19:16:28 +00:00
|
|
|
/*
|
|
|
|
* read [.lbs][+-]nnnnn)
|
|
|
|
*/
|
|
|
|
if (*l == '.') {
|
1996-01-23 12:29:07 +00:00
|
|
|
l++;
|
2000-11-05 08:33:55 +00:00
|
|
|
switch (*l) {
|
1994-09-03 19:16:28 +00:00
|
|
|
case 'l':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_LELONG;
|
2000-11-05 08:33:55 +00:00
|
|
|
break;
|
|
|
|
case 'L':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_BELONG;
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
2006-06-19 07:52:15 +00:00
|
|
|
case 'm':
|
|
|
|
m->in_type = FILE_MELONG;
|
|
|
|
break;
|
1996-01-23 12:29:07 +00:00
|
|
|
case 'h':
|
1994-09-03 19:16:28 +00:00
|
|
|
case 's':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_LESHORT;
|
2000-11-05 08:33:55 +00:00
|
|
|
break;
|
|
|
|
case 'H':
|
|
|
|
case 'S':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_BESHORT;
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
1996-01-23 12:29:07 +00:00
|
|
|
case 'c':
|
1994-09-03 19:16:28 +00:00
|
|
|
case 'b':
|
2000-11-05 08:33:55 +00:00
|
|
|
case 'C':
|
|
|
|
case 'B':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_type = FILE_BYTE;
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
|
|
|
default:
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms,
|
|
|
|
"indirect offset type `%c' invalid",
|
2004-08-09 08:45:41 +00:00
|
|
|
*l);
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
l++;
|
|
|
|
}
|
2001-07-30 03:09:46 +00:00
|
|
|
if (*l == '~') {
|
2006-06-19 07:52:15 +00:00
|
|
|
m->in_op |= FILE_OPINVERSE;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
}
|
|
|
|
switch (*l) {
|
|
|
|
case '&':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPAND;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '|':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPOR;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '^':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPXOR;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '+':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPADD;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '-':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPMINUS;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '*':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPMULTIPLY;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '/':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPDIVIDE;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
|
|
|
case '%':
|
2004-08-09 08:45:41 +00:00
|
|
|
m->in_op |= FILE_OPMODULO;
|
2001-07-30 03:09:46 +00:00
|
|
|
l++;
|
|
|
|
break;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
2006-06-19 07:52:15 +00:00
|
|
|
if (*l == '(') {
|
|
|
|
m->in_op |= FILE_OPINDIRECT;
|
|
|
|
l++;
|
|
|
|
}
|
|
|
|
if (isdigit((unsigned char)*l) || *l == '-') {
|
|
|
|
m->in_offset = (int32_t)strtol(l, &t, 0);
|
|
|
|
l = t;
|
|
|
|
}
|
|
|
|
if (*l++ != ')' ||
|
|
|
|
((m->in_op & FILE_OPINDIRECT) && *l++ != ')'))
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms,
|
|
|
|
"missing ')' in indirect offset");
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
while (isascii((unsigned char)*l) && isdigit((unsigned char)*l))
|
|
|
|
++l;
|
|
|
|
EATAB;
|
|
|
|
|
|
|
|
if (*l == 'u') {
|
|
|
|
++l;
|
|
|
|
m->flag |= UNSIGNED;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get type, skip it */
|
2007-05-24 16:12:23 +00:00
|
|
|
for (i = 0; i < file_nnames; i++) {
|
|
|
|
size_t len = strlen(file_names[i]);
|
|
|
|
if (strncmp(l, file_names[i], len) == 0) {
|
|
|
|
m->type = i;
|
|
|
|
l+= len;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (i == file_nnames) {
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms, "type `%s' invalid", l);
|
1994-09-03 19:16:28 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
/* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */
|
2001-07-30 03:09:46 +00:00
|
|
|
/* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */
|
|
|
|
if (*l == '~') {
|
2004-12-28 04:31:47 +00:00
|
|
|
if (!IS_STRING(m->type))
|
2006-06-19 07:52:15 +00:00
|
|
|
m->mask_op |= FILE_OPINVERSE;
|
2001-07-30 03:09:46 +00:00
|
|
|
++l;
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
if ((t = strchr(fops, *l)) != NULL) {
|
|
|
|
uint32_t op = (uint32_t)(t - fops);
|
2006-06-19 07:52:15 +00:00
|
|
|
if (op != FILE_OPDIVIDE || !IS_PLAINSTRING(m->type)) {
|
2001-07-30 03:09:46 +00:00
|
|
|
++l;
|
2004-08-09 08:45:41 +00:00
|
|
|
m->mask_op |= op;
|
2007-05-24 16:12:23 +00:00
|
|
|
val = (uint64_t)strtoull(l, &t, 0);
|
2006-06-19 07:52:15 +00:00
|
|
|
l = t;
|
2004-08-09 08:45:41 +00:00
|
|
|
m->mask = file_signextend(ms, m, val);
|
2001-07-30 03:09:46 +00:00
|
|
|
eatsize(&l);
|
|
|
|
} else {
|
|
|
|
m->mask = 0L;
|
2004-08-09 08:45:41 +00:00
|
|
|
while (!isspace((unsigned char)*++l)) {
|
2000-11-05 08:33:55 +00:00
|
|
|
switch (*l) {
|
|
|
|
case CHAR_IGNORE_LOWERCASE:
|
|
|
|
m->mask |= STRING_IGNORE_LOWERCASE;
|
|
|
|
break;
|
|
|
|
case CHAR_COMPACT_BLANK:
|
|
|
|
m->mask |= STRING_COMPACT_BLANK;
|
|
|
|
break;
|
|
|
|
case CHAR_COMPACT_OPTIONAL_BLANK:
|
|
|
|
m->mask |=
|
|
|
|
STRING_COMPACT_OPTIONAL_BLANK;
|
|
|
|
break;
|
|
|
|
default:
|
2004-08-09 08:45:41 +00:00
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms,
|
|
|
|
"string extension `%c' invalid",
|
2004-08-09 08:45:41 +00:00
|
|
|
*l);
|
2000-11-05 08:33:55 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
2006-06-19 07:52:15 +00:00
|
|
|
++l;
|
2000-11-05 08:33:55 +00:00
|
|
|
}
|
2001-07-30 03:09:46 +00:00
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
/*
|
|
|
|
* We used to set mask to all 1's here, instead let's just not do
|
|
|
|
* anything if mask = 0 (unless you have a better idea)
|
|
|
|
*/
|
1994-09-03 19:16:28 +00:00
|
|
|
EATAB;
|
|
|
|
|
|
|
|
switch (*l) {
|
|
|
|
case '>':
|
|
|
|
case '<':
|
|
|
|
/* Old-style anding: "0 byte &0x80 dynamically linked" */
|
|
|
|
case '&':
|
|
|
|
case '^':
|
|
|
|
case '=':
|
|
|
|
m->reln = *l;
|
|
|
|
++l;
|
2000-11-05 08:33:55 +00:00
|
|
|
if (*l == '=') {
|
|
|
|
/* HP compat: ignore &= etc. */
|
|
|
|
++l;
|
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
break;
|
|
|
|
case '!':
|
2006-06-19 07:52:15 +00:00
|
|
|
m->reln = *l;
|
|
|
|
++l;
|
|
|
|
break;
|
1994-09-03 19:16:28 +00:00
|
|
|
default:
|
2006-06-19 07:52:15 +00:00
|
|
|
if (*l == 'x' && ((isascii((unsigned char)l[1]) &&
|
|
|
|
isspace((unsigned char)l[1])) || !l[1])) {
|
1994-09-03 19:16:28 +00:00
|
|
|
m->reln = *l;
|
|
|
|
++l;
|
|
|
|
goto GetDesc; /* Bill The Cat */
|
|
|
|
}
|
|
|
|
m->reln = '=';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
EATAB;
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (getvalue(ms, m, &l))
|
1994-09-03 19:16:28 +00:00
|
|
|
return -1;
|
|
|
|
/*
|
|
|
|
* TODO finish this macro and start using it!
|
|
|
|
* #define offsetcheck {if (offset > HOWMANY-1)
|
|
|
|
* magwarn("offset too big"); }
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* now get last part - the description
|
|
|
|
*/
|
|
|
|
GetDesc:
|
|
|
|
EATAB;
|
|
|
|
if (l[0] == '\b') {
|
|
|
|
++l;
|
|
|
|
m->nospflag = 1;
|
|
|
|
} else if ((l[0] == '\\') && (l[1] == 'b')) {
|
|
|
|
++l;
|
|
|
|
++l;
|
|
|
|
m->nospflag = 1;
|
|
|
|
} else
|
|
|
|
m->nospflag = 0;
|
2007-05-24 16:12:23 +00:00
|
|
|
for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); )
|
|
|
|
continue;
|
|
|
|
if (i == sizeof(m->desc)) {
|
|
|
|
m->desc[sizeof(m->desc) - 1] = '\0';
|
|
|
|
if (ms->flags & MAGIC_CHECK)
|
|
|
|
file_magwarn(ms, "description `%s' truncated", m->desc);
|
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
/*
|
|
|
|
* We only do this check while compiling, or if any of the magic
|
|
|
|
* files were not compiled.
|
|
|
|
*/
|
|
|
|
if (ms->flags & MAGIC_CHECK) {
|
|
|
|
if (check_format(ms, m) == -1)
|
2004-08-09 08:45:41 +00:00
|
|
|
return -1;
|
|
|
|
}
|
2002-09-16 05:54:26 +00:00
|
|
|
#ifndef COMPILE_ONLY
|
2004-08-09 08:45:41 +00:00
|
|
|
if (action == FILE_CHECK) {
|
|
|
|
file_mdump(m);
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
2002-09-16 05:54:26 +00:00
|
|
|
#endif
|
2006-06-19 07:52:15 +00:00
|
|
|
if (m->cont_level == 0)
|
|
|
|
++(*nmentryp); /* make room for next */
|
1994-09-03 19:16:28 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
private int
|
|
|
|
check_format_type(const char *ptr, int type)
|
|
|
|
{
|
|
|
|
int quad = 0;
|
|
|
|
if (*ptr == '\0') {
|
|
|
|
/* Missing format string; bad */
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (type) {
|
|
|
|
case FILE_FMT_QUAD:
|
|
|
|
quad = 1;
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
case FILE_FMT_NUM:
|
|
|
|
if (*ptr == '-')
|
|
|
|
ptr++;
|
|
|
|
if (*ptr == '.')
|
|
|
|
ptr++;
|
|
|
|
while (isdigit((unsigned char)*ptr)) ptr++;
|
|
|
|
if (*ptr == '.')
|
|
|
|
ptr++;
|
|
|
|
while (isdigit((unsigned char)*ptr)) ptr++;
|
|
|
|
if (quad) {
|
|
|
|
if (*ptr++ != 'l')
|
|
|
|
return -1;
|
|
|
|
if (*ptr++ != 'l')
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (*ptr++) {
|
|
|
|
case 'l':
|
|
|
|
switch (*ptr++) {
|
|
|
|
case 'i':
|
|
|
|
case 'd':
|
|
|
|
case 'u':
|
|
|
|
case 'x':
|
|
|
|
case 'X':
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
case 'h':
|
|
|
|
switch (*ptr++) {
|
|
|
|
case 'h':
|
|
|
|
switch (*ptr++) {
|
|
|
|
case 'i':
|
|
|
|
case 'd':
|
|
|
|
case 'u':
|
|
|
|
case 'x':
|
|
|
|
case 'X':
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
case 'd':
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
case 'i':
|
|
|
|
case 'c':
|
|
|
|
case 'd':
|
|
|
|
case 'u':
|
|
|
|
case 'x':
|
|
|
|
case 'X':
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
case FILE_FMT_STR:
|
|
|
|
if (*ptr == '-')
|
|
|
|
ptr++;
|
|
|
|
while (isdigit((unsigned char )*ptr))
|
|
|
|
ptr++;
|
|
|
|
if (*ptr == '.') {
|
|
|
|
ptr++;
|
|
|
|
while (isdigit((unsigned char )*ptr))
|
|
|
|
ptr++;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (*ptr++) {
|
|
|
|
case 's':
|
|
|
|
return 0;
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
/* internal error */
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
/*NOTREACHED*/
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
/*
|
|
|
|
* Check that the optional printf format in description matches
|
|
|
|
* the type of the magic.
|
|
|
|
*/
|
|
|
|
private int
|
2004-12-28 04:31:47 +00:00
|
|
|
check_format(struct magic_set *ms, struct magic *m)
|
2004-08-09 08:45:41 +00:00
|
|
|
{
|
|
|
|
char *ptr;
|
|
|
|
|
|
|
|
for (ptr = m->desc; *ptr; ptr++)
|
|
|
|
if (*ptr == '%')
|
|
|
|
break;
|
|
|
|
if (*ptr == '\0') {
|
|
|
|
/* No format string; ok */
|
|
|
|
return 1;
|
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
|
|
|
|
assert(file_nformats == file_nnames);
|
|
|
|
|
|
|
|
if (m->type >= file_nformats) {
|
|
|
|
file_error(ms, 0, "Internal error inconsistency between "
|
|
|
|
"m->type and format strings");
|
|
|
|
return -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
if (file_formats[m->type] == FILE_FMT_NONE) {
|
|
|
|
file_error(ms, 0, "No format string for `%s' with description "
|
|
|
|
"`%s'", m->desc, file_names[m->type]);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
ptr++;
|
|
|
|
if (check_format_type(ptr, file_formats[m->type]) == -1) {
|
|
|
|
/*
|
|
|
|
* TODO: this error message is unhelpful if the format
|
|
|
|
* string is not one character long
|
|
|
|
*/
|
|
|
|
file_error(ms, 0, "Printf format `%c' is not valid for type "
|
|
|
|
" `%s' in description `%s'", *ptr,
|
|
|
|
file_names[m->type], m->desc);
|
|
|
|
return -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
for (; *ptr; ptr++) {
|
2007-05-24 16:12:23 +00:00
|
|
|
if (*ptr == '%') {
|
|
|
|
file_error(ms, 0,
|
|
|
|
"Too many format strings (should have at most one) "
|
|
|
|
"for `%s' with description `%s'",
|
|
|
|
file_names[m->type], m->desc);
|
|
|
|
return -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
}
|
|
|
|
}
|
2007-05-24 16:12:23 +00:00
|
|
|
return 0;
|
2004-08-09 08:45:41 +00:00
|
|
|
}
|
|
|
|
|
1994-09-03 19:16:28 +00:00
|
|
|
/*
|
|
|
|
* Read a numeric value from a pointer, into the value union of a magic
|
|
|
|
* pointer, according to the magic type. Update the string pointer to point
|
|
|
|
* just after the number read. Return 0 for success, non-zero for failure.
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
2006-06-19 07:52:15 +00:00
|
|
|
getvalue(struct magic_set *ms, struct magic *m, const char **p)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
|
|
|
int slen;
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
switch (m->type) {
|
2004-12-28 04:31:47 +00:00
|
|
|
case FILE_BESTRING16:
|
|
|
|
case FILE_LESTRING16:
|
2004-08-09 08:45:41 +00:00
|
|
|
case FILE_STRING:
|
|
|
|
case FILE_PSTRING:
|
|
|
|
case FILE_REGEX:
|
2006-06-19 07:52:15 +00:00
|
|
|
case FILE_SEARCH:
|
2004-08-09 08:45:41 +00:00
|
|
|
*p = getstr(ms, *p, m->value.s, sizeof(m->value.s), &slen);
|
|
|
|
if (*p == NULL) {
|
|
|
|
if (ms->flags & MAGIC_CHECK)
|
2004-12-28 04:31:47 +00:00
|
|
|
file_magwarn(ms, "cannot get string from `%s'",
|
2004-08-09 08:45:41 +00:00
|
|
|
m->value.s);
|
|
|
|
return -1;
|
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
m->vallen = slen;
|
2004-08-09 08:45:41 +00:00
|
|
|
return 0;
|
|
|
|
default:
|
1996-01-23 12:29:07 +00:00
|
|
|
if (m->reln != 'x') {
|
2006-06-19 07:52:15 +00:00
|
|
|
char *ep;
|
2007-05-24 16:12:23 +00:00
|
|
|
m->value.q = file_signextend(ms, m,
|
|
|
|
(uint64_t)strtoull(*p, &ep, 0));
|
2006-06-19 07:52:15 +00:00
|
|
|
*p = ep;
|
1996-01-23 12:29:07 +00:00
|
|
|
eatsize(p);
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
return 0;
|
|
|
|
}
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert a string containing C character escapes. Stop at an unescaped
|
|
|
|
* space or tab.
|
|
|
|
* Copy the converted version to "p", returning its length in *slen.
|
|
|
|
* Return updated scan pointer as function result.
|
|
|
|
*/
|
2006-06-19 07:52:15 +00:00
|
|
|
private const char *
|
|
|
|
getstr(struct magic_set *ms, const char *s, char *p, int plen, int *slen)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
2006-06-19 07:52:15 +00:00
|
|
|
const char *origs = s;
|
|
|
|
char *origp = p;
|
1994-09-03 19:16:28 +00:00
|
|
|
char *pmax = p + plen - 1;
|
2000-11-05 08:33:55 +00:00
|
|
|
int c;
|
|
|
|
int val;
|
1994-09-03 19:16:28 +00:00
|
|
|
|
|
|
|
while ((c = *s++) != '\0') {
|
|
|
|
if (isspace((unsigned char) c))
|
|
|
|
break;
|
|
|
|
if (p >= pmax) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, 0, "string too long: `%s'", origs);
|
|
|
|
return NULL;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
if(c == '\\') {
|
|
|
|
switch(c = *s++) {
|
|
|
|
|
|
|
|
case '\0':
|
|
|
|
goto out;
|
|
|
|
|
|
|
|
default:
|
|
|
|
*p++ = (char) c;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'n':
|
|
|
|
*p++ = '\n';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'r':
|
|
|
|
*p++ = '\r';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'b':
|
|
|
|
*p++ = '\b';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 't':
|
|
|
|
*p++ = '\t';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'f':
|
|
|
|
*p++ = '\f';
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'v':
|
|
|
|
*p++ = '\v';
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* \ and up to 3 octal digits */
|
|
|
|
case '0':
|
|
|
|
case '1':
|
|
|
|
case '2':
|
|
|
|
case '3':
|
|
|
|
case '4':
|
|
|
|
case '5':
|
|
|
|
case '6':
|
|
|
|
case '7':
|
|
|
|
val = c - '0';
|
|
|
|
c = *s++; /* try for 2 */
|
|
|
|
if(c >= '0' && c <= '7') {
|
|
|
|
val = (val<<3) | (c - '0');
|
|
|
|
c = *s++; /* try for 3 */
|
|
|
|
if(c >= '0' && c <= '7')
|
|
|
|
val = (val<<3) | (c-'0');
|
|
|
|
else
|
|
|
|
--s;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
--s;
|
|
|
|
*p++ = (char)val;
|
|
|
|
break;
|
|
|
|
|
1997-03-18 18:00:03 +00:00
|
|
|
/* \x and up to 2 hex digits */
|
1994-09-03 19:16:28 +00:00
|
|
|
case 'x':
|
|
|
|
val = 'x'; /* Default if no digits */
|
|
|
|
c = hextoint(*s++); /* Get next char */
|
|
|
|
if (c >= 0) {
|
|
|
|
val = c;
|
|
|
|
c = hextoint(*s++);
|
1997-03-18 18:00:03 +00:00
|
|
|
if (c >= 0)
|
1994-09-03 19:16:28 +00:00
|
|
|
val = (val << 4) + c;
|
1997-03-18 18:00:03 +00:00
|
|
|
else
|
1994-09-03 19:16:28 +00:00
|
|
|
--s;
|
|
|
|
} else
|
|
|
|
--s;
|
|
|
|
*p++ = (char)val;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
*p++ = (char)c;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
*p = '\0';
|
|
|
|
*slen = p - origp;
|
|
|
|
return s;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Single hex char to int; -1 if not a hex char. */
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
2002-09-16 05:54:26 +00:00
|
|
|
hextoint(int c)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
2000-11-05 08:33:55 +00:00
|
|
|
if (!isascii((unsigned char) c))
|
|
|
|
return -1;
|
|
|
|
if (isdigit((unsigned char) c))
|
|
|
|
return c - '0';
|
|
|
|
if ((c >= 'a')&&(c <= 'f'))
|
|
|
|
return c + 10 - 'a';
|
|
|
|
if (( c>= 'A')&&(c <= 'F'))
|
|
|
|
return c + 10 - 'A';
|
|
|
|
return -1;
|
1994-09-03 19:16:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Print a string containing C character escapes.
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
protected void
|
|
|
|
file_showstr(FILE *fp, const char *s, size_t len)
|
1994-09-03 19:16:28 +00:00
|
|
|
{
|
2000-11-05 08:33:55 +00:00
|
|
|
char c;
|
1994-09-03 19:16:28 +00:00
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
c = *s++;
|
2004-08-09 08:45:41 +00:00
|
|
|
if (len == ~0U) {
|
1994-09-03 19:16:28 +00:00
|
|
|
if (c == '\0')
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (len-- == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if(c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */
|
|
|
|
(void) fputc(c, fp);
|
|
|
|
else {
|
|
|
|
(void) fputc('\\', fp);
|
|
|
|
switch (c) {
|
|
|
|
|
|
|
|
case '\n':
|
|
|
|
(void) fputc('n', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\r':
|
|
|
|
(void) fputc('r', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\b':
|
|
|
|
(void) fputc('b', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\t':
|
|
|
|
(void) fputc('t', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\f':
|
|
|
|
(void) fputc('f', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case '\v':
|
|
|
|
(void) fputc('v', fp);
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
(void) fprintf(fp, "%.3o", c & 0377);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
1996-01-23 12:29:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* eatsize(): Eat the size spec from a number [eg. 10UL]
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private void
|
2006-06-19 07:52:15 +00:00
|
|
|
eatsize(const char **p)
|
1996-01-23 12:29:07 +00:00
|
|
|
{
|
2006-06-19 07:52:15 +00:00
|
|
|
const char *l = *p;
|
1996-01-23 12:29:07 +00:00
|
|
|
|
|
|
|
if (LOWCASE(*l) == 'u')
|
|
|
|
l++;
|
|
|
|
|
|
|
|
switch (LOWCASE(*l)) {
|
|
|
|
case 'l': /* long */
|
|
|
|
case 's': /* short */
|
|
|
|
case 'h': /* short */
|
|
|
|
case 'b': /* char/byte */
|
|
|
|
case 'c': /* char/byte */
|
|
|
|
l++;
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
*p = l;
|
|
|
|
}
|
2001-03-25 18:37:04 +00:00
|
|
|
|
|
|
|
/*
|
2002-09-16 05:54:26 +00:00
|
|
|
* handle a compiled file.
|
2001-03-25 18:37:04 +00:00
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
|
|
|
apprentice_map(struct magic_set *ms, struct magic **magicp, uint32_t *nmagicp,
|
|
|
|
const char *fn)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
struct stat st;
|
2002-09-16 05:54:26 +00:00
|
|
|
uint32_t *ptr;
|
|
|
|
uint32_t version;
|
2001-03-25 18:37:04 +00:00
|
|
|
int needsbyteswap;
|
2004-08-09 08:45:41 +00:00
|
|
|
char buf[MAXPATHLEN];
|
2004-12-28 04:31:47 +00:00
|
|
|
char *dbname = mkdbname(fn, buf, sizeof(buf), 0);
|
2004-08-09 08:45:41 +00:00
|
|
|
void *mm = NULL;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2001-07-30 03:09:46 +00:00
|
|
|
if (dbname == NULL)
|
|
|
|
return -1;
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1)
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
|
|
|
|
|
|
|
if (fstat(fd, &st) == -1) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, errno, "cannot stat `%s'", dbname);
|
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
if (st.st_size < 16) {
|
|
|
|
file_error(ms, 0, "file `%s' is too small", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
|
2001-07-30 03:09:46 +00:00
|
|
|
#ifdef QUICK
|
2002-09-16 05:54:26 +00:00
|
|
|
if ((mm = mmap(0, (size_t)st.st_size, PROT_READ|PROT_WRITE,
|
2001-03-25 18:37:04 +00:00
|
|
|
MAP_PRIVATE|MAP_FILE, fd, (off_t)0)) == MAP_FAILED) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, errno, "cannot map `%s'", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
goto error;
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
#define RET 2
|
2001-07-30 03:09:46 +00:00
|
|
|
#else
|
2002-09-16 05:54:26 +00:00
|
|
|
if ((mm = malloc((size_t)st.st_size)) == NULL) {
|
2007-05-24 16:12:23 +00:00
|
|
|
file_oomem(ms, (size_t)st.st_size);
|
2001-07-30 03:09:46 +00:00
|
|
|
goto error;
|
|
|
|
}
|
2002-09-16 05:54:26 +00:00
|
|
|
if (read(fd, mm, (size_t)st.st_size) != (size_t)st.st_size) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_badread(ms);
|
2001-07-30 03:09:46 +00:00
|
|
|
goto error;
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
#define RET 1
|
2001-07-30 03:09:46 +00:00
|
|
|
#endif
|
2002-09-16 05:54:26 +00:00
|
|
|
*magicp = mm;
|
2001-03-25 18:37:04 +00:00
|
|
|
(void)close(fd);
|
2001-04-25 07:41:21 +00:00
|
|
|
fd = -1;
|
2004-08-09 08:45:41 +00:00
|
|
|
ptr = (uint32_t *)(void *)*magicp;
|
2001-03-25 18:37:04 +00:00
|
|
|
if (*ptr != MAGICNO) {
|
|
|
|
if (swap4(*ptr) != MAGICNO) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, 0, "bad magic in `%s'");
|
2001-03-25 18:37:04 +00:00
|
|
|
goto error;
|
|
|
|
}
|
|
|
|
needsbyteswap = 1;
|
|
|
|
} else
|
|
|
|
needsbyteswap = 0;
|
|
|
|
if (needsbyteswap)
|
|
|
|
version = swap4(ptr[1]);
|
|
|
|
else
|
|
|
|
version = ptr[1];
|
|
|
|
if (version != VERSIONNO) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, 0, "version mismatch (%d != %d) in `%s'",
|
|
|
|
version, VERSIONNO, dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
goto error;
|
|
|
|
}
|
2004-08-09 08:45:41 +00:00
|
|
|
*nmagicp = (uint32_t)(st.st_size / sizeof(struct magic)) - 1;
|
2001-03-25 18:37:04 +00:00
|
|
|
(*magicp)++;
|
|
|
|
if (needsbyteswap)
|
|
|
|
byteswap(*magicp, *nmagicp);
|
2004-08-09 08:45:41 +00:00
|
|
|
return RET;
|
2001-03-25 18:37:04 +00:00
|
|
|
|
|
|
|
error:
|
|
|
|
if (fd != -1)
|
|
|
|
(void)close(fd);
|
2002-09-16 05:54:26 +00:00
|
|
|
if (mm) {
|
2001-07-30 03:09:46 +00:00
|
|
|
#ifdef QUICK
|
2004-08-09 08:45:41 +00:00
|
|
|
(void)munmap((void *)mm, (size_t)st.st_size);
|
2001-07-30 03:09:46 +00:00
|
|
|
#else
|
2002-09-16 05:54:26 +00:00
|
|
|
free(mm);
|
2001-07-30 03:09:46 +00:00
|
|
|
#endif
|
|
|
|
} else {
|
2001-03-25 18:37:04 +00:00
|
|
|
*magicp = NULL;
|
|
|
|
*nmagicp = 0;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
private const uint32_t ar[] = {
|
|
|
|
MAGICNO, VERSIONNO
|
|
|
|
};
|
2001-03-25 18:37:04 +00:00
|
|
|
/*
|
|
|
|
* handle an mmaped file.
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private int
|
|
|
|
apprentice_compile(struct magic_set *ms, struct magic **magicp,
|
|
|
|
uint32_t *nmagicp, const char *fn)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
|
|
|
int fd;
|
2004-08-09 08:45:41 +00:00
|
|
|
char buf[MAXPATHLEN];
|
2004-12-28 04:31:47 +00:00
|
|
|
char *dbname = mkdbname(fn, buf, sizeof(buf), 1);
|
2001-03-25 18:37:04 +00:00
|
|
|
|
2001-07-30 03:09:46 +00:00
|
|
|
if (dbname == NULL)
|
|
|
|
return -1;
|
|
|
|
|
2006-06-19 07:52:15 +00:00
|
|
|
if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1) {
|
2004-08-09 08:45:41 +00:00
|
|
|
file_error(ms, errno, "cannot open `%s'", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (write(fd, ar, sizeof(ar)) != (ssize_t)sizeof(ar)) {
|
|
|
|
file_error(ms, errno, "error writing `%s'", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (lseek(fd, (off_t)sizeof(struct magic), SEEK_SET)
|
|
|
|
!= sizeof(struct magic)) {
|
|
|
|
file_error(ms, errno, "error seeking `%s'", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
if (write(fd, *magicp, (sizeof(struct magic) * *nmagicp))
|
|
|
|
!= (ssize_t)(sizeof(struct magic) * *nmagicp)) {
|
|
|
|
file_error(ms, errno, "error writing `%s'", dbname);
|
2001-03-25 18:37:04 +00:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
(void)close(fd);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
private const char ext[] = ".mgc";
|
2001-03-25 18:37:04 +00:00
|
|
|
/*
|
|
|
|
* make a dbname
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private char *
|
2004-12-28 04:31:47 +00:00
|
|
|
mkdbname(const char *fn, char *buf, size_t bufsiz, int strip)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
2004-12-28 04:31:47 +00:00
|
|
|
if (strip) {
|
|
|
|
const char *p;
|
|
|
|
if ((p = strrchr(fn, '/')) != NULL)
|
|
|
|
fn = ++p;
|
|
|
|
}
|
|
|
|
|
2004-08-09 08:45:41 +00:00
|
|
|
(void)snprintf(buf, bufsiz, "%s%s", fn, ext);
|
2001-03-25 18:37:04 +00:00
|
|
|
return buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Byteswap an mmap'ed file if needed
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private void
|
2002-09-16 05:54:26 +00:00
|
|
|
byteswap(struct magic *magic, uint32_t nmagic)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
2002-09-16 05:54:26 +00:00
|
|
|
uint32_t i;
|
2001-03-25 18:37:04 +00:00
|
|
|
for (i = 0; i < nmagic; i++)
|
|
|
|
bs1(&magic[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* swap a short
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private uint16_t
|
2002-09-16 05:54:26 +00:00
|
|
|
swap2(uint16_t sv)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
2002-09-16 05:54:26 +00:00
|
|
|
uint16_t rv;
|
2004-08-09 08:45:41 +00:00
|
|
|
uint8_t *s = (uint8_t *)(void *)&sv;
|
|
|
|
uint8_t *d = (uint8_t *)(void *)&rv;
|
2001-03-25 18:37:04 +00:00
|
|
|
d[0] = s[1];
|
|
|
|
d[1] = s[0];
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* swap an int
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private uint32_t
|
2002-09-16 05:54:26 +00:00
|
|
|
swap4(uint32_t sv)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
2002-09-16 05:54:26 +00:00
|
|
|
uint32_t rv;
|
2004-08-09 08:45:41 +00:00
|
|
|
uint8_t *s = (uint8_t *)(void *)&sv;
|
|
|
|
uint8_t *d = (uint8_t *)(void *)&rv;
|
2001-03-25 18:37:04 +00:00
|
|
|
d[0] = s[3];
|
|
|
|
d[1] = s[2];
|
|
|
|
d[2] = s[1];
|
|
|
|
d[3] = s[0];
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2007-05-24 16:12:23 +00:00
|
|
|
/*
|
|
|
|
* swap a quad
|
|
|
|
*/
|
|
|
|
private uint64_t
|
|
|
|
swap8(uint64_t sv)
|
|
|
|
{
|
|
|
|
uint32_t rv;
|
|
|
|
uint8_t *s = (uint8_t *)(void *)&sv;
|
|
|
|
uint8_t *d = (uint8_t *)(void *)&rv;
|
|
|
|
d[0] = s[3];
|
|
|
|
d[1] = s[2];
|
|
|
|
d[2] = s[1];
|
|
|
|
d[3] = s[0];
|
|
|
|
d[4] = s[7];
|
|
|
|
d[5] = s[6];
|
|
|
|
d[6] = s[5];
|
|
|
|
d[7] = s[4];
|
|
|
|
return rv;
|
|
|
|
}
|
|
|
|
|
2001-03-25 18:37:04 +00:00
|
|
|
/*
|
|
|
|
* byteswap a single magic entry
|
|
|
|
*/
|
2004-08-09 08:45:41 +00:00
|
|
|
private void
|
|
|
|
bs1(struct magic *m)
|
2001-03-25 18:37:04 +00:00
|
|
|
{
|
|
|
|
m->cont_level = swap2(m->cont_level);
|
2004-08-09 08:45:41 +00:00
|
|
|
m->offset = swap4((uint32_t)m->offset);
|
|
|
|
m->in_offset = swap4((uint32_t)m->in_offset);
|
2006-06-19 07:52:15 +00:00
|
|
|
if (!IS_STRING(m->type))
|
2007-05-24 16:12:23 +00:00
|
|
|
m->value.q = swap8(m->value.q);
|
|
|
|
m->mask = swap8(m->mask);
|
2001-03-25 18:37:04 +00:00
|
|
|
}
|