unicode.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482
  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++] =
  118. (uint8_t) (0xc0 | (c >> 6));
  119. utf_o->u_name[utf_o->u_len++] =
  120. (uint8_t) (0x80 | (c & 0x3f));
  121. } else {
  122. utf_o->u_name[utf_o->u_len++] =
  123. (uint8_t) (0xe0 | (c >> 12));
  124. utf_o->u_name[utf_o->u_len++] =
  125. (uint8_t) (0x80 | ((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. continue;
  196. } else
  197. /* Single byte UTF-8 character (most common) */
  198. utf_char = c;
  199. }
  200. /* Choose no compression if necessary */
  201. if (utf_char > max_val) {
  202. if (0xffU == max_val) {
  203. max_val = 0xffffU;
  204. ocu[0] = (uint8_t) 0x10U;
  205. goto try_again;
  206. }
  207. goto error_out;
  208. }
  209. if (max_val == 0xffffU) {
  210. ocu[++u_len] = (uint8_t) (utf_char >> 8);
  211. }
  212. ocu[++u_len] = (uint8_t) (utf_char & 0xffU);
  213. }
  214. if (utf_cnt) {
  215. error_out:
  216. ocu[++u_len] = '?';
  217. printk(KERN_DEBUG "udf: bad UTF-8 character\n");
  218. }
  219. ocu[length - 1] = (uint8_t) u_len + 1;
  220. return u_len + 1;
  221. }
  222. static int udf_CS0toNLS(struct nls_table *nls, struct ustr *utf_o,
  223. struct ustr *ocu_i)
  224. {
  225. uint8_t *ocu;
  226. uint32_t c;
  227. uint8_t cmp_id, ocu_len;
  228. int i;
  229. ocu = ocu_i->u_name;
  230. ocu_len = ocu_i->u_len;
  231. cmp_id = ocu_i->u_cmpID;
  232. utf_o->u_len = 0;
  233. if (ocu_len == 0) {
  234. memset(utf_o, 0, sizeof(struct ustr));
  235. utf_o->u_cmpID = 0;
  236. utf_o->u_len = 0;
  237. return 0;
  238. }
  239. if ((cmp_id != 8) && (cmp_id != 16)) {
  240. printk(KERN_ERR "udf: unknown compression code (%d) stri=%s\n",
  241. cmp_id, ocu_i->u_name);
  242. return 0;
  243. }
  244. for (i = 0; (i < ocu_len) && (utf_o->u_len <= (UDF_NAME_LEN - 3));) {
  245. /* Expand OSTA compressed Unicode to Unicode */
  246. c = ocu[i++];
  247. if (cmp_id == 16)
  248. c = (c << 8) | ocu[i++];
  249. utf_o->u_len += nls->uni2char(c, &utf_o->u_name[utf_o->u_len],
  250. UDF_NAME_LEN - utf_o->u_len);
  251. }
  252. utf_o->u_cmpID = 8;
  253. return utf_o->u_len;
  254. }
  255. static int udf_NLStoCS0(struct nls_table *nls, dstring * ocu, struct ustr *uni,
  256. int length)
  257. {
  258. unsigned len, i, max_val;
  259. uint16_t uni_char;
  260. int u_len;
  261. memset(ocu, 0, sizeof(dstring) * length);
  262. ocu[0] = 8;
  263. max_val = 0xffU;
  264. try_again:
  265. u_len = 0U;
  266. for (i = 0U; i < uni->u_len; i++) {
  267. len = nls->char2uni(&uni->u_name[i], uni->u_len - i, &uni_char);
  268. if (len <= 0)
  269. continue;
  270. if (uni_char > max_val) {
  271. max_val = 0xffffU;
  272. ocu[0] = (uint8_t) 0x10U;
  273. goto try_again;
  274. }
  275. if (max_val == 0xffffU)
  276. ocu[++u_len] = (uint8_t) (uni_char >> 8);
  277. ocu[++u_len] = (uint8_t) (uni_char & 0xffU);
  278. i += len - 1;
  279. }
  280. ocu[length - 1] = (uint8_t) u_len + 1;
  281. return u_len + 1;
  282. }
  283. int udf_get_filename(struct super_block *sb, uint8_t * sname, uint8_t * dname,
  284. int flen)
  285. {
  286. struct ustr filename, unifilename;
  287. int len;
  288. if (udf_build_ustr_exact(&unifilename, sname, flen)) {
  289. return 0;
  290. }
  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
  299. (UDF_SB(sb)->s_nls_map, &filename, &unifilename)) {
  300. udf_debug("Failed in udf_get_filename: sname = %s\n",
  301. sname);
  302. return 0;
  303. }
  304. } else
  305. return 0;
  306. if ((len =
  307. udf_translate_to_linux(dname, filename.u_name, filename.u_len,
  308. unifilename.u_name, unifilename.u_len))) {
  309. return len;
  310. }
  311. return 0;
  312. }
  313. int udf_put_filename(struct super_block *sb, const uint8_t * sname,
  314. uint8_t * dname, int flen)
  315. {
  316. struct ustr unifilename;
  317. int namelen;
  318. if (!(udf_char_to_ustr(&unifilename, sname, flen))) {
  319. return 0;
  320. }
  321. if (UDF_QUERY_FLAG(sb, UDF_FLAG_UTF8)) {
  322. if (!
  323. (namelen =
  324. udf_UTF8toCS0(dname, &unifilename, UDF_NAME_LEN))) {
  325. return 0;
  326. }
  327. } else if (UDF_QUERY_FLAG(sb, UDF_FLAG_NLS_MAP)) {
  328. if (!
  329. (namelen =
  330. udf_NLStoCS0(UDF_SB(sb)->s_nls_map, dname, &unifilename,
  331. UDF_NAME_LEN))) {
  332. return 0;
  333. }
  334. } else
  335. return 0;
  336. return namelen;
  337. }
  338. #define ILLEGAL_CHAR_MARK '_'
  339. #define EXT_MARK '.'
  340. #define CRC_MARK '#'
  341. #define EXT_SIZE 5
  342. static int udf_translate_to_linux(uint8_t * newName, uint8_t * udfName,
  343. int udfLen, uint8_t * fidName, int fidNameLen)
  344. {
  345. int index, newIndex = 0, needsCRC = 0;
  346. int extIndex = 0, newExtIndex = 0, hasExt = 0;
  347. unsigned short valueCRC;
  348. uint8_t curr;
  349. const uint8_t hexChar[] = "0123456789ABCDEF";
  350. if (udfName[0] == '.' && (udfLen == 1 ||
  351. (udfLen == 2 && udfName[1] == '.'))) {
  352. needsCRC = 1;
  353. newIndex = udfLen;
  354. memcpy(newName, udfName, udfLen);
  355. } else {
  356. for (index = 0; index < udfLen; index++) {
  357. curr = udfName[index];
  358. if (curr == '/' || curr == 0) {
  359. needsCRC = 1;
  360. curr = ILLEGAL_CHAR_MARK;
  361. while (index + 1 < udfLen
  362. && (udfName[index + 1] == '/'
  363. || udfName[index + 1] == 0))
  364. index++;
  365. }
  366. if (curr == EXT_MARK
  367. && (udfLen - index - 1) <= EXT_SIZE) {
  368. if (udfLen == index + 1)
  369. hasExt = 0;
  370. else {
  371. hasExt = 1;
  372. extIndex = index;
  373. newExtIndex = newIndex;
  374. }
  375. }
  376. if (newIndex < 256)
  377. newName[newIndex++] = curr;
  378. else
  379. needsCRC = 1;
  380. }
  381. }
  382. if (needsCRC) {
  383. uint8_t ext[EXT_SIZE];
  384. int localExtIndex = 0;
  385. if (hasExt) {
  386. int maxFilenameLen;
  387. for (index = 0;
  388. index < EXT_SIZE && extIndex + index + 1 < udfLen;
  389. index++) {
  390. curr = udfName[extIndex + index + 1];
  391. if (curr == '/' || curr == 0) {
  392. needsCRC = 1;
  393. curr = ILLEGAL_CHAR_MARK;
  394. while (extIndex + index + 2 < udfLen
  395. && (index + 1 < EXT_SIZE
  396. &&
  397. (udfName
  398. [extIndex + index + 2] ==
  399. '/'
  400. || udfName[extIndex +
  401. index + 2] ==
  402. 0)))
  403. index++;
  404. }
  405. ext[localExtIndex++] = curr;
  406. }
  407. maxFilenameLen = 250 - localExtIndex;
  408. if (newIndex > maxFilenameLen)
  409. newIndex = maxFilenameLen;
  410. else
  411. newIndex = newExtIndex;
  412. } else if (newIndex > 250)
  413. newIndex = 250;
  414. newName[newIndex++] = CRC_MARK;
  415. valueCRC = udf_crc(fidName, fidNameLen, 0);
  416. newName[newIndex++] = hexChar[(valueCRC & 0xf000) >> 12];
  417. newName[newIndex++] = hexChar[(valueCRC & 0x0f00) >> 8];
  418. newName[newIndex++] = hexChar[(valueCRC & 0x00f0) >> 4];
  419. newName[newIndex++] = hexChar[(valueCRC & 0x000f)];
  420. if (hasExt) {
  421. newName[newIndex++] = EXT_MARK;
  422. for (index = 0; index < localExtIndex; index++)
  423. newName[newIndex++] = ext[index];
  424. }
  425. }
  426. return newIndex;
  427. }