($0,$1,$2,$3,$4)
| 327375 | STACKTOP = sp;return ($$0|0); |
| 327376 | } |
| 327377 | function _nocaseCollatingFunc($0,$1,$2,$3,$4) { |
| 327378 | $0 = $0|0; |
| 327379 | $1 = $1|0; |
| 327380 | $2 = $2|0; |
| 327381 | $3 = $3|0; |
| 327382 | $4 = $4|0; |
| 327383 | var $$ = 0, $$01722$i = 0, $$019$i = 0, $$023$i = 0, $$in$i = 0, $$phi$trans$insert28$i = 0, $$phi$trans$insert29$i = 0, $$pre27$i = 0, $$pre30$i = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $20 = 0; |
| 327384 | var $21 = 0, $22 = 0, $23 = 0, $24 = 0, $25 = 0, $26 = 0, $27 = 0, $28 = 0, $29 = 0, $30 = 0, $31 = 0, $32 = 0, $5 = 0, $6 = 0, $7 = 0, $8 = 0, $9 = 0, label = 0, sp = 0; |
| 327385 | sp = STACKTOP; |
| 327386 | $5 = ($1|0)<($3|0); |
| 327387 | $6 = $5 ? $1 : $3; |
| 327388 | $7 = ($2|0)==(0|0); |
| 327389 | L1: do { |
| 327390 | if ($7) { |
| 327391 | $8 = ($4|0)!=(0|0); |
| 327392 | $9 = $8 << 31 >> 31; |
| 327393 | $$019$i = $9; |
| 327394 | } else { |
| 327395 | $10 = ($4|0)==(0|0); |
| 327396 | if ($10) { |
| 327397 | $$019$i = 1; |
| 327398 | } else { |
| 327399 | $11 = ($6|0)>(0); |
| 327400 | if ($11) { |
| 327401 | $$01722$i = $2;$$023$i = $4;$$in$i = $6; |
| 327402 | while(1) { |
| 327403 | $12 = (($$in$i) + -1)|0; |
| 327404 | $13 = HEAP8[$$01722$i>>0]|0; |
| 327405 | $14 = ($13<<24>>24)==(0); |
| 327406 | if ($14) { |
| 327407 | label = 6; |
| 327408 | break; |
| 327409 | } |
| 327410 | $15 = $13&255; |
| 327411 | $16 = (17324 + ($15)|0); |
| 327412 | $17 = HEAP8[$16>>0]|0; |
| 327413 | $18 = HEAP8[$$023$i>>0]|0; |
| 327414 | $19 = $18&255; |
| 327415 | $20 = (17324 + ($19)|0); |
| 327416 | $21 = HEAP8[$20>>0]|0; |
| 327417 | $22 = ($17<<24>>24)==($21<<24>>24); |
| 327418 | if (!($22)) { |
| 327419 | $27 = $17;$29 = $21; |
| 327420 | break; |
| 327421 | } |
| 327422 | $23 = ((($$01722$i)) + 1|0); |
| 327423 | $24 = ((($$023$i)) + 1|0); |
| 327424 | $25 = ($$in$i|0)>(1); |
| 327425 | if ($25) { |
| 327426 | $$01722$i = $23;$$023$i = $24;$$in$i = $12; |
| 327427 | } else { |
| 327428 | $$019$i = 0; |
| 327429 | break L1; |
| 327430 | } |
| 327431 | } |
| 327432 | if ((label|0) == 6) { |
| 327433 | $$pre27$i = HEAP8[$$023$i>>0]|0; |
| 327434 | $$phi$trans$insert28$i = $$pre27$i&255; |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…