ascmagic.c 24 KB

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