.. cmake-module:: ../../Modules/CPackBundle.cmake meta name='generator' content='cgit v0.12'/> <meta name='robots' content='index, nofollow'/> <link rel='stylesheet' type='text/css' href='/cgit-data/cgit-techsat.css'/> <link rel='shortcut icon' href='/favicon.ico'/> <link rel='alternate' title='Atom feed' href='http://service.techsat.com/oss-git/cpython.git/atom/Python/dtoa.c?h=v3.10.11' type='application/atom+xml'/> </head> <body> <div id='cgit'><table id='header'> <tr> <td class='logo' rowspan='2'><a href='/oss-git/'><img src='/cgit-data/cgit.png' alt='cgit logo'/></a></td> <td class='main'><a href='/oss-git/'>index</a> : <a title='cpython.git' href='/oss-git/cpython.git/'>cpython.git</a></td><td class='form'><form method='get' action=''> <input type='hidden' name='id' value='9028a101440bd1526cf1fa0e77db8b4b1200fc29'/><select name='h' onchange='this.form.submit();'> <option value='2.7'>2.7</option> <option value='3.3'>3.3</option> <option value='3.4'>3.4</option> <option value='3.5'>3.5</option> <option value='3.6'>3.6</option> <option value='benjamin-clang'>benjamin-clang</option> <option value='benjamin-iteration-torture'>benjamin-iteration-torture</option> <option value='buildbot-custom'>buildbot-custom</option> <option value='master'>master</option> </select> <input type='submit' name='' value='switch'/></form></td></tr> <tr><td class='sub'>https://github.com/python/cpython.git</td><td class='sub right'></td></tr></table> <table class='tabs'><tr><td> <a href='/oss-git/cpython.git/?h=v3.10.11'>summary</a><a href='/oss-git/cpython.git/refs/?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>refs</a><a href='/oss-git/cpython.git/log/Python/dtoa.c?h=v3.10.11'>log</a><a class='active' href='/oss-git/cpython.git/tree/Python/dtoa.c?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>tree</a><a href='/oss-git/cpython.git/commit/Python/dtoa.c?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>commit</a><a href='/oss-git/cpython.git/diff/Python/dtoa.c?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>diff</a><a href='/oss-git/cpython.git/stats/Python/dtoa.c?h=v3.10.11'>stats</a></td><td class='form'><form class='right' method='get' action='/oss-git/cpython.git/log/Python/dtoa.c'> <input type='hidden' name='h' value='v3.10.11'/><input type='hidden' name='id' value='9028a101440bd1526cf1fa0e77db8b4b1200fc29'/><select name='qt'> <option value='grep'>log msg</option> <option value='author'>author</option> <option value='committer'>committer</option> <option value='range'>range</option> </select> <input class='txt' type='text' size='10' name='q' value=''/> <input type='submit' value='search'/> </form> </td></tr></table> <div class='path'>path: <a href='/oss-git/cpython.git/tree/?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>root</a>/<a href='/oss-git/cpython.git/tree/Python?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>Python</a>/<a href='/oss-git/cpython.git/tree/Python/dtoa.c?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>dtoa.c</a></div><div class='content'>blob: 82b6faa80c2e733a34e3f74c08de104160777721 (<a href='/oss-git/cpython.git/plain/Python/dtoa.c?h=v3.10.11&id=9028a101440bd1526cf1fa0e77db8b4b1200fc29'>plain</a>) <table summary='blob content' class='blob'> <tr><td class='linenumbers'><pre><a id='n1' href='#n1'>1</a> <a id='n2' href='#n2'>2</a> <a id='n3' href='#n3'>3</a> <a id='n4' href='#n4'>4</a> <a id='n5' href='#n5'>5</a> <a id='n6' href='#n6'>6</a> <a id='n7' href='#n7'>7</a> <a id='n8' href='#n8'>8</a> <a id='n9' href='#n9'>9</a> <a id='n10' href='#n10'>10</a> <a id='n11' href='#n11'>11</a> <a id='n12' href='#n12'>12</a> <a id='n13' href='#n13'>13</a> <a id='n14' href='#n14'>14</a> <a id='n15' href='#n15'>15</a> <a id='n16' href='#n16'>16</a> <a id='n17' href='#n17'>17</a> <a id='n18' href='#n18'>18</a> <a id='n19' href='#n19'>19</a> <a id='n20' href='#n20'>20</a> <a id='n21' href='#n21'>21</a> <a id='n22' href='#n22'>22</a> <a id='n23' href='#n23'>23</a> <a id='n24' href='#n24'>24</a> <a id='n25' href='#n25'>25</a> <a id='n26' href='#n26'>26</a> <a id='n27' href='#n27'>27</a> <a id='n28' href='#n28'>28</a> <a id='n29' href='#n29'>29</a> <a id='n30' href='#n30'>30</a> <a id='n31' href='#n31'>31</a> <a id='n32' href='#n32'>32</a> <a id='n33' href='#n33'>33</a> <a id='n34' href='#n34'>34</a> <a id='n35' href='#n35'>35</a> <a id='n36' href='#n36'>36</a> <a id='n37' href='#n37'>37</a> <a id='n38' href='#n38'>38</a> <a id='n39' href='#n39'>39</a> <a id='n40' href='#n40'>40</a> <a id='n41' href='#n41'>41</a> <a id='n42' href='#n42'>42</a> <a id='n43' href='#n43'>43</a> <a id='n44' href='#n44'>44</a> <a id='n45' href='#n45'>45</a> <a id='n46' href='#n46'>46</a> <a id='n47' href='#n47'>47</a> <a id='n48' href='#n48'>48</a> <a id='n49' href='#n49'>49</a> <a id='n50' href='#n50'>50</a> <a id='n51' href='#n51'>51</a> <a id='n52' href='#n52'>52</a> <a id='n53' href='#n53'>53</a> <a id='n54' href='#n54'>54</a> <a id='n55' href='#n55'>55</a> <a id='n56' href='#n56'>56</a> <a id='n57' href='#n57'>57</a> <a id='n58' href='#n58'>58</a> <a id='n59' href='#n59'>59</a> <a id='n60' href='#n60'>60</a> <a id='n61' href='#n61'>61</a> <a id='n62' href='#n62'>62</a> <a id='n63' href='#n63'>63</a> <a id='n64' href='#n64'>64</a> <a id='n65' href='#n65'>65</a> <a id='n66' href='#n66'>66</a> <a id='n67' href='#n67'>67</a> <a id='n68' href='#n68'>68</a> <a id='n69' href='#n69'>69</a> <a id='n70' href='#n70'>70</a> <a id='n71' href='#n71'>71</a> <a id='n72' href='#n72'>72</a> <a id='n73' href='#n73'>73</a> <a id='n74' href='#n74'>74</a> <a id='n75' href='#n75'>75</a> <a id='n76' href='#n76'>76</a> <a id='n77' href='#n77'>77</a> <a id='n78' href='#n78'>78</a> <a id='n79' href='#n79'>79</a> <a id='n80' href='#n80'>80</a> <a id='n81' href='#n81'>81</a> <a id='n82' href='#n82'>82</a> <a id='n83' href='#n83'>83</a> <a id='n84' href='#n84'>84</a> <a id='n85' href='#n85'>85</a> <a id='n86' href='#n86'>86</a> <a id='n87' href='#n87'>87</a> <a id='n88' href='#n88'>88</a> <a id='n89' href='#n89'>89</a> <a id='n90' href='#n90'>90</a> <a id='n91' href='#n91'>91</a> <a id='n92' href='#n92'>92</a> <a id='n93' href='#n93'>93</a> <a id='n94' href='#n94'>94</a> <a id='n95' href='#n95'>95</a> <a id='n96' href='#n96'>96</a> <a id='n97' href='#n97'>97</a> <a id='n98' href='#n98'>98</a> <a id='n99' href='#n99'>99</a> <a id='n100' href='#n100'>100</a> <a id='n101' href='#n101'>101</a> <a id='n102' href='#n102'>102</a> <a id='n103' href='#n103'>103</a> <a id='n104' href='#n104'>104</a> <a id='n105' href='#n105'>105</a> <a id='n106' href='#n106'>106</a> <a id='n107' href='#n107'>107</a> <a id='n108' href='#n108'>108</a> <a id='n109' href='#n109'>109</a> <a id='n110' href='#n110'>110</a> <a id='n111' href='#n111'>111</a> <a id='n112' href='#n112'>112</a> <a id='n113' href='#n113'>113</a> <a id='n114' href='#n114'>114</a> <a id='n115' href='#n115'>115</a> <a id='n116' href='#n116'>116</a> <a id='n117' href='#n117'>117</a> <a id='n118' href='#n118'>118</a> <a id='n119' href='#n119'>119</a> <a id='n120' href='#n120'>120</a> <a id='n121' href='#n121'>121</a> <a id='n122' href='#n122'>122</a> <a id='n123' href='#n123'>123</a> <a id='n124' href='#n124'>124</a> <a id='n125' href='#n125'>125</a> <a id='n126' href='#n126'>126</a> <a id='n127' href='#n127'>127</a> <a id='n128' href='#n128'>128</a> <a id='n129' href='#n129'>129</a> <a id='n130' href='#n130'>130</a> <a id='n131' href='#n131'>131</a> <a id='n132' href='#n132'>132</a> <a id='n133' href='#n133'>133</a> <a id='n134' href='#n134'>134</a> <a id='n135' href='#n135'>135</a> <a id='n136' href='#n136'>136</a> <a id='n137' href='#n137'>137</a> <a id='n138' href='#n138'>138</a> <a id='n139' href='#n139'>139</a> <a id='n140' href='#n140'>140</a> <a id='n141' href='#n141'>141</a> <a id='n142' href='#n142'>142</a> <a id='n143' href='#n143'>143</a> <a id='n144' href='#n144'>144</a> <a id='n145' href='#n145'>145</a> <a id='n146' href='#n146'>146</a> <a id='n147' href='#n147'>147</a> <a id='n148' href='#n148'>148</a> <a id='n149' href='#n149'>149</a> <a id='n150' href='#n150'>150</a> <a id='n151' href='#n151'>151</a> <a id='n152' href='#n152'>152</a> <a id='n153' href='#n153'>153</a> <a id='n154' href='#n154'>154</a> <a id='n155' href='#n155'>155</a> <a id='n156' href='#n156'>156</a> <a id='n157' href='#n157'>157</a> <a id='n158' href='#n158'>158</a> <a id='n159' href='#n159'>159</a> <a id='n160' href='#n160'>160</a> <a id='n161' href='#n161'>161</a> <a id='n162' href='#n162'>162</a> <a id='n163' href='#n163'>163</a> <a id='n164' href='#n164'>164</a> <a id='n165' href='#n165'>165</a> <a id='n166' href='#n166'>166</a> <a id='n167' href='#n167'>167</a> <a id='n168' href='#n168'>168</a> <a id='n169' href='#n169'>169</a> <a id='n170' href='#n170'>170</a> <a id='n171' href='#n171'>171</a> <a id='n172' href='#n172'>172</a> <a id='n173' href='#n173'>173</a> <a id='n174' href='#n174'>174</a> <a id='n175' href='#n175'>175</a> <a id='n176' href='#n176'>176</a> <a id='n177' href='#n177'>177</a> <a id='n178' href='#n178'>178</a> <a id='n179' href='#n179'>179</a> <a id='n180' href='#n180'>180</a> <a id='n181' href='#n181'>181</a> <a id='n182' href='#n182'>182</a> <a id='n183' href='#n183'>183</a> <a id='n184' href='#n184'>184</a> <a id='n185' href='#n185'>185</a> <a id='n186' href='#n186'>186</a> <a id='n187' href='#n187'>187</a> <a id='n188' href='#n188'>188</a> <a id='n189' href='#n189'>189</a> <a id='n190' href='#n190'>190</a> <a id='n191' href='#n191'>191</a> <a id='n192' href='#n192'>192</a> <a id='n193' href='#n193'>193</a> <a id='n194' href='#n194'>194</a> <a id='n195' href='#n195'>195</a> <a id='n196' href='#n196'>196</a> <a id='n197' href='#n197'>197</a> <a id='n198' href='#n198'>198</a> <a id='n199' href='#n199'>199</a> <a id='n200' href='#n200'>200</a> <a id='n201' href='#n201'>201</a> <a id='n202' href='#n202'>202</a> <a id='n203' href='#n203'>203</a> <a id='n204' href='#n204'>204</a> <a id='n205' href='#n205'>205</a> <a id='n206' href='#n206'>206</a> <a id='n207' href='#n207'>207</a> <a id='n208' href='#n208'>208</a> <a id='n209' href='#n209'>209</a> <a id='n210' href='#n210'>210</a> <a id='n211' href='#n211'>211</a> <a id='n212' href='#n212'>212</a> <a id='n213' href='#n213'>213</a> <a id='n214' href='#n214'>214</a> <a id='n215' href='#n215'>215</a> <a id='n216' href='#n216'>216</a> <a id='n217' href='#n217'>217</a> <a id='n218' href='#n218'>218</a> <a id='n219' href='#n219'>219</a> <a id='n220' href='#n220'>220</a> <a id='n221' href='#n221'>221</a> <a id='n222' href='#n222'>222</a> <a id='n223' href='#n223'>223</a> <a id='n224' href='#n224'>224</a> <a id='n225' href='#n225'>225</a> <a id='n226' href='#n226'>226</a> <a id='n227' href='#n227'>227</a> <a id='n228' href='#n228'>228</a> <a id='n229' href='#n229'>229</a> <a id='n230' href='#n230'>230</a> <a id='n231' href='#n231'>231</a> <a id='n232' href='#n232'>232</a> <a id='n233' href='#n233'>233</a> <a id='n234' href='#n234'>234</a> <a id='n235' href='#n235'>235</a> <a id='n236' href='#n236'>236</a> <a id='n237' href='#n237'>237</a> <a id='n238' href='#n238'>238</a> <a id='n239' href='#n239'>239</a> <a id='n240' href='#n240'>240</a> <a id='n241' href='#n241'>241</a> <a id='n242' href='#n242'>242</a> <a id='n243' href='#n243'>243</a> <a id='n244' href='#n244'>244</a> <a id='n245' href='#n245'>245</a> <a id='n246' href='#n246'>246</a> <a id='n247' href='#n247'>247</a> <a id='n248' href='#n248'>248</a> <a id='n249' href='#n249'>249</a> <a id='n250' href='#n250'>250</a> <a id='n251' href='#n251'>251</a> <a id='n252' href='#n252'>252</a> <a id='n253' href='#n253'>253</a> <a id='n254' href='#n254'>254</a> <a id='n255' href='#n255'>255</a> <a id='n256' href='#n256'>256</a> <a id='n257' href='#n257'>257</a> <a id='n258' href='#n258'>258</a> <a id='n259' href='#n259'>259</a> <a id='n260' href='#n260'>260</a> <a id='n261' href='#n261'>261</a> <a id='n262' href='#n262'>262</a> <a id='n263' href='#n263'>263</a> <a id='n264' href='#n264'>264</a> <a id='n265' href='#n265'>265</a> <a id='n266' href='#n266'>266</a> <a id='n267' href='#n267'>267</a> <a id='n268' href='#n268'>268</a> <a id='n269' href='#n269'>269</a> <a id='n270' href='#n270'>270</a> <a id='n271' href='#n271'>271</a> <a id='n272' href='#n272'>272</a> <a id='n273' href='#n273'>273</a> <a id='n274' href='#n274'>274</a> <a id='n275' href='#n275'>275</a> <a id='n276' href='#n276'>276</a> <a id='n277' href='#n277'>277</a> <a id='n278' href='#n278'>278</a> <a id='n279' href='#n279'>279</a> <a id='n280' href='#n280'>280</a> <a id='n281' href='#n281'>281</a> <a id='n282' href='#n282'>282</a> <a id='n283' href='#n283'>283</a> <a id='n284' href='#n284'>284</a> <a id='n285' href='#n285'>285</a> <a id='n286' href='#n286'>286</a> <a id='n287' href='#n287'>287</a> <a id='n288' href='#n288'>288</a> <a id='n289' href='#n289'>289</a> <a id='n290' href='#n290'>290</a> <a id='n291' href='#n291'>291</a> <a id='n292' href='#n292'>292</a> <a id='n293' href='#n293'>293</a> <a id='n294' href='#n294'>294</a> <a id='n295' href='#n295'>295</a> <a id='n296' href='#n296'>296</a> <a id='n297' href='#n297'>297</a> <a id='n298' href='#n298'>298</a> <a id='n299' href='#n299'>299</a> <a id='n300' href='#n300'>300</a> <a id='n301' href='#n301'>301</a> <a id='n302' href='#n302'>302</a> <a id='n303' href='#n303'>303</a> <a id='n304' href='#n304'>304</a> <a id='n305' href='#n305'>305</a> <a id='n306' href='#n306'>306</a> <a id='n307' href='#n307'>307</a> <a id='n308' href='#n308'>308</a> <a id='n309' href='#n309'>309</a> <a id='n310' href='#n310'>310</a> <a id='n311' href='#n311'>311</a> <a id='n312' href='#n312'>312</a> <a id='n313' href='#n313'>313</a> <a id='n314' href='#n314'>314</a> <a id='n315' href='#n315'>315</a> <a id='n316' href='#n316'>316</a> <a id='n317' href='#n317'>317</a> <a id='n318' href='#n318'>318</a> <a id='n319' href='#n319'>319</a> <a id='n320' href='#n320'>320</a> <a id='n321' href='#n321'>321</a> <a id='n322' href='#n322'>322</a> <a id='n323' href='#n323'>323</a> <a id='n324' href='#n324'>324</a> <a id='n325' href='#n325'>325</a> <a id='n326' href='#n326'>326</a> <a id='n327' href='#n327'>327</a> <a id='n328' href='#n328'>328</a> <a id='n329' href='#n329'>329</a> <a id='n330' href='#n330'>330</a> <a id='n331' href='#n331'>331</a> <a id='n332' href='#n332'>332</a> <a id='n333' href='#n333'>333</a> <a id='n334' href='#n334'>334</a> <a id='n335' href='#n335'>335</a> <a id='n336' href='#n336'>336</a> <a id='n337' href='#n337'>337</a> <a id='n338' href='#n338'>338</a> <a id='n339' href='#n339'>339</a> <a id='n340' href='#n340'>340</a> <a id='n341' href='#n341'>341</a> <a id='n342' href='#n342'>342</a> <a id='n343' href='#n343'>343</a> <a id='n344' href='#n344'>344</a> <a id='n345' href='#n345'>345</a> <a id='n346' href='#n346'>346</a> <a id='n347' href='#n347'>347</a> <a id='n348' href='#n348'>348</a> <a id='n349' href='#n349'>349</a> <a id='n350' href='#n350'>350</a> <a id='n351' href='#n351'>351</a> <a id='n352' href='#n352'>352</a> <a id='n353' href='#n353'>353</a> <a id='n354' href='#n354'>354</a> <a id='n355' href='#n355'>355</a> <a id='n356' href='#n356'>356</a> <a id='n357' href='#n357'>357</a> <a id='n358' href='#n358'>358</a> <a id='n359' href='#n359'>359</a> <a id='n360' href='#n360'>360</a> <a id='n361' href='#n361'>361</a> <a id='n362' href='#n362'>362</a> <a id='n363' href='#n363'>363</a> <a id='n364' href='#n364'>364</a> <a id='n365' href='#n365'>365</a> <a id='n366' href='#n366'>366</a> <a id='n367' href='#n367'>367</a> <a id='n368' href='#n368'>368</a> <a id='n369' href='#n369'>369</a> <a id='n370' href='#n370'>370</a> <a id='n371' href='#n371'>371</a> <a id='n372' href='#n372'>372</a> <a id='n373' href='#n373'>373</a> <a id='n374' href='#n374'>374</a> <a id='n375' href='#n375'>375</a> <a id='n376' href='#n376'>376</a> <a id='n377' href='#n377'>377</a> <a id='n378' href='#n378'>378</a> <a id='n379' href='#n379'>379</a> <a id='n380' href='#n380'>380</a> <a id='n381' href='#n381'>381</a> <a id='n382' href='#n382'>382</a> <a id='n383' href='#n383'>383</a> <a id='n384' href='#n384'>384</a> <a id='n385' href='#n385'>385</a> <a id='n386' href='#n386'>386</a> <a id='n387' href='#n387'>387</a> <a id='n388' href='#n388'>388</a> <a id='n389' href='#n389'>389</a> <a id='n390' href='#n390'>390</a> <a id='n391' href='#n391'>391</a> <a id='n392' href='#n392'>392</a> <a id='n393' href='#n393'>393</a> <a id='n394' href='#n394'>394</a> <a id='n395' href='#n395'>395</a> <a id='n396' href='#n396'>396</a> <a id='n397' href='#n397'>397</a> <a id='n398' href='#n398'>398</a> <a id='n399' href='#n399'>399</a> <a id='n400' href='#n400'>400</a> <a id='n401' href='#n401'>401</a> <a id='n402' href='#n402'>402</a> <a id='n403' href='#n403'>403</a> <a id='n404' href='#n404'>404</a> <a id='n405' href='#n405'>405</a> <a id='n406' href='#n406'>406</a> <a id='n407' href='#n407'>407</a> <a id='n408' href='#n408'>408</a> <a id='n409' href='#n409'>409</a> <a id='n410' href='#n410'>410</a> <a id='n411' href='#n411'>411</a> <a id='n412' href='#n412'>412</a> <a id='n413' href='#n413'>413</a> <a id='n414' href='#n414'>414</a> <a id='n415' href='#n415'>415</a> <a id='n416' href='#n416'>416</a> <a id='n417' href='#n417'>417</a> <a id='n418' href='#n418'>418</a> <a id='n419' href='#n419'>419</a> <a id='n420' href='#n420'>420</a> <a id='n421' href='#n421'>421</a> <a id='n422' href='#n422'>422</a> <a id='n423' href='#n423'>423</a> <a id='n424' href='#n424'>424</a> <a id='n425' href='#n425'>425</a> <a id='n426' href='#n426'>426</a> <a id='n427' href='#n427'>427</a> <a id='n428' href='#n428'>428</a> <a id='n429' href='#n429'>429</a> <a id='n430' href='#n430'>430</a> <a id='n431' href='#n431'>431</a> <a id='n432' href='#n432'>432</a> <a id='n433' href='#n433'>433</a> <a id='n434' href='#n434'>434</a> <a id='n435' href='#n435'>435</a> <a id='n436' href='#n436'>436</a> <a id='n437' href='#n437'>437</a> <a id='n438' href='#n438'>438</a> <a id='n439' href='#n439'>439</a> <a id='n440' href='#n440'>440</a> <a id='n441' href='#n441'>441</a> <a id='n442' href='#n442'>442</a> <a id='n443' href='#n443'>443</a> <a id='n444' href='#n444'>444</a> <a id='n445' href='#n445'>445</a> <a id='n446' href='#n446'>446</a> <a id='n447' href='#n447'>447</a> <a id='n448' href='#n448'>448</a> <a id='n449' href='#n449'>449</a> <a id='n450' href='#n450'>450</a> <a id='n451' href='#n451'>451</a> <a id='n452' href='#n452'>452</a> <a id='n453' href='#n453'>453</a> <a id='n454' href='#n454'>454</a> <a id='n455' href='#n455'>455</a> <a id='n456' href='#n456'>456</a> <a id='n457' href='#n457'>457</a> <a id='n458' href='#n458'>458</a> <a id='n459' href='#n459'>459</a> <a id='n460' href='#n460'>460</a> <a id='n461' href='#n461'>461</a> <a id='n462' href='#n462'>462</a> <a id='n463' href='#n463'>463</a> <a id='n464' href='#n464'>464</a> <a id='n465' href='#n465'>465</a> <a id='n466' href='#n466'>466</a> <a id='n467' href='#n467'>467</a> <a id='n468' href='#n468'>468</a> <a id='n469' href='#n469'>469</a> <a id='n470' href='#n470'>470</a> <a id='n471' href='#n471'>471</a> <a id='n472' href='#n472'>472</a> <a id='n473' href='#n473'>473</a> <a id='n474' href='#n474'>474</a> <a id='n475' href='#n475'>475</a> <a id='n476' href='#n476'>476</a> <a id='n477' href='#n477'>477</a> <a id='n478' href='#n478'>478</a> <a id='n479' href='#n479'>479</a> <a id='n480' href='#n480'>480</a> <a id='n481' href='#n481'>481</a> <a id='n482' href='#n482'>482</a> <a id='n483' href='#n483'>483</a> <a id='n484' href='#n484'>484</a> <a id='n485' href='#n485'>485</a> <a id='n486' href='#n486'>486</a> <a id='n487' href='#n487'>487</a> <a id='n488' href='#n488'>488</a> <a id='n489' href='#n489'>489</a> <a id='n490' href='#n490'>490</a> <a id='n491' href='#n491'>491</a> <a id='n492' href='#n492'>492</a> <a id='n493' href='#n493'>493</a> <a id='n494' href='#n494'>494</a> <a id='n495' href='#n495'>495</a> <a id='n496' href='#n496'>496</a> <a id='n497' href='#n497'>497</a> <a id='n498' href='#n498'>498</a> <a id='n499' href='#n499'>499</a> <a id='n500' href='#n500'>500</a> <a id='n501' href='#n501'>501</a> <a id='n502' href='#n502'>502</a> <a id='n503' href='#n503'>503</a> <a id='n504' href='#n504'>504</a> <a id='n505' href='#n505'>505</a> <a id='n506' href='#n506'>506</a> <a id='n507' href='#n507'>507</a> <a id='n508' href='#n508'>508</a> <a id='n509' href='#n509'>509</a> <a id='n510' href='#n510'>510</a> <a id='n511' href='#n511'>511</a> <a id='n512' href='#n512'>512</a> <a id='n513' href='#n513'>513</a> <a id='n514' href='#n514'>514</a> <a id='n515' href='#n515'>515</a> <a id='n516' href='#n516'>516</a> <a id='n517' href='#n517'>517</a> <a id='n518' href='#n518'>518</a> <a id='n519' href='#n519'>519</a> <a id='n520' href='#n520'>520</a> <a id='n521' href='#n521'>521</a> <a id='n522' href='#n522'>522</a> <a id='n523' href='#n523'>523</a> <a id='n524' href='#n524'>524</a> <a id='n525' href='#n525'>525</a> <a id='n526' href='#n526'>526</a> <a id='n527' href='#n527'>527</a> <a id='n528' href='#n528'>528</a> <a id='n529' href='#n529'>529</a> <a id='n530' href='#n530'>530</a> <a id='n531' href='#n531'>531</a> <a id='n532' href='#n532'>532</a> <a id='n533' href='#n533'>533</a> <a id='n534' href='#n534'>534</a> <a id='n535' href='#n535'>535</a> <a id='n536' href='#n536'>536</a> <a id='n537' href='#n537'>537</a> <a id='n538' href='#n538'>538</a> <a id='n539' href='#n539'>539</a> <a id='n540' href='#n540'>540</a> <a id='n541' href='#n541'>541</a> <a id='n542' href='#n542'>542</a> <a id='n543' href='#n543'>543</a> <a id='n544' href='#n544'>544</a> <a id='n545' href='#n545'>545</a> <a id='n546' href='#n546'>546</a> <a id='n547' href='#n547'>547</a> <a id='n548' href='#n548'>548</a> <a id='n549' href='#n549'>549</a> <a id='n550' href='#n550'>550</a> <a id='n551' href='#n551'>551</a> <a id='n552' href='#n552'>552</a> <a id='n553' href='#n553'>553</a> <a id='n554' href='#n554'>554</a> <a id='n555' href='#n555'>555</a> <a id='n556' href='#n556'>556</a> <a id='n557' href='#n557'>557</a> <a id='n558' href='#n558'>558</a> <a id='n559' href='#n559'>559</a> <a id='n560' href='#n560'>560</a> <a id='n561' href='#n561'>561</a> <a id='n562' href='#n562'>562</a> <a id='n563' href='#n563'>563</a> <a id='n564' href='#n564'>564</a> <a id='n565' href='#n565'>565</a> <a id='n566' href='#n566'>566</a> <a id='n567' href='#n567'>567</a> <a id='n568' href='#n568'>568</a> <a id='n569' href='#n569'>569</a> <a id='n570' href='#n570'>570</a> <a id='n571' href='#n571'>571</a> <a id='n572' href='#n572'>572</a> <a id='n573' href='#n573'>573</a> <a id='n574' href='#n574'>574</a> <a id='n575' href='#n575'>575</a> <a id='n576' href='#n576'>576</a> <a id='n577' href='#n577'>577</a> <a id='n578' href='#n578'>578</a> <a id='n579' href='#n579'>579</a> <a id='n580' href='#n580'>580</a> <a id='n581' href='#n581'>581</a> <a id='n582' href='#n582'>582</a> <a id='n583' href='#n583'>583</a> <a id='n584' href='#n584'>584</a> <a id='n585' href='#n585'>585</a> <a id='n586' href='#n586'>586</a> <a id='n587' href='#n587'>587</a> <a id='n588' href='#n588'>588</a> <a id='n589' href='#n589'>589</a> <a id='n590' href='#n590'>590</a> <a id='n591' href='#n591'>591</a> <a id='n592' href='#n592'>592</a> <a id='n593' href='#n593'>593</a> <a id='n594' href='#n594'>594</a> <a id='n595' href='#n595'>595</a> <a id='n596' href='#n596'>596</a> <a id='n597' href='#n597'>597</a> <a id='n598' href='#n598'>598</a> <a id='n599' href='#n599'>599</a> <a id='n600' href='#n600'>600</a> <a id='n601' href='#n601'>601</a> <a id='n602' href='#n602'>602</a> <a id='n603' href='#n603'>603</a> <a id='n604' href='#n604'>604</a> <a id='n605' href='#n605'>605</a> <a id='n606' href='#n606'>606</a> <a id='n607' href='#n607'>607</a> <a id='n608' href='#n608'>608</a> <a id='n609' href='#n609'>609</a> <a id='n610' href='#n610'>610</a> <a id='n611' href='#n611'>611</a> <a id='n612' href='#n612'>612</a> <a id='n613' href='#n613'>613</a> <a id='n614' href='#n614'>614</a> <a id='n615' href='#n615'>615</a> <a id='n616' href='#n616'>616</a> <a id='n617' href='#n617'>617</a> <a id='n618' href='#n618'>618</a> <a id='n619' href='#n619'>619</a> <a id='n620' href='#n620'>620</a> <a id='n621' href='#n621'>621</a> <a id='n622' href='#n622'>622</a> <a id='n623' href='#n623'>623</a> <a id='n624' href='#n624'>624</a> <a id='n625' href='#n625'>625</a> <a id='n626' href='#n626'>626</a> <a id='n627' href='#n627'>627</a> <a id='n628' href='#n628'>628</a> <a id='n629' href='#n629'>629</a> <a id='n630' href='#n630'>630</a> <a id='n631' href='#n631'>631</a> <a id='n632' href='#n632'>632</a> <a id='n633' href='#n633'>633</a> <a id='n634' href='#n634'>634</a> <a id='n635' href='#n635'>635</a> <a id='n636' href='#n636'>636</a> <a id='n637' href='#n637'>637</a> <a id='n638' href='#n638'>638</a> <a id='n639' href='#n639'>639</a> <a id='n640' href='#n640'>640</a> <a id='n641' href='#n641'>641</a> <a id='n642' href='#n642'>642</a> <a id='n643' href='#n643'>643</a> <a id='n644' href='#n644'>644</a> <a id='n645' href='#n645'>645</a> <a id='n646' href='#n646'>646</a> <a id='n647' href='#n647'>647</a> <a id='n648' href='#n648'>648</a> <a id='n649' href='#n649'>649</a> <a id='n650' href='#n650'>650</a> <a id='n651' href='#n651'>651</a> <a id='n652' href='#n652'>652</a> <a id='n653' href='#n653'>653</a> <a id='n654' href='#n654'>654</a> <a id='n655' href='#n655'>655</a> <a id='n656' href='#n656'>656</a> <a id='n657' href='#n657'>657</a> <a id='n658' href='#n658'>658</a> <a id='n659' href='#n659'>659</a> <a id='n660' href='#n660'>660</a> <a id='n661' href='#n661'>661</a> <a id='n662' href='#n662'>662</a> <a id='n663' href='#n663'>663</a> <a id='n664' href='#n664'>664</a> <a id='n665' href='#n665'>665</a> <a id='n666' href='#n666'>666</a> <a id='n667' href='#n667'>667</a> <a id='n668' href='#n668'>668</a> <a id='n669' href='#n669'>669</a> <a id='n670' href='#n670'>670</a> <a id='n671' href='#n671'>671</a> <a id='n672' href='#n672'>672</a> <a id='n673' href='#n673'>673</a> <a id='n674' href='#n674'>674</a> <a id='n675' href='#n675'>675</a> <a id='n676' href='#n676'>676</a> <a id='n677' href='#n677'>677</a> <a id='n678' href='#n678'>678</a> <a id='n679' href='#n679'>679</a> <a id='n680' href='#n680'>680</a> <a id='n681' href='#n681'>681</a> <a id='n682' href='#n682'>682</a> <a id='n683' href='#n683'>683</a> <a id='n684' href='#n684'>684</a> <a id='n685' href='#n685'>685</a> <a id='n686' href='#n686'>686</a> <a id='n687' href='#n687'>687</a> <a id='n688' href='#n688'>688</a> <a id='n689' href='#n689'>689</a> <a id='n690' href='#n690'>690</a> <a id='n691' href='#n691'>691</a> <a id='n692' href='#n692'>692</a> <a id='n693' href='#n693'>693</a> <a id='n694' href='#n694'>694</a> <a id='n695' href='#n695'>695</a> <a id='n696' href='#n696'>696</a> <a id='n697' href='#n697'>697</a> <a id='n698' href='#n698'>698</a> <a id='n699' href='#n699'>699</a> <a id='n700' href='#n700'>700</a> <a id='n701' href='#n701'>701</a> <a id='n702' href='#n702'>702</a> <a id='n703' href='#n703'>703</a> <a id='n704' href='#n704'>704</a> <a id='n705' href='#n705'>705</a> <a id='n706' href='#n706'>706</a> <a id='n707' href='#n707'>707</a> <a id='n708' href='#n708'>708</a> <a id='n709' href='#n709'>709</a> <a id='n710' href='#n710'>710</a> <a id='n711' href='#n711'>711</a> <a id='n712' href='#n712'>712</a> <a id='n713' href='#n713'>713</a> <a id='n714' href='#n714'>714</a> <a id='n715' href='#n715'>715</a> <a id='n716' href='#n716'>716</a> <a id='n717' href='#n717'>717</a> <a id='n718' href='#n718'>718</a> <a id='n719' href='#n719'>719</a> <a id='n720' href='#n720'>720</a> <a id='n721' href='#n721'>721</a> <a id='n722' href='#n722'>722</a> <a id='n723' href='#n723'>723</a> <a id='n724' href='#n724'>724</a> <a id='n725' href='#n725'>725</a> <a id='n726' href='#n726'>726</a> <a id='n727' href='#n727'>727</a> <a id='n728' href='#n728'>728</a> <a id='n729' href='#n729'>729</a> <a id='n730' href='#n730'>730</a> <a id='n731' href='#n731'>731</a> <a id='n732' href='#n732'>732</a> <a id='n733' href='#n733'>733</a> <a id='n734' href='#n734'>734</a> <a id='n735' href='#n735'>735</a> <a id='n736' href='#n736'>736</a> <a id='n737' href='#n737'>737</a> <a id='n738' href='#n738'>738</a> <a id='n739' href='#n739'>739</a> <a id='n740' href='#n740'>740</a> <a id='n741' href='#n741'>741</a> <a id='n742' href='#n742'>742</a> <a id='n743' href='#n743'>743</a> <a id='n744' href='#n744'>744</a> <a id='n745' href='#n745'>745</a> <a id='n746' href='#n746'>746</a> <a id='n747' href='#n747'>747</a> <a id='n748' href='#n748'>748</a> <a id='n749' href='#n749'>749</a> <a id='n750' href='#n750'>750</a> <a id='n751' href='#n751'>751</a> <a id='n752' href='#n752'>752</a> <a id='n753' href='#n753'>753</a> <a id='n754' href='#n754'>754</a> <a id='n755' href='#n755'>755</a> <a id='n756' href='#n756'>756</a> <a id='n757' href='#n757'>757</a> <a id='n758' href='#n758'>758</a> <a id='n759' href='#n759'>759</a> <a id='n760' href='#n760'>760</a> <a id='n761' href='#n761'>761</a> <a id='n762' href='#n762'>762</a> <a id='n763' href='#n763'>763</a> <a id='n764' href='#n764'>764</a> <a id='n765' href='#n765'>765</a> <a id='n766' href='#n766'>766</a> <a id='n767' href='#n767'>767</a> <a id='n768' href='#n768'>768</a> <a id='n769' href='#n769'>769</a> <a id='n770' href='#n770'>770</a> <a id='n771' href='#n771'>771</a> <a id='n772' href='#n772'>772</a> <a id='n773' href='#n773'>773</a> <a id='n774' href='#n774'>774</a> <a id='n775' href='#n775'>775</a> <a id='n776' href='#n776'>776</a> <a id='n777' href='#n777'>777</a> <a id='n778' href='#n778'>778</a> <a id='n779' href='#n779'>779</a> <a id='n780' href='#n780'>780</a> <a id='n781' href='#n781'>781</a> <a id='n782' href='#n782'>782</a> <a id='n783' href='#n783'>783</a> <a id='n784' href='#n784'>784</a> <a id='n785' href='#n785'>785</a> <a id='n786' href='#n786'>786</a> <a id='n787' href='#n787'>787</a> <a id='n788' href='#n788'>788</a> <a id='n789' href='#n789'>789</a> <a id='n790' href='#n790'>790</a> <a id='n791' href='#n791'>791</a> <a id='n792' href='#n792'>792</a> <a id='n793' href='#n793'>793</a> <a id='n794' href='#n794'>794</a> <a id='n795' href='#n795'>795</a> <a id='n796' href='#n796'>796</a> <a id='n797' href='#n797'>797</a> <a id='n798' href='#n798'>798</a> <a id='n799' href='#n799'>799</a> <a id='n800' href='#n800'>800</a> <a id='n801' href='#n801'>801</a> <a id='n802' href='#n802'>802</a> <a id='n803' href='#n803'>803</a> <a id='n804' href='#n804'>804</a> <a id='n805' href='#n805'>805</a> <a id='n806' href='#n806'>806</a> <a id='n807' href='#n807'>807</a> <a id='n808' href='#n808'>808</a> <a id='n809' href='#n809'>809</a> <a id='n810' href='#n810'>810</a> <a id='n811' href='#n811'>811</a> <a id='n812' href='#n812'>812</a> <a id='n813' href='#n813'>813</a> <a id='n814' href='#n814'>814</a> <a id='n815' href='#n815'>815</a> <a id='n816' href='#n816'>816</a> <a id='n817' href='#n817'>817</a> <a id='n818' href='#n818'>818</a> <a id='n819' href='#n819'>819</a> <a id='n820' href='#n820'>820</a> <a id='n821' href='#n821'>821</a> <a id='n822' href='#n822'>822</a> <a id='n823' href='#n823'>823</a> <a id='n824' href='#n824'>824</a> <a id='n825' href='#n825'>825</a> <a id='n826' href='#n826'>826</a> <a id='n827' href='#n827'>827</a> <a id='n828' href='#n828'>828</a> <a id='n829' href='#n829'>829</a> <a id='n830' href='#n830'>830</a> <a id='n831' href='#n831'>831</a> <a id='n832' href='#n832'>832</a> <a id='n833' href='#n833'>833</a> <a id='n834' href='#n834'>834</a> <a id='n835' href='#n835'>835</a> <a id='n836' href='#n836'>836</a> <a id='n837' href='#n837'>837</a> <a id='n838' href='#n838'>838</a> <a id='n839' href='#n839'>839</a> <a id='n840' href='#n840'>840</a> <a id='n841' href='#n841'>841</a> <a id='n842' href='#n842'>842</a> <a id='n843' href='#n843'>843</a> <a id='n844' href='#n844'>844</a> <a id='n845' href='#n845'>845</a> <a id='n846' href='#n846'>846</a> <a id='n847' href='#n847'>847</a> <a id='n848' href='#n848'>848</a> <a id='n849' href='#n849'>849</a> <a id='n850' href='#n850'>850</a> <a id='n851' href='#n851'>851</a> <a id='n852' href='#n852'>852</a> <a id='n853' href='#n853'>853</a> <a id='n854' href='#n854'>854</a> <a id='n855' href='#n855'>855</a> <a id='n856' href='#n856'>856</a> <a id='n857' href='#n857'>857</a> <a id='n858' href='#n858'>858</a> <a id='n859' href='#n859'>859</a> <a id='n860' href='#n860'>860</a> <a id='n861' href='#n861'>861</a> <a id='n862' href='#n862'>862</a> <a id='n863' href='#n863'>863</a> <a id='n864' href='#n864'>864</a> <a id='n865' href='#n865'>865</a> <a id='n866' href='#n866'>866</a> <a id='n867' href='#n867'>867</a> <a id='n868' href='#n868'>868</a> <a id='n869' href='#n869'>869</a> <a id='n870' href='#n870'>870</a> <a id='n871' href='#n871'>871</a> <a id='n872' href='#n872'>872</a> <a id='n873' href='#n873'>873</a> <a id='n874' href='#n874'>874</a> <a id='n875' href='#n875'>875</a> <a id='n876' href='#n876'>876</a> <a id='n877' href='#n877'>877</a> <a id='n878' href='#n878'>878</a> <a id='n879' href='#n879'>879</a> <a id='n880' href='#n880'>880</a> <a id='n881' href='#n881'>881</a> <a id='n882' href='#n882'>882</a> <a id='n883' href='#n883'>883</a> <a id='n884' href='#n884'>884</a> <a id='n885' href='#n885'>885</a> <a id='n886' href='#n886'>886</a> <a id='n887' href='#n887'>887</a> <a id='n888' href='#n888'>888</a> <a id='n889' href='#n889'>889</a> <a id='n890' href='#n890'>890</a> <a id='n891' href='#n891'>891</a> <a id='n892' href='#n892'>892</a> <a id='n893' href='#n893'>893</a> <a id='n894' href='#n894'>894</a> <a id='n895' href='#n895'>895</a> <a id='n896' href='#n896'>896</a> <a id='n897' href='#n897'>897</a> <a id='n898' href='#n898'>898</a> <a id='n899' href='#n899'>899</a> <a id='n900' href='#n900'>900</a> <a id='n901' href='#n901'>901</a> <a id='n902' href='#n902'>902</a> <a id='n903' href='#n903'>903</a> <a id='n904' href='#n904'>904</a> <a id='n905' href='#n905'>905</a> <a id='n906' href='#n906'>906</a> <a id='n907' href='#n907'>907</a> <a id='n908' href='#n908'>908</a> <a id='n909' href='#n909'>909</a> <a id='n910' href='#n910'>910</a> <a id='n911' href='#n911'>911</a> <a id='n912' href='#n912'>912</a> <a id='n913' href='#n913'>913</a> <a id='n914' href='#n914'>914</a> <a id='n915' href='#n915'>915</a> <a id='n916' href='#n916'>916</a> <a id='n917' href='#n917'>917</a> <a id='n918' href='#n918'>918</a> <a id='n919' href='#n919'>919</a> <a id='n920' href='#n920'>920</a> <a id='n921' href='#n921'>921</a> <a id='n922' href='#n922'>922</a> <a id='n923' href='#n923'>923</a> <a id='n924' href='#n924'>924</a> <a id='n925' href='#n925'>925</a> <a id='n926' href='#n926'>926</a> <a id='n927' href='#n927'>927</a> <a id='n928' href='#n928'>928</a> <a id='n929' href='#n929'>929</a> <a id='n930' href='#n930'>930</a> <a id='n931' href='#n931'>931</a> <a id='n932' href='#n932'>932</a> <a id='n933' href='#n933'>933</a> <a id='n934' href='#n934'>934</a> <a id='n935' href='#n935'>935</a> <a id='n936' href='#n936'>936</a> <a id='n937' href='#n937'>937</a> <a id='n938' href='#n938'>938</a> <a id='n939' href='#n939'>939</a> <a id='n940' href='#n940'>940</a> <a id='n941' href='#n941'>941</a> <a id='n942' href='#n942'>942</a> <a id='n943' href='#n943'>943</a> <a id='n944' href='#n944'>944</a> <a id='n945' href='#n945'>945</a> <a id='n946' href='#n946'>946</a> <a id='n947' href='#n947'>947</a> <a id='n948' href='#n948'>948</a> <a id='n949' href='#n949'>949</a> <a id='n950' href='#n950'>950</a> <a id='n951' href='#n951'>951</a> <a id='n952' href='#n952'>952</a> <a id='n953' href='#n953'>953</a> <a id='n954' href='#n954'>954</a> <a id='n955' href='#n955'>955</a> <a id='n956' href='#n956'>956</a> <a id='n957' href='#n957'>957</a> <a id='n958' href='#n958'>958</a> <a id='n959' href='#n959'>959</a> <a id='n960' href='#n960'>960</a> <a id='n961' href='#n961'>961</a> <a id='n962' href='#n962'>962</a> <a id='n963' href='#n963'>963</a> <a id='n964' href='#n964'>964</a> <a id='n965' href='#n965'>965</a> <a id='n966' href='#n966'>966</a> <a id='n967' href='#n967'>967</a> <a id='n968' href='#n968'>968</a> <a id='n969' href='#n969'>969</a> <a id='n970' href='#n970'>970</a> <a id='n971' href='#n971'>971</a> <a id='n972' href='#n972'>972</a> <a id='n973' href='#n973'>973</a> <a id='n974' href='#n974'>974</a> <a id='n975' href='#n975'>975</a> <a id='n976' href='#n976'>976</a> <a id='n977' href='#n977'>977</a> <a id='n978' href='#n978'>978</a> <a id='n979' href='#n979'>979</a> <a id='n980' href='#n980'>980</a> <a id='n981' href='#n981'>981</a> <a id='n982' href='#n982'>982</a> <a id='n983' href='#n983'>983</a> <a id='n984' href='#n984'>984</a> <a id='n985' href='#n985'>985</a> <a id='n986' href='#n986'>986</a> <a id='n987' href='#n987'>987</a> <a id='n988' href='#n988'>988</a> <a id='n989' href='#n989'>989</a> <a id='n990' href='#n990'>990</a> <a id='n991' href='#n991'>991</a> <a id='n992' href='#n992'>992</a> <a id='n993' href='#n993'>993</a> <a id='n994' href='#n994'>994</a> <a id='n995' href='#n995'>995</a> <a id='n996' href='#n996'>996</a> <a id='n997' href='#n997'>997</a> <a id='n998' href='#n998'>998</a> <a id='n999' href='#n999'>999</a> <a id='n1000' href='#n1000'>1000</a> <a id='n1001' href='#n1001'>1001</a> <a id='n1002' href='#n1002'>1002</a> <a id='n1003' href='#n1003'>1003</a> <a id='n1004' href='#n1004'>1004</a> <a id='n1005' href='#n1005'>1005</a> <a id='n1006' href='#n1006'>1006</a> <a id='n1007' href='#n1007'>1007</a> <a id='n1008' href='#n1008'>1008</a> <a id='n1009' href='#n1009'>1009</a> <a id='n1010' href='#n1010'>1010</a> <a id='n1011' href='#n1011'>1011</a> <a id='n1012' href='#n1012'>1012</a> <a id='n1013' href='#n1013'>1013</a> <a id='n1014' href='#n1014'>1014</a> <a id='n1015' href='#n1015'>1015</a> <a id='n1016' href='#n1016'>1016</a> <a id='n1017' href='#n1017'>1017</a> <a id='n1018' href='#n1018'>1018</a> <a id='n1019' href='#n1019'>1019</a> <a id='n1020' href='#n1020'>1020</a> <a id='n1021' href='#n1021'>1021</a> <a id='n1022' href='#n1022'>1022</a> <a id='n1023' href='#n1023'>1023</a> <a id='n1024' href='#n1024'>1024</a> <a id='n1025' href='#n1025'>1025</a> <a id='n1026' href='#n1026'>1026</a> <a id='n1027' href='#n1027'>1027</a> <a id='n1028' href='#n1028'>1028</a> <a id='n1029' href='#n1029'>1029</a> <a id='n1030' href='#n1030'>1030</a> <a id='n1031' href='#n1031'>1031</a> <a id='n1032' href='#n1032'>1032</a> <a id='n1033' href='#n1033'>1033</a> <a id='n1034' href='#n1034'>1034</a> <a id='n1035' href='#n1035'>1035</a> <a id='n1036' href='#n1036'>1036</a> <a id='n1037' href='#n1037'>1037</a> <a id='n1038' href='#n1038'>1038</a> <a id='n1039' href='#n1039'>1039</a> <a id='n1040' href='#n1040'>1040</a> <a id='n1041' href='#n1041'>1041</a> <a id='n1042' href='#n1042'>1042</a> <a id='n1043' href='#n1043'>1043</a> <a id='n1044' href='#n1044'>1044</a> <a id='n1045' href='#n1045'>1045</a> <a id='n1046' href='#n1046'>1046</a> <a id='n1047' href='#n1047'>1047</a> <a id='n1048' href='#n1048'>1048</a> <a id='n1049' href='#n1049'>1049</a> <a id='n1050' href='#n1050'>1050</a> <a id='n1051' href='#n1051'>1051</a> <a id='n1052' href='#n1052'>1052</a> <a id='n1053' href='#n1053'>1053</a> <a id='n1054' href='#n1054'>1054</a> <a id='n1055' href='#n1055'>1055</a> <a id='n1056' href='#n1056'>1056</a> <a id='n1057' href='#n1057'>1057</a> <a id='n1058' href='#n1058'>1058</a> <a id='n1059' href='#n1059'>1059</a> <a id='n1060' href='#n1060'>1060</a> <a id='n1061' href='#n1061'>1061</a> <a id='n1062' href='#n1062'>1062</a> <a id='n1063' href='#n1063'>1063</a> <a id='n1064' href='#n1064'>1064</a> <a id='n1065' href='#n1065'>1065</a> <a id='n1066' href='#n1066'>1066</a> <a id='n1067' href='#n1067'>1067</a> <a id='n1068' href='#n1068'>1068</a> <a id='n1069' href='#n1069'>1069</a> <a id='n1070' href='#n1070'>1070</a> <a id='n1071' href='#n1071'>1071</a> <a id='n1072' href='#n1072'>1072</a> <a id='n1073' href='#n1073'>1073</a> <a id='n1074' href='#n1074'>1074</a> <a id='n1075' href='#n1075'>1075</a> <a id='n1076' href='#n1076'>1076</a> <a id='n1077' href='#n1077'>1077</a> <a id='n1078' href='#n1078'>1078</a> <a id='n1079' href='#n1079'>1079</a> <a id='n1080' href='#n1080'>1080</a> <a id='n1081' href='#n1081'>1081</a> <a id='n1082' href='#n1082'>1082</a> <a id='n1083' href='#n1083'>1083</a> <a id='n1084' href='#n1084'>1084</a> <a id='n1085' href='#n1085'>1085</a> <a id='n1086' href='#n1086'>1086</a> <a id='n1087' href='#n1087'>1087</a> <a id='n1088' href='#n1088'>1088</a> <a id='n1089' href='#n1089'>1089</a> <a id='n1090' href='#n1090'>1090</a> <a id='n1091' href='#n1091'>1091</a> <a id='n1092' href='#n1092'>1092</a> <a id='n1093' href='#n1093'>1093</a> <a id='n1094' href='#n1094'>1094</a> <a id='n1095' href='#n1095'>1095</a> <a id='n1096' href='#n1096'>1096</a> <a id='n1097' href='#n1097'>1097</a> <a id='n1098' href='#n1098'>1098</a> <a id='n1099' href='#n1099'>1099</a> <a id='n1100' href='#n1100'>1100</a> <a id='n1101' href='#n1101'>1101</a> <a id='n1102' href='#n1102'>1102</a> <a id='n1103' href='#n1103'>1103</a> <a id='n1104' href='#n1104'>1104</a> <a id='n1105' href='#n1105'>1105</a> <a id='n1106' href='#n1106'>1106</a> <a id='n1107' href='#n1107'>1107</a> <a id='n1108' href='#n1108'>1108</a> <a id='n1109' href='#n1109'>1109</a> <a id='n1110' href='#n1110'>1110</a> <a id='n1111' href='#n1111'>1111</a> <a id='n1112' href='#n1112'>1112</a> <a id='n1113' href='#n1113'>1113</a> <a id='n1114' href='#n1114'>1114</a> <a id='n1115' href='#n1115'>1115</a> <a id='n1116' href='#n1116'>1116</a> <a id='n1117' href='#n1117'>1117</a> <a id='n1118' href='#n1118'>1118</a> <a id='n1119' href='#n1119'>1119</a> <a id='n1120' href='#n1120'>1120</a> <a id='n1121' href='#n1121'>1121</a> <a id='n1122' href='#n1122'>1122</a> <a id='n1123' href='#n1123'>1123</a> <a id='n1124' href='#n1124'>1124</a> <a id='n1125' href='#n1125'>1125</a> <a id='n1126' href='#n1126'>1126</a> <a id='n1127' href='#n1127'>1127</a> <a id='n1128' href='#n1128'>1128</a> <a id='n1129' href='#n1129'>1129</a> <a id='n1130' href='#n1130'>1130</a> <a id='n1131' href='#n1131'>1131</a> <a id='n1132' href='#n1132'>1132</a> <a id='n1133' href='#n1133'>1133</a> <a id='n1134' href='#n1134'>1134</a> <a id='n1135' href='#n1135'>1135</a> <a id='n1136' href='#n1136'>1136</a> <a id='n1137' href='#n1137'>1137</a> <a id='n1138' href='#n1138'>1138</a> <a id='n1139' href='#n1139'>1139</a> <a id='n1140' href='#n1140'>1140</a> <a id='n1141' href='#n1141'>1141</a> <a id='n1142' href='#n1142'>1142</a> <a id='n1143' href='#n1143'>1143</a> <a id='n1144' href='#n1144'>1144</a> <a id='n1145' href='#n1145'>1145</a> <a id='n1146' href='#n1146'>1146</a> <a id='n1147' href='#n1147'>1147</a> <a id='n1148' href='#n1148'>1148</a> <a id='n1149' href='#n1149'>1149</a> <a id='n1150' href='#n1150'>1150</a> <a id='n1151' href='#n1151'>1151</a> <a id='n1152' href='#n1152'>1152</a> <a id='n1153' href='#n1153'>1153</a> <a id='n1154' href='#n1154'>1154</a> <a id='n1155' href='#n1155'>1155</a> <a id='n1156' href='#n1156'>1156</a> <a id='n1157' href='#n1157'>1157</a> <a id='n1158' href='#n1158'>1158</a> <a id='n1159' href='#n1159'>1159</a> <a id='n1160' href='#n1160'>1160</a> <a id='n1161' href='#n1161'>1161</a> <a id='n1162' href='#n1162'>1162</a> <a id='n1163' href='#n1163'>1163</a> <a id='n1164' href='#n1164'>1164</a> <a id='n1165' href='#n1165'>1165</a> <a id='n1166' href='#n1166'>1166</a> <a id='n1167' href='#n1167'>1167</a> <a id='n1168' href='#n1168'>1168</a> <a id='n1169' href='#n1169'>1169</a> <a id='n1170' href='#n1170'>1170</a> <a id='n1171' href='#n1171'>1171</a> <a id='n1172' href='#n1172'>1172</a> <a id='n1173' href='#n1173'>1173</a> <a id='n1174' href='#n1174'>1174</a> <a id='n1175' href='#n1175'>1175</a> <a id='n1176' href='#n1176'>1176</a> <a id='n1177' href='#n1177'>1177</a> <a id='n1178' href='#n1178'>1178</a> <a id='n1179' href='#n1179'>1179</a> <a id='n1180' href='#n1180'>1180</a> <a id='n1181' href='#n1181'>1181</a> <a id='n1182' href='#n1182'>1182</a> <a id='n1183' href='#n1183'>1183</a> <a id='n1184' href='#n1184'>1184</a> <a id='n1185' href='#n1185'>1185</a> <a id='n1186' href='#n1186'>1186</a> <a id='n1187' href='#n1187'>1187</a> <a id='n1188' href='#n1188'>1188</a> <a id='n1189' href='#n1189'>1189</a> <a id='n1190' href='#n1190'>1190</a> <a id='n1191' href='#n1191'>1191</a> <a id='n1192' href='#n1192'>1192</a> <a id='n1193' href='#n1193'>1193</a> <a id='n1194' href='#n1194'>1194</a> <a id='n1195' href='#n1195'>1195</a> <a id='n1196' href='#n1196'>1196</a> <a id='n1197' href='#n1197'>1197</a> <a id='n1198' href='#n1198'>1198</a> <a id='n1199' href='#n1199'>1199</a> <a id='n1200' href='#n1200'>1200</a> <a id='n1201' href='#n1201'>1201</a> <a id='n1202' href='#n1202'>1202</a> <a id='n1203' href='#n1203'>1203</a> <a id='n1204' href='#n1204'>1204</a> <a id='n1205' href='#n1205'>1205</a> <a id='n1206' href='#n1206'>1206</a> <a id='n1207' href='#n1207'>1207</a> <a id='n1208' href='#n1208'>1208</a> <a id='n1209' href='#n1209'>1209</a> <a id='n1210' href='#n1210'>1210</a> <a id='n1211' href='#n1211'>1211</a> <a id='n1212' href='#n1212'>1212</a> <a id='n1213' href='#n1213'>1213</a> <a id='n1214' href='#n1214'>1214</a> <a id='n1215' href='#n1215'>1215</a> <a id='n1216' href='#n1216'>1216</a> <a id='n1217' href='#n1217'>1217</a> <a id='n1218' href='#n1218'>1218</a> <a id='n1219' href='#n1219'>1219</a> <a id='n1220' href='#n1220'>1220</a> <a id='n1221' href='#n1221'>1221</a> <a id='n1222' href='#n1222'>1222</a> <a id='n1223' href='#n1223'>1223</a> <a id='n1224' href='#n1224'>1224</a> <a id='n1225' href='#n1225'>1225</a> <a id='n1226' href='#n1226'>1226</a> <a id='n1227' href='#n1227'>1227</a> <a id='n1228' href='#n1228'>1228</a> <a id='n1229' href='#n1229'>1229</a> <a id='n1230' href='#n1230'>1230</a> <a id='n1231' href='#n1231'>1231</a> <a id='n1232' href='#n1232'>1232</a> <a id='n1233' href='#n1233'>1233</a> <a id='n1234' href='#n1234'>1234</a> <a id='n1235' href='#n1235'>1235</a> <a id='n1236' href='#n1236'>1236</a> <a id='n1237' href='#n1237'>1237</a> <a id='n1238' href='#n1238'>1238</a> <a id='n1239' href='#n1239'>1239</a> <a id='n1240' href='#n1240'>1240</a> <a id='n1241' href='#n1241'>1241</a> <a id='n1242' href='#n1242'>1242</a> <a id='n1243' href='#n1243'>1243</a> <a id='n1244' href='#n1244'>1244</a> <a id='n1245' href='#n1245'>1245</a> <a id='n1246' href='#n1246'>1246</a> <a id='n1247' href='#n1247'>1247</a> <a id='n1248' href='#n1248'>1248</a> <a id='n1249' href='#n1249'>1249</a> <a id='n1250' href='#n1250'>1250</a> <a id='n1251' href='#n1251'>1251</a> <a id='n1252' href='#n1252'>1252</a> <a id='n1253' href='#n1253'>1253</a> <a id='n1254' href='#n1254'>1254</a> <a id='n1255' href='#n1255'>1255</a> <a id='n1256' href='#n1256'>1256</a> <a id='n1257' href='#n1257'>1257</a> <a id='n1258' href='#n1258'>1258</a> <a id='n1259' href='#n1259'>1259</a> <a id='n1260' href='#n1260'>1260</a> <a id='n1261' href='#n1261'>1261</a> <a id='n1262' href='#n1262'>1262</a> <a id='n1263' href='#n1263'>1263</a> <a id='n1264' href='#n1264'>1264</a> <a id='n1265' href='#n1265'>1265</a> <a id='n1266' href='#n1266'>1266</a> <a id='n1267' href='#n1267'>1267</a> <a id='n1268' href='#n1268'>1268</a> <a id='n1269' href='#n1269'>1269</a> <a id='n1270' href='#n1270'>1270</a> <a id='n1271' href='#n1271'>1271</a> <a id='n1272' href='#n1272'>1272</a> <a id='n1273' href='#n1273'>1273</a> <a id='n1274' href='#n1274'>1274</a> <a id='n1275' href='#n1275'>1275</a> <a id='n1276' href='#n1276'>1276</a> <a id='n1277' href='#n1277'>1277</a> <a id='n1278' href='#n1278'>1278</a> <a id='n1279' href='#n1279'>1279</a> <a id='n1280' href='#n1280'>1280</a> <a id='n1281' href='#n1281'>1281</a> <a id='n1282' href='#n1282'>1282</a> <a id='n1283' href='#n1283'>1283</a> <a id='n1284' href='#n1284'>1284</a> <a id='n1285' href='#n1285'>1285</a> <a id='n1286' href='#n1286'>1286</a> <a id='n1287' href='#n1287'>1287</a> <a id='n1288' href='#n1288'>1288</a> <a id='n1289' href='#n1289'>1289</a> <a id='n1290' href='#n1290'>1290</a> <a id='n1291' href='#n1291'>1291</a> <a id='n1292' href='#n1292'>1292</a> <a id='n1293' href='#n1293'>1293</a> <a id='n1294' href='#n1294'>1294</a> <a id='n1295' href='#n1295'>1295</a> <a id='n1296' href='#n1296'>1296</a> <a id='n1297' href='#n1297'>1297</a> <a id='n1298' href='#n1298'>1298</a> <a id='n1299' href='#n1299'>1299</a> <a id='n1300' href='#n1300'>1300</a> <a id='n1301' href='#n1301'>1301</a> <a id='n1302' href='#n1302'>1302</a> <a id='n1303' href='#n1303'>1303</a> <a id='n1304' href='#n1304'>1304</a> <a id='n1305' href='#n1305'>1305</a> <a id='n1306' href='#n1306'>1306</a> <a id='n1307' href='#n1307'>1307</a> <a id='n1308' href='#n1308'>1308</a> <a id='n1309' href='#n1309'>1309</a> <a id='n1310' href='#n1310'>1310</a> <a id='n1311' href='#n1311'>1311</a> <a id='n1312' href='#n1312'>1312</a> <a id='n1313' href='#n1313'>1313</a> <a id='n1314' href='#n1314'>1314</a> <a id='n1315' href='#n1315'>1315</a> <a id='n1316' href='#n1316'>1316</a> <a id='n1317' href='#n1317'>1317</a> <a id='n1318' href='#n1318'>1318</a> <a id='n1319' href='#n1319'>1319</a> <a id='n1320' href='#n1320'>1320</a> <a id='n1321' href='#n1321'>1321</a> <a id='n1322' href='#n1322'>1322</a> <a id='n1323' href='#n1323'>1323</a> <a id='n1324' href='#n1324'>1324</a> <a id='n1325' href='#n1325'>1325</a> <a id='n1326' href='#n1326'>1326</a> <a id='n1327' href='#n1327'>1327</a> <a id='n1328' href='#n1328'>1328</a> <a id='n1329' href='#n1329'>1329</a> <a id='n1330' href='#n1330'>1330</a> <a id='n1331' href='#n1331'>1331</a> <a id='n1332' href='#n1332'>1332</a> <a id='n1333' href='#n1333'>1333</a> <a id='n1334' href='#n1334'>1334</a> <a id='n1335' href='#n1335'>1335</a> <a id='n1336' href='#n1336'>1336</a> <a id='n1337' href='#n1337'>1337</a> <a id='n1338' href='#n1338'>1338</a> <a id='n1339' href='#n1339'>1339</a> <a id='n1340' href='#n1340'>1340</a> <a id='n1341' href='#n1341'>1341</a> <a id='n1342' href='#n1342'>1342</a> <a id='n1343' href='#n1343'>1343</a> <a id='n1344' href='#n1344'>1344</a> <a id='n1345' href='#n1345'>1345</a> <a id='n1346' href='#n1346'>1346</a> <a id='n1347' href='#n1347'>1347</a> <a id='n1348' href='#n1348'>1348</a> <a id='n1349' href='#n1349'>1349</a> <a id='n1350' href='#n1350'>1350</a> <a id='n1351' href='#n1351'>1351</a> <a id='n1352' href='#n1352'>1352</a> <a id='n1353' href='#n1353'>1353</a> <a id='n1354' href='#n1354'>1354</a> <a id='n1355' href='#n1355'>1355</a> <a id='n1356' href='#n1356'>1356</a> <a id='n1357' href='#n1357'>1357</a> <a id='n1358' href='#n1358'>1358</a> <a id='n1359' href='#n1359'>1359</a> <a id='n1360' href='#n1360'>1360</a> <a id='n1361' href='#n1361'>1361</a> <a id='n1362' href='#n1362'>1362</a> <a id='n1363' href='#n1363'>1363</a> <a id='n1364' href='#n1364'>1364</a> <a id='n1365' href='#n1365'>1365</a> <a id='n1366' href='#n1366'>1366</a> <a id='n1367' href='#n1367'>1367</a> <a id='n1368' href='#n1368'>1368</a> <a id='n1369' href='#n1369'>1369</a> <a id='n1370' href='#n1370'>1370</a> <a id='n1371' href='#n1371'>1371</a> <a id='n1372' href='#n1372'>1372</a> <a id='n1373' href='#n1373'>1373</a> <a id='n1374' href='#n1374'>1374</a> <a id='n1375' href='#n1375'>1375</a> <a id='n1376' href='#n1376'>1376</a> <a id='n1377' href='#n1377'>1377</a> <a id='n1378' href='#n1378'>1378</a> <a id='n1379' href='#n1379'>1379</a> <a id='n1380' href='#n1380'>1380</a> <a id='n1381' href='#n1381'>1381</a> <a id='n1382' href='#n1382'>1382</a> <a id='n1383' href='#n1383'>1383</a> <a id='n1384' href='#n1384'>1384</a> <a id='n1385' href='#n1385'>1385</a> <a id='n1386' href='#n1386'>1386</a> <a id='n1387' href='#n1387'>1387</a> <a id='n1388' href='#n1388'>1388</a> <a id='n1389' href='#n1389'>1389</a> <a id='n1390' href='#n1390'>1390</a> <a id='n1391' href='#n1391'>1391</a> <a id='n1392' href='#n1392'>1392</a> <a id='n1393' href='#n1393'>1393</a> <a id='n1394' href='#n1394'>1394</a> <a id='n1395' href='#n1395'>1395</a> <a id='n1396' href='#n1396'>1396</a> <a id='n1397' href='#n1397'>1397</a> <a id='n1398' href='#n1398'>1398</a> <a id='n1399' href='#n1399'>1399</a> <a id='n1400' href='#n1400'>1400</a> <a id='n1401' href='#n1401'>1401</a> <a id='n1402' href='#n1402'>1402</a> <a id='n1403' href='#n1403'>1403</a> <a id='n1404' href='#n1404'>1404</a> <a id='n1405' href='#n1405'>1405</a> <a id='n1406' href='#n1406'>1406</a> <a id='n1407' href='#n1407'>1407</a> <a id='n1408' href='#n1408'>1408</a> <a id='n1409' href='#n1409'>1409</a> <a id='n1410' href='#n1410'>1410</a> <a id='n1411' href='#n1411'>1411</a> <a id='n1412' href='#n1412'>1412</a> <a id='n1413' href='#n1413'>1413</a> <a id='n1414' href='#n1414'>1414</a> <a id='n1415' href='#n1415'>1415</a> <a id='n1416' href='#n1416'>1416</a> <a id='n1417' href='#n1417'>1417</a> <a id='n1418' href='#n1418'>1418</a> <a id='n1419' href='#n1419'>1419</a> <a id='n1420' href='#n1420'>1420</a> <a id='n1421' href='#n1421'>1421</a> <a id='n1422' href='#n1422'>1422</a> <a id='n1423' href='#n1423'>1423</a> <a id='n1424' href='#n1424'>1424</a> <a id='n1425' href='#n1425'>1425</a> <a id='n1426' href='#n1426'>1426</a> <a id='n1427' href='#n1427'>1427</a> <a id='n1428' href='#n1428'>1428</a> <a id='n1429' href='#n1429'>1429</a> <a id='n1430' href='#n1430'>1430</a> <a id='n1431' href='#n1431'>1431</a> <a id='n1432' href='#n1432'>1432</a> <a id='n1433' href='#n1433'>1433</a> <a id='n1434' href='#n1434'>1434</a> <a id='n1435' href='#n1435'>1435</a> <a id='n1436' href='#n1436'>1436</a> <a id='n1437' href='#n1437'>1437</a> <a id='n1438' href='#n1438'>1438</a> <a id='n1439' href='#n1439'>1439</a> <a id='n1440' href='#n1440'>1440</a> <a id='n1441' href='#n1441'>1441</a> <a id='n1442' href='#n1442'>1442</a> <a id='n1443' href='#n1443'>1443</a> <a id='n1444' href='#n1444'>1444</a> <a id='n1445' href='#n1445'>1445</a> <a id='n1446' href='#n1446'>1446</a> <a id='n1447' href='#n1447'>1447</a> <a id='n1448' href='#n1448'>1448</a> <a id='n1449' href='#n1449'>1449</a> <a id='n1450' href='#n1450'>1450</a> <a id='n1451' href='#n1451'>1451</a> <a id='n1452' href='#n1452'>1452</a> <a id='n1453' href='#n1453'>1453</a> <a id='n1454' href='#n1454'>1454</a> <a id='n1455' href='#n1455'>1455</a> <a id='n1456' href='#n1456'>1456</a> <a id='n1457' href='#n1457'>1457</a> <a id='n1458' href='#n1458'>1458</a> <a id='n1459' href='#n1459'>1459</a> <a id='n1460' href='#n1460'>1460</a> <a id='n1461' href='#n1461'>1461</a> <a id='n1462' href='#n1462'>1462</a> <a id='n1463' href='#n1463'>1463</a> <a id='n1464' href='#n1464'>1464</a> <a id='n1465' href='#n1465'>1465</a> <a id='n1466' href='#n1466'>1466</a> <a id='n1467' href='#n1467'>1467</a> <a id='n1468' href='#n1468'>1468</a> <a id='n1469' href='#n1469'>1469</a> <a id='n1470' href='#n1470'>1470</a> <a id='n1471' href='#n1471'>1471</a> <a id='n1472' href='#n1472'>1472</a> <a id='n1473' href='#n1473'>1473</a> <a id='n1474' href='#n1474'>1474</a> <a id='n1475' href='#n1475'>1475</a> <a id='n1476' href='#n1476'>1476</a> <a id='n1477' href='#n1477'>1477</a> <a id='n1478' href='#n1478'>1478</a> <a id='n1479' href='#n1479'>1479</a> <a id='n1480' href='#n1480'>1480</a> <a id='n1481' href='#n1481'>1481</a> <a id='n1482' href='#n1482'>1482</a> <a id='n1483' href='#n1483'>1483</a> <a id='n1484' href='#n1484'>1484</a> <a id='n1485' href='#n1485'>1485</a> <a id='n1486' href='#n1486'>1486</a> <a id='n1487' href='#n1487'>1487</a> <a id='n1488' href='#n1488'>1488</a> <a id='n1489' href='#n1489'>1489</a> <a id='n1490' href='#n1490'>1490</a> <a id='n1491' href='#n1491'>1491</a> <a id='n1492' href='#n1492'>1492</a> <a id='n1493' href='#n1493'>1493</a> <a id='n1494' href='#n1494'>1494</a> <a id='n1495' href='#n1495'>1495</a> <a id='n1496' href='#n1496'>1496</a> <a id='n1497' href='#n1497'>1497</a> <a id='n1498' href='#n1498'>1498</a> <a id='n1499' href='#n1499'>1499</a> <a id='n1500' href='#n1500'>1500</a> <a id='n1501' href='#n1501'>1501</a> <a id='n1502' href='#n1502'>1502</a> <a id='n1503' href='#n1503'>1503</a> <a id='n1504' href='#n1504'>1504</a> <a id='n1505' href='#n1505'>1505</a> <a id='n1506' href='#n1506'>1506</a> <a id='n1507' href='#n1507'>1507</a> <a id='n1508' href='#n1508'>1508</a> <a id='n1509' href='#n1509'>1509</a> <a id='n1510' href='#n1510'>1510</a> <a id='n1511' href='#n1511'>1511</a> <a id='n1512' href='#n1512'>1512</a> <a id='n1513' href='#n1513'>1513</a> <a id='n1514' href='#n1514'>1514</a> <a id='n1515' href='#n1515'>1515</a> <a id='n1516' href='#n1516'>1516</a> <a id='n1517' href='#n1517'>1517</a> <a id='n1518' href='#n1518'>1518</a> <a id='n1519' href='#n1519'>1519</a> <a id='n1520' href='#n1520'>1520</a> <a id='n1521' href='#n1521'>1521</a> <a id='n1522' href='#n1522'>1522</a> <a id='n1523' href='#n1523'>1523</a> <a id='n1524' href='#n1524'>1524</a> <a id='n1525' href='#n1525'>1525</a> <a id='n1526' href='#n1526'>1526</a> <a id='n1527' href='#n1527'>1527</a> <a id='n1528' href='#n1528'>1528</a> <a id='n1529' href='#n1529'>1529</a> <a id='n1530' href='#n1530'>1530</a> <a id='n1531' href='#n1531'>1531</a> <a id='n1532' href='#n1532'>1532</a> <a id='n1533' href='#n1533'>1533</a> <a id='n1534' href='#n1534'>1534</a> <a id='n1535' href='#n1535'>1535</a> <a id='n1536' href='#n1536'>1536</a> <a id='n1537' href='#n1537'>1537</a> <a id='n1538' href='#n1538'>1538</a> <a id='n1539' href='#n1539'>1539</a> <a id='n1540' href='#n1540'>1540</a> <a id='n1541' href='#n1541'>1541</a> <a id='n1542' href='#n1542'>1542</a> <a id='n1543' href='#n1543'>1543</a> <a id='n1544' href='#n1544'>1544</a> <a id='n1545' href='#n1545'>1545</a> <a id='n1546' href='#n1546'>1546</a> <a id='n1547' href='#n1547'>1547</a> <a id='n1548' href='#n1548'>1548</a> <a id='n1549' href='#n1549'>1549</a> <a id='n1550' href='#n1550'>1550</a> <a id='n1551' href='#n1551'>1551</a> <a id='n1552' href='#n1552'>1552</a> <a id='n1553' href='#n1553'>1553</a> <a id='n1554' href='#n1554'>1554</a> <a id='n1555' href='#n1555'>1555</a> <a id='n1556' href='#n1556'>1556</a> <a id='n1557' href='#n1557'>1557</a> <a id='n1558' href='#n1558'>1558</a> <a id='n1559' href='#n1559'>1559</a> <a id='n1560' href='#n1560'>1560</a> <a id='n1561' href='#n1561'>1561</a> <a id='n1562' href='#n1562'>1562</a> <a id='n1563' href='#n1563'>1563</a> <a id='n1564' href='#n1564'>1564</a> <a id='n1565' href='#n1565'>1565</a> <a id='n1566' href='#n1566'>1566</a> <a id='n1567' href='#n1567'>1567</a> <a id='n1568' href='#n1568'>1568</a> <a id='n1569' href='#n1569'>1569</a> <a id='n1570' href='#n1570'>1570</a> <a id='n1571' href='#n1571'>1571</a> <a id='n1572' href='#n1572'>1572</a> <a id='n1573' href='#n1573'>1573</a> <a id='n1574' href='#n1574'>1574</a> <a id='n1575' href='#n1575'>1575</a> <a id='n1576' href='#n1576'>1576</a> <a id='n1577' href='#n1577'>1577</a> <a id='n1578' href='#n1578'>1578</a> <a id='n1579' href='#n1579'>1579</a> <a id='n1580' href='#n1580'>1580</a> <a id='n1581' href='#n1581'>1581</a> <a id='n1582' href='#n1582'>1582</a> <a id='n1583' href='#n1583'>1583</a> <a id='n1584' href='#n1584'>1584</a> <a id='n1585' href='#n1585'>1585</a> <a id='n1586' href='#n1586'>1586</a> <a id='n1587' href='#n1587'>1587</a> <a id='n1588' href='#n1588'>1588</a> <a id='n1589' href='#n1589'>1589</a> <a id='n1590' href='#n1590'>1590</a> <a id='n1591' href='#n1591'>1591</a> <a id='n1592' href='#n1592'>1592</a> <a id='n1593' href='#n1593'>1593</a> <a id='n1594' href='#n1594'>1594</a> <a id='n1595' href='#n1595'>1595</a> <a id='n1596' href='#n1596'>1596</a> <a id='n1597' href='#n1597'>1597</a> <a id='n1598' href='#n1598'>1598</a> <a id='n1599' href='#n1599'>1599</a> <a id='n1600' href='#n1600'>1600</a> <a id='n1601' href='#n1601'>1601</a> <a id='n1602' href='#n1602'>1602</a> <a id='n1603' href='#n1603'>1603</a> <a id='n1604' href='#n1604'>1604</a> <a id='n1605' href='#n1605'>1605</a> <a id='n1606' href='#n1606'>1606</a> <a id='n1607' href='#n1607'>1607</a> <a id='n1608' href='#n1608'>1608</a> <a id='n1609' href='#n1609'>1609</a> <a id='n1610' href='#n1610'>1610</a> <a id='n1611' href='#n1611'>1611</a> <a id='n1612' href='#n1612'>1612</a> <a id='n1613' href='#n1613'>1613</a> <a id='n1614' href='#n1614'>1614</a> <a id='n1615' href='#n1615'>1615</a> <a id='n1616' href='#n1616'>1616</a> <a id='n1617' href='#n1617'>1617</a> <a id='n1618' href='#n1618'>1618</a> <a id='n1619' href='#n1619'>1619</a> <a id='n1620' href='#n1620'>1620</a> <a id='n1621' href='#n1621'>1621</a> <a id='n1622' href='#n1622'>1622</a> <a id='n1623' href='#n1623'>1623</a> <a id='n1624' href='#n1624'>1624</a> <a id='n1625' href='#n1625'>1625</a> <a id='n1626' href='#n1626'>1626</a> <a id='n1627' href='#n1627'>1627</a> <a id='n1628' href='#n1628'>1628</a> <a id='n1629' href='#n1629'>1629</a> <a id='n1630' href='#n1630'>1630</a> <a id='n1631' href='#n1631'>1631</a> <a id='n1632' href='#n1632'>1632</a> <a id='n1633' href='#n1633'>1633</a> <a id='n1634' href='#n1634'>1634</a> <a id='n1635' href='#n1635'>1635</a> <a id='n1636' href='#n1636'>1636</a> <a id='n1637' href='#n1637'>1637</a> <a id='n1638' href='#n1638'>1638</a> <a id='n1639' href='#n1639'>1639</a> <a id='n1640' href='#n1640'>1640</a> <a id='n1641' href='#n1641'>1641</a> <a id='n1642' href='#n1642'>1642</a> <a id='n1643' href='#n1643'>1643</a> <a id='n1644' href='#n1644'>1644</a> <a id='n1645' href='#n1645'>1645</a> <a id='n1646' href='#n1646'>1646</a> <a id='n1647' href='#n1647'>1647</a> <a id='n1648' href='#n1648'>1648</a> <a id='n1649' href='#n1649'>1649</a> <a id='n1650' href='#n1650'>1650</a> <a id='n1651' href='#n1651'>1651</a> <a id='n1652' href='#n1652'>1652</a> <a id='n1653' href='#n1653'>1653</a> <a id='n1654' href='#n1654'>1654</a> <a id='n1655' href='#n1655'>1655</a> <a id='n1656' href='#n1656'>1656</a> <a id='n1657' href='#n1657'>1657</a> <a id='n1658' href='#n1658'>1658</a> <a id='n1659' href='#n1659'>1659</a> <a id='n1660' href='#n1660'>1660</a> <a id='n1661' href='#n1661'>1661</a> <a id='n1662' href='#n1662'>1662</a> <a id='n1663' href='#n1663'>1663</a> <a id='n1664' href='#n1664'>1664</a> <a id='n1665' href='#n1665'>1665</a> <a id='n1666' href='#n1666'>1666</a> <a id='n1667' href='#n1667'>1667</a> <a id='n1668' href='#n1668'>1668</a> <a id='n1669' href='#n1669'>1669</a> <a id='n1670' href='#n1670'>1670</a> <a id='n1671' href='#n1671'>1671</a> <a id='n1672' href='#n1672'>1672</a> <a id='n1673' href='#n1673'>1673</a> <a id='n1674' href='#n1674'>1674</a> <a id='n1675' href='#n1675'>1675</a> <a id='n1676' href='#n1676'>1676</a> <a id='n1677' href='#n1677'>1677</a> <a id='n1678' href='#n1678'>1678</a> <a id='n1679' href='#n1679'>1679</a> <a id='n1680' href='#n1680'>1680</a> <a id='n1681' href='#n1681'>1681</a> <a id='n1682' href='#n1682'>1682</a> <a id='n1683' href='#n1683'>1683</a> <a id='n1684' href='#n1684'>1684</a> <a id='n1685' href='#n1685'>1685</a> <a id='n1686' href='#n1686'>1686</a> <a id='n1687' href='#n1687'>1687</a> <a id='n1688' href='#n1688'>1688</a> <a id='n1689' href='#n1689'>1689</a> <a id='n1690' href='#n1690'>1690</a> <a id='n1691' href='#n1691'>1691</a> <a id='n1692' href='#n1692'>1692</a> <a id='n1693' href='#n1693'>1693</a> <a id='n1694' href='#n1694'>1694</a> <a id='n1695' href='#n1695'>1695</a> <a id='n1696' href='#n1696'>1696</a> <a id='n1697' href='#n1697'>1697</a> <a id='n1698' href='#n1698'>1698</a> <a id='n1699' href='#n1699'>1699</a> <a id='n1700' href='#n1700'>1700</a> <a id='n1701' href='#n1701'>1701</a> <a id='n1702' href='#n1702'>1702</a> <a id='n1703' href='#n1703'>1703</a> <a id='n1704' href='#n1704'>1704</a> <a id='n1705' href='#n1705'>1705</a> <a id='n1706' href='#n1706'>1706</a> <a id='n1707' href='#n1707'>1707</a> <a id='n1708' href='#n1708'>1708</a> <a id='n1709' href='#n1709'>1709</a> <a id='n1710' href='#n1710'>1710</a> <a id='n1711' href='#n1711'>1711</a> <a id='n1712' href='#n1712'>1712</a> <a id='n1713' href='#n1713'>1713</a> <a id='n1714' href='#n1714'>1714</a> <a id='n1715' href='#n1715'>1715</a> <a id='n1716' href='#n1716'>1716</a> <a id='n1717' href='#n1717'>1717</a> <a id='n1718' href='#n1718'>1718</a> <a id='n1719' href='#n1719'>1719</a> <a id='n1720' href='#n1720'>1720</a> <a id='n1721' href='#n1721'>1721</a> <a id='n1722' href='#n1722'>1722</a> <a id='n1723' href='#n1723'>1723</a> <a id='n1724' href='#n1724'>1724</a> <a id='n1725' href='#n1725'>1725</a> <a id='n1726' href='#n1726'>1726</a> <a id='n1727' href='#n1727'>1727</a> <a id='n1728' href='#n1728'>1728</a> <a id='n1729' href='#n1729'>1729</a> <a id='n1730' href='#n1730'>1730</a> <a id='n1731' href='#n1731'>1731</a> <a id='n1732' href='#n1732'>1732</a> <a id='n1733' href='#n1733'>1733</a> <a id='n1734' href='#n1734'>1734</a> <a id='n1735' href='#n1735'>1735</a> <a id='n1736' href='#n1736'>1736</a> <a id='n1737' href='#n1737'>1737</a> <a id='n1738' href='#n1738'>1738</a> <a id='n1739' href='#n1739'>1739</a> <a id='n1740' href='#n1740'>1740</a> <a id='n1741' href='#n1741'>1741</a> <a id='n1742' href='#n1742'>1742</a> <a id='n1743' href='#n1743'>1743</a> <a id='n1744' href='#n1744'>1744</a> <a id='n1745' href='#n1745'>1745</a> <a id='n1746' href='#n1746'>1746</a> <a id='n1747' href='#n1747'>1747</a> <a id='n1748' href='#n1748'>1748</a> <a id='n1749' href='#n1749'>1749</a> <a id='n1750' href='#n1750'>1750</a> <a id='n1751' href='#n1751'>1751</a> <a id='n1752' href='#n1752'>1752</a> <a id='n1753' href='#n1753'>1753</a> <a id='n1754' href='#n1754'>1754</a> <a id='n1755' href='#n1755'>1755</a> <a id='n1756' href='#n1756'>1756</a> <a id='n1757' href='#n1757'>1757</a> <a id='n1758' href='#n1758'>1758</a> <a id='n1759' href='#n1759'>1759</a> <a id='n1760' href='#n1760'>1760</a> <a id='n1761' href='#n1761'>1761</a> <a id='n1762' href='#n1762'>1762</a> <a id='n1763' href='#n1763'>1763</a> <a id='n1764' href='#n1764'>1764</a> <a id='n1765' href='#n1765'>1765</a> <a id='n1766' href='#n1766'>1766</a> <a id='n1767' href='#n1767'>1767</a> <a id='n1768' href='#n1768'>1768</a> <a id='n1769' href='#n1769'>1769</a> <a id='n1770' href='#n1770'>1770</a> <a id='n1771' href='#n1771'>1771</a> <a id='n1772' href='#n1772'>1772</a> <a id='n1773' href='#n1773'>1773</a> <a id='n1774' href='#n1774'>1774</a> <a id='n1775' href='#n1775'>1775</a> <a id='n1776' href='#n1776'>1776</a> <a id='n1777' href='#n1777'>1777</a> <a id='n1778' href='#n1778'>1778</a> <a id='n1779' href='#n1779'>1779</a> <a id='n1780' href='#n1780'>1780</a> <a id='n1781' href='#n1781'>1781</a> <a id='n1782' href='#n1782'>1782</a> <a id='n1783' href='#n1783'>1783</a> <a id='n1784' href='#n1784'>1784</a> <a id='n1785' href='#n1785'>1785</a> <a id='n1786' href='#n1786'>1786</a> <a id='n1787' href='#n1787'>1787</a> <a id='n1788' href='#n1788'>1788</a> <a id='n1789' href='#n1789'>1789</a> <a id='n1790' href='#n1790'>1790</a> <a id='n1791' href='#n1791'>1791</a> <a id='n1792' href='#n1792'>1792</a> <a id='n1793' href='#n1793'>1793</a> <a id='n1794' href='#n1794'>1794</a> <a id='n1795' href='#n1795'>1795</a> <a id='n1796' href='#n1796'>1796</a> <a id='n1797' href='#n1797'>1797</a> <a id='n1798' href='#n1798'>1798</a> <a id='n1799' href='#n1799'>1799</a> <a id='n1800' href='#n1800'>1800</a> <a id='n1801' href='#n1801'>1801</a> <a id='n1802' href='#n1802'>1802</a> <a id='n1803' href='#n1803'>1803</a> <a id='n1804' href='#n1804'>1804</a> <a id='n1805' href='#n1805'>1805</a> <a id='n1806' href='#n1806'>1806</a> <a id='n1807' href='#n1807'>1807</a> <a id='n1808' href='#n1808'>1808</a> <a id='n1809' href='#n1809'>1809</a> <a id='n1810' href='#n1810'>1810</a> <a id='n1811' href='#n1811'>1811</a> <a id='n1812' href='#n1812'>1812</a> <a id='n1813' href='#n1813'>1813</a> <a id='n1814' href='#n1814'>1814</a> <a id='n1815' href='#n1815'>1815</a> <a id='n1816' href='#n1816'>1816</a> <a id='n1817' href='#n1817'>1817</a> <a id='n1818' href='#n1818'>1818</a> <a id='n1819' href='#n1819'>1819</a> <a id='n1820' href='#n1820'>1820</a> <a id='n1821' href='#n1821'>1821</a> <a id='n1822' href='#n1822'>1822</a> <a id='n1823' href='#n1823'>1823</a> <a id='n1824' href='#n1824'>1824</a> <a id='n1825' href='#n1825'>1825</a> <a id='n1826' href='#n1826'>1826</a> <a id='n1827' href='#n1827'>1827</a> <a id='n1828' href='#n1828'>1828</a> <a id='n1829' href='#n1829'>1829</a> <a id='n1830' href='#n1830'>1830</a> <a id='n1831' href='#n1831'>1831</a> <a id='n1832' href='#n1832'>1832</a> <a id='n1833' href='#n1833'>1833</a> <a id='n1834' href='#n1834'>1834</a> <a id='n1835' href='#n1835'>1835</a> <a id='n1836' href='#n1836'>1836</a> <a id='n1837' href='#n1837'>1837</a> <a id='n1838' href='#n1838'>1838</a> <a id='n1839' href='#n1839'>1839</a> <a id='n1840' href='#n1840'>1840</a> <a id='n1841' href='#n1841'>1841</a> <a id='n1842' href='#n1842'>1842</a> <a id='n1843' href='#n1843'>1843</a> <a id='n1844' href='#n1844'>1844</a> <a id='n1845' href='#n1845'>1845</a> <a id='n1846' href='#n1846'>1846</a> <a id='n1847' href='#n1847'>1847</a> <a id='n1848' href='#n1848'>1848</a> <a id='n1849' href='#n1849'>1849</a> <a id='n1850' href='#n1850'>1850</a> <a id='n1851' href='#n1851'>1851</a> <a id='n1852' href='#n1852'>1852</a> <a id='n1853' href='#n1853'>1853</a> <a id='n1854' href='#n1854'>1854</a> <a id='n1855' href='#n1855'>1855</a> <a id='n1856' href='#n1856'>1856</a> <a id='n1857' href='#n1857'>1857</a> <a id='n1858' href='#n1858'>1858</a> <a id='n1859' href='#n1859'>1859</a> <a id='n1860' href='#n1860'>1860</a> <a id='n1861' href='#n1861'>1861</a> <a id='n1862' href='#n1862'>1862</a> <a id='n1863' href='#n1863'>1863</a> <a id='n1864' href='#n1864'>1864</a> <a id='n1865' href='#n1865'>1865</a> <a id='n1866' href='#n1866'>1866</a> <a id='n1867' href='#n1867'>1867</a> <a id='n1868' href='#n1868'>1868</a> <a id='n1869' href='#n1869'>1869</a> <a id='n1870' href='#n1870'>1870</a> <a id='n1871' href='#n1871'>1871</a> <a id='n1872' href='#n1872'>1872</a> <a id='n1873' href='#n1873'>1873</a> <a id='n1874' href='#n1874'>1874</a> <a id='n1875' href='#n1875'>1875</a> <a id='n1876' href='#n1876'>1876</a> <a id='n1877' href='#n1877'>1877</a> <a id='n1878' href='#n1878'>1878</a> <a id='n1879' href='#n1879'>1879</a> <a id='n1880' href='#n1880'>1880</a> <a id='n1881' href='#n1881'>1881</a> <a id='n1882' href='#n1882'>1882</a> <a id='n1883' href='#n1883'>1883</a> <a id='n1884' href='#n1884'>1884</a> <a id='n1885' href='#n1885'>1885</a> <a id='n1886' href='#n1886'>1886</a> <a id='n1887' href='#n1887'>1887</a> <a id='n1888' href='#n1888'>1888</a> <a id='n1889' href='#n1889'>1889</a> <a id='n1890' href='#n1890'>1890</a> <a id='n1891' href='#n1891'>1891</a> <a id='n1892' href='#n1892'>1892</a> <a id='n1893' href='#n1893'>1893</a> <a id='n1894' href='#n1894'>1894</a> <a id='n1895' href='#n1895'>1895</a> <a id='n1896' href='#n1896'>1896</a> <a id='n1897' href='#n1897'>1897</a> <a id='n1898' href='#n1898'>1898</a> <a id='n1899' href='#n1899'>1899</a> <a id='n1900' href='#n1900'>1900</a> <a id='n1901' href='#n1901'>1901</a> <a id='n1902' href='#n1902'>1902</a> <a id='n1903' href='#n1903'>1903</a> <a id='n1904' href='#n1904'>1904</a> <a id='n1905' href='#n1905'>1905</a> <a id='n1906' href='#n1906'>1906</a> <a id='n1907' href='#n1907'>1907</a> <a id='n1908' href='#n1908'>1908</a> <a id='n1909' href='#n1909'>1909</a> <a id='n1910' href='#n1910'>1910</a> <a id='n1911' href='#n1911'>1911</a> <a id='n1912' href='#n1912'>1912</a> <a id='n1913' href='#n1913'>1913</a> <a id='n1914' href='#n1914'>1914</a> <a id='n1915' href='#n1915'>1915</a> <a id='n1916' href='#n1916'>1916</a> <a id='n1917' href='#n1917'>1917</a> <a id='n1918' href='#n1918'>1918</a> <a id='n1919' href='#n1919'>1919</a> <a id='n1920' href='#n1920'>1920</a> <a id='n1921' href='#n1921'>1921</a> <a id='n1922' href='#n1922'>1922</a> <a id='n1923' href='#n1923'>1923</a> <a id='n1924' href='#n1924'>1924</a> <a id='n1925' href='#n1925'>1925</a> <a id='n1926' href='#n1926'>1926</a> <a id='n1927' href='#n1927'>1927</a> <a id='n1928' href='#n1928'>1928</a> <a id='n1929' href='#n1929'>1929</a> <a id='n1930' href='#n1930'>1930</a> <a id='n1931' href='#n1931'>1931</a> <a id='n1932' href='#n1932'>1932</a> <a id='n1933' href='#n1933'>1933</a> <a id='n1934' href='#n1934'>1934</a> <a id='n1935' href='#n1935'>1935</a> <a id='n1936' href='#n1936'>1936</a> <a id='n1937' href='#n1937'>1937</a> <a id='n1938' href='#n1938'>1938</a> <a id='n1939' href='#n1939'>1939</a> <a id='n1940' href='#n1940'>1940</a> <a id='n1941' href='#n1941'>1941</a> <a id='n1942' href='#n1942'>1942</a> <a id='n1943' href='#n1943'>1943</a> <a id='n1944' href='#n1944'>1944</a> <a id='n1945' href='#n1945'>1945</a> <a id='n1946' href='#n1946'>1946</a> <a id='n1947' href='#n1947'>1947</a> <a id='n1948' href='#n1948'>1948</a> <a id='n1949' href='#n1949'>1949</a> <a id='n1950' href='#n1950'>1950</a> <a id='n1951' href='#n1951'>1951</a> <a id='n1952' href='#n1952'>1952</a> <a id='n1953' href='#n1953'>1953</a> <a id='n1954' href='#n1954'>1954</a> <a id='n1955' href='#n1955'>1955</a> <a id='n1956' href='#n1956'>1956</a> <a id='n1957' href='#n1957'>1957</a> <a id='n1958' href='#n1958'>1958</a> <a id='n1959' href='#n1959'>1959</a> <a id='n1960' href='#n1960'>1960</a> <a id='n1961' href='#n1961'>1961</a> <a id='n1962' href='#n1962'>1962</a> <a id='n1963' href='#n1963'>1963</a> <a id='n1964' href='#n1964'>1964</a> <a id='n1965' href='#n1965'>1965</a> <a id='n1966' href='#n1966'>1966</a> <a id='n1967' href='#n1967'>1967</a> <a id='n1968' href='#n1968'>1968</a> <a id='n1969' href='#n1969'>1969</a> <a id='n1970' href='#n1970'>1970</a> <a id='n1971' href='#n1971'>1971</a> <a id='n1972' href='#n1972'>1972</a> <a id='n1973' href='#n1973'>1973</a> <a id='n1974' href='#n1974'>1974</a> <a id='n1975' href='#n1975'>1975</a> <a id='n1976' href='#n1976'>1976</a> <a id='n1977' href='#n1977'>1977</a> <a id='n1978' href='#n1978'>1978</a> <a id='n1979' href='#n1979'>1979</a> <a id='n1980' href='#n1980'>1980</a> <a id='n1981' href='#n1981'>1981</a> <a id='n1982' href='#n1982'>1982</a> <a id='n1983' href='#n1983'>1983</a> <a id='n1984' href='#n1984'>1984</a> <a id='n1985' href='#n1985'>1985</a> <a id='n1986' href='#n1986'>1986</a> <a id='n1987' href='#n1987'>1987</a> <a id='n1988' href='#n1988'>1988</a> <a id='n1989' href='#n1989'>1989</a> <a id='n1990' href='#n1990'>1990</a> <a id='n1991' href='#n1991'>1991</a> <a id='n1992' href='#n1992'>1992</a> <a id='n1993' href='#n1993'>1993</a> <a id='n1994' href='#n1994'>1994</a> <a id='n1995' href='#n1995'>1995</a> <a id='n1996' href='#n1996'>1996</a> <a id='n1997' href='#n1997'>1997</a> <a id='n1998' href='#n1998'>1998</a> <a id='n1999' href='#n1999'>1999</a> <a id='n2000' href='#n2000'>2000</a> <a id='n2001' href='#n2001'>2001</a> <a id='n2002' href='#n2002'>2002</a> <a id='n2003' href='#n2003'>2003</a> <a id='n2004' href='#n2004'>2004</a> <a id='n2005' href='#n2005'>2005</a> <a id='n2006' href='#n2006'>2006</a> <a id='n2007' href='#n2007'>2007</a> <a id='n2008' href='#n2008'>2008</a> <a id='n2009' href='#n2009'>2009</a> <a id='n2010' href='#n2010'>2010</a> <a id='n2011' href='#n2011'>2011</a> <a id='n2012' href='#n2012'>2012</a> <a id='n2013' href='#n2013'>2013</a> <a id='n2014' href='#n2014'>2014</a> <a id='n2015' href='#n2015'>2015</a> <a id='n2016' href='#n2016'>2016</a> <a id='n2017' href='#n2017'>2017</a> <a id='n2018' href='#n2018'>2018</a> <a id='n2019' href='#n2019'>2019</a> <a id='n2020' href='#n2020'>2020</a> <a id='n2021' href='#n2021'>2021</a> <a id='n2022' href='#n2022'>2022</a> <a id='n2023' href='#n2023'>2023</a> <a id='n2024' href='#n2024'>2024</a> <a id='n2025' href='#n2025'>2025</a> <a id='n2026' href='#n2026'>2026</a> <a id='n2027' href='#n2027'>2027</a> <a id='n2028' href='#n2028'>2028</a> <a id='n2029' href='#n2029'>2029</a> <a id='n2030' href='#n2030'>2030</a> <a id='n2031' href='#n2031'>2031</a> <a id='n2032' href='#n2032'>2032</a> <a id='n2033' href='#n2033'>2033</a> <a id='n2034' href='#n2034'>2034</a> <a id='n2035' href='#n2035'>2035</a> <a id='n2036' href='#n2036'>2036</a> <a id='n2037' href='#n2037'>2037</a> <a id='n2038' href='#n2038'>2038</a> <a id='n2039' href='#n2039'>2039</a> <a id='n2040' href='#n2040'>2040</a> <a id='n2041' href='#n2041'>2041</a> <a id='n2042' href='#n2042'>2042</a> <a id='n2043' href='#n2043'>2043</a> <a id='n2044' href='#n2044'>2044</a> <a id='n2045' href='#n2045'>2045</a> <a id='n2046' href='#n2046'>2046</a> <a id='n2047' href='#n2047'>2047</a> <a id='n2048' href='#n2048'>2048</a> <a id='n2049' href='#n2049'>2049</a> <a id='n2050' href='#n2050'>2050</a> <a id='n2051' href='#n2051'>2051</a> <a id='n2052' href='#n2052'>2052</a> <a id='n2053' href='#n2053'>2053</a> <a id='n2054' href='#n2054'>2054</a> <a id='n2055' href='#n2055'>2055</a> <a id='n2056' href='#n2056'>2056</a> <a id='n2057' href='#n2057'>2057</a> <a id='n2058' href='#n2058'>2058</a> <a id='n2059' href='#n2059'>2059</a> <a id='n2060' href='#n2060'>2060</a> <a id='n2061' href='#n2061'>2061</a> <a id='n2062' href='#n2062'>2062</a> <a id='n2063' href='#n2063'>2063</a> <a id='n2064' href='#n2064'>2064</a> <a id='n2065' href='#n2065'>2065</a> <a id='n2066' href='#n2066'>2066</a> <a id='n2067' href='#n2067'>2067</a> <a id='n2068' href='#n2068'>2068</a> <a id='n2069' href='#n2069'>2069</a> <a id='n2070' href='#n2070'>2070</a> <a id='n2071' href='#n2071'>2071</a> <a id='n2072' href='#n2072'>2072</a> <a id='n2073' href='#n2073'>2073</a> <a id='n2074' href='#n2074'>2074</a> <a id='n2075' href='#n2075'>2075</a> <a id='n2076' href='#n2076'>2076</a> <a id='n2077' href='#n2077'>2077</a> <a id='n2078' href='#n2078'>2078</a> <a id='n2079' href='#n2079'>2079</a> <a id='n2080' href='#n2080'>2080</a> <a id='n2081' href='#n2081'>2081</a> <a id='n2082' href='#n2082'>2082</a> <a id='n2083' href='#n2083'>2083</a> <a id='n2084' href='#n2084'>2084</a> <a id='n2085' href='#n2085'>2085</a> <a id='n2086' href='#n2086'>2086</a> <a id='n2087' href='#n2087'>2087</a> <a id='n2088' href='#n2088'>2088</a> <a id='n2089' href='#n2089'>2089</a> <a id='n2090' href='#n2090'>2090</a> <a id='n2091' href='#n2091'>2091</a> <a id='n2092' href='#n2092'>2092</a> <a id='n2093' href='#n2093'>2093</a> <a id='n2094' href='#n2094'>2094</a> <a id='n2095' href='#n2095'>2095</a> <a id='n2096' href='#n2096'>2096</a> <a id='n2097' href='#n2097'>2097</a> <a id='n2098' href='#n2098'>2098</a> <a id='n2099' href='#n2099'>2099</a> <a id='n2100' href='#n2100'>2100</a> <a id='n2101' href='#n2101'>2101</a> <a id='n2102' href='#n2102'>2102</a> <a id='n2103' href='#n2103'>2103</a> <a id='n2104' href='#n2104'>2104</a> <a id='n2105' href='#n2105'>2105</a> <a id='n2106' href='#n2106'>2106</a> <a id='n2107' href='#n2107'>2107</a> <a id='n2108' href='#n2108'>2108</a> <a id='n2109' href='#n2109'>2109</a> <a id='n2110' href='#n2110'>2110</a> <a id='n2111' href='#n2111'>2111</a> <a id='n2112' href='#n2112'>2112</a> <a id='n2113' href='#n2113'>2113</a> <a id='n2114' href='#n2114'>2114</a> <a id='n2115' href='#n2115'>2115</a> <a id='n2116' href='#n2116'>2116</a> <a id='n2117' href='#n2117'>2117</a> <a id='n2118' href='#n2118'>2118</a> <a id='n2119' href='#n2119'>2119</a> <a id='n2120' href='#n2120'>2120</a> <a id='n2121' href='#n2121'>2121</a> <a id='n2122' href='#n2122'>2122</a> <a id='n2123' href='#n2123'>2123</a> <a id='n2124' href='#n2124'>2124</a> <a id='n2125' href='#n2125'>2125</a> <a id='n2126' href='#n2126'>2126</a> <a id='n2127' href='#n2127'>2127</a> <a id='n2128' href='#n2128'>2128</a> <a id='n2129' href='#n2129'>2129</a> <a id='n2130' href='#n2130'>2130</a> <a id='n2131' href='#n2131'>2131</a> <a id='n2132' href='#n2132'>2132</a> <a id='n2133' href='#n2133'>2133</a> <a id='n2134' href='#n2134'>2134</a> <a id='n2135' href='#n2135'>2135</a> <a id='n2136' href='#n2136'>2136</a> <a id='n2137' href='#n2137'>2137</a> <a id='n2138' href='#n2138'>2138</a> <a id='n2139' href='#n2139'>2139</a> <a id='n2140' href='#n2140'>2140</a> <a id='n2141' href='#n2141'>2141</a> <a id='n2142' href='#n2142'>2142</a> <a id='n2143' href='#n2143'>2143</a> <a id='n2144' href='#n2144'>2144</a> <a id='n2145' href='#n2145'>2145</a> <a id='n2146' href='#n2146'>2146</a> <a id='n2147' href='#n2147'>2147</a> <a id='n2148' href='#n2148'>2148</a> <a id='n2149' href='#n2149'>2149</a> <a id='n2150' href='#n2150'>2150</a> <a id='n2151' href='#n2151'>2151</a> <a id='n2152' href='#n2152'>2152</a> <a id='n2153' href='#n2153'>2153</a> <a id='n2154' href='#n2154'>2154</a> <a id='n2155' href='#n2155'>2155</a> <a id='n2156' href='#n2156'>2156</a> <a id='n2157' href='#n2157'>2157</a> <a id='n2158' href='#n2158'>2158</a> <a id='n2159' href='#n2159'>2159</a> <a id='n2160' href='#n2160'>2160</a> <a id='n2161' href='#n2161'>2161</a> <a id='n2162' href='#n2162'>2162</a> <a id='n2163' href='#n2163'>2163</a> <a id='n2164' href='#n2164'>2164</a> <a id='n2165' href='#n2165'>2165</a> <a id='n2166' href='#n2166'>2166</a> <a id='n2167' href='#n2167'>2167</a> <a id='n2168' href='#n2168'>2168</a> <a id='n2169' href='#n2169'>2169</a> <a id='n2170' href='#n2170'>2170</a> <a id='n2171' href='#n2171'>2171</a> <a id='n2172' href='#n2172'>2172</a> <a id='n2173' href='#n2173'>2173</a> <a id='n2174' href='#n2174'>2174</a> <a id='n2175' href='#n2175'>2175</a> <a id='n2176' href='#n2176'>2176</a> <a id='n2177' href='#n2177'>2177</a> <a id='n2178' href='#n2178'>2178</a> <a id='n2179' href='#n2179'>2179</a> <a id='n2180' href='#n2180'>2180</a> <a id='n2181' href='#n2181'>2181</a> <a id='n2182' href='#n2182'>2182</a> <a id='n2183' href='#n2183'>2183</a> <a id='n2184' href='#n2184'>2184</a> <a id='n2185' href='#n2185'>2185</a> <a id='n2186' href='#n2186'>2186</a> <a id='n2187' href='#n2187'>2187</a> <a id='n2188' href='#n2188'>2188</a> <a id='n2189' href='#n2189'>2189</a> <a id='n2190' href='#n2190'>2190</a> <a id='n2191' href='#n2191'>2191</a> <a id='n2192' href='#n2192'>2192</a> <a id='n2193' href='#n2193'>2193</a> <a id='n2194' href='#n2194'>2194</a> <a id='n2195' href='#n2195'>2195</a> <a id='n2196' href='#n2196'>2196</a> <a id='n2197' href='#n2197'>2197</a> <a id='n2198' href='#n2198'>2198</a> <a id='n2199' href='#n2199'>2199</a> <a id='n2200' href='#n2200'>2200</a> <a id='n2201' href='#n2201'>2201</a> <a id='n2202' href='#n2202'>2202</a> <a id='n2203' href='#n2203'>2203</a> <a id='n2204' href='#n2204'>2204</a> <a id='n2205' href='#n2205'>2205</a> <a id='n2206' href='#n2206'>2206</a> <a id='n2207' href='#n2207'>2207</a> <a id='n2208' href='#n2208'>2208</a> <a id='n2209' href='#n2209'>2209</a> <a id='n2210' href='#n2210'>2210</a> <a id='n2211' href='#n2211'>2211</a> <a id='n2212' href='#n2212'>2212</a> <a id='n2213' href='#n2213'>2213</a> <a id='n2214' href='#n2214'>2214</a> <a id='n2215' href='#n2215'>2215</a> <a id='n2216' href='#n2216'>2216</a> <a id='n2217' href='#n2217'>2217</a> <a id='n2218' href='#n2218'>2218</a> <a id='n2219' href='#n2219'>2219</a> <a id='n2220' href='#n2220'>2220</a> <a id='n2221' href='#n2221'>2221</a> <a id='n2222' href='#n2222'>2222</a> <a id='n2223' href='#n2223'>2223</a> <a id='n2224' href='#n2224'>2224</a> <a id='n2225' href='#n2225'>2225</a> <a id='n2226' href='#n2226'>2226</a> <a id='n2227' href='#n2227'>2227</a> <a id='n2228' href='#n2228'>2228</a> <a id='n2229' href='#n2229'>2229</a> <a id='n2230' href='#n2230'>2230</a> <a id='n2231' href='#n2231'>2231</a> <a id='n2232' href='#n2232'>2232</a> <a id='n2233' href='#n2233'>2233</a> <a id='n2234' href='#n2234'>2234</a> <a id='n2235' href='#n2235'>2235</a> <a id='n2236' href='#n2236'>2236</a> <a id='n2237' href='#n2237'>2237</a> <a id='n2238' href='#n2238'>2238</a> <a id='n2239' href='#n2239'>2239</a> <a id='n2240' href='#n2240'>2240</a> <a id='n2241' href='#n2241'>2241</a> <a id='n2242' href='#n2242'>2242</a> <a id='n2243' href='#n2243'>2243</a> <a id='n2244' href='#n2244'>2244</a> <a id='n2245' href='#n2245'>2245</a> <a id='n2246' href='#n2246'>2246</a> <a id='n2247' href='#n2247'>2247</a> <a id='n2248' href='#n2248'>2248</a> <a id='n2249' href='#n2249'>2249</a> <a id='n2250' href='#n2250'>2250</a> <a id='n2251' href='#n2251'>2251</a> <a id='n2252' href='#n2252'>2252</a> <a id='n2253' href='#n2253'>2253</a> <a id='n2254' href='#n2254'>2254</a> <a id='n2255' href='#n2255'>2255</a> <a id='n2256' href='#n2256'>2256</a> <a id='n2257' href='#n2257'>2257</a> <a id='n2258' href='#n2258'>2258</a> <a id='n2259' href='#n2259'>2259</a> <a id='n2260' href='#n2260'>2260</a> <a id='n2261' href='#n2261'>2261</a> <a id='n2262' href='#n2262'>2262</a> <a id='n2263' href='#n2263'>2263</a> <a id='n2264' href='#n2264'>2264</a> <a id='n2265' href='#n2265'>2265</a> <a id='n2266' href='#n2266'>2266</a> <a id='n2267' href='#n2267'>2267</a> <a id='n2268' href='#n2268'>2268</a> <a id='n2269' href='#n2269'>2269</a> <a id='n2270' href='#n2270'>2270</a> <a id='n2271' href='#n2271'>2271</a> <a id='n2272' href='#n2272'>2272</a> <a id='n2273' href='#n2273'>2273</a> <a id='n2274' href='#n2274'>2274</a> <a id='n2275' href='#n2275'>2275</a> <a id='n2276' href='#n2276'>2276</a> <a id='n2277' href='#n2277'>2277</a> <a id='n2278' href='#n2278'>2278</a> <a id='n2279' href='#n2279'>2279</a> <a id='n2280' href='#n2280'>2280</a> <a id='n2281' href='#n2281'>2281</a> <a id='n2282' href='#n2282'>2282</a> <a id='n2283' href='#n2283'>2283</a> <a id='n2284' href='#n2284'>2284</a> <a id='n2285' href='#n2285'>2285</a> <a id='n2286' href='#n2286'>2286</a> <a id='n2287' href='#n2287'>2287</a> <a id='n2288' href='#n2288'>2288</a> <a id='n2289' href='#n2289'>2289</a> <a id='n2290' href='#n2290'>2290</a> <a id='n2291' href='#n2291'>2291</a> <a id='n2292' href='#n2292'>2292</a> <a id='n2293' href='#n2293'>2293</a> <a id='n2294' href='#n2294'>2294</a> <a id='n2295' href='#n2295'>2295</a> <a id='n2296' href='#n2296'>2296</a> <a id='n2297' href='#n2297'>2297</a> <a id='n2298' href='#n2298'>2298</a> <a id='n2299' href='#n2299'>2299</a> <a id='n2300' href='#n2300'>2300</a> <a id='n2301' href='#n2301'>2301</a> <a id='n2302' href='#n2302'>2302</a> <a id='n2303' href='#n2303'>2303</a> <a id='n2304' href='#n2304'>2304</a> <a id='n2305' href='#n2305'>2305</a> <a id='n2306' href='#n2306'>2306</a> <a id='n2307' href='#n2307'>2307</a> <a id='n2308' href='#n2308'>2308</a> <a id='n2309' href='#n2309'>2309</a> <a id='n2310' href='#n2310'>2310</a> <a id='n2311' href='#n2311'>2311</a> <a id='n2312' href='#n2312'>2312</a> <a id='n2313' href='#n2313'>2313</a> <a id='n2314' href='#n2314'>2314</a> <a id='n2315' href='#n2315'>2315</a> <a id='n2316' href='#n2316'>2316</a> <a id='n2317' href='#n2317'>2317</a> <a id='n2318' href='#n2318'>2318</a> <a id='n2319' href='#n2319'>2319</a> <a id='n2320' href='#n2320'>2320</a> <a id='n2321' href='#n2321'>2321</a> <a id='n2322' href='#n2322'>2322</a> <a id='n2323' href='#n2323'>2323</a> <a id='n2324' href='#n2324'>2324</a> <a id='n2325' href='#n2325'>2325</a> <a id='n2326' href='#n2326'>2326</a> <a id='n2327' href='#n2327'>2327</a> <a id='n2328' href='#n2328'>2328</a> <a id='n2329' href='#n2329'>2329</a> <a id='n2330' href='#n2330'>2330</a> <a id='n2331' href='#n2331'>2331</a> <a id='n2332' href='#n2332'>2332</a> <a id='n2333' href='#n2333'>2333</a> <a id='n2334' href='#n2334'>2334</a> <a id='n2335' href='#n2335'>2335</a> <a id='n2336' href='#n2336'>2336</a> <a id='n2337' href='#n2337'>2337</a> <a id='n2338' href='#n2338'>2338</a> <a id='n2339' href='#n2339'>2339</a> <a id='n2340' href='#n2340'>2340</a> <a id='n2341' href='#n2341'>2341</a> <a id='n2342' href='#n2342'>2342</a> <a id='n2343' href='#n2343'>2343</a> <a id='n2344' href='#n2344'>2344</a> <a id='n2345' href='#n2345'>2345</a> <a id='n2346' href='#n2346'>2346</a> <a id='n2347' href='#n2347'>2347</a> <a id='n2348' href='#n2348'>2348</a> <a id='n2349' href='#n2349'>2349</a> <a id='n2350' href='#n2350'>2350</a> <a id='n2351' href='#n2351'>2351</a> <a id='n2352' href='#n2352'>2352</a> <a id='n2353' href='#n2353'>2353</a> <a id='n2354' href='#n2354'>2354</a> <a id='n2355' href='#n2355'>2355</a> <a id='n2356' href='#n2356'>2356</a> <a id='n2357' href='#n2357'>2357</a> <a id='n2358' href='#n2358'>2358</a> <a id='n2359' href='#n2359'>2359</a> <a id='n2360' href='#n2360'>2360</a> <a id='n2361' href='#n2361'>2361</a> <a id='n2362' href='#n2362'>2362</a> <a id='n2363' href='#n2363'>2363</a> <a id='n2364' href='#n2364'>2364</a> <a id='n2365' href='#n2365'>2365</a> <a id='n2366' href='#n2366'>2366</a> <a id='n2367' href='#n2367'>2367</a> <a id='n2368' href='#n2368'>2368</a> <a id='n2369' href='#n2369'>2369</a> <a id='n2370' href='#n2370'>2370</a> <a id='n2371' href='#n2371'>2371</a> <a id='n2372' href='#n2372'>2372</a> <a id='n2373' href='#n2373'>2373</a> <a id='n2374' href='#n2374'>2374</a> <a id='n2375' href='#n2375'>2375</a> <a id='n2376' href='#n2376'>2376</a> <a id='n2377' href='#n2377'>2377</a> <a id='n2378' href='#n2378'>2378</a> <a id='n2379' href='#n2379'>2379</a> <a id='n2380' href='#n2380'>2380</a> <a id='n2381' href='#n2381'>2381</a> <a id='n2382' href='#n2382'>2382</a> <a id='n2383' href='#n2383'>2383</a> <a id='n2384' href='#n2384'>2384</a> <a id='n2385' href='#n2385'>2385</a> <a id='n2386' href='#n2386'>2386</a> <a id='n2387' href='#n2387'>2387</a> <a id='n2388' href='#n2388'>2388</a> <a id='n2389' href='#n2389'>2389</a> <a id='n2390' href='#n2390'>2390</a> <a id='n2391' href='#n2391'>2391</a> <a id='n2392' href='#n2392'>2392</a> <a id='n2393' href='#n2393'>2393</a> <a id='n2394' href='#n2394'>2394</a> <a id='n2395' href='#n2395'>2395</a> <a id='n2396' href='#n2396'>2396</a> <a id='n2397' href='#n2397'>2397</a> <a id='n2398' href='#n2398'>2398</a> <a id='n2399' href='#n2399'>2399</a> <a id='n2400' href='#n2400'>2400</a> <a id='n2401' href='#n2401'>2401</a> <a id='n2402' href='#n2402'>2402</a> <a id='n2403' href='#n2403'>2403</a> <a id='n2404' href='#n2404'>2404</a> <a id='n2405' href='#n2405'>2405</a> <a id='n2406' href='#n2406'>2406</a> <a id='n2407' href='#n2407'>2407</a> <a id='n2408' href='#n2408'>2408</a> <a id='n2409' href='#n2409'>2409</a> <a id='n2410' href='#n2410'>2410</a> <a id='n2411' href='#n2411'>2411</a> <a id='n2412' href='#n2412'>2412</a> <a id='n2413' href='#n2413'>2413</a> <a id='n2414' href='#n2414'>2414</a> <a id='n2415' href='#n2415'>2415</a> <a id='n2416' href='#n2416'>2416</a> <a id='n2417' href='#n2417'>2417</a> <a id='n2418' href='#n2418'>2418</a> <a id='n2419' href='#n2419'>2419</a> <a id='n2420' href='#n2420'>2420</a> <a id='n2421' href='#n2421'>2421</a> <a id='n2422' href='#n2422'>2422</a> <a id='n2423' href='#n2423'>2423</a> <a id='n2424' href='#n2424'>2424</a> <a id='n2425' href='#n2425'>2425</a> <a id='n2426' href='#n2426'>2426</a> <a id='n2427' href='#n2427'>2427</a> <a id='n2428' href='#n2428'>2428</a> <a id='n2429' href='#n2429'>2429</a> <a id='n2430' href='#n2430'>2430</a> <a id='n2431' href='#n2431'>2431</a> <a id='n2432' href='#n2432'>2432</a> <a id='n2433' href='#n2433'>2433</a> <a id='n2434' href='#n2434'>2434</a> <a id='n2435' href='#n2435'>2435</a> <a id='n2436' href='#n2436'>2436</a> <a id='n2437' href='#n2437'>2437</a> <a id='n2438' href='#n2438'>2438</a> <a id='n2439' href='#n2439'>2439</a> <a id='n2440' href='#n2440'>2440</a> <a id='n2441' href='#n2441'>2441</a> <a id='n2442' href='#n2442'>2442</a> <a id='n2443' href='#n2443'>2443</a> <a id='n2444' href='#n2444'>2444</a> <a id='n2445' href='#n2445'>2445</a> <a id='n2446' href='#n2446'>2446</a> <a id='n2447' href='#n2447'>2447</a> <a id='n2448' href='#n2448'>2448</a> <a id='n2449' href='#n2449'>2449</a> <a id='n2450' href='#n2450'>2450</a> <a id='n2451' href='#n2451'>2451</a> <a id='n2452' href='#n2452'>2452</a> <a id='n2453' href='#n2453'>2453</a> <a id='n2454' href='#n2454'>2454</a> <a id='n2455' href='#n2455'>2455</a> <a id='n2456' href='#n2456'>2456</a> <a id='n2457' href='#n2457'>2457</a> <a id='n2458' href='#n2458'>2458</a> <a id='n2459' href='#n2459'>2459</a> <a id='n2460' href='#n2460'>2460</a> <a id='n2461' href='#n2461'>2461</a> <a id='n2462' href='#n2462'>2462</a> <a id='n2463' href='#n2463'>2463</a> <a id='n2464' href='#n2464'>2464</a> <a id='n2465' href='#n2465'>2465</a> <a id='n2466' href='#n2466'>2466</a> <a id='n2467' href='#n2467'>2467</a> <a id='n2468' href='#n2468'>2468</a> <a id='n2469' href='#n2469'>2469</a> <a id='n2470' href='#n2470'>2470</a> <a id='n2471' href='#n2471'>2471</a> <a id='n2472' href='#n2472'>2472</a> <a id='n2473' href='#n2473'>2473</a> <a id='n2474' href='#n2474'>2474</a> <a id='n2475' href='#n2475'>2475</a> <a id='n2476' href='#n2476'>2476</a> <a id='n2477' href='#n2477'>2477</a> <a id='n2478' href='#n2478'>2478</a> <a id='n2479' href='#n2479'>2479</a> <a id='n2480' href='#n2480'>2480</a> <a id='n2481' href='#n2481'>2481</a> <a id='n2482' href='#n2482'>2482</a> <a id='n2483' href='#n2483'>2483</a> <a id='n2484' href='#n2484'>2484</a> <a id='n2485' href='#n2485'>2485</a> <a id='n2486' href='#n2486'>2486</a> <a id='n2487' href='#n2487'>2487</a> <a id='n2488' href='#n2488'>2488</a> <a id='n2489' href='#n2489'>2489</a> <a id='n2490' href='#n2490'>2490</a> <a id='n2491' href='#n2491'>2491</a> <a id='n2492' href='#n2492'>2492</a> <a id='n2493' href='#n2493'>2493</a> <a id='n2494' href='#n2494'>2494</a> <a id='n2495' href='#n2495'>2495</a> <a id='n2496' href='#n2496'>2496</a> <a id='n2497' href='#n2497'>2497</a> <a id='n2498' href='#n2498'>2498</a> <a id='n2499' href='#n2499'>2499</a> <a id='n2500' href='#n2500'>2500</a> <a id='n2501' href='#n2501'>2501</a> <a id='n2502' href='#n2502'>2502</a> <a id='n2503' href='#n2503'>2503</a> <a id='n2504' href='#n2504'>2504</a> <a id='n2505' href='#n2505'>2505</a> <a id='n2506' href='#n2506'>2506</a> <a id='n2507' href='#n2507'>2507</a> <a id='n2508' href='#n2508'>2508</a> <a id='n2509' href='#n2509'>2509</a> <a id='n2510' href='#n2510'>2510</a> <a id='n2511' href='#n2511'>2511</a> <a id='n2512' href='#n2512'>2512</a> <a id='n2513' href='#n2513'>2513</a> <a id='n2514' href='#n2514'>2514</a> <a id='n2515' href='#n2515'>2515</a> <a id='n2516' href='#n2516'>2516</a> <a id='n2517' href='#n2517'>2517</a> <a id='n2518' href='#n2518'>2518</a> <a id='n2519' href='#n2519'>2519</a> <a id='n2520' href='#n2520'>2520</a> <a id='n2521' href='#n2521'>2521</a> <a id='n2522' href='#n2522'>2522</a> <a id='n2523' href='#n2523'>2523</a> <a id='n2524' href='#n2524'>2524</a> <a id='n2525' href='#n2525'>2525</a> <a id='n2526' href='#n2526'>2526</a> <a id='n2527' href='#n2527'>2527</a> <a id='n2528' href='#n2528'>2528</a> <a id='n2529' href='#n2529'>2529</a> <a id='n2530' href='#n2530'>2530</a> <a id='n2531' href='#n2531'>2531</a> <a id='n2532' href='#n2532'>2532</a> <a id='n2533' href='#n2533'>2533</a> <a id='n2534' href='#n2534'>2534</a> <a id='n2535' href='#n2535'>2535</a> <a id='n2536' href='#n2536'>2536</a> <a id='n2537' href='#n2537'>2537</a> <a id='n2538' href='#n2538'>2538</a> <a id='n2539' href='#n2539'>2539</a> <a id='n2540' href='#n2540'>2540</a> <a id='n2541' href='#n2541'>2541</a> <a id='n2542' href='#n2542'>2542</a> <a id='n2543' href='#n2543'>2543</a> <a id='n2544' href='#n2544'>2544</a> <a id='n2545' href='#n2545'>2545</a> <a id='n2546' href='#n2546'>2546</a> <a id='n2547' href='#n2547'>2547</a> <a id='n2548' href='#n2548'>2548</a> <a id='n2549' href='#n2549'>2549</a> <a id='n2550' href='#n2550'>2550</a> <a id='n2551' href='#n2551'>2551</a> <a id='n2552' href='#n2552'>2552</a> <a id='n2553' href='#n2553'>2553</a> <a id='n2554' href='#n2554'>2554</a> <a id='n2555' href='#n2555'>2555</a> <a id='n2556' href='#n2556'>2556</a> <a id='n2557' href='#n2557'>2557</a> <a id='n2558' href='#n2558'>2558</a> <a id='n2559' href='#n2559'>2559</a> <a id='n2560' href='#n2560'>2560</a> <a id='n2561' href='#n2561'>2561</a> <a id='n2562' href='#n2562'>2562</a> <a id='n2563' href='#n2563'>2563</a> <a id='n2564' href='#n2564'>2564</a> <a id='n2565' href='#n2565'>2565</a> <a id='n2566' href='#n2566'>2566</a> <a id='n2567' href='#n2567'>2567</a> <a id='n2568' href='#n2568'>2568</a> <a id='n2569' href='#n2569'>2569</a> <a id='n2570' href='#n2570'>2570</a> <a id='n2571' href='#n2571'>2571</a> <a id='n2572' href='#n2572'>2572</a> <a id='n2573' href='#n2573'>2573</a> <a id='n2574' href='#n2574'>2574</a> <a id='n2575' href='#n2575'>2575</a> <a id='n2576' href='#n2576'>2576</a> <a id='n2577' href='#n2577'>2577</a> <a id='n2578' href='#n2578'>2578</a> <a id='n2579' href='#n2579'>2579</a> <a id='n2580' href='#n2580'>2580</a> <a id='n2581' href='#n2581'>2581</a> <a id='n2582' href='#n2582'>2582</a> <a id='n2583' href='#n2583'>2583</a> <a id='n2584' href='#n2584'>2584</a> <a id='n2585' href='#n2585'>2585</a> <a id='n2586' href='#n2586'>2586</a> <a id='n2587' href='#n2587'>2587</a> <a id='n2588' href='#n2588'>2588</a> <a id='n2589' href='#n2589'>2589</a> <a id='n2590' href='#n2590'>2590</a> <a id='n2591' href='#n2591'>2591</a> <a id='n2592' href='#n2592'>2592</a> <a id='n2593' href='#n2593'>2593</a> <a id='n2594' href='#n2594'>2594</a> <a id='n2595' href='#n2595'>2595</a> <a id='n2596' href='#n2596'>2596</a> <a id='n2597' href='#n2597'>2597</a> <a id='n2598' href='#n2598'>2598</a> <a id='n2599' href='#n2599'>2599</a> <a id='n2600' href='#n2600'>2600</a> <a id='n2601' href='#n2601'>2601</a> <a id='n2602' href='#n2602'>2602</a> <a id='n2603' href='#n2603'>2603</a> <a id='n2604' href='#n2604'>2604</a> <a id='n2605' href='#n2605'>2605</a> <a id='n2606' href='#n2606'>2606</a> <a id='n2607' href='#n2607'>2607</a> <a id='n2608' href='#n2608'>2608</a> <a id='n2609' href='#n2609'>2609</a> <a id='n2610' href='#n2610'>2610</a> <a id='n2611' href='#n2611'>2611</a> <a id='n2612' href='#n2612'>2612</a> <a id='n2613' href='#n2613'>2613</a> <a id='n2614' href='#n2614'>2614</a> <a id='n2615' href='#n2615'>2615</a> <a id='n2616' href='#n2616'>2616</a> <a id='n2617' href='#n2617'>2617</a> <a id='n2618' href='#n2618'>2618</a> <a id='n2619' href='#n2619'>2619</a> <a id='n2620' href='#n2620'>2620</a> <a id='n2621' href='#n2621'>2621</a> <a id='n2622' href='#n2622'>2622</a> <a id='n2623' href='#n2623'>2623</a> <a id='n2624' href='#n2624'>2624</a> <a id='n2625' href='#n2625'>2625</a> <a id='n2626' href='#n2626'>2626</a> <a id='n2627' href='#n2627'>2627</a> <a id='n2628' href='#n2628'>2628</a> <a id='n2629' href='#n2629'>2629</a> <a id='n2630' href='#n2630'>2630</a> <a id='n2631' href='#n2631'>2631</a> <a id='n2632' href='#n2632'>2632</a> <a id='n2633' href='#n2633'>2633</a> <a id='n2634' href='#n2634'>2634</a> <a id='n2635' href='#n2635'>2635</a> <a id='n2636' href='#n2636'>2636</a> <a id='n2637' href='#n2637'>2637</a> <a id='n2638' href='#n2638'>2638</a> <a id='n2639' href='#n2639'>2639</a> <a id='n2640' href='#n2640'>2640</a> <a id='n2641' href='#n2641'>2641</a> <a id='n2642' href='#n2642'>2642</a> <a id='n2643' href='#n2643'>2643</a> <a id='n2644' href='#n2644'>2644</a> <a id='n2645' href='#n2645'>2645</a> <a id='n2646' href='#n2646'>2646</a> <a id='n2647' href='#n2647'>2647</a> <a id='n2648' href='#n2648'>2648</a> <a id='n2649' href='#n2649'>2649</a> <a id='n2650' href='#n2650'>2650</a> <a id='n2651' href='#n2651'>2651</a> <a id='n2652' href='#n2652'>2652</a> <a id='n2653' href='#n2653'>2653</a> <a id='n2654' href='#n2654'>2654</a> <a id='n2655' href='#n2655'>2655</a> <a id='n2656' href='#n2656'>2656</a> <a id='n2657' href='#n2657'>2657</a> <a id='n2658' href='#n2658'>2658</a> <a id='n2659' href='#n2659'>2659</a> <a id='n2660' href='#n2660'>2660</a> <a id='n2661' href='#n2661'>2661</a> <a id='n2662' href='#n2662'>2662</a> <a id='n2663' href='#n2663'>2663</a> <a id='n2664' href='#n2664'>2664</a> <a id='n2665' href='#n2665'>2665</a> <a id='n2666' href='#n2666'>2666</a> <a id='n2667' href='#n2667'>2667</a> <a id='n2668' href='#n2668'>2668</a> <a id='n2669' href='#n2669'>2669</a> <a id='n2670' href='#n2670'>2670</a> <a id='n2671' href='#n2671'>2671</a> <a id='n2672' href='#n2672'>2672</a> <a id='n2673' href='#n2673'>2673</a> <a id='n2674' href='#n2674'>2674</a> <a id='n2675' href='#n2675'>2675</a> <a id='n2676' href='#n2676'>2676</a> <a id='n2677' href='#n2677'>2677</a> <a id='n2678' href='#n2678'>2678</a> <a id='n2679' href='#n2679'>2679</a> <a id='n2680' href='#n2680'>2680</a> <a id='n2681' href='#n2681'>2681</a> <a id='n2682' href='#n2682'>2682</a> <a id='n2683' href='#n2683'>2683</a> <a id='n2684' href='#n2684'>2684</a> <a id='n2685' href='#n2685'>2685</a> <a id='n2686' href='#n2686'>2686</a> <a id='n2687' href='#n2687'>2687</a> <a id='n2688' href='#n2688'>2688</a> <a id='n2689' href='#n2689'>2689</a> <a id='n2690' href='#n2690'>2690</a> <a id='n2691' href='#n2691'>2691</a> <a id='n2692' href='#n2692'>2692</a> <a id='n2693' href='#n2693'>2693</a> <a id='n2694' href='#n2694'>2694</a> <a id='n2695' href='#n2695'>2695</a> <a id='n2696' href='#n2696'>2696</a> <a id='n2697' href='#n2697'>2697</a> <a id='n2698' href='#n2698'>2698</a> <a id='n2699' href='#n2699'>2699</a> <a id='n2700' href='#n2700'>2700</a> <a id='n2701' href='#n2701'>2701</a> <a id='n2702' href='#n2702'>2702</a> <a id='n2703' href='#n2703'>2703</a> <a id='n2704' href='#n2704'>2704</a> <a id='n2705' href='#n2705'>2705</a> <a id='n2706' href='#n2706'>2706</a> <a id='n2707' href='#n2707'>2707</a> <a id='n2708' href='#n2708'>2708</a> <a id='n2709' href='#n2709'>2709</a> <a id='n2710' href='#n2710'>2710</a> <a id='n2711' href='#n2711'>2711</a> <a id='n2712' href='#n2712'>2712</a> <a id='n2713' href='#n2713'>2713</a> <a id='n2714' href='#n2714'>2714</a> <a id='n2715' href='#n2715'>2715</a> <a id='n2716' href='#n2716'>2716</a> <a id='n2717' href='#n2717'>2717</a> <a id='n2718' href='#n2718'>2718</a> <a id='n2719' href='#n2719'>2719</a> <a id='n2720' href='#n2720'>2720</a> <a id='n2721' href='#n2721'>2721</a> <a id='n2722' href='#n2722'>2722</a> <a id='n2723' href='#n2723'>2723</a> <a id='n2724' href='#n2724'>2724</a> <a id='n2725' href='#n2725'>2725</a> <a id='n2726' href='#n2726'>2726</a> <a id='n2727' href='#n2727'>2727</a> <a id='n2728' href='#n2728'>2728</a> <a id='n2729' href='#n2729'>2729</a> <a id='n2730' href='#n2730'>2730</a> <a id='n2731' href='#n2731'>2731</a> <a id='n2732' href='#n2732'>2732</a> <a id='n2733' href='#n2733'>2733</a> <a id='n2734' href='#n2734'>2734</a> <a id='n2735' href='#n2735'>2735</a> <a id='n2736' href='#n2736'>2736</a> <a id='n2737' href='#n2737'>2737</a> <a id='n2738' href='#n2738'>2738</a> <a id='n2739' href='#n2739'>2739</a> <a id='n2740' href='#n2740'>2740</a> <a id='n2741' href='#n2741'>2741</a> <a id='n2742' href='#n2742'>2742</a> <a id='n2743' href='#n2743'>2743</a> <a id='n2744' href='#n2744'>2744</a> <a id='n2745' href='#n2745'>2745</a> <a id='n2746' href='#n2746'>2746</a> <a id='n2747' href='#n2747'>2747</a> <a id='n2748' href='#n2748'>2748</a> <a id='n2749' href='#n2749'>2749</a> <a id='n2750' href='#n2750'>2750</a> <a id='n2751' href='#n2751'>2751</a> <a id='n2752' href='#n2752'>2752</a> <a id='n2753' href='#n2753'>2753</a> <a id='n2754' href='#n2754'>2754</a> <a id='n2755' href='#n2755'>2755</a> <a id='n2756' href='#n2756'>2756</a> <a id='n2757' href='#n2757'>2757</a> <a id='n2758' href='#n2758'>2758</a> <a id='n2759' href='#n2759'>2759</a> <a id='n2760' href='#n2760'>2760</a> <a id='n2761' href='#n2761'>2761</a> <a id='n2762' href='#n2762'>2762</a> <a id='n2763' href='#n2763'>2763</a> <a id='n2764' href='#n2764'>2764</a> <a id='n2765' href='#n2765'>2765</a> <a id='n2766' href='#n2766'>2766</a> <a id='n2767' href='#n2767'>2767</a> <a id='n2768' href='#n2768'>2768</a> <a id='n2769' href='#n2769'>2769</a> <a id='n2770' href='#n2770'>2770</a> <a id='n2771' href='#n2771'>2771</a> <a id='n2772' href='#n2772'>2772</a> <a id='n2773' href='#n2773'>2773</a> <a id='n2774' href='#n2774'>2774</a> <a id='n2775' href='#n2775'>2775</a> <a id='n2776' href='#n2776'>2776</a> <a id='n2777' href='#n2777'>2777</a> <a id='n2778' href='#n2778'>2778</a> <a id='n2779' href='#n2779'>2779</a> <a id='n2780' href='#n2780'>2780</a> <a id='n2781' href='#n2781'>2781</a> <a id='n2782' href='#n2782'>2782</a> <a id='n2783' href='#n2783'>2783</a> <a id='n2784' href='#n2784'>2784</a> <a id='n2785' href='#n2785'>2785</a> <a id='n2786' href='#n2786'>2786</a> <a id='n2787' href='#n2787'>2787</a> <a id='n2788' href='#n2788'>2788</a> <a id='n2789' href='#n2789'>2789</a> <a id='n2790' href='#n2790'>2790</a> <a id='n2791' href='#n2791'>2791</a> <a id='n2792' href='#n2792'>2792</a> <a id='n2793' href='#n2793'>2793</a> <a id='n2794' href='#n2794'>2794</a> <a id='n2795' href='#n2795'>2795</a> <a id='n2796' href='#n2796'>2796</a> <a id='n2797' href='#n2797'>2797</a> <a id='n2798' href='#n2798'>2798</a> <a id='n2799' href='#n2799'>2799</a> <a id='n2800' href='#n2800'>2800</a> <a id='n2801' href='#n2801'>2801</a> <a id='n2802' href='#n2802'>2802</a> <a id='n2803' href='#n2803'>2803</a> <a id='n2804' href='#n2804'>2804</a> <a id='n2805' href='#n2805'>2805</a> <a id='n2806' href='#n2806'>2806</a> <a id='n2807' href='#n2807'>2807</a> <a id='n2808' href='#n2808'>2808</a> <a id='n2809' href='#n2809'>2809</a> <a id='n2810' href='#n2810'>2810</a> <a id='n2811' href='#n2811'>2811</a> <a id='n2812' href='#n2812'>2812</a> <a id='n2813' href='#n2813'>2813</a> <a id='n2814' href='#n2814'>2814</a> <a id='n2815' href='#n2815'>2815</a> <a id='n2816' href='#n2816'>2816</a> <a id='n2817' href='#n2817'>2817</a> <a id='n2818' href='#n2818'>2818</a> <a id='n2819' href='#n2819'>2819</a> <a id='n2820' href='#n2820'>2820</a> <a id='n2821' href='#n2821'>2821</a> <a id='n2822' href='#n2822'>2822</a> <a id='n2823' href='#n2823'>2823</a> <a id='n2824' href='#n2824'>2824</a> <a id='n2825' href='#n2825'>2825</a> <a id='n2826' href='#n2826'>2826</a> <a id='n2827' href='#n2827'>2827</a> <a id='n2828' href='#n2828'>2828</a> <a id='n2829' href='#n2829'>2829</a> <a id='n2830' href='#n2830'>2830</a> <a id='n2831' href='#n2831'>2831</a> <a id='n2832' href='#n2832'>2832</a> <a id='n2833' href='#n2833'>2833</a> <a id='n2834' href='#n2834'>2834</a> <a id='n2835' href='#n2835'>2835</a> <a id='n2836' href='#n2836'>2836</a> <a id='n2837' href='#n2837'>2837</a> <a id='n2838' href='#n2838'>2838</a> <a id='n2839' href='#n2839'>2839</a> <a id='n2840' href='#n2840'>2840</a> <a id='n2841' href='#n2841'>2841</a> <a id='n2842' href='#n2842'>2842</a> <a id='n2843' href='#n2843'>2843</a> <a id='n2844' href='#n2844'>2844</a> <a id='n2845' href='#n2845'>2845</a> <a id='n2846' href='#n2846'>2846</a> <a id='n2847' href='#n2847'>2847</a> <a id='n2848' href='#n2848'>2848</a> <a id='n2849' href='#n2849'>2849</a> <a id='n2850' href='#n2850'>2850</a> <a id='n2851' href='#n2851'>2851</a> <a id='n2852' href='#n2852'>2852</a> <a id='n2853' href='#n2853'>2853</a> <a id='n2854' href='#n2854'>2854</a> <a id='n2855' href='#n2855'>2855</a> <a id='n2856' href='#n2856'>2856</a> <a id='n2857' href='#n2857'>2857</a> <a id='n2858' href='#n2858'>2858</a> <a id='n2859' href='#n2859'>2859</a> <a id='n2860' href='#n2860'>2860</a> <a id='n2861' href='#n2861'>2861</a> <a id='n2862' href='#n2862'>2862</a> <a id='n2863' href='#n2863'>2863</a> <a id='n2864' href='#n2864'>2864</a> <a id='n2865' href='#n2865'>2865</a> <a id='n2866' href='#n2866'>2866</a> <a id='n2867' href='#n2867'>2867</a> <a id='n2868' href='#n2868'>2868</a> <a id='n2869' href='#n2869'>2869</a> <a id='n2870' href='#n2870'>2870</a> <a id='n2871' href='#n2871'>2871</a> <a id='n2872' href='#n2872'>2872</a> <a id='n2873' href='#n2873'>2873</a> <a id='n2874' href='#n2874'>2874</a> <a id='n2875' href='#n2875'>2875</a> <a id='n2876' href='#n2876'>2876</a> <a id='n2877' href='#n2877'>2877</a> <a id='n2878' href='#n2878'>2878</a> <a id='n2879' href='#n2879'>2879</a> <a id='n2880' href='#n2880'>2880</a> <a id='n2881' href='#n2881'>2881</a> <a id='n2882' href='#n2882'>2882</a> <a id='n2883' href='#n2883'>2883</a> <a id='n2884' href='#n2884'>2884</a> <a id='n2885' href='#n2885'>2885</a> <a id='n2886' href='#n2886'>2886</a> <a id='n2887' href='#n2887'>2887</a> <a id='n2888' href='#n2888'>2888</a> <a id='n2889' href='#n2889'>2889</a> <a id='n2890' href='#n2890'>2890</a> <a id='n2891' href='#n2891'>2891</a> <a id='n2892' href='#n2892'>2892</a> <a id='n2893' href='#n2893'>2893</a> <a id='n2894' href='#n2894'>2894</a> <a id='n2895' href='#n2895'>2895</a> <a id='n2896' href='#n2896'>2896</a> <a id='n2897' href='#n2897'>2897</a> <a id='n2898' href='#n2898'>2898</a> <a id='n2899' href='#n2899'>2899</a> <a id='n2900' href='#n2900'>2900</a> <a id='n2901' href='#n2901'>2901</a> <a id='n2902' href='#n2902'>2902</a> <a id='n2903' href='#n2903'>2903</a> <a id='n2904' href='#n2904'>2904</a> <a id='n2905' href='#n2905'>2905</a> <a id='n2906' href='#n2906'>2906</a> <a id='n2907' href='#n2907'>2907</a> <a id='n2908' href='#n2908'>2908</a> <a id='n2909' href='#n2909'>2909</a> <a id='n2910' href='#n2910'>2910</a> <a id='n2911' href='#n2911'>2911</a> <a id='n2912' href='#n2912'>2912</a> <a id='n2913' href='#n2913'>2913</a> <a id='n2914' href='#n2914'>2914</a> <a id='n2915' href='#n2915'>2915</a> <a id='n2916' href='#n2916'>2916</a> <a id='n2917' href='#n2917'>2917</a> <a id='n2918' href='#n2918'>2918</a> </pre></td> <td class='lines'><pre><code><span class="hl com">/****************************************************************</span> <span class="hl com"> *</span> <span class="hl com"> * The author of this software is David M. Gay.</span> <span class="hl com"> *</span> <span class="hl com"> * Copyright (c) 1991, 2000, 2001 by Lucent Technologies.</span> <span class="hl com"> *</span> <span class="hl com"> * Permission to use, copy, modify, and distribute this software for any</span> <span class="hl com"> * purpose without fee is hereby granted, provided that this entire notice</span> <span class="hl com"> * is included in all copies of any software which is or includes a copy</span> <span class="hl com"> * or modification of this software and in all copies of the supporting</span> <span class="hl com"> * documentation for such software.</span> <span class="hl com"> *</span> <span class="hl com"> * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED</span> <span class="hl com"> * WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY</span> <span class="hl com"> * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY</span> <span class="hl com"> * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.</span> <span class="hl com"> *</span> <span class="hl com"> ***************************************************************/</span> <span class="hl com">/****************************************************************</span> <span class="hl com"> * This is dtoa.c by David M. Gay, downloaded from</span> <span class="hl com"> * http://www.netlib.org/fp/dtoa.c on April 15, 2009 and modified for</span> <span class="hl com"> * inclusion into the Python core by Mark E. T. Dickinson and Eric V. Smith.</span> <span class="hl com"> *</span> <span class="hl com"> * Please remember to check http://www.netlib.org/fp regularly (and especially</span> <span class="hl com"> * before any Python release) for bugfixes and updates.</span> <span class="hl com"> *</span> <span class="hl com"> * The major modifications from Gay's original code are as follows:</span> <span class="hl com"> *</span> <span class="hl com"> * 0. The original code has been specialized to Python's needs by removing</span> <span class="hl com"> * many of the #ifdef'd sections. In particular, code to support VAX and</span> <span class="hl com"> * IBM floating-point formats, hex NaNs, hex floats, locale-aware</span> <span class="hl com"> * treatment of the decimal point, and setting of the inexact flag have</span> <span class="hl com"> * been removed.</span> <span class="hl com"> *</span> <span class="hl com"> * 1. We use PyMem_Malloc and PyMem_Free in place of malloc and free.</span> <span class="hl com"> *</span> <span class="hl com"> * 2. The public functions strtod, dtoa and freedtoa all now have</span> <span class="hl com"> * a _Py_dg_ prefix.</span> <span class="hl com"> *</span> <span class="hl com"> * 3. Instead of assuming that PyMem_Malloc always succeeds, we thread</span> <span class="hl com"> * PyMem_Malloc failures through the code. The functions</span> <span class="hl com"> *</span> <span class="hl com"> * Balloc, multadd, s2b, i2b, mult, pow5mult, lshift, diff, d2b</span> <span class="hl com"> *</span> <span class="hl com"> * of return type *Bigint all return NULL to indicate a malloc failure.</span> <span class="hl com"> * Similarly, rv_alloc and nrv_alloc (return type char *) return NULL on</span> <span class="hl com"> * failure. bigcomp now has return type int (it used to be void) and</span> <span class="hl com"> * returns -1 on failure and 0 otherwise. _Py_dg_dtoa returns NULL</span> <span class="hl com"> * on failure. _Py_dg_strtod indicates failure due to malloc failure</span> <span class="hl com"> * by returning -1.0, setting errno=ENOMEM and *se to s00.</span> <span class="hl com"> *</span> <span class="hl com"> * 4. The static variable dtoa_result has been removed. Callers of</span> <span class="hl com"> * _Py_dg_dtoa are expected to call _Py_dg_freedtoa to free</span> <span class="hl com"> * the memory allocated by _Py_dg_dtoa.</span> <span class="hl com"> *</span> <span class="hl com"> * 5. The code has been reformatted to better fit with Python's</span> <span class="hl com"> * C style guide (PEP 7).</span> <span class="hl com"> *</span> <span class="hl com"> * 6. A bug in the memory allocation has been fixed: to avoid FREEing memory</span> <span class="hl com"> * that hasn't been MALLOC'ed, private_mem should only be used when k <=</span> <span class="hl com"> * Kmax.</span> <span class="hl com"> *</span> <span class="hl com"> * 7. _Py_dg_strtod has been modified so that it doesn't accept strings with</span> <span class="hl com"> * leading whitespace.</span> <span class="hl com"> *</span> <span class="hl com"> ***************************************************************/</span> <span class="hl com">/* Please send bug reports for the original dtoa.c code to David M. Gay (dmg</span> <span class="hl com"> * at acm dot org, with " at " changed at "@" and " dot " changed to ".").</span> <span class="hl com"> * Please report bugs for this modified version using the Python issue tracker</span> <span class="hl com"> * (http://bugs.python.org). */</span> <span class="hl com">/* On a machine with IEEE extended-precision registers, it is</span> <span class="hl com"> * necessary to specify double-precision (53-bit) rounding precision</span> <span class="hl com"> * before invoking strtod or dtoa. If the machine uses (the equivalent</span> <span class="hl com"> * of) Intel 80x87 arithmetic, the call</span> <span class="hl com"> * _control87(PC_53, MCW_PC);</span> <span class="hl com"> * does this with many compilers. Whether this or another call is</span> <span class="hl com"> * appropriate depends on the compiler; for this to work, it may be</span> <span class="hl com"> * necessary to #include "float.h" or another system-dependent header</span> <span class="hl com"> * file.</span> <span class="hl com"> */</span> <span class="hl com">/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.</span> <span class="hl com"> *</span> <span class="hl com"> * This strtod returns a nearest machine number to the input decimal</span> <span class="hl com"> * string (or sets errno to ERANGE). With IEEE arithmetic, ties are</span> <span class="hl com"> * broken by the IEEE round-even rule. Otherwise ties are broken by</span> <span class="hl com"> * biased rounding (add half and chop).</span> <span class="hl com"> *</span> <span class="hl com"> * Inspired loosely by William D. Clinger's paper "How to Read Floating</span> <span class="hl com"> * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].</span> <span class="hl com"> *</span> <span class="hl com"> * Modifications:</span> <span class="hl com"> *</span> <span class="hl com"> * 1. We only require IEEE, IBM, or VAX double-precision</span> <span class="hl com"> * arithmetic (not IEEE double-extended).</span> <span class="hl com"> * 2. We get by with floating-point arithmetic in a case that</span> <span class="hl com"> * Clinger missed -- when we're computing d * 10^n</span> <span class="hl com"> * for a small integer d and the integer n is not too</span> <span class="hl com"> * much larger than 22 (the maximum integer k for which</span> <span class="hl com"> * we can represent 10^k exactly), we may be able to</span> <span class="hl com"> * compute (d*10^k) * 10^(e-k) with just one roundoff.</span> <span class="hl com"> * 3. Rather than a bit-at-a-time adjustment of the binary</span> <span class="hl com"> * result in the hard case, we use floating-point</span> <span class="hl com"> * arithmetic to determine the adjustment to within</span> <span class="hl com"> * one bit; only in really hard cases do we need to</span> <span class="hl com"> * compute a second residual.</span> <span class="hl com"> * 4. Because of 3., we don't need a large table of powers of 10</span> <span class="hl com"> * for ten-to-e (just some small tables, e.g. of 10^k</span> <span class="hl com"> * for 0 <= k <= 22).</span> <span class="hl com"> */</span> <span class="hl com">/* Linking of Python's #defines to Gay's #defines starts here. */</span> <span class="hl ppc">#include</span> <span class="hl pps">"Python.h"</span><span class="hl ppc"></span> <span class="hl com">/* if PY_NO_SHORT_FLOAT_REPR is defined, then don't even try to compile</span> <span class="hl com"> the following code */</span> <span class="hl ppc">#ifndef PY_NO_SHORT_FLOAT_REPR</span> <span class="hl ppc">#include</span> <span class="hl pps">"float.h"</span><span class="hl ppc"></span> <span class="hl ppc">#define MALLOC PyMem_Malloc</span> <span class="hl ppc">#define FREE PyMem_Free</span> <span class="hl com">/* This code should also work for ARM mixed-endian format on little-endian</span> <span class="hl com"> machines, where doubles have byte order 45670123 (in increasing address</span> <span class="hl com"> order, 0 being the least significant byte). */</span> <span class="hl ppc">#ifdef DOUBLE_IS_LITTLE_ENDIAN_IEEE754</span> <span class="hl ppc"># define IEEE_8087</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#if defined(DOUBLE_IS_BIG_ENDIAN_IEEE754) || \</span> <span class="hl ppc"> defined(DOUBLE_IS_ARM_MIXED_ENDIAN_IEEE754)</span> <span class="hl ppc"># define IEEE_MC68k</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#if defined(IEEE_8087) + defined(IEEE_MC68k) != 1</span> <span class="hl ppc">#error</span> <span class="hl pps">"Exactly one of IEEE_8087 or IEEE_MC68k should be defined."</span><span class="hl ppc"></span> <span class="hl ppc">#endif</span> <span class="hl com">/* The code below assumes that the endianness of integers matches the</span> <span class="hl com"> endianness of the two 32-bit words of a double. Check this. */</span> <span class="hl ppc">#if defined(WORDS_BIGENDIAN) && (defined(DOUBLE_IS_LITTLE_ENDIAN_IEEE754) || \</span> <span class="hl ppc"> defined(DOUBLE_IS_ARM_MIXED_ENDIAN_IEEE754))</span> <span class="hl ppc">#error</span> <span class="hl pps">"doubles and ints have incompatible endianness"</span><span class="hl ppc"></span> <span class="hl ppc">#endif</span> <span class="hl ppc">#if !defined(WORDS_BIGENDIAN) && defined(DOUBLE_IS_BIG_ENDIAN_IEEE754)</span> <span class="hl ppc">#error</span> <span class="hl pps">"doubles and ints have incompatible endianness"</span><span class="hl ppc"></span> <span class="hl ppc">#endif</span> <span class="hl ppc">#if defined(HAVE_UINT32_T) && defined(HAVE_INT32_T)</span> <span class="hl kwc">typedef</span> PY_UINT32_T ULong<span class="hl opt">;</span> <span class="hl kwc">typedef</span> PY_INT32_T Long<span class="hl opt">;</span> <span class="hl ppc">#else</span> <span class="hl ppc">#error</span> <span class="hl pps">"Failed to find an exact-width 32-bit integer type"</span><span class="hl ppc"></span> <span class="hl ppc">#endif</span> <span class="hl ppc">#if defined(HAVE_UINT64_T)</span> <span class="hl ppc">#define ULLong PY_UINT64_T</span> <span class="hl ppc">#else</span> <span class="hl ppc">#undef ULLong</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#undef DEBUG</span> <span class="hl ppc">#ifdef Py_DEBUG</span> <span class="hl ppc">#define DEBUG</span> <span class="hl ppc">#endif</span> <span class="hl com">/* End Python #define linking */</span> <span class="hl ppc">#ifdef DEBUG</span> <span class="hl ppc">#define Bug(x) {fprintf(stderr,</span> <span class="hl pps">"%s</span><span class="hl esc">\n</span><span class="hl pps">"</span><span class="hl ppc">, x); exit(1);}</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#ifndef PRIVATE_MEM</span> <span class="hl ppc">#define PRIVATE_MEM 2304</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))</span> <span class="hl kwb">static double</span> private_mem<span class="hl opt">[</span>PRIVATE_mem<span class="hl opt">], *</span>pmem_next <span class="hl opt">=</span> private_mem<span class="hl opt">;</span> <span class="hl ppc">#ifdef __cplusplus</span> <span class="hl kwc">extern</span> <span class="hl str">"C"</span> <span class="hl opt">{</span> <span class="hl ppc">#endif</span> <span class="hl kwc">typedef</span> <span class="hl kwb">union</span> <span class="hl opt">{</span> <span class="hl kwb">double</span> d<span class="hl opt">;</span> ULong L<span class="hl opt">[</span><span class="hl num">2</span><span class="hl opt">]; }</span> U<span class="hl opt">;</span> <span class="hl ppc">#ifdef IEEE_8087</span> <span class="hl ppc">#define word0(x) (x)->L[1]</span> <span class="hl ppc">#define word1(x) (x)->L[0]</span> <span class="hl ppc">#else</span> <span class="hl ppc">#define word0(x) (x)->L[0]</span> <span class="hl ppc">#define word1(x) (x)->L[1]</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#define dval(x) (x)->d</span> <span class="hl ppc">#ifndef STRTOD_DIGLIM</span> <span class="hl ppc">#define STRTOD_DIGLIM 40</span> <span class="hl ppc">#endif</span> <span class="hl com">/* maximum permitted exponent value for strtod; exponents larger than</span> <span class="hl com"> MAX_ABS_EXP in absolute value get truncated to +-MAX_ABS_EXP. MAX_ABS_EXP</span> <span class="hl com"> should fit into an int. */</span> <span class="hl ppc">#ifndef MAX_ABS_EXP</span> <span class="hl ppc">#define MAX_ABS_EXP 19999U</span> <span class="hl ppc">#endif</span> <span class="hl com">/* The following definition of Storeinc is appropriate for MIPS processors.</span> <span class="hl com"> * An alternative that might be better on some machines is</span> <span class="hl com"> * #define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)</span> <span class="hl com"> */</span> <span class="hl ppc">#if defined(IEEE_8087)</span> <span class="hl ppc">#define Storeinc(a,b,c) (((unsigned short *)a)[1] = (unsigned short)b, \</span> <span class="hl ppc"> ((unsigned short *)a)[0] = (unsigned short)c, a++)</span> <span class="hl ppc">#else</span> <span class="hl ppc">#define Storeinc(a,b,c) (((unsigned short *)a)[0] = (unsigned short)b, \</span> <span class="hl ppc"> ((unsigned short *)a)[1] = (unsigned short)c, a++)</span> <span class="hl ppc">#endif</span> <span class="hl com">/* #define P DBL_MANT_DIG */</span> <span class="hl com">/* Ten_pmax = floor(P*log(2)/log(5)) */</span> <span class="hl com">/* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */</span> <span class="hl com">/* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */</span> <span class="hl com">/* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */</span> <span class="hl ppc">#define Exp_shift 20</span> <span class="hl ppc">#define Exp_shift1 20</span> <span class="hl ppc">#define Exp_msk1 0x100000</span> <span class="hl ppc">#define Exp_msk11 0x100000</span> <span class="hl ppc">#define Exp_mask 0x7ff00000</span> <span class="hl ppc">#define P 53</span> <span class="hl ppc">#define Nbits 53</span> <span class="hl ppc">#define Bias 1023</span> <span class="hl ppc">#define Emax 1023</span> <span class="hl ppc">#define Emin (-1022)</span> <span class="hl ppc">#define Etiny (-1074)</span> <span class="hl com">/* smallest denormal is 2**Etiny */</span><span class="hl ppc"></span> <span class="hl ppc">#define Exp_1 0x3ff00000</span> <span class="hl ppc">#define Exp_11 0x3ff00000</span> <span class="hl ppc">#define Ebits 11</span> <span class="hl ppc">#define Frac_mask 0xfffff</span> <span class="hl ppc">#define Frac_mask1 0xfffff</span> <span class="hl ppc">#define Ten_pmax 22</span> <span class="hl ppc">#define Bletch 0x10</span> <span class="hl ppc">#define Bndry_mask 0xfffff</span> <span class="hl ppc">#define Bndry_mask1 0xfffff</span> <span class="hl ppc">#define Sign_bit 0x80000000</span> <span class="hl ppc">#define Log2P 1</span> <span class="hl ppc">#define Tiny0 0</span> <span class="hl ppc">#define Tiny1 1</span> <span class="hl ppc">#define Quick_max 14</span> <span class="hl ppc">#define Int_max 14</span> <span class="hl ppc">#ifndef Flt_Rounds</span> <span class="hl ppc">#ifdef FLT_ROUNDS</span> <span class="hl ppc">#define Flt_Rounds FLT_ROUNDS</span> <span class="hl ppc">#else</span> <span class="hl ppc">#define Flt_Rounds 1</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#endif</span> <span class="hl com">/*Flt_Rounds*/</span><span class="hl ppc"></span> <span class="hl ppc">#define Rounding Flt_Rounds</span> <span class="hl ppc">#define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))</span> <span class="hl ppc">#define Big1 0xffffffff</span> <span class="hl com">/* struct BCinfo is used to pass information from _Py_dg_strtod to bigcomp */</span> <span class="hl kwc">typedef</span> <span class="hl kwb">struct</span> BCinfo BCinfo<span class="hl opt">;</span> <span class="hl kwb">struct</span> BCinfo <span class="hl opt">{</span> <span class="hl kwb">int</span> e0<span class="hl opt">,</span> nd<span class="hl opt">,</span> nd0<span class="hl opt">,</span> scale<span class="hl opt">;</span> <span class="hl opt">};</span> <span class="hl ppc">#define FFFFFFFF 0xffffffffUL</span> <span class="hl ppc">#define Kmax 7</span> <span class="hl com">/* struct Bigint is used to represent arbitrary-precision integers. These</span> <span class="hl com"> integers are stored in sign-magnitude format, with the magnitude stored as</span> <span class="hl com"> an array of base 2**32 digits. Bigints are always normalized: if x is a</span> <span class="hl com"> Bigint then x->wds >= 1, and either x->wds == 1 or x[wds-1] is nonzero.</span> <span class="hl com"></span> <span class="hl com"> The Bigint fields are as follows:</span> <span class="hl com"></span> <span class="hl com"> - next is a header used by Balloc and Bfree to keep track of lists</span> <span class="hl com"> of freed Bigints; it's also used for the linked list of</span> <span class="hl com"> powers of 5 of the form 5**2**i used by pow5mult.</span> <span class="hl com"> - k indicates which pool this Bigint was allocated from</span> <span class="hl com"> - maxwds is the maximum number of words space was allocated for</span> <span class="hl com"> (usually maxwds == 2**k)</span> <span class="hl com"> - sign is 1 for negative Bigints, 0 for positive. The sign is unused</span> <span class="hl com"> (ignored on inputs, set to 0 on outputs) in almost all operations</span> <span class="hl com"> involving Bigints: a notable exception is the diff function, which</span> <span class="hl com"> ignores signs on inputs but sets the sign of the output correctly.</span> <span class="hl com"> - wds is the actual number of significant words</span> <span class="hl com"> - x contains the vector of words (digits) for this Bigint, from least</span> <span class="hl com"> significant (x[0]) to most significant (x[wds-1]).</span> <span class="hl com">*/</span> <span class="hl kwb">struct</span> Bigint <span class="hl opt">{</span> <span class="hl kwb">struct</span> Bigint <span class="hl opt">*</span>next<span class="hl opt">;</span> <span class="hl kwb">int</span> k<span class="hl opt">,</span> maxwds<span class="hl opt">,</span> sign<span class="hl opt">,</span> wds<span class="hl opt">;</span> ULong x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">];</span> <span class="hl opt">};</span> <span class="hl kwc">typedef</span> <span class="hl kwb">struct</span> Bigint Bigint<span class="hl opt">;</span> <span class="hl ppc">#ifndef Py_USING_MEMORY_DEBUGGER</span> <span class="hl com">/* Memory management: memory is allocated from, and returned to, Kmax+1 pools</span> <span class="hl com"> of memory, where pool k (0 <= k <= Kmax) is for Bigints b with b->maxwds ==</span> <span class="hl com"> 1 << k. These pools are maintained as linked lists, with freelist[k]</span> <span class="hl com"> pointing to the head of the list for pool k.</span> <span class="hl com"></span> <span class="hl com"> On allocation, if there's no free slot in the appropriate pool, MALLOC is</span> <span class="hl com"> called to get more memory. This memory is not returned to the system until</span> <span class="hl com"> Python quits. There's also a private memory pool that's allocated from</span> <span class="hl com"> in preference to using MALLOC.</span> <span class="hl com"></span> <span class="hl com"> For Bigints with more than (1 << Kmax) digits (which implies at least 1233</span> <span class="hl com"> decimal digits), memory is directly allocated using MALLOC, and freed using</span> <span class="hl com"> FREE.</span> <span class="hl com"></span> <span class="hl com"> XXX: it would be easy to bypass this memory-management system and</span> <span class="hl com"> translate each call to Balloc into a call to PyMem_Malloc, and each</span> <span class="hl com"> Bfree to PyMem_Free. Investigate whether this has any significant</span> <span class="hl com"> performance on impact. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span>freelist<span class="hl opt">[</span>Kmax<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">];</span> <span class="hl com">/* Allocate space for a Bigint with up to 1<<k digits */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl kwb">int</span> k<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> x<span class="hl opt">;</span> Bigint <span class="hl opt">*</span>rv<span class="hl opt">;</span> <span class="hl kwb">unsigned int</span> len<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt"><=</span> Kmax <span class="hl opt">&& (</span>rv <span class="hl opt">=</span> freelist<span class="hl opt">[</span>k<span class="hl opt">]))</span> freelist<span class="hl opt">[</span>k<span class="hl opt">] =</span> rv<span class="hl opt">-></span>next<span class="hl opt">;</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> x <span class="hl opt">=</span> <span class="hl num">1</span> <span class="hl opt"><<</span> k<span class="hl opt">;</span> len <span class="hl opt">= (</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span>Bigint<span class="hl opt">) + (</span>x<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)*</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span>ULong<span class="hl opt">) +</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl opt">/</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt"><=</span> Kmax <span class="hl opt">&&</span> pmem_next <span class="hl opt">-</span> private_mem <span class="hl opt">+</span> len <span class="hl opt"><=</span> PRIVATE_mem<span class="hl opt">) {</span> rv <span class="hl opt">= (</span>Bigint<span class="hl opt">*)</span>pmem_next<span class="hl opt">;</span> pmem_next <span class="hl opt">+=</span> len<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> rv <span class="hl opt">= (</span>Bigint<span class="hl opt">*)</span><span class="hl kwd">MALLOC</span><span class="hl opt">(</span>len<span class="hl opt">*</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">));</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>rv <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> rv<span class="hl opt">-></span>k <span class="hl opt">=</span> k<span class="hl opt">;</span> rv<span class="hl opt">-></span>maxwds <span class="hl opt">=</span> x<span class="hl opt">;</span> <span class="hl opt">}</span> rv<span class="hl opt">-></span>sign <span class="hl opt">=</span> rv<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> rv<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Free a Bigint allocated with Balloc */</span> <span class="hl kwb">static void</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>v<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>v<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>v<span class="hl opt">-></span>k <span class="hl opt">></span> Kmax<span class="hl opt">)</span> <span class="hl kwd">FREE</span><span class="hl opt">((</span><span class="hl kwb">void</span><span class="hl opt">*)</span>v<span class="hl opt">);</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> v<span class="hl opt">-></span>next <span class="hl opt">=</span> freelist<span class="hl opt">[</span>v<span class="hl opt">-></span>k<span class="hl opt">];</span> freelist<span class="hl opt">[</span>v<span class="hl opt">-></span>k<span class="hl opt">] =</span> v<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl ppc">#else</span> <span class="hl com">/* Alternative versions of Balloc and Bfree that use PyMem_Malloc and</span> <span class="hl com"> PyMem_Free directly in place of the custom memory allocation scheme above.</span> <span class="hl com"> These are provided for the benefit of memory debugging tools like</span> <span class="hl com"> Valgrind. */</span> <span class="hl com">/* Allocate space for a Bigint with up to 1<<k digits */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl kwb">int</span> k<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> x<span class="hl opt">;</span> Bigint <span class="hl opt">*</span>rv<span class="hl opt">;</span> <span class="hl kwb">unsigned int</span> len<span class="hl opt">;</span> x <span class="hl opt">=</span> <span class="hl num">1</span> <span class="hl opt"><<</span> k<span class="hl opt">;</span> len <span class="hl opt">= (</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span>Bigint<span class="hl opt">) + (</span>x<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)*</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span>ULong<span class="hl opt">) +</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl opt">/</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">);</span> rv <span class="hl opt">= (</span>Bigint<span class="hl opt">*)</span><span class="hl kwd">MALLOC</span><span class="hl opt">(</span>len<span class="hl opt">*</span><span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">double</span><span class="hl opt">));</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>rv <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> rv<span class="hl opt">-></span>k <span class="hl opt">=</span> k<span class="hl opt">;</span> rv<span class="hl opt">-></span>maxwds <span class="hl opt">=</span> x<span class="hl opt">;</span> rv<span class="hl opt">-></span>sign <span class="hl opt">=</span> rv<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> rv<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Free a Bigint allocated with Balloc */</span> <span class="hl kwb">static void</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>v<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>v<span class="hl opt">) {</span> <span class="hl kwd">FREE</span><span class="hl opt">((</span><span class="hl kwb">void</span><span class="hl opt">*)</span>v<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl ppc">#endif</span> <span class="hl com">/* Py_USING_MEMORY_DEBUGGER */</span><span class="hl ppc"></span> <span class="hl ppc">#define Bcopy(x,y) memcpy((char *)&x->sign, (char *)&y->sign, \</span> <span class="hl ppc"> y->wds*sizeof(Long) + 2*sizeof(int))</span> <span class="hl com">/* Multiply a Bigint b by m and add a. Either modifies b in place and returns</span> <span class="hl com"> a pointer to the modified b, or Bfrees b and returns a pointer to a copy.</span> <span class="hl com"> On failure, return NULL. In this case, b will have been already freed. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> <span class="hl kwb">int</span> m<span class="hl opt">,</span> <span class="hl kwb">int</span> a<span class="hl opt">)</span> <span class="hl com">/* multiply by m and add a */</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> i<span class="hl opt">,</span> wds<span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> ULong <span class="hl opt">*</span>x<span class="hl opt">;</span> ULLong carry<span class="hl opt">,</span> y<span class="hl opt">;</span> <span class="hl ppc">#else</span> ULong carry<span class="hl opt">, *</span>x<span class="hl opt">,</span> y<span class="hl opt">;</span> ULong xi<span class="hl opt">,</span> z<span class="hl opt">;</span> <span class="hl ppc">#endif</span> Bigint <span class="hl opt">*</span>b1<span class="hl opt">;</span> wds <span class="hl opt">=</span> b<span class="hl opt">-></span>wds<span class="hl opt">;</span> x <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> carry <span class="hl opt">=</span> a<span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> <span class="hl ppc">#ifdef ULLong</span> y <span class="hl opt">= *</span>x <span class="hl opt">* (</span>ULLong<span class="hl opt">)</span>m <span class="hl opt">+</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> y <span class="hl opt">>></span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">*</span>x<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>y <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl ppc">#else</span> xi <span class="hl opt">= *</span>x<span class="hl opt">;</span> y <span class="hl opt">= (</span>xi <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) *</span> m <span class="hl opt">+</span> carry<span class="hl opt">;</span> z <span class="hl opt">= (</span>xi <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) *</span> m <span class="hl opt">+ (</span>y <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">);</span> carry <span class="hl opt">=</span> z <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl opt">*</span>x<span class="hl opt">++ = (</span>z <span class="hl opt"><<</span> <span class="hl num">16</span><span class="hl opt">) + (</span>y <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(++</span>i <span class="hl opt"><</span> wds<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>carry<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>wds <span class="hl opt">>=</span> b<span class="hl opt">-></span>maxwds<span class="hl opt">) {</span> b1 <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>b<span class="hl opt">-></span>k<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b1 <span class="hl opt">==</span> NULL<span class="hl opt">){</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwd">Bcopy</span><span class="hl opt">(</span>b1<span class="hl opt">,</span> b<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> b <span class="hl opt">=</span> b1<span class="hl opt">;</span> <span class="hl opt">}</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span>wds<span class="hl opt">++] = (</span>ULong<span class="hl opt">)</span>carry<span class="hl opt">;</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> wds<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* convert a string s containing nd decimal digits (possibly containing a</span> <span class="hl com"> decimal separator at position nd0, which is ignored) to a Bigint. This</span> <span class="hl com"> function carries on where the parsing code in _Py_dg_strtod leaves off: on</span> <span class="hl com"> entry, y9 contains the result of converting the first 9 digits. Returns</span> <span class="hl com"> NULL on failure. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">s2b</span><span class="hl opt">(</span><span class="hl kwb">const char</span> <span class="hl opt">*</span>s<span class="hl opt">,</span> <span class="hl kwb">int</span> nd0<span class="hl opt">,</span> <span class="hl kwb">int</span> nd<span class="hl opt">,</span> ULong y9<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">,</span> k<span class="hl opt">;</span> Long x<span class="hl opt">,</span> y<span class="hl opt">;</span> x <span class="hl opt">= (</span>nd <span class="hl opt">+</span> <span class="hl num">8</span><span class="hl opt">) /</span> <span class="hl num">9</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>k <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">,</span> y <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> x <span class="hl opt">></span> y<span class="hl opt">;</span> y <span class="hl opt"><<=</span> <span class="hl num">1</span><span class="hl opt">,</span> k<span class="hl opt">++) ;</span> b <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> y9<span class="hl opt">;</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd <span class="hl opt"><=</span> <span class="hl num">9</span><span class="hl opt">)</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> s <span class="hl opt">+=</span> <span class="hl num">9</span><span class="hl opt">;</span> <span class="hl kwa">for</span> <span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">9</span><span class="hl opt">;</span> i <span class="hl opt"><</span> nd0<span class="hl opt">;</span> i<span class="hl opt">++) {</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">, *</span>s<span class="hl opt">++ -</span> <span class="hl str">'0'</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> s<span class="hl opt">++;</span> <span class="hl kwa">for</span><span class="hl opt">(;</span> i <span class="hl opt"><</span> nd<span class="hl opt">;</span> i<span class="hl opt">++) {</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">, *</span>s<span class="hl opt">++ -</span> <span class="hl str">'0'</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* count leading 0 bits in the 32-bit integer x. */</span> <span class="hl kwb">static int</span> <span class="hl kwd">hi0bits</span><span class="hl opt">(</span>ULong x<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> k <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xffff0000</span><span class="hl opt">)) {</span> k <span class="hl opt">=</span> <span class="hl num">16</span><span class="hl opt">;</span> x <span class="hl opt"><<=</span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xff000000</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">8</span><span class="hl opt">;</span> x <span class="hl opt"><<=</span> <span class="hl num">8</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xf0000000</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">4</span><span class="hl opt">;</span> x <span class="hl opt"><<=</span> <span class="hl num">4</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xc0000000</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">2</span><span class="hl opt">;</span> x <span class="hl opt"><<=</span> <span class="hl num">2</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0x80000000</span><span class="hl opt">)) {</span> k<span class="hl opt">++;</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0x40000000</span><span class="hl opt">))</span> <span class="hl kwa">return</span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> k<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* count trailing 0 bits in the 32-bit integer y, and shift y right by that</span> <span class="hl com"> number of bits. */</span> <span class="hl kwb">static int</span> <span class="hl kwd">lo0bits</span><span class="hl opt">(</span>ULong <span class="hl opt">*</span>y<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> k<span class="hl opt">;</span> ULong x <span class="hl opt">= *</span>y<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>x <span class="hl opt">&</span> <span class="hl num">7</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>x <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>x <span class="hl opt">&</span> <span class="hl num">2</span><span class="hl opt">) {</span> <span class="hl opt">*</span>y <span class="hl opt">=</span> x <span class="hl opt">>></span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">*</span>y <span class="hl opt">=</span> x <span class="hl opt">>></span> <span class="hl num">2</span><span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl num">2</span><span class="hl opt">;</span> <span class="hl opt">}</span> k <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">)) {</span> k <span class="hl opt">=</span> <span class="hl num">16</span><span class="hl opt">;</span> x <span class="hl opt">>>=</span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xff</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">8</span><span class="hl opt">;</span> x <span class="hl opt">>>=</span> <span class="hl num">8</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0xf</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">4</span><span class="hl opt">;</span> x <span class="hl opt">>>=</span> <span class="hl num">4</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">0x3</span><span class="hl opt">)) {</span> k <span class="hl opt">+=</span> <span class="hl num">2</span><span class="hl opt">;</span> x <span class="hl opt">>>=</span> <span class="hl num">2</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>x <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)) {</span> k<span class="hl opt">++;</span> x <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>x<span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">*</span>y <span class="hl opt">=</span> x<span class="hl opt">;</span> <span class="hl kwa">return</span> k<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* convert a small nonnegative integer to a Bigint */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl kwb">int</span> i<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> i<span class="hl opt">;</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* multiply two Bigints. Returns a new Bigint, or NULL on failure. Ignores</span> <span class="hl com"> the signs of a and b. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>a<span class="hl opt">,</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>c<span class="hl opt">;</span> <span class="hl kwb">int</span> k<span class="hl opt">,</span> wa<span class="hl opt">,</span> wb<span class="hl opt">,</span> wc<span class="hl opt">;</span> ULong <span class="hl opt">*</span>x<span class="hl opt">, *</span>xa<span class="hl opt">, *</span>xae<span class="hl opt">, *</span>xb<span class="hl opt">, *</span>xbe<span class="hl opt">, *</span>xc<span class="hl opt">, *</span>xc0<span class="hl opt">;</span> ULong y<span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> ULLong carry<span class="hl opt">,</span> z<span class="hl opt">;</span> <span class="hl ppc">#else</span> ULong carry<span class="hl opt">,</span> z<span class="hl opt">;</span> ULong z2<span class="hl opt">;</span> <span class="hl ppc">#endif</span> <span class="hl kwa">if</span> <span class="hl opt">((!</span>a<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> a<span class="hl opt">-></span>wds <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">) || (!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> b<span class="hl opt">-></span>wds <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">)) {</span> c <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> c<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> c<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> c<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>a<span class="hl opt">-></span>wds <span class="hl opt"><</span> b<span class="hl opt">-></span>wds<span class="hl opt">) {</span> c <span class="hl opt">=</span> a<span class="hl opt">;</span> a <span class="hl opt">=</span> b<span class="hl opt">;</span> b <span class="hl opt">=</span> c<span class="hl opt">;</span> <span class="hl opt">}</span> k <span class="hl opt">=</span> a<span class="hl opt">-></span>k<span class="hl opt">;</span> wa <span class="hl opt">=</span> a<span class="hl opt">-></span>wds<span class="hl opt">;</span> wb <span class="hl opt">=</span> b<span class="hl opt">-></span>wds<span class="hl opt">;</span> wc <span class="hl opt">=</span> wa <span class="hl opt">+</span> wb<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>wc <span class="hl opt">></span> a<span class="hl opt">-></span>maxwds<span class="hl opt">)</span> k<span class="hl opt">++;</span> c <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>x <span class="hl opt">=</span> c<span class="hl opt">-></span>x<span class="hl opt">,</span> xa <span class="hl opt">=</span> x <span class="hl opt">+</span> wc<span class="hl opt">;</span> x <span class="hl opt"><</span> xa<span class="hl opt">;</span> x<span class="hl opt">++)</span> <span class="hl opt">*</span>x <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> xa <span class="hl opt">=</span> a<span class="hl opt">-></span>x<span class="hl opt">;</span> xae <span class="hl opt">=</span> xa <span class="hl opt">+</span> wa<span class="hl opt">;</span> xb <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> xbe <span class="hl opt">=</span> xb <span class="hl opt">+</span> wb<span class="hl opt">;</span> xc0 <span class="hl opt">=</span> c<span class="hl opt">-></span>x<span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> <span class="hl kwa">for</span><span class="hl opt">(;</span> xb <span class="hl opt"><</span> xbe<span class="hl opt">;</span> xc0<span class="hl opt">++) {</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>y <span class="hl opt">= *</span>xb<span class="hl opt">++)) {</span> x <span class="hl opt">=</span> xa<span class="hl opt">;</span> xc <span class="hl opt">=</span> xc0<span class="hl opt">;</span> carry <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> z <span class="hl opt">= *</span>x<span class="hl opt">++ * (</span>ULLong<span class="hl opt">)</span>y <span class="hl opt">+ *</span>xc <span class="hl opt">+</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> z <span class="hl opt">>></span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">*</span>xc<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>z <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>x <span class="hl opt"><</span> xae<span class="hl opt">);</span> <span class="hl opt">*</span>xc <span class="hl opt">= (</span>ULong<span class="hl opt">)</span>carry<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl ppc">#else</span> <span class="hl kwa">for</span><span class="hl opt">(;</span> xb <span class="hl opt"><</span> xbe<span class="hl opt">;</span> xb<span class="hl opt">++,</span> xc0<span class="hl opt">++) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>y <span class="hl opt">= *</span>xb <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) {</span> x <span class="hl opt">=</span> xa<span class="hl opt">;</span> xc <span class="hl opt">=</span> xc0<span class="hl opt">;</span> carry <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> z <span class="hl opt">= (*</span>x <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) *</span> y <span class="hl opt">+ (*</span>xc <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) +</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> z <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> z2 <span class="hl opt">= (*</span>x<span class="hl opt">++ >></span> <span class="hl num">16</span><span class="hl opt">) *</span> y <span class="hl opt">+ (*</span>xc <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) +</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> z2 <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>xc<span class="hl opt">,</span> z2<span class="hl opt">,</span> z<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>x <span class="hl opt"><</span> xae<span class="hl opt">);</span> <span class="hl opt">*</span>xc <span class="hl opt">=</span> carry<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>y <span class="hl opt">= *</span>xb <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) {</span> x <span class="hl opt">=</span> xa<span class="hl opt">;</span> xc <span class="hl opt">=</span> xc0<span class="hl opt">;</span> carry <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> z2 <span class="hl opt">= *</span>xc<span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> z <span class="hl opt">= (*</span>x <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) *</span> y <span class="hl opt">+ (*</span>xc <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) +</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> z <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>xc<span class="hl opt">,</span> z<span class="hl opt">,</span> z2<span class="hl opt">);</span> z2 <span class="hl opt">= (*</span>x<span class="hl opt">++ >></span> <span class="hl num">16</span><span class="hl opt">) *</span> y <span class="hl opt">+ (*</span>xc <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) +</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> z2 <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>x <span class="hl opt"><</span> xae<span class="hl opt">);</span> <span class="hl opt">*</span>xc <span class="hl opt">=</span> z2<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl ppc">#endif</span> <span class="hl kwa">for</span><span class="hl opt">(</span>xc0 <span class="hl opt">=</span> c<span class="hl opt">-></span>x<span class="hl opt">,</span> xc <span class="hl opt">=</span> xc0 <span class="hl opt">+</span> wc<span class="hl opt">;</span> wc <span class="hl opt">></span> <span class="hl num">0</span> <span class="hl opt">&& !*--</span>xc<span class="hl opt">; --</span>wc<span class="hl opt">) ;</span> c<span class="hl opt">-></span>wds <span class="hl opt">=</span> wc<span class="hl opt">;</span> <span class="hl kwa">return</span> c<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl ppc">#ifndef Py_USING_MEMORY_DEBUGGER</span> <span class="hl com">/* p5s is a linked list of powers of 5 of the form 5**(2**i), i >= 2 */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span>p5s<span class="hl opt">;</span> <span class="hl com">/* multiply the Bigint b by 5**k. Returns a pointer to the result, or NULL on</span> <span class="hl com"> failure; if the returned pointer is distinct from b then the original</span> <span class="hl com"> Bigint b will have been Bfree'd. Ignores the sign of b. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> <span class="hl kwb">int</span> k<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b1<span class="hl opt">, *</span>p5<span class="hl opt">, *</span>p51<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">;</span> <span class="hl kwb">static int</span> p05<span class="hl opt">[</span><span class="hl num">3</span><span class="hl opt">] = {</span> <span class="hl num">5</span><span class="hl opt">,</span> <span class="hl num">25</span><span class="hl opt">,</span> <span class="hl num">125</span> <span class="hl opt">};</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>i <span class="hl opt">=</span> k <span class="hl opt">&</span> <span class="hl num">3</span><span class="hl opt">)) {</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> p05<span class="hl opt">[</span>i<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">],</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>k <span class="hl opt">>>=</span> <span class="hl num">2</span><span class="hl opt">))</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> p5 <span class="hl opt">=</span> p5s<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>p5<span class="hl opt">) {</span> <span class="hl com">/* first time */</span> p5 <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">625</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p5 <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> p5s <span class="hl opt">=</span> p5<span class="hl opt">;</span> p5<span class="hl opt">-></span>next <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">for</span><span class="hl opt">(;;) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">) {</span> b1 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>b<span class="hl opt">,</span> p5<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> b <span class="hl opt">=</span> b1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>k <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">))</span> <span class="hl kwa">break</span><span class="hl opt">;</span> p51 <span class="hl opt">=</span> p5<span class="hl opt">-></span>next<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>p51<span class="hl opt">) {</span> p51 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>p5<span class="hl opt">,</span>p5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p51 <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> p51<span class="hl opt">-></span>next <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> p5<span class="hl opt">-></span>next <span class="hl opt">=</span> p51<span class="hl opt">;</span> <span class="hl opt">}</span> p5 <span class="hl opt">=</span> p51<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl ppc">#else</span> <span class="hl com">/* Version of pow5mult that doesn't cache powers of 5. Provided for</span> <span class="hl com"> the benefit of memory debugging tools like Valgrind. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> <span class="hl kwb">int</span> k<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b1<span class="hl opt">, *</span>p5<span class="hl opt">, *</span>p51<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">;</span> <span class="hl kwb">static int</span> p05<span class="hl opt">[</span><span class="hl num">3</span><span class="hl opt">] = {</span> <span class="hl num">5</span><span class="hl opt">,</span> <span class="hl num">25</span><span class="hl opt">,</span> <span class="hl num">125</span> <span class="hl opt">};</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>i <span class="hl opt">=</span> k <span class="hl opt">&</span> <span class="hl num">3</span><span class="hl opt">)) {</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> p05<span class="hl opt">[</span>i<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">],</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>k <span class="hl opt">>>=</span> <span class="hl num">2</span><span class="hl opt">))</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> p5 <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">625</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p5 <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">for</span><span class="hl opt">(;;) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">) {</span> b1 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>b<span class="hl opt">,</span> p5<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> b <span class="hl opt">=</span> b1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>p5<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>k <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">))</span> <span class="hl kwa">break</span><span class="hl opt">;</span> p51 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>p5<span class="hl opt">,</span> p5<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>p5<span class="hl opt">);</span> p5 <span class="hl opt">=</span> p51<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p5 <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>p5<span class="hl opt">);</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl ppc">#endif</span> <span class="hl com">/* Py_USING_MEMORY_DEBUGGER */</span><span class="hl ppc"></span> <span class="hl com">/* shift a Bigint b left by k bits. Return a pointer to the shifted result,</span> <span class="hl com"> or NULL on failure. If the returned pointer is distinct from b then the</span> <span class="hl com"> original b will have been Bfree'd. Ignores the sign of b. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> <span class="hl kwb">int</span> k<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> i<span class="hl opt">,</span> k1<span class="hl opt">,</span> n<span class="hl opt">,</span> n1<span class="hl opt">;</span> Bigint <span class="hl opt">*</span>b1<span class="hl opt">;</span> ULong <span class="hl opt">*</span>x<span class="hl opt">, *</span>x1<span class="hl opt">, *</span>xe<span class="hl opt">,</span> z<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>k <span class="hl opt">|| (!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> b<span class="hl opt">-></span>wds <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">))</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> n <span class="hl opt">=</span> k <span class="hl opt">>></span> <span class="hl num">5</span><span class="hl opt">;</span> k1 <span class="hl opt">=</span> b<span class="hl opt">-></span>k<span class="hl opt">;</span> n1 <span class="hl opt">=</span> n <span class="hl opt">+</span> b<span class="hl opt">-></span>wds <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> b<span class="hl opt">-></span>maxwds<span class="hl opt">;</span> n1 <span class="hl opt">></span> i<span class="hl opt">;</span> i <span class="hl opt"><<=</span> <span class="hl num">1</span><span class="hl opt">)</span> k1<span class="hl opt">++;</span> b1 <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>k1<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b1 <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> x1 <span class="hl opt">=</span> b1<span class="hl opt">-></span>x<span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt"><</span> n<span class="hl opt">;</span> i<span class="hl opt">++)</span> <span class="hl opt">*</span>x1<span class="hl opt">++ =</span> <span class="hl num">0</span><span class="hl opt">;</span> x <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> xe <span class="hl opt">=</span> x <span class="hl opt">+</span> b<span class="hl opt">-></span>wds<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">&=</span> <span class="hl num">0x1f</span><span class="hl opt">) {</span> k1 <span class="hl opt">=</span> <span class="hl num">32</span> <span class="hl opt">-</span> k<span class="hl opt">;</span> z <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> <span class="hl opt">*</span>x1<span class="hl opt">++ = *</span>x <span class="hl opt"><<</span> k <span class="hl opt">|</span> z<span class="hl opt">;</span> z <span class="hl opt">= *</span>x<span class="hl opt">++ >></span> k1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>x <span class="hl opt"><</span> xe<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">((*</span>x1 <span class="hl opt">=</span> z<span class="hl opt">))</span> <span class="hl opt">++</span>n1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else do</span> <span class="hl opt">*</span>x1<span class="hl opt">++ = *</span>x<span class="hl opt">++;</span> <span class="hl kwa">while</span><span class="hl opt">(</span>x <span class="hl opt"><</span> xe<span class="hl opt">);</span> b1<span class="hl opt">-></span>wds <span class="hl opt">=</span> n1 <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> b1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Do a three-way compare of a and b, returning -1 if a < b, 0 if a == b and</span> <span class="hl com"> 1 if a > b. Ignores signs of a and b. */</span> <span class="hl kwb">static int</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>a<span class="hl opt">,</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">)</span> <span class="hl opt">{</span> ULong <span class="hl opt">*</span>xa<span class="hl opt">, *</span>xa0<span class="hl opt">, *</span>xb<span class="hl opt">, *</span>xb0<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">,</span> j<span class="hl opt">;</span> i <span class="hl opt">=</span> a<span class="hl opt">-></span>wds<span class="hl opt">;</span> j <span class="hl opt">=</span> b<span class="hl opt">-></span>wds<span class="hl opt">;</span> <span class="hl ppc">#ifdef DEBUG</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">></span> <span class="hl num">1</span> <span class="hl opt">&& !</span>a<span class="hl opt">-></span>x<span class="hl opt">[</span>i<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">])</span> <span class="hl kwd">Bug</span><span class="hl opt">(</span><span class="hl str">"cmp called with a->x[a->wds-1] == 0"</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">></span> <span class="hl num">1</span> <span class="hl opt">&& !</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span>j<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">])</span> <span class="hl kwd">Bug</span><span class="hl opt">(</span><span class="hl str">"cmp called with b->x[b->wds-1] == 0"</span><span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">-=</span> j<span class="hl opt">)</span> <span class="hl kwa">return</span> i<span class="hl opt">;</span> xa0 <span class="hl opt">=</span> a<span class="hl opt">-></span>x<span class="hl opt">;</span> xa <span class="hl opt">=</span> xa0 <span class="hl opt">+</span> j<span class="hl opt">;</span> xb0 <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> xb <span class="hl opt">=</span> xb0 <span class="hl opt">+</span> j<span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(;;) {</span> <span class="hl kwa">if</span> <span class="hl opt">(*--</span>xa <span class="hl opt">!= *--</span>xb<span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl opt">*</span>xa <span class="hl opt">< *</span>xb ? <span class="hl opt">-</span><span class="hl num">1</span> <span class="hl opt">:</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>xa <span class="hl opt"><=</span> xa0<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Take the difference of Bigints a and b, returning a new Bigint. Returns</span> <span class="hl com"> NULL on failure. The signs of a and b are ignored, but the sign of the</span> <span class="hl com"> result is set appropriately. */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">diff</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>a<span class="hl opt">,</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>c<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">,</span> wa<span class="hl opt">,</span> wb<span class="hl opt">;</span> ULong <span class="hl opt">*</span>xa<span class="hl opt">, *</span>xae<span class="hl opt">, *</span>xb<span class="hl opt">, *</span>xbe<span class="hl opt">, *</span>xc<span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> ULLong borrow<span class="hl opt">,</span> y<span class="hl opt">;</span> <span class="hl ppc">#else</span> ULong borrow<span class="hl opt">,</span> y<span class="hl opt">;</span> ULong z<span class="hl opt">;</span> <span class="hl ppc">#endif</span> i <span class="hl opt">=</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>a<span class="hl opt">,</span>b<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>i<span class="hl opt">) {</span> c <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> c<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> c<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> c<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">) {</span> c <span class="hl opt">=</span> a<span class="hl opt">;</span> a <span class="hl opt">=</span> b<span class="hl opt">;</span> b <span class="hl opt">=</span> c<span class="hl opt">;</span> i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> c <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>a<span class="hl opt">-></span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> c<span class="hl opt">-></span>sign <span class="hl opt">=</span> i<span class="hl opt">;</span> wa <span class="hl opt">=</span> a<span class="hl opt">-></span>wds<span class="hl opt">;</span> xa <span class="hl opt">=</span> a<span class="hl opt">-></span>x<span class="hl opt">;</span> xae <span class="hl opt">=</span> xa <span class="hl opt">+</span> wa<span class="hl opt">;</span> wb <span class="hl opt">=</span> b<span class="hl opt">-></span>wds<span class="hl opt">;</span> xb <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> xbe <span class="hl opt">=</span> xb <span class="hl opt">+</span> wb<span class="hl opt">;</span> xc <span class="hl opt">=</span> c<span class="hl opt">-></span>x<span class="hl opt">;</span> borrow <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> y <span class="hl opt">= (</span>ULLong<span class="hl opt">)*</span>xa<span class="hl opt">++ - *</span>xb<span class="hl opt">++ -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">=</span> y <span class="hl opt">>></span> <span class="hl num">32</span> <span class="hl opt">& (</span>ULong<span class="hl opt">)</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">*</span>xc<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>y <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>xb <span class="hl opt"><</span> xbe<span class="hl opt">);</span> <span class="hl kwa">while</span><span class="hl opt">(</span>xa <span class="hl opt"><</span> xae<span class="hl opt">) {</span> y <span class="hl opt">= *</span>xa<span class="hl opt">++ -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">=</span> y <span class="hl opt">>></span> <span class="hl num">32</span> <span class="hl opt">& (</span>ULong<span class="hl opt">)</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">*</span>xc<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>y <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl ppc">#else</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> y <span class="hl opt">= (*</span>xa <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) - (*</span>xb <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>y <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> z <span class="hl opt">= (*</span>xa<span class="hl opt">++ >></span> <span class="hl num">16</span><span class="hl opt">) - (*</span>xb<span class="hl opt">++ >></span> <span class="hl num">16</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>z <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>xc<span class="hl opt">,</span> z<span class="hl opt">,</span> y<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>xb <span class="hl opt"><</span> xbe<span class="hl opt">);</span> <span class="hl kwa">while</span><span class="hl opt">(</span>xa <span class="hl opt"><</span> xae<span class="hl opt">) {</span> y <span class="hl opt">= (*</span>xa <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>y <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> z <span class="hl opt">= (*</span>xa<span class="hl opt">++ >></span> <span class="hl num">16</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>z <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>xc<span class="hl opt">,</span> z<span class="hl opt">,</span> y<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl ppc">#endif</span> <span class="hl kwa">while</span><span class="hl opt">(!*--</span>xc<span class="hl opt">)</span> wa<span class="hl opt">--;</span> c<span class="hl opt">-></span>wds <span class="hl opt">=</span> wa<span class="hl opt">;</span> <span class="hl kwa">return</span> c<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Given a positive normal double x, return the difference between x and the</span> <span class="hl com"> next double up. Doesn't give correct results for subnormals. */</span> <span class="hl kwb">static double</span> <span class="hl kwd">ulp</span><span class="hl opt">(</span>U <span class="hl opt">*</span>x<span class="hl opt">)</span> <span class="hl opt">{</span> Long L<span class="hl opt">;</span> U u<span class="hl opt">;</span> L <span class="hl opt">= (</span><span class="hl kwd">word0</span><span class="hl opt">(</span>x<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) - (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) =</span> L<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl com">/* Convert a Bigint to a double plus an exponent */</span> <span class="hl kwb">static double</span> <span class="hl kwd">b2d</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>a<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>e<span class="hl opt">)</span> <span class="hl opt">{</span> ULong <span class="hl opt">*</span>xa<span class="hl opt">, *</span>xa0<span class="hl opt">,</span> w<span class="hl opt">,</span> y<span class="hl opt">,</span> z<span class="hl opt">;</span> <span class="hl kwb">int</span> k<span class="hl opt">;</span> U d<span class="hl opt">;</span> xa0 <span class="hl opt">=</span> a<span class="hl opt">-></span>x<span class="hl opt">;</span> xa <span class="hl opt">=</span> xa0 <span class="hl opt">+</span> a<span class="hl opt">-></span>wds<span class="hl opt">;</span> y <span class="hl opt">= *--</span>xa<span class="hl opt">;</span> <span class="hl ppc">#ifdef DEBUG</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>y<span class="hl opt">)</span> <span class="hl kwd">Bug</span><span class="hl opt">(</span><span class="hl str">"zero y in b2d"</span><span class="hl opt">);</span> <span class="hl ppc">#endif</span> k <span class="hl opt">=</span> <span class="hl kwd">hi0bits</span><span class="hl opt">(</span>y<span class="hl opt">);</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> <span class="hl num">32</span> <span class="hl opt">-</span> k<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt"><</span> Ebits<span class="hl opt">) {</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> Exp_1 <span class="hl opt">|</span> y <span class="hl opt">>> (</span>Ebits <span class="hl opt">-</span> k<span class="hl opt">);</span> w <span class="hl opt">=</span> xa <span class="hl opt">></span> xa0 ? <span class="hl opt">*--</span>xa <span class="hl opt">:</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> y <span class="hl opt"><< ((</span><span class="hl num">32</span><span class="hl opt">-</span>Ebits<span class="hl opt">) +</span> k<span class="hl opt">) |</span> w <span class="hl opt">>> (</span>Ebits <span class="hl opt">-</span> k<span class="hl opt">);</span> <span class="hl kwa">goto</span> ret_d<span class="hl opt">;</span> <span class="hl opt">}</span> z <span class="hl opt">=</span> xa <span class="hl opt">></span> xa0 ? <span class="hl opt">*--</span>xa <span class="hl opt">:</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">-=</span> Ebits<span class="hl opt">) {</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> Exp_1 <span class="hl opt">|</span> y <span class="hl opt"><<</span> k <span class="hl opt">|</span> z <span class="hl opt">>> (</span><span class="hl num">32</span> <span class="hl opt">-</span> k<span class="hl opt">);</span> y <span class="hl opt">=</span> xa <span class="hl opt">></span> xa0 ? <span class="hl opt">*--</span>xa <span class="hl opt">:</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> z <span class="hl opt"><<</span> k <span class="hl opt">|</span> y <span class="hl opt">>> (</span><span class="hl num">32</span> <span class="hl opt">-</span> k<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> Exp_1 <span class="hl opt">|</span> y<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>d<span class="hl opt">) =</span> z<span class="hl opt">;</span> <span class="hl opt">}</span> ret_d<span class="hl opt">:</span> <span class="hl kwa">return</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>d<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl com">/* Convert a scaled double to a Bigint plus an exponent. Similar to d2b,</span> <span class="hl com"> except that it accepts the scale parameter used in _Py_dg_strtod (which</span> <span class="hl com"> should be either 0 or 2*P), and the normalization for the return value is</span> <span class="hl com"> different (see below). On input, d should be finite and nonnegative, and d</span> <span class="hl com"> / 2**scale should be exactly representable as an IEEE 754 double.</span> <span class="hl com"></span> <span class="hl com"> Returns a Bigint b and an integer e such that</span> <span class="hl com"></span> <span class="hl com"> dval(d) / 2**scale = b * 2**e.</span> <span class="hl com"></span> <span class="hl com"> Unlike d2b, b is not necessarily odd: b and e are normalized so</span> <span class="hl com"> that either 2**(P-1) <= b < 2**P and e >= Etiny, or b < 2**P</span> <span class="hl com"> and e == Etiny. This applies equally to an input of 0.0: in that</span> <span class="hl com"> case the return values are b = 0 and e = Etiny.</span> <span class="hl com"></span> <span class="hl com"> The above normalization ensures that for all possible inputs d,</span> <span class="hl com"> 2**e gives ulp(d/2**scale).</span> <span class="hl com"></span> <span class="hl com"> Returns NULL on failure.</span> <span class="hl com">*/</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">sd2b</span><span class="hl opt">(</span>U <span class="hl opt">*</span>d<span class="hl opt">,</span> <span class="hl kwb">int</span> scale<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>e<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl com">/* First construct b and e assuming that scale == 0. */</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">2</span><span class="hl opt">;</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> <span class="hl kwd">word1</span><span class="hl opt">(</span>d<span class="hl opt">);</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] =</span> <span class="hl kwd">word0</span><span class="hl opt">(</span>d<span class="hl opt">) &</span> Frac_mask<span class="hl opt">;</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> Etiny <span class="hl opt">-</span> <span class="hl num">1</span> <span class="hl opt">+ (</span><span class="hl kwb">int</span><span class="hl opt">)((</span><span class="hl kwd">word0</span><span class="hl opt">(</span>d<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) >></span> Exp_shift<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(*</span>e <span class="hl opt"><</span> Etiny<span class="hl opt">)</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> Etiny<span class="hl opt">;</span> <span class="hl kwa">else</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] |=</span> Exp_msk1<span class="hl opt">;</span> <span class="hl com">/* Now adjust for scale, provided that b != 0. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>scale <span class="hl opt">&& (</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] ||</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">])) {</span> <span class="hl opt">*</span>e <span class="hl opt">-=</span> scale<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(*</span>e <span class="hl opt"><</span> Etiny<span class="hl opt">) {</span> scale <span class="hl opt">=</span> Etiny <span class="hl opt">- *</span>e<span class="hl opt">;</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> Etiny<span class="hl opt">;</span> <span class="hl com">/* We can't shift more than P-1 bits without shifting out a 1. */</span> <span class="hl kwa">assert</span><span class="hl opt">(</span><span class="hl num">0</span> <span class="hl opt"><</span> scale <span class="hl opt">&&</span> scale <span class="hl opt"><=</span> P <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>scale <span class="hl opt">>=</span> <span class="hl num">32</span><span class="hl opt">) {</span> <span class="hl com">/* The bits shifted out should all be zero. */</span> <span class="hl kwa">assert</span><span class="hl opt">(</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] ==</span> <span class="hl num">0</span><span class="hl opt">);</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">];</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] =</span> <span class="hl num">0</span><span class="hl opt">;</span> scale <span class="hl opt">-=</span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>scale<span class="hl opt">) {</span> <span class="hl com">/* The bits shifted out should all be zero. */</span> <span class="hl kwa">assert</span><span class="hl opt">(</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] << (</span><span class="hl num">32</span> <span class="hl opt">-</span> scale<span class="hl opt">) ==</span> <span class="hl num">0</span><span class="hl opt">);</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] = (</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] >></span> scale<span class="hl opt">) | (</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] << (</span><span class="hl num">32</span> <span class="hl opt">-</span> scale<span class="hl opt">));</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] >>=</span> scale<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* Ensure b is normalized. */</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">])</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Convert a double to a Bigint plus an exponent. Return NULL on failure.</span> <span class="hl com"></span> <span class="hl com"> Given a finite nonzero double d, return an odd Bigint b and exponent *e</span> <span class="hl com"> such that fabs(d) = b * 2**e. On return, *bbits gives the number of</span> <span class="hl com"> significant bits of b; that is, 2**(*bbits-1) <= b < 2**(*bbits).</span> <span class="hl com"></span> <span class="hl com"> If d is zero, then b == 0, *e == -1010, *bbits = 0.</span> <span class="hl com"> */</span> <span class="hl kwb">static</span> Bigint <span class="hl opt">*</span> <span class="hl kwd">d2b</span><span class="hl opt">(</span>U <span class="hl opt">*</span>d<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>e<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>bits<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">;</span> <span class="hl kwb">int</span> de<span class="hl opt">,</span> k<span class="hl opt">;</span> ULong <span class="hl opt">*</span>x<span class="hl opt">,</span> y<span class="hl opt">,</span> z<span class="hl opt">;</span> <span class="hl kwb">int</span> i<span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> x <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> z <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(</span>d<span class="hl opt">) &</span> Frac_mask<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(</span>d<span class="hl opt">) &=</span> <span class="hl num">0x7fffffff</span><span class="hl opt">;</span> <span class="hl com">/* clear sign bit, which we ignore */</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>de <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span><span class="hl kwd">word0</span><span class="hl opt">(</span>d<span class="hl opt">) >></span> Exp_shift<span class="hl opt">)))</span> z <span class="hl opt">|=</span> Exp_msk1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>y <span class="hl opt">=</span> <span class="hl kwd">word1</span><span class="hl opt">(</span>d<span class="hl opt">))) {</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>k <span class="hl opt">=</span> <span class="hl kwd">lo0bits</span><span class="hl opt">(&</span>y<span class="hl opt">))) {</span> x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> y <span class="hl opt">|</span> z <span class="hl opt"><< (</span><span class="hl num">32</span> <span class="hl opt">-</span> k<span class="hl opt">);</span> z <span class="hl opt">>>=</span> k<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> y<span class="hl opt">;</span> i <span class="hl opt">=</span> b<span class="hl opt">-></span>wds <span class="hl opt">= (</span>x<span class="hl opt">[</span><span class="hl num">1</span><span class="hl opt">] =</span> z<span class="hl opt">)</span> ? <span class="hl num">2</span> <span class="hl opt">:</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> k <span class="hl opt">=</span> <span class="hl kwd">lo0bits</span><span class="hl opt">(&</span>z<span class="hl opt">);</span> x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] =</span> z<span class="hl opt">;</span> i <span class="hl opt">=</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> k <span class="hl opt">+=</span> <span class="hl num">32</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>de<span class="hl opt">) {</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> de <span class="hl opt">-</span> Bias <span class="hl opt">- (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) +</span> k<span class="hl opt">;</span> <span class="hl opt">*</span>bits <span class="hl opt">=</span> P <span class="hl opt">-</span> k<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl opt">*</span>e <span class="hl opt">=</span> de <span class="hl opt">-</span> Bias <span class="hl opt">- (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) +</span> <span class="hl num">1</span> <span class="hl opt">+</span> k<span class="hl opt">;</span> <span class="hl opt">*</span>bits <span class="hl opt">=</span> <span class="hl num">32</span><span class="hl opt">*</span>i <span class="hl opt">-</span> <span class="hl kwd">hi0bits</span><span class="hl opt">(</span>x<span class="hl opt">[</span>i<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">]);</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> b<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Compute the ratio of two Bigints, as a double. The result may have an</span> <span class="hl com"> error of up to 2.5 ulps. */</span> <span class="hl kwb">static double</span> <span class="hl kwd">ratio</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>a<span class="hl opt">,</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">)</span> <span class="hl opt">{</span> U da<span class="hl opt">,</span> db<span class="hl opt">;</span> <span class="hl kwb">int</span> k<span class="hl opt">,</span> ka<span class="hl opt">,</span> kb<span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>da<span class="hl opt">) =</span> <span class="hl kwd">b2d</span><span class="hl opt">(</span>a<span class="hl opt">, &</span>ka<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>db<span class="hl opt">) =</span> <span class="hl kwd">b2d</span><span class="hl opt">(</span>b<span class="hl opt">, &</span>kb<span class="hl opt">);</span> k <span class="hl opt">=</span> ka <span class="hl opt">-</span> kb <span class="hl opt">+</span> <span class="hl num">32</span><span class="hl opt">*(</span>a<span class="hl opt">-></span>wds <span class="hl opt">-</span> b<span class="hl opt">-></span>wds<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">)</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>da<span class="hl opt">) +=</span> k<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> k <span class="hl opt">= -</span>k<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>db<span class="hl opt">) +=</span> k<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>da<span class="hl opt">) /</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>db<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwb">static const double</span> tens<span class="hl opt">[] = {</span> <span class="hl num">1</span>e0<span class="hl opt">,</span> <span class="hl num">1</span>e1<span class="hl opt">,</span> <span class="hl num">1</span>e2<span class="hl opt">,</span> <span class="hl num">1</span>e3<span class="hl opt">,</span> <span class="hl num">1</span>e4<span class="hl opt">,</span> <span class="hl num">1</span>e5<span class="hl opt">,</span> <span class="hl num">1</span>e6<span class="hl opt">,</span> <span class="hl num">1</span>e7<span class="hl opt">,</span> <span class="hl num">1</span>e8<span class="hl opt">,</span> <span class="hl num">1</span>e9<span class="hl opt">,</span> <span class="hl num">1</span>e10<span class="hl opt">,</span> <span class="hl num">1</span>e11<span class="hl opt">,</span> <span class="hl num">1</span>e12<span class="hl opt">,</span> <span class="hl num">1</span>e13<span class="hl opt">,</span> <span class="hl num">1</span>e14<span class="hl opt">,</span> <span class="hl num">1</span>e15<span class="hl opt">,</span> <span class="hl num">1</span>e16<span class="hl opt">,</span> <span class="hl num">1</span>e17<span class="hl opt">,</span> <span class="hl num">1</span>e18<span class="hl opt">,</span> <span class="hl num">1</span>e19<span class="hl opt">,</span> <span class="hl num">1</span>e20<span class="hl opt">,</span> <span class="hl num">1</span>e21<span class="hl opt">,</span> <span class="hl num">1</span>e22 <span class="hl opt">};</span> <span class="hl kwb">static const double</span> bigtens<span class="hl opt">[] = {</span> <span class="hl num">1</span>e16<span class="hl opt">,</span> <span class="hl num">1</span>e32<span class="hl opt">,</span> <span class="hl num">1</span>e64<span class="hl opt">,</span> <span class="hl num">1</span>e128<span class="hl opt">,</span> <span class="hl num">1</span>e256 <span class="hl opt">};</span> <span class="hl kwb">static const double</span> tinytens<span class="hl opt">[] = {</span> <span class="hl num">1e-16</span><span class="hl opt">,</span> <span class="hl num">1e-32</span><span class="hl opt">,</span> <span class="hl num">1e-64</span><span class="hl opt">,</span> <span class="hl num">1e-128</span><span class="hl opt">,</span> <span class="hl num">9007199254740992</span><span class="hl opt">.*</span><span class="hl num">9007199254740992</span><span class="hl opt">.</span>e<span class="hl opt">-</span><span class="hl num">256</span> <span class="hl com">/* = 2^106 * 1e-256 */</span> <span class="hl opt">};</span> <span class="hl com">/* The factor of 2^53 in tinytens[4] helps us avoid setting the underflow */</span> <span class="hl com">/* flag unnecessarily. It leads to a song and dance at the end of strtod. */</span> <span class="hl ppc">#define Scale_Bit 0x10</span> <span class="hl ppc">#define n_bigtens 5</span> <span class="hl ppc">#define ULbits 32</span> <span class="hl ppc">#define kshift 5</span> <span class="hl ppc">#define kmask 31</span> <span class="hl kwb">static int</span> <span class="hl kwd">dshift</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> <span class="hl kwb">int</span> p2<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> rv <span class="hl opt">=</span> <span class="hl kwd">hi0bits</span><span class="hl opt">(</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span>b<span class="hl opt">-></span>wds<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">]) -</span> <span class="hl num">4</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">)</span> rv <span class="hl opt">-=</span> p2<span class="hl opt">;</span> <span class="hl kwa">return</span> rv <span class="hl opt">&</span> kmask<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* special case of Bigint division. The quotient is always in the range 0 <=</span> <span class="hl com"> quotient < 10, and on entry the divisor S is normalized so that its top 4</span> <span class="hl com"> bits (28--31) are zero and bit 27 is set. */</span> <span class="hl kwb">static int</span> <span class="hl kwd">quorem</span><span class="hl opt">(</span>Bigint <span class="hl opt">*</span>b<span class="hl opt">,</span> Bigint <span class="hl opt">*</span>S<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> n<span class="hl opt">;</span> ULong <span class="hl opt">*</span>bx<span class="hl opt">, *</span>bxe<span class="hl opt">,</span> q<span class="hl opt">, *</span>sx<span class="hl opt">, *</span>sxe<span class="hl opt">;</span> <span class="hl ppc">#ifdef ULLong</span> ULLong borrow<span class="hl opt">,</span> carry<span class="hl opt">,</span> y<span class="hl opt">,</span> ys<span class="hl opt">;</span> <span class="hl ppc">#else</span> ULong borrow<span class="hl opt">,</span> carry<span class="hl opt">,</span> y<span class="hl opt">,</span> ys<span class="hl opt">;</span> ULong si<span class="hl opt">,</span> z<span class="hl opt">,</span> zs<span class="hl opt">;</span> <span class="hl ppc">#endif</span> n <span class="hl opt">=</span> S<span class="hl opt">-></span>wds<span class="hl opt">;</span> <span class="hl ppc">#ifdef DEBUG</span> <span class="hl com">/*debug*/</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b<span class="hl opt">-></span>wds <span class="hl opt">></span> n<span class="hl opt">)</span> <span class="hl com">/*debug*/</span> <span class="hl kwd">Bug</span><span class="hl opt">(</span><span class="hl str">"oversize b in quorem"</span><span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b<span class="hl opt">-></span>wds <span class="hl opt"><</span> n<span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl num">0</span><span class="hl opt">;</span> sx <span class="hl opt">=</span> S<span class="hl opt">-></span>x<span class="hl opt">;</span> sxe <span class="hl opt">=</span> sx <span class="hl opt">+ --</span>n<span class="hl opt">;</span> bx <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> bxe <span class="hl opt">=</span> bx <span class="hl opt">+</span> n<span class="hl opt">;</span> q <span class="hl opt">= *</span>bxe <span class="hl opt">/ (*</span>sxe <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl com">/* ensure q <= true quotient */</span> <span class="hl ppc">#ifdef DEBUG</span> <span class="hl com">/*debug*/</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>q <span class="hl opt">></span> <span class="hl num">9</span><span class="hl opt">)</span> <span class="hl com">/*debug*/</span> <span class="hl kwd">Bug</span><span class="hl opt">(</span><span class="hl str">"oversized quotient in quorem"</span><span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>q<span class="hl opt">) {</span> borrow <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> carry <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> <span class="hl ppc">#ifdef ULLong</span> ys <span class="hl opt">= *</span>sx<span class="hl opt">++ * (</span>ULLong<span class="hl opt">)</span>q <span class="hl opt">+</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> ys <span class="hl opt">>></span> <span class="hl num">32</span><span class="hl opt">;</span> y <span class="hl opt">= *</span>bx <span class="hl opt">- (</span>ys <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">=</span> y <span class="hl opt">>></span> <span class="hl num">32</span> <span class="hl opt">& (</span>ULong<span class="hl opt">)</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">*</span>bx<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>y <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl ppc">#else</span> si <span class="hl opt">= *</span>sx<span class="hl opt">++;</span> ys <span class="hl opt">= (</span>si <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) *</span> q <span class="hl opt">+</span> carry<span class="hl opt">;</span> zs <span class="hl opt">= (</span>si <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) *</span> q <span class="hl opt">+ (</span>ys <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">);</span> carry <span class="hl opt">=</span> zs <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> y <span class="hl opt">= (*</span>bx <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) - (</span>ys <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>y <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> z <span class="hl opt">= (*</span>bx <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) - (</span>zs <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>z <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>bx<span class="hl opt">,</span> z<span class="hl opt">,</span> y<span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>sx <span class="hl opt"><=</span> sxe<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(!*</span>bxe<span class="hl opt">) {</span> bx <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> <span class="hl kwa">while</span><span class="hl opt">(--</span>bxe <span class="hl opt">></span> bx <span class="hl opt">&& !*</span>bxe<span class="hl opt">)</span> <span class="hl opt">--</span>n<span class="hl opt">;</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> n<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> S<span class="hl opt">) >=</span> <span class="hl num">0</span><span class="hl opt">) {</span> q<span class="hl opt">++;</span> borrow <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> carry <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> bx <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> sx <span class="hl opt">=</span> S<span class="hl opt">-></span>x<span class="hl opt">;</span> <span class="hl kwa">do</span> <span class="hl opt">{</span> <span class="hl ppc">#ifdef ULLong</span> ys <span class="hl opt">= *</span>sx<span class="hl opt">++ +</span> carry<span class="hl opt">;</span> carry <span class="hl opt">=</span> ys <span class="hl opt">>></span> <span class="hl num">32</span><span class="hl opt">;</span> y <span class="hl opt">= *</span>bx <span class="hl opt">- (</span>ys <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">=</span> y <span class="hl opt">>></span> <span class="hl num">32</span> <span class="hl opt">& (</span>ULong<span class="hl opt">)</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">*</span>bx<span class="hl opt">++ = (</span>ULong<span class="hl opt">)(</span>y <span class="hl opt">&</span> FFFFFFFF<span class="hl opt">);</span> <span class="hl ppc">#else</span> si <span class="hl opt">= *</span>sx<span class="hl opt">++;</span> ys <span class="hl opt">= (</span>si <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) +</span> carry<span class="hl opt">;</span> zs <span class="hl opt">= (</span>si <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) + (</span>ys <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">);</span> carry <span class="hl opt">=</span> zs <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">;</span> y <span class="hl opt">= (*</span>bx <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) - (</span>ys <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>y <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> z <span class="hl opt">= (*</span>bx <span class="hl opt">>></span> <span class="hl num">16</span><span class="hl opt">) - (</span>zs <span class="hl opt">&</span> <span class="hl num">0xffff</span><span class="hl opt">) -</span> borrow<span class="hl opt">;</span> borrow <span class="hl opt">= (</span>z <span class="hl opt">&</span> <span class="hl num">0x10000</span><span class="hl opt">) >></span> <span class="hl num">16</span><span class="hl opt">;</span> <span class="hl kwd">Storeinc</span><span class="hl opt">(</span>bx<span class="hl opt">,</span> z<span class="hl opt">,</span> y<span class="hl opt">);</span> <span class="hl ppc">#endif</span> <span class="hl opt">}</span> <span class="hl kwa">while</span><span class="hl opt">(</span>sx <span class="hl opt"><=</span> sxe<span class="hl opt">);</span> bx <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">;</span> bxe <span class="hl opt">=</span> bx <span class="hl opt">+</span> n<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!*</span>bxe<span class="hl opt">) {</span> <span class="hl kwa">while</span><span class="hl opt">(--</span>bxe <span class="hl opt">></span> bx <span class="hl opt">&& !*</span>bxe<span class="hl opt">)</span> <span class="hl opt">--</span>n<span class="hl opt">;</span> b<span class="hl opt">-></span>wds <span class="hl opt">=</span> n<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">return</span> q<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* sulp(x) is a version of ulp(x) that takes bc.scale into account.</span> <span class="hl com"></span> <span class="hl com"> Assuming that x is finite and nonnegative (positive zero is fine</span> <span class="hl com"> here) and x / 2^bc.scale is exactly representable as a double,</span> <span class="hl com"> sulp(x) is equivalent to 2^bc.scale * ulp(x / 2^bc.scale). */</span> <span class="hl kwb">static double</span> <span class="hl kwd">sulp</span><span class="hl opt">(</span>U <span class="hl opt">*</span>x<span class="hl opt">,</span> BCinfo <span class="hl opt">*</span>bc<span class="hl opt">)</span> <span class="hl opt">{</span> U u<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">-></span>scale <span class="hl opt">&&</span> <span class="hl num">2</span><span class="hl opt">*</span>P <span class="hl opt">+</span> <span class="hl num">1</span> <span class="hl opt">> (</span><span class="hl kwb">int</span><span class="hl opt">)((</span><span class="hl kwd">word0</span><span class="hl opt">(</span>x<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) >></span> Exp_shift<span class="hl opt">)) {</span> <span class="hl com">/* rv/2^bc->scale is subnormal */</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) = (</span>P<span class="hl opt">+</span><span class="hl num">2</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> u<span class="hl opt">.</span>d<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl kwa">assert</span><span class="hl opt">(</span><span class="hl kwd">word0</span><span class="hl opt">(</span>x<span class="hl opt">) ||</span> <span class="hl kwd">word1</span><span class="hl opt">(</span>x<span class="hl opt">));</span> <span class="hl com">/* x != 0.0 */</span> <span class="hl kwa">return</span> <span class="hl kwd">ulp</span><span class="hl opt">(</span>x<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* The bigcomp function handles some hard cases for strtod, for inputs</span> <span class="hl com"> with more than STRTOD_DIGLIM digits. It's called once an initial</span> <span class="hl com"> estimate for the double corresponding to the input string has</span> <span class="hl com"> already been obtained by the code in _Py_dg_strtod.</span> <span class="hl com"></span> <span class="hl com"> The bigcomp function is only called after _Py_dg_strtod has found a</span> <span class="hl com"> double value rv such that either rv or rv + 1ulp represents the</span> <span class="hl com"> correctly rounded value corresponding to the original string. It</span> <span class="hl com"> determines which of these two values is the correct one by</span> <span class="hl com"> computing the decimal digits of rv + 0.5ulp and comparing them with</span> <span class="hl com"> the corresponding digits of s0.</span> <span class="hl com"></span> <span class="hl com"> In the following, write dv for the absolute value of the number represented</span> <span class="hl com"> by the input string.</span> <span class="hl com"></span> <span class="hl com"> Inputs:</span> <span class="hl com"></span> <span class="hl com"> s0 points to the first significant digit of the input string.</span> <span class="hl com"></span> <span class="hl com"> rv is a (possibly scaled) estimate for the closest double value to the</span> <span class="hl com"> value represented by the original input to _Py_dg_strtod. If</span> <span class="hl com"> bc->scale is nonzero, then rv/2^(bc->scale) is the approximation to</span> <span class="hl com"> the input value.</span> <span class="hl com"></span> <span class="hl com"> bc is a struct containing information gathered during the parsing and</span> <span class="hl com"> estimation steps of _Py_dg_strtod. Description of fields follows:</span> <span class="hl com"></span> <span class="hl com"> bc->e0 gives the exponent of the input value, such that dv = (integer</span> <span class="hl com"> given by the bd->nd digits of s0) * 10**e0</span> <span class="hl com"></span> <span class="hl com"> bc->nd gives the total number of significant digits of s0. It will</span> <span class="hl com"> be at least 1.</span> <span class="hl com"></span> <span class="hl com"> bc->nd0 gives the number of significant digits of s0 before the</span> <span class="hl com"> decimal separator. If there's no decimal separator, bc->nd0 ==</span> <span class="hl com"> bc->nd.</span> <span class="hl com"></span> <span class="hl com"> bc->scale is the value used to scale rv to avoid doing arithmetic with</span> <span class="hl com"> subnormal values. It's either 0 or 2*P (=106).</span> <span class="hl com"></span> <span class="hl com"> Outputs:</span> <span class="hl com"></span> <span class="hl com"> On successful exit, rv/2^(bc->scale) is the closest double to dv.</span> <span class="hl com"></span> <span class="hl com"> Returns 0 on success, -1 on failure (e.g., due to a failed malloc call). */</span> <span class="hl kwb">static int</span> <span class="hl kwd">bigcomp</span><span class="hl opt">(</span>U <span class="hl opt">*</span>rv<span class="hl opt">,</span> <span class="hl kwb">const char</span> <span class="hl opt">*</span>s0<span class="hl opt">,</span> BCinfo <span class="hl opt">*</span>bc<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">, *</span>d<span class="hl opt">;</span> <span class="hl kwb">int</span> b2<span class="hl opt">,</span> d2<span class="hl opt">,</span> dd<span class="hl opt">,</span> i<span class="hl opt">,</span> nd<span class="hl opt">,</span> nd0<span class="hl opt">,</span> odd<span class="hl opt">,</span> p2<span class="hl opt">,</span> p5<span class="hl opt">;</span> nd <span class="hl opt">=</span> bc<span class="hl opt">-></span>nd<span class="hl opt">;</span> nd0 <span class="hl opt">=</span> bc<span class="hl opt">-></span>nd0<span class="hl opt">;</span> p5 <span class="hl opt">=</span> nd <span class="hl opt">+</span> bc<span class="hl opt">-></span>e0<span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">sd2b</span><span class="hl opt">(</span>rv<span class="hl opt">,</span> bc<span class="hl opt">-></span>scale<span class="hl opt">, &</span>p2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* record whether the lsb of rv/2^(bc->scale) is odd: in the exact halfway</span> <span class="hl com"> case, this is used for round to even. */</span> odd <span class="hl opt">=</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* left shift b by 1 bit and or a 1 into the least significant bit;</span> <span class="hl com"> this gives us b * 2**p2 = rv/2^(bc->scale) + 0.5 ulp. */</span> b <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] |=</span> <span class="hl num">1</span><span class="hl opt">;</span> p2<span class="hl opt">--;</span> p2 <span class="hl opt">-=</span> p5<span class="hl opt">;</span> d <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>d <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Arrange for convenient computation of quotients:</span> <span class="hl com"> * shift left if necessary so divisor has 4 leading 0 bits.</span> <span class="hl com"> */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> d <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>d<span class="hl opt">,</span> p5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>d <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span>p5 <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">) {</span> b <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>b<span class="hl opt">, -</span>p5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>d<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>p2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> b2 <span class="hl opt">=</span> p2<span class="hl opt">;</span> d2 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> b2 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> d2 <span class="hl opt">= -</span>p2<span class="hl opt">;</span> <span class="hl opt">}</span> i <span class="hl opt">=</span> <span class="hl kwd">dshift</span><span class="hl opt">(</span>d<span class="hl opt">,</span> d2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>b2 <span class="hl opt">+=</span> i<span class="hl opt">) ></span> <span class="hl num">0</span><span class="hl opt">) {</span> b <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>b<span class="hl opt">,</span> b2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>d<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>d2 <span class="hl opt">+=</span> i<span class="hl opt">) ></span> <span class="hl num">0</span><span class="hl opt">) {</span> d <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>d<span class="hl opt">,</span> d2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>d <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* Compare s0 with b/d: set dd to -1, 0, or 1 according as s0 < b/d, s0 ==</span> <span class="hl com"> * b/d, or s0 > b/d. Here the digits of s0 are thought of as representing</span> <span class="hl com"> * a number in the range [0.1, 1). */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> d<span class="hl opt">) >=</span> <span class="hl num">0</span><span class="hl opt">)</span> <span class="hl com">/* b/d >= 1 */</span> dd <span class="hl opt">= -</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(;;) {</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>d<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> dd <span class="hl opt">=</span> s0<span class="hl opt">[</span>i <span class="hl opt"><</span> nd0 ? i <span class="hl opt">:</span> i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] -</span> <span class="hl str">'0'</span> <span class="hl opt">-</span> <span class="hl kwd">quorem</span><span class="hl opt">(</span>b<span class="hl opt">,</span> d<span class="hl opt">);</span> i<span class="hl opt">++;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dd<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> b<span class="hl opt">-></span>wds <span class="hl opt">==</span> <span class="hl num">1</span><span class="hl opt">) {</span> <span class="hl com">/* b/d == 0 */</span> dd <span class="hl opt">=</span> i <span class="hl opt"><</span> nd<span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span>i <span class="hl opt"><</span> nd<span class="hl opt">)) {</span> <span class="hl com">/* b/d != 0, but digits of s0 exhausted */</span> dd <span class="hl opt">= -</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>d<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dd <span class="hl opt">></span> <span class="hl num">0</span> <span class="hl opt">|| (</span>dd <span class="hl opt">==</span> <span class="hl num">0</span> <span class="hl opt">&&</span> odd<span class="hl opt">))</span> <span class="hl kwd">dval</span><span class="hl opt">(</span>rv<span class="hl opt">) +=</span> <span class="hl kwd">sulp</span><span class="hl opt">(</span>rv<span class="hl opt">,</span> bc<span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwb">double</span> <span class="hl kwd">_Py_dg_strtod</span><span class="hl opt">(</span><span class="hl kwb">const char</span> <span class="hl opt">*</span>s00<span class="hl opt">,</span> <span class="hl kwb">char</span> <span class="hl opt">**</span>se<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> bb2<span class="hl opt">,</span> bb5<span class="hl opt">,</span> bbe<span class="hl opt">,</span> bd2<span class="hl opt">,</span> bd5<span class="hl opt">,</span> bs2<span class="hl opt">,</span> c<span class="hl opt">,</span> dsign<span class="hl opt">,</span> e<span class="hl opt">,</span> e1<span class="hl opt">,</span> error<span class="hl opt">;</span> <span class="hl kwb">int</span> esign<span class="hl opt">,</span> i<span class="hl opt">,</span> j<span class="hl opt">,</span> k<span class="hl opt">,</span> lz<span class="hl opt">,</span> nd<span class="hl opt">,</span> nd0<span class="hl opt">,</span> odd<span class="hl opt">,</span> sign<span class="hl opt">;</span> <span class="hl kwb">const char</span> <span class="hl opt">*</span>s<span class="hl opt">, *</span>s0<span class="hl opt">, *</span>s1<span class="hl opt">;</span> <span class="hl kwb">double</span> aadj<span class="hl opt">,</span> aadj1<span class="hl opt">;</span> U aadj2<span class="hl opt">,</span> adj<span class="hl opt">,</span> rv<span class="hl opt">,</span> rv0<span class="hl opt">;</span> ULong y<span class="hl opt">,</span> z<span class="hl opt">,</span> abs_exp<span class="hl opt">;</span> Long L<span class="hl opt">;</span> BCinfo bc<span class="hl opt">;</span> Bigint <span class="hl opt">*</span>bb<span class="hl opt">, *</span>bb1<span class="hl opt">, *</span>bd<span class="hl opt">, *</span>bd0<span class="hl opt">, *</span>bs<span class="hl opt">, *</span>delta<span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">.;</span> <span class="hl com">/* Start parsing. */</span> c <span class="hl opt">= *(</span>s <span class="hl opt">=</span> s00<span class="hl opt">);</span> <span class="hl com">/* Parse optional sign, if present. */</span> sign <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">switch</span> <span class="hl opt">(</span>c<span class="hl opt">) {</span> <span class="hl kwa">case</span> <span class="hl str">'-'</span><span class="hl opt">:</span> sign <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* no break */</span> <span class="hl kwa">case</span> <span class="hl str">'+'</span><span class="hl opt">:</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Skip leading zeros: lz is true iff there were leading zeros. */</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> <span class="hl str">'0'</span><span class="hl opt">)</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> lz <span class="hl opt">=</span> s <span class="hl opt">!=</span> s1<span class="hl opt">;</span> <span class="hl com">/* Point s0 at the first nonzero digit (if any). nd0 will be the position</span> <span class="hl com"> of the point relative to s0. nd will be the total number of digits</span> <span class="hl com"> ignoring leading zeros. */</span> s0 <span class="hl opt">=</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span><span class="hl str">'0'</span> <span class="hl opt"><=</span> c <span class="hl opt">&&</span> c <span class="hl opt"><=</span> <span class="hl str">'9'</span><span class="hl opt">)</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> nd0 <span class="hl opt">=</span> nd <span class="hl opt">=</span> s <span class="hl opt">-</span> s1<span class="hl opt">;</span> <span class="hl com">/* Parse decimal point and following digits. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> <span class="hl str">'.'</span><span class="hl opt">) {</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>nd<span class="hl opt">) {</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> <span class="hl str">'0'</span><span class="hl opt">)</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> lz <span class="hl opt">=</span> lz <span class="hl opt">||</span> s <span class="hl opt">!=</span> s1<span class="hl opt">;</span> nd0 <span class="hl opt">-=</span> s <span class="hl opt">-</span> s1<span class="hl opt">;</span> s0 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl opt">}</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span><span class="hl str">'0'</span> <span class="hl opt"><=</span> c <span class="hl opt">&&</span> c <span class="hl opt"><=</span> <span class="hl str">'9'</span><span class="hl opt">)</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> nd <span class="hl opt">+=</span> s <span class="hl opt">-</span> s1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Now lz is true if and only if there were leading zero digits, and nd</span> <span class="hl com"> gives the total number of digits ignoring leading zeros. A valid input</span> <span class="hl com"> must have at least one digit. */</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>nd <span class="hl opt">&& !</span>lz<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>se<span class="hl opt">)</span> <span class="hl opt">*</span>se <span class="hl opt">= (</span><span class="hl kwb">char</span> <span class="hl opt">*)</span>s00<span class="hl opt">;</span> <span class="hl kwa">goto</span> parse_error<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Parse exponent. */</span> e <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> <span class="hl str">'e'</span> <span class="hl opt">||</span> c <span class="hl opt">==</span> <span class="hl str">'E'</span><span class="hl opt">) {</span> s00 <span class="hl opt">=</span> s<span class="hl opt">;</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> <span class="hl com">/* Exponent sign. */</span> esign <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">switch</span> <span class="hl opt">(</span>c<span class="hl opt">) {</span> <span class="hl kwa">case</span> <span class="hl str">'-'</span><span class="hl opt">:</span> esign <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* no break */</span> <span class="hl kwa">case</span> <span class="hl str">'+'</span><span class="hl opt">:</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Skip zeros. lz is true iff there are leading zeros. */</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span>c <span class="hl opt">==</span> <span class="hl str">'0'</span><span class="hl opt">)</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> lz <span class="hl opt">=</span> s <span class="hl opt">!=</span> s1<span class="hl opt">;</span> <span class="hl com">/* Get absolute value of the exponent. */</span> s1 <span class="hl opt">=</span> s<span class="hl opt">;</span> abs_exp <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">while</span> <span class="hl opt">(</span><span class="hl str">'0'</span> <span class="hl opt"><=</span> c <span class="hl opt">&&</span> c <span class="hl opt"><=</span> <span class="hl str">'9'</span><span class="hl opt">) {</span> abs_exp <span class="hl opt">=</span> <span class="hl num">10</span><span class="hl opt">*</span>abs_exp <span class="hl opt">+ (</span>c <span class="hl opt">-</span> <span class="hl str">'0'</span><span class="hl opt">);</span> c <span class="hl opt">= *++</span>s<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* abs_exp will be correct modulo 2**32. But 10**9 < 2**32, so if</span> <span class="hl com"> there are at most 9 significant exponent digits then overflow is</span> <span class="hl com"> impossible. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s <span class="hl opt">-</span> s1 <span class="hl opt">></span> <span class="hl num">9</span> <span class="hl opt">||</span> abs_exp <span class="hl opt">></span> MAX_ABS_EXP<span class="hl opt">)</span> e <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>MAX_ABS_EXP<span class="hl opt">;</span> <span class="hl kwa">else</span> e <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>abs_exp<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>esign<span class="hl opt">)</span> e <span class="hl opt">= -</span>e<span class="hl opt">;</span> <span class="hl com">/* A valid exponent must have at least one digit. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s <span class="hl opt">==</span> s1 <span class="hl opt">&& !</span>lz<span class="hl opt">)</span> s <span class="hl opt">=</span> s00<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Adjust exponent to take into account position of the point. */</span> e <span class="hl opt">-=</span> nd <span class="hl opt">-</span> nd0<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd0 <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">)</span> nd0 <span class="hl opt">=</span> nd<span class="hl opt">;</span> <span class="hl com">/* Finished parsing. Set se to indicate how far we parsed */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>se<span class="hl opt">)</span> <span class="hl opt">*</span>se <span class="hl opt">= (</span><span class="hl kwb">char</span> <span class="hl opt">*)</span>s<span class="hl opt">;</span> <span class="hl com">/* If all digits were zero, exit with return value +-0.0. Otherwise,</span> <span class="hl com"> strip trailing zeros: scan back until we hit a nonzero digit. */</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>nd<span class="hl opt">)</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl kwa">for</span> <span class="hl opt">(</span>i <span class="hl opt">=</span> nd<span class="hl opt">;</span> i <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">; ) {</span> <span class="hl opt">--</span>i<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s0<span class="hl opt">[</span>i <span class="hl opt"><</span> nd0 ? i <span class="hl opt">:</span> i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] !=</span> <span class="hl str">'0'</span><span class="hl opt">) {</span> <span class="hl opt">++</span>i<span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> e <span class="hl opt">+=</span> nd <span class="hl opt">-</span> i<span class="hl opt">;</span> nd <span class="hl opt">=</span> i<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd0 <span class="hl opt">></span> nd<span class="hl opt">)</span> nd0 <span class="hl opt">=</span> nd<span class="hl opt">;</span> <span class="hl com">/* Summary of parsing results. After parsing, and dealing with zero</span> <span class="hl com"> * inputs, we have values s0, nd0, nd, e, sign, where:</span> <span class="hl com"> *</span> <span class="hl com"> * - s0 points to the first significant digit of the input string</span> <span class="hl com"> *</span> <span class="hl com"> * - nd is the total number of significant digits (here, and</span> <span class="hl com"> * below, 'significant digits' means the set of digits of the</span> <span class="hl com"> * significand of the input that remain after ignoring leading</span> <span class="hl com"> * and trailing zeros).</span> <span class="hl com"> *</span> <span class="hl com"> * - nd0 indicates the position of the decimal point, if present; it</span> <span class="hl com"> * satisfies 1 <= nd0 <= nd. The nd significant digits are in</span> <span class="hl com"> * s0[0:nd0] and s0[nd0+1:nd+1] using the usual Python half-open slice</span> <span class="hl com"> * notation. (If nd0 < nd, then s0[nd0] contains a '.' character; if</span> <span class="hl com"> * nd0 == nd, then s0[nd0] could be any non-digit character.)</span> <span class="hl com"> *</span> <span class="hl com"> * - e is the adjusted exponent: the absolute value of the number</span> <span class="hl com"> * represented by the original input string is n * 10**e, where</span> <span class="hl com"> * n is the integer represented by the concatenation of</span> <span class="hl com"> * s0[0:nd0] and s0[nd0+1:nd+1]</span> <span class="hl com"> *</span> <span class="hl com"> * - sign gives the sign of the input: 1 for negative, 0 for positive</span> <span class="hl com"> *</span> <span class="hl com"> * - the first and last significant digits are nonzero</span> <span class="hl com"> */</span> <span class="hl com">/* put first DBL_DIG+1 digits into integer y and z.</span> <span class="hl com"> *</span> <span class="hl com"> * - y contains the value represented by the first min(9, nd)</span> <span class="hl com"> * significant digits</span> <span class="hl com"> *</span> <span class="hl com"> * - if nd > 9, z contains the value represented by significant digits</span> <span class="hl com"> * with indices in [9, min(16, nd)). So y * 10**(min(16, nd) - 9) + z</span> <span class="hl com"> * gives the value represented by the first min(16, nd) sig. digits.</span> <span class="hl com"> */</span> bc<span class="hl opt">.</span>e0 <span class="hl opt">=</span> e1 <span class="hl opt">=</span> e<span class="hl opt">;</span> y <span class="hl opt">=</span> z <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">for</span> <span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt"><</span> nd<span class="hl opt">;</span> i<span class="hl opt">++) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt"><</span> <span class="hl num">9</span><span class="hl opt">)</span> y <span class="hl opt">=</span> <span class="hl num">10</span><span class="hl opt">*</span>y <span class="hl opt">+</span> s0<span class="hl opt">[</span>i <span class="hl opt"><</span> nd0 ? i <span class="hl opt">:</span> i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] -</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span>i <span class="hl opt"><</span> DBL_DIG<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">)</span> z <span class="hl opt">=</span> <span class="hl num">10</span><span class="hl opt">*</span>z <span class="hl opt">+</span> s0<span class="hl opt">[</span>i <span class="hl opt"><</span> nd0 ? i <span class="hl opt">:</span> i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] -</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl kwa">else</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> k <span class="hl opt">=</span> nd <span class="hl opt"><</span> DBL_DIG <span class="hl opt">+</span> <span class="hl num">1</span> ? nd <span class="hl opt">:</span> DBL_DIG <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> y<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">></span> <span class="hl num">9</span><span class="hl opt">) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> tens<span class="hl opt">[</span>k <span class="hl opt">-</span> <span class="hl num">9</span><span class="hl opt">] *</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) +</span> z<span class="hl opt">;</span> <span class="hl opt">}</span> bd0 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd <span class="hl opt"><=</span> DBL_DIG <span class="hl opt">&&</span> Flt_Rounds <span class="hl opt">==</span> <span class="hl num">1</span> <span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>e<span class="hl opt">)</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e <span class="hl opt"><=</span> Ten_pmax<span class="hl opt">) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>e<span class="hl opt">];</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> i <span class="hl opt">=</span> DBL_DIG <span class="hl opt">-</span> nd<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e <span class="hl opt"><=</span> Ten_pmax <span class="hl opt">+</span> i<span class="hl opt">) {</span> <span class="hl com">/* A fancier test would sometimes let us do</span> <span class="hl com"> * this for larger i values.</span> <span class="hl com"> */</span> e <span class="hl opt">-=</span> i<span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>e<span class="hl opt">];</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span>e <span class="hl opt">>= -</span>Ten_pmax<span class="hl opt">) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) /=</span> tens<span class="hl opt">[-</span>e<span class="hl opt">];</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> e1 <span class="hl opt">+=</span> nd <span class="hl opt">-</span> k<span class="hl opt">;</span> bc<span class="hl opt">.</span>scale <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* Get starting approximation = rv * 10**e1 */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>i <span class="hl opt">=</span> e1 <span class="hl opt">&</span> <span class="hl num">15</span><span class="hl opt">))</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">&= ~</span><span class="hl num">15</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">></span> DBL_MAX_10_EXP<span class="hl opt">)</span> <span class="hl kwa">goto</span> ovfl<span class="hl opt">;</span> e1 <span class="hl opt">>>=</span> <span class="hl num">4</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>j <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> e1 <span class="hl opt">></span> <span class="hl num">1</span><span class="hl opt">;</span> j<span class="hl opt">++,</span> e1 <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> bigtens<span class="hl opt">[</span>j<span class="hl opt">];</span> <span class="hl com">/* The last multiplication could overflow. */</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) -=</span> P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> bigtens<span class="hl opt">[</span>j<span class="hl opt">];</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>z <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">)</span> <span class="hl opt">></span> Exp_msk1<span class="hl opt">*(</span>DBL_MAX_EXP<span class="hl opt">+</span>Bias<span class="hl opt">-</span>P<span class="hl opt">))</span> <span class="hl kwa">goto</span> ovfl<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>z <span class="hl opt">></span> Exp_msk1<span class="hl opt">*(</span>DBL_MAX_EXP<span class="hl opt">+</span>Bias<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">-</span>P<span class="hl opt">)) {</span> <span class="hl com">/* set to largest number */</span> <span class="hl com">/* (Can't trust DBL_MAX) */</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> Big0<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> Big1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) +=</span> P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span>e1 <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl com">/* The input decimal value lies in [10**e1, 10**(e1+16)).</span> <span class="hl com"></span> <span class="hl com"> If e1 <= -512, underflow immediately.</span> <span class="hl com"> If e1 <= -256, set bc.scale to 2*P.</span> <span class="hl com"></span> <span class="hl com"> So for input value < 1e-256, bc.scale is always set;</span> <span class="hl com"> for input value >= 1e-240, bc.scale is never set.</span> <span class="hl com"> For input values in [1e-256, 1e-240), bc.scale may or may</span> <span class="hl com"> not be set. */</span> e1 <span class="hl opt">= -</span>e1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>i <span class="hl opt">=</span> e1 <span class="hl opt">&</span> <span class="hl num">15</span><span class="hl opt">))</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) /=</span> tens<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">>>=</span> <span class="hl num">4</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">>=</span> <span class="hl num">1</span> <span class="hl opt"><<</span> n_bigtens<span class="hl opt">)</span> <span class="hl kwa">goto</span> undfl<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">&</span> Scale_Bit<span class="hl opt">)</span> bc<span class="hl opt">.</span>scale <span class="hl opt">=</span> <span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>j <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> e1 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">;</span> j<span class="hl opt">++,</span> e1 <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e1 <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> tinytens<span class="hl opt">[</span>j<span class="hl opt">];</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>scale <span class="hl opt">&& (</span>j <span class="hl opt">=</span> <span class="hl num">2</span><span class="hl opt">*</span>P <span class="hl opt">+</span> <span class="hl num">1</span> <span class="hl opt">- ((</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">)</span> <span class="hl opt">>></span> Exp_shift<span class="hl opt">)) ></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl com">/* scaled rv is denormal; clear j low bits */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">>=</span> <span class="hl num">32</span><span class="hl opt">) {</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">>=</span> <span class="hl num">53</span><span class="hl opt">)</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) = (</span>P<span class="hl opt">+</span><span class="hl num">2</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwa">else</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &=</span> <span class="hl num">0xffffffff</span> <span class="hl opt"><< (</span>j<span class="hl opt">-</span><span class="hl num">32</span><span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) &=</span> <span class="hl num">0xffffffff</span> <span class="hl opt"><<</span> j<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">))</span> <span class="hl kwa">goto</span> undfl<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* Now the hard part -- adjusting rv to the correct value.*/</span> <span class="hl com">/* Put digits into bd: true value = bd * 10^e */</span> bc<span class="hl opt">.</span>nd <span class="hl opt">=</span> nd<span class="hl opt">;</span> bc<span class="hl opt">.</span>nd0 <span class="hl opt">=</span> nd0<span class="hl opt">;</span> <span class="hl com">/* Only needed if nd > STRTOD_DIGLIM, but done here */</span> <span class="hl com">/* to silence an erroneous warning about bc.nd0 */</span> <span class="hl com">/* possibly not being initialized. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd <span class="hl opt">></span> STRTOD_DIGLIM<span class="hl opt">) {</span> <span class="hl com">/* ASSERT(STRTOD_DIGLIM >= 18); 18 == one more than the */</span> <span class="hl com">/* minimum number of decimal digits to distinguish double values */</span> <span class="hl com">/* in IEEE arithmetic. */</span> <span class="hl com">/* Truncate input to 18 significant digits, then discard any trailing</span> <span class="hl com"> zeros on the result by updating nd, nd0, e and y suitably. (There's</span> <span class="hl com"> no need to update z; it's not reused beyond this point.) */</span> <span class="hl kwa">for</span> <span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">18</span><span class="hl opt">;</span> i <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">; ) {</span> <span class="hl com">/* scan back until we hit a nonzero digit. significant digit 'i'</span> <span class="hl com"> is s0[i] if i < nd0, s0[i+1] if i >= nd0. */</span> <span class="hl opt">--</span>i<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s0<span class="hl opt">[</span>i <span class="hl opt"><</span> nd0 ? i <span class="hl opt">:</span> i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] !=</span> <span class="hl str">'0'</span><span class="hl opt">) {</span> <span class="hl opt">++</span>i<span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> e <span class="hl opt">+=</span> nd <span class="hl opt">-</span> i<span class="hl opt">;</span> nd <span class="hl opt">=</span> i<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd0 <span class="hl opt">></span> nd<span class="hl opt">)</span> nd0 <span class="hl opt">=</span> nd<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>nd <span class="hl opt"><</span> <span class="hl num">9</span><span class="hl opt">) {</span> <span class="hl com">/* must recompute y */</span> y <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt"><</span> nd0<span class="hl opt">; ++</span>i<span class="hl opt">)</span> y <span class="hl opt">=</span> <span class="hl num">10</span><span class="hl opt">*</span>y <span class="hl opt">+</span> s0<span class="hl opt">[</span>i<span class="hl opt">] -</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl kwa">for</span><span class="hl opt">(;</span> i <span class="hl opt"><</span> nd<span class="hl opt">; ++</span>i<span class="hl opt">)</span> y <span class="hl opt">=</span> <span class="hl num">10</span><span class="hl opt">*</span>y <span class="hl opt">+</span> s0<span class="hl opt">[</span>i<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">] -</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> bd0 <span class="hl opt">=</span> <span class="hl kwd">s2b</span><span class="hl opt">(</span>s0<span class="hl opt">,</span> nd0<span class="hl opt">,</span> nd<span class="hl opt">,</span> y<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd0 <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl com">/* Notation for the comments below. Write:</span> <span class="hl com"></span> <span class="hl com"> - dv for the absolute value of the number represented by the original</span> <span class="hl com"> decimal input string.</span> <span class="hl com"></span> <span class="hl com"> - if we've truncated dv, write tdv for the truncated value.</span> <span class="hl com"> Otherwise, set tdv == dv.</span> <span class="hl com"></span> <span class="hl com"> - srv for the quantity rv/2^bc.scale; so srv is the current binary</span> <span class="hl com"> approximation to tdv (and dv). It should be exactly representable</span> <span class="hl com"> in an IEEE 754 double.</span> <span class="hl com"> */</span> <span class="hl kwa">for</span><span class="hl opt">(;;) {</span> <span class="hl com">/* This is the main correction loop for _Py_dg_strtod.</span> <span class="hl com"></span> <span class="hl com"> We've got a decimal value tdv, and a floating-point approximation</span> <span class="hl com"> srv=rv/2^bc.scale to tdv. The aim is to determine whether srv is</span> <span class="hl com"> close enough (i.e., within 0.5 ulps) to tdv, and to compute a new</span> <span class="hl com"> approximation if not.</span> <span class="hl com"></span> <span class="hl com"> To determine whether srv is close enough to tdv, compute integers</span> <span class="hl com"> bd, bb and bs proportional to tdv, srv and 0.5 ulp(srv)</span> <span class="hl com"> respectively, and then use integer arithmetic to determine whether</span> <span class="hl com"> |tdv - srv| is less than, equal to, or greater than 0.5 ulp(srv).</span> <span class="hl com"> */</span> bd <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>bd0<span class="hl opt">-></span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwd">Bcopy</span><span class="hl opt">(</span>bd<span class="hl opt">,</span> bd0<span class="hl opt">);</span> bb <span class="hl opt">=</span> <span class="hl kwd">sd2b</span><span class="hl opt">(&</span>rv<span class="hl opt">,</span> bc<span class="hl opt">.</span>scale<span class="hl opt">, &</span>bbe<span class="hl opt">);</span> <span class="hl com">/* srv = bb * 2^bbe */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bb <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Record whether lsb of bb is odd, in case we need this</span> <span class="hl com"> for the round-to-even step later. */</span> odd <span class="hl opt">=</span> bb<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* tdv = bd * 10**e; srv = bb * 2**bbe */</span> bs <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bs <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>e <span class="hl opt">>=</span> <span class="hl num">0</span><span class="hl opt">) {</span> bb2 <span class="hl opt">=</span> bb5 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> bd2 <span class="hl opt">=</span> bd5 <span class="hl opt">=</span> e<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> bb2 <span class="hl opt">=</span> bb5 <span class="hl opt">= -</span>e<span class="hl opt">;</span> bd2 <span class="hl opt">=</span> bd5 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bbe <span class="hl opt">>=</span> <span class="hl num">0</span><span class="hl opt">)</span> bb2 <span class="hl opt">+=</span> bbe<span class="hl opt">;</span> <span class="hl kwa">else</span> bd2 <span class="hl opt">-=</span> bbe<span class="hl opt">;</span> bs2 <span class="hl opt">=</span> bb2<span class="hl opt">;</span> bb2<span class="hl opt">++;</span> bd2<span class="hl opt">++;</span> <span class="hl com">/* At this stage bd5 - bb5 == e == bd2 - bb2 + bbe, bb2 - bs2 == 1,</span> <span class="hl com"> and bs == 1, so:</span> <span class="hl com"></span> <span class="hl com"> tdv == bd * 10**e = bd * 2**(bbe - bb2 + bd2) * 5**(bd5 - bb5)</span> <span class="hl com"> srv == bb * 2**bbe = bb * 2**(bbe - bb2 + bb2)</span> <span class="hl com"> 0.5 ulp(srv) == 2**(bbe-1) = bs * 2**(bbe - bb2 + bs2)</span> <span class="hl com"></span> <span class="hl com"> It follows that:</span> <span class="hl com"></span> <span class="hl com"> M * tdv = bd * 2**bd2 * 5**bd5</span> <span class="hl com"> M * srv = bb * 2**bb2 * 5**bb5</span> <span class="hl com"> M * 0.5 ulp(srv) = bs * 2**bs2 * 5**bb5</span> <span class="hl com"></span> <span class="hl com"> for some constant M. (Actually, M == 2**(bb2 - bbe) * 5**bb5, but</span> <span class="hl com"> this fact is not needed below.)</span> <span class="hl com"> */</span> <span class="hl com">/* Remove factor of 2**i, where i = min(bb2, bd2, bs2). */</span> i <span class="hl opt">=</span> bb2 <span class="hl opt"><</span> bd2 ? bb2 <span class="hl opt">:</span> bd2<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">></span> bs2<span class="hl opt">)</span> i <span class="hl opt">=</span> bs2<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bb2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> bd2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> bs2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Scale bb, bd, bs by the appropriate powers of 2 and 5. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bb5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bs <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>bs<span class="hl opt">,</span> bb5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bs <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> bb1 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>bs<span class="hl opt">,</span> bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> bb <span class="hl opt">=</span> bb1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bb <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bb2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bb <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>bb<span class="hl opt">,</span> bb2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bb <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bd <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>bd<span class="hl opt">,</span> bd5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bd <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>bd<span class="hl opt">,</span> bd2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bd <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bs2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> bs <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>bs<span class="hl opt">,</span> bs2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bs <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* Now bd, bb and bs are scaled versions of tdv, srv and 0.5 ulp(srv),</span> <span class="hl com"> respectively. Compute the difference |tdv - srv|, and compare</span> <span class="hl com"> with 0.5 ulp(srv). */</span> delta <span class="hl opt">=</span> <span class="hl kwd">diff</span><span class="hl opt">(</span>bb<span class="hl opt">,</span> bd<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>delta <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> dsign <span class="hl opt">=</span> delta<span class="hl opt">-></span>sign<span class="hl opt">;</span> delta<span class="hl opt">-></span>sign <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> i <span class="hl opt">=</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>delta<span class="hl opt">,</span> bs<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">></span> nd <span class="hl opt">&&</span> i <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl com">/* Must use bigcomp(). */</span> <span class="hl com">/* Here rv overestimates the truncated decimal value by at most</span> <span class="hl com"> 0.5 ulp(rv). Hence rv either overestimates the true decimal</span> <span class="hl com"> value by <= 0.5 ulp(rv), or underestimates it by some small</span> <span class="hl com"> amount (< 0.1 ulp(rv)); either way, rv is within 0.5 ulps of</span> <span class="hl com"> the true decimal value, so it's possible to exit.</span> <span class="hl com"></span> <span class="hl com"> Exception: if scaled rv is a normal exact power of 2, but not</span> <span class="hl com"> DBL_MIN, then rv - 0.5 ulp(rv) takes us all the way down to the</span> <span class="hl com"> next double, so the correctly rounded result is either rv - 0.5</span> <span class="hl com"> ulp(rv) or rv; in this case, use bigcomp to distinguish. */</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) && !(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask<span class="hl opt">)) {</span> <span class="hl com">/* rv can't be 0, since it's an overestimate for some</span> <span class="hl com"> nonzero value. So rv is a normal power of 2. */</span> j <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) >></span> Exp_shift<span class="hl opt">;</span> <span class="hl com">/* rv / 2^bc.scale = 2^(j - 1023 - bc.scale); use bigcomp if</span> <span class="hl com"> rv / 2^bc.scale >= 2^-1021. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">-</span> bc<span class="hl opt">.</span>scale <span class="hl opt">>=</span> <span class="hl num">2</span><span class="hl opt">) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) -=</span> <span class="hl num">0.5</span> <span class="hl opt">*</span> <span class="hl kwd">sulp</span><span class="hl opt">(&</span>rv<span class="hl opt">, &</span>bc<span class="hl opt">);</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl com">/* Use bigcomp. */</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">{</span> bc<span class="hl opt">.</span>nd <span class="hl opt">=</span> nd<span class="hl opt">;</span> i <span class="hl opt">= -</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* Discarded digits make delta smaller. */</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl com">/* Error is less than half an ulp -- check for</span> <span class="hl com"> * special case of mantissa a power of two.</span> <span class="hl com"> */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign <span class="hl opt">||</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) ||</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask <span class="hl opt">|| (</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) <= (</span><span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">)*</span>Exp_msk1 <span class="hl opt">) {</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>delta<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> delta<span class="hl opt">-></span>wds <span class="hl opt"><=</span> <span class="hl num">1</span><span class="hl opt">) {</span> <span class="hl com">/* exact result */</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> delta <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>delta<span class="hl opt">,</span>Log2P<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>delta <span class="hl opt">==</span> NULL<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">cmp</span><span class="hl opt">(</span>delta<span class="hl opt">,</span> bs<span class="hl opt">) ></span> <span class="hl num">0</span><span class="hl opt">)</span> <span class="hl kwa">goto</span> drop_down<span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl com">/* exactly half-way between */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">((</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask1<span class="hl opt">) ==</span> Bndry_mask1 <span class="hl opt">&&</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) == (</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>scale <span class="hl opt">&&</span> <span class="hl opt">(</span>y <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) <=</span> <span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">)</span> ? <span class="hl opt">(</span><span class="hl num">0xffffffff</span> <span class="hl opt">& (</span><span class="hl num">0xffffffff</span> <span class="hl opt"><< (</span><span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">-(</span>y<span class="hl opt">>></span>Exp_shift<span class="hl opt">)))) :</span> <span class="hl num">0xffffffff</span><span class="hl opt">)) {</span> <span class="hl com">/*boundary case -- increment exponent*/</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) = (</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">)</span> <span class="hl opt">+</span> Exp_msk1 <span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* dsign = 0; */</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">(!(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask<span class="hl opt">) && !</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">)) {</span> drop_down<span class="hl opt">:</span> <span class="hl com">/* boundary case -- decrement exponent */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>scale<span class="hl opt">) {</span> L <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>L <span class="hl opt"><= (</span><span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>L <span class="hl opt">> (</span>P<span class="hl opt">+</span><span class="hl num">2</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">)</span> <span class="hl com">/* round even ==> */</span> <span class="hl com">/* accept rv */</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl com">/* rv = smallest denormal */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">></span> nd<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> undfl<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> L <span class="hl opt">= (</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) -</span> Exp_msk1<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> L <span class="hl opt">|</span> Bndry_mask1<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> <span class="hl num">0xffffffff</span><span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>odd<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign<span class="hl opt">)</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) +=</span> <span class="hl kwd">sulp</span><span class="hl opt">(&</span>rv<span class="hl opt">, &</span>bc<span class="hl opt">);</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) -=</span> <span class="hl kwd">sulp</span><span class="hl opt">(&</span>rv<span class="hl opt">, &</span>bc<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">)) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">></span>nd<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> undfl<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* dsign = 1 - dsign; */</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>aadj <span class="hl opt">=</span> <span class="hl kwd">ratio</span><span class="hl opt">(</span>delta<span class="hl opt">,</span> bs<span class="hl opt">)) <=</span> <span class="hl num">2</span><span class="hl opt">.) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign<span class="hl opt">)</span> aadj <span class="hl opt">=</span> aadj1 <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">.;</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) ||</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) ==</span> Tiny1 <span class="hl opt">&& !</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">)) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">></span>nd<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> undfl<span class="hl opt">;</span> <span class="hl opt">}</span> aadj <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">.;</span> aadj1 <span class="hl opt">= -</span><span class="hl num">1</span><span class="hl opt">.;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl com">/* special case -- power of FLT_RADIX to be */</span> <span class="hl com">/* rounded down... */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>aadj <span class="hl opt"><</span> <span class="hl num">2</span><span class="hl opt">./</span>FLT_RADIX<span class="hl opt">)</span> aadj <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">./</span>FLT_RADIX<span class="hl opt">;</span> <span class="hl kwa">else</span> aadj <span class="hl opt">*=</span> <span class="hl num">0.5</span><span class="hl opt">;</span> aadj1 <span class="hl opt">= -</span>aadj<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> aadj <span class="hl opt">*=</span> <span class="hl num">0.5</span><span class="hl opt">;</span> aadj1 <span class="hl opt">=</span> dsign ? aadj <span class="hl opt">: -</span>aadj<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>Flt_Rounds <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">)</span> aadj1 <span class="hl opt">+=</span> <span class="hl num">0.5</span><span class="hl opt">;</span> <span class="hl opt">}</span> y <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">;</span> <span class="hl com">/* Check for overflow */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>y <span class="hl opt">==</span> Exp_msk1<span class="hl opt">*(</span>DBL_MAX_EXP<span class="hl opt">+</span>Bias<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv0<span class="hl opt">) =</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">);</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) -=</span> P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> adj<span class="hl opt">.</span>d <span class="hl opt">=</span> aadj1 <span class="hl opt">*</span> <span class="hl kwd">ulp</span><span class="hl opt">(&</span>rv<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) +=</span> adj<span class="hl opt">.</span>d<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">((</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) >=</span> Exp_msk1<span class="hl opt">*(</span>DBL_MAX_EXP<span class="hl opt">+</span>Bias<span class="hl opt">-</span>P<span class="hl opt">)) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>rv0<span class="hl opt">) ==</span> Big0 <span class="hl opt">&&</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv0<span class="hl opt">) ==</span> Big1<span class="hl opt">) {</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>delta<span class="hl opt">);</span> <span class="hl kwa">goto</span> ovfl<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> Big0<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> Big1<span class="hl opt">;</span> <span class="hl kwa">goto</span> cont<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) +=</span> P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>scale <span class="hl opt">&&</span> y <span class="hl opt"><=</span> <span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>aadj <span class="hl opt"><=</span> <span class="hl num">0x7fffffff</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>z <span class="hl opt">= (</span>ULong<span class="hl opt">)</span>aadj<span class="hl opt">) <=</span> <span class="hl num">0</span><span class="hl opt">)</span> z <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> aadj <span class="hl opt">=</span> z<span class="hl opt">;</span> aadj1 <span class="hl opt">=</span> dsign ? aadj <span class="hl opt">: -</span>aadj<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>aadj2<span class="hl opt">) =</span> aadj1<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>aadj2<span class="hl opt">) += (</span><span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">)*</span>Exp_msk1 <span class="hl opt">-</span> y<span class="hl opt">;</span> aadj1 <span class="hl opt">=</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>aadj2<span class="hl opt">);</span> <span class="hl opt">}</span> adj<span class="hl opt">.</span>d <span class="hl opt">=</span> aadj1 <span class="hl opt">*</span> <span class="hl kwd">ulp</span><span class="hl opt">(&</span>rv<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) +=</span> adj<span class="hl opt">.</span>d<span class="hl opt">;</span> <span class="hl opt">}</span> z <span class="hl opt">=</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Exp_mask<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">==</span> nd<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>bc<span class="hl opt">.</span>scale<span class="hl opt">)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>y <span class="hl opt">==</span> z<span class="hl opt">) {</span> <span class="hl com">/* Can we stop now? */</span> L <span class="hl opt">= (</span>Long<span class="hl opt">)</span>aadj<span class="hl opt">;</span> aadj <span class="hl opt">-=</span> L<span class="hl opt">;</span> <span class="hl com">/* The tolerances below are conservative. */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dsign <span class="hl opt">||</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) ||</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) &</span> Bndry_mask<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>aadj <span class="hl opt"><</span> <span class="hl num">.4999999</span> <span class="hl opt">||</span> aadj <span class="hl opt">></span> <span class="hl num">.5000001</span><span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span>aadj <span class="hl opt"><</span> <span class="hl num">.4999999</span><span class="hl opt">/</span>FLT_RADIX<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> cont<span class="hl opt">:</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>delta<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bb<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bs<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>bd0<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>delta<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>nd <span class="hl opt">></span> nd<span class="hl opt">) {</span> error <span class="hl opt">=</span> <span class="hl kwd">bigcomp</span><span class="hl opt">(&</span>rv<span class="hl opt">,</span> s0<span class="hl opt">, &</span>bc<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>error<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>bc<span class="hl opt">.</span>scale<span class="hl opt">) {</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv0<span class="hl opt">) =</span> Exp_1 <span class="hl opt">-</span> <span class="hl num">2</span><span class="hl opt">*</span>P<span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv0<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) *=</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv0<span class="hl opt">);</span> <span class="hl opt">}</span> ret<span class="hl opt">:</span> <span class="hl kwa">return</span> sign ? <span class="hl opt">-</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) :</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">);</span> parse_error<span class="hl opt">:</span> <span class="hl kwa">return</span> <span class="hl num">0.0</span><span class="hl opt">;</span> failed_malloc<span class="hl opt">:</span> errno <span class="hl opt">=</span> ENOMEM<span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl opt">-</span><span class="hl num">1.0</span><span class="hl opt">;</span> undfl<span class="hl opt">:</span> <span class="hl kwa">return</span> sign ? <span class="hl opt">-</span><span class="hl num">0.0</span> <span class="hl opt">:</span> <span class="hl num">0.0</span><span class="hl opt">;</span> ovfl<span class="hl opt">:</span> errno <span class="hl opt">=</span> ERANGE<span class="hl opt">;</span> <span class="hl com">/* Can't trust HUGE_VAL */</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> Exp_mask<span class="hl opt">;</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>rv<span class="hl opt">) =</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">return</span> sign ? <span class="hl opt">-</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">) :</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>rv<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwb">static char</span> <span class="hl opt">*</span> <span class="hl kwd">rv_alloc</span><span class="hl opt">(</span><span class="hl kwb">int</span> i<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">int</span> j<span class="hl opt">,</span> k<span class="hl opt">, *</span>r<span class="hl opt">;</span> j <span class="hl opt">=</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>ULong<span class="hl opt">);</span> <span class="hl kwa">for</span><span class="hl opt">(</span>k <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>Bigint<span class="hl opt">) -</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span>ULong<span class="hl opt">) -</span> <span class="hl kwa">sizeof</span><span class="hl opt">(</span><span class="hl kwb">int</span><span class="hl opt">) +</span> j <span class="hl opt"><= (</span><span class="hl kwb">unsigned</span><span class="hl opt">)</span>i<span class="hl opt">;</span> j <span class="hl opt"><<=</span> <span class="hl num">1</span><span class="hl opt">)</span> k<span class="hl opt">++;</span> r <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">*)</span><span class="hl kwd">Balloc</span><span class="hl opt">(</span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>r <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">*</span>r <span class="hl opt">=</span> k<span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl opt">(</span><span class="hl kwb">char</span> <span class="hl opt">*)(</span>r<span class="hl opt">+</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwb">static char</span> <span class="hl opt">*</span> <span class="hl kwd">nrv_alloc</span><span class="hl opt">(</span><span class="hl kwb">char</span> <span class="hl opt">*</span>s<span class="hl opt">,</span> <span class="hl kwb">char</span> <span class="hl opt">**</span>rve<span class="hl opt">,</span> <span class="hl kwb">int</span> n<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl kwb">char</span> <span class="hl opt">*</span>rv<span class="hl opt">, *</span>t<span class="hl opt">;</span> rv <span class="hl opt">=</span> <span class="hl kwd">rv_alloc</span><span class="hl opt">(</span>n<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>rv <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> t <span class="hl opt">=</span> rv<span class="hl opt">;</span> <span class="hl kwa">while</span><span class="hl opt">((*</span>t <span class="hl opt">= *</span>s<span class="hl opt">++))</span> t<span class="hl opt">++;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>rve<span class="hl opt">)</span> <span class="hl opt">*</span>rve <span class="hl opt">=</span> t<span class="hl opt">;</span> <span class="hl kwa">return</span> rv<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* freedtoa(s) must be used to free values s returned by dtoa</span> <span class="hl com"> * when MULTIPLE_THREADS is #defined. It should be used in all cases,</span> <span class="hl com"> * but for consistency with earlier versions of dtoa, it is optional</span> <span class="hl com"> * when MULTIPLE_THREADS is not defined.</span> <span class="hl com"> */</span> <span class="hl kwb">void</span> <span class="hl kwd">_Py_dg_freedtoa</span><span class="hl opt">(</span><span class="hl kwb">char</span> <span class="hl opt">*</span>s<span class="hl opt">)</span> <span class="hl opt">{</span> Bigint <span class="hl opt">*</span>b <span class="hl opt">= (</span>Bigint <span class="hl opt">*)((</span><span class="hl kwb">int</span> <span class="hl opt">*)</span>s <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">);</span> b<span class="hl opt">-></span>maxwds <span class="hl opt">=</span> <span class="hl num">1</span> <span class="hl opt"><< (</span>b<span class="hl opt">-></span>k <span class="hl opt">= *(</span><span class="hl kwb">int</span><span class="hl opt">*)</span>b<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl com">/* dtoa for IEEE arithmetic (dmg): convert double to ASCII string.</span> <span class="hl com"> *</span> <span class="hl com"> * Inspired by "How to Print Floating-Point Numbers Accurately" by</span> <span class="hl com"> * Guy L. Steele, Jr. and Jon L. White [Proc. ACM SIGPLAN '90, pp. 112-126].</span> <span class="hl com"> *</span> <span class="hl com"> * Modifications:</span> <span class="hl com"> * 1. Rather than iterating, we use a simple numeric overestimate</span> <span class="hl com"> * to determine k = floor(log10(d)). We scale relevant</span> <span class="hl com"> * quantities using O(log2(k)) rather than O(k) multiplications.</span> <span class="hl com"> * 2. For some modes > 2 (corresponding to ecvt and fcvt), we don't</span> <span class="hl com"> * try to generate digits strictly left to right. Instead, we</span> <span class="hl com"> * compute with fewer bits and propagate the carry if necessary</span> <span class="hl com"> * when rounding the final digit up. This is often faster.</span> <span class="hl com"> * 3. Under the assumption that input will be rounded nearest,</span> <span class="hl com"> * mode 0 renders 1e23 as 1e23 rather than 9.999999999999999e22.</span> <span class="hl com"> * That is, we allow equality in stopping tests when the</span> <span class="hl com"> * round-nearest rule will give the same floating-point value</span> <span class="hl com"> * as would satisfaction of the stopping test with strict</span> <span class="hl com"> * inequality.</span> <span class="hl com"> * 4. We remove common factors of powers of 2 from relevant</span> <span class="hl com"> * quantities.</span> <span class="hl com"> * 5. When converting floating-point integers less than 1e16,</span> <span class="hl com"> * we use floating-point arithmetic rather than resorting</span> <span class="hl com"> * to multiple-precision integers.</span> <span class="hl com"> * 6. When asked to produce fewer than 15 digits, we first try</span> <span class="hl com"> * to get by with floating-point arithmetic; we resort to</span> <span class="hl com"> * multiple-precision integer arithmetic only if we cannot</span> <span class="hl com"> * guarantee that the floating-point calculation has given</span> <span class="hl com"> * the correctly rounded result. For k requested digits and</span> <span class="hl com"> * "uniformly" distributed input, the probability is</span> <span class="hl com"> * something like 10^(k-15) that we must resort to the Long</span> <span class="hl com"> * calculation.</span> <span class="hl com"> */</span> <span class="hl com">/* Additional notes (METD): (1) returns NULL on failure. (2) to avoid memory</span> <span class="hl com"> leakage, a successful call to _Py_dg_dtoa should always be matched by a</span> <span class="hl com"> call to _Py_dg_freedtoa. */</span> <span class="hl kwb">char</span> <span class="hl opt">*</span> <span class="hl kwd">_Py_dg_dtoa</span><span class="hl opt">(</span><span class="hl kwb">double</span> dd<span class="hl opt">,</span> <span class="hl kwb">int</span> mode<span class="hl opt">,</span> <span class="hl kwb">int</span> ndigits<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>decpt<span class="hl opt">,</span> <span class="hl kwb">int</span> <span class="hl opt">*</span>sign<span class="hl opt">,</span> <span class="hl kwb">char</span> <span class="hl opt">**</span>rve<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl com">/* Arguments ndigits, decpt, sign are similar to those</span> <span class="hl com"> of ecvt and fcvt; trailing zeros are suppressed from</span> <span class="hl com"> the returned string. If not null, *rve is set to point</span> <span class="hl com"> to the end of the return value. If d is +-Infinity or NaN,</span> <span class="hl com"> then *decpt is set to 9999.</span> <span class="hl com"></span> <span class="hl com"> mode:</span> <span class="hl com"> 0 ==> shortest string that yields d when read in</span> <span class="hl com"> and rounded to nearest.</span> <span class="hl com"> 1 ==> like 0, but with Steele & White stopping rule;</span> <span class="hl com"> e.g. with IEEE P754 arithmetic , mode 0 gives</span> <span class="hl com"> 1e23 whereas mode 1 gives 9.999999999999999e22.</span> <span class="hl com"> 2 ==> max(1,ndigits) significant digits. This gives a</span> <span class="hl com"> return value similar to that of ecvt, except</span> <span class="hl com"> that trailing zeros are suppressed.</span> <span class="hl com"> 3 ==> through ndigits past the decimal point. This</span> <span class="hl com"> gives a return value similar to that from fcvt,</span> <span class="hl com"> except that trailing zeros are suppressed, and</span> <span class="hl com"> ndigits can be negative.</span> <span class="hl com"> 4,5 ==> similar to 2 and 3, respectively, but (in</span> <span class="hl com"> round-nearest mode) with the tests of mode 0 to</span> <span class="hl com"> possibly return a shorter string that rounds to d.</span> <span class="hl com"> With IEEE arithmetic and compilation with</span> <span class="hl com"> -DHonor_FLT_ROUNDS, modes 4 and 5 behave the same</span> <span class="hl com"> as modes 2 and 3 when FLT_ROUNDS != 1.</span> <span class="hl com"> 6-9 ==> Debugging modes similar to mode - 4: don't try</span> <span class="hl com"> fast floating-point estimate (if applicable).</span> <span class="hl com"></span> <span class="hl com"> Values of mode other than 0-9 are treated as mode 0.</span> <span class="hl com"></span> <span class="hl com"> Sufficient space is allocated to the return value</span> <span class="hl com"> to hold the suppressed trailing zeros.</span> <span class="hl com"> */</span> <span class="hl kwb">int</span> bbits<span class="hl opt">,</span> b2<span class="hl opt">,</span> b5<span class="hl opt">,</span> be<span class="hl opt">,</span> dig<span class="hl opt">,</span> i<span class="hl opt">,</span> ieps<span class="hl opt">,</span> ilim<span class="hl opt">,</span> ilim0<span class="hl opt">,</span> ilim1<span class="hl opt">,</span> j<span class="hl opt">,</span> j1<span class="hl opt">,</span> k<span class="hl opt">,</span> k0<span class="hl opt">,</span> k_check<span class="hl opt">,</span> leftright<span class="hl opt">,</span> m2<span class="hl opt">,</span> m5<span class="hl opt">,</span> s2<span class="hl opt">,</span> s5<span class="hl opt">,</span> spec_case<span class="hl opt">,</span> try_quick<span class="hl opt">;</span> Long L<span class="hl opt">;</span> <span class="hl kwb">int</span> denorm<span class="hl opt">;</span> ULong x<span class="hl opt">;</span> Bigint <span class="hl opt">*</span>b<span class="hl opt">, *</span>b1<span class="hl opt">, *</span>delta<span class="hl opt">, *</span>mlo<span class="hl opt">, *</span>mhi<span class="hl opt">, *</span>S<span class="hl opt">;</span> U d2<span class="hl opt">,</span> eps<span class="hl opt">,</span> u<span class="hl opt">;</span> <span class="hl kwb">double</span> ds<span class="hl opt">;</span> <span class="hl kwb">char</span> <span class="hl opt">*</span>s<span class="hl opt">, *</span>s0<span class="hl opt">;</span> <span class="hl com">/* set pointers to NULL, to silence gcc compiler warnings and make</span> <span class="hl com"> cleanup easier on error */</span> mlo <span class="hl opt">=</span> mhi <span class="hl opt">=</span> S <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> s0 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> u<span class="hl opt">.</span>d <span class="hl opt">=</span> dd<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> Sign_bit<span class="hl opt">) {</span> <span class="hl com">/* set sign for everything, including 0's and NaNs */</span> <span class="hl opt">*</span>sign <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) &= ~</span>Sign_bit<span class="hl opt">;</span> <span class="hl com">/* clear sign bit */</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">*</span>sign <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* quick return for Infinities, NaNs and zeros */</span> <span class="hl kwa">if</span> <span class="hl opt">((</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> Exp_mask<span class="hl opt">) ==</span> Exp_mask<span class="hl opt">)</span> <span class="hl opt">{</span> <span class="hl com">/* Infinity or NaN */</span> <span class="hl opt">*</span>decpt <span class="hl opt">=</span> <span class="hl num">9999</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) && !(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> <span class="hl num">0xfffff</span><span class="hl opt">))</span> <span class="hl kwa">return</span> <span class="hl kwd">nrv_alloc</span><span class="hl opt">(</span><span class="hl str">"Infinity"</span><span class="hl opt">,</span> rve<span class="hl opt">,</span> <span class="hl num">8</span><span class="hl opt">);</span> <span class="hl kwa">return</span> <span class="hl kwd">nrv_alloc</span><span class="hl opt">(</span><span class="hl str">"NaN"</span><span class="hl opt">,</span> rve<span class="hl opt">,</span> <span class="hl num">3</span><span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">)) {</span> <span class="hl opt">*</span>decpt <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">return</span> <span class="hl kwd">nrv_alloc</span><span class="hl opt">(</span><span class="hl str">"0"</span><span class="hl opt">,</span> rve<span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl opt">}</span> <span class="hl com">/* compute k = floor(log10(d)). The computation may leave k</span> <span class="hl com"> one too large, but should never leave k too small. */</span> b <span class="hl opt">=</span> <span class="hl kwd">d2b</span><span class="hl opt">(&</span>u<span class="hl opt">, &</span>be<span class="hl opt">, &</span>bbits<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>i <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) >></span> Exp_shift1 <span class="hl opt">& (</span>Exp_mask<span class="hl opt">>></span>Exp_shift1<span class="hl opt">)))) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>d2<span class="hl opt">) =</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">);</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d2<span class="hl opt">) &=</span> Frac_mask1<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d2<span class="hl opt">) |=</span> Exp_11<span class="hl opt">;</span> <span class="hl com">/* log(x) ~=~ log(1.5) + (x-1.5)/1.5</span> <span class="hl com"> * log10(x) = log(x) / log(10)</span> <span class="hl com"> * ~=~ log(1.5)/log(10) + (x-1.5)/(1.5*log(10))</span> <span class="hl com"> * log10(d) = (i-Bias)*log(2)/log(10) + log10(d2)</span> <span class="hl com"> *</span> <span class="hl com"> * This suggests computing an approximation k to log10(d) by</span> <span class="hl com"> *</span> <span class="hl com"> * k = (i - Bias)*0.301029995663981</span> <span class="hl com"> * + ( (d2-1.5)*0.289529654602168 + 0.176091259055681 );</span> <span class="hl com"> *</span> <span class="hl com"> * We want k to be too large rather than too small.</span> <span class="hl com"> * The error in the first-order Taylor series approximation</span> <span class="hl com"> * is in our favor, so we just round up the constant enough</span> <span class="hl com"> * to compensate for any error in the multiplication of</span> <span class="hl com"> * (i - Bias) by 0.301029995663981; since |i - Bias| <= 1077,</span> <span class="hl com"> * and 1077 * 0.30103 * 2^-52 ~=~ 7.2e-14,</span> <span class="hl com"> * adding 1e-13 to the constant term more than suffices.</span> <span class="hl com"> * Hence we adjust the constant term to 0.1760912590558.</span> <span class="hl com"> * (We could get a more accurate k by invoking log10,</span> <span class="hl com"> * but this is probably not worthwhile.)</span> <span class="hl com"> */</span> i <span class="hl opt">-=</span> Bias<span class="hl opt">;</span> denorm <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl com">/* d is denormalized */</span> i <span class="hl opt">=</span> bbits <span class="hl opt">+</span> be <span class="hl opt">+ (</span>Bias <span class="hl opt">+ (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">);</span> x <span class="hl opt">=</span> i <span class="hl opt">></span> <span class="hl num">32</span> ? <span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) << (</span><span class="hl num">64</span> <span class="hl opt">-</span> i<span class="hl opt">) |</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) >> (</span>i <span class="hl opt">-</span> <span class="hl num">32</span><span class="hl opt">)</span> <span class="hl opt">:</span> <span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) << (</span><span class="hl num">32</span> <span class="hl opt">-</span> i<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>d2<span class="hl opt">) =</span> x<span class="hl opt">;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>d2<span class="hl opt">) -=</span> <span class="hl num">31</span><span class="hl opt">*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl com">/* adjust exponent */</span> i <span class="hl opt">-= (</span>Bias <span class="hl opt">+ (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) -</span> <span class="hl num">1</span><span class="hl opt">) +</span> <span class="hl num">1</span><span class="hl opt">;</span> denorm <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> ds <span class="hl opt">= (</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>d2<span class="hl opt">)-</span><span class="hl num">1.5</span><span class="hl opt">)*</span><span class="hl num">0.289529654602168</span> <span class="hl opt">+</span> <span class="hl num">0.1760912590558</span> <span class="hl opt">+</span> i<span class="hl opt">*</span><span class="hl num">0.301029995663981</span><span class="hl opt">;</span> k <span class="hl opt">= (</span><span class="hl kwb">int</span><span class="hl opt">)</span>ds<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ds <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">. &&</span> ds <span class="hl opt">!=</span> k<span class="hl opt">)</span> k<span class="hl opt">--;</span> <span class="hl com">/* want k = floor(ds) */</span> k_check <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">>=</span> <span class="hl num">0</span> <span class="hl opt">&&</span> k <span class="hl opt"><=</span> Ten_pmax<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <</span> tens<span class="hl opt">[</span>k<span class="hl opt">])</span> k<span class="hl opt">--;</span> k_check <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> j <span class="hl opt">=</span> bbits <span class="hl opt">-</span> i <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">>=</span> <span class="hl num">0</span><span class="hl opt">) {</span> b2 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> s2 <span class="hl opt">=</span> j<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> b2 <span class="hl opt">= -</span>j<span class="hl opt">;</span> s2 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">>=</span> <span class="hl num">0</span><span class="hl opt">) {</span> b5 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> s5 <span class="hl opt">=</span> k<span class="hl opt">;</span> s2 <span class="hl opt">+=</span> k<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> b2 <span class="hl opt">-=</span> k<span class="hl opt">;</span> b5 <span class="hl opt">= -</span>k<span class="hl opt">;</span> s5 <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mode <span class="hl opt"><</span> <span class="hl num">0</span> <span class="hl opt">||</span> mode <span class="hl opt">></span> <span class="hl num">9</span><span class="hl opt">)</span> mode <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> try_quick <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mode <span class="hl opt">></span> <span class="hl num">5</span><span class="hl opt">) {</span> mode <span class="hl opt">-=</span> <span class="hl num">4</span><span class="hl opt">;</span> try_quick <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">}</span> leftright <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> ilim <span class="hl opt">=</span> ilim1 <span class="hl opt">= -</span><span class="hl num">1</span><span class="hl opt">;</span> <span class="hl com">/* Values for cases 0 and 1; done here to */</span> <span class="hl com">/* silence erroneous "gcc -Wall" warning. */</span> <span class="hl kwa">switch</span><span class="hl opt">(</span>mode<span class="hl opt">) {</span> <span class="hl kwa">case</span> <span class="hl num">0</span><span class="hl opt">:</span> <span class="hl kwa">case</span> <span class="hl num">1</span><span class="hl opt">:</span> i <span class="hl opt">=</span> <span class="hl num">18</span><span class="hl opt">;</span> ndigits <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">case</span> <span class="hl num">2</span><span class="hl opt">:</span> leftright <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* no break */</span> <span class="hl kwa">case</span> <span class="hl num">4</span><span class="hl opt">:</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ndigits <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">)</span> ndigits <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> ilim <span class="hl opt">=</span> ilim1 <span class="hl opt">=</span> i <span class="hl opt">=</span> ndigits<span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwa">case</span> <span class="hl num">3</span><span class="hl opt">:</span> leftright <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl com">/* no break */</span> <span class="hl kwa">case</span> <span class="hl num">5</span><span class="hl opt">:</span> i <span class="hl opt">=</span> ndigits <span class="hl opt">+</span> k <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">;</span> ilim <span class="hl opt">=</span> i<span class="hl opt">;</span> ilim1 <span class="hl opt">=</span> i <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">)</span> i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> s0 <span class="hl opt">=</span> <span class="hl kwd">rv_alloc</span><span class="hl opt">(</span>i<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s0 <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> s <span class="hl opt">=</span> s0<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim <span class="hl opt">>=</span> <span class="hl num">0</span> <span class="hl opt">&&</span> ilim <span class="hl opt"><=</span> Quick_max <span class="hl opt">&&</span> try_quick<span class="hl opt">) {</span> <span class="hl com">/* Try to get by with floating-point arithmetic. */</span> i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>d2<span class="hl opt">) =</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">);</span> k0 <span class="hl opt">=</span> k<span class="hl opt">;</span> ilim0 <span class="hl opt">=</span> ilim<span class="hl opt">;</span> ieps <span class="hl opt">=</span> <span class="hl num">2</span><span class="hl opt">;</span> <span class="hl com">/* conservative */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> ds <span class="hl opt">=</span> tens<span class="hl opt">[</span>k<span class="hl opt">&</span><span class="hl num">0xf</span><span class="hl opt">];</span> j <span class="hl opt">=</span> k <span class="hl opt">>></span> <span class="hl num">4</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">&</span> Bletch<span class="hl opt">) {</span> <span class="hl com">/* prevent overflows */</span> j <span class="hl opt">&=</span> Bletch <span class="hl opt">-</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) /=</span> bigtens<span class="hl opt">[</span>n_bigtens<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">];</span> ieps<span class="hl opt">++;</span> <span class="hl opt">}</span> <span class="hl kwa">for</span><span class="hl opt">(;</span> j<span class="hl opt">;</span> j <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">,</span> i<span class="hl opt">++)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">) {</span> ieps<span class="hl opt">++;</span> ds <span class="hl opt">*=</span> bigtens<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl opt">}</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) /=</span> ds<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else if</span> <span class="hl opt">((</span>j1 <span class="hl opt">= -</span>k<span class="hl opt">)) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>j1 <span class="hl opt">&</span> <span class="hl num">0xf</span><span class="hl opt">];</span> <span class="hl kwa">for</span><span class="hl opt">(</span>j <span class="hl opt">=</span> j1 <span class="hl opt">>></span> <span class="hl num">4</span><span class="hl opt">;</span> j<span class="hl opt">;</span> j <span class="hl opt">>>=</span> <span class="hl num">1</span><span class="hl opt">,</span> i<span class="hl opt">++)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">) {</span> ieps<span class="hl opt">++;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> bigtens<span class="hl opt">[</span>i<span class="hl opt">];</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k_check <span class="hl opt">&&</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <</span> <span class="hl num">1</span><span class="hl opt">. &&</span> ilim <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim1 <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">)</span> <span class="hl kwa">goto</span> fast_failed<span class="hl opt">;</span> ilim <span class="hl opt">=</span> ilim1<span class="hl opt">;</span> k<span class="hl opt">--;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> <span class="hl num">10</span><span class="hl opt">.;</span> ieps<span class="hl opt">++;</span> <span class="hl opt">}</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">) =</span> ieps<span class="hl opt">*</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) +</span> <span class="hl num">7</span><span class="hl opt">.;</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>eps<span class="hl opt">) -= (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">)*</span>Exp_msk1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim <span class="hl opt">==</span> <span class="hl num">0</span><span class="hl opt">) {</span> S <span class="hl opt">=</span> mhi <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) -=</span> <span class="hl num">5</span><span class="hl opt">.;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) ></span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">))</span> <span class="hl kwa">goto</span> one_digit<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) < -</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">))</span> <span class="hl kwa">goto</span> no_digits<span class="hl opt">;</span> <span class="hl kwa">goto</span> fast_failed<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>leftright<span class="hl opt">) {</span> <span class="hl com">/* Use Steele & White method of only</span> <span class="hl com"> * generating digits needed.</span> <span class="hl com"> */</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">) =</span> <span class="hl num">0.5</span><span class="hl opt">/</span>tens<span class="hl opt">[</span>ilim<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">] -</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">);</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;;) {</span> L <span class="hl opt">= (</span>Long<span class="hl opt">)</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) -=</span> L<span class="hl opt">;</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'0'</span> <span class="hl opt">+ (</span><span class="hl kwb">int</span><span class="hl opt">)</span>L<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">))</span> <span class="hl kwa">goto</span> ret1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">. -</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">))</span> <span class="hl kwa">goto</span> bump_up<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(++</span>i <span class="hl opt">>=</span> ilim<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">) *=</span> <span class="hl num">10</span><span class="hl opt">.;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> <span class="hl num">10</span><span class="hl opt">.;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl com">/* Generate ilim digits, then fix them up. */</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">) *=</span> tens<span class="hl opt">[</span>ilim<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">];</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;;</span> i<span class="hl opt">++,</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> <span class="hl num">10</span><span class="hl opt">.) {</span> L <span class="hl opt">= (</span>Long<span class="hl opt">)(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">));</span> <span class="hl kwa">if</span> <span class="hl opt">(!(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) -=</span> L<span class="hl opt">))</span> ilim <span class="hl opt">=</span> i<span class="hl opt">;</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'0'</span> <span class="hl opt">+ (</span><span class="hl kwb">int</span><span class="hl opt">)</span>L<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">==</span> ilim<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) ></span> <span class="hl num">0.5</span> <span class="hl opt">+</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">))</span> <span class="hl kwa">goto</span> bump_up<span class="hl opt">;</span> <span class="hl kwa">else if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <</span> <span class="hl num">0.5</span> <span class="hl opt">-</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>eps<span class="hl opt">)) {</span> <span class="hl kwa">while</span><span class="hl opt">(*--</span>s <span class="hl opt">==</span> <span class="hl str">'0'</span><span class="hl opt">);</span> s<span class="hl opt">++;</span> <span class="hl kwa">goto</span> ret1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">}</span> fast_failed<span class="hl opt">:</span> s <span class="hl opt">=</span> s0<span class="hl opt">;</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) =</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>d2<span class="hl opt">);</span> k <span class="hl opt">=</span> k0<span class="hl opt">;</span> ilim <span class="hl opt">=</span> ilim0<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Do we have a "small" integer? */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>be <span class="hl opt">>=</span> <span class="hl num">0</span> <span class="hl opt">&&</span> k <span class="hl opt"><=</span> Int_max<span class="hl opt">) {</span> <span class="hl com">/* Yes. */</span> ds <span class="hl opt">=</span> tens<span class="hl opt">[</span>k<span class="hl opt">];</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ndigits <span class="hl opt"><</span> <span class="hl num">0</span> <span class="hl opt">&&</span> ilim <span class="hl opt"><=</span> <span class="hl num">0</span><span class="hl opt">) {</span> S <span class="hl opt">=</span> mhi <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim <span class="hl opt"><</span> <span class="hl num">0</span> <span class="hl opt">||</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) <=</span> <span class="hl num">5</span><span class="hl opt">*</span>ds<span class="hl opt">)</span> <span class="hl kwa">goto</span> no_digits<span class="hl opt">;</span> <span class="hl kwa">goto</span> one_digit<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;;</span> i<span class="hl opt">++,</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) *=</span> <span class="hl num">10</span><span class="hl opt">.) {</span> L <span class="hl opt">= (</span>Long<span class="hl opt">)(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) /</span> ds<span class="hl opt">);</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) -=</span> L<span class="hl opt">*</span>ds<span class="hl opt">;</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'0'</span> <span class="hl opt">+ (</span><span class="hl kwb">int</span><span class="hl opt">)</span>L<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">)) {</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">==</span> ilim<span class="hl opt">) {</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) +=</span> <span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) ></span> ds <span class="hl opt">|| (</span><span class="hl kwd">dval</span><span class="hl opt">(&</span>u<span class="hl opt">) ==</span> ds <span class="hl opt">&&</span> L <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)) {</span> bump_up<span class="hl opt">:</span> <span class="hl kwa">while</span><span class="hl opt">(*--</span>s <span class="hl opt">==</span> <span class="hl str">'9'</span><span class="hl opt">)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s <span class="hl opt">==</span> s0<span class="hl opt">) {</span> k<span class="hl opt">++;</span> <span class="hl opt">*</span>s <span class="hl opt">=</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">++*</span>s<span class="hl opt">++;</span> <span class="hl opt">}</span> <span class="hl kwa">break</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">goto</span> ret1<span class="hl opt">;</span> <span class="hl opt">}</span> m2 <span class="hl opt">=</span> b2<span class="hl opt">;</span> m5 <span class="hl opt">=</span> b5<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>leftright<span class="hl opt">) {</span> i <span class="hl opt">=</span> denorm ? be <span class="hl opt">+ (</span>Bias <span class="hl opt">+ (</span>P<span class="hl opt">-</span><span class="hl num">1</span><span class="hl opt">) -</span> <span class="hl num">1</span> <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">) :</span> <span class="hl num">1</span> <span class="hl opt">+</span> P <span class="hl opt">-</span> bbits<span class="hl opt">;</span> b2 <span class="hl opt">+=</span> i<span class="hl opt">;</span> s2 <span class="hl opt">+=</span> i<span class="hl opt">;</span> mhi <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>m2 <span class="hl opt">></span> <span class="hl num">0</span> <span class="hl opt">&&</span> s2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> i <span class="hl opt">=</span> m2 <span class="hl opt"><</span> s2 ? m2 <span class="hl opt">:</span> s2<span class="hl opt">;</span> b2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> m2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> s2 <span class="hl opt">-=</span> i<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>leftright<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>m5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> mhi <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> m5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> b1 <span class="hl opt">=</span> <span class="hl kwd">mult</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> b<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> b <span class="hl opt">=</span> b1<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>j <span class="hl opt">=</span> b5 <span class="hl opt">-</span> m5<span class="hl opt">)) {</span> b <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>b<span class="hl opt">,</span> j<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> b <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>b<span class="hl opt">,</span> b5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> S <span class="hl opt">=</span> <span class="hl kwd">i2b</span><span class="hl opt">(</span><span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>S <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s5 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> S <span class="hl opt">=</span> <span class="hl kwd">pow5mult</span><span class="hl opt">(</span>S<span class="hl opt">,</span> s5<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>S <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Check for special case that d is a normalized power of 2. */</span> spec_case <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>mode <span class="hl opt"><</span> <span class="hl num">2</span> <span class="hl opt">||</span> leftright<span class="hl opt">)</span> <span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) && !(</span><span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> Bndry_mask<span class="hl opt">)</span> <span class="hl opt">&&</span> <span class="hl kwd">word0</span><span class="hl opt">(&</span>u<span class="hl opt">) & (</span>Exp_mask <span class="hl opt">& ~</span>Exp_msk1<span class="hl opt">)</span> <span class="hl opt">) {</span> <span class="hl com">/* The special case */</span> b2 <span class="hl opt">+=</span> Log2P<span class="hl opt">;</span> s2 <span class="hl opt">+=</span> Log2P<span class="hl opt">;</span> spec_case <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl com">/* Arrange for convenient computation of quotients:</span> <span class="hl com"> * shift left if necessary so divisor has 4 leading 0 bits.</span> <span class="hl com"> *</span> <span class="hl com"> * Perhaps we should just compute leading 28 bits of S once</span> <span class="hl com"> * and for all and pass them and a shift to quorem, so it</span> <span class="hl com"> * can do shifts and ors to compute the numerator for q.</span> <span class="hl com"> */</span> <span class="hl ppc">#define iInc 28</span> i <span class="hl opt">=</span> <span class="hl kwd">dshift</span><span class="hl opt">(</span>S<span class="hl opt">,</span> s2<span class="hl opt">);</span> b2 <span class="hl opt">+=</span> i<span class="hl opt">;</span> m2 <span class="hl opt">+=</span> i<span class="hl opt">;</span> s2 <span class="hl opt">+=</span> i<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> b <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>b<span class="hl opt">,</span> b2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> S <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>S<span class="hl opt">,</span> s2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>S <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>k_check<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span>S<span class="hl opt">) <</span> <span class="hl num">0</span><span class="hl opt">) {</span> k<span class="hl opt">--;</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl com">/* we botched the k estimate */</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>leftright<span class="hl opt">) {</span> mhi <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> ilim <span class="hl opt">=</span> ilim1<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim <span class="hl opt"><=</span> <span class="hl num">0</span> <span class="hl opt">&& (</span>mode <span class="hl opt">==</span> <span class="hl num">3</span> <span class="hl opt">||</span> mode <span class="hl opt">==</span> <span class="hl num">5</span><span class="hl opt">)) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>ilim <span class="hl opt"><</span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl com">/* no digits, fcvt style */</span> no_digits<span class="hl opt">:</span> k <span class="hl opt">= -</span><span class="hl num">1</span> <span class="hl opt">-</span> ndigits<span class="hl opt">;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> S <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>S<span class="hl opt">,</span> <span class="hl num">5</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>S <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span><span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> S<span class="hl opt">) <=</span> <span class="hl num">0</span><span class="hl opt">)</span> <span class="hl kwa">goto</span> no_digits<span class="hl opt">;</span> <span class="hl opt">}</span> one_digit<span class="hl opt">:</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'1'</span><span class="hl opt">;</span> k<span class="hl opt">++;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>leftright<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>m2 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> mhi <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> m2<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Compute mlo -- check for special case</span> <span class="hl com"> * that d is a normalized power of 2.</span> <span class="hl com"> */</span> mlo <span class="hl opt">=</span> mhi<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>spec_case<span class="hl opt">) {</span> mhi <span class="hl opt">=</span> <span class="hl kwd">Balloc</span><span class="hl opt">(</span>mhi<span class="hl opt">-></span>k<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwd">Bcopy</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> mlo<span class="hl opt">);</span> mhi <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> Log2P<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;;</span>i<span class="hl opt">++) {</span> dig <span class="hl opt">=</span> <span class="hl kwd">quorem</span><span class="hl opt">(</span>b<span class="hl opt">,</span>S<span class="hl opt">) +</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl com">/* Do we yet have the shortest decimal string</span> <span class="hl com"> * that will round to d?</span> <span class="hl com"> */</span> j <span class="hl opt">=</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> mlo<span class="hl opt">);</span> delta <span class="hl opt">=</span> <span class="hl kwd">diff</span><span class="hl opt">(</span>S<span class="hl opt">,</span> mhi<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>delta <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> j1 <span class="hl opt">=</span> delta<span class="hl opt">-></span>sign ? <span class="hl num">1</span> <span class="hl opt">:</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> delta<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>delta<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j1 <span class="hl opt">==</span> <span class="hl num">0</span> <span class="hl opt">&&</span> mode <span class="hl opt">!=</span> <span class="hl num">1</span> <span class="hl opt">&& !(</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dig <span class="hl opt">==</span> <span class="hl str">'9'</span><span class="hl opt">)</span> <span class="hl kwa">goto</span> round_9_up<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">)</span> dig<span class="hl opt">++;</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> dig<span class="hl opt">;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt"><</span> <span class="hl num">0</span> <span class="hl opt">|| (</span>j <span class="hl opt">==</span> <span class="hl num">0</span> <span class="hl opt">&&</span> mode <span class="hl opt">!=</span> <span class="hl num">1</span> <span class="hl opt">&& !(</span><span class="hl kwd">word1</span><span class="hl opt">(&</span>u<span class="hl opt">) &</span> <span class="hl num">1</span><span class="hl opt">)</span> <span class="hl opt">)) {</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> b<span class="hl opt">-></span>wds <span class="hl opt"><=</span> <span class="hl num">1</span><span class="hl opt">) {</span> <span class="hl kwa">goto</span> accept_dig<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j1 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> b <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> j1 <span class="hl opt">=</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> S<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">((</span>j1 <span class="hl opt">></span> <span class="hl num">0</span> <span class="hl opt">|| (</span>j1 <span class="hl opt">==</span> <span class="hl num">0</span> <span class="hl opt">&&</span> dig <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">))</span> <span class="hl opt">&&</span> dig<span class="hl opt">++ ==</span> <span class="hl str">'9'</span><span class="hl opt">)</span> <span class="hl kwa">goto</span> round_9_up<span class="hl opt">;</span> <span class="hl opt">}</span> accept_dig<span class="hl opt">:</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> dig<span class="hl opt">;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j1 <span class="hl opt">></span> <span class="hl num">0</span><span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>dig <span class="hl opt">==</span> <span class="hl str">'9'</span><span class="hl opt">) {</span> <span class="hl com">/* possible if i == 1 */</span> round_9_up<span class="hl opt">:</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'9'</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> roundoff<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> dig <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> dig<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">==</span> ilim<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mlo <span class="hl opt">==</span> mhi<span class="hl opt">) {</span> mlo <span class="hl opt">=</span> mhi <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mlo <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> mlo <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>mlo<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mlo <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> mhi <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>mhi<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl kwa">for</span><span class="hl opt">(</span>i <span class="hl opt">=</span> <span class="hl num">1</span><span class="hl opt">;;</span> i<span class="hl opt">++) {</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> dig <span class="hl opt">=</span> <span class="hl kwd">quorem</span><span class="hl opt">(</span>b<span class="hl opt">,</span>S<span class="hl opt">) +</span> <span class="hl str">'0'</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(!</span>b<span class="hl opt">-></span>x<span class="hl opt">[</span><span class="hl num">0</span><span class="hl opt">] &&</span> b<span class="hl opt">-></span>wds <span class="hl opt"><=</span> <span class="hl num">1</span><span class="hl opt">) {</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>i <span class="hl opt">>=</span> ilim<span class="hl opt">)</span> <span class="hl kwa">break</span><span class="hl opt">;</span> b <span class="hl opt">=</span> <span class="hl kwd">multadd</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">10</span><span class="hl opt">,</span> <span class="hl num">0</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl com">/* Round off last digit */</span> b <span class="hl opt">=</span> <span class="hl kwd">lshift</span><span class="hl opt">(</span>b<span class="hl opt">,</span> <span class="hl num">1</span><span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b <span class="hl opt">==</span> NULL<span class="hl opt">)</span> <span class="hl kwa">goto</span> failed_malloc<span class="hl opt">;</span> j <span class="hl opt">=</span> <span class="hl kwd">cmp</span><span class="hl opt">(</span>b<span class="hl opt">,</span> S<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>j <span class="hl opt">></span> <span class="hl num">0</span> <span class="hl opt">|| (</span>j <span class="hl opt">==</span> <span class="hl num">0</span> <span class="hl opt">&&</span> dig <span class="hl opt">&</span> <span class="hl num">1</span><span class="hl opt">)) {</span> roundoff<span class="hl opt">:</span> <span class="hl kwa">while</span><span class="hl opt">(*--</span>s <span class="hl opt">==</span> <span class="hl str">'9'</span><span class="hl opt">)</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s <span class="hl opt">==</span> s0<span class="hl opt">) {</span> k<span class="hl opt">++;</span> <span class="hl opt">*</span>s<span class="hl opt">++ =</span> <span class="hl str">'1'</span><span class="hl opt">;</span> <span class="hl kwa">goto</span> ret<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl opt">++*</span>s<span class="hl opt">++;</span> <span class="hl opt">}</span> <span class="hl kwa">else</span> <span class="hl opt">{</span> <span class="hl kwa">while</span><span class="hl opt">(*--</span>s <span class="hl opt">==</span> <span class="hl str">'0'</span><span class="hl opt">);</span> s<span class="hl opt">++;</span> <span class="hl opt">}</span> ret<span class="hl opt">:</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>S<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi<span class="hl opt">) {</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mlo <span class="hl opt">&&</span> mlo <span class="hl opt">!=</span> mhi<span class="hl opt">)</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>mlo<span class="hl opt">);</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>mhi<span class="hl opt">);</span> <span class="hl opt">}</span> ret1<span class="hl opt">:</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl opt">*</span>s <span class="hl opt">=</span> <span class="hl num">0</span><span class="hl opt">;</span> <span class="hl opt">*</span>decpt <span class="hl opt">=</span> k <span class="hl opt">+</span> <span class="hl num">1</span><span class="hl opt">;</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>rve<span class="hl opt">)</span> <span class="hl opt">*</span>rve <span class="hl opt">=</span> s<span class="hl opt">;</span> <span class="hl kwa">return</span> s0<span class="hl opt">;</span> failed_malloc<span class="hl opt">:</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>S<span class="hl opt">)</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>S<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mlo <span class="hl opt">&&</span> mlo <span class="hl opt">!=</span> mhi<span class="hl opt">)</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>mlo<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>mhi<span class="hl opt">)</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>mhi<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>b<span class="hl opt">)</span> <span class="hl kwd">Bfree</span><span class="hl opt">(</span>b<span class="hl opt">);</span> <span class="hl kwa">if</span> <span class="hl opt">(</span>s0<span class="hl opt">)</span> <span class="hl kwd">_Py_dg_freedtoa</span><span class="hl opt">(</span>s0<span class="hl opt">);</span> <span class="hl kwa">return</span> NULL<span class="hl opt">;</span> <span class="hl opt">}</span> <span class="hl ppc">#ifdef __cplusplus</span> <span class="hl opt">}</span> <span class="hl ppc">#endif</span> <span class="hl ppc">#endif</span> <span class="hl com">/* PY_NO_SHORT_FLOAT_REPR */</span><span class="hl ppc"></span> </code></pre></td></tr></table> </div> <!-- class=content --> <div class='footer'>generated by <a href='http://git.zx2c4.com/cgit/about/'>cgit v0.12</a> at 2025-02-26 18:15:49 (GMT)</div> </div> <!-- id=cgit --> </body> </html>