xmltok.c 53 KB

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