($0,$1,$2)
| 56126 | return ($17|0); |
| 56127 | } |
| 56128 | function _backupUpdate($0,$1,$2) { |
| 56129 | $0 = $0|0; |
| 56130 | $1 = $1|0; |
| 56131 | $2 = $2|0; |
| 56132 | var $$0 = 0, $$clear = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, $switch$cast$i = 0, $switch$cast$i$clear = 0, $switch$downshift$i = 0, label = 0, sp = 0; |
| 56133 | sp = STACKTOP; |
| 56134 | $$0 = $0; |
| 56135 | while(1) { |
| 56136 | $3 = ((($$0)) + 28|0); |
| 56137 | $4 = HEAP32[$3>>2]|0; |
| 56138 | $5 = ($4>>>0)<(7); |
| 56139 | if ($5) { |
| 56140 | $switch$cast$i = $4&255; |
| 56141 | $switch$cast$i$clear = $switch$cast$i & 127; |
| 56142 | $switch$downshift$i = (30&255) >>> $switch$cast$i$clear; |
| 56143 | $6 = $switch$downshift$i & 1; |
| 56144 | $$clear = $6 & 127; |
| 56145 | $7 = ($$clear<<24>>24)==(0); |
| 56146 | if ($7) { |
| 56147 | $8 = ((($$0)) + 16|0); |
| 56148 | $9 = HEAP32[$8>>2]|0; |
| 56149 | $10 = ($9>>>0)>($1>>>0); |
| 56150 | if ($10) { |
| 56151 | $11 = (_backupOnePage($$0,$1,$2,1)|0); |
| 56152 | $12 = ($11|0)==(0); |
| 56153 | if (!($12)) { |
| 56154 | HEAP32[$3>>2] = $11; |
| 56155 | } |
| 56156 | } |
| 56157 | } |
| 56158 | } |
| 56159 | $13 = ((($$0)) + 44|0); |
| 56160 | $14 = HEAP32[$13>>2]|0; |
| 56161 | $15 = ($14|0)==(0|0); |
| 56162 | if ($15) { |
| 56163 | break; |
| 56164 | } else { |
| 56165 | $$0 = $14; |
| 56166 | } |
| 56167 | } |
| 56168 | return; |
| 56169 | } |
| 56170 | function _sqlite3PcacheRelease($0) { |
| 56171 | $0 = $0|0; |
| 56172 | var $$pre = 0, $$pre$phi4Z2D = 0, $$pre$phi5Z2D = 0, $$pre$phi7Z2D = 0, $$sink$i = 0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0; |
no test coverage detected
searching dependent graphs…