]>
Commit | Line | Data |
---|---|---|
7eb75bcc DM |
1 | /* Copyright (c) 1998, 1999 Thai Open Source Software Center Ltd\r |
2 | See the file COPYING for copying permission.\r | |
3 | */\r | |
4 | \r | |
5 | #include <stddef.h>\r | |
6 | \r | |
7 | #ifdef COMPILED_FROM_DSP\r | |
8 | #include "winconfig.h"\r | |
9 | #elif defined(MACOS_CLASSIC)\r | |
10 | #include "macconfig.h"\r | |
11 | #elif defined(__amigaos__)\r | |
12 | #include "amigaconfig.h"\r | |
13 | #elif defined(__WATCOMC__)\r | |
14 | #include "watcomconfig.h"\r | |
15 | #else\r | |
16 | #ifdef HAVE_EXPAT_CONFIG_H\r | |
17 | #include <expat_config.h>\r | |
18 | #endif\r | |
19 | #endif /* ndef COMPILED_FROM_DSP */\r | |
20 | \r | |
21 | #include "expat_external.h"\r | |
22 | #include "internal.h"\r | |
23 | #include "xmltok.h"\r | |
24 | #include "nametab.h"\r | |
25 | \r | |
26 | #ifdef XML_DTD\r | |
27 | #define IGNORE_SECTION_TOK_VTABLE , PREFIX(ignoreSectionTok)\r | |
28 | #else\r | |
29 | #define IGNORE_SECTION_TOK_VTABLE /* as nothing */\r | |
30 | #endif\r | |
31 | \r | |
32 | #define VTABLE1 \\r | |
33 | { PREFIX(prologTok), PREFIX(contentTok), \\r | |
34 | PREFIX(cdataSectionTok) IGNORE_SECTION_TOK_VTABLE }, \\r | |
35 | { PREFIX(attributeValueTok), PREFIX(entityValueTok) }, \\r | |
36 | PREFIX(sameName), \\r | |
37 | PREFIX(nameMatchesAscii), \\r | |
38 | PREFIX(nameLength), \\r | |
39 | PREFIX(skipS), \\r | |
40 | PREFIX(getAtts), \\r | |
41 | PREFIX(charRefNumber), \\r | |
42 | PREFIX(predefinedEntityName), \\r | |
43 | PREFIX(updatePosition), \\r | |
44 | PREFIX(isPublicId)\r | |
45 | \r | |
46 | #define VTABLE VTABLE1, PREFIX(toUtf8), PREFIX(toUtf16)\r | |
47 | \r | |
48 | #define UCS2_GET_NAMING(pages, hi, lo) \\r | |
49 | (namingBitmap[(pages[hi] << 3) + ((lo) >> 5)] & (1 << ((lo) & 0x1F)))\r | |
50 | \r | |
51 | /* A 2 byte UTF-8 representation splits the characters 11 bits between\r | |
52 | the bottom 5 and 6 bits of the bytes. We need 8 bits to index into\r | |
53 | pages, 3 bits to add to that index and 5 bits to generate the mask.\r | |
54 | */\r | |
55 | #define UTF8_GET_NAMING2(pages, byte) \\r | |
56 | (namingBitmap[((pages)[(((byte)[0]) >> 2) & 7] << 3) \\r | |
57 | + ((((byte)[0]) & 3) << 1) \\r | |
58 | + ((((byte)[1]) >> 5) & 1)] \\r | |
59 | & (1 << (((byte)[1]) & 0x1F)))\r | |
60 | \r | |
61 | /* A 3 byte UTF-8 representation splits the characters 16 bits between\r | |
62 | the bottom 4, 6 and 6 bits of the bytes. We need 8 bits to index\r | |
63 | into pages, 3 bits to add to that index and 5 bits to generate the\r | |
64 | mask.\r | |
65 | */\r | |
66 | #define UTF8_GET_NAMING3(pages, byte) \\r | |
67 | (namingBitmap[((pages)[((((byte)[0]) & 0xF) << 4) \\r | |
68 | + ((((byte)[1]) >> 2) & 0xF)] \\r | |
69 | << 3) \\r | |
70 | + ((((byte)[1]) & 3) << 1) \\r | |
71 | + ((((byte)[2]) >> 5) & 1)] \\r | |
72 | & (1 << (((byte)[2]) & 0x1F)))\r | |
73 | \r | |
74 | #define UTF8_GET_NAMING(pages, p, n) \\r | |
75 | ((n) == 2 \\r | |
76 | ? UTF8_GET_NAMING2(pages, (const unsigned char *)(p)) \\r | |
77 | : ((n) == 3 \\r | |
78 | ? UTF8_GET_NAMING3(pages, (const unsigned char *)(p)) \\r | |
79 | : 0))\r | |
80 | \r | |
81 | /* Detection of invalid UTF-8 sequences is based on Table 3.1B\r | |
82 | of Unicode 3.2: http://www.unicode.org/unicode/reports/tr28/\r | |
83 | with the additional restriction of not allowing the Unicode\r | |
84 | code points 0xFFFF and 0xFFFE (sequences EF,BF,BF and EF,BF,BE).\r | |
85 | Implementation details:\r | |
86 | (A & 0x80) == 0 means A < 0x80\r | |
87 | and\r | |
88 | (A & 0xC0) == 0xC0 means A > 0xBF\r | |
89 | */\r | |
90 | \r | |
91 | #define UTF8_INVALID2(p) \\r | |
92 | ((*p) < 0xC2 || ((p)[1] & 0x80) == 0 || ((p)[1] & 0xC0) == 0xC0)\r | |
93 | \r | |
94 | #define UTF8_INVALID3(p) \\r | |
95 | (((p)[2] & 0x80) == 0 \\r | |
96 | || \\r | |
97 | ((*p) == 0xEF && (p)[1] == 0xBF \\r | |
98 | ? \\r | |
99 | (p)[2] > 0xBD \\r | |
100 | : \\r | |
101 | ((p)[2] & 0xC0) == 0xC0) \\r | |
102 | || \\r | |
103 | ((*p) == 0xE0 \\r | |
104 | ? \\r | |
105 | (p)[1] < 0xA0 || ((p)[1] & 0xC0) == 0xC0 \\r | |
106 | : \\r | |
107 | ((p)[1] & 0x80) == 0 \\r | |
108 | || \\r | |
109 | ((*p) == 0xED ? (p)[1] > 0x9F : ((p)[1] & 0xC0) == 0xC0)))\r | |
110 | \r | |
111 | #define UTF8_INVALID4(p) \\r | |
112 | (((p)[3] & 0x80) == 0 || ((p)[3] & 0xC0) == 0xC0 \\r | |
113 | || \\r | |
114 | ((p)[2] & 0x80) == 0 || ((p)[2] & 0xC0) == 0xC0 \\r | |
115 | || \\r | |
116 | ((*p) == 0xF0 \\r | |
117 | ? \\r | |
118 | (p)[1] < 0x90 || ((p)[1] & 0xC0) == 0xC0 \\r | |
119 | : \\r | |
120 | ((p)[1] & 0x80) == 0 \\r | |
121 | || \\r | |
122 | ((*p) == 0xF4 ? (p)[1] > 0x8F : ((p)[1] & 0xC0) == 0xC0)))\r | |
123 | \r | |
124 | static int PTRFASTCALL\r | |
125 | isNever(const ENCODING *enc, const char *p)\r | |
126 | {\r | |
127 | return 0;\r | |
128 | }\r | |
129 | \r | |
130 | static int PTRFASTCALL\r | |
131 | utf8_isName2(const ENCODING *enc, const char *p)\r | |
132 | {\r | |
133 | return UTF8_GET_NAMING2(namePages, (const unsigned char *)p);\r | |
134 | }\r | |
135 | \r | |
136 | static int PTRFASTCALL\r | |
137 | utf8_isName3(const ENCODING *enc, const char *p)\r | |
138 | {\r | |
139 | return UTF8_GET_NAMING3(namePages, (const unsigned char *)p);\r | |
140 | }\r | |
141 | \r | |
142 | #define utf8_isName4 isNever\r | |
143 | \r | |
144 | static int PTRFASTCALL\r | |
145 | utf8_isNmstrt2(const ENCODING *enc, const char *p)\r | |
146 | {\r | |
147 | return UTF8_GET_NAMING2(nmstrtPages, (const unsigned char *)p);\r | |
148 | }\r | |
149 | \r | |
150 | static int PTRFASTCALL\r | |
151 | utf8_isNmstrt3(const ENCODING *enc, const char *p)\r | |
152 | {\r | |
153 | return UTF8_GET_NAMING3(nmstrtPages, (const unsigned char *)p);\r | |
154 | }\r | |
155 | \r | |
156 | #define utf8_isNmstrt4 isNever\r | |
157 | \r | |
158 | static int PTRFASTCALL\r | |
159 | utf8_isInvalid2(const ENCODING *enc, const char *p)\r | |
160 | {\r | |
161 | return UTF8_INVALID2((const unsigned char *)p);\r | |
162 | }\r | |
163 | \r | |
164 | static int PTRFASTCALL\r | |
165 | utf8_isInvalid3(const ENCODING *enc, const char *p)\r | |
166 | {\r | |
167 | return UTF8_INVALID3((const unsigned char *)p);\r | |
168 | }\r | |
169 | \r | |
170 | static int PTRFASTCALL\r | |
171 | utf8_isInvalid4(const ENCODING *enc, const char *p)\r | |
172 | {\r | |
173 | return UTF8_INVALID4((const unsigned char *)p);\r | |
174 | }\r | |
175 | \r | |
176 | struct normal_encoding {\r | |
177 | ENCODING enc;\r | |
178 | unsigned char type[256];\r | |
179 | #ifdef XML_MIN_SIZE\r | |
180 | int (PTRFASTCALL *byteType)(const ENCODING *, const char *);\r | |
181 | int (PTRFASTCALL *isNameMin)(const ENCODING *, const char *);\r | |
182 | int (PTRFASTCALL *isNmstrtMin)(const ENCODING *, const char *);\r | |
183 | int (PTRFASTCALL *byteToAscii)(const ENCODING *, const char *);\r | |
184 | int (PTRCALL *charMatches)(const ENCODING *, const char *, int);\r | |
185 | #endif /* XML_MIN_SIZE */\r | |
186 | int (PTRFASTCALL *isName2)(const ENCODING *, const char *);\r | |
187 | int (PTRFASTCALL *isName3)(const ENCODING *, const char *);\r | |
188 | int (PTRFASTCALL *isName4)(const ENCODING *, const char *);\r | |
189 | int (PTRFASTCALL *isNmstrt2)(const ENCODING *, const char *);\r | |
190 | int (PTRFASTCALL *isNmstrt3)(const ENCODING *, const char *);\r | |
191 | int (PTRFASTCALL *isNmstrt4)(const ENCODING *, const char *);\r | |
192 | int (PTRFASTCALL *isInvalid2)(const ENCODING *, const char *);\r | |
193 | int (PTRFASTCALL *isInvalid3)(const ENCODING *, const char *);\r | |
194 | int (PTRFASTCALL *isInvalid4)(const ENCODING *, const char *);\r | |
195 | };\r | |
196 | \r | |
197 | #define AS_NORMAL_ENCODING(enc) ((const struct normal_encoding *) (enc))\r | |
198 | \r | |
199 | #ifdef XML_MIN_SIZE\r | |
200 | \r | |
201 | #define STANDARD_VTABLE(E) \\r | |
202 | E ## byteType, \\r | |
203 | E ## isNameMin, \\r | |
204 | E ## isNmstrtMin, \\r | |
205 | E ## byteToAscii, \\r | |
206 | E ## charMatches,\r | |
207 | \r | |
208 | #else\r | |
209 | \r | |
210 | #define STANDARD_VTABLE(E) /* as nothing */\r | |
211 | \r | |
212 | #endif\r | |
213 | \r | |
214 | #define NORMAL_VTABLE(E) \\r | |
215 | E ## isName2, \\r | |
216 | E ## isName3, \\r | |
217 | E ## isName4, \\r | |
218 | E ## isNmstrt2, \\r | |
219 | E ## isNmstrt3, \\r | |
220 | E ## isNmstrt4, \\r | |
221 | E ## isInvalid2, \\r | |
222 | E ## isInvalid3, \\r | |
223 | E ## isInvalid4\r | |
224 | \r | |
225 | static int FASTCALL checkCharRefNumber(int);\r | |
226 | \r | |
227 | #include "xmltok_impl.h"\r | |
228 | #include "ascii.h"\r | |
229 | \r | |
230 | #ifdef XML_MIN_SIZE\r | |
231 | #define sb_isNameMin isNever\r | |
232 | #define sb_isNmstrtMin isNever\r | |
233 | #endif\r | |
234 | \r | |
235 | #ifdef XML_MIN_SIZE\r | |
236 | #define MINBPC(enc) ((enc)->minBytesPerChar)\r | |
237 | #else\r | |
238 | /* minimum bytes per character */\r | |
239 | #define MINBPC(enc) 1\r | |
240 | #endif\r | |
241 | \r | |
242 | #define SB_BYTE_TYPE(enc, p) \\r | |
243 | (((struct normal_encoding *)(enc))->type[(unsigned char)*(p)])\r | |
244 | \r | |
245 | #ifdef XML_MIN_SIZE\r | |
246 | static int PTRFASTCALL\r | |
247 | sb_byteType(const ENCODING *enc, const char *p)\r | |
248 | {\r | |
249 | return SB_BYTE_TYPE(enc, p);\r | |
250 | }\r | |
251 | #define BYTE_TYPE(enc, p) \\r | |
252 | (AS_NORMAL_ENCODING(enc)->byteType(enc, p))\r | |
253 | #else\r | |
254 | #define BYTE_TYPE(enc, p) SB_BYTE_TYPE(enc, p)\r | |
255 | #endif\r | |
256 | \r | |
257 | #ifdef XML_MIN_SIZE\r | |
258 | #define BYTE_TO_ASCII(enc, p) \\r | |
259 | (AS_NORMAL_ENCODING(enc)->byteToAscii(enc, p))\r | |
260 | static int PTRFASTCALL\r | |
261 | sb_byteToAscii(const ENCODING *enc, const char *p)\r | |
262 | {\r | |
263 | return *p;\r | |
264 | }\r | |
265 | #else\r | |
266 | #define BYTE_TO_ASCII(enc, p) (*(p))\r | |
267 | #endif\r | |
268 | \r | |
269 | #define IS_NAME_CHAR(enc, p, n) \\r | |
270 | (AS_NORMAL_ENCODING(enc)->isName ## n(enc, p))\r | |
271 | #define IS_NMSTRT_CHAR(enc, p, n) \\r | |
272 | (AS_NORMAL_ENCODING(enc)->isNmstrt ## n(enc, p))\r | |
273 | #define IS_INVALID_CHAR(enc, p, n) \\r | |
274 | (AS_NORMAL_ENCODING(enc)->isInvalid ## n(enc, p))\r | |
275 | \r | |
276 | #ifdef XML_MIN_SIZE\r | |
277 | #define IS_NAME_CHAR_MINBPC(enc, p) \\r | |
278 | (AS_NORMAL_ENCODING(enc)->isNameMin(enc, p))\r | |
279 | #define IS_NMSTRT_CHAR_MINBPC(enc, p) \\r | |
280 | (AS_NORMAL_ENCODING(enc)->isNmstrtMin(enc, p))\r | |
281 | #else\r | |
282 | #define IS_NAME_CHAR_MINBPC(enc, p) (0)\r | |
283 | #define IS_NMSTRT_CHAR_MINBPC(enc, p) (0)\r | |
284 | #endif\r | |
285 | \r | |
286 | #ifdef XML_MIN_SIZE\r | |
287 | #define CHAR_MATCHES(enc, p, c) \\r | |
288 | (AS_NORMAL_ENCODING(enc)->charMatches(enc, p, c))\r | |
289 | static int PTRCALL\r | |
290 | sb_charMatches(const ENCODING *enc, const char *p, int c)\r | |
291 | {\r | |
292 | return *p == c;\r | |
293 | }\r | |
294 | #else\r | |
295 | /* c is an ASCII character */\r | |
296 | #define CHAR_MATCHES(enc, p, c) (*(p) == c)\r | |
297 | #endif\r | |
298 | \r | |
299 | #define PREFIX(ident) normal_ ## ident\r | |
300 | #define XML_TOK_IMPL_C\r | |
301 | #include "xmltok_impl.c"\r | |
302 | #undef XML_TOK_IMPL_C\r | |
303 | \r | |
304 | #undef MINBPC\r | |
305 | #undef BYTE_TYPE\r | |
306 | #undef BYTE_TO_ASCII\r | |
307 | #undef CHAR_MATCHES\r | |
308 | #undef IS_NAME_CHAR\r | |
309 | #undef IS_NAME_CHAR_MINBPC\r | |
310 | #undef IS_NMSTRT_CHAR\r | |
311 | #undef IS_NMSTRT_CHAR_MINBPC\r | |
312 | #undef IS_INVALID_CHAR\r | |
313 | \r | |
314 | enum { /* UTF8_cvalN is value of masked first byte of N byte sequence */\r | |
315 | UTF8_cval1 = 0x00,\r | |
316 | UTF8_cval2 = 0xc0,\r | |
317 | UTF8_cval3 = 0xe0,\r | |
318 | UTF8_cval4 = 0xf0\r | |
319 | };\r | |
320 | \r | |
321 | static void PTRCALL\r | |
322 | utf8_toUtf8(const ENCODING *enc,\r | |
323 | const char **fromP, const char *fromLim,\r | |
324 | char **toP, const char *toLim)\r | |
325 | {\r | |
326 | char *to;\r | |
327 | const char *from;\r | |
328 | if (fromLim - *fromP > toLim - *toP) {\r | |
329 | /* Avoid copying partial characters. */\r | |
330 | for (fromLim = *fromP + (toLim - *toP); fromLim > *fromP; fromLim--)\r | |
331 | if (((unsigned char)fromLim[-1] & 0xc0) != 0x80)\r | |
332 | break;\r | |
333 | }\r | |
334 | for (to = *toP, from = *fromP; from != fromLim; from++, to++)\r | |
335 | *to = *from;\r | |
336 | *fromP = from;\r | |
337 | *toP = to;\r | |
338 | }\r | |
339 | \r | |
340 | static void PTRCALL\r | |
341 | utf8_toUtf16(const ENCODING *enc,\r | |
342 | const char **fromP, const char *fromLim,\r | |
343 | unsigned short **toP, const unsigned short *toLim)\r | |
344 | {\r | |
345 | unsigned short *to = *toP;\r | |
346 | const char *from = *fromP;\r | |
347 | while (from != fromLim && to != toLim) {\r | |
348 | switch (((struct normal_encoding *)enc)->type[(unsigned char)*from]) {\r | |
349 | case BT_LEAD2:\r | |
350 | *to++ = (unsigned short)(((from[0] & 0x1f) << 6) | (from[1] & 0x3f));\r | |
351 | from += 2;\r | |
352 | break;\r | |
353 | case BT_LEAD3:\r | |
354 | *to++ = (unsigned short)(((from[0] & 0xf) << 12)\r | |
355 | | ((from[1] & 0x3f) << 6) | (from[2] & 0x3f));\r | |
356 | from += 3;\r | |
357 | break;\r | |
358 | case BT_LEAD4:\r | |
359 | {\r | |
360 | unsigned long n;\r | |
361 | if (to + 1 == toLim)\r | |
362 | goto after;\r | |
363 | n = ((from[0] & 0x7) << 18) | ((from[1] & 0x3f) << 12)\r | |
364 | | ((from[2] & 0x3f) << 6) | (from[3] & 0x3f);\r | |
365 | n -= 0x10000;\r | |
366 | to[0] = (unsigned short)((n >> 10) | 0xD800);\r | |
367 | to[1] = (unsigned short)((n & 0x3FF) | 0xDC00);\r | |
368 | to += 2;\r | |
369 | from += 4;\r | |
370 | }\r | |
371 | break;\r | |
372 | default:\r | |
373 | *to++ = *from++;\r | |
374 | break;\r | |
375 | }\r | |
376 | }\r | |
377 | after:\r | |
378 | *fromP = from;\r | |
379 | *toP = to;\r | |
380 | }\r | |
381 | \r | |
382 | #ifdef XML_NS\r | |
383 | static const struct normal_encoding utf8_encoding_ns = {\r | |
384 | { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 },\r | |
385 | {\r | |
386 | #include "asciitab.h"\r | |
387 | #include "utf8tab.h"\r | |
388 | },\r | |
389 | STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_)\r | |
390 | };\r | |
391 | #endif\r | |
392 | \r | |
393 | static const struct normal_encoding utf8_encoding = {\r | |
394 | { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 },\r | |
395 | {\r | |
396 | #define BT_COLON BT_NMSTRT\r | |
397 | #include "asciitab.h"\r | |
398 | #undef BT_COLON\r | |
399 | #include "utf8tab.h"\r | |
400 | },\r | |
401 | STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_)\r | |
402 | };\r | |
403 | \r | |
404 | #ifdef XML_NS\r | |
405 | \r | |
406 | static const struct normal_encoding internal_utf8_encoding_ns = {\r | |
407 | { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 },\r | |
408 | {\r | |
409 | #include "iasciitab.h"\r | |
410 | #include "utf8tab.h"\r | |
411 | },\r | |
412 | STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_)\r | |
413 | };\r | |
414 | \r | |
415 | #endif\r | |
416 | \r | |
417 | static const struct normal_encoding internal_utf8_encoding = {\r | |
418 | { VTABLE1, utf8_toUtf8, utf8_toUtf16, 1, 1, 0 },\r | |
419 | {\r | |
420 | #define BT_COLON BT_NMSTRT\r | |
421 | #include "iasciitab.h"\r | |
422 | #undef BT_COLON\r | |
423 | #include "utf8tab.h"\r | |
424 | },\r | |
425 | STANDARD_VTABLE(sb_) NORMAL_VTABLE(utf8_)\r | |
426 | };\r | |
427 | \r | |
428 | static void PTRCALL\r | |
429 | latin1_toUtf8(const ENCODING *enc,\r | |
430 | const char **fromP, const char *fromLim,\r | |
431 | char **toP, const char *toLim)\r | |
432 | {\r | |
433 | for (;;) {\r | |
434 | unsigned char c;\r | |
435 | if (*fromP == fromLim)\r | |
436 | break;\r | |
437 | c = (unsigned char)**fromP;\r | |
438 | if (c & 0x80) {\r | |
439 | if (toLim - *toP < 2)\r | |
440 | break;\r | |
441 | *(*toP)++ = (char)((c >> 6) | UTF8_cval2);\r | |
442 | *(*toP)++ = (char)((c & 0x3f) | 0x80);\r | |
443 | (*fromP)++;\r | |
444 | }\r | |
445 | else {\r | |
446 | if (*toP == toLim)\r | |
447 | break;\r | |
448 | *(*toP)++ = *(*fromP)++;\r | |
449 | }\r | |
450 | }\r | |
451 | }\r | |
452 | \r | |
453 | static void PTRCALL\r | |
454 | latin1_toUtf16(const ENCODING *enc,\r | |
455 | const char **fromP, const char *fromLim,\r | |
456 | unsigned short **toP, const unsigned short *toLim)\r | |
457 | {\r | |
458 | while (*fromP != fromLim && *toP != toLim)\r | |
459 | *(*toP)++ = (unsigned char)*(*fromP)++;\r | |
460 | }\r | |
461 | \r | |
462 | #ifdef XML_NS\r | |
463 | \r | |
464 | static const struct normal_encoding latin1_encoding_ns = {\r | |
465 | { VTABLE1, latin1_toUtf8, latin1_toUtf16, 1, 0, 0 },\r | |
466 | {\r | |
467 | #include "asciitab.h"\r | |
468 | #include "latin1tab.h"\r | |
469 | },\r | |
470 | STANDARD_VTABLE(sb_)\r | |
471 | };\r | |
472 | \r | |
473 | #endif\r | |
474 | \r | |
475 | static const struct normal_encoding latin1_encoding = {\r | |
476 | { VTABLE1, latin1_toUtf8, latin1_toUtf16, 1, 0, 0 },\r | |
477 | {\r | |
478 | #define BT_COLON BT_NMSTRT\r | |
479 | #include "asciitab.h"\r | |
480 | #undef BT_COLON\r | |
481 | #include "latin1tab.h"\r | |
482 | },\r | |
483 | STANDARD_VTABLE(sb_)\r | |
484 | };\r | |
485 | \r | |
486 | static void PTRCALL\r | |
487 | ascii_toUtf8(const ENCODING *enc,\r | |
488 | const char **fromP, const char *fromLim,\r | |
489 | char **toP, const char *toLim)\r | |
490 | {\r | |
491 | while (*fromP != fromLim && *toP != toLim)\r | |
492 | *(*toP)++ = *(*fromP)++;\r | |
493 | }\r | |
494 | \r | |
495 | #ifdef XML_NS\r | |
496 | \r | |
497 | static const struct normal_encoding ascii_encoding_ns = {\r | |
498 | { VTABLE1, ascii_toUtf8, latin1_toUtf16, 1, 1, 0 },\r | |
499 | {\r | |
500 | #include "asciitab.h"\r | |
501 | /* BT_NONXML == 0 */\r | |
502 | },\r | |
503 | STANDARD_VTABLE(sb_)\r | |
504 | };\r | |
505 | \r | |
506 | #endif\r | |
507 | \r | |
508 | static const struct normal_encoding ascii_encoding = {\r | |
509 | { VTABLE1, ascii_toUtf8, latin1_toUtf16, 1, 1, 0 },\r | |
510 | {\r | |
511 | #define BT_COLON BT_NMSTRT\r | |
512 | #include "asciitab.h"\r | |
513 | #undef BT_COLON\r | |
514 | /* BT_NONXML == 0 */\r | |
515 | },\r | |
516 | STANDARD_VTABLE(sb_)\r | |
517 | };\r | |
518 | \r | |
519 | static int PTRFASTCALL\r | |
520 | unicode_byte_type(char hi, char lo)\r | |
521 | {\r | |
522 | switch ((unsigned char)hi) {\r | |
523 | case 0xD8: case 0xD9: case 0xDA: case 0xDB:\r | |
524 | return BT_LEAD4;\r | |
525 | case 0xDC: case 0xDD: case 0xDE: case 0xDF:\r | |
526 | return BT_TRAIL;\r | |
527 | case 0xFF:\r | |
528 | switch ((unsigned char)lo) {\r | |
529 | case 0xFF:\r | |
530 | case 0xFE:\r | |
531 | return BT_NONXML;\r | |
532 | }\r | |
533 | break;\r | |
534 | }\r | |
535 | return BT_NONASCII;\r | |
536 | }\r | |
537 | \r | |
538 | #define DEFINE_UTF16_TO_UTF8(E) \\r | |
539 | static void PTRCALL \\r | |
540 | E ## toUtf8(const ENCODING *enc, \\r | |
541 | const char **fromP, const char *fromLim, \\r | |
542 | char **toP, const char *toLim) \\r | |
543 | { \\r | |
544 | const char *from; \\r | |
545 | for (from = *fromP; from != fromLim; from += 2) { \\r | |
546 | int plane; \\r | |
547 | unsigned char lo2; \\r | |
548 | unsigned char lo = GET_LO(from); \\r | |
549 | unsigned char hi = GET_HI(from); \\r | |
550 | switch (hi) { \\r | |
551 | case 0: \\r | |
552 | if (lo < 0x80) { \\r | |
553 | if (*toP == toLim) { \\r | |
554 | *fromP = from; \\r | |
555 | return; \\r | |
556 | } \\r | |
557 | *(*toP)++ = lo; \\r | |
558 | break; \\r | |
559 | } \\r | |
560 | /* fall through */ \\r | |
561 | case 0x1: case 0x2: case 0x3: \\r | |
562 | case 0x4: case 0x5: case 0x6: case 0x7: \\r | |
563 | if (toLim - *toP < 2) { \\r | |
564 | *fromP = from; \\r | |
565 | return; \\r | |
566 | } \\r | |
567 | *(*toP)++ = ((lo >> 6) | (hi << 2) | UTF8_cval2); \\r | |
568 | *(*toP)++ = ((lo & 0x3f) | 0x80); \\r | |
569 | break; \\r | |
570 | default: \\r | |
571 | if (toLim - *toP < 3) { \\r | |
572 | *fromP = from; \\r | |
573 | return; \\r | |
574 | } \\r | |
575 | /* 16 bits divided 4, 6, 6 amongst 3 bytes */ \\r | |
576 | *(*toP)++ = ((hi >> 4) | UTF8_cval3); \\r | |
577 | *(*toP)++ = (((hi & 0xf) << 2) | (lo >> 6) | 0x80); \\r | |
578 | *(*toP)++ = ((lo & 0x3f) | 0x80); \\r | |
579 | break; \\r | |
580 | case 0xD8: case 0xD9: case 0xDA: case 0xDB: \\r | |
581 | if (toLim - *toP < 4) { \\r | |
582 | *fromP = from; \\r | |
583 | return; \\r | |
584 | } \\r | |
585 | plane = (((hi & 0x3) << 2) | ((lo >> 6) & 0x3)) + 1; \\r | |
586 | *(*toP)++ = ((plane >> 2) | UTF8_cval4); \\r | |
587 | *(*toP)++ = (((lo >> 2) & 0xF) | ((plane & 0x3) << 4) | 0x80); \\r | |
588 | from += 2; \\r | |
589 | lo2 = GET_LO(from); \\r | |
590 | *(*toP)++ = (((lo & 0x3) << 4) \\r | |
591 | | ((GET_HI(from) & 0x3) << 2) \\r | |
592 | | (lo2 >> 6) \\r | |
593 | | 0x80); \\r | |
594 | *(*toP)++ = ((lo2 & 0x3f) | 0x80); \\r | |
595 | break; \\r | |
596 | } \\r | |
597 | } \\r | |
598 | *fromP = from; \\r | |
599 | }\r | |
600 | \r | |
601 | #define DEFINE_UTF16_TO_UTF16(E) \\r | |
602 | static void PTRCALL \\r | |
603 | E ## toUtf16(const ENCODING *enc, \\r | |
604 | const char **fromP, const char *fromLim, \\r | |
605 | unsigned short **toP, const unsigned short *toLim) \\r | |
606 | { \\r | |
607 | /* Avoid copying first half only of surrogate */ \\r | |
608 | if (fromLim - *fromP > ((toLim - *toP) << 1) \\r | |
609 | && (GET_HI(fromLim - 2) & 0xF8) == 0xD8) \\r | |
610 | fromLim -= 2; \\r | |
611 | for (; *fromP != fromLim && *toP != toLim; *fromP += 2) \\r | |
612 | *(*toP)++ = (GET_HI(*fromP) << 8) | GET_LO(*fromP); \\r | |
613 | }\r | |
614 | \r | |
615 | #define SET2(ptr, ch) \\r | |
616 | (((ptr)[0] = ((ch) & 0xff)), ((ptr)[1] = ((ch) >> 8)))\r | |
617 | #define GET_LO(ptr) ((unsigned char)(ptr)[0])\r | |
618 | #define GET_HI(ptr) ((unsigned char)(ptr)[1])\r | |
619 | \r | |
620 | DEFINE_UTF16_TO_UTF8(little2_)\r | |
621 | DEFINE_UTF16_TO_UTF16(little2_)\r | |
622 | \r | |
623 | #undef SET2\r | |
624 | #undef GET_LO\r | |
625 | #undef GET_HI\r | |
626 | \r | |
627 | #define SET2(ptr, ch) \\r | |
628 | (((ptr)[0] = ((ch) >> 8)), ((ptr)[1] = ((ch) & 0xFF)))\r | |
629 | #define GET_LO(ptr) ((unsigned char)(ptr)[1])\r | |
630 | #define GET_HI(ptr) ((unsigned char)(ptr)[0])\r | |
631 | \r | |
632 | DEFINE_UTF16_TO_UTF8(big2_)\r | |
633 | DEFINE_UTF16_TO_UTF16(big2_)\r | |
634 | \r | |
635 | #undef SET2\r | |
636 | #undef GET_LO\r | |
637 | #undef GET_HI\r | |
638 | \r | |
639 | #define LITTLE2_BYTE_TYPE(enc, p) \\r | |
640 | ((p)[1] == 0 \\r | |
641 | ? ((struct normal_encoding *)(enc))->type[(unsigned char)*(p)] \\r | |
642 | : unicode_byte_type((p)[1], (p)[0]))\r | |
643 | #define LITTLE2_BYTE_TO_ASCII(enc, p) ((p)[1] == 0 ? (p)[0] : -1)\r | |
644 | #define LITTLE2_CHAR_MATCHES(enc, p, c) ((p)[1] == 0 && (p)[0] == c)\r | |
645 | #define LITTLE2_IS_NAME_CHAR_MINBPC(enc, p) \\r | |
646 | UCS2_GET_NAMING(namePages, (unsigned char)p[1], (unsigned char)p[0])\r | |
647 | #define LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p) \\r | |
648 | UCS2_GET_NAMING(nmstrtPages, (unsigned char)p[1], (unsigned char)p[0])\r | |
649 | \r | |
650 | #ifdef XML_MIN_SIZE\r | |
651 | \r | |
652 | static int PTRFASTCALL\r | |
653 | little2_byteType(const ENCODING *enc, const char *p)\r | |
654 | {\r | |
655 | return LITTLE2_BYTE_TYPE(enc, p);\r | |
656 | }\r | |
657 | \r | |
658 | static int PTRFASTCALL\r | |
659 | little2_byteToAscii(const ENCODING *enc, const char *p)\r | |
660 | {\r | |
661 | return LITTLE2_BYTE_TO_ASCII(enc, p);\r | |
662 | }\r | |
663 | \r | |
664 | static int PTRCALL\r | |
665 | little2_charMatches(const ENCODING *enc, const char *p, int c)\r | |
666 | {\r | |
667 | return LITTLE2_CHAR_MATCHES(enc, p, c);\r | |
668 | }\r | |
669 | \r | |
670 | static int PTRFASTCALL\r | |
671 | little2_isNameMin(const ENCODING *enc, const char *p)\r | |
672 | {\r | |
673 | return LITTLE2_IS_NAME_CHAR_MINBPC(enc, p);\r | |
674 | }\r | |
675 | \r | |
676 | static int PTRFASTCALL\r | |
677 | little2_isNmstrtMin(const ENCODING *enc, const char *p)\r | |
678 | {\r | |
679 | return LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p);\r | |
680 | }\r | |
681 | \r | |
682 | #undef VTABLE\r | |
683 | #define VTABLE VTABLE1, little2_toUtf8, little2_toUtf16\r | |
684 | \r | |
685 | #else /* not XML_MIN_SIZE */\r | |
686 | \r | |
687 | #undef PREFIX\r | |
688 | #define PREFIX(ident) little2_ ## ident\r | |
689 | #define MINBPC(enc) 2\r | |
690 | /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */\r | |
691 | #define BYTE_TYPE(enc, p) LITTLE2_BYTE_TYPE(enc, p)\r | |
692 | #define BYTE_TO_ASCII(enc, p) LITTLE2_BYTE_TO_ASCII(enc, p)\r | |
693 | #define CHAR_MATCHES(enc, p, c) LITTLE2_CHAR_MATCHES(enc, p, c)\r | |
694 | #define IS_NAME_CHAR(enc, p, n) 0\r | |
695 | #define IS_NAME_CHAR_MINBPC(enc, p) LITTLE2_IS_NAME_CHAR_MINBPC(enc, p)\r | |
696 | #define IS_NMSTRT_CHAR(enc, p, n) (0)\r | |
697 | #define IS_NMSTRT_CHAR_MINBPC(enc, p) LITTLE2_IS_NMSTRT_CHAR_MINBPC(enc, p)\r | |
698 | \r | |
699 | #define XML_TOK_IMPL_C\r | |
700 | #include "xmltok_impl.c"\r | |
701 | #undef XML_TOK_IMPL_C\r | |
702 | \r | |
703 | #undef MINBPC\r | |
704 | #undef BYTE_TYPE\r | |
705 | #undef BYTE_TO_ASCII\r | |
706 | #undef CHAR_MATCHES\r | |
707 | #undef IS_NAME_CHAR\r | |
708 | #undef IS_NAME_CHAR_MINBPC\r | |
709 | #undef IS_NMSTRT_CHAR\r | |
710 | #undef IS_NMSTRT_CHAR_MINBPC\r | |
711 | #undef IS_INVALID_CHAR\r | |
712 | \r | |
713 | #endif /* not XML_MIN_SIZE */\r | |
714 | \r | |
715 | #ifdef XML_NS\r | |
716 | \r | |
717 | static const struct normal_encoding little2_encoding_ns = {\r | |
718 | { VTABLE, 2, 0,\r | |
719 | #if BYTEORDER == 1234\r | |
720 | 1\r | |
721 | #else\r | |
722 | 0\r | |
723 | #endif\r | |
724 | },\r | |
725 | {\r | |
726 | #include "asciitab.h"\r | |
727 | #include "latin1tab.h"\r | |
728 | },\r | |
729 | STANDARD_VTABLE(little2_)\r | |
730 | };\r | |
731 | \r | |
732 | #endif\r | |
733 | \r | |
734 | static const struct normal_encoding little2_encoding = {\r | |
735 | { VTABLE, 2, 0,\r | |
736 | #if BYTEORDER == 1234\r | |
737 | 1\r | |
738 | #else\r | |
739 | 0\r | |
740 | #endif\r | |
741 | },\r | |
742 | {\r | |
743 | #define BT_COLON BT_NMSTRT\r | |
744 | #include "asciitab.h"\r | |
745 | #undef BT_COLON\r | |
746 | #include "latin1tab.h"\r | |
747 | },\r | |
748 | STANDARD_VTABLE(little2_)\r | |
749 | };\r | |
750 | \r | |
751 | #if BYTEORDER != 4321\r | |
752 | \r | |
753 | #ifdef XML_NS\r | |
754 | \r | |
755 | static const struct normal_encoding internal_little2_encoding_ns = {\r | |
756 | { VTABLE, 2, 0, 1 },\r | |
757 | {\r | |
758 | #include "iasciitab.h"\r | |
759 | #include "latin1tab.h"\r | |
760 | },\r | |
761 | STANDARD_VTABLE(little2_)\r | |
762 | };\r | |
763 | \r | |
764 | #endif\r | |
765 | \r | |
766 | static const struct normal_encoding internal_little2_encoding = {\r | |
767 | { VTABLE, 2, 0, 1 },\r | |
768 | {\r | |
769 | #define BT_COLON BT_NMSTRT\r | |
770 | #include "iasciitab.h"\r | |
771 | #undef BT_COLON\r | |
772 | #include "latin1tab.h"\r | |
773 | },\r | |
774 | STANDARD_VTABLE(little2_)\r | |
775 | };\r | |
776 | \r | |
777 | #endif\r | |
778 | \r | |
779 | \r | |
780 | #define BIG2_BYTE_TYPE(enc, p) \\r | |
781 | ((p)[0] == 0 \\r | |
782 | ? ((struct normal_encoding *)(enc))->type[(unsigned char)(p)[1]] \\r | |
783 | : unicode_byte_type((p)[0], (p)[1]))\r | |
784 | #define BIG2_BYTE_TO_ASCII(enc, p) ((p)[0] == 0 ? (p)[1] : -1)\r | |
785 | #define BIG2_CHAR_MATCHES(enc, p, c) ((p)[0] == 0 && (p)[1] == c)\r | |
786 | #define BIG2_IS_NAME_CHAR_MINBPC(enc, p) \\r | |
787 | UCS2_GET_NAMING(namePages, (unsigned char)p[0], (unsigned char)p[1])\r | |
788 | #define BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p) \\r | |
789 | UCS2_GET_NAMING(nmstrtPages, (unsigned char)p[0], (unsigned char)p[1])\r | |
790 | \r | |
791 | #ifdef XML_MIN_SIZE\r | |
792 | \r | |
793 | static int PTRFASTCALL\r | |
794 | big2_byteType(const ENCODING *enc, const char *p)\r | |
795 | {\r | |
796 | return BIG2_BYTE_TYPE(enc, p);\r | |
797 | }\r | |
798 | \r | |
799 | static int PTRFASTCALL\r | |
800 | big2_byteToAscii(const ENCODING *enc, const char *p)\r | |
801 | {\r | |
802 | return BIG2_BYTE_TO_ASCII(enc, p);\r | |
803 | }\r | |
804 | \r | |
805 | static int PTRCALL\r | |
806 | big2_charMatches(const ENCODING *enc, const char *p, int c)\r | |
807 | {\r | |
808 | return BIG2_CHAR_MATCHES(enc, p, c);\r | |
809 | }\r | |
810 | \r | |
811 | static int PTRFASTCALL\r | |
812 | big2_isNameMin(const ENCODING *enc, const char *p)\r | |
813 | {\r | |
814 | return BIG2_IS_NAME_CHAR_MINBPC(enc, p);\r | |
815 | }\r | |
816 | \r | |
817 | static int PTRFASTCALL\r | |
818 | big2_isNmstrtMin(const ENCODING *enc, const char *p)\r | |
819 | {\r | |
820 | return BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p);\r | |
821 | }\r | |
822 | \r | |
823 | #undef VTABLE\r | |
824 | #define VTABLE VTABLE1, big2_toUtf8, big2_toUtf16\r | |
825 | \r | |
826 | #else /* not XML_MIN_SIZE */\r | |
827 | \r | |
828 | #undef PREFIX\r | |
829 | #define PREFIX(ident) big2_ ## ident\r | |
830 | #define MINBPC(enc) 2\r | |
831 | /* CHAR_MATCHES is guaranteed to have MINBPC bytes available. */\r | |
832 | #define BYTE_TYPE(enc, p) BIG2_BYTE_TYPE(enc, p)\r | |
833 | #define BYTE_TO_ASCII(enc, p) BIG2_BYTE_TO_ASCII(enc, p)\r | |
834 | #define CHAR_MATCHES(enc, p, c) BIG2_CHAR_MATCHES(enc, p, c)\r | |
835 | #define IS_NAME_CHAR(enc, p, n) 0\r | |
836 | #define IS_NAME_CHAR_MINBPC(enc, p) BIG2_IS_NAME_CHAR_MINBPC(enc, p)\r | |
837 | #define IS_NMSTRT_CHAR(enc, p, n) (0)\r | |
838 | #define IS_NMSTRT_CHAR_MINBPC(enc, p) BIG2_IS_NMSTRT_CHAR_MINBPC(enc, p)\r | |
839 | \r | |
840 | #define XML_TOK_IMPL_C\r | |
841 | #include "xmltok_impl.c"\r | |
842 | #undef XML_TOK_IMPL_C\r | |
843 | \r | |
844 | #undef MINBPC\r | |
845 | #undef BYTE_TYPE\r | |
846 | #undef BYTE_TO_ASCII\r | |
847 | #undef CHAR_MATCHES\r | |
848 | #undef IS_NAME_CHAR\r | |
849 | #undef IS_NAME_CHAR_MINBPC\r | |
850 | #undef IS_NMSTRT_CHAR\r | |
851 | #undef IS_NMSTRT_CHAR_MINBPC\r | |
852 | #undef IS_INVALID_CHAR\r | |
853 | \r | |
854 | #endif /* not XML_MIN_SIZE */\r | |
855 | \r | |
856 | #ifdef XML_NS\r | |
857 | \r | |
858 | static const struct normal_encoding big2_encoding_ns = {\r | |
859 | { VTABLE, 2, 0,\r | |
860 | #if BYTEORDER == 4321\r | |
861 | 1\r | |
862 | #else\r | |
863 | 0\r | |
864 | #endif\r | |
865 | },\r | |
866 | {\r | |
867 | #include "asciitab.h"\r | |
868 | #include "latin1tab.h"\r | |
869 | },\r | |
870 | STANDARD_VTABLE(big2_)\r | |
871 | };\r | |
872 | \r | |
873 | #endif\r | |
874 | \r | |
875 | static const struct normal_encoding big2_encoding = {\r | |
876 | { VTABLE, 2, 0,\r | |
877 | #if BYTEORDER == 4321\r | |
878 | 1\r | |
879 | #else\r | |
880 | 0\r | |
881 | #endif\r | |
882 | },\r | |
883 | {\r | |
884 | #define BT_COLON BT_NMSTRT\r | |
885 | #include "asciitab.h"\r | |
886 | #undef BT_COLON\r | |
887 | #include "latin1tab.h"\r | |
888 | },\r | |
889 | STANDARD_VTABLE(big2_)\r | |
890 | };\r | |
891 | \r | |
892 | #if BYTEORDER != 1234\r | |
893 | \r | |
894 | #ifdef XML_NS\r | |
895 | \r | |
896 | static const struct normal_encoding internal_big2_encoding_ns = {\r | |
897 | { VTABLE, 2, 0, 1 },\r | |
898 | {\r | |
899 | #include "iasciitab.h"\r | |
900 | #include "latin1tab.h"\r | |
901 | },\r | |
902 | STANDARD_VTABLE(big2_)\r | |
903 | };\r | |
904 | \r | |
905 | #endif\r | |
906 | \r | |
907 | static const struct normal_encoding internal_big2_encoding = {\r | |
908 | { VTABLE, 2, 0, 1 },\r | |
909 | {\r | |
910 | #define BT_COLON BT_NMSTRT\r | |
911 | #include "iasciitab.h"\r | |
912 | #undef BT_COLON\r | |
913 | #include "latin1tab.h"\r | |
914 | },\r | |
915 | STANDARD_VTABLE(big2_)\r | |
916 | };\r | |
917 | \r | |
918 | #endif\r | |
919 | \r | |
920 | #undef PREFIX\r | |
921 | \r | |
922 | static int FASTCALL\r | |
923 | streqci(const char *s1, const char *s2)\r | |
924 | {\r | |
925 | for (;;) {\r | |
926 | char c1 = *s1++;\r | |
927 | char c2 = *s2++;\r | |
928 | if (ASCII_a <= c1 && c1 <= ASCII_z)\r | |
929 | c1 += ASCII_A - ASCII_a;\r | |
930 | if (ASCII_a <= c2 && c2 <= ASCII_z)\r | |
931 | c2 += ASCII_A - ASCII_a;\r | |
932 | if (c1 != c2)\r | |
933 | return 0;\r | |
934 | if (!c1)\r | |
935 | break;\r | |
936 | }\r | |
937 | return 1;\r | |
938 | }\r | |
939 | \r | |
940 | static void PTRCALL\r | |
941 | initUpdatePosition(const ENCODING *enc, const char *ptr,\r | |
942 | const char *end, POSITION *pos)\r | |
943 | {\r | |
944 | normal_updatePosition(&utf8_encoding.enc, ptr, end, pos);\r | |
945 | }\r | |
946 | \r | |
947 | static int\r | |
948 | toAscii(const ENCODING *enc, const char *ptr, const char *end)\r | |
949 | {\r | |
950 | char buf[1];\r | |
951 | char *p = buf;\r | |
952 | XmlUtf8Convert(enc, &ptr, end, &p, p + 1);\r | |
953 | if (p == buf)\r | |
954 | return -1;\r | |
955 | else\r | |
956 | return buf[0];\r | |
957 | }\r | |
958 | \r | |
959 | static int FASTCALL\r | |
960 | isSpace(int c)\r | |
961 | {\r | |
962 | switch (c) {\r | |
963 | case 0x20:\r | |
964 | case 0xD:\r | |
965 | case 0xA:\r | |
966 | case 0x9:\r | |
967 | return 1;\r | |
968 | }\r | |
969 | return 0;\r | |
970 | }\r | |
971 | \r | |
972 | /* Return 1 if there's just optional white space or there's an S\r | |
973 | followed by name=val.\r | |
974 | */\r | |
975 | static int\r | |
976 | parsePseudoAttribute(const ENCODING *enc,\r | |
977 | const char *ptr,\r | |
978 | const char *end,\r | |
979 | const char **namePtr,\r | |
980 | const char **nameEndPtr,\r | |
981 | const char **valPtr,\r | |
982 | const char **nextTokPtr)\r | |
983 | {\r | |
984 | int c;\r | |
985 | char open;\r | |
986 | if (ptr == end) {\r | |
987 | *namePtr = NULL;\r | |
988 | return 1;\r | |
989 | }\r | |
990 | if (!isSpace(toAscii(enc, ptr, end))) {\r | |
991 | *nextTokPtr = ptr;\r | |
992 | return 0;\r | |
993 | }\r | |
994 | do {\r | |
995 | ptr += enc->minBytesPerChar;\r | |
996 | } while (isSpace(toAscii(enc, ptr, end)));\r | |
997 | if (ptr == end) {\r | |
998 | *namePtr = NULL;\r | |
999 | return 1;\r | |
1000 | }\r | |
1001 | *namePtr = ptr;\r | |
1002 | for (;;) {\r | |
1003 | c = toAscii(enc, ptr, end);\r | |
1004 | if (c == -1) {\r | |
1005 | *nextTokPtr = ptr;\r | |
1006 | return 0;\r | |
1007 | }\r | |
1008 | if (c == ASCII_EQUALS) {\r | |
1009 | *nameEndPtr = ptr;\r | |
1010 | break;\r | |
1011 | }\r | |
1012 | if (isSpace(c)) {\r | |
1013 | *nameEndPtr = ptr;\r | |
1014 | do {\r | |
1015 | ptr += enc->minBytesPerChar;\r | |
1016 | } while (isSpace(c = toAscii(enc, ptr, end)));\r | |
1017 | if (c != ASCII_EQUALS) {\r | |
1018 | *nextTokPtr = ptr;\r | |
1019 | return 0;\r | |
1020 | }\r | |
1021 | break;\r | |
1022 | }\r | |
1023 | ptr += enc->minBytesPerChar;\r | |
1024 | }\r | |
1025 | if (ptr == *namePtr) {\r | |
1026 | *nextTokPtr = ptr;\r | |
1027 | return 0;\r | |
1028 | }\r | |
1029 | ptr += enc->minBytesPerChar;\r | |
1030 | c = toAscii(enc, ptr, end);\r | |
1031 | while (isSpace(c)) {\r | |
1032 | ptr += enc->minBytesPerChar;\r | |
1033 | c = toAscii(enc, ptr, end);\r | |
1034 | }\r | |
1035 | if (c != ASCII_QUOT && c != ASCII_APOS) {\r | |
1036 | *nextTokPtr = ptr;\r | |
1037 | return 0;\r | |
1038 | }\r | |
1039 | open = (char)c;\r | |
1040 | ptr += enc->minBytesPerChar;\r | |
1041 | *valPtr = ptr;\r | |
1042 | for (;; ptr += enc->minBytesPerChar) {\r | |
1043 | c = toAscii(enc, ptr, end);\r | |
1044 | if (c == open)\r | |
1045 | break;\r | |
1046 | if (!(ASCII_a <= c && c <= ASCII_z)\r | |
1047 | && !(ASCII_A <= c && c <= ASCII_Z)\r | |
1048 | && !(ASCII_0 <= c && c <= ASCII_9)\r | |
1049 | && c != ASCII_PERIOD\r | |
1050 | && c != ASCII_MINUS\r | |
1051 | && c != ASCII_UNDERSCORE) {\r | |
1052 | *nextTokPtr = ptr;\r | |
1053 | return 0;\r | |
1054 | }\r | |
1055 | }\r | |
1056 | *nextTokPtr = ptr + enc->minBytesPerChar;\r | |
1057 | return 1;\r | |
1058 | }\r | |
1059 | \r | |
1060 | static const char KW_version[] = {\r | |
1061 | ASCII_v, ASCII_e, ASCII_r, ASCII_s, ASCII_i, ASCII_o, ASCII_n, '\0'\r | |
1062 | };\r | |
1063 | \r | |
1064 | static const char KW_encoding[] = {\r | |
1065 | ASCII_e, ASCII_n, ASCII_c, ASCII_o, ASCII_d, ASCII_i, ASCII_n, ASCII_g, '\0'\r | |
1066 | };\r | |
1067 | \r | |
1068 | static const char KW_standalone[] = {\r | |
1069 | ASCII_s, ASCII_t, ASCII_a, ASCII_n, ASCII_d, ASCII_a, ASCII_l, ASCII_o,\r | |
1070 | ASCII_n, ASCII_e, '\0'\r | |
1071 | };\r | |
1072 | \r | |
1073 | static const char KW_yes[] = {\r | |
1074 | ASCII_y, ASCII_e, ASCII_s, '\0'\r | |
1075 | };\r | |
1076 | \r | |
1077 | static const char KW_no[] = {\r | |
1078 | ASCII_n, ASCII_o, '\0'\r | |
1079 | };\r | |
1080 | \r | |
1081 | static int\r | |
1082 | doParseXmlDecl(const ENCODING *(*encodingFinder)(const ENCODING *,\r | |
1083 | const char *,\r | |
1084 | const char *),\r | |
1085 | int isGeneralTextEntity,\r | |
1086 | const ENCODING *enc,\r | |
1087 | const char *ptr,\r | |
1088 | const char *end,\r | |
1089 | const char **badPtr,\r | |
1090 | const char **versionPtr,\r | |
1091 | const char **versionEndPtr,\r | |
1092 | const char **encodingName,\r | |
1093 | const ENCODING **encoding,\r | |
1094 | int *standalone)\r | |
1095 | {\r | |
1096 | const char *val = NULL;\r | |
1097 | const char *name = NULL;\r | |
1098 | const char *nameEnd = NULL;\r | |
1099 | ptr += 5 * enc->minBytesPerChar;\r | |
1100 | end -= 2 * enc->minBytesPerChar;\r | |
1101 | if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr)\r | |
1102 | || !name) {\r | |
1103 | *badPtr = ptr;\r | |
1104 | return 0;\r | |
1105 | }\r | |
1106 | if (!XmlNameMatchesAscii(enc, name, nameEnd, KW_version)) {\r | |
1107 | if (!isGeneralTextEntity) {\r | |
1108 | *badPtr = name;\r | |
1109 | return 0;\r | |
1110 | }\r | |
1111 | }\r | |
1112 | else {\r | |
1113 | if (versionPtr)\r | |
1114 | *versionPtr = val;\r | |
1115 | if (versionEndPtr)\r | |
1116 | *versionEndPtr = ptr;\r | |
1117 | if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr)) {\r | |
1118 | *badPtr = ptr;\r | |
1119 | return 0;\r | |
1120 | }\r | |
1121 | if (!name) {\r | |
1122 | if (isGeneralTextEntity) {\r | |
1123 | /* a TextDecl must have an EncodingDecl */\r | |
1124 | *badPtr = ptr;\r | |
1125 | return 0;\r | |
1126 | }\r | |
1127 | return 1;\r | |
1128 | }\r | |
1129 | }\r | |
1130 | if (XmlNameMatchesAscii(enc, name, nameEnd, KW_encoding)) {\r | |
1131 | int c = toAscii(enc, val, end);\r | |
1132 | if (!(ASCII_a <= c && c <= ASCII_z) && !(ASCII_A <= c && c <= ASCII_Z)) {\r | |
1133 | *badPtr = val;\r | |
1134 | return 0;\r | |
1135 | }\r | |
1136 | if (encodingName)\r | |
1137 | *encodingName = val;\r | |
1138 | if (encoding)\r | |
1139 | *encoding = encodingFinder(enc, val, ptr - enc->minBytesPerChar);\r | |
1140 | if (!parsePseudoAttribute(enc, ptr, end, &name, &nameEnd, &val, &ptr)) {\r | |
1141 | *badPtr = ptr;\r | |
1142 | return 0;\r | |
1143 | }\r | |
1144 | if (!name)\r | |
1145 | return 1;\r | |
1146 | }\r | |
1147 | if (!XmlNameMatchesAscii(enc, name, nameEnd, KW_standalone)\r | |
1148 | || isGeneralTextEntity) {\r | |
1149 | *badPtr = name;\r | |
1150 | return 0;\r | |
1151 | }\r | |
1152 | if (XmlNameMatchesAscii(enc, val, ptr - enc->minBytesPerChar, KW_yes)) {\r | |
1153 | if (standalone)\r | |
1154 | *standalone = 1;\r | |
1155 | }\r | |
1156 | else if (XmlNameMatchesAscii(enc, val, ptr - enc->minBytesPerChar, KW_no)) {\r | |
1157 | if (standalone)\r | |
1158 | *standalone = 0;\r | |
1159 | }\r | |
1160 | else {\r | |
1161 | *badPtr = val;\r | |
1162 | return 0;\r | |
1163 | }\r | |
1164 | while (isSpace(toAscii(enc, ptr, end)))\r | |
1165 | ptr += enc->minBytesPerChar;\r | |
1166 | if (ptr != end) {\r | |
1167 | *badPtr = ptr;\r | |
1168 | return 0;\r | |
1169 | }\r | |
1170 | return 1;\r | |
1171 | }\r | |
1172 | \r | |
1173 | static int FASTCALL\r | |
1174 | checkCharRefNumber(int result)\r | |
1175 | {\r | |
1176 | switch (result >> 8) {\r | |
1177 | case 0xD8: case 0xD9: case 0xDA: case 0xDB:\r | |
1178 | case 0xDC: case 0xDD: case 0xDE: case 0xDF:\r | |
1179 | return -1;\r | |
1180 | case 0:\r | |
1181 | if (latin1_encoding.type[result] == BT_NONXML)\r | |
1182 | return -1;\r | |
1183 | break;\r | |
1184 | case 0xFF:\r | |
1185 | if (result == 0xFFFE || result == 0xFFFF)\r | |
1186 | return -1;\r | |
1187 | break;\r | |
1188 | }\r | |
1189 | return result;\r | |
1190 | }\r | |
1191 | \r | |
1192 | int FASTCALL\r | |
1193 | XmlUtf8Encode(int c, char *buf)\r | |
1194 | {\r | |
1195 | enum {\r | |
1196 | /* minN is minimum legal resulting value for N byte sequence */\r | |
1197 | min2 = 0x80,\r | |
1198 | min3 = 0x800,\r | |
1199 | min4 = 0x10000\r | |
1200 | };\r | |
1201 | \r | |
1202 | if (c < 0)\r | |
1203 | return 0;\r | |
1204 | if (c < min2) {\r | |
1205 | buf[0] = (char)(c | UTF8_cval1);\r | |
1206 | return 1;\r | |
1207 | }\r | |
1208 | if (c < min3) {\r | |
1209 | buf[0] = (char)((c >> 6) | UTF8_cval2);\r | |
1210 | buf[1] = (char)((c & 0x3f) | 0x80);\r | |
1211 | return 2;\r | |
1212 | }\r | |
1213 | if (c < min4) {\r | |
1214 | buf[0] = (char)((c >> 12) | UTF8_cval3);\r | |
1215 | buf[1] = (char)(((c >> 6) & 0x3f) | 0x80);\r | |
1216 | buf[2] = (char)((c & 0x3f) | 0x80);\r | |
1217 | return 3;\r | |
1218 | }\r | |
1219 | if (c < 0x110000) {\r | |
1220 | buf[0] = (char)((c >> 18) | UTF8_cval4);\r | |
1221 | buf[1] = (char)(((c >> 12) & 0x3f) | 0x80);\r | |
1222 | buf[2] = (char)(((c >> 6) & 0x3f) | 0x80);\r | |
1223 | buf[3] = (char)((c & 0x3f) | 0x80);\r | |
1224 | return 4;\r | |
1225 | }\r | |
1226 | return 0;\r | |
1227 | }\r | |
1228 | \r | |
1229 | int FASTCALL\r | |
1230 | XmlUtf16Encode(int charNum, unsigned short *buf)\r | |
1231 | {\r | |
1232 | if (charNum < 0)\r | |
1233 | return 0;\r | |
1234 | if (charNum < 0x10000) {\r | |
1235 | buf[0] = (unsigned short)charNum;\r | |
1236 | return 1;\r | |
1237 | }\r | |
1238 | if (charNum < 0x110000) {\r | |
1239 | charNum -= 0x10000;\r | |
1240 | buf[0] = (unsigned short)((charNum >> 10) + 0xD800);\r | |
1241 | buf[1] = (unsigned short)((charNum & 0x3FF) + 0xDC00);\r | |
1242 | return 2;\r | |
1243 | }\r | |
1244 | return 0;\r | |
1245 | }\r | |
1246 | \r | |
1247 | struct unknown_encoding {\r | |
1248 | struct normal_encoding normal;\r | |
1249 | CONVERTER convert;\r | |
1250 | void *userData;\r | |
1251 | unsigned short utf16[256];\r | |
1252 | char utf8[256][4];\r | |
1253 | };\r | |
1254 | \r | |
1255 | #define AS_UNKNOWN_ENCODING(enc) ((const struct unknown_encoding *) (enc))\r | |
1256 | \r | |
1257 | int\r | |
1258 | XmlSizeOfUnknownEncoding(void)\r | |
1259 | {\r | |
1260 | return sizeof(struct unknown_encoding);\r | |
1261 | }\r | |
1262 | \r | |
1263 | static int PTRFASTCALL\r | |
1264 | unknown_isName(const ENCODING *enc, const char *p)\r | |
1265 | {\r | |
1266 | const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc);\r | |
1267 | int c = uenc->convert(uenc->userData, p);\r | |
1268 | if (c & ~0xFFFF)\r | |
1269 | return 0;\r | |
1270 | return UCS2_GET_NAMING(namePages, c >> 8, c & 0xFF);\r | |
1271 | }\r | |
1272 | \r | |
1273 | static int PTRFASTCALL\r | |
1274 | unknown_isNmstrt(const ENCODING *enc, const char *p)\r | |
1275 | {\r | |
1276 | const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc);\r | |
1277 | int c = uenc->convert(uenc->userData, p);\r | |
1278 | if (c & ~0xFFFF)\r | |
1279 | return 0;\r | |
1280 | return UCS2_GET_NAMING(nmstrtPages, c >> 8, c & 0xFF);\r | |
1281 | }\r | |
1282 | \r | |
1283 | static int PTRFASTCALL\r | |
1284 | unknown_isInvalid(const ENCODING *enc, const char *p)\r | |
1285 | {\r | |
1286 | const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc);\r | |
1287 | int c = uenc->convert(uenc->userData, p);\r | |
1288 | return (c & ~0xFFFF) || checkCharRefNumber(c) < 0;\r | |
1289 | }\r | |
1290 | \r | |
1291 | static void PTRCALL\r | |
1292 | unknown_toUtf8(const ENCODING *enc,\r | |
1293 | const char **fromP, const char *fromLim,\r | |
1294 | char **toP, const char *toLim)\r | |
1295 | {\r | |
1296 | const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc);\r | |
1297 | char buf[XML_UTF8_ENCODE_MAX];\r | |
1298 | for (;;) {\r | |
1299 | const char *utf8;\r | |
1300 | int n;\r | |
1301 | if (*fromP == fromLim)\r | |
1302 | break;\r | |
1303 | utf8 = uenc->utf8[(unsigned char)**fromP];\r | |
1304 | n = *utf8++;\r | |
1305 | if (n == 0) {\r | |
1306 | int c = uenc->convert(uenc->userData, *fromP);\r | |
1307 | n = XmlUtf8Encode(c, buf);\r | |
1308 | if (n > toLim - *toP)\r | |
1309 | break;\r | |
1310 | utf8 = buf;\r | |
1311 | *fromP += (AS_NORMAL_ENCODING(enc)->type[(unsigned char)**fromP]\r | |
1312 | - (BT_LEAD2 - 2));\r | |
1313 | }\r | |
1314 | else {\r | |
1315 | if (n > toLim - *toP)\r | |
1316 | break;\r | |
1317 | (*fromP)++;\r | |
1318 | }\r | |
1319 | do {\r | |
1320 | *(*toP)++ = *utf8++;\r | |
1321 | } while (--n != 0);\r | |
1322 | }\r | |
1323 | }\r | |
1324 | \r | |
1325 | static void PTRCALL\r | |
1326 | unknown_toUtf16(const ENCODING *enc,\r | |
1327 | const char **fromP, const char *fromLim,\r | |
1328 | unsigned short **toP, const unsigned short *toLim)\r | |
1329 | {\r | |
1330 | const struct unknown_encoding *uenc = AS_UNKNOWN_ENCODING(enc);\r | |
1331 | while (*fromP != fromLim && *toP != toLim) {\r | |
1332 | unsigned short c = uenc->utf16[(unsigned char)**fromP];\r | |
1333 | if (c == 0) {\r | |
1334 | c = (unsigned short)\r | |
1335 | uenc->convert(uenc->userData, *fromP);\r | |
1336 | *fromP += (AS_NORMAL_ENCODING(enc)->type[(unsigned char)**fromP]\r | |
1337 | - (BT_LEAD2 - 2));\r | |
1338 | }\r | |
1339 | else\r | |
1340 | (*fromP)++;\r | |
1341 | *(*toP)++ = c;\r | |
1342 | }\r | |
1343 | }\r | |
1344 | \r | |
1345 | ENCODING *\r | |
1346 | XmlInitUnknownEncoding(void *mem,\r | |
1347 | int *table,\r | |
1348 | CONVERTER convert,\r | |
1349 | void *userData)\r | |
1350 | {\r | |
1351 | int i;\r | |
1352 | struct unknown_encoding *e = (struct unknown_encoding *)mem;\r | |
1353 | for (i = 0; i < (int)sizeof(struct normal_encoding); i++)\r | |
1354 | ((char *)mem)[i] = ((char *)&latin1_encoding)[i];\r | |
1355 | for (i = 0; i < 128; i++)\r | |
1356 | if (latin1_encoding.type[i] != BT_OTHER\r | |
1357 | && latin1_encoding.type[i] != BT_NONXML\r | |
1358 | && table[i] != i)\r | |
1359 | return 0;\r | |
1360 | for (i = 0; i < 256; i++) {\r | |
1361 | int c = table[i];\r | |
1362 | if (c == -1) {\r | |
1363 | e->normal.type[i] = BT_MALFORM;\r | |
1364 | /* This shouldn't really get used. */\r | |
1365 | e->utf16[i] = 0xFFFF;\r | |
1366 | e->utf8[i][0] = 1;\r | |
1367 | e->utf8[i][1] = 0;\r | |
1368 | }\r | |
1369 | else if (c < 0) {\r | |
1370 | if (c < -4)\r | |
1371 | return 0;\r | |
1372 | e->normal.type[i] = (unsigned char)(BT_LEAD2 - (c + 2));\r | |
1373 | e->utf8[i][0] = 0;\r | |
1374 | e->utf16[i] = 0;\r | |
1375 | }\r | |
1376 | else if (c < 0x80) {\r | |
1377 | if (latin1_encoding.type[c] != BT_OTHER\r | |
1378 | && latin1_encoding.type[c] != BT_NONXML\r | |
1379 | && c != i)\r | |
1380 | return 0;\r | |
1381 | e->normal.type[i] = latin1_encoding.type[c];\r | |
1382 | e->utf8[i][0] = 1;\r | |
1383 | e->utf8[i][1] = (char)c;\r | |
1384 | e->utf16[i] = (unsigned short)(c == 0 ? 0xFFFF : c);\r | |
1385 | }\r | |
1386 | else if (checkCharRefNumber(c) < 0) {\r | |
1387 | e->normal.type[i] = BT_NONXML;\r | |
1388 | /* This shouldn't really get used. */\r | |
1389 | e->utf16[i] = 0xFFFF;\r | |
1390 | e->utf8[i][0] = 1;\r | |
1391 | e->utf8[i][1] = 0;\r | |
1392 | }\r | |
1393 | else {\r | |
1394 | if (c > 0xFFFF)\r | |
1395 | return 0;\r | |
1396 | if (UCS2_GET_NAMING(nmstrtPages, c >> 8, c & 0xff))\r | |
1397 | e->normal.type[i] = BT_NMSTRT;\r | |
1398 | else if (UCS2_GET_NAMING(namePages, c >> 8, c & 0xff))\r | |
1399 | e->normal.type[i] = BT_NAME;\r | |
1400 | else\r | |
1401 | e->normal.type[i] = BT_OTHER;\r | |
1402 | e->utf8[i][0] = (char)XmlUtf8Encode(c, e->utf8[i] + 1);\r | |
1403 | e->utf16[i] = (unsigned short)c;\r | |
1404 | }\r | |
1405 | }\r | |
1406 | e->userData = userData;\r | |
1407 | e->convert = convert;\r | |
1408 | if (convert) {\r | |
1409 | e->normal.isName2 = unknown_isName;\r | |
1410 | e->normal.isName3 = unknown_isName;\r | |
1411 | e->normal.isName4 = unknown_isName;\r | |
1412 | e->normal.isNmstrt2 = unknown_isNmstrt;\r | |
1413 | e->normal.isNmstrt3 = unknown_isNmstrt;\r | |
1414 | e->normal.isNmstrt4 = unknown_isNmstrt;\r | |
1415 | e->normal.isInvalid2 = unknown_isInvalid;\r | |
1416 | e->normal.isInvalid3 = unknown_isInvalid;\r | |
1417 | e->normal.isInvalid4 = unknown_isInvalid;\r | |
1418 | }\r | |
1419 | e->normal.enc.utf8Convert = unknown_toUtf8;\r | |
1420 | e->normal.enc.utf16Convert = unknown_toUtf16;\r | |
1421 | return &(e->normal.enc);\r | |
1422 | }\r | |
1423 | \r | |
1424 | /* If this enumeration is changed, getEncodingIndex and encodings\r | |
1425 | must also be changed. */\r | |
1426 | enum {\r | |
1427 | UNKNOWN_ENC = -1,\r | |
1428 | ISO_8859_1_ENC = 0,\r | |
1429 | US_ASCII_ENC,\r | |
1430 | UTF_8_ENC,\r | |
1431 | UTF_16_ENC,\r | |
1432 | UTF_16BE_ENC,\r | |
1433 | UTF_16LE_ENC,\r | |
1434 | /* must match encodingNames up to here */\r | |
1435 | NO_ENC\r | |
1436 | };\r | |
1437 | \r | |
1438 | static const char KW_ISO_8859_1[] = {\r | |
1439 | ASCII_I, ASCII_S, ASCII_O, ASCII_MINUS, ASCII_8, ASCII_8, ASCII_5, ASCII_9,\r | |
1440 | ASCII_MINUS, ASCII_1, '\0'\r | |
1441 | };\r | |
1442 | static const char KW_US_ASCII[] = {\r | |
1443 | ASCII_U, ASCII_S, ASCII_MINUS, ASCII_A, ASCII_S, ASCII_C, ASCII_I, ASCII_I,\r | |
1444 | '\0'\r | |
1445 | };\r | |
1446 | static const char KW_UTF_8[] = {\r | |
1447 | ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_8, '\0'\r | |
1448 | };\r | |
1449 | static const char KW_UTF_16[] = {\r | |
1450 | ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, '\0'\r | |
1451 | };\r | |
1452 | static const char KW_UTF_16BE[] = {\r | |
1453 | ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, ASCII_B, ASCII_E,\r | |
1454 | '\0'\r | |
1455 | };\r | |
1456 | static const char KW_UTF_16LE[] = {\r | |
1457 | ASCII_U, ASCII_T, ASCII_F, ASCII_MINUS, ASCII_1, ASCII_6, ASCII_L, ASCII_E,\r | |
1458 | '\0'\r | |
1459 | };\r | |
1460 | \r | |
1461 | static int FASTCALL\r | |
1462 | getEncodingIndex(const char *name)\r | |
1463 | {\r | |
1464 | static const char * const encodingNames[] = {\r | |
1465 | KW_ISO_8859_1,\r | |
1466 | KW_US_ASCII,\r | |
1467 | KW_UTF_8,\r | |
1468 | KW_UTF_16,\r | |
1469 | KW_UTF_16BE,\r | |
1470 | KW_UTF_16LE,\r | |
1471 | };\r | |
1472 | int i;\r | |
1473 | if (name == NULL)\r | |
1474 | return NO_ENC;\r | |
1475 | for (i = 0; i < (int)(sizeof(encodingNames)/sizeof(encodingNames[0])); i++)\r | |
1476 | if (streqci(name, encodingNames[i]))\r | |
1477 | return i;\r | |
1478 | return UNKNOWN_ENC;\r | |
1479 | }\r | |
1480 | \r | |
1481 | /* For binary compatibility, we store the index of the encoding\r | |
1482 | specified at initialization in the isUtf16 member.\r | |
1483 | */\r | |
1484 | \r | |
1485 | #define INIT_ENC_INDEX(enc) ((int)(enc)->initEnc.isUtf16)\r | |
1486 | #define SET_INIT_ENC_INDEX(enc, i) ((enc)->initEnc.isUtf16 = (char)i)\r | |
1487 | \r | |
1488 | /* This is what detects the encoding. encodingTable maps from\r | |
1489 | encoding indices to encodings; INIT_ENC_INDEX(enc) is the index of\r | |
1490 | the external (protocol) specified encoding; state is\r | |
1491 | XML_CONTENT_STATE if we're parsing an external text entity, and\r | |
1492 | XML_PROLOG_STATE otherwise.\r | |
1493 | */\r | |
1494 | \r | |
1495 | \r | |
1496 | static int\r | |
1497 | initScan(const ENCODING * const *encodingTable,\r | |
1498 | const INIT_ENCODING *enc,\r | |
1499 | int state,\r | |
1500 | const char *ptr,\r | |
1501 | const char *end,\r | |
1502 | const char **nextTokPtr)\r | |
1503 | {\r | |
1504 | const ENCODING **encPtr;\r | |
1505 | \r | |
1506 | if (ptr == end)\r | |
1507 | return XML_TOK_NONE;\r | |
1508 | encPtr = enc->encPtr;\r | |
1509 | if (ptr + 1 == end) {\r | |
1510 | /* only a single byte available for auto-detection */\r | |
1511 | #ifndef XML_DTD /* FIXME */\r | |
1512 | /* a well-formed document entity must have more than one byte */\r | |
1513 | if (state != XML_CONTENT_STATE)\r | |
1514 | return XML_TOK_PARTIAL;\r | |
1515 | #endif\r | |
1516 | /* so we're parsing an external text entity... */\r | |
1517 | /* if UTF-16 was externally specified, then we need at least 2 bytes */\r | |
1518 | switch (INIT_ENC_INDEX(enc)) {\r | |
1519 | case UTF_16_ENC:\r | |
1520 | case UTF_16LE_ENC:\r | |
1521 | case UTF_16BE_ENC:\r | |
1522 | return XML_TOK_PARTIAL;\r | |
1523 | }\r | |
1524 | switch ((unsigned char)*ptr) {\r | |
1525 | case 0xFE:\r | |
1526 | case 0xFF:\r | |
1527 | case 0xEF: /* possibly first byte of UTF-8 BOM */\r | |
1528 | if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC\r | |
1529 | && state == XML_CONTENT_STATE)\r | |
1530 | break;\r | |
1531 | /* fall through */\r | |
1532 | case 0x00:\r | |
1533 | case 0x3C:\r | |
1534 | return XML_TOK_PARTIAL;\r | |
1535 | }\r | |
1536 | }\r | |
1537 | else {\r | |
1538 | switch (((unsigned char)ptr[0] << 8) | (unsigned char)ptr[1]) {\r | |
1539 | case 0xFEFF:\r | |
1540 | if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC\r | |
1541 | && state == XML_CONTENT_STATE)\r | |
1542 | break;\r | |
1543 | *nextTokPtr = ptr + 2;\r | |
1544 | *encPtr = encodingTable[UTF_16BE_ENC];\r | |
1545 | return XML_TOK_BOM;\r | |
1546 | /* 00 3C is handled in the default case */\r | |
1547 | case 0x3C00:\r | |
1548 | if ((INIT_ENC_INDEX(enc) == UTF_16BE_ENC\r | |
1549 | || INIT_ENC_INDEX(enc) == UTF_16_ENC)\r | |
1550 | && state == XML_CONTENT_STATE)\r | |
1551 | break;\r | |
1552 | *encPtr = encodingTable[UTF_16LE_ENC];\r | |
1553 | return XmlTok(*encPtr, state, ptr, end, nextTokPtr);\r | |
1554 | case 0xFFFE:\r | |
1555 | if (INIT_ENC_INDEX(enc) == ISO_8859_1_ENC\r | |
1556 | && state == XML_CONTENT_STATE)\r | |
1557 | break;\r | |
1558 | *nextTokPtr = ptr + 2;\r | |
1559 | *encPtr = encodingTable[UTF_16LE_ENC];\r | |
1560 | return XML_TOK_BOM;\r | |
1561 | case 0xEFBB:\r | |
1562 | /* Maybe a UTF-8 BOM (EF BB BF) */\r | |
1563 | /* If there's an explicitly specified (external) encoding\r | |
1564 | of ISO-8859-1 or some flavour of UTF-16\r | |
1565 | and this is an external text entity,\r | |
1566 | don't look for the BOM,\r | |
1567 | because it might be a legal data.\r | |
1568 | */\r | |
1569 | if (state == XML_CONTENT_STATE) {\r | |
1570 | int e = INIT_ENC_INDEX(enc);\r | |
1571 | if (e == ISO_8859_1_ENC || e == UTF_16BE_ENC\r | |
1572 | || e == UTF_16LE_ENC || e == UTF_16_ENC)\r | |
1573 | break;\r | |
1574 | }\r | |
1575 | if (ptr + 2 == end)\r | |
1576 | return XML_TOK_PARTIAL;\r | |
1577 | if ((unsigned char)ptr[2] == 0xBF) {\r | |
1578 | *nextTokPtr = ptr + 3;\r | |
1579 | *encPtr = encodingTable[UTF_8_ENC];\r | |
1580 | return XML_TOK_BOM;\r | |
1581 | }\r | |
1582 | break;\r | |
1583 | default:\r | |
1584 | if (ptr[0] == '\0') {\r | |
1585 | /* 0 isn't a legal data character. Furthermore a document\r | |
1586 | entity can only start with ASCII characters. So the only\r | |
1587 | way this can fail to be big-endian UTF-16 is if it is an\r | |
1588 | external parsed general entity that's labelled as\r | |
1589 | UTF-16LE.\r | |
1590 | */\r | |
1591 | if (state == XML_CONTENT_STATE && INIT_ENC_INDEX(enc) == UTF_16LE_ENC)\r | |
1592 | break;\r | |
1593 | *encPtr = encodingTable[UTF_16BE_ENC];\r | |
1594 | return XmlTok(*encPtr, state, ptr, end, nextTokPtr);\r | |
1595 | }\r | |
1596 | else if (ptr[1] == '\0') {\r | |
1597 | /* We could recover here in the case:\r | |
1598 | - parsing an external entity\r | |
1599 | - second byte is 0\r | |
1600 | - no externally specified encoding\r | |
1601 | - no encoding declaration\r | |
1602 | by assuming UTF-16LE. But we don't, because this would mean when\r | |
1603 | presented just with a single byte, we couldn't reliably determine\r | |
1604 | whether we needed further bytes.\r | |
1605 | */\r | |
1606 | if (state == XML_CONTENT_STATE)\r | |
1607 | break;\r | |
1608 | *encPtr = encodingTable[UTF_16LE_ENC];\r | |
1609 | return XmlTok(*encPtr, state, ptr, end, nextTokPtr);\r | |
1610 | }\r | |
1611 | break;\r | |
1612 | }\r | |
1613 | }\r | |
1614 | *encPtr = encodingTable[INIT_ENC_INDEX(enc)];\r | |
1615 | return XmlTok(*encPtr, state, ptr, end, nextTokPtr);\r | |
1616 | }\r | |
1617 | \r | |
1618 | \r | |
1619 | #define NS(x) x\r | |
1620 | #define ns(x) x\r | |
1621 | #define XML_TOK_NS_C\r | |
1622 | #include "xmltok_ns.c"\r | |
1623 | #undef XML_TOK_NS_C\r | |
1624 | #undef NS\r | |
1625 | #undef ns\r | |
1626 | \r | |
1627 | #ifdef XML_NS\r | |
1628 | \r | |
1629 | #define NS(x) x ## NS\r | |
1630 | #define ns(x) x ## _ns\r | |
1631 | \r | |
1632 | #define XML_TOK_NS_C\r | |
1633 | #include "xmltok_ns.c"\r | |
1634 | #undef XML_TOK_NS_C\r | |
1635 | \r | |
1636 | #undef NS\r | |
1637 | #undef ns\r | |
1638 | \r | |
1639 | ENCODING *\r | |
1640 | XmlInitUnknownEncodingNS(void *mem,\r | |
1641 | int *table,\r | |
1642 | CONVERTER convert,\r | |
1643 | void *userData)\r | |
1644 | {\r | |
1645 | ENCODING *enc = XmlInitUnknownEncoding(mem, table, convert, userData);\r | |
1646 | if (enc)\r | |
1647 | ((struct normal_encoding *)enc)->type[ASCII_COLON] = BT_COLON;\r | |
1648 | return enc;\r | |
1649 | }\r | |
1650 | \r | |
1651 | #endif /* XML_NS */\r |