RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-23 03:59:12 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

typoes

Browse Source 
llvm-svn: 113647
This commit is contained in:
Gabor Greif 2010-09-10 22:25:58 +00:00
parent da0804f6a1
commit dfe6dea95f
5 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
include/llvm/Analysis/Dominators.h
View File

@ -509,7 +509,7 @@ public:
}
/// eraseNode - Removes a node from the dominator tree. Block must not
/// domiante any other blocks. Removes node from its immediate dominator's
/// dominate any other blocks. Removes node from its immediate dominator's
/// children list. Deletes dominator node associated with basic block BB.
void eraseNode(NodeT *BB) {
DomTreeNodeBase<NodeT> *Node = getNode(BB);
@ -807,7 +807,7 @@ public:
}
/// eraseNode - Removes a node from the dominator tree. Block must not
/// domiante any other blocks. Removes node from its immediate dominator's
/// dominate any other blocks. Removes node from its immediate dominator's
/// children list. Deletes dominator node associated with basic block BB.
inline void eraseNode(BasicBlock *BB) {
DT->eraseNode(BB);

2
include/llvm/CodeGen/MachineDominators.h
View File

@ -145,7 +145,7 @@ public:
}
/// eraseNode - Removes a node from the dominator tree. Block must not
/// domiante any other blocks. Removes node from its immediate dominator's
/// dominate any other blocks. Removes node from its immediate dominator's
/// children list. Deletes dominator node associated with basic block BB.
inline void eraseNode(MachineBasicBlock *BB) {
DT->eraseNode(BB);

6
lib/Transforms/Scalar/LoopIndexSplit.cpp
View File

@ -617,8 +617,8 @@ bool LoopIndexSplit::updateLoopIterationSpace() {
if (Op1->use_empty())
Op1->eraseFromParent();
// Update domiantor info. Now, ExitingBlock has only one predecessor,
// ExitingBBPred, and it is ExitingBlock's immediate domiantor.
// Update dominator info. Now, ExitingBlock has only one predecessor,
// ExitingBBPred, and it is ExitingBlock's immediate dominator.
DT->changeImmediateDominator(ExitingBlock, ExitingBBPred);
BasicBlock *ExitBlock = ExitingBlock->getTerminator()->getSuccessor(1);
@ -1040,7 +1040,7 @@ bool LoopIndexSplit::splitLoop() {
// [*] Update BLoop's header phi nodes. Remove incoming PHINode's from
// original loop's preheader. Add incoming PHINode values from
// ALoop's exiting block. Update BLoop header's domiantor info.
// ALoop's exiting block. Update BLoop header's dominator info.
// Collect inverse map of Header PHINodes.
DenseMap<Value *, Value *> InverseMap;

2
lib/Transforms/Utils/BasicBlockUtils.cpp
View File

@ -327,7 +327,7 @@ BasicBlock *llvm::SplitBlock(BasicBlock *Old, Instruction *SplitPt, Pass *P) {
L->addBasicBlockToLoop(New, LI->getBase());
if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
// Old dominates New. New node domiantes all other nodes dominated by Old.
// Old dominates New. New node dominates all other nodes dominated by Old.
DomTreeNode *OldNode = DT->getNode(Old);
std::vector<DomTreeNode *> Children;
for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();

4
lib/Transforms/Utils/CodeExtractor.cpp
View File

@ -186,8 +186,8 @@ void CodeExtractor::splitReturnBlocks() {
if (ReturnInst *RI = dyn_cast<ReturnInst>((*I)->getTerminator())) {
BasicBlock *New = (*I)->splitBasicBlock(RI, (*I)->getName()+".ret");
if (DT) {
// Old dominates New. New node domiantes all other nodes dominated
//by Old.
// Old dominates New. New node dominates all other nodes dominated
// by Old.
DomTreeNode *OldNode = DT->getNode(*I);
SmallVector<DomTreeNode*, 8> Children;
for (DomTreeNode::iterator DI = OldNode->begin(), DE = OldNode->end();