unicode.c 11 KB

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