llvm-6502/unittests/ADT
Cameron Zwarich 8d7285d0e5 The signed version of our "magic number" computation for the integer approximation
of a constant had a minor typo introduced when copying it from the book, which
caused it to favor negative approximations over positive approximations in many
cases. Positive approximations require fewer operations beyond the multiplication.

In the case of division by 3, we still generate code that is a single instruction
larger than GCC's code.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@126097 91177308-0d34-0410-b5e6-96231b3b80d8
2011-02-21 00:22:02 +00:00
..
APFloatTest.cpp
APIntTest.cpp The signed version of our "magic number" computation for the integer approximation 2011-02-21 00:22:02 +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 Add more checks to IntervalMapOverlaps::advance() to ensure that advanceTo sees 2010-12-17 22:07:54 +00:00
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