436 lines
		
	
	
		
			11 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			436 lines
		
	
	
		
			11 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| /*	$NetBSD: ascmagic.c,v 1.1.1.2 2011/05/12 20:46:52 christos Exp $	*/
 | |
| 
 | |
| /*
 | |
|  * Copyright (c) Ian F. Darwin 1986-1995.
 | |
|  * Software written by Ian F. Darwin and others;
 | |
|  * maintained 1995-present by Christos Zoulas and others.
 | |
|  *
 | |
|  * Redistribution and use in source and binary forms, with or without
 | |
|  * modification, are permitted provided that the following conditions
 | |
|  * are met:
 | |
|  * 1. Redistributions of source code must retain the above copyright
 | |
|  *    notice immediately at the beginning of the file, without modification,
 | |
|  *    this list of conditions, and the following disclaimer.
 | |
|  * 2. Redistributions in binary form must reproduce the above copyright
 | |
|  *    notice, this list of conditions and the following disclaimer in the
 | |
|  *    documentation and/or other materials provided with the distribution.
 | |
|  *
 | |
|  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 | |
|  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 | |
|  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 | |
|  * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
 | |
|  * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 | |
|  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 | |
|  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 | |
|  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 | |
|  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 | |
|  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 | |
|  * SUCH DAMAGE.
 | |
|  */
 | |
| /*
 | |
|  * ASCII magic -- try to detect text encoding.
 | |
|  *
 | |
|  * Extensively modified by Eric Fischer <enf@pobox.com> in July, 2000,
 | |
|  * to handle character codes other than ASCII on a unified basis.
 | |
|  */
 | |
| 
 | |
| #include "file.h"
 | |
| 
 | |
| #ifndef	lint
 | |
| #if 0
 | |
| FILE_RCSID("@(#)$File: ascmagic.c,v 1.81 2011/03/15 22:16:29 christos Exp $")
 | |
| #else
 | |
| __RCSID("$NetBSD: ascmagic.c,v 1.1.1.2 2011/05/12 20:46:52 christos Exp $");
 | |
| #endif
 | |
| #endif	/* lint */
 | |
| 
 | |
| #include "magic.h"
 | |
| #include <string.h>
 | |
| #include <memory.h>
 | |
| #include <ctype.h>
 | |
| #include <stdlib.h>
 | |
| #ifdef HAVE_UNISTD_H
 | |
| #include <unistd.h>
 | |
| #endif
 | |
| #include "names.h"
 | |
| 
 | |
| #define MAXLINELEN 300	/* longest sane line length */
 | |
| #define ISSPC(x) ((x) == ' ' || (x) == '\t' || (x) == '\r' || (x) == '\n' \
 | |
| 		  || (x) == 0x85 || (x) == '\f')
 | |
| 
 | |
| private int ascmatch(const unsigned char *, const unichar *, size_t);
 | |
| private unsigned char *encode_utf8(unsigned char *, size_t, unichar *, size_t);
 | |
| private size_t trim_nuls(const unsigned char *, size_t);
 | |
| 
 | |
| /*
 | |
|  * Undo the NUL-termination kindly provided by process()
 | |
|  * but leave at least one byte to look at
 | |
|  */
 | |
| private size_t
 | |
| trim_nuls(const unsigned char *buf, size_t nbytes)
 | |
| {
 | |
| 	while (nbytes > 1 && buf[nbytes - 1] == '\0')
 | |
| 		nbytes--;
 | |
| 
 | |
| 	return nbytes;
 | |
| }
 | |
| 
 | |
| protected int
 | |
| file_ascmagic(struct magic_set *ms, const unsigned char *buf, size_t nbytes)
 | |
| {
 | |
| 	unichar *ubuf = NULL;
 | |
| 	size_t ulen;
 | |
| 	int rv = 1;
 | |
| 
 | |
| 	const char *code = NULL;
 | |
| 	const char *code_mime = NULL;
 | |
| 	const char *type = NULL;
 | |
| 
 | |
| 	if (ms->flags & MAGIC_APPLE)
 | |
| 		return 0;
 | |
| 
 | |
| 	nbytes = trim_nuls(buf, nbytes);
 | |
| 
 | |
| 	/* If file doesn't look like any sort of text, give up. */
 | |
| 	if (file_encoding(ms, buf, nbytes, &ubuf, &ulen, &code, &code_mime,
 | |
| 	    &type) == 0) {
 | |
| 		rv = 0;
 | |
| 		goto done;
 | |
| 	}
 | |
| 
 | |
| 	rv = file_ascmagic_with_encoding(ms, buf, nbytes, ubuf, ulen, code,
 | |
| 	    type);
 | |
| 
 | |
|  done:
 | |
| 	if (ubuf)
 | |
| 		free(ubuf);
 | |
| 
 | |
| 	return rv;
 | |
| }
 | |
| 
 | |
| protected int
 | |
| file_ascmagic_with_encoding(struct magic_set *ms, const unsigned char *buf,
 | |
|     size_t nbytes, unichar *ubuf, size_t ulen, const char *code,
 | |
|     const char *type)
 | |
| {
 | |
| 	unsigned char *utf8_buf = NULL, *utf8_end;
 | |
| 	size_t mlen, i;
 | |
| 	const struct names *p;
 | |
| 	int rv = -1;
 | |
| 	int mime = ms->flags & MAGIC_MIME;
 | |
| 
 | |
| 	const char *subtype = NULL;
 | |
| 	const char *subtype_mime = NULL;
 | |
| 
 | |
| 	int has_escapes = 0;
 | |
| 	int has_backspace = 0;
 | |
| 	int seen_cr = 0;
 | |
| 
 | |
| 	int n_crlf = 0;
 | |
| 	int n_lf = 0;
 | |
| 	int n_cr = 0;
 | |
| 	int n_nel = 0;
 | |
| 	int score, curtype, executable = 0;
 | |
| 
 | |
| 	size_t last_line_end = (size_t)-1;
 | |
| 	int has_long_lines = 0;
 | |
| 
 | |
| 	if (ms->flags & MAGIC_APPLE)
 | |
| 		return 0;
 | |
| 
 | |
| 	nbytes = trim_nuls(buf, nbytes);
 | |
| 
 | |
| 	/* If we have fewer than 2 bytes, give up. */
 | |
| 	if (nbytes <= 1) {
 | |
| 		rv = 0;
 | |
| 		goto done;
 | |
| 	}
 | |
| 
 | |
| 	if ((ms->flags & MAGIC_NO_CHECK_SOFT) == 0) {
 | |
| 		/* Convert ubuf to UTF-8 and try text soft magic */
 | |
| 		/* malloc size is a conservative overestimate; could be
 | |
| 		   improved, or at least realloced after conversion. */
 | |
| 		mlen = ulen * 6;
 | |
| 		if ((utf8_buf = CAST(unsigned char *, malloc(mlen))) == NULL) {
 | |
| 			file_oomem(ms, mlen);
 | |
| 			goto done;
 | |
| 		}
 | |
| 		if ((utf8_end = encode_utf8(utf8_buf, mlen, ubuf, ulen))
 | |
| 		    == NULL)
 | |
| 			goto done;
 | |
| 		if ((rv = file_softmagic(ms, utf8_buf,
 | |
| 		    (size_t)(utf8_end - utf8_buf), TEXTTEST)) != 0)
 | |
| 			goto subtype_identified;
 | |
| 		else
 | |
| 			rv = -1;
 | |
| 	}
 | |
| 
 | |
| 	/* look for tokens from names.h - this is expensive! */
 | |
| 	if ((ms->flags & MAGIC_NO_CHECK_TOKENS) != 0)
 | |
| 		goto subtype_identified;
 | |
| 
 | |
| 	i = 0;
 | |
| 	score = 0;
 | |
| 	curtype = -1;
 | |
| 	while (i < ulen) {
 | |
| 		size_t end;
 | |
| 
 | |
| 		/* skip past any leading space */
 | |
| 		while (i < ulen && ISSPC(ubuf[i]))
 | |
| 			i++;
 | |
| 		if (i >= ulen)
 | |
| 			break;
 | |
| 
 | |
| 		/* find the next whitespace */
 | |
| 		for (end = i + 1; end < nbytes; end++)
 | |
| 			if (ISSPC(ubuf[end]))
 | |
| 				break;
 | |
| 
 | |
| 		/* compare the word thus isolated against the token list */
 | |
| 		for (p = names; p < names + NNAMES; p++) {
 | |
| 			if (ascmatch((const unsigned char *)p->name, ubuf + i,
 | |
| 			    end - i)) {
 | |
| 				if (curtype == -1)
 | |
| 					curtype = p->type;
 | |
| 				else if (curtype != p->type) {
 | |
| 					score = p->score;
 | |
| 					curtype = p->type;
 | |
| 				} else
 | |
| 					score += p->score;
 | |
| 				if (score > 1) {
 | |
| 					subtype = types[p->type].human;
 | |
| 					subtype_mime = types[p->type].mime;
 | |
| 					goto subtype_identified;
 | |
| 				}
 | |
| 			}
 | |
| 		}
 | |
| 
 | |
| 		i = end;
 | |
| 	}
 | |
| 
 | |
| subtype_identified:
 | |
| 
 | |
| 	/* Now try to discover other details about the file. */
 | |
| 	for (i = 0; i < ulen; i++) {
 | |
| 		if (ubuf[i] == '\n') {
 | |
| 			if (seen_cr)
 | |
| 				n_crlf++;
 | |
| 			else
 | |
| 				n_lf++;
 | |
| 			last_line_end = i;
 | |
| 		} else if (seen_cr)
 | |
| 			n_cr++;
 | |
| 
 | |
| 		seen_cr = (ubuf[i] == '\r');
 | |
| 		if (seen_cr)
 | |
| 			last_line_end = i;
 | |
| 
 | |
| 		if (ubuf[i] == 0x85) { /* X3.64/ECMA-43 "next line" character */
 | |
| 			n_nel++;
 | |
| 			last_line_end = i;
 | |
| 		}
 | |
| 
 | |
| 		/* If this line is _longer_ than MAXLINELEN, remember it. */
 | |
| 		if (i > last_line_end + MAXLINELEN)
 | |
| 			has_long_lines = 1;
 | |
| 
 | |
| 		if (ubuf[i] == '\033')
 | |
| 			has_escapes = 1;
 | |
| 		if (ubuf[i] == '\b')
 | |
| 			has_backspace = 1;
 | |
| 	}
 | |
| 
 | |
| 	/* Beware, if the data has been truncated, the final CR could have
 | |
| 	   been followed by a LF.  If we have HOWMANY bytes, it indicates
 | |
| 	   that the data might have been truncated, probably even before
 | |
| 	   this function was called. */
 | |
| 	if (seen_cr && nbytes < HOWMANY)
 | |
| 		n_cr++;
 | |
| 
 | |
| 	if (strcmp(type, "binary") == 0) {
 | |
| 		rv = 0;
 | |
| 		goto done;
 | |
| 	}
 | |
| 	if (mime) {
 | |
| 		if (!file_printedlen(ms) && (mime & MAGIC_MIME_TYPE) != 0) {
 | |
| 			if (subtype_mime) {
 | |
| 				if (file_printf(ms, "%s", subtype_mime) == -1)
 | |
| 					goto done;
 | |
| 			} else {
 | |
| 				if (file_printf(ms, "text/plain") == -1)
 | |
| 					goto done;
 | |
| 			}
 | |
| 		}
 | |
| 	} else {
 | |
| 		if (file_printedlen(ms)) {
 | |
| 			switch (file_replace(ms, " text$", ", ")) {
 | |
| 			case 0:
 | |
| 				switch (file_replace(ms, " text executable$",
 | |
| 				    ", ")) {
 | |
| 				case 0:
 | |
| 					if (file_printf(ms, ", ") == -1)
 | |
| 						goto done;
 | |
| 				case -1:
 | |
| 					goto done;
 | |
| 				default:
 | |
| 					executable = 1;
 | |
| 					break;
 | |
| 				}
 | |
| 				break;
 | |
| 			case -1:
 | |
| 				goto done;
 | |
| 			default:
 | |
| 				break;
 | |
| 			}
 | |
| 		}
 | |
| 
 | |
| 		if (file_printf(ms, "%s", code) == -1)
 | |
| 			goto done;
 | |
| 
 | |
| 		if (subtype) {
 | |
| 			if (file_printf(ms, " %s", subtype) == -1)
 | |
| 				goto done;
 | |
| 		}
 | |
| 
 | |
| 		if (file_printf(ms, " %s", type) == -1)
 | |
| 			goto done;
 | |
| 
 | |
| 		if (executable)
 | |
| 			if (file_printf(ms, " executable") == -1)
 | |
| 				goto done;
 | |
| 
 | |
| 		if (has_long_lines)
 | |
| 			if (file_printf(ms, ", with very long lines") == -1)
 | |
| 				goto done;
 | |
| 
 | |
| 		/*
 | |
| 		 * Only report line terminators if we find one other than LF,
 | |
| 		 * or if we find none at all.
 | |
| 		 */
 | |
| 		if ((n_crlf == 0 && n_cr == 0 && n_nel == 0 && n_lf == 0) ||
 | |
| 		    (n_crlf != 0 || n_cr != 0 || n_nel != 0)) {
 | |
| 			if (file_printf(ms, ", with") == -1)
 | |
| 				goto done;
 | |
| 
 | |
| 			if (n_crlf == 0 && n_cr == 0 && n_nel == 0 && n_lf == 0) {
 | |
| 				if (file_printf(ms, " no") == -1)
 | |
| 					goto done;
 | |
| 			} else {
 | |
| 				if (n_crlf) {
 | |
| 					if (file_printf(ms, " CRLF") == -1)
 | |
| 						goto done;
 | |
| 					if (n_cr || n_lf || n_nel)
 | |
| 						if (file_printf(ms, ",") == -1)
 | |
| 							goto done;
 | |
| 				}
 | |
| 				if (n_cr) {
 | |
| 					if (file_printf(ms, " CR") == -1)
 | |
| 						goto done;
 | |
| 					if (n_lf || n_nel)
 | |
| 						if (file_printf(ms, ",") == -1)
 | |
| 							goto done;
 | |
| 				}
 | |
| 				if (n_lf) {
 | |
| 					if (file_printf(ms, " LF") == -1)
 | |
| 						goto done;
 | |
| 					if (n_nel)
 | |
| 						if (file_printf(ms, ",") == -1)
 | |
| 							goto done;
 | |
| 				}
 | |
| 				if (n_nel)
 | |
| 					if (file_printf(ms, " NEL") == -1)
 | |
| 						goto done;
 | |
| 			}
 | |
| 
 | |
| 			if (file_printf(ms, " line terminators") == -1)
 | |
| 				goto done;
 | |
| 		}
 | |
| 
 | |
| 		if (has_escapes)
 | |
| 			if (file_printf(ms, ", with escape sequences") == -1)
 | |
| 				goto done;
 | |
| 		if (has_backspace)
 | |
| 			if (file_printf(ms, ", with overstriking") == -1)
 | |
| 				goto done;
 | |
| 	}
 | |
| 	rv = 1;
 | |
| done:
 | |
| 	if (utf8_buf)
 | |
| 		free(utf8_buf);
 | |
| 
 | |
| 	return rv;
 | |
| }
 | |
| 
 | |
| private int
 | |
| ascmatch(const unsigned char *s, const unichar *us, size_t ulen)
 | |
| {
 | |
| 	size_t i;
 | |
| 
 | |
| 	for (i = 0; i < ulen; i++) {
 | |
| 		if (s[i] != us[i])
 | |
| 			return 0;
 | |
| 	}
 | |
| 
 | |
| 	if (s[i])
 | |
| 		return 0;
 | |
| 	else
 | |
| 		return 1;
 | |
| }
 | |
| 
 | |
| /*
 | |
|  * Encode Unicode string as UTF-8, returning pointer to character
 | |
|  * after end of string, or NULL if an invalid character is found.
 | |
|  */
 | |
| private unsigned char *
 | |
| encode_utf8(unsigned char *buf, size_t len, unichar *ubuf, size_t ulen)
 | |
| {
 | |
| 	size_t i;
 | |
| 	unsigned char *end = buf + len;
 | |
| 
 | |
| 	for (i = 0; i < ulen; i++) {
 | |
| 		if (ubuf[i] <= 0x7f) {
 | |
| 			if (end - buf < 1)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)ubuf[i];
 | |
| 		} else if (ubuf[i] <= 0x7ff) {
 | |
| 			if (end - buf < 2)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)((ubuf[i] >> 6) + 0xc0);
 | |
| 			*buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
 | |
| 		} else if (ubuf[i] <= 0xffff) {
 | |
| 			if (end - buf < 3)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)((ubuf[i] >> 12) + 0xe0);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 6) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
 | |
| 		} else if (ubuf[i] <= 0x1fffff) {
 | |
| 			if (end - buf < 4)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)((ubuf[i] >> 18) + 0xf0);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >>  6) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
 | |
| 		} else if (ubuf[i] <= 0x3ffffff) {
 | |
| 			if (end - buf < 5)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)((ubuf[i] >> 24) + 0xf8);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 18) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >>  6) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
 | |
| 		} else if (ubuf[i] <= 0x7fffffff) {
 | |
| 			if (end - buf < 6)
 | |
| 				return NULL;
 | |
| 			*buf++ = (unsigned char)((ubuf[i] >> 30) + 0xfc);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 24) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 18) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)(((ubuf[i] >>  6) & 0x3f) + 0x80);
 | |
| 			*buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
 | |
| 		} else /* Invalid character */
 | |
| 			return NULL;
 | |
| 	}
 | |
| 
 | |
| 	return buf;
 | |
| }
 | 
