xmltok.c 53 KB

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