diff options
author | Chris Lattner <sabre@nondot.org> | 2011-04-15 05:18:47 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2011-04-15 05:18:47 +0000 |
commit | 7a2bdde0a0eebcd2125055e0eacaca040f0b766c (patch) | |
tree | 1cd5fa470f290368855c9081cb213ed118812805 /lib/Transforms/Scalar/TailRecursionElimination.cpp | |
parent | bcb8c6d09ee426e0f774e3412912f6ae9e5f78dd (diff) | |
download | llvm-7a2bdde0a0eebcd2125055e0eacaca040f0b766c.tar.gz llvm-7a2bdde0a0eebcd2125055e0eacaca040f0b766c.tar.bz2 llvm-7a2bdde0a0eebcd2125055e0eacaca040f0b766c.tar.xz |
Fix a ton of comment typos found by codespell. Patch by
Luis Felipe Strano Moraes!
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@129558 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Transforms/Scalar/TailRecursionElimination.cpp')
-rw-r--r-- | lib/Transforms/Scalar/TailRecursionElimination.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/Transforms/Scalar/TailRecursionElimination.cpp b/lib/Transforms/Scalar/TailRecursionElimination.cpp index 5768ccbcd8..a221759710 100644 --- a/lib/Transforms/Scalar/TailRecursionElimination.cpp +++ b/lib/Transforms/Scalar/TailRecursionElimination.cpp @@ -36,7 +36,7 @@ // evaluated each time through the tail recursion. Safely keeping allocas // in the entry block requires analysis to proves that the tail-called // function does not read or write the stack object. -// 2. Tail recursion is only performed if the call immediately preceeds the +// 2. Tail recursion is only performed if the call immediately precedes the // return instruction. It's possible that there could be a jump between // the call and the return. // 3. There can be intervening operations between the call and the return that @@ -433,7 +433,7 @@ bool TailCallElim::EliminateRecursiveTailCall(CallInst *CI, ReturnInst *Ret, if (CanMoveAboveCall(BBI, CI)) continue; // If we can't move the instruction above the call, it might be because it - // is an associative and commutative operation that could be tranformed + // is an associative and commutative operation that could be transformed // using accumulator recursion elimination. Check to see if this is the // case, and if so, remember the initial accumulator value for later. if ((AccumulatorRecursionEliminationInitVal = |