xmltok_impl.c 45 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763
  1. /* This file is included!
  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. #ifdef XML_TOK_IMPL_C
  29. #ifndef IS_INVALID_CHAR
  30. #define IS_INVALID_CHAR(enc, ptr, n) (0)
  31. #endif
  32. #define INVALID_LEAD_CASE(n, ptr, nextTokPtr) \
  33. case BT_LEAD ## n: \
  34. if (end - ptr < n) \
  35. return XML_TOK_PARTIAL_CHAR; \
  36. if (IS_INVALID_CHAR(enc, ptr, n)) { \
  37. *(nextTokPtr) = (ptr); \
  38. return XML_TOK_INVALID; \
  39. } \
  40. ptr += n; \
  41. break;
  42. #define INVALID_CASES(ptr, nextTokPtr) \
  43. INVALID_LEAD_CASE(2, ptr, nextTokPtr) \
  44. INVALID_LEAD_CASE(3, ptr, nextTokPtr) \
  45. INVALID_LEAD_CASE(4, ptr, nextTokPtr) \
  46. case BT_NONXML: \
  47. case BT_MALFORM: \
  48. case BT_TRAIL: \
  49. *(nextTokPtr) = (ptr); \
  50. return XML_TOK_INVALID;
  51. #define CHECK_NAME_CASE(n, enc, ptr, end, nextTokPtr) \
  52. case BT_LEAD ## n: \
  53. if (end - ptr < n) \
  54. return XML_TOK_PARTIAL_CHAR; \
  55. if (!IS_NAME_CHAR(enc, ptr, n)) { \
  56. *nextTokPtr = ptr; \
  57. return XML_TOK_INVALID; \
  58. } \
  59. ptr += n; \
  60. break;
  61. #define CHECK_NAME_CASES(enc, ptr, end, nextTokPtr) \
  62. case BT_NONASCII: \
  63. if (!IS_NAME_CHAR_MINBPC(enc, ptr)) { \
  64. *nextTokPtr = ptr; \
  65. return XML_TOK_INVALID; \
  66. } \
  67. case BT_NMSTRT: \
  68. case BT_HEX: \
  69. case BT_DIGIT: \
  70. case BT_NAME: \
  71. case BT_MINUS: \
  72. ptr += MINBPC(enc); \
  73. break; \
  74. CHECK_NAME_CASE(2, enc, ptr, end, nextTokPtr) \
  75. CHECK_NAME_CASE(3, enc, ptr, end, nextTokPtr) \
  76. CHECK_NAME_CASE(4, enc, ptr, end, nextTokPtr)
  77. #define CHECK_NMSTRT_CASE(n, enc, ptr, end, nextTokPtr) \
  78. case BT_LEAD ## n: \
  79. if (end - ptr < n) \
  80. return XML_TOK_PARTIAL_CHAR; \
  81. if (!IS_NMSTRT_CHAR(enc, ptr, n)) { \
  82. *nextTokPtr = ptr; \
  83. return XML_TOK_INVALID; \
  84. } \
  85. ptr += n; \
  86. break;
  87. #define CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr) \
  88. case BT_NONASCII: \
  89. if (!IS_NMSTRT_CHAR_MINBPC(enc, ptr)) { \
  90. *nextTokPtr = ptr; \
  91. return XML_TOK_INVALID; \
  92. } \
  93. case BT_NMSTRT: \
  94. case BT_HEX: \
  95. ptr += MINBPC(enc); \
  96. break; \
  97. CHECK_NMSTRT_CASE(2, enc, ptr, end, nextTokPtr) \
  98. CHECK_NMSTRT_CASE(3, enc, ptr, end, nextTokPtr) \
  99. CHECK_NMSTRT_CASE(4, enc, ptr, end, nextTokPtr)
  100. #ifndef PREFIX
  101. #define PREFIX(ident) ident
  102. #endif
  103. #define HAS_CHARS(enc, ptr, end, count) \
  104. (end - ptr >= count * MINBPC(enc))
  105. #define HAS_CHAR(enc, ptr, end) \
  106. HAS_CHARS(enc, ptr, end, 1)
  107. #define REQUIRE_CHARS(enc, ptr, end, count) \
  108. { \
  109. if (! HAS_CHARS(enc, ptr, end, count)) { \
  110. return XML_TOK_PARTIAL; \
  111. } \
  112. }
  113. #define REQUIRE_CHAR(enc, ptr, end) \
  114. REQUIRE_CHARS(enc, ptr, end, 1)
  115. /* ptr points to character following "<!-" */
  116. static int PTRCALL
  117. PREFIX(scanComment)(const ENCODING *enc, const char *ptr,
  118. const char *end, const char **nextTokPtr)
  119. {
  120. if (HAS_CHAR(enc, ptr, end)) {
  121. if (!CHAR_MATCHES(enc, ptr, ASCII_MINUS)) {
  122. *nextTokPtr = ptr;
  123. return XML_TOK_INVALID;
  124. }
  125. ptr += MINBPC(enc);
  126. while (HAS_CHAR(enc, ptr, end)) {
  127. switch (BYTE_TYPE(enc, ptr)) {
  128. INVALID_CASES(ptr, nextTokPtr)
  129. case BT_MINUS:
  130. ptr += MINBPC(enc);
  131. REQUIRE_CHAR(enc, ptr, end);
  132. if (CHAR_MATCHES(enc, ptr, ASCII_MINUS)) {
  133. ptr += MINBPC(enc);
  134. REQUIRE_CHAR(enc, ptr, end);
  135. if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  136. *nextTokPtr = ptr;
  137. return XML_TOK_INVALID;
  138. }
  139. *nextTokPtr = ptr + MINBPC(enc);
  140. return XML_TOK_COMMENT;
  141. }
  142. break;
  143. default:
  144. ptr += MINBPC(enc);
  145. break;
  146. }
  147. }
  148. }
  149. return XML_TOK_PARTIAL;
  150. }
  151. /* ptr points to character following "<!" */
  152. static int PTRCALL
  153. PREFIX(scanDecl)(const ENCODING *enc, const char *ptr,
  154. const char *end, const char **nextTokPtr)
  155. {
  156. REQUIRE_CHAR(enc, ptr, end);
  157. switch (BYTE_TYPE(enc, ptr)) {
  158. case BT_MINUS:
  159. return PREFIX(scanComment)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  160. case BT_LSQB:
  161. *nextTokPtr = ptr + MINBPC(enc);
  162. return XML_TOK_COND_SECT_OPEN;
  163. case BT_NMSTRT:
  164. case BT_HEX:
  165. ptr += MINBPC(enc);
  166. break;
  167. default:
  168. *nextTokPtr = ptr;
  169. return XML_TOK_INVALID;
  170. }
  171. while (HAS_CHAR(enc, ptr, end)) {
  172. switch (BYTE_TYPE(enc, ptr)) {
  173. case BT_PERCNT:
  174. REQUIRE_CHARS(enc, ptr, end, 2);
  175. /* don't allow <!ENTITY% foo "whatever"> */
  176. switch (BYTE_TYPE(enc, ptr + MINBPC(enc))) {
  177. case BT_S: case BT_CR: case BT_LF: case BT_PERCNT:
  178. *nextTokPtr = ptr;
  179. return XML_TOK_INVALID;
  180. }
  181. /* fall through */
  182. case BT_S: case BT_CR: case BT_LF:
  183. *nextTokPtr = ptr;
  184. return XML_TOK_DECL_OPEN;
  185. case BT_NMSTRT:
  186. case BT_HEX:
  187. ptr += MINBPC(enc);
  188. break;
  189. default:
  190. *nextTokPtr = ptr;
  191. return XML_TOK_INVALID;
  192. }
  193. }
  194. return XML_TOK_PARTIAL;
  195. }
  196. static int PTRCALL
  197. PREFIX(checkPiTarget)(const ENCODING *UNUSED_P(enc), const char *ptr,
  198. const char *end, int *tokPtr)
  199. {
  200. int upper = 0;
  201. *tokPtr = XML_TOK_PI;
  202. if (end - ptr != MINBPC(enc)*3)
  203. return 1;
  204. switch (BYTE_TO_ASCII(enc, ptr)) {
  205. case ASCII_x:
  206. break;
  207. case ASCII_X:
  208. upper = 1;
  209. break;
  210. default:
  211. return 1;
  212. }
  213. ptr += MINBPC(enc);
  214. switch (BYTE_TO_ASCII(enc, ptr)) {
  215. case ASCII_m:
  216. break;
  217. case ASCII_M:
  218. upper = 1;
  219. break;
  220. default:
  221. return 1;
  222. }
  223. ptr += MINBPC(enc);
  224. switch (BYTE_TO_ASCII(enc, ptr)) {
  225. case ASCII_l:
  226. break;
  227. case ASCII_L:
  228. upper = 1;
  229. break;
  230. default:
  231. return 1;
  232. }
  233. if (upper)
  234. return 0;
  235. *tokPtr = XML_TOK_XML_DECL;
  236. return 1;
  237. }
  238. /* ptr points to character following "<?" */
  239. static int PTRCALL
  240. PREFIX(scanPi)(const ENCODING *enc, const char *ptr,
  241. const char *end, const char **nextTokPtr)
  242. {
  243. int tok;
  244. const char *target = ptr;
  245. REQUIRE_CHAR(enc, ptr, end);
  246. switch (BYTE_TYPE(enc, ptr)) {
  247. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  248. default:
  249. *nextTokPtr = ptr;
  250. return XML_TOK_INVALID;
  251. }
  252. while (HAS_CHAR(enc, ptr, end)) {
  253. switch (BYTE_TYPE(enc, ptr)) {
  254. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  255. case BT_S: case BT_CR: case BT_LF:
  256. if (!PREFIX(checkPiTarget)(enc, target, ptr, &tok)) {
  257. *nextTokPtr = ptr;
  258. return XML_TOK_INVALID;
  259. }
  260. ptr += MINBPC(enc);
  261. while (HAS_CHAR(enc, ptr, end)) {
  262. switch (BYTE_TYPE(enc, ptr)) {
  263. INVALID_CASES(ptr, nextTokPtr)
  264. case BT_QUEST:
  265. ptr += MINBPC(enc);
  266. REQUIRE_CHAR(enc, ptr, end);
  267. if (CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  268. *nextTokPtr = ptr + MINBPC(enc);
  269. return tok;
  270. }
  271. break;
  272. default:
  273. ptr += MINBPC(enc);
  274. break;
  275. }
  276. }
  277. return XML_TOK_PARTIAL;
  278. case BT_QUEST:
  279. if (!PREFIX(checkPiTarget)(enc, target, ptr, &tok)) {
  280. *nextTokPtr = ptr;
  281. return XML_TOK_INVALID;
  282. }
  283. ptr += MINBPC(enc);
  284. REQUIRE_CHAR(enc, ptr, end);
  285. if (CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  286. *nextTokPtr = ptr + MINBPC(enc);
  287. return tok;
  288. }
  289. /* fall through */
  290. default:
  291. *nextTokPtr = ptr;
  292. return XML_TOK_INVALID;
  293. }
  294. }
  295. return XML_TOK_PARTIAL;
  296. }
  297. static int PTRCALL
  298. PREFIX(scanCdataSection)(const ENCODING *UNUSED_P(enc), const char *ptr,
  299. const char *end, const char **nextTokPtr)
  300. {
  301. static const char CDATA_LSQB[] = { ASCII_C, ASCII_D, ASCII_A,
  302. ASCII_T, ASCII_A, ASCII_LSQB };
  303. int i;
  304. /* CDATA[ */
  305. REQUIRE_CHARS(enc, ptr, end, 6);
  306. for (i = 0; i < 6; i++, ptr += MINBPC(enc)) {
  307. if (!CHAR_MATCHES(enc, ptr, CDATA_LSQB[i])) {
  308. *nextTokPtr = ptr;
  309. return XML_TOK_INVALID;
  310. }
  311. }
  312. *nextTokPtr = ptr;
  313. return XML_TOK_CDATA_SECT_OPEN;
  314. }
  315. static int PTRCALL
  316. PREFIX(cdataSectionTok)(const ENCODING *enc, const char *ptr,
  317. const char *end, const char **nextTokPtr)
  318. {
  319. if (ptr >= end)
  320. return XML_TOK_NONE;
  321. if (MINBPC(enc) > 1) {
  322. size_t n = end - ptr;
  323. if (n & (MINBPC(enc) - 1)) {
  324. n &= ~(MINBPC(enc) - 1);
  325. if (n == 0)
  326. return XML_TOK_PARTIAL;
  327. end = ptr + n;
  328. }
  329. }
  330. switch (BYTE_TYPE(enc, ptr)) {
  331. case BT_RSQB:
  332. ptr += MINBPC(enc);
  333. REQUIRE_CHAR(enc, ptr, end);
  334. if (!CHAR_MATCHES(enc, ptr, ASCII_RSQB))
  335. break;
  336. ptr += MINBPC(enc);
  337. REQUIRE_CHAR(enc, ptr, end);
  338. if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  339. ptr -= MINBPC(enc);
  340. break;
  341. }
  342. *nextTokPtr = ptr + MINBPC(enc);
  343. return XML_TOK_CDATA_SECT_CLOSE;
  344. case BT_CR:
  345. ptr += MINBPC(enc);
  346. REQUIRE_CHAR(enc, ptr, end);
  347. if (BYTE_TYPE(enc, ptr) == BT_LF)
  348. ptr += MINBPC(enc);
  349. *nextTokPtr = ptr;
  350. return XML_TOK_DATA_NEWLINE;
  351. case BT_LF:
  352. *nextTokPtr = ptr + MINBPC(enc);
  353. return XML_TOK_DATA_NEWLINE;
  354. INVALID_CASES(ptr, nextTokPtr)
  355. default:
  356. ptr += MINBPC(enc);
  357. break;
  358. }
  359. while (HAS_CHAR(enc, ptr, end)) {
  360. switch (BYTE_TYPE(enc, ptr)) {
  361. #define LEAD_CASE(n) \
  362. case BT_LEAD ## n: \
  363. if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \
  364. *nextTokPtr = ptr; \
  365. return XML_TOK_DATA_CHARS; \
  366. } \
  367. ptr += n; \
  368. break;
  369. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  370. #undef LEAD_CASE
  371. case BT_NONXML:
  372. case BT_MALFORM:
  373. case BT_TRAIL:
  374. case BT_CR:
  375. case BT_LF:
  376. case BT_RSQB:
  377. *nextTokPtr = ptr;
  378. return XML_TOK_DATA_CHARS;
  379. default:
  380. ptr += MINBPC(enc);
  381. break;
  382. }
  383. }
  384. *nextTokPtr = ptr;
  385. return XML_TOK_DATA_CHARS;
  386. }
  387. /* ptr points to character following "</" */
  388. static int PTRCALL
  389. PREFIX(scanEndTag)(const ENCODING *enc, const char *ptr,
  390. const char *end, const char **nextTokPtr)
  391. {
  392. REQUIRE_CHAR(enc, ptr, end);
  393. switch (BYTE_TYPE(enc, ptr)) {
  394. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  395. default:
  396. *nextTokPtr = ptr;
  397. return XML_TOK_INVALID;
  398. }
  399. while (HAS_CHAR(enc, ptr, end)) {
  400. switch (BYTE_TYPE(enc, ptr)) {
  401. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  402. case BT_S: case BT_CR: case BT_LF:
  403. for (ptr += MINBPC(enc); HAS_CHAR(enc, ptr, end); ptr += MINBPC(enc)) {
  404. switch (BYTE_TYPE(enc, ptr)) {
  405. case BT_S: case BT_CR: case BT_LF:
  406. break;
  407. case BT_GT:
  408. *nextTokPtr = ptr + MINBPC(enc);
  409. return XML_TOK_END_TAG;
  410. default:
  411. *nextTokPtr = ptr;
  412. return XML_TOK_INVALID;
  413. }
  414. }
  415. return XML_TOK_PARTIAL;
  416. #ifdef XML_NS
  417. case BT_COLON:
  418. /* no need to check qname syntax here,
  419. since end-tag must match exactly */
  420. ptr += MINBPC(enc);
  421. break;
  422. #endif
  423. case BT_GT:
  424. *nextTokPtr = ptr + MINBPC(enc);
  425. return XML_TOK_END_TAG;
  426. default:
  427. *nextTokPtr = ptr;
  428. return XML_TOK_INVALID;
  429. }
  430. }
  431. return XML_TOK_PARTIAL;
  432. }
  433. /* ptr points to character following "&#X" */
  434. static int PTRCALL
  435. PREFIX(scanHexCharRef)(const ENCODING *enc, const char *ptr,
  436. const char *end, const char **nextTokPtr)
  437. {
  438. if (HAS_CHAR(enc, ptr, end)) {
  439. switch (BYTE_TYPE(enc, ptr)) {
  440. case BT_DIGIT:
  441. case BT_HEX:
  442. break;
  443. default:
  444. *nextTokPtr = ptr;
  445. return XML_TOK_INVALID;
  446. }
  447. for (ptr += MINBPC(enc); HAS_CHAR(enc, ptr, end); ptr += MINBPC(enc)) {
  448. switch (BYTE_TYPE(enc, ptr)) {
  449. case BT_DIGIT:
  450. case BT_HEX:
  451. break;
  452. case BT_SEMI:
  453. *nextTokPtr = ptr + MINBPC(enc);
  454. return XML_TOK_CHAR_REF;
  455. default:
  456. *nextTokPtr = ptr;
  457. return XML_TOK_INVALID;
  458. }
  459. }
  460. }
  461. return XML_TOK_PARTIAL;
  462. }
  463. /* ptr points to character following "&#" */
  464. static int PTRCALL
  465. PREFIX(scanCharRef)(const ENCODING *enc, const char *ptr,
  466. const char *end, const char **nextTokPtr)
  467. {
  468. if (HAS_CHAR(enc, ptr, end)) {
  469. if (CHAR_MATCHES(enc, ptr, ASCII_x))
  470. return PREFIX(scanHexCharRef)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  471. switch (BYTE_TYPE(enc, ptr)) {
  472. case BT_DIGIT:
  473. break;
  474. default:
  475. *nextTokPtr = ptr;
  476. return XML_TOK_INVALID;
  477. }
  478. for (ptr += MINBPC(enc); HAS_CHAR(enc, ptr, end); ptr += MINBPC(enc)) {
  479. switch (BYTE_TYPE(enc, ptr)) {
  480. case BT_DIGIT:
  481. break;
  482. case BT_SEMI:
  483. *nextTokPtr = ptr + MINBPC(enc);
  484. return XML_TOK_CHAR_REF;
  485. default:
  486. *nextTokPtr = ptr;
  487. return XML_TOK_INVALID;
  488. }
  489. }
  490. }
  491. return XML_TOK_PARTIAL;
  492. }
  493. /* ptr points to character following "&" */
  494. static int PTRCALL
  495. PREFIX(scanRef)(const ENCODING *enc, const char *ptr, const char *end,
  496. const char **nextTokPtr)
  497. {
  498. REQUIRE_CHAR(enc, ptr, end);
  499. switch (BYTE_TYPE(enc, ptr)) {
  500. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  501. case BT_NUM:
  502. return PREFIX(scanCharRef)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  503. default:
  504. *nextTokPtr = ptr;
  505. return XML_TOK_INVALID;
  506. }
  507. while (HAS_CHAR(enc, ptr, end)) {
  508. switch (BYTE_TYPE(enc, ptr)) {
  509. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  510. case BT_SEMI:
  511. *nextTokPtr = ptr + MINBPC(enc);
  512. return XML_TOK_ENTITY_REF;
  513. default:
  514. *nextTokPtr = ptr;
  515. return XML_TOK_INVALID;
  516. }
  517. }
  518. return XML_TOK_PARTIAL;
  519. }
  520. /* ptr points to character following first character of attribute name */
  521. static int PTRCALL
  522. PREFIX(scanAtts)(const ENCODING *enc, const char *ptr, const char *end,
  523. const char **nextTokPtr)
  524. {
  525. #ifdef XML_NS
  526. int hadColon = 0;
  527. #endif
  528. while (HAS_CHAR(enc, ptr, end)) {
  529. switch (BYTE_TYPE(enc, ptr)) {
  530. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  531. #ifdef XML_NS
  532. case BT_COLON:
  533. if (hadColon) {
  534. *nextTokPtr = ptr;
  535. return XML_TOK_INVALID;
  536. }
  537. hadColon = 1;
  538. ptr += MINBPC(enc);
  539. REQUIRE_CHAR(enc, ptr, end);
  540. switch (BYTE_TYPE(enc, ptr)) {
  541. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  542. default:
  543. *nextTokPtr = ptr;
  544. return XML_TOK_INVALID;
  545. }
  546. break;
  547. #endif
  548. case BT_S: case BT_CR: case BT_LF:
  549. for (;;) {
  550. int t;
  551. ptr += MINBPC(enc);
  552. REQUIRE_CHAR(enc, ptr, end);
  553. t = BYTE_TYPE(enc, ptr);
  554. if (t == BT_EQUALS)
  555. break;
  556. switch (t) {
  557. case BT_S:
  558. case BT_LF:
  559. case BT_CR:
  560. break;
  561. default:
  562. *nextTokPtr = ptr;
  563. return XML_TOK_INVALID;
  564. }
  565. }
  566. /* fall through */
  567. case BT_EQUALS:
  568. {
  569. int open;
  570. #ifdef XML_NS
  571. hadColon = 0;
  572. #endif
  573. for (;;) {
  574. ptr += MINBPC(enc);
  575. REQUIRE_CHAR(enc, ptr, end);
  576. open = BYTE_TYPE(enc, ptr);
  577. if (open == BT_QUOT || open == BT_APOS)
  578. break;
  579. switch (open) {
  580. case BT_S:
  581. case BT_LF:
  582. case BT_CR:
  583. break;
  584. default:
  585. *nextTokPtr = ptr;
  586. return XML_TOK_INVALID;
  587. }
  588. }
  589. ptr += MINBPC(enc);
  590. /* in attribute value */
  591. for (;;) {
  592. int t;
  593. REQUIRE_CHAR(enc, ptr, end);
  594. t = BYTE_TYPE(enc, ptr);
  595. if (t == open)
  596. break;
  597. switch (t) {
  598. INVALID_CASES(ptr, nextTokPtr)
  599. case BT_AMP:
  600. {
  601. int tok = PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, &ptr);
  602. if (tok <= 0) {
  603. if (tok == XML_TOK_INVALID)
  604. *nextTokPtr = ptr;
  605. return tok;
  606. }
  607. break;
  608. }
  609. case BT_LT:
  610. *nextTokPtr = ptr;
  611. return XML_TOK_INVALID;
  612. default:
  613. ptr += MINBPC(enc);
  614. break;
  615. }
  616. }
  617. ptr += MINBPC(enc);
  618. REQUIRE_CHAR(enc, ptr, end);
  619. switch (BYTE_TYPE(enc, ptr)) {
  620. case BT_S:
  621. case BT_CR:
  622. case BT_LF:
  623. break;
  624. case BT_SOL:
  625. goto sol;
  626. case BT_GT:
  627. goto gt;
  628. default:
  629. *nextTokPtr = ptr;
  630. return XML_TOK_INVALID;
  631. }
  632. /* ptr points to closing quote */
  633. for (;;) {
  634. ptr += MINBPC(enc);
  635. REQUIRE_CHAR(enc, ptr, end);
  636. switch (BYTE_TYPE(enc, ptr)) {
  637. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  638. case BT_S: case BT_CR: case BT_LF:
  639. continue;
  640. case BT_GT:
  641. gt:
  642. *nextTokPtr = ptr + MINBPC(enc);
  643. return XML_TOK_START_TAG_WITH_ATTS;
  644. case BT_SOL:
  645. sol:
  646. ptr += MINBPC(enc);
  647. REQUIRE_CHAR(enc, ptr, end);
  648. if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  649. *nextTokPtr = ptr;
  650. return XML_TOK_INVALID;
  651. }
  652. *nextTokPtr = ptr + MINBPC(enc);
  653. return XML_TOK_EMPTY_ELEMENT_WITH_ATTS;
  654. default:
  655. *nextTokPtr = ptr;
  656. return XML_TOK_INVALID;
  657. }
  658. break;
  659. }
  660. break;
  661. }
  662. default:
  663. *nextTokPtr = ptr;
  664. return XML_TOK_INVALID;
  665. }
  666. }
  667. return XML_TOK_PARTIAL;
  668. }
  669. /* ptr points to character following "<" */
  670. static int PTRCALL
  671. PREFIX(scanLt)(const ENCODING *enc, const char *ptr, const char *end,
  672. const char **nextTokPtr)
  673. {
  674. #ifdef XML_NS
  675. int hadColon;
  676. #endif
  677. REQUIRE_CHAR(enc, ptr, end);
  678. switch (BYTE_TYPE(enc, ptr)) {
  679. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  680. case BT_EXCL:
  681. ptr += MINBPC(enc);
  682. REQUIRE_CHAR(enc, ptr, end);
  683. switch (BYTE_TYPE(enc, ptr)) {
  684. case BT_MINUS:
  685. return PREFIX(scanComment)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  686. case BT_LSQB:
  687. return PREFIX(scanCdataSection)(enc, ptr + MINBPC(enc),
  688. end, nextTokPtr);
  689. }
  690. *nextTokPtr = ptr;
  691. return XML_TOK_INVALID;
  692. case BT_QUEST:
  693. return PREFIX(scanPi)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  694. case BT_SOL:
  695. return PREFIX(scanEndTag)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  696. default:
  697. *nextTokPtr = ptr;
  698. return XML_TOK_INVALID;
  699. }
  700. #ifdef XML_NS
  701. hadColon = 0;
  702. #endif
  703. /* we have a start-tag */
  704. while (HAS_CHAR(enc, ptr, end)) {
  705. switch (BYTE_TYPE(enc, ptr)) {
  706. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  707. #ifdef XML_NS
  708. case BT_COLON:
  709. if (hadColon) {
  710. *nextTokPtr = ptr;
  711. return XML_TOK_INVALID;
  712. }
  713. hadColon = 1;
  714. ptr += MINBPC(enc);
  715. REQUIRE_CHAR(enc, ptr, end);
  716. switch (BYTE_TYPE(enc, ptr)) {
  717. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  718. default:
  719. *nextTokPtr = ptr;
  720. return XML_TOK_INVALID;
  721. }
  722. break;
  723. #endif
  724. case BT_S: case BT_CR: case BT_LF:
  725. {
  726. ptr += MINBPC(enc);
  727. while (HAS_CHAR(enc, ptr, end)) {
  728. switch (BYTE_TYPE(enc, ptr)) {
  729. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  730. case BT_GT:
  731. goto gt;
  732. case BT_SOL:
  733. goto sol;
  734. case BT_S: case BT_CR: case BT_LF:
  735. ptr += MINBPC(enc);
  736. continue;
  737. default:
  738. *nextTokPtr = ptr;
  739. return XML_TOK_INVALID;
  740. }
  741. return PREFIX(scanAtts)(enc, ptr, end, nextTokPtr);
  742. }
  743. return XML_TOK_PARTIAL;
  744. }
  745. case BT_GT:
  746. gt:
  747. *nextTokPtr = ptr + MINBPC(enc);
  748. return XML_TOK_START_TAG_NO_ATTS;
  749. case BT_SOL:
  750. sol:
  751. ptr += MINBPC(enc);
  752. REQUIRE_CHAR(enc, ptr, end);
  753. if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  754. *nextTokPtr = ptr;
  755. return XML_TOK_INVALID;
  756. }
  757. *nextTokPtr = ptr + MINBPC(enc);
  758. return XML_TOK_EMPTY_ELEMENT_NO_ATTS;
  759. default:
  760. *nextTokPtr = ptr;
  761. return XML_TOK_INVALID;
  762. }
  763. }
  764. return XML_TOK_PARTIAL;
  765. }
  766. static int PTRCALL
  767. PREFIX(contentTok)(const ENCODING *enc, const char *ptr, const char *end,
  768. const char **nextTokPtr)
  769. {
  770. if (ptr >= end)
  771. return XML_TOK_NONE;
  772. if (MINBPC(enc) > 1) {
  773. size_t n = end - ptr;
  774. if (n & (MINBPC(enc) - 1)) {
  775. n &= ~(MINBPC(enc) - 1);
  776. if (n == 0)
  777. return XML_TOK_PARTIAL;
  778. end = ptr + n;
  779. }
  780. }
  781. switch (BYTE_TYPE(enc, ptr)) {
  782. case BT_LT:
  783. return PREFIX(scanLt)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  784. case BT_AMP:
  785. return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  786. case BT_CR:
  787. ptr += MINBPC(enc);
  788. if (! HAS_CHAR(enc, ptr, end))
  789. return XML_TOK_TRAILING_CR;
  790. if (BYTE_TYPE(enc, ptr) == BT_LF)
  791. ptr += MINBPC(enc);
  792. *nextTokPtr = ptr;
  793. return XML_TOK_DATA_NEWLINE;
  794. case BT_LF:
  795. *nextTokPtr = ptr + MINBPC(enc);
  796. return XML_TOK_DATA_NEWLINE;
  797. case BT_RSQB:
  798. ptr += MINBPC(enc);
  799. if (! HAS_CHAR(enc, ptr, end))
  800. return XML_TOK_TRAILING_RSQB;
  801. if (!CHAR_MATCHES(enc, ptr, ASCII_RSQB))
  802. break;
  803. ptr += MINBPC(enc);
  804. if (! HAS_CHAR(enc, ptr, end))
  805. return XML_TOK_TRAILING_RSQB;
  806. if (!CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  807. ptr -= MINBPC(enc);
  808. break;
  809. }
  810. *nextTokPtr = ptr;
  811. return XML_TOK_INVALID;
  812. INVALID_CASES(ptr, nextTokPtr)
  813. default:
  814. ptr += MINBPC(enc);
  815. break;
  816. }
  817. while (HAS_CHAR(enc, ptr, end)) {
  818. switch (BYTE_TYPE(enc, ptr)) {
  819. #define LEAD_CASE(n) \
  820. case BT_LEAD ## n: \
  821. if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \
  822. *nextTokPtr = ptr; \
  823. return XML_TOK_DATA_CHARS; \
  824. } \
  825. ptr += n; \
  826. break;
  827. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  828. #undef LEAD_CASE
  829. case BT_RSQB:
  830. if (HAS_CHARS(enc, ptr, end, 2)) {
  831. if (!CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_RSQB)) {
  832. ptr += MINBPC(enc);
  833. break;
  834. }
  835. if (HAS_CHARS(enc, ptr, end, 3)) {
  836. if (!CHAR_MATCHES(enc, ptr + 2*MINBPC(enc), ASCII_GT)) {
  837. ptr += MINBPC(enc);
  838. break;
  839. }
  840. *nextTokPtr = ptr + 2*MINBPC(enc);
  841. return XML_TOK_INVALID;
  842. }
  843. }
  844. /* fall through */
  845. case BT_AMP:
  846. case BT_LT:
  847. case BT_NONXML:
  848. case BT_MALFORM:
  849. case BT_TRAIL:
  850. case BT_CR:
  851. case BT_LF:
  852. *nextTokPtr = ptr;
  853. return XML_TOK_DATA_CHARS;
  854. default:
  855. ptr += MINBPC(enc);
  856. break;
  857. }
  858. }
  859. *nextTokPtr = ptr;
  860. return XML_TOK_DATA_CHARS;
  861. }
  862. /* ptr points to character following "%" */
  863. static int PTRCALL
  864. PREFIX(scanPercent)(const ENCODING *enc, const char *ptr, const char *end,
  865. const char **nextTokPtr)
  866. {
  867. REQUIRE_CHAR(enc, ptr, end);
  868. switch (BYTE_TYPE(enc, ptr)) {
  869. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  870. case BT_S: case BT_LF: case BT_CR: case BT_PERCNT:
  871. *nextTokPtr = ptr;
  872. return XML_TOK_PERCENT;
  873. default:
  874. *nextTokPtr = ptr;
  875. return XML_TOK_INVALID;
  876. }
  877. while (HAS_CHAR(enc, ptr, end)) {
  878. switch (BYTE_TYPE(enc, ptr)) {
  879. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  880. case BT_SEMI:
  881. *nextTokPtr = ptr + MINBPC(enc);
  882. return XML_TOK_PARAM_ENTITY_REF;
  883. default:
  884. *nextTokPtr = ptr;
  885. return XML_TOK_INVALID;
  886. }
  887. }
  888. return XML_TOK_PARTIAL;
  889. }
  890. static int PTRCALL
  891. PREFIX(scanPoundName)(const ENCODING *enc, const char *ptr, const char *end,
  892. const char **nextTokPtr)
  893. {
  894. REQUIRE_CHAR(enc, ptr, end);
  895. switch (BYTE_TYPE(enc, ptr)) {
  896. CHECK_NMSTRT_CASES(enc, ptr, end, nextTokPtr)
  897. default:
  898. *nextTokPtr = ptr;
  899. return XML_TOK_INVALID;
  900. }
  901. while (HAS_CHAR(enc, ptr, end)) {
  902. switch (BYTE_TYPE(enc, ptr)) {
  903. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  904. case BT_CR: case BT_LF: case BT_S:
  905. case BT_RPAR: case BT_GT: case BT_PERCNT: case BT_VERBAR:
  906. *nextTokPtr = ptr;
  907. return XML_TOK_POUND_NAME;
  908. default:
  909. *nextTokPtr = ptr;
  910. return XML_TOK_INVALID;
  911. }
  912. }
  913. return -XML_TOK_POUND_NAME;
  914. }
  915. static int PTRCALL
  916. PREFIX(scanLit)(int open, const ENCODING *enc,
  917. const char *ptr, const char *end,
  918. const char **nextTokPtr)
  919. {
  920. while (HAS_CHAR(enc, ptr, end)) {
  921. int t = BYTE_TYPE(enc, ptr);
  922. switch (t) {
  923. INVALID_CASES(ptr, nextTokPtr)
  924. case BT_QUOT:
  925. case BT_APOS:
  926. ptr += MINBPC(enc);
  927. if (t != open)
  928. break;
  929. if (! HAS_CHAR(enc, ptr, end))
  930. return -XML_TOK_LITERAL;
  931. *nextTokPtr = ptr;
  932. switch (BYTE_TYPE(enc, ptr)) {
  933. case BT_S: case BT_CR: case BT_LF:
  934. case BT_GT: case BT_PERCNT: case BT_LSQB:
  935. return XML_TOK_LITERAL;
  936. default:
  937. return XML_TOK_INVALID;
  938. }
  939. default:
  940. ptr += MINBPC(enc);
  941. break;
  942. }
  943. }
  944. return XML_TOK_PARTIAL;
  945. }
  946. static int PTRCALL
  947. PREFIX(prologTok)(const ENCODING *enc, const char *ptr, const char *end,
  948. const char **nextTokPtr)
  949. {
  950. int tok;
  951. if (ptr >= end)
  952. return XML_TOK_NONE;
  953. if (MINBPC(enc) > 1) {
  954. size_t n = end - ptr;
  955. if (n & (MINBPC(enc) - 1)) {
  956. n &= ~(MINBPC(enc) - 1);
  957. if (n == 0)
  958. return XML_TOK_PARTIAL;
  959. end = ptr + n;
  960. }
  961. }
  962. switch (BYTE_TYPE(enc, ptr)) {
  963. case BT_QUOT:
  964. return PREFIX(scanLit)(BT_QUOT, enc, ptr + MINBPC(enc), end, nextTokPtr);
  965. case BT_APOS:
  966. return PREFIX(scanLit)(BT_APOS, enc, ptr + MINBPC(enc), end, nextTokPtr);
  967. case BT_LT:
  968. {
  969. ptr += MINBPC(enc);
  970. REQUIRE_CHAR(enc, ptr, end);
  971. switch (BYTE_TYPE(enc, ptr)) {
  972. case BT_EXCL:
  973. return PREFIX(scanDecl)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  974. case BT_QUEST:
  975. return PREFIX(scanPi)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  976. case BT_NMSTRT:
  977. case BT_HEX:
  978. case BT_NONASCII:
  979. case BT_LEAD2:
  980. case BT_LEAD3:
  981. case BT_LEAD4:
  982. *nextTokPtr = ptr - MINBPC(enc);
  983. return XML_TOK_INSTANCE_START;
  984. }
  985. *nextTokPtr = ptr;
  986. return XML_TOK_INVALID;
  987. }
  988. case BT_CR:
  989. if (ptr + MINBPC(enc) == end) {
  990. *nextTokPtr = end;
  991. /* indicate that this might be part of a CR/LF pair */
  992. return -XML_TOK_PROLOG_S;
  993. }
  994. /* fall through */
  995. case BT_S: case BT_LF:
  996. for (;;) {
  997. ptr += MINBPC(enc);
  998. if (! HAS_CHAR(enc, ptr, end))
  999. break;
  1000. switch (BYTE_TYPE(enc, ptr)) {
  1001. case BT_S: case BT_LF:
  1002. break;
  1003. case BT_CR:
  1004. /* don't split CR/LF pair */
  1005. if (ptr + MINBPC(enc) != end)
  1006. break;
  1007. /* fall through */
  1008. default:
  1009. *nextTokPtr = ptr;
  1010. return XML_TOK_PROLOG_S;
  1011. }
  1012. }
  1013. *nextTokPtr = ptr;
  1014. return XML_TOK_PROLOG_S;
  1015. case BT_PERCNT:
  1016. return PREFIX(scanPercent)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  1017. case BT_COMMA:
  1018. *nextTokPtr = ptr + MINBPC(enc);
  1019. return XML_TOK_COMMA;
  1020. case BT_LSQB:
  1021. *nextTokPtr = ptr + MINBPC(enc);
  1022. return XML_TOK_OPEN_BRACKET;
  1023. case BT_RSQB:
  1024. ptr += MINBPC(enc);
  1025. if (! HAS_CHAR(enc, ptr, end))
  1026. return -XML_TOK_CLOSE_BRACKET;
  1027. if (CHAR_MATCHES(enc, ptr, ASCII_RSQB)) {
  1028. REQUIRE_CHARS(enc, ptr, end, 2);
  1029. if (CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_GT)) {
  1030. *nextTokPtr = ptr + 2*MINBPC(enc);
  1031. return XML_TOK_COND_SECT_CLOSE;
  1032. }
  1033. }
  1034. *nextTokPtr = ptr;
  1035. return XML_TOK_CLOSE_BRACKET;
  1036. case BT_LPAR:
  1037. *nextTokPtr = ptr + MINBPC(enc);
  1038. return XML_TOK_OPEN_PAREN;
  1039. case BT_RPAR:
  1040. ptr += MINBPC(enc);
  1041. if (! HAS_CHAR(enc, ptr, end))
  1042. return -XML_TOK_CLOSE_PAREN;
  1043. switch (BYTE_TYPE(enc, ptr)) {
  1044. case BT_AST:
  1045. *nextTokPtr = ptr + MINBPC(enc);
  1046. return XML_TOK_CLOSE_PAREN_ASTERISK;
  1047. case BT_QUEST:
  1048. *nextTokPtr = ptr + MINBPC(enc);
  1049. return XML_TOK_CLOSE_PAREN_QUESTION;
  1050. case BT_PLUS:
  1051. *nextTokPtr = ptr + MINBPC(enc);
  1052. return XML_TOK_CLOSE_PAREN_PLUS;
  1053. case BT_CR: case BT_LF: case BT_S:
  1054. case BT_GT: case BT_COMMA: case BT_VERBAR:
  1055. case BT_RPAR:
  1056. *nextTokPtr = ptr;
  1057. return XML_TOK_CLOSE_PAREN;
  1058. }
  1059. *nextTokPtr = ptr;
  1060. return XML_TOK_INVALID;
  1061. case BT_VERBAR:
  1062. *nextTokPtr = ptr + MINBPC(enc);
  1063. return XML_TOK_OR;
  1064. case BT_GT:
  1065. *nextTokPtr = ptr + MINBPC(enc);
  1066. return XML_TOK_DECL_CLOSE;
  1067. case BT_NUM:
  1068. return PREFIX(scanPoundName)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  1069. #define LEAD_CASE(n) \
  1070. case BT_LEAD ## n: \
  1071. if (end - ptr < n) \
  1072. return XML_TOK_PARTIAL_CHAR; \
  1073. if (IS_NMSTRT_CHAR(enc, ptr, n)) { \
  1074. ptr += n; \
  1075. tok = XML_TOK_NAME; \
  1076. break; \
  1077. } \
  1078. if (IS_NAME_CHAR(enc, ptr, n)) { \
  1079. ptr += n; \
  1080. tok = XML_TOK_NMTOKEN; \
  1081. break; \
  1082. } \
  1083. *nextTokPtr = ptr; \
  1084. return XML_TOK_INVALID;
  1085. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1086. #undef LEAD_CASE
  1087. case BT_NMSTRT:
  1088. case BT_HEX:
  1089. tok = XML_TOK_NAME;
  1090. ptr += MINBPC(enc);
  1091. break;
  1092. case BT_DIGIT:
  1093. case BT_NAME:
  1094. case BT_MINUS:
  1095. #ifdef XML_NS
  1096. case BT_COLON:
  1097. #endif
  1098. tok = XML_TOK_NMTOKEN;
  1099. ptr += MINBPC(enc);
  1100. break;
  1101. case BT_NONASCII:
  1102. if (IS_NMSTRT_CHAR_MINBPC(enc, ptr)) {
  1103. ptr += MINBPC(enc);
  1104. tok = XML_TOK_NAME;
  1105. break;
  1106. }
  1107. if (IS_NAME_CHAR_MINBPC(enc, ptr)) {
  1108. ptr += MINBPC(enc);
  1109. tok = XML_TOK_NMTOKEN;
  1110. break;
  1111. }
  1112. /* fall through */
  1113. default:
  1114. *nextTokPtr = ptr;
  1115. return XML_TOK_INVALID;
  1116. }
  1117. while (HAS_CHAR(enc, ptr, end)) {
  1118. switch (BYTE_TYPE(enc, ptr)) {
  1119. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  1120. case BT_GT: case BT_RPAR: case BT_COMMA:
  1121. case BT_VERBAR: case BT_LSQB: case BT_PERCNT:
  1122. case BT_S: case BT_CR: case BT_LF:
  1123. *nextTokPtr = ptr;
  1124. return tok;
  1125. #ifdef XML_NS
  1126. case BT_COLON:
  1127. ptr += MINBPC(enc);
  1128. switch (tok) {
  1129. case XML_TOK_NAME:
  1130. REQUIRE_CHAR(enc, ptr, end);
  1131. tok = XML_TOK_PREFIXED_NAME;
  1132. switch (BYTE_TYPE(enc, ptr)) {
  1133. CHECK_NAME_CASES(enc, ptr, end, nextTokPtr)
  1134. default:
  1135. tok = XML_TOK_NMTOKEN;
  1136. break;
  1137. }
  1138. break;
  1139. case XML_TOK_PREFIXED_NAME:
  1140. tok = XML_TOK_NMTOKEN;
  1141. break;
  1142. }
  1143. break;
  1144. #endif
  1145. case BT_PLUS:
  1146. if (tok == XML_TOK_NMTOKEN) {
  1147. *nextTokPtr = ptr;
  1148. return XML_TOK_INVALID;
  1149. }
  1150. *nextTokPtr = ptr + MINBPC(enc);
  1151. return XML_TOK_NAME_PLUS;
  1152. case BT_AST:
  1153. if (tok == XML_TOK_NMTOKEN) {
  1154. *nextTokPtr = ptr;
  1155. return XML_TOK_INVALID;
  1156. }
  1157. *nextTokPtr = ptr + MINBPC(enc);
  1158. return XML_TOK_NAME_ASTERISK;
  1159. case BT_QUEST:
  1160. if (tok == XML_TOK_NMTOKEN) {
  1161. *nextTokPtr = ptr;
  1162. return XML_TOK_INVALID;
  1163. }
  1164. *nextTokPtr = ptr + MINBPC(enc);
  1165. return XML_TOK_NAME_QUESTION;
  1166. default:
  1167. *nextTokPtr = ptr;
  1168. return XML_TOK_INVALID;
  1169. }
  1170. }
  1171. return -tok;
  1172. }
  1173. static int PTRCALL
  1174. PREFIX(attributeValueTok)(const ENCODING *enc, const char *ptr,
  1175. const char *end, const char **nextTokPtr)
  1176. {
  1177. const char *start;
  1178. if (ptr >= end)
  1179. return XML_TOK_NONE;
  1180. else if (! HAS_CHAR(enc, ptr, end)) {
  1181. /* This line cannot be executed. The incoming data has already
  1182. * been tokenized once, so incomplete characters like this have
  1183. * already been eliminated from the input. Retaining the paranoia
  1184. * check is still valuable, however.
  1185. */
  1186. return XML_TOK_PARTIAL; /* LCOV_EXCL_LINE */
  1187. }
  1188. start = ptr;
  1189. while (HAS_CHAR(enc, ptr, end)) {
  1190. switch (BYTE_TYPE(enc, ptr)) {
  1191. #define LEAD_CASE(n) \
  1192. case BT_LEAD ## n: ptr += n; break;
  1193. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1194. #undef LEAD_CASE
  1195. case BT_AMP:
  1196. if (ptr == start)
  1197. return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  1198. *nextTokPtr = ptr;
  1199. return XML_TOK_DATA_CHARS;
  1200. case BT_LT:
  1201. /* this is for inside entity references */
  1202. *nextTokPtr = ptr;
  1203. return XML_TOK_INVALID;
  1204. case BT_LF:
  1205. if (ptr == start) {
  1206. *nextTokPtr = ptr + MINBPC(enc);
  1207. return XML_TOK_DATA_NEWLINE;
  1208. }
  1209. *nextTokPtr = ptr;
  1210. return XML_TOK_DATA_CHARS;
  1211. case BT_CR:
  1212. if (ptr == start) {
  1213. ptr += MINBPC(enc);
  1214. if (! HAS_CHAR(enc, ptr, end))
  1215. return XML_TOK_TRAILING_CR;
  1216. if (BYTE_TYPE(enc, ptr) == BT_LF)
  1217. ptr += MINBPC(enc);
  1218. *nextTokPtr = ptr;
  1219. return XML_TOK_DATA_NEWLINE;
  1220. }
  1221. *nextTokPtr = ptr;
  1222. return XML_TOK_DATA_CHARS;
  1223. case BT_S:
  1224. if (ptr == start) {
  1225. *nextTokPtr = ptr + MINBPC(enc);
  1226. return XML_TOK_ATTRIBUTE_VALUE_S;
  1227. }
  1228. *nextTokPtr = ptr;
  1229. return XML_TOK_DATA_CHARS;
  1230. default:
  1231. ptr += MINBPC(enc);
  1232. break;
  1233. }
  1234. }
  1235. *nextTokPtr = ptr;
  1236. return XML_TOK_DATA_CHARS;
  1237. }
  1238. static int PTRCALL
  1239. PREFIX(entityValueTok)(const ENCODING *enc, const char *ptr,
  1240. const char *end, const char **nextTokPtr)
  1241. {
  1242. const char *start;
  1243. if (ptr >= end)
  1244. return XML_TOK_NONE;
  1245. else if (! HAS_CHAR(enc, ptr, end)) {
  1246. /* This line cannot be executed. The incoming data has already
  1247. * been tokenized once, so incomplete characters like this have
  1248. * already been eliminated from the input. Retaining the paranoia
  1249. * check is still valuable, however.
  1250. */
  1251. return XML_TOK_PARTIAL; /* LCOV_EXCL_LINE */
  1252. }
  1253. start = ptr;
  1254. while (HAS_CHAR(enc, ptr, end)) {
  1255. switch (BYTE_TYPE(enc, ptr)) {
  1256. #define LEAD_CASE(n) \
  1257. case BT_LEAD ## n: ptr += n; break;
  1258. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1259. #undef LEAD_CASE
  1260. case BT_AMP:
  1261. if (ptr == start)
  1262. return PREFIX(scanRef)(enc, ptr + MINBPC(enc), end, nextTokPtr);
  1263. *nextTokPtr = ptr;
  1264. return XML_TOK_DATA_CHARS;
  1265. case BT_PERCNT:
  1266. if (ptr == start) {
  1267. int tok = PREFIX(scanPercent)(enc, ptr + MINBPC(enc),
  1268. end, nextTokPtr);
  1269. return (tok == XML_TOK_PERCENT) ? XML_TOK_INVALID : tok;
  1270. }
  1271. *nextTokPtr = ptr;
  1272. return XML_TOK_DATA_CHARS;
  1273. case BT_LF:
  1274. if (ptr == start) {
  1275. *nextTokPtr = ptr + MINBPC(enc);
  1276. return XML_TOK_DATA_NEWLINE;
  1277. }
  1278. *nextTokPtr = ptr;
  1279. return XML_TOK_DATA_CHARS;
  1280. case BT_CR:
  1281. if (ptr == start) {
  1282. ptr += MINBPC(enc);
  1283. if (! HAS_CHAR(enc, ptr, end))
  1284. return XML_TOK_TRAILING_CR;
  1285. if (BYTE_TYPE(enc, ptr) == BT_LF)
  1286. ptr += MINBPC(enc);
  1287. *nextTokPtr = ptr;
  1288. return XML_TOK_DATA_NEWLINE;
  1289. }
  1290. *nextTokPtr = ptr;
  1291. return XML_TOK_DATA_CHARS;
  1292. default:
  1293. ptr += MINBPC(enc);
  1294. break;
  1295. }
  1296. }
  1297. *nextTokPtr = ptr;
  1298. return XML_TOK_DATA_CHARS;
  1299. }
  1300. #ifdef XML_DTD
  1301. static int PTRCALL
  1302. PREFIX(ignoreSectionTok)(const ENCODING *enc, const char *ptr,
  1303. const char *end, const char **nextTokPtr)
  1304. {
  1305. int level = 0;
  1306. if (MINBPC(enc) > 1) {
  1307. size_t n = end - ptr;
  1308. if (n & (MINBPC(enc) - 1)) {
  1309. n &= ~(MINBPC(enc) - 1);
  1310. end = ptr + n;
  1311. }
  1312. }
  1313. while (HAS_CHAR(enc, ptr, end)) {
  1314. switch (BYTE_TYPE(enc, ptr)) {
  1315. INVALID_CASES(ptr, nextTokPtr)
  1316. case BT_LT:
  1317. ptr += MINBPC(enc);
  1318. REQUIRE_CHAR(enc, ptr, end);
  1319. if (CHAR_MATCHES(enc, ptr, ASCII_EXCL)) {
  1320. ptr += MINBPC(enc);
  1321. REQUIRE_CHAR(enc, ptr, end);
  1322. if (CHAR_MATCHES(enc, ptr, ASCII_LSQB)) {
  1323. ++level;
  1324. ptr += MINBPC(enc);
  1325. }
  1326. }
  1327. break;
  1328. case BT_RSQB:
  1329. ptr += MINBPC(enc);
  1330. REQUIRE_CHAR(enc, ptr, end);
  1331. if (CHAR_MATCHES(enc, ptr, ASCII_RSQB)) {
  1332. ptr += MINBPC(enc);
  1333. REQUIRE_CHAR(enc, ptr, end);
  1334. if (CHAR_MATCHES(enc, ptr, ASCII_GT)) {
  1335. ptr += MINBPC(enc);
  1336. if (level == 0) {
  1337. *nextTokPtr = ptr;
  1338. return XML_TOK_IGNORE_SECT;
  1339. }
  1340. --level;
  1341. }
  1342. }
  1343. break;
  1344. default:
  1345. ptr += MINBPC(enc);
  1346. break;
  1347. }
  1348. }
  1349. return XML_TOK_PARTIAL;
  1350. }
  1351. #endif /* XML_DTD */
  1352. static int PTRCALL
  1353. PREFIX(isPublicId)(const ENCODING *enc, const char *ptr, const char *end,
  1354. const char **badPtr)
  1355. {
  1356. ptr += MINBPC(enc);
  1357. end -= MINBPC(enc);
  1358. for (; HAS_CHAR(enc, ptr, end); ptr += MINBPC(enc)) {
  1359. switch (BYTE_TYPE(enc, ptr)) {
  1360. case BT_DIGIT:
  1361. case BT_HEX:
  1362. case BT_MINUS:
  1363. case BT_APOS:
  1364. case BT_LPAR:
  1365. case BT_RPAR:
  1366. case BT_PLUS:
  1367. case BT_COMMA:
  1368. case BT_SOL:
  1369. case BT_EQUALS:
  1370. case BT_QUEST:
  1371. case BT_CR:
  1372. case BT_LF:
  1373. case BT_SEMI:
  1374. case BT_EXCL:
  1375. case BT_AST:
  1376. case BT_PERCNT:
  1377. case BT_NUM:
  1378. #ifdef XML_NS
  1379. case BT_COLON:
  1380. #endif
  1381. break;
  1382. case BT_S:
  1383. if (CHAR_MATCHES(enc, ptr, ASCII_TAB)) {
  1384. *badPtr = ptr;
  1385. return 0;
  1386. }
  1387. break;
  1388. case BT_NAME:
  1389. case BT_NMSTRT:
  1390. if (!(BYTE_TO_ASCII(enc, ptr) & ~0x7f))
  1391. break;
  1392. default:
  1393. switch (BYTE_TO_ASCII(enc, ptr)) {
  1394. case 0x24: /* $ */
  1395. case 0x40: /* @ */
  1396. break;
  1397. default:
  1398. *badPtr = ptr;
  1399. return 0;
  1400. }
  1401. break;
  1402. }
  1403. }
  1404. return 1;
  1405. }
  1406. /* This must only be called for a well-formed start-tag or empty
  1407. element tag. Returns the number of attributes. Pointers to the
  1408. first attsMax attributes are stored in atts.
  1409. */
  1410. static int PTRCALL
  1411. PREFIX(getAtts)(const ENCODING *enc, const char *ptr,
  1412. int attsMax, ATTRIBUTE *atts)
  1413. {
  1414. enum { other, inName, inValue } state = inName;
  1415. int nAtts = 0;
  1416. int open = 0; /* defined when state == inValue;
  1417. initialization just to shut up compilers */
  1418. for (ptr += MINBPC(enc);; ptr += MINBPC(enc)) {
  1419. switch (BYTE_TYPE(enc, ptr)) {
  1420. #define START_NAME \
  1421. if (state == other) { \
  1422. if (nAtts < attsMax) { \
  1423. atts[nAtts].name = ptr; \
  1424. atts[nAtts].normalized = 1; \
  1425. } \
  1426. state = inName; \
  1427. }
  1428. #define LEAD_CASE(n) \
  1429. case BT_LEAD ## n: START_NAME ptr += (n - MINBPC(enc)); break;
  1430. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1431. #undef LEAD_CASE
  1432. case BT_NONASCII:
  1433. case BT_NMSTRT:
  1434. case BT_HEX:
  1435. START_NAME
  1436. break;
  1437. #undef START_NAME
  1438. case BT_QUOT:
  1439. if (state != inValue) {
  1440. if (nAtts < attsMax)
  1441. atts[nAtts].valuePtr = ptr + MINBPC(enc);
  1442. state = inValue;
  1443. open = BT_QUOT;
  1444. }
  1445. else if (open == BT_QUOT) {
  1446. state = other;
  1447. if (nAtts < attsMax)
  1448. atts[nAtts].valueEnd = ptr;
  1449. nAtts++;
  1450. }
  1451. break;
  1452. case BT_APOS:
  1453. if (state != inValue) {
  1454. if (nAtts < attsMax)
  1455. atts[nAtts].valuePtr = ptr + MINBPC(enc);
  1456. state = inValue;
  1457. open = BT_APOS;
  1458. }
  1459. else if (open == BT_APOS) {
  1460. state = other;
  1461. if (nAtts < attsMax)
  1462. atts[nAtts].valueEnd = ptr;
  1463. nAtts++;
  1464. }
  1465. break;
  1466. case BT_AMP:
  1467. if (nAtts < attsMax)
  1468. atts[nAtts].normalized = 0;
  1469. break;
  1470. case BT_S:
  1471. if (state == inName)
  1472. state = other;
  1473. else if (state == inValue
  1474. && nAtts < attsMax
  1475. && atts[nAtts].normalized
  1476. && (ptr == atts[nAtts].valuePtr
  1477. || BYTE_TO_ASCII(enc, ptr) != ASCII_SPACE
  1478. || BYTE_TO_ASCII(enc, ptr + MINBPC(enc)) == ASCII_SPACE
  1479. || BYTE_TYPE(enc, ptr + MINBPC(enc)) == open))
  1480. atts[nAtts].normalized = 0;
  1481. break;
  1482. case BT_CR: case BT_LF:
  1483. /* This case ensures that the first attribute name is counted
  1484. Apart from that we could just change state on the quote. */
  1485. if (state == inName)
  1486. state = other;
  1487. else if (state == inValue && nAtts < attsMax)
  1488. atts[nAtts].normalized = 0;
  1489. break;
  1490. case BT_GT:
  1491. case BT_SOL:
  1492. if (state != inValue)
  1493. return nAtts;
  1494. break;
  1495. default:
  1496. break;
  1497. }
  1498. }
  1499. /* not reached */
  1500. }
  1501. static int PTRFASTCALL
  1502. PREFIX(charRefNumber)(const ENCODING *UNUSED_P(enc), const char *ptr)
  1503. {
  1504. int result = 0;
  1505. /* skip &# */
  1506. ptr += 2*MINBPC(enc);
  1507. if (CHAR_MATCHES(enc, ptr, ASCII_x)) {
  1508. for (ptr += MINBPC(enc);
  1509. !CHAR_MATCHES(enc, ptr, ASCII_SEMI);
  1510. ptr += MINBPC(enc)) {
  1511. int c = BYTE_TO_ASCII(enc, ptr);
  1512. switch (c) {
  1513. case ASCII_0: case ASCII_1: case ASCII_2: case ASCII_3: case ASCII_4:
  1514. case ASCII_5: case ASCII_6: case ASCII_7: case ASCII_8: case ASCII_9:
  1515. result <<= 4;
  1516. result |= (c - ASCII_0);
  1517. break;
  1518. case ASCII_A: case ASCII_B: case ASCII_C:
  1519. case ASCII_D: case ASCII_E: case ASCII_F:
  1520. result <<= 4;
  1521. result += 10 + (c - ASCII_A);
  1522. break;
  1523. case ASCII_a: case ASCII_b: case ASCII_c:
  1524. case ASCII_d: case ASCII_e: case ASCII_f:
  1525. result <<= 4;
  1526. result += 10 + (c - ASCII_a);
  1527. break;
  1528. }
  1529. if (result >= 0x110000)
  1530. return -1;
  1531. }
  1532. }
  1533. else {
  1534. for (; !CHAR_MATCHES(enc, ptr, ASCII_SEMI); ptr += MINBPC(enc)) {
  1535. int c = BYTE_TO_ASCII(enc, ptr);
  1536. result *= 10;
  1537. result += (c - ASCII_0);
  1538. if (result >= 0x110000)
  1539. return -1;
  1540. }
  1541. }
  1542. return checkCharRefNumber(result);
  1543. }
  1544. static int PTRCALL
  1545. PREFIX(predefinedEntityName)(const ENCODING *UNUSED_P(enc), const char *ptr,
  1546. const char *end)
  1547. {
  1548. switch ((end - ptr)/MINBPC(enc)) {
  1549. case 2:
  1550. if (CHAR_MATCHES(enc, ptr + MINBPC(enc), ASCII_t)) {
  1551. switch (BYTE_TO_ASCII(enc, ptr)) {
  1552. case ASCII_l:
  1553. return ASCII_LT;
  1554. case ASCII_g:
  1555. return ASCII_GT;
  1556. }
  1557. }
  1558. break;
  1559. case 3:
  1560. if (CHAR_MATCHES(enc, ptr, ASCII_a)) {
  1561. ptr += MINBPC(enc);
  1562. if (CHAR_MATCHES(enc, ptr, ASCII_m)) {
  1563. ptr += MINBPC(enc);
  1564. if (CHAR_MATCHES(enc, ptr, ASCII_p))
  1565. return ASCII_AMP;
  1566. }
  1567. }
  1568. break;
  1569. case 4:
  1570. switch (BYTE_TO_ASCII(enc, ptr)) {
  1571. case ASCII_q:
  1572. ptr += MINBPC(enc);
  1573. if (CHAR_MATCHES(enc, ptr, ASCII_u)) {
  1574. ptr += MINBPC(enc);
  1575. if (CHAR_MATCHES(enc, ptr, ASCII_o)) {
  1576. ptr += MINBPC(enc);
  1577. if (CHAR_MATCHES(enc, ptr, ASCII_t))
  1578. return ASCII_QUOT;
  1579. }
  1580. }
  1581. break;
  1582. case ASCII_a:
  1583. ptr += MINBPC(enc);
  1584. if (CHAR_MATCHES(enc, ptr, ASCII_p)) {
  1585. ptr += MINBPC(enc);
  1586. if (CHAR_MATCHES(enc, ptr, ASCII_o)) {
  1587. ptr += MINBPC(enc);
  1588. if (CHAR_MATCHES(enc, ptr, ASCII_s))
  1589. return ASCII_APOS;
  1590. }
  1591. }
  1592. break;
  1593. }
  1594. }
  1595. return 0;
  1596. }
  1597. static int PTRCALL
  1598. PREFIX(nameMatchesAscii)(const ENCODING *UNUSED_P(enc), const char *ptr1,
  1599. const char *end1, const char *ptr2)
  1600. {
  1601. for (; *ptr2; ptr1 += MINBPC(enc), ptr2++) {
  1602. if (end1 - ptr1 < MINBPC(enc)) {
  1603. /* This line cannot be executed. THe incoming data has already
  1604. * been tokenized once, so imcomplete characters like this have
  1605. * already been eliminated from the input. Retaining the
  1606. * paranoia check is still valuable, however.
  1607. */
  1608. return 0; /* LCOV_EXCL_LINE */
  1609. }
  1610. if (!CHAR_MATCHES(enc, ptr1, *ptr2))
  1611. return 0;
  1612. }
  1613. return ptr1 == end1;
  1614. }
  1615. static int PTRFASTCALL
  1616. PREFIX(nameLength)(const ENCODING *enc, const char *ptr)
  1617. {
  1618. const char *start = ptr;
  1619. for (;;) {
  1620. switch (BYTE_TYPE(enc, ptr)) {
  1621. #define LEAD_CASE(n) \
  1622. case BT_LEAD ## n: ptr += n; break;
  1623. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1624. #undef LEAD_CASE
  1625. case BT_NONASCII:
  1626. case BT_NMSTRT:
  1627. #ifdef XML_NS
  1628. case BT_COLON:
  1629. #endif
  1630. case BT_HEX:
  1631. case BT_DIGIT:
  1632. case BT_NAME:
  1633. case BT_MINUS:
  1634. ptr += MINBPC(enc);
  1635. break;
  1636. default:
  1637. return (int)(ptr - start);
  1638. }
  1639. }
  1640. }
  1641. static const char * PTRFASTCALL
  1642. PREFIX(skipS)(const ENCODING *enc, const char *ptr)
  1643. {
  1644. for (;;) {
  1645. switch (BYTE_TYPE(enc, ptr)) {
  1646. case BT_LF:
  1647. case BT_CR:
  1648. case BT_S:
  1649. ptr += MINBPC(enc);
  1650. break;
  1651. default:
  1652. return ptr;
  1653. }
  1654. }
  1655. }
  1656. static void PTRCALL
  1657. PREFIX(updatePosition)(const ENCODING *enc,
  1658. const char *ptr,
  1659. const char *end,
  1660. POSITION *pos)
  1661. {
  1662. while (HAS_CHAR(enc, ptr, end)) {
  1663. switch (BYTE_TYPE(enc, ptr)) {
  1664. #define LEAD_CASE(n) \
  1665. case BT_LEAD ## n: \
  1666. if (end - ptr < n) { \
  1667. return; \
  1668. } \
  1669. ptr += n; \
  1670. break;
  1671. LEAD_CASE(2) LEAD_CASE(3) LEAD_CASE(4)
  1672. #undef LEAD_CASE
  1673. case BT_LF:
  1674. pos->columnNumber = (XML_Size)-1;
  1675. pos->lineNumber++;
  1676. ptr += MINBPC(enc);
  1677. break;
  1678. case BT_CR:
  1679. pos->lineNumber++;
  1680. ptr += MINBPC(enc);
  1681. if (HAS_CHAR(enc, ptr, end) && BYTE_TYPE(enc, ptr) == BT_LF)
  1682. ptr += MINBPC(enc);
  1683. pos->columnNumber = (XML_Size)-1;
  1684. break;
  1685. default:
  1686. ptr += MINBPC(enc);
  1687. break;
  1688. }
  1689. pos->columnNumber++;
  1690. }
  1691. }
  1692. #undef DO_LEAD_CASE
  1693. #undef MULTIBYTE_CASES
  1694. #undef INVALID_CASES
  1695. #undef CHECK_NAME_CASE
  1696. #undef CHECK_NAME_CASES
  1697. #undef CHECK_NMSTRT_CASE
  1698. #undef CHECK_NMSTRT_CASES
  1699. #endif /* XML_TOK_IMPL_C */