Author: wmat Date: Wed Feb 13 06:21:32 2008 New Revision: 47062 URL: http://llvm.org/viewvc/llvm-project?rev=47062&view=rev Log: Fix typo. Thanks to Duncan for noticing.
Modified: llvm/trunk/lib/Analysis/ScalarEvolution.cpp Modified: llvm/trunk/lib/Analysis/ScalarEvolution.cpp URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Analysis/ScalarEvolution.cpp?rev=47062&r1=47061&r2=47062&view=diff ============================================================================== --- llvm/trunk/lib/Analysis/ScalarEvolution.cpp (original) +++ llvm/trunk/lib/Analysis/ScalarEvolution.cpp Wed Feb 13 06:21:32 2008 @@ -2533,7 +2533,7 @@ // We know the LHS is of the form {n,+,1} and the RHS is some loop-invariant // m. So, we count the number of iterations in which {n,+,1} < m is true. // Note that we cannot simply return max(m-n,0) because it's not safe to - // treat m-n as signed nor unsinged due to overflow possibility. + // treat m-n as signed nor unsigned due to overflow possibility. // First, we get the value of the LHS in the first iteration: n SCEVHandle Start = AddRec->getOperand(0); _______________________________________________ llvm-commits mailing list llvm-commits@cs.uiuc.edu http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits