xmlparse.c 281 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571
  1. /* c5625880f4bf417c1463deee4eb92d86ff413f802048621c57e25fe483eb59e4 (2.6.4+)
  2. __ __ _
  3. ___\ \/ /_ __ __ _| |_
  4. / _ \\ /| '_ \ / _` | __|
  5. | __// \| |_) | (_| | |_
  6. \___/_/\_\ .__/ \__,_|\__|
  7. |_| XML parser
  8. Copyright (c) 1997-2000 Thai Open Source Software Center Ltd
  9. Copyright (c) 2000 Clark Cooper <coopercc@users.sourceforge.net>
  10. Copyright (c) 2000-2006 Fred L. Drake, Jr. <fdrake@users.sourceforge.net>
  11. Copyright (c) 2001-2002 Greg Stein <gstein@users.sourceforge.net>
  12. Copyright (c) 2002-2016 Karl Waclawek <karl@waclawek.net>
  13. Copyright (c) 2005-2009 Steven Solie <steven@solie.ca>
  14. Copyright (c) 2016 Eric Rahm <erahm@mozilla.com>
  15. Copyright (c) 2016-2024 Sebastian Pipping <sebastian@pipping.org>
  16. Copyright (c) 2016 Gaurav <g.gupta@samsung.com>
  17. Copyright (c) 2016 Thomas Beutlich <tc@tbeu.de>
  18. Copyright (c) 2016 Gustavo Grieco <gustavo.grieco@imag.fr>
  19. Copyright (c) 2016 Pascal Cuoq <cuoq@trust-in-soft.com>
  20. Copyright (c) 2016 Ed Schouten <ed@nuxi.nl>
  21. Copyright (c) 2017-2022 Rhodri James <rhodri@wildebeest.org.uk>
  22. Copyright (c) 2017 Václav Slavík <vaclav@slavik.io>
  23. Copyright (c) 2017 Viktor Szakats <commit@vsz.me>
  24. Copyright (c) 2017 Chanho Park <chanho61.park@samsung.com>
  25. Copyright (c) 2017 Rolf Eike Beer <eike@sf-mail.de>
  26. Copyright (c) 2017 Hans Wennborg <hans@chromium.org>
  27. Copyright (c) 2018 Anton Maklakov <antmak.pub@gmail.com>
  28. Copyright (c) 2018 Benjamin Peterson <benjamin@python.org>
  29. Copyright (c) 2018 Marco Maggi <marco.maggi-ipsu@poste.it>
  30. Copyright (c) 2018 Mariusz Zaborski <oshogbo@vexillium.org>
  31. Copyright (c) 2019 David Loffredo <loffredo@steptools.com>
  32. Copyright (c) 2019-2020 Ben Wagner <bungeman@chromium.org>
  33. Copyright (c) 2019 Vadim Zeitlin <vadim@zeitlins.org>
  34. Copyright (c) 2021 Donghee Na <donghee.na@python.org>
  35. Copyright (c) 2022 Samanta Navarro <ferivoz@riseup.net>
  36. Copyright (c) 2022 Jeffrey Walton <noloader@gmail.com>
  37. Copyright (c) 2022 Jann Horn <jannh@google.com>
  38. Copyright (c) 2022 Sean McBride <sean@rogue-research.com>
  39. Copyright (c) 2023 Owain Davies <owaind@bath.edu>
  40. Copyright (c) 2023-2024 Sony Corporation / Snild Dolkow <snild@sony.com>
  41. Copyright (c) 2024 Berkay Eren Ürün <berkay.ueruen@siemens.com>
  42. Copyright (c) 2024 Hanno Böck <hanno@gentoo.org>
  43. Licensed under the MIT license:
  44. Permission is hereby granted, free of charge, to any person obtaining
  45. a copy of this software and associated documentation files (the
  46. "Software"), to deal in the Software without restriction, including
  47. without limitation the rights to use, copy, modify, merge, publish,
  48. distribute, sublicense, and/or sell copies of the Software, and to permit
  49. persons to whom the Software is furnished to do so, subject to the
  50. following conditions:
  51. The above copyright notice and this permission notice shall be included
  52. in all copies or substantial portions of the Software.
  53. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  54. EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  55. MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
  56. NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
  57. DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
  58. OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
  59. USE OR OTHER DEALINGS IN THE SOFTWARE.
  60. */
  61. #define XML_BUILDING_EXPAT 1
  62. #include "expat_config.h"
  63. #if ! defined(XML_GE) || (1 - XML_GE - 1 == 2) || (XML_GE < 0) || (XML_GE > 1)
  64. # error XML_GE (for general entities) must be defined, non-empty, either 1 or 0 (0 to disable, 1 to enable; 1 is a common default)
  65. #endif
  66. #if defined(XML_DTD) && XML_GE == 0
  67. # error Either undefine XML_DTD or define XML_GE to 1.
  68. #endif
  69. #if ! defined(XML_CONTEXT_BYTES) || (1 - XML_CONTEXT_BYTES - 1 == 2) \
  70. || (XML_CONTEXT_BYTES + 0 < 0)
  71. # error XML_CONTEXT_BYTES must be defined, non-empty and >=0 (0 to disable, >=1 to enable; 1024 is a common default)
  72. #endif
  73. #if defined(HAVE_SYSCALL_GETRANDOM)
  74. # if ! defined(_GNU_SOURCE)
  75. # define _GNU_SOURCE 1 /* syscall prototype */
  76. # endif
  77. #endif
  78. #ifdef _WIN32
  79. /* force stdlib to define rand_s() */
  80. # if ! defined(_CRT_RAND_S)
  81. # define _CRT_RAND_S
  82. # endif
  83. #endif
  84. #include <stdbool.h>
  85. #include <stddef.h>
  86. #include <string.h> /* memset(), memcpy() */
  87. #include <assert.h>
  88. #include <limits.h> /* UINT_MAX */
  89. #include <stdio.h> /* fprintf */
  90. #include <stdlib.h> /* getenv, rand_s */
  91. #include <stdint.h> /* uintptr_t */
  92. #include <math.h> /* isnan */
  93. #ifdef _WIN32
  94. # define getpid GetCurrentProcessId
  95. #else
  96. # include <sys/time.h> /* gettimeofday() */
  97. # include <sys/types.h> /* getpid() */
  98. # include <unistd.h> /* getpid() */
  99. # include <fcntl.h> /* O_RDONLY */
  100. # include <errno.h>
  101. #endif
  102. #ifdef _WIN32
  103. # include "winconfig.h"
  104. #endif
  105. #include "ascii.h"
  106. #include "expat.h"
  107. #include "siphash.h"
  108. #if defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)
  109. # if defined(HAVE_GETRANDOM)
  110. # include <sys/random.h> /* getrandom */
  111. # else
  112. # include <unistd.h> /* syscall */
  113. # include <sys/syscall.h> /* SYS_getrandom */
  114. # endif
  115. # if ! defined(GRND_NONBLOCK)
  116. # define GRND_NONBLOCK 0x0001
  117. # endif /* defined(GRND_NONBLOCK) */
  118. #endif /* defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM) */
  119. #if defined(HAVE_LIBBSD) \
  120. && (defined(HAVE_ARC4RANDOM_BUF) || defined(HAVE_ARC4RANDOM))
  121. # error #include <bsd/stdlib.h>
  122. #endif
  123. #if defined(_WIN32) && ! defined(LOAD_LIBRARY_SEARCH_SYSTEM32)
  124. # define LOAD_LIBRARY_SEARCH_SYSTEM32 0x00000800
  125. #endif
  126. #if ! defined(HAVE_GETRANDOM) && ! defined(HAVE_SYSCALL_GETRANDOM) \
  127. && ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) \
  128. && ! defined(XML_DEV_URANDOM) && ! defined(_WIN32) \
  129. && ! defined(XML_POOR_ENTROPY)
  130. # error You do not have support for any sources of high quality entropy \
  131. enabled. For end user security, that is probably not what you want. \
  132. \
  133. Your options include: \
  134. * Linux >=3.17 + glibc >=2.25 (getrandom): HAVE_GETRANDOM, \
  135. * Linux >=3.17 + glibc (including <2.25) (syscall SYS_getrandom): HAVE_SYSCALL_GETRANDOM, \
  136. * BSD / macOS >=10.7 / glibc >=2.36 (arc4random_buf): HAVE_ARC4RANDOM_BUF, \
  137. * BSD / macOS (including <10.7) / glibc >=2.36 (arc4random): HAVE_ARC4RANDOM, \
  138. * libbsd (arc4random_buf): HAVE_ARC4RANDOM_BUF + HAVE_LIBBSD, \
  139. * libbsd (arc4random): HAVE_ARC4RANDOM + HAVE_LIBBSD, \
  140. * Linux (including <3.17) / BSD / macOS (including <10.7) / Solaris >=8 (/dev/urandom): XML_DEV_URANDOM, \
  141. * Windows >=Vista (rand_s): _WIN32. \
  142. \
  143. If insist on not using any of these, bypass this error by defining \
  144. XML_POOR_ENTROPY; you have been warned. \
  145. \
  146. If you have reasons to patch this detection code away or need changes \
  147. to the build system, please open a bug. Thank you!
  148. #endif
  149. #ifdef XML_UNICODE
  150. # define XML_ENCODE_MAX XML_UTF16_ENCODE_MAX
  151. # define XmlConvert XmlUtf16Convert
  152. # define XmlGetInternalEncoding XmlGetUtf16InternalEncoding
  153. # define XmlGetInternalEncodingNS XmlGetUtf16InternalEncodingNS
  154. # define XmlEncode XmlUtf16Encode
  155. # define MUST_CONVERT(enc, s) (! (enc)->isUtf16 || (((uintptr_t)(s)) & 1))
  156. typedef unsigned short ICHAR;
  157. #else
  158. # define XML_ENCODE_MAX XML_UTF8_ENCODE_MAX
  159. # define XmlConvert XmlUtf8Convert
  160. # define XmlGetInternalEncoding XmlGetUtf8InternalEncoding
  161. # define XmlGetInternalEncodingNS XmlGetUtf8InternalEncodingNS
  162. # define XmlEncode XmlUtf8Encode
  163. # define MUST_CONVERT(enc, s) (! (enc)->isUtf8)
  164. typedef char ICHAR;
  165. #endif
  166. #ifndef XML_NS
  167. # define XmlInitEncodingNS XmlInitEncoding
  168. # define XmlInitUnknownEncodingNS XmlInitUnknownEncoding
  169. # undef XmlGetInternalEncodingNS
  170. # define XmlGetInternalEncodingNS XmlGetInternalEncoding
  171. # define XmlParseXmlDeclNS XmlParseXmlDecl
  172. #endif
  173. #ifdef XML_UNICODE
  174. # ifdef XML_UNICODE_WCHAR_T
  175. # define XML_T(x) (const wchar_t) x
  176. # define XML_L(x) L##x
  177. # else
  178. # define XML_T(x) (const unsigned short)x
  179. # define XML_L(x) x
  180. # endif
  181. #else
  182. # define XML_T(x) x
  183. # define XML_L(x) x
  184. #endif
  185. /* Round up n to be a multiple of sz, where sz is a power of 2. */
  186. #define ROUND_UP(n, sz) (((n) + ((sz) - 1)) & ~((sz) - 1))
  187. /* Do safe (NULL-aware) pointer arithmetic */
  188. #define EXPAT_SAFE_PTR_DIFF(p, q) (((p) && (q)) ? ((p) - (q)) : 0)
  189. #define EXPAT_MIN(a, b) (((a) < (b)) ? (a) : (b))
  190. #include "internal.h"
  191. #include "xmltok.h"
  192. #include "xmlrole.h"
  193. typedef const XML_Char *KEY;
  194. typedef struct {
  195. KEY name;
  196. } NAMED;
  197. typedef struct {
  198. NAMED **v;
  199. unsigned char power;
  200. size_t size;
  201. size_t used;
  202. const XML_Memory_Handling_Suite *mem;
  203. } HASH_TABLE;
  204. static size_t keylen(KEY s);
  205. static void copy_salt_to_sipkey(XML_Parser parser, struct sipkey *key);
  206. /* For probing (after a collision) we need a step size relative prime
  207. to the hash table size, which is a power of 2. We use double-hashing,
  208. since we can calculate a second hash value cheaply by taking those bits
  209. of the first hash value that were discarded (masked out) when the table
  210. index was calculated: index = hash & mask, where mask = table->size - 1.
  211. We limit the maximum step size to table->size / 4 (mask >> 2) and make
  212. it odd, since odd numbers are always relative prime to a power of 2.
  213. */
  214. #define SECOND_HASH(hash, mask, power) \
  215. ((((hash) & ~(mask)) >> ((power) - 1)) & ((mask) >> 2))
  216. #define PROBE_STEP(hash, mask, power) \
  217. ((unsigned char)((SECOND_HASH(hash, mask, power)) | 1))
  218. typedef struct {
  219. NAMED **p;
  220. NAMED **end;
  221. } HASH_TABLE_ITER;
  222. #define INIT_TAG_BUF_SIZE 32 /* must be a multiple of sizeof(XML_Char) */
  223. #define INIT_DATA_BUF_SIZE 1024
  224. #define INIT_ATTS_SIZE 16
  225. #define INIT_ATTS_VERSION 0xFFFFFFFF
  226. #define INIT_BLOCK_SIZE 1024
  227. #define INIT_BUFFER_SIZE 1024
  228. #define EXPAND_SPARE 24
  229. typedef struct binding {
  230. struct prefix *prefix;
  231. struct binding *nextTagBinding;
  232. struct binding *prevPrefixBinding;
  233. const struct attribute_id *attId;
  234. XML_Char *uri;
  235. int uriLen;
  236. int uriAlloc;
  237. } BINDING;
  238. typedef struct prefix {
  239. const XML_Char *name;
  240. BINDING *binding;
  241. } PREFIX;
  242. typedef struct {
  243. const XML_Char *str;
  244. const XML_Char *localPart;
  245. const XML_Char *prefix;
  246. int strLen;
  247. int uriLen;
  248. int prefixLen;
  249. } TAG_NAME;
  250. /* TAG represents an open element.
  251. The name of the element is stored in both the document and API
  252. encodings. The memory buffer 'buf' is a separately-allocated
  253. memory area which stores the name. During the XML_Parse()/
  254. XML_ParseBuffer() when the element is open, the memory for the 'raw'
  255. version of the name (in the document encoding) is shared with the
  256. document buffer. If the element is open across calls to
  257. XML_Parse()/XML_ParseBuffer(), the buffer is re-allocated to
  258. contain the 'raw' name as well.
  259. A parser reuses these structures, maintaining a list of allocated
  260. TAG objects in a free list.
  261. */
  262. typedef struct tag {
  263. struct tag *parent; /* parent of this element */
  264. const char *rawName; /* tagName in the original encoding */
  265. int rawNameLength;
  266. TAG_NAME name; /* tagName in the API encoding */
  267. char *buf; /* buffer for name components */
  268. char *bufEnd; /* end of the buffer */
  269. BINDING *bindings;
  270. } TAG;
  271. typedef struct {
  272. const XML_Char *name;
  273. const XML_Char *textPtr;
  274. int textLen; /* length in XML_Chars */
  275. int processed; /* # of processed bytes - when suspended */
  276. const XML_Char *systemId;
  277. const XML_Char *base;
  278. const XML_Char *publicId;
  279. const XML_Char *notation;
  280. XML_Bool open;
  281. XML_Bool is_param;
  282. XML_Bool is_internal; /* true if declared in internal subset outside PE */
  283. } ENTITY;
  284. typedef struct {
  285. enum XML_Content_Type type;
  286. enum XML_Content_Quant quant;
  287. const XML_Char *name;
  288. int firstchild;
  289. int lastchild;
  290. int childcnt;
  291. int nextsib;
  292. } CONTENT_SCAFFOLD;
  293. #define INIT_SCAFFOLD_ELEMENTS 32
  294. typedef struct block {
  295. struct block *next;
  296. int size;
  297. XML_Char s[1];
  298. } BLOCK;
  299. typedef struct {
  300. BLOCK *blocks;
  301. BLOCK *freeBlocks;
  302. const XML_Char *end;
  303. XML_Char *ptr;
  304. XML_Char *start;
  305. const XML_Memory_Handling_Suite *mem;
  306. } STRING_POOL;
  307. /* The XML_Char before the name is used to determine whether
  308. an attribute has been specified. */
  309. typedef struct attribute_id {
  310. XML_Char *name;
  311. PREFIX *prefix;
  312. XML_Bool maybeTokenized;
  313. XML_Bool xmlns;
  314. } ATTRIBUTE_ID;
  315. typedef struct {
  316. const ATTRIBUTE_ID *id;
  317. XML_Bool isCdata;
  318. const XML_Char *value;
  319. } DEFAULT_ATTRIBUTE;
  320. typedef struct {
  321. unsigned long version;
  322. unsigned long hash;
  323. const XML_Char *uriName;
  324. } NS_ATT;
  325. typedef struct {
  326. const XML_Char *name;
  327. PREFIX *prefix;
  328. const ATTRIBUTE_ID *idAtt;
  329. int nDefaultAtts;
  330. int allocDefaultAtts;
  331. DEFAULT_ATTRIBUTE *defaultAtts;
  332. } ELEMENT_TYPE;
  333. typedef struct {
  334. HASH_TABLE generalEntities;
  335. HASH_TABLE elementTypes;
  336. HASH_TABLE attributeIds;
  337. HASH_TABLE prefixes;
  338. STRING_POOL pool;
  339. STRING_POOL entityValuePool;
  340. /* false once a parameter entity reference has been skipped */
  341. XML_Bool keepProcessing;
  342. /* true once an internal or external PE reference has been encountered;
  343. this includes the reference to an external subset */
  344. XML_Bool hasParamEntityRefs;
  345. XML_Bool standalone;
  346. #ifdef XML_DTD
  347. /* indicates if external PE has been read */
  348. XML_Bool paramEntityRead;
  349. HASH_TABLE paramEntities;
  350. #endif /* XML_DTD */
  351. PREFIX defaultPrefix;
  352. /* === scaffolding for building content model === */
  353. XML_Bool in_eldecl;
  354. CONTENT_SCAFFOLD *scaffold;
  355. unsigned contentStringLen;
  356. unsigned scaffSize;
  357. unsigned scaffCount;
  358. int scaffLevel;
  359. int *scaffIndex;
  360. } DTD;
  361. typedef struct open_internal_entity {
  362. const char *internalEventPtr;
  363. const char *internalEventEndPtr;
  364. struct open_internal_entity *next;
  365. ENTITY *entity;
  366. int startTagLevel;
  367. XML_Bool betweenDecl; /* WFC: PE Between Declarations */
  368. } OPEN_INTERNAL_ENTITY;
  369. enum XML_Account {
  370. XML_ACCOUNT_DIRECT, /* bytes directly passed to the Expat parser */
  371. XML_ACCOUNT_ENTITY_EXPANSION, /* intermediate bytes produced during entity
  372. expansion */
  373. XML_ACCOUNT_NONE /* i.e. do not account, was accounted already */
  374. };
  375. #if XML_GE == 1
  376. typedef unsigned long long XmlBigCount;
  377. typedef struct accounting {
  378. XmlBigCount countBytesDirect;
  379. XmlBigCount countBytesIndirect;
  380. unsigned long debugLevel;
  381. float maximumAmplificationFactor; // >=1.0
  382. unsigned long long activationThresholdBytes;
  383. } ACCOUNTING;
  384. typedef struct entity_stats {
  385. unsigned int countEverOpened;
  386. unsigned int currentDepth;
  387. unsigned int maximumDepthSeen;
  388. unsigned long debugLevel;
  389. } ENTITY_STATS;
  390. #endif /* XML_GE == 1 */
  391. typedef enum XML_Error PTRCALL Processor(XML_Parser parser, const char *start,
  392. const char *end, const char **endPtr);
  393. static Processor prologProcessor;
  394. static Processor prologInitProcessor;
  395. static Processor contentProcessor;
  396. static Processor cdataSectionProcessor;
  397. #ifdef XML_DTD
  398. static Processor ignoreSectionProcessor;
  399. static Processor externalParEntProcessor;
  400. static Processor externalParEntInitProcessor;
  401. static Processor entityValueProcessor;
  402. static Processor entityValueInitProcessor;
  403. #endif /* XML_DTD */
  404. static Processor epilogProcessor;
  405. static Processor errorProcessor;
  406. static Processor externalEntityInitProcessor;
  407. static Processor externalEntityInitProcessor2;
  408. static Processor externalEntityInitProcessor3;
  409. static Processor externalEntityContentProcessor;
  410. static Processor internalEntityProcessor;
  411. static enum XML_Error handleUnknownEncoding(XML_Parser parser,
  412. const XML_Char *encodingName);
  413. static enum XML_Error processXmlDecl(XML_Parser parser, int isGeneralTextEntity,
  414. const char *s, const char *next);
  415. static enum XML_Error initializeEncoding(XML_Parser parser);
  416. static enum XML_Error doProlog(XML_Parser parser, const ENCODING *enc,
  417. const char *s, const char *end, int tok,
  418. const char *next, const char **nextPtr,
  419. XML_Bool haveMore, XML_Bool allowClosingDoctype,
  420. enum XML_Account account);
  421. static enum XML_Error processInternalEntity(XML_Parser parser, ENTITY *entity,
  422. XML_Bool betweenDecl);
  423. static enum XML_Error doContent(XML_Parser parser, int startTagLevel,
  424. const ENCODING *enc, const char *start,
  425. const char *end, const char **endPtr,
  426. XML_Bool haveMore, enum XML_Account account);
  427. static enum XML_Error doCdataSection(XML_Parser parser, const ENCODING *enc,
  428. const char **startPtr, const char *end,
  429. const char **nextPtr, XML_Bool haveMore,
  430. enum XML_Account account);
  431. #ifdef XML_DTD
  432. static enum XML_Error doIgnoreSection(XML_Parser parser, const ENCODING *enc,
  433. const char **startPtr, const char *end,
  434. const char **nextPtr, XML_Bool haveMore);
  435. #endif /* XML_DTD */
  436. static void freeBindings(XML_Parser parser, BINDING *bindings);
  437. static enum XML_Error storeAtts(XML_Parser parser, const ENCODING *enc,
  438. const char *attStr, TAG_NAME *tagNamePtr,
  439. BINDING **bindingsPtr,
  440. enum XML_Account account);
  441. static enum XML_Error addBinding(XML_Parser parser, PREFIX *prefix,
  442. const ATTRIBUTE_ID *attId, const XML_Char *uri,
  443. BINDING **bindingsPtr);
  444. static int defineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *attId,
  445. XML_Bool isCdata, XML_Bool isId,
  446. const XML_Char *value, XML_Parser parser);
  447. static enum XML_Error storeAttributeValue(XML_Parser parser,
  448. const ENCODING *enc, XML_Bool isCdata,
  449. const char *ptr, const char *end,
  450. STRING_POOL *pool,
  451. enum XML_Account account);
  452. static enum XML_Error appendAttributeValue(XML_Parser parser,
  453. const ENCODING *enc,
  454. XML_Bool isCdata, const char *ptr,
  455. const char *end, STRING_POOL *pool,
  456. enum XML_Account account);
  457. static ATTRIBUTE_ID *getAttributeId(XML_Parser parser, const ENCODING *enc,
  458. const char *start, const char *end);
  459. static int setElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *elementType);
  460. #if XML_GE == 1
  461. static enum XML_Error storeEntityValue(XML_Parser parser, const ENCODING *enc,
  462. const char *start, const char *end,
  463. enum XML_Account account);
  464. #else
  465. static enum XML_Error storeSelfEntityValue(XML_Parser parser, ENTITY *entity);
  466. #endif
  467. static int reportProcessingInstruction(XML_Parser parser, const ENCODING *enc,
  468. const char *start, const char *end);
  469. static int reportComment(XML_Parser parser, const ENCODING *enc,
  470. const char *start, const char *end);
  471. static void reportDefault(XML_Parser parser, const ENCODING *enc,
  472. const char *start, const char *end);
  473. static const XML_Char *getContext(XML_Parser parser);
  474. static XML_Bool setContext(XML_Parser parser, const XML_Char *context);
  475. static void FASTCALL normalizePublicId(XML_Char *s);
  476. static DTD *dtdCreate(const XML_Memory_Handling_Suite *ms);
  477. /* do not call if m_parentParser != NULL */
  478. static void dtdReset(DTD *p, const XML_Memory_Handling_Suite *ms);
  479. static void dtdDestroy(DTD *p, XML_Bool isDocEntity,
  480. const XML_Memory_Handling_Suite *ms);
  481. static int dtdCopy(XML_Parser oldParser, DTD *newDtd, const DTD *oldDtd,
  482. const XML_Memory_Handling_Suite *ms);
  483. static int copyEntityTable(XML_Parser oldParser, HASH_TABLE *newTable,
  484. STRING_POOL *newPool, const HASH_TABLE *oldTable);
  485. static NAMED *lookup(XML_Parser parser, HASH_TABLE *table, KEY name,
  486. size_t createSize);
  487. static void FASTCALL hashTableInit(HASH_TABLE *table,
  488. const XML_Memory_Handling_Suite *ms);
  489. static void FASTCALL hashTableClear(HASH_TABLE *table);
  490. static void FASTCALL hashTableDestroy(HASH_TABLE *table);
  491. static void FASTCALL hashTableIterInit(HASH_TABLE_ITER *iter,
  492. const HASH_TABLE *table);
  493. static NAMED *FASTCALL hashTableIterNext(HASH_TABLE_ITER *iter);
  494. static void FASTCALL poolInit(STRING_POOL *pool,
  495. const XML_Memory_Handling_Suite *ms);
  496. static void FASTCALL poolClear(STRING_POOL *pool);
  497. static void FASTCALL poolDestroy(STRING_POOL *pool);
  498. static XML_Char *poolAppend(STRING_POOL *pool, const ENCODING *enc,
  499. const char *ptr, const char *end);
  500. static XML_Char *poolStoreString(STRING_POOL *pool, const ENCODING *enc,
  501. const char *ptr, const char *end);
  502. static XML_Bool FASTCALL poolGrow(STRING_POOL *pool);
  503. static const XML_Char *FASTCALL poolCopyString(STRING_POOL *pool,
  504. const XML_Char *s);
  505. static const XML_Char *poolCopyStringN(STRING_POOL *pool, const XML_Char *s,
  506. int n);
  507. static const XML_Char *FASTCALL poolAppendString(STRING_POOL *pool,
  508. const XML_Char *s);
  509. static int FASTCALL nextScaffoldPart(XML_Parser parser);
  510. static XML_Content *build_model(XML_Parser parser);
  511. static ELEMENT_TYPE *getElementType(XML_Parser parser, const ENCODING *enc,
  512. const char *ptr, const char *end);
  513. static XML_Char *copyString(const XML_Char *s,
  514. const XML_Memory_Handling_Suite *memsuite);
  515. static unsigned long generate_hash_secret_salt(XML_Parser parser);
  516. static XML_Bool startParsing(XML_Parser parser);
  517. static XML_Parser parserCreate(const XML_Char *encodingName,
  518. const XML_Memory_Handling_Suite *memsuite,
  519. const XML_Char *nameSep, DTD *dtd);
  520. static void parserInit(XML_Parser parser, const XML_Char *encodingName);
  521. #if XML_GE == 1
  522. static float accountingGetCurrentAmplification(XML_Parser rootParser);
  523. static void accountingReportStats(XML_Parser originParser, const char *epilog);
  524. static void accountingOnAbort(XML_Parser originParser);
  525. static void accountingReportDiff(XML_Parser rootParser,
  526. unsigned int levelsAwayFromRootParser,
  527. const char *before, const char *after,
  528. ptrdiff_t bytesMore, int source_line,
  529. enum XML_Account account);
  530. static XML_Bool accountingDiffTolerated(XML_Parser originParser, int tok,
  531. const char *before, const char *after,
  532. int source_line,
  533. enum XML_Account account);
  534. static void entityTrackingReportStats(XML_Parser parser, ENTITY *entity,
  535. const char *action, int sourceLine);
  536. static void entityTrackingOnOpen(XML_Parser parser, ENTITY *entity,
  537. int sourceLine);
  538. static void entityTrackingOnClose(XML_Parser parser, ENTITY *entity,
  539. int sourceLine);
  540. static XML_Parser getRootParserOf(XML_Parser parser,
  541. unsigned int *outLevelDiff);
  542. #endif /* XML_GE == 1 */
  543. static unsigned long getDebugLevel(const char *variableName,
  544. unsigned long defaultDebugLevel);
  545. #define poolStart(pool) ((pool)->start)
  546. #define poolLength(pool) ((pool)->ptr - (pool)->start)
  547. #define poolChop(pool) ((void)--(pool->ptr))
  548. #define poolLastChar(pool) (((pool)->ptr)[-1])
  549. #define poolDiscard(pool) ((pool)->ptr = (pool)->start)
  550. #define poolFinish(pool) ((pool)->start = (pool)->ptr)
  551. #define poolAppendChar(pool, c) \
  552. (((pool)->ptr == (pool)->end && ! poolGrow(pool)) \
  553. ? 0 \
  554. : ((*((pool)->ptr)++ = c), 1))
  555. #if ! defined(XML_TESTING)
  556. const
  557. #endif
  558. XML_Bool g_reparseDeferralEnabledDefault
  559. = XML_TRUE; // write ONLY in runtests.c
  560. #if defined(XML_TESTING)
  561. unsigned int g_bytesScanned = 0; // used for testing only
  562. #endif
  563. struct XML_ParserStruct {
  564. /* The first member must be m_userData so that the XML_GetUserData
  565. macro works. */
  566. void *m_userData;
  567. void *m_handlerArg;
  568. // How the four parse buffer pointers below relate in time and space:
  569. //
  570. // m_buffer <= m_bufferPtr <= m_bufferEnd <= m_bufferLim
  571. // | | | |
  572. // <--parsed-->| | |
  573. // <---parsing--->| |
  574. // <--unoccupied-->|
  575. // <---------total-malloced/realloced-------->|
  576. char *m_buffer; // malloc/realloc base pointer of parse buffer
  577. const XML_Memory_Handling_Suite m_mem;
  578. const char *m_bufferPtr; // first character to be parsed
  579. char *m_bufferEnd; // past last character to be parsed
  580. const char *m_bufferLim; // allocated end of m_buffer
  581. XML_Index m_parseEndByteIndex;
  582. const char *m_parseEndPtr;
  583. size_t m_partialTokenBytesBefore; /* used in heuristic to avoid O(n^2) */
  584. XML_Bool m_reparseDeferralEnabled;
  585. int m_lastBufferRequestSize;
  586. XML_Char *m_dataBuf;
  587. XML_Char *m_dataBufEnd;
  588. XML_StartElementHandler m_startElementHandler;
  589. XML_EndElementHandler m_endElementHandler;
  590. XML_CharacterDataHandler m_characterDataHandler;
  591. XML_ProcessingInstructionHandler m_processingInstructionHandler;
  592. XML_CommentHandler m_commentHandler;
  593. XML_StartCdataSectionHandler m_startCdataSectionHandler;
  594. XML_EndCdataSectionHandler m_endCdataSectionHandler;
  595. XML_DefaultHandler m_defaultHandler;
  596. XML_StartDoctypeDeclHandler m_startDoctypeDeclHandler;
  597. XML_EndDoctypeDeclHandler m_endDoctypeDeclHandler;
  598. XML_UnparsedEntityDeclHandler m_unparsedEntityDeclHandler;
  599. XML_NotationDeclHandler m_notationDeclHandler;
  600. XML_StartNamespaceDeclHandler m_startNamespaceDeclHandler;
  601. XML_EndNamespaceDeclHandler m_endNamespaceDeclHandler;
  602. XML_NotStandaloneHandler m_notStandaloneHandler;
  603. XML_ExternalEntityRefHandler m_externalEntityRefHandler;
  604. XML_Parser m_externalEntityRefHandlerArg;
  605. XML_SkippedEntityHandler m_skippedEntityHandler;
  606. XML_UnknownEncodingHandler m_unknownEncodingHandler;
  607. XML_ElementDeclHandler m_elementDeclHandler;
  608. XML_AttlistDeclHandler m_attlistDeclHandler;
  609. XML_EntityDeclHandler m_entityDeclHandler;
  610. XML_XmlDeclHandler m_xmlDeclHandler;
  611. const ENCODING *m_encoding;
  612. INIT_ENCODING m_initEncoding;
  613. const ENCODING *m_internalEncoding;
  614. const XML_Char *m_protocolEncodingName;
  615. XML_Bool m_ns;
  616. XML_Bool m_ns_triplets;
  617. void *m_unknownEncodingMem;
  618. void *m_unknownEncodingData;
  619. void *m_unknownEncodingHandlerData;
  620. void(XMLCALL *m_unknownEncodingRelease)(void *);
  621. PROLOG_STATE m_prologState;
  622. Processor *m_processor;
  623. enum XML_Error m_errorCode;
  624. const char *m_eventPtr;
  625. const char *m_eventEndPtr;
  626. const char *m_positionPtr;
  627. OPEN_INTERNAL_ENTITY *m_openInternalEntities;
  628. OPEN_INTERNAL_ENTITY *m_freeInternalEntities;
  629. XML_Bool m_defaultExpandInternalEntities;
  630. int m_tagLevel;
  631. ENTITY *m_declEntity;
  632. const XML_Char *m_doctypeName;
  633. const XML_Char *m_doctypeSysid;
  634. const XML_Char *m_doctypePubid;
  635. const XML_Char *m_declAttributeType;
  636. const XML_Char *m_declNotationName;
  637. const XML_Char *m_declNotationPublicId;
  638. ELEMENT_TYPE *m_declElementType;
  639. ATTRIBUTE_ID *m_declAttributeId;
  640. XML_Bool m_declAttributeIsCdata;
  641. XML_Bool m_declAttributeIsId;
  642. DTD *m_dtd;
  643. const XML_Char *m_curBase;
  644. TAG *m_tagStack;
  645. TAG *m_freeTagList;
  646. BINDING *m_inheritedBindings;
  647. BINDING *m_freeBindingList;
  648. int m_attsSize;
  649. int m_nSpecifiedAtts;
  650. int m_idAttIndex;
  651. ATTRIBUTE *m_atts;
  652. NS_ATT *m_nsAtts;
  653. unsigned long m_nsAttsVersion;
  654. unsigned char m_nsAttsPower;
  655. #ifdef XML_ATTR_INFO
  656. XML_AttrInfo *m_attInfo;
  657. #endif
  658. POSITION m_position;
  659. STRING_POOL m_tempPool;
  660. STRING_POOL m_temp2Pool;
  661. char *m_groupConnector;
  662. unsigned int m_groupSize;
  663. XML_Char m_namespaceSeparator;
  664. XML_Parser m_parentParser;
  665. XML_ParsingStatus m_parsingStatus;
  666. #ifdef XML_DTD
  667. XML_Bool m_isParamEntity;
  668. XML_Bool m_useForeignDTD;
  669. enum XML_ParamEntityParsing m_paramEntityParsing;
  670. #endif
  671. unsigned long m_hash_secret_salt;
  672. #if XML_GE == 1
  673. ACCOUNTING m_accounting;
  674. ENTITY_STATS m_entity_stats;
  675. #endif
  676. };
  677. #define MALLOC(parser, s) (parser->m_mem.malloc_fcn((s)))
  678. #define REALLOC(parser, p, s) (parser->m_mem.realloc_fcn((p), (s)))
  679. #define FREE(parser, p) (parser->m_mem.free_fcn((p)))
  680. XML_Parser XMLCALL
  681. XML_ParserCreate(const XML_Char *encodingName) {
  682. return XML_ParserCreate_MM(encodingName, NULL, NULL);
  683. }
  684. XML_Parser XMLCALL
  685. XML_ParserCreateNS(const XML_Char *encodingName, XML_Char nsSep) {
  686. XML_Char tmp[2] = {nsSep, 0};
  687. return XML_ParserCreate_MM(encodingName, NULL, tmp);
  688. }
  689. // "xml=http://www.w3.org/XML/1998/namespace"
  690. static const XML_Char implicitContext[]
  691. = {ASCII_x, ASCII_m, ASCII_l, ASCII_EQUALS, ASCII_h,
  692. ASCII_t, ASCII_t, ASCII_p, ASCII_COLON, ASCII_SLASH,
  693. ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w, ASCII_PERIOD,
  694. ASCII_w, ASCII_3, ASCII_PERIOD, ASCII_o, ASCII_r,
  695. ASCII_g, ASCII_SLASH, ASCII_X, ASCII_M, ASCII_L,
  696. ASCII_SLASH, ASCII_1, ASCII_9, ASCII_9, ASCII_8,
  697. ASCII_SLASH, ASCII_n, ASCII_a, ASCII_m, ASCII_e,
  698. ASCII_s, ASCII_p, ASCII_a, ASCII_c, ASCII_e,
  699. '\0'};
  700. /* To avoid warnings about unused functions: */
  701. #if ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM)
  702. # if defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)
  703. /* Obtain entropy on Linux 3.17+ */
  704. static int
  705. writeRandomBytes_getrandom_nonblock(void *target, size_t count) {
  706. int success = 0; /* full count bytes written? */
  707. size_t bytesWrittenTotal = 0;
  708. const unsigned int getrandomFlags = GRND_NONBLOCK;
  709. do {
  710. void *const currentTarget = (void *)((char *)target + bytesWrittenTotal);
  711. const size_t bytesToWrite = count - bytesWrittenTotal;
  712. const int bytesWrittenMore =
  713. # if defined(HAVE_GETRANDOM)
  714. getrandom(currentTarget, bytesToWrite, getrandomFlags);
  715. # else
  716. syscall(SYS_getrandom, currentTarget, bytesToWrite, getrandomFlags);
  717. # endif
  718. if (bytesWrittenMore > 0) {
  719. bytesWrittenTotal += bytesWrittenMore;
  720. if (bytesWrittenTotal >= count)
  721. success = 1;
  722. }
  723. } while (! success && (errno == EINTR));
  724. return success;
  725. }
  726. # endif /* defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM) */
  727. # if ! defined(_WIN32) && defined(XML_DEV_URANDOM)
  728. /* Extract entropy from /dev/urandom */
  729. static int
  730. writeRandomBytes_dev_urandom(void *target, size_t count) {
  731. int success = 0; /* full count bytes written? */
  732. size_t bytesWrittenTotal = 0;
  733. const int fd = open("/dev/urandom", O_RDONLY);
  734. if (fd < 0) {
  735. return 0;
  736. }
  737. do {
  738. void *const currentTarget = (void *)((char *)target + bytesWrittenTotal);
  739. const size_t bytesToWrite = count - bytesWrittenTotal;
  740. const ssize_t bytesWrittenMore = read(fd, currentTarget, bytesToWrite);
  741. if (bytesWrittenMore > 0) {
  742. bytesWrittenTotal += bytesWrittenMore;
  743. if (bytesWrittenTotal >= count)
  744. success = 1;
  745. }
  746. } while (! success && (errno == EINTR));
  747. close(fd);
  748. return success;
  749. }
  750. # endif /* ! defined(_WIN32) && defined(XML_DEV_URANDOM) */
  751. #endif /* ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) */
  752. #if defined(HAVE_ARC4RANDOM) && ! defined(HAVE_ARC4RANDOM_BUF)
  753. static void
  754. writeRandomBytes_arc4random(void *target, size_t count) {
  755. size_t bytesWrittenTotal = 0;
  756. while (bytesWrittenTotal < count) {
  757. const uint32_t random32 = arc4random();
  758. size_t i = 0;
  759. for (; (i < sizeof(random32)) && (bytesWrittenTotal < count);
  760. i++, bytesWrittenTotal++) {
  761. const uint8_t random8 = (uint8_t)(random32 >> (i * 8));
  762. ((uint8_t *)target)[bytesWrittenTotal] = random8;
  763. }
  764. }
  765. }
  766. #endif /* defined(HAVE_ARC4RANDOM) && ! defined(HAVE_ARC4RANDOM_BUF) */
  767. #ifdef _WIN32
  768. /* Provide declaration of rand_s() for MinGW-32 (not 64, which has it),
  769. as it didn't declare it in its header prior to version 5.3.0 of its
  770. runtime package (mingwrt, containing stdlib.h). The upstream fix
  771. was introduced at https://osdn.net/projects/mingw/ticket/39658 . */
  772. # if defined(__MINGW32__) && defined(__MINGW32_VERSION) \
  773. && __MINGW32_VERSION < 5003000L && ! defined(__MINGW64_VERSION_MAJOR)
  774. __declspec(dllimport) int rand_s(unsigned int *);
  775. # endif
  776. /* Obtain entropy on Windows using the rand_s() function which
  777. * generates cryptographically secure random numbers. Internally it
  778. * uses RtlGenRandom API which is present in Windows XP and later.
  779. */
  780. static int
  781. writeRandomBytes_rand_s(void *target, size_t count) {
  782. size_t bytesWrittenTotal = 0;
  783. while (bytesWrittenTotal < count) {
  784. unsigned int random32 = 0;
  785. size_t i = 0;
  786. if (rand_s(&random32))
  787. return 0; /* failure */
  788. for (; (i < sizeof(random32)) && (bytesWrittenTotal < count);
  789. i++, bytesWrittenTotal++) {
  790. const uint8_t random8 = (uint8_t)(random32 >> (i * 8));
  791. ((uint8_t *)target)[bytesWrittenTotal] = random8;
  792. }
  793. }
  794. return 1; /* success */
  795. }
  796. #endif /* _WIN32 */
  797. #if ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM)
  798. static unsigned long
  799. gather_time_entropy(void) {
  800. # ifdef _WIN32
  801. FILETIME ft;
  802. GetSystemTimeAsFileTime(&ft); /* never fails */
  803. return ft.dwHighDateTime ^ ft.dwLowDateTime;
  804. # else
  805. struct timeval tv;
  806. int gettimeofday_res;
  807. gettimeofday_res = gettimeofday(&tv, NULL);
  808. # if defined(NDEBUG)
  809. (void)gettimeofday_res;
  810. # else
  811. assert(gettimeofday_res == 0);
  812. # endif /* defined(NDEBUG) */
  813. /* Microseconds time is <20 bits entropy */
  814. return tv.tv_usec;
  815. # endif
  816. }
  817. #endif /* ! defined(HAVE_ARC4RANDOM_BUF) && ! defined(HAVE_ARC4RANDOM) */
  818. static unsigned long
  819. ENTROPY_DEBUG(const char *label, unsigned long entropy) {
  820. if (getDebugLevel("EXPAT_ENTROPY_DEBUG", 0) >= 1u) {
  821. fprintf(stderr, "expat: Entropy: %s --> 0x%0*lx (%lu bytes)\n", label,
  822. (int)sizeof(entropy) * 2, entropy, (unsigned long)sizeof(entropy));
  823. }
  824. return entropy;
  825. }
  826. static unsigned long
  827. generate_hash_secret_salt(XML_Parser parser) {
  828. unsigned long entropy;
  829. (void)parser;
  830. /* "Failproof" high quality providers: */
  831. #if defined(HAVE_ARC4RANDOM_BUF)
  832. arc4random_buf(&entropy, sizeof(entropy));
  833. return ENTROPY_DEBUG("arc4random_buf", entropy);
  834. #elif defined(HAVE_ARC4RANDOM)
  835. writeRandomBytes_arc4random((void *)&entropy, sizeof(entropy));
  836. return ENTROPY_DEBUG("arc4random", entropy);
  837. #else
  838. /* Try high quality providers first .. */
  839. # ifdef _WIN32
  840. if (writeRandomBytes_rand_s((void *)&entropy, sizeof(entropy))) {
  841. return ENTROPY_DEBUG("rand_s", entropy);
  842. }
  843. # elif defined(HAVE_GETRANDOM) || defined(HAVE_SYSCALL_GETRANDOM)
  844. if (writeRandomBytes_getrandom_nonblock((void *)&entropy, sizeof(entropy))) {
  845. return ENTROPY_DEBUG("getrandom", entropy);
  846. }
  847. # endif
  848. # if ! defined(_WIN32) && defined(XML_DEV_URANDOM)
  849. if (writeRandomBytes_dev_urandom((void *)&entropy, sizeof(entropy))) {
  850. return ENTROPY_DEBUG("/dev/urandom", entropy);
  851. }
  852. # endif /* ! defined(_WIN32) && defined(XML_DEV_URANDOM) */
  853. /* .. and self-made low quality for backup: */
  854. /* Process ID is 0 bits entropy if attacker has local access */
  855. entropy = gather_time_entropy() ^ getpid();
  856. /* Factors are 2^31-1 and 2^61-1 (Mersenne primes M31 and M61) */
  857. if (sizeof(unsigned long) == 4) {
  858. return ENTROPY_DEBUG("fallback(4)", entropy * 2147483647);
  859. } else {
  860. return ENTROPY_DEBUG("fallback(8)",
  861. entropy * (unsigned long)2305843009213693951ULL);
  862. }
  863. #endif
  864. }
  865. static unsigned long
  866. get_hash_secret_salt(XML_Parser parser) {
  867. if (parser->m_parentParser != NULL)
  868. return get_hash_secret_salt(parser->m_parentParser);
  869. return parser->m_hash_secret_salt;
  870. }
  871. static enum XML_Error
  872. callProcessor(XML_Parser parser, const char *start, const char *end,
  873. const char **endPtr) {
  874. const size_t have_now = EXPAT_SAFE_PTR_DIFF(end, start);
  875. if (parser->m_reparseDeferralEnabled
  876. && ! parser->m_parsingStatus.finalBuffer) {
  877. // Heuristic: don't try to parse a partial token again until the amount of
  878. // available data has increased significantly.
  879. const size_t had_before = parser->m_partialTokenBytesBefore;
  880. // ...but *do* try anyway if we're close to causing a reallocation.
  881. size_t available_buffer
  882. = EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer);
  883. #if XML_CONTEXT_BYTES > 0
  884. available_buffer -= EXPAT_MIN(available_buffer, XML_CONTEXT_BYTES);
  885. #endif
  886. available_buffer
  887. += EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferEnd);
  888. // m_lastBufferRequestSize is never assigned a value < 0, so the cast is ok
  889. const bool enough
  890. = (have_now >= 2 * had_before)
  891. || ((size_t)parser->m_lastBufferRequestSize > available_buffer);
  892. if (! enough) {
  893. *endPtr = start; // callers may expect this to be set
  894. return XML_ERROR_NONE;
  895. }
  896. }
  897. #if defined(XML_TESTING)
  898. g_bytesScanned += (unsigned)have_now;
  899. #endif
  900. const enum XML_Error ret = parser->m_processor(parser, start, end, endPtr);
  901. if (ret == XML_ERROR_NONE) {
  902. // if we consumed nothing, remember what we had on this parse attempt.
  903. if (*endPtr == start) {
  904. parser->m_partialTokenBytesBefore = have_now;
  905. } else {
  906. parser->m_partialTokenBytesBefore = 0;
  907. }
  908. }
  909. return ret;
  910. }
  911. static XML_Bool /* only valid for root parser */
  912. startParsing(XML_Parser parser) {
  913. /* hash functions must be initialized before setContext() is called */
  914. if (parser->m_hash_secret_salt == 0)
  915. parser->m_hash_secret_salt = generate_hash_secret_salt(parser);
  916. if (parser->m_ns) {
  917. /* implicit context only set for root parser, since child
  918. parsers (i.e. external entity parsers) will inherit it
  919. */
  920. return setContext(parser, implicitContext);
  921. }
  922. return XML_TRUE;
  923. }
  924. XML_Parser XMLCALL
  925. XML_ParserCreate_MM(const XML_Char *encodingName,
  926. const XML_Memory_Handling_Suite *memsuite,
  927. const XML_Char *nameSep) {
  928. return parserCreate(encodingName, memsuite, nameSep, NULL);
  929. }
  930. static XML_Parser
  931. parserCreate(const XML_Char *encodingName,
  932. const XML_Memory_Handling_Suite *memsuite, const XML_Char *nameSep,
  933. DTD *dtd) {
  934. XML_Parser parser;
  935. if (memsuite) {
  936. XML_Memory_Handling_Suite *mtemp;
  937. parser = memsuite->malloc_fcn(sizeof(struct XML_ParserStruct));
  938. if (parser != NULL) {
  939. mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem);
  940. mtemp->malloc_fcn = memsuite->malloc_fcn;
  941. mtemp->realloc_fcn = memsuite->realloc_fcn;
  942. mtemp->free_fcn = memsuite->free_fcn;
  943. }
  944. } else {
  945. XML_Memory_Handling_Suite *mtemp;
  946. parser = (XML_Parser)malloc(sizeof(struct XML_ParserStruct));
  947. if (parser != NULL) {
  948. mtemp = (XML_Memory_Handling_Suite *)&(parser->m_mem);
  949. mtemp->malloc_fcn = malloc;
  950. mtemp->realloc_fcn = realloc;
  951. mtemp->free_fcn = free;
  952. }
  953. }
  954. if (! parser)
  955. return parser;
  956. parser->m_buffer = NULL;
  957. parser->m_bufferLim = NULL;
  958. parser->m_attsSize = INIT_ATTS_SIZE;
  959. parser->m_atts
  960. = (ATTRIBUTE *)MALLOC(parser, parser->m_attsSize * sizeof(ATTRIBUTE));
  961. if (parser->m_atts == NULL) {
  962. FREE(parser, parser);
  963. return NULL;
  964. }
  965. #ifdef XML_ATTR_INFO
  966. parser->m_attInfo = (XML_AttrInfo *)MALLOC(
  967. parser, parser->m_attsSize * sizeof(XML_AttrInfo));
  968. if (parser->m_attInfo == NULL) {
  969. FREE(parser, parser->m_atts);
  970. FREE(parser, parser);
  971. return NULL;
  972. }
  973. #endif
  974. parser->m_dataBuf
  975. = (XML_Char *)MALLOC(parser, INIT_DATA_BUF_SIZE * sizeof(XML_Char));
  976. if (parser->m_dataBuf == NULL) {
  977. FREE(parser, parser->m_atts);
  978. #ifdef XML_ATTR_INFO
  979. FREE(parser, parser->m_attInfo);
  980. #endif
  981. FREE(parser, parser);
  982. return NULL;
  983. }
  984. parser->m_dataBufEnd = parser->m_dataBuf + INIT_DATA_BUF_SIZE;
  985. if (dtd)
  986. parser->m_dtd = dtd;
  987. else {
  988. parser->m_dtd = dtdCreate(&parser->m_mem);
  989. if (parser->m_dtd == NULL) {
  990. FREE(parser, parser->m_dataBuf);
  991. FREE(parser, parser->m_atts);
  992. #ifdef XML_ATTR_INFO
  993. FREE(parser, parser->m_attInfo);
  994. #endif
  995. FREE(parser, parser);
  996. return NULL;
  997. }
  998. }
  999. parser->m_freeBindingList = NULL;
  1000. parser->m_freeTagList = NULL;
  1001. parser->m_freeInternalEntities = NULL;
  1002. parser->m_groupSize = 0;
  1003. parser->m_groupConnector = NULL;
  1004. parser->m_unknownEncodingHandler = NULL;
  1005. parser->m_unknownEncodingHandlerData = NULL;
  1006. parser->m_namespaceSeparator = ASCII_EXCL;
  1007. parser->m_ns = XML_FALSE;
  1008. parser->m_ns_triplets = XML_FALSE;
  1009. parser->m_nsAtts = NULL;
  1010. parser->m_nsAttsVersion = 0;
  1011. parser->m_nsAttsPower = 0;
  1012. parser->m_protocolEncodingName = NULL;
  1013. poolInit(&parser->m_tempPool, &(parser->m_mem));
  1014. poolInit(&parser->m_temp2Pool, &(parser->m_mem));
  1015. parserInit(parser, encodingName);
  1016. if (encodingName && ! parser->m_protocolEncodingName) {
  1017. if (dtd) {
  1018. // We need to stop the upcoming call to XML_ParserFree from happily
  1019. // destroying parser->m_dtd because the DTD is shared with the parent
  1020. // parser and the only guard that keeps XML_ParserFree from destroying
  1021. // parser->m_dtd is parser->m_isParamEntity but it will be set to
  1022. // XML_TRUE only later in XML_ExternalEntityParserCreate (or not at all).
  1023. parser->m_dtd = NULL;
  1024. }
  1025. XML_ParserFree(parser);
  1026. return NULL;
  1027. }
  1028. if (nameSep) {
  1029. parser->m_ns = XML_TRUE;
  1030. parser->m_internalEncoding = XmlGetInternalEncodingNS();
  1031. parser->m_namespaceSeparator = *nameSep;
  1032. } else {
  1033. parser->m_internalEncoding = XmlGetInternalEncoding();
  1034. }
  1035. return parser;
  1036. }
  1037. static void
  1038. parserInit(XML_Parser parser, const XML_Char *encodingName) {
  1039. parser->m_processor = prologInitProcessor;
  1040. XmlPrologStateInit(&parser->m_prologState);
  1041. if (encodingName != NULL) {
  1042. parser->m_protocolEncodingName = copyString(encodingName, &(parser->m_mem));
  1043. }
  1044. parser->m_curBase = NULL;
  1045. XmlInitEncoding(&parser->m_initEncoding, &parser->m_encoding, 0);
  1046. parser->m_userData = NULL;
  1047. parser->m_handlerArg = NULL;
  1048. parser->m_startElementHandler = NULL;
  1049. parser->m_endElementHandler = NULL;
  1050. parser->m_characterDataHandler = NULL;
  1051. parser->m_processingInstructionHandler = NULL;
  1052. parser->m_commentHandler = NULL;
  1053. parser->m_startCdataSectionHandler = NULL;
  1054. parser->m_endCdataSectionHandler = NULL;
  1055. parser->m_defaultHandler = NULL;
  1056. parser->m_startDoctypeDeclHandler = NULL;
  1057. parser->m_endDoctypeDeclHandler = NULL;
  1058. parser->m_unparsedEntityDeclHandler = NULL;
  1059. parser->m_notationDeclHandler = NULL;
  1060. parser->m_startNamespaceDeclHandler = NULL;
  1061. parser->m_endNamespaceDeclHandler = NULL;
  1062. parser->m_notStandaloneHandler = NULL;
  1063. parser->m_externalEntityRefHandler = NULL;
  1064. parser->m_externalEntityRefHandlerArg = parser;
  1065. parser->m_skippedEntityHandler = NULL;
  1066. parser->m_elementDeclHandler = NULL;
  1067. parser->m_attlistDeclHandler = NULL;
  1068. parser->m_entityDeclHandler = NULL;
  1069. parser->m_xmlDeclHandler = NULL;
  1070. parser->m_bufferPtr = parser->m_buffer;
  1071. parser->m_bufferEnd = parser->m_buffer;
  1072. parser->m_parseEndByteIndex = 0;
  1073. parser->m_parseEndPtr = NULL;
  1074. parser->m_partialTokenBytesBefore = 0;
  1075. parser->m_reparseDeferralEnabled = g_reparseDeferralEnabledDefault;
  1076. parser->m_lastBufferRequestSize = 0;
  1077. parser->m_declElementType = NULL;
  1078. parser->m_declAttributeId = NULL;
  1079. parser->m_declEntity = NULL;
  1080. parser->m_doctypeName = NULL;
  1081. parser->m_doctypeSysid = NULL;
  1082. parser->m_doctypePubid = NULL;
  1083. parser->m_declAttributeType = NULL;
  1084. parser->m_declNotationName = NULL;
  1085. parser->m_declNotationPublicId = NULL;
  1086. parser->m_declAttributeIsCdata = XML_FALSE;
  1087. parser->m_declAttributeIsId = XML_FALSE;
  1088. memset(&parser->m_position, 0, sizeof(POSITION));
  1089. parser->m_errorCode = XML_ERROR_NONE;
  1090. parser->m_eventPtr = NULL;
  1091. parser->m_eventEndPtr = NULL;
  1092. parser->m_positionPtr = NULL;
  1093. parser->m_openInternalEntities = NULL;
  1094. parser->m_defaultExpandInternalEntities = XML_TRUE;
  1095. parser->m_tagLevel = 0;
  1096. parser->m_tagStack = NULL;
  1097. parser->m_inheritedBindings = NULL;
  1098. parser->m_nSpecifiedAtts = 0;
  1099. parser->m_unknownEncodingMem = NULL;
  1100. parser->m_unknownEncodingRelease = NULL;
  1101. parser->m_unknownEncodingData = NULL;
  1102. parser->m_parentParser = NULL;
  1103. parser->m_parsingStatus.parsing = XML_INITIALIZED;
  1104. #ifdef XML_DTD
  1105. parser->m_isParamEntity = XML_FALSE;
  1106. parser->m_useForeignDTD = XML_FALSE;
  1107. parser->m_paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER;
  1108. #endif
  1109. parser->m_hash_secret_salt = 0;
  1110. #if XML_GE == 1
  1111. memset(&parser->m_accounting, 0, sizeof(ACCOUNTING));
  1112. parser->m_accounting.debugLevel = getDebugLevel("EXPAT_ACCOUNTING_DEBUG", 0u);
  1113. parser->m_accounting.maximumAmplificationFactor
  1114. = EXPAT_BILLION_LAUGHS_ATTACK_PROTECTION_MAXIMUM_AMPLIFICATION_DEFAULT;
  1115. parser->m_accounting.activationThresholdBytes
  1116. = EXPAT_BILLION_LAUGHS_ATTACK_PROTECTION_ACTIVATION_THRESHOLD_DEFAULT;
  1117. memset(&parser->m_entity_stats, 0, sizeof(ENTITY_STATS));
  1118. parser->m_entity_stats.debugLevel = getDebugLevel("EXPAT_ENTITY_DEBUG", 0u);
  1119. #endif
  1120. }
  1121. /* moves list of bindings to m_freeBindingList */
  1122. static void FASTCALL
  1123. moveToFreeBindingList(XML_Parser parser, BINDING *bindings) {
  1124. while (bindings) {
  1125. BINDING *b = bindings;
  1126. bindings = bindings->nextTagBinding;
  1127. b->nextTagBinding = parser->m_freeBindingList;
  1128. parser->m_freeBindingList = b;
  1129. }
  1130. }
  1131. XML_Bool XMLCALL
  1132. XML_ParserReset(XML_Parser parser, const XML_Char *encodingName) {
  1133. TAG *tStk;
  1134. OPEN_INTERNAL_ENTITY *openEntityList;
  1135. if (parser == NULL)
  1136. return XML_FALSE;
  1137. if (parser->m_parentParser)
  1138. return XML_FALSE;
  1139. /* move m_tagStack to m_freeTagList */
  1140. tStk = parser->m_tagStack;
  1141. while (tStk) {
  1142. TAG *tag = tStk;
  1143. tStk = tStk->parent;
  1144. tag->parent = parser->m_freeTagList;
  1145. moveToFreeBindingList(parser, tag->bindings);
  1146. tag->bindings = NULL;
  1147. parser->m_freeTagList = tag;
  1148. }
  1149. /* move m_openInternalEntities to m_freeInternalEntities */
  1150. openEntityList = parser->m_openInternalEntities;
  1151. while (openEntityList) {
  1152. OPEN_INTERNAL_ENTITY *openEntity = openEntityList;
  1153. openEntityList = openEntity->next;
  1154. openEntity->next = parser->m_freeInternalEntities;
  1155. parser->m_freeInternalEntities = openEntity;
  1156. }
  1157. moveToFreeBindingList(parser, parser->m_inheritedBindings);
  1158. FREE(parser, parser->m_unknownEncodingMem);
  1159. if (parser->m_unknownEncodingRelease)
  1160. parser->m_unknownEncodingRelease(parser->m_unknownEncodingData);
  1161. poolClear(&parser->m_tempPool);
  1162. poolClear(&parser->m_temp2Pool);
  1163. FREE(parser, (void *)parser->m_protocolEncodingName);
  1164. parser->m_protocolEncodingName = NULL;
  1165. parserInit(parser, encodingName);
  1166. dtdReset(parser->m_dtd, &parser->m_mem);
  1167. return XML_TRUE;
  1168. }
  1169. enum XML_Status XMLCALL
  1170. XML_SetEncoding(XML_Parser parser, const XML_Char *encodingName) {
  1171. if (parser == NULL)
  1172. return XML_STATUS_ERROR;
  1173. /* Block after XML_Parse()/XML_ParseBuffer() has been called.
  1174. XXX There's no way for the caller to determine which of the
  1175. XXX possible error cases caused the XML_STATUS_ERROR return.
  1176. */
  1177. if (parser->m_parsingStatus.parsing == XML_PARSING
  1178. || parser->m_parsingStatus.parsing == XML_SUSPENDED)
  1179. return XML_STATUS_ERROR;
  1180. /* Get rid of any previous encoding name */
  1181. FREE(parser, (void *)parser->m_protocolEncodingName);
  1182. if (encodingName == NULL)
  1183. /* No new encoding name */
  1184. parser->m_protocolEncodingName = NULL;
  1185. else {
  1186. /* Copy the new encoding name into allocated memory */
  1187. parser->m_protocolEncodingName = copyString(encodingName, &(parser->m_mem));
  1188. if (! parser->m_protocolEncodingName)
  1189. return XML_STATUS_ERROR;
  1190. }
  1191. return XML_STATUS_OK;
  1192. }
  1193. XML_Parser XMLCALL
  1194. XML_ExternalEntityParserCreate(XML_Parser oldParser, const XML_Char *context,
  1195. const XML_Char *encodingName) {
  1196. XML_Parser parser = oldParser;
  1197. DTD *newDtd = NULL;
  1198. DTD *oldDtd;
  1199. XML_StartElementHandler oldStartElementHandler;
  1200. XML_EndElementHandler oldEndElementHandler;
  1201. XML_CharacterDataHandler oldCharacterDataHandler;
  1202. XML_ProcessingInstructionHandler oldProcessingInstructionHandler;
  1203. XML_CommentHandler oldCommentHandler;
  1204. XML_StartCdataSectionHandler oldStartCdataSectionHandler;
  1205. XML_EndCdataSectionHandler oldEndCdataSectionHandler;
  1206. XML_DefaultHandler oldDefaultHandler;
  1207. XML_UnparsedEntityDeclHandler oldUnparsedEntityDeclHandler;
  1208. XML_NotationDeclHandler oldNotationDeclHandler;
  1209. XML_StartNamespaceDeclHandler oldStartNamespaceDeclHandler;
  1210. XML_EndNamespaceDeclHandler oldEndNamespaceDeclHandler;
  1211. XML_NotStandaloneHandler oldNotStandaloneHandler;
  1212. XML_ExternalEntityRefHandler oldExternalEntityRefHandler;
  1213. XML_SkippedEntityHandler oldSkippedEntityHandler;
  1214. XML_UnknownEncodingHandler oldUnknownEncodingHandler;
  1215. XML_ElementDeclHandler oldElementDeclHandler;
  1216. XML_AttlistDeclHandler oldAttlistDeclHandler;
  1217. XML_EntityDeclHandler oldEntityDeclHandler;
  1218. XML_XmlDeclHandler oldXmlDeclHandler;
  1219. ELEMENT_TYPE *oldDeclElementType;
  1220. void *oldUserData;
  1221. void *oldHandlerArg;
  1222. XML_Bool oldDefaultExpandInternalEntities;
  1223. XML_Parser oldExternalEntityRefHandlerArg;
  1224. #ifdef XML_DTD
  1225. enum XML_ParamEntityParsing oldParamEntityParsing;
  1226. int oldInEntityValue;
  1227. #endif
  1228. XML_Bool oldns_triplets;
  1229. /* Note that the new parser shares the same hash secret as the old
  1230. parser, so that dtdCopy and copyEntityTable can lookup values
  1231. from hash tables associated with either parser without us having
  1232. to worry which hash secrets each table has.
  1233. */
  1234. unsigned long oldhash_secret_salt;
  1235. XML_Bool oldReparseDeferralEnabled;
  1236. /* Validate the oldParser parameter before we pull everything out of it */
  1237. if (oldParser == NULL)
  1238. return NULL;
  1239. /* Stash the original parser contents on the stack */
  1240. oldDtd = parser->m_dtd;
  1241. oldStartElementHandler = parser->m_startElementHandler;
  1242. oldEndElementHandler = parser->m_endElementHandler;
  1243. oldCharacterDataHandler = parser->m_characterDataHandler;
  1244. oldProcessingInstructionHandler = parser->m_processingInstructionHandler;
  1245. oldCommentHandler = parser->m_commentHandler;
  1246. oldStartCdataSectionHandler = parser->m_startCdataSectionHandler;
  1247. oldEndCdataSectionHandler = parser->m_endCdataSectionHandler;
  1248. oldDefaultHandler = parser->m_defaultHandler;
  1249. oldUnparsedEntityDeclHandler = parser->m_unparsedEntityDeclHandler;
  1250. oldNotationDeclHandler = parser->m_notationDeclHandler;
  1251. oldStartNamespaceDeclHandler = parser->m_startNamespaceDeclHandler;
  1252. oldEndNamespaceDeclHandler = parser->m_endNamespaceDeclHandler;
  1253. oldNotStandaloneHandler = parser->m_notStandaloneHandler;
  1254. oldExternalEntityRefHandler = parser->m_externalEntityRefHandler;
  1255. oldSkippedEntityHandler = parser->m_skippedEntityHandler;
  1256. oldUnknownEncodingHandler = parser->m_unknownEncodingHandler;
  1257. oldElementDeclHandler = parser->m_elementDeclHandler;
  1258. oldAttlistDeclHandler = parser->m_attlistDeclHandler;
  1259. oldEntityDeclHandler = parser->m_entityDeclHandler;
  1260. oldXmlDeclHandler = parser->m_xmlDeclHandler;
  1261. oldDeclElementType = parser->m_declElementType;
  1262. oldUserData = parser->m_userData;
  1263. oldHandlerArg = parser->m_handlerArg;
  1264. oldDefaultExpandInternalEntities = parser->m_defaultExpandInternalEntities;
  1265. oldExternalEntityRefHandlerArg = parser->m_externalEntityRefHandlerArg;
  1266. #ifdef XML_DTD
  1267. oldParamEntityParsing = parser->m_paramEntityParsing;
  1268. oldInEntityValue = parser->m_prologState.inEntityValue;
  1269. #endif
  1270. oldns_triplets = parser->m_ns_triplets;
  1271. /* Note that the new parser shares the same hash secret as the old
  1272. parser, so that dtdCopy and copyEntityTable can lookup values
  1273. from hash tables associated with either parser without us having
  1274. to worry which hash secrets each table has.
  1275. */
  1276. oldhash_secret_salt = parser->m_hash_secret_salt;
  1277. oldReparseDeferralEnabled = parser->m_reparseDeferralEnabled;
  1278. #ifdef XML_DTD
  1279. if (! context)
  1280. newDtd = oldDtd;
  1281. #endif /* XML_DTD */
  1282. /* Note that the magical uses of the pre-processor to make field
  1283. access look more like C++ require that `parser' be overwritten
  1284. here. This makes this function more painful to follow than it
  1285. would be otherwise.
  1286. */
  1287. if (parser->m_ns) {
  1288. XML_Char tmp[2] = {parser->m_namespaceSeparator, 0};
  1289. parser = parserCreate(encodingName, &parser->m_mem, tmp, newDtd);
  1290. } else {
  1291. parser = parserCreate(encodingName, &parser->m_mem, NULL, newDtd);
  1292. }
  1293. if (! parser)
  1294. return NULL;
  1295. parser->m_startElementHandler = oldStartElementHandler;
  1296. parser->m_endElementHandler = oldEndElementHandler;
  1297. parser->m_characterDataHandler = oldCharacterDataHandler;
  1298. parser->m_processingInstructionHandler = oldProcessingInstructionHandler;
  1299. parser->m_commentHandler = oldCommentHandler;
  1300. parser->m_startCdataSectionHandler = oldStartCdataSectionHandler;
  1301. parser->m_endCdataSectionHandler = oldEndCdataSectionHandler;
  1302. parser->m_defaultHandler = oldDefaultHandler;
  1303. parser->m_unparsedEntityDeclHandler = oldUnparsedEntityDeclHandler;
  1304. parser->m_notationDeclHandler = oldNotationDeclHandler;
  1305. parser->m_startNamespaceDeclHandler = oldStartNamespaceDeclHandler;
  1306. parser->m_endNamespaceDeclHandler = oldEndNamespaceDeclHandler;
  1307. parser->m_notStandaloneHandler = oldNotStandaloneHandler;
  1308. parser->m_externalEntityRefHandler = oldExternalEntityRefHandler;
  1309. parser->m_skippedEntityHandler = oldSkippedEntityHandler;
  1310. parser->m_unknownEncodingHandler = oldUnknownEncodingHandler;
  1311. parser->m_elementDeclHandler = oldElementDeclHandler;
  1312. parser->m_attlistDeclHandler = oldAttlistDeclHandler;
  1313. parser->m_entityDeclHandler = oldEntityDeclHandler;
  1314. parser->m_xmlDeclHandler = oldXmlDeclHandler;
  1315. parser->m_declElementType = oldDeclElementType;
  1316. parser->m_userData = oldUserData;
  1317. if (oldUserData == oldHandlerArg)
  1318. parser->m_handlerArg = parser->m_userData;
  1319. else
  1320. parser->m_handlerArg = parser;
  1321. if (oldExternalEntityRefHandlerArg != oldParser)
  1322. parser->m_externalEntityRefHandlerArg = oldExternalEntityRefHandlerArg;
  1323. parser->m_defaultExpandInternalEntities = oldDefaultExpandInternalEntities;
  1324. parser->m_ns_triplets = oldns_triplets;
  1325. parser->m_hash_secret_salt = oldhash_secret_salt;
  1326. parser->m_reparseDeferralEnabled = oldReparseDeferralEnabled;
  1327. parser->m_parentParser = oldParser;
  1328. #ifdef XML_DTD
  1329. parser->m_paramEntityParsing = oldParamEntityParsing;
  1330. parser->m_prologState.inEntityValue = oldInEntityValue;
  1331. if (context) {
  1332. #endif /* XML_DTD */
  1333. if (! dtdCopy(oldParser, parser->m_dtd, oldDtd, &parser->m_mem)
  1334. || ! setContext(parser, context)) {
  1335. XML_ParserFree(parser);
  1336. return NULL;
  1337. }
  1338. parser->m_processor = externalEntityInitProcessor;
  1339. #ifdef XML_DTD
  1340. } else {
  1341. /* The DTD instance referenced by parser->m_dtd is shared between the
  1342. document's root parser and external PE parsers, therefore one does not
  1343. need to call setContext. In addition, one also *must* not call
  1344. setContext, because this would overwrite existing prefix->binding
  1345. pointers in parser->m_dtd with ones that get destroyed with the external
  1346. PE parser. This would leave those prefixes with dangling pointers.
  1347. */
  1348. parser->m_isParamEntity = XML_TRUE;
  1349. XmlPrologStateInitExternalEntity(&parser->m_prologState);
  1350. parser->m_processor = externalParEntInitProcessor;
  1351. }
  1352. #endif /* XML_DTD */
  1353. return parser;
  1354. }
  1355. static void FASTCALL
  1356. destroyBindings(BINDING *bindings, XML_Parser parser) {
  1357. for (;;) {
  1358. BINDING *b = bindings;
  1359. if (! b)
  1360. break;
  1361. bindings = b->nextTagBinding;
  1362. FREE(parser, b->uri);
  1363. FREE(parser, b);
  1364. }
  1365. }
  1366. void XMLCALL
  1367. XML_ParserFree(XML_Parser parser) {
  1368. TAG *tagList;
  1369. OPEN_INTERNAL_ENTITY *entityList;
  1370. if (parser == NULL)
  1371. return;
  1372. /* free m_tagStack and m_freeTagList */
  1373. tagList = parser->m_tagStack;
  1374. for (;;) {
  1375. TAG *p;
  1376. if (tagList == NULL) {
  1377. if (parser->m_freeTagList == NULL)
  1378. break;
  1379. tagList = parser->m_freeTagList;
  1380. parser->m_freeTagList = NULL;
  1381. }
  1382. p = tagList;
  1383. tagList = tagList->parent;
  1384. FREE(parser, p->buf);
  1385. destroyBindings(p->bindings, parser);
  1386. FREE(parser, p);
  1387. }
  1388. /* free m_openInternalEntities and m_freeInternalEntities */
  1389. entityList = parser->m_openInternalEntities;
  1390. for (;;) {
  1391. OPEN_INTERNAL_ENTITY *openEntity;
  1392. if (entityList == NULL) {
  1393. if (parser->m_freeInternalEntities == NULL)
  1394. break;
  1395. entityList = parser->m_freeInternalEntities;
  1396. parser->m_freeInternalEntities = NULL;
  1397. }
  1398. openEntity = entityList;
  1399. entityList = entityList->next;
  1400. FREE(parser, openEntity);
  1401. }
  1402. destroyBindings(parser->m_freeBindingList, parser);
  1403. destroyBindings(parser->m_inheritedBindings, parser);
  1404. poolDestroy(&parser->m_tempPool);
  1405. poolDestroy(&parser->m_temp2Pool);
  1406. FREE(parser, (void *)parser->m_protocolEncodingName);
  1407. #ifdef XML_DTD
  1408. /* external parameter entity parsers share the DTD structure
  1409. parser->m_dtd with the root parser, so we must not destroy it
  1410. */
  1411. if (! parser->m_isParamEntity && parser->m_dtd)
  1412. #else
  1413. if (parser->m_dtd)
  1414. #endif /* XML_DTD */
  1415. dtdDestroy(parser->m_dtd, (XML_Bool)! parser->m_parentParser,
  1416. &parser->m_mem);
  1417. FREE(parser, (void *)parser->m_atts);
  1418. #ifdef XML_ATTR_INFO
  1419. FREE(parser, (void *)parser->m_attInfo);
  1420. #endif
  1421. FREE(parser, parser->m_groupConnector);
  1422. FREE(parser, parser->m_buffer);
  1423. FREE(parser, parser->m_dataBuf);
  1424. FREE(parser, parser->m_nsAtts);
  1425. FREE(parser, parser->m_unknownEncodingMem);
  1426. if (parser->m_unknownEncodingRelease)
  1427. parser->m_unknownEncodingRelease(parser->m_unknownEncodingData);
  1428. FREE(parser, parser);
  1429. }
  1430. void XMLCALL
  1431. XML_UseParserAsHandlerArg(XML_Parser parser) {
  1432. if (parser != NULL)
  1433. parser->m_handlerArg = parser;
  1434. }
  1435. enum XML_Error XMLCALL
  1436. XML_UseForeignDTD(XML_Parser parser, XML_Bool useDTD) {
  1437. if (parser == NULL)
  1438. return XML_ERROR_INVALID_ARGUMENT;
  1439. #ifdef XML_DTD
  1440. /* block after XML_Parse()/XML_ParseBuffer() has been called */
  1441. if (parser->m_parsingStatus.parsing == XML_PARSING
  1442. || parser->m_parsingStatus.parsing == XML_SUSPENDED)
  1443. return XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING;
  1444. parser->m_useForeignDTD = useDTD;
  1445. return XML_ERROR_NONE;
  1446. #else
  1447. UNUSED_P(useDTD);
  1448. return XML_ERROR_FEATURE_REQUIRES_XML_DTD;
  1449. #endif
  1450. }
  1451. void XMLCALL
  1452. XML_SetReturnNSTriplet(XML_Parser parser, int do_nst) {
  1453. if (parser == NULL)
  1454. return;
  1455. /* block after XML_Parse()/XML_ParseBuffer() has been called */
  1456. if (parser->m_parsingStatus.parsing == XML_PARSING
  1457. || parser->m_parsingStatus.parsing == XML_SUSPENDED)
  1458. return;
  1459. parser->m_ns_triplets = do_nst ? XML_TRUE : XML_FALSE;
  1460. }
  1461. void XMLCALL
  1462. XML_SetUserData(XML_Parser parser, void *p) {
  1463. if (parser == NULL)
  1464. return;
  1465. if (parser->m_handlerArg == parser->m_userData)
  1466. parser->m_handlerArg = parser->m_userData = p;
  1467. else
  1468. parser->m_userData = p;
  1469. }
  1470. enum XML_Status XMLCALL
  1471. XML_SetBase(XML_Parser parser, const XML_Char *p) {
  1472. if (parser == NULL)
  1473. return XML_STATUS_ERROR;
  1474. if (p) {
  1475. p = poolCopyString(&parser->m_dtd->pool, p);
  1476. if (! p)
  1477. return XML_STATUS_ERROR;
  1478. parser->m_curBase = p;
  1479. } else
  1480. parser->m_curBase = NULL;
  1481. return XML_STATUS_OK;
  1482. }
  1483. const XML_Char *XMLCALL
  1484. XML_GetBase(XML_Parser parser) {
  1485. if (parser == NULL)
  1486. return NULL;
  1487. return parser->m_curBase;
  1488. }
  1489. int XMLCALL
  1490. XML_GetSpecifiedAttributeCount(XML_Parser parser) {
  1491. if (parser == NULL)
  1492. return -1;
  1493. return parser->m_nSpecifiedAtts;
  1494. }
  1495. int XMLCALL
  1496. XML_GetIdAttributeIndex(XML_Parser parser) {
  1497. if (parser == NULL)
  1498. return -1;
  1499. return parser->m_idAttIndex;
  1500. }
  1501. #ifdef XML_ATTR_INFO
  1502. const XML_AttrInfo *XMLCALL
  1503. XML_GetAttributeInfo(XML_Parser parser) {
  1504. if (parser == NULL)
  1505. return NULL;
  1506. return parser->m_attInfo;
  1507. }
  1508. #endif
  1509. void XMLCALL
  1510. XML_SetElementHandler(XML_Parser parser, XML_StartElementHandler start,
  1511. XML_EndElementHandler end) {
  1512. if (parser == NULL)
  1513. return;
  1514. parser->m_startElementHandler = start;
  1515. parser->m_endElementHandler = end;
  1516. }
  1517. void XMLCALL
  1518. XML_SetStartElementHandler(XML_Parser parser, XML_StartElementHandler start) {
  1519. if (parser != NULL)
  1520. parser->m_startElementHandler = start;
  1521. }
  1522. void XMLCALL
  1523. XML_SetEndElementHandler(XML_Parser parser, XML_EndElementHandler end) {
  1524. if (parser != NULL)
  1525. parser->m_endElementHandler = end;
  1526. }
  1527. void XMLCALL
  1528. XML_SetCharacterDataHandler(XML_Parser parser,
  1529. XML_CharacterDataHandler handler) {
  1530. if (parser != NULL)
  1531. parser->m_characterDataHandler = handler;
  1532. }
  1533. void XMLCALL
  1534. XML_SetProcessingInstructionHandler(XML_Parser parser,
  1535. XML_ProcessingInstructionHandler handler) {
  1536. if (parser != NULL)
  1537. parser->m_processingInstructionHandler = handler;
  1538. }
  1539. void XMLCALL
  1540. XML_SetCommentHandler(XML_Parser parser, XML_CommentHandler handler) {
  1541. if (parser != NULL)
  1542. parser->m_commentHandler = handler;
  1543. }
  1544. void XMLCALL
  1545. XML_SetCdataSectionHandler(XML_Parser parser,
  1546. XML_StartCdataSectionHandler start,
  1547. XML_EndCdataSectionHandler end) {
  1548. if (parser == NULL)
  1549. return;
  1550. parser->m_startCdataSectionHandler = start;
  1551. parser->m_endCdataSectionHandler = end;
  1552. }
  1553. void XMLCALL
  1554. XML_SetStartCdataSectionHandler(XML_Parser parser,
  1555. XML_StartCdataSectionHandler start) {
  1556. if (parser != NULL)
  1557. parser->m_startCdataSectionHandler = start;
  1558. }
  1559. void XMLCALL
  1560. XML_SetEndCdataSectionHandler(XML_Parser parser,
  1561. XML_EndCdataSectionHandler end) {
  1562. if (parser != NULL)
  1563. parser->m_endCdataSectionHandler = end;
  1564. }
  1565. void XMLCALL
  1566. XML_SetDefaultHandler(XML_Parser parser, XML_DefaultHandler handler) {
  1567. if (parser == NULL)
  1568. return;
  1569. parser->m_defaultHandler = handler;
  1570. parser->m_defaultExpandInternalEntities = XML_FALSE;
  1571. }
  1572. void XMLCALL
  1573. XML_SetDefaultHandlerExpand(XML_Parser parser, XML_DefaultHandler handler) {
  1574. if (parser == NULL)
  1575. return;
  1576. parser->m_defaultHandler = handler;
  1577. parser->m_defaultExpandInternalEntities = XML_TRUE;
  1578. }
  1579. void XMLCALL
  1580. XML_SetDoctypeDeclHandler(XML_Parser parser, XML_StartDoctypeDeclHandler start,
  1581. XML_EndDoctypeDeclHandler end) {
  1582. if (parser == NULL)
  1583. return;
  1584. parser->m_startDoctypeDeclHandler = start;
  1585. parser->m_endDoctypeDeclHandler = end;
  1586. }
  1587. void XMLCALL
  1588. XML_SetStartDoctypeDeclHandler(XML_Parser parser,
  1589. XML_StartDoctypeDeclHandler start) {
  1590. if (parser != NULL)
  1591. parser->m_startDoctypeDeclHandler = start;
  1592. }
  1593. void XMLCALL
  1594. XML_SetEndDoctypeDeclHandler(XML_Parser parser, XML_EndDoctypeDeclHandler end) {
  1595. if (parser != NULL)
  1596. parser->m_endDoctypeDeclHandler = end;
  1597. }
  1598. void XMLCALL
  1599. XML_SetUnparsedEntityDeclHandler(XML_Parser parser,
  1600. XML_UnparsedEntityDeclHandler handler) {
  1601. if (parser != NULL)
  1602. parser->m_unparsedEntityDeclHandler = handler;
  1603. }
  1604. void XMLCALL
  1605. XML_SetNotationDeclHandler(XML_Parser parser, XML_NotationDeclHandler handler) {
  1606. if (parser != NULL)
  1607. parser->m_notationDeclHandler = handler;
  1608. }
  1609. void XMLCALL
  1610. XML_SetNamespaceDeclHandler(XML_Parser parser,
  1611. XML_StartNamespaceDeclHandler start,
  1612. XML_EndNamespaceDeclHandler end) {
  1613. if (parser == NULL)
  1614. return;
  1615. parser->m_startNamespaceDeclHandler = start;
  1616. parser->m_endNamespaceDeclHandler = end;
  1617. }
  1618. void XMLCALL
  1619. XML_SetStartNamespaceDeclHandler(XML_Parser parser,
  1620. XML_StartNamespaceDeclHandler start) {
  1621. if (parser != NULL)
  1622. parser->m_startNamespaceDeclHandler = start;
  1623. }
  1624. void XMLCALL
  1625. XML_SetEndNamespaceDeclHandler(XML_Parser parser,
  1626. XML_EndNamespaceDeclHandler end) {
  1627. if (parser != NULL)
  1628. parser->m_endNamespaceDeclHandler = end;
  1629. }
  1630. void XMLCALL
  1631. XML_SetNotStandaloneHandler(XML_Parser parser,
  1632. XML_NotStandaloneHandler handler) {
  1633. if (parser != NULL)
  1634. parser->m_notStandaloneHandler = handler;
  1635. }
  1636. void XMLCALL
  1637. XML_SetExternalEntityRefHandler(XML_Parser parser,
  1638. XML_ExternalEntityRefHandler handler) {
  1639. if (parser != NULL)
  1640. parser->m_externalEntityRefHandler = handler;
  1641. }
  1642. void XMLCALL
  1643. XML_SetExternalEntityRefHandlerArg(XML_Parser parser, void *arg) {
  1644. if (parser == NULL)
  1645. return;
  1646. if (arg)
  1647. parser->m_externalEntityRefHandlerArg = (XML_Parser)arg;
  1648. else
  1649. parser->m_externalEntityRefHandlerArg = parser;
  1650. }
  1651. void XMLCALL
  1652. XML_SetSkippedEntityHandler(XML_Parser parser,
  1653. XML_SkippedEntityHandler handler) {
  1654. if (parser != NULL)
  1655. parser->m_skippedEntityHandler = handler;
  1656. }
  1657. void XMLCALL
  1658. XML_SetUnknownEncodingHandler(XML_Parser parser,
  1659. XML_UnknownEncodingHandler handler, void *data) {
  1660. if (parser == NULL)
  1661. return;
  1662. parser->m_unknownEncodingHandler = handler;
  1663. parser->m_unknownEncodingHandlerData = data;
  1664. }
  1665. void XMLCALL
  1666. XML_SetElementDeclHandler(XML_Parser parser, XML_ElementDeclHandler eldecl) {
  1667. if (parser != NULL)
  1668. parser->m_elementDeclHandler = eldecl;
  1669. }
  1670. void XMLCALL
  1671. XML_SetAttlistDeclHandler(XML_Parser parser, XML_AttlistDeclHandler attdecl) {
  1672. if (parser != NULL)
  1673. parser->m_attlistDeclHandler = attdecl;
  1674. }
  1675. void XMLCALL
  1676. XML_SetEntityDeclHandler(XML_Parser parser, XML_EntityDeclHandler handler) {
  1677. if (parser != NULL)
  1678. parser->m_entityDeclHandler = handler;
  1679. }
  1680. void XMLCALL
  1681. XML_SetXmlDeclHandler(XML_Parser parser, XML_XmlDeclHandler handler) {
  1682. if (parser != NULL)
  1683. parser->m_xmlDeclHandler = handler;
  1684. }
  1685. int XMLCALL
  1686. XML_SetParamEntityParsing(XML_Parser parser,
  1687. enum XML_ParamEntityParsing peParsing) {
  1688. if (parser == NULL)
  1689. return 0;
  1690. /* block after XML_Parse()/XML_ParseBuffer() has been called */
  1691. if (parser->m_parsingStatus.parsing == XML_PARSING
  1692. || parser->m_parsingStatus.parsing == XML_SUSPENDED)
  1693. return 0;
  1694. #ifdef XML_DTD
  1695. parser->m_paramEntityParsing = peParsing;
  1696. return 1;
  1697. #else
  1698. return peParsing == XML_PARAM_ENTITY_PARSING_NEVER;
  1699. #endif
  1700. }
  1701. int XMLCALL
  1702. XML_SetHashSalt(XML_Parser parser, unsigned long hash_salt) {
  1703. if (parser == NULL)
  1704. return 0;
  1705. if (parser->m_parentParser)
  1706. return XML_SetHashSalt(parser->m_parentParser, hash_salt);
  1707. /* block after XML_Parse()/XML_ParseBuffer() has been called */
  1708. if (parser->m_parsingStatus.parsing == XML_PARSING
  1709. || parser->m_parsingStatus.parsing == XML_SUSPENDED)
  1710. return 0;
  1711. parser->m_hash_secret_salt = hash_salt;
  1712. return 1;
  1713. }
  1714. enum XML_Status XMLCALL
  1715. XML_Parse(XML_Parser parser, const char *s, int len, int isFinal) {
  1716. if ((parser == NULL) || (len < 0) || ((s == NULL) && (len != 0))) {
  1717. if (parser != NULL)
  1718. parser->m_errorCode = XML_ERROR_INVALID_ARGUMENT;
  1719. return XML_STATUS_ERROR;
  1720. }
  1721. switch (parser->m_parsingStatus.parsing) {
  1722. case XML_SUSPENDED:
  1723. parser->m_errorCode = XML_ERROR_SUSPENDED;
  1724. return XML_STATUS_ERROR;
  1725. case XML_FINISHED:
  1726. parser->m_errorCode = XML_ERROR_FINISHED;
  1727. return XML_STATUS_ERROR;
  1728. case XML_INITIALIZED:
  1729. if (parser->m_parentParser == NULL && ! startParsing(parser)) {
  1730. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1731. return XML_STATUS_ERROR;
  1732. }
  1733. /* fall through */
  1734. default:
  1735. parser->m_parsingStatus.parsing = XML_PARSING;
  1736. }
  1737. #if XML_CONTEXT_BYTES == 0
  1738. if (parser->m_bufferPtr == parser->m_bufferEnd) {
  1739. const char *end;
  1740. int nLeftOver;
  1741. enum XML_Status result;
  1742. /* Detect overflow (a+b > MAX <==> b > MAX-a) */
  1743. if ((XML_Size)len > ((XML_Size)-1) / 2 - parser->m_parseEndByteIndex) {
  1744. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1745. parser->m_eventPtr = parser->m_eventEndPtr = NULL;
  1746. parser->m_processor = errorProcessor;
  1747. return XML_STATUS_ERROR;
  1748. }
  1749. // though this isn't a buffer request, we assume that `len` is the app's
  1750. // preferred buffer fill size, and therefore save it here.
  1751. parser->m_lastBufferRequestSize = len;
  1752. parser->m_parseEndByteIndex += len;
  1753. parser->m_positionPtr = s;
  1754. parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;
  1755. parser->m_errorCode
  1756. = callProcessor(parser, s, parser->m_parseEndPtr = s + len, &end);
  1757. if (parser->m_errorCode != XML_ERROR_NONE) {
  1758. parser->m_eventEndPtr = parser->m_eventPtr;
  1759. parser->m_processor = errorProcessor;
  1760. return XML_STATUS_ERROR;
  1761. } else {
  1762. switch (parser->m_parsingStatus.parsing) {
  1763. case XML_SUSPENDED:
  1764. result = XML_STATUS_SUSPENDED;
  1765. break;
  1766. case XML_INITIALIZED:
  1767. case XML_PARSING:
  1768. if (isFinal) {
  1769. parser->m_parsingStatus.parsing = XML_FINISHED;
  1770. return XML_STATUS_OK;
  1771. }
  1772. /* fall through */
  1773. default:
  1774. result = XML_STATUS_OK;
  1775. }
  1776. }
  1777. XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr, end,
  1778. &parser->m_position);
  1779. nLeftOver = s + len - end;
  1780. if (nLeftOver) {
  1781. // Back up and restore the parsing status to avoid XML_ERROR_SUSPENDED
  1782. // (and XML_ERROR_FINISHED) from XML_GetBuffer.
  1783. const enum XML_Parsing originalStatus = parser->m_parsingStatus.parsing;
  1784. parser->m_parsingStatus.parsing = XML_PARSING;
  1785. void *const temp = XML_GetBuffer(parser, nLeftOver);
  1786. parser->m_parsingStatus.parsing = originalStatus;
  1787. // GetBuffer may have overwritten this, but we want to remember what the
  1788. // app requested, not how many bytes were left over after parsing.
  1789. parser->m_lastBufferRequestSize = len;
  1790. if (temp == NULL) {
  1791. // NOTE: parser->m_errorCode has already been set by XML_GetBuffer().
  1792. parser->m_eventPtr = parser->m_eventEndPtr = NULL;
  1793. parser->m_processor = errorProcessor;
  1794. return XML_STATUS_ERROR;
  1795. }
  1796. // Since we know that the buffer was empty and XML_CONTEXT_BYTES is 0, we
  1797. // don't have any data to preserve, and can copy straight into the start
  1798. // of the buffer rather than the GetBuffer return pointer (which may be
  1799. // pointing further into the allocated buffer).
  1800. memcpy(parser->m_buffer, end, nLeftOver);
  1801. }
  1802. parser->m_bufferPtr = parser->m_buffer;
  1803. parser->m_bufferEnd = parser->m_buffer + nLeftOver;
  1804. parser->m_positionPtr = parser->m_bufferPtr;
  1805. parser->m_parseEndPtr = parser->m_bufferEnd;
  1806. parser->m_eventPtr = parser->m_bufferPtr;
  1807. parser->m_eventEndPtr = parser->m_bufferPtr;
  1808. return result;
  1809. }
  1810. #endif /* XML_CONTEXT_BYTES == 0 */
  1811. void *buff = XML_GetBuffer(parser, len);
  1812. if (buff == NULL)
  1813. return XML_STATUS_ERROR;
  1814. if (len > 0) {
  1815. assert(s != NULL); // make sure s==NULL && len!=0 was rejected above
  1816. memcpy(buff, s, len);
  1817. }
  1818. return XML_ParseBuffer(parser, len, isFinal);
  1819. }
  1820. enum XML_Status XMLCALL
  1821. XML_ParseBuffer(XML_Parser parser, int len, int isFinal) {
  1822. const char *start;
  1823. enum XML_Status result = XML_STATUS_OK;
  1824. if (parser == NULL)
  1825. return XML_STATUS_ERROR;
  1826. if (len < 0) {
  1827. parser->m_errorCode = XML_ERROR_INVALID_ARGUMENT;
  1828. return XML_STATUS_ERROR;
  1829. }
  1830. switch (parser->m_parsingStatus.parsing) {
  1831. case XML_SUSPENDED:
  1832. parser->m_errorCode = XML_ERROR_SUSPENDED;
  1833. return XML_STATUS_ERROR;
  1834. case XML_FINISHED:
  1835. parser->m_errorCode = XML_ERROR_FINISHED;
  1836. return XML_STATUS_ERROR;
  1837. case XML_INITIALIZED:
  1838. /* Has someone called XML_GetBuffer successfully before? */
  1839. if (! parser->m_bufferPtr) {
  1840. parser->m_errorCode = XML_ERROR_NO_BUFFER;
  1841. return XML_STATUS_ERROR;
  1842. }
  1843. if (parser->m_parentParser == NULL && ! startParsing(parser)) {
  1844. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1845. return XML_STATUS_ERROR;
  1846. }
  1847. /* fall through */
  1848. default:
  1849. parser->m_parsingStatus.parsing = XML_PARSING;
  1850. }
  1851. start = parser->m_bufferPtr;
  1852. parser->m_positionPtr = start;
  1853. parser->m_bufferEnd += len;
  1854. parser->m_parseEndPtr = parser->m_bufferEnd;
  1855. parser->m_parseEndByteIndex += len;
  1856. parser->m_parsingStatus.finalBuffer = (XML_Bool)isFinal;
  1857. parser->m_errorCode = callProcessor(parser, start, parser->m_parseEndPtr,
  1858. &parser->m_bufferPtr);
  1859. if (parser->m_errorCode != XML_ERROR_NONE) {
  1860. parser->m_eventEndPtr = parser->m_eventPtr;
  1861. parser->m_processor = errorProcessor;
  1862. return XML_STATUS_ERROR;
  1863. } else {
  1864. switch (parser->m_parsingStatus.parsing) {
  1865. case XML_SUSPENDED:
  1866. result = XML_STATUS_SUSPENDED;
  1867. break;
  1868. case XML_INITIALIZED:
  1869. case XML_PARSING:
  1870. if (isFinal) {
  1871. parser->m_parsingStatus.parsing = XML_FINISHED;
  1872. return result;
  1873. }
  1874. default:; /* should not happen */
  1875. }
  1876. }
  1877. XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,
  1878. parser->m_bufferPtr, &parser->m_position);
  1879. parser->m_positionPtr = parser->m_bufferPtr;
  1880. return result;
  1881. }
  1882. void *XMLCALL
  1883. XML_GetBuffer(XML_Parser parser, int len) {
  1884. if (parser == NULL)
  1885. return NULL;
  1886. if (len < 0) {
  1887. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1888. return NULL;
  1889. }
  1890. switch (parser->m_parsingStatus.parsing) {
  1891. case XML_SUSPENDED:
  1892. parser->m_errorCode = XML_ERROR_SUSPENDED;
  1893. return NULL;
  1894. case XML_FINISHED:
  1895. parser->m_errorCode = XML_ERROR_FINISHED;
  1896. return NULL;
  1897. default:;
  1898. }
  1899. // whether or not the request succeeds, `len` seems to be the app's preferred
  1900. // buffer fill size; remember it.
  1901. parser->m_lastBufferRequestSize = len;
  1902. if (len > EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_bufferEnd)
  1903. || parser->m_buffer == NULL) {
  1904. #if XML_CONTEXT_BYTES > 0
  1905. int keep;
  1906. #endif /* XML_CONTEXT_BYTES > 0 */
  1907. /* Do not invoke signed arithmetic overflow: */
  1908. int neededSize = (int)((unsigned)len
  1909. + (unsigned)EXPAT_SAFE_PTR_DIFF(
  1910. parser->m_bufferEnd, parser->m_bufferPtr));
  1911. if (neededSize < 0) {
  1912. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1913. return NULL;
  1914. }
  1915. #if XML_CONTEXT_BYTES > 0
  1916. keep = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer);
  1917. if (keep > XML_CONTEXT_BYTES)
  1918. keep = XML_CONTEXT_BYTES;
  1919. /* Detect and prevent integer overflow */
  1920. if (keep > INT_MAX - neededSize) {
  1921. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1922. return NULL;
  1923. }
  1924. neededSize += keep;
  1925. #endif /* XML_CONTEXT_BYTES > 0 */
  1926. if (parser->m_buffer && parser->m_bufferPtr
  1927. && neededSize
  1928. <= EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_buffer)) {
  1929. #if XML_CONTEXT_BYTES > 0
  1930. if (keep < EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)) {
  1931. int offset
  1932. = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferPtr, parser->m_buffer)
  1933. - keep;
  1934. /* The buffer pointers cannot be NULL here; we have at least some bytes
  1935. * in the buffer */
  1936. memmove(parser->m_buffer, &parser->m_buffer[offset],
  1937. parser->m_bufferEnd - parser->m_bufferPtr + keep);
  1938. parser->m_bufferEnd -= offset;
  1939. parser->m_bufferPtr -= offset;
  1940. }
  1941. #else
  1942. memmove(parser->m_buffer, parser->m_bufferPtr,
  1943. EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));
  1944. parser->m_bufferEnd
  1945. = parser->m_buffer
  1946. + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);
  1947. parser->m_bufferPtr = parser->m_buffer;
  1948. #endif /* XML_CONTEXT_BYTES > 0 */
  1949. } else {
  1950. char *newBuf;
  1951. int bufferSize
  1952. = (int)EXPAT_SAFE_PTR_DIFF(parser->m_bufferLim, parser->m_buffer);
  1953. if (bufferSize == 0)
  1954. bufferSize = INIT_BUFFER_SIZE;
  1955. do {
  1956. /* Do not invoke signed arithmetic overflow: */
  1957. bufferSize = (int)(2U * (unsigned)bufferSize);
  1958. } while (bufferSize < neededSize && bufferSize > 0);
  1959. if (bufferSize <= 0) {
  1960. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1961. return NULL;
  1962. }
  1963. newBuf = (char *)MALLOC(parser, bufferSize);
  1964. if (newBuf == 0) {
  1965. parser->m_errorCode = XML_ERROR_NO_MEMORY;
  1966. return NULL;
  1967. }
  1968. parser->m_bufferLim = newBuf + bufferSize;
  1969. #if XML_CONTEXT_BYTES > 0
  1970. if (parser->m_bufferPtr) {
  1971. memcpy(newBuf, &parser->m_bufferPtr[-keep],
  1972. EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)
  1973. + keep);
  1974. FREE(parser, parser->m_buffer);
  1975. parser->m_buffer = newBuf;
  1976. parser->m_bufferEnd
  1977. = parser->m_buffer
  1978. + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr)
  1979. + keep;
  1980. parser->m_bufferPtr = parser->m_buffer + keep;
  1981. } else {
  1982. /* This must be a brand new buffer with no data in it yet */
  1983. parser->m_bufferEnd = newBuf;
  1984. parser->m_bufferPtr = parser->m_buffer = newBuf;
  1985. }
  1986. #else
  1987. if (parser->m_bufferPtr) {
  1988. memcpy(newBuf, parser->m_bufferPtr,
  1989. EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr));
  1990. FREE(parser, parser->m_buffer);
  1991. parser->m_bufferEnd
  1992. = newBuf
  1993. + EXPAT_SAFE_PTR_DIFF(parser->m_bufferEnd, parser->m_bufferPtr);
  1994. } else {
  1995. /* This must be a brand new buffer with no data in it yet */
  1996. parser->m_bufferEnd = newBuf;
  1997. }
  1998. parser->m_bufferPtr = parser->m_buffer = newBuf;
  1999. #endif /* XML_CONTEXT_BYTES > 0 */
  2000. }
  2001. parser->m_eventPtr = parser->m_eventEndPtr = NULL;
  2002. parser->m_positionPtr = NULL;
  2003. }
  2004. return parser->m_bufferEnd;
  2005. }
  2006. enum XML_Status XMLCALL
  2007. XML_StopParser(XML_Parser parser, XML_Bool resumable) {
  2008. if (parser == NULL)
  2009. return XML_STATUS_ERROR;
  2010. switch (parser->m_parsingStatus.parsing) {
  2011. case XML_INITIALIZED:
  2012. parser->m_errorCode = XML_ERROR_NOT_STARTED;
  2013. return XML_STATUS_ERROR;
  2014. case XML_SUSPENDED:
  2015. if (resumable) {
  2016. parser->m_errorCode = XML_ERROR_SUSPENDED;
  2017. return XML_STATUS_ERROR;
  2018. }
  2019. parser->m_parsingStatus.parsing = XML_FINISHED;
  2020. break;
  2021. case XML_FINISHED:
  2022. parser->m_errorCode = XML_ERROR_FINISHED;
  2023. return XML_STATUS_ERROR;
  2024. case XML_PARSING:
  2025. if (resumable) {
  2026. #ifdef XML_DTD
  2027. if (parser->m_isParamEntity) {
  2028. parser->m_errorCode = XML_ERROR_SUSPEND_PE;
  2029. return XML_STATUS_ERROR;
  2030. }
  2031. #endif
  2032. parser->m_parsingStatus.parsing = XML_SUSPENDED;
  2033. } else
  2034. parser->m_parsingStatus.parsing = XML_FINISHED;
  2035. break;
  2036. default:
  2037. assert(0);
  2038. }
  2039. return XML_STATUS_OK;
  2040. }
  2041. enum XML_Status XMLCALL
  2042. XML_ResumeParser(XML_Parser parser) {
  2043. enum XML_Status result = XML_STATUS_OK;
  2044. if (parser == NULL)
  2045. return XML_STATUS_ERROR;
  2046. if (parser->m_parsingStatus.parsing != XML_SUSPENDED) {
  2047. parser->m_errorCode = XML_ERROR_NOT_SUSPENDED;
  2048. return XML_STATUS_ERROR;
  2049. }
  2050. parser->m_parsingStatus.parsing = XML_PARSING;
  2051. parser->m_errorCode = callProcessor(
  2052. parser, parser->m_bufferPtr, parser->m_parseEndPtr, &parser->m_bufferPtr);
  2053. if (parser->m_errorCode != XML_ERROR_NONE) {
  2054. parser->m_eventEndPtr = parser->m_eventPtr;
  2055. parser->m_processor = errorProcessor;
  2056. return XML_STATUS_ERROR;
  2057. } else {
  2058. switch (parser->m_parsingStatus.parsing) {
  2059. case XML_SUSPENDED:
  2060. result = XML_STATUS_SUSPENDED;
  2061. break;
  2062. case XML_INITIALIZED:
  2063. case XML_PARSING:
  2064. if (parser->m_parsingStatus.finalBuffer) {
  2065. parser->m_parsingStatus.parsing = XML_FINISHED;
  2066. return result;
  2067. }
  2068. default:;
  2069. }
  2070. }
  2071. XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,
  2072. parser->m_bufferPtr, &parser->m_position);
  2073. parser->m_positionPtr = parser->m_bufferPtr;
  2074. return result;
  2075. }
  2076. void XMLCALL
  2077. XML_GetParsingStatus(XML_Parser parser, XML_ParsingStatus *status) {
  2078. if (parser == NULL)
  2079. return;
  2080. assert(status != NULL);
  2081. *status = parser->m_parsingStatus;
  2082. }
  2083. enum XML_Error XMLCALL
  2084. XML_GetErrorCode(XML_Parser parser) {
  2085. if (parser == NULL)
  2086. return XML_ERROR_INVALID_ARGUMENT;
  2087. return parser->m_errorCode;
  2088. }
  2089. XML_Index XMLCALL
  2090. XML_GetCurrentByteIndex(XML_Parser parser) {
  2091. if (parser == NULL)
  2092. return -1;
  2093. if (parser->m_eventPtr)
  2094. return (XML_Index)(parser->m_parseEndByteIndex
  2095. - (parser->m_parseEndPtr - parser->m_eventPtr));
  2096. return -1;
  2097. }
  2098. int XMLCALL
  2099. XML_GetCurrentByteCount(XML_Parser parser) {
  2100. if (parser == NULL)
  2101. return 0;
  2102. if (parser->m_eventEndPtr && parser->m_eventPtr)
  2103. return (int)(parser->m_eventEndPtr - parser->m_eventPtr);
  2104. return 0;
  2105. }
  2106. const char *XMLCALL
  2107. XML_GetInputContext(XML_Parser parser, int *offset, int *size) {
  2108. #if XML_CONTEXT_BYTES > 0
  2109. if (parser == NULL)
  2110. return NULL;
  2111. if (parser->m_eventPtr && parser->m_buffer) {
  2112. if (offset != NULL)
  2113. *offset = (int)(parser->m_eventPtr - parser->m_buffer);
  2114. if (size != NULL)
  2115. *size = (int)(parser->m_bufferEnd - parser->m_buffer);
  2116. return parser->m_buffer;
  2117. }
  2118. #else
  2119. (void)parser;
  2120. (void)offset;
  2121. (void)size;
  2122. #endif /* XML_CONTEXT_BYTES > 0 */
  2123. return (const char *)0;
  2124. }
  2125. XML_Size XMLCALL
  2126. XML_GetCurrentLineNumber(XML_Parser parser) {
  2127. if (parser == NULL)
  2128. return 0;
  2129. if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {
  2130. XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,
  2131. parser->m_eventPtr, &parser->m_position);
  2132. parser->m_positionPtr = parser->m_eventPtr;
  2133. }
  2134. return parser->m_position.lineNumber + 1;
  2135. }
  2136. XML_Size XMLCALL
  2137. XML_GetCurrentColumnNumber(XML_Parser parser) {
  2138. if (parser == NULL)
  2139. return 0;
  2140. if (parser->m_eventPtr && parser->m_eventPtr >= parser->m_positionPtr) {
  2141. XmlUpdatePosition(parser->m_encoding, parser->m_positionPtr,
  2142. parser->m_eventPtr, &parser->m_position);
  2143. parser->m_positionPtr = parser->m_eventPtr;
  2144. }
  2145. return parser->m_position.columnNumber;
  2146. }
  2147. void XMLCALL
  2148. XML_FreeContentModel(XML_Parser parser, XML_Content *model) {
  2149. if (parser != NULL)
  2150. FREE(parser, model);
  2151. }
  2152. void *XMLCALL
  2153. XML_MemMalloc(XML_Parser parser, size_t size) {
  2154. if (parser == NULL)
  2155. return NULL;
  2156. return MALLOC(parser, size);
  2157. }
  2158. void *XMLCALL
  2159. XML_MemRealloc(XML_Parser parser, void *ptr, size_t size) {
  2160. if (parser == NULL)
  2161. return NULL;
  2162. return REALLOC(parser, ptr, size);
  2163. }
  2164. void XMLCALL
  2165. XML_MemFree(XML_Parser parser, void *ptr) {
  2166. if (parser != NULL)
  2167. FREE(parser, ptr);
  2168. }
  2169. void XMLCALL
  2170. XML_DefaultCurrent(XML_Parser parser) {
  2171. if (parser == NULL)
  2172. return;
  2173. if (parser->m_defaultHandler) {
  2174. if (parser->m_openInternalEntities)
  2175. reportDefault(parser, parser->m_internalEncoding,
  2176. parser->m_openInternalEntities->internalEventPtr,
  2177. parser->m_openInternalEntities->internalEventEndPtr);
  2178. else
  2179. reportDefault(parser, parser->m_encoding, parser->m_eventPtr,
  2180. parser->m_eventEndPtr);
  2181. }
  2182. }
  2183. const XML_LChar *XMLCALL
  2184. XML_ErrorString(enum XML_Error code) {
  2185. switch (code) {
  2186. case XML_ERROR_NONE:
  2187. return NULL;
  2188. case XML_ERROR_NO_MEMORY:
  2189. return XML_L("out of memory");
  2190. case XML_ERROR_SYNTAX:
  2191. return XML_L("syntax error");
  2192. case XML_ERROR_NO_ELEMENTS:
  2193. return XML_L("no element found");
  2194. case XML_ERROR_INVALID_TOKEN:
  2195. return XML_L("not well-formed (invalid token)");
  2196. case XML_ERROR_UNCLOSED_TOKEN:
  2197. return XML_L("unclosed token");
  2198. case XML_ERROR_PARTIAL_CHAR:
  2199. return XML_L("partial character");
  2200. case XML_ERROR_TAG_MISMATCH:
  2201. return XML_L("mismatched tag");
  2202. case XML_ERROR_DUPLICATE_ATTRIBUTE:
  2203. return XML_L("duplicate attribute");
  2204. case XML_ERROR_JUNK_AFTER_DOC_ELEMENT:
  2205. return XML_L("junk after document element");
  2206. case XML_ERROR_PARAM_ENTITY_REF:
  2207. return XML_L("illegal parameter entity reference");
  2208. case XML_ERROR_UNDEFINED_ENTITY:
  2209. return XML_L("undefined entity");
  2210. case XML_ERROR_RECURSIVE_ENTITY_REF:
  2211. return XML_L("recursive entity reference");
  2212. case XML_ERROR_ASYNC_ENTITY:
  2213. return XML_L("asynchronous entity");
  2214. case XML_ERROR_BAD_CHAR_REF:
  2215. return XML_L("reference to invalid character number");
  2216. case XML_ERROR_BINARY_ENTITY_REF:
  2217. return XML_L("reference to binary entity");
  2218. case XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF:
  2219. return XML_L("reference to external entity in attribute");
  2220. case XML_ERROR_MISPLACED_XML_PI:
  2221. return XML_L("XML or text declaration not at start of entity");
  2222. case XML_ERROR_UNKNOWN_ENCODING:
  2223. return XML_L("unknown encoding");
  2224. case XML_ERROR_INCORRECT_ENCODING:
  2225. return XML_L("encoding specified in XML declaration is incorrect");
  2226. case XML_ERROR_UNCLOSED_CDATA_SECTION:
  2227. return XML_L("unclosed CDATA section");
  2228. case XML_ERROR_EXTERNAL_ENTITY_HANDLING:
  2229. return XML_L("error in processing external entity reference");
  2230. case XML_ERROR_NOT_STANDALONE:
  2231. return XML_L("document is not standalone");
  2232. case XML_ERROR_UNEXPECTED_STATE:
  2233. return XML_L("unexpected parser state - please send a bug report");
  2234. case XML_ERROR_ENTITY_DECLARED_IN_PE:
  2235. return XML_L("entity declared in parameter entity");
  2236. case XML_ERROR_FEATURE_REQUIRES_XML_DTD:
  2237. return XML_L("requested feature requires XML_DTD support in Expat");
  2238. case XML_ERROR_CANT_CHANGE_FEATURE_ONCE_PARSING:
  2239. return XML_L("cannot change setting once parsing has begun");
  2240. /* Added in 1.95.7. */
  2241. case XML_ERROR_UNBOUND_PREFIX:
  2242. return XML_L("unbound prefix");
  2243. /* Added in 1.95.8. */
  2244. case XML_ERROR_UNDECLARING_PREFIX:
  2245. return XML_L("must not undeclare prefix");
  2246. case XML_ERROR_INCOMPLETE_PE:
  2247. return XML_L("incomplete markup in parameter entity");
  2248. case XML_ERROR_XML_DECL:
  2249. return XML_L("XML declaration not well-formed");
  2250. case XML_ERROR_TEXT_DECL:
  2251. return XML_L("text declaration not well-formed");
  2252. case XML_ERROR_PUBLICID:
  2253. return XML_L("illegal character(s) in public id");
  2254. case XML_ERROR_SUSPENDED:
  2255. return XML_L("parser suspended");
  2256. case XML_ERROR_NOT_SUSPENDED:
  2257. return XML_L("parser not suspended");
  2258. case XML_ERROR_ABORTED:
  2259. return XML_L("parsing aborted");
  2260. case XML_ERROR_FINISHED:
  2261. return XML_L("parsing finished");
  2262. case XML_ERROR_SUSPEND_PE:
  2263. return XML_L("cannot suspend in external parameter entity");
  2264. /* Added in 2.0.0. */
  2265. case XML_ERROR_RESERVED_PREFIX_XML:
  2266. return XML_L(
  2267. "reserved prefix (xml) must not be undeclared or bound to another namespace name");
  2268. case XML_ERROR_RESERVED_PREFIX_XMLNS:
  2269. return XML_L("reserved prefix (xmlns) must not be declared or undeclared");
  2270. case XML_ERROR_RESERVED_NAMESPACE_URI:
  2271. return XML_L(
  2272. "prefix must not be bound to one of the reserved namespace names");
  2273. /* Added in 2.2.5. */
  2274. case XML_ERROR_INVALID_ARGUMENT: /* Constant added in 2.2.1, already */
  2275. return XML_L("invalid argument");
  2276. /* Added in 2.3.0. */
  2277. case XML_ERROR_NO_BUFFER:
  2278. return XML_L(
  2279. "a successful prior call to function XML_GetBuffer is required");
  2280. /* Added in 2.4.0. */
  2281. case XML_ERROR_AMPLIFICATION_LIMIT_BREACH:
  2282. return XML_L(
  2283. "limit on input amplification factor (from DTD and entities) breached");
  2284. /* Added in 2.6.4. */
  2285. case XML_ERROR_NOT_STARTED:
  2286. return XML_L("parser not started");
  2287. }
  2288. return NULL;
  2289. }
  2290. const XML_LChar *XMLCALL
  2291. XML_ExpatVersion(void) {
  2292. /* V1 is used to string-ize the version number. However, it would
  2293. string-ize the actual version macro *names* unless we get them
  2294. substituted before being passed to V1. CPP is defined to expand
  2295. a macro, then rescan for more expansions. Thus, we use V2 to expand
  2296. the version macros, then CPP will expand the resulting V1() macro
  2297. with the correct numerals. */
  2298. /* ### I'm assuming cpp is portable in this respect... */
  2299. #define V1(a, b, c) XML_L(#a) XML_L(".") XML_L(#b) XML_L(".") XML_L(#c)
  2300. #define V2(a, b, c) XML_L("expat_") V1(a, b, c)
  2301. return V2(XML_MAJOR_VERSION, XML_MINOR_VERSION, XML_MICRO_VERSION);
  2302. #undef V1
  2303. #undef V2
  2304. }
  2305. XML_Expat_Version XMLCALL
  2306. XML_ExpatVersionInfo(void) {
  2307. XML_Expat_Version version;
  2308. version.major = XML_MAJOR_VERSION;
  2309. version.minor = XML_MINOR_VERSION;
  2310. version.micro = XML_MICRO_VERSION;
  2311. return version;
  2312. }
  2313. const XML_Feature *XMLCALL
  2314. XML_GetFeatureList(void) {
  2315. static const XML_Feature features[] = {
  2316. {XML_FEATURE_SIZEOF_XML_CHAR, XML_L("sizeof(XML_Char)"),
  2317. sizeof(XML_Char)},
  2318. {XML_FEATURE_SIZEOF_XML_LCHAR, XML_L("sizeof(XML_LChar)"),
  2319. sizeof(XML_LChar)},
  2320. #ifdef XML_UNICODE
  2321. {XML_FEATURE_UNICODE, XML_L("XML_UNICODE"), 0},
  2322. #endif
  2323. #ifdef XML_UNICODE_WCHAR_T
  2324. {XML_FEATURE_UNICODE_WCHAR_T, XML_L("XML_UNICODE_WCHAR_T"), 0},
  2325. #endif
  2326. #ifdef XML_DTD
  2327. {XML_FEATURE_DTD, XML_L("XML_DTD"), 0},
  2328. #endif
  2329. #if XML_CONTEXT_BYTES > 0
  2330. {XML_FEATURE_CONTEXT_BYTES, XML_L("XML_CONTEXT_BYTES"),
  2331. XML_CONTEXT_BYTES},
  2332. #endif
  2333. #ifdef XML_MIN_SIZE
  2334. {XML_FEATURE_MIN_SIZE, XML_L("XML_MIN_SIZE"), 0},
  2335. #endif
  2336. #ifdef XML_NS
  2337. {XML_FEATURE_NS, XML_L("XML_NS"), 0},
  2338. #endif
  2339. #ifdef XML_LARGE_SIZE
  2340. {XML_FEATURE_LARGE_SIZE, XML_L("XML_LARGE_SIZE"), 0},
  2341. #endif
  2342. #ifdef XML_ATTR_INFO
  2343. {XML_FEATURE_ATTR_INFO, XML_L("XML_ATTR_INFO"), 0},
  2344. #endif
  2345. #if XML_GE == 1
  2346. /* Added in Expat 2.4.0 for XML_DTD defined and
  2347. * added in Expat 2.6.0 for XML_GE == 1. */
  2348. {XML_FEATURE_BILLION_LAUGHS_ATTACK_PROTECTION_MAXIMUM_AMPLIFICATION_DEFAULT,
  2349. XML_L("XML_BLAP_MAX_AMP"),
  2350. (long int)
  2351. EXPAT_BILLION_LAUGHS_ATTACK_PROTECTION_MAXIMUM_AMPLIFICATION_DEFAULT},
  2352. {XML_FEATURE_BILLION_LAUGHS_ATTACK_PROTECTION_ACTIVATION_THRESHOLD_DEFAULT,
  2353. XML_L("XML_BLAP_ACT_THRES"),
  2354. EXPAT_BILLION_LAUGHS_ATTACK_PROTECTION_ACTIVATION_THRESHOLD_DEFAULT},
  2355. /* Added in Expat 2.6.0. */
  2356. {XML_FEATURE_GE, XML_L("XML_GE"), 0},
  2357. #endif
  2358. {XML_FEATURE_END, NULL, 0}};
  2359. return features;
  2360. }
  2361. #if XML_GE == 1
  2362. XML_Bool XMLCALL
  2363. XML_SetBillionLaughsAttackProtectionMaximumAmplification(
  2364. XML_Parser parser, float maximumAmplificationFactor) {
  2365. if ((parser == NULL) || (parser->m_parentParser != NULL)
  2366. || isnan(maximumAmplificationFactor)
  2367. || (maximumAmplificationFactor < 1.0f)) {
  2368. return XML_FALSE;
  2369. }
  2370. parser->m_accounting.maximumAmplificationFactor = maximumAmplificationFactor;
  2371. return XML_TRUE;
  2372. }
  2373. XML_Bool XMLCALL
  2374. XML_SetBillionLaughsAttackProtectionActivationThreshold(
  2375. XML_Parser parser, unsigned long long activationThresholdBytes) {
  2376. if ((parser == NULL) || (parser->m_parentParser != NULL)) {
  2377. return XML_FALSE;
  2378. }
  2379. parser->m_accounting.activationThresholdBytes = activationThresholdBytes;
  2380. return XML_TRUE;
  2381. }
  2382. #endif /* XML_GE == 1 */
  2383. XML_Bool XMLCALL
  2384. XML_SetReparseDeferralEnabled(XML_Parser parser, XML_Bool enabled) {
  2385. if (parser != NULL && (enabled == XML_TRUE || enabled == XML_FALSE)) {
  2386. parser->m_reparseDeferralEnabled = enabled;
  2387. return XML_TRUE;
  2388. }
  2389. return XML_FALSE;
  2390. }
  2391. /* Initially tag->rawName always points into the parse buffer;
  2392. for those TAG instances opened while the current parse buffer was
  2393. processed, and not yet closed, we need to store tag->rawName in a more
  2394. permanent location, since the parse buffer is about to be discarded.
  2395. */
  2396. static XML_Bool
  2397. storeRawNames(XML_Parser parser) {
  2398. TAG *tag = parser->m_tagStack;
  2399. while (tag) {
  2400. int bufSize;
  2401. int nameLen = sizeof(XML_Char) * (tag->name.strLen + 1);
  2402. size_t rawNameLen;
  2403. char *rawNameBuf = tag->buf + nameLen;
  2404. /* Stop if already stored. Since m_tagStack is a stack, we can stop
  2405. at the first entry that has already been copied; everything
  2406. below it in the stack is already been accounted for in a
  2407. previous call to this function.
  2408. */
  2409. if (tag->rawName == rawNameBuf)
  2410. break;
  2411. /* For reuse purposes we need to ensure that the
  2412. size of tag->buf is a multiple of sizeof(XML_Char).
  2413. */
  2414. rawNameLen = ROUND_UP(tag->rawNameLength, sizeof(XML_Char));
  2415. /* Detect and prevent integer overflow. */
  2416. if (rawNameLen > (size_t)INT_MAX - nameLen)
  2417. return XML_FALSE;
  2418. bufSize = nameLen + (int)rawNameLen;
  2419. if (bufSize > tag->bufEnd - tag->buf) {
  2420. char *temp = (char *)REALLOC(parser, tag->buf, bufSize);
  2421. if (temp == NULL)
  2422. return XML_FALSE;
  2423. /* if tag->name.str points to tag->buf (only when namespace
  2424. processing is off) then we have to update it
  2425. */
  2426. if (tag->name.str == (XML_Char *)tag->buf)
  2427. tag->name.str = (XML_Char *)temp;
  2428. /* if tag->name.localPart is set (when namespace processing is on)
  2429. then update it as well, since it will always point into tag->buf
  2430. */
  2431. if (tag->name.localPart)
  2432. tag->name.localPart
  2433. = (XML_Char *)temp + (tag->name.localPart - (XML_Char *)tag->buf);
  2434. tag->buf = temp;
  2435. tag->bufEnd = temp + bufSize;
  2436. rawNameBuf = temp + nameLen;
  2437. }
  2438. memcpy(rawNameBuf, tag->rawName, tag->rawNameLength);
  2439. tag->rawName = rawNameBuf;
  2440. tag = tag->parent;
  2441. }
  2442. return XML_TRUE;
  2443. }
  2444. static enum XML_Error PTRCALL
  2445. contentProcessor(XML_Parser parser, const char *start, const char *end,
  2446. const char **endPtr) {
  2447. enum XML_Error result = doContent(
  2448. parser, 0, parser->m_encoding, start, end, endPtr,
  2449. (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_ACCOUNT_DIRECT);
  2450. if (result == XML_ERROR_NONE) {
  2451. if (! storeRawNames(parser))
  2452. return XML_ERROR_NO_MEMORY;
  2453. }
  2454. return result;
  2455. }
  2456. static enum XML_Error PTRCALL
  2457. externalEntityInitProcessor(XML_Parser parser, const char *start,
  2458. const char *end, const char **endPtr) {
  2459. enum XML_Error result = initializeEncoding(parser);
  2460. if (result != XML_ERROR_NONE)
  2461. return result;
  2462. parser->m_processor = externalEntityInitProcessor2;
  2463. return externalEntityInitProcessor2(parser, start, end, endPtr);
  2464. }
  2465. static enum XML_Error PTRCALL
  2466. externalEntityInitProcessor2(XML_Parser parser, const char *start,
  2467. const char *end, const char **endPtr) {
  2468. const char *next = start; /* XmlContentTok doesn't always set the last arg */
  2469. int tok = XmlContentTok(parser->m_encoding, start, end, &next);
  2470. switch (tok) {
  2471. case XML_TOK_BOM:
  2472. #if XML_GE == 1
  2473. if (! accountingDiffTolerated(parser, tok, start, next, __LINE__,
  2474. XML_ACCOUNT_DIRECT)) {
  2475. accountingOnAbort(parser);
  2476. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  2477. }
  2478. #endif /* XML_GE == 1 */
  2479. /* If we are at the end of the buffer, this would cause the next stage,
  2480. i.e. externalEntityInitProcessor3, to pass control directly to
  2481. doContent (by detecting XML_TOK_NONE) without processing any xml text
  2482. declaration - causing the error XML_ERROR_MISPLACED_XML_PI in doContent.
  2483. */
  2484. if (next == end && ! parser->m_parsingStatus.finalBuffer) {
  2485. *endPtr = next;
  2486. return XML_ERROR_NONE;
  2487. }
  2488. start = next;
  2489. break;
  2490. case XML_TOK_PARTIAL:
  2491. if (! parser->m_parsingStatus.finalBuffer) {
  2492. *endPtr = start;
  2493. return XML_ERROR_NONE;
  2494. }
  2495. parser->m_eventPtr = start;
  2496. return XML_ERROR_UNCLOSED_TOKEN;
  2497. case XML_TOK_PARTIAL_CHAR:
  2498. if (! parser->m_parsingStatus.finalBuffer) {
  2499. *endPtr = start;
  2500. return XML_ERROR_NONE;
  2501. }
  2502. parser->m_eventPtr = start;
  2503. return XML_ERROR_PARTIAL_CHAR;
  2504. }
  2505. parser->m_processor = externalEntityInitProcessor3;
  2506. return externalEntityInitProcessor3(parser, start, end, endPtr);
  2507. }
  2508. static enum XML_Error PTRCALL
  2509. externalEntityInitProcessor3(XML_Parser parser, const char *start,
  2510. const char *end, const char **endPtr) {
  2511. int tok;
  2512. const char *next = start; /* XmlContentTok doesn't always set the last arg */
  2513. parser->m_eventPtr = start;
  2514. tok = XmlContentTok(parser->m_encoding, start, end, &next);
  2515. /* Note: These bytes are accounted later in:
  2516. - processXmlDecl
  2517. - externalEntityContentProcessor
  2518. */
  2519. parser->m_eventEndPtr = next;
  2520. switch (tok) {
  2521. case XML_TOK_XML_DECL: {
  2522. enum XML_Error result;
  2523. result = processXmlDecl(parser, 1, start, next);
  2524. if (result != XML_ERROR_NONE)
  2525. return result;
  2526. switch (parser->m_parsingStatus.parsing) {
  2527. case XML_SUSPENDED:
  2528. *endPtr = next;
  2529. return XML_ERROR_NONE;
  2530. case XML_FINISHED:
  2531. return XML_ERROR_ABORTED;
  2532. default:
  2533. start = next;
  2534. }
  2535. } break;
  2536. case XML_TOK_PARTIAL:
  2537. if (! parser->m_parsingStatus.finalBuffer) {
  2538. *endPtr = start;
  2539. return XML_ERROR_NONE;
  2540. }
  2541. return XML_ERROR_UNCLOSED_TOKEN;
  2542. case XML_TOK_PARTIAL_CHAR:
  2543. if (! parser->m_parsingStatus.finalBuffer) {
  2544. *endPtr = start;
  2545. return XML_ERROR_NONE;
  2546. }
  2547. return XML_ERROR_PARTIAL_CHAR;
  2548. }
  2549. parser->m_processor = externalEntityContentProcessor;
  2550. parser->m_tagLevel = 1;
  2551. return externalEntityContentProcessor(parser, start, end, endPtr);
  2552. }
  2553. static enum XML_Error PTRCALL
  2554. externalEntityContentProcessor(XML_Parser parser, const char *start,
  2555. const char *end, const char **endPtr) {
  2556. enum XML_Error result
  2557. = doContent(parser, 1, parser->m_encoding, start, end, endPtr,
  2558. (XML_Bool)! parser->m_parsingStatus.finalBuffer,
  2559. XML_ACCOUNT_ENTITY_EXPANSION);
  2560. if (result == XML_ERROR_NONE) {
  2561. if (! storeRawNames(parser))
  2562. return XML_ERROR_NO_MEMORY;
  2563. }
  2564. return result;
  2565. }
  2566. static enum XML_Error
  2567. doContent(XML_Parser parser, int startTagLevel, const ENCODING *enc,
  2568. const char *s, const char *end, const char **nextPtr,
  2569. XML_Bool haveMore, enum XML_Account account) {
  2570. /* save one level of indirection */
  2571. DTD *const dtd = parser->m_dtd;
  2572. const char **eventPP;
  2573. const char **eventEndPP;
  2574. if (enc == parser->m_encoding) {
  2575. eventPP = &parser->m_eventPtr;
  2576. eventEndPP = &parser->m_eventEndPtr;
  2577. } else {
  2578. eventPP = &(parser->m_openInternalEntities->internalEventPtr);
  2579. eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);
  2580. }
  2581. *eventPP = s;
  2582. for (;;) {
  2583. const char *next = s; /* XmlContentTok doesn't always set the last arg */
  2584. int tok = XmlContentTok(enc, s, end, &next);
  2585. #if XML_GE == 1
  2586. const char *accountAfter
  2587. = ((tok == XML_TOK_TRAILING_RSQB) || (tok == XML_TOK_TRAILING_CR))
  2588. ? (haveMore ? s /* i.e. 0 bytes */ : end)
  2589. : next;
  2590. if (! accountingDiffTolerated(parser, tok, s, accountAfter, __LINE__,
  2591. account)) {
  2592. accountingOnAbort(parser);
  2593. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  2594. }
  2595. #endif
  2596. *eventEndPP = next;
  2597. switch (tok) {
  2598. case XML_TOK_TRAILING_CR:
  2599. if (haveMore) {
  2600. *nextPtr = s;
  2601. return XML_ERROR_NONE;
  2602. }
  2603. *eventEndPP = end;
  2604. if (parser->m_characterDataHandler) {
  2605. XML_Char c = 0xA;
  2606. parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);
  2607. } else if (parser->m_defaultHandler)
  2608. reportDefault(parser, enc, s, end);
  2609. /* We are at the end of the final buffer, should we check for
  2610. XML_SUSPENDED, XML_FINISHED?
  2611. */
  2612. if (startTagLevel == 0)
  2613. return XML_ERROR_NO_ELEMENTS;
  2614. if (parser->m_tagLevel != startTagLevel)
  2615. return XML_ERROR_ASYNC_ENTITY;
  2616. *nextPtr = end;
  2617. return XML_ERROR_NONE;
  2618. case XML_TOK_NONE:
  2619. if (haveMore) {
  2620. *nextPtr = s;
  2621. return XML_ERROR_NONE;
  2622. }
  2623. if (startTagLevel > 0) {
  2624. if (parser->m_tagLevel != startTagLevel)
  2625. return XML_ERROR_ASYNC_ENTITY;
  2626. *nextPtr = s;
  2627. return XML_ERROR_NONE;
  2628. }
  2629. return XML_ERROR_NO_ELEMENTS;
  2630. case XML_TOK_INVALID:
  2631. *eventPP = next;
  2632. return XML_ERROR_INVALID_TOKEN;
  2633. case XML_TOK_PARTIAL:
  2634. if (haveMore) {
  2635. *nextPtr = s;
  2636. return XML_ERROR_NONE;
  2637. }
  2638. return XML_ERROR_UNCLOSED_TOKEN;
  2639. case XML_TOK_PARTIAL_CHAR:
  2640. if (haveMore) {
  2641. *nextPtr = s;
  2642. return XML_ERROR_NONE;
  2643. }
  2644. return XML_ERROR_PARTIAL_CHAR;
  2645. case XML_TOK_ENTITY_REF: {
  2646. const XML_Char *name;
  2647. ENTITY *entity;
  2648. XML_Char ch = (XML_Char)XmlPredefinedEntityName(
  2649. enc, s + enc->minBytesPerChar, next - enc->minBytesPerChar);
  2650. if (ch) {
  2651. #if XML_GE == 1
  2652. /* NOTE: We are replacing 4-6 characters original input for 1 character
  2653. * so there is no amplification and hence recording without
  2654. * protection. */
  2655. accountingDiffTolerated(parser, tok, (char *)&ch,
  2656. ((char *)&ch) + sizeof(XML_Char), __LINE__,
  2657. XML_ACCOUNT_ENTITY_EXPANSION);
  2658. #endif /* XML_GE == 1 */
  2659. if (parser->m_characterDataHandler)
  2660. parser->m_characterDataHandler(parser->m_handlerArg, &ch, 1);
  2661. else if (parser->m_defaultHandler)
  2662. reportDefault(parser, enc, s, next);
  2663. break;
  2664. }
  2665. name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,
  2666. next - enc->minBytesPerChar);
  2667. if (! name)
  2668. return XML_ERROR_NO_MEMORY;
  2669. entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);
  2670. poolDiscard(&dtd->pool);
  2671. /* First, determine if a check for an existing declaration is needed;
  2672. if yes, check that the entity exists, and that it is internal,
  2673. otherwise call the skipped entity or default handler.
  2674. */
  2675. if (! dtd->hasParamEntityRefs || dtd->standalone) {
  2676. if (! entity)
  2677. return XML_ERROR_UNDEFINED_ENTITY;
  2678. else if (! entity->is_internal)
  2679. return XML_ERROR_ENTITY_DECLARED_IN_PE;
  2680. } else if (! entity) {
  2681. if (parser->m_skippedEntityHandler)
  2682. parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);
  2683. else if (parser->m_defaultHandler)
  2684. reportDefault(parser, enc, s, next);
  2685. break;
  2686. }
  2687. if (entity->open)
  2688. return XML_ERROR_RECURSIVE_ENTITY_REF;
  2689. if (entity->notation)
  2690. return XML_ERROR_BINARY_ENTITY_REF;
  2691. if (entity->textPtr) {
  2692. enum XML_Error result;
  2693. if (! parser->m_defaultExpandInternalEntities) {
  2694. if (parser->m_skippedEntityHandler)
  2695. parser->m_skippedEntityHandler(parser->m_handlerArg, entity->name,
  2696. 0);
  2697. else if (parser->m_defaultHandler)
  2698. reportDefault(parser, enc, s, next);
  2699. break;
  2700. }
  2701. result = processInternalEntity(parser, entity, XML_FALSE);
  2702. if (result != XML_ERROR_NONE)
  2703. return result;
  2704. } else if (parser->m_externalEntityRefHandler) {
  2705. const XML_Char *context;
  2706. entity->open = XML_TRUE;
  2707. context = getContext(parser);
  2708. entity->open = XML_FALSE;
  2709. if (! context)
  2710. return XML_ERROR_NO_MEMORY;
  2711. if (! parser->m_externalEntityRefHandler(
  2712. parser->m_externalEntityRefHandlerArg, context, entity->base,
  2713. entity->systemId, entity->publicId))
  2714. return XML_ERROR_EXTERNAL_ENTITY_HANDLING;
  2715. poolDiscard(&parser->m_tempPool);
  2716. } else if (parser->m_defaultHandler)
  2717. reportDefault(parser, enc, s, next);
  2718. break;
  2719. }
  2720. case XML_TOK_START_TAG_NO_ATTS:
  2721. /* fall through */
  2722. case XML_TOK_START_TAG_WITH_ATTS: {
  2723. TAG *tag;
  2724. enum XML_Error result;
  2725. XML_Char *toPtr;
  2726. if (parser->m_freeTagList) {
  2727. tag = parser->m_freeTagList;
  2728. parser->m_freeTagList = parser->m_freeTagList->parent;
  2729. } else {
  2730. tag = (TAG *)MALLOC(parser, sizeof(TAG));
  2731. if (! tag)
  2732. return XML_ERROR_NO_MEMORY;
  2733. tag->buf = (char *)MALLOC(parser, INIT_TAG_BUF_SIZE);
  2734. if (! tag->buf) {
  2735. FREE(parser, tag);
  2736. return XML_ERROR_NO_MEMORY;
  2737. }
  2738. tag->bufEnd = tag->buf + INIT_TAG_BUF_SIZE;
  2739. }
  2740. tag->bindings = NULL;
  2741. tag->parent = parser->m_tagStack;
  2742. parser->m_tagStack = tag;
  2743. tag->name.localPart = NULL;
  2744. tag->name.prefix = NULL;
  2745. tag->rawName = s + enc->minBytesPerChar;
  2746. tag->rawNameLength = XmlNameLength(enc, tag->rawName);
  2747. ++parser->m_tagLevel;
  2748. {
  2749. const char *rawNameEnd = tag->rawName + tag->rawNameLength;
  2750. const char *fromPtr = tag->rawName;
  2751. toPtr = (XML_Char *)tag->buf;
  2752. for (;;) {
  2753. int bufSize;
  2754. int convLen;
  2755. const enum XML_Convert_Result convert_res
  2756. = XmlConvert(enc, &fromPtr, rawNameEnd, (ICHAR **)&toPtr,
  2757. (ICHAR *)tag->bufEnd - 1);
  2758. convLen = (int)(toPtr - (XML_Char *)tag->buf);
  2759. if ((fromPtr >= rawNameEnd)
  2760. || (convert_res == XML_CONVERT_INPUT_INCOMPLETE)) {
  2761. tag->name.strLen = convLen;
  2762. break;
  2763. }
  2764. bufSize = (int)(tag->bufEnd - tag->buf) << 1;
  2765. {
  2766. char *temp = (char *)REALLOC(parser, tag->buf, bufSize);
  2767. if (temp == NULL)
  2768. return XML_ERROR_NO_MEMORY;
  2769. tag->buf = temp;
  2770. tag->bufEnd = temp + bufSize;
  2771. toPtr = (XML_Char *)temp + convLen;
  2772. }
  2773. }
  2774. }
  2775. tag->name.str = (XML_Char *)tag->buf;
  2776. *toPtr = XML_T('\0');
  2777. result
  2778. = storeAtts(parser, enc, s, &(tag->name), &(tag->bindings), account);
  2779. if (result)
  2780. return result;
  2781. if (parser->m_startElementHandler)
  2782. parser->m_startElementHandler(parser->m_handlerArg, tag->name.str,
  2783. (const XML_Char **)parser->m_atts);
  2784. else if (parser->m_defaultHandler)
  2785. reportDefault(parser, enc, s, next);
  2786. poolClear(&parser->m_tempPool);
  2787. break;
  2788. }
  2789. case XML_TOK_EMPTY_ELEMENT_NO_ATTS:
  2790. /* fall through */
  2791. case XML_TOK_EMPTY_ELEMENT_WITH_ATTS: {
  2792. const char *rawName = s + enc->minBytesPerChar;
  2793. enum XML_Error result;
  2794. BINDING *bindings = NULL;
  2795. XML_Bool noElmHandlers = XML_TRUE;
  2796. TAG_NAME name;
  2797. name.str = poolStoreString(&parser->m_tempPool, enc, rawName,
  2798. rawName + XmlNameLength(enc, rawName));
  2799. if (! name.str)
  2800. return XML_ERROR_NO_MEMORY;
  2801. poolFinish(&parser->m_tempPool);
  2802. result = storeAtts(parser, enc, s, &name, &bindings,
  2803. XML_ACCOUNT_NONE /* token spans whole start tag */);
  2804. if (result != XML_ERROR_NONE) {
  2805. freeBindings(parser, bindings);
  2806. return result;
  2807. }
  2808. poolFinish(&parser->m_tempPool);
  2809. if (parser->m_startElementHandler) {
  2810. parser->m_startElementHandler(parser->m_handlerArg, name.str,
  2811. (const XML_Char **)parser->m_atts);
  2812. noElmHandlers = XML_FALSE;
  2813. }
  2814. if (parser->m_endElementHandler) {
  2815. if (parser->m_startElementHandler)
  2816. *eventPP = *eventEndPP;
  2817. parser->m_endElementHandler(parser->m_handlerArg, name.str);
  2818. noElmHandlers = XML_FALSE;
  2819. }
  2820. if (noElmHandlers && parser->m_defaultHandler)
  2821. reportDefault(parser, enc, s, next);
  2822. poolClear(&parser->m_tempPool);
  2823. freeBindings(parser, bindings);
  2824. }
  2825. if ((parser->m_tagLevel == 0)
  2826. && (parser->m_parsingStatus.parsing != XML_FINISHED)) {
  2827. if (parser->m_parsingStatus.parsing == XML_SUSPENDED)
  2828. parser->m_processor = epilogProcessor;
  2829. else
  2830. return epilogProcessor(parser, next, end, nextPtr);
  2831. }
  2832. break;
  2833. case XML_TOK_END_TAG:
  2834. if (parser->m_tagLevel == startTagLevel)
  2835. return XML_ERROR_ASYNC_ENTITY;
  2836. else {
  2837. int len;
  2838. const char *rawName;
  2839. TAG *tag = parser->m_tagStack;
  2840. rawName = s + enc->minBytesPerChar * 2;
  2841. len = XmlNameLength(enc, rawName);
  2842. if (len != tag->rawNameLength
  2843. || memcmp(tag->rawName, rawName, len) != 0) {
  2844. *eventPP = rawName;
  2845. return XML_ERROR_TAG_MISMATCH;
  2846. }
  2847. parser->m_tagStack = tag->parent;
  2848. tag->parent = parser->m_freeTagList;
  2849. parser->m_freeTagList = tag;
  2850. --parser->m_tagLevel;
  2851. if (parser->m_endElementHandler) {
  2852. const XML_Char *localPart;
  2853. const XML_Char *prefix;
  2854. XML_Char *uri;
  2855. localPart = tag->name.localPart;
  2856. if (parser->m_ns && localPart) {
  2857. /* localPart and prefix may have been overwritten in
  2858. tag->name.str, since this points to the binding->uri
  2859. buffer which gets reused; so we have to add them again
  2860. */
  2861. uri = (XML_Char *)tag->name.str + tag->name.uriLen;
  2862. /* don't need to check for space - already done in storeAtts() */
  2863. while (*localPart)
  2864. *uri++ = *localPart++;
  2865. prefix = tag->name.prefix;
  2866. if (parser->m_ns_triplets && prefix) {
  2867. *uri++ = parser->m_namespaceSeparator;
  2868. while (*prefix)
  2869. *uri++ = *prefix++;
  2870. }
  2871. *uri = XML_T('\0');
  2872. }
  2873. parser->m_endElementHandler(parser->m_handlerArg, tag->name.str);
  2874. } else if (parser->m_defaultHandler)
  2875. reportDefault(parser, enc, s, next);
  2876. while (tag->bindings) {
  2877. BINDING *b = tag->bindings;
  2878. if (parser->m_endNamespaceDeclHandler)
  2879. parser->m_endNamespaceDeclHandler(parser->m_handlerArg,
  2880. b->prefix->name);
  2881. tag->bindings = tag->bindings->nextTagBinding;
  2882. b->nextTagBinding = parser->m_freeBindingList;
  2883. parser->m_freeBindingList = b;
  2884. b->prefix->binding = b->prevPrefixBinding;
  2885. }
  2886. if ((parser->m_tagLevel == 0)
  2887. && (parser->m_parsingStatus.parsing != XML_FINISHED)) {
  2888. if (parser->m_parsingStatus.parsing == XML_SUSPENDED)
  2889. parser->m_processor = epilogProcessor;
  2890. else
  2891. return epilogProcessor(parser, next, end, nextPtr);
  2892. }
  2893. }
  2894. break;
  2895. case XML_TOK_CHAR_REF: {
  2896. int n = XmlCharRefNumber(enc, s);
  2897. if (n < 0)
  2898. return XML_ERROR_BAD_CHAR_REF;
  2899. if (parser->m_characterDataHandler) {
  2900. XML_Char buf[XML_ENCODE_MAX];
  2901. parser->m_characterDataHandler(parser->m_handlerArg, buf,
  2902. XmlEncode(n, (ICHAR *)buf));
  2903. } else if (parser->m_defaultHandler)
  2904. reportDefault(parser, enc, s, next);
  2905. } break;
  2906. case XML_TOK_XML_DECL:
  2907. return XML_ERROR_MISPLACED_XML_PI;
  2908. case XML_TOK_DATA_NEWLINE:
  2909. if (parser->m_characterDataHandler) {
  2910. XML_Char c = 0xA;
  2911. parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);
  2912. } else if (parser->m_defaultHandler)
  2913. reportDefault(parser, enc, s, next);
  2914. break;
  2915. case XML_TOK_CDATA_SECT_OPEN: {
  2916. enum XML_Error result;
  2917. if (parser->m_startCdataSectionHandler)
  2918. parser->m_startCdataSectionHandler(parser->m_handlerArg);
  2919. /* BEGIN disabled code */
  2920. /* Suppose you doing a transformation on a document that involves
  2921. changing only the character data. You set up a defaultHandler
  2922. and a characterDataHandler. The defaultHandler simply copies
  2923. characters through. The characterDataHandler does the
  2924. transformation and writes the characters out escaping them as
  2925. necessary. This case will fail to work if we leave out the
  2926. following two lines (because & and < inside CDATA sections will
  2927. be incorrectly escaped).
  2928. However, now we have a start/endCdataSectionHandler, so it seems
  2929. easier to let the user deal with this.
  2930. */
  2931. else if ((0) && parser->m_characterDataHandler)
  2932. parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,
  2933. 0);
  2934. /* END disabled code */
  2935. else if (parser->m_defaultHandler)
  2936. reportDefault(parser, enc, s, next);
  2937. result
  2938. = doCdataSection(parser, enc, &next, end, nextPtr, haveMore, account);
  2939. if (result != XML_ERROR_NONE)
  2940. return result;
  2941. else if (! next) {
  2942. parser->m_processor = cdataSectionProcessor;
  2943. return result;
  2944. }
  2945. } break;
  2946. case XML_TOK_TRAILING_RSQB:
  2947. if (haveMore) {
  2948. *nextPtr = s;
  2949. return XML_ERROR_NONE;
  2950. }
  2951. if (parser->m_characterDataHandler) {
  2952. if (MUST_CONVERT(enc, s)) {
  2953. ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;
  2954. XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);
  2955. parser->m_characterDataHandler(
  2956. parser->m_handlerArg, parser->m_dataBuf,
  2957. (int)(dataPtr - (ICHAR *)parser->m_dataBuf));
  2958. } else
  2959. parser->m_characterDataHandler(
  2960. parser->m_handlerArg, (const XML_Char *)s,
  2961. (int)((const XML_Char *)end - (const XML_Char *)s));
  2962. } else if (parser->m_defaultHandler)
  2963. reportDefault(parser, enc, s, end);
  2964. /* We are at the end of the final buffer, should we check for
  2965. XML_SUSPENDED, XML_FINISHED?
  2966. */
  2967. if (startTagLevel == 0) {
  2968. *eventPP = end;
  2969. return XML_ERROR_NO_ELEMENTS;
  2970. }
  2971. if (parser->m_tagLevel != startTagLevel) {
  2972. *eventPP = end;
  2973. return XML_ERROR_ASYNC_ENTITY;
  2974. }
  2975. *nextPtr = end;
  2976. return XML_ERROR_NONE;
  2977. case XML_TOK_DATA_CHARS: {
  2978. XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;
  2979. if (charDataHandler) {
  2980. if (MUST_CONVERT(enc, s)) {
  2981. for (;;) {
  2982. ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;
  2983. const enum XML_Convert_Result convert_res = XmlConvert(
  2984. enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);
  2985. *eventEndPP = s;
  2986. charDataHandler(parser->m_handlerArg, parser->m_dataBuf,
  2987. (int)(dataPtr - (ICHAR *)parser->m_dataBuf));
  2988. if ((convert_res == XML_CONVERT_COMPLETED)
  2989. || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))
  2990. break;
  2991. *eventPP = s;
  2992. }
  2993. } else
  2994. charDataHandler(parser->m_handlerArg, (const XML_Char *)s,
  2995. (int)((const XML_Char *)next - (const XML_Char *)s));
  2996. } else if (parser->m_defaultHandler)
  2997. reportDefault(parser, enc, s, next);
  2998. } break;
  2999. case XML_TOK_PI:
  3000. if (! reportProcessingInstruction(parser, enc, s, next))
  3001. return XML_ERROR_NO_MEMORY;
  3002. break;
  3003. case XML_TOK_COMMENT:
  3004. if (! reportComment(parser, enc, s, next))
  3005. return XML_ERROR_NO_MEMORY;
  3006. break;
  3007. default:
  3008. /* All of the tokens produced by XmlContentTok() have their own
  3009. * explicit cases, so this default is not strictly necessary.
  3010. * However it is a useful safety net, so we retain the code and
  3011. * simply exclude it from the coverage tests.
  3012. *
  3013. * LCOV_EXCL_START
  3014. */
  3015. if (parser->m_defaultHandler)
  3016. reportDefault(parser, enc, s, next);
  3017. break;
  3018. /* LCOV_EXCL_STOP */
  3019. }
  3020. *eventPP = s = next;
  3021. switch (parser->m_parsingStatus.parsing) {
  3022. case XML_SUSPENDED:
  3023. *nextPtr = next;
  3024. return XML_ERROR_NONE;
  3025. case XML_FINISHED:
  3026. return XML_ERROR_ABORTED;
  3027. default:;
  3028. }
  3029. }
  3030. /* not reached */
  3031. }
  3032. /* This function does not call free() on the allocated memory, merely
  3033. * moving it to the parser's m_freeBindingList where it can be freed or
  3034. * reused as appropriate.
  3035. */
  3036. static void
  3037. freeBindings(XML_Parser parser, BINDING *bindings) {
  3038. while (bindings) {
  3039. BINDING *b = bindings;
  3040. /* m_startNamespaceDeclHandler will have been called for this
  3041. * binding in addBindings(), so call the end handler now.
  3042. */
  3043. if (parser->m_endNamespaceDeclHandler)
  3044. parser->m_endNamespaceDeclHandler(parser->m_handlerArg, b->prefix->name);
  3045. bindings = bindings->nextTagBinding;
  3046. b->nextTagBinding = parser->m_freeBindingList;
  3047. parser->m_freeBindingList = b;
  3048. b->prefix->binding = b->prevPrefixBinding;
  3049. }
  3050. }
  3051. /* Precondition: all arguments must be non-NULL;
  3052. Purpose:
  3053. - normalize attributes
  3054. - check attributes for well-formedness
  3055. - generate namespace aware attribute names (URI, prefix)
  3056. - build list of attributes for startElementHandler
  3057. - default attributes
  3058. - process namespace declarations (check and report them)
  3059. - generate namespace aware element name (URI, prefix)
  3060. */
  3061. static enum XML_Error
  3062. storeAtts(XML_Parser parser, const ENCODING *enc, const char *attStr,
  3063. TAG_NAME *tagNamePtr, BINDING **bindingsPtr,
  3064. enum XML_Account account) {
  3065. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  3066. ELEMENT_TYPE *elementType;
  3067. int nDefaultAtts;
  3068. const XML_Char **appAtts; /* the attribute list for the application */
  3069. int attIndex = 0;
  3070. int prefixLen;
  3071. int i;
  3072. int n;
  3073. XML_Char *uri;
  3074. int nPrefixes = 0;
  3075. BINDING *binding;
  3076. const XML_Char *localPart;
  3077. /* lookup the element type name */
  3078. elementType
  3079. = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, tagNamePtr->str, 0);
  3080. if (! elementType) {
  3081. const XML_Char *name = poolCopyString(&dtd->pool, tagNamePtr->str);
  3082. if (! name)
  3083. return XML_ERROR_NO_MEMORY;
  3084. elementType = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,
  3085. sizeof(ELEMENT_TYPE));
  3086. if (! elementType)
  3087. return XML_ERROR_NO_MEMORY;
  3088. if (parser->m_ns && ! setElementTypePrefix(parser, elementType))
  3089. return XML_ERROR_NO_MEMORY;
  3090. }
  3091. nDefaultAtts = elementType->nDefaultAtts;
  3092. /* get the attributes from the tokenizer */
  3093. n = XmlGetAttributes(enc, attStr, parser->m_attsSize, parser->m_atts);
  3094. /* Detect and prevent integer overflow */
  3095. if (n > INT_MAX - nDefaultAtts) {
  3096. return XML_ERROR_NO_MEMORY;
  3097. }
  3098. if (n + nDefaultAtts > parser->m_attsSize) {
  3099. int oldAttsSize = parser->m_attsSize;
  3100. ATTRIBUTE *temp;
  3101. #ifdef XML_ATTR_INFO
  3102. XML_AttrInfo *temp2;
  3103. #endif
  3104. /* Detect and prevent integer overflow */
  3105. if ((nDefaultAtts > INT_MAX - INIT_ATTS_SIZE)
  3106. || (n > INT_MAX - (nDefaultAtts + INIT_ATTS_SIZE))) {
  3107. return XML_ERROR_NO_MEMORY;
  3108. }
  3109. parser->m_attsSize = n + nDefaultAtts + INIT_ATTS_SIZE;
  3110. /* Detect and prevent integer overflow.
  3111. * The preprocessor guard addresses the "always false" warning
  3112. * from -Wtype-limits on platforms where
  3113. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3114. #if UINT_MAX >= SIZE_MAX
  3115. if ((unsigned)parser->m_attsSize > (size_t)(-1) / sizeof(ATTRIBUTE)) {
  3116. parser->m_attsSize = oldAttsSize;
  3117. return XML_ERROR_NO_MEMORY;
  3118. }
  3119. #endif
  3120. temp = (ATTRIBUTE *)REALLOC(parser, (void *)parser->m_atts,
  3121. parser->m_attsSize * sizeof(ATTRIBUTE));
  3122. if (temp == NULL) {
  3123. parser->m_attsSize = oldAttsSize;
  3124. return XML_ERROR_NO_MEMORY;
  3125. }
  3126. parser->m_atts = temp;
  3127. #ifdef XML_ATTR_INFO
  3128. /* Detect and prevent integer overflow.
  3129. * The preprocessor guard addresses the "always false" warning
  3130. * from -Wtype-limits on platforms where
  3131. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3132. # if UINT_MAX >= SIZE_MAX
  3133. if ((unsigned)parser->m_attsSize > (size_t)(-1) / sizeof(XML_AttrInfo)) {
  3134. parser->m_attsSize = oldAttsSize;
  3135. return XML_ERROR_NO_MEMORY;
  3136. }
  3137. # endif
  3138. temp2 = (XML_AttrInfo *)REALLOC(parser, (void *)parser->m_attInfo,
  3139. parser->m_attsSize * sizeof(XML_AttrInfo));
  3140. if (temp2 == NULL) {
  3141. parser->m_attsSize = oldAttsSize;
  3142. return XML_ERROR_NO_MEMORY;
  3143. }
  3144. parser->m_attInfo = temp2;
  3145. #endif
  3146. if (n > oldAttsSize)
  3147. XmlGetAttributes(enc, attStr, n, parser->m_atts);
  3148. }
  3149. appAtts = (const XML_Char **)parser->m_atts;
  3150. for (i = 0; i < n; i++) {
  3151. ATTRIBUTE *currAtt = &parser->m_atts[i];
  3152. #ifdef XML_ATTR_INFO
  3153. XML_AttrInfo *currAttInfo = &parser->m_attInfo[i];
  3154. #endif
  3155. /* add the name and value to the attribute list */
  3156. ATTRIBUTE_ID *attId
  3157. = getAttributeId(parser, enc, currAtt->name,
  3158. currAtt->name + XmlNameLength(enc, currAtt->name));
  3159. if (! attId)
  3160. return XML_ERROR_NO_MEMORY;
  3161. #ifdef XML_ATTR_INFO
  3162. currAttInfo->nameStart
  3163. = parser->m_parseEndByteIndex - (parser->m_parseEndPtr - currAtt->name);
  3164. currAttInfo->nameEnd
  3165. = currAttInfo->nameStart + XmlNameLength(enc, currAtt->name);
  3166. currAttInfo->valueStart = parser->m_parseEndByteIndex
  3167. - (parser->m_parseEndPtr - currAtt->valuePtr);
  3168. currAttInfo->valueEnd = parser->m_parseEndByteIndex
  3169. - (parser->m_parseEndPtr - currAtt->valueEnd);
  3170. #endif
  3171. /* Detect duplicate attributes by their QNames. This does not work when
  3172. namespace processing is turned on and different prefixes for the same
  3173. namespace are used. For this case we have a check further down.
  3174. */
  3175. if ((attId->name)[-1]) {
  3176. if (enc == parser->m_encoding)
  3177. parser->m_eventPtr = parser->m_atts[i].name;
  3178. return XML_ERROR_DUPLICATE_ATTRIBUTE;
  3179. }
  3180. (attId->name)[-1] = 1;
  3181. appAtts[attIndex++] = attId->name;
  3182. if (! parser->m_atts[i].normalized) {
  3183. enum XML_Error result;
  3184. XML_Bool isCdata = XML_TRUE;
  3185. /* figure out whether declared as other than CDATA */
  3186. if (attId->maybeTokenized) {
  3187. int j;
  3188. for (j = 0; j < nDefaultAtts; j++) {
  3189. if (attId == elementType->defaultAtts[j].id) {
  3190. isCdata = elementType->defaultAtts[j].isCdata;
  3191. break;
  3192. }
  3193. }
  3194. }
  3195. /* normalize the attribute value */
  3196. result = storeAttributeValue(
  3197. parser, enc, isCdata, parser->m_atts[i].valuePtr,
  3198. parser->m_atts[i].valueEnd, &parser->m_tempPool, account);
  3199. if (result)
  3200. return result;
  3201. appAtts[attIndex] = poolStart(&parser->m_tempPool);
  3202. poolFinish(&parser->m_tempPool);
  3203. } else {
  3204. /* the value did not need normalizing */
  3205. appAtts[attIndex] = poolStoreString(&parser->m_tempPool, enc,
  3206. parser->m_atts[i].valuePtr,
  3207. parser->m_atts[i].valueEnd);
  3208. if (appAtts[attIndex] == 0)
  3209. return XML_ERROR_NO_MEMORY;
  3210. poolFinish(&parser->m_tempPool);
  3211. }
  3212. /* handle prefixed attribute names */
  3213. if (attId->prefix) {
  3214. if (attId->xmlns) {
  3215. /* deal with namespace declarations here */
  3216. enum XML_Error result = addBinding(parser, attId->prefix, attId,
  3217. appAtts[attIndex], bindingsPtr);
  3218. if (result)
  3219. return result;
  3220. --attIndex;
  3221. } else {
  3222. /* deal with other prefixed names later */
  3223. attIndex++;
  3224. nPrefixes++;
  3225. (attId->name)[-1] = 2;
  3226. }
  3227. } else
  3228. attIndex++;
  3229. }
  3230. /* set-up for XML_GetSpecifiedAttributeCount and XML_GetIdAttributeIndex */
  3231. parser->m_nSpecifiedAtts = attIndex;
  3232. if (elementType->idAtt && (elementType->idAtt->name)[-1]) {
  3233. for (i = 0; i < attIndex; i += 2)
  3234. if (appAtts[i] == elementType->idAtt->name) {
  3235. parser->m_idAttIndex = i;
  3236. break;
  3237. }
  3238. } else
  3239. parser->m_idAttIndex = -1;
  3240. /* do attribute defaulting */
  3241. for (i = 0; i < nDefaultAtts; i++) {
  3242. const DEFAULT_ATTRIBUTE *da = elementType->defaultAtts + i;
  3243. if (! (da->id->name)[-1] && da->value) {
  3244. if (da->id->prefix) {
  3245. if (da->id->xmlns) {
  3246. enum XML_Error result = addBinding(parser, da->id->prefix, da->id,
  3247. da->value, bindingsPtr);
  3248. if (result)
  3249. return result;
  3250. } else {
  3251. (da->id->name)[-1] = 2;
  3252. nPrefixes++;
  3253. appAtts[attIndex++] = da->id->name;
  3254. appAtts[attIndex++] = da->value;
  3255. }
  3256. } else {
  3257. (da->id->name)[-1] = 1;
  3258. appAtts[attIndex++] = da->id->name;
  3259. appAtts[attIndex++] = da->value;
  3260. }
  3261. }
  3262. }
  3263. appAtts[attIndex] = 0;
  3264. /* expand prefixed attribute names, check for duplicates,
  3265. and clear flags that say whether attributes were specified */
  3266. i = 0;
  3267. if (nPrefixes) {
  3268. int j; /* hash table index */
  3269. unsigned long version = parser->m_nsAttsVersion;
  3270. /* Detect and prevent invalid shift */
  3271. if (parser->m_nsAttsPower >= sizeof(unsigned int) * 8 /* bits per byte */) {
  3272. return XML_ERROR_NO_MEMORY;
  3273. }
  3274. unsigned int nsAttsSize = 1u << parser->m_nsAttsPower;
  3275. unsigned char oldNsAttsPower = parser->m_nsAttsPower;
  3276. /* size of hash table must be at least 2 * (# of prefixed attributes) */
  3277. if ((nPrefixes << 1)
  3278. >> parser->m_nsAttsPower) { /* true for m_nsAttsPower = 0 */
  3279. NS_ATT *temp;
  3280. /* hash table size must also be a power of 2 and >= 8 */
  3281. while (nPrefixes >> parser->m_nsAttsPower++)
  3282. ;
  3283. if (parser->m_nsAttsPower < 3)
  3284. parser->m_nsAttsPower = 3;
  3285. /* Detect and prevent invalid shift */
  3286. if (parser->m_nsAttsPower >= sizeof(nsAttsSize) * 8 /* bits per byte */) {
  3287. /* Restore actual size of memory in m_nsAtts */
  3288. parser->m_nsAttsPower = oldNsAttsPower;
  3289. return XML_ERROR_NO_MEMORY;
  3290. }
  3291. nsAttsSize = 1u << parser->m_nsAttsPower;
  3292. /* Detect and prevent integer overflow.
  3293. * The preprocessor guard addresses the "always false" warning
  3294. * from -Wtype-limits on platforms where
  3295. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3296. #if UINT_MAX >= SIZE_MAX
  3297. if (nsAttsSize > (size_t)(-1) / sizeof(NS_ATT)) {
  3298. /* Restore actual size of memory in m_nsAtts */
  3299. parser->m_nsAttsPower = oldNsAttsPower;
  3300. return XML_ERROR_NO_MEMORY;
  3301. }
  3302. #endif
  3303. temp = (NS_ATT *)REALLOC(parser, parser->m_nsAtts,
  3304. nsAttsSize * sizeof(NS_ATT));
  3305. if (! temp) {
  3306. /* Restore actual size of memory in m_nsAtts */
  3307. parser->m_nsAttsPower = oldNsAttsPower;
  3308. return XML_ERROR_NO_MEMORY;
  3309. }
  3310. parser->m_nsAtts = temp;
  3311. version = 0; /* force re-initialization of m_nsAtts hash table */
  3312. }
  3313. /* using a version flag saves us from initializing m_nsAtts every time */
  3314. if (! version) { /* initialize version flags when version wraps around */
  3315. version = INIT_ATTS_VERSION;
  3316. for (j = nsAttsSize; j != 0;)
  3317. parser->m_nsAtts[--j].version = version;
  3318. }
  3319. parser->m_nsAttsVersion = --version;
  3320. /* expand prefixed names and check for duplicates */
  3321. for (; i < attIndex; i += 2) {
  3322. const XML_Char *s = appAtts[i];
  3323. if (s[-1] == 2) { /* prefixed */
  3324. ATTRIBUTE_ID *id;
  3325. const BINDING *b;
  3326. unsigned long uriHash;
  3327. struct siphash sip_state;
  3328. struct sipkey sip_key;
  3329. copy_salt_to_sipkey(parser, &sip_key);
  3330. sip24_init(&sip_state, &sip_key);
  3331. ((XML_Char *)s)[-1] = 0; /* clear flag */
  3332. id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, s, 0);
  3333. if (! id || ! id->prefix) {
  3334. /* This code is walking through the appAtts array, dealing
  3335. * with (in this case) a prefixed attribute name. To be in
  3336. * the array, the attribute must have already been bound, so
  3337. * has to have passed through the hash table lookup once
  3338. * already. That implies that an entry for it already
  3339. * exists, so the lookup above will return a pointer to
  3340. * already allocated memory. There is no opportunaity for
  3341. * the allocator to fail, so the condition above cannot be
  3342. * fulfilled.
  3343. *
  3344. * Since it is difficult to be certain that the above
  3345. * analysis is complete, we retain the test and merely
  3346. * remove the code from coverage tests.
  3347. */
  3348. return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */
  3349. }
  3350. b = id->prefix->binding;
  3351. if (! b)
  3352. return XML_ERROR_UNBOUND_PREFIX;
  3353. for (j = 0; j < b->uriLen; j++) {
  3354. const XML_Char c = b->uri[j];
  3355. if (! poolAppendChar(&parser->m_tempPool, c))
  3356. return XML_ERROR_NO_MEMORY;
  3357. }
  3358. sip24_update(&sip_state, b->uri, b->uriLen * sizeof(XML_Char));
  3359. while (*s++ != XML_T(ASCII_COLON))
  3360. ;
  3361. sip24_update(&sip_state, s, keylen(s) * sizeof(XML_Char));
  3362. do { /* copies null terminator */
  3363. if (! poolAppendChar(&parser->m_tempPool, *s))
  3364. return XML_ERROR_NO_MEMORY;
  3365. } while (*s++);
  3366. uriHash = (unsigned long)sip24_final(&sip_state);
  3367. { /* Check hash table for duplicate of expanded name (uriName).
  3368. Derived from code in lookup(parser, HASH_TABLE *table, ...).
  3369. */
  3370. unsigned char step = 0;
  3371. unsigned long mask = nsAttsSize - 1;
  3372. j = uriHash & mask; /* index into hash table */
  3373. while (parser->m_nsAtts[j].version == version) {
  3374. /* for speed we compare stored hash values first */
  3375. if (uriHash == parser->m_nsAtts[j].hash) {
  3376. const XML_Char *s1 = poolStart(&parser->m_tempPool);
  3377. const XML_Char *s2 = parser->m_nsAtts[j].uriName;
  3378. /* s1 is null terminated, but not s2 */
  3379. for (; *s1 == *s2 && *s1 != 0; s1++, s2++)
  3380. ;
  3381. if (*s1 == 0)
  3382. return XML_ERROR_DUPLICATE_ATTRIBUTE;
  3383. }
  3384. if (! step)
  3385. step = PROBE_STEP(uriHash, mask, parser->m_nsAttsPower);
  3386. j < step ? (j += nsAttsSize - step) : (j -= step);
  3387. }
  3388. }
  3389. if (parser->m_ns_triplets) { /* append namespace separator and prefix */
  3390. parser->m_tempPool.ptr[-1] = parser->m_namespaceSeparator;
  3391. s = b->prefix->name;
  3392. do {
  3393. if (! poolAppendChar(&parser->m_tempPool, *s))
  3394. return XML_ERROR_NO_MEMORY;
  3395. } while (*s++);
  3396. }
  3397. /* store expanded name in attribute list */
  3398. s = poolStart(&parser->m_tempPool);
  3399. poolFinish(&parser->m_tempPool);
  3400. appAtts[i] = s;
  3401. /* fill empty slot with new version, uriName and hash value */
  3402. parser->m_nsAtts[j].version = version;
  3403. parser->m_nsAtts[j].hash = uriHash;
  3404. parser->m_nsAtts[j].uriName = s;
  3405. if (! --nPrefixes) {
  3406. i += 2;
  3407. break;
  3408. }
  3409. } else /* not prefixed */
  3410. ((XML_Char *)s)[-1] = 0; /* clear flag */
  3411. }
  3412. }
  3413. /* clear flags for the remaining attributes */
  3414. for (; i < attIndex; i += 2)
  3415. ((XML_Char *)(appAtts[i]))[-1] = 0;
  3416. for (binding = *bindingsPtr; binding; binding = binding->nextTagBinding)
  3417. binding->attId->name[-1] = 0;
  3418. if (! parser->m_ns)
  3419. return XML_ERROR_NONE;
  3420. /* expand the element type name */
  3421. if (elementType->prefix) {
  3422. binding = elementType->prefix->binding;
  3423. if (! binding)
  3424. return XML_ERROR_UNBOUND_PREFIX;
  3425. localPart = tagNamePtr->str;
  3426. while (*localPart++ != XML_T(ASCII_COLON))
  3427. ;
  3428. } else if (dtd->defaultPrefix.binding) {
  3429. binding = dtd->defaultPrefix.binding;
  3430. localPart = tagNamePtr->str;
  3431. } else
  3432. return XML_ERROR_NONE;
  3433. prefixLen = 0;
  3434. if (parser->m_ns_triplets && binding->prefix->name) {
  3435. for (; binding->prefix->name[prefixLen++];)
  3436. ; /* prefixLen includes null terminator */
  3437. }
  3438. tagNamePtr->localPart = localPart;
  3439. tagNamePtr->uriLen = binding->uriLen;
  3440. tagNamePtr->prefix = binding->prefix->name;
  3441. tagNamePtr->prefixLen = prefixLen;
  3442. for (i = 0; localPart[i++];)
  3443. ; /* i includes null terminator */
  3444. /* Detect and prevent integer overflow */
  3445. if (binding->uriLen > INT_MAX - prefixLen
  3446. || i > INT_MAX - (binding->uriLen + prefixLen)) {
  3447. return XML_ERROR_NO_MEMORY;
  3448. }
  3449. n = i + binding->uriLen + prefixLen;
  3450. if (n > binding->uriAlloc) {
  3451. TAG *p;
  3452. /* Detect and prevent integer overflow */
  3453. if (n > INT_MAX - EXPAND_SPARE) {
  3454. return XML_ERROR_NO_MEMORY;
  3455. }
  3456. /* Detect and prevent integer overflow.
  3457. * The preprocessor guard addresses the "always false" warning
  3458. * from -Wtype-limits on platforms where
  3459. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3460. #if UINT_MAX >= SIZE_MAX
  3461. if ((unsigned)(n + EXPAND_SPARE) > (size_t)(-1) / sizeof(XML_Char)) {
  3462. return XML_ERROR_NO_MEMORY;
  3463. }
  3464. #endif
  3465. uri = (XML_Char *)MALLOC(parser, (n + EXPAND_SPARE) * sizeof(XML_Char));
  3466. if (! uri)
  3467. return XML_ERROR_NO_MEMORY;
  3468. binding->uriAlloc = n + EXPAND_SPARE;
  3469. memcpy(uri, binding->uri, binding->uriLen * sizeof(XML_Char));
  3470. for (p = parser->m_tagStack; p; p = p->parent)
  3471. if (p->name.str == binding->uri)
  3472. p->name.str = uri;
  3473. FREE(parser, binding->uri);
  3474. binding->uri = uri;
  3475. }
  3476. /* if m_namespaceSeparator != '\0' then uri includes it already */
  3477. uri = binding->uri + binding->uriLen;
  3478. memcpy(uri, localPart, i * sizeof(XML_Char));
  3479. /* we always have a namespace separator between localPart and prefix */
  3480. if (prefixLen) {
  3481. uri += i - 1;
  3482. *uri = parser->m_namespaceSeparator; /* replace null terminator */
  3483. memcpy(uri + 1, binding->prefix->name, prefixLen * sizeof(XML_Char));
  3484. }
  3485. tagNamePtr->str = binding->uri;
  3486. return XML_ERROR_NONE;
  3487. }
  3488. static XML_Bool
  3489. is_rfc3986_uri_char(XML_Char candidate) {
  3490. // For the RFC 3986 ANBF grammar see
  3491. // https://datatracker.ietf.org/doc/html/rfc3986#appendix-A
  3492. switch (candidate) {
  3493. // From rule "ALPHA" (uppercase half)
  3494. case 'A':
  3495. case 'B':
  3496. case 'C':
  3497. case 'D':
  3498. case 'E':
  3499. case 'F':
  3500. case 'G':
  3501. case 'H':
  3502. case 'I':
  3503. case 'J':
  3504. case 'K':
  3505. case 'L':
  3506. case 'M':
  3507. case 'N':
  3508. case 'O':
  3509. case 'P':
  3510. case 'Q':
  3511. case 'R':
  3512. case 'S':
  3513. case 'T':
  3514. case 'U':
  3515. case 'V':
  3516. case 'W':
  3517. case 'X':
  3518. case 'Y':
  3519. case 'Z':
  3520. // From rule "ALPHA" (lowercase half)
  3521. case 'a':
  3522. case 'b':
  3523. case 'c':
  3524. case 'd':
  3525. case 'e':
  3526. case 'f':
  3527. case 'g':
  3528. case 'h':
  3529. case 'i':
  3530. case 'j':
  3531. case 'k':
  3532. case 'l':
  3533. case 'm':
  3534. case 'n':
  3535. case 'o':
  3536. case 'p':
  3537. case 'q':
  3538. case 'r':
  3539. case 's':
  3540. case 't':
  3541. case 'u':
  3542. case 'v':
  3543. case 'w':
  3544. case 'x':
  3545. case 'y':
  3546. case 'z':
  3547. // From rule "DIGIT"
  3548. case '0':
  3549. case '1':
  3550. case '2':
  3551. case '3':
  3552. case '4':
  3553. case '5':
  3554. case '6':
  3555. case '7':
  3556. case '8':
  3557. case '9':
  3558. // From rule "pct-encoded"
  3559. case '%':
  3560. // From rule "unreserved"
  3561. case '-':
  3562. case '.':
  3563. case '_':
  3564. case '~':
  3565. // From rule "gen-delims"
  3566. case ':':
  3567. case '/':
  3568. case '?':
  3569. case '#':
  3570. case '[':
  3571. case ']':
  3572. case '@':
  3573. // From rule "sub-delims"
  3574. case '!':
  3575. case '$':
  3576. case '&':
  3577. case '\'':
  3578. case '(':
  3579. case ')':
  3580. case '*':
  3581. case '+':
  3582. case ',':
  3583. case ';':
  3584. case '=':
  3585. return XML_TRUE;
  3586. default:
  3587. return XML_FALSE;
  3588. }
  3589. }
  3590. /* addBinding() overwrites the value of prefix->binding without checking.
  3591. Therefore one must keep track of the old value outside of addBinding().
  3592. */
  3593. static enum XML_Error
  3594. addBinding(XML_Parser parser, PREFIX *prefix, const ATTRIBUTE_ID *attId,
  3595. const XML_Char *uri, BINDING **bindingsPtr) {
  3596. // "http://www.w3.org/XML/1998/namespace"
  3597. static const XML_Char xmlNamespace[]
  3598. = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON,
  3599. ASCII_SLASH, ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w,
  3600. ASCII_PERIOD, ASCII_w, ASCII_3, ASCII_PERIOD, ASCII_o,
  3601. ASCII_r, ASCII_g, ASCII_SLASH, ASCII_X, ASCII_M,
  3602. ASCII_L, ASCII_SLASH, ASCII_1, ASCII_9, ASCII_9,
  3603. ASCII_8, ASCII_SLASH, ASCII_n, ASCII_a, ASCII_m,
  3604. ASCII_e, ASCII_s, ASCII_p, ASCII_a, ASCII_c,
  3605. ASCII_e, '\0'};
  3606. static const int xmlLen = (int)sizeof(xmlNamespace) / sizeof(XML_Char) - 1;
  3607. // "http://www.w3.org/2000/xmlns/"
  3608. static const XML_Char xmlnsNamespace[]
  3609. = {ASCII_h, ASCII_t, ASCII_t, ASCII_p, ASCII_COLON, ASCII_SLASH,
  3610. ASCII_SLASH, ASCII_w, ASCII_w, ASCII_w, ASCII_PERIOD, ASCII_w,
  3611. ASCII_3, ASCII_PERIOD, ASCII_o, ASCII_r, ASCII_g, ASCII_SLASH,
  3612. ASCII_2, ASCII_0, ASCII_0, ASCII_0, ASCII_SLASH, ASCII_x,
  3613. ASCII_m, ASCII_l, ASCII_n, ASCII_s, ASCII_SLASH, '\0'};
  3614. static const int xmlnsLen
  3615. = (int)sizeof(xmlnsNamespace) / sizeof(XML_Char) - 1;
  3616. XML_Bool mustBeXML = XML_FALSE;
  3617. XML_Bool isXML = XML_TRUE;
  3618. XML_Bool isXMLNS = XML_TRUE;
  3619. BINDING *b;
  3620. int len;
  3621. /* empty URI is only valid for default namespace per XML NS 1.0 (not 1.1) */
  3622. if (*uri == XML_T('\0') && prefix->name)
  3623. return XML_ERROR_UNDECLARING_PREFIX;
  3624. if (prefix->name && prefix->name[0] == XML_T(ASCII_x)
  3625. && prefix->name[1] == XML_T(ASCII_m)
  3626. && prefix->name[2] == XML_T(ASCII_l)) {
  3627. /* Not allowed to bind xmlns */
  3628. if (prefix->name[3] == XML_T(ASCII_n) && prefix->name[4] == XML_T(ASCII_s)
  3629. && prefix->name[5] == XML_T('\0'))
  3630. return XML_ERROR_RESERVED_PREFIX_XMLNS;
  3631. if (prefix->name[3] == XML_T('\0'))
  3632. mustBeXML = XML_TRUE;
  3633. }
  3634. for (len = 0; uri[len]; len++) {
  3635. if (isXML && (len > xmlLen || uri[len] != xmlNamespace[len]))
  3636. isXML = XML_FALSE;
  3637. if (! mustBeXML && isXMLNS
  3638. && (len > xmlnsLen || uri[len] != xmlnsNamespace[len]))
  3639. isXMLNS = XML_FALSE;
  3640. // NOTE: While Expat does not validate namespace URIs against RFC 3986
  3641. // today (and is not REQUIRED to do so with regard to the XML 1.0
  3642. // namespaces specification) we have to at least make sure, that
  3643. // the application on top of Expat (that is likely splitting expanded
  3644. // element names ("qualified names") of form
  3645. // "[uri sep] local [sep prefix] '\0'" back into 1, 2 or 3 pieces
  3646. // in its element handler code) cannot be confused by an attacker
  3647. // putting additional namespace separator characters into namespace
  3648. // declarations. That would be ambiguous and not to be expected.
  3649. //
  3650. // While the HTML API docs of function XML_ParserCreateNS have been
  3651. // advising against use of a namespace separator character that can
  3652. // appear in a URI for >20 years now, some widespread applications
  3653. // are using URI characters (':' (colon) in particular) for a
  3654. // namespace separator, in practice. To keep these applications
  3655. // functional, we only reject namespaces URIs containing the
  3656. // application-chosen namespace separator if the chosen separator
  3657. // is a non-URI character with regard to RFC 3986.
  3658. if (parser->m_ns && (uri[len] == parser->m_namespaceSeparator)
  3659. && ! is_rfc3986_uri_char(uri[len])) {
  3660. return XML_ERROR_SYNTAX;
  3661. }
  3662. }
  3663. isXML = isXML && len == xmlLen;
  3664. isXMLNS = isXMLNS && len == xmlnsLen;
  3665. if (mustBeXML != isXML)
  3666. return mustBeXML ? XML_ERROR_RESERVED_PREFIX_XML
  3667. : XML_ERROR_RESERVED_NAMESPACE_URI;
  3668. if (isXMLNS)
  3669. return XML_ERROR_RESERVED_NAMESPACE_URI;
  3670. if (parser->m_namespaceSeparator)
  3671. len++;
  3672. if (parser->m_freeBindingList) {
  3673. b = parser->m_freeBindingList;
  3674. if (len > b->uriAlloc) {
  3675. /* Detect and prevent integer overflow */
  3676. if (len > INT_MAX - EXPAND_SPARE) {
  3677. return XML_ERROR_NO_MEMORY;
  3678. }
  3679. /* Detect and prevent integer overflow.
  3680. * The preprocessor guard addresses the "always false" warning
  3681. * from -Wtype-limits on platforms where
  3682. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3683. #if UINT_MAX >= SIZE_MAX
  3684. if ((unsigned)(len + EXPAND_SPARE) > (size_t)(-1) / sizeof(XML_Char)) {
  3685. return XML_ERROR_NO_MEMORY;
  3686. }
  3687. #endif
  3688. XML_Char *temp = (XML_Char *)REALLOC(
  3689. parser, b->uri, sizeof(XML_Char) * (len + EXPAND_SPARE));
  3690. if (temp == NULL)
  3691. return XML_ERROR_NO_MEMORY;
  3692. b->uri = temp;
  3693. b->uriAlloc = len + EXPAND_SPARE;
  3694. }
  3695. parser->m_freeBindingList = b->nextTagBinding;
  3696. } else {
  3697. b = (BINDING *)MALLOC(parser, sizeof(BINDING));
  3698. if (! b)
  3699. return XML_ERROR_NO_MEMORY;
  3700. /* Detect and prevent integer overflow */
  3701. if (len > INT_MAX - EXPAND_SPARE) {
  3702. return XML_ERROR_NO_MEMORY;
  3703. }
  3704. /* Detect and prevent integer overflow.
  3705. * The preprocessor guard addresses the "always false" warning
  3706. * from -Wtype-limits on platforms where
  3707. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  3708. #if UINT_MAX >= SIZE_MAX
  3709. if ((unsigned)(len + EXPAND_SPARE) > (size_t)(-1) / sizeof(XML_Char)) {
  3710. return XML_ERROR_NO_MEMORY;
  3711. }
  3712. #endif
  3713. b->uri
  3714. = (XML_Char *)MALLOC(parser, sizeof(XML_Char) * (len + EXPAND_SPARE));
  3715. if (! b->uri) {
  3716. FREE(parser, b);
  3717. return XML_ERROR_NO_MEMORY;
  3718. }
  3719. b->uriAlloc = len + EXPAND_SPARE;
  3720. }
  3721. b->uriLen = len;
  3722. memcpy(b->uri, uri, len * sizeof(XML_Char));
  3723. if (parser->m_namespaceSeparator)
  3724. b->uri[len - 1] = parser->m_namespaceSeparator;
  3725. b->prefix = prefix;
  3726. b->attId = attId;
  3727. b->prevPrefixBinding = prefix->binding;
  3728. /* NULL binding when default namespace undeclared */
  3729. if (*uri == XML_T('\0') && prefix == &parser->m_dtd->defaultPrefix)
  3730. prefix->binding = NULL;
  3731. else
  3732. prefix->binding = b;
  3733. b->nextTagBinding = *bindingsPtr;
  3734. *bindingsPtr = b;
  3735. /* if attId == NULL then we are not starting a namespace scope */
  3736. if (attId && parser->m_startNamespaceDeclHandler)
  3737. parser->m_startNamespaceDeclHandler(parser->m_handlerArg, prefix->name,
  3738. prefix->binding ? uri : 0);
  3739. return XML_ERROR_NONE;
  3740. }
  3741. /* The idea here is to avoid using stack for each CDATA section when
  3742. the whole file is parsed with one call.
  3743. */
  3744. static enum XML_Error PTRCALL
  3745. cdataSectionProcessor(XML_Parser parser, const char *start, const char *end,
  3746. const char **endPtr) {
  3747. enum XML_Error result = doCdataSection(
  3748. parser, parser->m_encoding, &start, end, endPtr,
  3749. (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_ACCOUNT_DIRECT);
  3750. if (result != XML_ERROR_NONE)
  3751. return result;
  3752. if (start) {
  3753. if (parser->m_parentParser) { /* we are parsing an external entity */
  3754. parser->m_processor = externalEntityContentProcessor;
  3755. return externalEntityContentProcessor(parser, start, end, endPtr);
  3756. } else {
  3757. parser->m_processor = contentProcessor;
  3758. return contentProcessor(parser, start, end, endPtr);
  3759. }
  3760. }
  3761. return result;
  3762. }
  3763. /* startPtr gets set to non-null if the section is closed, and to null if
  3764. the section is not yet closed.
  3765. */
  3766. static enum XML_Error
  3767. doCdataSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,
  3768. const char *end, const char **nextPtr, XML_Bool haveMore,
  3769. enum XML_Account account) {
  3770. const char *s = *startPtr;
  3771. const char **eventPP;
  3772. const char **eventEndPP;
  3773. if (enc == parser->m_encoding) {
  3774. eventPP = &parser->m_eventPtr;
  3775. *eventPP = s;
  3776. eventEndPP = &parser->m_eventEndPtr;
  3777. } else {
  3778. eventPP = &(parser->m_openInternalEntities->internalEventPtr);
  3779. eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);
  3780. }
  3781. *eventPP = s;
  3782. *startPtr = NULL;
  3783. for (;;) {
  3784. const char *next = s; /* in case of XML_TOK_NONE or XML_TOK_PARTIAL */
  3785. int tok = XmlCdataSectionTok(enc, s, end, &next);
  3786. #if XML_GE == 1
  3787. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__, account)) {
  3788. accountingOnAbort(parser);
  3789. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  3790. }
  3791. #else
  3792. UNUSED_P(account);
  3793. #endif
  3794. *eventEndPP = next;
  3795. switch (tok) {
  3796. case XML_TOK_CDATA_SECT_CLOSE:
  3797. if (parser->m_endCdataSectionHandler)
  3798. parser->m_endCdataSectionHandler(parser->m_handlerArg);
  3799. /* BEGIN disabled code */
  3800. /* see comment under XML_TOK_CDATA_SECT_OPEN */
  3801. else if ((0) && parser->m_characterDataHandler)
  3802. parser->m_characterDataHandler(parser->m_handlerArg, parser->m_dataBuf,
  3803. 0);
  3804. /* END disabled code */
  3805. else if (parser->m_defaultHandler)
  3806. reportDefault(parser, enc, s, next);
  3807. *startPtr = next;
  3808. *nextPtr = next;
  3809. if (parser->m_parsingStatus.parsing == XML_FINISHED)
  3810. return XML_ERROR_ABORTED;
  3811. else
  3812. return XML_ERROR_NONE;
  3813. case XML_TOK_DATA_NEWLINE:
  3814. if (parser->m_characterDataHandler) {
  3815. XML_Char c = 0xA;
  3816. parser->m_characterDataHandler(parser->m_handlerArg, &c, 1);
  3817. } else if (parser->m_defaultHandler)
  3818. reportDefault(parser, enc, s, next);
  3819. break;
  3820. case XML_TOK_DATA_CHARS: {
  3821. XML_CharacterDataHandler charDataHandler = parser->m_characterDataHandler;
  3822. if (charDataHandler) {
  3823. if (MUST_CONVERT(enc, s)) {
  3824. for (;;) {
  3825. ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;
  3826. const enum XML_Convert_Result convert_res = XmlConvert(
  3827. enc, &s, next, &dataPtr, (ICHAR *)parser->m_dataBufEnd);
  3828. *eventEndPP = next;
  3829. charDataHandler(parser->m_handlerArg, parser->m_dataBuf,
  3830. (int)(dataPtr - (ICHAR *)parser->m_dataBuf));
  3831. if ((convert_res == XML_CONVERT_COMPLETED)
  3832. || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))
  3833. break;
  3834. *eventPP = s;
  3835. }
  3836. } else
  3837. charDataHandler(parser->m_handlerArg, (const XML_Char *)s,
  3838. (int)((const XML_Char *)next - (const XML_Char *)s));
  3839. } else if (parser->m_defaultHandler)
  3840. reportDefault(parser, enc, s, next);
  3841. } break;
  3842. case XML_TOK_INVALID:
  3843. *eventPP = next;
  3844. return XML_ERROR_INVALID_TOKEN;
  3845. case XML_TOK_PARTIAL_CHAR:
  3846. if (haveMore) {
  3847. *nextPtr = s;
  3848. return XML_ERROR_NONE;
  3849. }
  3850. return XML_ERROR_PARTIAL_CHAR;
  3851. case XML_TOK_PARTIAL:
  3852. case XML_TOK_NONE:
  3853. if (haveMore) {
  3854. *nextPtr = s;
  3855. return XML_ERROR_NONE;
  3856. }
  3857. return XML_ERROR_UNCLOSED_CDATA_SECTION;
  3858. default:
  3859. /* Every token returned by XmlCdataSectionTok() has its own
  3860. * explicit case, so this default case will never be executed.
  3861. * We retain it as a safety net and exclude it from the coverage
  3862. * statistics.
  3863. *
  3864. * LCOV_EXCL_START
  3865. */
  3866. *eventPP = next;
  3867. return XML_ERROR_UNEXPECTED_STATE;
  3868. /* LCOV_EXCL_STOP */
  3869. }
  3870. *eventPP = s = next;
  3871. switch (parser->m_parsingStatus.parsing) {
  3872. case XML_SUSPENDED:
  3873. *nextPtr = next;
  3874. return XML_ERROR_NONE;
  3875. case XML_FINISHED:
  3876. return XML_ERROR_ABORTED;
  3877. default:;
  3878. }
  3879. }
  3880. /* not reached */
  3881. }
  3882. #ifdef XML_DTD
  3883. /* The idea here is to avoid using stack for each IGNORE section when
  3884. the whole file is parsed with one call.
  3885. */
  3886. static enum XML_Error PTRCALL
  3887. ignoreSectionProcessor(XML_Parser parser, const char *start, const char *end,
  3888. const char **endPtr) {
  3889. enum XML_Error result
  3890. = doIgnoreSection(parser, parser->m_encoding, &start, end, endPtr,
  3891. (XML_Bool)! parser->m_parsingStatus.finalBuffer);
  3892. if (result != XML_ERROR_NONE)
  3893. return result;
  3894. if (start) {
  3895. parser->m_processor = prologProcessor;
  3896. return prologProcessor(parser, start, end, endPtr);
  3897. }
  3898. return result;
  3899. }
  3900. /* startPtr gets set to non-null is the section is closed, and to null
  3901. if the section is not yet closed.
  3902. */
  3903. static enum XML_Error
  3904. doIgnoreSection(XML_Parser parser, const ENCODING *enc, const char **startPtr,
  3905. const char *end, const char **nextPtr, XML_Bool haveMore) {
  3906. const char *next = *startPtr; /* in case of XML_TOK_NONE or XML_TOK_PARTIAL */
  3907. int tok;
  3908. const char *s = *startPtr;
  3909. const char **eventPP;
  3910. const char **eventEndPP;
  3911. if (enc == parser->m_encoding) {
  3912. eventPP = &parser->m_eventPtr;
  3913. *eventPP = s;
  3914. eventEndPP = &parser->m_eventEndPtr;
  3915. } else {
  3916. /* It's not entirely clear, but it seems the following two lines
  3917. * of code cannot be executed. The only occasions on which 'enc'
  3918. * is not 'encoding' are when this function is called
  3919. * from the internal entity processing, and IGNORE sections are an
  3920. * error in internal entities.
  3921. *
  3922. * Since it really isn't clear that this is true, we keep the code
  3923. * and just remove it from our coverage tests.
  3924. *
  3925. * LCOV_EXCL_START
  3926. */
  3927. eventPP = &(parser->m_openInternalEntities->internalEventPtr);
  3928. eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);
  3929. /* LCOV_EXCL_STOP */
  3930. }
  3931. *eventPP = s;
  3932. *startPtr = NULL;
  3933. tok = XmlIgnoreSectionTok(enc, s, end, &next);
  3934. # if XML_GE == 1
  3935. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__,
  3936. XML_ACCOUNT_DIRECT)) {
  3937. accountingOnAbort(parser);
  3938. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  3939. }
  3940. # endif
  3941. *eventEndPP = next;
  3942. switch (tok) {
  3943. case XML_TOK_IGNORE_SECT:
  3944. if (parser->m_defaultHandler)
  3945. reportDefault(parser, enc, s, next);
  3946. *startPtr = next;
  3947. *nextPtr = next;
  3948. if (parser->m_parsingStatus.parsing == XML_FINISHED)
  3949. return XML_ERROR_ABORTED;
  3950. else
  3951. return XML_ERROR_NONE;
  3952. case XML_TOK_INVALID:
  3953. *eventPP = next;
  3954. return XML_ERROR_INVALID_TOKEN;
  3955. case XML_TOK_PARTIAL_CHAR:
  3956. if (haveMore) {
  3957. *nextPtr = s;
  3958. return XML_ERROR_NONE;
  3959. }
  3960. return XML_ERROR_PARTIAL_CHAR;
  3961. case XML_TOK_PARTIAL:
  3962. case XML_TOK_NONE:
  3963. if (haveMore) {
  3964. *nextPtr = s;
  3965. return XML_ERROR_NONE;
  3966. }
  3967. return XML_ERROR_SYNTAX; /* XML_ERROR_UNCLOSED_IGNORE_SECTION */
  3968. default:
  3969. /* All of the tokens that XmlIgnoreSectionTok() returns have
  3970. * explicit cases to handle them, so this default case is never
  3971. * executed. We keep it as a safety net anyway, and remove it
  3972. * from our test coverage statistics.
  3973. *
  3974. * LCOV_EXCL_START
  3975. */
  3976. *eventPP = next;
  3977. return XML_ERROR_UNEXPECTED_STATE;
  3978. /* LCOV_EXCL_STOP */
  3979. }
  3980. /* not reached */
  3981. }
  3982. #endif /* XML_DTD */
  3983. static enum XML_Error
  3984. initializeEncoding(XML_Parser parser) {
  3985. const char *s;
  3986. #ifdef XML_UNICODE
  3987. char encodingBuf[128];
  3988. /* See comments about `protocolEncodingName` in parserInit() */
  3989. if (! parser->m_protocolEncodingName)
  3990. s = NULL;
  3991. else {
  3992. int i;
  3993. for (i = 0; parser->m_protocolEncodingName[i]; i++) {
  3994. if (i == sizeof(encodingBuf) - 1
  3995. || (parser->m_protocolEncodingName[i] & ~0x7f) != 0) {
  3996. encodingBuf[0] = '\0';
  3997. break;
  3998. }
  3999. encodingBuf[i] = (char)parser->m_protocolEncodingName[i];
  4000. }
  4001. encodingBuf[i] = '\0';
  4002. s = encodingBuf;
  4003. }
  4004. #else
  4005. s = parser->m_protocolEncodingName;
  4006. #endif
  4007. if ((parser->m_ns ? XmlInitEncodingNS : XmlInitEncoding)(
  4008. &parser->m_initEncoding, &parser->m_encoding, s))
  4009. return XML_ERROR_NONE;
  4010. return handleUnknownEncoding(parser, parser->m_protocolEncodingName);
  4011. }
  4012. static enum XML_Error
  4013. processXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s,
  4014. const char *next) {
  4015. const char *encodingName = NULL;
  4016. const XML_Char *storedEncName = NULL;
  4017. const ENCODING *newEncoding = NULL;
  4018. const char *version = NULL;
  4019. const char *versionend = NULL;
  4020. const XML_Char *storedversion = NULL;
  4021. int standalone = -1;
  4022. #if XML_GE == 1
  4023. if (! accountingDiffTolerated(parser, XML_TOK_XML_DECL, s, next, __LINE__,
  4024. XML_ACCOUNT_DIRECT)) {
  4025. accountingOnAbort(parser);
  4026. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  4027. }
  4028. #endif
  4029. if (! (parser->m_ns ? XmlParseXmlDeclNS : XmlParseXmlDecl)(
  4030. isGeneralTextEntity, parser->m_encoding, s, next, &parser->m_eventPtr,
  4031. &version, &versionend, &encodingName, &newEncoding, &standalone)) {
  4032. if (isGeneralTextEntity)
  4033. return XML_ERROR_TEXT_DECL;
  4034. else
  4035. return XML_ERROR_XML_DECL;
  4036. }
  4037. if (! isGeneralTextEntity && standalone == 1) {
  4038. parser->m_dtd->standalone = XML_TRUE;
  4039. #ifdef XML_DTD
  4040. if (parser->m_paramEntityParsing
  4041. == XML_PARAM_ENTITY_PARSING_UNLESS_STANDALONE)
  4042. parser->m_paramEntityParsing = XML_PARAM_ENTITY_PARSING_NEVER;
  4043. #endif /* XML_DTD */
  4044. }
  4045. if (parser->m_xmlDeclHandler) {
  4046. if (encodingName != NULL) {
  4047. storedEncName = poolStoreString(
  4048. &parser->m_temp2Pool, parser->m_encoding, encodingName,
  4049. encodingName + XmlNameLength(parser->m_encoding, encodingName));
  4050. if (! storedEncName)
  4051. return XML_ERROR_NO_MEMORY;
  4052. poolFinish(&parser->m_temp2Pool);
  4053. }
  4054. if (version) {
  4055. storedversion
  4056. = poolStoreString(&parser->m_temp2Pool, parser->m_encoding, version,
  4057. versionend - parser->m_encoding->minBytesPerChar);
  4058. if (! storedversion)
  4059. return XML_ERROR_NO_MEMORY;
  4060. }
  4061. parser->m_xmlDeclHandler(parser->m_handlerArg, storedversion, storedEncName,
  4062. standalone);
  4063. } else if (parser->m_defaultHandler)
  4064. reportDefault(parser, parser->m_encoding, s, next);
  4065. if (parser->m_protocolEncodingName == NULL) {
  4066. if (newEncoding) {
  4067. /* Check that the specified encoding does not conflict with what
  4068. * the parser has already deduced. Do we have the same number
  4069. * of bytes in the smallest representation of a character? If
  4070. * this is UTF-16, is it the same endianness?
  4071. */
  4072. if (newEncoding->minBytesPerChar != parser->m_encoding->minBytesPerChar
  4073. || (newEncoding->minBytesPerChar == 2
  4074. && newEncoding != parser->m_encoding)) {
  4075. parser->m_eventPtr = encodingName;
  4076. return XML_ERROR_INCORRECT_ENCODING;
  4077. }
  4078. parser->m_encoding = newEncoding;
  4079. } else if (encodingName) {
  4080. enum XML_Error result;
  4081. if (! storedEncName) {
  4082. storedEncName = poolStoreString(
  4083. &parser->m_temp2Pool, parser->m_encoding, encodingName,
  4084. encodingName + XmlNameLength(parser->m_encoding, encodingName));
  4085. if (! storedEncName)
  4086. return XML_ERROR_NO_MEMORY;
  4087. }
  4088. result = handleUnknownEncoding(parser, storedEncName);
  4089. poolClear(&parser->m_temp2Pool);
  4090. if (result == XML_ERROR_UNKNOWN_ENCODING)
  4091. parser->m_eventPtr = encodingName;
  4092. return result;
  4093. }
  4094. }
  4095. if (storedEncName || storedversion)
  4096. poolClear(&parser->m_temp2Pool);
  4097. return XML_ERROR_NONE;
  4098. }
  4099. static enum XML_Error
  4100. handleUnknownEncoding(XML_Parser parser, const XML_Char *encodingName) {
  4101. if (parser->m_unknownEncodingHandler) {
  4102. XML_Encoding info;
  4103. int i;
  4104. for (i = 0; i < 256; i++)
  4105. info.map[i] = -1;
  4106. info.convert = NULL;
  4107. info.data = NULL;
  4108. info.release = NULL;
  4109. if (parser->m_unknownEncodingHandler(parser->m_unknownEncodingHandlerData,
  4110. encodingName, &info)) {
  4111. ENCODING *enc;
  4112. parser->m_unknownEncodingMem = MALLOC(parser, XmlSizeOfUnknownEncoding());
  4113. if (! parser->m_unknownEncodingMem) {
  4114. if (info.release)
  4115. info.release(info.data);
  4116. return XML_ERROR_NO_MEMORY;
  4117. }
  4118. enc = (parser->m_ns ? XmlInitUnknownEncodingNS : XmlInitUnknownEncoding)(
  4119. parser->m_unknownEncodingMem, info.map, info.convert, info.data);
  4120. if (enc) {
  4121. parser->m_unknownEncodingData = info.data;
  4122. parser->m_unknownEncodingRelease = info.release;
  4123. parser->m_encoding = enc;
  4124. return XML_ERROR_NONE;
  4125. }
  4126. }
  4127. if (info.release != NULL)
  4128. info.release(info.data);
  4129. }
  4130. return XML_ERROR_UNKNOWN_ENCODING;
  4131. }
  4132. static enum XML_Error PTRCALL
  4133. prologInitProcessor(XML_Parser parser, const char *s, const char *end,
  4134. const char **nextPtr) {
  4135. enum XML_Error result = initializeEncoding(parser);
  4136. if (result != XML_ERROR_NONE)
  4137. return result;
  4138. parser->m_processor = prologProcessor;
  4139. return prologProcessor(parser, s, end, nextPtr);
  4140. }
  4141. #ifdef XML_DTD
  4142. static enum XML_Error PTRCALL
  4143. externalParEntInitProcessor(XML_Parser parser, const char *s, const char *end,
  4144. const char **nextPtr) {
  4145. enum XML_Error result = initializeEncoding(parser);
  4146. if (result != XML_ERROR_NONE)
  4147. return result;
  4148. /* we know now that XML_Parse(Buffer) has been called,
  4149. so we consider the external parameter entity read */
  4150. parser->m_dtd->paramEntityRead = XML_TRUE;
  4151. if (parser->m_prologState.inEntityValue) {
  4152. parser->m_processor = entityValueInitProcessor;
  4153. return entityValueInitProcessor(parser, s, end, nextPtr);
  4154. } else {
  4155. parser->m_processor = externalParEntProcessor;
  4156. return externalParEntProcessor(parser, s, end, nextPtr);
  4157. }
  4158. }
  4159. static enum XML_Error PTRCALL
  4160. entityValueInitProcessor(XML_Parser parser, const char *s, const char *end,
  4161. const char **nextPtr) {
  4162. int tok;
  4163. const char *start = s;
  4164. const char *next = start;
  4165. parser->m_eventPtr = start;
  4166. for (;;) {
  4167. tok = XmlPrologTok(parser->m_encoding, start, end, &next);
  4168. /* Note: Except for XML_TOK_BOM below, these bytes are accounted later in:
  4169. - storeEntityValue
  4170. - processXmlDecl
  4171. */
  4172. parser->m_eventEndPtr = next;
  4173. if (tok <= 0) {
  4174. if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {
  4175. *nextPtr = s;
  4176. return XML_ERROR_NONE;
  4177. }
  4178. switch (tok) {
  4179. case XML_TOK_INVALID:
  4180. return XML_ERROR_INVALID_TOKEN;
  4181. case XML_TOK_PARTIAL:
  4182. return XML_ERROR_UNCLOSED_TOKEN;
  4183. case XML_TOK_PARTIAL_CHAR:
  4184. return XML_ERROR_PARTIAL_CHAR;
  4185. case XML_TOK_NONE: /* start == end */
  4186. default:
  4187. break;
  4188. }
  4189. /* found end of entity value - can store it now */
  4190. return storeEntityValue(parser, parser->m_encoding, s, end,
  4191. XML_ACCOUNT_DIRECT);
  4192. } else if (tok == XML_TOK_XML_DECL) {
  4193. enum XML_Error result;
  4194. result = processXmlDecl(parser, 0, start, next);
  4195. if (result != XML_ERROR_NONE)
  4196. return result;
  4197. /* At this point, m_parsingStatus.parsing cannot be XML_SUSPENDED. For
  4198. * that to happen, a parameter entity parsing handler must have attempted
  4199. * to suspend the parser, which fails and raises an error. The parser can
  4200. * be aborted, but can't be suspended.
  4201. */
  4202. if (parser->m_parsingStatus.parsing == XML_FINISHED)
  4203. return XML_ERROR_ABORTED;
  4204. *nextPtr = next;
  4205. /* stop scanning for text declaration - we found one */
  4206. parser->m_processor = entityValueProcessor;
  4207. return entityValueProcessor(parser, next, end, nextPtr);
  4208. }
  4209. /* XmlPrologTok has now set the encoding based on the BOM it found, and we
  4210. must move s and nextPtr forward to consume the BOM.
  4211. If we didn't, and got XML_TOK_NONE from the next XmlPrologTok call, we
  4212. would leave the BOM in the buffer and return. On the next call to this
  4213. function, our XmlPrologTok call would return XML_TOK_INVALID, since it
  4214. is not valid to have multiple BOMs.
  4215. */
  4216. else if (tok == XML_TOK_BOM) {
  4217. # if XML_GE == 1
  4218. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__,
  4219. XML_ACCOUNT_DIRECT)) {
  4220. accountingOnAbort(parser);
  4221. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  4222. }
  4223. # endif
  4224. *nextPtr = next;
  4225. s = next;
  4226. }
  4227. /* If we get this token, we have the start of what might be a
  4228. normal tag, but not a declaration (i.e. it doesn't begin with
  4229. "<!"). In a DTD context, that isn't legal.
  4230. */
  4231. else if (tok == XML_TOK_INSTANCE_START) {
  4232. *nextPtr = next;
  4233. return XML_ERROR_SYNTAX;
  4234. }
  4235. start = next;
  4236. parser->m_eventPtr = start;
  4237. }
  4238. }
  4239. static enum XML_Error PTRCALL
  4240. externalParEntProcessor(XML_Parser parser, const char *s, const char *end,
  4241. const char **nextPtr) {
  4242. const char *next = s;
  4243. int tok;
  4244. tok = XmlPrologTok(parser->m_encoding, s, end, &next);
  4245. if (tok <= 0) {
  4246. if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {
  4247. *nextPtr = s;
  4248. return XML_ERROR_NONE;
  4249. }
  4250. switch (tok) {
  4251. case XML_TOK_INVALID:
  4252. return XML_ERROR_INVALID_TOKEN;
  4253. case XML_TOK_PARTIAL:
  4254. return XML_ERROR_UNCLOSED_TOKEN;
  4255. case XML_TOK_PARTIAL_CHAR:
  4256. return XML_ERROR_PARTIAL_CHAR;
  4257. case XML_TOK_NONE: /* start == end */
  4258. default:
  4259. break;
  4260. }
  4261. }
  4262. /* This would cause the next stage, i.e. doProlog to be passed XML_TOK_BOM.
  4263. However, when parsing an external subset, doProlog will not accept a BOM
  4264. as valid, and report a syntax error, so we have to skip the BOM, and
  4265. account for the BOM bytes.
  4266. */
  4267. else if (tok == XML_TOK_BOM) {
  4268. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__,
  4269. XML_ACCOUNT_DIRECT)) {
  4270. accountingOnAbort(parser);
  4271. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  4272. }
  4273. s = next;
  4274. tok = XmlPrologTok(parser->m_encoding, s, end, &next);
  4275. }
  4276. parser->m_processor = prologProcessor;
  4277. return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,
  4278. (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE,
  4279. XML_ACCOUNT_DIRECT);
  4280. }
  4281. static enum XML_Error PTRCALL
  4282. entityValueProcessor(XML_Parser parser, const char *s, const char *end,
  4283. const char **nextPtr) {
  4284. const char *start = s;
  4285. const char *next = s;
  4286. const ENCODING *enc = parser->m_encoding;
  4287. int tok;
  4288. for (;;) {
  4289. tok = XmlPrologTok(enc, start, end, &next);
  4290. /* Note: These bytes are accounted later in:
  4291. - storeEntityValue
  4292. */
  4293. if (tok <= 0) {
  4294. if (! parser->m_parsingStatus.finalBuffer && tok != XML_TOK_INVALID) {
  4295. *nextPtr = s;
  4296. return XML_ERROR_NONE;
  4297. }
  4298. switch (tok) {
  4299. case XML_TOK_INVALID:
  4300. return XML_ERROR_INVALID_TOKEN;
  4301. case XML_TOK_PARTIAL:
  4302. return XML_ERROR_UNCLOSED_TOKEN;
  4303. case XML_TOK_PARTIAL_CHAR:
  4304. return XML_ERROR_PARTIAL_CHAR;
  4305. case XML_TOK_NONE: /* start == end */
  4306. default:
  4307. break;
  4308. }
  4309. /* found end of entity value - can store it now */
  4310. return storeEntityValue(parser, enc, s, end, XML_ACCOUNT_DIRECT);
  4311. }
  4312. start = next;
  4313. }
  4314. }
  4315. #endif /* XML_DTD */
  4316. static enum XML_Error PTRCALL
  4317. prologProcessor(XML_Parser parser, const char *s, const char *end,
  4318. const char **nextPtr) {
  4319. const char *next = s;
  4320. int tok = XmlPrologTok(parser->m_encoding, s, end, &next);
  4321. return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,
  4322. (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE,
  4323. XML_ACCOUNT_DIRECT);
  4324. }
  4325. static enum XML_Error
  4326. doProlog(XML_Parser parser, const ENCODING *enc, const char *s, const char *end,
  4327. int tok, const char *next, const char **nextPtr, XML_Bool haveMore,
  4328. XML_Bool allowClosingDoctype, enum XML_Account account) {
  4329. #ifdef XML_DTD
  4330. static const XML_Char externalSubsetName[] = {ASCII_HASH, '\0'};
  4331. #endif /* XML_DTD */
  4332. static const XML_Char atypeCDATA[]
  4333. = {ASCII_C, ASCII_D, ASCII_A, ASCII_T, ASCII_A, '\0'};
  4334. static const XML_Char atypeID[] = {ASCII_I, ASCII_D, '\0'};
  4335. static const XML_Char atypeIDREF[]
  4336. = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, '\0'};
  4337. static const XML_Char atypeIDREFS[]
  4338. = {ASCII_I, ASCII_D, ASCII_R, ASCII_E, ASCII_F, ASCII_S, '\0'};
  4339. static const XML_Char atypeENTITY[]
  4340. = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T, ASCII_Y, '\0'};
  4341. static const XML_Char atypeENTITIES[]
  4342. = {ASCII_E, ASCII_N, ASCII_T, ASCII_I, ASCII_T,
  4343. ASCII_I, ASCII_E, ASCII_S, '\0'};
  4344. static const XML_Char atypeNMTOKEN[]
  4345. = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K, ASCII_E, ASCII_N, '\0'};
  4346. static const XML_Char atypeNMTOKENS[]
  4347. = {ASCII_N, ASCII_M, ASCII_T, ASCII_O, ASCII_K,
  4348. ASCII_E, ASCII_N, ASCII_S, '\0'};
  4349. static const XML_Char notationPrefix[]
  4350. = {ASCII_N, ASCII_O, ASCII_T, ASCII_A, ASCII_T,
  4351. ASCII_I, ASCII_O, ASCII_N, ASCII_LPAREN, '\0'};
  4352. static const XML_Char enumValueSep[] = {ASCII_PIPE, '\0'};
  4353. static const XML_Char enumValueStart[] = {ASCII_LPAREN, '\0'};
  4354. #ifndef XML_DTD
  4355. UNUSED_P(account);
  4356. #endif
  4357. /* save one level of indirection */
  4358. DTD *const dtd = parser->m_dtd;
  4359. const char **eventPP;
  4360. const char **eventEndPP;
  4361. enum XML_Content_Quant quant;
  4362. if (enc == parser->m_encoding) {
  4363. eventPP = &parser->m_eventPtr;
  4364. eventEndPP = &parser->m_eventEndPtr;
  4365. } else {
  4366. eventPP = &(parser->m_openInternalEntities->internalEventPtr);
  4367. eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);
  4368. }
  4369. for (;;) {
  4370. int role;
  4371. XML_Bool handleDefault = XML_TRUE;
  4372. *eventPP = s;
  4373. *eventEndPP = next;
  4374. if (tok <= 0) {
  4375. if (haveMore && tok != XML_TOK_INVALID) {
  4376. *nextPtr = s;
  4377. return XML_ERROR_NONE;
  4378. }
  4379. switch (tok) {
  4380. case XML_TOK_INVALID:
  4381. *eventPP = next;
  4382. return XML_ERROR_INVALID_TOKEN;
  4383. case XML_TOK_PARTIAL:
  4384. return XML_ERROR_UNCLOSED_TOKEN;
  4385. case XML_TOK_PARTIAL_CHAR:
  4386. return XML_ERROR_PARTIAL_CHAR;
  4387. case -XML_TOK_PROLOG_S:
  4388. tok = -tok;
  4389. break;
  4390. case XML_TOK_NONE:
  4391. #ifdef XML_DTD
  4392. /* for internal PE NOT referenced between declarations */
  4393. if (enc != parser->m_encoding
  4394. && ! parser->m_openInternalEntities->betweenDecl) {
  4395. *nextPtr = s;
  4396. return XML_ERROR_NONE;
  4397. }
  4398. /* WFC: PE Between Declarations - must check that PE contains
  4399. complete markup, not only for external PEs, but also for
  4400. internal PEs if the reference occurs between declarations.
  4401. */
  4402. if (parser->m_isParamEntity || enc != parser->m_encoding) {
  4403. if (XmlTokenRole(&parser->m_prologState, XML_TOK_NONE, end, end, enc)
  4404. == XML_ROLE_ERROR)
  4405. return XML_ERROR_INCOMPLETE_PE;
  4406. *nextPtr = s;
  4407. return XML_ERROR_NONE;
  4408. }
  4409. #endif /* XML_DTD */
  4410. return XML_ERROR_NO_ELEMENTS;
  4411. default:
  4412. tok = -tok;
  4413. next = end;
  4414. break;
  4415. }
  4416. }
  4417. role = XmlTokenRole(&parser->m_prologState, tok, s, next, enc);
  4418. #if XML_GE == 1
  4419. switch (role) {
  4420. case XML_ROLE_INSTANCE_START: // bytes accounted in contentProcessor
  4421. case XML_ROLE_XML_DECL: // bytes accounted in processXmlDecl
  4422. # ifdef XML_DTD
  4423. case XML_ROLE_TEXT_DECL: // bytes accounted in processXmlDecl
  4424. # endif
  4425. break;
  4426. default:
  4427. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__, account)) {
  4428. accountingOnAbort(parser);
  4429. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  4430. }
  4431. }
  4432. #endif
  4433. switch (role) {
  4434. case XML_ROLE_XML_DECL: {
  4435. enum XML_Error result = processXmlDecl(parser, 0, s, next);
  4436. if (result != XML_ERROR_NONE)
  4437. return result;
  4438. enc = parser->m_encoding;
  4439. handleDefault = XML_FALSE;
  4440. } break;
  4441. case XML_ROLE_DOCTYPE_NAME:
  4442. if (parser->m_startDoctypeDeclHandler) {
  4443. parser->m_doctypeName
  4444. = poolStoreString(&parser->m_tempPool, enc, s, next);
  4445. if (! parser->m_doctypeName)
  4446. return XML_ERROR_NO_MEMORY;
  4447. poolFinish(&parser->m_tempPool);
  4448. parser->m_doctypePubid = NULL;
  4449. handleDefault = XML_FALSE;
  4450. }
  4451. parser->m_doctypeSysid = NULL; /* always initialize to NULL */
  4452. break;
  4453. case XML_ROLE_DOCTYPE_INTERNAL_SUBSET:
  4454. if (parser->m_startDoctypeDeclHandler) {
  4455. parser->m_startDoctypeDeclHandler(
  4456. parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,
  4457. parser->m_doctypePubid, 1);
  4458. parser->m_doctypeName = NULL;
  4459. poolClear(&parser->m_tempPool);
  4460. handleDefault = XML_FALSE;
  4461. }
  4462. break;
  4463. #ifdef XML_DTD
  4464. case XML_ROLE_TEXT_DECL: {
  4465. enum XML_Error result = processXmlDecl(parser, 1, s, next);
  4466. if (result != XML_ERROR_NONE)
  4467. return result;
  4468. enc = parser->m_encoding;
  4469. handleDefault = XML_FALSE;
  4470. } break;
  4471. #endif /* XML_DTD */
  4472. case XML_ROLE_DOCTYPE_PUBLIC_ID:
  4473. #ifdef XML_DTD
  4474. parser->m_useForeignDTD = XML_FALSE;
  4475. parser->m_declEntity = (ENTITY *)lookup(
  4476. parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));
  4477. if (! parser->m_declEntity)
  4478. return XML_ERROR_NO_MEMORY;
  4479. #endif /* XML_DTD */
  4480. dtd->hasParamEntityRefs = XML_TRUE;
  4481. if (parser->m_startDoctypeDeclHandler) {
  4482. XML_Char *pubId;
  4483. if (! XmlIsPublicId(enc, s, next, eventPP))
  4484. return XML_ERROR_PUBLICID;
  4485. pubId = poolStoreString(&parser->m_tempPool, enc,
  4486. s + enc->minBytesPerChar,
  4487. next - enc->minBytesPerChar);
  4488. if (! pubId)
  4489. return XML_ERROR_NO_MEMORY;
  4490. normalizePublicId(pubId);
  4491. poolFinish(&parser->m_tempPool);
  4492. parser->m_doctypePubid = pubId;
  4493. handleDefault = XML_FALSE;
  4494. goto alreadyChecked;
  4495. }
  4496. /* fall through */
  4497. case XML_ROLE_ENTITY_PUBLIC_ID:
  4498. if (! XmlIsPublicId(enc, s, next, eventPP))
  4499. return XML_ERROR_PUBLICID;
  4500. alreadyChecked:
  4501. if (dtd->keepProcessing && parser->m_declEntity) {
  4502. XML_Char *tem
  4503. = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,
  4504. next - enc->minBytesPerChar);
  4505. if (! tem)
  4506. return XML_ERROR_NO_MEMORY;
  4507. normalizePublicId(tem);
  4508. parser->m_declEntity->publicId = tem;
  4509. poolFinish(&dtd->pool);
  4510. /* Don't suppress the default handler if we fell through from
  4511. * the XML_ROLE_DOCTYPE_PUBLIC_ID case.
  4512. */
  4513. if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_PUBLIC_ID)
  4514. handleDefault = XML_FALSE;
  4515. }
  4516. break;
  4517. case XML_ROLE_DOCTYPE_CLOSE:
  4518. if (allowClosingDoctype != XML_TRUE) {
  4519. /* Must not close doctype from within expanded parameter entities */
  4520. return XML_ERROR_INVALID_TOKEN;
  4521. }
  4522. if (parser->m_doctypeName) {
  4523. parser->m_startDoctypeDeclHandler(
  4524. parser->m_handlerArg, parser->m_doctypeName, parser->m_doctypeSysid,
  4525. parser->m_doctypePubid, 0);
  4526. poolClear(&parser->m_tempPool);
  4527. handleDefault = XML_FALSE;
  4528. }
  4529. /* parser->m_doctypeSysid will be non-NULL in the case of a previous
  4530. XML_ROLE_DOCTYPE_SYSTEM_ID, even if parser->m_startDoctypeDeclHandler
  4531. was not set, indicating an external subset
  4532. */
  4533. #ifdef XML_DTD
  4534. if (parser->m_doctypeSysid || parser->m_useForeignDTD) {
  4535. XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;
  4536. dtd->hasParamEntityRefs = XML_TRUE;
  4537. if (parser->m_paramEntityParsing
  4538. && parser->m_externalEntityRefHandler) {
  4539. ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,
  4540. externalSubsetName, sizeof(ENTITY));
  4541. if (! entity) {
  4542. /* The external subset name "#" will have already been
  4543. * inserted into the hash table at the start of the
  4544. * external entity parsing, so no allocation will happen
  4545. * and lookup() cannot fail.
  4546. */
  4547. return XML_ERROR_NO_MEMORY; /* LCOV_EXCL_LINE */
  4548. }
  4549. if (parser->m_useForeignDTD)
  4550. entity->base = parser->m_curBase;
  4551. dtd->paramEntityRead = XML_FALSE;
  4552. if (! parser->m_externalEntityRefHandler(
  4553. parser->m_externalEntityRefHandlerArg, 0, entity->base,
  4554. entity->systemId, entity->publicId))
  4555. return XML_ERROR_EXTERNAL_ENTITY_HANDLING;
  4556. if (dtd->paramEntityRead) {
  4557. if (! dtd->standalone && parser->m_notStandaloneHandler
  4558. && ! parser->m_notStandaloneHandler(parser->m_handlerArg))
  4559. return XML_ERROR_NOT_STANDALONE;
  4560. }
  4561. /* if we didn't read the foreign DTD then this means that there
  4562. is no external subset and we must reset dtd->hasParamEntityRefs
  4563. */
  4564. else if (! parser->m_doctypeSysid)
  4565. dtd->hasParamEntityRefs = hadParamEntityRefs;
  4566. /* end of DTD - no need to update dtd->keepProcessing */
  4567. }
  4568. parser->m_useForeignDTD = XML_FALSE;
  4569. }
  4570. #endif /* XML_DTD */
  4571. if (parser->m_endDoctypeDeclHandler) {
  4572. parser->m_endDoctypeDeclHandler(parser->m_handlerArg);
  4573. handleDefault = XML_FALSE;
  4574. }
  4575. break;
  4576. case XML_ROLE_INSTANCE_START:
  4577. #ifdef XML_DTD
  4578. /* if there is no DOCTYPE declaration then now is the
  4579. last chance to read the foreign DTD
  4580. */
  4581. if (parser->m_useForeignDTD) {
  4582. XML_Bool hadParamEntityRefs = dtd->hasParamEntityRefs;
  4583. dtd->hasParamEntityRefs = XML_TRUE;
  4584. if (parser->m_paramEntityParsing
  4585. && parser->m_externalEntityRefHandler) {
  4586. ENTITY *entity = (ENTITY *)lookup(parser, &dtd->paramEntities,
  4587. externalSubsetName, sizeof(ENTITY));
  4588. if (! entity)
  4589. return XML_ERROR_NO_MEMORY;
  4590. entity->base = parser->m_curBase;
  4591. dtd->paramEntityRead = XML_FALSE;
  4592. if (! parser->m_externalEntityRefHandler(
  4593. parser->m_externalEntityRefHandlerArg, 0, entity->base,
  4594. entity->systemId, entity->publicId))
  4595. return XML_ERROR_EXTERNAL_ENTITY_HANDLING;
  4596. if (dtd->paramEntityRead) {
  4597. if (! dtd->standalone && parser->m_notStandaloneHandler
  4598. && ! parser->m_notStandaloneHandler(parser->m_handlerArg))
  4599. return XML_ERROR_NOT_STANDALONE;
  4600. }
  4601. /* if we didn't read the foreign DTD then this means that there
  4602. is no external subset and we must reset dtd->hasParamEntityRefs
  4603. */
  4604. else
  4605. dtd->hasParamEntityRefs = hadParamEntityRefs;
  4606. /* end of DTD - no need to update dtd->keepProcessing */
  4607. }
  4608. }
  4609. #endif /* XML_DTD */
  4610. parser->m_processor = contentProcessor;
  4611. return contentProcessor(parser, s, end, nextPtr);
  4612. case XML_ROLE_ATTLIST_ELEMENT_NAME:
  4613. parser->m_declElementType = getElementType(parser, enc, s, next);
  4614. if (! parser->m_declElementType)
  4615. return XML_ERROR_NO_MEMORY;
  4616. goto checkAttListDeclHandler;
  4617. case XML_ROLE_ATTRIBUTE_NAME:
  4618. parser->m_declAttributeId = getAttributeId(parser, enc, s, next);
  4619. if (! parser->m_declAttributeId)
  4620. return XML_ERROR_NO_MEMORY;
  4621. parser->m_declAttributeIsCdata = XML_FALSE;
  4622. parser->m_declAttributeType = NULL;
  4623. parser->m_declAttributeIsId = XML_FALSE;
  4624. goto checkAttListDeclHandler;
  4625. case XML_ROLE_ATTRIBUTE_TYPE_CDATA:
  4626. parser->m_declAttributeIsCdata = XML_TRUE;
  4627. parser->m_declAttributeType = atypeCDATA;
  4628. goto checkAttListDeclHandler;
  4629. case XML_ROLE_ATTRIBUTE_TYPE_ID:
  4630. parser->m_declAttributeIsId = XML_TRUE;
  4631. parser->m_declAttributeType = atypeID;
  4632. goto checkAttListDeclHandler;
  4633. case XML_ROLE_ATTRIBUTE_TYPE_IDREF:
  4634. parser->m_declAttributeType = atypeIDREF;
  4635. goto checkAttListDeclHandler;
  4636. case XML_ROLE_ATTRIBUTE_TYPE_IDREFS:
  4637. parser->m_declAttributeType = atypeIDREFS;
  4638. goto checkAttListDeclHandler;
  4639. case XML_ROLE_ATTRIBUTE_TYPE_ENTITY:
  4640. parser->m_declAttributeType = atypeENTITY;
  4641. goto checkAttListDeclHandler;
  4642. case XML_ROLE_ATTRIBUTE_TYPE_ENTITIES:
  4643. parser->m_declAttributeType = atypeENTITIES;
  4644. goto checkAttListDeclHandler;
  4645. case XML_ROLE_ATTRIBUTE_TYPE_NMTOKEN:
  4646. parser->m_declAttributeType = atypeNMTOKEN;
  4647. goto checkAttListDeclHandler;
  4648. case XML_ROLE_ATTRIBUTE_TYPE_NMTOKENS:
  4649. parser->m_declAttributeType = atypeNMTOKENS;
  4650. checkAttListDeclHandler:
  4651. if (dtd->keepProcessing && parser->m_attlistDeclHandler)
  4652. handleDefault = XML_FALSE;
  4653. break;
  4654. case XML_ROLE_ATTRIBUTE_ENUM_VALUE:
  4655. case XML_ROLE_ATTRIBUTE_NOTATION_VALUE:
  4656. if (dtd->keepProcessing && parser->m_attlistDeclHandler) {
  4657. const XML_Char *prefix;
  4658. if (parser->m_declAttributeType) {
  4659. prefix = enumValueSep;
  4660. } else {
  4661. prefix = (role == XML_ROLE_ATTRIBUTE_NOTATION_VALUE ? notationPrefix
  4662. : enumValueStart);
  4663. }
  4664. if (! poolAppendString(&parser->m_tempPool, prefix))
  4665. return XML_ERROR_NO_MEMORY;
  4666. if (! poolAppend(&parser->m_tempPool, enc, s, next))
  4667. return XML_ERROR_NO_MEMORY;
  4668. parser->m_declAttributeType = parser->m_tempPool.start;
  4669. handleDefault = XML_FALSE;
  4670. }
  4671. break;
  4672. case XML_ROLE_IMPLIED_ATTRIBUTE_VALUE:
  4673. case XML_ROLE_REQUIRED_ATTRIBUTE_VALUE:
  4674. if (dtd->keepProcessing) {
  4675. if (! defineAttribute(parser->m_declElementType,
  4676. parser->m_declAttributeId,
  4677. parser->m_declAttributeIsCdata,
  4678. parser->m_declAttributeIsId, 0, parser))
  4679. return XML_ERROR_NO_MEMORY;
  4680. if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {
  4681. if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)
  4682. || (*parser->m_declAttributeType == XML_T(ASCII_N)
  4683. && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {
  4684. /* Enumerated or Notation type */
  4685. if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))
  4686. || ! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  4687. return XML_ERROR_NO_MEMORY;
  4688. parser->m_declAttributeType = parser->m_tempPool.start;
  4689. poolFinish(&parser->m_tempPool);
  4690. }
  4691. *eventEndPP = s;
  4692. parser->m_attlistDeclHandler(
  4693. parser->m_handlerArg, parser->m_declElementType->name,
  4694. parser->m_declAttributeId->name, parser->m_declAttributeType, 0,
  4695. role == XML_ROLE_REQUIRED_ATTRIBUTE_VALUE);
  4696. handleDefault = XML_FALSE;
  4697. }
  4698. }
  4699. poolClear(&parser->m_tempPool);
  4700. break;
  4701. case XML_ROLE_DEFAULT_ATTRIBUTE_VALUE:
  4702. case XML_ROLE_FIXED_ATTRIBUTE_VALUE:
  4703. if (dtd->keepProcessing) {
  4704. const XML_Char *attVal;
  4705. enum XML_Error result = storeAttributeValue(
  4706. parser, enc, parser->m_declAttributeIsCdata,
  4707. s + enc->minBytesPerChar, next - enc->minBytesPerChar, &dtd->pool,
  4708. XML_ACCOUNT_NONE);
  4709. if (result)
  4710. return result;
  4711. attVal = poolStart(&dtd->pool);
  4712. poolFinish(&dtd->pool);
  4713. /* ID attributes aren't allowed to have a default */
  4714. if (! defineAttribute(
  4715. parser->m_declElementType, parser->m_declAttributeId,
  4716. parser->m_declAttributeIsCdata, XML_FALSE, attVal, parser))
  4717. return XML_ERROR_NO_MEMORY;
  4718. if (parser->m_attlistDeclHandler && parser->m_declAttributeType) {
  4719. if (*parser->m_declAttributeType == XML_T(ASCII_LPAREN)
  4720. || (*parser->m_declAttributeType == XML_T(ASCII_N)
  4721. && parser->m_declAttributeType[1] == XML_T(ASCII_O))) {
  4722. /* Enumerated or Notation type */
  4723. if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_RPAREN))
  4724. || ! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  4725. return XML_ERROR_NO_MEMORY;
  4726. parser->m_declAttributeType = parser->m_tempPool.start;
  4727. poolFinish(&parser->m_tempPool);
  4728. }
  4729. *eventEndPP = s;
  4730. parser->m_attlistDeclHandler(
  4731. parser->m_handlerArg, parser->m_declElementType->name,
  4732. parser->m_declAttributeId->name, parser->m_declAttributeType,
  4733. attVal, role == XML_ROLE_FIXED_ATTRIBUTE_VALUE);
  4734. poolClear(&parser->m_tempPool);
  4735. handleDefault = XML_FALSE;
  4736. }
  4737. }
  4738. break;
  4739. case XML_ROLE_ENTITY_VALUE:
  4740. if (dtd->keepProcessing) {
  4741. #if XML_GE == 1
  4742. // This will store the given replacement text in
  4743. // parser->m_declEntity->textPtr.
  4744. enum XML_Error result
  4745. = storeEntityValue(parser, enc, s + enc->minBytesPerChar,
  4746. next - enc->minBytesPerChar, XML_ACCOUNT_NONE);
  4747. if (parser->m_declEntity) {
  4748. parser->m_declEntity->textPtr = poolStart(&dtd->entityValuePool);
  4749. parser->m_declEntity->textLen
  4750. = (int)(poolLength(&dtd->entityValuePool));
  4751. poolFinish(&dtd->entityValuePool);
  4752. if (parser->m_entityDeclHandler) {
  4753. *eventEndPP = s;
  4754. parser->m_entityDeclHandler(
  4755. parser->m_handlerArg, parser->m_declEntity->name,
  4756. parser->m_declEntity->is_param, parser->m_declEntity->textPtr,
  4757. parser->m_declEntity->textLen, parser->m_curBase, 0, 0, 0);
  4758. handleDefault = XML_FALSE;
  4759. }
  4760. } else
  4761. poolDiscard(&dtd->entityValuePool);
  4762. if (result != XML_ERROR_NONE)
  4763. return result;
  4764. #else
  4765. // This will store "&amp;entity123;" in parser->m_declEntity->textPtr
  4766. // to end up as "&entity123;" in the handler.
  4767. if (parser->m_declEntity != NULL) {
  4768. const enum XML_Error result
  4769. = storeSelfEntityValue(parser, parser->m_declEntity);
  4770. if (result != XML_ERROR_NONE)
  4771. return result;
  4772. if (parser->m_entityDeclHandler) {
  4773. *eventEndPP = s;
  4774. parser->m_entityDeclHandler(
  4775. parser->m_handlerArg, parser->m_declEntity->name,
  4776. parser->m_declEntity->is_param, parser->m_declEntity->textPtr,
  4777. parser->m_declEntity->textLen, parser->m_curBase, 0, 0, 0);
  4778. handleDefault = XML_FALSE;
  4779. }
  4780. }
  4781. #endif
  4782. }
  4783. break;
  4784. case XML_ROLE_DOCTYPE_SYSTEM_ID:
  4785. #ifdef XML_DTD
  4786. parser->m_useForeignDTD = XML_FALSE;
  4787. #endif /* XML_DTD */
  4788. dtd->hasParamEntityRefs = XML_TRUE;
  4789. if (parser->m_startDoctypeDeclHandler) {
  4790. parser->m_doctypeSysid = poolStoreString(&parser->m_tempPool, enc,
  4791. s + enc->minBytesPerChar,
  4792. next - enc->minBytesPerChar);
  4793. if (parser->m_doctypeSysid == NULL)
  4794. return XML_ERROR_NO_MEMORY;
  4795. poolFinish(&parser->m_tempPool);
  4796. handleDefault = XML_FALSE;
  4797. }
  4798. #ifdef XML_DTD
  4799. else
  4800. /* use externalSubsetName to make parser->m_doctypeSysid non-NULL
  4801. for the case where no parser->m_startDoctypeDeclHandler is set */
  4802. parser->m_doctypeSysid = externalSubsetName;
  4803. #endif /* XML_DTD */
  4804. if (! dtd->standalone
  4805. #ifdef XML_DTD
  4806. && ! parser->m_paramEntityParsing
  4807. #endif /* XML_DTD */
  4808. && parser->m_notStandaloneHandler
  4809. && ! parser->m_notStandaloneHandler(parser->m_handlerArg))
  4810. return XML_ERROR_NOT_STANDALONE;
  4811. #ifndef XML_DTD
  4812. break;
  4813. #else /* XML_DTD */
  4814. if (! parser->m_declEntity) {
  4815. parser->m_declEntity = (ENTITY *)lookup(
  4816. parser, &dtd->paramEntities, externalSubsetName, sizeof(ENTITY));
  4817. if (! parser->m_declEntity)
  4818. return XML_ERROR_NO_MEMORY;
  4819. parser->m_declEntity->publicId = NULL;
  4820. }
  4821. #endif /* XML_DTD */
  4822. /* fall through */
  4823. case XML_ROLE_ENTITY_SYSTEM_ID:
  4824. if (dtd->keepProcessing && parser->m_declEntity) {
  4825. parser->m_declEntity->systemId
  4826. = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,
  4827. next - enc->minBytesPerChar);
  4828. if (! parser->m_declEntity->systemId)
  4829. return XML_ERROR_NO_MEMORY;
  4830. parser->m_declEntity->base = parser->m_curBase;
  4831. poolFinish(&dtd->pool);
  4832. /* Don't suppress the default handler if we fell through from
  4833. * the XML_ROLE_DOCTYPE_SYSTEM_ID case.
  4834. */
  4835. if (parser->m_entityDeclHandler && role == XML_ROLE_ENTITY_SYSTEM_ID)
  4836. handleDefault = XML_FALSE;
  4837. }
  4838. break;
  4839. case XML_ROLE_ENTITY_COMPLETE:
  4840. #if XML_GE == 0
  4841. // This will store "&amp;entity123;" in entity->textPtr
  4842. // to end up as "&entity123;" in the handler.
  4843. if (parser->m_declEntity != NULL) {
  4844. const enum XML_Error result
  4845. = storeSelfEntityValue(parser, parser->m_declEntity);
  4846. if (result != XML_ERROR_NONE)
  4847. return result;
  4848. }
  4849. #endif
  4850. if (dtd->keepProcessing && parser->m_declEntity
  4851. && parser->m_entityDeclHandler) {
  4852. *eventEndPP = s;
  4853. parser->m_entityDeclHandler(
  4854. parser->m_handlerArg, parser->m_declEntity->name,
  4855. parser->m_declEntity->is_param, 0, 0, parser->m_declEntity->base,
  4856. parser->m_declEntity->systemId, parser->m_declEntity->publicId, 0);
  4857. handleDefault = XML_FALSE;
  4858. }
  4859. break;
  4860. case XML_ROLE_ENTITY_NOTATION_NAME:
  4861. if (dtd->keepProcessing && parser->m_declEntity) {
  4862. parser->m_declEntity->notation
  4863. = poolStoreString(&dtd->pool, enc, s, next);
  4864. if (! parser->m_declEntity->notation)
  4865. return XML_ERROR_NO_MEMORY;
  4866. poolFinish(&dtd->pool);
  4867. if (parser->m_unparsedEntityDeclHandler) {
  4868. *eventEndPP = s;
  4869. parser->m_unparsedEntityDeclHandler(
  4870. parser->m_handlerArg, parser->m_declEntity->name,
  4871. parser->m_declEntity->base, parser->m_declEntity->systemId,
  4872. parser->m_declEntity->publicId, parser->m_declEntity->notation);
  4873. handleDefault = XML_FALSE;
  4874. } else if (parser->m_entityDeclHandler) {
  4875. *eventEndPP = s;
  4876. parser->m_entityDeclHandler(
  4877. parser->m_handlerArg, parser->m_declEntity->name, 0, 0, 0,
  4878. parser->m_declEntity->base, parser->m_declEntity->systemId,
  4879. parser->m_declEntity->publicId, parser->m_declEntity->notation);
  4880. handleDefault = XML_FALSE;
  4881. }
  4882. }
  4883. break;
  4884. case XML_ROLE_GENERAL_ENTITY_NAME: {
  4885. if (XmlPredefinedEntityName(enc, s, next)) {
  4886. parser->m_declEntity = NULL;
  4887. break;
  4888. }
  4889. if (dtd->keepProcessing) {
  4890. const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);
  4891. if (! name)
  4892. return XML_ERROR_NO_MEMORY;
  4893. parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->generalEntities,
  4894. name, sizeof(ENTITY));
  4895. if (! parser->m_declEntity)
  4896. return XML_ERROR_NO_MEMORY;
  4897. if (parser->m_declEntity->name != name) {
  4898. poolDiscard(&dtd->pool);
  4899. parser->m_declEntity = NULL;
  4900. } else {
  4901. poolFinish(&dtd->pool);
  4902. parser->m_declEntity->publicId = NULL;
  4903. parser->m_declEntity->is_param = XML_FALSE;
  4904. /* if we have a parent parser or are reading an internal parameter
  4905. entity, then the entity declaration is not considered "internal"
  4906. */
  4907. parser->m_declEntity->is_internal
  4908. = ! (parser->m_parentParser || parser->m_openInternalEntities);
  4909. if (parser->m_entityDeclHandler)
  4910. handleDefault = XML_FALSE;
  4911. }
  4912. } else {
  4913. poolDiscard(&dtd->pool);
  4914. parser->m_declEntity = NULL;
  4915. }
  4916. } break;
  4917. case XML_ROLE_PARAM_ENTITY_NAME:
  4918. #ifdef XML_DTD
  4919. if (dtd->keepProcessing) {
  4920. const XML_Char *name = poolStoreString(&dtd->pool, enc, s, next);
  4921. if (! name)
  4922. return XML_ERROR_NO_MEMORY;
  4923. parser->m_declEntity = (ENTITY *)lookup(parser, &dtd->paramEntities,
  4924. name, sizeof(ENTITY));
  4925. if (! parser->m_declEntity)
  4926. return XML_ERROR_NO_MEMORY;
  4927. if (parser->m_declEntity->name != name) {
  4928. poolDiscard(&dtd->pool);
  4929. parser->m_declEntity = NULL;
  4930. } else {
  4931. poolFinish(&dtd->pool);
  4932. parser->m_declEntity->publicId = NULL;
  4933. parser->m_declEntity->is_param = XML_TRUE;
  4934. /* if we have a parent parser or are reading an internal parameter
  4935. entity, then the entity declaration is not considered "internal"
  4936. */
  4937. parser->m_declEntity->is_internal
  4938. = ! (parser->m_parentParser || parser->m_openInternalEntities);
  4939. if (parser->m_entityDeclHandler)
  4940. handleDefault = XML_FALSE;
  4941. }
  4942. } else {
  4943. poolDiscard(&dtd->pool);
  4944. parser->m_declEntity = NULL;
  4945. }
  4946. #else /* not XML_DTD */
  4947. parser->m_declEntity = NULL;
  4948. #endif /* XML_DTD */
  4949. break;
  4950. case XML_ROLE_NOTATION_NAME:
  4951. parser->m_declNotationPublicId = NULL;
  4952. parser->m_declNotationName = NULL;
  4953. if (parser->m_notationDeclHandler) {
  4954. parser->m_declNotationName
  4955. = poolStoreString(&parser->m_tempPool, enc, s, next);
  4956. if (! parser->m_declNotationName)
  4957. return XML_ERROR_NO_MEMORY;
  4958. poolFinish(&parser->m_tempPool);
  4959. handleDefault = XML_FALSE;
  4960. }
  4961. break;
  4962. case XML_ROLE_NOTATION_PUBLIC_ID:
  4963. if (! XmlIsPublicId(enc, s, next, eventPP))
  4964. return XML_ERROR_PUBLICID;
  4965. if (parser
  4966. ->m_declNotationName) { /* means m_notationDeclHandler != NULL */
  4967. XML_Char *tem = poolStoreString(&parser->m_tempPool, enc,
  4968. s + enc->minBytesPerChar,
  4969. next - enc->minBytesPerChar);
  4970. if (! tem)
  4971. return XML_ERROR_NO_MEMORY;
  4972. normalizePublicId(tem);
  4973. parser->m_declNotationPublicId = tem;
  4974. poolFinish(&parser->m_tempPool);
  4975. handleDefault = XML_FALSE;
  4976. }
  4977. break;
  4978. case XML_ROLE_NOTATION_SYSTEM_ID:
  4979. if (parser->m_declNotationName && parser->m_notationDeclHandler) {
  4980. const XML_Char *systemId = poolStoreString(&parser->m_tempPool, enc,
  4981. s + enc->minBytesPerChar,
  4982. next - enc->minBytesPerChar);
  4983. if (! systemId)
  4984. return XML_ERROR_NO_MEMORY;
  4985. *eventEndPP = s;
  4986. parser->m_notationDeclHandler(
  4987. parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,
  4988. systemId, parser->m_declNotationPublicId);
  4989. handleDefault = XML_FALSE;
  4990. }
  4991. poolClear(&parser->m_tempPool);
  4992. break;
  4993. case XML_ROLE_NOTATION_NO_SYSTEM_ID:
  4994. if (parser->m_declNotationPublicId && parser->m_notationDeclHandler) {
  4995. *eventEndPP = s;
  4996. parser->m_notationDeclHandler(
  4997. parser->m_handlerArg, parser->m_declNotationName, parser->m_curBase,
  4998. 0, parser->m_declNotationPublicId);
  4999. handleDefault = XML_FALSE;
  5000. }
  5001. poolClear(&parser->m_tempPool);
  5002. break;
  5003. case XML_ROLE_ERROR:
  5004. switch (tok) {
  5005. case XML_TOK_PARAM_ENTITY_REF:
  5006. /* PE references in internal subset are
  5007. not allowed within declarations. */
  5008. return XML_ERROR_PARAM_ENTITY_REF;
  5009. case XML_TOK_XML_DECL:
  5010. return XML_ERROR_MISPLACED_XML_PI;
  5011. default:
  5012. return XML_ERROR_SYNTAX;
  5013. }
  5014. #ifdef XML_DTD
  5015. case XML_ROLE_IGNORE_SECT: {
  5016. enum XML_Error result;
  5017. if (parser->m_defaultHandler)
  5018. reportDefault(parser, enc, s, next);
  5019. handleDefault = XML_FALSE;
  5020. result = doIgnoreSection(parser, enc, &next, end, nextPtr, haveMore);
  5021. if (result != XML_ERROR_NONE)
  5022. return result;
  5023. else if (! next) {
  5024. parser->m_processor = ignoreSectionProcessor;
  5025. return result;
  5026. }
  5027. } break;
  5028. #endif /* XML_DTD */
  5029. case XML_ROLE_GROUP_OPEN:
  5030. if (parser->m_prologState.level >= parser->m_groupSize) {
  5031. if (parser->m_groupSize) {
  5032. {
  5033. /* Detect and prevent integer overflow */
  5034. if (parser->m_groupSize > (unsigned int)(-1) / 2u) {
  5035. return XML_ERROR_NO_MEMORY;
  5036. }
  5037. char *const new_connector = (char *)REALLOC(
  5038. parser, parser->m_groupConnector, parser->m_groupSize *= 2);
  5039. if (new_connector == NULL) {
  5040. parser->m_groupSize /= 2;
  5041. return XML_ERROR_NO_MEMORY;
  5042. }
  5043. parser->m_groupConnector = new_connector;
  5044. }
  5045. if (dtd->scaffIndex) {
  5046. /* Detect and prevent integer overflow.
  5047. * The preprocessor guard addresses the "always false" warning
  5048. * from -Wtype-limits on platforms where
  5049. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  5050. #if UINT_MAX >= SIZE_MAX
  5051. if (parser->m_groupSize > (size_t)(-1) / sizeof(int)) {
  5052. return XML_ERROR_NO_MEMORY;
  5053. }
  5054. #endif
  5055. int *const new_scaff_index = (int *)REALLOC(
  5056. parser, dtd->scaffIndex, parser->m_groupSize * sizeof(int));
  5057. if (new_scaff_index == NULL)
  5058. return XML_ERROR_NO_MEMORY;
  5059. dtd->scaffIndex = new_scaff_index;
  5060. }
  5061. } else {
  5062. parser->m_groupConnector
  5063. = (char *)MALLOC(parser, parser->m_groupSize = 32);
  5064. if (! parser->m_groupConnector) {
  5065. parser->m_groupSize = 0;
  5066. return XML_ERROR_NO_MEMORY;
  5067. }
  5068. }
  5069. }
  5070. parser->m_groupConnector[parser->m_prologState.level] = 0;
  5071. if (dtd->in_eldecl) {
  5072. int myindex = nextScaffoldPart(parser);
  5073. if (myindex < 0)
  5074. return XML_ERROR_NO_MEMORY;
  5075. assert(dtd->scaffIndex != NULL);
  5076. dtd->scaffIndex[dtd->scaffLevel] = myindex;
  5077. dtd->scaffLevel++;
  5078. dtd->scaffold[myindex].type = XML_CTYPE_SEQ;
  5079. if (parser->m_elementDeclHandler)
  5080. handleDefault = XML_FALSE;
  5081. }
  5082. break;
  5083. case XML_ROLE_GROUP_SEQUENCE:
  5084. if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_PIPE)
  5085. return XML_ERROR_SYNTAX;
  5086. parser->m_groupConnector[parser->m_prologState.level] = ASCII_COMMA;
  5087. if (dtd->in_eldecl && parser->m_elementDeclHandler)
  5088. handleDefault = XML_FALSE;
  5089. break;
  5090. case XML_ROLE_GROUP_CHOICE:
  5091. if (parser->m_groupConnector[parser->m_prologState.level] == ASCII_COMMA)
  5092. return XML_ERROR_SYNTAX;
  5093. if (dtd->in_eldecl
  5094. && ! parser->m_groupConnector[parser->m_prologState.level]
  5095. && (dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type
  5096. != XML_CTYPE_MIXED)) {
  5097. dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type
  5098. = XML_CTYPE_CHOICE;
  5099. if (parser->m_elementDeclHandler)
  5100. handleDefault = XML_FALSE;
  5101. }
  5102. parser->m_groupConnector[parser->m_prologState.level] = ASCII_PIPE;
  5103. break;
  5104. case XML_ROLE_PARAM_ENTITY_REF:
  5105. #ifdef XML_DTD
  5106. case XML_ROLE_INNER_PARAM_ENTITY_REF:
  5107. dtd->hasParamEntityRefs = XML_TRUE;
  5108. if (! parser->m_paramEntityParsing)
  5109. dtd->keepProcessing = dtd->standalone;
  5110. else {
  5111. const XML_Char *name;
  5112. ENTITY *entity;
  5113. name = poolStoreString(&dtd->pool, enc, s + enc->minBytesPerChar,
  5114. next - enc->minBytesPerChar);
  5115. if (! name)
  5116. return XML_ERROR_NO_MEMORY;
  5117. entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);
  5118. poolDiscard(&dtd->pool);
  5119. /* first, determine if a check for an existing declaration is needed;
  5120. if yes, check that the entity exists, and that it is internal,
  5121. otherwise call the skipped entity handler
  5122. */
  5123. if (parser->m_prologState.documentEntity
  5124. && (dtd->standalone ? ! parser->m_openInternalEntities
  5125. : ! dtd->hasParamEntityRefs)) {
  5126. if (! entity)
  5127. return XML_ERROR_UNDEFINED_ENTITY;
  5128. else if (! entity->is_internal) {
  5129. /* It's hard to exhaustively search the code to be sure,
  5130. * but there doesn't seem to be a way of executing the
  5131. * following line. There are two cases:
  5132. *
  5133. * If 'standalone' is false, the DTD must have no
  5134. * parameter entities or we wouldn't have passed the outer
  5135. * 'if' statement. That means the only entity in the hash
  5136. * table is the external subset name "#" which cannot be
  5137. * given as a parameter entity name in XML syntax, so the
  5138. * lookup must have returned NULL and we don't even reach
  5139. * the test for an internal entity.
  5140. *
  5141. * If 'standalone' is true, it does not seem to be
  5142. * possible to create entities taking this code path that
  5143. * are not internal entities, so fail the test above.
  5144. *
  5145. * Because this analysis is very uncertain, the code is
  5146. * being left in place and merely removed from the
  5147. * coverage test statistics.
  5148. */
  5149. return XML_ERROR_ENTITY_DECLARED_IN_PE; /* LCOV_EXCL_LINE */
  5150. }
  5151. } else if (! entity) {
  5152. dtd->keepProcessing = dtd->standalone;
  5153. /* cannot report skipped entities in declarations */
  5154. if ((role == XML_ROLE_PARAM_ENTITY_REF)
  5155. && parser->m_skippedEntityHandler) {
  5156. parser->m_skippedEntityHandler(parser->m_handlerArg, name, 1);
  5157. handleDefault = XML_FALSE;
  5158. }
  5159. break;
  5160. }
  5161. if (entity->open)
  5162. return XML_ERROR_RECURSIVE_ENTITY_REF;
  5163. if (entity->textPtr) {
  5164. enum XML_Error result;
  5165. XML_Bool betweenDecl
  5166. = (role == XML_ROLE_PARAM_ENTITY_REF ? XML_TRUE : XML_FALSE);
  5167. result = processInternalEntity(parser, entity, betweenDecl);
  5168. if (result != XML_ERROR_NONE)
  5169. return result;
  5170. handleDefault = XML_FALSE;
  5171. break;
  5172. }
  5173. if (parser->m_externalEntityRefHandler) {
  5174. dtd->paramEntityRead = XML_FALSE;
  5175. entity->open = XML_TRUE;
  5176. entityTrackingOnOpen(parser, entity, __LINE__);
  5177. if (! parser->m_externalEntityRefHandler(
  5178. parser->m_externalEntityRefHandlerArg, 0, entity->base,
  5179. entity->systemId, entity->publicId)) {
  5180. entityTrackingOnClose(parser, entity, __LINE__);
  5181. entity->open = XML_FALSE;
  5182. return XML_ERROR_EXTERNAL_ENTITY_HANDLING;
  5183. }
  5184. entityTrackingOnClose(parser, entity, __LINE__);
  5185. entity->open = XML_FALSE;
  5186. handleDefault = XML_FALSE;
  5187. if (! dtd->paramEntityRead) {
  5188. dtd->keepProcessing = dtd->standalone;
  5189. break;
  5190. }
  5191. } else {
  5192. dtd->keepProcessing = dtd->standalone;
  5193. break;
  5194. }
  5195. }
  5196. #endif /* XML_DTD */
  5197. if (! dtd->standalone && parser->m_notStandaloneHandler
  5198. && ! parser->m_notStandaloneHandler(parser->m_handlerArg))
  5199. return XML_ERROR_NOT_STANDALONE;
  5200. break;
  5201. /* Element declaration stuff */
  5202. case XML_ROLE_ELEMENT_NAME:
  5203. if (parser->m_elementDeclHandler) {
  5204. parser->m_declElementType = getElementType(parser, enc, s, next);
  5205. if (! parser->m_declElementType)
  5206. return XML_ERROR_NO_MEMORY;
  5207. dtd->scaffLevel = 0;
  5208. dtd->scaffCount = 0;
  5209. dtd->in_eldecl = XML_TRUE;
  5210. handleDefault = XML_FALSE;
  5211. }
  5212. break;
  5213. case XML_ROLE_CONTENT_ANY:
  5214. case XML_ROLE_CONTENT_EMPTY:
  5215. if (dtd->in_eldecl) {
  5216. if (parser->m_elementDeclHandler) {
  5217. XML_Content *content
  5218. = (XML_Content *)MALLOC(parser, sizeof(XML_Content));
  5219. if (! content)
  5220. return XML_ERROR_NO_MEMORY;
  5221. content->quant = XML_CQUANT_NONE;
  5222. content->name = NULL;
  5223. content->numchildren = 0;
  5224. content->children = NULL;
  5225. content->type = ((role == XML_ROLE_CONTENT_ANY) ? XML_CTYPE_ANY
  5226. : XML_CTYPE_EMPTY);
  5227. *eventEndPP = s;
  5228. parser->m_elementDeclHandler(
  5229. parser->m_handlerArg, parser->m_declElementType->name, content);
  5230. handleDefault = XML_FALSE;
  5231. }
  5232. dtd->in_eldecl = XML_FALSE;
  5233. }
  5234. break;
  5235. case XML_ROLE_CONTENT_PCDATA:
  5236. if (dtd->in_eldecl) {
  5237. dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]].type
  5238. = XML_CTYPE_MIXED;
  5239. if (parser->m_elementDeclHandler)
  5240. handleDefault = XML_FALSE;
  5241. }
  5242. break;
  5243. case XML_ROLE_CONTENT_ELEMENT:
  5244. quant = XML_CQUANT_NONE;
  5245. goto elementContent;
  5246. case XML_ROLE_CONTENT_ELEMENT_OPT:
  5247. quant = XML_CQUANT_OPT;
  5248. goto elementContent;
  5249. case XML_ROLE_CONTENT_ELEMENT_REP:
  5250. quant = XML_CQUANT_REP;
  5251. goto elementContent;
  5252. case XML_ROLE_CONTENT_ELEMENT_PLUS:
  5253. quant = XML_CQUANT_PLUS;
  5254. elementContent:
  5255. if (dtd->in_eldecl) {
  5256. ELEMENT_TYPE *el;
  5257. const XML_Char *name;
  5258. size_t nameLen;
  5259. const char *nxt
  5260. = (quant == XML_CQUANT_NONE ? next : next - enc->minBytesPerChar);
  5261. int myindex = nextScaffoldPart(parser);
  5262. if (myindex < 0)
  5263. return XML_ERROR_NO_MEMORY;
  5264. dtd->scaffold[myindex].type = XML_CTYPE_NAME;
  5265. dtd->scaffold[myindex].quant = quant;
  5266. el = getElementType(parser, enc, s, nxt);
  5267. if (! el)
  5268. return XML_ERROR_NO_MEMORY;
  5269. name = el->name;
  5270. dtd->scaffold[myindex].name = name;
  5271. nameLen = 0;
  5272. for (; name[nameLen++];)
  5273. ;
  5274. /* Detect and prevent integer overflow */
  5275. if (nameLen > UINT_MAX - dtd->contentStringLen) {
  5276. return XML_ERROR_NO_MEMORY;
  5277. }
  5278. dtd->contentStringLen += (unsigned)nameLen;
  5279. if (parser->m_elementDeclHandler)
  5280. handleDefault = XML_FALSE;
  5281. }
  5282. break;
  5283. case XML_ROLE_GROUP_CLOSE:
  5284. quant = XML_CQUANT_NONE;
  5285. goto closeGroup;
  5286. case XML_ROLE_GROUP_CLOSE_OPT:
  5287. quant = XML_CQUANT_OPT;
  5288. goto closeGroup;
  5289. case XML_ROLE_GROUP_CLOSE_REP:
  5290. quant = XML_CQUANT_REP;
  5291. goto closeGroup;
  5292. case XML_ROLE_GROUP_CLOSE_PLUS:
  5293. quant = XML_CQUANT_PLUS;
  5294. closeGroup:
  5295. if (dtd->in_eldecl) {
  5296. if (parser->m_elementDeclHandler)
  5297. handleDefault = XML_FALSE;
  5298. dtd->scaffLevel--;
  5299. dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel]].quant = quant;
  5300. if (dtd->scaffLevel == 0) {
  5301. if (! handleDefault) {
  5302. XML_Content *model = build_model(parser);
  5303. if (! model)
  5304. return XML_ERROR_NO_MEMORY;
  5305. *eventEndPP = s;
  5306. parser->m_elementDeclHandler(
  5307. parser->m_handlerArg, parser->m_declElementType->name, model);
  5308. }
  5309. dtd->in_eldecl = XML_FALSE;
  5310. dtd->contentStringLen = 0;
  5311. }
  5312. }
  5313. break;
  5314. /* End element declaration stuff */
  5315. case XML_ROLE_PI:
  5316. if (! reportProcessingInstruction(parser, enc, s, next))
  5317. return XML_ERROR_NO_MEMORY;
  5318. handleDefault = XML_FALSE;
  5319. break;
  5320. case XML_ROLE_COMMENT:
  5321. if (! reportComment(parser, enc, s, next))
  5322. return XML_ERROR_NO_MEMORY;
  5323. handleDefault = XML_FALSE;
  5324. break;
  5325. case XML_ROLE_NONE:
  5326. switch (tok) {
  5327. case XML_TOK_BOM:
  5328. handleDefault = XML_FALSE;
  5329. break;
  5330. }
  5331. break;
  5332. case XML_ROLE_DOCTYPE_NONE:
  5333. if (parser->m_startDoctypeDeclHandler)
  5334. handleDefault = XML_FALSE;
  5335. break;
  5336. case XML_ROLE_ENTITY_NONE:
  5337. if (dtd->keepProcessing && parser->m_entityDeclHandler)
  5338. handleDefault = XML_FALSE;
  5339. break;
  5340. case XML_ROLE_NOTATION_NONE:
  5341. if (parser->m_notationDeclHandler)
  5342. handleDefault = XML_FALSE;
  5343. break;
  5344. case XML_ROLE_ATTLIST_NONE:
  5345. if (dtd->keepProcessing && parser->m_attlistDeclHandler)
  5346. handleDefault = XML_FALSE;
  5347. break;
  5348. case XML_ROLE_ELEMENT_NONE:
  5349. if (parser->m_elementDeclHandler)
  5350. handleDefault = XML_FALSE;
  5351. break;
  5352. } /* end of big switch */
  5353. if (handleDefault && parser->m_defaultHandler)
  5354. reportDefault(parser, enc, s, next);
  5355. switch (parser->m_parsingStatus.parsing) {
  5356. case XML_SUSPENDED:
  5357. *nextPtr = next;
  5358. return XML_ERROR_NONE;
  5359. case XML_FINISHED:
  5360. return XML_ERROR_ABORTED;
  5361. default:
  5362. s = next;
  5363. tok = XmlPrologTok(enc, s, end, &next);
  5364. }
  5365. }
  5366. /* not reached */
  5367. }
  5368. static enum XML_Error PTRCALL
  5369. epilogProcessor(XML_Parser parser, const char *s, const char *end,
  5370. const char **nextPtr) {
  5371. parser->m_processor = epilogProcessor;
  5372. parser->m_eventPtr = s;
  5373. for (;;) {
  5374. const char *next = NULL;
  5375. int tok = XmlPrologTok(parser->m_encoding, s, end, &next);
  5376. #if XML_GE == 1
  5377. if (! accountingDiffTolerated(parser, tok, s, next, __LINE__,
  5378. XML_ACCOUNT_DIRECT)) {
  5379. accountingOnAbort(parser);
  5380. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  5381. }
  5382. #endif
  5383. parser->m_eventEndPtr = next;
  5384. switch (tok) {
  5385. /* report partial linebreak - it might be the last token */
  5386. case -XML_TOK_PROLOG_S:
  5387. if (parser->m_defaultHandler) {
  5388. reportDefault(parser, parser->m_encoding, s, next);
  5389. if (parser->m_parsingStatus.parsing == XML_FINISHED)
  5390. return XML_ERROR_ABORTED;
  5391. }
  5392. *nextPtr = next;
  5393. return XML_ERROR_NONE;
  5394. case XML_TOK_NONE:
  5395. *nextPtr = s;
  5396. return XML_ERROR_NONE;
  5397. case XML_TOK_PROLOG_S:
  5398. if (parser->m_defaultHandler)
  5399. reportDefault(parser, parser->m_encoding, s, next);
  5400. break;
  5401. case XML_TOK_PI:
  5402. if (! reportProcessingInstruction(parser, parser->m_encoding, s, next))
  5403. return XML_ERROR_NO_MEMORY;
  5404. break;
  5405. case XML_TOK_COMMENT:
  5406. if (! reportComment(parser, parser->m_encoding, s, next))
  5407. return XML_ERROR_NO_MEMORY;
  5408. break;
  5409. case XML_TOK_INVALID:
  5410. parser->m_eventPtr = next;
  5411. return XML_ERROR_INVALID_TOKEN;
  5412. case XML_TOK_PARTIAL:
  5413. if (! parser->m_parsingStatus.finalBuffer) {
  5414. *nextPtr = s;
  5415. return XML_ERROR_NONE;
  5416. }
  5417. return XML_ERROR_UNCLOSED_TOKEN;
  5418. case XML_TOK_PARTIAL_CHAR:
  5419. if (! parser->m_parsingStatus.finalBuffer) {
  5420. *nextPtr = s;
  5421. return XML_ERROR_NONE;
  5422. }
  5423. return XML_ERROR_PARTIAL_CHAR;
  5424. default:
  5425. return XML_ERROR_JUNK_AFTER_DOC_ELEMENT;
  5426. }
  5427. parser->m_eventPtr = s = next;
  5428. switch (parser->m_parsingStatus.parsing) {
  5429. case XML_SUSPENDED:
  5430. *nextPtr = next;
  5431. return XML_ERROR_NONE;
  5432. case XML_FINISHED:
  5433. return XML_ERROR_ABORTED;
  5434. default:;
  5435. }
  5436. }
  5437. }
  5438. static enum XML_Error
  5439. processInternalEntity(XML_Parser parser, ENTITY *entity, XML_Bool betweenDecl) {
  5440. const char *textStart, *textEnd;
  5441. const char *next;
  5442. enum XML_Error result;
  5443. OPEN_INTERNAL_ENTITY *openEntity;
  5444. if (parser->m_freeInternalEntities) {
  5445. openEntity = parser->m_freeInternalEntities;
  5446. parser->m_freeInternalEntities = openEntity->next;
  5447. } else {
  5448. openEntity
  5449. = (OPEN_INTERNAL_ENTITY *)MALLOC(parser, sizeof(OPEN_INTERNAL_ENTITY));
  5450. if (! openEntity)
  5451. return XML_ERROR_NO_MEMORY;
  5452. }
  5453. entity->open = XML_TRUE;
  5454. #if XML_GE == 1
  5455. entityTrackingOnOpen(parser, entity, __LINE__);
  5456. #endif
  5457. entity->processed = 0;
  5458. openEntity->next = parser->m_openInternalEntities;
  5459. parser->m_openInternalEntities = openEntity;
  5460. openEntity->entity = entity;
  5461. openEntity->startTagLevel = parser->m_tagLevel;
  5462. openEntity->betweenDecl = betweenDecl;
  5463. openEntity->internalEventPtr = NULL;
  5464. openEntity->internalEventEndPtr = NULL;
  5465. textStart = (const char *)entity->textPtr;
  5466. textEnd = (const char *)(entity->textPtr + entity->textLen);
  5467. /* Set a safe default value in case 'next' does not get set */
  5468. next = textStart;
  5469. if (entity->is_param) {
  5470. int tok
  5471. = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);
  5472. result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,
  5473. tok, next, &next, XML_FALSE, XML_FALSE,
  5474. XML_ACCOUNT_ENTITY_EXPANSION);
  5475. } else {
  5476. result = doContent(parser, parser->m_tagLevel, parser->m_internalEncoding,
  5477. textStart, textEnd, &next, XML_FALSE,
  5478. XML_ACCOUNT_ENTITY_EXPANSION);
  5479. }
  5480. if (result == XML_ERROR_NONE) {
  5481. if (textEnd != next && parser->m_parsingStatus.parsing == XML_SUSPENDED) {
  5482. entity->processed = (int)(next - textStart);
  5483. parser->m_processor = internalEntityProcessor;
  5484. } else if (parser->m_openInternalEntities->entity == entity) {
  5485. #if XML_GE == 1
  5486. entityTrackingOnClose(parser, entity, __LINE__);
  5487. #endif /* XML_GE == 1 */
  5488. entity->open = XML_FALSE;
  5489. parser->m_openInternalEntities = openEntity->next;
  5490. /* put openEntity back in list of free instances */
  5491. openEntity->next = parser->m_freeInternalEntities;
  5492. parser->m_freeInternalEntities = openEntity;
  5493. }
  5494. }
  5495. return result;
  5496. }
  5497. static enum XML_Error PTRCALL
  5498. internalEntityProcessor(XML_Parser parser, const char *s, const char *end,
  5499. const char **nextPtr) {
  5500. ENTITY *entity;
  5501. const char *textStart, *textEnd;
  5502. const char *next;
  5503. enum XML_Error result;
  5504. OPEN_INTERNAL_ENTITY *openEntity = parser->m_openInternalEntities;
  5505. if (! openEntity)
  5506. return XML_ERROR_UNEXPECTED_STATE;
  5507. entity = openEntity->entity;
  5508. textStart = ((const char *)entity->textPtr) + entity->processed;
  5509. textEnd = (const char *)(entity->textPtr + entity->textLen);
  5510. /* Set a safe default value in case 'next' does not get set */
  5511. next = textStart;
  5512. if (entity->is_param) {
  5513. int tok
  5514. = XmlPrologTok(parser->m_internalEncoding, textStart, textEnd, &next);
  5515. result = doProlog(parser, parser->m_internalEncoding, textStart, textEnd,
  5516. tok, next, &next, XML_FALSE, XML_TRUE,
  5517. XML_ACCOUNT_ENTITY_EXPANSION);
  5518. } else {
  5519. result = doContent(parser, openEntity->startTagLevel,
  5520. parser->m_internalEncoding, textStart, textEnd, &next,
  5521. XML_FALSE, XML_ACCOUNT_ENTITY_EXPANSION);
  5522. }
  5523. if (result != XML_ERROR_NONE)
  5524. return result;
  5525. if (textEnd != next && parser->m_parsingStatus.parsing == XML_SUSPENDED) {
  5526. entity->processed = (int)(next - (const char *)entity->textPtr);
  5527. return result;
  5528. }
  5529. #if XML_GE == 1
  5530. entityTrackingOnClose(parser, entity, __LINE__);
  5531. #endif
  5532. entity->open = XML_FALSE;
  5533. parser->m_openInternalEntities = openEntity->next;
  5534. /* put openEntity back in list of free instances */
  5535. openEntity->next = parser->m_freeInternalEntities;
  5536. parser->m_freeInternalEntities = openEntity;
  5537. // If there are more open entities we want to stop right here and have the
  5538. // upcoming call to XML_ResumeParser continue with entity content, or it would
  5539. // be ignored altogether.
  5540. if (parser->m_openInternalEntities != NULL
  5541. && parser->m_parsingStatus.parsing == XML_SUSPENDED) {
  5542. return XML_ERROR_NONE;
  5543. }
  5544. if (entity->is_param) {
  5545. int tok;
  5546. parser->m_processor = prologProcessor;
  5547. tok = XmlPrologTok(parser->m_encoding, s, end, &next);
  5548. return doProlog(parser, parser->m_encoding, s, end, tok, next, nextPtr,
  5549. (XML_Bool)! parser->m_parsingStatus.finalBuffer, XML_TRUE,
  5550. XML_ACCOUNT_DIRECT);
  5551. } else {
  5552. parser->m_processor = contentProcessor;
  5553. /* see externalEntityContentProcessor vs contentProcessor */
  5554. result = doContent(parser, parser->m_parentParser ? 1 : 0,
  5555. parser->m_encoding, s, end, nextPtr,
  5556. (XML_Bool)! parser->m_parsingStatus.finalBuffer,
  5557. XML_ACCOUNT_DIRECT);
  5558. if (result == XML_ERROR_NONE) {
  5559. if (! storeRawNames(parser))
  5560. return XML_ERROR_NO_MEMORY;
  5561. }
  5562. return result;
  5563. }
  5564. }
  5565. static enum XML_Error PTRCALL
  5566. errorProcessor(XML_Parser parser, const char *s, const char *end,
  5567. const char **nextPtr) {
  5568. UNUSED_P(s);
  5569. UNUSED_P(end);
  5570. UNUSED_P(nextPtr);
  5571. return parser->m_errorCode;
  5572. }
  5573. static enum XML_Error
  5574. storeAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,
  5575. const char *ptr, const char *end, STRING_POOL *pool,
  5576. enum XML_Account account) {
  5577. enum XML_Error result
  5578. = appendAttributeValue(parser, enc, isCdata, ptr, end, pool, account);
  5579. if (result)
  5580. return result;
  5581. if (! isCdata && poolLength(pool) && poolLastChar(pool) == 0x20)
  5582. poolChop(pool);
  5583. if (! poolAppendChar(pool, XML_T('\0')))
  5584. return XML_ERROR_NO_MEMORY;
  5585. return XML_ERROR_NONE;
  5586. }
  5587. static enum XML_Error
  5588. appendAttributeValue(XML_Parser parser, const ENCODING *enc, XML_Bool isCdata,
  5589. const char *ptr, const char *end, STRING_POOL *pool,
  5590. enum XML_Account account) {
  5591. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  5592. #ifndef XML_DTD
  5593. UNUSED_P(account);
  5594. #endif
  5595. for (;;) {
  5596. const char *next
  5597. = ptr; /* XmlAttributeValueTok doesn't always set the last arg */
  5598. int tok = XmlAttributeValueTok(enc, ptr, end, &next);
  5599. #if XML_GE == 1
  5600. if (! accountingDiffTolerated(parser, tok, ptr, next, __LINE__, account)) {
  5601. accountingOnAbort(parser);
  5602. return XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  5603. }
  5604. #endif
  5605. switch (tok) {
  5606. case XML_TOK_NONE:
  5607. return XML_ERROR_NONE;
  5608. case XML_TOK_INVALID:
  5609. if (enc == parser->m_encoding)
  5610. parser->m_eventPtr = next;
  5611. return XML_ERROR_INVALID_TOKEN;
  5612. case XML_TOK_PARTIAL:
  5613. if (enc == parser->m_encoding)
  5614. parser->m_eventPtr = ptr;
  5615. return XML_ERROR_INVALID_TOKEN;
  5616. case XML_TOK_CHAR_REF: {
  5617. XML_Char buf[XML_ENCODE_MAX];
  5618. int i;
  5619. int n = XmlCharRefNumber(enc, ptr);
  5620. if (n < 0) {
  5621. if (enc == parser->m_encoding)
  5622. parser->m_eventPtr = ptr;
  5623. return XML_ERROR_BAD_CHAR_REF;
  5624. }
  5625. if (! isCdata && n == 0x20 /* space */
  5626. && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))
  5627. break;
  5628. n = XmlEncode(n, (ICHAR *)buf);
  5629. /* The XmlEncode() functions can never return 0 here. That
  5630. * error return happens if the code point passed in is either
  5631. * negative or greater than or equal to 0x110000. The
  5632. * XmlCharRefNumber() functions will all return a number
  5633. * strictly less than 0x110000 or a negative value if an error
  5634. * occurred. The negative value is intercepted above, so
  5635. * XmlEncode() is never passed a value it might return an
  5636. * error for.
  5637. */
  5638. for (i = 0; i < n; i++) {
  5639. if (! poolAppendChar(pool, buf[i]))
  5640. return XML_ERROR_NO_MEMORY;
  5641. }
  5642. } break;
  5643. case XML_TOK_DATA_CHARS:
  5644. if (! poolAppend(pool, enc, ptr, next))
  5645. return XML_ERROR_NO_MEMORY;
  5646. break;
  5647. case XML_TOK_TRAILING_CR:
  5648. next = ptr + enc->minBytesPerChar;
  5649. /* fall through */
  5650. case XML_TOK_ATTRIBUTE_VALUE_S:
  5651. case XML_TOK_DATA_NEWLINE:
  5652. if (! isCdata && (poolLength(pool) == 0 || poolLastChar(pool) == 0x20))
  5653. break;
  5654. if (! poolAppendChar(pool, 0x20))
  5655. return XML_ERROR_NO_MEMORY;
  5656. break;
  5657. case XML_TOK_ENTITY_REF: {
  5658. const XML_Char *name;
  5659. ENTITY *entity;
  5660. char checkEntityDecl;
  5661. XML_Char ch = (XML_Char)XmlPredefinedEntityName(
  5662. enc, ptr + enc->minBytesPerChar, next - enc->minBytesPerChar);
  5663. if (ch) {
  5664. #if XML_GE == 1
  5665. /* NOTE: We are replacing 4-6 characters original input for 1 character
  5666. * so there is no amplification and hence recording without
  5667. * protection. */
  5668. accountingDiffTolerated(parser, tok, (char *)&ch,
  5669. ((char *)&ch) + sizeof(XML_Char), __LINE__,
  5670. XML_ACCOUNT_ENTITY_EXPANSION);
  5671. #endif /* XML_GE == 1 */
  5672. if (! poolAppendChar(pool, ch))
  5673. return XML_ERROR_NO_MEMORY;
  5674. break;
  5675. }
  5676. name = poolStoreString(&parser->m_temp2Pool, enc,
  5677. ptr + enc->minBytesPerChar,
  5678. next - enc->minBytesPerChar);
  5679. if (! name)
  5680. return XML_ERROR_NO_MEMORY;
  5681. entity = (ENTITY *)lookup(parser, &dtd->generalEntities, name, 0);
  5682. poolDiscard(&parser->m_temp2Pool);
  5683. /* First, determine if a check for an existing declaration is needed;
  5684. if yes, check that the entity exists, and that it is internal.
  5685. */
  5686. if (pool == &dtd->pool) /* are we called from prolog? */
  5687. checkEntityDecl =
  5688. #ifdef XML_DTD
  5689. parser->m_prologState.documentEntity &&
  5690. #endif /* XML_DTD */
  5691. (dtd->standalone ? ! parser->m_openInternalEntities
  5692. : ! dtd->hasParamEntityRefs);
  5693. else /* if (pool == &parser->m_tempPool): we are called from content */
  5694. checkEntityDecl = ! dtd->hasParamEntityRefs || dtd->standalone;
  5695. if (checkEntityDecl) {
  5696. if (! entity)
  5697. return XML_ERROR_UNDEFINED_ENTITY;
  5698. else if (! entity->is_internal)
  5699. return XML_ERROR_ENTITY_DECLARED_IN_PE;
  5700. } else if (! entity) {
  5701. /* Cannot report skipped entity here - see comments on
  5702. parser->m_skippedEntityHandler.
  5703. if (parser->m_skippedEntityHandler)
  5704. parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);
  5705. */
  5706. /* Cannot call the default handler because this would be
  5707. out of sync with the call to the startElementHandler.
  5708. if ((pool == &parser->m_tempPool) && parser->m_defaultHandler)
  5709. reportDefault(parser, enc, ptr, next);
  5710. */
  5711. break;
  5712. }
  5713. if (entity->open) {
  5714. if (enc == parser->m_encoding) {
  5715. /* It does not appear that this line can be executed.
  5716. *
  5717. * The "if (entity->open)" check catches recursive entity
  5718. * definitions. In order to be called with an open
  5719. * entity, it must have gone through this code before and
  5720. * been through the recursive call to
  5721. * appendAttributeValue() some lines below. That call
  5722. * sets the local encoding ("enc") to the parser's
  5723. * internal encoding (internal_utf8 or internal_utf16),
  5724. * which can never be the same as the principle encoding.
  5725. * It doesn't appear there is another code path that gets
  5726. * here with entity->open being TRUE.
  5727. *
  5728. * Since it is not certain that this logic is watertight,
  5729. * we keep the line and merely exclude it from coverage
  5730. * tests.
  5731. */
  5732. parser->m_eventPtr = ptr; /* LCOV_EXCL_LINE */
  5733. }
  5734. return XML_ERROR_RECURSIVE_ENTITY_REF;
  5735. }
  5736. if (entity->notation) {
  5737. if (enc == parser->m_encoding)
  5738. parser->m_eventPtr = ptr;
  5739. return XML_ERROR_BINARY_ENTITY_REF;
  5740. }
  5741. if (! entity->textPtr) {
  5742. if (enc == parser->m_encoding)
  5743. parser->m_eventPtr = ptr;
  5744. return XML_ERROR_ATTRIBUTE_EXTERNAL_ENTITY_REF;
  5745. } else {
  5746. enum XML_Error result;
  5747. const XML_Char *textEnd = entity->textPtr + entity->textLen;
  5748. entity->open = XML_TRUE;
  5749. #if XML_GE == 1
  5750. entityTrackingOnOpen(parser, entity, __LINE__);
  5751. #endif
  5752. result = appendAttributeValue(parser, parser->m_internalEncoding,
  5753. isCdata, (const char *)entity->textPtr,
  5754. (const char *)textEnd, pool,
  5755. XML_ACCOUNT_ENTITY_EXPANSION);
  5756. #if XML_GE == 1
  5757. entityTrackingOnClose(parser, entity, __LINE__);
  5758. #endif
  5759. entity->open = XML_FALSE;
  5760. if (result)
  5761. return result;
  5762. }
  5763. } break;
  5764. default:
  5765. /* The only token returned by XmlAttributeValueTok() that does
  5766. * not have an explicit case here is XML_TOK_PARTIAL_CHAR.
  5767. * Getting that would require an entity name to contain an
  5768. * incomplete XML character (e.g. \xE2\x82); however previous
  5769. * tokenisers will have already recognised and rejected such
  5770. * names before XmlAttributeValueTok() gets a look-in. This
  5771. * default case should be retained as a safety net, but the code
  5772. * excluded from coverage tests.
  5773. *
  5774. * LCOV_EXCL_START
  5775. */
  5776. if (enc == parser->m_encoding)
  5777. parser->m_eventPtr = ptr;
  5778. return XML_ERROR_UNEXPECTED_STATE;
  5779. /* LCOV_EXCL_STOP */
  5780. }
  5781. ptr = next;
  5782. }
  5783. /* not reached */
  5784. }
  5785. #if XML_GE == 1
  5786. static enum XML_Error
  5787. storeEntityValue(XML_Parser parser, const ENCODING *enc,
  5788. const char *entityTextPtr, const char *entityTextEnd,
  5789. enum XML_Account account) {
  5790. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  5791. STRING_POOL *pool = &(dtd->entityValuePool);
  5792. enum XML_Error result = XML_ERROR_NONE;
  5793. # ifdef XML_DTD
  5794. int oldInEntityValue = parser->m_prologState.inEntityValue;
  5795. parser->m_prologState.inEntityValue = 1;
  5796. # else
  5797. UNUSED_P(account);
  5798. # endif /* XML_DTD */
  5799. /* never return Null for the value argument in EntityDeclHandler,
  5800. since this would indicate an external entity; therefore we
  5801. have to make sure that entityValuePool.start is not null */
  5802. if (! pool->blocks) {
  5803. if (! poolGrow(pool))
  5804. return XML_ERROR_NO_MEMORY;
  5805. }
  5806. for (;;) {
  5807. const char *next
  5808. = entityTextPtr; /* XmlEntityValueTok doesn't always set the last arg */
  5809. int tok = XmlEntityValueTok(enc, entityTextPtr, entityTextEnd, &next);
  5810. if (! accountingDiffTolerated(parser, tok, entityTextPtr, next, __LINE__,
  5811. account)) {
  5812. accountingOnAbort(parser);
  5813. result = XML_ERROR_AMPLIFICATION_LIMIT_BREACH;
  5814. goto endEntityValue;
  5815. }
  5816. switch (tok) {
  5817. case XML_TOK_PARAM_ENTITY_REF:
  5818. # ifdef XML_DTD
  5819. if (parser->m_isParamEntity || enc != parser->m_encoding) {
  5820. const XML_Char *name;
  5821. ENTITY *entity;
  5822. name = poolStoreString(&parser->m_tempPool, enc,
  5823. entityTextPtr + enc->minBytesPerChar,
  5824. next - enc->minBytesPerChar);
  5825. if (! name) {
  5826. result = XML_ERROR_NO_MEMORY;
  5827. goto endEntityValue;
  5828. }
  5829. entity = (ENTITY *)lookup(parser, &dtd->paramEntities, name, 0);
  5830. poolDiscard(&parser->m_tempPool);
  5831. if (! entity) {
  5832. /* not a well-formedness error - see XML 1.0: WFC Entity Declared */
  5833. /* cannot report skipped entity here - see comments on
  5834. parser->m_skippedEntityHandler
  5835. if (parser->m_skippedEntityHandler)
  5836. parser->m_skippedEntityHandler(parser->m_handlerArg, name, 0);
  5837. */
  5838. dtd->keepProcessing = dtd->standalone;
  5839. goto endEntityValue;
  5840. }
  5841. if (entity->open || (entity == parser->m_declEntity)) {
  5842. if (enc == parser->m_encoding)
  5843. parser->m_eventPtr = entityTextPtr;
  5844. result = XML_ERROR_RECURSIVE_ENTITY_REF;
  5845. goto endEntityValue;
  5846. }
  5847. if (entity->systemId) {
  5848. if (parser->m_externalEntityRefHandler) {
  5849. dtd->paramEntityRead = XML_FALSE;
  5850. entity->open = XML_TRUE;
  5851. entityTrackingOnOpen(parser, entity, __LINE__);
  5852. if (! parser->m_externalEntityRefHandler(
  5853. parser->m_externalEntityRefHandlerArg, 0, entity->base,
  5854. entity->systemId, entity->publicId)) {
  5855. entityTrackingOnClose(parser, entity, __LINE__);
  5856. entity->open = XML_FALSE;
  5857. result = XML_ERROR_EXTERNAL_ENTITY_HANDLING;
  5858. goto endEntityValue;
  5859. }
  5860. entityTrackingOnClose(parser, entity, __LINE__);
  5861. entity->open = XML_FALSE;
  5862. if (! dtd->paramEntityRead)
  5863. dtd->keepProcessing = dtd->standalone;
  5864. } else
  5865. dtd->keepProcessing = dtd->standalone;
  5866. } else {
  5867. entity->open = XML_TRUE;
  5868. entityTrackingOnOpen(parser, entity, __LINE__);
  5869. result = storeEntityValue(
  5870. parser, parser->m_internalEncoding, (const char *)entity->textPtr,
  5871. (const char *)(entity->textPtr + entity->textLen),
  5872. XML_ACCOUNT_ENTITY_EXPANSION);
  5873. entityTrackingOnClose(parser, entity, __LINE__);
  5874. entity->open = XML_FALSE;
  5875. if (result)
  5876. goto endEntityValue;
  5877. }
  5878. break;
  5879. }
  5880. # endif /* XML_DTD */
  5881. /* In the internal subset, PE references are not legal
  5882. within markup declarations, e.g entity values in this case. */
  5883. parser->m_eventPtr = entityTextPtr;
  5884. result = XML_ERROR_PARAM_ENTITY_REF;
  5885. goto endEntityValue;
  5886. case XML_TOK_NONE:
  5887. result = XML_ERROR_NONE;
  5888. goto endEntityValue;
  5889. case XML_TOK_ENTITY_REF:
  5890. case XML_TOK_DATA_CHARS:
  5891. if (! poolAppend(pool, enc, entityTextPtr, next)) {
  5892. result = XML_ERROR_NO_MEMORY;
  5893. goto endEntityValue;
  5894. }
  5895. break;
  5896. case XML_TOK_TRAILING_CR:
  5897. next = entityTextPtr + enc->minBytesPerChar;
  5898. /* fall through */
  5899. case XML_TOK_DATA_NEWLINE:
  5900. if (pool->end == pool->ptr && ! poolGrow(pool)) {
  5901. result = XML_ERROR_NO_MEMORY;
  5902. goto endEntityValue;
  5903. }
  5904. *(pool->ptr)++ = 0xA;
  5905. break;
  5906. case XML_TOK_CHAR_REF: {
  5907. XML_Char buf[XML_ENCODE_MAX];
  5908. int i;
  5909. int n = XmlCharRefNumber(enc, entityTextPtr);
  5910. if (n < 0) {
  5911. if (enc == parser->m_encoding)
  5912. parser->m_eventPtr = entityTextPtr;
  5913. result = XML_ERROR_BAD_CHAR_REF;
  5914. goto endEntityValue;
  5915. }
  5916. n = XmlEncode(n, (ICHAR *)buf);
  5917. /* The XmlEncode() functions can never return 0 here. That
  5918. * error return happens if the code point passed in is either
  5919. * negative or greater than or equal to 0x110000. The
  5920. * XmlCharRefNumber() functions will all return a number
  5921. * strictly less than 0x110000 or a negative value if an error
  5922. * occurred. The negative value is intercepted above, so
  5923. * XmlEncode() is never passed a value it might return an
  5924. * error for.
  5925. */
  5926. for (i = 0; i < n; i++) {
  5927. if (pool->end == pool->ptr && ! poolGrow(pool)) {
  5928. result = XML_ERROR_NO_MEMORY;
  5929. goto endEntityValue;
  5930. }
  5931. *(pool->ptr)++ = buf[i];
  5932. }
  5933. } break;
  5934. case XML_TOK_PARTIAL:
  5935. if (enc == parser->m_encoding)
  5936. parser->m_eventPtr = entityTextPtr;
  5937. result = XML_ERROR_INVALID_TOKEN;
  5938. goto endEntityValue;
  5939. case XML_TOK_INVALID:
  5940. if (enc == parser->m_encoding)
  5941. parser->m_eventPtr = next;
  5942. result = XML_ERROR_INVALID_TOKEN;
  5943. goto endEntityValue;
  5944. default:
  5945. /* This default case should be unnecessary -- all the tokens
  5946. * that XmlEntityValueTok() can return have their own explicit
  5947. * cases -- but should be retained for safety. We do however
  5948. * exclude it from the coverage statistics.
  5949. *
  5950. * LCOV_EXCL_START
  5951. */
  5952. if (enc == parser->m_encoding)
  5953. parser->m_eventPtr = entityTextPtr;
  5954. result = XML_ERROR_UNEXPECTED_STATE;
  5955. goto endEntityValue;
  5956. /* LCOV_EXCL_STOP */
  5957. }
  5958. entityTextPtr = next;
  5959. }
  5960. endEntityValue:
  5961. # ifdef XML_DTD
  5962. parser->m_prologState.inEntityValue = oldInEntityValue;
  5963. # endif /* XML_DTD */
  5964. return result;
  5965. }
  5966. #else /* XML_GE == 0 */
  5967. static enum XML_Error
  5968. storeSelfEntityValue(XML_Parser parser, ENTITY *entity) {
  5969. // This will store "&amp;entity123;" in entity->textPtr
  5970. // to end up as "&entity123;" in the handler.
  5971. const char *const entity_start = "&amp;";
  5972. const char *const entity_end = ";";
  5973. STRING_POOL *const pool = &(parser->m_dtd->entityValuePool);
  5974. if (! poolAppendString(pool, entity_start)
  5975. || ! poolAppendString(pool, entity->name)
  5976. || ! poolAppendString(pool, entity_end)) {
  5977. poolDiscard(pool);
  5978. return XML_ERROR_NO_MEMORY;
  5979. }
  5980. entity->textPtr = poolStart(pool);
  5981. entity->textLen = (int)(poolLength(pool));
  5982. poolFinish(pool);
  5983. return XML_ERROR_NONE;
  5984. }
  5985. #endif /* XML_GE == 0 */
  5986. static void FASTCALL
  5987. normalizeLines(XML_Char *s) {
  5988. XML_Char *p;
  5989. for (;; s++) {
  5990. if (*s == XML_T('\0'))
  5991. return;
  5992. if (*s == 0xD)
  5993. break;
  5994. }
  5995. p = s;
  5996. do {
  5997. if (*s == 0xD) {
  5998. *p++ = 0xA;
  5999. if (*++s == 0xA)
  6000. s++;
  6001. } else
  6002. *p++ = *s++;
  6003. } while (*s);
  6004. *p = XML_T('\0');
  6005. }
  6006. static int
  6007. reportProcessingInstruction(XML_Parser parser, const ENCODING *enc,
  6008. const char *start, const char *end) {
  6009. const XML_Char *target;
  6010. XML_Char *data;
  6011. const char *tem;
  6012. if (! parser->m_processingInstructionHandler) {
  6013. if (parser->m_defaultHandler)
  6014. reportDefault(parser, enc, start, end);
  6015. return 1;
  6016. }
  6017. start += enc->minBytesPerChar * 2;
  6018. tem = start + XmlNameLength(enc, start);
  6019. target = poolStoreString(&parser->m_tempPool, enc, start, tem);
  6020. if (! target)
  6021. return 0;
  6022. poolFinish(&parser->m_tempPool);
  6023. data = poolStoreString(&parser->m_tempPool, enc, XmlSkipS(enc, tem),
  6024. end - enc->minBytesPerChar * 2);
  6025. if (! data)
  6026. return 0;
  6027. normalizeLines(data);
  6028. parser->m_processingInstructionHandler(parser->m_handlerArg, target, data);
  6029. poolClear(&parser->m_tempPool);
  6030. return 1;
  6031. }
  6032. static int
  6033. reportComment(XML_Parser parser, const ENCODING *enc, const char *start,
  6034. const char *end) {
  6035. XML_Char *data;
  6036. if (! parser->m_commentHandler) {
  6037. if (parser->m_defaultHandler)
  6038. reportDefault(parser, enc, start, end);
  6039. return 1;
  6040. }
  6041. data = poolStoreString(&parser->m_tempPool, enc,
  6042. start + enc->minBytesPerChar * 4,
  6043. end - enc->minBytesPerChar * 3);
  6044. if (! data)
  6045. return 0;
  6046. normalizeLines(data);
  6047. parser->m_commentHandler(parser->m_handlerArg, data);
  6048. poolClear(&parser->m_tempPool);
  6049. return 1;
  6050. }
  6051. static void
  6052. reportDefault(XML_Parser parser, const ENCODING *enc, const char *s,
  6053. const char *end) {
  6054. if (MUST_CONVERT(enc, s)) {
  6055. enum XML_Convert_Result convert_res;
  6056. const char **eventPP;
  6057. const char **eventEndPP;
  6058. if (enc == parser->m_encoding) {
  6059. eventPP = &parser->m_eventPtr;
  6060. eventEndPP = &parser->m_eventEndPtr;
  6061. } else {
  6062. /* To get here, two things must be true; the parser must be
  6063. * using a character encoding that is not the same as the
  6064. * encoding passed in, and the encoding passed in must need
  6065. * conversion to the internal format (UTF-8 unless XML_UNICODE
  6066. * is defined). The only occasions on which the encoding passed
  6067. * in is not the same as the parser's encoding are when it is
  6068. * the internal encoding (e.g. a previously defined parameter
  6069. * entity, already converted to internal format). This by
  6070. * definition doesn't need conversion, so the whole branch never
  6071. * gets executed.
  6072. *
  6073. * For safety's sake we don't delete these lines and merely
  6074. * exclude them from coverage statistics.
  6075. *
  6076. * LCOV_EXCL_START
  6077. */
  6078. eventPP = &(parser->m_openInternalEntities->internalEventPtr);
  6079. eventEndPP = &(parser->m_openInternalEntities->internalEventEndPtr);
  6080. /* LCOV_EXCL_STOP */
  6081. }
  6082. do {
  6083. ICHAR *dataPtr = (ICHAR *)parser->m_dataBuf;
  6084. convert_res
  6085. = XmlConvert(enc, &s, end, &dataPtr, (ICHAR *)parser->m_dataBufEnd);
  6086. *eventEndPP = s;
  6087. parser->m_defaultHandler(parser->m_handlerArg, parser->m_dataBuf,
  6088. (int)(dataPtr - (ICHAR *)parser->m_dataBuf));
  6089. *eventPP = s;
  6090. } while ((convert_res != XML_CONVERT_COMPLETED)
  6091. && (convert_res != XML_CONVERT_INPUT_INCOMPLETE));
  6092. } else
  6093. parser->m_defaultHandler(
  6094. parser->m_handlerArg, (const XML_Char *)s,
  6095. (int)((const XML_Char *)end - (const XML_Char *)s));
  6096. }
  6097. static int
  6098. defineAttribute(ELEMENT_TYPE *type, ATTRIBUTE_ID *attId, XML_Bool isCdata,
  6099. XML_Bool isId, const XML_Char *value, XML_Parser parser) {
  6100. DEFAULT_ATTRIBUTE *att;
  6101. if (value || isId) {
  6102. /* The handling of default attributes gets messed up if we have
  6103. a default which duplicates a non-default. */
  6104. int i;
  6105. for (i = 0; i < type->nDefaultAtts; i++)
  6106. if (attId == type->defaultAtts[i].id)
  6107. return 1;
  6108. if (isId && ! type->idAtt && ! attId->xmlns)
  6109. type->idAtt = attId;
  6110. }
  6111. if (type->nDefaultAtts == type->allocDefaultAtts) {
  6112. if (type->allocDefaultAtts == 0) {
  6113. type->allocDefaultAtts = 8;
  6114. type->defaultAtts = (DEFAULT_ATTRIBUTE *)MALLOC(
  6115. parser, type->allocDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));
  6116. if (! type->defaultAtts) {
  6117. type->allocDefaultAtts = 0;
  6118. return 0;
  6119. }
  6120. } else {
  6121. DEFAULT_ATTRIBUTE *temp;
  6122. /* Detect and prevent integer overflow */
  6123. if (type->allocDefaultAtts > INT_MAX / 2) {
  6124. return 0;
  6125. }
  6126. int count = type->allocDefaultAtts * 2;
  6127. /* Detect and prevent integer overflow.
  6128. * The preprocessor guard addresses the "always false" warning
  6129. * from -Wtype-limits on platforms where
  6130. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  6131. #if UINT_MAX >= SIZE_MAX
  6132. if ((unsigned)count > (size_t)(-1) / sizeof(DEFAULT_ATTRIBUTE)) {
  6133. return 0;
  6134. }
  6135. #endif
  6136. temp = (DEFAULT_ATTRIBUTE *)REALLOC(parser, type->defaultAtts,
  6137. (count * sizeof(DEFAULT_ATTRIBUTE)));
  6138. if (temp == NULL)
  6139. return 0;
  6140. type->allocDefaultAtts = count;
  6141. type->defaultAtts = temp;
  6142. }
  6143. }
  6144. att = type->defaultAtts + type->nDefaultAtts;
  6145. att->id = attId;
  6146. att->value = value;
  6147. att->isCdata = isCdata;
  6148. if (! isCdata)
  6149. attId->maybeTokenized = XML_TRUE;
  6150. type->nDefaultAtts += 1;
  6151. return 1;
  6152. }
  6153. static int
  6154. setElementTypePrefix(XML_Parser parser, ELEMENT_TYPE *elementType) {
  6155. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  6156. const XML_Char *name;
  6157. for (name = elementType->name; *name; name++) {
  6158. if (*name == XML_T(ASCII_COLON)) {
  6159. PREFIX *prefix;
  6160. const XML_Char *s;
  6161. for (s = elementType->name; s != name; s++) {
  6162. if (! poolAppendChar(&dtd->pool, *s))
  6163. return 0;
  6164. }
  6165. if (! poolAppendChar(&dtd->pool, XML_T('\0')))
  6166. return 0;
  6167. prefix = (PREFIX *)lookup(parser, &dtd->prefixes, poolStart(&dtd->pool),
  6168. sizeof(PREFIX));
  6169. if (! prefix)
  6170. return 0;
  6171. if (prefix->name == poolStart(&dtd->pool))
  6172. poolFinish(&dtd->pool);
  6173. else
  6174. poolDiscard(&dtd->pool);
  6175. elementType->prefix = prefix;
  6176. break;
  6177. }
  6178. }
  6179. return 1;
  6180. }
  6181. static ATTRIBUTE_ID *
  6182. getAttributeId(XML_Parser parser, const ENCODING *enc, const char *start,
  6183. const char *end) {
  6184. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  6185. ATTRIBUTE_ID *id;
  6186. const XML_Char *name;
  6187. if (! poolAppendChar(&dtd->pool, XML_T('\0')))
  6188. return NULL;
  6189. name = poolStoreString(&dtd->pool, enc, start, end);
  6190. if (! name)
  6191. return NULL;
  6192. /* skip quotation mark - its storage will be reused (like in name[-1]) */
  6193. ++name;
  6194. id = (ATTRIBUTE_ID *)lookup(parser, &dtd->attributeIds, name,
  6195. sizeof(ATTRIBUTE_ID));
  6196. if (! id)
  6197. return NULL;
  6198. if (id->name != name)
  6199. poolDiscard(&dtd->pool);
  6200. else {
  6201. poolFinish(&dtd->pool);
  6202. if (! parser->m_ns)
  6203. ;
  6204. else if (name[0] == XML_T(ASCII_x) && name[1] == XML_T(ASCII_m)
  6205. && name[2] == XML_T(ASCII_l) && name[3] == XML_T(ASCII_n)
  6206. && name[4] == XML_T(ASCII_s)
  6207. && (name[5] == XML_T('\0') || name[5] == XML_T(ASCII_COLON))) {
  6208. if (name[5] == XML_T('\0'))
  6209. id->prefix = &dtd->defaultPrefix;
  6210. else
  6211. id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes, name + 6,
  6212. sizeof(PREFIX));
  6213. id->xmlns = XML_TRUE;
  6214. } else {
  6215. int i;
  6216. for (i = 0; name[i]; i++) {
  6217. /* attributes without prefix are *not* in the default namespace */
  6218. if (name[i] == XML_T(ASCII_COLON)) {
  6219. int j;
  6220. for (j = 0; j < i; j++) {
  6221. if (! poolAppendChar(&dtd->pool, name[j]))
  6222. return NULL;
  6223. }
  6224. if (! poolAppendChar(&dtd->pool, XML_T('\0')))
  6225. return NULL;
  6226. id->prefix = (PREFIX *)lookup(parser, &dtd->prefixes,
  6227. poolStart(&dtd->pool), sizeof(PREFIX));
  6228. if (! id->prefix)
  6229. return NULL;
  6230. if (id->prefix->name == poolStart(&dtd->pool))
  6231. poolFinish(&dtd->pool);
  6232. else
  6233. poolDiscard(&dtd->pool);
  6234. break;
  6235. }
  6236. }
  6237. }
  6238. }
  6239. return id;
  6240. }
  6241. #define CONTEXT_SEP XML_T(ASCII_FF)
  6242. static const XML_Char *
  6243. getContext(XML_Parser parser) {
  6244. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  6245. HASH_TABLE_ITER iter;
  6246. XML_Bool needSep = XML_FALSE;
  6247. if (dtd->defaultPrefix.binding) {
  6248. int i;
  6249. int len;
  6250. if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))
  6251. return NULL;
  6252. len = dtd->defaultPrefix.binding->uriLen;
  6253. if (parser->m_namespaceSeparator)
  6254. len--;
  6255. for (i = 0; i < len; i++) {
  6256. if (! poolAppendChar(&parser->m_tempPool,
  6257. dtd->defaultPrefix.binding->uri[i])) {
  6258. /* Because of memory caching, I don't believe this line can be
  6259. * executed.
  6260. *
  6261. * This is part of a loop copying the default prefix binding
  6262. * URI into the parser's temporary string pool. Previously,
  6263. * that URI was copied into the same string pool, with a
  6264. * terminating NUL character, as part of setContext(). When
  6265. * the pool was cleared, that leaves a block definitely big
  6266. * enough to hold the URI on the free block list of the pool.
  6267. * The URI copy in getContext() therefore cannot run out of
  6268. * memory.
  6269. *
  6270. * If the pool is used between the setContext() and
  6271. * getContext() calls, the worst it can do is leave a bigger
  6272. * block on the front of the free list. Given that this is
  6273. * all somewhat inobvious and program logic can be changed, we
  6274. * don't delete the line but we do exclude it from the test
  6275. * coverage statistics.
  6276. */
  6277. return NULL; /* LCOV_EXCL_LINE */
  6278. }
  6279. }
  6280. needSep = XML_TRUE;
  6281. }
  6282. hashTableIterInit(&iter, &(dtd->prefixes));
  6283. for (;;) {
  6284. int i;
  6285. int len;
  6286. const XML_Char *s;
  6287. PREFIX *prefix = (PREFIX *)hashTableIterNext(&iter);
  6288. if (! prefix)
  6289. break;
  6290. if (! prefix->binding) {
  6291. /* This test appears to be (justifiable) paranoia. There does
  6292. * not seem to be a way of injecting a prefix without a binding
  6293. * that doesn't get errored long before this function is called.
  6294. * The test should remain for safety's sake, so we instead
  6295. * exclude the following line from the coverage statistics.
  6296. */
  6297. continue; /* LCOV_EXCL_LINE */
  6298. }
  6299. if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))
  6300. return NULL;
  6301. for (s = prefix->name; *s; s++)
  6302. if (! poolAppendChar(&parser->m_tempPool, *s))
  6303. return NULL;
  6304. if (! poolAppendChar(&parser->m_tempPool, XML_T(ASCII_EQUALS)))
  6305. return NULL;
  6306. len = prefix->binding->uriLen;
  6307. if (parser->m_namespaceSeparator)
  6308. len--;
  6309. for (i = 0; i < len; i++)
  6310. if (! poolAppendChar(&parser->m_tempPool, prefix->binding->uri[i]))
  6311. return NULL;
  6312. needSep = XML_TRUE;
  6313. }
  6314. hashTableIterInit(&iter, &(dtd->generalEntities));
  6315. for (;;) {
  6316. const XML_Char *s;
  6317. ENTITY *e = (ENTITY *)hashTableIterNext(&iter);
  6318. if (! e)
  6319. break;
  6320. if (! e->open)
  6321. continue;
  6322. if (needSep && ! poolAppendChar(&parser->m_tempPool, CONTEXT_SEP))
  6323. return NULL;
  6324. for (s = e->name; *s; s++)
  6325. if (! poolAppendChar(&parser->m_tempPool, *s))
  6326. return 0;
  6327. needSep = XML_TRUE;
  6328. }
  6329. if (! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  6330. return NULL;
  6331. return parser->m_tempPool.start;
  6332. }
  6333. static XML_Bool
  6334. setContext(XML_Parser parser, const XML_Char *context) {
  6335. if (context == NULL) {
  6336. return XML_FALSE;
  6337. }
  6338. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  6339. const XML_Char *s = context;
  6340. while (*context != XML_T('\0')) {
  6341. if (*s == CONTEXT_SEP || *s == XML_T('\0')) {
  6342. ENTITY *e;
  6343. if (! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  6344. return XML_FALSE;
  6345. e = (ENTITY *)lookup(parser, &dtd->generalEntities,
  6346. poolStart(&parser->m_tempPool), 0);
  6347. if (e)
  6348. e->open = XML_TRUE;
  6349. if (*s != XML_T('\0'))
  6350. s++;
  6351. context = s;
  6352. poolDiscard(&parser->m_tempPool);
  6353. } else if (*s == XML_T(ASCII_EQUALS)) {
  6354. PREFIX *prefix;
  6355. if (poolLength(&parser->m_tempPool) == 0)
  6356. prefix = &dtd->defaultPrefix;
  6357. else {
  6358. if (! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  6359. return XML_FALSE;
  6360. prefix
  6361. = (PREFIX *)lookup(parser, &dtd->prefixes,
  6362. poolStart(&parser->m_tempPool), sizeof(PREFIX));
  6363. if (! prefix)
  6364. return XML_FALSE;
  6365. if (prefix->name == poolStart(&parser->m_tempPool)) {
  6366. prefix->name = poolCopyString(&dtd->pool, prefix->name);
  6367. if (! prefix->name)
  6368. return XML_FALSE;
  6369. }
  6370. poolDiscard(&parser->m_tempPool);
  6371. }
  6372. for (context = s + 1; *context != CONTEXT_SEP && *context != XML_T('\0');
  6373. context++)
  6374. if (! poolAppendChar(&parser->m_tempPool, *context))
  6375. return XML_FALSE;
  6376. if (! poolAppendChar(&parser->m_tempPool, XML_T('\0')))
  6377. return XML_FALSE;
  6378. if (addBinding(parser, prefix, NULL, poolStart(&parser->m_tempPool),
  6379. &parser->m_inheritedBindings)
  6380. != XML_ERROR_NONE)
  6381. return XML_FALSE;
  6382. poolDiscard(&parser->m_tempPool);
  6383. if (*context != XML_T('\0'))
  6384. ++context;
  6385. s = context;
  6386. } else {
  6387. if (! poolAppendChar(&parser->m_tempPool, *s))
  6388. return XML_FALSE;
  6389. s++;
  6390. }
  6391. }
  6392. return XML_TRUE;
  6393. }
  6394. static void FASTCALL
  6395. normalizePublicId(XML_Char *publicId) {
  6396. XML_Char *p = publicId;
  6397. XML_Char *s;
  6398. for (s = publicId; *s; s++) {
  6399. switch (*s) {
  6400. case 0x20:
  6401. case 0xD:
  6402. case 0xA:
  6403. if (p != publicId && p[-1] != 0x20)
  6404. *p++ = 0x20;
  6405. break;
  6406. default:
  6407. *p++ = *s;
  6408. }
  6409. }
  6410. if (p != publicId && p[-1] == 0x20)
  6411. --p;
  6412. *p = XML_T('\0');
  6413. }
  6414. static DTD *
  6415. dtdCreate(const XML_Memory_Handling_Suite *ms) {
  6416. DTD *p = ms->malloc_fcn(sizeof(DTD));
  6417. if (p == NULL)
  6418. return p;
  6419. poolInit(&(p->pool), ms);
  6420. poolInit(&(p->entityValuePool), ms);
  6421. hashTableInit(&(p->generalEntities), ms);
  6422. hashTableInit(&(p->elementTypes), ms);
  6423. hashTableInit(&(p->attributeIds), ms);
  6424. hashTableInit(&(p->prefixes), ms);
  6425. #ifdef XML_DTD
  6426. p->paramEntityRead = XML_FALSE;
  6427. hashTableInit(&(p->paramEntities), ms);
  6428. #endif /* XML_DTD */
  6429. p->defaultPrefix.name = NULL;
  6430. p->defaultPrefix.binding = NULL;
  6431. p->in_eldecl = XML_FALSE;
  6432. p->scaffIndex = NULL;
  6433. p->scaffold = NULL;
  6434. p->scaffLevel = 0;
  6435. p->scaffSize = 0;
  6436. p->scaffCount = 0;
  6437. p->contentStringLen = 0;
  6438. p->keepProcessing = XML_TRUE;
  6439. p->hasParamEntityRefs = XML_FALSE;
  6440. p->standalone = XML_FALSE;
  6441. return p;
  6442. }
  6443. static void
  6444. dtdReset(DTD *p, const XML_Memory_Handling_Suite *ms) {
  6445. HASH_TABLE_ITER iter;
  6446. hashTableIterInit(&iter, &(p->elementTypes));
  6447. for (;;) {
  6448. ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);
  6449. if (! e)
  6450. break;
  6451. if (e->allocDefaultAtts != 0)
  6452. ms->free_fcn(e->defaultAtts);
  6453. }
  6454. hashTableClear(&(p->generalEntities));
  6455. #ifdef XML_DTD
  6456. p->paramEntityRead = XML_FALSE;
  6457. hashTableClear(&(p->paramEntities));
  6458. #endif /* XML_DTD */
  6459. hashTableClear(&(p->elementTypes));
  6460. hashTableClear(&(p->attributeIds));
  6461. hashTableClear(&(p->prefixes));
  6462. poolClear(&(p->pool));
  6463. poolClear(&(p->entityValuePool));
  6464. p->defaultPrefix.name = NULL;
  6465. p->defaultPrefix.binding = NULL;
  6466. p->in_eldecl = XML_FALSE;
  6467. ms->free_fcn(p->scaffIndex);
  6468. p->scaffIndex = NULL;
  6469. ms->free_fcn(p->scaffold);
  6470. p->scaffold = NULL;
  6471. p->scaffLevel = 0;
  6472. p->scaffSize = 0;
  6473. p->scaffCount = 0;
  6474. p->contentStringLen = 0;
  6475. p->keepProcessing = XML_TRUE;
  6476. p->hasParamEntityRefs = XML_FALSE;
  6477. p->standalone = XML_FALSE;
  6478. }
  6479. static void
  6480. dtdDestroy(DTD *p, XML_Bool isDocEntity, const XML_Memory_Handling_Suite *ms) {
  6481. HASH_TABLE_ITER iter;
  6482. hashTableIterInit(&iter, &(p->elementTypes));
  6483. for (;;) {
  6484. ELEMENT_TYPE *e = (ELEMENT_TYPE *)hashTableIterNext(&iter);
  6485. if (! e)
  6486. break;
  6487. if (e->allocDefaultAtts != 0)
  6488. ms->free_fcn(e->defaultAtts);
  6489. }
  6490. hashTableDestroy(&(p->generalEntities));
  6491. #ifdef XML_DTD
  6492. hashTableDestroy(&(p->paramEntities));
  6493. #endif /* XML_DTD */
  6494. hashTableDestroy(&(p->elementTypes));
  6495. hashTableDestroy(&(p->attributeIds));
  6496. hashTableDestroy(&(p->prefixes));
  6497. poolDestroy(&(p->pool));
  6498. poolDestroy(&(p->entityValuePool));
  6499. if (isDocEntity) {
  6500. ms->free_fcn(p->scaffIndex);
  6501. ms->free_fcn(p->scaffold);
  6502. }
  6503. ms->free_fcn(p);
  6504. }
  6505. /* Do a deep copy of the DTD. Return 0 for out of memory, non-zero otherwise.
  6506. The new DTD has already been initialized.
  6507. */
  6508. static int
  6509. dtdCopy(XML_Parser oldParser, DTD *newDtd, const DTD *oldDtd,
  6510. const XML_Memory_Handling_Suite *ms) {
  6511. HASH_TABLE_ITER iter;
  6512. /* Copy the prefix table. */
  6513. hashTableIterInit(&iter, &(oldDtd->prefixes));
  6514. for (;;) {
  6515. const XML_Char *name;
  6516. const PREFIX *oldP = (PREFIX *)hashTableIterNext(&iter);
  6517. if (! oldP)
  6518. break;
  6519. name = poolCopyString(&(newDtd->pool), oldP->name);
  6520. if (! name)
  6521. return 0;
  6522. if (! lookup(oldParser, &(newDtd->prefixes), name, sizeof(PREFIX)))
  6523. return 0;
  6524. }
  6525. hashTableIterInit(&iter, &(oldDtd->attributeIds));
  6526. /* Copy the attribute id table. */
  6527. for (;;) {
  6528. ATTRIBUTE_ID *newA;
  6529. const XML_Char *name;
  6530. const ATTRIBUTE_ID *oldA = (ATTRIBUTE_ID *)hashTableIterNext(&iter);
  6531. if (! oldA)
  6532. break;
  6533. /* Remember to allocate the scratch byte before the name. */
  6534. if (! poolAppendChar(&(newDtd->pool), XML_T('\0')))
  6535. return 0;
  6536. name = poolCopyString(&(newDtd->pool), oldA->name);
  6537. if (! name)
  6538. return 0;
  6539. ++name;
  6540. newA = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds), name,
  6541. sizeof(ATTRIBUTE_ID));
  6542. if (! newA)
  6543. return 0;
  6544. newA->maybeTokenized = oldA->maybeTokenized;
  6545. if (oldA->prefix) {
  6546. newA->xmlns = oldA->xmlns;
  6547. if (oldA->prefix == &oldDtd->defaultPrefix)
  6548. newA->prefix = &newDtd->defaultPrefix;
  6549. else
  6550. newA->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),
  6551. oldA->prefix->name, 0);
  6552. }
  6553. }
  6554. /* Copy the element type table. */
  6555. hashTableIterInit(&iter, &(oldDtd->elementTypes));
  6556. for (;;) {
  6557. int i;
  6558. ELEMENT_TYPE *newE;
  6559. const XML_Char *name;
  6560. const ELEMENT_TYPE *oldE = (ELEMENT_TYPE *)hashTableIterNext(&iter);
  6561. if (! oldE)
  6562. break;
  6563. name = poolCopyString(&(newDtd->pool), oldE->name);
  6564. if (! name)
  6565. return 0;
  6566. newE = (ELEMENT_TYPE *)lookup(oldParser, &(newDtd->elementTypes), name,
  6567. sizeof(ELEMENT_TYPE));
  6568. if (! newE)
  6569. return 0;
  6570. if (oldE->nDefaultAtts) {
  6571. /* Detect and prevent integer overflow.
  6572. * The preprocessor guard addresses the "always false" warning
  6573. * from -Wtype-limits on platforms where
  6574. * sizeof(int) < sizeof(size_t), e.g. on x86_64. */
  6575. #if UINT_MAX >= SIZE_MAX
  6576. if ((size_t)oldE->nDefaultAtts
  6577. > ((size_t)(-1) / sizeof(DEFAULT_ATTRIBUTE))) {
  6578. return 0;
  6579. }
  6580. #endif
  6581. newE->defaultAtts
  6582. = ms->malloc_fcn(oldE->nDefaultAtts * sizeof(DEFAULT_ATTRIBUTE));
  6583. if (! newE->defaultAtts) {
  6584. return 0;
  6585. }
  6586. }
  6587. if (oldE->idAtt)
  6588. newE->idAtt = (ATTRIBUTE_ID *)lookup(oldParser, &(newDtd->attributeIds),
  6589. oldE->idAtt->name, 0);
  6590. newE->allocDefaultAtts = newE->nDefaultAtts = oldE->nDefaultAtts;
  6591. if (oldE->prefix)
  6592. newE->prefix = (PREFIX *)lookup(oldParser, &(newDtd->prefixes),
  6593. oldE->prefix->name, 0);
  6594. for (i = 0; i < newE->nDefaultAtts; i++) {
  6595. newE->defaultAtts[i].id = (ATTRIBUTE_ID *)lookup(
  6596. oldParser, &(newDtd->attributeIds), oldE->defaultAtts[i].id->name, 0);
  6597. newE->defaultAtts[i].isCdata = oldE->defaultAtts[i].isCdata;
  6598. if (oldE->defaultAtts[i].value) {
  6599. newE->defaultAtts[i].value
  6600. = poolCopyString(&(newDtd->pool), oldE->defaultAtts[i].value);
  6601. if (! newE->defaultAtts[i].value)
  6602. return 0;
  6603. } else
  6604. newE->defaultAtts[i].value = NULL;
  6605. }
  6606. }
  6607. /* Copy the entity tables. */
  6608. if (! copyEntityTable(oldParser, &(newDtd->generalEntities), &(newDtd->pool),
  6609. &(oldDtd->generalEntities)))
  6610. return 0;
  6611. #ifdef XML_DTD
  6612. if (! copyEntityTable(oldParser, &(newDtd->paramEntities), &(newDtd->pool),
  6613. &(oldDtd->paramEntities)))
  6614. return 0;
  6615. newDtd->paramEntityRead = oldDtd->paramEntityRead;
  6616. #endif /* XML_DTD */
  6617. newDtd->keepProcessing = oldDtd->keepProcessing;
  6618. newDtd->hasParamEntityRefs = oldDtd->hasParamEntityRefs;
  6619. newDtd->standalone = oldDtd->standalone;
  6620. /* Don't want deep copying for scaffolding */
  6621. newDtd->in_eldecl = oldDtd->in_eldecl;
  6622. newDtd->scaffold = oldDtd->scaffold;
  6623. newDtd->contentStringLen = oldDtd->contentStringLen;
  6624. newDtd->scaffSize = oldDtd->scaffSize;
  6625. newDtd->scaffLevel = oldDtd->scaffLevel;
  6626. newDtd->scaffIndex = oldDtd->scaffIndex;
  6627. return 1;
  6628. } /* End dtdCopy */
  6629. static int
  6630. copyEntityTable(XML_Parser oldParser, HASH_TABLE *newTable,
  6631. STRING_POOL *newPool, const HASH_TABLE *oldTable) {
  6632. HASH_TABLE_ITER iter;
  6633. const XML_Char *cachedOldBase = NULL;
  6634. const XML_Char *cachedNewBase = NULL;
  6635. hashTableIterInit(&iter, oldTable);
  6636. for (;;) {
  6637. ENTITY *newE;
  6638. const XML_Char *name;
  6639. const ENTITY *oldE = (ENTITY *)hashTableIterNext(&iter);
  6640. if (! oldE)
  6641. break;
  6642. name = poolCopyString(newPool, oldE->name);
  6643. if (! name)
  6644. return 0;
  6645. newE = (ENTITY *)lookup(oldParser, newTable, name, sizeof(ENTITY));
  6646. if (! newE)
  6647. return 0;
  6648. if (oldE->systemId) {
  6649. const XML_Char *tem = poolCopyString(newPool, oldE->systemId);
  6650. if (! tem)
  6651. return 0;
  6652. newE->systemId = tem;
  6653. if (oldE->base) {
  6654. if (oldE->base == cachedOldBase)
  6655. newE->base = cachedNewBase;
  6656. else {
  6657. cachedOldBase = oldE->base;
  6658. tem = poolCopyString(newPool, cachedOldBase);
  6659. if (! tem)
  6660. return 0;
  6661. cachedNewBase = newE->base = tem;
  6662. }
  6663. }
  6664. if (oldE->publicId) {
  6665. tem = poolCopyString(newPool, oldE->publicId);
  6666. if (! tem)
  6667. return 0;
  6668. newE->publicId = tem;
  6669. }
  6670. } else {
  6671. const XML_Char *tem
  6672. = poolCopyStringN(newPool, oldE->textPtr, oldE->textLen);
  6673. if (! tem)
  6674. return 0;
  6675. newE->textPtr = tem;
  6676. newE->textLen = oldE->textLen;
  6677. }
  6678. if (oldE->notation) {
  6679. const XML_Char *tem = poolCopyString(newPool, oldE->notation);
  6680. if (! tem)
  6681. return 0;
  6682. newE->notation = tem;
  6683. }
  6684. newE->is_param = oldE->is_param;
  6685. newE->is_internal = oldE->is_internal;
  6686. }
  6687. return 1;
  6688. }
  6689. #define INIT_POWER 6
  6690. static XML_Bool FASTCALL
  6691. keyeq(KEY s1, KEY s2) {
  6692. for (; *s1 == *s2; s1++, s2++)
  6693. if (*s1 == 0)
  6694. return XML_TRUE;
  6695. return XML_FALSE;
  6696. }
  6697. static size_t
  6698. keylen(KEY s) {
  6699. size_t len = 0;
  6700. for (; *s; s++, len++)
  6701. ;
  6702. return len;
  6703. }
  6704. static void
  6705. copy_salt_to_sipkey(XML_Parser parser, struct sipkey *key) {
  6706. key->k[0] = 0;
  6707. key->k[1] = get_hash_secret_salt(parser);
  6708. }
  6709. static unsigned long FASTCALL
  6710. hash(XML_Parser parser, KEY s) {
  6711. struct siphash state;
  6712. struct sipkey key;
  6713. (void)sip24_valid;
  6714. copy_salt_to_sipkey(parser, &key);
  6715. sip24_init(&state, &key);
  6716. sip24_update(&state, s, keylen(s) * sizeof(XML_Char));
  6717. return (unsigned long)sip24_final(&state);
  6718. }
  6719. static NAMED *
  6720. lookup(XML_Parser parser, HASH_TABLE *table, KEY name, size_t createSize) {
  6721. size_t i;
  6722. if (table->size == 0) {
  6723. size_t tsize;
  6724. if (! createSize)
  6725. return NULL;
  6726. table->power = INIT_POWER;
  6727. /* table->size is a power of 2 */
  6728. table->size = (size_t)1 << INIT_POWER;
  6729. tsize = table->size * sizeof(NAMED *);
  6730. table->v = table->mem->malloc_fcn(tsize);
  6731. if (! table->v) {
  6732. table->size = 0;
  6733. return NULL;
  6734. }
  6735. memset(table->v, 0, tsize);
  6736. i = hash(parser, name) & ((unsigned long)table->size - 1);
  6737. } else {
  6738. unsigned long h = hash(parser, name);
  6739. unsigned long mask = (unsigned long)table->size - 1;
  6740. unsigned char step = 0;
  6741. i = h & mask;
  6742. while (table->v[i]) {
  6743. if (keyeq(name, table->v[i]->name))
  6744. return table->v[i];
  6745. if (! step)
  6746. step = PROBE_STEP(h, mask, table->power);
  6747. i < step ? (i += table->size - step) : (i -= step);
  6748. }
  6749. if (! createSize)
  6750. return NULL;
  6751. /* check for overflow (table is half full) */
  6752. if (table->used >> (table->power - 1)) {
  6753. unsigned char newPower = table->power + 1;
  6754. /* Detect and prevent invalid shift */
  6755. if (newPower >= sizeof(unsigned long) * 8 /* bits per byte */) {
  6756. return NULL;
  6757. }
  6758. size_t newSize = (size_t)1 << newPower;
  6759. unsigned long newMask = (unsigned long)newSize - 1;
  6760. /* Detect and prevent integer overflow */
  6761. if (newSize > (size_t)(-1) / sizeof(NAMED *)) {
  6762. return NULL;
  6763. }
  6764. size_t tsize = newSize * sizeof(NAMED *);
  6765. NAMED **newV = table->mem->malloc_fcn(tsize);
  6766. if (! newV)
  6767. return NULL;
  6768. memset(newV, 0, tsize);
  6769. for (i = 0; i < table->size; i++)
  6770. if (table->v[i]) {
  6771. unsigned long newHash = hash(parser, table->v[i]->name);
  6772. size_t j = newHash & newMask;
  6773. step = 0;
  6774. while (newV[j]) {
  6775. if (! step)
  6776. step = PROBE_STEP(newHash, newMask, newPower);
  6777. j < step ? (j += newSize - step) : (j -= step);
  6778. }
  6779. newV[j] = table->v[i];
  6780. }
  6781. table->mem->free_fcn(table->v);
  6782. table->v = newV;
  6783. table->power = newPower;
  6784. table->size = newSize;
  6785. i = h & newMask;
  6786. step = 0;
  6787. while (table->v[i]) {
  6788. if (! step)
  6789. step = PROBE_STEP(h, newMask, newPower);
  6790. i < step ? (i += newSize - step) : (i -= step);
  6791. }
  6792. }
  6793. }
  6794. table->v[i] = table->mem->malloc_fcn(createSize);
  6795. if (! table->v[i])
  6796. return NULL;
  6797. memset(table->v[i], 0, createSize);
  6798. table->v[i]->name = name;
  6799. (table->used)++;
  6800. return table->v[i];
  6801. }
  6802. static void FASTCALL
  6803. hashTableClear(HASH_TABLE *table) {
  6804. size_t i;
  6805. for (i = 0; i < table->size; i++) {
  6806. table->mem->free_fcn(table->v[i]);
  6807. table->v[i] = NULL;
  6808. }
  6809. table->used = 0;
  6810. }
  6811. static void FASTCALL
  6812. hashTableDestroy(HASH_TABLE *table) {
  6813. size_t i;
  6814. for (i = 0; i < table->size; i++)
  6815. table->mem->free_fcn(table->v[i]);
  6816. table->mem->free_fcn(table->v);
  6817. }
  6818. static void FASTCALL
  6819. hashTableInit(HASH_TABLE *p, const XML_Memory_Handling_Suite *ms) {
  6820. p->power = 0;
  6821. p->size = 0;
  6822. p->used = 0;
  6823. p->v = NULL;
  6824. p->mem = ms;
  6825. }
  6826. static void FASTCALL
  6827. hashTableIterInit(HASH_TABLE_ITER *iter, const HASH_TABLE *table) {
  6828. iter->p = table->v;
  6829. iter->end = iter->p ? iter->p + table->size : NULL;
  6830. }
  6831. static NAMED *FASTCALL
  6832. hashTableIterNext(HASH_TABLE_ITER *iter) {
  6833. while (iter->p != iter->end) {
  6834. NAMED *tem = *(iter->p)++;
  6835. if (tem)
  6836. return tem;
  6837. }
  6838. return NULL;
  6839. }
  6840. static void FASTCALL
  6841. poolInit(STRING_POOL *pool, const XML_Memory_Handling_Suite *ms) {
  6842. pool->blocks = NULL;
  6843. pool->freeBlocks = NULL;
  6844. pool->start = NULL;
  6845. pool->ptr = NULL;
  6846. pool->end = NULL;
  6847. pool->mem = ms;
  6848. }
  6849. static void FASTCALL
  6850. poolClear(STRING_POOL *pool) {
  6851. if (! pool->freeBlocks)
  6852. pool->freeBlocks = pool->blocks;
  6853. else {
  6854. BLOCK *p = pool->blocks;
  6855. while (p) {
  6856. BLOCK *tem = p->next;
  6857. p->next = pool->freeBlocks;
  6858. pool->freeBlocks = p;
  6859. p = tem;
  6860. }
  6861. }
  6862. pool->blocks = NULL;
  6863. pool->start = NULL;
  6864. pool->ptr = NULL;
  6865. pool->end = NULL;
  6866. }
  6867. static void FASTCALL
  6868. poolDestroy(STRING_POOL *pool) {
  6869. BLOCK *p = pool->blocks;
  6870. while (p) {
  6871. BLOCK *tem = p->next;
  6872. pool->mem->free_fcn(p);
  6873. p = tem;
  6874. }
  6875. p = pool->freeBlocks;
  6876. while (p) {
  6877. BLOCK *tem = p->next;
  6878. pool->mem->free_fcn(p);
  6879. p = tem;
  6880. }
  6881. }
  6882. static XML_Char *
  6883. poolAppend(STRING_POOL *pool, const ENCODING *enc, const char *ptr,
  6884. const char *end) {
  6885. if (! pool->ptr && ! poolGrow(pool))
  6886. return NULL;
  6887. for (;;) {
  6888. const enum XML_Convert_Result convert_res = XmlConvert(
  6889. enc, &ptr, end, (ICHAR **)&(pool->ptr), (const ICHAR *)pool->end);
  6890. if ((convert_res == XML_CONVERT_COMPLETED)
  6891. || (convert_res == XML_CONVERT_INPUT_INCOMPLETE))
  6892. break;
  6893. if (! poolGrow(pool))
  6894. return NULL;
  6895. }
  6896. return pool->start;
  6897. }
  6898. static const XML_Char *FASTCALL
  6899. poolCopyString(STRING_POOL *pool, const XML_Char *s) {
  6900. do {
  6901. if (! poolAppendChar(pool, *s))
  6902. return NULL;
  6903. } while (*s++);
  6904. s = pool->start;
  6905. poolFinish(pool);
  6906. return s;
  6907. }
  6908. static const XML_Char *
  6909. poolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n) {
  6910. if (! pool->ptr && ! poolGrow(pool)) {
  6911. /* The following line is unreachable given the current usage of
  6912. * poolCopyStringN(). Currently it is called from exactly one
  6913. * place to copy the text of a simple general entity. By that
  6914. * point, the name of the entity is already stored in the pool, so
  6915. * pool->ptr cannot be NULL.
  6916. *
  6917. * If poolCopyStringN() is used elsewhere as it well might be,
  6918. * this line may well become executable again. Regardless, this
  6919. * sort of check shouldn't be removed lightly, so we just exclude
  6920. * it from the coverage statistics.
  6921. */
  6922. return NULL; /* LCOV_EXCL_LINE */
  6923. }
  6924. for (; n > 0; --n, s++) {
  6925. if (! poolAppendChar(pool, *s))
  6926. return NULL;
  6927. }
  6928. s = pool->start;
  6929. poolFinish(pool);
  6930. return s;
  6931. }
  6932. static const XML_Char *FASTCALL
  6933. poolAppendString(STRING_POOL *pool, const XML_Char *s) {
  6934. while (*s) {
  6935. if (! poolAppendChar(pool, *s))
  6936. return NULL;
  6937. s++;
  6938. }
  6939. return pool->start;
  6940. }
  6941. static XML_Char *
  6942. poolStoreString(STRING_POOL *pool, const ENCODING *enc, const char *ptr,
  6943. const char *end) {
  6944. if (! poolAppend(pool, enc, ptr, end))
  6945. return NULL;
  6946. if (pool->ptr == pool->end && ! poolGrow(pool))
  6947. return NULL;
  6948. *(pool->ptr)++ = 0;
  6949. return pool->start;
  6950. }
  6951. static size_t
  6952. poolBytesToAllocateFor(int blockSize) {
  6953. /* Unprotected math would be:
  6954. ** return offsetof(BLOCK, s) + blockSize * sizeof(XML_Char);
  6955. **
  6956. ** Detect overflow, avoiding _signed_ overflow undefined behavior
  6957. ** For a + b * c we check b * c in isolation first, so that addition of a
  6958. ** on top has no chance of making us accept a small non-negative number
  6959. */
  6960. const size_t stretch = sizeof(XML_Char); /* can be 4 bytes */
  6961. if (blockSize <= 0)
  6962. return 0;
  6963. if (blockSize > (int)(INT_MAX / stretch))
  6964. return 0;
  6965. {
  6966. const int stretchedBlockSize = blockSize * (int)stretch;
  6967. const int bytesToAllocate
  6968. = (int)(offsetof(BLOCK, s) + (unsigned)stretchedBlockSize);
  6969. if (bytesToAllocate < 0)
  6970. return 0;
  6971. return (size_t)bytesToAllocate;
  6972. }
  6973. }
  6974. static XML_Bool FASTCALL
  6975. poolGrow(STRING_POOL *pool) {
  6976. if (pool->freeBlocks) {
  6977. if (pool->start == 0) {
  6978. pool->blocks = pool->freeBlocks;
  6979. pool->freeBlocks = pool->freeBlocks->next;
  6980. pool->blocks->next = NULL;
  6981. pool->start = pool->blocks->s;
  6982. pool->end = pool->start + pool->blocks->size;
  6983. pool->ptr = pool->start;
  6984. return XML_TRUE;
  6985. }
  6986. if (pool->end - pool->start < pool->freeBlocks->size) {
  6987. BLOCK *tem = pool->freeBlocks->next;
  6988. pool->freeBlocks->next = pool->blocks;
  6989. pool->blocks = pool->freeBlocks;
  6990. pool->freeBlocks = tem;
  6991. memcpy(pool->blocks->s, pool->start,
  6992. (pool->end - pool->start) * sizeof(XML_Char));
  6993. pool->ptr = pool->blocks->s + (pool->ptr - pool->start);
  6994. pool->start = pool->blocks->s;
  6995. pool->end = pool->start + pool->blocks->size;
  6996. return XML_TRUE;
  6997. }
  6998. }
  6999. if (pool->blocks && pool->start == pool->blocks->s) {
  7000. BLOCK *temp;
  7001. int blockSize = (int)((unsigned)(pool->end - pool->start) * 2U);
  7002. size_t bytesToAllocate;
  7003. /* NOTE: Needs to be calculated prior to calling `realloc`
  7004. to avoid dangling pointers: */
  7005. const ptrdiff_t offsetInsideBlock = pool->ptr - pool->start;
  7006. if (blockSize < 0) {
  7007. /* This condition traps a situation where either more than
  7008. * INT_MAX/2 bytes have already been allocated. This isn't
  7009. * readily testable, since it is unlikely that an average
  7010. * machine will have that much memory, so we exclude it from the
  7011. * coverage statistics.
  7012. */
  7013. return XML_FALSE; /* LCOV_EXCL_LINE */
  7014. }
  7015. bytesToAllocate = poolBytesToAllocateFor(blockSize);
  7016. if (bytesToAllocate == 0)
  7017. return XML_FALSE;
  7018. temp = (BLOCK *)pool->mem->realloc_fcn(pool->blocks,
  7019. (unsigned)bytesToAllocate);
  7020. if (temp == NULL)
  7021. return XML_FALSE;
  7022. pool->blocks = temp;
  7023. pool->blocks->size = blockSize;
  7024. pool->ptr = pool->blocks->s + offsetInsideBlock;
  7025. pool->start = pool->blocks->s;
  7026. pool->end = pool->start + blockSize;
  7027. } else {
  7028. BLOCK *tem;
  7029. int blockSize = (int)(pool->end - pool->start);
  7030. size_t bytesToAllocate;
  7031. if (blockSize < 0) {
  7032. /* This condition traps a situation where either more than
  7033. * INT_MAX bytes have already been allocated (which is prevented
  7034. * by various pieces of program logic, not least this one, never
  7035. * mind the unlikelihood of actually having that much memory) or
  7036. * the pool control fields have been corrupted (which could
  7037. * conceivably happen in an extremely buggy user handler
  7038. * function). Either way it isn't readily testable, so we
  7039. * exclude it from the coverage statistics.
  7040. */
  7041. return XML_FALSE; /* LCOV_EXCL_LINE */
  7042. }
  7043. if (blockSize < INIT_BLOCK_SIZE)
  7044. blockSize = INIT_BLOCK_SIZE;
  7045. else {
  7046. /* Detect overflow, avoiding _signed_ overflow undefined behavior */
  7047. if ((int)((unsigned)blockSize * 2U) < 0) {
  7048. return XML_FALSE;
  7049. }
  7050. blockSize *= 2;
  7051. }
  7052. bytesToAllocate = poolBytesToAllocateFor(blockSize);
  7053. if (bytesToAllocate == 0)
  7054. return XML_FALSE;
  7055. tem = pool->mem->malloc_fcn(bytesToAllocate);
  7056. if (! tem)
  7057. return XML_FALSE;
  7058. tem->size = blockSize;
  7059. tem->next = pool->blocks;
  7060. pool->blocks = tem;
  7061. if (pool->ptr != pool->start)
  7062. memcpy(tem->s, pool->start, (pool->ptr - pool->start) * sizeof(XML_Char));
  7063. pool->ptr = tem->s + (pool->ptr - pool->start);
  7064. pool->start = tem->s;
  7065. pool->end = tem->s + blockSize;
  7066. }
  7067. return XML_TRUE;
  7068. }
  7069. static int FASTCALL
  7070. nextScaffoldPart(XML_Parser parser) {
  7071. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  7072. CONTENT_SCAFFOLD *me;
  7073. int next;
  7074. if (! dtd->scaffIndex) {
  7075. /* Detect and prevent integer overflow.
  7076. * The preprocessor guard addresses the "always false" warning
  7077. * from -Wtype-limits on platforms where
  7078. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  7079. #if UINT_MAX >= SIZE_MAX
  7080. if (parser->m_groupSize > ((size_t)(-1) / sizeof(int))) {
  7081. return -1;
  7082. }
  7083. #endif
  7084. dtd->scaffIndex = (int *)MALLOC(parser, parser->m_groupSize * sizeof(int));
  7085. if (! dtd->scaffIndex)
  7086. return -1;
  7087. dtd->scaffIndex[0] = 0;
  7088. }
  7089. if (dtd->scaffCount >= dtd->scaffSize) {
  7090. CONTENT_SCAFFOLD *temp;
  7091. if (dtd->scaffold) {
  7092. /* Detect and prevent integer overflow */
  7093. if (dtd->scaffSize > UINT_MAX / 2u) {
  7094. return -1;
  7095. }
  7096. /* Detect and prevent integer overflow.
  7097. * The preprocessor guard addresses the "always false" warning
  7098. * from -Wtype-limits on platforms where
  7099. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  7100. #if UINT_MAX >= SIZE_MAX
  7101. if (dtd->scaffSize > (size_t)(-1) / 2u / sizeof(CONTENT_SCAFFOLD)) {
  7102. return -1;
  7103. }
  7104. #endif
  7105. temp = (CONTENT_SCAFFOLD *)REALLOC(
  7106. parser, dtd->scaffold, dtd->scaffSize * 2 * sizeof(CONTENT_SCAFFOLD));
  7107. if (temp == NULL)
  7108. return -1;
  7109. dtd->scaffSize *= 2;
  7110. } else {
  7111. temp = (CONTENT_SCAFFOLD *)MALLOC(parser, INIT_SCAFFOLD_ELEMENTS
  7112. * sizeof(CONTENT_SCAFFOLD));
  7113. if (temp == NULL)
  7114. return -1;
  7115. dtd->scaffSize = INIT_SCAFFOLD_ELEMENTS;
  7116. }
  7117. dtd->scaffold = temp;
  7118. }
  7119. next = dtd->scaffCount++;
  7120. me = &dtd->scaffold[next];
  7121. if (dtd->scaffLevel) {
  7122. CONTENT_SCAFFOLD *parent
  7123. = &dtd->scaffold[dtd->scaffIndex[dtd->scaffLevel - 1]];
  7124. if (parent->lastchild) {
  7125. dtd->scaffold[parent->lastchild].nextsib = next;
  7126. }
  7127. if (! parent->childcnt)
  7128. parent->firstchild = next;
  7129. parent->lastchild = next;
  7130. parent->childcnt++;
  7131. }
  7132. me->firstchild = me->lastchild = me->childcnt = me->nextsib = 0;
  7133. return next;
  7134. }
  7135. static XML_Content *
  7136. build_model(XML_Parser parser) {
  7137. /* Function build_model transforms the existing parser->m_dtd->scaffold
  7138. * array of CONTENT_SCAFFOLD tree nodes into a new array of
  7139. * XML_Content tree nodes followed by a gapless list of zero-terminated
  7140. * strings. */
  7141. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  7142. XML_Content *ret;
  7143. XML_Char *str; /* the current string writing location */
  7144. /* Detect and prevent integer overflow.
  7145. * The preprocessor guard addresses the "always false" warning
  7146. * from -Wtype-limits on platforms where
  7147. * sizeof(unsigned int) < sizeof(size_t), e.g. on x86_64. */
  7148. #if UINT_MAX >= SIZE_MAX
  7149. if (dtd->scaffCount > (size_t)(-1) / sizeof(XML_Content)) {
  7150. return NULL;
  7151. }
  7152. if (dtd->contentStringLen > (size_t)(-1) / sizeof(XML_Char)) {
  7153. return NULL;
  7154. }
  7155. #endif
  7156. if (dtd->scaffCount * sizeof(XML_Content)
  7157. > (size_t)(-1) - dtd->contentStringLen * sizeof(XML_Char)) {
  7158. return NULL;
  7159. }
  7160. const size_t allocsize = (dtd->scaffCount * sizeof(XML_Content)
  7161. + (dtd->contentStringLen * sizeof(XML_Char)));
  7162. ret = (XML_Content *)MALLOC(parser, allocsize);
  7163. if (! ret)
  7164. return NULL;
  7165. /* What follows is an iterative implementation (of what was previously done
  7166. * recursively in a dedicated function called "build_node". The old recursive
  7167. * build_node could be forced into stack exhaustion from input as small as a
  7168. * few megabyte, and so that was a security issue. Hence, a function call
  7169. * stack is avoided now by resolving recursion.)
  7170. *
  7171. * The iterative approach works as follows:
  7172. *
  7173. * - We have two writing pointers, both walking up the result array; one does
  7174. * the work, the other creates "jobs" for its colleague to do, and leads
  7175. * the way:
  7176. *
  7177. * - The faster one, pointer jobDest, always leads and writes "what job
  7178. * to do" by the other, once they reach that place in the
  7179. * array: leader "jobDest" stores the source node array index (relative
  7180. * to array dtd->scaffold) in field "numchildren".
  7181. *
  7182. * - The slower one, pointer dest, looks at the value stored in the
  7183. * "numchildren" field (which actually holds a source node array index
  7184. * at that time) and puts the real data from dtd->scaffold in.
  7185. *
  7186. * - Before the loop starts, jobDest writes source array index 0
  7187. * (where the root node is located) so that dest will have something to do
  7188. * when it starts operation.
  7189. *
  7190. * - Whenever nodes with children are encountered, jobDest appends
  7191. * them as new jobs, in order. As a result, tree node siblings are
  7192. * adjacent in the resulting array, for example:
  7193. *
  7194. * [0] root, has two children
  7195. * [1] first child of 0, has three children
  7196. * [3] first child of 1, does not have children
  7197. * [4] second child of 1, does not have children
  7198. * [5] third child of 1, does not have children
  7199. * [2] second child of 0, does not have children
  7200. *
  7201. * Or (the same data) presented in flat array view:
  7202. *
  7203. * [0] root, has two children
  7204. *
  7205. * [1] first child of 0, has three children
  7206. * [2] second child of 0, does not have children
  7207. *
  7208. * [3] first child of 1, does not have children
  7209. * [4] second child of 1, does not have children
  7210. * [5] third child of 1, does not have children
  7211. *
  7212. * - The algorithm repeats until all target array indices have been processed.
  7213. */
  7214. XML_Content *dest = ret; /* tree node writing location, moves upwards */
  7215. XML_Content *const destLimit = &ret[dtd->scaffCount];
  7216. XML_Content *jobDest = ret; /* next free writing location in target array */
  7217. str = (XML_Char *)&ret[dtd->scaffCount];
  7218. /* Add the starting job, the root node (index 0) of the source tree */
  7219. (jobDest++)->numchildren = 0;
  7220. for (; dest < destLimit; dest++) {
  7221. /* Retrieve source tree array index from job storage */
  7222. const int src_node = (int)dest->numchildren;
  7223. /* Convert item */
  7224. dest->type = dtd->scaffold[src_node].type;
  7225. dest->quant = dtd->scaffold[src_node].quant;
  7226. if (dest->type == XML_CTYPE_NAME) {
  7227. const XML_Char *src;
  7228. dest->name = str;
  7229. src = dtd->scaffold[src_node].name;
  7230. for (;;) {
  7231. *str++ = *src;
  7232. if (! *src)
  7233. break;
  7234. src++;
  7235. }
  7236. dest->numchildren = 0;
  7237. dest->children = NULL;
  7238. } else {
  7239. unsigned int i;
  7240. int cn;
  7241. dest->name = NULL;
  7242. dest->numchildren = dtd->scaffold[src_node].childcnt;
  7243. dest->children = jobDest;
  7244. /* Append scaffold indices of children to array */
  7245. for (i = 0, cn = dtd->scaffold[src_node].firstchild;
  7246. i < dest->numchildren; i++, cn = dtd->scaffold[cn].nextsib)
  7247. (jobDest++)->numchildren = (unsigned int)cn;
  7248. }
  7249. }
  7250. return ret;
  7251. }
  7252. static ELEMENT_TYPE *
  7253. getElementType(XML_Parser parser, const ENCODING *enc, const char *ptr,
  7254. const char *end) {
  7255. DTD *const dtd = parser->m_dtd; /* save one level of indirection */
  7256. const XML_Char *name = poolStoreString(&dtd->pool, enc, ptr, end);
  7257. ELEMENT_TYPE *ret;
  7258. if (! name)
  7259. return NULL;
  7260. ret = (ELEMENT_TYPE *)lookup(parser, &dtd->elementTypes, name,
  7261. sizeof(ELEMENT_TYPE));
  7262. if (! ret)
  7263. return NULL;
  7264. if (ret->name != name)
  7265. poolDiscard(&dtd->pool);
  7266. else {
  7267. poolFinish(&dtd->pool);
  7268. if (! setElementTypePrefix(parser, ret))
  7269. return NULL;
  7270. }
  7271. return ret;
  7272. }
  7273. static XML_Char *
  7274. copyString(const XML_Char *s, const XML_Memory_Handling_Suite *memsuite) {
  7275. size_t charsRequired = 0;
  7276. XML_Char *result;
  7277. /* First determine how long the string is */
  7278. while (s[charsRequired] != 0) {
  7279. charsRequired++;
  7280. }
  7281. /* Include the terminator */
  7282. charsRequired++;
  7283. /* Now allocate space for the copy */
  7284. result = memsuite->malloc_fcn(charsRequired * sizeof(XML_Char));
  7285. if (result == NULL)
  7286. return NULL;
  7287. /* Copy the original into place */
  7288. memcpy(result, s, charsRequired * sizeof(XML_Char));
  7289. return result;
  7290. }
  7291. #if XML_GE == 1
  7292. static float
  7293. accountingGetCurrentAmplification(XML_Parser rootParser) {
  7294. // 1.........1.........12 => 22
  7295. const size_t lenOfShortestInclude = sizeof("<!ENTITY a SYSTEM 'b'>") - 1;
  7296. const XmlBigCount countBytesOutput
  7297. = rootParser->m_accounting.countBytesDirect
  7298. + rootParser->m_accounting.countBytesIndirect;
  7299. const float amplificationFactor
  7300. = rootParser->m_accounting.countBytesDirect
  7301. ? (countBytesOutput
  7302. / (float)(rootParser->m_accounting.countBytesDirect))
  7303. : ((lenOfShortestInclude
  7304. + rootParser->m_accounting.countBytesIndirect)
  7305. / (float)lenOfShortestInclude);
  7306. assert(! rootParser->m_parentParser);
  7307. return amplificationFactor;
  7308. }
  7309. static void
  7310. accountingReportStats(XML_Parser originParser, const char *epilog) {
  7311. const XML_Parser rootParser = getRootParserOf(originParser, NULL);
  7312. assert(! rootParser->m_parentParser);
  7313. if (rootParser->m_accounting.debugLevel == 0u) {
  7314. return;
  7315. }
  7316. const float amplificationFactor
  7317. = accountingGetCurrentAmplification(rootParser);
  7318. fprintf(stderr,
  7319. "expat: Accounting(%p): Direct " EXPAT_FMT_ULL(
  7320. "10") ", indirect " EXPAT_FMT_ULL("10") ", amplification %8.2f%s",
  7321. (void *)rootParser, rootParser->m_accounting.countBytesDirect,
  7322. rootParser->m_accounting.countBytesIndirect,
  7323. (double)amplificationFactor, epilog);
  7324. }
  7325. static void
  7326. accountingOnAbort(XML_Parser originParser) {
  7327. accountingReportStats(originParser, " ABORTING\n");
  7328. }
  7329. static void
  7330. accountingReportDiff(XML_Parser rootParser,
  7331. unsigned int levelsAwayFromRootParser, const char *before,
  7332. const char *after, ptrdiff_t bytesMore, int source_line,
  7333. enum XML_Account account) {
  7334. assert(! rootParser->m_parentParser);
  7335. fprintf(stderr,
  7336. " (+" EXPAT_FMT_PTRDIFF_T("6") " bytes %s|%u, xmlparse.c:%d) %*s\"",
  7337. bytesMore, (account == XML_ACCOUNT_DIRECT) ? "DIR" : "EXP",
  7338. levelsAwayFromRootParser, source_line, 10, "");
  7339. const char ellipis[] = "[..]";
  7340. const size_t ellipsisLength = sizeof(ellipis) /* because compile-time */ - 1;
  7341. const unsigned int contextLength = 10;
  7342. /* Note: Performance is of no concern here */
  7343. const char *walker = before;
  7344. if ((rootParser->m_accounting.debugLevel >= 3u)
  7345. || (after - before)
  7346. <= (ptrdiff_t)(contextLength + ellipsisLength + contextLength)) {
  7347. for (; walker < after; walker++) {
  7348. fprintf(stderr, "%s", unsignedCharToPrintable(walker[0]));
  7349. }
  7350. } else {
  7351. for (; walker < before + contextLength; walker++) {
  7352. fprintf(stderr, "%s", unsignedCharToPrintable(walker[0]));
  7353. }
  7354. fprintf(stderr, ellipis);
  7355. walker = after - contextLength;
  7356. for (; walker < after; walker++) {
  7357. fprintf(stderr, "%s", unsignedCharToPrintable(walker[0]));
  7358. }
  7359. }
  7360. fprintf(stderr, "\"\n");
  7361. }
  7362. static XML_Bool
  7363. accountingDiffTolerated(XML_Parser originParser, int tok, const char *before,
  7364. const char *after, int source_line,
  7365. enum XML_Account account) {
  7366. /* Note: We need to check the token type *first* to be sure that
  7367. * we can even access variable <after>, safely.
  7368. * E.g. for XML_TOK_NONE <after> may hold an invalid pointer. */
  7369. switch (tok) {
  7370. case XML_TOK_INVALID:
  7371. case XML_TOK_PARTIAL:
  7372. case XML_TOK_PARTIAL_CHAR:
  7373. case XML_TOK_NONE:
  7374. return XML_TRUE;
  7375. }
  7376. if (account == XML_ACCOUNT_NONE)
  7377. return XML_TRUE; /* because these bytes have been accounted for, already */
  7378. unsigned int levelsAwayFromRootParser;
  7379. const XML_Parser rootParser
  7380. = getRootParserOf(originParser, &levelsAwayFromRootParser);
  7381. assert(! rootParser->m_parentParser);
  7382. const int isDirect
  7383. = (account == XML_ACCOUNT_DIRECT) && (originParser == rootParser);
  7384. const ptrdiff_t bytesMore = after - before;
  7385. XmlBigCount *const additionTarget
  7386. = isDirect ? &rootParser->m_accounting.countBytesDirect
  7387. : &rootParser->m_accounting.countBytesIndirect;
  7388. /* Detect and avoid integer overflow */
  7389. if (*additionTarget > (XmlBigCount)(-1) - (XmlBigCount)bytesMore)
  7390. return XML_FALSE;
  7391. *additionTarget += bytesMore;
  7392. const XmlBigCount countBytesOutput
  7393. = rootParser->m_accounting.countBytesDirect
  7394. + rootParser->m_accounting.countBytesIndirect;
  7395. const float amplificationFactor
  7396. = accountingGetCurrentAmplification(rootParser);
  7397. const XML_Bool tolerated
  7398. = (countBytesOutput < rootParser->m_accounting.activationThresholdBytes)
  7399. || (amplificationFactor
  7400. <= rootParser->m_accounting.maximumAmplificationFactor);
  7401. if (rootParser->m_accounting.debugLevel >= 2u) {
  7402. accountingReportStats(rootParser, "");
  7403. accountingReportDiff(rootParser, levelsAwayFromRootParser, before, after,
  7404. bytesMore, source_line, account);
  7405. }
  7406. return tolerated;
  7407. }
  7408. unsigned long long
  7409. testingAccountingGetCountBytesDirect(XML_Parser parser) {
  7410. if (! parser)
  7411. return 0;
  7412. return parser->m_accounting.countBytesDirect;
  7413. }
  7414. unsigned long long
  7415. testingAccountingGetCountBytesIndirect(XML_Parser parser) {
  7416. if (! parser)
  7417. return 0;
  7418. return parser->m_accounting.countBytesIndirect;
  7419. }
  7420. static void
  7421. entityTrackingReportStats(XML_Parser rootParser, ENTITY *entity,
  7422. const char *action, int sourceLine) {
  7423. assert(! rootParser->m_parentParser);
  7424. if (rootParser->m_entity_stats.debugLevel == 0u)
  7425. return;
  7426. # if defined(XML_UNICODE)
  7427. const char *const entityName = "[..]";
  7428. # else
  7429. const char *const entityName = entity->name;
  7430. # endif
  7431. fprintf(
  7432. stderr,
  7433. "expat: Entities(%p): Count %9u, depth %2u/%2u %*s%s%s; %s length %d (xmlparse.c:%d)\n",
  7434. (void *)rootParser, rootParser->m_entity_stats.countEverOpened,
  7435. rootParser->m_entity_stats.currentDepth,
  7436. rootParser->m_entity_stats.maximumDepthSeen,
  7437. (rootParser->m_entity_stats.currentDepth - 1) * 2, "",
  7438. entity->is_param ? "%" : "&", entityName, action, entity->textLen,
  7439. sourceLine);
  7440. }
  7441. static void
  7442. entityTrackingOnOpen(XML_Parser originParser, ENTITY *entity, int sourceLine) {
  7443. const XML_Parser rootParser = getRootParserOf(originParser, NULL);
  7444. assert(! rootParser->m_parentParser);
  7445. rootParser->m_entity_stats.countEverOpened++;
  7446. rootParser->m_entity_stats.currentDepth++;
  7447. if (rootParser->m_entity_stats.currentDepth
  7448. > rootParser->m_entity_stats.maximumDepthSeen) {
  7449. rootParser->m_entity_stats.maximumDepthSeen++;
  7450. }
  7451. entityTrackingReportStats(rootParser, entity, "OPEN ", sourceLine);
  7452. }
  7453. static void
  7454. entityTrackingOnClose(XML_Parser originParser, ENTITY *entity, int sourceLine) {
  7455. const XML_Parser rootParser = getRootParserOf(originParser, NULL);
  7456. assert(! rootParser->m_parentParser);
  7457. entityTrackingReportStats(rootParser, entity, "CLOSE", sourceLine);
  7458. rootParser->m_entity_stats.currentDepth--;
  7459. }
  7460. static XML_Parser
  7461. getRootParserOf(XML_Parser parser, unsigned int *outLevelDiff) {
  7462. XML_Parser rootParser = parser;
  7463. unsigned int stepsTakenUpwards = 0;
  7464. while (rootParser->m_parentParser) {
  7465. rootParser = rootParser->m_parentParser;
  7466. stepsTakenUpwards++;
  7467. }
  7468. assert(! rootParser->m_parentParser);
  7469. if (outLevelDiff != NULL) {
  7470. *outLevelDiff = stepsTakenUpwards;
  7471. }
  7472. return rootParser;
  7473. }
  7474. const char *
  7475. unsignedCharToPrintable(unsigned char c) {
  7476. switch (c) {
  7477. case 0:
  7478. return "\\0";
  7479. case 1:
  7480. return "\\x1";
  7481. case 2:
  7482. return "\\x2";
  7483. case 3:
  7484. return "\\x3";
  7485. case 4:
  7486. return "\\x4";
  7487. case 5:
  7488. return "\\x5";
  7489. case 6:
  7490. return "\\x6";
  7491. case 7:
  7492. return "\\x7";
  7493. case 8:
  7494. return "\\x8";
  7495. case 9:
  7496. return "\\t";
  7497. case 10:
  7498. return "\\n";
  7499. case 11:
  7500. return "\\xB";
  7501. case 12:
  7502. return "\\xC";
  7503. case 13:
  7504. return "\\r";
  7505. case 14:
  7506. return "\\xE";
  7507. case 15:
  7508. return "\\xF";
  7509. case 16:
  7510. return "\\x10";
  7511. case 17:
  7512. return "\\x11";
  7513. case 18:
  7514. return "\\x12";
  7515. case 19:
  7516. return "\\x13";
  7517. case 20:
  7518. return "\\x14";
  7519. case 21:
  7520. return "\\x15";
  7521. case 22:
  7522. return "\\x16";
  7523. case 23:
  7524. return "\\x17";
  7525. case 24:
  7526. return "\\x18";
  7527. case 25:
  7528. return "\\x19";
  7529. case 26:
  7530. return "\\x1A";
  7531. case 27:
  7532. return "\\x1B";
  7533. case 28:
  7534. return "\\x1C";
  7535. case 29:
  7536. return "\\x1D";
  7537. case 30:
  7538. return "\\x1E";
  7539. case 31:
  7540. return "\\x1F";
  7541. case 32:
  7542. return " ";
  7543. case 33:
  7544. return "!";
  7545. case 34:
  7546. return "\\\"";
  7547. case 35:
  7548. return "#";
  7549. case 36:
  7550. return "$";
  7551. case 37:
  7552. return "%";
  7553. case 38:
  7554. return "&";
  7555. case 39:
  7556. return "'";
  7557. case 40:
  7558. return "(";
  7559. case 41:
  7560. return ")";
  7561. case 42:
  7562. return "*";
  7563. case 43:
  7564. return "+";
  7565. case 44:
  7566. return ",";
  7567. case 45:
  7568. return "-";
  7569. case 46:
  7570. return ".";
  7571. case 47:
  7572. return "/";
  7573. case 48:
  7574. return "0";
  7575. case 49:
  7576. return "1";
  7577. case 50:
  7578. return "2";
  7579. case 51:
  7580. return "3";
  7581. case 52:
  7582. return "4";
  7583. case 53:
  7584. return "5";
  7585. case 54:
  7586. return "6";
  7587. case 55:
  7588. return "7";
  7589. case 56:
  7590. return "8";
  7591. case 57:
  7592. return "9";
  7593. case 58:
  7594. return ":";
  7595. case 59:
  7596. return ";";
  7597. case 60:
  7598. return "<";
  7599. case 61:
  7600. return "=";
  7601. case 62:
  7602. return ">";
  7603. case 63:
  7604. return "?";
  7605. case 64:
  7606. return "@";
  7607. case 65:
  7608. return "A";
  7609. case 66:
  7610. return "B";
  7611. case 67:
  7612. return "C";
  7613. case 68:
  7614. return "D";
  7615. case 69:
  7616. return "E";
  7617. case 70:
  7618. return "F";
  7619. case 71:
  7620. return "G";
  7621. case 72:
  7622. return "H";
  7623. case 73:
  7624. return "I";
  7625. case 74:
  7626. return "J";
  7627. case 75:
  7628. return "K";
  7629. case 76:
  7630. return "L";
  7631. case 77:
  7632. return "M";
  7633. case 78:
  7634. return "N";
  7635. case 79:
  7636. return "O";
  7637. case 80:
  7638. return "P";
  7639. case 81:
  7640. return "Q";
  7641. case 82:
  7642. return "R";
  7643. case 83:
  7644. return "S";
  7645. case 84:
  7646. return "T";
  7647. case 85:
  7648. return "U";
  7649. case 86:
  7650. return "V";
  7651. case 87:
  7652. return "W";
  7653. case 88:
  7654. return "X";
  7655. case 89:
  7656. return "Y";
  7657. case 90:
  7658. return "Z";
  7659. case 91:
  7660. return "[";
  7661. case 92:
  7662. return "\\\\";
  7663. case 93:
  7664. return "]";
  7665. case 94:
  7666. return "^";
  7667. case 95:
  7668. return "_";
  7669. case 96:
  7670. return "`";
  7671. case 97:
  7672. return "a";
  7673. case 98:
  7674. return "b";
  7675. case 99:
  7676. return "c";
  7677. case 100:
  7678. return "d";
  7679. case 101:
  7680. return "e";
  7681. case 102:
  7682. return "f";
  7683. case 103:
  7684. return "g";
  7685. case 104:
  7686. return "h";
  7687. case 105:
  7688. return "i";
  7689. case 106:
  7690. return "j";
  7691. case 107:
  7692. return "k";
  7693. case 108:
  7694. return "l";
  7695. case 109:
  7696. return "m";
  7697. case 110:
  7698. return "n";
  7699. case 111:
  7700. return "o";
  7701. case 112:
  7702. return "p";
  7703. case 113:
  7704. return "q";
  7705. case 114:
  7706. return "r";
  7707. case 115:
  7708. return "s";
  7709. case 116:
  7710. return "t";
  7711. case 117:
  7712. return "u";
  7713. case 118:
  7714. return "v";
  7715. case 119:
  7716. return "w";
  7717. case 120:
  7718. return "x";
  7719. case 121:
  7720. return "y";
  7721. case 122:
  7722. return "z";
  7723. case 123:
  7724. return "{";
  7725. case 124:
  7726. return "|";
  7727. case 125:
  7728. return "}";
  7729. case 126:
  7730. return "~";
  7731. case 127:
  7732. return "\\x7F";
  7733. case 128:
  7734. return "\\x80";
  7735. case 129:
  7736. return "\\x81";
  7737. case 130:
  7738. return "\\x82";
  7739. case 131:
  7740. return "\\x83";
  7741. case 132:
  7742. return "\\x84";
  7743. case 133:
  7744. return "\\x85";
  7745. case 134:
  7746. return "\\x86";
  7747. case 135:
  7748. return "\\x87";
  7749. case 136:
  7750. return "\\x88";
  7751. case 137:
  7752. return "\\x89";
  7753. case 138:
  7754. return "\\x8A";
  7755. case 139:
  7756. return "\\x8B";
  7757. case 140:
  7758. return "\\x8C";
  7759. case 141:
  7760. return "\\x8D";
  7761. case 142:
  7762. return "\\x8E";
  7763. case 143:
  7764. return "\\x8F";
  7765. case 144:
  7766. return "\\x90";
  7767. case 145:
  7768. return "\\x91";
  7769. case 146:
  7770. return "\\x92";
  7771. case 147:
  7772. return "\\x93";
  7773. case 148:
  7774. return "\\x94";
  7775. case 149:
  7776. return "\\x95";
  7777. case 150:
  7778. return "\\x96";
  7779. case 151:
  7780. return "\\x97";
  7781. case 152:
  7782. return "\\x98";
  7783. case 153:
  7784. return "\\x99";
  7785. case 154:
  7786. return "\\x9A";
  7787. case 155:
  7788. return "\\x9B";
  7789. case 156:
  7790. return "\\x9C";
  7791. case 157:
  7792. return "\\x9D";
  7793. case 158:
  7794. return "\\x9E";
  7795. case 159:
  7796. return "\\x9F";
  7797. case 160:
  7798. return "\\xA0";
  7799. case 161:
  7800. return "\\xA1";
  7801. case 162:
  7802. return "\\xA2";
  7803. case 163:
  7804. return "\\xA3";
  7805. case 164:
  7806. return "\\xA4";
  7807. case 165:
  7808. return "\\xA5";
  7809. case 166:
  7810. return "\\xA6";
  7811. case 167:
  7812. return "\\xA7";
  7813. case 168:
  7814. return "\\xA8";
  7815. case 169:
  7816. return "\\xA9";
  7817. case 170:
  7818. return "\\xAA";
  7819. case 171:
  7820. return "\\xAB";
  7821. case 172:
  7822. return "\\xAC";
  7823. case 173:
  7824. return "\\xAD";
  7825. case 174:
  7826. return "\\xAE";
  7827. case 175:
  7828. return "\\xAF";
  7829. case 176:
  7830. return "\\xB0";
  7831. case 177:
  7832. return "\\xB1";
  7833. case 178:
  7834. return "\\xB2";
  7835. case 179:
  7836. return "\\xB3";
  7837. case 180:
  7838. return "\\xB4";
  7839. case 181:
  7840. return "\\xB5";
  7841. case 182:
  7842. return "\\xB6";
  7843. case 183:
  7844. return "\\xB7";
  7845. case 184:
  7846. return "\\xB8";
  7847. case 185:
  7848. return "\\xB9";
  7849. case 186:
  7850. return "\\xBA";
  7851. case 187:
  7852. return "\\xBB";
  7853. case 188:
  7854. return "\\xBC";
  7855. case 189:
  7856. return "\\xBD";
  7857. case 190:
  7858. return "\\xBE";
  7859. case 191:
  7860. return "\\xBF";
  7861. case 192:
  7862. return "\\xC0";
  7863. case 193:
  7864. return "\\xC1";
  7865. case 194:
  7866. return "\\xC2";
  7867. case 195:
  7868. return "\\xC3";
  7869. case 196:
  7870. return "\\xC4";
  7871. case 197:
  7872. return "\\xC5";
  7873. case 198:
  7874. return "\\xC6";
  7875. case 199:
  7876. return "\\xC7";
  7877. case 200:
  7878. return "\\xC8";
  7879. case 201:
  7880. return "\\xC9";
  7881. case 202:
  7882. return "\\xCA";
  7883. case 203:
  7884. return "\\xCB";
  7885. case 204:
  7886. return "\\xCC";
  7887. case 205:
  7888. return "\\xCD";
  7889. case 206:
  7890. return "\\xCE";
  7891. case 207:
  7892. return "\\xCF";
  7893. case 208:
  7894. return "\\xD0";
  7895. case 209:
  7896. return "\\xD1";
  7897. case 210:
  7898. return "\\xD2";
  7899. case 211:
  7900. return "\\xD3";
  7901. case 212:
  7902. return "\\xD4";
  7903. case 213:
  7904. return "\\xD5";
  7905. case 214:
  7906. return "\\xD6";
  7907. case 215:
  7908. return "\\xD7";
  7909. case 216:
  7910. return "\\xD8";
  7911. case 217:
  7912. return "\\xD9";
  7913. case 218:
  7914. return "\\xDA";
  7915. case 219:
  7916. return "\\xDB";
  7917. case 220:
  7918. return "\\xDC";
  7919. case 221:
  7920. return "\\xDD";
  7921. case 222:
  7922. return "\\xDE";
  7923. case 223:
  7924. return "\\xDF";
  7925. case 224:
  7926. return "\\xE0";
  7927. case 225:
  7928. return "\\xE1";
  7929. case 226:
  7930. return "\\xE2";
  7931. case 227:
  7932. return "\\xE3";
  7933. case 228:
  7934. return "\\xE4";
  7935. case 229:
  7936. return "\\xE5";
  7937. case 230:
  7938. return "\\xE6";
  7939. case 231:
  7940. return "\\xE7";
  7941. case 232:
  7942. return "\\xE8";
  7943. case 233:
  7944. return "\\xE9";
  7945. case 234:
  7946. return "\\xEA";
  7947. case 235:
  7948. return "\\xEB";
  7949. case 236:
  7950. return "\\xEC";
  7951. case 237:
  7952. return "\\xED";
  7953. case 238:
  7954. return "\\xEE";
  7955. case 239:
  7956. return "\\xEF";
  7957. case 240:
  7958. return "\\xF0";
  7959. case 241:
  7960. return "\\xF1";
  7961. case 242:
  7962. return "\\xF2";
  7963. case 243:
  7964. return "\\xF3";
  7965. case 244:
  7966. return "\\xF4";
  7967. case 245:
  7968. return "\\xF5";
  7969. case 246:
  7970. return "\\xF6";
  7971. case 247:
  7972. return "\\xF7";
  7973. case 248:
  7974. return "\\xF8";
  7975. case 249:
  7976. return "\\xF9";
  7977. case 250:
  7978. return "\\xFA";
  7979. case 251:
  7980. return "\\xFB";
  7981. case 252:
  7982. return "\\xFC";
  7983. case 253:
  7984. return "\\xFD";
  7985. case 254:
  7986. return "\\xFE";
  7987. case 255:
  7988. return "\\xFF";
  7989. default:
  7990. assert(0); /* never gets here */
  7991. return "dead code";
  7992. }
  7993. assert(0); /* never gets here */
  7994. }
  7995. #endif /* XML_GE == 1 */
  7996. static unsigned long
  7997. getDebugLevel(const char *variableName, unsigned long defaultDebugLevel) {
  7998. const char *const valueOrNull = getenv(variableName);
  7999. if (valueOrNull == NULL) {
  8000. return defaultDebugLevel;
  8001. }
  8002. const char *const value = valueOrNull;
  8003. errno = 0;
  8004. char *afterValue = NULL;
  8005. unsigned long debugLevel = strtoul(value, &afterValue, 10);
  8006. if ((errno != 0) || (afterValue == value) || (afterValue[0] != '\0')) {
  8007. errno = 0;
  8008. return defaultDebugLevel;
  8009. }
  8010. return debugLevel;
  8011. }