From: Hiroshi Inoue Date: Wed, 9 Jan 2019 05:11:10 +0000 (+0000) Subject: [NFC] fix trivial typos in comments X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=7a9527e0ebd3c0b85b5a181325c755e0c0790f8a;p=llvm [NFC] fix trivial typos in comments git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@350690 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/lib/CodeGen/IfConversion.cpp b/lib/CodeGen/IfConversion.cpp index 5666626ab31..ceeba639ee0 100644 --- a/lib/CodeGen/IfConversion.cpp +++ b/lib/CodeGen/IfConversion.cpp @@ -1444,7 +1444,7 @@ bool IfConverter::IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) { Redefs.init(*TRI); if (MRI->tracksLiveness()) { - // Initialize liveins to the first BB. These are potentiall redefined by + // Initialize liveins to the first BB. These are potentially redefined by // predicated instructions. Redefs.addLiveIns(CvtMBB); Redefs.addLiveIns(NextMBB); @@ -2148,7 +2148,7 @@ void IfConverter::MergeBlocks(BBInfo &ToBBI, BBInfo &FromBBI, bool AddEdges) { // Calculate the edge probability for the edge from ToBBI.BB to Succ, // which is a portion of the edge probability from FromMBB to Succ. The // portion ratio is the edge probability from ToBBI.BB to FromMBB (if - // FromBBI is a successor of ToBBI.BB. See comment below for excepion). + // FromBBI is a successor of ToBBI.BB. See comment below for exception). NewProb = MBPI->getEdgeProbability(&FromMBB, Succ); // To2FromProb is 0 when FromMBB is not a successor of ToBBI.BB. This diff --git a/lib/CodeGen/MachineBlockPlacement.cpp b/lib/CodeGen/MachineBlockPlacement.cpp index 624d3365b4f..4fee9c4ea02 100644 --- a/lib/CodeGen/MachineBlockPlacement.cpp +++ b/lib/CodeGen/MachineBlockPlacement.cpp @@ -316,7 +316,7 @@ class MachineBlockPlacement : public MachineFunctionPass { /// A type for a block filter set. using BlockFilterSet = SmallSetVector; - /// Pair struct containing basic block and taildup profitiability + /// Pair struct containing basic block and taildup profitability struct BlockAndTailDupResult { MachineBasicBlock *BB; bool ShouldTailDup; diff --git a/lib/CodeGen/MachinePipeliner.cpp b/lib/CodeGen/MachinePipeliner.cpp index de8c55585d3..9d79e895412 100644 --- a/lib/CodeGen/MachinePipeliner.cpp +++ b/lib/CodeGen/MachinePipeliner.cpp @@ -1557,7 +1557,7 @@ void SwingSchedulerDAG::Circuits::createAdjacencyStructure( } } } - // Add back-eges in the adjacency matrix for the output dependences. + // Add back-edges in the adjacency matrix for the output dependences. for (auto &OD : OutputDeps) if (!Added.test(OD.second)) { AdjK[OD.first].push_back(OD.second); @@ -2773,7 +2773,7 @@ void SwingSchedulerDAG::generateExistingPhis( else if (PrologStage >= AccessStage + StageDiff + np && VRMap[PrologStage - StageDiff - np].count(LoopVal) != 0) PhiOp1 = VRMap[PrologStage - StageDiff - np][LoopVal]; - // Check if the Phi has already been scheduled, but the loop intruction + // Check if the Phi has already been scheduled, but the loop instruction // is either another Phi, or doesn't occur in the loop. else if (PrologStage >= AccessStage + StageDiff + np) { // If the Phi references another Phi, we need to examine the other diff --git a/lib/CodeGen/MachineScheduler.cpp b/lib/CodeGen/MachineScheduler.cpp index ec11586b08e..90dad9d399f 100644 --- a/lib/CodeGen/MachineScheduler.cpp +++ b/lib/CodeGen/MachineScheduler.cpp @@ -2460,13 +2460,13 @@ static unsigned computeRemLatency(SchedBoundary &CurrZone) { } /// Returns true if the current cycle plus remaning latency is greater than -/// the cirtical path in the scheduling region. +/// the critical path in the scheduling region. bool GenericSchedulerBase::shouldReduceLatency(const CandPolicy &Policy, SchedBoundary &CurrZone, bool ComputeRemLatency, unsigned &RemLatency) const { // The current cycle is already greater than the critical path, so we are - // already latnecy limited and don't need to compute the remaining latency. + // already latency limited and don't need to compute the remaining latency. if (CurrZone.getCurrCycle() > Rem.CriticalPath) return true; diff --git a/lib/CodeGen/MachineVerifier.cpp b/lib/CodeGen/MachineVerifier.cpp index 3128e5a7666..534d3699db2 100644 --- a/lib/CodeGen/MachineVerifier.cpp +++ b/lib/CodeGen/MachineVerifier.cpp @@ -683,7 +683,7 @@ MachineVerifier::visitMachineBasicBlockBefore(const MachineBasicBlock *MBB) { // out the bottom of the function. } else if (MBB->succ_size() == LandingPadSuccs.size()) { // It's possible that the block legitimately ends with a noreturn - // call or an unreachable, in which case it won't actuall fall + // call or an unreachable, in which case it won't actually fall // out of the block. } else if (MBB->succ_size() != 1+LandingPadSuccs.size()) { report("MBB exits via unconditional fall-through but doesn't have " diff --git a/lib/CodeGen/RegAllocGreedy.cpp b/lib/CodeGen/RegAllocGreedy.cpp index f244028534f..81b21b44243 100644 --- a/lib/CodeGen/RegAllocGreedy.cpp +++ b/lib/CodeGen/RegAllocGreedy.cpp @@ -318,7 +318,7 @@ class RAGreedy : public MachineFunctionPass, /// Track new eviction. /// The Evictor vreg has evicted the Evictee vreg from Physreg. - /// \param PhysReg The phisical register Evictee was evicted from. + /// \param PhysReg The physical register Evictee was evicted from. /// \param Evictor The evictor Vreg that evicted Evictee. /// \param Evictee The evictee Vreg. void addEviction(unsigned PhysReg, unsigned Evictor, unsigned Evictee) { diff --git a/lib/CodeGen/RegisterCoalescer.cpp b/lib/CodeGen/RegisterCoalescer.cpp index 2cef900d8b7..2a06d5e95fb 100644 --- a/lib/CodeGen/RegisterCoalescer.cpp +++ b/lib/CodeGen/RegisterCoalescer.cpp @@ -176,7 +176,7 @@ namespace { /// If one def has many copy like uses, and those copy uses are all /// rematerialized, the live interval update needed for those /// rematerializations will be delayed and done all at once instead - /// of being done multiple times. This is to save compile cost becuase + /// of being done multiple times. This is to save compile cost because /// live interval update is costly. void lateLiveIntervalUpdate();