6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-09-27 16:17:17 +00:00
Code Issues Projects Releases Wiki Activity

Fix PR2088. Use modulo linear equation solver to compute loop iteration

Browse Source 
count.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@53810 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Wojciech Matyjewicz
2008-07-20 15:55:14 +00:00
parent b8c44d3aac
commit de0f2382e4
5 changed files with 101 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
lib/Support/APInt.cpp
View File

@@ -1466,7 +1466,7 @@ APInt APInt::multiplicativeInverse(const APInt& modulo) const {
// The next-to-last t is the multiplicative inverse. However, we are
// interested in a positive inverse. Calcuate a positive one from a negative
// one if necessary. A simple addition of the modulo suffices because
// abs(t[i]) is known to less than *this/2 (see the link above).
// abs(t[i]) is known to be less than *this/2 (see the link above).
return t[i].isNegative() ? t[i] + modulo : t[i];
}