From 1e06f6cc990c352c03abb148bd5ad5bf3aeb7a1a Mon Sep 17 00:00:00 2001 From: Chad Rosier Date: Wed, 14 Sep 2016 17:12:30 +0000 Subject: [PATCH] [LoopInterchange] Typo. NFC. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@281501 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/Transforms/Scalar/LoopInterchange.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/lib/Transforms/Scalar/LoopInterchange.cpp b/lib/Transforms/Scalar/LoopInterchange.cpp index 1e091bacd40..a4d985a6451 100644 --- a/lib/Transforms/Scalar/LoopInterchange.cpp +++ b/lib/Transforms/Scalar/LoopInterchange.cpp @@ -948,9 +948,9 @@ int LoopInterchangeProfitability::getInstrOrderCost() { return GoodOrder - BadOrder; } -static bool isProfitabileForVectorization(unsigned InnerLoopId, - unsigned OuterLoopId, - CharMatrix &DepMatrix) { +static bool isProfitableForVectorization(unsigned InnerLoopId, + unsigned OuterLoopId, + CharMatrix &DepMatrix) { // TODO: Improve this heuristic to catch more cases. // If the inner loop is loop independent or doesn't carry any dependency it is // profitable to move this to outer position. @@ -987,7 +987,7 @@ bool LoopInterchangeProfitability::isProfitable(unsigned InnerLoopId, // It is not profitable as per current cache profitability model. But check if // we can move this loop outside to improve parallelism. bool ImprovesPar = - isProfitabileForVectorization(InnerLoopId, OuterLoopId, DepMatrix); + isProfitableForVectorization(InnerLoopId, OuterLoopId, DepMatrix); return ImprovesPar; } -- 2.50.1