summaryrefslogtreecommitdiff
path: root/include/llvm
diff options
context:
space:
mode:
Diffstat (limited to 'include/llvm')
-rw-r--r--include/llvm/ADT/PostOrderIterator.h2
-rw-r--r--include/llvm/Analysis/AliasSetTracker.h2
-rw-r--r--include/llvm/Analysis/Dominators.h2
-rw-r--r--include/llvm/Analysis/IntervalIterator.h2
-rw-r--r--include/llvm/Bytecode/Primitives.h2
-rw-r--r--include/llvm/Pass.h8
-rw-r--r--include/llvm/Support/DOTGraphTraits.h2
-rw-r--r--include/llvm/Support/InstVisitor.h2
-rw-r--r--include/llvm/Target/TargetData.h2
9 files changed, 12 insertions, 12 deletions
diff --git a/include/llvm/ADT/PostOrderIterator.h b/include/llvm/ADT/PostOrderIterator.h
index 178125405e..d976f08876 100644
--- a/include/llvm/ADT/PostOrderIterator.h
+++ b/include/llvm/ADT/PostOrderIterator.h
@@ -109,7 +109,7 @@ ipo_iterator<T> ipo_end(T G){
// computer RPO from a graph. Because of this, the construction of the
// ReversePostOrderTraversal object is expensive (it must walk the entire graph
// with a postorder iterator to build the data structures). The moral of this
-// story is: Don't create more ReversePostOrderTraversal classes than neccesary.
+// story is: Don't create more ReversePostOrderTraversal classes than necessary.
//
// This class should be used like this:
// {
diff --git a/include/llvm/Analysis/AliasSetTracker.h b/include/llvm/Analysis/AliasSetTracker.h
index 45867ae916..53e61ba80a 100644
--- a/include/llvm/Analysis/AliasSetTracker.h
+++ b/include/llvm/Analysis/AliasSetTracker.h
@@ -77,7 +77,7 @@ class AliasSet {
/// AccessType - Keep track of whether this alias set merely refers to the
/// locations of memory, whether it modifies the memory, or whether it does
/// both. The lattice goes from "NoModRef" to either Refs or Mods, then to
- /// ModRef as neccesary.
+ /// ModRef as necessary.
///
enum AccessType {
NoModRef = 0, Refs = 1, // Ref = bit 1
diff --git a/include/llvm/Analysis/Dominators.h b/include/llvm/Analysis/Dominators.h
index a38d7d199a..76f9111b8d 100644
--- a/include/llvm/Analysis/Dominators.h
+++ b/include/llvm/Analysis/Dominators.h
@@ -96,7 +96,7 @@ public:
virtual void print(std::ostream &OS) const;
/// dominates - Return true if A dominates B. This performs the special
- /// checks neccesary if A and B are in the same basic block.
+ /// checks necessary if A and B are in the same basic block.
///
bool dominates(Instruction *A, Instruction *B) const;
diff --git a/include/llvm/Analysis/IntervalIterator.h b/include/llvm/Analysis/IntervalIterator.h
index 09bfc92aeb..e533f8ac16 100644
--- a/include/llvm/Analysis/IntervalIterator.h
+++ b/include/llvm/Analysis/IntervalIterator.h
@@ -133,7 +133,7 @@ public:
if (Done) return *this; // Found a new interval! Use it!
}
- // Free interval memory... if neccesary
+ // Free interval memory... if necessary
if (IOwnMem) delete IntStack.top().first;
// We ran out of successors for this interval... pop off the stack
diff --git a/include/llvm/Bytecode/Primitives.h b/include/llvm/Bytecode/Primitives.h
index ee552c2fbb..f8158a0c1a 100644
--- a/include/llvm/Bytecode/Primitives.h
+++ b/include/llvm/Bytecode/Primitives.h
@@ -5,7 +5,7 @@
//
// Using the routines defined in this file does not require linking to any
// libraries, as all of the services are small self contained units that are to
-// be inlined as neccesary.
+// be inlined as necessary.
//
//===----------------------------------------------------------------------===//
diff --git a/include/llvm/Pass.h b/include/llvm/Pass.h
index 6ed693ec08..a0fa060fbf 100644
--- a/include/llvm/Pass.h
+++ b/include/llvm/Pass.h
@@ -81,7 +81,7 @@ public:
/// print - Print out the internal state of the pass. This is called by
/// Analyze to print out the contents of an analysis. Otherwise it is not
- /// neccesary to implement this method. Beware that the module pointer MAY be
+ /// necessary to implement this method. Beware that the module pointer MAY be
/// null. This automatically forwards to a virtual function that does not
/// provide the Module* in case the analysis doesn't need it it can just be
/// ignored.
@@ -239,7 +239,7 @@ private:
///
struct FunctionPass : public Pass {
/// doInitialization - Virtual method overridden by subclasses to do
- /// any neccesary per-module initialization.
+ /// any necessary per-module initialization.
///
virtual bool doInitialization(Module &M) { return false; }
@@ -285,12 +285,12 @@ private:
///
struct BasicBlockPass : public FunctionPass {
/// doInitialization - Virtual method overridden by subclasses to do
- /// any neccesary per-module initialization.
+ /// any necessary per-module initialization.
///
virtual bool doInitialization(Module &M) { return false; }
/// doInitialization - Virtual method overridden by BasicBlockPass subclasses
- /// to do any neccesary per-function initialization.
+ /// to do any necessary per-function initialization.
///
virtual bool doInitialization(Function &F) { return false; }
diff --git a/include/llvm/Support/DOTGraphTraits.h b/include/llvm/Support/DOTGraphTraits.h
index f67035f597..2371b66407 100644
--- a/include/llvm/Support/DOTGraphTraits.h
+++ b/include/llvm/Support/DOTGraphTraits.h
@@ -73,7 +73,7 @@ struct DefaultDOTGraphTraits {
/// addCustomGraphFeatures - If a graph is made up of more than just
/// straight-forward nodes and edges, this is the place to put all of the
- /// custom stuff neccesary. The GraphWriter object, instantiated with your
+ /// custom stuff necessary. The GraphWriter object, instantiated with your
/// GraphType is passed in as an argument. You may call arbitrary methods on
/// it to add things to the output graph.
///
diff --git a/include/llvm/Support/InstVisitor.h b/include/llvm/Support/InstVisitor.h
index 6004aac88f..932bd91a6a 100644
--- a/include/llvm/Support/InstVisitor.h
+++ b/include/llvm/Support/InstVisitor.h
@@ -155,7 +155,7 @@ struct InstVisitor {
// Specific Instruction type classes... note that all of the casts are
- // neccesary because we use the instruction classes as opaque types...
+ // necessary because we use the instruction classes as opaque types...
//
RetTy visitReturnInst(ReturnInst &I) { DELEGATE(TerminatorInst);}
RetTy visitBranchInst(BranchInst &I) { DELEGATE(TerminatorInst);}
diff --git a/include/llvm/Target/TargetData.h b/include/llvm/Target/TargetData.h
index a9bf2182da..11d078c232 100644
--- a/include/llvm/Target/TargetData.h
+++ b/include/llvm/Target/TargetData.h
@@ -61,7 +61,7 @@ public:
unsigned char getPointerSize() const { return PointerSize; }
AnnotationID getStructLayoutAID() const { return AID; }
- // getTypeSize - Return the number of bytes neccesary to hold the specified
+ // getTypeSize - Return the number of bytes necessary to hold the specified
// type
uint64_t getTypeSize (const Type *Ty) const;