RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-02-08 05:26:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix spelling and grammar

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@186858 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Matt Arsenault 2013-07-22 18:59:58 +00:00
parent e08a57824c
commit 1f4492e0b0
1 changed files with 12 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
lib/Transforms/Scalar/LoopIdiomRecognize.cpp
View File

@ -81,7 +81,7 @@ namespace {
/// Return the condition of the branch terminating the given basic block. /// Return the condition of the branch terminating the given basic block.
static Value *getBrCondtion(BasicBlock *); static Value *getBrCondtion(BasicBlock *);
/// Derive the precondition block (i.e the block that guards the loop /// Derive the precondition block (i.e the block that guards the loop
/// preheader) from the given preheader. /// preheader) from the given preheader.
static BasicBlock *getPrecondBb(BasicBlock *PreHead); static BasicBlock *getPrecondBb(BasicBlock *PreHead);
}; };
@ -111,7 +111,7 @@ namespace {
/// beween a variable and zero, and if the variable is non-zero, the /// beween a variable and zero, and if the variable is non-zero, the
/// control yeilds to the loop entry. If the branch matches the behavior, /// control yeilds to the loop entry. If the branch matches the behavior,
/// the variable involved in the comparion is returned. This function will /// the variable involved in the comparion is returned. This function will
/// be called to see if the precondition and postcondition of the loop /// be called to see if the precondition and postcondition of the loop
/// are in desirable form. /// are in desirable form.
Value *matchCondition (BranchInst *Br, BasicBlock *NonZeroTarget) const; Value *matchCondition (BranchInst *Br, BasicBlock *NonZeroTarget) const;
@ -274,11 +274,11 @@ static void deleteIfDeadInstruction(Value *V, ScalarEvolution &SE,
// //
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
// This fucntion will return true iff the given block contains nothing but goto. // This function will return true iff the given block contains nothing but goto.
// A typical usage of this function is to check if the preheader fucntion is // A typical usage of this function is to check if the preheader function is
// "almost" empty such that generated intrinsic function can be moved across // "almost" empty such that generated intrinsic functions can be moved across
// preheader and to be placed at the end of the preconditiona block without // the preheader and be placed at the end of the precondition block without
// concerning of breaking data dependence. // the concern of breaking data dependence.
bool LIRUtil::isAlmostEmpty(BasicBlock *BB) { bool LIRUtil::isAlmostEmpty(BasicBlock *BB) {
if (BranchInst *Br = getBranch(BB)) { if (BranchInst *Br = getBranch(BB)) {
return Br->isUnconditional() && BB->size() == 1; return Br->isUnconditional() && BB->size() == 1;
@ -339,7 +339,7 @@ bool NclPopcountRecognize::preliminaryScreen() {
PreCondBB = LIRUtil::getPrecondBb(PreHead); PreCondBB = LIRUtil::getPrecondBb(PreHead);
if (!PreCondBB) if (!PreCondBB)
return false; return false;
return true; return true;
} }
@ -504,7 +504,7 @@ void NclPopcountRecognize::transform(Instruction *CntInst,
// Assuming before transformation, the loop is following: // Assuming before transformation, the loop is following:
// if (x) // the precondition // if (x) // the precondition
// do { cnt++; x &= x - 1; } while(x); // do { cnt++; x &= x - 1; } while(x);
// Step 1: Insert the ctpop instruction at the end of the precondition block // Step 1: Insert the ctpop instruction at the end of the precondition block
IRBuilderTy Builder(PreCondBr); IRBuilderTy Builder(PreCondBr);
Value *PopCnt, *PopCntZext, *NewCount, *TripCnt; Value *PopCnt, *PopCntZext, *NewCount, *TripCnt;
@ -611,7 +611,7 @@ void NclPopcountRecognize::transform(Instruction *CntInst,
SE->forgetLoop(CurLoop); SE->forgetLoop(CurLoop);
} }
CallInst *NclPopcountRecognize::createPopcntIntrinsic(IRBuilderTy &IRBuilder, CallInst *NclPopcountRecognize::createPopcntIntrinsic(IRBuilderTy &IRBuilder,
Value *Val, DebugLoc DL) { Value *Val, DebugLoc DL) {
Value *Ops[] = { Val }; Value *Ops[] = { Val };
Type *Tys[] = { Val->getType() }; Type *Tys[] = { Val->getType() };
@ -667,13 +667,13 @@ bool LoopIdiomRecognize::runOnCountableLoop() {
if (!getDataLayout()) if (!getDataLayout())
return false; return false;
// set DT // set DT
(void)getDominatorTree(); (void)getDominatorTree();
LoopInfo &LI = getAnalysis<LoopInfo>(); LoopInfo &LI = getAnalysis<LoopInfo>();
TLI = &getAnalysis<TargetLibraryInfo>(); TLI = &getAnalysis<TargetLibraryInfo>();
// set TLI // set TLI
(void)getTargetLibraryInfo(); (void)getTargetLibraryInfo();
SmallVector<BasicBlock*, 8> ExitBlocks; SmallVector<BasicBlock*, 8> ExitBlocks;