diff options
author | Misha Brukman <brukman+llvm@gmail.com> | 2003-09-11 18:14:24 +0000 |
---|---|---|
committer | Misha Brukman <brukman+llvm@gmail.com> | 2003-09-11 18:14:24 +0000 |
commit | 2f2d06506c9167dada05b11debe717334de972d4 (patch) | |
tree | b4db466a5bb0270d2711628d7b91ded86660892d /lib | |
parent | 0043e4698c66bcac6526bbb9f133d2326a915494 (diff) | |
download | external_llvm-2f2d06506c9167dada05b11debe717334de972d4.zip external_llvm-2f2d06506c9167dada05b11debe717334de972d4.tar.gz external_llvm-2f2d06506c9167dada05b11debe717334de972d4.tar.bz2 |
Fixed spelling and grammar.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8478 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Analysis/BasicAliasAnalysis.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/DataStructure/DataStructure.cpp | 6 | ||||
-rw-r--r-- | lib/Analysis/DataStructure/DataStructureAA.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/DataStructure/IPModRef.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/DataStructure/Local.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/IPA/DependenceGraph.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/IPA/IPModRef.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/InductionVariable.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp | 4 | ||||
-rw-r--r-- | lib/Analysis/LoadValueNumbering.cpp | 4 | ||||
-rw-r--r-- | lib/Analysis/PostDominators.cpp | 2 | ||||
-rw-r--r-- | lib/Analysis/ValueNumbering.cpp | 4 | ||||
-rw-r--r-- | lib/Target/SparcV9/LiveVar/FunctionLiveVarInfo.cpp | 4 |
13 files changed, 19 insertions, 19 deletions
diff --git a/lib/Analysis/BasicAliasAnalysis.cpp b/lib/Analysis/BasicAliasAnalysis.cpp index 8b34d25..54614d7 100644 --- a/lib/Analysis/BasicAliasAnalysis.cpp +++ b/lib/Analysis/BasicAliasAnalysis.cpp @@ -110,7 +110,7 @@ BasicAliasAnalysis::alias(const Value *V1, unsigned V1Size, const Value *O1 = getUnderlyingObject(V1); const Value *O2 = getUnderlyingObject(V2); - // Pointing at a discernable object? + // Pointing at a discernible object? if (O1 && O2) { // If they are two different objects, we know that we have no alias... if (O1 != O2) return NoAlias; diff --git a/lib/Analysis/DataStructure/DataStructure.cpp b/lib/Analysis/DataStructure/DataStructure.cpp index 241c2a9..24bed38 100644 --- a/lib/Analysis/DataStructure/DataStructure.cpp +++ b/lib/Analysis/DataStructure/DataStructure.cpp @@ -960,7 +960,7 @@ void DSGraph::cloneInto(const DSGraph &G, ScalarMapTy &OldValMap, } if (!(CloneFlags & DontCloneAuxCallNodes)) { - // Copy the auxillary function calls list... + // Copy the auxiliary function calls list... unsigned FC = AuxFunctionCalls.size(); // FirstCall AuxFunctionCalls.reserve(FC+G.AuxFunctionCalls.size()); for (unsigned i = 0, ei = G.AuxFunctionCalls.size(); i != ei; ++i) @@ -1062,7 +1062,7 @@ static void markIncompleteNode(DSNode *N) { // Actually mark the node N->setIncompleteMarker(); - // Recusively process children... + // Recursively process children... for (unsigned i = 0, e = N->getSize(); i < e; i += DS::PointerSize) if (DSNode *DSN = N->getLink(i).getNode()) markIncompleteNode(DSN); @@ -1386,7 +1386,7 @@ void DSGraph::removeDeadNodes(unsigned Flags) { // merging... removeTriviallyDeadNodes(); - // FIXME: Merge nontrivially identical call nodes... + // FIXME: Merge non-trivially identical call nodes... // Alive - a set that holds all nodes found to be reachable/alive. hash_set<DSNode*> Alive; diff --git a/lib/Analysis/DataStructure/DataStructureAA.cpp b/lib/Analysis/DataStructure/DataStructureAA.cpp index e7e963a..51df033 100644 --- a/lib/Analysis/DataStructure/DataStructureAA.cpp +++ b/lib/Analysis/DataStructure/DataStructureAA.cpp @@ -102,7 +102,7 @@ AliasAnalysis::AliasResult DSAA::alias(const Value *V1, unsigned V1Size, DSNode *N1 = I->second.getNode(), *N2 = J->second.getNode(); unsigned O1 = I->second.getOffset(), O2 = J->second.getOffset(); - // We can only make a judgement of one of the nodes is complete... + // We can only make a judgment of one of the nodes is complete... if (N1->isComplete() || N2->isComplete()) { if (N1 != N2) return NoAlias; // Completely different nodes. diff --git a/lib/Analysis/DataStructure/IPModRef.cpp b/lib/Analysis/DataStructure/IPModRef.cpp index 86bddc8..a90b5c6 100644 --- a/lib/Analysis/DataStructure/IPModRef.cpp +++ b/lib/Analysis/DataStructure/IPModRef.cpp @@ -183,7 +183,7 @@ DSGraph* FunctionModRefInfo::ResolveCallSiteModRefInfo(CallInst &CI, // Compute Mod/Ref bit vectors for a single call site. // These are copies of the Read/Write flags from the nodes of -// the graph produced by clearing all flags in teh caller's TD graph +// the graph produced by clearing all flags in the caller's TD graph // and then inlining the callee's BU graph into the caller's TD graph. // void diff --git a/lib/Analysis/DataStructure/Local.cpp b/lib/Analysis/DataStructure/Local.cpp index a03354d..cd81aab 100644 --- a/lib/Analysis/DataStructure/Local.cpp +++ b/lib/Analysis/DataStructure/Local.cpp @@ -347,7 +347,7 @@ void GraphBuilder::visitGetElementPtrInst(User &GEP) { unsigned RawOffset = Offset+Value.getOffset(); // Loop over all of the elements of the array, merging them into the - // zero'th element. + // zeroth element. for (unsigned i = 1, e = ATy->getNumElements(); i != e; ++i) // Merge all of the byte components of this array element for (unsigned j = 0; j != ElSize; ++j) diff --git a/lib/Analysis/IPA/DependenceGraph.cpp b/lib/Analysis/IPA/DependenceGraph.cpp index 284a96a..faabdd3 100644 --- a/lib/Analysis/IPA/DependenceGraph.cpp +++ b/lib/Analysis/IPA/DependenceGraph.cpp @@ -1,6 +1,6 @@ //===- DependenceGraph.cpp - Dependence graph for a function ----*- C++ -*-===// // -// This file implments an explicit representation for the dependence graph +// This file implements an explicit representation for the dependence graph // of a function, with one node per instruction and one edge per dependence. // Dependences include both data and control dependences. // diff --git a/lib/Analysis/IPA/IPModRef.cpp b/lib/Analysis/IPA/IPModRef.cpp index 86bddc8..a90b5c6 100644 --- a/lib/Analysis/IPA/IPModRef.cpp +++ b/lib/Analysis/IPA/IPModRef.cpp @@ -183,7 +183,7 @@ DSGraph* FunctionModRefInfo::ResolveCallSiteModRefInfo(CallInst &CI, // Compute Mod/Ref bit vectors for a single call site. // These are copies of the Read/Write flags from the nodes of -// the graph produced by clearing all flags in teh caller's TD graph +// the graph produced by clearing all flags in the caller's TD graph // and then inlining the callee's BU graph into the caller's TD graph. // void diff --git a/lib/Analysis/InductionVariable.cpp b/lib/Analysis/InductionVariable.cpp index 3e33ca1..334a72b 100644 --- a/lib/Analysis/InductionVariable.cpp +++ b/lib/Analysis/InductionVariable.cpp @@ -178,7 +178,7 @@ Value *InductionVariable::getExecutionCount(LoopInfo *LoopInfo) { return 0; } - // Find final node: predecesor of the loop header that's also an exit + // Find final node: predecessor of the loop header that's also an exit BasicBlock *terminator = 0; for (pred_iterator PI = pred_begin(L->getHeader()), PE = pred_end(L->getHeader()); PI != PE; ++PI) diff --git a/lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp b/lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp index 764ec36..8c95eaa 100644 --- a/lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp +++ b/lib/Analysis/LiveVar/FunctionLiveVarInfo.cpp @@ -175,7 +175,7 @@ void FunctionLiveVarInfo::releaseMemory() { // Following functions will give the LiveVar info for any machine instr in // a function. It should be called after a call to analyze(). // -// Thsese functions calucluates live var info for all the machine instrs in a +// These functions calculate live var info for all the machine instrs in a // BB when LVInfo for one inst is requested. Hence, this function is useful // when live var info is required for many (or all) instructions in a basic // block. Also, the arguments to this function does not require specific @@ -217,7 +217,7 @@ FunctionLiveVarInfo::getLiveVarSetAfterMInst(const MachineInstr *MI, // This function applies a machine instr to a live var set (accepts OutSet) and // makes necessary changes to it (produces InSet). Note that two for loops are // used to first kill all defs and then to add all uses. This is because there -// can be instructions like Val = Val + 1 since we allow multipe defs to a +// can be instructions like Val = Val + 1 since we allow multiple defs to a // machine instruction operand. // static void applyTranferFuncForMInst(ValueSet &LVS, const MachineInstr *MInst) { diff --git a/lib/Analysis/LoadValueNumbering.cpp b/lib/Analysis/LoadValueNumbering.cpp index 79e071d..2022065 100644 --- a/lib/Analysis/LoadValueNumbering.cpp +++ b/lib/Analysis/LoadValueNumbering.cpp @@ -109,7 +109,7 @@ void LoadVN::getEqualNumberNodes(Value *V, Function *F = LI->getParent()->getParent(); // Now that we know the set of equivalent source pointers for the load - // instruction, look to see if there are any load or store candiates that + // instruction, look to see if there are any load or store candidates that // are identical. // std::vector<LoadInst*> CandidateLoads; @@ -148,7 +148,7 @@ void LoadVN::getEqualNumberNodes(Value *V, AliasAnalysis &AA = getAnalysis<AliasAnalysis>(); DominatorSet &DomSetInfo = getAnalysis<DominatorSet>(); - // Loop over all of the candindate loads. If they are not invalidated by + // Loop over all of the candidate loads. If they are not invalidated by // stores or calls between execution of them and LI, then add them to // RetVals. for (unsigned i = 0, e = CandidateLoads.size(); i != e; ++i) diff --git a/lib/Analysis/PostDominators.cpp b/lib/Analysis/PostDominators.cpp index 7dbeb35..f97fda8 100644 --- a/lib/Analysis/PostDominators.cpp +++ b/lib/Analysis/PostDominators.cpp @@ -181,7 +181,7 @@ PostDominanceFrontier::calculate(const PostDominatorTree &DT, if (BB) for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB); SI != SE; ++SI) - // Does Node immediately dominate this predeccessor? + // Does Node immediately dominate this predecessor? if (DT[*SI]->getIDom() != Node) S.insert(*SI); diff --git a/lib/Analysis/ValueNumbering.cpp b/lib/Analysis/ValueNumbering.cpp index 53d70e8..d28f0b7 100644 --- a/lib/Analysis/ValueNumbering.cpp +++ b/lib/Analysis/ValueNumbering.cpp @@ -100,7 +100,7 @@ void BVNImpl::visitCastInst(CastInst &CI) { // Check to see if this new cast is not I, but has the same operand... if (Other != &I && Other->getOpcode() == I.getOpcode() && Other->getOperand(0) == Op && // Is the operand the same? - // Is it embeded in the same function? (This could be false if LHS + // Is it embedded in the same function? (This could be false if LHS // is a constant or global!) Other->getParent()->getParent() == F && @@ -118,7 +118,7 @@ void BVNImpl::visitCastInst(CastInst &CI) { // static inline bool isIdenticalBinaryInst(const Instruction &I1, const Instruction *I2) { - // Is it embeded in the same function? (This could be false if LHS + // Is it embedded in the same function? (This could be false if LHS // is a constant or global!) if (I1.getOpcode() != I2->getOpcode() || I1.getParent()->getParent() != I2->getParent()->getParent()) diff --git a/lib/Target/SparcV9/LiveVar/FunctionLiveVarInfo.cpp b/lib/Target/SparcV9/LiveVar/FunctionLiveVarInfo.cpp index 764ec36..8c95eaa 100644 --- a/lib/Target/SparcV9/LiveVar/FunctionLiveVarInfo.cpp +++ b/lib/Target/SparcV9/LiveVar/FunctionLiveVarInfo.cpp @@ -175,7 +175,7 @@ void FunctionLiveVarInfo::releaseMemory() { // Following functions will give the LiveVar info for any machine instr in // a function. It should be called after a call to analyze(). // -// Thsese functions calucluates live var info for all the machine instrs in a +// These functions calculate live var info for all the machine instrs in a // BB when LVInfo for one inst is requested. Hence, this function is useful // when live var info is required for many (or all) instructions in a basic // block. Also, the arguments to this function does not require specific @@ -217,7 +217,7 @@ FunctionLiveVarInfo::getLiveVarSetAfterMInst(const MachineInstr *MI, // This function applies a machine instr to a live var set (accepts OutSet) and // makes necessary changes to it (produces InSet). Note that two for loops are // used to first kill all defs and then to add all uses. This is because there -// can be instructions like Val = Val + 1 since we allow multipe defs to a +// can be instructions like Val = Val + 1 since we allow multiple defs to a // machine instruction operand. // static void applyTranferFuncForMInst(ValueSet &LVS, const MachineInstr *MInst) { |