Benjamin Kramer 2746000f4f Add APFloat::getExactInverse. ... The idea is, that if an ieee 754 float is divided by a power of two, we can turn the division into a cheaper multiplication. This function sees if we can get an exact multiplicative inverse for a divisor and returns it if possible. This is the hard part of PR9587. I tested many inputs against llvm-gcc's frotend implementation of this optimization and didn't find any difference. However, floating point is the land of weird edge cases, so any review would be appreciated. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@128545 91177308-0d34-0410-b5e6-96231b3b80d8		2011-03-30 15:42:27 +00:00
..
APFloatTest.cpp	Add APFloat::getExactInverse.	2011-03-30 15:42:27 +00:00
APIntTest.cpp	Add an argument to APInt's magic udiv calculation to specify the number of bits that are known zero in the divided number.	2011-03-17 20:39:06 +00:00
BitVectorTest.cpp
DAGDeltaAlgorithmTest.cpp
DeltaAlgorithmTest.cpp
DenseMapTest.cpp
DenseSetTest.cpp
FoldingSet.cpp
ilistTest.cpp
ImmutableSetTest.cpp
IntEqClassesTest.cpp	Add ADT/IntEqClasses.h as a light-weight implementation of EquivalenceClasses.h.	2010-12-21 00:04:46 +00:00
IntervalMapTest.cpp
Makefile
SmallBitVectorTest.cpp
SmallStringTest.cpp
SmallVectorTest.cpp
SparseBitVectorTest.cpp
StringMapTest.cpp
StringRefTest.cpp	Don't infinitely recurse! Patch by Marius Wachtler!	2011-01-27 07:35:27 +00:00
TripleTest.cpp	Part of this test is invariant inside the inner loop - move it outside	2011-02-03 08:14:04 +00:00
TwineTest.cpp