MCPcopy Index your code
hub / github.com/sql-js/sql.js / _acosh

Function _acosh

js/sql-debug.js:394813–394856  ·  view source on GitHub ↗
($0)

Source from the content-addressed store, hash-verified

394811 return (+$$0101);
394812}
394813function _acosh($0) {
394814 $0 = +$0;
394815 var $$0 = 0.0, $1 = 0, $10 = 0.0, $11 = 0.0, $12 = 0.0, $13 = 0.0, $14 = 0, $15 = 0.0, $16 = 0.0, $17 = 0.0, $18 = 0.0, $19 = 0.0, $2 = 0, $20 = 0.0, $21 = 0.0, $22 = 0.0, $23 = 0.0, $24 = 0.0, $3 = 0, $4 = 0;
394816 var $5 = 0, $6 = 0, $7 = 0.0, $8 = 0.0, $9 = 0.0, label = 0, sp = 0;
394817 sp = STACKTOP;
394818 HEAPF64[tempDoublePtr>>3] = $0;$1 = HEAP32[tempDoublePtr>>2]|0;
394819 $2 = HEAP32[tempDoublePtr+4>>2]|0;
394820 $3 = (_bitshift64Lshr(($1|0),($2|0),52)|0);
394821 $4 = tempRet0;
394822 $5 = $3 & 2047;
394823 $6 = ($5>>>0)<(1024);
394824 do {
394825 if ($6) {
394826 $7 = $0 + -1.0;
394827 $8 = $7 * $7;
394828 $9 = $7 * 2.0;
394829 $10 = $8 + $9;
394830 $11 = (+Math_sqrt((+$10)));
394831 $12 = $7 + $11;
394832 $13 = (+_log1p($12));
394833 $$0 = $13;
394834 } else {
394835 $14 = ($5>>>0)<(1049);
394836 if ($14) {
394837 $15 = $0 * 2.0;
394838 $16 = $0 * $0;
394839 $17 = $16 + -1.0;
394840 $18 = (+Math_sqrt((+$17)));
394841 $19 = $18 + $0;
394842 $20 = 1.0 / $19;
394843 $21 = $15 - $20;
394844 $22 = (+Math_log((+$21)));
394845 $$0 = $22;
394846 break;
394847 } else {
394848 $23 = (+Math_log((+$0)));
394849 $24 = $23 + 0.69314718055994529;
394850 $$0 = $24;
394851 break;
394852 }
394853 }
394854 } while(0);
394855 return (+$$0);
394856}
394857function _log1p($0) {
394858 $0 = +$0;
394859 var $$082 = 0.0, $$1 = 0.0, $$184 = 0.0, $$186 = 0.0, $$2 = 0.0, $$sink = 0.0, $$sink1 = 0.0, $$sink1$p = 0.0, $1 = 0, $10 = 0, $11 = 0, $12 = 0, $13 = 0, $14 = 0.0, $15 = 0, $16 = 0, $17 = 0, $18 = 0, $19 = 0, $2 = 0;

Callers 1

_acoshFuncFunction · 0.85

Calls 2

_bitshift64LshrFunction · 0.85
_log1pFunction · 0.85

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…