($0,$1)
| 62075 | return (0)|0; |
| 62076 | } |
| 62077 | function _cellSizePtr($0,$1) { |
| 62078 | $0 = $0|0; |
| 62079 | $1 = $1|0; |
| 62080 | var $$ = 0, $$0$add = 0, $$0$idx = 0, $$042 = 0, $$1 = 0, $$143 = 0, $$2$add = 0, $$2$idx = 0, $$2$ptr = 0, $$3 = 0, $$345 = 0, $$49 = 0, $$ptr$le = 0, $$ptr46 = 0, $$ptr47 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0; |
| 62081 | var $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, $31 = 0, $32 = 0; |
| 62082 | var $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, $5 = 0, $6 = 0, $7 = 0, $8 = 0; |
| 62083 | var $9 = 0, $or$cond = 0, $or$cond48 = 0, label = 0, sp = 0; |
| 62084 | sp = STACKTOP; |
| 62085 | $2 = ((($0)) + 10|0); |
| 62086 | $3 = HEAP8[$2>>0]|0; |
| 62087 | $4 = $3&255; |
| 62088 | $5 = (($1) + ($4)|0); |
| 62089 | $6 = HEAP8[$5>>0]|0; |
| 62090 | $7 = $6&255; |
| 62091 | $8 = ($6<<24>>24)<(0); |
| 62092 | if ($8) { |
| 62093 | $9 = $7 & 127; |
| 62094 | $$0$idx = 0;$$042 = $9; |
| 62095 | while(1) { |
| 62096 | $10 = $$042 << 7; |
| 62097 | $$0$add = (($$0$idx) + 1)|0; |
| 62098 | $$ptr47 = (($5) + ($$0$add)|0); |
| 62099 | $11 = HEAP8[$$ptr47>>0]|0; |
| 62100 | $12 = $11 & 127; |
| 62101 | $13 = $12&255; |
| 62102 | $14 = $13 | $10; |
| 62103 | $15 = ($11<<24>>24)<(0); |
| 62104 | $16 = ($$0$add|0)<(8); |
| 62105 | $or$cond = $15 & $16; |
| 62106 | if ($or$cond) { |
| 62107 | $$0$idx = $$0$add;$$042 = $14; |
| 62108 | } else { |
| 62109 | $$1 = $$ptr47;$$143 = $14; |
| 62110 | break; |
| 62111 | } |
| 62112 | } |
| 62113 | } else { |
| 62114 | $$1 = $5;$$143 = $7; |
| 62115 | } |
| 62116 | $$ptr46 = ((($$1)) + 1|0); |
| 62117 | $17 = ((($0)) + 2|0); |
| 62118 | $18 = HEAP8[$17>>0]|0; |
| 62119 | $19 = ($18<<24>>24)==(0); |
| 62120 | if ($19) { |
| 62121 | $$3 = $$ptr46; |
| 62122 | } else { |
| 62123 | $$2$idx = 1; |
| 62124 | while(1) { |
| 62125 | $$2$ptr = (($$1) + ($$2$idx)|0); |
| 62126 | $$2$add = (($$2$idx) + 1)|0; |
| 62127 | $20 = HEAP8[$$2$ptr>>0]|0; |
| 62128 | $21 = ($20<<24>>24)<(0); |
| 62129 | $22 = ($$2$add|0)<(10); |
| 62130 | $or$cond48 = $21 & $22; |
| 62131 | if ($or$cond48) { |
| 62132 | $$2$idx = $$2$add; |
| 62133 | } else { |
| 62134 | break; |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…