diff options
| author | Szabolcs Nagy <szabolcs.nagy@arm.com> | 2017-09-04 17:55:33 +0100 |
|---|---|---|
| committer | Szabolcs Nagy <szabolcs.nagy@arm.com> | 2017-09-29 11:51:12 +0100 |
| commit | e260a9f8a9279c231405593c449e1f5bd39b3fd1 (patch) | |
| tree | 7b80b0dc7fab5bec38a78ebbf13b940386873294 /libio/clearerr_u.c | |
| parent | eb38f71b3504ac132b5c65ba23a15ddb9d02a435 (diff) | |
| download | glibc-e260a9f8a9279c231405593c449e1f5bd39b3fd1.tar.gz glibc-e260a9f8a9279c231405593c449e1f5bd39b3fd1.tar.xz glibc-e260a9f8a9279c231405593c449e1f5bd39b3fd1.zip | |
New generic powf
without wrapper on aarch64: powf reciprocal-throughput: 4.2x faster powf latency: 2.6x faster old worst-case error: 1.11 ulp new worst-case error: 0.82 ulp aarch64 .text size: -780 bytes aarch64 .rodata size: +144 bytes powf(x,y) is implemented as exp2(y*log2(x)) with the same algorithms that are used in exp2f and log2f, except that the log2f polynomial is larger for extra precision and its output (and exp2f input) may be scaled by a power of 2 (POWF_SCALE) to simplify the argument reduction step of exp2 (possible when efficient round and convert toint operation is available). The special case handling tries to minimize the checks in the hot path. When the input of exp2_inline is checked, int arithmetics is used as that was faster on the tested aarch64 cores. 2017-09-19 Szabolcs Nagy <szabolcs.nagy@arm.com> * math/Makefile (type-float-routines): Add e_powf_log2_data. * sysdeps/ieee754/flt-32/e_powf.c: New implementation. * sysdeps/ieee754/flt-32/e_powf_log2_data.c: New file. * sysdeps/ieee754/flt-32/math_config.h (__powf_data): Define. (issignalingf_inline): Likewise. (POWF_LOG2_TABLE_BITS): Likewise. (POWF_LOG2_POLY_ORDER): Likewise. (POWF_SCALE_BITS): Likewise. (POWF_SCALE): Likewise. * sysdeps/i386/fpu/e_powf_log2_data.c: New file. * sysdeps/ia64/fpu/e_powf_log2_data.c: New file. * sysdeps/m68k/m680x0/fpu/e_powf_log2_data.c: New file.
Diffstat (limited to 'libio/clearerr_u.c')
0 files changed, 0 insertions, 0 deletions