($0,$1,$2)
| 9641 | return; |
| 9642 | } |
| 9643 | function _node_iterate($0,$1,$2) { |
| 9644 | $0 = $0|0; |
| 9645 | $1 = $1|0; |
| 9646 | $2 = $2|0; |
| 9647 | var $$tr = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0; |
| 9648 | sp = STACKTOP; |
| 9649 | $$tr = $0; |
| 9650 | while(1) { |
| 9651 | $3 = ($$tr|0)==(0|0); |
| 9652 | if ($3) { |
| 9653 | label = 6; |
| 9654 | break; |
| 9655 | } |
| 9656 | $4 = HEAP32[$$tr>>2]|0; |
| 9657 | $5 = ($4|0)==(0|0); |
| 9658 | if (!($5)) { |
| 9659 | _node_iterate($4,$1,$2); |
| 9660 | } |
| 9661 | $6 = ((($$tr)) + 8|0); |
| 9662 | $7 = HEAP32[$6>>2]|0; |
| 9663 | $8 = ((($$tr)) + 16|0); |
| 9664 | $9 = $8; |
| 9665 | $10 = $9; |
| 9666 | $11 = HEAP32[$10>>2]|0; |
| 9667 | $12 = (($9) + 4)|0; |
| 9668 | $13 = $12; |
| 9669 | $14 = HEAP32[$13>>2]|0; |
| 9670 | FUNCTION_TABLE_viiii[$1 & 255]($7,$11,$14,$2); |
| 9671 | $15 = ((($$tr)) + 4|0); |
| 9672 | $16 = HEAP32[$15>>2]|0; |
| 9673 | $17 = ($16|0)==(0|0); |
| 9674 | if ($17) { |
| 9675 | label = 6; |
| 9676 | break; |
| 9677 | } else { |
| 9678 | $$tr = $16; |
| 9679 | } |
| 9680 | } |
| 9681 | if ((label|0) == 6) { |
| 9682 | return; |
| 9683 | } |
| 9684 | } |
| 9685 | function _node_destroy($0) { |
| 9686 | $0 = $0|0; |
| 9687 | var $1 = 0, $2 = 0, $3 = 0, $4 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, label = 0, sp = 0; |
no outgoing calls
no test coverage detected
searching dependent graphs…