fixed some typos in method comments, reworded some comments for clarity

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@90754 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
John Mosby 2009-12-07 09:06:37 +00:00
parent bcc2e45840
commit 4650d92748
2 changed files with 9 additions and 9 deletions

View File

@ -67,17 +67,17 @@ class LoopDependenceAnalysis : public LoopPass {
/// created. The third argument is set to the pair found or created. /// created. The third argument is set to the pair found or created.
bool findOrInsertDependencePair(Value*, Value*, DependencePair*&); bool findOrInsertDependencePair(Value*, Value*, DependencePair*&);
/// getLoops - Collect all loops of the loop-nest L a given SCEV is variant /// getLoops - Collect all loops of the loop nest L in which
/// in. /// a given SCEV is variant.
void getLoops(const SCEV*, DenseSet<const Loop*>*) const; void getLoops(const SCEV*, DenseSet<const Loop*>*) const;
/// isLoopInvariant - True if a given SCEV is invariant in all loops of the /// isLoopInvariant - True if a given SCEV is invariant in all loops of the
/// loop-nest starting at the innermost loop L. /// loop nest starting at the innermost loop L.
bool isLoopInvariant(const SCEV*) const; bool isLoopInvariant(const SCEV*) const;
/// isAffine - An SCEV is affine with respect to the loop-nest starting at /// isAffine - An SCEV is affine with respect to the loop nest starting at
/// the innermost loop L if it is of the form A+B*X where A, B are invariant /// the innermost loop L if it is of the form A+B*X where A, B are invariant
/// in the loop-nest and X is a induction variable in the loop-nest. /// in the loop nest and X is a induction variable in the loop nest.
bool isAffine(const SCEV*) const; bool isAffine(const SCEV*) const;
/// TODO: doc /// TODO: doc
@ -93,8 +93,8 @@ public:
static char ID; // Class identification, replacement for typeinfo static char ID; // Class identification, replacement for typeinfo
LoopDependenceAnalysis() : LoopPass(&ID) {} LoopDependenceAnalysis() : LoopPass(&ID) {}
/// isDependencePair - Check wether two values can possibly give rise to a /// isDependencePair - Check whether two values can possibly give rise to
/// data dependence: that is the case if both are instructions accessing /// a data dependence: that is the case if both are instructions accessing
/// memory and at least one of those accesses is a write. /// memory and at least one of those accesses is a write.
bool isDependencePair(const Value*, const Value*) const; bool isDependencePair(const Value*, const Value*) const;

View File

@ -52,7 +52,7 @@ public:
// LPPassManger as expected. // LPPassManger as expected.
void preparePassManager(PMStack &PMS); void preparePassManager(PMStack &PMS);
/// Assign pass manager to manager this pass /// Assign pass manager to manage this pass
virtual void assignPassManager(PMStack &PMS, virtual void assignPassManager(PMStack &PMS,
PassManagerType PMT = PMT_LoopPassManager); PassManagerType PMT = PMT_LoopPassManager);
@ -73,7 +73,7 @@ public:
/// cloneBasicBlockAnalysis - Clone analysis info associated with basic block. /// cloneBasicBlockAnalysis - Clone analysis info associated with basic block.
virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {} virtual void cloneBasicBlockAnalysis(BasicBlock *F, BasicBlock *T, Loop *L) {}
/// deletekAnalysisValue - Delete analysis info associated with value V. /// deleteAnalysisValue - Delete analysis info associated with value V.
virtual void deleteAnalysisValue(Value *V, Loop *L) {} virtual void deleteAnalysisValue(Value *V, Loop *L) {}
}; };