OSchip
/
llvm-project
mirror of https://github.com/THU-DSP-LAB/llvm-project.git
13
0
Fork 6
Code Issues Packages Projects Releases Wiki Activity

Fixed typos in comments. NFCI. 

llvm-svn: 297379
This commit is contained in:
Simon Pilgrim 2017-03-09 13:57:04 +00:00
parent 7a1bbd4d73
commit 0099beb51f
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
llvm/lib/Support/APInt.cpp
View File

@ -340,7 +340,7 @@ static uint64_t mul_1(uint64_t dest[], uint64_t x[], unsigned len, uint64_t y) {
/// Multiplies integer array x by integer array y and stores the result into /// Multiplies integer array x by integer array y and stores the result into
/// the integer array dest. Note that dest's size must be >= xlen + ylen. /// the integer array dest. Note that dest's size must be >= xlen + ylen.
/// @brief Generalized multiplicate of integer arrays. /// @brief Generalized multiplication of integer arrays.
static void mul(uint64_t dest[], uint64_t x[], unsigned xlen, uint64_t y[], static void mul(uint64_t dest[], uint64_t x[], unsigned xlen, uint64_t y[],
unsigned ylen) { unsigned ylen) {
dest[xlen] = mul_1(dest, x, xlen, y[0]); dest[xlen] = mul_1(dest, x, xlen, y[0]);
@ -495,11 +495,11 @@ bool APInt::ult(const APInt& RHS) const {
if (n1 < n2) if (n1 < n2)
return true; return true;
// If magnitude of RHS is greather than LHS, return false. // If magnitude of RHS is greater than LHS, return false.
if (n2 < n1) if (n2 < n1)
return false; return false;
// If they bot fit in a word, just compare the low order word // If they both fit in a word, just compare the low order word
if (n1 <= APINT_BITS_PER_WORD && n2 <= APINT_BITS_PER_WORD) if (n1 <= APINT_BITS_PER_WORD && n2 <= APINT_BITS_PER_WORD)
return pVal[0] < RHS.pVal[0]; return pVal[0] < RHS.pVal[0];
@ -529,7 +529,7 @@ bool APInt::slt(const APInt& RHS) const {
if (lhsNeg != rhsNeg) if (lhsNeg != rhsNeg)
return lhsNeg; return lhsNeg;
// Otherwise we can just use an unsigned comparision, because even negative // Otherwise we can just use an unsigned comparison, because even negative
// numbers compare correctly this way if both have the same signed-ness. // numbers compare correctly this way if both have the same signed-ness.
return ult(RHS); return ult(RHS);
} }
@ -545,7 +545,7 @@ void APInt::setBitsSlowCase(unsigned loBit, unsigned hiBit) {
unsigned loWord = whichWord(loBit); unsigned loWord = whichWord(loBit);
unsigned hiWord = whichWord(hiBit); unsigned hiWord = whichWord(hiBit);
// Create an initial mask for the low word with zeroes below loBit. // Create an initial mask for the low word with zeros below loBit.
uint64_t loMask = UINT64_MAX << whichBit(loBit); uint64_t loMask = UINT64_MAX << whichBit(loBit);
// If hiBit is not aligned, we need a high mask. // If hiBit is not aligned, we need a high mask.
@ -1678,7 +1678,7 @@ static void KnuthDiv(unsigned *u, unsigned *v, unsigned *q, unsigned* r,
if (r) { if (r) {
// The value d is expressed by the "shift" value above since we avoided // The value d is expressed by the "shift" value above since we avoided
// multiplication by d by using a shift left. So, all we have to do is // multiplication by d by using a shift left. So, all we have to do is
// shift right here. In order to mak // shift right here.
if (shift) { if (shift) {
unsigned carry = 0; unsigned carry = 0;
DEBUG(dbgs() << "KnuthDiv: remainder:"); DEBUG(dbgs() << "KnuthDiv: remainder:");