git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@317072
91177308-0d34-0410-b5e6-
96231b3b80d8
Replace0 &= !N0->hasOneUse();
Replace1 &= (N0 != N1) && !N1->hasOneUse();
- // Combine Op here so it is presreved past replacements.
+ // Combine Op here so it is preserved past replacements.
CombineTo(Op.getNode(), RV);
- // If operands have a use ordering, make sur we deal with
+ // If operands have a use ordering, make sure we deal with
// predecessor first.
if (Replace0 && Replace1 && N0.getNode()->isPredecessorOf(N1.getNode())) {
std::swap(N0, N1);