From: Sanjay Patel <spatel@rotateright.com>
Date: Wed, 30 Aug 2017 13:19:23 +0000 (+0000)
Subject: fix more typos; NFC
X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=ccd99b4a5bd14913f836536729d5f803eb59b272;p=llvm

fix more typos; NFC


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@312120 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Target/X86/X86CmovConversion.cpp b/lib/Target/X86/X86CmovConversion.cpp
index f84edaeb4ab..f7967004e20 100644
--- a/lib/Target/X86/X86CmovConversion.cpp
+++ b/lib/Target/X86/X86CmovConversion.cpp
@@ -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.