[llvm] [bolt] Fix typos discovered by codespell (PR #124726)
via llvm-commits
llvm-commits at lists.llvm.org
Tue Jan 28 02:35:22 PST 2025
llvmbot wrote:
<!--LLVM PR SUMMARY COMMENT-->
@llvm/pr-subscribers-bolt
Author: Christian Clauss (cclauss)
<details>
<summary>Changes</summary>
https://github.com/codespell-project/codespell
```bash
codespell bolt --skip="*.yaml,Maintainers.txt" --write-changes \
--ignore-words-list=acount,alledges,ans,archtype,defin,iself,mis,mmaped,othere,outweight,vas
```
---
Patch is 39.64 KiB, truncated to 20.00 KiB below, full version: https://github.com/llvm/llvm-project/pull/124726.diff
44 Files Affected:
- (modified) bolt/docs/BinaryAnalysis.md (+1-1)
- (modified) bolt/docs/CommandLineArgumentReference.md (+1-1)
- (modified) bolt/docs/RuntimeLibrary.md (+1-1)
- (modified) bolt/docs/doxygen.cfg.in (+1-1)
- (modified) bolt/include/bolt/Core/BinaryFunction.h (+1-1)
- (modified) bolt/include/bolt/Core/DIEBuilder.h (+1-1)
- (modified) bolt/include/bolt/Core/DebugData.h (+2-2)
- (modified) bolt/include/bolt/Core/DebugNames.h (+2-2)
- (modified) bolt/include/bolt/Core/MCPlusBuilder.h (+2-2)
- (modified) bolt/include/bolt/Passes/FrameAnalysis.h (+1-1)
- (modified) bolt/include/bolt/Passes/LongJmp.h (+1-1)
- (modified) bolt/include/bolt/Passes/ReorderAlgorithm.h (+1-1)
- (modified) bolt/include/bolt/Rewrite/DWARFRewriter.h (+1-1)
- (modified) bolt/lib/Core/BinaryContext.cpp (+3-3)
- (modified) bolt/lib/Core/BinaryFunction.cpp (+2-2)
- (modified) bolt/lib/Core/BinaryFunctionCallGraph.cpp (+1-1)
- (modified) bolt/lib/Core/DIEBuilder.cpp (+3-3)
- (modified) bolt/lib/Core/DebugData.cpp (+2-2)
- (modified) bolt/lib/Core/DebugNames.cpp (+2-2)
- (modified) bolt/lib/Passes/Aligner.cpp (+2-2)
- (modified) bolt/lib/Passes/RegReAssign.cpp (+3-3)
- (modified) bolt/lib/Passes/SplitFunctions.cpp (+6-6)
- (modified) bolt/lib/Profile/DataReader.cpp (+1-1)
- (modified) bolt/lib/Rewrite/BuildIDRewriter.cpp (+1-1)
- (modified) bolt/lib/Rewrite/DWARFRewriter.cpp (+3-3)
- (modified) bolt/lib/Rewrite/PseudoProbeRewriter.cpp (+1-1)
- (modified) bolt/lib/Rewrite/RewriteInstance.cpp (+3-3)
- (modified) bolt/lib/Target/AArch64/AArch64MCPlusBuilder.cpp (+1-1)
- (modified) bolt/lib/Target/X86/X86MCPlusBuilder.cpp (+1-1)
- (modified) bolt/lib/Utils/CommandLineOpts.cpp (+1-1)
- (modified) bolt/runtime/hugify.cpp (+1-1)
- (modified) bolt/runtime/instr.cpp (+5-5)
- (modified) bolt/runtime/sys_aarch64.h (+1-1)
- (modified) bolt/runtime/sys_x86_64.h (+2-2)
- (modified) bolt/test/AArch64/constant-island-alignment.s (+1-1)
- (modified) bolt/test/AArch64/ifunc.test (+1-1)
- (modified) bolt/test/X86/cdsplit-call-scale.s (+3-3)
- (modified) bolt/test/X86/dwarf5-two-cu-str-offset-table.test (+1-1)
- (modified) bolt/test/X86/dwarf5-type-unit-no-cu-str-offset-table.test (+1-1)
- (modified) bolt/test/X86/jt-symbol-disambiguation-3.s (+2-2)
- (modified) bolt/test/X86/split-landing-pad.s (+1-1)
- (modified) bolt/test/runtime/X86/asm-dump.c (+1-1)
- (modified) bolt/test/runtime/wait_file.sh (+1-1)
- (modified) bolt/utils/bughunter.sh (+1-1)
``````````diff
diff --git a/bolt/docs/BinaryAnalysis.md b/bolt/docs/BinaryAnalysis.md
index f91b77d046de8f..5f869fb4863b28 100644
--- a/bolt/docs/BinaryAnalysis.md
+++ b/bolt/docs/BinaryAnalysis.md
@@ -1,7 +1,7 @@
# BOLT-based binary analysis
As part of post-link-time optimizing, BOLT needs to perform a range of analyses
-on binaries such as recontructing control flow graphs, and more.
+on binaries such as reconstructing control flow graphs, and more.
The `llvm-bolt-binary-analysis` tool enables running requested binary analyses
on binaries, and generating reports. It does this by building on top of the
diff --git a/bolt/docs/CommandLineArgumentReference.md b/bolt/docs/CommandLineArgumentReference.md
index f3881c9a640a92..2c5cbcf87bad1a 100644
--- a/bolt/docs/CommandLineArgumentReference.md
+++ b/bolt/docs/CommandLineArgumentReference.md
@@ -369,7 +369,7 @@
- `--use-old-text`
- Re-use space in old .text if possible (relocation mode)
+ Reuse space in old .text if possible (relocation mode)
- `-v <uint>`
diff --git a/bolt/docs/RuntimeLibrary.md b/bolt/docs/RuntimeLibrary.md
index 58d9497a195b21..b969ebd3e3547e 100644
--- a/bolt/docs/RuntimeLibrary.md
+++ b/bolt/docs/RuntimeLibrary.md
@@ -15,7 +15,7 @@ However, this approach quickly becomes awkward if we want to insert a lot of cod
Currently, our runtime library is written in C++ and contains code that helps us instrument a binary.
### Limitations
-Our library is not written with regular C++ code as it is not linked against any other libraries (this means we cannnot rely on anything defined on libstdc++, glibc, libgcc etc), but is self sufficient. In runtime/CMakeLists.txt, we can see it is built with -ffreestanding, which requires the compiler to avoid using a runtime library by itself.
+Our library is not written with regular C++ code as it is not linked against any other libraries (this means we cannot rely on anything defined on libstdc++, glibc, libgcc etc), but is self sufficient. In runtime/CMakeLists.txt, we can see it is built with -ffreestanding, which requires the compiler to avoid using a runtime library by itself.
While this requires us to make our own syscalls, it does simplify our linker a lot, which is very limited and can only do basic function name resolving. However, this is a big improvement in comparison with programmatically generating the code in assembly language using MCInsts.
diff --git a/bolt/docs/doxygen.cfg.in b/bolt/docs/doxygen.cfg.in
index 01571e79555cec..2c5edfda9897df 100644
--- a/bolt/docs/doxygen.cfg.in
+++ b/bolt/docs/doxygen.cfg.in
@@ -1070,7 +1070,7 @@ HTML_STYLESHEET =
# defined cascading style sheet that is included after the standard style sheets
# created by doxygen. Using this option one can overrule certain style aspects.
# This is preferred over using HTML_STYLESHEET since it does not replace the
-# standard style sheet and is therefor more robust against future updates.
+# standard style sheet and is therefore more robust against future updates.
# Doxygen will copy the style sheet file to the output directory. For an example
# see the documentation.
# This tag requires that the tag GENERATE_HTML is set to YES.
diff --git a/bolt/include/bolt/Core/BinaryFunction.h b/bolt/include/bolt/Core/BinaryFunction.h
index e8b2757f7db215..1124f4e5603955 100644
--- a/bolt/include/bolt/Core/BinaryFunction.h
+++ b/bolt/include/bolt/Core/BinaryFunction.h
@@ -1301,7 +1301,7 @@ class BinaryFunction {
ColdCodeSectionName = Name.str();
}
- /// Return true iif the function will halt execution on entry.
+ /// Return true if the function will halt execution on entry.
bool trapsOnEntry() const { return TrapsOnEntry; }
/// Make the function always trap on entry. Other than the trap instruction,
diff --git a/bolt/include/bolt/Core/DIEBuilder.h b/bolt/include/bolt/Core/DIEBuilder.h
index bd22c536c56fca..60dd5347bd0a30 100644
--- a/bolt/include/bolt/Core/DIEBuilder.h
+++ b/bolt/include/bolt/Core/DIEBuilder.h
@@ -60,7 +60,7 @@ class DIEBuilder {
uint32_t UnitLength = 0;
bool IsConstructed = false;
// A map of DIE offsets in original DWARF section to DIE ID.
- // Whih is used to access DieInfoVector.
+ // Which is used to access DieInfoVector.
std::unordered_map<uint64_t, uint32_t> DIEIDMap;
// Some STL implementations don't have a noexcept move constructor for
diff --git a/bolt/include/bolt/Core/DebugData.h b/bolt/include/bolt/Core/DebugData.h
index 6ea3b1af1024f3..8b8ea875e0a2e5 100644
--- a/bolt/include/bolt/Core/DebugData.h
+++ b/bolt/include/bolt/Core/DebugData.h
@@ -346,7 +346,7 @@ class DebugAddrWriter {
/// Write out entries in to .debug_addr section for CUs.
virtual std::optional<uint64_t> finalize(const size_t BufferSize);
- /// Return buffer with all the entries in .debug_addr already writen out using
+ /// Return buffer with all the entries in .debug_addr already written out using
/// update(...).
virtual std::unique_ptr<AddressSectionBuffer> releaseBuffer() {
return std::move(Buffer);
@@ -429,7 +429,7 @@ class DebugAddrWriter {
std::mutex WriterMutex;
std::unique_ptr<AddressSectionBuffer> Buffer;
std::unique_ptr<raw_svector_ostream> AddressStream;
- /// Used to track sections that were not modified so that they can be re-used.
+ /// Used to track sections that were not modified so that they can be reused.
static DenseMap<uint64_t, uint64_t> UnmodifiedAddressOffsets;
};
diff --git a/bolt/include/bolt/Core/DebugNames.h b/bolt/include/bolt/Core/DebugNames.h
index cc4e13a481b2d6..4ec49ca7207b5c 100644
--- a/bolt/include/bolt/Core/DebugNames.h
+++ b/bolt/include/bolt/Core/DebugNames.h
@@ -65,7 +65,7 @@ class DWARF5AcceleratorTable {
void setCurrentUnit(DWARFUnit &Unit, const uint64_t UnitStartOffset);
/// Emit Accelerator table.
void emitAccelTable();
- /// Returns true if the table was crated.
+ /// Returns true if the table was created.
bool isCreated() const { return NeedToCreate; }
/// Returns buffer containing the accelerator table.
std::unique_ptr<DebugBufferVector> releaseBuffer() {
@@ -91,7 +91,7 @@ class DWARF5AcceleratorTable {
uint64_t CurrentUnitOffset = 0;
const DWARFUnit *CurrentUnit = nullptr;
std::unordered_map<uint32_t, uint32_t> AbbrevTagToIndexMap;
- /// Contains a map of TU hashes to a Foreign TU indecies.
+ /// Contains a map of TU hashes to a Foreign TU indices.
/// This is used to reduce the size of Foreign TU list since there could be
/// multiple TUs with the same hash.
DenseMap<uint64_t, uint32_t> TUHashToIndexMap;
diff --git a/bolt/include/bolt/Core/MCPlusBuilder.h b/bolt/include/bolt/Core/MCPlusBuilder.h
index c1460b2aac8a69..e6dcc4b80e7915 100644
--- a/bolt/include/bolt/Core/MCPlusBuilder.h
+++ b/bolt/include/bolt/Core/MCPlusBuilder.h
@@ -414,7 +414,7 @@ class MCPlusBuilder {
return Analysis->isConditionalBranch(Inst);
}
- /// Returns true if Inst is a condtional move instruction
+ /// Returns true if Inst is a conditional move instruction
virtual bool isConditionalMove(const MCInst &Inst) const {
llvm_unreachable("not implemented");
return false;
@@ -1303,7 +1303,7 @@ class MCPlusBuilder {
}
/// Get the default def_in and live_out registers for the function
- /// Currently only used for the Stoke optimzation
+ /// Currently only used for the Stoke optimization
virtual void getDefaultDefIn(BitVector &Regs) const {
llvm_unreachable("not implemented");
}
diff --git a/bolt/include/bolt/Passes/FrameAnalysis.h b/bolt/include/bolt/Passes/FrameAnalysis.h
index 44b54d4ed45d4d..0571af599fa02f 100644
--- a/bolt/include/bolt/Passes/FrameAnalysis.h
+++ b/bolt/include/bolt/Passes/FrameAnalysis.h
@@ -36,7 +36,7 @@ struct FrameIndexEntry {
int64_t StackOffset;
uint8_t Size;
- /// If this is false, we will never atempt to remove or optimize this
+ /// If this is false, we will never attempt to remove or optimize this
/// instruction. We just use it to keep track of stores we don't fully
/// understand but we know it may write to a frame position.
bool IsSimple;
diff --git a/bolt/include/bolt/Passes/LongJmp.h b/bolt/include/bolt/Passes/LongJmp.h
index df3ea9620918af..84da4535648b29 100644
--- a/bolt/include/bolt/Passes/LongJmp.h
+++ b/bolt/include/bolt/Passes/LongJmp.h
@@ -30,7 +30,7 @@ namespace bolt {
/// 64-bit range, we guarantee it can reach any code location.
///
class LongJmpPass : public BinaryFunctionPass {
- /// Used to implement stub grouping (re-using a stub from one function into
+ /// Used to implement stub grouping (reusing a stub from one function into
/// another)
using StubTy = std::pair<uint64_t, BinaryBasicBlock *>;
using StubGroupTy = SmallVector<StubTy, 4>;
diff --git a/bolt/include/bolt/Passes/ReorderAlgorithm.h b/bolt/include/bolt/Passes/ReorderAlgorithm.h
index 95d9e831ec68be..42bb33370cf7c4 100644
--- a/bolt/include/bolt/Passes/ReorderAlgorithm.h
+++ b/bolt/include/bolt/Passes/ReorderAlgorithm.h
@@ -26,7 +26,7 @@ namespace bolt {
/// Objects of this class implement various basic block clustering algorithms.
/// Basic block clusters are chains of basic blocks that should be laid out
-/// in this order to maximize performace. These algorithms group basic blocks
+/// in this order to maximize performance. These algorithms group basic blocks
/// into clusters using execution profile data and various heuristics.
class ClusterAlgorithm {
public:
diff --git a/bolt/include/bolt/Rewrite/DWARFRewriter.h b/bolt/include/bolt/Rewrite/DWARFRewriter.h
index 624245650a0924..cab346b5aebc51 100644
--- a/bolt/include/bolt/Rewrite/DWARFRewriter.h
+++ b/bolt/include/bolt/Rewrite/DWARFRewriter.h
@@ -128,7 +128,7 @@ class DWARFRewriter {
CUOffsetMap finalizeTypeSections(DIEBuilder &DIEBlder, DIEStreamer &Streamer,
GDBIndex &GDBIndexSection);
- /// Process and write out CUs that are passsed in.
+ /// Process and write out CUs that are passed in.
void finalizeCompileUnits(DIEBuilder &DIEBlder, DIEStreamer &Streamer,
CUOffsetMap &CUMap,
const std::list<DWARFUnit *> &CUs,
diff --git a/bolt/lib/Core/BinaryContext.cpp b/bolt/lib/Core/BinaryContext.cpp
index f5e11358daaa32..2cbe665f8ee893 100644
--- a/bolt/lib/Core/BinaryContext.cpp
+++ b/bolt/lib/Core/BinaryContext.cpp
@@ -845,7 +845,7 @@ BinaryContext::getOrCreateJumpTable(BinaryFunction &Function, uint64_t Address,
[&](const BinaryFunction *BF) {
return areRelatedFragments(&Function, BF);
}) &&
- "cannot re-use jump table of a different function");
+ "cannot reuse jump table of a different function");
// Duplicate the entry for the parent function for easy access
JT->Parents.push_back(&Function);
if (opts::Verbosity > 2) {
@@ -865,11 +865,11 @@ BinaryContext::getOrCreateJumpTable(BinaryFunction &Function, uint64_t Address,
if (Frag == &Function)
IsJumpTableParent = true;
assert(IsJumpTableParent &&
- "cannot re-use jump table of a different function");
+ "cannot reuse jump table of a different function");
return JT->getFirstLabel();
}
- // Re-use the existing symbol if possible.
+ // Reuse the existing symbol if possible.
MCSymbol *JTLabel = nullptr;
if (BinaryData *Object = getBinaryDataAtAddress(Address)) {
if (!isInternalSymbolName(Object->getSymbol()->getName()))
diff --git a/bolt/lib/Core/BinaryFunction.cpp b/bolt/lib/Core/BinaryFunction.cpp
index 1c5cd62a095b24..75ed476f4cc564 100644
--- a/bolt/lib/Core/BinaryFunction.cpp
+++ b/bolt/lib/Core/BinaryFunction.cpp
@@ -3033,7 +3033,7 @@ void BinaryFunction::setTrapOnEntry() {
void BinaryFunction::setIgnored() {
if (opts::processAllFunctions()) {
// We can accept ignored functions before they've been disassembled.
- // In that case, they would still get disassembled and emited, but not
+ // In that case, they would still get disassembled and emitted, but not
// optimized.
assert(CurrentState == State::Empty &&
"cannot ignore non-empty functions in current mode");
@@ -3631,7 +3631,7 @@ uint64_t BinaryFunction::getEntryIDForSymbol(const MCSymbol *Symbol) const {
if (FunctionSymbol == Symbol)
return 0;
- // Check all secondary entries available as either basic blocks or lables.
+ // Check all secondary entries available as either basic blocks or labels.
uint64_t NumEntries = 1;
for (const BinaryBasicBlock *BB : BasicBlocks) {
MCSymbol *EntrySymbol = getSecondaryEntryPointSymbol(*BB);
diff --git a/bolt/lib/Core/BinaryFunctionCallGraph.cpp b/bolt/lib/Core/BinaryFunctionCallGraph.cpp
index b4b7897aa426ae..a498a0a0674ad2 100644
--- a/bolt/lib/Core/BinaryFunctionCallGraph.cpp
+++ b/bolt/lib/Core/BinaryFunctionCallGraph.cpp
@@ -122,7 +122,7 @@ buildCallGraph(BinaryContext &BC, CgFilterFunction Filter, bool CgFromPerfData,
// create a node for a function unless it was the target of a call from
// a hot block. The alternative would be to set the count to one or
// accumulate the number of calls from the callsite into the function
- // samples. Results from perfomance testing seem to favor the zero
+ // samples. Results from performance testing seem to favor the zero
// count though, so I'm leaving it this way for now.
return Cg.addNode(Function, Size, Function->getKnownExecutionCount());
}
diff --git a/bolt/lib/Core/DIEBuilder.cpp b/bolt/lib/Core/DIEBuilder.cpp
index 80ad583e079d49..ede950b98be8c5 100644
--- a/bolt/lib/Core/DIEBuilder.cpp
+++ b/bolt/lib/Core/DIEBuilder.cpp
@@ -137,7 +137,7 @@ void DIEBuilder::updateReferences() {
DIEInteger(NewAddr));
}
- // Handling referenes in location expressions.
+ // Handling references in location expressions.
for (LocWithReference &LocExpr : getState().LocWithReferencesToProcess) {
SmallVector<uint8_t, 32> Buffer;
DataExtractor Data(StringRef((const char *)LocExpr.BlockData.data(),
@@ -338,7 +338,7 @@ void DIEBuilder::buildCompileUnits(const bool Init) {
registerUnit(*DU.get(), false);
}
- // Using DULIst since it can be modified by cross CU refrence resolution.
+ // Using DULIst since it can be modified by cross CU reference resolution.
for (DWARFUnit *DU : getState().DUList) {
if (DU->isTypeUnit())
continue;
@@ -510,7 +510,7 @@ void DIEBuilder::finish() {
UnitStartOffset += CurUnitInfo.UnitLength;
};
// Computing offsets for .debug_types section.
- // It's processed first when CU is registered so will be at the begginnig of
+ // It's processed first when CU is registered so will be at the beginning of
// the vector.
uint64_t TypeUnitStartOffset = 0;
for (DWARFUnit *CU : getState().DUList) {
diff --git a/bolt/lib/Core/DebugData.cpp b/bolt/lib/Core/DebugData.cpp
index bd8aa807f1aaed..ba20d7d653cd72 100644
--- a/bolt/lib/Core/DebugData.cpp
+++ b/bolt/lib/Core/DebugData.cpp
@@ -879,7 +879,7 @@ void DebugStrOffsetsWriter::finalizeSection(DWARFUnit &Unit,
DIEValue StrListBaseAttrInfo =
Die.findAttribute(dwarf::DW_AT_str_offsets_base);
auto RetVal = ProcessedBaseOffsets.find(*Val);
- // Handling re-use of str-offsets section.
+ // Handling reuse of str-offsets section.
if (RetVal == ProcessedBaseOffsets.end() || StrOffsetSectionWasModified) {
initialize(Unit);
// Update String Offsets that were modified.
@@ -1170,7 +1170,7 @@ void DwarfLineTable::emitCU(MCStreamer *MCOS, MCDwarfLineTableParams Params,
// For functions that we do not modify we output them as raw data.
// Re-constructing .debug_line_str so that offsets are correct for those
// debug line tables.
-// Bonus is that when we output a final binary we can re-use .debug_line_str
+// Bonus is that when we output a final binary we can reuse .debug_line_str
// section. So we don't have to do the SHF_ALLOC trick we did with
// .debug_line.
static void parseAndPopulateDebugLineStr(BinarySection &LineStrSection,
diff --git a/bolt/lib/Core/DebugNames.cpp b/bolt/lib/Core/DebugNames.cpp
index 366c22c38e6164..f8250ce9325877 100644
--- a/bolt/lib/Core/DebugNames.cpp
+++ b/bolt/lib/Core/DebugNames.cpp
@@ -55,7 +55,7 @@ DWARF5AcceleratorTable::DWARF5AcceleratorTable(
llvm::hash_value(llvm::StringRef(CStr)), StrOffset);
if (!R.second)
BC.errs()
- << "BOLT-WARNING: [internal-dwarf-error]: collision occured on "
+ << "BOLT-WARNING: [internal-dwarf-error]: collision occurred on "
<< CStr << " at offset : 0x" << Twine::utohexstr(StrOffset)
<< ". Previous string offset is: 0x"
<< Twine::utohexstr(R.first->second) << ".\n";
@@ -86,7 +86,7 @@ void DWARF5AcceleratorTable::addUnit(DWARFUnit &Unit,
if (Unit.isTypeUnit()) {
if (DWOID) {
// We adding an entry for a DWO TU. The DWO CU might not have any entries,
- // so need to add it to the list pre-emptively.
+ // so need to add it to the list preemptively.
auto Iter = CUOffsetsToPatch.insert({*DWOID, CUList.size()});
if (Iter.second)
CUList.push_back(BADCUOFFSET);
diff --git a/bolt/lib/Passes/Aligner.cpp b/bolt/lib/Passes/Aligner.cpp
index 555f82a5a81780..1dbcb4c8163d08 100644
--- a/bolt/lib/Passes/Aligner.cpp
+++ b/bolt/lib/Passes/Aligner.cpp
@@ -65,7 +65,7 @@ namespace llvm {
namespace bolt {
// Align function to the specified byte-boundary (typically, 64) offsetting
-// the fuction by not more than the corresponding value
+// the function by not more than the corresponding value
static void alignMaxBytes(BinaryFunction &Function) {
Function.setAlignment(opts::AlignFunctions);
Function.setMaxAlignmentBytes(opts::AlignFunctionsMaxBytes);
@@ -73,7 +73,7 @@ static void alignMaxBytes(BinaryFunction &Function) {
}
// Align function to the specified byte-boundary (typically, 64) offsetting
-// the fuction by not more than the minimum over
+// the function by not more than the minimum over
// -- the size of the function
// -- the specified number of bytes
static void alignCompact(BinaryFunction &Function,
diff --git a/bolt/lib/Passes/RegReAssign.cpp b/bolt/lib/Passes/RegReAssign.cpp
index 60349f18b11d39..0859cd244ce402 100644
--- a/bolt/lib/Passes/RegReAssign.cpp
+++ b/bolt/lib/Passes/RegReAssign.cpp
@@ -145,7 +145,7 @@ void RegReAssign::rankRegisters(BinaryFunction &Function) {
const bool CannotUseREX = BC.MIB->cannotUseREX(Inst);
const MCInstrDesc &Desc = BC.MII->get(Inst.getOpcode());
- // Disallow substituitions involving regs in implicit uses lists
+ // Disallow substitutions involving regs in implicit uses lists
for (MCPhysReg ImplicitUse : Desc.implicit_uses()) {
const size_t RegEC =
BC.MIB->getAliases(ImplicitUse, false).find_first();
@@ -153,7 +153,7 @@ void RegReAssign::rankRegisters(BinaryFunction &Function) {
std::numeric_limits<decltype(RegScore)::value_type>::min();
}
- // Disallow substituitions involving regs in implicit defs lists
+ // Disallow substitutions involving regs in implicit defs lists
for (MCPhysReg ImplicitDef : Desc.implicit_defs()) {
const size_t RegEC =
BC.MIB->getAliases(ImplicitDef, false).find_first();
@@ -174,7 +174,7 @@ void RegReAssign::rankRegisters(BinaryFunction &Function) {
if (RegEC == 0)
continue;
- // Disallow substituitions involving regs in instrs that cannot use REX
+ // Disallow substitutions involving regs in instrs that cannot use REX
// The relationship of X86 registers is shown in the diagram. BL and BH
// do not have a direct alias relationship. However, if the BH register
// cannot be swapped, then the BX/EBX/RBX registers cannot be swapped as
diff --git a/bolt/lib/Passes/SplitFunctions.cpp b/bolt/lib/Passes/SplitFunctions.cpp
index b21401e069bfa6..466dc0300d1cc6 100644
--- a/bolt/lib/Passes/SplitFunctions.cpp
+++ b/bolt/lib/Passes/SplitFunctions.cpp
@@ -409,7 +409,7 @@ struct SplitCacheDirected final : public SplitStrategy {
}
/// Compute sum of scores over jumps within \p BlockOrder given \p SplitIndex.
- /// Increament Score.LocalScore in place by the sum.
+ /// Increment Score.LocalScore in place by the sum.
void computeJ...
[truncated]
``````````
</details>
https://github.com/llvm/llvm-project/pull/124726
More information about the llvm-commits
mailing list