(value, bits, ignore)
| 1332 | |
| 1333 | |
| 1334 | function unSign(value, bits, ignore) { |
| 1335 | if (value >= 0) { |
| 1336 | return value; |
| 1337 | } |
| 1338 | return bits <= 32 ? 2*Math.abs(1 << (bits-1)) + value // Need some trickery, since if bits == 32, we are right at the limit of the bits JS uses in bitshifts |
| 1339 | : Math.pow(2, bits) + value; |
| 1340 | } |
| 1341 | function reSign(value, bits, ignore) { |
| 1342 | if (value <= 0) { |
| 1343 | return value; |
nothing calls this directly
no outgoing calls
no test coverage detected
searching dependent graphs…