From: Hiroshi Inoue Date: Tue, 23 Jan 2018 05:49:30 +0000 (+0000) Subject: [NFC] fix trivial typos in comments X-Git-Tag: android-x86-7.1-r4~5988 X-Git-Url: http://git.osdn.net/view?a=commitdiff_plain;h=c0d997dcdfa01940464bbec7b1ffa58b6555ad5c;p=android-x86%2Fexternal-llvm.git [NFC] fix trivial typos in comments "the the" -> "the" git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@323176 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/include/llvm-c/Types.h b/include/llvm-c/Types.h index d63ea4de933..970980b1f23 100644 --- a/include/llvm-c/Types.h +++ b/include/llvm-c/Types.h @@ -7,7 +7,7 @@ |* *| |*===----------------------------------------------------------------------===*| |* *| -|* This file defines types used by the the C interface to LLVM. *| +|* This file defines types used by the C interface to LLVM. *| |* *| \*===----------------------------------------------------------------------===*/ diff --git a/include/llvm-c/lto.h b/include/llvm-c/lto.h index 55f3e46c45e..8ea24244034 100644 --- a/include/llvm-c/lto.h +++ b/include/llvm-c/lto.h @@ -793,7 +793,7 @@ extern void thinlto_codegen_set_cache_pruning_interval(thinlto_code_gen_t cg, /** * Sets the maximum cache size that can be persistent across build, in terms of - * percentage of the available space on the the disk. Set to 100 to indicate + * percentage of the available space on the disk. Set to 100 to indicate * no limit, 50 to indicate that the cache size will not be left over half the * available space. A value over 100 will be reduced to 100, a value of 0 will * be ignored. An unspecified default value will be applied. diff --git a/include/llvm/Analysis/CGSCCPassManager.h b/include/llvm/Analysis/CGSCCPassManager.h index 8123cbad22f..457d5a0adcb 100644 --- a/include/llvm/Analysis/CGSCCPassManager.h +++ b/include/llvm/Analysis/CGSCCPassManager.h @@ -397,7 +397,7 @@ public: DEBUG(dbgs() << "Running an SCC pass across the RefSCC: " << *RC << "\n"); - // Push the initial SCCs in reverse post-order as we'll pop off the the + // Push the initial SCCs in reverse post-order as we'll pop off the // back and so see this in post-order. for (LazyCallGraph::SCC &C : llvm::reverse(*RC)) CWorklist.insert(&C); diff --git a/include/llvm/Analysis/InlineCost.h b/include/llvm/Analysis/InlineCost.h index 985f3880ed3..138d3acb0e8 100644 --- a/include/llvm/Analysis/InlineCost.h +++ b/include/llvm/Analysis/InlineCost.h @@ -170,7 +170,7 @@ InlineParams getInlineParams(int Threshold); /// line options. If -inline-threshold option is not explicitly passed, /// the default threshold is computed from \p OptLevel and \p SizeOptLevel. /// An \p OptLevel value above 3 is considered an aggressive optimization mode. -/// \p SizeOptLevel of 1 corresponds to the the -Os flag and 2 corresponds to +/// \p SizeOptLevel of 1 corresponds to the -Os flag and 2 corresponds to /// the -Oz flag. InlineParams getInlineParams(unsigned OptLevel, unsigned SizeOptLevel); diff --git a/include/llvm/CodeGen/MachineInstr.h b/include/llvm/CodeGen/MachineInstr.h index f9ad367b690..635c1482bd3 100644 --- a/include/llvm/CodeGen/MachineInstr.h +++ b/include/llvm/CodeGen/MachineInstr.h @@ -391,7 +391,7 @@ public: /// Access to memory operands of the instruction mmo_iterator memoperands_begin() const { return MemRefs; } mmo_iterator memoperands_end() const { return MemRefs + NumMemRefs; } - /// Return true if we don't have any memory operands which described the the + /// Return true if we don't have any memory operands which described the /// memory access done by this instruction. If this is true, calling code /// must be conservative. bool memoperands_empty() const { return NumMemRefs == 0; } diff --git a/include/llvm/CodeGen/TargetInstrInfo.h b/include/llvm/CodeGen/TargetInstrInfo.h index 22b0225f790..2c6cadf7e86 100644 --- a/include/llvm/CodeGen/TargetInstrInfo.h +++ b/include/llvm/CodeGen/TargetInstrInfo.h @@ -635,8 +635,8 @@ public: return true; } - /// Generate code to reduce the loop iteration by one and check if the loop is - /// finished. Return the value/register of the the new loop count. We need + /// Generate code to reduce the loop iteration by one and check if the loop + /// is finished. Return the value/register of the new loop count. We need /// this function when peeling off one or more iterations of a loop. This /// function assumes the nth iteration is peeled first. virtual unsigned reduceLoopCount(MachineBasicBlock &MBB, MachineInstr *IndVar, diff --git a/include/llvm/CodeGen/TargetLowering.h b/include/llvm/CodeGen/TargetLowering.h index 7e3073ea047..0926ee8d325 100644 --- a/include/llvm/CodeGen/TargetLowering.h +++ b/include/llvm/CodeGen/TargetLowering.h @@ -820,7 +820,7 @@ public: /// Return true if lowering to a jump table is suitable for a set of case /// clusters which may contain \p NumCases cases, \p Range range of values. /// FIXME: This function check the maximum table size and density, but the - /// minimum size is not checked. It would be nice if the the minimum size is + /// minimum size is not checked. It would be nice if the minimum size is /// also combined within this function. Currently, the minimum size check is /// performed in findJumpTable() in SelectionDAGBuiler and /// getEstimatedNumberOfCaseClusters() in BasicTTIImpl. diff --git a/include/llvm/DebugInfo/CodeView/CVTypeVisitor.h b/include/llvm/DebugInfo/CodeView/CVTypeVisitor.h index df55e181364..b765ba1abb4 100644 --- a/include/llvm/DebugInfo/CodeView/CVTypeVisitor.h +++ b/include/llvm/DebugInfo/CodeView/CVTypeVisitor.h @@ -20,7 +20,7 @@ class TypeCollection; class TypeVisitorCallbacks; enum VisitorDataSource { - VDS_BytesPresent, // The record bytes are passed into the the visitation + VDS_BytesPresent, // The record bytes are passed into the visitation // function. The algorithm should first deserialize them // before passing them on through the pipeline. VDS_BytesExternal // The record bytes are not present, and it is the diff --git a/include/llvm/DebugInfo/CodeView/CodeView.h b/include/llvm/DebugInfo/CodeView/CodeView.h index 1a4f510c24a..301e4f6358f 100644 --- a/include/llvm/DebugInfo/CodeView/CodeView.h +++ b/include/llvm/DebugInfo/CodeView/CodeView.h @@ -531,7 +531,7 @@ enum LineFlags : uint16_t { LF_HaveColumns = 1, // CV_LINES_HAVE_COLUMNS }; -/// Data in the the SUBSEC_FRAMEDATA subection. +/// Data in the SUBSEC_FRAMEDATA subection. struct FrameData { support::ulittle32_t RvaStart; support::ulittle32_t CodeSize; diff --git a/include/llvm/DebugInfo/DWARF/DWARFVerifier.h b/include/llvm/DebugInfo/DWARF/DWARFVerifier.h index c427a07ccc1..9207befaf80 100644 --- a/include/llvm/DebugInfo/DWARF/DWARFVerifier.h +++ b/include/llvm/DebugInfo/DWARF/DWARFVerifier.h @@ -200,7 +200,7 @@ private: /// references for the .debug_info section unsigned verifyDebugInfoReferences(); - /// Verify the the DW_AT_stmt_list encoding and value and ensure that no + /// Verify the DW_AT_stmt_list encoding and value and ensure that no /// compile units that have the same DW_AT_stmt_list value. void verifyDebugLineStmtOffsets(); diff --git a/include/llvm/IR/DebugInfoMetadata.h b/include/llvm/IR/DebugInfoMetadata.h index f58f3df7b74..cf55a2ac659 100644 --- a/include/llvm/IR/DebugInfoMetadata.h +++ b/include/llvm/IR/DebugInfoMetadata.h @@ -1384,7 +1384,7 @@ public: /// /// The above 3 components are encoded into a 32bit unsigned integer in /// order. If the lowest bit is 1, the current component is empty, and the - /// next component will start in the next bit. Otherwise, the the current + /// next component will start in the next bit. Otherwise, the current /// component is non-empty, and its content starts in the next bit. The /// length of each components is either 5 bit or 12 bit: if the 7th bit /// is 0, the bit 2~6 (5 bits) are used to represent the component; if the diff --git a/include/llvm/IR/Statepoint.h b/include/llvm/IR/Statepoint.h index ad9537e9762..a87f67ca707 100644 --- a/include/llvm/IR/Statepoint.h +++ b/include/llvm/IR/Statepoint.h @@ -465,7 +465,7 @@ struct StatepointDirectives { /// AS. StatepointDirectives parseStatepointDirectivesFromAttrs(AttributeList AS); -/// Return \c true if the the \p Attr is an attribute that is a statepoint +/// Return \c true if the \p Attr is an attribute that is a statepoint /// directive. bool isStatepointDirectiveAttr(Attribute Attr); diff --git a/include/llvm/LTO/legacy/ThinLTOCodeGenerator.h b/include/llvm/LTO/legacy/ThinLTOCodeGenerator.h index d794535700e..07e45d4c122 100644 --- a/include/llvm/LTO/legacy/ThinLTOCodeGenerator.h +++ b/include/llvm/LTO/legacy/ThinLTOCodeGenerator.h @@ -168,8 +168,8 @@ public: /** * Sets the maximum cache size that can be persistent across build, in terms - * of percentage of the available space on the the disk. Set to 100 to - * indicate no limit, 50 to indicate that the cache size will not be left over + * of percentage of the available space on the disk. Set to 100 to indicate + * no limit, 50 to indicate that the cache size will not be left over * half the available space. A value over 100 will be reduced to 100, and a * value of 0 will be ignored. * diff --git a/include/llvm/PassAnalysisSupport.h b/include/llvm/PassAnalysisSupport.h index b109605355b..11871874765 100644 --- a/include/llvm/PassAnalysisSupport.h +++ b/include/llvm/PassAnalysisSupport.h @@ -174,7 +174,7 @@ public: AnalysisImpls.push_back(pir); } - /// Clear cache that is used to connect a pass to the the analysis (PassInfo). + /// Clear cache that is used to connect a pass to the analysis (PassInfo). void clearAnalysisImpls() { AnalysisImpls.clear(); } diff --git a/include/llvm/ProfileData/InstrProfData.inc b/include/llvm/ProfileData/InstrProfData.inc index 6a98dc7b9b8..eb4a792ce82 100644 --- a/include/llvm/ProfileData/InstrProfData.inc +++ b/include/llvm/ProfileData/InstrProfData.inc @@ -178,7 +178,7 @@ VALUE_PROF_FUNC_PARAM(uint64_t, LargeValue, Type::getInt64Ty(Ctx)) * functions are profiled by the instrumented code. The target addresses are * written in the raw profile data and converted to target function name's MD5 * hash by the profile reader during deserialization. Typically, this happens - * when the the raw profile data is read during profile merging. + * when the raw profile data is read during profile merging. * * For this remapping the ProfData is used. ProfData contains both the function * name hash and the function address. diff --git a/include/llvm/Support/BinaryStreamWriter.h b/include/llvm/Support/BinaryStreamWriter.h index a4495a1ce27..f31db87c2f3 100644 --- a/include/llvm/Support/BinaryStreamWriter.h +++ b/include/llvm/Support/BinaryStreamWriter.h @@ -56,7 +56,7 @@ public: /// otherwise returns an appropriate error code. Error writeBytes(ArrayRef Buffer); - /// Write the the integer \p Value to the underlying stream in the + /// Write the integer \p Value to the underlying stream in the /// specified endianness. On success, updates the offset so that /// subsequent writes occur at the next unwritten position. /// @@ -80,7 +80,7 @@ public: return writeInteger(static_cast(Num)); } - /// Write the the string \p Str to the underlying stream followed by a null + /// Write the string \p Str to the underlying stream followed by a null /// terminator. On success, updates the offset so that subsequent writes /// occur at the next unwritten position. \p Str need not be null terminated /// on input. @@ -89,7 +89,7 @@ public: /// otherwise returns an appropriate error code. Error writeCString(StringRef Str); - /// Write the the string \p Str to the underlying stream without a null + /// Write the string \p Str to the underlying stream without a null /// terminator. On success, updates the offset so that subsequent writes /// occur at the next unwritten position. /// diff --git a/include/llvm/Support/CachePruning.h b/include/llvm/Support/CachePruning.h index 327c7df4570..dbd99624836 100644 --- a/include/llvm/Support/CachePruning.h +++ b/include/llvm/Support/CachePruning.h @@ -37,7 +37,7 @@ struct CachePruningPolicy { std::chrono::seconds Expiration = std::chrono::hours(7 * 24); // 1w /// The maximum size for the cache directory, in terms of percentage of the - /// available space on the the disk. Set to 100 to indicate no limit, 50 to + /// available space on the disk. Set to 100 to indicate no limit, 50 to /// indicate that the cache size will not be left over half the available disk /// space. A value over 100 will be reduced to 100. A value of 0 disables the /// percentage size-based pruning.