xmltok.c 46 KB

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