Reid Spencer 80b41ab5f7 First version that can process arith.cpp test case up to 1024 bits: ... 1. Ensure pVal is set to 0 in each constructor. 2. Fix roundToDouble to make correct calculations and not read beyond the end of allocated memory. 3. Implement Knuth's "classical algorithm" for division from scratch and eliminate buffer overflows and uninitialized mememory reads. Document it properly too. 4. Implement a wrapper function for KnuthDiv which handles the 64-bit to 32-bit conversion and back. It also implement short division for the n == 1 case that Knuth's algorithm can't handle. 5. Simplify the logic of udiv and urem a little, make them exit early, and have them use the "divide" wrapper function to perform the division or remainder operation. 6. Move the toString function to the end of the file, closer to where the division functions are located. Note: division is still broken for some > 64 bit values, but at least it doesn't crash any more. llvm-svn: 34449		2007-02-20 08:51:03 +00:00
..
bzip2
Allocator.cpp
Annotation.cpp
APInt.cpp	First version that can process arith.cpp test case up to 1024 bits:	2007-02-20 08:51:03 +00:00
CommandLine.cpp
Compressor.cpp
Debug.cpp
Dwarf.cpp
FileUtilities.cpp
FoldingSet.cpp
GraphWriter.cpp	Add possibility to set memory limit for binaries run via libSystem. This	2007-02-16 19:11:07 +00:00
IsInf.cpp
IsNAN.cpp
Makefile
ManagedStatic.cpp	Not all managedstatics need object pointers.	2007-02-20 06:18:57 +00:00
PluginLoader.cpp
SlowOperationInformer.cpp
SmallPtrSet.cpp
Statistic.cpp
Streams.cpp
StringExtras.cpp
StringMap.cpp
SystemUtils.cpp
Timer.cpp