1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/* FriBidi - Library of BiDi algorithm
* Copyright (C) 1999,2000 Dov Grobgeld, and
* Copyright (C) 2001,2002 Behdad Esfahbod.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this library, in a file named COPYING; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place, Suite 330,
* Boston, MA 02111-1307, USA
*
* For licensing issues, contact <dov@imagic.weizmann.ac.il> and
* <fwpg@sharif.edu>.
*/
#include "fribidi_config.h"
#ifndef FRIBIDI_NO_CHARSETS
#include <string.h>
#include "fribidi.h"
#define ISO_ALEF 224
#define ISO_TAV 250
#define CP1255_SHEVA 0xC0
#define CP1255_SOF_PASUQ 0xD3
#define CP1255_DOUBLE_VAV 0xD4
#define CP1255_GERSHAYIM 0xD8
#define UNI_ALEF 0x05D0
#define UNI_TAV 0x05EA
#define UNI_SHEVA 0x05B0
#define UNI_SOF_PASUQ 0x05C3
#define UNI_DOUBLE_VAV 0x05F0
#define UNI_GERSHAYIM 0x05F4
FriBidiChar fribidi_cp1255_to_unicode_tab[] = { /* 0x80-0xBF */
0x20AC, 0x81, 0x201A, 0x0192, 0x201E, 0x2026, 0x2020, 0x2021,
0x02C6, 0x2030, 0x8a, 0x2039, 0x8c, 0x8d, 0x8e, 0x8f,
0x90, 0x2018, 0x2019, 0x201C, 0x201D, 0x2022, 0x2013, 0x2014,
0x02DC, 0x2122, 0x9a, 0x203A, 0x9c, 0x9d, 0x9e, 0x9f,
0x00A0, 0x00A1, 0x00A2, 0x00A3, 0x20AA, 0x00A5, 0x00A6, 0x00A7,
0x00A8, 0x00A9, 0x00D7, 0x00AB, 0x00AC, 0x00AD, 0x00AE, 0x00AF,
0x00B0, 0x00B1, 0x00B2, 0x00B3, 0x00B4, 0x00B5, 0x00B6, 0x00B7,
0x00B8, 0x00B9, 0x00F7, 0x00BB, 0x00BC, 0x00BD, 0x00BE, 0x00BF
};
FriBidiChar
fribidi_cp1255_to_unicode_c (char sch)
{
unsigned char ch = (unsigned char) sch;
if (ch >= ISO_ALEF && ch <= ISO_TAV)
return ch - ISO_ALEF + UNI_ALEF;
else if (ch >= CP1255_SHEVA && ch <= CP1255_SOF_PASUQ)
return ch - CP1255_SHEVA + UNI_SHEVA;
else if (ch >= CP1255_DOUBLE_VAV && ch <= CP1255_GERSHAYIM)
return ch - CP1255_DOUBLE_VAV + UNI_DOUBLE_VAV;
/* cp1256 specific chars */
else if (ch >= 0x80 && ch <= 0xbf)
return fribidi_cp1255_to_unicode_tab[ch - 0x80];
else
return ch;
}
int
fribidi_cp1255_to_unicode (char *s,
int len,
FriBidiChar *us)
{
int i;
for (i = 0; i < len + 1; i++)
us[i] = fribidi_cp1255_to_unicode_c (s[i]);
return len;
}
char
fribidi_unicode_to_cp1255_c (FriBidiChar uch)
{
if (uch >= UNI_ALEF && uch <= UNI_TAV)
return (char) (uch - UNI_ALEF + ISO_ALEF);
if (uch >= UNI_SHEVA && uch <= UNI_SOF_PASUQ)
return (char) (uch - UNI_SHEVA + CP1255_SHEVA);
if (uch >= UNI_DOUBLE_VAV && uch <= UNI_GERSHAYIM)
return (char) (uch - UNI_DOUBLE_VAV + CP1255_DOUBLE_VAV);
/* TODO: handle pre-composed and presentation chars */
else if (uch < 256)
return (char) uch;
else
return '¿';
}
int
fribidi_unicode_to_cp1255 (FriBidiChar *us,
int length,
char *s)
{
int i;
for (i = 0; i < length; i++)
s[i] = fribidi_unicode_to_cp1255_c (us[i]);
s[i] = 0;
return length;
}
#endif
|
