/src/file/src/apprentice.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright (c) Ian F. Darwin 1986-1995. |
3 | | * Software written by Ian F. Darwin and others; |
4 | | * maintained 1995-present by Christos Zoulas and others. |
5 | | * |
6 | | * Redistribution and use in source and binary forms, with or without |
7 | | * modification, are permitted provided that the following conditions |
8 | | * are met: |
9 | | * 1. Redistributions of source code must retain the above copyright |
10 | | * notice immediately at the beginning of the file, without modification, |
11 | | * this list of conditions, and the following disclaimer. |
12 | | * 2. Redistributions in binary form must reproduce the above copyright |
13 | | * notice, this list of conditions and the following disclaimer in the |
14 | | * documentation and/or other materials provided with the distribution. |
15 | | * |
16 | | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
17 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
18 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
19 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR |
20 | | * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
21 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
22 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
23 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
24 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
25 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
26 | | * SUCH DAMAGE. |
27 | | */ |
28 | | /* |
29 | | * apprentice - make one pass through /etc/magic, learning its secrets. |
30 | | */ |
31 | | |
32 | | #include "file.h" |
33 | | |
34 | | #ifndef lint |
35 | | FILE_RCSID("@(#)$File: apprentice.c,v 1.342 2023/07/17 14:38:35 christos Exp $") |
36 | | #endif /* lint */ |
37 | | |
38 | | #include "magic.h" |
39 | | #include <stdlib.h> |
40 | | #ifdef HAVE_UNISTD_H |
41 | | #include <unistd.h> |
42 | | #endif |
43 | | #include <stddef.h> |
44 | | #include <string.h> |
45 | | #include <assert.h> |
46 | | #include <ctype.h> |
47 | | #include <fcntl.h> |
48 | | #ifdef QUICK |
49 | | #include <sys/mman.h> |
50 | | #endif |
51 | | #include <dirent.h> |
52 | | #include <limits.h> |
53 | | #ifdef HAVE_BYTESWAP_H |
54 | | #include <byteswap.h> |
55 | | #endif |
56 | | #ifdef HAVE_SYS_BSWAP_H |
57 | | #include <sys/bswap.h> |
58 | | #endif |
59 | | |
60 | | |
61 | 0 | #define EATAB {while (isascii(CAST(unsigned char, *l)) && \ |
62 | 0 | isspace(CAST(unsigned char, *l))) ++l;} |
63 | 0 | #define LOWCASE(l) (isupper(CAST(unsigned char, l)) ? \ |
64 | 0 | tolower(CAST(unsigned char, l)) : (l)) |
65 | | /* |
66 | | * Work around a bug in headers on Digital Unix. |
67 | | * At least confirmed for: OSF1 V4.0 878 |
68 | | */ |
69 | | #if defined(__osf__) && defined(__DECC) |
70 | | #ifdef MAP_FAILED |
71 | | #undef MAP_FAILED |
72 | | #endif |
73 | | #endif |
74 | | |
75 | | #ifndef MAP_FAILED |
76 | | #define MAP_FAILED (void *) -1 |
77 | | #endif |
78 | | |
79 | | #ifndef MAP_FILE |
80 | | #define MAP_FILE 0 |
81 | | #endif |
82 | | |
83 | 0 | #define ALLOC_CHUNK CAST(size_t, 10) |
84 | 0 | #define ALLOC_INCR CAST(size_t, 200) |
85 | | |
86 | 2 | #define MAP_TYPE_USER 0 |
87 | 0 | #define MAP_TYPE_MALLOC 1 |
88 | 2 | #define MAP_TYPE_MMAP 2 |
89 | | |
90 | | struct magic_entry { |
91 | | struct magic *mp; |
92 | | uint32_t cont_count; |
93 | | uint32_t max_count; |
94 | | }; |
95 | | |
96 | | struct magic_entry_set { |
97 | | struct magic_entry *me; |
98 | | uint32_t count; |
99 | | uint32_t max; |
100 | | }; |
101 | | |
102 | | struct magic_map { |
103 | | void *p; |
104 | | size_t len; |
105 | | int type; |
106 | | struct magic *magic[MAGIC_SETS]; |
107 | | uint32_t nmagic[MAGIC_SETS]; |
108 | | }; |
109 | | |
110 | | int file_formats[FILE_NAMES_SIZE]; |
111 | | const size_t file_nformats = FILE_NAMES_SIZE; |
112 | | const char *file_names[FILE_NAMES_SIZE]; |
113 | | const size_t file_nnames = FILE_NAMES_SIZE; |
114 | | |
115 | | file_private int getvalue(struct magic_set *ms, struct magic *, const char **, int); |
116 | | file_private int hextoint(int); |
117 | | file_private const char *getstr(struct magic_set *, struct magic *, const char *, |
118 | | int); |
119 | | file_private int parse(struct magic_set *, struct magic_entry *, const char *, |
120 | | size_t, int); |
121 | | file_private void eatsize(const char **); |
122 | | file_private int apprentice_1(struct magic_set *, const char *, int); |
123 | | file_private ssize_t apprentice_magic_strength_1(const struct magic *); |
124 | | file_private int apprentice_sort(const void *, const void *); |
125 | | file_private void apprentice_list(struct mlist *, int ); |
126 | | file_private struct magic_map *apprentice_load(struct magic_set *, |
127 | | const char *, int); |
128 | | file_private struct mlist *mlist_alloc(void); |
129 | | file_private void mlist_free_all(struct magic_set *); |
130 | | file_private void mlist_free(struct mlist *); |
131 | | file_private void byteswap(struct magic *, uint32_t); |
132 | | file_private void bs1(struct magic *); |
133 | | |
134 | | #if defined(HAVE_BYTESWAP_H) |
135 | 0 | #define swap2(x) bswap_16(x) |
136 | 0 | #define swap4(x) bswap_32(x) |
137 | 0 | #define swap8(x) bswap_64(x) |
138 | | #elif defined(HAVE_SYS_BSWAP_H) |
139 | | #define swap2(x) bswap16(x) |
140 | | #define swap4(x) bswap32(x) |
141 | | #define swap8(x) bswap64(x) |
142 | | #else |
143 | | file_private uint16_t swap2(uint16_t); |
144 | | file_private uint32_t swap4(uint32_t); |
145 | | file_private uint64_t swap8(uint64_t); |
146 | | #endif |
147 | | |
148 | | file_private char *mkdbname(struct magic_set *, const char *, int); |
149 | | file_private struct magic_map *apprentice_buf(struct magic_set *, struct magic *, |
150 | | size_t); |
151 | | file_private struct magic_map *apprentice_map(struct magic_set *, const char *); |
152 | | file_private int check_buffer(struct magic_set *, struct magic_map *, const char *); |
153 | | file_private void apprentice_unmap(struct magic_map *); |
154 | | file_private int apprentice_compile(struct magic_set *, struct magic_map *, |
155 | | const char *); |
156 | | file_private int check_format_type(const char *, int, const char **); |
157 | | file_private int check_format(struct magic_set *, struct magic *); |
158 | | file_private int get_op(char); |
159 | | file_private int parse_mime(struct magic_set *, struct magic_entry *, const char *, |
160 | | size_t); |
161 | | file_private int parse_strength(struct magic_set *, struct magic_entry *, |
162 | | const char *, size_t); |
163 | | file_private int parse_apple(struct magic_set *, struct magic_entry *, const char *, |
164 | | size_t); |
165 | | file_private int parse_ext(struct magic_set *, struct magic_entry *, const char *, |
166 | | size_t); |
167 | | |
168 | | |
169 | | file_private size_t magicsize = sizeof(struct magic); |
170 | | |
171 | | file_private const char usg_hdr[] = "cont\toffset\ttype\topcode\tmask\tvalue\tdesc"; |
172 | | |
173 | | file_private struct { |
174 | | const char *name; |
175 | | size_t len; |
176 | | int (*fun)(struct magic_set *, struct magic_entry *, const char *, |
177 | | size_t); |
178 | | } bang[] = { |
179 | | #define DECLARE_FIELD(name) { # name, sizeof(# name) - 1, parse_ ## name } |
180 | | DECLARE_FIELD(mime), |
181 | | DECLARE_FIELD(apple), |
182 | | DECLARE_FIELD(ext), |
183 | | DECLARE_FIELD(strength), |
184 | | #undef DECLARE_FIELD |
185 | | { NULL, 0, NULL } |
186 | | }; |
187 | | |
188 | | #ifdef COMPILE_ONLY |
189 | | |
190 | | int main(int, char *[]); |
191 | | |
192 | | int |
193 | | main(int argc, char *argv[]) |
194 | | { |
195 | | int ret; |
196 | | struct magic_set *ms; |
197 | | char *progname; |
198 | | |
199 | | if ((progname = strrchr(argv[0], '/')) != NULL) |
200 | | progname++; |
201 | | else |
202 | | progname = argv[0]; |
203 | | |
204 | | if (argc != 2) { |
205 | | (void)fprintf(stderr, "Usage: %s file\n", progname); |
206 | | return 1; |
207 | | } |
208 | | |
209 | | if ((ms = magic_open(MAGIC_CHECK)) == NULL) { |
210 | | (void)fprintf(stderr, "%s: %s\n", progname, strerror(errno)); |
211 | | return 1; |
212 | | } |
213 | | ret = magic_compile(ms, argv[1]) == -1 ? 1 : 0; |
214 | | if (ret == 1) |
215 | | (void)fprintf(stderr, "%s: %s\n", progname, magic_error(ms)); |
216 | | magic_close(ms); |
217 | | return ret; |
218 | | } |
219 | | #endif /* COMPILE_ONLY */ |
220 | | |
221 | | struct type_tbl_s { |
222 | | const char name[16]; |
223 | | const size_t len; |
224 | | const int type; |
225 | | const int format; |
226 | | }; |
227 | | |
228 | | /* |
229 | | * XXX - the actual Single UNIX Specification says that "long" means "long", |
230 | | * as in the C data type, but we treat it as meaning "4-byte integer". |
231 | | * Given that the OS X version of file 5.04 did the same, I guess that passes |
232 | | * the actual test; having "long" be dependent on how big a "long" is on |
233 | | * the machine running "file" is silly. |
234 | | */ |
235 | | static const struct type_tbl_s type_tbl[] = { |
236 | | # define XX(s) s, (sizeof(s) - 1) |
237 | | # define XX_NULL "", 0 |
238 | | { XX("invalid"), FILE_INVALID, FILE_FMT_NONE }, |
239 | | { XX("byte"), FILE_BYTE, FILE_FMT_NUM }, |
240 | | { XX("short"), FILE_SHORT, FILE_FMT_NUM }, |
241 | | { XX("default"), FILE_DEFAULT, FILE_FMT_NONE }, |
242 | | { XX("long"), FILE_LONG, FILE_FMT_NUM }, |
243 | | { XX("string"), FILE_STRING, FILE_FMT_STR }, |
244 | | { XX("date"), FILE_DATE, FILE_FMT_STR }, |
245 | | { XX("beshort"), FILE_BESHORT, FILE_FMT_NUM }, |
246 | | { XX("belong"), FILE_BELONG, FILE_FMT_NUM }, |
247 | | { XX("bedate"), FILE_BEDATE, FILE_FMT_STR }, |
248 | | { XX("leshort"), FILE_LESHORT, FILE_FMT_NUM }, |
249 | | { XX("lelong"), FILE_LELONG, FILE_FMT_NUM }, |
250 | | { XX("ledate"), FILE_LEDATE, FILE_FMT_STR }, |
251 | | { XX("pstring"), FILE_PSTRING, FILE_FMT_STR }, |
252 | | { XX("ldate"), FILE_LDATE, FILE_FMT_STR }, |
253 | | { XX("beldate"), FILE_BELDATE, FILE_FMT_STR }, |
254 | | { XX("leldate"), FILE_LELDATE, FILE_FMT_STR }, |
255 | | { XX("regex"), FILE_REGEX, FILE_FMT_STR }, |
256 | | { XX("bestring16"), FILE_BESTRING16, FILE_FMT_STR }, |
257 | | { XX("lestring16"), FILE_LESTRING16, FILE_FMT_STR }, |
258 | | { XX("search"), FILE_SEARCH, FILE_FMT_STR }, |
259 | | { XX("medate"), FILE_MEDATE, FILE_FMT_STR }, |
260 | | { XX("meldate"), FILE_MELDATE, FILE_FMT_STR }, |
261 | | { XX("melong"), FILE_MELONG, FILE_FMT_NUM }, |
262 | | { XX("quad"), FILE_QUAD, FILE_FMT_QUAD }, |
263 | | { XX("lequad"), FILE_LEQUAD, FILE_FMT_QUAD }, |
264 | | { XX("bequad"), FILE_BEQUAD, FILE_FMT_QUAD }, |
265 | | { XX("qdate"), FILE_QDATE, FILE_FMT_STR }, |
266 | | { XX("leqdate"), FILE_LEQDATE, FILE_FMT_STR }, |
267 | | { XX("beqdate"), FILE_BEQDATE, FILE_FMT_STR }, |
268 | | { XX("qldate"), FILE_QLDATE, FILE_FMT_STR }, |
269 | | { XX("leqldate"), FILE_LEQLDATE, FILE_FMT_STR }, |
270 | | { XX("beqldate"), FILE_BEQLDATE, FILE_FMT_STR }, |
271 | | { XX("float"), FILE_FLOAT, FILE_FMT_FLOAT }, |
272 | | { XX("befloat"), FILE_BEFLOAT, FILE_FMT_FLOAT }, |
273 | | { XX("lefloat"), FILE_LEFLOAT, FILE_FMT_FLOAT }, |
274 | | { XX("double"), FILE_DOUBLE, FILE_FMT_DOUBLE }, |
275 | | { XX("bedouble"), FILE_BEDOUBLE, FILE_FMT_DOUBLE }, |
276 | | { XX("ledouble"), FILE_LEDOUBLE, FILE_FMT_DOUBLE }, |
277 | | { XX("leid3"), FILE_LEID3, FILE_FMT_NUM }, |
278 | | { XX("beid3"), FILE_BEID3, FILE_FMT_NUM }, |
279 | | { XX("indirect"), FILE_INDIRECT, FILE_FMT_NUM }, |
280 | | { XX("qwdate"), FILE_QWDATE, FILE_FMT_STR }, |
281 | | { XX("leqwdate"), FILE_LEQWDATE, FILE_FMT_STR }, |
282 | | { XX("beqwdate"), FILE_BEQWDATE, FILE_FMT_STR }, |
283 | | { XX("name"), FILE_NAME, FILE_FMT_NONE }, |
284 | | { XX("use"), FILE_USE, FILE_FMT_NONE }, |
285 | | { XX("clear"), FILE_CLEAR, FILE_FMT_NONE }, |
286 | | { XX("der"), FILE_DER, FILE_FMT_STR }, |
287 | | { XX("guid"), FILE_GUID, FILE_FMT_STR }, |
288 | | { XX("offset"), FILE_OFFSET, FILE_FMT_QUAD }, |
289 | | { XX("bevarint"), FILE_BEVARINT, FILE_FMT_STR }, |
290 | | { XX("levarint"), FILE_LEVARINT, FILE_FMT_STR }, |
291 | | { XX("msdosdate"), FILE_MSDOSDATE, FILE_FMT_STR }, |
292 | | { XX("lemsdosdate"), FILE_LEMSDOSDATE, FILE_FMT_STR }, |
293 | | { XX("bemsdosdate"), FILE_BEMSDOSDATE, FILE_FMT_STR }, |
294 | | { XX("msdostime"), FILE_MSDOSTIME, FILE_FMT_STR }, |
295 | | { XX("lemsdostime"), FILE_LEMSDOSTIME, FILE_FMT_STR }, |
296 | | { XX("bemsdostime"), FILE_BEMSDOSTIME, FILE_FMT_STR }, |
297 | | { XX("octal"), FILE_OCTAL, FILE_FMT_STR }, |
298 | | { XX_NULL, FILE_INVALID, FILE_FMT_NONE }, |
299 | | }; |
300 | | |
301 | | /* |
302 | | * These are not types, and cannot be preceded by "u" to make them |
303 | | * unsigned. |
304 | | */ |
305 | | static const struct type_tbl_s special_tbl[] = { |
306 | | { XX("der"), FILE_DER, FILE_FMT_STR }, |
307 | | { XX("name"), FILE_NAME, FILE_FMT_STR }, |
308 | | { XX("use"), FILE_USE, FILE_FMT_STR }, |
309 | | { XX("octal"), FILE_OCTAL, FILE_FMT_STR }, |
310 | | { XX_NULL, FILE_INVALID, FILE_FMT_NONE }, |
311 | | }; |
312 | | # undef XX |
313 | | # undef XX_NULL |
314 | | |
315 | | file_private int |
316 | | get_type(const struct type_tbl_s *tbl, const char *l, const char **t) |
317 | 0 | { |
318 | 0 | const struct type_tbl_s *p; |
319 | |
|
320 | 0 | for (p = tbl; p->len; p++) { |
321 | 0 | if (strncmp(l, p->name, p->len) == 0) { |
322 | 0 | if (t) |
323 | 0 | *t = l + p->len; |
324 | 0 | break; |
325 | 0 | } |
326 | 0 | } |
327 | 0 | return p->type; |
328 | 0 | } |
329 | | |
330 | | file_private off_t |
331 | 2 | maxoff_t(void) { |
332 | 2 | if (/*CONSTCOND*/sizeof(off_t) == sizeof(int)) |
333 | 0 | return CAST(off_t, INT_MAX); |
334 | 2 | if (/*CONSTCOND*/sizeof(off_t) == sizeof(long)) |
335 | 2 | return CAST(off_t, LONG_MAX); |
336 | 0 | return 0x7fffffff; |
337 | 2 | } |
338 | | |
339 | | file_private int |
340 | | get_standard_integer_type(const char *l, const char **t) |
341 | 0 | { |
342 | 0 | int type; |
343 | |
|
344 | 0 | if (isalpha(CAST(unsigned char, l[1]))) { |
345 | 0 | switch (l[1]) { |
346 | 0 | case 'C': |
347 | | /* "dC" and "uC" */ |
348 | 0 | type = FILE_BYTE; |
349 | 0 | break; |
350 | 0 | case 'S': |
351 | | /* "dS" and "uS" */ |
352 | 0 | type = FILE_SHORT; |
353 | 0 | break; |
354 | 0 | case 'I': |
355 | 0 | case 'L': |
356 | | /* |
357 | | * "dI", "dL", "uI", and "uL". |
358 | | * |
359 | | * XXX - the actual Single UNIX Specification says |
360 | | * that "L" means "long", as in the C data type, |
361 | | * but we treat it as meaning "4-byte integer". |
362 | | * Given that the OS X version of file 5.04 did |
363 | | * the same, I guess that passes the actual SUS |
364 | | * validation suite; having "dL" be dependent on |
365 | | * how big a "long" is on the machine running |
366 | | * "file" is silly. |
367 | | */ |
368 | 0 | type = FILE_LONG; |
369 | 0 | break; |
370 | 0 | case 'Q': |
371 | | /* "dQ" and "uQ" */ |
372 | 0 | type = FILE_QUAD; |
373 | 0 | break; |
374 | 0 | default: |
375 | | /* "d{anything else}", "u{anything else}" */ |
376 | 0 | return FILE_INVALID; |
377 | 0 | } |
378 | 0 | l += 2; |
379 | 0 | } else if (isdigit(CAST(unsigned char, l[1]))) { |
380 | | /* |
381 | | * "d{num}" and "u{num}"; we only support {num} values |
382 | | * of 1, 2, 4, and 8 - the Single UNIX Specification |
383 | | * doesn't say anything about whether arbitrary |
384 | | * values should be supported, but both the Solaris 10 |
385 | | * and OS X Mountain Lion versions of file passed the |
386 | | * Single UNIX Specification validation suite, and |
387 | | * neither of them support values bigger than 8 or |
388 | | * non-power-of-2 values. |
389 | | */ |
390 | 0 | if (isdigit(CAST(unsigned char, l[2]))) { |
391 | | /* Multi-digit, so > 9 */ |
392 | 0 | return FILE_INVALID; |
393 | 0 | } |
394 | 0 | switch (l[1]) { |
395 | 0 | case '1': |
396 | 0 | type = FILE_BYTE; |
397 | 0 | break; |
398 | 0 | case '2': |
399 | 0 | type = FILE_SHORT; |
400 | 0 | break; |
401 | 0 | case '4': |
402 | 0 | type = FILE_LONG; |
403 | 0 | break; |
404 | 0 | case '8': |
405 | 0 | type = FILE_QUAD; |
406 | 0 | break; |
407 | 0 | default: |
408 | | /* XXX - what about 3, 5, 6, or 7? */ |
409 | 0 | return FILE_INVALID; |
410 | 0 | } |
411 | 0 | l += 2; |
412 | 0 | } else { |
413 | | /* |
414 | | * "d" or "u" by itself. |
415 | | */ |
416 | 0 | type = FILE_LONG; |
417 | 0 | ++l; |
418 | 0 | } |
419 | 0 | if (t) |
420 | 0 | *t = l; |
421 | 0 | return type; |
422 | 0 | } |
423 | | |
424 | | file_private void |
425 | | init_file_tables(void) |
426 | 2 | { |
427 | 2 | static int done = 0; |
428 | 2 | const struct type_tbl_s *p; |
429 | | |
430 | 2 | if (done) |
431 | 0 | return; |
432 | 2 | done++; |
433 | | |
434 | 122 | for (p = type_tbl; p->len; p++) { |
435 | 120 | assert(p->type < FILE_NAMES_SIZE); |
436 | 120 | file_names[p->type] = p->name; |
437 | 120 | file_formats[p->type] = p->format; |
438 | 120 | } |
439 | 2 | assert(p - type_tbl == FILE_NAMES_SIZE); |
440 | 2 | } |
441 | | |
442 | | file_private int |
443 | | add_mlist(struct mlist *mlp, struct magic_map *map, size_t idx) |
444 | 4 | { |
445 | 4 | struct mlist *ml; |
446 | | |
447 | 4 | mlp->map = NULL; |
448 | 4 | if ((ml = CAST(struct mlist *, malloc(sizeof(*ml)))) == NULL) |
449 | 0 | return -1; |
450 | | |
451 | 4 | ml->map = idx == 0 ? map : NULL; |
452 | 4 | ml->magic = map->magic[idx]; |
453 | 4 | ml->nmagic = map->nmagic[idx]; |
454 | 4 | if (ml->nmagic) { |
455 | 4 | ml->magic_rxcomp = CAST(file_regex_t **, |
456 | 4 | calloc(ml->nmagic, sizeof(*ml->magic_rxcomp))); |
457 | 4 | if (ml->magic_rxcomp == NULL) { |
458 | 0 | free(ml); |
459 | 0 | return -1; |
460 | 0 | } |
461 | 4 | } else |
462 | 0 | ml->magic_rxcomp = NULL; |
463 | 4 | mlp->prev->next = ml; |
464 | 4 | ml->prev = mlp->prev; |
465 | 4 | ml->next = mlp; |
466 | 4 | mlp->prev = ml; |
467 | 4 | return 0; |
468 | 4 | } |
469 | | |
470 | | /* |
471 | | * Handle one file or directory. |
472 | | */ |
473 | | file_private int |
474 | | apprentice_1(struct magic_set *ms, const char *fn, int action) |
475 | 2 | { |
476 | 2 | struct magic_map *map; |
477 | 2 | #ifndef COMPILE_ONLY |
478 | 2 | size_t i; |
479 | 2 | #endif |
480 | | |
481 | 2 | if (magicsize != FILE_MAGICSIZE) { |
482 | 0 | file_error(ms, 0, "magic element size %lu != %lu", |
483 | 0 | CAST(unsigned long, sizeof(*map->magic[0])), |
484 | 0 | CAST(unsigned long, FILE_MAGICSIZE)); |
485 | 0 | return -1; |
486 | 0 | } |
487 | | |
488 | 2 | if (action == FILE_COMPILE) { |
489 | 0 | map = apprentice_load(ms, fn, action); |
490 | 0 | if (map == NULL) |
491 | 0 | return -1; |
492 | 0 | return apprentice_compile(ms, map, fn); |
493 | 0 | } |
494 | | |
495 | 2 | #ifndef COMPILE_ONLY |
496 | 2 | map = apprentice_map(ms, fn); |
497 | 2 | if (map == NULL) { |
498 | 0 | if (ms->flags & MAGIC_CHECK) |
499 | 0 | file_magwarn(NULL, "using regular magic file `%s'", fn); |
500 | 0 | map = apprentice_load(ms, fn, action); |
501 | 0 | if (map == NULL) |
502 | 0 | return -1; |
503 | 0 | } |
504 | | |
505 | 6 | for (i = 0; i < MAGIC_SETS; i++) { |
506 | 4 | if (add_mlist(ms->mlist[i], map, i) == -1) { |
507 | | /* failed to add to any list, free explicitly */ |
508 | 0 | if (i == 0) |
509 | 0 | apprentice_unmap(map); |
510 | 0 | else |
511 | 0 | mlist_free_all(ms); |
512 | 0 | file_oomem(ms, sizeof(*ms->mlist[0])); |
513 | 0 | return -1; |
514 | 0 | } |
515 | 4 | } |
516 | | |
517 | 2 | if (action == FILE_LIST) { |
518 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
519 | 0 | printf("Set %" SIZE_T_FORMAT "u:\nBinary patterns:\n", |
520 | 0 | i); |
521 | 0 | apprentice_list(ms->mlist[i], BINTEST); |
522 | 0 | printf("Text patterns:\n"); |
523 | 0 | apprentice_list(ms->mlist[i], TEXTTEST); |
524 | 0 | } |
525 | 0 | } |
526 | 2 | return 0; |
527 | | #else |
528 | | return 0; |
529 | | #endif /* COMPILE_ONLY */ |
530 | 2 | } |
531 | | |
532 | | file_protected void |
533 | | file_ms_free(struct magic_set *ms) |
534 | 0 | { |
535 | 0 | size_t i; |
536 | 0 | if (ms == NULL) |
537 | 0 | return; |
538 | 0 | for (i = 0; i < MAGIC_SETS; i++) |
539 | 0 | mlist_free(ms->mlist[i]); |
540 | 0 | free(ms->o.pbuf); |
541 | 0 | free(ms->o.buf); |
542 | 0 | free(ms->c.li); |
543 | 0 | #ifdef USE_C_LOCALE |
544 | 0 | freelocale(ms->c_lc_ctype); |
545 | 0 | #endif |
546 | 0 | free(ms); |
547 | 0 | } |
548 | | |
549 | | file_protected struct magic_set * |
550 | | file_ms_alloc(int flags) |
551 | 2 | { |
552 | 2 | struct magic_set *ms; |
553 | 2 | size_t i, len; |
554 | | |
555 | 2 | if ((ms = CAST(struct magic_set *, calloc(CAST(size_t, 1u), |
556 | 2 | sizeof(*ms)))) == NULL) |
557 | 0 | return NULL; |
558 | | |
559 | 2 | if (magic_setflags(ms, flags) == -1) { |
560 | 0 | errno = EINVAL; |
561 | 0 | goto free; |
562 | 0 | } |
563 | | |
564 | 2 | ms->o.buf = ms->o.pbuf = NULL; |
565 | 2 | ms->o.blen = 0; |
566 | 2 | len = (ms->c.len = 10) * sizeof(*ms->c.li); |
567 | | |
568 | 2 | if ((ms->c.li = CAST(struct level_info *, malloc(len))) == NULL) |
569 | 0 | goto free; |
570 | | |
571 | 2 | ms->event_flags = 0; |
572 | 2 | ms->error = -1; |
573 | 6 | for (i = 0; i < MAGIC_SETS; i++) |
574 | 4 | ms->mlist[i] = NULL; |
575 | 2 | ms->file = "unknown"; |
576 | 2 | ms->line = 0; |
577 | 2 | ms->indir_max = FILE_INDIR_MAX; |
578 | 2 | ms->name_max = FILE_NAME_MAX; |
579 | 2 | ms->elf_shnum_max = FILE_ELF_SHNUM_MAX; |
580 | 2 | ms->elf_shsize_max = FILE_ELF_SHSIZE_MAX; |
581 | 2 | ms->elf_phnum_max = FILE_ELF_PHNUM_MAX; |
582 | 2 | ms->elf_notes_max = FILE_ELF_NOTES_MAX; |
583 | 2 | ms->regex_max = FILE_REGEX_MAX; |
584 | 2 | ms->bytes_max = FILE_BYTES_MAX; |
585 | 2 | ms->encoding_max = FILE_ENCODING_MAX; |
586 | 2 | #ifdef USE_C_LOCALE |
587 | 2 | ms->c_lc_ctype = newlocale(LC_CTYPE_MASK, "C", 0); |
588 | 2 | assert(ms->c_lc_ctype != NULL); |
589 | 2 | #endif |
590 | 2 | return ms; |
591 | 0 | free: |
592 | 0 | free(ms); |
593 | 0 | return NULL; |
594 | 2 | } |
595 | | |
596 | | file_private void |
597 | | apprentice_unmap(struct magic_map *map) |
598 | 0 | { |
599 | 0 | size_t i; |
600 | 0 | char *p; |
601 | 0 | if (map == NULL) |
602 | 0 | return; |
603 | | |
604 | 0 | switch (map->type) { |
605 | 0 | case MAP_TYPE_USER: |
606 | 0 | break; |
607 | 0 | case MAP_TYPE_MALLOC: |
608 | 0 | p = CAST(char *, map->p); |
609 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
610 | 0 | char *b = RCAST(char *, map->magic[i]); |
611 | 0 | if (p != NULL && b >= p && b <= p + map->len) |
612 | 0 | continue; |
613 | 0 | free(b); |
614 | 0 | } |
615 | 0 | free(p); |
616 | 0 | break; |
617 | 0 | #ifdef QUICK |
618 | 0 | case MAP_TYPE_MMAP: |
619 | 0 | if (map->p && map->p != MAP_FAILED) |
620 | 0 | (void)munmap(map->p, map->len); |
621 | 0 | break; |
622 | 0 | #endif |
623 | 0 | default: |
624 | 0 | fprintf(stderr, "Bad map type %d", map->type); |
625 | 0 | abort(); |
626 | 0 | } |
627 | 0 | free(map); |
628 | 0 | } |
629 | | |
630 | | file_private struct mlist * |
631 | | mlist_alloc(void) |
632 | 4 | { |
633 | 4 | struct mlist *mlist; |
634 | 4 | if ((mlist = CAST(struct mlist *, calloc(1, sizeof(*mlist)))) == NULL) { |
635 | 0 | return NULL; |
636 | 0 | } |
637 | 4 | mlist->next = mlist->prev = mlist; |
638 | 4 | return mlist; |
639 | 4 | } |
640 | | |
641 | | file_private void |
642 | | mlist_free_all(struct magic_set *ms) |
643 | 0 | { |
644 | 0 | size_t i; |
645 | |
|
646 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
647 | 0 | mlist_free(ms->mlist[i]); |
648 | 0 | ms->mlist[i] = NULL; |
649 | 0 | } |
650 | 0 | } |
651 | | |
652 | | file_private void |
653 | | mlist_free_one(struct mlist *ml) |
654 | 0 | { |
655 | 0 | size_t i; |
656 | |
|
657 | 0 | if (ml->map) |
658 | 0 | apprentice_unmap(CAST(struct magic_map *, ml->map)); |
659 | |
|
660 | 0 | for (i = 0; i < ml->nmagic; ++i) { |
661 | 0 | if (ml->magic_rxcomp[i]) { |
662 | 0 | file_regfree(ml->magic_rxcomp[i]); |
663 | 0 | free(ml->magic_rxcomp[i]); |
664 | 0 | ml->magic_rxcomp[i] = NULL; |
665 | 0 | } |
666 | 0 | } |
667 | 0 | free(ml->magic_rxcomp); |
668 | 0 | ml->magic_rxcomp = NULL; |
669 | 0 | free(ml); |
670 | 0 | } |
671 | | |
672 | | file_private void |
673 | | mlist_free(struct mlist *mlist) |
674 | 4 | { |
675 | 4 | struct mlist *ml, *next; |
676 | | |
677 | 4 | if (mlist == NULL) |
678 | 4 | return; |
679 | | |
680 | 0 | for (ml = mlist->next; ml != mlist;) { |
681 | 0 | next = ml->next; |
682 | 0 | mlist_free_one(ml); |
683 | 0 | ml = next; |
684 | 0 | } |
685 | 0 | mlist_free_one(mlist); |
686 | 0 | } |
687 | | |
688 | | #ifndef COMPILE_ONLY |
689 | | /* void **bufs: an array of compiled magic files */ |
690 | | file_protected int |
691 | | buffer_apprentice(struct magic_set *ms, struct magic **bufs, |
692 | | size_t *sizes, size_t nbufs) |
693 | 0 | { |
694 | 0 | size_t i, j; |
695 | 0 | struct magic_map *map; |
696 | |
|
697 | 0 | if (nbufs == 0) |
698 | 0 | return -1; |
699 | | |
700 | 0 | (void)file_reset(ms, 0); |
701 | |
|
702 | 0 | init_file_tables(); |
703 | |
|
704 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
705 | 0 | mlist_free(ms->mlist[i]); |
706 | 0 | if ((ms->mlist[i] = mlist_alloc()) == NULL) { |
707 | 0 | file_oomem(ms, sizeof(*ms->mlist[0])); |
708 | 0 | goto fail; |
709 | 0 | } |
710 | 0 | } |
711 | | |
712 | 0 | for (i = 0; i < nbufs; i++) { |
713 | 0 | map = apprentice_buf(ms, bufs[i], sizes[i]); |
714 | 0 | if (map == NULL) |
715 | 0 | goto fail; |
716 | | |
717 | 0 | for (j = 0; j < MAGIC_SETS; j++) { |
718 | 0 | if (add_mlist(ms->mlist[j], map, j) == -1) { |
719 | 0 | file_oomem(ms, sizeof(*ms->mlist[0])); |
720 | 0 | goto fail; |
721 | 0 | } |
722 | 0 | } |
723 | 0 | } |
724 | | |
725 | 0 | return 0; |
726 | 0 | fail: |
727 | 0 | mlist_free_all(ms); |
728 | 0 | return -1; |
729 | 0 | } |
730 | | #endif |
731 | | |
732 | | /* const char *fn: list of magic files and directories */ |
733 | | file_protected int |
734 | | file_apprentice(struct magic_set *ms, const char *fn, int action) |
735 | 2 | { |
736 | 2 | char *p, *mfn; |
737 | 2 | int fileerr, errs = -1; |
738 | 2 | size_t i, j; |
739 | | |
740 | 2 | (void)file_reset(ms, 0); |
741 | | |
742 | 2 | if ((fn = magic_getpath(fn, action)) == NULL) |
743 | 0 | return -1; |
744 | | |
745 | 2 | init_file_tables(); |
746 | | |
747 | 2 | if ((mfn = strdup(fn)) == NULL) { |
748 | 0 | file_oomem(ms, strlen(fn)); |
749 | 0 | return -1; |
750 | 0 | } |
751 | | |
752 | 6 | for (i = 0; i < MAGIC_SETS; i++) { |
753 | 4 | mlist_free(ms->mlist[i]); |
754 | 4 | if ((ms->mlist[i] = mlist_alloc()) == NULL) { |
755 | 0 | file_oomem(ms, sizeof(*ms->mlist[0])); |
756 | 0 | for (j = 0; j < i; j++) { |
757 | 0 | mlist_free(ms->mlist[j]); |
758 | 0 | ms->mlist[j] = NULL; |
759 | 0 | } |
760 | 0 | free(mfn); |
761 | 0 | return -1; |
762 | 0 | } |
763 | 4 | } |
764 | 2 | fn = mfn; |
765 | | |
766 | 4 | while (fn) { |
767 | 2 | p = CCAST(char *, strchr(fn, PATHSEP)); |
768 | 2 | if (p) |
769 | 0 | *p++ = '\0'; |
770 | 2 | if (*fn == '\0') |
771 | 0 | break; |
772 | 2 | fileerr = apprentice_1(ms, fn, action); |
773 | 2 | errs = MAX(errs, fileerr); |
774 | 2 | fn = p; |
775 | 2 | } |
776 | | |
777 | 2 | free(mfn); |
778 | | |
779 | 2 | if (errs == -1) { |
780 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
781 | 0 | mlist_free(ms->mlist[i]); |
782 | 0 | ms->mlist[i] = NULL; |
783 | 0 | } |
784 | 0 | file_error(ms, 0, "could not find any valid magic files!"); |
785 | 0 | return -1; |
786 | 0 | } |
787 | | |
788 | | #if 0 |
789 | | /* |
790 | | * Always leave the database loaded |
791 | | */ |
792 | | if (action == FILE_LOAD) |
793 | | return 0; |
794 | | |
795 | | for (i = 0; i < MAGIC_SETS; i++) { |
796 | | mlist_free(ms->mlist[i]); |
797 | | ms->mlist[i] = NULL; |
798 | | } |
799 | | #endif |
800 | | |
801 | 2 | switch (action) { |
802 | 2 | case FILE_LOAD: |
803 | 2 | case FILE_COMPILE: |
804 | 2 | case FILE_CHECK: |
805 | 2 | case FILE_LIST: |
806 | 2 | return 0; |
807 | 0 | default: |
808 | 0 | file_error(ms, 0, "Invalid action %d", action); |
809 | 0 | return -1; |
810 | 2 | } |
811 | 2 | } |
812 | | |
813 | | /* |
814 | | * Compute the real length of a magic expression, for the purposes |
815 | | * of determining how "strong" a magic expression is (approximating |
816 | | * how specific its matches are): |
817 | | * - magic characters count 0 unless escaped. |
818 | | * - [] expressions count 1 |
819 | | * - {} expressions count 0 |
820 | | * - regular characters or escaped magic characters count 1 |
821 | | * - 0 length expressions count as one |
822 | | */ |
823 | | file_private size_t |
824 | | nonmagic(const char *str) |
825 | 0 | { |
826 | 0 | const char *p; |
827 | 0 | size_t rv = 0; |
828 | |
|
829 | 0 | for (p = str; *p; p++) |
830 | 0 | switch (*p) { |
831 | 0 | case '\\': /* Escaped anything counts 1 */ |
832 | 0 | if (!*++p) |
833 | 0 | p--; |
834 | 0 | rv++; |
835 | 0 | continue; |
836 | 0 | case '?': /* Magic characters count 0 */ |
837 | 0 | case '*': |
838 | 0 | case '.': |
839 | 0 | case '+': |
840 | 0 | case '^': |
841 | 0 | case '$': |
842 | 0 | continue; |
843 | 0 | case '[': /* Bracketed expressions count 1 the ']' */ |
844 | 0 | while (*p && *p != ']') |
845 | 0 | p++; |
846 | 0 | p--; |
847 | 0 | continue; |
848 | 0 | case '{': /* Braced expressions count 0 */ |
849 | 0 | while (*p && *p != '}') |
850 | 0 | p++; |
851 | 0 | if (!*p) |
852 | 0 | p--; |
853 | 0 | continue; |
854 | 0 | default: /* Anything else counts 1 */ |
855 | 0 | rv++; |
856 | 0 | continue; |
857 | 0 | } |
858 | | |
859 | 0 | return rv == 0 ? 1 : rv; /* Return at least 1 */ |
860 | 0 | } |
861 | | |
862 | | |
863 | | file_private size_t |
864 | | typesize(int type) |
865 | 0 | { |
866 | 0 | switch (type) { |
867 | 0 | case FILE_BYTE: |
868 | 0 | return 1; |
869 | | |
870 | 0 | case FILE_SHORT: |
871 | 0 | case FILE_LESHORT: |
872 | 0 | case FILE_BESHORT: |
873 | 0 | case FILE_MSDOSDATE: |
874 | 0 | case FILE_BEMSDOSDATE: |
875 | 0 | case FILE_LEMSDOSDATE: |
876 | 0 | case FILE_MSDOSTIME: |
877 | 0 | case FILE_BEMSDOSTIME: |
878 | 0 | case FILE_LEMSDOSTIME: |
879 | 0 | return 2; |
880 | | |
881 | 0 | case FILE_LONG: |
882 | 0 | case FILE_LELONG: |
883 | 0 | case FILE_BELONG: |
884 | 0 | case FILE_MELONG: |
885 | 0 | return 4; |
886 | | |
887 | 0 | case FILE_DATE: |
888 | 0 | case FILE_LEDATE: |
889 | 0 | case FILE_BEDATE: |
890 | 0 | case FILE_MEDATE: |
891 | 0 | case FILE_LDATE: |
892 | 0 | case FILE_LELDATE: |
893 | 0 | case FILE_BELDATE: |
894 | 0 | case FILE_MELDATE: |
895 | 0 | case FILE_FLOAT: |
896 | 0 | case FILE_BEFLOAT: |
897 | 0 | case FILE_LEFLOAT: |
898 | 0 | case FILE_BEID3: |
899 | 0 | case FILE_LEID3: |
900 | 0 | return 4; |
901 | | |
902 | 0 | case FILE_QUAD: |
903 | 0 | case FILE_BEQUAD: |
904 | 0 | case FILE_LEQUAD: |
905 | 0 | case FILE_QDATE: |
906 | 0 | case FILE_LEQDATE: |
907 | 0 | case FILE_BEQDATE: |
908 | 0 | case FILE_QLDATE: |
909 | 0 | case FILE_LEQLDATE: |
910 | 0 | case FILE_BEQLDATE: |
911 | 0 | case FILE_QWDATE: |
912 | 0 | case FILE_LEQWDATE: |
913 | 0 | case FILE_BEQWDATE: |
914 | 0 | case FILE_DOUBLE: |
915 | 0 | case FILE_BEDOUBLE: |
916 | 0 | case FILE_LEDOUBLE: |
917 | 0 | case FILE_OFFSET: |
918 | 0 | case FILE_BEVARINT: |
919 | 0 | case FILE_LEVARINT: |
920 | 0 | return 8; |
921 | | |
922 | 0 | case FILE_GUID: |
923 | 0 | return 16; |
924 | | |
925 | 0 | default: |
926 | 0 | return FILE_BADSIZE; |
927 | 0 | } |
928 | 0 | } |
929 | | |
930 | | /* |
931 | | * Get weight of this magic entry, for sorting purposes. |
932 | | */ |
933 | | file_private ssize_t |
934 | | apprentice_magic_strength_1(const struct magic *m) |
935 | 0 | { |
936 | 0 | #define MULT 10U |
937 | 0 | size_t ts, v; |
938 | 0 | ssize_t val = 2 * MULT; /* baseline strength */ |
939 | |
|
940 | 0 | switch (m->type) { |
941 | 0 | case FILE_DEFAULT: /* make sure this sorts last */ |
942 | 0 | if (m->factor_op != FILE_FACTOR_OP_NONE) { |
943 | 0 | file_magwarn(NULL, "Usupported factor_op in default %d", |
944 | 0 | m->factor_op); |
945 | 0 | } |
946 | 0 | return 0; |
947 | | |
948 | 0 | case FILE_BYTE: |
949 | 0 | case FILE_SHORT: |
950 | 0 | case FILE_LESHORT: |
951 | 0 | case FILE_BESHORT: |
952 | 0 | case FILE_LONG: |
953 | 0 | case FILE_LELONG: |
954 | 0 | case FILE_BELONG: |
955 | 0 | case FILE_MELONG: |
956 | 0 | case FILE_DATE: |
957 | 0 | case FILE_LEDATE: |
958 | 0 | case FILE_BEDATE: |
959 | 0 | case FILE_MEDATE: |
960 | 0 | case FILE_LDATE: |
961 | 0 | case FILE_LELDATE: |
962 | 0 | case FILE_BELDATE: |
963 | 0 | case FILE_MELDATE: |
964 | 0 | case FILE_FLOAT: |
965 | 0 | case FILE_BEFLOAT: |
966 | 0 | case FILE_LEFLOAT: |
967 | 0 | case FILE_QUAD: |
968 | 0 | case FILE_BEQUAD: |
969 | 0 | case FILE_LEQUAD: |
970 | 0 | case FILE_QDATE: |
971 | 0 | case FILE_LEQDATE: |
972 | 0 | case FILE_BEQDATE: |
973 | 0 | case FILE_QLDATE: |
974 | 0 | case FILE_LEQLDATE: |
975 | 0 | case FILE_BEQLDATE: |
976 | 0 | case FILE_QWDATE: |
977 | 0 | case FILE_LEQWDATE: |
978 | 0 | case FILE_BEQWDATE: |
979 | 0 | case FILE_DOUBLE: |
980 | 0 | case FILE_BEDOUBLE: |
981 | 0 | case FILE_LEDOUBLE: |
982 | 0 | case FILE_BEVARINT: |
983 | 0 | case FILE_LEVARINT: |
984 | 0 | case FILE_GUID: |
985 | 0 | case FILE_BEID3: |
986 | 0 | case FILE_LEID3: |
987 | 0 | case FILE_OFFSET: |
988 | 0 | case FILE_MSDOSDATE: |
989 | 0 | case FILE_BEMSDOSDATE: |
990 | 0 | case FILE_LEMSDOSDATE: |
991 | 0 | case FILE_MSDOSTIME: |
992 | 0 | case FILE_BEMSDOSTIME: |
993 | 0 | case FILE_LEMSDOSTIME: |
994 | 0 | ts = typesize(m->type); |
995 | 0 | if (ts == FILE_BADSIZE) { |
996 | 0 | (void)fprintf(stderr, "Bad size for type %d\n", |
997 | 0 | m->type); |
998 | 0 | abort(); |
999 | 0 | } |
1000 | 0 | val += ts * MULT; |
1001 | 0 | break; |
1002 | | |
1003 | 0 | case FILE_PSTRING: |
1004 | 0 | case FILE_STRING: |
1005 | 0 | case FILE_OCTAL: |
1006 | 0 | val += m->vallen * MULT; |
1007 | 0 | break; |
1008 | | |
1009 | 0 | case FILE_BESTRING16: |
1010 | 0 | case FILE_LESTRING16: |
1011 | 0 | val += m->vallen * MULT / 2; |
1012 | 0 | break; |
1013 | | |
1014 | 0 | case FILE_SEARCH: |
1015 | 0 | if (m->vallen == 0) |
1016 | 0 | break; |
1017 | 0 | val += m->vallen * MAX(MULT / m->vallen, 1); |
1018 | 0 | break; |
1019 | | |
1020 | 0 | case FILE_REGEX: |
1021 | 0 | v = nonmagic(m->value.s); |
1022 | 0 | val += v * MAX(MULT / v, 1); |
1023 | 0 | break; |
1024 | | |
1025 | 0 | case FILE_INDIRECT: |
1026 | 0 | case FILE_NAME: |
1027 | 0 | case FILE_USE: |
1028 | 0 | case FILE_CLEAR: |
1029 | 0 | break; |
1030 | | |
1031 | 0 | case FILE_DER: |
1032 | 0 | val += MULT; |
1033 | 0 | break; |
1034 | | |
1035 | 0 | default: |
1036 | 0 | (void)fprintf(stderr, "Bad type %d\n", m->type); |
1037 | 0 | abort(); |
1038 | 0 | } |
1039 | | |
1040 | 0 | switch (m->reln) { |
1041 | 0 | case 'x': /* matches anything penalize */ |
1042 | 0 | case '!': /* matches almost anything penalize */ |
1043 | 0 | val = 0; |
1044 | 0 | break; |
1045 | | |
1046 | 0 | case '=': /* Exact match, prefer */ |
1047 | 0 | val += MULT; |
1048 | 0 | break; |
1049 | | |
1050 | 0 | case '>': |
1051 | 0 | case '<': /* comparison match reduce strength */ |
1052 | 0 | val -= 2 * MULT; |
1053 | 0 | break; |
1054 | | |
1055 | 0 | case '^': |
1056 | 0 | case '&': /* masking bits, we could count them too */ |
1057 | 0 | val -= MULT; |
1058 | 0 | break; |
1059 | | |
1060 | 0 | default: |
1061 | 0 | (void)fprintf(stderr, "Bad relation %c\n", m->reln); |
1062 | 0 | abort(); |
1063 | 0 | } |
1064 | | |
1065 | 0 | return val; |
1066 | 0 | } |
1067 | | |
1068 | | |
1069 | | /*ARGSUSED*/ |
1070 | | file_protected size_t |
1071 | | file_magic_strength(const struct magic *m, |
1072 | | size_t nmagic __attribute__((__unused__))) |
1073 | 0 | { |
1074 | 0 | ssize_t val = apprentice_magic_strength_1(m); |
1075 | |
|
1076 | | #ifdef notyet |
1077 | | if (m->desc[0] == '\0') { |
1078 | | size_t i; |
1079 | | /* |
1080 | | * Magic entries with no description get their continuations |
1081 | | * added |
1082 | | */ |
1083 | | for (i = 1; m[i].cont_level != 0 && i < MIN(nmagic, 3); i++) { |
1084 | | ssize_t v = apprentice_magic_strength_1(&m[i]) >> |
1085 | | (i + 1); |
1086 | | val += v; |
1087 | | if (m[i].desc[0] != '\0') |
1088 | | break; |
1089 | | } |
1090 | | } |
1091 | | #endif |
1092 | |
|
1093 | 0 | switch (m->factor_op) { |
1094 | 0 | case FILE_FACTOR_OP_NONE: |
1095 | 0 | break; |
1096 | 0 | case FILE_FACTOR_OP_PLUS: |
1097 | 0 | val += m->factor; |
1098 | 0 | break; |
1099 | 0 | case FILE_FACTOR_OP_MINUS: |
1100 | 0 | val -= m->factor; |
1101 | 0 | break; |
1102 | 0 | case FILE_FACTOR_OP_TIMES: |
1103 | 0 | val *= m->factor; |
1104 | 0 | break; |
1105 | 0 | case FILE_FACTOR_OP_DIV: |
1106 | 0 | val /= m->factor; |
1107 | 0 | break; |
1108 | 0 | default: |
1109 | 0 | (void)fprintf(stderr, "Bad factor_op %u\n", m->factor_op); |
1110 | 0 | abort(); |
1111 | 0 | } |
1112 | | |
1113 | 0 | if (val <= 0) /* ensure we only return 0 for FILE_DEFAULT */ |
1114 | 0 | val = 1; |
1115 | |
|
1116 | 0 | #ifndef notyet |
1117 | | /* |
1118 | | * Magic entries with no description get a bonus because they depend |
1119 | | * on subsequent magic entries to print something. |
1120 | | */ |
1121 | 0 | if (m->desc[0] == '\0') |
1122 | 0 | val++; |
1123 | 0 | #endif |
1124 | |
|
1125 | 0 | return val; |
1126 | 0 | } |
1127 | | |
1128 | | /* |
1129 | | * Sort callback for sorting entries by "strength" (basically length) |
1130 | | */ |
1131 | | file_private int |
1132 | | apprentice_sort(const void *a, const void *b) |
1133 | 0 | { |
1134 | 0 | const struct magic_entry *ma = CAST(const struct magic_entry *, a); |
1135 | 0 | const struct magic_entry *mb = CAST(const struct magic_entry *, b); |
1136 | 0 | size_t sa = file_magic_strength(ma->mp, ma->cont_count); |
1137 | 0 | size_t sb = file_magic_strength(mb->mp, mb->cont_count); |
1138 | 0 | if (sa == sb) |
1139 | 0 | return 0; |
1140 | 0 | else if (sa > sb) |
1141 | 0 | return -1; |
1142 | 0 | else |
1143 | 0 | return 1; |
1144 | 0 | } |
1145 | | |
1146 | | /* |
1147 | | * Shows sorted patterns list in the order which is used for the matching |
1148 | | */ |
1149 | | file_private void |
1150 | | apprentice_list(struct mlist *mlist, int mode) |
1151 | 0 | { |
1152 | 0 | uint32_t magindex, descindex, mimeindex, lineindex; |
1153 | 0 | struct mlist *ml; |
1154 | 0 | for (ml = mlist->next; ml != mlist; ml = ml->next) { |
1155 | 0 | for (magindex = 0; magindex < ml->nmagic; magindex++) { |
1156 | 0 | struct magic *m = &ml->magic[magindex]; |
1157 | 0 | if ((m->flag & mode) != mode) { |
1158 | | /* Skip sub-tests */ |
1159 | 0 | while (magindex + 1 < ml->nmagic && |
1160 | 0 | ml->magic[magindex + 1].cont_level != 0) |
1161 | 0 | ++magindex; |
1162 | 0 | continue; /* Skip to next top-level test*/ |
1163 | 0 | } |
1164 | | |
1165 | | /* |
1166 | | * Try to iterate over the tree until we find item with |
1167 | | * description/mimetype. |
1168 | | */ |
1169 | 0 | lineindex = descindex = mimeindex = magindex; |
1170 | 0 | for (; magindex + 1 < ml->nmagic && |
1171 | 0 | ml->magic[magindex + 1].cont_level != 0; |
1172 | 0 | magindex++) { |
1173 | 0 | uint32_t mi = magindex + 1; |
1174 | 0 | if (*ml->magic[descindex].desc == '\0' |
1175 | 0 | && *ml->magic[mi].desc) |
1176 | 0 | descindex = mi; |
1177 | 0 | if (*ml->magic[mimeindex].mimetype == '\0' |
1178 | 0 | && *ml->magic[mi].mimetype) |
1179 | 0 | mimeindex = mi; |
1180 | 0 | } |
1181 | |
|
1182 | 0 | printf("Strength = %3" SIZE_T_FORMAT "u@%u: %s [%s]\n", |
1183 | 0 | file_magic_strength(m, ml->nmagic - magindex), |
1184 | 0 | ml->magic[lineindex].lineno, |
1185 | 0 | ml->magic[descindex].desc, |
1186 | 0 | ml->magic[mimeindex].mimetype); |
1187 | 0 | } |
1188 | 0 | } |
1189 | 0 | } |
1190 | | |
1191 | | file_private void |
1192 | | set_test_type(struct magic *mstart, struct magic *m) |
1193 | 0 | { |
1194 | 0 | switch (m->type) { |
1195 | 0 | case FILE_BYTE: |
1196 | 0 | case FILE_SHORT: |
1197 | 0 | case FILE_LONG: |
1198 | 0 | case FILE_DATE: |
1199 | 0 | case FILE_BESHORT: |
1200 | 0 | case FILE_BELONG: |
1201 | 0 | case FILE_BEDATE: |
1202 | 0 | case FILE_LESHORT: |
1203 | 0 | case FILE_LELONG: |
1204 | 0 | case FILE_LEDATE: |
1205 | 0 | case FILE_LDATE: |
1206 | 0 | case FILE_BELDATE: |
1207 | 0 | case FILE_LELDATE: |
1208 | 0 | case FILE_MEDATE: |
1209 | 0 | case FILE_MELDATE: |
1210 | 0 | case FILE_MELONG: |
1211 | 0 | case FILE_QUAD: |
1212 | 0 | case FILE_LEQUAD: |
1213 | 0 | case FILE_BEQUAD: |
1214 | 0 | case FILE_QDATE: |
1215 | 0 | case FILE_LEQDATE: |
1216 | 0 | case FILE_BEQDATE: |
1217 | 0 | case FILE_QLDATE: |
1218 | 0 | case FILE_LEQLDATE: |
1219 | 0 | case FILE_BEQLDATE: |
1220 | 0 | case FILE_QWDATE: |
1221 | 0 | case FILE_LEQWDATE: |
1222 | 0 | case FILE_BEQWDATE: |
1223 | 0 | case FILE_FLOAT: |
1224 | 0 | case FILE_BEFLOAT: |
1225 | 0 | case FILE_LEFLOAT: |
1226 | 0 | case FILE_DOUBLE: |
1227 | 0 | case FILE_BEDOUBLE: |
1228 | 0 | case FILE_LEDOUBLE: |
1229 | 0 | case FILE_BEVARINT: |
1230 | 0 | case FILE_LEVARINT: |
1231 | 0 | case FILE_DER: |
1232 | 0 | case FILE_GUID: |
1233 | 0 | case FILE_OFFSET: |
1234 | 0 | case FILE_MSDOSDATE: |
1235 | 0 | case FILE_BEMSDOSDATE: |
1236 | 0 | case FILE_LEMSDOSDATE: |
1237 | 0 | case FILE_MSDOSTIME: |
1238 | 0 | case FILE_BEMSDOSTIME: |
1239 | 0 | case FILE_LEMSDOSTIME: |
1240 | 0 | case FILE_OCTAL: |
1241 | 0 | mstart->flag |= BINTEST; |
1242 | 0 | break; |
1243 | 0 | case FILE_STRING: |
1244 | 0 | case FILE_PSTRING: |
1245 | 0 | case FILE_BESTRING16: |
1246 | 0 | case FILE_LESTRING16: |
1247 | | /* Allow text overrides */ |
1248 | 0 | if (mstart->str_flags & STRING_TEXTTEST) |
1249 | 0 | mstart->flag |= TEXTTEST; |
1250 | 0 | else |
1251 | 0 | mstart->flag |= BINTEST; |
1252 | 0 | break; |
1253 | 0 | case FILE_REGEX: |
1254 | 0 | case FILE_SEARCH: |
1255 | | /* Check for override */ |
1256 | 0 | if (mstart->str_flags & STRING_BINTEST) |
1257 | 0 | mstart->flag |= BINTEST; |
1258 | 0 | if (mstart->str_flags & STRING_TEXTTEST) |
1259 | 0 | mstart->flag |= TEXTTEST; |
1260 | |
|
1261 | 0 | if (mstart->flag & (TEXTTEST|BINTEST)) |
1262 | 0 | break; |
1263 | | |
1264 | | /* binary test if pattern is not text */ |
1265 | 0 | if (file_looks_utf8(m->value.us, CAST(size_t, m->vallen), NULL, |
1266 | 0 | NULL) <= 0) |
1267 | 0 | mstart->flag |= BINTEST; |
1268 | 0 | else |
1269 | 0 | mstart->flag |= TEXTTEST; |
1270 | 0 | break; |
1271 | 0 | case FILE_DEFAULT: |
1272 | | /* can't deduce anything; we shouldn't see this at the |
1273 | | top level anyway */ |
1274 | 0 | break; |
1275 | 0 | case FILE_INVALID: |
1276 | 0 | default: |
1277 | | /* invalid search type, but no need to complain here */ |
1278 | 0 | break; |
1279 | 0 | } |
1280 | 0 | } |
1281 | | |
1282 | | file_private int |
1283 | | addentry(struct magic_set *ms, struct magic_entry *me, |
1284 | | struct magic_entry_set *mset) |
1285 | 0 | { |
1286 | 0 | size_t i = me->mp->type == FILE_NAME ? 1 : 0; |
1287 | 0 | if (mset[i].me == NULL || mset[i].count == mset[i].max) { |
1288 | 0 | struct magic_entry *mp; |
1289 | |
|
1290 | 0 | size_t incr = mset[i].max + ALLOC_INCR; |
1291 | 0 | if ((mp = CAST(struct magic_entry *, |
1292 | 0 | realloc(mset[i].me, sizeof(*mp) * incr))) == |
1293 | 0 | NULL) { |
1294 | 0 | file_oomem(ms, sizeof(*mp) * incr); |
1295 | 0 | return -1; |
1296 | 0 | } |
1297 | 0 | (void)memset(&mp[mset[i].count], 0, sizeof(*mp) * |
1298 | 0 | ALLOC_INCR); |
1299 | 0 | mset[i].me = mp; |
1300 | 0 | mset[i].max = CAST(uint32_t, incr); |
1301 | 0 | assert(mset[i].max == incr); |
1302 | 0 | } |
1303 | 0 | mset[i].me[mset[i].count++] = *me; |
1304 | 0 | memset(me, 0, sizeof(*me)); |
1305 | 0 | return 0; |
1306 | 0 | } |
1307 | | |
1308 | | /* |
1309 | | * Load and parse one file. |
1310 | | */ |
1311 | | file_private void |
1312 | | load_1(struct magic_set *ms, int action, const char *fn, int *errs, |
1313 | | struct magic_entry_set *mset) |
1314 | 0 | { |
1315 | 0 | size_t lineno = 0, llen = 0; |
1316 | 0 | char *line = NULL; |
1317 | 0 | ssize_t len; |
1318 | 0 | struct magic_entry me; |
1319 | |
|
1320 | 0 | FILE *f = fopen(ms->file = fn, "r"); |
1321 | 0 | if (f == NULL) { |
1322 | 0 | if (errno != ENOENT) |
1323 | 0 | file_error(ms, errno, "cannot read magic file `%s'", |
1324 | 0 | fn); |
1325 | 0 | (*errs)++; |
1326 | 0 | return; |
1327 | 0 | } |
1328 | | |
1329 | 0 | memset(&me, 0, sizeof(me)); |
1330 | | /* read and parse this file */ |
1331 | 0 | for (ms->line = 1; (len = getline(&line, &llen, f)) != -1; |
1332 | 0 | ms->line++) { |
1333 | 0 | if (len == 0) /* null line, garbage, etc */ |
1334 | 0 | continue; |
1335 | 0 | if (line[len - 1] == '\n') { |
1336 | 0 | lineno++; |
1337 | 0 | line[len - 1] = '\0'; /* delete newline */ |
1338 | 0 | } |
1339 | 0 | switch (line[0]) { |
1340 | 0 | case '\0': /* empty, do not parse */ |
1341 | 0 | case '#': /* comment, do not parse */ |
1342 | 0 | continue; |
1343 | 0 | case '!': |
1344 | 0 | if (line[1] == ':') { |
1345 | 0 | size_t i; |
1346 | |
|
1347 | 0 | for (i = 0; bang[i].name != NULL; i++) { |
1348 | 0 | if (CAST(size_t, len - 2) > bang[i].len && |
1349 | 0 | memcmp(bang[i].name, line + 2, |
1350 | 0 | bang[i].len) == 0) |
1351 | 0 | break; |
1352 | 0 | } |
1353 | 0 | if (bang[i].name == NULL) { |
1354 | 0 | file_error(ms, 0, |
1355 | 0 | "Unknown !: entry `%s'", line); |
1356 | 0 | (*errs)++; |
1357 | 0 | continue; |
1358 | 0 | } |
1359 | 0 | if (me.mp == NULL) { |
1360 | 0 | file_error(ms, 0, |
1361 | 0 | "No current entry for :!%s type", |
1362 | 0 | bang[i].name); |
1363 | 0 | (*errs)++; |
1364 | 0 | continue; |
1365 | 0 | } |
1366 | 0 | if ((*bang[i].fun)(ms, &me, |
1367 | 0 | line + bang[i].len + 2, |
1368 | 0 | len - bang[i].len - 2) != 0) { |
1369 | 0 | (*errs)++; |
1370 | 0 | continue; |
1371 | 0 | } |
1372 | 0 | continue; |
1373 | 0 | } |
1374 | | /*FALLTHROUGH*/ |
1375 | 0 | default: |
1376 | 0 | again: |
1377 | 0 | switch (parse(ms, &me, line, lineno, action)) { |
1378 | 0 | case 0: |
1379 | 0 | continue; |
1380 | 0 | case 1: |
1381 | 0 | (void)addentry(ms, &me, mset); |
1382 | 0 | goto again; |
1383 | 0 | default: |
1384 | 0 | (*errs)++; |
1385 | 0 | break; |
1386 | 0 | } |
1387 | 0 | } |
1388 | 0 | } |
1389 | 0 | if (me.mp) |
1390 | 0 | (void)addentry(ms, &me, mset); |
1391 | 0 | free(line); |
1392 | 0 | (void)fclose(f); |
1393 | 0 | } |
1394 | | |
1395 | | /* |
1396 | | * parse a file or directory of files |
1397 | | * const char *fn: name of magic file or directory |
1398 | | */ |
1399 | | file_private int |
1400 | | cmpstrp(const void *p1, const void *p2) |
1401 | 0 | { |
1402 | 0 | return strcmp(*RCAST(char *const *, p1), *RCAST(char *const *, p2)); |
1403 | 0 | } |
1404 | | |
1405 | | |
1406 | | file_private uint32_t |
1407 | | set_text_binary(struct magic_set *ms, struct magic_entry *me, uint32_t nme, |
1408 | | uint32_t starttest) |
1409 | 0 | { |
1410 | 0 | static const char text[] = "text"; |
1411 | 0 | static const char binary[] = "binary"; |
1412 | 0 | static const size_t len = sizeof(text); |
1413 | |
|
1414 | 0 | uint32_t i = starttest; |
1415 | |
|
1416 | 0 | do { |
1417 | 0 | set_test_type(me[starttest].mp, me[i].mp); |
1418 | 0 | if ((ms->flags & MAGIC_DEBUG) == 0) |
1419 | 0 | continue; |
1420 | 0 | (void)fprintf(stderr, "%s%s%s: %s\n", |
1421 | 0 | me[i].mp->mimetype, |
1422 | 0 | me[i].mp->mimetype[0] == '\0' ? "" : "; ", |
1423 | 0 | me[i].mp->desc[0] ? me[i].mp->desc : "(no description)", |
1424 | 0 | me[i].mp->flag & BINTEST ? binary : text); |
1425 | 0 | if (me[i].mp->flag & BINTEST) { |
1426 | 0 | char *p = strstr(me[i].mp->desc, text); |
1427 | 0 | if (p && (p == me[i].mp->desc || |
1428 | 0 | isspace(CAST(unsigned char, p[-1]))) && |
1429 | 0 | (p + len - me[i].mp->desc == MAXstring |
1430 | 0 | || (p[len] == '\0' || |
1431 | 0 | isspace(CAST(unsigned char, p[len]))))) |
1432 | 0 | (void)fprintf(stderr, "*** Possible " |
1433 | 0 | "binary test for text type\n"); |
1434 | 0 | } |
1435 | 0 | } while (++i < nme && me[i].mp->cont_level != 0); |
1436 | 0 | return i; |
1437 | 0 | } |
1438 | | |
1439 | | file_private void |
1440 | | set_last_default(struct magic_set *ms, struct magic_entry *me, uint32_t nme) |
1441 | 0 | { |
1442 | 0 | uint32_t i; |
1443 | 0 | for (i = 0; i < nme; i++) { |
1444 | 0 | if (me[i].mp->cont_level == 0 && |
1445 | 0 | me[i].mp->type == FILE_DEFAULT) { |
1446 | 0 | while (++i < nme) |
1447 | 0 | if (me[i].mp->cont_level == 0) |
1448 | 0 | break; |
1449 | 0 | if (i != nme) { |
1450 | | /* XXX - Ugh! */ |
1451 | 0 | ms->line = me[i].mp->lineno; |
1452 | 0 | file_magwarn(ms, |
1453 | 0 | "level 0 \"default\" did not sort last"); |
1454 | 0 | } |
1455 | 0 | return; |
1456 | 0 | } |
1457 | 0 | } |
1458 | 0 | } |
1459 | | |
1460 | | file_private int |
1461 | | coalesce_entries(struct magic_set *ms, struct magic_entry *me, uint32_t nme, |
1462 | | struct magic **ma, uint32_t *nma) |
1463 | 0 | { |
1464 | 0 | uint32_t i, mentrycount = 0; |
1465 | 0 | size_t slen; |
1466 | |
|
1467 | 0 | for (i = 0; i < nme; i++) |
1468 | 0 | mentrycount += me[i].cont_count; |
1469 | |
|
1470 | 0 | if (mentrycount == 0) { |
1471 | 0 | *ma = NULL; |
1472 | 0 | *nma = 0; |
1473 | 0 | return 0; |
1474 | 0 | } |
1475 | | |
1476 | 0 | slen = sizeof(**ma) * mentrycount; |
1477 | 0 | if ((*ma = CAST(struct magic *, malloc(slen))) == NULL) { |
1478 | 0 | file_oomem(ms, slen); |
1479 | 0 | return -1; |
1480 | 0 | } |
1481 | | |
1482 | 0 | mentrycount = 0; |
1483 | 0 | for (i = 0; i < nme; i++) { |
1484 | 0 | (void)memcpy(*ma + mentrycount, me[i].mp, |
1485 | 0 | me[i].cont_count * sizeof(**ma)); |
1486 | 0 | mentrycount += me[i].cont_count; |
1487 | 0 | } |
1488 | 0 | *nma = mentrycount; |
1489 | 0 | return 0; |
1490 | 0 | } |
1491 | | |
1492 | | file_private void |
1493 | | magic_entry_free(struct magic_entry *me, uint32_t nme) |
1494 | 0 | { |
1495 | 0 | uint32_t i; |
1496 | 0 | if (me == NULL) |
1497 | 0 | return; |
1498 | 0 | for (i = 0; i < nme; i++) |
1499 | 0 | free(me[i].mp); |
1500 | 0 | free(me); |
1501 | 0 | } |
1502 | | |
1503 | | file_private struct magic_map * |
1504 | | apprentice_load(struct magic_set *ms, const char *fn, int action) |
1505 | 0 | { |
1506 | 0 | int errs = 0; |
1507 | 0 | uint32_t i, j; |
1508 | 0 | size_t files = 0, maxfiles = 0; |
1509 | 0 | char **filearr = NULL, *mfn; |
1510 | 0 | struct stat st; |
1511 | 0 | struct magic_map *map; |
1512 | 0 | struct magic_entry_set mset[MAGIC_SETS]; |
1513 | 0 | DIR *dir; |
1514 | 0 | struct dirent *d; |
1515 | |
|
1516 | 0 | memset(mset, 0, sizeof(mset)); |
1517 | 0 | ms->flags |= MAGIC_CHECK; /* Enable checks for parsed files */ |
1518 | | |
1519 | |
|
1520 | 0 | if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) |
1521 | 0 | { |
1522 | 0 | file_oomem(ms, sizeof(*map)); |
1523 | 0 | return NULL; |
1524 | 0 | } |
1525 | 0 | map->type = MAP_TYPE_MALLOC; |
1526 | | |
1527 | | /* print silly verbose header for USG compat. */ |
1528 | 0 | if (action == FILE_CHECK) |
1529 | 0 | (void)fprintf(stderr, "%s\n", usg_hdr); |
1530 | | |
1531 | | /* load directory or file */ |
1532 | 0 | if (stat(fn, &st) == 0 && S_ISDIR(st.st_mode)) { |
1533 | 0 | dir = opendir(fn); |
1534 | 0 | if (!dir) { |
1535 | 0 | errs++; |
1536 | 0 | goto out; |
1537 | 0 | } |
1538 | 0 | while ((d = readdir(dir)) != NULL) { |
1539 | 0 | if (d->d_name[0] == '.') |
1540 | 0 | continue; |
1541 | 0 | if (asprintf(&mfn, "%s/%s", fn, d->d_name) < 0) { |
1542 | 0 | file_oomem(ms, |
1543 | 0 | strlen(fn) + strlen(d->d_name) + 2); |
1544 | 0 | errs++; |
1545 | 0 | closedir(dir); |
1546 | 0 | goto out; |
1547 | 0 | } |
1548 | 0 | if (stat(mfn, &st) == -1 || !S_ISREG(st.st_mode)) { |
1549 | 0 | free(mfn); |
1550 | 0 | continue; |
1551 | 0 | } |
1552 | 0 | if (files >= maxfiles) { |
1553 | 0 | size_t mlen; |
1554 | 0 | char **nfilearr; |
1555 | 0 | maxfiles = (maxfiles + 1) * 2; |
1556 | 0 | mlen = maxfiles * sizeof(*filearr); |
1557 | 0 | if ((nfilearr = CAST(char **, |
1558 | 0 | realloc(filearr, mlen))) == NULL) { |
1559 | 0 | file_oomem(ms, mlen); |
1560 | 0 | free(mfn); |
1561 | 0 | closedir(dir); |
1562 | 0 | errs++; |
1563 | 0 | goto out; |
1564 | 0 | } |
1565 | 0 | filearr = nfilearr; |
1566 | 0 | } |
1567 | 0 | filearr[files++] = mfn; |
1568 | 0 | } |
1569 | 0 | closedir(dir); |
1570 | 0 | if (filearr) { |
1571 | 0 | qsort(filearr, files, sizeof(*filearr), cmpstrp); |
1572 | 0 | for (i = 0; i < files; i++) { |
1573 | 0 | load_1(ms, action, filearr[i], &errs, mset); |
1574 | 0 | free(filearr[i]); |
1575 | 0 | } |
1576 | 0 | free(filearr); |
1577 | 0 | filearr = NULL; |
1578 | 0 | } |
1579 | 0 | } else |
1580 | 0 | load_1(ms, action, fn, &errs, mset); |
1581 | 0 | if (errs) |
1582 | 0 | goto out; |
1583 | | |
1584 | 0 | for (j = 0; j < MAGIC_SETS; j++) { |
1585 | | /* Set types of tests */ |
1586 | 0 | for (i = 0; i < mset[j].count; ) { |
1587 | 0 | if (mset[j].me[i].mp->cont_level != 0) { |
1588 | 0 | i++; |
1589 | 0 | continue; |
1590 | 0 | } |
1591 | 0 | i = set_text_binary(ms, mset[j].me, mset[j].count, i); |
1592 | 0 | } |
1593 | 0 | if (mset[j].me) |
1594 | 0 | qsort(mset[j].me, mset[j].count, sizeof(*mset[0].me), |
1595 | 0 | apprentice_sort); |
1596 | | |
1597 | | /* |
1598 | | * Make sure that any level 0 "default" line is last |
1599 | | * (if one exists). |
1600 | | */ |
1601 | 0 | set_last_default(ms, mset[j].me, mset[j].count); |
1602 | | |
1603 | | /* coalesce per file arrays into a single one, if needed */ |
1604 | 0 | if (mset[j].count == 0) |
1605 | 0 | continue; |
1606 | | |
1607 | 0 | if (coalesce_entries(ms, mset[j].me, mset[j].count, |
1608 | 0 | &map->magic[j], &map->nmagic[j]) == -1) { |
1609 | 0 | errs++; |
1610 | 0 | goto out; |
1611 | 0 | } |
1612 | 0 | } |
1613 | | |
1614 | 0 | out: |
1615 | 0 | free(filearr); |
1616 | 0 | for (j = 0; j < MAGIC_SETS; j++) |
1617 | 0 | magic_entry_free(mset[j].me, mset[j].count); |
1618 | |
|
1619 | 0 | if (errs) { |
1620 | 0 | apprentice_unmap(map); |
1621 | 0 | return NULL; |
1622 | 0 | } |
1623 | 0 | return map; |
1624 | 0 | } |
1625 | | |
1626 | | /* |
1627 | | * extend the sign bit if the comparison is to be signed |
1628 | | */ |
1629 | | file_protected uint64_t |
1630 | | file_signextend(struct magic_set *ms, struct magic *m, uint64_t v) |
1631 | 71.4M | { |
1632 | 71.4M | if (!(m->flag & UNSIGNED)) { |
1633 | 67.3M | switch(m->type) { |
1634 | | /* |
1635 | | * Do not remove the casts below. They are |
1636 | | * vital. When later compared with the data, |
1637 | | * the sign extension must have happened. |
1638 | | */ |
1639 | 607k | case FILE_BYTE: |
1640 | 607k | v = CAST(signed char, v); |
1641 | 607k | break; |
1642 | 809k | case FILE_SHORT: |
1643 | 4.01M | case FILE_BESHORT: |
1644 | 6.00M | case FILE_LESHORT: |
1645 | 6.00M | v = CAST(short, v); |
1646 | 6.00M | break; |
1647 | 0 | case FILE_DATE: |
1648 | 168 | case FILE_BEDATE: |
1649 | 517 | case FILE_LEDATE: |
1650 | 585 | case FILE_MEDATE: |
1651 | 585 | case FILE_LDATE: |
1652 | 1.15k | case FILE_BELDATE: |
1653 | 1.19k | case FILE_LELDATE: |
1654 | 1.19k | case FILE_MELDATE: |
1655 | 1.21M | case FILE_LONG: |
1656 | 10.7M | case FILE_BELONG: |
1657 | 14.1M | case FILE_LELONG: |
1658 | 14.1M | case FILE_MELONG: |
1659 | 14.1M | case FILE_FLOAT: |
1660 | 14.1M | case FILE_BEFLOAT: |
1661 | 14.1M | case FILE_LEFLOAT: |
1662 | 14.1M | case FILE_MSDOSDATE: |
1663 | 14.1M | case FILE_BEMSDOSDATE: |
1664 | 14.1M | case FILE_LEMSDOSDATE: |
1665 | 14.1M | case FILE_MSDOSTIME: |
1666 | 14.1M | case FILE_BEMSDOSTIME: |
1667 | 14.1M | case FILE_LEMSDOSTIME: |
1668 | 14.1M | v = CAST(int32_t, v); |
1669 | 14.1M | break; |
1670 | 56.0k | case FILE_QUAD: |
1671 | 602k | case FILE_BEQUAD: |
1672 | 875k | case FILE_LEQUAD: |
1673 | 875k | case FILE_QDATE: |
1674 | 875k | case FILE_QLDATE: |
1675 | 875k | case FILE_QWDATE: |
1676 | 876k | case FILE_BEQDATE: |
1677 | 876k | case FILE_BEQLDATE: |
1678 | 876k | case FILE_BEQWDATE: |
1679 | 876k | case FILE_LEQDATE: |
1680 | 876k | case FILE_LEQLDATE: |
1681 | 877k | case FILE_LEQWDATE: |
1682 | 877k | case FILE_DOUBLE: |
1683 | 877k | case FILE_BEDOUBLE: |
1684 | 877k | case FILE_LEDOUBLE: |
1685 | 877k | case FILE_OFFSET: |
1686 | 877k | case FILE_BEVARINT: |
1687 | 877k | case FILE_LEVARINT: |
1688 | 877k | v = CAST(int64_t, v); |
1689 | 877k | break; |
1690 | 44.8M | case FILE_STRING: |
1691 | 44.8M | case FILE_PSTRING: |
1692 | 44.8M | case FILE_BESTRING16: |
1693 | 44.9M | case FILE_LESTRING16: |
1694 | 45.1M | case FILE_REGEX: |
1695 | 45.5M | case FILE_SEARCH: |
1696 | 45.6M | case FILE_DEFAULT: |
1697 | 45.6M | case FILE_INDIRECT: |
1698 | 45.6M | case FILE_NAME: |
1699 | 45.6M | case FILE_USE: |
1700 | 45.6M | case FILE_CLEAR: |
1701 | 45.6M | case FILE_DER: |
1702 | 45.7M | case FILE_GUID: |
1703 | 45.7M | case FILE_OCTAL: |
1704 | 45.7M | break; |
1705 | 0 | default: |
1706 | 0 | if (ms->flags & MAGIC_CHECK) |
1707 | 0 | file_magwarn(ms, "cannot happen: m->type=%d\n", |
1708 | 0 | m->type); |
1709 | 0 | return FILE_BADSIZE; |
1710 | 67.3M | } |
1711 | 67.3M | } |
1712 | 71.4M | return v; |
1713 | 71.4M | } |
1714 | | |
1715 | | file_private int |
1716 | | string_modifier_check(struct magic_set *ms, struct magic *m) |
1717 | 0 | { |
1718 | 0 | if ((ms->flags & MAGIC_CHECK) == 0) |
1719 | 0 | return 0; |
1720 | | |
1721 | 0 | if ((m->type != FILE_REGEX || (m->str_flags & REGEX_LINE_COUNT) == 0) && |
1722 | 0 | (m->type != FILE_PSTRING && (m->str_flags & PSTRING_LEN) != 0)) { |
1723 | 0 | file_magwarn(ms, |
1724 | 0 | "'/BHhLl' modifiers are only allowed for pascal strings\n"); |
1725 | 0 | return -1; |
1726 | 0 | } |
1727 | 0 | switch (m->type) { |
1728 | 0 | case FILE_BESTRING16: |
1729 | 0 | case FILE_LESTRING16: |
1730 | 0 | if (m->str_flags != 0) { |
1731 | 0 | file_magwarn(ms, |
1732 | 0 | "no modifiers allowed for 16-bit strings\n"); |
1733 | 0 | return -1; |
1734 | 0 | } |
1735 | 0 | break; |
1736 | 0 | case FILE_STRING: |
1737 | 0 | case FILE_PSTRING: |
1738 | 0 | if ((m->str_flags & REGEX_OFFSET_START) != 0) { |
1739 | 0 | file_magwarn(ms, |
1740 | 0 | "'/%c' only allowed on regex and search\n", |
1741 | 0 | CHAR_REGEX_OFFSET_START); |
1742 | 0 | return -1; |
1743 | 0 | } |
1744 | 0 | break; |
1745 | 0 | case FILE_SEARCH: |
1746 | 0 | if (m->str_range == 0) { |
1747 | 0 | file_magwarn(ms, |
1748 | 0 | "missing range; defaulting to %d\n", |
1749 | 0 | STRING_DEFAULT_RANGE); |
1750 | 0 | m->str_range = STRING_DEFAULT_RANGE; |
1751 | 0 | return -1; |
1752 | 0 | } |
1753 | 0 | break; |
1754 | 0 | case FILE_REGEX: |
1755 | 0 | if ((m->str_flags & STRING_COMPACT_WHITESPACE) != 0) { |
1756 | 0 | file_magwarn(ms, "'/%c' not allowed on regex\n", |
1757 | 0 | CHAR_COMPACT_WHITESPACE); |
1758 | 0 | return -1; |
1759 | 0 | } |
1760 | 0 | if ((m->str_flags & STRING_COMPACT_OPTIONAL_WHITESPACE) != 0) { |
1761 | 0 | file_magwarn(ms, "'/%c' not allowed on regex\n", |
1762 | 0 | CHAR_COMPACT_OPTIONAL_WHITESPACE); |
1763 | 0 | return -1; |
1764 | 0 | } |
1765 | 0 | break; |
1766 | 0 | default: |
1767 | 0 | file_magwarn(ms, "coding error: m->type=%d\n", |
1768 | 0 | m->type); |
1769 | 0 | return -1; |
1770 | 0 | } |
1771 | 0 | return 0; |
1772 | 0 | } |
1773 | | |
1774 | | file_private int |
1775 | | get_op(char c) |
1776 | 0 | { |
1777 | 0 | switch (c) { |
1778 | 0 | case '&': |
1779 | 0 | return FILE_OPAND; |
1780 | 0 | case '|': |
1781 | 0 | return FILE_OPOR; |
1782 | 0 | case '^': |
1783 | 0 | return FILE_OPXOR; |
1784 | 0 | case '+': |
1785 | 0 | return FILE_OPADD; |
1786 | 0 | case '-': |
1787 | 0 | return FILE_OPMINUS; |
1788 | 0 | case '*': |
1789 | 0 | return FILE_OPMULTIPLY; |
1790 | 0 | case '/': |
1791 | 0 | return FILE_OPDIVIDE; |
1792 | 0 | case '%': |
1793 | 0 | return FILE_OPMODULO; |
1794 | 0 | default: |
1795 | 0 | return -1; |
1796 | 0 | } |
1797 | 0 | } |
1798 | | |
1799 | | #ifdef ENABLE_CONDITIONALS |
1800 | | file_private int |
1801 | | get_cond(const char *l, const char **t) |
1802 | 0 | { |
1803 | 0 | static const struct cond_tbl_s { |
1804 | 0 | char name[8]; |
1805 | 0 | size_t len; |
1806 | 0 | int cond; |
1807 | 0 | } cond_tbl[] = { |
1808 | 0 | { "if", 2, COND_IF }, |
1809 | 0 | { "elif", 4, COND_ELIF }, |
1810 | 0 | { "else", 4, COND_ELSE }, |
1811 | 0 | { "", 0, COND_NONE }, |
1812 | 0 | }; |
1813 | 0 | const struct cond_tbl_s *p; |
1814 | |
|
1815 | 0 | for (p = cond_tbl; p->len; p++) { |
1816 | 0 | if (strncmp(l, p->name, p->len) == 0 && |
1817 | 0 | isspace(CAST(unsigned char, l[p->len]))) { |
1818 | 0 | if (t) |
1819 | 0 | *t = l + p->len; |
1820 | 0 | break; |
1821 | 0 | } |
1822 | 0 | } |
1823 | 0 | return p->cond; |
1824 | 0 | } |
1825 | | |
1826 | | file_private int |
1827 | | check_cond(struct magic_set *ms, int cond, uint32_t cont_level) |
1828 | 0 | { |
1829 | 0 | int last_cond; |
1830 | 0 | last_cond = ms->c.li[cont_level].last_cond; |
1831 | |
|
1832 | 0 | switch (cond) { |
1833 | 0 | case COND_IF: |
1834 | 0 | if (last_cond != COND_NONE && last_cond != COND_ELIF) { |
1835 | 0 | if (ms->flags & MAGIC_CHECK) |
1836 | 0 | file_magwarn(ms, "syntax error: `if'"); |
1837 | 0 | return -1; |
1838 | 0 | } |
1839 | 0 | last_cond = COND_IF; |
1840 | 0 | break; |
1841 | | |
1842 | 0 | case COND_ELIF: |
1843 | 0 | if (last_cond != COND_IF && last_cond != COND_ELIF) { |
1844 | 0 | if (ms->flags & MAGIC_CHECK) |
1845 | 0 | file_magwarn(ms, "syntax error: `elif'"); |
1846 | 0 | return -1; |
1847 | 0 | } |
1848 | 0 | last_cond = COND_ELIF; |
1849 | 0 | break; |
1850 | | |
1851 | 0 | case COND_ELSE: |
1852 | 0 | if (last_cond != COND_IF && last_cond != COND_ELIF) { |
1853 | 0 | if (ms->flags & MAGIC_CHECK) |
1854 | 0 | file_magwarn(ms, "syntax error: `else'"); |
1855 | 0 | return -1; |
1856 | 0 | } |
1857 | 0 | last_cond = COND_NONE; |
1858 | 0 | break; |
1859 | | |
1860 | 0 | case COND_NONE: |
1861 | 0 | last_cond = COND_NONE; |
1862 | 0 | break; |
1863 | 0 | } |
1864 | | |
1865 | 0 | ms->c.li[cont_level].last_cond = last_cond; |
1866 | 0 | return 0; |
1867 | 0 | } |
1868 | | #endif /* ENABLE_CONDITIONALS */ |
1869 | | |
1870 | | file_private int |
1871 | | parse_indirect_modifier(struct magic_set *ms, struct magic *m, const char **lp) |
1872 | 0 | { |
1873 | 0 | const char *l = *lp; |
1874 | |
|
1875 | 0 | while (!isspace(CAST(unsigned char, *++l))) |
1876 | 0 | switch (*l) { |
1877 | 0 | case CHAR_INDIRECT_RELATIVE: |
1878 | 0 | m->str_flags |= INDIRECT_RELATIVE; |
1879 | 0 | break; |
1880 | 0 | default: |
1881 | 0 | if (ms->flags & MAGIC_CHECK) |
1882 | 0 | file_magwarn(ms, "indirect modifier `%c' " |
1883 | 0 | "invalid", *l); |
1884 | 0 | *lp = l; |
1885 | 0 | return -1; |
1886 | 0 | } |
1887 | 0 | *lp = l; |
1888 | 0 | return 0; |
1889 | 0 | } |
1890 | | |
1891 | | file_private void |
1892 | | parse_op_modifier(struct magic_set *ms, struct magic *m, const char **lp, |
1893 | | int op) |
1894 | 0 | { |
1895 | 0 | const char *l = *lp; |
1896 | 0 | char *t; |
1897 | 0 | uint64_t val; |
1898 | |
|
1899 | 0 | ++l; |
1900 | 0 | m->mask_op |= op; |
1901 | 0 | val = CAST(uint64_t, strtoull(l, &t, 0)); |
1902 | 0 | l = t; |
1903 | 0 | m->num_mask = file_signextend(ms, m, val); |
1904 | 0 | eatsize(&l); |
1905 | 0 | *lp = l; |
1906 | 0 | } |
1907 | | |
1908 | | file_private int |
1909 | | parse_string_modifier(struct magic_set *ms, struct magic *m, const char **lp) |
1910 | 0 | { |
1911 | 0 | const char *l = *lp; |
1912 | 0 | char *t; |
1913 | 0 | int have_range = 0; |
1914 | |
|
1915 | 0 | while (!isspace(CAST(unsigned char, *++l))) { |
1916 | 0 | switch (*l) { |
1917 | 0 | case '0': case '1': case '2': |
1918 | 0 | case '3': case '4': case '5': |
1919 | 0 | case '6': case '7': case '8': |
1920 | 0 | case '9': |
1921 | 0 | if (have_range && (ms->flags & MAGIC_CHECK)) |
1922 | 0 | file_magwarn(ms, "multiple ranges"); |
1923 | 0 | have_range = 1; |
1924 | 0 | m->str_range = CAST(uint32_t, strtoul(l, &t, 0)); |
1925 | 0 | if (m->str_range == 0) |
1926 | 0 | file_magwarn(ms, "zero range"); |
1927 | 0 | l = t - 1; |
1928 | 0 | break; |
1929 | 0 | case CHAR_COMPACT_WHITESPACE: |
1930 | 0 | m->str_flags |= STRING_COMPACT_WHITESPACE; |
1931 | 0 | break; |
1932 | 0 | case CHAR_COMPACT_OPTIONAL_WHITESPACE: |
1933 | 0 | m->str_flags |= STRING_COMPACT_OPTIONAL_WHITESPACE; |
1934 | 0 | break; |
1935 | 0 | case CHAR_IGNORE_LOWERCASE: |
1936 | 0 | m->str_flags |= STRING_IGNORE_LOWERCASE; |
1937 | 0 | break; |
1938 | 0 | case CHAR_IGNORE_UPPERCASE: |
1939 | 0 | m->str_flags |= STRING_IGNORE_UPPERCASE; |
1940 | 0 | break; |
1941 | 0 | case CHAR_REGEX_OFFSET_START: |
1942 | 0 | m->str_flags |= REGEX_OFFSET_START; |
1943 | 0 | break; |
1944 | 0 | case CHAR_BINTEST: |
1945 | 0 | m->str_flags |= STRING_BINTEST; |
1946 | 0 | break; |
1947 | 0 | case CHAR_TEXTTEST: |
1948 | 0 | m->str_flags |= STRING_TEXTTEST; |
1949 | 0 | break; |
1950 | 0 | case CHAR_TRIM: |
1951 | 0 | m->str_flags |= STRING_TRIM; |
1952 | 0 | break; |
1953 | 0 | case CHAR_FULL_WORD: |
1954 | 0 | m->str_flags |= STRING_FULL_WORD; |
1955 | 0 | break; |
1956 | 0 | case CHAR_PSTRING_1_LE: |
1957 | 0 | #define SET_LENGTH(a) m->str_flags = (m->str_flags & ~PSTRING_LEN) | (a) |
1958 | 0 | if (m->type != FILE_PSTRING) |
1959 | 0 | goto bad; |
1960 | 0 | SET_LENGTH(PSTRING_1_LE); |
1961 | 0 | break; |
1962 | 0 | case CHAR_PSTRING_2_BE: |
1963 | 0 | if (m->type != FILE_PSTRING) |
1964 | 0 | goto bad; |
1965 | 0 | SET_LENGTH(PSTRING_2_BE); |
1966 | 0 | break; |
1967 | 0 | case CHAR_PSTRING_2_LE: |
1968 | 0 | if (m->type != FILE_PSTRING) |
1969 | 0 | goto bad; |
1970 | 0 | SET_LENGTH(PSTRING_2_LE); |
1971 | 0 | break; |
1972 | 0 | case CHAR_PSTRING_4_BE: |
1973 | 0 | if (m->type != FILE_PSTRING) |
1974 | 0 | goto bad; |
1975 | 0 | SET_LENGTH(PSTRING_4_BE); |
1976 | 0 | break; |
1977 | 0 | case CHAR_PSTRING_4_LE: |
1978 | 0 | switch (m->type) { |
1979 | 0 | case FILE_PSTRING: |
1980 | 0 | case FILE_REGEX: |
1981 | 0 | break; |
1982 | 0 | default: |
1983 | 0 | goto bad; |
1984 | 0 | } |
1985 | 0 | SET_LENGTH(PSTRING_4_LE); |
1986 | 0 | break; |
1987 | 0 | case CHAR_PSTRING_LENGTH_INCLUDES_ITSELF: |
1988 | 0 | if (m->type != FILE_PSTRING) |
1989 | 0 | goto bad; |
1990 | 0 | m->str_flags |= PSTRING_LENGTH_INCLUDES_ITSELF; |
1991 | 0 | break; |
1992 | 0 | default: |
1993 | 0 | bad: |
1994 | 0 | if (ms->flags & MAGIC_CHECK) |
1995 | 0 | file_magwarn(ms, "string modifier `%c' " |
1996 | 0 | "invalid", *l); |
1997 | 0 | goto out; |
1998 | 0 | } |
1999 | | /* allow multiple '/' for readability */ |
2000 | 0 | if (l[1] == '/' && !isspace(CAST(unsigned char, l[2]))) |
2001 | 0 | l++; |
2002 | 0 | } |
2003 | 0 | if (string_modifier_check(ms, m) == -1) |
2004 | 0 | goto out; |
2005 | 0 | *lp = l; |
2006 | 0 | return 0; |
2007 | 0 | out: |
2008 | 0 | *lp = l; |
2009 | 0 | return -1; |
2010 | 0 | } |
2011 | | |
2012 | | /* |
2013 | | * parse one line from magic file, put into magic[index++] if valid |
2014 | | */ |
2015 | | file_private int |
2016 | | parse(struct magic_set *ms, struct magic_entry *me, const char *line, |
2017 | | size_t lineno, int action) |
2018 | 0 | { |
2019 | 0 | #ifdef ENABLE_CONDITIONALS |
2020 | 0 | static uint32_t last_cont_level = 0; |
2021 | 0 | #endif |
2022 | 0 | size_t i; |
2023 | 0 | struct magic *m; |
2024 | 0 | const char *l = line; |
2025 | 0 | char *t; |
2026 | 0 | int op; |
2027 | 0 | uint32_t cont_level; |
2028 | 0 | int32_t diff; |
2029 | |
|
2030 | 0 | cont_level = 0; |
2031 | | |
2032 | | /* |
2033 | | * Parse the offset. |
2034 | | */ |
2035 | 0 | while (*l == '>') { |
2036 | 0 | ++l; /* step over */ |
2037 | 0 | cont_level++; |
2038 | 0 | } |
2039 | 0 | #ifdef ENABLE_CONDITIONALS |
2040 | 0 | if (cont_level == 0 || cont_level > last_cont_level) |
2041 | 0 | if (file_check_mem(ms, cont_level) == -1) |
2042 | 0 | return -1; |
2043 | 0 | last_cont_level = cont_level; |
2044 | 0 | #endif |
2045 | 0 | if (cont_level != 0) { |
2046 | 0 | if (me->mp == NULL) { |
2047 | 0 | file_magerror(ms, "No current entry for continuation"); |
2048 | 0 | return -1; |
2049 | 0 | } |
2050 | 0 | if (me->cont_count == 0) { |
2051 | 0 | file_magerror(ms, "Continuations present with 0 count"); |
2052 | 0 | return -1; |
2053 | 0 | } |
2054 | 0 | m = &me->mp[me->cont_count - 1]; |
2055 | 0 | diff = CAST(int32_t, cont_level) - CAST(int32_t, m->cont_level); |
2056 | 0 | if (diff > 1) |
2057 | 0 | file_magwarn(ms, "New continuation level %u is more " |
2058 | 0 | "than one larger than current level %u", cont_level, |
2059 | 0 | m->cont_level); |
2060 | 0 | if (me->cont_count == me->max_count) { |
2061 | 0 | struct magic *nm; |
2062 | 0 | size_t cnt = me->max_count + ALLOC_CHUNK; |
2063 | 0 | if ((nm = CAST(struct magic *, realloc(me->mp, |
2064 | 0 | sizeof(*nm) * cnt))) == NULL) { |
2065 | 0 | file_oomem(ms, sizeof(*nm) * cnt); |
2066 | 0 | return -1; |
2067 | 0 | } |
2068 | 0 | me->mp = nm; |
2069 | 0 | me->max_count = CAST(uint32_t, cnt); |
2070 | 0 | } |
2071 | 0 | m = &me->mp[me->cont_count++]; |
2072 | 0 | (void)memset(m, 0, sizeof(*m)); |
2073 | 0 | m->cont_level = cont_level; |
2074 | 0 | } else { |
2075 | 0 | static const size_t len = sizeof(*m) * ALLOC_CHUNK; |
2076 | 0 | if (me->mp != NULL) |
2077 | 0 | return 1; |
2078 | 0 | if ((m = CAST(struct magic *, malloc(len))) == NULL) { |
2079 | 0 | file_oomem(ms, len); |
2080 | 0 | return -1; |
2081 | 0 | } |
2082 | 0 | me->mp = m; |
2083 | 0 | me->max_count = ALLOC_CHUNK; |
2084 | 0 | (void)memset(m, 0, sizeof(*m)); |
2085 | 0 | m->factor_op = FILE_FACTOR_OP_NONE; |
2086 | 0 | m->cont_level = 0; |
2087 | 0 | me->cont_count = 1; |
2088 | 0 | } |
2089 | 0 | m->lineno = CAST(uint32_t, lineno); |
2090 | |
|
2091 | 0 | if (*l == '&') { /* m->cont_level == 0 checked below. */ |
2092 | 0 | ++l; /* step over */ |
2093 | 0 | m->flag |= OFFADD; |
2094 | 0 | } |
2095 | 0 | if (*l == '(') { |
2096 | 0 | ++l; /* step over */ |
2097 | 0 | m->flag |= INDIR; |
2098 | 0 | if (m->flag & OFFADD) |
2099 | 0 | m->flag = (m->flag & ~OFFADD) | INDIROFFADD; |
2100 | |
|
2101 | 0 | if (*l == '&') { /* m->cont_level == 0 checked below */ |
2102 | 0 | ++l; /* step over */ |
2103 | 0 | m->flag |= OFFADD; |
2104 | 0 | } |
2105 | 0 | } |
2106 | | /* Indirect offsets are not valid at level 0. */ |
2107 | 0 | if (m->cont_level == 0 && (m->flag & (OFFADD | INDIROFFADD))) { |
2108 | 0 | if (ms->flags & MAGIC_CHECK) |
2109 | 0 | file_magwarn(ms, "relative offset at level 0"); |
2110 | 0 | return -1; |
2111 | 0 | } |
2112 | | |
2113 | | /* get offset, then skip over it */ |
2114 | 0 | if (*l == '-') { |
2115 | 0 | ++l; /* step over */ |
2116 | 0 | m->flag |= OFFNEGATIVE; |
2117 | 0 | } |
2118 | 0 | m->offset = CAST(int32_t, strtol(l, &t, 0)); |
2119 | 0 | if (l == t) { |
2120 | 0 | if (ms->flags & MAGIC_CHECK) |
2121 | 0 | file_magwarn(ms, "offset `%s' invalid", l); |
2122 | 0 | return -1; |
2123 | 0 | } |
2124 | | |
2125 | 0 | l = t; |
2126 | |
|
2127 | 0 | if (m->flag & INDIR) { |
2128 | 0 | m->in_type = FILE_LONG; |
2129 | 0 | m->in_offset = 0; |
2130 | 0 | m->in_op = 0; |
2131 | | /* |
2132 | | * read [.,lbs][+-]nnnnn) |
2133 | | */ |
2134 | 0 | if (*l == '.' || *l == ',') { |
2135 | 0 | if (*l == ',') |
2136 | 0 | m->in_op |= FILE_OPSIGNED; |
2137 | 0 | l++; |
2138 | 0 | switch (*l) { |
2139 | 0 | case 'l': |
2140 | 0 | m->in_type = FILE_LELONG; |
2141 | 0 | break; |
2142 | 0 | case 'L': |
2143 | 0 | m->in_type = FILE_BELONG; |
2144 | 0 | break; |
2145 | 0 | case 'm': |
2146 | 0 | m->in_type = FILE_MELONG; |
2147 | 0 | break; |
2148 | 0 | case 'h': |
2149 | 0 | case 's': |
2150 | 0 | m->in_type = FILE_LESHORT; |
2151 | 0 | break; |
2152 | 0 | case 'H': |
2153 | 0 | case 'S': |
2154 | 0 | m->in_type = FILE_BESHORT; |
2155 | 0 | break; |
2156 | 0 | case 'c': |
2157 | 0 | case 'b': |
2158 | 0 | case 'C': |
2159 | 0 | case 'B': |
2160 | 0 | m->in_type = FILE_BYTE; |
2161 | 0 | break; |
2162 | 0 | case 'e': |
2163 | 0 | case 'f': |
2164 | 0 | case 'g': |
2165 | 0 | m->in_type = FILE_LEDOUBLE; |
2166 | 0 | break; |
2167 | 0 | case 'E': |
2168 | 0 | case 'F': |
2169 | 0 | case 'G': |
2170 | 0 | m->in_type = FILE_BEDOUBLE; |
2171 | 0 | break; |
2172 | 0 | case 'i': |
2173 | 0 | m->in_type = FILE_LEID3; |
2174 | 0 | break; |
2175 | 0 | case 'I': |
2176 | 0 | m->in_type = FILE_BEID3; |
2177 | 0 | break; |
2178 | 0 | case 'o': |
2179 | 0 | m->in_type = FILE_OCTAL; |
2180 | 0 | break; |
2181 | 0 | case 'q': |
2182 | 0 | m->in_type = FILE_LEQUAD; |
2183 | 0 | break; |
2184 | 0 | case 'Q': |
2185 | 0 | m->in_type = FILE_BEQUAD; |
2186 | 0 | break; |
2187 | 0 | default: |
2188 | 0 | if (ms->flags & MAGIC_CHECK) |
2189 | 0 | file_magwarn(ms, |
2190 | 0 | "indirect offset type `%c' invalid", |
2191 | 0 | *l); |
2192 | 0 | return -1; |
2193 | 0 | } |
2194 | 0 | l++; |
2195 | 0 | } |
2196 | | |
2197 | 0 | if (*l == '~') { |
2198 | 0 | m->in_op |= FILE_OPINVERSE; |
2199 | 0 | l++; |
2200 | 0 | } |
2201 | 0 | if ((op = get_op(*l)) != -1) { |
2202 | 0 | m->in_op |= op; |
2203 | 0 | l++; |
2204 | 0 | } |
2205 | 0 | if (*l == '(') { |
2206 | 0 | m->in_op |= FILE_OPINDIRECT; |
2207 | 0 | l++; |
2208 | 0 | } |
2209 | 0 | if (isdigit(CAST(unsigned char, *l)) || *l == '-') { |
2210 | 0 | m->in_offset = CAST(int32_t, strtol(l, &t, 0)); |
2211 | 0 | if (l == t) { |
2212 | 0 | if (ms->flags & MAGIC_CHECK) |
2213 | 0 | file_magwarn(ms, |
2214 | 0 | "in_offset `%s' invalid", l); |
2215 | 0 | return -1; |
2216 | 0 | } |
2217 | 0 | l = t; |
2218 | 0 | } |
2219 | 0 | if (*l++ != ')' || |
2220 | 0 | ((m->in_op & FILE_OPINDIRECT) && *l++ != ')')) { |
2221 | 0 | if (ms->flags & MAGIC_CHECK) |
2222 | 0 | file_magwarn(ms, |
2223 | 0 | "missing ')' in indirect offset"); |
2224 | 0 | return -1; |
2225 | 0 | } |
2226 | 0 | } |
2227 | 0 | EATAB; |
2228 | |
|
2229 | 0 | #ifdef ENABLE_CONDITIONALS |
2230 | 0 | m->cond = get_cond(l, &l); |
2231 | 0 | if (check_cond(ms, m->cond, cont_level) == -1) |
2232 | 0 | return -1; |
2233 | | |
2234 | 0 | EATAB; |
2235 | 0 | #endif |
2236 | | |
2237 | | /* |
2238 | | * Parse the type. |
2239 | | */ |
2240 | 0 | if (*l == 'u') { |
2241 | | /* |
2242 | | * Try it as a keyword type prefixed by "u"; match what |
2243 | | * follows the "u". If that fails, try it as an SUS |
2244 | | * integer type. |
2245 | | */ |
2246 | 0 | m->type = get_type(type_tbl, l + 1, &l); |
2247 | 0 | if (m->type == FILE_INVALID) { |
2248 | | /* |
2249 | | * Not a keyword type; parse it as an SUS type, |
2250 | | * 'u' possibly followed by a number or C/S/L. |
2251 | | */ |
2252 | 0 | m->type = get_standard_integer_type(l, &l); |
2253 | 0 | } |
2254 | | /* It's unsigned. */ |
2255 | 0 | if (m->type != FILE_INVALID) |
2256 | 0 | m->flag |= UNSIGNED; |
2257 | 0 | } else { |
2258 | | /* |
2259 | | * Try it as a keyword type. If that fails, try it as |
2260 | | * an SUS integer type if it begins with "d" or as an |
2261 | | * SUS string type if it begins with "s". In any case, |
2262 | | * it's not unsigned. |
2263 | | */ |
2264 | 0 | m->type = get_type(type_tbl, l, &l); |
2265 | 0 | if (m->type == FILE_INVALID) { |
2266 | | /* |
2267 | | * Not a keyword type; parse it as an SUS type, |
2268 | | * either 'd' possibly followed by a number or |
2269 | | * C/S/L, or just 's'. |
2270 | | */ |
2271 | 0 | if (*l == 'd') |
2272 | 0 | m->type = get_standard_integer_type(l, &l); |
2273 | 0 | else if (*l == 's' |
2274 | 0 | && !isalpha(CAST(unsigned char, l[1]))) { |
2275 | 0 | m->type = FILE_STRING; |
2276 | 0 | ++l; |
2277 | 0 | } |
2278 | 0 | } |
2279 | 0 | } |
2280 | |
|
2281 | 0 | if (m->type == FILE_INVALID) { |
2282 | | /* Not found - try it as a special keyword. */ |
2283 | 0 | m->type = get_type(special_tbl, l, &l); |
2284 | 0 | } |
2285 | |
|
2286 | 0 | if (m->type == FILE_INVALID) { |
2287 | 0 | if (ms->flags & MAGIC_CHECK) |
2288 | 0 | file_magwarn(ms, "type `%s' invalid", l); |
2289 | 0 | return -1; |
2290 | 0 | } |
2291 | | |
2292 | 0 | if (m->type == FILE_NAME && cont_level != 0) { |
2293 | 0 | if (ms->flags & MAGIC_CHECK) |
2294 | 0 | file_magwarn(ms, "`name%s' entries can only be " |
2295 | 0 | "declared at top level", l); |
2296 | 0 | return -1; |
2297 | 0 | } |
2298 | | |
2299 | | /* New-style anding: "0 byte&0x80 =0x80 dynamically linked" */ |
2300 | | /* New and improved: ~ & | ^ + - * / % -- exciting, isn't it? */ |
2301 | | |
2302 | 0 | m->mask_op = 0; |
2303 | 0 | if (*l == '~') { |
2304 | 0 | if (!IS_STRING(m->type)) |
2305 | 0 | m->mask_op |= FILE_OPINVERSE; |
2306 | 0 | else if (ms->flags & MAGIC_CHECK) |
2307 | 0 | file_magwarn(ms, "'~' invalid for string types"); |
2308 | 0 | ++l; |
2309 | 0 | } |
2310 | 0 | m->str_range = 0; |
2311 | 0 | m->str_flags = m->type == FILE_PSTRING ? PSTRING_1_LE : 0; |
2312 | 0 | if ((op = get_op(*l)) != -1) { |
2313 | 0 | if (IS_STRING(m->type)) { |
2314 | 0 | int r; |
2315 | |
|
2316 | 0 | if (op != FILE_OPDIVIDE) { |
2317 | 0 | if (ms->flags & MAGIC_CHECK) |
2318 | 0 | file_magwarn(ms, |
2319 | 0 | "invalid string/indirect op: " |
2320 | 0 | "`%c'", *t); |
2321 | 0 | return -1; |
2322 | 0 | } |
2323 | | |
2324 | 0 | if (m->type == FILE_INDIRECT) |
2325 | 0 | r = parse_indirect_modifier(ms, m, &l); |
2326 | 0 | else |
2327 | 0 | r = parse_string_modifier(ms, m, &l); |
2328 | 0 | if (r == -1) |
2329 | 0 | return -1; |
2330 | 0 | } else |
2331 | 0 | parse_op_modifier(ms, m, &l, op); |
2332 | 0 | } |
2333 | | |
2334 | | /* |
2335 | | * We used to set mask to all 1's here, instead let's just not do |
2336 | | * anything if mask = 0 (unless you have a better idea) |
2337 | | */ |
2338 | 0 | EATAB; |
2339 | |
|
2340 | 0 | switch (*l) { |
2341 | 0 | case '>': |
2342 | 0 | case '<': |
2343 | 0 | m->reln = *l; |
2344 | 0 | ++l; |
2345 | 0 | if (*l == '=') { |
2346 | 0 | if (ms->flags & MAGIC_CHECK) { |
2347 | 0 | file_magwarn(ms, "%c= not supported", |
2348 | 0 | m->reln); |
2349 | 0 | return -1; |
2350 | 0 | } |
2351 | 0 | ++l; |
2352 | 0 | } |
2353 | 0 | break; |
2354 | | /* Old-style anding: "0 byte &0x80 dynamically linked" */ |
2355 | 0 | case '&': |
2356 | 0 | case '^': |
2357 | 0 | case '=': |
2358 | 0 | m->reln = *l; |
2359 | 0 | ++l; |
2360 | 0 | if (*l == '=') { |
2361 | | /* HP compat: ignore &= etc. */ |
2362 | 0 | ++l; |
2363 | 0 | } |
2364 | 0 | break; |
2365 | 0 | case '!': |
2366 | 0 | m->reln = *l; |
2367 | 0 | ++l; |
2368 | 0 | break; |
2369 | 0 | default: |
2370 | 0 | m->reln = '='; /* the default relation */ |
2371 | 0 | if (*l == 'x' && ((isascii(CAST(unsigned char, l[1])) && |
2372 | 0 | isspace(CAST(unsigned char, l[1]))) || !l[1])) { |
2373 | 0 | m->reln = *l; |
2374 | 0 | ++l; |
2375 | 0 | } |
2376 | 0 | break; |
2377 | 0 | } |
2378 | | /* |
2379 | | * Grab the value part, except for an 'x' reln. |
2380 | | */ |
2381 | 0 | if (m->reln != 'x' && getvalue(ms, m, &l, action)) |
2382 | 0 | return -1; |
2383 | | |
2384 | | /* |
2385 | | * TODO finish this macro and start using it! |
2386 | | * #define offsetcheck {if (offset > ms->bytes_max -1) |
2387 | | * magwarn("offset too big"); } |
2388 | | */ |
2389 | | |
2390 | | /* |
2391 | | * Now get last part - the description |
2392 | | */ |
2393 | 0 | EATAB; |
2394 | 0 | if (l[0] == '\b') { |
2395 | 0 | ++l; |
2396 | 0 | m->flag |= NOSPACE; |
2397 | 0 | } else if ((l[0] == '\\') && (l[1] == 'b')) { |
2398 | 0 | ++l; |
2399 | 0 | ++l; |
2400 | 0 | m->flag |= NOSPACE; |
2401 | 0 | } |
2402 | 0 | for (i = 0; (m->desc[i++] = *l++) != '\0' && i < sizeof(m->desc); ) |
2403 | 0 | continue; |
2404 | 0 | if (i == sizeof(m->desc)) { |
2405 | 0 | m->desc[sizeof(m->desc) - 1] = '\0'; |
2406 | 0 | if (ms->flags & MAGIC_CHECK) |
2407 | 0 | file_magwarn(ms, "description `%s' truncated", m->desc); |
2408 | 0 | } |
2409 | | |
2410 | | /* |
2411 | | * We only do this check while compiling, or if any of the magic |
2412 | | * files were not compiled. |
2413 | | */ |
2414 | 0 | if (ms->flags & MAGIC_CHECK) { |
2415 | 0 | if (check_format(ms, m) == -1) |
2416 | 0 | return -1; |
2417 | 0 | } |
2418 | 0 | #ifndef COMPILE_ONLY |
2419 | 0 | if (action == FILE_CHECK) { |
2420 | 0 | file_mdump(m); |
2421 | 0 | } |
2422 | 0 | #endif |
2423 | 0 | m->mimetype[0] = '\0'; /* initialise MIME type to none */ |
2424 | 0 | return 0; |
2425 | 0 | } |
2426 | | |
2427 | | /* |
2428 | | * parse a STRENGTH annotation line from magic file, put into magic[index - 1] |
2429 | | * if valid |
2430 | | */ |
2431 | | /*ARGSUSED*/ |
2432 | | file_private int |
2433 | | parse_strength(struct magic_set *ms, struct magic_entry *me, const char *line, |
2434 | | size_t len __attribute__((__unused__))) |
2435 | 0 | { |
2436 | 0 | const char *l = line; |
2437 | 0 | char *el; |
2438 | 0 | unsigned long factor; |
2439 | 0 | char sbuf[512]; |
2440 | 0 | struct magic *m = &me->mp[0]; |
2441 | |
|
2442 | 0 | if (m->factor_op != FILE_FACTOR_OP_NONE) { |
2443 | 0 | file_magwarn(ms, |
2444 | 0 | "Current entry already has a strength type: %c %d", |
2445 | 0 | m->factor_op, m->factor); |
2446 | 0 | return -1; |
2447 | 0 | } |
2448 | 0 | if (m->type == FILE_NAME) { |
2449 | 0 | file_magwarn(ms, "%s: Strength setting is not supported in " |
2450 | 0 | "\"name\" magic entries", |
2451 | 0 | file_printable(ms, sbuf, sizeof(sbuf), m->value.s, |
2452 | 0 | sizeof(m->value.s))); |
2453 | 0 | return -1; |
2454 | 0 | } |
2455 | 0 | EATAB; |
2456 | 0 | switch (*l) { |
2457 | 0 | case FILE_FACTOR_OP_NONE: |
2458 | 0 | break; |
2459 | 0 | case FILE_FACTOR_OP_PLUS: |
2460 | 0 | case FILE_FACTOR_OP_MINUS: |
2461 | 0 | case FILE_FACTOR_OP_TIMES: |
2462 | 0 | case FILE_FACTOR_OP_DIV: |
2463 | 0 | m->factor_op = *l++; |
2464 | 0 | break; |
2465 | 0 | default: |
2466 | 0 | file_magwarn(ms, "Unknown factor op `%c'", *l); |
2467 | 0 | return -1; |
2468 | 0 | } |
2469 | 0 | EATAB; |
2470 | 0 | factor = strtoul(l, &el, 0); |
2471 | 0 | if (factor > 255) { |
2472 | 0 | file_magwarn(ms, "Too large factor `%lu'", factor); |
2473 | 0 | goto out; |
2474 | 0 | } |
2475 | 0 | if (*el && !isspace(CAST(unsigned char, *el))) { |
2476 | 0 | file_magwarn(ms, "Bad factor `%s'", l); |
2477 | 0 | goto out; |
2478 | 0 | } |
2479 | 0 | m->factor = CAST(uint8_t, factor); |
2480 | 0 | if (m->factor == 0 && m->factor_op == FILE_FACTOR_OP_DIV) { |
2481 | 0 | file_magwarn(ms, "Cannot have factor op `%c' and factor %u", |
2482 | 0 | m->factor_op, m->factor); |
2483 | 0 | goto out; |
2484 | 0 | } |
2485 | 0 | return 0; |
2486 | 0 | out: |
2487 | 0 | m->factor_op = FILE_FACTOR_OP_NONE; |
2488 | 0 | m->factor = 0; |
2489 | 0 | return -1; |
2490 | 0 | } |
2491 | | |
2492 | | file_private int |
2493 | | goodchar(unsigned char x, const char *extra) |
2494 | 0 | { |
2495 | 0 | return (isascii(x) && isalnum(x)) || strchr(extra, x); |
2496 | 0 | } |
2497 | | |
2498 | | file_private int |
2499 | | parse_extra(struct magic_set *ms, struct magic_entry *me, const char *line, |
2500 | | size_t llen, off_t off, size_t len, const char *name, const char *extra, |
2501 | | int nt) |
2502 | 0 | { |
2503 | 0 | size_t i; |
2504 | 0 | const char *l = line; |
2505 | 0 | struct magic *m = &me->mp[me->cont_count == 0 ? 0 : me->cont_count - 1]; |
2506 | 0 | char *buf = CAST(char *, CAST(void *, m)) + off; |
2507 | |
|
2508 | 0 | if (buf[0] != '\0') { |
2509 | 0 | len = nt ? strlen(buf) : len; |
2510 | 0 | file_magwarn(ms, "Current entry already has a %s type " |
2511 | 0 | "`%.*s', new type `%s'", name, CAST(int, len), buf, l); |
2512 | 0 | return -1; |
2513 | 0 | } |
2514 | | |
2515 | 0 | if (*m->desc == '\0') { |
2516 | 0 | file_magwarn(ms, "Current entry does not yet have a " |
2517 | 0 | "description for adding a %s type", name); |
2518 | 0 | return -1; |
2519 | 0 | } |
2520 | | |
2521 | 0 | EATAB; |
2522 | 0 | for (i = 0; *l && i < llen && i < len && goodchar(*l, extra); |
2523 | 0 | buf[i++] = *l++) |
2524 | 0 | continue; |
2525 | |
|
2526 | 0 | if (i == len && *l) { |
2527 | 0 | if (nt) |
2528 | 0 | buf[len - 1] = '\0'; |
2529 | 0 | if (ms->flags & MAGIC_CHECK) |
2530 | 0 | file_magwarn(ms, "%s type `%s' truncated %" |
2531 | 0 | SIZE_T_FORMAT "u", name, line, i); |
2532 | 0 | } else { |
2533 | 0 | if (!isspace(CAST(unsigned char, *l)) && !goodchar(*l, extra)) |
2534 | 0 | file_magwarn(ms, "%s type `%s' has bad char '%c'", |
2535 | 0 | name, line, *l); |
2536 | 0 | if (nt) |
2537 | 0 | buf[i] = '\0'; |
2538 | 0 | } |
2539 | |
|
2540 | 0 | if (i > 0) |
2541 | 0 | return 0; |
2542 | | |
2543 | 0 | file_magerror(ms, "Bad magic entry '%s'", line); |
2544 | 0 | return -1; |
2545 | 0 | } |
2546 | | |
2547 | | /* |
2548 | | * Parse an Apple CREATOR/TYPE annotation from magic file and put it into |
2549 | | * magic[index - 1] |
2550 | | */ |
2551 | | file_private int |
2552 | | parse_apple(struct magic_set *ms, struct magic_entry *me, const char *line, |
2553 | | size_t len) |
2554 | 0 | { |
2555 | 0 | return parse_extra(ms, me, line, len, |
2556 | 0 | CAST(off_t, offsetof(struct magic, apple)), |
2557 | 0 | sizeof(me->mp[0].apple), "APPLE", "!+-./?", 0); |
2558 | 0 | } |
2559 | | |
2560 | | /* |
2561 | | * Parse a comma-separated list of extensions |
2562 | | */ |
2563 | | file_private int |
2564 | | parse_ext(struct magic_set *ms, struct magic_entry *me, const char *line, |
2565 | | size_t len) |
2566 | 0 | { |
2567 | 0 | return parse_extra(ms, me, line, len, |
2568 | 0 | CAST(off_t, offsetof(struct magic, ext)), |
2569 | 0 | sizeof(me->mp[0].ext), "EXTENSION", ",!+-/@?_$&~", 0); |
2570 | | /* & for b&w */ |
2571 | | /* ~ for journal~ */ |
2572 | 0 | } |
2573 | | |
2574 | | /* |
2575 | | * parse a MIME annotation line from magic file, put into magic[index - 1] |
2576 | | * if valid |
2577 | | */ |
2578 | | file_private int |
2579 | | parse_mime(struct magic_set *ms, struct magic_entry *me, const char *line, |
2580 | | size_t len) |
2581 | 0 | { |
2582 | 0 | return parse_extra(ms, me, line, len, |
2583 | 0 | CAST(off_t, offsetof(struct magic, mimetype)), |
2584 | 0 | sizeof(me->mp[0].mimetype), "MIME", "+-/.$?:{}", 1); |
2585 | 0 | } |
2586 | | |
2587 | | file_private int |
2588 | | check_format_type(const char *ptr, int type, const char **estr) |
2589 | 0 | { |
2590 | 0 | int quad = 0, h; |
2591 | 0 | size_t len, cnt; |
2592 | 0 | if (*ptr == '\0') { |
2593 | | /* Missing format string; bad */ |
2594 | 0 | *estr = "missing format spec"; |
2595 | 0 | return -1; |
2596 | 0 | } |
2597 | | |
2598 | 0 | switch (file_formats[type]) { |
2599 | 0 | case FILE_FMT_QUAD: |
2600 | 0 | quad = 1; |
2601 | | /*FALLTHROUGH*/ |
2602 | 0 | case FILE_FMT_NUM: |
2603 | 0 | if (quad == 0) { |
2604 | 0 | switch (type) { |
2605 | 0 | case FILE_BYTE: |
2606 | 0 | h = 2; |
2607 | 0 | break; |
2608 | 0 | case FILE_SHORT: |
2609 | 0 | case FILE_BESHORT: |
2610 | 0 | case FILE_LESHORT: |
2611 | 0 | h = 1; |
2612 | 0 | break; |
2613 | 0 | case FILE_LONG: |
2614 | 0 | case FILE_BELONG: |
2615 | 0 | case FILE_LELONG: |
2616 | 0 | case FILE_MELONG: |
2617 | 0 | case FILE_LEID3: |
2618 | 0 | case FILE_BEID3: |
2619 | 0 | case FILE_INDIRECT: |
2620 | 0 | h = 0; |
2621 | 0 | break; |
2622 | 0 | default: |
2623 | 0 | fprintf(stderr, "Bad number format %d", type); |
2624 | 0 | abort(); |
2625 | 0 | } |
2626 | 0 | } else |
2627 | 0 | h = 0; |
2628 | 0 | while (*ptr && strchr("-.#", *ptr) != NULL) |
2629 | 0 | ptr++; |
2630 | 0 | #define CHECKLEN() do { \ |
2631 | 0 | for (len = cnt = 0; isdigit(CAST(unsigned char, *ptr)); ptr++, cnt++) \ |
2632 | 0 | len = len * 10 + (*ptr - '0'); \ |
2633 | 0 | if (cnt > 5 || len > 1024) \ |
2634 | 0 | goto toolong; \ |
2635 | 0 | } while (/*CONSTCOND*/0) |
2636 | |
|
2637 | 0 | CHECKLEN(); |
2638 | 0 | if (*ptr == '.') |
2639 | 0 | ptr++; |
2640 | 0 | CHECKLEN(); |
2641 | 0 | if (quad) { |
2642 | 0 | if (*ptr++ != 'l') |
2643 | 0 | goto invalid; |
2644 | 0 | if (*ptr++ != 'l') |
2645 | 0 | goto invalid; |
2646 | 0 | } |
2647 | | |
2648 | 0 | switch (*ptr++) { |
2649 | | #ifdef STRICT_FORMAT /* "long" formats are int formats for us */ |
2650 | | /* so don't accept the 'l' modifier */ |
2651 | | case 'l': |
2652 | | switch (*ptr++) { |
2653 | | case 'i': |
2654 | | case 'd': |
2655 | | case 'u': |
2656 | | case 'o': |
2657 | | case 'x': |
2658 | | case 'X': |
2659 | | if (h == 0) |
2660 | | return 0; |
2661 | | /*FALLTHROUGH*/ |
2662 | | default: |
2663 | | goto invalid; |
2664 | | } |
2665 | | |
2666 | | /* |
2667 | | * Don't accept h and hh modifiers. They make writing |
2668 | | * magic entries more complicated, for very little benefit |
2669 | | */ |
2670 | | case 'h': |
2671 | | if (h-- <= 0) |
2672 | | goto invalid; |
2673 | | switch (*ptr++) { |
2674 | | case 'h': |
2675 | | if (h-- <= 0) |
2676 | | goto invalid; |
2677 | | switch (*ptr++) { |
2678 | | case 'i': |
2679 | | case 'd': |
2680 | | case 'u': |
2681 | | case 'o': |
2682 | | case 'x': |
2683 | | case 'X': |
2684 | | return 0; |
2685 | | default: |
2686 | | goto invalid; |
2687 | | } |
2688 | | case 'i': |
2689 | | case 'd': |
2690 | | case 'u': |
2691 | | case 'o': |
2692 | | case 'x': |
2693 | | case 'X': |
2694 | | if (h == 0) |
2695 | | return 0; |
2696 | | /*FALLTHROUGH*/ |
2697 | | default: |
2698 | | goto invalid; |
2699 | | } |
2700 | | #endif |
2701 | 0 | case 'c': |
2702 | 0 | if (h == 2) |
2703 | 0 | return 0; |
2704 | 0 | goto invalid; |
2705 | 0 | case 'i': |
2706 | 0 | case 'd': |
2707 | 0 | case 'u': |
2708 | 0 | case 'o': |
2709 | 0 | case 'x': |
2710 | 0 | case 'X': |
2711 | | #ifdef STRICT_FORMAT |
2712 | | if (h == 0) |
2713 | | return 0; |
2714 | | /*FALLTHROUGH*/ |
2715 | | #else |
2716 | 0 | return 0; |
2717 | 0 | #endif |
2718 | 0 | default: |
2719 | 0 | goto invalid; |
2720 | 0 | } |
2721 | | |
2722 | 0 | case FILE_FMT_FLOAT: |
2723 | 0 | case FILE_FMT_DOUBLE: |
2724 | 0 | if (*ptr == '-') |
2725 | 0 | ptr++; |
2726 | 0 | if (*ptr == '.') |
2727 | 0 | ptr++; |
2728 | 0 | CHECKLEN(); |
2729 | 0 | if (*ptr == '.') |
2730 | 0 | ptr++; |
2731 | 0 | CHECKLEN(); |
2732 | 0 | switch (*ptr++) { |
2733 | 0 | case 'e': |
2734 | 0 | case 'E': |
2735 | 0 | case 'f': |
2736 | 0 | case 'F': |
2737 | 0 | case 'g': |
2738 | 0 | case 'G': |
2739 | 0 | return 0; |
2740 | | |
2741 | 0 | default: |
2742 | 0 | goto invalid; |
2743 | 0 | } |
2744 | | |
2745 | | |
2746 | 0 | case FILE_FMT_STR: |
2747 | 0 | if (*ptr == '-') |
2748 | 0 | ptr++; |
2749 | 0 | while (isdigit(CAST(unsigned char, *ptr))) |
2750 | 0 | ptr++; |
2751 | 0 | if (*ptr == '.') { |
2752 | 0 | ptr++; |
2753 | 0 | while (isdigit(CAST(unsigned char , *ptr))) |
2754 | 0 | ptr++; |
2755 | 0 | } |
2756 | |
|
2757 | 0 | switch (*ptr++) { |
2758 | 0 | case 's': |
2759 | 0 | return 0; |
2760 | 0 | default: |
2761 | 0 | goto invalid; |
2762 | 0 | } |
2763 | | |
2764 | 0 | default: |
2765 | | /* internal error */ |
2766 | 0 | fprintf(stderr, "Bad file format %d", type); |
2767 | 0 | abort(); |
2768 | 0 | } |
2769 | 0 | invalid: |
2770 | 0 | *estr = "not valid"; |
2771 | 0 | return -1; |
2772 | 0 | toolong: |
2773 | 0 | *estr = "too long"; |
2774 | 0 | return -1; |
2775 | 0 | } |
2776 | | |
2777 | | /* |
2778 | | * Check that the optional printf format in description matches |
2779 | | * the type of the magic. |
2780 | | */ |
2781 | | file_private int |
2782 | | check_format(struct magic_set *ms, struct magic *m) |
2783 | 0 | { |
2784 | 0 | char *ptr; |
2785 | 0 | const char *estr; |
2786 | |
|
2787 | 0 | for (ptr = m->desc; *ptr; ptr++) |
2788 | 0 | if (*ptr == '%') |
2789 | 0 | break; |
2790 | 0 | if (*ptr == '\0') { |
2791 | | /* No format string; ok */ |
2792 | 0 | return 1; |
2793 | 0 | } |
2794 | | |
2795 | 0 | assert(file_nformats == file_nnames); |
2796 | | |
2797 | 0 | if (m->type >= file_nformats) { |
2798 | 0 | file_magwarn(ms, "Internal error inconsistency between " |
2799 | 0 | "m->type and format strings"); |
2800 | 0 | return -1; |
2801 | 0 | } |
2802 | 0 | if (file_formats[m->type] == FILE_FMT_NONE) { |
2803 | 0 | file_magwarn(ms, "No format string for `%s' with description " |
2804 | 0 | "`%s'", m->desc, file_names[m->type]); |
2805 | 0 | return -1; |
2806 | 0 | } |
2807 | | |
2808 | 0 | ptr++; |
2809 | 0 | if (check_format_type(ptr, m->type, &estr) == -1) { |
2810 | | /* |
2811 | | * TODO: this error message is unhelpful if the format |
2812 | | * string is not one character long |
2813 | | */ |
2814 | 0 | file_magwarn(ms, "Printf format is %s for type " |
2815 | 0 | "`%s' in description `%s'", estr, |
2816 | 0 | file_names[m->type], m->desc); |
2817 | 0 | return -1; |
2818 | 0 | } |
2819 | | |
2820 | 0 | for (; *ptr; ptr++) { |
2821 | 0 | if (*ptr == '%') { |
2822 | 0 | file_magwarn(ms, |
2823 | 0 | "Too many format strings (should have at most one) " |
2824 | 0 | "for `%s' with description `%s'", |
2825 | 0 | file_names[m->type], m->desc); |
2826 | 0 | return -1; |
2827 | 0 | } |
2828 | 0 | } |
2829 | 0 | return 0; |
2830 | 0 | } |
2831 | | |
2832 | | /* |
2833 | | * Read a numeric value from a pointer, into the value union of a magic |
2834 | | * pointer, according to the magic type. Update the string pointer to point |
2835 | | * just after the number read. Return 0 for success, non-zero for failure. |
2836 | | */ |
2837 | | file_private int |
2838 | | getvalue(struct magic_set *ms, struct magic *m, const char **p, int action) |
2839 | 0 | { |
2840 | 0 | char *ep; |
2841 | 0 | uint64_t ull; |
2842 | 0 | int y; |
2843 | |
|
2844 | 0 | switch (m->type) { |
2845 | 0 | case FILE_BESTRING16: |
2846 | 0 | case FILE_LESTRING16: |
2847 | 0 | case FILE_STRING: |
2848 | 0 | case FILE_PSTRING: |
2849 | 0 | case FILE_REGEX: |
2850 | 0 | case FILE_SEARCH: |
2851 | 0 | case FILE_NAME: |
2852 | 0 | case FILE_USE: |
2853 | 0 | case FILE_DER: |
2854 | 0 | case FILE_OCTAL: |
2855 | 0 | *p = getstr(ms, m, *p, action == FILE_COMPILE); |
2856 | 0 | if (*p == NULL) { |
2857 | 0 | if (ms->flags & MAGIC_CHECK) |
2858 | 0 | file_magwarn(ms, "cannot get string from `%s'", |
2859 | 0 | m->value.s); |
2860 | 0 | return -1; |
2861 | 0 | } |
2862 | 0 | if (m->type == FILE_REGEX) { |
2863 | 0 | file_regex_t rx; |
2864 | 0 | int rc = |
2865 | 0 | file_regcomp(ms, &rx, m->value.s, REG_EXTENDED); |
2866 | 0 | if (rc == 0) { |
2867 | 0 | file_regfree(&rx); |
2868 | 0 | } |
2869 | 0 | return rc ? -1 : 0; |
2870 | 0 | } |
2871 | 0 | return 0; |
2872 | 0 | default: |
2873 | 0 | if (m->reln == 'x') |
2874 | 0 | return 0; |
2875 | 0 | break; |
2876 | 0 | } |
2877 | | |
2878 | 0 | switch (m->type) { |
2879 | 0 | case FILE_FLOAT: |
2880 | 0 | case FILE_BEFLOAT: |
2881 | 0 | case FILE_LEFLOAT: |
2882 | 0 | errno = 0; |
2883 | 0 | #ifdef HAVE_STRTOF |
2884 | 0 | m->value.f = strtof(*p, &ep); |
2885 | | #else |
2886 | | m->value.f = (float)strtod(*p, &ep); |
2887 | | #endif |
2888 | 0 | if (errno == 0) |
2889 | 0 | *p = ep; |
2890 | 0 | return 0; |
2891 | 0 | case FILE_DOUBLE: |
2892 | 0 | case FILE_BEDOUBLE: |
2893 | 0 | case FILE_LEDOUBLE: |
2894 | 0 | errno = 0; |
2895 | 0 | m->value.d = strtod(*p, &ep); |
2896 | 0 | if (errno == 0) |
2897 | 0 | *p = ep; |
2898 | 0 | return 0; |
2899 | 0 | case FILE_GUID: |
2900 | 0 | if (file_parse_guid(*p, m->value.guid) == -1) |
2901 | 0 | return -1; |
2902 | 0 | *p += FILE_GUID_SIZE - 1; |
2903 | 0 | return 0; |
2904 | 0 | default: |
2905 | 0 | errno = 0; |
2906 | 0 | ull = CAST(uint64_t, strtoull(*p, &ep, 0)); |
2907 | 0 | m->value.q = file_signextend(ms, m, ull); |
2908 | 0 | if (*p == ep) { |
2909 | 0 | file_magwarn(ms, "Unparsable number `%s'", *p); |
2910 | 0 | return -1; |
2911 | 0 | } else { |
2912 | 0 | size_t ts = typesize(m->type); |
2913 | 0 | uint64_t x; |
2914 | 0 | const char *q; |
2915 | |
|
2916 | 0 | if (ts == FILE_BADSIZE) { |
2917 | 0 | file_magwarn(ms, |
2918 | 0 | "Expected numeric type got `%s'", |
2919 | 0 | type_tbl[m->type].name); |
2920 | 0 | return -1; |
2921 | 0 | } |
2922 | 0 | for (q = *p; isspace(CAST(unsigned char, *q)); q++) |
2923 | 0 | continue; |
2924 | 0 | if (*q == '-' && ull != UINT64_MAX) |
2925 | 0 | ull = -CAST(int64_t, ull); |
2926 | 0 | switch (ts) { |
2927 | 0 | case 1: |
2928 | 0 | x = CAST(uint64_t, ull & ~0xffULL); |
2929 | 0 | y = (x & ~0xffULL) != ~0xffULL; |
2930 | 0 | break; |
2931 | 0 | case 2: |
2932 | 0 | x = CAST(uint64_t, ull & ~0xffffULL); |
2933 | 0 | y = (x & ~0xffffULL) != ~0xffffULL; |
2934 | 0 | break; |
2935 | 0 | case 4: |
2936 | 0 | x = CAST(uint64_t, ull & ~0xffffffffULL); |
2937 | 0 | y = (x & ~0xffffffffULL) != ~0xffffffffULL; |
2938 | 0 | break; |
2939 | 0 | case 8: |
2940 | 0 | x = 0; |
2941 | 0 | y = 0; |
2942 | 0 | break; |
2943 | 0 | default: |
2944 | 0 | fprintf(stderr, "Bad width %zu", ts); |
2945 | 0 | abort(); |
2946 | 0 | } |
2947 | 0 | if (x && y) { |
2948 | 0 | file_magwarn(ms, "Overflow for numeric" |
2949 | 0 | " type `%s' value %#" PRIx64, |
2950 | 0 | type_tbl[m->type].name, ull); |
2951 | 0 | return -1; |
2952 | 0 | } |
2953 | 0 | } |
2954 | 0 | if (errno == 0) { |
2955 | 0 | *p = ep; |
2956 | 0 | eatsize(p); |
2957 | 0 | } |
2958 | 0 | return 0; |
2959 | 0 | } |
2960 | 0 | } |
2961 | | |
2962 | | /* |
2963 | | * Convert a string containing C character escapes. Stop at an unescaped |
2964 | | * space or tab. |
2965 | | * Copy the converted version to "m->value.s", and the length in m->vallen. |
2966 | | * Return updated scan pointer as function result. Warn if set. |
2967 | | */ |
2968 | | file_private const char * |
2969 | | getstr(struct magic_set *ms, struct magic *m, const char *s, int warn) |
2970 | 0 | { |
2971 | 0 | const char *origs = s; |
2972 | 0 | char *p = m->value.s; |
2973 | 0 | size_t plen = sizeof(m->value.s); |
2974 | 0 | char *origp = p; |
2975 | 0 | char *pmax = p + plen - 1; |
2976 | 0 | int c; |
2977 | 0 | int val; |
2978 | 0 | size_t bracket_nesting = 0; |
2979 | |
|
2980 | 0 | while ((c = *s++) != '\0') { |
2981 | 0 | if (isspace(CAST(unsigned char, c))) |
2982 | 0 | break; |
2983 | 0 | if (p >= pmax) { |
2984 | 0 | file_error(ms, 0, "string too long: `%s'", origs); |
2985 | 0 | return NULL; |
2986 | 0 | } |
2987 | 0 | if (c != '\\') { |
2988 | 0 | if (c == '[') { |
2989 | 0 | bracket_nesting++; |
2990 | 0 | } |
2991 | 0 | if (c == ']' && bracket_nesting > 0) { |
2992 | 0 | bracket_nesting--; |
2993 | 0 | } |
2994 | 0 | *p++ = CAST(char, c); |
2995 | 0 | continue; |
2996 | 0 | } |
2997 | 0 | switch(c = *s++) { |
2998 | | |
2999 | 0 | case '\0': |
3000 | 0 | if (warn) |
3001 | 0 | file_magwarn(ms, "incomplete escape"); |
3002 | 0 | s--; |
3003 | 0 | goto out; |
3004 | 0 | case '.': |
3005 | 0 | if (m->type == FILE_REGEX && |
3006 | 0 | bracket_nesting == 0 && warn) { |
3007 | 0 | file_magwarn(ms, "escaped dot ('.') found, " |
3008 | 0 | "use \\\\. instead"); |
3009 | 0 | } |
3010 | 0 | warn = 0; /* already did */ |
3011 | | /*FALLTHROUGH*/ |
3012 | 0 | case '\t': |
3013 | 0 | if (warn) { |
3014 | 0 | file_magwarn(ms, |
3015 | 0 | "escaped tab found, use \\\\t instead"); |
3016 | 0 | warn = 0; /* already did */ |
3017 | 0 | } |
3018 | | /*FALLTHROUGH*/ |
3019 | 0 | default: |
3020 | 0 | if (warn) { |
3021 | 0 | if (isprint(CAST(unsigned char, c))) { |
3022 | | /* Allow escaping of |
3023 | | * ``relations'' */ |
3024 | 0 | if (strchr("<>&^=!", c) == NULL |
3025 | 0 | && (m->type != FILE_REGEX || |
3026 | 0 | strchr("[]().*?^$|{}", c) |
3027 | 0 | == NULL)) { |
3028 | 0 | file_magwarn(ms, "no " |
3029 | 0 | "need to escape " |
3030 | 0 | "`%c'", c); |
3031 | 0 | } |
3032 | 0 | } else { |
3033 | 0 | file_magwarn(ms, |
3034 | 0 | "unknown escape sequence: " |
3035 | 0 | "\\%03o", c); |
3036 | 0 | } |
3037 | 0 | } |
3038 | | /*FALLTHROUGH*/ |
3039 | | /* space, perhaps force people to use \040? */ |
3040 | 0 | case ' ': |
3041 | | #if 0 |
3042 | | /* |
3043 | | * Other things people escape, but shouldn't need to, |
3044 | | * so we disallow them |
3045 | | */ |
3046 | | case '\'': |
3047 | | case '"': |
3048 | | case '?': |
3049 | | #endif |
3050 | | /* Relations */ |
3051 | 0 | case '>': |
3052 | 0 | case '<': |
3053 | 0 | case '&': |
3054 | 0 | case '^': |
3055 | 0 | case '=': |
3056 | 0 | case '!': |
3057 | | /* and backslash itself */ |
3058 | 0 | case '\\': |
3059 | 0 | *p++ = CAST(char, c); |
3060 | 0 | break; |
3061 | | |
3062 | 0 | case 'a': |
3063 | 0 | *p++ = '\a'; |
3064 | 0 | break; |
3065 | | |
3066 | 0 | case 'b': |
3067 | 0 | *p++ = '\b'; |
3068 | 0 | break; |
3069 | | |
3070 | 0 | case 'f': |
3071 | 0 | *p++ = '\f'; |
3072 | 0 | break; |
3073 | | |
3074 | 0 | case 'n': |
3075 | 0 | *p++ = '\n'; |
3076 | 0 | break; |
3077 | | |
3078 | 0 | case 'r': |
3079 | 0 | *p++ = '\r'; |
3080 | 0 | break; |
3081 | | |
3082 | 0 | case 't': |
3083 | 0 | *p++ = '\t'; |
3084 | 0 | break; |
3085 | | |
3086 | 0 | case 'v': |
3087 | 0 | *p++ = '\v'; |
3088 | 0 | break; |
3089 | | |
3090 | | /* \ and up to 3 octal digits */ |
3091 | 0 | case '0': |
3092 | 0 | case '1': |
3093 | 0 | case '2': |
3094 | 0 | case '3': |
3095 | 0 | case '4': |
3096 | 0 | case '5': |
3097 | 0 | case '6': |
3098 | 0 | case '7': |
3099 | 0 | val = c - '0'; |
3100 | 0 | c = *s++; /* try for 2 */ |
3101 | 0 | if (c >= '0' && c <= '7') { |
3102 | 0 | val = (val << 3) | (c - '0'); |
3103 | 0 | c = *s++; /* try for 3 */ |
3104 | 0 | if (c >= '0' && c <= '7') |
3105 | 0 | val = (val << 3) | (c-'0'); |
3106 | 0 | else |
3107 | 0 | --s; |
3108 | 0 | } |
3109 | 0 | else |
3110 | 0 | --s; |
3111 | 0 | *p++ = CAST(char, val); |
3112 | 0 | break; |
3113 | | |
3114 | | /* \x and up to 2 hex digits */ |
3115 | 0 | case 'x': |
3116 | 0 | val = 'x'; /* Default if no digits */ |
3117 | 0 | c = hextoint(*s++); /* Get next char */ |
3118 | 0 | if (c >= 0) { |
3119 | 0 | val = c; |
3120 | 0 | c = hextoint(*s++); |
3121 | 0 | if (c >= 0) |
3122 | 0 | val = (val << 4) + c; |
3123 | 0 | else |
3124 | 0 | --s; |
3125 | 0 | } else |
3126 | 0 | --s; |
3127 | 0 | *p++ = CAST(char, val); |
3128 | 0 | break; |
3129 | 0 | } |
3130 | 0 | } |
3131 | 0 | --s; |
3132 | 0 | out: |
3133 | 0 | *p = '\0'; |
3134 | 0 | m->vallen = CAST(unsigned char, (p - origp)); |
3135 | 0 | if (m->type == FILE_PSTRING) { |
3136 | 0 | size_t l = file_pstring_length_size(ms, m); |
3137 | 0 | if (l == FILE_BADSIZE) |
3138 | 0 | return NULL; |
3139 | 0 | m->vallen += CAST(unsigned char, l); |
3140 | 0 | } |
3141 | 0 | return s; |
3142 | 0 | } |
3143 | | |
3144 | | |
3145 | | /* Single hex char to int; -1 if not a hex char. */ |
3146 | | file_private int |
3147 | | hextoint(int c) |
3148 | 0 | { |
3149 | 0 | if (!isascii(CAST(unsigned char, c))) |
3150 | 0 | return -1; |
3151 | 0 | if (isdigit(CAST(unsigned char, c))) |
3152 | 0 | return c - '0'; |
3153 | 0 | if ((c >= 'a') && (c <= 'f')) |
3154 | 0 | return c + 10 - 'a'; |
3155 | 0 | if (( c>= 'A') && (c <= 'F')) |
3156 | 0 | return c + 10 - 'A'; |
3157 | 0 | return -1; |
3158 | 0 | } |
3159 | | |
3160 | | |
3161 | | /* |
3162 | | * Print a string containing C character escapes. |
3163 | | */ |
3164 | | file_protected void |
3165 | | file_showstr(FILE *fp, const char *s, size_t len) |
3166 | 0 | { |
3167 | 0 | char c; |
3168 | |
|
3169 | 0 | for (;;) { |
3170 | 0 | if (len == FILE_BADSIZE) { |
3171 | 0 | c = *s++; |
3172 | 0 | if (c == '\0') |
3173 | 0 | break; |
3174 | 0 | } |
3175 | 0 | else { |
3176 | 0 | if (len-- == 0) |
3177 | 0 | break; |
3178 | 0 | c = *s++; |
3179 | 0 | } |
3180 | 0 | if (c >= 040 && c <= 0176) /* TODO isprint && !iscntrl */ |
3181 | 0 | (void) fputc(c, fp); |
3182 | 0 | else { |
3183 | 0 | (void) fputc('\\', fp); |
3184 | 0 | switch (c) { |
3185 | 0 | case '\a': |
3186 | 0 | (void) fputc('a', fp); |
3187 | 0 | break; |
3188 | | |
3189 | 0 | case '\b': |
3190 | 0 | (void) fputc('b', fp); |
3191 | 0 | break; |
3192 | | |
3193 | 0 | case '\f': |
3194 | 0 | (void) fputc('f', fp); |
3195 | 0 | break; |
3196 | | |
3197 | 0 | case '\n': |
3198 | 0 | (void) fputc('n', fp); |
3199 | 0 | break; |
3200 | | |
3201 | 0 | case '\r': |
3202 | 0 | (void) fputc('r', fp); |
3203 | 0 | break; |
3204 | | |
3205 | 0 | case '\t': |
3206 | 0 | (void) fputc('t', fp); |
3207 | 0 | break; |
3208 | | |
3209 | 0 | case '\v': |
3210 | 0 | (void) fputc('v', fp); |
3211 | 0 | break; |
3212 | | |
3213 | 0 | default: |
3214 | 0 | (void) fprintf(fp, "%.3o", c & 0377); |
3215 | 0 | break; |
3216 | 0 | } |
3217 | 0 | } |
3218 | 0 | } |
3219 | 0 | } |
3220 | | |
3221 | | /* |
3222 | | * eatsize(): Eat the size spec from a number [eg. 10UL] |
3223 | | */ |
3224 | | file_private void |
3225 | | eatsize(const char **p) |
3226 | 0 | { |
3227 | 0 | const char *l = *p; |
3228 | |
|
3229 | 0 | if (LOWCASE(*l) == 'u') |
3230 | 0 | l++; |
3231 | |
|
3232 | 0 | switch (LOWCASE(*l)) { |
3233 | 0 | case 'l': /* long */ |
3234 | 0 | case 's': /* short */ |
3235 | 0 | case 'h': /* short */ |
3236 | 0 | case 'b': /* char/byte */ |
3237 | 0 | case 'c': /* char/byte */ |
3238 | 0 | l++; |
3239 | | /*FALLTHROUGH*/ |
3240 | 0 | default: |
3241 | 0 | break; |
3242 | 0 | } |
3243 | | |
3244 | 0 | *p = l; |
3245 | 0 | } |
3246 | | |
3247 | | /* |
3248 | | * handle a buffer containing a compiled file. |
3249 | | */ |
3250 | | file_private struct magic_map * |
3251 | | apprentice_buf(struct magic_set *ms, struct magic *buf, size_t len) |
3252 | 0 | { |
3253 | 0 | struct magic_map *map; |
3254 | |
|
3255 | 0 | if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) { |
3256 | 0 | file_oomem(ms, sizeof(*map)); |
3257 | 0 | return NULL; |
3258 | 0 | } |
3259 | 0 | map->len = len; |
3260 | 0 | map->p = buf; |
3261 | 0 | map->type = MAP_TYPE_USER; |
3262 | 0 | if (check_buffer(ms, map, "buffer") != 0) { |
3263 | 0 | apprentice_unmap(map); |
3264 | 0 | return NULL; |
3265 | 0 | } |
3266 | 0 | return map; |
3267 | 0 | } |
3268 | | |
3269 | | /* |
3270 | | * handle a compiled file. |
3271 | | */ |
3272 | | |
3273 | | file_private struct magic_map * |
3274 | | apprentice_map(struct magic_set *ms, const char *fn) |
3275 | 2 | { |
3276 | 2 | int fd; |
3277 | 2 | struct stat st; |
3278 | 2 | char *dbname = NULL; |
3279 | 2 | struct magic_map *map; |
3280 | 2 | struct magic_map *rv = NULL; |
3281 | | |
3282 | 2 | fd = -1; |
3283 | 2 | if ((map = CAST(struct magic_map *, calloc(1, sizeof(*map)))) == NULL) { |
3284 | 0 | file_oomem(ms, sizeof(*map)); |
3285 | 0 | goto error; |
3286 | 0 | } |
3287 | 2 | map->type = MAP_TYPE_USER; /* unspecified */ |
3288 | | |
3289 | 2 | dbname = mkdbname(ms, fn, 0); |
3290 | 2 | if (dbname == NULL) |
3291 | 0 | goto error; |
3292 | | |
3293 | 2 | if ((fd = open(dbname, O_RDONLY|O_BINARY)) == -1) |
3294 | 0 | goto error; |
3295 | | |
3296 | 2 | if (fstat(fd, &st) == -1) { |
3297 | 0 | file_error(ms, errno, "cannot stat `%s'", dbname); |
3298 | 0 | goto error; |
3299 | 0 | } |
3300 | 2 | if (st.st_size < 8 || st.st_size > maxoff_t()) { |
3301 | 0 | file_error(ms, 0, "file `%s' is too %s", dbname, |
3302 | 0 | st.st_size < 8 ? "small" : "large"); |
3303 | 0 | goto error; |
3304 | 0 | } |
3305 | | |
3306 | 2 | map->len = CAST(size_t, st.st_size); |
3307 | 2 | #ifdef QUICK |
3308 | 2 | map->type = MAP_TYPE_MMAP; |
3309 | 2 | if ((map->p = mmap(0, CAST(size_t, st.st_size), PROT_READ|PROT_WRITE, |
3310 | 2 | MAP_PRIVATE|MAP_FILE, fd, CAST(off_t, 0))) == MAP_FAILED) { |
3311 | 0 | file_error(ms, errno, "cannot map `%s'", dbname); |
3312 | 0 | goto error; |
3313 | 0 | } |
3314 | | #else |
3315 | | map->type = MAP_TYPE_MALLOC; |
3316 | | if ((map->p = CAST(void *, malloc(map->len))) == NULL) { |
3317 | | file_oomem(ms, map->len); |
3318 | | goto error; |
3319 | | } |
3320 | | if (read(fd, map->p, map->len) != (ssize_t)map->len) { |
3321 | | file_badread(ms); |
3322 | | goto error; |
3323 | | } |
3324 | | #endif |
3325 | 2 | (void)close(fd); |
3326 | 2 | fd = -1; |
3327 | | |
3328 | 2 | if (check_buffer(ms, map, dbname) != 0) { |
3329 | 0 | goto error; |
3330 | 0 | } |
3331 | 2 | #ifdef QUICK |
3332 | 2 | if (mprotect(map->p, CAST(size_t, st.st_size), PROT_READ) == -1) { |
3333 | 0 | file_error(ms, errno, "cannot mprotect `%s'", dbname); |
3334 | 0 | goto error; |
3335 | 0 | } |
3336 | 2 | #endif |
3337 | | |
3338 | 2 | free(dbname); |
3339 | 2 | return map; |
3340 | | |
3341 | 0 | error: |
3342 | 0 | if (fd != -1) |
3343 | 0 | (void)close(fd); |
3344 | 0 | apprentice_unmap(map); |
3345 | 0 | free(dbname); |
3346 | 0 | return rv; |
3347 | 2 | } |
3348 | | |
3349 | | file_private int |
3350 | | check_buffer(struct magic_set *ms, struct magic_map *map, const char *dbname) |
3351 | 2 | { |
3352 | 2 | uint32_t *ptr; |
3353 | 2 | uint32_t entries, nentries; |
3354 | 2 | uint32_t version; |
3355 | 2 | int i, needsbyteswap; |
3356 | | |
3357 | 2 | ptr = CAST(uint32_t *, map->p); |
3358 | 2 | if (*ptr != MAGICNO) { |
3359 | 0 | if (swap4(*ptr) != MAGICNO) { |
3360 | 0 | file_error(ms, 0, "bad magic in `%s'", dbname); |
3361 | 0 | return -1; |
3362 | 0 | } |
3363 | 0 | needsbyteswap = 1; |
3364 | 0 | } else |
3365 | 2 | needsbyteswap = 0; |
3366 | 2 | if (needsbyteswap) |
3367 | 0 | version = swap4(ptr[1]); |
3368 | 2 | else |
3369 | 2 | version = ptr[1]; |
3370 | 2 | if (version != VERSIONNO) { |
3371 | 0 | file_error(ms, 0, "File %s supports only version %d magic " |
3372 | 0 | "files. `%s' is version %d", VERSION, |
3373 | 0 | VERSIONNO, dbname, version); |
3374 | 0 | return -1; |
3375 | 0 | } |
3376 | 2 | entries = CAST(uint32_t, map->len / sizeof(struct magic)); |
3377 | 2 | if ((entries * sizeof(struct magic)) != map->len) { |
3378 | 0 | file_error(ms, 0, "Size of `%s' %" SIZE_T_FORMAT "u is not " |
3379 | 0 | "a multiple of %" SIZE_T_FORMAT "u", |
3380 | 0 | dbname, map->len, sizeof(struct magic)); |
3381 | 0 | return -1; |
3382 | 0 | } |
3383 | 2 | map->magic[0] = CAST(struct magic *, map->p) + 1; |
3384 | 2 | nentries = 0; |
3385 | 6 | for (i = 0; i < MAGIC_SETS; i++) { |
3386 | 4 | if (needsbyteswap) |
3387 | 0 | map->nmagic[i] = swap4(ptr[i + 2]); |
3388 | 4 | else |
3389 | 4 | map->nmagic[i] = ptr[i + 2]; |
3390 | 4 | if (i != MAGIC_SETS - 1) |
3391 | 2 | map->magic[i + 1] = map->magic[i] + map->nmagic[i]; |
3392 | 4 | nentries += map->nmagic[i]; |
3393 | 4 | } |
3394 | 2 | if (entries != nentries + 1) { |
3395 | 0 | file_error(ms, 0, "Inconsistent entries in `%s' %u != %u", |
3396 | 0 | dbname, entries, nentries + 1); |
3397 | 0 | return -1; |
3398 | 0 | } |
3399 | 2 | if (needsbyteswap) |
3400 | 0 | for (i = 0; i < MAGIC_SETS; i++) |
3401 | 0 | byteswap(map->magic[i], map->nmagic[i]); |
3402 | 2 | return 0; |
3403 | 2 | } |
3404 | | |
3405 | | /* |
3406 | | * handle an mmaped file. |
3407 | | */ |
3408 | | file_private int |
3409 | | apprentice_compile(struct magic_set *ms, struct magic_map *map, const char *fn) |
3410 | 0 | { |
3411 | 0 | static const size_t nm = sizeof(*map->nmagic) * MAGIC_SETS; |
3412 | 0 | static const size_t m = sizeof(**map->magic); |
3413 | 0 | int fd = -1; |
3414 | 0 | size_t len; |
3415 | 0 | char *dbname; |
3416 | 0 | int rv = -1; |
3417 | 0 | uint32_t i; |
3418 | 0 | union { |
3419 | 0 | struct magic m; |
3420 | 0 | uint32_t h[2 + MAGIC_SETS]; |
3421 | 0 | } hdr; |
3422 | |
|
3423 | 0 | dbname = mkdbname(ms, fn, 1); |
3424 | |
|
3425 | 0 | if (dbname == NULL) |
3426 | 0 | goto out; |
3427 | | |
3428 | 0 | if ((fd = open(dbname, O_WRONLY|O_CREAT|O_TRUNC|O_BINARY, 0644)) == -1) |
3429 | 0 | { |
3430 | 0 | file_error(ms, errno, "cannot open `%s'", dbname); |
3431 | 0 | goto out; |
3432 | 0 | } |
3433 | 0 | memset(&hdr, 0, sizeof(hdr)); |
3434 | 0 | hdr.h[0] = MAGICNO; |
3435 | 0 | hdr.h[1] = VERSIONNO; |
3436 | 0 | memcpy(hdr.h + 2, map->nmagic, nm); |
3437 | |
|
3438 | 0 | if (write(fd, &hdr, sizeof(hdr)) != CAST(ssize_t, sizeof(hdr))) { |
3439 | 0 | file_error(ms, errno, "error writing `%s'", dbname); |
3440 | 0 | goto out2; |
3441 | 0 | } |
3442 | | |
3443 | 0 | for (i = 0; i < MAGIC_SETS; i++) { |
3444 | 0 | len = m * map->nmagic[i]; |
3445 | 0 | if (write(fd, map->magic[i], len) != CAST(ssize_t, len)) { |
3446 | 0 | file_error(ms, errno, "error writing `%s'", dbname); |
3447 | 0 | goto out2; |
3448 | 0 | } |
3449 | 0 | } |
3450 | | |
3451 | 0 | rv = 0; |
3452 | 0 | out2: |
3453 | 0 | if (fd != -1) |
3454 | 0 | (void)close(fd); |
3455 | 0 | out: |
3456 | 0 | apprentice_unmap(map); |
3457 | 0 | free(dbname); |
3458 | 0 | return rv; |
3459 | 0 | } |
3460 | | |
3461 | | file_private const char ext[] = ".mgc"; |
3462 | | /* |
3463 | | * make a dbname |
3464 | | */ |
3465 | | file_private char * |
3466 | | mkdbname(struct magic_set *ms, const char *fn, int strip) |
3467 | 2 | { |
3468 | 2 | const char *p, *q; |
3469 | 2 | char *buf; |
3470 | | |
3471 | 2 | if (strip) { |
3472 | 0 | if ((p = strrchr(fn, '/')) != NULL) |
3473 | 0 | fn = ++p; |
3474 | 0 | } |
3475 | | |
3476 | 94 | for (q = fn; *q; q++) |
3477 | 92 | continue; |
3478 | | /* Look for .mgc */ |
3479 | 6 | for (p = ext + sizeof(ext) - 1; p >= ext && q >= fn; p--, q--) |
3480 | 6 | if (*p != *q) |
3481 | 2 | break; |
3482 | | |
3483 | | /* Did not find .mgc, restore q */ |
3484 | 2 | if (p >= ext) |
3485 | 6 | while (*q) |
3486 | 4 | q++; |
3487 | | |
3488 | 2 | q++; |
3489 | | /* Compatibility with old code that looked in .mime */ |
3490 | 2 | if (ms->flags & MAGIC_MIME) { |
3491 | 0 | if (asprintf(&buf, "%.*s.mime%s", CAST(int, q - fn), fn, ext) |
3492 | 0 | < 0) |
3493 | 0 | return NULL; |
3494 | 0 | if (access(buf, R_OK) != -1) { |
3495 | 0 | ms->flags &= MAGIC_MIME_TYPE; |
3496 | 0 | return buf; |
3497 | 0 | } |
3498 | 0 | free(buf); |
3499 | 0 | } |
3500 | 2 | if (asprintf(&buf, "%.*s%s", CAST(int, q - fn), fn, ext) < 0) |
3501 | 0 | return NULL; |
3502 | | |
3503 | | /* Compatibility with old code that looked in .mime */ |
3504 | 2 | if (strstr(fn, ".mime") != NULL) |
3505 | 0 | ms->flags &= MAGIC_MIME_TYPE; |
3506 | 2 | return buf; |
3507 | 2 | } |
3508 | | |
3509 | | /* |
3510 | | * Byteswap an mmap'ed file if needed |
3511 | | */ |
3512 | | file_private void |
3513 | | byteswap(struct magic *magic, uint32_t nmagic) |
3514 | 0 | { |
3515 | 0 | uint32_t i; |
3516 | 0 | for (i = 0; i < nmagic; i++) |
3517 | 0 | bs1(&magic[i]); |
3518 | 0 | } |
3519 | | |
3520 | | #if !defined(HAVE_BYTESWAP_H) && !defined(HAVE_SYS_BSWAP_H) |
3521 | | /* |
3522 | | * swap a short |
3523 | | */ |
3524 | | file_private uint16_t |
3525 | | swap2(uint16_t sv) |
3526 | | { |
3527 | | uint16_t rv; |
3528 | | uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); |
3529 | | uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); |
3530 | | d[0] = s[1]; |
3531 | | d[1] = s[0]; |
3532 | | return rv; |
3533 | | } |
3534 | | |
3535 | | /* |
3536 | | * swap an int |
3537 | | */ |
3538 | | file_private uint32_t |
3539 | | swap4(uint32_t sv) |
3540 | | { |
3541 | | uint32_t rv; |
3542 | | uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); |
3543 | | uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); |
3544 | | d[0] = s[3]; |
3545 | | d[1] = s[2]; |
3546 | | d[2] = s[1]; |
3547 | | d[3] = s[0]; |
3548 | | return rv; |
3549 | | } |
3550 | | |
3551 | | /* |
3552 | | * swap a quad |
3553 | | */ |
3554 | | file_private uint64_t |
3555 | | swap8(uint64_t sv) |
3556 | | { |
3557 | | uint64_t rv; |
3558 | | uint8_t *s = RCAST(uint8_t *, RCAST(void *, &sv)); |
3559 | | uint8_t *d = RCAST(uint8_t *, RCAST(void *, &rv)); |
3560 | | # if 0 |
3561 | | d[0] = s[3]; |
3562 | | d[1] = s[2]; |
3563 | | d[2] = s[1]; |
3564 | | d[3] = s[0]; |
3565 | | d[4] = s[7]; |
3566 | | d[5] = s[6]; |
3567 | | d[6] = s[5]; |
3568 | | d[7] = s[4]; |
3569 | | # else |
3570 | | d[0] = s[7]; |
3571 | | d[1] = s[6]; |
3572 | | d[2] = s[5]; |
3573 | | d[3] = s[4]; |
3574 | | d[4] = s[3]; |
3575 | | d[5] = s[2]; |
3576 | | d[6] = s[1]; |
3577 | | d[7] = s[0]; |
3578 | | # endif |
3579 | | return rv; |
3580 | | } |
3581 | | #endif |
3582 | | |
3583 | | file_protected uintmax_t |
3584 | | file_varint2uintmax_t(const unsigned char *us, int t, size_t *l) |
3585 | 0 | { |
3586 | 0 | uintmax_t x = 0; |
3587 | 0 | const unsigned char *c; |
3588 | 0 | if (t == FILE_LEVARINT) { |
3589 | 0 | for (c = us; *c; c++) { |
3590 | 0 | if ((*c & 0x80) == 0) |
3591 | 0 | break; |
3592 | 0 | } |
3593 | 0 | if (l) |
3594 | 0 | *l = c - us + 1; |
3595 | 0 | for (; c >= us; c--) { |
3596 | 0 | x |= *c & 0x7f; |
3597 | 0 | x <<= 7; |
3598 | 0 | } |
3599 | 0 | } else { |
3600 | 0 | for (c = us; *c; c++) { |
3601 | 0 | x |= *c & 0x7f; |
3602 | 0 | if ((*c & 0x80) == 0) |
3603 | 0 | break; |
3604 | 0 | x <<= 7; |
3605 | 0 | } |
3606 | 0 | if (l) |
3607 | 0 | *l = c - us + 1; |
3608 | 0 | } |
3609 | 0 | return x; |
3610 | 0 | } |
3611 | | |
3612 | | |
3613 | | /* |
3614 | | * byteswap a single magic entry |
3615 | | */ |
3616 | | file_private void |
3617 | | bs1(struct magic *m) |
3618 | 0 | { |
3619 | 0 | m->cont_level = swap2(m->cont_level); |
3620 | 0 | m->offset = swap4(CAST(uint32_t, m->offset)); |
3621 | 0 | m->in_offset = swap4(CAST(uint32_t, m->in_offset)); |
3622 | 0 | m->lineno = swap4(CAST(uint32_t, m->lineno)); |
3623 | 0 | if (IS_STRING(m->type)) { |
3624 | 0 | m->str_range = swap4(m->str_range); |
3625 | 0 | m->str_flags = swap4(m->str_flags); |
3626 | 0 | } |
3627 | 0 | else { |
3628 | 0 | m->value.q = swap8(m->value.q); |
3629 | 0 | m->num_mask = swap8(m->num_mask); |
3630 | 0 | } |
3631 | 0 | } |
3632 | | |
3633 | | file_protected size_t |
3634 | | file_pstring_length_size(struct magic_set *ms, const struct magic *m) |
3635 | 24.1k | { |
3636 | 24.1k | switch (m->str_flags & PSTRING_LEN) { |
3637 | 18.8k | case PSTRING_1_LE: |
3638 | 18.8k | return 1; |
3639 | 354 | case PSTRING_2_LE: |
3640 | 4.48k | case PSTRING_2_BE: |
3641 | 4.48k | return 2; |
3642 | 492 | case PSTRING_4_LE: |
3643 | 765 | case PSTRING_4_BE: |
3644 | 765 | return 4; |
3645 | 0 | default: |
3646 | 0 | file_error(ms, 0, "corrupt magic file " |
3647 | 0 | "(bad pascal string length %d)", |
3648 | 0 | m->str_flags & PSTRING_LEN); |
3649 | 0 | return FILE_BADSIZE; |
3650 | 24.1k | } |
3651 | 24.1k | } |
3652 | | file_protected size_t |
3653 | | file_pstring_get_length(struct magic_set *ms, const struct magic *m, |
3654 | | const char *ss) |
3655 | 19.6k | { |
3656 | 19.6k | size_t len = 0; |
3657 | 19.6k | const unsigned char *s = RCAST(const unsigned char *, ss); |
3658 | 19.6k | unsigned int s3, s2, s1, s0; |
3659 | | |
3660 | 19.6k | switch (m->str_flags & PSTRING_LEN) { |
3661 | 18.2k | case PSTRING_1_LE: |
3662 | 18.2k | len = *s; |
3663 | 18.2k | break; |
3664 | 118 | case PSTRING_2_LE: |
3665 | 118 | s0 = s[0]; |
3666 | 118 | s1 = s[1]; |
3667 | 118 | len = (s1 << 8) | s0; |
3668 | 118 | break; |
3669 | 1.10k | case PSTRING_2_BE: |
3670 | 1.10k | s0 = s[0]; |
3671 | 1.10k | s1 = s[1]; |
3672 | 1.10k | len = (s0 << 8) | s1; |
3673 | 1.10k | break; |
3674 | 164 | case PSTRING_4_LE: |
3675 | 164 | s0 = s[0]; |
3676 | 164 | s1 = s[1]; |
3677 | 164 | s2 = s[2]; |
3678 | 164 | s3 = s[3]; |
3679 | 164 | len = (s3 << 24) | (s2 << 16) | (s1 << 8) | s0; |
3680 | 164 | break; |
3681 | 91 | case PSTRING_4_BE: |
3682 | 91 | s0 = s[0]; |
3683 | 91 | s1 = s[1]; |
3684 | 91 | s2 = s[2]; |
3685 | 91 | s3 = s[3]; |
3686 | 91 | len = (s0 << 24) | (s1 << 16) | (s2 << 8) | s3; |
3687 | 91 | break; |
3688 | 0 | default: |
3689 | 0 | file_error(ms, 0, "corrupt magic file " |
3690 | 0 | "(bad pascal string length %d)", |
3691 | 0 | m->str_flags & PSTRING_LEN); |
3692 | 0 | return FILE_BADSIZE; |
3693 | 19.6k | } |
3694 | | |
3695 | 19.6k | if (m->str_flags & PSTRING_LENGTH_INCLUDES_ITSELF) { |
3696 | 970 | size_t l = file_pstring_length_size(ms, m); |
3697 | 970 | if (l == FILE_BADSIZE) |
3698 | 0 | return l; |
3699 | 970 | len -= l; |
3700 | 970 | } |
3701 | | |
3702 | 19.6k | return len; |
3703 | 19.6k | } |
3704 | | |
3705 | | file_protected int |
3706 | | file_magicfind(struct magic_set *ms, const char *name, struct mlist *v) |
3707 | 59.2k | { |
3708 | 59.2k | uint32_t i, j; |
3709 | 59.2k | struct mlist *mlist, *ml; |
3710 | | |
3711 | 59.2k | mlist = ms->mlist[1]; |
3712 | | |
3713 | 59.2k | for (ml = mlist->next; ml != mlist; ml = ml->next) { |
3714 | 59.2k | struct magic *ma = ml->magic; |
3715 | 221M | for (i = 0; i < ml->nmagic; i++) { |
3716 | 221M | if (ma[i].type != FILE_NAME) |
3717 | 211M | continue; |
3718 | 9.68M | if (strcmp(ma[i].value.s, name) == 0) { |
3719 | 59.2k | v->magic = &ma[i]; |
3720 | 59.2k | v->magic_rxcomp = &(ml->magic_rxcomp[i]); |
3721 | 2.85M | for (j = i + 1; j < ml->nmagic; j++) |
3722 | 2.85M | if (ma[j].cont_level == 0) |
3723 | 59.2k | break; |
3724 | 59.2k | v->nmagic = j - i; |
3725 | 59.2k | return 0; |
3726 | 59.2k | } |
3727 | 9.68M | } |
3728 | 59.2k | } |
3729 | 0 | return -1; |
3730 | 59.2k | } |