aboutsummaryrefslogtreecommitdiff
path: root/clang/unittests/Tooling/CompilationDatabaseTest.cpp
diff options
context:
space:
mode:
authorNemanja Ivanovic <nemanja.i.ibm@gmail.com>2019-05-07 13:48:03 +0000
committerNemanja Ivanovic <nemanja.i.ibm@gmail.com>2019-05-07 13:48:03 +0000
commitb4f028f0f3f6c4326ff9ff3c077f71b01d5adc2e (patch)
treedc0d51ef3204f44cdf1dec98975ded5442bad306 /clang/unittests/Tooling/CompilationDatabaseTest.cpp
parent5c922f698847a7059e9015dcf73721af3be852a3 (diff)
downloadllvm-b4f028f0f3f6c4326ff9ff3c077f71b01d5adc2e.zip
llvm-b4f028f0f3f6c4326ff9ff3c077f71b01d5adc2e.tar.gz
llvm-b4f028f0f3f6c4326ff9ff3c077f71b01d5adc2e.tar.bz2
[PowerPC] Use the two-constant NR algorithm for refining estimates
The single-constant algorithm produces infinities on a lot of denormal values. The precision of the two-constant algorithm is actually sufficient across the range of denormals. We will switch to that algorithm for now to avoid the infinities on denormals. In the future, we will re-evaluate the algorithm to find the optimal one for PowerPC. Differential revision: https://reviews.llvm.org/D60037 llvm-svn: 360144
Diffstat (limited to 'clang/unittests/Tooling/CompilationDatabaseTest.cpp')
0 files changed, 0 insertions, 0 deletions