mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 11:02:59 +02:00
Fix spelling mistakes in Transforms comments. NFC.
Identified by Pedro Giffuni in PR27636. llvm-svn: 287488
This commit is contained in:
parent
148a658151
commit
e116136251
@ -246,7 +246,7 @@ private:
|
||||
RecurrenceKind Kind;
|
||||
// If this a min/max recurrence the kind of recurrence.
|
||||
MinMaxRecurrenceKind MinMaxKind;
|
||||
// First occurance of unasfe algebra in the PHI's use-chain.
|
||||
// First occurrence of unasfe algebra in the PHI's use-chain.
|
||||
Instruction *UnsafeAlgebraInst;
|
||||
// The type of the recurrence.
|
||||
Type *RecurrenceType;
|
||||
|
@ -66,9 +66,9 @@ public:
|
||||
// passes through a suspend point.
|
||||
//
|
||||
// For every basic block 'i' it maintains a BlockData that consists of:
|
||||
// Consumes: a bit vector which contains a set of indicies of blocks that can
|
||||
// Consumes: a bit vector which contains a set of indices of blocks that can
|
||||
// reach block 'i'
|
||||
// Kills: a bit vector which contains a set of indicies of blocks that can
|
||||
// Kills: a bit vector which contains a set of indices of blocks that can
|
||||
// reach block 'i', but one of the path will cross a suspend point
|
||||
// Suspend: a boolean indicating whether block 'i' contains a suspend point.
|
||||
// End: a boolean indicating whether block 'i' contains a coro.end intrinsic.
|
||||
|
@ -177,7 +177,7 @@ static void mergeInlinedArrayAllocas(
|
||||
<< "\n\t\tINTO: " << *AvailableAlloca << '\n');
|
||||
|
||||
// Move affected dbg.declare calls immediately after the new alloca to
|
||||
// avoid the situation when a dbg.declare preceeds its alloca.
|
||||
// avoid the situation when a dbg.declare precedes its alloca.
|
||||
if (auto *L = LocalAsMetadata::getIfExists(AI))
|
||||
if (auto *MDV = MetadataAsValue::getIfExists(AI->getContext(), L))
|
||||
for (User *U : MDV->users())
|
||||
|
@ -2576,7 +2576,7 @@ Instruction *InstCombiner::visitLandingPadInst(LandingPadInst &LI) {
|
||||
// remove it from the filter. An unexpected type handler may be
|
||||
// set up for a call site which throws an exception of the same
|
||||
// type caught. In order for the exception thrown by the unexpected
|
||||
// handler to propogate correctly, the filter must be correctly
|
||||
// handler to propagate correctly, the filter must be correctly
|
||||
// described for the call site.
|
||||
//
|
||||
// Example:
|
||||
|
@ -444,7 +444,7 @@ void ConstantHoistingPass::findBaseConstants() {
|
||||
|
||||
/// \brief Updates the operand at Idx in instruction Inst with the result of
|
||||
/// instruction Mat. If the instruction is a PHI node then special
|
||||
/// handling for duplicate values form the same incomming basic block is
|
||||
/// handling for duplicate values form the same incoming basic block is
|
||||
/// required.
|
||||
/// \return The update will always succeed, but the return value indicated if
|
||||
/// Mat was used for the update or not.
|
||||
|
@ -1635,7 +1635,7 @@ void WidenIV::calculatePostIncRange(Instruction *NarrowDef,
|
||||
|
||||
BasicBlock *NarrowUserBB = NarrowUser->getParent();
|
||||
// If NarrowUserBB is statically unreachable asking dominator queries may
|
||||
// yield suprising results. (e.g. the block may not have a dom tree node)
|
||||
// yield surprising results. (e.g. the block may not have a dom tree node)
|
||||
if (!DT->isReachableFromEntry(NarrowUserBB))
|
||||
return;
|
||||
|
||||
|
@ -1603,7 +1603,7 @@ bool JumpThreadingPass::ThreadEdge(BasicBlock *BB,
|
||||
}
|
||||
|
||||
/// Create a new basic block that will be the predecessor of BB and successor of
|
||||
/// all blocks in Preds. When profile data is availble, update the frequency of
|
||||
/// all blocks in Preds. When profile data is available, update the frequency of
|
||||
/// this new block.
|
||||
BasicBlock *JumpThreadingPass::SplitBlockPreds(BasicBlock *BB,
|
||||
ArrayRef<BasicBlock *> Preds,
|
||||
|
@ -141,7 +141,7 @@ public:
|
||||
/// Control flow is expressed as a branch where the true exit goes into the
|
||||
/// "Then"/"Else" region, while the false exit skips the region
|
||||
/// The condition for the optional "Else" region is expressed as a PHI node.
|
||||
/// The incomming values of the PHI node are true for the "If" edge and false
|
||||
/// The incoming values of the PHI node are true for the "If" edge and false
|
||||
/// for the "Then" edge.
|
||||
///
|
||||
/// Additionally to that even complicated loops look like this:
|
||||
|
@ -4436,7 +4436,7 @@ static Value *getReductionValue(const DominatorTree *DT, PHINode *P,
|
||||
return nullptr;
|
||||
|
||||
// There is a loop latch, return the incoming value if it comes from
|
||||
// that. This reduction pattern occassionaly turns up.
|
||||
// that. This reduction pattern occasionally turns up.
|
||||
if (P->getIncomingBlock(0) == BBLatch) {
|
||||
Rdx = P->getIncomingValue(0);
|
||||
} else if (P->getIncomingBlock(1) == BBLatch) {
|
||||
|
Loading…
Reference in New Issue
Block a user