[llvm] r312120 - fix more typos; NFC

[Sanjay Patel via llvm-commits]

Author: spatel
Date: Wed Aug 30 06:19:23 2017
New Revision: 312120

URL: http://llvm.org/viewvc/llvm-project?rev=312120&view=rev
Log:
fix more typos; NFC

Modified:
    llvm/trunk/lib/Target/X86/X86CmovConversion.cpp

Modified: llvm/trunk/lib/Target/X86/X86CmovConversion.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Target/X86/X86CmovConversion.cpp?rev=312120&r1=312119&r2=312120&view=diff
==============================================================================
--- llvm/trunk/lib/Target/X86/X86CmovConversion.cpp (original)
+++ llvm/trunk/lib/Target/X86/X86CmovConversion.cpp Wed Aug 30 06:19:23 2017
@@ -9,7 +9,7 @@
 /// \file
 /// This file implements a pass that converts X86 cmov instructions into
 /// branches when profitable. This pass is conservative. It transforms if and
-/// only if it can gaurantee a gain with high confidence.
+/// only if it can guarantee a gain with high confidence.
 ///
 /// Thus, the optimization applies under the following conditions:
 ///   1. Consider as candidates only CMOVs in innermost loops (assume that
@@ -27,7 +27,7 @@
 ///         depth cost by some threshold.
 ///      b. CMOV is considered profitable if the cost of its condition is higher
 ///         than the average cost of its true-value and false-value by 25% of
-///         branch-misprediction-penalty. This assures no degredation even with
+///         branch-misprediction-penalty. This assures no degradation even with
 ///         25% branch misprediction.
 ///
 /// Note: This pass is assumed to run on SSA machine code.