mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 20:23:11 +01:00
[NFC] fix trivial typos in comments
"the the" -> "the" llvm-svn: 322934
This commit is contained in:
parent
0dd4ced3cd
commit
a161a054b1
@ -217,7 +217,7 @@ struct PartialInlinerImpl {
|
||||
// outline function due to code size.
|
||||
std::pair<bool, Function *> unswitchFunction(Function *F);
|
||||
|
||||
// This class speculatively clones the the function to be partial inlined.
|
||||
// This class speculatively clones the function to be partial inlined.
|
||||
// At the end of partial inlining, the remaining callsites to the cloned
|
||||
// function that are not partially inlined will be fixed up to reference
|
||||
// the original function, and the cloned function will be erased.
|
||||
|
@ -71,7 +71,7 @@ public:
|
||||
private:
|
||||
bool runOnLoop(Loop *L);
|
||||
|
||||
/// \brief Check if the the stride of the accesses is large enough to
|
||||
/// \brief Check if the stride of the accesses is large enough to
|
||||
/// warrant a prefetch.
|
||||
bool isStrideLargeEnough(const SCEVAddRecExpr *AR);
|
||||
|
||||
@ -275,7 +275,7 @@ bool LoopDataPrefetch::runOnLoop(Loop *L) {
|
||||
if (!LSCEVAddRec)
|
||||
continue;
|
||||
|
||||
// Check if the the stride of the accesses is large enough to warrant a
|
||||
// Check if the stride of the accesses is large enough to warrant a
|
||||
// prefetch.
|
||||
if (!isStrideLargeEnough(LSCEVAddRec))
|
||||
continue;
|
||||
|
@ -127,7 +127,7 @@ class BCECmpBlock {
|
||||
return Lhs_.Base() != nullptr && Rhs_.Base() != nullptr;
|
||||
}
|
||||
|
||||
// Assert the the block is consistent: If valid, it should also have
|
||||
// Assert the block is consistent: If valid, it should also have
|
||||
// non-null members besides Lhs_ and Rhs_.
|
||||
void AssertConsistent() const {
|
||||
if (IsValid()) {
|
||||
@ -552,7 +552,7 @@ bool processPhi(PHINode &Phi, const TargetLibraryInfo *const TLI) {
|
||||
// - The last basic block (bb4 here) must branch unconditionally to bb_phi.
|
||||
// It's the only block that contributes a non-constant value to the Phi.
|
||||
// - All other blocks (b1, b2, b3) must have exactly two successors, one of
|
||||
// them being the the phi block.
|
||||
// them being the phi block.
|
||||
// - All intermediate blocks (bb2, bb3) must have only one predecessor.
|
||||
// - Blocks cannot do other work besides the comparison, see doesOtherWork()
|
||||
|
||||
|
@ -272,7 +272,7 @@ static void updateBranchWeights(BasicBlock *Header, BranchInst *LatchBR,
|
||||
/// \param IterNumber The serial number of the iteration currently being
|
||||
/// peeled off.
|
||||
/// \param Exit The exit block of the original loop.
|
||||
/// \param[out] NewBlocks A list of the the blocks in the newly created clone
|
||||
/// \param[out] NewBlocks A list of the blocks in the newly created clone
|
||||
/// \param[out] VMap The value map between the loop and the new clone.
|
||||
/// \param LoopBlocks A helper for DFS-traversal of the loop.
|
||||
/// \param LVMap A value-map that maps instructions from the original loop to
|
||||
|
@ -1456,7 +1456,7 @@ Optional<unsigned> llvm::getLoopEstimatedTripCount(Loop *L) {
|
||||
if (!L->getExitingBlock())
|
||||
return None;
|
||||
|
||||
// Get the branch weights for the the loop's backedge.
|
||||
// Get the branch weights for the loop's backedge.
|
||||
BranchInst *LatchBR =
|
||||
dyn_cast<BranchInst>(L->getLoopLatch()->getTerminator());
|
||||
if (!LatchBR || LatchBR->getNumSuccessors() != 2)
|
||||
|
Loading…
Reference in New Issue
Block a user