cifs_unicode.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420
  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_ASTERISK ((__u16) 0xF021)
  56. #define SFM_QUESTION ((__u16) 0xF025)
  57. #define SFM_COLON ((__u16) 0xF022)
  58. #define SFM_GRTRTHAN ((__u16) 0xF024)
  59. #define SFM_LESSTHAN ((__u16) 0xF023)
  60. #define SFM_PIPE ((__u16) 0xF027)
  61. #define SFM_SLASH ((__u16) 0xF026)
  62. #define SFM_PERIOD ((__u16) 0xF028)
  63. #define SFM_SPACE ((__u16) 0xF029)
  64. /*
  65. * Mapping mechanism to use when one of the seven reserved characters is
  66. * encountered. We can only map using one of the mechanisms at a time
  67. * since otherwise readdir could return directory entries which we would
  68. * not be able to open
  69. *
  70. * NO_MAP_UNI_RSVD = do not perform any remapping of the character
  71. * SFM_MAP_UNI_RSVD = map reserved characters using SFM scheme (MAC compatible)
  72. * SFU_MAP_UNI_RSVD = map reserved characters ala SFU ("mapchars" option)
  73. *
  74. */
  75. #define NO_MAP_UNI_RSVD 0
  76. #define SFM_MAP_UNI_RSVD 1
  77. #define SFU_MAP_UNI_RSVD 2
  78. /* Just define what we want from uniupr.h. We don't want to define the tables
  79. * in each source file.
  80. */
  81. #ifndef UNICASERANGE_DEFINED
  82. struct UniCaseRange {
  83. wchar_t start;
  84. wchar_t end;
  85. signed char *table;
  86. };
  87. #endif /* UNICASERANGE_DEFINED */
  88. #ifndef UNIUPR_NOUPPER
  89. extern signed char CifsUniUpperTable[512];
  90. extern const struct UniCaseRange CifsUniUpperRange[];
  91. #endif /* UNIUPR_NOUPPER */
  92. #ifndef UNIUPR_NOLOWER
  93. extern signed char CifsUniLowerTable[512];
  94. extern const struct UniCaseRange CifsUniLowerRange[];
  95. #endif /* UNIUPR_NOLOWER */
  96. #ifdef __KERNEL__
  97. int cifs_from_utf16(char *to, const __le16 *from, int tolen, int fromlen,
  98. const struct nls_table *cp, int map_type);
  99. int cifs_utf16_bytes(const __le16 *from, int maxbytes,
  100. const struct nls_table *codepage);
  101. int cifs_strtoUTF16(__le16 *, const char *, int, const struct nls_table *);
  102. char *cifs_strndup_from_utf16(const char *src, const int maxlen,
  103. const bool is_unicode,
  104. const struct nls_table *codepage);
  105. extern int cifsConvertToUTF16(__le16 *target, const char *source, int maxlen,
  106. const struct nls_table *cp, int mapChars);
  107. extern int cifs_remap(struct cifs_sb_info *cifs_sb);
  108. #ifdef CONFIG_CIFS_SMB2
  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 /* CONFIG_CIFS_SMB2 */
  113. #endif
  114. wchar_t cifs_toupper(wchar_t in);
  115. /*
  116. * UniStrcat: Concatenate the second string to the first
  117. *
  118. * Returns:
  119. * Address of the first string
  120. */
  121. static inline wchar_t *
  122. UniStrcat(wchar_t *ucs1, const wchar_t *ucs2)
  123. {
  124. wchar_t *anchor = ucs1; /* save a pointer to start of ucs1 */
  125. while (*ucs1++) ; /* To end of first string */
  126. ucs1--; /* Return to the null */
  127. while ((*ucs1++ = *ucs2++)) ; /* copy string 2 over */
  128. return anchor;
  129. }
  130. /*
  131. * UniStrchr: Find a character in a string
  132. *
  133. * Returns:
  134. * Address of first occurrence of character in string
  135. * or NULL if the character is not in the string
  136. */
  137. static inline wchar_t *
  138. UniStrchr(const wchar_t *ucs, wchar_t uc)
  139. {
  140. while ((*ucs != uc) && *ucs)
  141. ucs++;
  142. if (*ucs == uc)
  143. return (wchar_t *) ucs;
  144. return NULL;
  145. }
  146. /*
  147. * UniStrcmp: Compare two strings
  148. *
  149. * Returns:
  150. * < 0: First string is less than second
  151. * = 0: Strings are equal
  152. * > 0: First string is greater than second
  153. */
  154. static inline int
  155. UniStrcmp(const wchar_t *ucs1, const wchar_t *ucs2)
  156. {
  157. while ((*ucs1 == *ucs2) && *ucs1) {
  158. ucs1++;
  159. ucs2++;
  160. }
  161. return (int) *ucs1 - (int) *ucs2;
  162. }
  163. /*
  164. * UniStrcpy: Copy a string
  165. */
  166. static inline wchar_t *
  167. UniStrcpy(wchar_t *ucs1, const wchar_t *ucs2)
  168. {
  169. wchar_t *anchor = ucs1; /* save the start of result string */
  170. while ((*ucs1++ = *ucs2++)) ;
  171. return anchor;
  172. }
  173. /*
  174. * UniStrlen: Return the length of a string (in 16 bit Unicode chars not bytes)
  175. */
  176. static inline size_t
  177. UniStrlen(const wchar_t *ucs1)
  178. {
  179. int i = 0;
  180. while (*ucs1++)
  181. i++;
  182. return i;
  183. }
  184. /*
  185. * UniStrnlen: Return the length (in 16 bit Unicode chars not bytes) of a
  186. * string (length limited)
  187. */
  188. static inline size_t
  189. UniStrnlen(const wchar_t *ucs1, int maxlen)
  190. {
  191. int i = 0;
  192. while (*ucs1++) {
  193. i++;
  194. if (i >= maxlen)
  195. break;
  196. }
  197. return i;
  198. }
  199. /*
  200. * UniStrncat: Concatenate length limited string
  201. */
  202. static inline wchar_t *
  203. UniStrncat(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  204. {
  205. wchar_t *anchor = ucs1; /* save pointer to string 1 */
  206. while (*ucs1++) ;
  207. ucs1--; /* point to null terminator of s1 */
  208. while (n-- && (*ucs1 = *ucs2)) { /* copy s2 after s1 */
  209. ucs1++;
  210. ucs2++;
  211. }
  212. *ucs1 = 0; /* Null terminate the result */
  213. return (anchor);
  214. }
  215. /*
  216. * UniStrncmp: Compare length limited string
  217. */
  218. static inline int
  219. UniStrncmp(const wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  220. {
  221. if (!n)
  222. return 0; /* Null strings are equal */
  223. while ((*ucs1 == *ucs2) && *ucs1 && --n) {
  224. ucs1++;
  225. ucs2++;
  226. }
  227. return (int) *ucs1 - (int) *ucs2;
  228. }
  229. /*
  230. * UniStrncmp_le: Compare length limited string - native to little-endian
  231. */
  232. static inline int
  233. UniStrncmp_le(const wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  234. {
  235. if (!n)
  236. return 0; /* Null strings are equal */
  237. while ((*ucs1 == __le16_to_cpu(*ucs2)) && *ucs1 && --n) {
  238. ucs1++;
  239. ucs2++;
  240. }
  241. return (int) *ucs1 - (int) __le16_to_cpu(*ucs2);
  242. }
  243. /*
  244. * UniStrncpy: Copy length limited string with pad
  245. */
  246. static inline wchar_t *
  247. UniStrncpy(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  248. {
  249. wchar_t *anchor = ucs1;
  250. while (n-- && *ucs2) /* Copy the strings */
  251. *ucs1++ = *ucs2++;
  252. n++;
  253. while (n--) /* Pad with nulls */
  254. *ucs1++ = 0;
  255. return anchor;
  256. }
  257. /*
  258. * UniStrncpy_le: Copy length limited string with pad to little-endian
  259. */
  260. static inline wchar_t *
  261. UniStrncpy_le(wchar_t *ucs1, const wchar_t *ucs2, size_t n)
  262. {
  263. wchar_t *anchor = ucs1;
  264. while (n-- && *ucs2) /* Copy the strings */
  265. *ucs1++ = __le16_to_cpu(*ucs2++);
  266. n++;
  267. while (n--) /* Pad with nulls */
  268. *ucs1++ = 0;
  269. return anchor;
  270. }
  271. /*
  272. * UniStrstr: Find a string in a string
  273. *
  274. * Returns:
  275. * Address of first match found
  276. * NULL if no matching string is found
  277. */
  278. static inline wchar_t *
  279. UniStrstr(const wchar_t *ucs1, const wchar_t *ucs2)
  280. {
  281. const wchar_t *anchor1 = ucs1;
  282. const wchar_t *anchor2 = ucs2;
  283. while (*ucs1) {
  284. if (*ucs1 == *ucs2) {
  285. /* Partial match found */
  286. ucs1++;
  287. ucs2++;
  288. } else {
  289. if (!*ucs2) /* Match found */
  290. return (wchar_t *) anchor1;
  291. ucs1 = ++anchor1; /* No match */
  292. ucs2 = anchor2;
  293. }
  294. }
  295. if (!*ucs2) /* Both end together */
  296. return (wchar_t *) anchor1; /* Match found */
  297. return NULL; /* No match */
  298. }
  299. #ifndef UNIUPR_NOUPPER
  300. /*
  301. * UniToupper: Convert a unicode character to upper case
  302. */
  303. static inline wchar_t
  304. UniToupper(register wchar_t uc)
  305. {
  306. register const struct UniCaseRange *rp;
  307. if (uc < sizeof(CifsUniUpperTable)) {
  308. /* Latin characters */
  309. return uc + CifsUniUpperTable[uc]; /* Use base tables */
  310. } else {
  311. rp = CifsUniUpperRange; /* Use range tables */
  312. while (rp->start) {
  313. if (uc < rp->start) /* Before start of range */
  314. return uc; /* Uppercase = input */
  315. if (uc <= rp->end) /* In range */
  316. return uc + rp->table[uc - rp->start];
  317. rp++; /* Try next range */
  318. }
  319. }
  320. return uc; /* Past last range */
  321. }
  322. /*
  323. * UniStrupr: Upper case a unicode string
  324. */
  325. static inline __le16 *
  326. UniStrupr(register __le16 *upin)
  327. {
  328. register __le16 *up;
  329. up = upin;
  330. while (*up) { /* For all characters */
  331. *up = cpu_to_le16(UniToupper(le16_to_cpu(*up)));
  332. up++;
  333. }
  334. return upin; /* Return input pointer */
  335. }
  336. #endif /* UNIUPR_NOUPPER */
  337. #ifndef UNIUPR_NOLOWER
  338. /*
  339. * UniTolower: Convert a unicode character to lower case
  340. */
  341. static inline wchar_t
  342. UniTolower(register wchar_t uc)
  343. {
  344. register const struct UniCaseRange *rp;
  345. if (uc < sizeof(CifsUniLowerTable)) {
  346. /* Latin characters */
  347. return uc + CifsUniLowerTable[uc]; /* Use base tables */
  348. } else {
  349. rp = CifsUniLowerRange; /* Use range tables */
  350. while (rp->start) {
  351. if (uc < rp->start) /* Before start of range */
  352. return uc; /* Uppercase = input */
  353. if (uc <= rp->end) /* In range */
  354. return uc + rp->table[uc - rp->start];
  355. rp++; /* Try next range */
  356. }
  357. }
  358. return uc; /* Past last range */
  359. }
  360. /*
  361. * UniStrlwr: Lower case a unicode string
  362. */
  363. static inline wchar_t *
  364. UniStrlwr(register wchar_t *upin)
  365. {
  366. register wchar_t *up;
  367. up = upin;
  368. while (*up) { /* For all characters */
  369. *up = UniTolower(*up);
  370. up++;
  371. }
  372. return upin; /* Return input pointer */
  373. }
  374. #endif
  375. #endif /* _CIFS_UNICODE_H */