Author: Sanjay Patel Date: 2021-01-16T13:55:52-05:00 New Revision: fcfcc3cc6b16e4fd7d7d2d07937634cca360b46e
URL: https://github.com/llvm/llvm-project/commit/fcfcc3cc6b16e4fd7d7d2d07937634cca360b46e DIFF: https://github.com/llvm/llvm-project/commit/fcfcc3cc6b16e4fd7d7d2d07937634cca360b46e.diff LOG: [SLP] fix typos; NFC Added: Modified: llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp Removed: ################################################################################ diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp index d5e6dfed8e2c..a8d8ef5024d7 100644 --- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -6784,7 +6784,7 @@ class HorizontalReduction { /// Try to find a reduction tree. bool matchAssociativeReduction(PHINode *Phi, Instruction *B) { assert((!Phi || is_contained(Phi->operands(), B)) && - "Thi phi needs to use the binary operator"); + "Phi needs to use the binary operator"); RdxTreeInst = getOperationData(B); @@ -6831,7 +6831,7 @@ class HorizontalReduction { const OperationData OpData = getOperationData(TreeN); bool IsReducedValue = OpData != RdxTreeInst; - // Postorder vist. + // Postorder visit. if (IsReducedValue || EdgeToVisit == OpData.getNumberOfOperands()) { if (IsReducedValue) ReducedVals.push_back(TreeN); _______________________________________________ llvm-branch-commits mailing list llvm-branch-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits
