fix comment typos to cycle bots

This commit is contained in:
Nico Weber 2021-02-18 14:24:56 -05:00
parent 2cc76b17be
commit cb4df6eb8d
3 changed files with 13 additions and 13 deletions

View File

@ -2212,7 +2212,7 @@ template <class ELFT> void LinkerDriver::link(opt::InputArgList &args) {
// in addCombinedLTOObject, so we are done if that's the case.
// Likewise, --plugin-opt=emit-llvm and --plugin-opt=emit-asm are the
// options to create output files in bitcode or assembly code
// repsectively. No object files are generated.
// respectively. No object files are generated.
// Also bail out here when only certain thinLTO modules are specified for
// compilation. The intermediate object file are the expected output.
if (config->thinLTOIndexOnly || config->emitLLVM || config->ltoEmitAsm ||

View File

@ -1249,10 +1249,10 @@ void ArchiveFile::fetch(const Archive::Symbol &sym) {
}
// The handling of tentative definitions (COMMON symbols) in archives is murky.
// A tentative defintion will be promoted to a global definition if there are no
// non-tentative definitions to dominate it. When we hold a tentative definition
// to a symbol and are inspecting archive memebers for inclusion there are 2
// ways we can proceed:
// A tentative definition will be promoted to a global definition if there are
// no non-tentative definitions to dominate it. When we hold a tentative
// definition to a symbol and are inspecting archive members for inclusion
// there are 2 ways we can proceed:
//
// 1) Consider the tentative definition a 'real' definition (ie promotion from
// tentative to real definition has already happened) and not inspect
@ -1261,17 +1261,17 @@ void ArchiveFile::fetch(const Archive::Symbol &sym) {
// other undefined symbol. This is the behavior Gold uses.
//
// 2) Consider the tentative definition as still undefined (ie the promotion to
// a real definiton happens only after all symbol resolution is done).
// The linker searches archive memebers for global or weak definitions to
// a real definition happens only after all symbol resolution is done).
// The linker searches archive members for global or weak definitions to
// replace the tentative definition with. This is the behavior used by
// GNU ld.
//
// The second behavior is inherited from SysVR4, which based it on the FORTRAN
// COMMON BLOCK model. This behavior is needed for proper initalizations in old
// COMMON BLOCK model. This behavior is needed for proper initalization in old
// (pre F90) FORTRAN code that is packaged into an archive.
//
// The following functions search archive members for defintions to replace
// tentative defintions (implementing behavior 2).
// The following functions search archive members for definitions to replace
// tentative definitions (implementing behavior 2).
static bool isBitcodeNonCommonDef(MemoryBufferRef mb, StringRef symName,
StringRef archiveName) {
IRSymtabFile symtabFile = check(readIRSymtab(mb));

View File

@ -1446,8 +1446,8 @@ static void sortSection(OutputSection *sec,
return;
// IRelative relocations that usually live in the .rel[a].dyn section should
// be proccessed last by the dynamic loader. To achieve that we add synthetic
// sections in the required order from the begining so that the in.relaIplt
// be processed last by the dynamic loader. To achieve that we add synthetic
// sections in the required order from the beginning so that the in.relaIplt
// section is placed last in an output section. Here we just do not apply
// sorting for an output section which holds the in.relaIplt section.
if (in.relaIplt->getParent() == sec)
@ -1769,7 +1769,7 @@ template <class ELFT> void Writer<ELFT>::finalizeAddressDependentContent() {
Twine(os->alignment) + ")");
}
// If Input Sections have been shrinked (basic block sections) then
// If Input Sections have been shrunk (basic block sections) then
// update symbol values and sizes associated with these sections. With basic
// block sections, input sections can shrink when the jump instructions at
// the end of the section are relaxed.