diff options
50 files changed, 65 insertions, 65 deletions
diff --git a/docs/AliasAnalysis.html b/docs/AliasAnalysis.html index d29ec927fe..51a80ef09c 100644 --- a/docs/AliasAnalysis.html +++ b/docs/AliasAnalysis.html @@ -68,7 +68,7 @@ this class exposes Mod/Ref information from those implementations which can provide it, allowing for powerful analyses and transformations to work well together.<p> -This document contains information neccesary to successfully implement this +This document contains information necessary to successfully implement this interface, use it, and to test both sides. It also explains some of the finer points about what exactly results mean. If you feel that something is unclear or should be added, please <a href="mailto:sabre@nondot.org">let me know</a>.<p> diff --git a/docs/CodingStandards.html b/docs/CodingStandards.html index 1f6efd6579..700fe1b883 100644 --- a/docs/CodingStandards.html +++ b/docs/CodingStandards.html @@ -93,7 +93,7 @@ Every source file should have a header on it that describes the basic purpose of //===----------------------------------------------------------------------===// </pre> -A few things to note about this particular format. The "<tt>-*- C++ -*-</tt>" string on the first line is there to tell Emacs that the source file is a C++ file, not a C file (Emacs assumes .h files are C files by default [Note that tag this is not neccesary in .cpp files]). The name of the file is also on the first line, along with a very short description of the purpose of the file. This is important when printing out code and flipping though lots of pages.<p> +A few things to note about this particular format. The "<tt>-*- C++ -*-</tt>" string on the first line is there to tell Emacs that the source file is a C++ file, not a C file (Emacs assumes .h files are C files by default [Note that tag this is not necessary in .cpp files]). The name of the file is also on the first line, along with a very short description of the purpose of the file. This is important when printing out code and flipping though lots of pages.<p> The main body of the description does not have to be very long in most cases. Here it's only two lines. If an algorithm is being implemented or something tricky is going on, a reference to the paper where it is published should be included, as well as any notes or "gotchas" in the code to watch out for.<p> @@ -105,7 +105,7 @@ Classes are one fundemental part of a good object oriented design. As such, a c <h4><li>Method information</h4> -Methods defined in a class (as well as any global functions) should also be documented properly. A quick note about what it does any a description of the borderline behaviour is all that is neccesary here (unless something particularly tricky or insideous is going on). The hope is that people can figure out how to use your interfaces without reading the code itself... that is the goal metric.<p> +Methods defined in a class (as well as any global functions) should also be documented properly. A quick note about what it does any a description of the borderline behaviour is all that is necessary here (unless something particularly tricky or insideous is going on). The hope is that people can figure out how to use your interfaces without reading the code itself... that is the goal metric.<p> Good things to talk about here are what happens when something unexpected happens: does the method return null? Abort? Format your hard disk?<p> </ol> diff --git a/docs/HistoricalNotes/2001-02-09-AdveCommentsResponse.txt b/docs/HistoricalNotes/2001-02-09-AdveCommentsResponse.txt index 4d2879554a..5c87330fb7 100644 --- a/docs/HistoricalNotes/2001-02-09-AdveCommentsResponse.txt +++ b/docs/HistoricalNotes/2001-02-09-AdveCommentsResponse.txt @@ -150,7 +150,7 @@ needed... Conditional move is effectly a special case of a predicated instruction... and I think that all predicated instructions can possibly be implemented later in LLVM. It would significantly change things, and -it doesn't seem to be very neccesary right now. It would seem to +it doesn't seem to be very necessary right now. It would seem to complicate flow control analysis a LOT in the virtual machine. I would tend to prefer that a predicated architecture like IA64 convert from a "basic block" representation to a predicated rep as part of it's dynamic diff --git a/docs/HistoricalNotes/2001-05-18-ExceptionHandling.txt b/docs/HistoricalNotes/2001-05-18-ExceptionHandling.txt index 2e0b794075..b546301d35 100644 --- a/docs/HistoricalNotes/2001-05-18-ExceptionHandling.txt +++ b/docs/HistoricalNotes/2001-05-18-ExceptionHandling.txt @@ -144,7 +144,7 @@ least*: 2. A pointer to the dtor for the contained object 3. The contained object itself -Note that it is neccesary to maintain #1 & #2 in the exception object itself +Note that it is necessary to maintain #1 & #2 in the exception object itself because objects without virtual function tables may be thrown (as in this example). Assuming this, TryHandler would look something like this: diff --git a/docs/HistoricalNotes/2002-06-25-MegaPatchInfo.txt b/docs/HistoricalNotes/2002-06-25-MegaPatchInfo.txt index 9709ce5db5..2ca46117ca 100644 --- a/docs/HistoricalNotes/2002-06-25-MegaPatchInfo.txt +++ b/docs/HistoricalNotes/2002-06-25-MegaPatchInfo.txt @@ -43,7 +43,7 @@ Changes: which is much more natural and what users expect. -* Simplification of #include's: Before, it was neccesary for a .cpp file to +* Simplification of #include's: Before, it was necessary for a .cpp file to include every .h file that it used. Now things are batched a little bit more to make it easier to use. Specifically, the include graph now includes these edges: diff --git a/docs/OpenProjects.html b/docs/OpenProjects.html index 740c9db103..574f4d34d3 100644 --- a/docs/OpenProjects.html +++ b/docs/OpenProjects.html @@ -92,7 +92,7 @@ could use the following improvements:<p> <li>Graphs - It would be great to have gnuplot graphs to keep track of how the tree is changing over time. We already gather a several statistics, it - just neccesary to add the script-fu to gnuplotize it. + just necessary to add the script-fu to gnuplotize it. <li>Regression tests - We should run the regression tests in addition to the program tests... diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 6c2659876b..be40ba32f1 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -1452,7 +1452,7 @@ list.<p> <li><tt>Function::BasicBlockListType &getBasicBlockList()</tt><p> Returns the list of <a href="#BasicBlock"><tt>BasicBlock</tt></a>s. This is -neccesary to use when you need to update the list or perform a complex action +necessary to use when you need to update the list or perform a complex action that doesn't have a forwarding method.<p> @@ -1467,7 +1467,7 @@ These are forwarding methods that make it easy to access the contents of a <li><tt>Function::ArgumentListType &getArgumentList()</tt><p> Returns the list of <a href="#Argument"><tt>Argument</tt></a>s. This is -neccesary to use when you need to update the list or perform a complex action +necessary to use when you need to update the list or perform a complex action that doesn't have a forwarding method.<p> @@ -1583,7 +1583,7 @@ list.<p> <li><tt>Module::FunctionListType &getFunctionList()</tt><p> Returns the list of <a href="#Function"><tt>Function</tt></a>s. This is -neccesary to use when you need to update the list or perform a complex action +necessary to use when you need to update the list or perform a complex action that doesn't have a forwarding method.<p> <!-- Global Variable --> @@ -1601,7 +1601,7 @@ list.<p> <li><tt>Module::GlobalListType &getGlobalList()</tt><p> Returns the list of <a href="#GlobalVariable"><tt>GlobalVariable</tt></a>s. -This is neccesary to use when you need to update the list or perform a complex +This is necessary to use when you need to update the list or perform a complex action that doesn't have a forwarding method.<p> diff --git a/docs/WritingAnLLVMPass.html b/docs/WritingAnLLVMPass.html index a39369fc29..e176435a15 100644 --- a/docs/WritingAnLLVMPass.html +++ b/docs/WritingAnLLVMPass.html @@ -367,7 +367,7 @@ available, from the most general to the most specific.<p> When choosing a superclass for your Pass, you should choose the <b>most specific</b> class possible, while still being able to meet the requirements -listed. This gives the LLVM Pass Infrastructure information neccesary to +listed. This gives the LLVM Pass Infrastructure information necessary to optimize how passes are run, so that the resultant compiler isn't unneccesarily slow.<p> @@ -476,7 +476,7 @@ href="http://llvm.cs.uiuc.edu/doxygen/LowerAllocations_8cpp-source.html">LowerAl pass. This pass converts <tt>malloc</tt> and <tt>free</tt> instructions into platform dependant <tt>malloc()</tt> and <tt>free()</tt> function calls. It uses the <tt>doInitialization</tt> method to get a reference to the malloc and -free functions that it needs, adding prototypes to the module if neccesary.<p> +free functions that it needs, adding prototypes to the module if necessary.<p> <!-- _______________________________________________________________________ --> </ul><h4><a name="runOnFunction"><hr size=0>The <tt>runOnFunction</tt> method</h4><ul> diff --git a/include/Support/DOTGraphTraits.h b/include/Support/DOTGraphTraits.h index f67035f597..2371b66407 100644 --- a/include/Support/DOTGraphTraits.h +++ b/include/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/Support/PostOrderIterator.h b/include/Support/PostOrderIterator.h index 178125405e..d976f08876 100644 --- a/include/Support/PostOrderIterator.h +++ b/include/Support/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/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; diff --git a/lib/Analysis/LoadValueNumbering.cpp b/lib/Analysis/LoadValueNumbering.cpp index a850f81dcc..c47010c383 100644 --- a/lib/Analysis/LoadValueNumbering.cpp +++ b/lib/Analysis/LoadValueNumbering.cpp @@ -130,7 +130,7 @@ void LoadVN::getEqualNumberNodes(Value *V, // Remove duplicates from the CandidateLoads list because alias analysis // processing may be somewhat expensive and we don't want to do more work - // than neccesary. + // than necessary. // unsigned OldSize = CandidateLoads.size(); std::sort(CandidateLoads.begin(), CandidateLoads.end()); diff --git a/lib/AsmParser/llvmAsmParser.y b/lib/AsmParser/llvmAsmParser.y index a06a4b7fc2..a90b5f5edb 100644 --- a/lib/AsmParser/llvmAsmParser.y +++ b/lib/AsmParser/llvmAsmParser.y @@ -107,7 +107,7 @@ static struct PerModuleInfo { if (I != GlobalRefs.end()) { GlobalVariable *OldGV = I->second; // Get the placeholder... - I->first.second.destroy(); // Free string memory if neccesary + I->first.second.destroy(); // Free string memory if necessary // Loop over all of the uses of the GlobalValue. The only thing they are // allowed to be is ConstantPointerRef's. diff --git a/lib/Bytecode/Reader/Reader.cpp b/lib/Bytecode/Reader/Reader.cpp index 42ba5d9584..097a8d4dc7 100644 --- a/lib/Bytecode/Reader/Reader.cpp +++ b/lib/Bytecode/Reader/Reader.cpp @@ -665,7 +665,7 @@ Module *ParseBytecodeBuffer(const unsigned char *Buffer, unsigned Length, Module *R = Parser.ParseBytecode(Buffer, Buffer+Length, ModuleID); if (ErrorStr) *ErrorStr = Parser.getError(); - delete [] PtrToDelete; // Delete alignment buffer if neccesary + delete [] PtrToDelete; // Delete alignment buffer if necessary return R; } diff --git a/lib/CodeGen/RegAllocSimple.cpp b/lib/CodeGen/RegAllocSimple.cpp index ba571e4116..57d678b02f 100644 --- a/lib/CodeGen/RegAllocSimple.cpp +++ b/lib/CodeGen/RegAllocSimple.cpp @@ -58,7 +58,7 @@ namespace { void AllocateBasicBlock(MachineBasicBlock &MBB); /// getStackSpaceFor - This returns the offset of the specified virtual - /// register on the stack, allocating space if neccesary. + /// register on the stack, allocating space if necessary. int getStackSpaceFor(unsigned VirtReg, const TargetRegisterClass *RC); /// Given a virtual register, return a compatible physical register that is diff --git a/lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp b/lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp index b171affd1c..73deed9ab2 100644 --- a/lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp +++ b/lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp @@ -354,7 +354,7 @@ static void ByteswapSCANFResults(const char *Fmt, void *Arg0, void *Arg1, void *Args[] = { Arg0, Arg1, Arg2, Arg3, Arg4, Arg5, Arg6, Arg7, Arg8, 0 }; // Loop over the format string, munging read values as appropriate (performs - // byteswaps as neccesary). + // byteswaps as necessary). unsigned ArgNo = 0; while (*Fmt) { if (*Fmt++ == '%') { diff --git a/lib/Target/CBackend/CBackend.cpp b/lib/Target/CBackend/CBackend.cpp index 6a80019091..0443c18475 100644 --- a/lib/Target/CBackend/CBackend.cpp +++ b/lib/Target/CBackend/CBackend.cpp @@ -924,7 +924,7 @@ void CWriter::printFunction(Function *F) { } // 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... // void CWriter::visitReturnInst(ReturnInst &I) { // Don't output a void return if this is the last basic block in the function @@ -1024,7 +1024,7 @@ void CWriter::visitBranchInst(BranchInst &I) { printBranchToBlock(I.getParent(), I.getSuccessor(1), 2); } } else { - // First goto not neccesary, assume second one is... + // First goto not necessary, assume second one is... Out << " if (!"; writeOperand(I.getCondition()); Out << ") {\n"; diff --git a/lib/Target/CBackend/Writer.cpp b/lib/Target/CBackend/Writer.cpp index 6a80019091..0443c18475 100644 --- a/lib/Target/CBackend/Writer.cpp +++ b/lib/Target/CBackend/Writer.cpp @@ -924,7 +924,7 @@ void CWriter::printFunction(Function *F) { } // 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... // void CWriter::visitReturnInst(ReturnInst &I) { // Don't output a void return if this is the last basic block in the function @@ -1024,7 +1024,7 @@ void CWriter::visitBranchInst(BranchInst &I) { printBranchToBlock(I.getParent(), I.getSuccessor(1), 2); } } else { - // First goto not neccesary, assume second one is... + // First goto not necessary, assume second one is... Out << " if (!"; writeOperand(I.getCondition()); Out << ") {\n"; diff --git a/lib/Target/SparcV9/SparcV9AsmPrinter.cpp b/lib/Target/SparcV9/SparcV9AsmPrinter.cpp index 13b3c38c97..3a9893162b 100644 --- a/lib/Target/SparcV9/SparcV9AsmPrinter.cpp +++ b/lib/Target/Spa |