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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
/* bidi.c - IDNA right to left checking functions
Copyright (C) 2011-2017 Simon Josefsson
Libidn2 is free software: you can redistribute it and/or modify it
under the terms of either:
* the GNU Lesser General Public License as published by the Free
Software Foundation; either version 3 of the License, or (at
your option) any later version.
or
* the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at
your option) any later version.
or both in parallel, as here.
This program 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 General Public License for more details.
You should have received copies of the GNU General Public License and
the GNU Lesser General Public License along with this program. If
not, see <http://www.gnu.org/licenses/>.
*/
#include <config.h>
#include "idn2.h"
#include <stdbool.h>
#include "bidi.h"
#include <unictype.h>
/* The entire bidi rule could be rewritten into an one-pass approach;
the implementation below may in the worse case iterate through the
string a few times. However, recall Knuth and premature
optimization is the root of all evil. */
static bool
rtl_ralanenescsetonbnnsm_ok (const uint32_t * label, size_t llen)
{
int bc;
for (; llen > 0; label++, llen--)
{
bc = uc_bidi_category (*label);
switch (bc)
{
case UC_BIDI_R:
case UC_BIDI_AL:
case UC_BIDI_AN:
case UC_BIDI_EN:
case UC_BIDI_ES:
case UC_BIDI_CS:
case UC_BIDI_ET:
case UC_BIDI_ON:
case UC_BIDI_BN:
case UC_BIDI_NSM:
break;
default:
return false;
}
}
return true;
}
static bool
rtl_ends_ok (const uint32_t * label, size_t llen)
{
const uint32_t *p;
int bc;
for (p = label + llen - 1; llen > 0; llen--, p--)
{
bc = uc_bidi_category (*p);
switch (bc)
{
case UC_BIDI_NSM:
continue;
case UC_BIDI_R:
case UC_BIDI_AL:
case UC_BIDI_EN:
case UC_BIDI_AN:
return true;
default:
return false;
}
}
return false;
}
static bool
rtl_enan_ok (const uint32_t * label, size_t llen)
{
bool en = false;
bool an = false;
const uint32_t *p;
int bc;
for (p = label + llen - 1; llen > 0; llen--, p--)
{
bc = uc_bidi_category (*p);
switch (bc)
{
case UC_BIDI_EN:
en = true;
break;
case UC_BIDI_AN:
an = true;
break;
}
}
return !(en && an);
}
static int
rtl (const uint32_t * label, size_t llen)
{
if (rtl_ralanenescsetonbnnsm_ok (label, llen)
&& rtl_ends_ok (label, llen) && rtl_enan_ok (label, llen))
return IDN2_OK;
return IDN2_BIDI;
}
static bool
ltr_lenescsetonbnnsm_ok (const uint32_t * label, size_t llen)
{
int bc;
for (; llen > 0; label++, llen--)
{
bc = uc_bidi_category (*label);
switch (bc)
{
case UC_BIDI_L:
case UC_BIDI_EN:
case UC_BIDI_ES:
case UC_BIDI_CS:
case UC_BIDI_ET:
case UC_BIDI_ON:
case UC_BIDI_BN:
case UC_BIDI_NSM:
break;
default:
return false;
}
}
return true;
}
static bool
ltr_ends_ok (const uint32_t * label, size_t llen)
{
const uint32_t *p;
int bc;
for (p = label + llen - 1; llen > 0; llen--, p--)
{
bc = uc_bidi_category (*p);
switch (bc)
{
case UC_BIDI_NSM:
continue;
case UC_BIDI_L:
case UC_BIDI_EN:
return true;
default:
return false;
}
}
return false;
}
static int
ltr (const uint32_t * label, size_t llen)
{
if (ltr_lenescsetonbnnsm_ok (label, llen) && ltr_ends_ok (label, llen))
return IDN2_OK;
return IDN2_BIDI;
}
static bool
bidi_p (const uint32_t * label, size_t llen)
{
int bc;
for (; llen > 0; label++, llen--)
{
bc = uc_bidi_category (*label);
switch (bc)
{
case UC_BIDI_R:
case UC_BIDI_AL:
case UC_BIDI_AN:
return true;
}
}
return false;
}
int
_idn2_bidi (const uint32_t * label, size_t llen)
{
int bc;
if (!bidi_p (label, llen))
return IDN2_OK;
bc = uc_bidi_category (*label);
switch (bc)
{
case UC_BIDI_L:
return ltr (label, llen);
case UC_BIDI_R:
case UC_BIDI_AL:
return rtl (label, llen);
}
return IDN2_BIDI;
}
|
