[llvm] r302974 - [APInt] Fix typo in comment. NFC
Craig Topper via llvm-commits
llvm-commits at lists.llvm.org
Fri May 12 17:35:30 PDT 2017
Author: ctopper
Date: Fri May 12 19:35:30 2017
New Revision: 302974
URL: http://llvm.org/viewvc/llvm-project?rev=302974&view=rev
Log:
[APInt] Fix typo in comment. NFC
Modified:
llvm/trunk/lib/Support/APInt.cpp
Modified: llvm/trunk/lib/Support/APInt.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Support/APInt.cpp?rev=302974&r1=302973&r2=302974&view=diff
==============================================================================
--- llvm/trunk/lib/Support/APInt.cpp (original)
+++ llvm/trunk/lib/Support/APInt.cpp Fri May 12 19:35:30 2017
@@ -1302,7 +1302,7 @@ static void KnuthDiv(uint32_t *u, uint32
// Set qp = (u[j+n]*b + u[j+n-1]) / v[n-1]. (qp=qprime=q')
// Set rp = (u[j+n]*b + u[j+n-1]) % v[n-1]. (rp=rprime=r')
// Now test if qp == b or qp*v[n-2] > b*rp + u[j+n-2]; if so, decrease
- // qp by 1, inrease rp by v[n-1], and repeat this test if rp < b. The test
+ // qp by 1, increase rp by v[n-1], and repeat this test if rp < b. The test
// on v[n-2] determines at high speed most of the cases in which the trial
// value qp is one too large, and it eliminates all cases where qp is two
// too large.
More information about the llvm-commits
mailing list