unicode.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479
  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 "udf_sb.h"
  25. static int udf_translate_to_linux(uint8_t *, uint8_t *, int, uint8_t *, int);
  26. static int udf_char_to_ustr(struct ustr *dest, const uint8_t *src, int strlen)
  27. {
  28. if ((!dest) || (!src) || (!strlen) || (strlen > UDF_NAME_LEN - 2))
  29. return 0;
  30. memset(dest, 0, sizeof(struct ustr));
  31. memcpy(dest->u_name, src, strlen);
  32. dest->u_cmpID = 0x08;
  33. dest->u_len = strlen;
  34. return strlen;
  35. }
  36. /*
  37. * udf_build_ustr
  38. */
  39. int udf_build_ustr(struct ustr *dest, dstring *ptr, int size)
  40. {
  41. int usesize;
  42. if ((!dest) || (!ptr) || (!size))
  43. return -1;
  44. memset(dest, 0, sizeof(struct ustr));
  45. usesize = (size > UDF_NAME_LEN) ? UDF_NAME_LEN : size;
  46. dest->u_cmpID = ptr[0];
  47. dest->u_len = ptr[size - 1];
  48. memcpy(dest->u_name, ptr + 1, usesize - 1);
  49. return 0;
  50. }
  51. /*
  52. * udf_build_ustr_exact
  53. */
  54. static int udf_build_ustr_exact(struct ustr *dest, dstring *ptr, int exactsize)
  55. {
  56. if ((!dest) || (!ptr) || (!exactsize))
  57. return -1;
  58. memset(dest, 0, sizeof(struct ustr));
  59. dest->u_cmpID = ptr[0];
  60. dest->u_len = exactsize - 1;
  61. memcpy(dest->u_name, ptr + 1, exactsize - 1);
  62. return 0;
  63. }
  64. /*
  65. * udf_ocu_to_utf8
  66. *
  67. * PURPOSE
  68. * Convert OSTA Compressed Unicode to the UTF-8 equivalent.
  69. *
  70. * DESCRIPTION
  71. * This routine is only called by udf_filldir().
  72. *
  73. * PRE-CONDITIONS
  74. * utf Pointer to UTF-8 output buffer.
  75. * ocu Pointer to OSTA Compressed Unicode input buffer
  76. * of size UDF_NAME_LEN bytes.
  77. * both of type "struct ustr *"
  78. *
  79. * POST-CONDITIONS
  80. * <return> Zero on success.
  81. *
  82. * HISTORY
  83. * November 12, 1997 - Andrew E. Mileski
  84. * Written, tested, and released.
  85. */
  86. int udf_CS0toUTF8(struct ustr *utf_o, struct ustr *ocu_i)
  87. {
  88. uint8_t *ocu;
  89. uint32_t c;
  90. uint8_t cmp_id, ocu_len;
  91. int i;
  92. ocu = ocu_i->u_name;
  93. ocu_len = ocu_i->u_len;
  94. cmp_id = ocu_i->u_cmpID;
  95. utf_o->u_len = 0;
  96. if (ocu_len == 0) {
  97. memset(utf_o, 0, sizeof(struct ustr));
  98. utf_o->u_cmpID = 0;
  99. utf_o->u_len = 0;
  100. return 0;
  101. }
  102. if ((cmp_id != 8) && (cmp_id != 16)) {
  103. printk(KERN_ERR "udf: unknown compression code (%d) stri=%s\n",
  104. cmp_id, ocu_i->u_name);
  105. return 0;
  106. }
  107. for (i = 0; (i < ocu_len) && (utf_o->u_len <= (UDF_NAME_LEN - 3));) {
  108. /* Expand OSTA compressed Unicode to Unicode */
  109. c = ocu[i++];
  110. if (cmp_id == 16)
  111. c = (c << 8) | ocu[i++];
  112. /* Compress Unicode to UTF-8 */
  113. if (c < 0x80U) {
  114. utf_o->u_name[utf_o->u_len++] = (uint8_t)c;
  115. } else if (c < 0x800U) {
  116. utf_o->u_name[utf_o->u_len++] =
  117. (uint8_t)(0xc0 | (c >> 6));
  118. utf_o->u_name[utf_o->u_len++] =
  119. (uint8_t)(0x80 | (c & 0x3f));
  120. } else {
  121. utf_o->u_name[utf_o->u_len++] =
  122. (uint8_t)(0xe0 | (c >> 12));
  123. utf_o->u_name[utf_o->u_len++] =
  124. (uint8_t)(0x80 |
  125. ((c >> 6) & 0x3f));
  126. utf_o->u_name[utf_o->u_len++] =
  127. (uint8_t)(0x80 | (c & 0x3f));
  128. }
  129. }
  130. utf_o->u_cmpID = 8;
  131. return utf_o->u_len;
  132. }
  133. /*
  134. *
  135. * udf_utf8_to_ocu
  136. *
  137. * PURPOSE
  138. * Convert UTF-8 to the OSTA Compressed Unicode equivalent.
  139. *
  140. * DESCRIPTION
  141. * This routine is only called by udf_lookup().
  142. *
  143. * PRE-CONDITIONS
  144. * ocu Pointer to OSTA Compressed Unicode output
  145. * buffer of size UDF_NAME_LEN bytes.
  146. * utf Pointer to UTF-8 input buffer.
  147. * utf_len Length of UTF-8 input buffer in bytes.
  148. *
  149. * POST-CONDITIONS
  150. * <return> Zero on success.
  151. *
  152. * HISTORY
  153. * November 12, 1997 - Andrew E. Mileski
  154. * Written, tested, and released.
  155. */
  156. static int udf_UTF8toCS0(dstring *ocu, struct ustr *utf, int length)
  157. {
  158. unsigned c, i, max_val, utf_char;
  159. int utf_cnt, u_len;
  160. memset(ocu, 0, sizeof(dstring) * length);
  161. ocu[0] = 8;
  162. max_val = 0xffU;
  163. try_again:
  164. u_len = 0U;
  165. utf_char = 0U;
  166. utf_cnt = 0U;
  167. for (i = 0U; i < utf->u_len; i++) {
  168. c = (uint8_t)utf->u_name[i];
  169. /* Complete a multi-byte UTF-8 character */
  170. if (utf_cnt) {
  171. utf_char = (utf_char << 6) | (c & 0x3fU);
  172. if (--utf_cnt)
  173. continue;
  174. } else {
  175. /* Check for a multi-byte UTF-8 character */
  176. if (c & 0x80U) {
  177. /* Start a multi-byte UTF-8 character */
  178. if ((c & 0xe0U) == 0xc0U) {
  179. utf_char = c & 0x1fU;
  180. utf_cnt = 1;
  181. } else if ((c & 0xf0U) == 0xe0U) {
  182. utf_char = c & 0x0fU;
  183. utf_cnt = 2;
  184. } else if ((c & 0xf8U) == 0xf0U) {
  185. utf_char = c & 0x07U;
  186. utf_cnt = 3;
  187. } else if ((c & 0xfcU) == 0xf8U) {
  188. utf_char = c & 0x03U;
  189. utf_cnt = 4;
  190. } else if ((c & 0xfeU) == 0xfcU) {
  191. utf_char = c & 0x01U;
  192. utf_cnt = 5;
  193. } else {
  194. goto error_out;
  195. }
  196. continue;
  197. } else {
  198. /* Single byte UTF-8 character (most common) */
  199. utf_char = c;
  200. }
  201. }
  202. /* Choose no compression if necessary */
  203. if (utf_char > max_val) {
  204. if (max_val == 0xffU) {
  205. max_val = 0xffffU;
  206. ocu[0] = (uint8_t)0x10U;
  207. goto try_again;
  208. }
  209. goto error_out;
  210. }
  211. if (max_val == 0xffffU)
  212. ocu[++u_len] = (uint8_t)(utf_char >> 8);
  213. ocu[++u_len] = (uint8_t)(utf_char & 0xffU);
  214. }
  215. if (utf_cnt) {
  216. error_out:
  217. ocu[++u_len] = '?';
  218. printk(KERN_DEBUG "udf: bad UTF-8 character\n");
  219. }
  220. ocu[length - 1] = (uint8_t)u_len + 1;
  221. return u_len + 1;
  222. }
  223. static int udf_CS0toNLS(struct nls_table *nls, struct ustr *utf_o,
  224. struct ustr *ocu_i)
  225. {
  226. uint8_t *ocu;
  227. uint32_t c;
  228. uint8_t cmp_id, ocu_len;
  229. int i;
  230. ocu = ocu_i->u_name;
  231. ocu_len = ocu_i->u_len;
  232. cmp_id = ocu_i->u_cmpID;
  233. utf_o->u_len = 0;
  234. if (ocu_len == 0) {
  235. memset(utf_o, 0, sizeof(struct ustr));
  236. utf_o->u_cmpID = 0;
  237. utf_o->u_len = 0;
  238. return 0;
  239. }
  240. if ((cmp_id != 8) && (cmp_id != 16)) {
  241. printk(KERN_ERR "udf: unknown compression code (%d) stri=%s\n",
  242. cmp_id, ocu_i->u_name);
  243. return 0;
  244. }
  245. for (i = 0; (i < ocu_len) && (utf_o->u_len <= (UDF_NAME_LEN - 3));) {
  246. /* Expand OSTA compressed Unicode to Unicode */
  247. c = ocu[i++];
  248. if (cmp_id == 16)
  249. c = (c << 8) | ocu[i++];
  250. utf_o->u_len += nls->uni2char(c, &utf_o->u_name[utf_o->u_len],
  251. UDF_NAME_LEN - 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. unsigned len, i, max_val;
  260. uint16_t uni_char;
  261. int u_len;
  262. memset(ocu, 0, sizeof(dstring) * length);
  263. ocu[0] = 8;
  264. max_val = 0xffU;
  265. try_again:
  266. u_len = 0U;
  267. for (i = 0U; i < uni->u_len; i++) {
  268. len = nls->char2uni(&uni->u_name[i], uni->u_len - i, &uni_char);
  269. if (len <= 0)
  270. continue;
  271. if (uni_char > max_val) {
  272. max_val = 0xffffU;
  273. ocu[0] = (uint8_t)0x10U;
  274. goto try_again;
  275. }
  276. if (max_val == 0xffffU)
  277. ocu[++u_len] = (uint8_t)(uni_char >> 8);
  278. ocu[++u_len] = (uint8_t)(uni_char & 0xffU);
  279. i += len - 1;
  280. }
  281. ocu[length - 1] = (uint8_t)u_len + 1;
  282. return u_len + 1;
  283. }
  284. int udf_get_filename(struct super_block *sb, uint8_t *sname, uint8_t *dname,
  285. int flen)
  286. {
  287. struct ustr filename, unifilename;
  288. int len;
  289. if (udf_build_ustr_exact(&unifilename, sname, flen))
  290. return 0;
  291. if (UDF_QUERY_FLAG(sb, UDF_FLAG_UTF8)) {
  292. if (!udf_CS0toUTF8(&filename, &unifilename)) {
  293. udf_debug("Failed in udf_get_filename: sname = %s\n",
  294. sname);
  295. return 0;
  296. }
  297. } else if (UDF_QUERY_FLAG(sb, UDF_FLAG_NLS_MAP)) {
  298. if (!udf_CS0toNLS(UDF_SB(sb)->s_nls_map, &filename,
  299. &unifilename)) {
  300. udf_debug("Failed in udf_get_filename: sname = %s\n",
  301. sname);
  302. return 0;
  303. }
  304. } else
  305. return 0;
  306. len = udf_translate_to_linux(dname, filename.u_name, filename.u_len,
  307. unifilename.u_name, unifilename.u_len);
  308. if (len)
  309. return len;
  310. return 0;
  311. }
  312. int udf_put_filename(struct super_block *sb, const uint8_t *sname,
  313. uint8_t *dname, int flen)
  314. {
  315. struct ustr unifilename;
  316. int namelen;
  317. if (!udf_char_to_ustr(&unifilename, sname, flen))
  318. return 0;
  319. if (UDF_QUERY_FLAG(sb, UDF_FLAG_UTF8)) {
  320. namelen = udf_UTF8toCS0(dname, &unifilename, UDF_NAME_LEN);
  321. if (!namelen)
  322. return 0;
  323. } else if (UDF_QUERY_FLAG(sb, UDF_FLAG_NLS_MAP)) {
  324. namelen = udf_NLStoCS0(UDF_SB(sb)->s_nls_map, dname,
  325. &unifilename, UDF_NAME_LEN);
  326. if (!namelen)
  327. return 0;
  328. } else
  329. return 0;
  330. return namelen;
  331. }
  332. #define ILLEGAL_CHAR_MARK '_'
  333. #define EXT_MARK '.'
  334. #define CRC_MARK '#'
  335. #define EXT_SIZE 5
  336. static int udf_translate_to_linux(uint8_t *newName, uint8_t *udfName,
  337. int udfLen, uint8_t *fidName,
  338. int fidNameLen)
  339. {
  340. int index, newIndex = 0, needsCRC = 0;
  341. int extIndex = 0, newExtIndex = 0, hasExt = 0;
  342. unsigned short valueCRC;
  343. uint8_t curr;
  344. const uint8_t hexChar[] = "0123456789ABCDEF";
  345. if (udfName[0] == '.' &&
  346. (udfLen == 1 || (udfLen == 2 && udfName[1] == '.'))) {
  347. needsCRC = 1;
  348. newIndex = udfLen;
  349. memcpy(newName, udfName, udfLen);
  350. } else {
  351. for (index = 0; index < udfLen; index++) {
  352. curr = udfName[index];
  353. if (curr == '/' || curr == 0) {
  354. needsCRC = 1;
  355. curr = ILLEGAL_CHAR_MARK;
  356. while (index + 1 < udfLen &&
  357. (udfName[index + 1] == '/' ||
  358. udfName[index + 1] == 0))
  359. index++;
  360. }
  361. if (curr == EXT_MARK &&
  362. (udfLen - index - 1) <= EXT_SIZE) {
  363. if (udfLen == index + 1)
  364. hasExt = 0;
  365. else {
  366. hasExt = 1;
  367. extIndex = index;
  368. newExtIndex = newIndex;
  369. }
  370. }
  371. if (newIndex < 256)
  372. newName[newIndex++] = curr;
  373. else
  374. needsCRC = 1;
  375. }
  376. }
  377. if (needsCRC) {
  378. uint8_t ext[EXT_SIZE];
  379. int localExtIndex = 0;
  380. if (hasExt) {
  381. int maxFilenameLen;
  382. for (index = 0;
  383. index < EXT_SIZE && extIndex + index + 1 < udfLen;
  384. index++) {
  385. curr = udfName[extIndex + index + 1];
  386. if (curr == '/' || curr == 0) {
  387. needsCRC = 1;
  388. curr = ILLEGAL_CHAR_MARK;
  389. while (extIndex + index + 2 < udfLen &&
  390. (index + 1 < EXT_SIZE &&
  391. (udfName[extIndex + index + 2] == '/' ||
  392. udfName[extIndex + index + 2] == 0)))
  393. index++;
  394. }
  395. ext[localExtIndex++] = curr;
  396. }
  397. maxFilenameLen = 250 - localExtIndex;
  398. if (newIndex > maxFilenameLen)
  399. newIndex = maxFilenameLen;
  400. else
  401. newIndex = newExtIndex;
  402. } else if (newIndex > 250)
  403. newIndex = 250;
  404. newName[newIndex++] = CRC_MARK;
  405. valueCRC = udf_crc(fidName, fidNameLen, 0);
  406. newName[newIndex++] = hexChar[(valueCRC & 0xf000) >> 12];
  407. newName[newIndex++] = hexChar[(valueCRC & 0x0f00) >> 8];
  408. newName[newIndex++] = hexChar[(valueCRC & 0x00f0) >> 4];
  409. newName[newIndex++] = hexChar[(valueCRC & 0x000f)];
  410. if (hasExt) {
  411. newName[newIndex++] = EXT_MARK;
  412. for (index = 0; index < localExtIndex; index++)
  413. newName[newIndex++] = ext[index];
  414. }
  415. }
  416. return newIndex;
  417. }