cp1255.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380
  1. /*
  2. * Copyright (C) 1999-2001, 2004 Free Software Foundation, Inc.
  3. * This file is part of the GNU LIBICONV Library.
  4. *
  5. * The GNU LIBICONV Library is free software; you can redistribute it
  6. * and/or modify it under the terms of the GNU Library General Public
  7. * License as published by the Free Software Foundation; either version 2
  8. * of the License, or (at your option) any later version.
  9. *
  10. * The GNU LIBICONV Library is distributed in the hope that it will be
  11. * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Library General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Library General Public
  16. * License along with the GNU LIBICONV Library; see the file COPYING.LIB.
  17. * If not, write to the Free Software Foundation, Inc., 51 Franklin Street,
  18. * Fifth Floor, Boston, MA 02110-1301, USA.
  19. */
  20. /*
  21. * CP1255
  22. */
  23. #include "flushwc.h"
  24. /* Combining characters used in Hebrew encoding CP1255. */
  25. /* Relevant combining characters:
  26. 0x05b4, 0x05b7, 0x05b8, 0x05b9, 0x05bc, 0x05bf, 0x05c1, 0x05c2. */
  27. /* Composition tables for each of the relevant combining characters. */
  28. static const struct { unsigned short base; unsigned short composed; } cp1255_comp_table_data[] = {
  29. #define cp1255_comp_table05b4_idx 0
  30. #define cp1255_comp_table05b4_len 1
  31. { 0x05D9, 0xFB1D },
  32. #define cp1255_comp_table05b7_idx (cp1255_comp_table05b4_idx+cp1255_comp_table05b4_len)
  33. #define cp1255_comp_table05b7_len 2
  34. { 0x05D0, 0xFB2E },
  35. { 0x05F2, 0xFB1F },
  36. #define cp1255_comp_table05b8_idx (cp1255_comp_table05b7_idx+cp1255_comp_table05b7_len)
  37. #define cp1255_comp_table05b8_len 1
  38. { 0x05D0, 0xFB2F },
  39. #define cp1255_comp_table05b9_idx (cp1255_comp_table05b8_idx+cp1255_comp_table05b8_len)
  40. #define cp1255_comp_table05b9_len 1
  41. { 0x05D5, 0xFB4B },
  42. #define cp1255_comp_table05bc_idx (cp1255_comp_table05b9_idx+cp1255_comp_table05b9_len)
  43. #define cp1255_comp_table05bc_len 24
  44. { 0x05D0, 0xFB30 },
  45. { 0x05D1, 0xFB31 },
  46. { 0x05D2, 0xFB32 },
  47. { 0x05D3, 0xFB33 },
  48. { 0x05D4, 0xFB34 },
  49. { 0x05D5, 0xFB35 },
  50. { 0x05D6, 0xFB36 },
  51. { 0x05D8, 0xFB38 },
  52. { 0x05D9, 0xFB39 },
  53. { 0x05DA, 0xFB3A },
  54. { 0x05DB, 0xFB3B },
  55. { 0x05DC, 0xFB3C },
  56. { 0x05DE, 0xFB3E },
  57. { 0x05E0, 0xFB40 },
  58. { 0x05E1, 0xFB41 },
  59. { 0x05E3, 0xFB43 },
  60. { 0x05E4, 0xFB44 },
  61. { 0x05E6, 0xFB46 },
  62. { 0x05E7, 0xFB47 },
  63. { 0x05E8, 0xFB48 },
  64. { 0x05E9, 0xFB49 },
  65. { 0x05EA, 0xFB4A },
  66. { 0xFB2A, 0xFB2C },
  67. { 0xFB2B, 0xFB2D },
  68. #define cp1255_comp_table05bf_idx (cp1255_comp_table05bc_idx+cp1255_comp_table05bc_len)
  69. #define cp1255_comp_table05bf_len 3
  70. { 0x05D1, 0xFB4C },
  71. { 0x05DB, 0xFB4D },
  72. { 0x05E4, 0xFB4E },
  73. #define cp1255_comp_table05c1_idx (cp1255_comp_table05bf_idx+cp1255_comp_table05bf_len)
  74. #define cp1255_comp_table05c1_len 2
  75. { 0x05E9, 0xFB2A },
  76. { 0xFB49, 0xFB2C },
  77. #define cp1255_comp_table05c2_idx (cp1255_comp_table05c1_idx+cp1255_comp_table05c1_len)
  78. #define cp1255_comp_table05c2_len 2
  79. { 0x05E9, 0xFB2B },
  80. { 0xFB49, 0xFB2D },
  81. };
  82. static const struct { unsigned int len; unsigned int idx; } cp1255_comp_table[] = {
  83. { cp1255_comp_table05b4_len, cp1255_comp_table05b4_idx },
  84. { cp1255_comp_table05b7_len, cp1255_comp_table05b7_idx },
  85. { cp1255_comp_table05b8_len, cp1255_comp_table05b8_idx },
  86. { cp1255_comp_table05b9_len, cp1255_comp_table05b9_idx },
  87. { cp1255_comp_table05bc_len, cp1255_comp_table05bc_idx },
  88. { cp1255_comp_table05bf_len, cp1255_comp_table05bf_idx },
  89. { cp1255_comp_table05c1_len, cp1255_comp_table05c1_idx },
  90. { cp1255_comp_table05c2_len, cp1255_comp_table05c2_idx },
  91. };
  92. /* Decomposition table for the relevant Unicode characters. */
  93. struct cp1255_decomp { unsigned short composed; unsigned short base; int comb1 : 8; signed int comb2 : 8; };
  94. static const struct cp1255_decomp cp1255_decomp_table[] = {
  95. { 0xFB1D, 0x05D9, 0, -1 },
  96. { 0xFB1F, 0x05F2, 1, -1 },
  97. { 0xFB2A, 0x05E9, 6, -1 },
  98. { 0xFB2B, 0x05E9, 7, -1 },
  99. { 0xFB2C, 0x05E9, 4, 6 },
  100. { 0xFB2D, 0x05E9, 4, 7 },
  101. { 0xFB2E, 0x05D0, 1, -1 },
  102. { 0xFB2F, 0x05D0, 2, -1 },
  103. { 0xFB30, 0x05D0, 4, -1 },
  104. { 0xFB31, 0x05D1, 4, -1 },
  105. { 0xFB32, 0x05D2, 4, -1 },
  106. { 0xFB33, 0x05D3, 4, -1 },
  107. { 0xFB34, 0x05D4, 4, -1 },
  108. { 0xFB35, 0x05D5, 4, -1 },
  109. { 0xFB36, 0x05D6, 4, -1 },
  110. { 0xFB38, 0x05D8, 4, -1 },
  111. { 0xFB39, 0x05D9, 4, -1 },
  112. { 0xFB3A, 0x05DA, 4, -1 },
  113. { 0xFB3B, 0x05DB, 4, -1 },
  114. { 0xFB3C, 0x05DC, 4, -1 },
  115. { 0xFB3E, 0x05DE, 4, -1 },
  116. { 0xFB40, 0x05E0, 4, -1 },
  117. { 0xFB41, 0x05E1, 4, -1 },
  118. { 0xFB43, 0x05E3, 4, -1 },
  119. { 0xFB44, 0x05E4, 4, -1 },
  120. { 0xFB46, 0x05E6, 4, -1 },
  121. { 0xFB47, 0x05E7, 4, -1 },
  122. { 0xFB48, 0x05E8, 4, -1 },
  123. { 0xFB49, 0x05E9, 4, -1 },
  124. { 0xFB4A, 0x05EA, 4, -1 },
  125. { 0xFB4B, 0x05D5, 3, -1 },
  126. { 0xFB4C, 0x05D1, 5, -1 },
  127. { 0xFB4D, 0x05DB, 5, -1 },
  128. { 0xFB4E, 0x05E4, 5, -1 },
  129. };
  130. static const unsigned char cp1255_comb_table[] = {
  131. 0xc4, 0xc7, 0xc8, 0xc9, 0xcc, 0xcf, 0xd1, 0xd2,
  132. };
  133. static const unsigned short cp1255_2uni[128] = {
  134. /* 0x80 */
  135. 0x20ac, 0xfffd, 0x201a, 0x0192, 0x201e, 0x2026, 0x2020, 0x2021,
  136. 0x02c6, 0x2030, 0xfffd, 0x2039, 0xfffd, 0xfffd, 0xfffd, 0xfffd,
  137. /* 0x90 */
  138. 0xfffd, 0x2018, 0x2019, 0x201c, 0x201d, 0x2022, 0x2013, 0x2014,
  139. 0x02dc, 0x2122, 0xfffd, 0x203a, 0xfffd, 0xfffd, 0xfffd, 0xfffd,
  140. /* 0xa0 */
  141. 0x00a0, 0x00a1, 0x00a2, 0x00a3, 0x20aa, 0x00a5, 0x00a6, 0x00a7,
  142. 0x00a8, 0x00a9, 0x00d7, 0x00ab, 0x00ac, 0x00ad, 0x00ae, 0x00af,
  143. /* 0xb0 */
  144. 0x00b0, 0x00b1, 0x00b2, 0x00b3, 0x00b4, 0x00b5, 0x00b6, 0x00b7,
  145. 0x00b8, 0x00b9, 0x00f7, 0x00bb, 0x00bc, 0x00bd, 0x00be, 0x00bf,
  146. /* 0xc0 */
  147. 0x05b0, 0x05b1, 0x05b2, 0x05b3, 0x05b4, 0x05b5, 0x05b6, 0x05b7,
  148. 0x05b8, 0x05b9, 0xfffd, 0x05bb, 0x05bc, 0x05bd, 0x05be, 0x05bf,
  149. /* 0xd0 */
  150. 0x05c0, 0x05c1, 0x05c2, 0x05c3, 0x05f0, 0x05f1, 0x05f2, 0x05f3,
  151. 0x05f4, 0xfffd, 0xfffd, 0xfffd, 0xfffd, 0xfffd, 0xfffd, 0xfffd,
  152. /* 0xe0 */
  153. 0x05d0, 0x05d1, 0x05d2, 0x05d3, 0x05d4, 0x05d5, 0x05d6, 0x05d7,
  154. 0x05d8, 0x05d9, 0x05da, 0x05db, 0x05dc, 0x05dd, 0x05de, 0x05df,
  155. /* 0xf0 */
  156. 0x05e0, 0x05e1, 0x05e2, 0x05e3, 0x05e4, 0x05e5, 0x05e6, 0x05e7,
  157. 0x05e8, 0x05e9, 0x05ea, 0xfffd, 0xfffd, 0x200e, 0x200f, 0xfffd,
  158. };
  159. /* In the CP1255 to Unicode direction, the state contains a buffered
  160. character, or 0 if none. */
  161. static int
  162. cp1255_mbtowc (conv_t conv, ucs4_t *pwc, const unsigned char *s, int n)
  163. {
  164. unsigned char c = *s;
  165. unsigned short wc;
  166. unsigned short last_wc;
  167. if (c < 0x80) {
  168. wc = c;
  169. } else {
  170. wc = cp1255_2uni[c-0x80];
  171. if (wc == 0xfffd)
  172. return RET_ILSEQ;
  173. }
  174. last_wc = conv->istate;
  175. if (last_wc) {
  176. if (wc >= 0x05b0 && wc < 0x05c5) {
  177. /* See whether last_wc and wc can be combined. */
  178. unsigned int k;
  179. unsigned int i1, i2;
  180. switch (wc) {
  181. case 0x05b4: k = 0; break;
  182. case 0x05b7: k = 1; break;
  183. case 0x05b8: k = 2; break;
  184. case 0x05b9: k = 3; break;
  185. case 0x05bc: k = 4; break;
  186. case 0x05bf: k = 5; break;
  187. case 0x05c1: k = 6; break;
  188. case 0x05c2: k = 7; break;
  189. default: goto not_combining;
  190. }
  191. i1 = cp1255_comp_table[k].idx;
  192. i2 = i1 + cp1255_comp_table[k].len-1;
  193. if (last_wc >= cp1255_comp_table_data[i1].base
  194. && last_wc <= cp1255_comp_table_data[i2].base) {
  195. unsigned int i;
  196. for (;;) {
  197. i = (i1+i2)>>1;
  198. if (last_wc == cp1255_comp_table_data[i].base)
  199. break;
  200. if (last_wc < cp1255_comp_table_data[i].base) {
  201. if (i1 == i)
  202. goto not_combining;
  203. i2 = i;
  204. } else {
  205. if (i1 != i)
  206. i1 = i;
  207. else {
  208. i = i2;
  209. if (last_wc == cp1255_comp_table_data[i].base)
  210. break;
  211. goto not_combining;
  212. }
  213. }
  214. }
  215. last_wc = cp1255_comp_table_data[i].composed;
  216. if (last_wc == 0xfb2a || last_wc == 0xfb2b || last_wc == 0xfb49) {
  217. /* Buffer the combined character. */
  218. conv->istate = last_wc;
  219. return RET_TOOFEW(1);
  220. } else {
  221. /* Output the combined character. */
  222. conv->istate = 0;
  223. *pwc = (ucs4_t) last_wc;
  224. return 1;
  225. }
  226. }
  227. }
  228. not_combining:
  229. /* Output the buffered character. */
  230. conv->istate = 0;
  231. *pwc = (ucs4_t) last_wc;
  232. return 0; /* Don't advance the input pointer. */
  233. }
  234. if ((wc >= 0x05d0 && wc <= 0x05ea && ((0x07db5f7f >> (wc - 0x05d0)) & 1))
  235. || wc == 0x05f2) {
  236. /* wc is a possible match in cp1255_comp_table_data. Buffer it. */
  237. conv->istate = wc;
  238. return RET_TOOFEW(1);
  239. } else {
  240. /* Output wc immediately. */
  241. *pwc = (ucs4_t) wc;
  242. return 1;
  243. }
  244. }
  245. #define cp1255_flushwc normal_flushwc
  246. static const unsigned char cp1255_page00[88] = {
  247. 0xa0, 0xa1, 0xa2, 0xa3, 0x00, 0xa5, 0xa6, 0xa7, /* 0xa0-0xa7 */
  248. 0xa8, 0xa9, 0x00, 0xab, 0xac, 0xad, 0xae, 0xaf, /* 0xa8-0xaf */
  249. 0xb0, 0xb1, 0xb2, 0xb3, 0xb4, 0xb5, 0xb6, 0xb7, /* 0xb0-0xb7 */
  250. 0xb8, 0xb9, 0x00, 0xbb, 0xbc, 0xbd, 0xbe, 0xbf, /* 0xb8-0xbf */
  251. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xc0-0xc7 */
  252. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xc8-0xcf */
  253. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xaa, /* 0xd0-0xd7 */
  254. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xd8-0xdf */
  255. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xe0-0xe7 */
  256. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xe8-0xef */
  257. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xba, /* 0xf0-0xf7 */
  258. };
  259. static const unsigned char cp1255_page02[32] = {
  260. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x88, 0x00, /* 0xc0-0xc7 */
  261. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xc8-0xcf */
  262. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xd0-0xd7 */
  263. 0x00, 0x00, 0x00, 0x00, 0x98, 0x00, 0x00, 0x00, /* 0xd8-0xdf */
  264. };
  265. static const unsigned char cp1255_page05[72] = {
  266. 0xc0, 0xc1, 0xc2, 0xc3, 0xc4, 0xc5, 0xc6, 0xc7, /* 0xb0-0xb7 */
  267. 0xc8, 0xc9, 0x00, 0xcb, 0xcc, 0xcd, 0xce, 0xcf, /* 0xb8-0xbf */
  268. 0xd0, 0xd1, 0xd2, 0xd3, 0x00, 0x00, 0x00, 0x00, /* 0xc0-0xc7 */
  269. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xc8-0xcf */
  270. 0xe0, 0xe1, 0xe2, 0xe3, 0xe4, 0xe5, 0xe6, 0xe7, /* 0xd0-0xd7 */
  271. 0xe8, 0xe9, 0xea, 0xeb, 0xec, 0xed, 0xee, 0xef, /* 0xd8-0xdf */
  272. 0xf0, 0xf1, 0xf2, 0xf3, 0xf4, 0xf5, 0xf6, 0xf7, /* 0xe0-0xe7 */
  273. 0xf8, 0xf9, 0xfa, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0xe8-0xef */
  274. 0xd4, 0xd5, 0xd6, 0xd7, 0xd8, 0x00, 0x00, 0x00, /* 0xf0-0xf7 */
  275. };
  276. static const unsigned char cp1255_page20[56] = {
  277. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xfd, 0xfe, /* 0x08-0x0f */
  278. 0x00, 0x00, 0x00, 0x96, 0x97, 0x00, 0x00, 0x00, /* 0x10-0x17 */
  279. 0x91, 0x92, 0x82, 0x00, 0x93, 0x94, 0x84, 0x00, /* 0x18-0x1f */
  280. 0x86, 0x87, 0x95, 0x00, 0x00, 0x00, 0x85, 0x00, /* 0x20-0x27 */
  281. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0x28-0x2f */
  282. 0x89, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0x30-0x37 */
  283. 0x00, 0x8b, 0x9b, 0x00, 0x00, 0x00, 0x00, 0x00, /* 0x38-0x3f */
  284. };
  285. static int
  286. cp1255_wctomb (conv_t conv, unsigned char *r, ucs4_t wc, int n)
  287. {
  288. unsigned char c = 0;
  289. if (wc < 0x0080) {
  290. *r = wc;
  291. return 1;
  292. }
  293. else if (wc >= 0x00a0 && wc < 0x00f8)
  294. c = cp1255_page00[wc-0x00a0];
  295. else if (wc == 0x0192)
  296. c = 0x83;
  297. else if (wc >= 0x02c0 && wc < 0x02e0)
  298. c = cp1255_page02[wc-0x02c0];
  299. else if (wc >= 0x05b0 && wc < 0x05f8)
  300. c = cp1255_page05[wc-0x05b0];
  301. else if (wc >= 0x2008 && wc < 0x2040)
  302. c = cp1255_page20[wc-0x2008];
  303. else if (wc == 0x20aa)
  304. c = 0xa4;
  305. else if (wc == 0x20ac)
  306. c = 0x80;
  307. else if (wc == 0x2122)
  308. c = 0x99;
  309. if (c != 0) {
  310. *r = c;
  311. return 1;
  312. }
  313. /* Try canonical decomposition. */
  314. {
  315. /* Binary search through cp1255_decomp_table. */
  316. unsigned int i1 = 0;
  317. unsigned int i2 = sizeof(cp1255_decomp_table)/sizeof(cp1255_decomp_table[0])-1;
  318. if (wc >= cp1255_decomp_table[i1].composed
  319. && wc <= cp1255_decomp_table[i2].composed) {
  320. unsigned int i;
  321. for (;;) {
  322. /* Here i2 - i1 > 0. */
  323. i = (i1+i2)>>1;
  324. if (wc == cp1255_decomp_table[i].composed)
  325. break;
  326. if (wc < cp1255_decomp_table[i].composed) {
  327. if (i1 == i)
  328. return RET_ILUNI;
  329. /* Here i1 < i < i2. */
  330. i2 = i;
  331. } else {
  332. /* Here i1 <= i < i2. */
  333. if (i1 != i)
  334. i1 = i;
  335. else {
  336. /* Here i2 - i1 = 1. */
  337. i = i2;
  338. if (wc == cp1255_decomp_table[i].composed)
  339. break;
  340. else
  341. return RET_ILUNI;
  342. }
  343. }
  344. }
  345. /* Found a canonical decomposition. */
  346. wc = cp1255_decomp_table[i].base;
  347. /* wc is one of 0x05d0..0x05d6, 0x05d8..0x05dc, 0x05de, 0x05e0..0x05e1,
  348. 0x05e3..0x05e4, 0x05e6..0x05ea, 0x05f2. */
  349. c = cp1255_page05[wc-0x05b0];
  350. if (cp1255_decomp_table[i].comb2 < 0) {
  351. if (n < 2)
  352. return RET_TOOSMALL;
  353. r[0] = c;
  354. r[1] = cp1255_comb_table[cp1255_decomp_table[i].comb1];
  355. return 2;
  356. } else {
  357. if (n < 3)
  358. return RET_TOOSMALL;
  359. r[0] = c;
  360. r[1] = cp1255_comb_table[cp1255_decomp_table[i].comb1];
  361. r[2] = cp1255_comb_table[cp1255_decomp_table[i].comb2];
  362. return 3;
  363. }
  364. }
  365. }
  366. return RET_ILUNI;
  367. }