From: Ed Maste Date: Tue, 14 Apr 2015 20:52:58 +0000 (+0000) Subject: Correct 'teh' and other typos / repeated words. X-Git-Url: http://plrg.eecs.uci.edu/git/?p=oota-llvm.git;a=commitdiff_plain;h=ffc045ab802ea542aabf1f1f22f97cb8a0ad6cde Correct 'teh' and other typos / repeated words. Patch by Eitan Adler. Differential Revision: http://reviews.llvm.org/D8514 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@234939 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/docs/Bugpoint.rst b/docs/Bugpoint.rst index 8fa64bc1242..6bd7ff99564 100644 --- a/docs/Bugpoint.rst +++ b/docs/Bugpoint.rst @@ -208,7 +208,7 @@ point---a simple binary search may not be sufficient, as transformations that interact may require isolating more than one call. In TargetLowering, use ``return SDNode();`` instead of ``return false;``. -Now that that the number of transformations is down to a manageable number, try +Now that the number of transformations is down to a manageable number, try examining the output to see if you can figure out which transformations are being done. If that can be figured out, then do the usual debugging. If which code corresponds to the transformation being performed isn't obvious, set a diff --git a/docs/LangRef.rst b/docs/LangRef.rst index e0d45bca64f..0edd6a6c769 100644 --- a/docs/LangRef.rst +++ b/docs/LangRef.rst @@ -3370,7 +3370,7 @@ instructions (loads, stores, memory-accessing calls, etc.) that carry ``noalias`` metadata can specifically be specified not to alias with some other collection of memory access instructions that carry ``alias.scope`` metadata. Each type of metadata specifies a list of scopes where each scope has an id and -a domain. When evaluating an aliasing query, if for some some domain, the set +a domain. When evaluating an aliasing query, if for some domain, the set of scopes with that domain in one instruction's ``alias.scope`` list is a subset of (or equal to) the set of scopes for that domain in another instruction's ``noalias`` list, then the two memory accesses are assumed not to @@ -6577,7 +6577,7 @@ Arguments: """""""""" The '``ptrtoint``' instruction takes a ``value`` to cast, which must be -a a value of type :ref:`pointer ` or a vector of pointers, and a +a value of type :ref:`pointer ` or a vector of pointers, and a type to cast it to ``ty2``, which must be an :ref:`integer ` or a vector of integers type. diff --git a/docs/ProgrammersManual.rst b/docs/ProgrammersManual.rst index 2c7e4a9954a..1e7e3ac1aea 100644 --- a/docs/ProgrammersManual.rst +++ b/docs/ProgrammersManual.rst @@ -940,7 +940,7 @@ There are a variety of ways to pass around and use strings in C and C++, and LLVM adds a few new options to choose from. Pick the first option on this list that will do what you need, they are ordered according to their relative cost. -Note that is is generally preferred to *not* pass strings around as ``const +Note that it is generally preferred to *not* pass strings around as ``const char*``'s. These have a number of problems, including the fact that they cannot represent embedded nul ("\0") characters, and do not have a length available efficiently. The general replacement for '``const char*``' is @@ -2651,7 +2651,7 @@ Important Derived Types Subclass of SequentialType for vector types. A vector type is similar to an ArrayType but is distinguished because it is a first class type whereas ArrayType is not. Vector types are used for vector operations and are usually - small vectors of of an integer or floating point type. + small vectors of an integer or floating point type. ``StructType`` Subclass of DerivedTypes for struct types. diff --git a/docs/Vectorizers.rst b/docs/Vectorizers.rst index 2b702179bf2..65c19aa2bc0 100644 --- a/docs/Vectorizers.rst +++ b/docs/Vectorizers.rst @@ -366,7 +366,7 @@ The decision to unroll the loop depends on the register pressure and the generat Performance ----------- -This section shows the the execution time of Clang on a simple benchmark: +This section shows the execution time of Clang on a simple benchmark: `gcc-loops `_. This benchmarks is a collection of loops from the GCC autovectorization `page `_ by Dorit Nuzman. diff --git a/docs/YamlIO.rst b/docs/YamlIO.rst index 76dd021f82f..3cc683b6b82 100644 --- a/docs/YamlIO.rst +++ b/docs/YamlIO.rst @@ -332,7 +332,7 @@ as a field type: } }; -When reading YAML, if the string found does not match any of the the strings +When reading YAML, if the string found does not match any of the strings specified by enumCase() methods, an error is automatically generated. When writing YAML, if the value being written does not match any of the values specified by the enumCase() methods, a runtime assertion is triggered. @@ -767,7 +767,7 @@ add "static const bool flow = true;". For instance: }; With the above, if you used MyList as the data type in your native data -structures, then then when converted to YAML, a flow sequence of integers +structures, then when converted to YAML, a flow sequence of integers will be used (e.g. [ 10, -3, 4 ]). diff --git a/docs/tutorial/LangImpl5.rst b/docs/tutorial/LangImpl5.rst index 2dbc8322fc9..ca2ffebc19a 100644 --- a/docs/tutorial/LangImpl5.rst +++ b/docs/tutorial/LangImpl5.rst @@ -254,7 +254,7 @@ In `Chapter 7 `_ of this tutorial ("mutable variables"), we'll talk about #1 in depth. For now, just believe me that you don't need SSA construction to handle this case. For #2, you have the choice of using the techniques that we will describe for #1, or you can insert -Phi nodes directly, if convenient. In this case, it is really really +Phi nodes directly, if convenient. In this case, it is really easy to generate the Phi node, so we choose to do it directly. Okay, enough of the motivation and overview, lets generate code! diff --git a/docs/tutorial/LangImpl7.rst b/docs/tutorial/LangImpl7.rst index c44590836b8..648940785b0 100644 --- a/docs/tutorial/LangImpl7.rst +++ b/docs/tutorial/LangImpl7.rst @@ -632,7 +632,7 @@ own local variables, lets add this next! User-defined Local Variables ============================ -Adding var/in is just like any other other extensions we made to +Adding var/in is just like any other extension we made to Kaleidoscope: we extend the lexer, the parser, the AST and the code generator. The first step for adding our new 'var/in' construct is to extend the lexer. As before, this is pretty trivial, the code looks like diff --git a/include/llvm/Support/Options.h b/include/llvm/Support/Options.h index 4fd1bff358f..2742d3907c6 100644 --- a/include/llvm/Support/Options.h +++ b/include/llvm/Support/Options.h @@ -61,7 +61,7 @@ char OptionKey::ID = 0; /// The OptionRegistry is responsible for managing lifetimes of the options and /// provides interfaces for option registration and reading values from options. /// This object is a singleton, only one instance should ever exist so that all -/// options are registered in teh same place. +/// options are registered in the same place. class OptionRegistry { private: DenseMap Options; diff --git a/lib/Target/PowerPC/README_ALTIVEC.txt b/lib/Target/PowerPC/README_ALTIVEC.txt index 43d87d3aefe..1d5b0922a9f 100644 --- a/lib/Target/PowerPC/README_ALTIVEC.txt +++ b/lib/Target/PowerPC/README_ALTIVEC.txt @@ -277,7 +277,7 @@ This will generate the following instruction sequence: This will almost certainly cause a load-hit-store hazard. Since val is a value parameter, it should not need to be saved onto the stack, unless it's being done set up the vector register. Instead, -it would be better to splat teh value into a vector register, and then +it would be better to splat the value into a vector register, and then remove the (dead) stores to the stack. //===----------------------------------------------------------------------===//