($0)
| 22458 | return; |
| 22459 | } |
| 22460 | function _pcache1Destroy($0) { |
| 22461 | $0 = $0|0; |
| 22462 | var $$032$i = 0, $$032$ph$i = 0, $$034$ph$i = 0, $$phi$trans$insert = 0, $$pre = 0, $1 = 0, $10 = 0, $100 = 0, $101 = 0, $102 = 0, $103 = 0, $104 = 0, $105 = 0, $106 = 0, $107 = 0, $108 = 0, $109 = 0, $11 = 0, $110 = 0, $111 = 0; |
| 22463 | var $112 = 0, $113 = 0, $114 = 0, $115 = 0, $116 = 0, $117 = 0, $118 = 0, $119 = 0, $12 = 0, $120 = 0, $121 = 0, $122 = 0, $123 = 0, $124 = 0, $125 = 0, $126 = 0, $127 = 0, $128 = 0, $129 = 0, $13 = 0; |
| 22464 | var $130 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0, $20 = 0, $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $3 = 0, $30 = 0; |
| 22465 | var $31 = 0, $32 = 0, $33 = 0, $34 = 0, $35 = 0, $36 = 0, $37 = 0, $38 = 0, $39 = 0, $4 = 0, $40 = 0, $41 = 0, $42 = 0, $43 = 0, $44 = 0, $45 = 0, $46 = 0, $47 = 0, $48 = 0, $49 = 0; |
| 22466 | var $5 = 0, $50 = 0, $51 = 0, $52 = 0, $53 = 0, $54 = 0, $55 = 0, $56 = 0, $57 = 0, $58 = 0, $59 = 0, $6 = 0, $60 = 0, $61 = 0, $62 = 0, $63 = 0, $64 = 0, $65 = 0, $66 = 0, $67 = 0; |
| 22467 | var $68 = 0, $69 = 0, $7 = 0, $70 = 0, $71 = 0, $72 = 0, $73 = 0, $74 = 0, $75 = 0, $76 = 0, $77 = 0, $78 = 0, $79 = 0, $8 = 0, $80 = 0, $81 = 0, $82 = 0, $83 = 0, $84 = 0, $85 = 0; |
| 22468 | var $86 = 0, $87 = 0, $88 = 0, $89 = 0, $9 = 0, $90 = 0, $91 = 0, $92 = 0, $93 = 0, $94 = 0, $95 = 0, $96 = 0, $97 = 0, $98 = 0, $99 = 0, $or$cond$i$i = 0, label = 0, sp = 0; |
| 22469 | sp = STACKTOP; |
| 22470 | $1 = HEAP32[$0>>2]|0; |
| 22471 | $2 = ((($0)) + 44|0); |
| 22472 | $3 = HEAP32[$2>>2]|0; |
| 22473 | $4 = ($3|0)==(0); |
| 22474 | L1: do { |
| 22475 | if (!($4)) { |
| 22476 | $5 = ((($0)) + 36|0); |
| 22477 | $6 = HEAP32[$5>>2]|0; |
| 22478 | $7 = ((($0)) + 48|0); |
| 22479 | $8 = HEAP32[$7>>2]|0; |
| 22480 | $9 = ($6>>>0)<($8>>>0); |
| 22481 | if ($9) { |
| 22482 | $10 = (($6>>>0) % ($8>>>0))&-1; |
| 22483 | $$032$ph$i = 0;$$034$ph$i = $10; |
| 22484 | } else { |
| 22485 | $11 = $8 >>> 1; |
| 22486 | $12 = (($11) + -1)|0; |
| 22487 | $$032$ph$i = $11;$$034$ph$i = $12; |
| 22488 | } |
| 22489 | $13 = ((($0)) + 52|0); |
| 22490 | $$032$i = $$032$ph$i; |
| 22491 | while(1) { |
| 22492 | $14 = HEAP32[$13>>2]|0; |
| 22493 | $15 = (($14) + ($$032$i<<2)|0); |
| 22494 | $16 = HEAP32[$15>>2]|0; |
| 22495 | $17 = ($16|0)==(0|0); |
| 22496 | if (!($17)) { |
| 22497 | $21 = $16; |
| 22498 | while(1) { |
| 22499 | $18 = HEAP32[$2>>2]|0; |
| 22500 | $19 = (($18) + -1)|0; |
| 22501 | HEAP32[$2>>2] = $19; |
| 22502 | $20 = ((($21)) + 16|0); |
| 22503 | $22 = HEAP32[$20>>2]|0; |
| 22504 | HEAP32[$15>>2] = $22; |
| 22505 | $23 = ((($21)) + 24|0); |
| 22506 | $24 = HEAP32[$23>>2]|0; |
| 22507 | $25 = ($24|0)==(0|0); |
| 22508 | if ($25) { |
| 22509 | $$phi$trans$insert = ((($21)) + 20|0); |
| 22510 | $$pre = HEAP32[$$phi$trans$insert>>2]|0; |
| 22511 | $41 = $$pre; |
| 22512 | } else { |
| 22513 | $26 = $24; |
| 22514 | $27 = ((($21)) + 28|0); |
| 22515 | $28 = HEAP32[$27>>2]|0; |
| 22516 | $29 = ((($28)) + 24|0); |
| 22517 | HEAP32[$29>>2] = $26; |
no test coverage detected
searching dependent graphs…