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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
|
/*
* utf_validate.c: Validate a UTF-8 string
*
* ====================================================================
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
* ====================================================================
*/
/* Validate a UTF-8 string according to the rules in
*
* Table 3-6. Well-Formed UTF-8 Bytes Sequences
*
* in
*
* The Unicode Standard, Version 4.0
*
* which is available at
*
* http://www.unicode.org/
*
* UTF-8 was originally defined in RFC-2279, Unicode's "well-formed UTF-8"
* is a subset of that enconding. The Unicode enconding prohibits things
* like non-shortest encodings (some characters can be represented by more
* than one multi-byte encoding) and the encodings for the surrogate code
* points. RFC-3629 superceeds RFC-2279 and adopts the same well-formed
* rules as Unicode. This is the ABNF in RFC-3629 that describes
* well-formed UTF-8 rules:
*
* UTF8-octets = *( UTF8-char )
* UTF8-char = UTF8-1 / UTF8-2 / UTF8-3 / UTF8-4
* UTF8-1 = %x00-7F
* UTF8-2 = %xC2-DF UTF8-tail
* UTF8-3 = %xE0 %xA0-BF UTF8-tail /
* %xE1-EC 2( UTF8-tail ) /
* %xED %x80-9F UTF8-tail /
* %xEE-EF 2( UTF8-tail )
* UTF8-4 = %xF0 %x90-BF 2( UTF8-tail ) /
* %xF1-F3 3( UTF8-tail ) /
* %xF4 %x80-8F 2( UTF8-tail )
* UTF8-tail = %x80-BF
*
*/
#include "private/svn_utf_private.h"
/* Lookup table to categorise each octet in the string. */
static const char octet_category[256] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x00-0x7f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0x80-0x8f */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0x90-0x9f */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, /* 0xa0-0xbf */
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
4, 4, /* 0xc0-0xc1 */
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, /* 0xc2-0xdf */
5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
6, /* 0xe0 */
7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, /* 0xe1-0xec */
8, /* 0xed */
9, 9, /* 0xee-0xef */
10, /* 0xf0 */
11, 11, 11, /* 0xf1-0xf3 */
12, /* 0xf4 */
13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13 /* 0xf5-0xff */
};
/* Machine states */
#define FSM_START 0
#define FSM_80BF 1
#define FSM_A0BF 2
#define FSM_80BF80BF 3
#define FSM_809F 4
#define FSM_90BF 5
#define FSM_80BF80BF80BF 6
#define FSM_808F 7
#define FSM_ERROR 8
/* In the FSM it appears that categories 0xc0-0xc1 and 0xf5-0xff make the
same transitions, as do categories 0xe1-0xec and 0xee-0xef. I wonder if
there is any great benefit in combining categories? It would reduce the
memory footprint of the transition table by 16 bytes, but might it be
harder to understand? */
/* Machine transition table */
static const char machine [9][14] = {
/* FSM_START */
{FSM_START, /* 0x00-0x7f */
FSM_ERROR, /* 0x80-0x8f */
FSM_ERROR, /* 0x90-0x9f */
FSM_ERROR, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_80BF, /* 0xc2-0xdf */
FSM_A0BF, /* 0xe0 */
FSM_80BF80BF, /* 0xe1-0xec */
FSM_809F, /* 0xed */
FSM_80BF80BF, /* 0xee-0xef */
FSM_90BF, /* 0xf0 */
FSM_80BF80BF80BF, /* 0xf1-0xf3 */
FSM_808F, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_80BF */
{FSM_ERROR, /* 0x00-0x7f */
FSM_START, /* 0x80-0x8f */
FSM_START, /* 0x90-0x9f */
FSM_START, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_A0BF */
{FSM_ERROR, /* 0x00-0x7f */
FSM_ERROR, /* 0x80-0x8f */
FSM_ERROR, /* 0x90-0x9f */
FSM_80BF, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_80BF80BF */
{FSM_ERROR, /* 0x00-0x7f */
FSM_80BF, /* 0x80-0x8f */
FSM_80BF, /* 0x90-0x9f */
FSM_80BF, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_809F */
{FSM_ERROR, /* 0x00-0x7f */
FSM_80BF, /* 0x80-0x8f */
FSM_80BF, /* 0x90-0x9f */
FSM_ERROR, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_90BF */
{FSM_ERROR, /* 0x00-0x7f */
FSM_ERROR, /* 0x80-0x8f */
FSM_80BF80BF, /* 0x90-0x9f */
FSM_80BF80BF, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_80BF80BF80BF */
{FSM_ERROR, /* 0x00-0x7f */
FSM_80BF80BF, /* 0x80-0x8f */
FSM_80BF80BF, /* 0x90-0x9f */
FSM_80BF80BF, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_808F */
{FSM_ERROR, /* 0x00-0x7f */
FSM_80BF80BF, /* 0x80-0x8f */
FSM_ERROR, /* 0x90-0x9f */
FSM_ERROR, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
/* FSM_ERROR */
{FSM_ERROR, /* 0x00-0x7f */
FSM_ERROR, /* 0x80-0x8f */
FSM_ERROR, /* 0x90-0x9f */
FSM_ERROR, /* 0xa0-0xbf */
FSM_ERROR, /* 0xc0-0xc1 */
FSM_ERROR, /* 0xc2-0xdf */
FSM_ERROR, /* 0xe0 */
FSM_ERROR, /* 0xe1-0xec */
FSM_ERROR, /* 0xed */
FSM_ERROR, /* 0xee-0xef */
FSM_ERROR, /* 0xf0 */
FSM_ERROR, /* 0xf1-0xf3 */
FSM_ERROR, /* 0xf4 */
FSM_ERROR}, /* 0xf5-0xff */
};
const char *
svn_utf__last_valid(const char *data, apr_size_t len)
{
const char *start = data, *end = data + len;
int state = FSM_START;
while (data < end)
{
unsigned char octet = *data++;
int category = octet_category[octet];
state = machine[state][category];
if (state == FSM_START)
start = data;
}
return start;
}
svn_boolean_t
svn_utf__cstring_is_valid(const char *data)
{
int state = FSM_START;
while (*data)
{
unsigned char octet = *data++;
int category = octet_category[octet];
state = machine[state][category];
}
return state == FSM_START;
}
svn_boolean_t
svn_utf__is_valid(const char *data, apr_size_t len)
{
const char *end = data + len;
int state = FSM_START;
while (data < end)
{
unsigned char octet = *data++;
int category = octet_category[octet];
state = machine[state][category];
}
return state == FSM_START;
}
const char *
svn_utf__last_valid2(const char *data, apr_size_t len)
{
const char *start = data, *end = data + len;
int state = FSM_START;
while (data < end)
{
unsigned char octet = *data++;
switch (state)
{
case FSM_START:
if (octet <= 0x7F)
break;
else if (octet <= 0xC1)
state = FSM_ERROR;
else if (octet <= 0xDF)
state = FSM_80BF;
else if (octet == 0xE0)
state = FSM_A0BF;
else if (octet <= 0xEC)
state = FSM_80BF80BF;
else if (octet == 0xED)
state = FSM_809F;
else if (octet <= 0xEF)
state = FSM_80BF80BF;
else if (octet == 0xF0)
state = FSM_90BF;
else if (octet <= 0xF3)
state = FSM_80BF80BF80BF;
else if (octet <= 0xF4)
state = FSM_808F;
else
state = FSM_ERROR;
break;
case FSM_80BF:
if (octet >= 0x80 && octet <= 0xBF)
state = FSM_START;
else
state = FSM_ERROR;
break;
case FSM_A0BF:
if (octet >= 0xA0 && octet <= 0xBF)
state = FSM_80BF;
else
state = FSM_ERROR;
break;
case FSM_80BF80BF:
if (octet >= 0x80 && octet <= 0xBF)
state = FSM_80BF;
else
state = FSM_ERROR;
break;
case FSM_809F:
if (octet >= 0x80 && octet <= 0x9F)
state = FSM_80BF;
else
state = FSM_ERROR;
break;
case FSM_90BF:
if (octet >= 0x90 && octet <= 0xBF)
state = FSM_80BF80BF;
else
state = FSM_ERROR;
break;
case FSM_80BF80BF80BF:
if (octet >= 0x80 && octet <= 0xBF)
state = FSM_80BF80BF;
else
state = FSM_ERROR;
break;
case FSM_808F:
if (octet >= 0x80 && octet <= 0x8F)
state = FSM_80BF80BF;
else
state = FSM_ERROR;
break;
default:
case FSM_ERROR:
return start;
}
if (state == FSM_START)
start = data;
}
return start;
}
|
