summaryrefslogtreecommitdiff
path: root/src/network/bind.c
diff options
context:
space:
mode:
authorRich Felker <dalias@aerifal.cx>2012-03-20 00:51:32 -0400
committerRich Felker <dalias@aerifal.cx>2012-03-20 00:51:32 -0400
commitbaa43bca0a051e8deb0d6a9a8882ceeea5c27249 (patch)
treef5fe7ae916d9039adfe82217716e2aafd08702fb /src/network/bind.c
parent7513d3ecabb998e2c8c4cb9ed5de48c4b64a166b (diff)
downloadmusl-baa43bca0a051e8deb0d6a9a8882ceeea5c27249.tar.gz
musl-baa43bca0a051e8deb0d6a9a8882ceeea5c27249.tar.bz2
musl-baa43bca0a051e8deb0d6a9a8882ceeea5c27249.tar.xz
musl-baa43bca0a051e8deb0d6a9a8882ceeea5c27249.zip
optimize scalbn family
the fscale instruction is slow everywhere, probably because it involves a costly and unnecessary integer truncation operation that ends up being a no-op in common usages. instead, construct a floating point scale value with integer arithmetic and simply multiply by it, when possible. for float and double, this is always possible by going to the next-larger type. we use some cheap but effective saturating arithmetic tricks to make sure even very large-magnitude exponents fit. for long double, if the scaling exponent is too large to fit in the exponent of a long double value, we simply fallback to the expensive fscale method. on atom cpu, these changes speed up scalbn by over 30%. (min rdtsc timing dropped from 110 cycles to 70 cycles.)
Diffstat (limited to 'src/network/bind.c')
0 files changed, 0 insertions, 0 deletions