[polly] r268220 - Typo: isToComplex -> isTooComplex. NFC.

[Michael Kruse via llvm-commits]

Author: meinersbur
Date: Mon May  2 05:44:20 2016
New Revision: 268220

URL: http://llvm.org/viewvc/llvm-project?rev=268220&view=rev
Log:
Typo: isToComplex -> isTooComplex. NFC.

Modified:
    polly/trunk/lib/Support/SCEVAffinator.cpp

Modified: polly/trunk/lib/Support/SCEVAffinator.cpp
URL: http://llvm.org/viewvc/llvm-project/polly/trunk/lib/Support/SCEVAffinator.cpp?rev=268220&r1=268219&r2=268220&view=diff
==============================================================================
--- polly/trunk/lib/Support/SCEVAffinator.cpp (original)
+++ polly/trunk/lib/Support/SCEVAffinator.cpp Mon May  2 05:44:20 2016
@@ -64,11 +64,11 @@ static __isl_give PWACtx copyPWACtx(cons
   return std::make_pair(isl_pw_aff_copy(PWAC.first), isl_set_copy(PWAC.second));
 }
 
-/// @brief Determine if @p PWAC is to complex to continue
+/// @brief Determine if @p PWAC is too complex to continue.
 ///
 /// Note that @p PWAC will be "free" (deallocated) if this function returns
 /// true, but not if this function returns false.
-static bool isToComplex(PWACtx &PWAC) {
+static bool isTooComplex(PWACtx &PWAC) {
   unsigned NumBasicSets = 0;
   isl_pw_aff_foreach_piece(PWAC.first, addNumBasicSets, &NumBasicSets);
   if (NumBasicSets <= MaxConjunctsInPwAff)
@@ -373,7 +373,7 @@ __isl_give PWACtx SCEVAffinator::visitAd
 
   for (int i = 1, e = Expr->getNumOperands(); i < e; ++i) {
     combine(Sum, visit(Expr->getOperand(i)), isl_pw_aff_add);
-    if (isToComplex(Sum))
+    if (isTooComplex(Sum))
       return std::make_pair(nullptr, nullptr);
   }
 
@@ -385,7 +385,7 @@ __isl_give PWACtx SCEVAffinator::visitMu
 
   for (int i = 1, e = Expr->getNumOperands(); i < e; ++i) {
     combine(Prod, visit(Expr->getOperand(i)), isl_pw_aff_mul);
-    if (isToComplex(Prod))
+    if (isTooComplex(Prod))
       return std::make_pair(nullptr, nullptr);
   }
 
@@ -437,7 +437,7 @@ __isl_give PWACtx SCEVAffinator::visitSM
 
   for (int i = 1, e = Expr->getNumOperands(); i < e; ++i) {
     combine(Max, visit(Expr->getOperand(i)), isl_pw_aff_max);
-    if (isToComplex(Max))
+    if (isTooComplex(Max))
       return std::make_pair(nullptr, nullptr);
   }