xmltok.c 44 KB

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