ascmagic.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791
  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. * ASCII magic -- file types that we know based on keywords
  30. * that can appear anywhere in the file.
  31. *
  32. * Extensively modified by Eric Fischer <enf@pobox.com> in July, 2000,
  33. * to handle character codes other than ASCII on a unified basis.
  34. *
  35. * Joerg Wunsch <joerg@freebsd.org> wrote the original support for 8-bit
  36. * international characters, now subsumed into this file.
  37. */
  38. #include "file.h"
  39. #include "magic.h"
  40. #include <stdio.h>
  41. #include <string.h>
  42. #include <memory.h>
  43. #include <ctype.h>
  44. #include <stdlib.h>
  45. #ifdef HAVE_UNISTD_H
  46. #include <unistd.h>
  47. #endif
  48. #include "names.h"
  49. #ifndef lint
  50. FILE_RCSID("@(#)$File: ascmagic.c,v 1.63 2008/05/09 14:20:28 christos Exp $")
  51. #endif /* lint */
  52. #define MAXLINELEN 300 /* longest sane line length */
  53. #define ISSPC(x) ((x) == ' ' || (x) == '\t' || (x) == '\r' || (x) == '\n' \
  54. || (x) == 0x85 || (x) == '\f')
  55. private int looks_ascii(const unsigned char *, size_t, unichar *, size_t *);
  56. private int looks_utf8_with_BOM(const unsigned char *, size_t, unichar *,
  57. size_t *);
  58. private int looks_ucs16(const unsigned char *, size_t, unichar *, size_t *);
  59. private int looks_latin1(const unsigned char *, size_t, unichar *, size_t *);
  60. private int looks_extended(const unsigned char *, size_t, unichar *, size_t *);
  61. private void from_ebcdic(const unsigned char *, size_t, unsigned char *);
  62. private int ascmatch(const unsigned char *, const unichar *, size_t);
  63. private unsigned char *encode_utf8(unsigned char *, size_t, unichar *, size_t);
  64. protected int
  65. file_ascmagic(struct magic_set *ms, const unsigned char *buf, size_t nbytes)
  66. {
  67. size_t i;
  68. unsigned char *nbuf = NULL, *utf8_buf = NULL, *utf8_end;
  69. unichar *ubuf = NULL;
  70. size_t ulen, mlen;
  71. const struct names *p;
  72. int rv = -1;
  73. int mime = ms->flags & MAGIC_MIME;
  74. const char *code = NULL;
  75. const char *code_mime = NULL;
  76. const char *type = NULL;
  77. const char *subtype = NULL;
  78. const char *subtype_mime = NULL;
  79. int has_escapes = 0;
  80. int has_backspace = 0;
  81. int seen_cr = 0;
  82. int n_crlf = 0;
  83. int n_lf = 0;
  84. int n_cr = 0;
  85. int n_nel = 0;
  86. size_t last_line_end = (size_t)-1;
  87. int has_long_lines = 0;
  88. /*
  89. * Undo the NUL-termination kindly provided by process()
  90. * but leave at least one byte to look at
  91. */
  92. while (nbytes > 1 && buf[nbytes - 1] == '\0')
  93. nbytes--;
  94. if ((nbuf = calloc(1, (nbytes + 1) * sizeof(nbuf[0]))) == NULL)
  95. goto done;
  96. if ((ubuf = calloc(1, (nbytes + 1) * sizeof(ubuf[0]))) == NULL)
  97. goto done;
  98. /*
  99. * Then try to determine whether it's any character code we can
  100. * identify. Each of these tests, if it succeeds, will leave
  101. * the text converted into one-unichar-per-character Unicode in
  102. * ubuf, and the number of characters converted in ulen.
  103. */
  104. if (looks_ascii(buf, nbytes, ubuf, &ulen)) {
  105. code = "ASCII";
  106. code_mime = "us-ascii";
  107. type = "text";
  108. } else if (looks_utf8_with_BOM(buf, nbytes, ubuf, &ulen) > 0) {
  109. code = "UTF-8 Unicode (with BOM)";
  110. code_mime = "utf-8";
  111. type = "text";
  112. } else if (file_looks_utf8(buf, nbytes, ubuf, &ulen) > 1) {
  113. code = "UTF-8 Unicode";
  114. code_mime = "utf-8";
  115. type = "text";
  116. } else if ((i = looks_ucs16(buf, nbytes, ubuf, &ulen)) != 0) {
  117. if (i == 1)
  118. code = "Little-endian UTF-16 Unicode";
  119. else
  120. code = "Big-endian UTF-16 Unicode";
  121. type = "character data";
  122. code_mime = "utf-16"; /* is this defined? */
  123. } else if (looks_latin1(buf, nbytes, ubuf, &ulen)) {
  124. code = "ISO-8859";
  125. type = "text";
  126. code_mime = "iso-8859-1";
  127. } else if (looks_extended(buf, nbytes, ubuf, &ulen)) {
  128. code = "Non-ISO extended-ASCII";
  129. type = "text";
  130. code_mime = "unknown";
  131. } else {
  132. from_ebcdic(buf, nbytes, nbuf);
  133. if (looks_ascii(nbuf, nbytes, ubuf, &ulen)) {
  134. code = "EBCDIC";
  135. type = "character data";
  136. code_mime = "ebcdic";
  137. } else if (looks_latin1(nbuf, nbytes, ubuf, &ulen)) {
  138. code = "International EBCDIC";
  139. type = "character data";
  140. code_mime = "ebcdic";
  141. } else {
  142. rv = 0;
  143. goto done; /* doesn't look like text at all */
  144. }
  145. }
  146. if (nbytes <= 1) {
  147. rv = 0;
  148. goto done;
  149. }
  150. /* Convert ubuf to UTF-8 and try text soft magic */
  151. /* If original was ASCII or UTF-8, could use nbuf instead of
  152. re-converting. */
  153. /* malloc size is a conservative overestimate; could be
  154. re-converting improved, or at least realloced after
  155. re-converting conversion. */
  156. mlen = ulen * 6;
  157. if ((utf8_buf = malloc(mlen)) == NULL) {
  158. file_oomem(ms, mlen);
  159. goto done;
  160. }
  161. if ((utf8_end = encode_utf8(utf8_buf, mlen, ubuf, ulen)) == NULL)
  162. goto done;
  163. if (file_softmagic(ms, utf8_buf, utf8_end - utf8_buf, TEXTTEST) != 0) {
  164. rv = 1;
  165. goto done;
  166. }
  167. /* look for tokens from names.h - this is expensive! */
  168. if ((ms->flags & MAGIC_NO_CHECK_TOKENS) != 0)
  169. goto subtype_identified;
  170. i = 0;
  171. while (i < ulen) {
  172. size_t end;
  173. /* skip past any leading space */
  174. while (i < ulen && ISSPC(ubuf[i]))
  175. i++;
  176. if (i >= ulen)
  177. break;
  178. /* find the next whitespace */
  179. for (end = i + 1; end < nbytes; end++)
  180. if (ISSPC(ubuf[end]))
  181. break;
  182. /* compare the word thus isolated against the token list */
  183. for (p = names; p < names + NNAMES; p++) {
  184. if (ascmatch((const unsigned char *)p->name, ubuf + i,
  185. end - i)) {
  186. subtype = types[p->type].human;
  187. subtype_mime = types[p->type].mime;
  188. goto subtype_identified;
  189. }
  190. }
  191. i = end;
  192. }
  193. subtype_identified:
  194. /* Now try to discover other details about the file. */
  195. for (i = 0; i < ulen; i++) {
  196. if (ubuf[i] == '\n') {
  197. if (seen_cr)
  198. n_crlf++;
  199. else
  200. n_lf++;
  201. last_line_end = i;
  202. } else if (seen_cr)
  203. n_cr++;
  204. seen_cr = (ubuf[i] == '\r');
  205. if (seen_cr)
  206. last_line_end = i;
  207. if (ubuf[i] == 0x85) { /* X3.64/ECMA-43 "next line" character */
  208. n_nel++;
  209. last_line_end = i;
  210. }
  211. /* If this line is _longer_ than MAXLINELEN, remember it. */
  212. if (i > last_line_end + MAXLINELEN)
  213. has_long_lines = 1;
  214. if (ubuf[i] == '\033')
  215. has_escapes = 1;
  216. if (ubuf[i] == '\b')
  217. has_backspace = 1;
  218. }
  219. /* Beware, if the data has been truncated, the final CR could have
  220. been followed by a LF. If we have HOWMANY bytes, it indicates
  221. that the data might have been truncated, probably even before
  222. this function was called. */
  223. if (seen_cr && nbytes < HOWMANY)
  224. n_cr++;
  225. if (mime) {
  226. if (mime & MAGIC_MIME_TYPE) {
  227. if (subtype_mime) {
  228. if (file_printf(ms, subtype_mime) == -1)
  229. goto done;
  230. } else {
  231. if (file_printf(ms, "text/plain") == -1)
  232. goto done;
  233. }
  234. }
  235. if ((mime == 0 || mime == MAGIC_MIME) && code_mime) {
  236. if ((mime & MAGIC_MIME_TYPE) &&
  237. file_printf(ms, " charset=") == -1)
  238. goto done;
  239. if (file_printf(ms, code_mime) == -1)
  240. goto done;
  241. }
  242. if (mime == MAGIC_MIME_ENCODING)
  243. file_printf(ms, "binary");
  244. } else {
  245. if (file_printf(ms, code) == -1)
  246. goto done;
  247. if (subtype) {
  248. if (file_printf(ms, " ") == -1)
  249. goto done;
  250. if (file_printf(ms, subtype) == -1)
  251. goto done;
  252. }
  253. if (file_printf(ms, " ") == -1)
  254. goto done;
  255. if (file_printf(ms, type) == -1)
  256. goto done;
  257. if (has_long_lines)
  258. if (file_printf(ms, ", with very long lines") == -1)
  259. goto done;
  260. /*
  261. * Only report line terminators if we find one other than LF,
  262. * or if we find none at all.
  263. */
  264. if ((n_crlf == 0 && n_cr == 0 && n_nel == 0 && n_lf == 0) ||
  265. (n_crlf != 0 || n_cr != 0 || n_nel != 0)) {
  266. if (file_printf(ms, ", with") == -1)
  267. goto done;
  268. if (n_crlf == 0 && n_cr == 0 && n_nel == 0 && n_lf == 0) {
  269. if (file_printf(ms, " no") == -1)
  270. goto done;
  271. } else {
  272. if (n_crlf) {
  273. if (file_printf(ms, " CRLF") == -1)
  274. goto done;
  275. if (n_cr || n_lf || n_nel)
  276. if (file_printf(ms, ",") == -1)
  277. goto done;
  278. }
  279. if (n_cr) {
  280. if (file_printf(ms, " CR") == -1)
  281. goto done;
  282. if (n_lf || n_nel)
  283. if (file_printf(ms, ",") == -1)
  284. goto done;
  285. }
  286. if (n_lf) {
  287. if (file_printf(ms, " LF") == -1)
  288. goto done;
  289. if (n_nel)
  290. if (file_printf(ms, ",") == -1)
  291. goto done;
  292. }
  293. if (n_nel)
  294. if (file_printf(ms, " NEL") == -1)
  295. goto done;
  296. }
  297. if (file_printf(ms, " line terminators") == -1)
  298. goto done;
  299. }
  300. if (has_escapes)
  301. if (file_printf(ms, ", with escape sequences") == -1)
  302. goto done;
  303. if (has_backspace)
  304. if (file_printf(ms, ", with overstriking") == -1)
  305. goto done;
  306. }
  307. rv = 1;
  308. done:
  309. if (nbuf)
  310. free(nbuf);
  311. if (ubuf)
  312. free(ubuf);
  313. if (utf8_buf)
  314. free(utf8_buf);
  315. return rv;
  316. }
  317. private int
  318. ascmatch(const unsigned char *s, const unichar *us, size_t ulen)
  319. {
  320. size_t i;
  321. for (i = 0; i < ulen; i++) {
  322. if (s[i] != us[i])
  323. return 0;
  324. }
  325. if (s[i])
  326. return 0;
  327. else
  328. return 1;
  329. }
  330. /*
  331. * This table reflects a particular philosophy about what constitutes
  332. * "text," and there is room for disagreement about it.
  333. *
  334. * Version 3.31 of the file command considered a file to be ASCII if
  335. * each of its characters was approved by either the isascii() or
  336. * isalpha() function. On most systems, this would mean that any
  337. * file consisting only of characters in the range 0x00 ... 0x7F
  338. * would be called ASCII text, but many systems might reasonably
  339. * consider some characters outside this range to be alphabetic,
  340. * so the file command would call such characters ASCII. It might
  341. * have been more accurate to call this "considered textual on the
  342. * local system" than "ASCII."
  343. *
  344. * It considered a file to be "International language text" if each
  345. * of its characters was either an ASCII printing character (according
  346. * to the real ASCII standard, not the above test), a character in
  347. * the range 0x80 ... 0xFF, or one of the following control characters:
  348. * backspace, tab, line feed, vertical tab, form feed, carriage return,
  349. * escape. No attempt was made to determine the language in which files
  350. * of this type were written.
  351. *
  352. *
  353. * The table below considers a file to be ASCII if all of its characters
  354. * are either ASCII printing characters (again, according to the X3.4
  355. * standard, not isascii()) or any of the following controls: bell,
  356. * backspace, tab, line feed, form feed, carriage return, esc, nextline.
  357. *
  358. * I include bell because some programs (particularly shell scripts)
  359. * use it literally, even though it is rare in normal text. I exclude
  360. * vertical tab because it never seems to be used in real text. I also
  361. * include, with hesitation, the X3.64/ECMA-43 control nextline (0x85),
  362. * because that's what the dd EBCDIC->ASCII table maps the EBCDIC newline
  363. * character to. It might be more appropriate to include it in the 8859
  364. * set instead of the ASCII set, but it's got to be included in *something*
  365. * we recognize or EBCDIC files aren't going to be considered textual.
  366. * Some old Unix source files use SO/SI (^N/^O) to shift between Greek
  367. * and Latin characters, so these should possibly be allowed. But they
  368. * make a real mess on VT100-style displays if they're not paired properly,
  369. * so we are probably better off not calling them text.
  370. *
  371. * A file is considered to be ISO-8859 text if its characters are all
  372. * either ASCII, according to the above definition, or printing characters
  373. * from the ISO-8859 8-bit extension, characters 0xA0 ... 0xFF.
  374. *
  375. * Finally, a file is considered to be international text from some other
  376. * character code if its characters are all either ISO-8859 (according to
  377. * the above definition) or characters in the range 0x80 ... 0x9F, which
  378. * ISO-8859 considers to be control characters but the IBM PC and Macintosh
  379. * consider to be printing characters.
  380. */
  381. #define F 0 /* character never appears in text */
  382. #define T 1 /* character appears in plain ASCII text */
  383. #define I 2 /* character appears in ISO-8859 text */
  384. #define X 3 /* character appears in non-ISO extended ASCII (Mac, IBM PC) */
  385. private char text_chars[256] = {
  386. /* BEL BS HT LF FF CR */
  387. F, F, F, F, F, F, F, T, T, T, T, F, T, T, F, F, /* 0x0X */
  388. /* ESC */
  389. F, F, F, F, F, F, F, F, F, F, F, T, F, F, F, F, /* 0x1X */
  390. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, /* 0x2X */
  391. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, /* 0x3X */
  392. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, /* 0x4X */
  393. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, /* 0x5X */
  394. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, /* 0x6X */
  395. T, T, T, T, T, T, T, T, T, T, T, T, T, T, T, F, /* 0x7X */
  396. /* NEL */
  397. X, X, X, X, X, T, X, X, X, X, X, X, X, X, X, X, /* 0x8X */
  398. X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, X, /* 0x9X */
  399. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xaX */
  400. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xbX */
  401. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xcX */
  402. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xdX */
  403. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, /* 0xeX */
  404. I, I, I, I, I, I, I, I, I, I, I, I, I, I, I, I /* 0xfX */
  405. };
  406. private int
  407. looks_ascii(const unsigned char *buf, size_t nbytes, unichar *ubuf,
  408. size_t *ulen)
  409. {
  410. size_t i;
  411. *ulen = 0;
  412. for (i = 0; i < nbytes; i++) {
  413. int t = text_chars[buf[i]];
  414. if (t != T)
  415. return 0;
  416. ubuf[(*ulen)++] = buf[i];
  417. }
  418. return 1;
  419. }
  420. private int
  421. looks_latin1(const unsigned char *buf, size_t nbytes, unichar *ubuf, size_t *ulen)
  422. {
  423. size_t i;
  424. *ulen = 0;
  425. for (i = 0; i < nbytes; i++) {
  426. int t = text_chars[buf[i]];
  427. if (t != T && t != I)
  428. return 0;
  429. ubuf[(*ulen)++] = buf[i];
  430. }
  431. return 1;
  432. }
  433. private int
  434. looks_extended(const unsigned char *buf, size_t nbytes, unichar *ubuf,
  435. size_t *ulen)
  436. {
  437. size_t i;
  438. *ulen = 0;
  439. for (i = 0; i < nbytes; i++) {
  440. int t = text_chars[buf[i]];
  441. if (t != T && t != I && t != X)
  442. return 0;
  443. ubuf[(*ulen)++] = buf[i];
  444. }
  445. return 1;
  446. }
  447. /*
  448. * Encode Unicode string as UTF-8, returning pointer to character
  449. * after end of string, or NULL if an invalid character is found.
  450. */
  451. private unsigned char *
  452. encode_utf8(unsigned char *buf, size_t len, unichar *ubuf, size_t ulen)
  453. {
  454. size_t i;
  455. unsigned char *end = buf + len;
  456. for (i = 0; i < ulen; i++) {
  457. if (ubuf[i] <= 0x7f) {
  458. if (end - buf < 1)
  459. return NULL;
  460. *buf++ = (unsigned char)ubuf[i];
  461. } else if (ubuf[i] <= 0x7ff) {
  462. if (end - buf < 2)
  463. return NULL;
  464. *buf++ = (unsigned char)((ubuf[i] >> 6) + 0xc0);
  465. *buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
  466. } else if (ubuf[i] <= 0xffff) {
  467. if (end - buf < 3)
  468. return NULL;
  469. *buf++ = (unsigned char)((ubuf[i] >> 12) + 0xe0);
  470. *buf++ = (unsigned char)(((ubuf[i] >> 6) & 0x3f) + 0x80);
  471. *buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
  472. } else if (ubuf[i] <= 0x1fffff) {
  473. if (end - buf < 4)
  474. return NULL;
  475. *buf++ = (unsigned char)((ubuf[i] >> 18) + 0xf0);
  476. *buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
  477. *buf++ = (unsigned char)(((ubuf[i] >> 6) & 0x3f) + 0x80);
  478. *buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
  479. } else if (ubuf[i] <= 0x3ffffff) {
  480. if (end - buf < 5)
  481. return NULL;
  482. *buf++ = (unsigned char)((ubuf[i] >> 24) + 0xf8);
  483. *buf++ = (unsigned char)(((ubuf[i] >> 18) & 0x3f) + 0x80);
  484. *buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
  485. *buf++ = (unsigned char)(((ubuf[i] >> 6) & 0x3f) + 0x80);
  486. *buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
  487. } else if (ubuf[i] <= 0x7fffffff) {
  488. if (end - buf < 6)
  489. return NULL;
  490. *buf++ = (unsigned char)((ubuf[i] >> 30) + 0xfc);
  491. *buf++ = (unsigned char)(((ubuf[i] >> 24) & 0x3f) + 0x80);
  492. *buf++ = (unsigned char)(((ubuf[i] >> 18) & 0x3f) + 0x80);
  493. *buf++ = (unsigned char)(((ubuf[i] >> 12) & 0x3f) + 0x80);
  494. *buf++ = (unsigned char)(((ubuf[i] >> 6) & 0x3f) + 0x80);
  495. *buf++ = (unsigned char)((ubuf[i] & 0x3f) + 0x80);
  496. } else /* Invalid character */
  497. return NULL;
  498. }
  499. return buf;
  500. }
  501. /*
  502. * Decide whether some text looks like UTF-8. Returns:
  503. *
  504. * -1: invalid UTF-8
  505. * 0: uses odd control characters, so doesn't look like text
  506. * 1: 7-bit text
  507. * 2: definitely UTF-8 text (valid high-bit set bytes)
  508. *
  509. * If ubuf is non-NULL on entry, text is decoded into ubuf, *ulen;
  510. * ubuf must be big enough!
  511. */
  512. protected int
  513. file_looks_utf8(const unsigned char *buf, size_t nbytes, unichar *ubuf, size_t *ulen)
  514. {
  515. size_t i;
  516. int n;
  517. unichar c;
  518. int gotone = 0, ctrl = 0;
  519. if (ubuf)
  520. *ulen = 0;
  521. for (i = 0; i < nbytes; i++) {
  522. if ((buf[i] & 0x80) == 0) { /* 0xxxxxxx is plain ASCII */
  523. /*
  524. * Even if the whole file is valid UTF-8 sequences,
  525. * still reject it if it uses weird control characters.
  526. */
  527. if (text_chars[buf[i]] != T)
  528. ctrl = 1;
  529. if (ubuf)
  530. ubuf[(*ulen)++] = buf[i];
  531. } else if ((buf[i] & 0x40) == 0) { /* 10xxxxxx never 1st byte */
  532. return -1;
  533. } else { /* 11xxxxxx begins UTF-8 */
  534. int following;
  535. if ((buf[i] & 0x20) == 0) { /* 110xxxxx */
  536. c = buf[i] & 0x1f;
  537. following = 1;
  538. } else if ((buf[i] & 0x10) == 0) { /* 1110xxxx */
  539. c = buf[i] & 0x0f;
  540. following = 2;
  541. } else if ((buf[i] & 0x08) == 0) { /* 11110xxx */
  542. c = buf[i] & 0x07;
  543. following = 3;
  544. } else if ((buf[i] & 0x04) == 0) { /* 111110xx */
  545. c = buf[i] & 0x03;
  546. following = 4;
  547. } else if ((buf[i] & 0x02) == 0) { /* 1111110x */
  548. c = buf[i] & 0x01;
  549. following = 5;
  550. } else
  551. return -1;
  552. for (n = 0; n < following; n++) {
  553. i++;
  554. if (i >= nbytes)
  555. goto done;
  556. if ((buf[i] & 0x80) == 0 || (buf[i] & 0x40))
  557. return -1;
  558. c = (c << 6) + (buf[i] & 0x3f);
  559. }
  560. if (ubuf)
  561. ubuf[(*ulen)++] = c;
  562. gotone = 1;
  563. }
  564. }
  565. done:
  566. return ctrl ? 0 : (gotone ? 2 : 1);
  567. }
  568. /*
  569. * Decide whether some text looks like UTF-8 with BOM. If there is no
  570. * BOM, return -1; otherwise return the result of looks_utf8 on the
  571. * rest of the text.
  572. */
  573. private int
  574. looks_utf8_with_BOM(const unsigned char *buf, size_t nbytes, unichar *ubuf,
  575. size_t *ulen)
  576. {
  577. if (nbytes > 3 && buf[0] == 0xef && buf[1] == 0xbb && buf[2] == 0xbf)
  578. return file_looks_utf8(buf + 3, nbytes - 3, ubuf, ulen);
  579. else
  580. return -1;
  581. }
  582. private int
  583. looks_ucs16(const unsigned char *buf, size_t nbytes, unichar *ubuf,
  584. size_t *ulen)
  585. {
  586. int bigend;
  587. size_t i;
  588. if (nbytes < 2)
  589. return 0;
  590. if (buf[0] == 0xff && buf[1] == 0xfe)
  591. bigend = 0;
  592. else if (buf[0] == 0xfe && buf[1] == 0xff)
  593. bigend = 1;
  594. else
  595. return 0;
  596. *ulen = 0;
  597. for (i = 2; i + 1 < nbytes; i += 2) {
  598. /* XXX fix to properly handle chars > 65536 */
  599. if (bigend)
  600. ubuf[(*ulen)++] = buf[i + 1] + 256 * buf[i];
  601. else
  602. ubuf[(*ulen)++] = buf[i] + 256 * buf[i + 1];
  603. if (ubuf[*ulen - 1] == 0xfffe)
  604. return 0;
  605. if (ubuf[*ulen - 1] < 128 &&
  606. text_chars[(size_t)ubuf[*ulen - 1]] != T)
  607. return 0;
  608. }
  609. return 1 + bigend;
  610. }
  611. #undef F
  612. #undef T
  613. #undef I
  614. #undef X
  615. /*
  616. * This table maps each EBCDIC character to an (8-bit extended) ASCII
  617. * character, as specified in the rationale for the dd(1) command in
  618. * draft 11.2 (September, 1991) of the POSIX P1003.2 standard.
  619. *
  620. * Unfortunately it does not seem to correspond exactly to any of the
  621. * five variants of EBCDIC documented in IBM's _Enterprise Systems
  622. * Architecture/390: Principles of Operation_, SA22-7201-06, Seventh
  623. * Edition, July, 1999, pp. I-1 - I-4.
  624. *
  625. * Fortunately, though, all versions of EBCDIC, including this one, agree
  626. * on most of the printing characters that also appear in (7-bit) ASCII.
  627. * Of these, only '|', '!', '~', '^', '[', and ']' are in question at all.
  628. *
  629. * Fortunately too, there is general agreement that codes 0x00 through
  630. * 0x3F represent control characters, 0x41 a nonbreaking space, and the
  631. * remainder printing characters.
  632. *
  633. * This is sufficient to allow us to identify EBCDIC text and to distinguish
  634. * between old-style and internationalized examples of text.
  635. */
  636. private unsigned char ebcdic_to_ascii[] = {
  637. 0, 1, 2, 3, 156, 9, 134, 127, 151, 141, 142, 11, 12, 13, 14, 15,
  638. 16, 17, 18, 19, 157, 133, 8, 135, 24, 25, 146, 143, 28, 29, 30, 31,
  639. 128, 129, 130, 131, 132, 10, 23, 27, 136, 137, 138, 139, 140, 5, 6, 7,
  640. 144, 145, 22, 147, 148, 149, 150, 4, 152, 153, 154, 155, 20, 21, 158, 26,
  641. ' ', 160, 161, 162, 163, 164, 165, 166, 167, 168, 213, '.', '<', '(', '+', '|',
  642. '&', 169, 170, 171, 172, 173, 174, 175, 176, 177, '!', '$', '*', ')', ';', '~',
  643. '-', '/', 178, 179, 180, 181, 182, 183, 184, 185, 203, ',', '%', '_', '>', '?',
  644. 186, 187, 188, 189, 190, 191, 192, 193, 194, '`', ':', '#', '@', '\'','=', '"',
  645. 195, 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 196, 197, 198, 199, 200, 201,
  646. 202, 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', '^', 204, 205, 206, 207, 208,
  647. 209, 229, 's', 't', 'u', 'v', 'w', 'x', 'y', 'z', 210, 211, 212, '[', 214, 215,
  648. 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, ']', 230, 231,
  649. '{', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 232, 233, 234, 235, 236, 237,
  650. '}', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 238, 239, 240, 241, 242, 243,
  651. '\\',159, 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', 244, 245, 246, 247, 248, 249,
  652. '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 250, 251, 252, 253, 254, 255
  653. };
  654. #ifdef notdef
  655. /*
  656. * The following EBCDIC-to-ASCII table may relate more closely to reality,
  657. * or at least to modern reality. It comes from
  658. *
  659. * http://ftp.s390.ibm.com/products/oe/bpxqp9.html
  660. *
  661. * and maps the characters of EBCDIC code page 1047 (the code used for
  662. * Unix-derived software on IBM's 390 systems) to the corresponding
  663. * characters from ISO 8859-1.
  664. *
  665. * If this table is used instead of the above one, some of the special
  666. * cases for the NEL character can be taken out of the code.
  667. */
  668. private unsigned char ebcdic_1047_to_8859[] = {
  669. 0x00,0x01,0x02,0x03,0x9C,0x09,0x86,0x7F,0x97,0x8D,0x8E,0x0B,0x0C,0x0D,0x0E,0x0F,
  670. 0x10,0x11,0x12,0x13,0x9D,0x0A,0x08,0x87,0x18,0x19,0x92,0x8F,0x1C,0x1D,0x1E,0x1F,
  671. 0x80,0x81,0x82,0x83,0x84,0x85,0x17,0x1B,0x88,0x89,0x8A,0x8B,0x8C,0x05,0x06,0x07,
  672. 0x90,0x91,0x16,0x93,0x94,0x95,0x96,0x04,0x98,0x99,0x9A,0x9B,0x14,0x15,0x9E,0x1A,
  673. 0x20,0xA0,0xE2,0xE4,0xE0,0xE1,0xE3,0xE5,0xE7,0xF1,0xA2,0x2E,0x3C,0x28,0x2B,0x7C,
  674. 0x26,0xE9,0xEA,0xEB,0xE8,0xED,0xEE,0xEF,0xEC,0xDF,0x21,0x24,0x2A,0x29,0x3B,0x5E,
  675. 0x2D,0x2F,0xC2,0xC4,0xC0,0xC1,0xC3,0xC5,0xC7,0xD1,0xA6,0x2C,0x25,0x5F,0x3E,0x3F,
  676. 0xF8,0xC9,0xCA,0xCB,0xC8,0xCD,0xCE,0xCF,0xCC,0x60,0x3A,0x23,0x40,0x27,0x3D,0x22,
  677. 0xD8,0x61,0x62,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0xAB,0xBB,0xF0,0xFD,0xFE,0xB1,
  678. 0xB0,0x6A,0x6B,0x6C,0x6D,0x6E,0x6F,0x70,0x71,0x72,0xAA,0xBA,0xE6,0xB8,0xC6,0xA4,
  679. 0xB5,0x7E,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7A,0xA1,0xBF,0xD0,0x5B,0xDE,0xAE,
  680. 0xAC,0xA3,0xA5,0xB7,0xA9,0xA7,0xB6,0xBC,0xBD,0xBE,0xDD,0xA8,0xAF,0x5D,0xB4,0xD7,
  681. 0x7B,0x41,0x42,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0xAD,0xF4,0xF6,0xF2,0xF3,0xF5,
  682. 0x7D,0x4A,0x4B,0x4C,0x4D,0x4E,0x4F,0x50,0x51,0x52,0xB9,0xFB,0xFC,0xF9,0xFA,0xFF,
  683. 0x5C,0xF7,0x53,0x54,0x55,0x56,0x57,0x58,0x59,0x5A,0xB2,0xD4,0xD6,0xD2,0xD3,0xD5,
  684. 0x30,0x31,0x32,0x33,0x34,0x35,0x36,0x37,0x38,0x39,0xB3,0xDB,0xDC,0xD9,0xDA,0x9F
  685. };
  686. #endif
  687. /*
  688. * Copy buf[0 ... nbytes-1] into out[], translating EBCDIC to ASCII.
  689. */
  690. private void
  691. from_ebcdic(const unsigned char *buf, size_t nbytes, unsigned char *out)
  692. {
  693. size_t i;
  694. for (i = 0; i < nbytes; i++) {
  695. out[i] = ebcdic_to_ascii[buf[i]];
  696. }
  697. }