xmltok.c 54 KB

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