unicode.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499
  1. /*
  2. * unicode.c
  3. *
  4. * PURPOSE
  5. * Routines for converting between UTF-8 and OSTA Compressed Unicode.
  6. * Also handles filename mangling
  7. *
  8. * DESCRIPTION
  9. * OSTA Compressed Unicode is explained in the OSTA UDF specification.
  10. * http://www.osta.org/
  11. * UTF-8 is explained in the IETF RFC XXXX.
  12. * ftp://ftp.internic.net/rfc/rfcxxxx.txt
  13. *
  14. * COPYRIGHT
  15. * This file is distributed under the terms of the GNU General Public
  16. * License (GPL). Copies of the GPL can be obtained from:
  17. * ftp://prep.ai.mit.edu/pub/gnu/GPL
  18. * Each contributing author retains all rights to their own work.
  19. */
  20. #include "udfdecl.h"
  21. #include <linux/kernel.h>
  22. #include <linux/string.h> /* for memset */
  23. #include <linux/nls.h>
  24. #include <linux/crc-itu-t.h>
  25. #include <linux/slab.h>
  26. #include "udf_sb.h"
  27. static int udf_translate_to_linux(uint8_t *, int, uint8_t *, int, uint8_t *,
  28. int);
  29. static int udf_char_to_ustr(struct ustr *dest, const uint8_t *src, int strlen)
  30. {
  31. if ((!dest) || (!src) || (!strlen) || (strlen > UDF_NAME_LEN - 2))
  32. return 0;
  33. memset(dest, 0, sizeof(struct ustr));
  34. memcpy(dest->u_name, src, strlen);
  35. dest->u_cmpID = 0x08;
  36. dest->u_len = strlen;
  37. return strlen;
  38. }
  39. /*
  40. * udf_build_ustr
  41. */
  42. int udf_build_ustr(struct ustr *dest, dstring *ptr, int size)
  43. {
  44. int usesize;
  45. if (!dest || !ptr || !size)
  46. return -1;
  47. BUG_ON(size < 2);
  48. usesize = min_t(size_t, ptr[size - 1], sizeof(dest->u_name));
  49. usesize = min(usesize, size - 2);
  50. dest->u_cmpID = ptr[0];
  51. dest->u_len = usesize;
  52. memcpy(dest->u_name, ptr + 1, usesize);
  53. memset(dest->u_name + usesize, 0, sizeof(dest->u_name) - usesize);
  54. return 0;
  55. }
  56. /*
  57. * udf_build_ustr_exact
  58. */
  59. static void udf_build_ustr_exact(struct ustr *dest, dstring *ptr, int exactsize)
  60. {
  61. memset(dest, 0, sizeof(struct ustr));
  62. dest->u_cmpID = ptr[0];
  63. dest->u_len = exactsize - 1;
  64. memcpy(dest->u_name, ptr + 1, exactsize - 1);
  65. }
  66. /*
  67. * udf_CS0toUTF8
  68. *
  69. * PURPOSE
  70. * Convert OSTA Compressed Unicode to the UTF-8 equivalent.
  71. *
  72. * PRE-CONDITIONS
  73. * utf Pointer to UTF-8 output buffer.
  74. * ocu Pointer to OSTA Compressed Unicode input buffer
  75. * of size UDF_NAME_LEN bytes.
  76. * both of type "struct ustr *"
  77. *
  78. * POST-CONDITIONS
  79. * <return> >= 0 on success.
  80. *
  81. * HISTORY
  82. * November 12, 1997 - Andrew E. Mileski
  83. * Written, tested, and released.
  84. */
  85. int udf_CS0toUTF8(struct ustr *utf_o, const struct ustr *ocu_i)
  86. {
  87. const uint8_t *ocu;
  88. uint8_t cmp_id, ocu_len;
  89. int i;
  90. ocu_len = ocu_i->u_len;
  91. if (ocu_len == 0) {
  92. memset(utf_o, 0, sizeof(struct ustr));
  93. return 0;
  94. }
  95. cmp_id = ocu_i->u_cmpID;
  96. if (cmp_id != 8 && cmp_id != 16) {
  97. memset(utf_o, 0, sizeof(struct ustr));
  98. pr_err("unknown compression code (%d) stri=%s\n",
  99. cmp_id, ocu_i->u_name);
  100. return -EINVAL;
  101. }
  102. ocu = ocu_i->u_name;
  103. utf_o->u_len = 0;
  104. for (i = 0; (i < ocu_len) && (utf_o->u_len <= (UDF_NAME_LEN - 3));) {
  105. /* Expand OSTA compressed Unicode to Unicode */
  106. uint32_t c = ocu[i++];
  107. if (cmp_id == 16)
  108. c = (c << 8) | ocu[i++];
  109. /* Compress Unicode to UTF-8 */
  110. if (c < 0x80U)
  111. utf_o->u_name[utf_o->u_len++] = (uint8_t)c;
  112. else if (c < 0x800U) {
  113. utf_o->u_name[utf_o->u_len++] =
  114. (uint8_t)(0xc0 | (c >> 6));
  115. utf_o->u_name[utf_o->u_len++] =
  116. (uint8_t)(0x80 | (c & 0x3f));
  117. } else {
  118. utf_o->u_name[utf_o->u_len++] =
  119. (uint8_t)(0xe0 | (c >> 12));
  120. utf_o->u_name[utf_o->u_len++] =
  121. (uint8_t)(0x80 |
  122. ((c >> 6) & 0x3f));
  123. utf_o->u_name[utf_o->u_len++] =
  124. (uint8_t)(0x80 | (c & 0x3f));
  125. }
  126. }
  127. utf_o->u_cmpID = 8;
  128. return utf_o->u_len;
  129. }
  130. /*
  131. *
  132. * udf_UTF8toCS0
  133. *
  134. * PURPOSE
  135. * Convert UTF-8 to the OSTA Compressed Unicode equivalent.
  136. *
  137. * DESCRIPTION
  138. * This routine is only called by udf_lookup().
  139. *
  140. * PRE-CONDITIONS
  141. * ocu Pointer to OSTA Compressed Unicode output
  142. * buffer of size UDF_NAME_LEN bytes.
  143. * utf Pointer to UTF-8 input buffer.
  144. * utf_len Length of UTF-8 input buffer in bytes.
  145. *
  146. * POST-CONDITIONS
  147. * <return> Zero on success.
  148. *
  149. * HISTORY
  150. * November 12, 1997 - Andrew E. Mileski
  151. * Written, tested, and released.
  152. */
  153. static int udf_UTF8toCS0(dstring *ocu, struct ustr *utf, int length)
  154. {
  155. unsigned c, i, max_val, utf_char;
  156. int utf_cnt, u_len;
  157. memset(ocu, 0, sizeof(dstring) * length);
  158. ocu[0] = 8;
  159. max_val = 0xffU;
  160. try_again:
  161. u_len = 0U;
  162. utf_char = 0U;
  163. utf_cnt = 0U;
  164. for (i = 0U; i < utf->u_len; i++) {
  165. c = (uint8_t)utf->u_name[i];
  166. /* Complete a multi-byte UTF-8 character */
  167. if (utf_cnt) {
  168. utf_char = (utf_char << 6) | (c & 0x3fU);
  169. if (--utf_cnt)
  170. continue;
  171. } else {
  172. /* Check for a multi-byte UTF-8 character */
  173. if (c & 0x80U) {
  174. /* Start a multi-byte UTF-8 character */
  175. if ((c & 0xe0U) == 0xc0U) {
  176. utf_char = c & 0x1fU;
  177. utf_cnt = 1;
  178. } else if ((c & 0xf0U) == 0xe0U) {
  179. utf_char = c & 0x0fU;
  180. utf_cnt = 2;
  181. } else if ((c & 0xf8U) == 0xf0U) {
  182. utf_char = c & 0x07U;
  183. utf_cnt = 3;
  184. } else if ((c & 0xfcU) == 0xf8U) {
  185. utf_char = c & 0x03U;
  186. utf_cnt = 4;
  187. } else if ((c & 0xfeU) == 0xfcU) {
  188. utf_char = c & 0x01U;
  189. utf_cnt = 5;
  190. } else {
  191. goto error_out;
  192. }
  193. continue;
  194. } else {
  195. /* Single byte UTF-8 character (most common) */
  196. utf_char = c;
  197. }
  198. }
  199. /* Choose no compression if necessary */
  200. if (utf_char > max_val) {
  201. if (max_val == 0xffU) {
  202. max_val = 0xffffU;
  203. ocu[0] = (uint8_t)0x10U;
  204. goto try_again;
  205. }
  206. goto error_out;
  207. }
  208. if (max_val == 0xffffU)
  209. ocu[++u_len] = (uint8_t)(utf_char >> 8);
  210. ocu[++u_len] = (uint8_t)(utf_char & 0xffU);
  211. }
  212. if (utf_cnt) {
  213. error_out:
  214. ocu[++u_len] = '?';
  215. printk(KERN_DEBUG pr_fmt("bad UTF-8 character\n"));
  216. }
  217. ocu[length - 1] = (uint8_t)u_len + 1;
  218. return u_len + 1;
  219. }
  220. static int udf_CS0toNLS(struct nls_table *nls, struct ustr *utf_o,
  221. const struct ustr *ocu_i)
  222. {
  223. const uint8_t *ocu;
  224. uint8_t cmp_id, ocu_len;
  225. int i, len;
  226. ocu_len = ocu_i->u_len;
  227. if (ocu_len == 0) {
  228. memset(utf_o, 0, sizeof(struct ustr));
  229. return 0;
  230. }
  231. cmp_id = ocu_i->u_cmpID;
  232. if (cmp_id != 8 && cmp_id != 16) {
  233. memset(utf_o, 0, sizeof(struct ustr));
  234. pr_err("unknown compression code (%d) stri=%s\n",
  235. cmp_id, ocu_i->u_name);
  236. return -EINVAL;
  237. }
  238. ocu = ocu_i->u_name;
  239. utf_o->u_len = 0;
  240. for (i = 0; (i < ocu_len) && (utf_o->u_len <= (UDF_NAME_LEN - 3));) {
  241. /* Expand OSTA compressed Unicode to Unicode */
  242. uint32_t c = ocu[i++];
  243. if (cmp_id == 16)
  244. c = (c << 8) | ocu[i++];
  245. len = nls->uni2char(c, &utf_o->u_name[utf_o->u_len],
  246. UDF_NAME_LEN - utf_o->u_len);
  247. /* Valid character? */
  248. if (len >= 0)
  249. utf_o->u_len += len;
  250. else
  251. utf_o->u_name[utf_o->u_len++] = '?';
  252. }
  253. utf_o->u_cmpID = 8;
  254. return utf_o->u_len;
  255. }
  256. static int udf_NLStoCS0(struct nls_table *nls, dstring *ocu, struct ustr *uni,
  257. int length)
  258. {
  259. int len;
  260. unsigned i, max_val;
  261. uint16_t uni_char;
  262. int u_len;
  263. memset(ocu, 0, sizeof(dstring) * length);
  264. ocu[0] = 8;
  265. max_val = 0xffU;
  266. try_again:
  267. u_len = 0U;
  268. for (i = 0U; i < uni->u_len; i++) {
  269. len = nls->char2uni(&uni->u_name[i], uni->u_len - i, &uni_char);
  270. if (!len)
  271. continue;
  272. /* Invalid character, deal with it */
  273. if (len < 0) {
  274. len = 1;
  275. uni_char = '?';
  276. }
  277. if (uni_char > max_val) {
  278. max_val = 0xffffU;
  279. ocu[0] = (uint8_t)0x10U;
  280. goto try_again;
  281. }
  282. if (max_val == 0xffffU)
  283. ocu[++u_len] = (uint8_t)(uni_char >> 8);
  284. ocu[++u_len] = (uint8_t)(uni_char & 0xffU);
  285. i += len - 1;
  286. }
  287. ocu[length - 1] = (uint8_t)u_len + 1;
  288. return u_len + 1;
  289. }
  290. int udf_get_filename(struct super_block *sb, uint8_t *sname, int slen,
  291. uint8_t *dname, int dlen)
  292. {
  293. struct ustr *filename, *unifilename;
  294. int ret;
  295. if (!slen)
  296. return -EIO;
  297. filename = kmalloc(sizeof(struct ustr), GFP_NOFS);
  298. if (!filename)
  299. return -ENOMEM;
  300. unifilename = kmalloc(sizeof(struct ustr), GFP_NOFS);
  301. if (!unifilename) {
  302. ret = -ENOMEM;
  303. goto out1;
  304. }
  305. udf_build_ustr_exact(unifilename, sname, slen);
  306. if (UDF_QUERY_FLAG(sb, UDF_FLAG_UTF8)) {
  307. ret = udf_CS0toUTF8(filename, unifilename);
  308. if (ret < 0) {
  309. udf_debug("Failed in udf_get_filename: sname = %s\n",
  310. sname);
  311. goto out2;
  312. }
  313. } else if (UDF_QUERY_FLAG(sb, UDF_FLAG_NLS_MAP)) {
  314. ret = udf_CS0toNLS(UDF_SB(sb)->s_nls_map, filename,
  315. unifilename);
  316. if (ret < 0) {
  317. udf_debug("Failed in udf_get_filename: sname = %s\n",
  318. sname);
  319. goto out2;
  320. }
  321. } else
  322. BUG();
  323. ret = udf_translate_to_linux(dname, dlen,
  324. filename->u_name, filename->u_len,
  325. unifilename->u_name, unifilename->u_len);
  326. /* Zero length filename isn't valid... */
  327. if (ret == 0)
  328. ret = -EINVAL;
  329. out2:
  330. kfree(unifilename);
  331. out1:
  332. kfree(filename);
  333. return ret;
  334. }
  335. int udf_put_filename(struct super_block *sb, const uint8_t *sname,
  336. uint8_t *dname, int flen)
  337. {
  338. struct ustr unifilename;
  339. int namelen;
  340. if (!udf_char_to_ustr(&unifilename, sname, flen))
  341. return 0;
  342. if (UDF_QUERY_FLAG(sb, UDF_FLAG_UTF8)) {
  343. namelen = udf_UTF8toCS0(dname, &unifilename, UDF_NAME_LEN);
  344. if (!namelen)
  345. return 0;
  346. } else if (UDF_QUERY_FLAG(sb, UDF_FLAG_NLS_MAP)) {
  347. namelen = udf_NLStoCS0(UDF_SB(sb)->s_nls_map, dname,
  348. &unifilename, UDF_NAME_LEN);
  349. if (!namelen)
  350. return 0;
  351. } else
  352. return 0;
  353. return namelen;
  354. }
  355. #define ILLEGAL_CHAR_MARK '_'
  356. #define EXT_MARK '.'
  357. #define CRC_MARK '#'
  358. #define EXT_SIZE 5
  359. /* Number of chars we need to store generated CRC to make filename unique */
  360. #define CRC_LEN 5
  361. static int udf_translate_to_linux(uint8_t *newName, int newLen,
  362. uint8_t *udfName, int udfLen,
  363. uint8_t *fidName, int fidNameLen)
  364. {
  365. int index, newIndex = 0, needsCRC = 0;
  366. int extIndex = 0, newExtIndex = 0, hasExt = 0;
  367. unsigned short valueCRC;
  368. uint8_t curr;
  369. if (udfName[0] == '.' &&
  370. (udfLen == 1 || (udfLen == 2 && udfName[1] == '.'))) {
  371. needsCRC = 1;
  372. newIndex = udfLen;
  373. memcpy(newName, udfName, udfLen);
  374. } else {
  375. for (index = 0; index < udfLen; index++) {
  376. curr = udfName[index];
  377. if (curr == '/' || curr == 0) {
  378. needsCRC = 1;
  379. curr = ILLEGAL_CHAR_MARK;
  380. while (index + 1 < udfLen &&
  381. (udfName[index + 1] == '/' ||
  382. udfName[index + 1] == 0))
  383. index++;
  384. }
  385. if (curr == EXT_MARK &&
  386. (udfLen - index - 1) <= EXT_SIZE) {
  387. if (udfLen == index + 1)
  388. hasExt = 0;
  389. else {
  390. hasExt = 1;
  391. extIndex = index;
  392. newExtIndex = newIndex;
  393. }
  394. }
  395. if (newIndex < newLen)
  396. newName[newIndex++] = curr;
  397. else
  398. needsCRC = 1;
  399. }
  400. }
  401. if (needsCRC) {
  402. uint8_t ext[EXT_SIZE];
  403. int localExtIndex = 0;
  404. if (hasExt) {
  405. int maxFilenameLen;
  406. for (index = 0;
  407. index < EXT_SIZE && extIndex + index + 1 < udfLen;
  408. index++) {
  409. curr = udfName[extIndex + index + 1];
  410. if (curr == '/' || curr == 0) {
  411. needsCRC = 1;
  412. curr = ILLEGAL_CHAR_MARK;
  413. while (extIndex + index + 2 < udfLen &&
  414. (index + 1 < EXT_SIZE &&
  415. (udfName[extIndex + index + 2] == '/' ||
  416. udfName[extIndex + index + 2] == 0)))
  417. index++;
  418. }
  419. ext[localExtIndex++] = curr;
  420. }
  421. maxFilenameLen = newLen - CRC_LEN - localExtIndex;
  422. if (newIndex > maxFilenameLen)
  423. newIndex = maxFilenameLen;
  424. else
  425. newIndex = newExtIndex;
  426. } else if (newIndex > newLen - CRC_LEN)
  427. newIndex = newLen - CRC_LEN;
  428. newName[newIndex++] = CRC_MARK;
  429. valueCRC = crc_itu_t(0, fidName, fidNameLen);
  430. newName[newIndex++] = hex_asc_upper_hi(valueCRC >> 8);
  431. newName[newIndex++] = hex_asc_upper_lo(valueCRC >> 8);
  432. newName[newIndex++] = hex_asc_upper_hi(valueCRC);
  433. newName[newIndex++] = hex_asc_upper_lo(valueCRC);
  434. if (hasExt) {
  435. newName[newIndex++] = EXT_MARK;
  436. for (index = 0; index < localExtIndex; index++)
  437. newName[newIndex++] = ext[index];
  438. }
  439. }
  440. return newIndex;
  441. }