[llvm] ab066bc - Fix "the the" duplicate typo in comment. NFC.

[Simon Pilgrim via llvm-commits]

Author: Simon Pilgrim
Date: 2023-06-27T11:43:08+01:00
New Revision: ab066bccf7dd6f43d878d4c88d828c7a2ad9ecc0

URL: https://github.com/llvm/llvm-project/commit/ab066bccf7dd6f43d878d4c88d828c7a2ad9ecc0
DIFF: https://github.com/llvm/llvm-project/commit/ab066bccf7dd6f43d878d4c88d828c7a2ad9ecc0.diff

LOG: Fix "the the" duplicate typo in comment. NFC.

Added: 
    

Modified: 
    llvm/lib/Analysis/ValueTracking.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Analysis/ValueTracking.cpp b/llvm/lib/Analysis/ValueTracking.cpp
index 5931032896512..482cf642e3247 100644
--- a/llvm/lib/Analysis/ValueTracking.cpp
+++ b/llvm/lib/Analysis/ValueTracking.cpp
@@ -2777,7 +2777,7 @@ bool isKnownNonZero(const Value *V, const APInt &DemandedElts, unsigned Depth,
 
     // If there exists any subset of X (sX) and subset of Y (sY) s.t sX * sY is
     // non-zero, then X * Y is non-zero. We can find sX and sY by just taking
-    // the the lowest known One of X and Y. If they are non-zero, the result
+    // the lowest known One of X and Y. If they are non-zero, the result
     // must be non-zero. We can check if LSB(X) * LSB(Y) != 0 by doing
     // X.CountLeadingZeros + Y.CountLeadingZeros < BitWidth.
     return (XKnown.countMaxTrailingZeros() + YKnown.countMaxTrailingZeros()) <