cifs_unicode.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419
  1. /*
  2. * cifs_unicode: Unicode kernel case support
  3. *
  4. * Function:
  5. * Convert a unicode character to upper or lower case using
  6. * compressed tables.
  7. *
  8. * Copyright (c) International Business Machines Corp., 2000,2009
  9. *
  10. * This program is free software; you can redistribute it and/or modify
  11. * it under the terms of the GNU General Public License as published by
  12. * the Free Software Foundation; either version 2 of the License, or
  13. * (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
  18. * the GNU General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public License
  21. * along with this program; if not, write to the Free Software
  22. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  23. *
  24. *
  25. * Notes:
  26. * These APIs are based on the C library functions. The semantics
  27. * should match the C functions but with expanded size operands.
  28. *
  29. * The upper/lower functions are based on a table created by mkupr.
  30. * This is a compressed table of upper and lower case conversion.
  31. *
  32. */
  33. #ifndef _CIFS_UNICODE_H
  34. #define _CIFS_UNICODE_H
  35. #include <asm/byteorder.h>
  36. #include <linux/types.h>
  37. #include <linux/nls.h>
  38. #define UNIUPR_NOLOWER /* Example to not expand lower case tables */
  39. /*
  40. * Windows maps these to the user defined 16 bit Unicode range since they are
  41. * reserved symbols (along with \ and /), otherwise illegal to store
  42. * in filenames in NTFS
  43. */
  44. #define UNI_ASTERISK (__u16) ('*' + 0xF000)
  45. #define UNI_QUESTION (__u16) ('?' + 0xF000)
  46. #define UNI_COLON (__u16) (':' + 0xF000)
  47. #define UNI_GRTRTHAN (__u16) ('>' + 0xF000)
  48. #define UNI_LESSTHAN (__u16) ('<' + 0xF000)
  49. #define UNI_PIPE (__u16) ('|' + 0xF000)
  50. #define UNI_SLASH (__u16) ('\\' + 0xF000)
  51. /*
  52. * Macs use an older "SFM" mapping of the symbols above. Fortunately it does
  53. * not conflict (although almost does) with the mapping above.
  54. */
  55. #define SFM_DOUBLEQUOTE ((__u16) 0xF020)
  56. #define SFM_ASTERISK ((__u16) 0xF021)
  57. #define SFM_QUESTION ((__u16) 0xF025)
  58. #define SFM_COLON ((__u16) 0xF022)
  59. #define SFM_GRTRTHAN ((__u16) 0xF024)
  60. #define SFM_LESSTHAN ((__u16) 0xF023)
  61. #define SFM_PIPE ((__u16) 0xF027)
  62. #define SFM_SLASH ((__u16) 0xF026)
  63. #define SFM_SPACE ((__u16) 0xF028)
  64. #define SFM_PERIOD ((__u16) 0xF029)
  65. /*
  66. * Mapping mechanism to use when one of the seven reserved characters is
  67. * encountered. We can only map using one of the mechanisms at a time
  68. * since otherwise readdir could return directory entries which we would
  69. * not be able to open
  70. *
  71. * NO_MAP_UNI_RSVD = do not perform any remapping of the character
  72. * SFM_MAP_UNI_RSVD = map reserved characters using SFM scheme (MAC compatible)
  73. * SFU_MAP_UNI_RSVD = map reserved characters ala SFU ("mapchars" option)
  74. *
  75. */
  76. #define NO_MAP_UNI_RSVD 0
  77. #define SFM_MAP_UNI_RSVD 1
  78. #define SFU_MAP_UNI_RSVD 2
  79. /* Just define what we want from uniupr.h. We don't want to define the tables
  80. * in each source file.
  81. */
  82. #ifndef UNICASERANGE_DEFINED
  83. struct UniCaseRange {
  84. wchar_t start;
  85. wchar_t end;
  86. signed char *table;
  87. };
  88. #endif /* UNICASERANGE_DEFINED */
  89. #ifndef UNIUPR_NOUPPER
  90. extern signed char CifsUniUpperTable[512];
  91. extern const struct UniCaseRange CifsUniUpperRange[];
  92. #endif /* UNIUPR_NOUPPER */
  93. #ifndef UNIUPR_NOLOWER
  94. extern signed char CifsUniLowerTable[512];
  95. extern const struct UniCaseRange CifsUniLowerRange[];
  96. #endif /* UNIUPR_NOLOWER */
  97. #ifdef __KERNEL__
  98. int cifs_from_utf16(char *to, const __le16 *from, int tolen, int fromlen,
  99. const struct nls_table *cp, int map_type);
  100. int cifs_utf16_bytes(const __le16 *from, int maxbytes,
  101. const struct nls_table *codepage);
  102. int cifs_strtoUTF16(__le16 *, const char *, int, const struct nls_table *);
  103. char *cifs_strndup_from_utf16(const char *src, const int maxlen,
  104. const bool is_unicode,
  105. const struct nls_table *codepage);
  106. extern int cifsConvertToUTF16(__le16 *target, const char *source, int maxlen,
  107. const struct nls_table *cp, int mapChars);
  108. extern int cifs_remap(struct cifs_sb_info *cifs_sb);
  109. extern __le16 *cifs_strndup_to_utf16(const char *src, const int maxlen,
  110. int *utf16_len, const struct nls_table *cp,
  111. int remap);
  112. #endif
  113. wchar_t cifs_toupper(wchar_t in);
  114. /*
  115. * UniStrcat: Concatenate the second string to the first
  116. *
  117. * Returns:
  118. * Address of the first string
  119. */
  120. static inline __le16 *
  121. UniStrcat(__le16 *ucs1, const __le16 *ucs2)
  122. {
  123. __le16 *anchor = ucs1; /* save a pointer to start of ucs1 */
  124. while (*ucs1++) ; /* To end of first string */
  125. ucs1--; /* Return to the null */
  126. while ((*ucs1++ = *ucs2++)) ; /* copy string 2 over */
  127. return anchor;
  128. }
  129. /*
  130. * UniStrchr: Find a character in a string
  131. *
  132. * Returns:
  133. * Address of first occurrence of character in string
  134. * or NULL if the character is not in the string
  135. */
  136. static inline wchar_t *
  137. UniStrchr(const wchar_t *ucs, wchar_t uc)
  138. {
  139. while ((*ucs != uc) && *ucs)
  140. ucs++;
  141. if (*ucs == uc)
  142. return (wchar_t *) ucs;
  143. return NULL;
  144. }
  145. /*
  146. * UniStrcmp: Compare two strings
  147. *
  148. * Returns:
  149. * < 0: First string is less than second
  150. * = 0: Strings are equal
  151. * > 0: First string is greater than second
  152. */
  153. static inline int
  154. UniStrcmp(const wchar_t *ucs1, const wchar_t *ucs2)
  155. {
  156. while ((*ucs1 == *ucs2) && *ucs1) {
  157. ucs1++;
  158. ucs2++;
  159. }
  160. return (int) *ucs1 - (int) *ucs2;
  161. }
  162. /*
  163. * UniStrcpy: Copy a string
  164. */
  165. static inline wchar_t *
  166. UniStrcpy(wchar_t *ucs1, const wchar_t *ucs2)
  167. {
  168. wchar_t *anchor = ucs1; /* save the start of result string */
  169. while ((*ucs1++ = *ucs2++)) ;
  170. return anchor;
  171. }
  172. /*
  173. * UniStrlen: Return the length of a string (in 16 bit Unicode chars not bytes)
  174. */
  175. static inline size_t
  176. UniStrlen(const wchar_t *ucs1)
  177. {
  178. int i = 0;
  179. while (*ucs1++)
  180. i++;
  181. return i;
  182. }
  183. /*
  184. * UniStrnlen: Return the length (in 16 bit Unicode chars not bytes) of a
  185. * string (length limited)
  186. */
  187. static inline size_t
  188. UniStrnlen(const wchar_t *ucs1, int maxlen)
  189. {
  190. int i = 0;
  191. while (*ucs1++) {
  192. i++;
  193. if (i >= maxlen)
  194. break;
  195. }
  196. return i;
  197. }
  198. /*
  199. * UniStrncat: Concatenate length limited string
  200. */
  201. static inline wchar_t *
  202. UniStrncat(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  203. {
  204. wchar_t *anchor = ucs1; /* save pointer to string 1 */
  205. while (*ucs1++) ;
  206. ucs1--; /* point to null terminator of s1 */
  207. while (n-- && (*ucs1 = *ucs2)) { /* copy s2 after s1 */
  208. ucs1++;
  209. ucs2++;
  210. }
  211. *ucs1 = 0; /* Null terminate the result */
  212. return (anchor);
  213. }
  214. /*
  215. * UniStrncmp: Compare length limited string
  216. */
  217. static inline int
  218. UniStrncmp(const wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  219. {
  220. if (!n)
  221. return 0; /* Null strings are equal */
  222. while ((*ucs1 == *ucs2) && *ucs1 && --n) {
  223. ucs1++;
  224. ucs2++;
  225. }
  226. return (int) *ucs1 - (int) *ucs2;
  227. }
  228. /*
  229. * UniStrncmp_le: Compare length limited string - native to little-endian
  230. */
  231. static inline int
  232. UniStrncmp_le(const wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  233. {
  234. if (!n)
  235. return 0; /* Null strings are equal */
  236. while ((*ucs1 == __le16_to_cpu(*ucs2)) && *ucs1 && --n) {
  237. ucs1++;
  238. ucs2++;
  239. }
  240. return (int) *ucs1 - (int) __le16_to_cpu(*ucs2);
  241. }
  242. /*
  243. * UniStrncpy: Copy length limited string with pad
  244. */
  245. static inline wchar_t *
  246. UniStrncpy(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  247. {
  248. wchar_t *anchor = ucs1;
  249. while (n-- && *ucs2) /* Copy the strings */
  250. *ucs1++ = *ucs2++;
  251. n++;
  252. while (n--) /* Pad with nulls */
  253. *ucs1++ = 0;
  254. return anchor;
  255. }
  256. /*
  257. * UniStrncpy_le: Copy length limited string with pad to little-endian
  258. */
  259. static inline wchar_t *
  260. UniStrncpy_le(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  261. {
  262. wchar_t *anchor = ucs1;
  263. while (n-- && *ucs2) /* Copy the strings */
  264. *ucs1++ = __le16_to_cpu(*ucs2++);
  265. n++;
  266. while (n--) /* Pad with nulls */
  267. *ucs1++ = 0;
  268. return anchor;
  269. }
  270. /*
  271. * UniStrstr: Find a string in a string
  272. *
  273. * Returns:
  274. * Address of first match found
  275. * NULL if no matching string is found
  276. */
  277. static inline wchar_t *
  278. UniStrstr(const wchar_t *ucs1, const wchar_t *ucs2)
  279. {
  280. const wchar_t *anchor1 = ucs1;
  281. const wchar_t *anchor2 = ucs2;
  282. while (*ucs1) {
  283. if (*ucs1 == *ucs2) {
  284. /* Partial match found */
  285. ucs1++;
  286. ucs2++;
  287. } else {
  288. if (!*ucs2) /* Match found */
  289. return (wchar_t *) anchor1;
  290. ucs1 = ++anchor1; /* No match */
  291. ucs2 = anchor2;
  292. }
  293. }
  294. if (!*ucs2) /* Both end together */
  295. return (wchar_t *) anchor1; /* Match found */
  296. return NULL; /* No match */
  297. }
  298. #ifndef UNIUPR_NOUPPER
  299. /*
  300. * UniToupper: Convert a unicode character to upper case
  301. */
  302. static inline wchar_t
  303. UniToupper(register wchar_t uc)
  304. {
  305. register const struct UniCaseRange *rp;
  306. if (uc < sizeof(CifsUniUpperTable)) {
  307. /* Latin characters */
  308. return uc + CifsUniUpperTable[uc]; /* Use base tables */
  309. } else {
  310. rp = CifsUniUpperRange; /* Use range tables */
  311. while (rp->start) {
  312. if (uc < rp->start) /* Before start of range */
  313. return uc; /* Uppercase = input */
  314. if (uc <= rp->end) /* In range */
  315. return uc + rp->table[uc - rp->start];
  316. rp++; /* Try next range */
  317. }
  318. }
  319. return uc; /* Past last range */
  320. }
  321. /*
  322. * UniStrupr: Upper case a unicode string
  323. */
  324. static inline __le16 *
  325. UniStrupr(register __le16 *upin)
  326. {
  327. register __le16 *up;
  328. up = upin;
  329. while (*up) { /* For all characters */
  330. *up = cpu_to_le16(UniToupper(le16_to_cpu(*up)));
  331. up++;
  332. }
  333. return upin; /* Return input pointer */
  334. }
  335. #endif /* UNIUPR_NOUPPER */
  336. #ifndef UNIUPR_NOLOWER
  337. /*
  338. * UniTolower: Convert a unicode character to lower case
  339. */
  340. static inline wchar_t
  341. UniTolower(register wchar_t uc)
  342. {
  343. register const struct UniCaseRange *rp;
  344. if (uc < sizeof(CifsUniLowerTable)) {
  345. /* Latin characters */
  346. return uc + CifsUniLowerTable[uc]; /* Use base tables */
  347. } else {
  348. rp = CifsUniLowerRange; /* Use range tables */
  349. while (rp->start) {
  350. if (uc < rp->start) /* Before start of range */
  351. return uc; /* Uppercase = input */
  352. if (uc <= rp->end) /* In range */
  353. return uc + rp->table[uc - rp->start];
  354. rp++; /* Try next range */
  355. }
  356. }
  357. return uc; /* Past last range */
  358. }
  359. /*
  360. * UniStrlwr: Lower case a unicode string
  361. */
  362. static inline wchar_t *
  363. UniStrlwr(register wchar_t *upin)
  364. {
  365. register wchar_t *up;
  366. up = upin;
  367. while (*up) { /* For all characters */
  368. *up = UniTolower(*up);
  369. up++;
  370. }
  371. return upin; /* Return input pointer */
  372. }
  373. #endif
  374. #endif /* _CIFS_UNICODE_H */