2 changes: 1 addition & 1 deletion lldb/source/Plugins/Process/Linux/Perf.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -228,7 +228,7 @@ Expected<std::vector<uint8_t>> PerfEvent::GetReadOnlyDataBuffer() {
uint64_t actual_data_head = data_head % data_size;
// The buffer has wrapped, so we first the oldest chunk of data
output.insert(output.end(), data.begin() + actual_data_head, data.end());
// And we we read the most recent chunk of data
// And we read the most recent chunk of data
output.insert(output.end(), data.begin(), data.begin() + actual_data_head);
} else {
// There's been no wrapping, so we just read linearly
Expand Down
2 changes: 1 addition & 1 deletion lldb/source/Plugins/Process/elf-core/ProcessElfCore.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -131,7 +131,7 @@ lldb::addr_t ProcessElfCore::AddAddressRangeFromLoadSegment(
m_core_aranges.Append(range_entry);
}
}
// Keep a separate map of permissions that that isn't coalesced so all ranges
// Keep a separate map of permissions that isn't coalesced so all ranges
// are maintained.
const uint32_t permissions =
((header.p_flags & llvm::ELF::PF_R) ? lldb::ePermissionsReadable : 0u) |
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -2089,7 +2089,7 @@ StateType ProcessGDBRemote::SetThreadStopInfo(StringExtractor &stop_packet) {
switch (stop_type) {
case 'T':
case 'S': {
// This is a bit of a hack, but is is required. If we did exec, we need to
// This is a bit of a hack, but it is required. If we did exec, we need to
// clear our thread lists and also know to rebuild our dynamic register
// info before we lookup and threads and populate the expedited register
// values so we need to know this right away so we can cleanup and update
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -99,7 +99,7 @@ struct MinidumpContext_x86_32 {

// The next field is included with
// MinidumpContext_x86_32_Flags::ExtendedRegisters
// It contains vector (MMX/SSE) registers. It it laid out in the
// It contains vector (MMX/SSE) registers. It is laid out in the
// format used by the fxsave and fsrstor instructions, so it includes
// a copy of the x87 floating-point registers as well. See FXSAVE in
// "Intel Architecture Software Developer's Manual, Volume 2."
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -1344,7 +1344,7 @@ llvm::Expected<FileSP> PythonFile::ConvertToFile(bool borrowed) {

FileSP file_sp;
if (borrowed) {
// In this case we we don't need to retain the python
// In this case we don't need to retain the python
// object at all.
file_sp = std::make_shared<NativeFile>(fd, options.get(), false);
} else {
Expand Down
6 changes: 3 additions & 3 deletions lldb/source/Plugins/SymbolFile/DWARF/DWARFASTParserClang.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1023,7 +1023,7 @@ TypeSP DWARFASTParserClang::ParseSubroutine(const DWARFDIE &die,
}
}
} else if (is_cxx_method) {
// Look at the parent of this DIE and see if is is a class or
// Look at the parent of this DIE and see if it is a class or
// struct and see if this is actually a C++ method
Type *class_type = dwarf->ResolveType(decl_ctx_die);
if (class_type) {
Expand Down Expand Up @@ -3093,7 +3093,7 @@ void DWARFASTParserClang::ParseSingleMember(
// in our AST. Clang will re-create those articial members and they would
// otherwise just overlap in the layout with the FieldDecls we add here.
// This needs to be done after updating FieldInfo which keeps track of where
// field start/end so we don't later try to fill the the space of this
// field start/end so we don't later try to fill the space of this
// artificial member with (unnamed bitfield) padding.
// FIXME: This check should verify that this is indeed an artificial member
// we are supposed to ignore.
Expand Down Expand Up @@ -3727,7 +3727,7 @@ bool DWARFASTParserClang::CopyUniqueClassMethodTypes(
// Make sure this is a declaration and not a concrete instance by looking
// for DW_AT_declaration set to 1. Sometimes concrete function instances are
// placed inside the class definitions and shouldn't be included in the list
// of things are are tracking here.
// of things that are tracking here.
if (die.GetAttributeValueAsUnsigned(DW_AT_declaration, 0) != 1)
return;

Expand Down
2 changes: 1 addition & 1 deletion lldb/source/Plugins/SymbolFile/DWARF/ManualDWARFIndex.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -654,7 +654,7 @@ void ManualDWARFIndex::IndexSet::Encode(DataEncoder &encoder) const {

// Now that all strings have been gathered, we will emit the string table.
strtab.Encode(encoder);
// Followed the the symbol table data.
// Followed by the symbol table data.
encoder.AppendData(index_encoder.GetData());
}

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -285,7 +285,7 @@ StringRef TraceIntelPTBundleLoader::GetSchema() {
"tscPerfZeroConversion"?: {
// Values used to convert between TSCs and nanoseconds. See the time_zero
// section in https://man7.org/linux/man-pages/man2/perf_event_open.2.html
// for for information.
// for information.
"timeMult": integer,
"timeShift": integer,
Expand Down
2 changes: 1 addition & 1 deletion lldb/source/Symbol/LineTable.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -89,7 +89,7 @@ void LineTable::AppendLineEntryToSequence(
if (!entries.empty() && entries.back().file_addr == file_addr) {
// GCC don't use the is_prologue_end flag to mark the first instruction
// after the prologue.
// Instead of it it is issuing a line table entry for the first instruction
// Instead of it is issuing a line table entry for the first instruction
// of the prologue and one for the first instruction after the prologue. If
// the size of the prologue is 0 instruction then the 2 line entry will
// have the same file address. Removing it will remove our ability to
Expand Down
2 changes: 1 addition & 1 deletion lldb/source/Symbol/Symtab.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1286,7 +1286,7 @@ bool Symtab::Encode(DataEncoder &encoder) const {

// Now that all strings have been gathered, we will emit the string table.
strtab.Encode(encoder);
// Followed the the symbol table data.
// Followed by the symbol table data.
encoder.AppendData(symtab_encoder.GetData());
return true;
}
Expand Down
2 changes: 1 addition & 1 deletion lldb/source/Target/RegisterContextUnwind.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -712,7 +712,7 @@ bool RegisterContextUnwind::CheckIfLoopingStack() {
// frames with the same
// CFA (in theory we
// can have arbitrary number of frames with the same CFA, but more then 2 is
// very very unlikely)
// very unlikely)

RegisterContextUnwind::SharedPtr next_frame = GetNextFrame();
if (next_frame) {
Expand Down
4 changes: 2 additions & 2 deletions lldb/source/Target/Target.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1813,7 +1813,7 @@ size_t Target::ReadMemory(const Address &addr, void *dst, size_t dst_len,
} else {
// We have at least one section loaded. This can be because we have
// manually loaded some sections with "target modules load ..." or
// because we have have a live process that has sections loaded through
// because we have a live process that has sections loaded through
// the dynamic loader
load_addr =
fixed_addr.GetOffset(); // "fixed_addr" doesn't have a section, so
Expand Down Expand Up @@ -2096,7 +2096,7 @@ bool Target::ReadPointerFromMemory(const Address &addr, Status &error,
} else {
// We have at least one section loaded. This can be because we have
// manually loaded some sections with "target modules load ..." or
// because we have have a live process that has sections loaded through
// because we have a live process that has sections loaded through
// the dynamic loader
section_load_list.ResolveLoadAddress(pointer_vm_addr, pointer_addr);
}
Expand Down
4 changes: 2 additions & 2 deletions lldb/source/Utility/Args.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ static llvm::StringRef ParseDoubleQuotes(llvm::StringRef quoted,
// Inside double quotes, '\' and '"' are special.
static const char *k_escapable_characters = "\"\\";
while (true) {
// Skip over over regular characters and append them.
// Skip over regular characters and append them.
size_t regular = quoted.find_first_of(k_escapable_characters);
result += quoted.substr(0, regular);
quoted = quoted.substr(regular);
Expand Down Expand Up @@ -93,7 +93,7 @@ ParseSingleArgument(llvm::StringRef command) {

bool arg_complete = false;
do {
// Skip over over regular characters and append them.
// Skip over regular characters and append them.
size_t regular = command.find_first_of(" \t\r\"'`\\");
arg += command.substr(0, regular);
command = command.substr(regular);
Expand Down
2 changes: 1 addition & 1 deletion lldb/tools/debugserver/source/MacOSX/MachTask.mm
Original file line number Diff line number Diff line change
Expand Up @@ -670,7 +670,7 @@ static void get_threads_profile_data(DNBProfileDataScanType scanType,

err = RestoreExceptionPortInfo();

// NULL our our exception port and let our exception thread exit
// NULL our exception port and let our exception thread exit
mach_port_t exception_port = m_exception_port;
m_exception_port = 0;

Expand Down
2 changes: 1 addition & 1 deletion lldb/tools/lldb-vscode/JSONUtils.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1013,7 +1013,7 @@ llvm::json::Value CreateVariable(lldb::SBValue v, int64_t variablesReference,
SetValueForKey(v, object, "value");
auto type_obj = v.GetType();
auto type_cstr = type_obj.GetDisplayTypeName();
// If we have a type with many many children, we would like to be able to
// If we have a type with many children, we would like to be able to
// give a hint to the IDE that the type has indexed children so that the
// request can be broken up in grabbing only a few children at a time. We want
// to be careful and only call "v.GetNumChildren()" if we have an array type
Expand Down
2 changes: 1 addition & 1 deletion lldb/tools/lldb-vscode/lldb-vscode.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1738,7 +1738,7 @@ lldb::SBError LaunchProcess(const llvm::json::Object &request) {
// selected target after these commands are run.
g_vsc.target = g_vsc.debugger.GetSelectedTarget();
// Make sure the process is launched and stopped at the entry point before
// proceeding as the the launch commands are not run using the synchronous
// proceeding as the launch commands are not run using the synchronous
// mode.
error = g_vsc.WaitForProcessToStop(timeout_seconds);
}
Expand Down
2 changes: 1 addition & 1 deletion lldb/unittests/Interpreter/TestCompletion.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -60,7 +60,7 @@ class CompletionTest : public testing::Test {

void SetUp() override {
// chdir back into the original working dir this test binary started with.
// A previous test may have have changed the working dir.
// A previous test may have changed the working dir.
ASSERT_NO_ERROR(fs::set_current_path(OriginalWorkingDir));

// Get the name of the current test. To prevent that by chance two tests
Expand Down
2 changes: 1 addition & 1 deletion lldb/unittests/Process/gdb-remote/PortMapTest.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ TEST(PortMapTest, Constructors) {
GDBRemoteCommunicationServerPlatform::PortMap p1;
ASSERT_TRUE(p1.empty());

// Empty means no restrictions, return 0 and and bind to get a port
// Empty means no restrictions, return 0 and bind to get a port
llvm::Expected<uint16_t> available_port = p1.GetNextAvailablePort();
ASSERT_THAT_EXPECTED(available_port, llvm::HasValue(0));

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@
["\"", "\""],
["'", "'"]
],
// symbols that that can be used to surround a selection
// symbols that can be used to surround a selection
"surroundingPairs": [
["{", "}"],
["[", "]"],
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -114,7 +114,7 @@ Error GenericGlobalHandlerTy::getGlobalMetadataFromImage(
return Plugin::error("Unable to create ELF object for image %p",
Image.getStart());

// Search the ELF symbol using the the symbol name.
// Search the ELF symbol using the symbol name.
auto SymOrErr = getELFSymbol(*ELFObj, ImageGlobal.getName());
if (!SymOrErr)
return Plugin::error("Failed ELF lookup of global '%s': %s",
Expand Down
4 changes: 2 additions & 2 deletions openmp/runtime/src/kmp_affinity.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -2810,7 +2810,7 @@ static int __kmp_affinity_cmp_ProcCpuInfo_phys_id(const void *a,
// Set the array sizes for the hierarchy layers
static void __kmp_dispatch_set_hierarchy_values() {
// Set the maximum number of L1's to number of cores
// Set the maximum number of L2's to to either number of cores / 2 for
// Set the maximum number of L2's to either number of cores / 2 for
// Intel(R) Xeon Phi(TM) coprocessor formally codenamed Knights Landing
// Or the number of cores for Intel(R) Xeon(R) processors
// Set the maximum number of NUMA nodes and L3's to number of packages
Expand Down Expand Up @@ -3316,7 +3316,7 @@ static bool __kmp_affinity_create_cpuinfo_map(int *line,
return false;
}

// If the thread ids were not specified and we see entries entries that
// If the thread ids were not specified and we see entries that
// are duplicates, start the loop over and assign the thread ids manually.
assign_thread_ids = true;
goto restart_radix_check;
Expand Down
2 changes: 1 addition & 1 deletion openmp/runtime/src/kmp_itt.inl
Original file line number Diff line number Diff line change
Expand Up @@ -438,7 +438,7 @@ void *__kmp_itt_barrier_object(int gtid, int bt, int set_name,
KMP_BUILD_ASSERT(sizeof(kmp_team_t) >= bs_last_barrier);
// This condition is a must (we would have zero divide otherwise).
KMP_BUILD_ASSERT(sizeof(kmp_team_t) >= 2 * bs_last_barrier);
// More strong condition: make sure we have room at least for for two
// More strong condition: make sure we have room at least for two
// different ids (for each barrier type).
object = reinterpret_cast<void *>(
(kmp_uintptr_t)(team) +
Expand Down
2 changes: 1 addition & 1 deletion openmp/runtime/src/kmp_lock.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -3809,7 +3809,7 @@ static kmp_lock_index_t __kmp_lock_table_insert(kmp_user_lock_p lck) {
sizeof(kmp_user_lock_p) * (__kmp_user_lock_table.used - 1));
table[0] = (kmp_user_lock_p)__kmp_user_lock_table.table;
// We cannot free the previous table now, since it may be in use by other
// threads. So save the pointer to the previous table in in the first
// threads. So save the pointer to the previous table in the first
// element of the new table. All the tables will be organized into a list,
// and could be freed when library shutting down.
__kmp_user_lock_table.table = table;
Expand Down
2 changes: 1 addition & 1 deletion openmp/runtime/src/kmp_settings.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -1593,7 +1593,7 @@ static void __kmp_stg_parse_debug(char const *name, char const *value,
static void __kmp_stg_parse_debug_buf(char const *name, char const *value,
void *data) {
__kmp_stg_parse_bool(name, value, &__kmp_debug_buf);
// !!! TODO: Move buffer initialization of of this file! It may works
// !!! TODO: Move buffer initialization of this file! It may works
// incorrectly if KMP_DEBUG_BUF is parsed before KMP_DEBUG_BUF_LINES or
// KMP_DEBUG_BUF_CHARS.
if (__kmp_debug_buf) {
Expand Down
2 changes: 1 addition & 1 deletion polly/include/polly/ScopInfo.h
Original file line number Diff line number Diff line change
Expand Up @@ -509,7 +509,7 @@ class MemoryAccess final {
/// Here not all iterations access the same memory location, but iterations
/// for which j = 0 holds do. After lifting the equality check in ScopBuilder,
/// subsequent transformations do not only need check if a statement is
/// reduction like, but they also need to verify that that the reduction
/// reduction like, but they also need to verify that the reduction
/// property is only exploited for statement instances that load from and
/// store to the same data location. Doing so at dependence analysis time
/// could allow us to handle the above example.
Expand Down
2 changes: 1 addition & 1 deletion polly/lib/Transform/MatmulOptimizer.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -565,7 +565,7 @@ createMicroKernel(isl::schedule_node Node,
///
/// We create the BLIS macro-kernel by applying a combination of tiling
/// of dimensions of the band node and interchanging of two innermost
/// modified dimensions. The values of of MacroKernelParams's fields are used
/// modified dimensions. The values of MacroKernelParams's fields are used
/// as tile sizes.
///
/// @param Node The schedule node to be modified.
Expand Down
2 changes: 1 addition & 1 deletion third-party/benchmark/include/benchmark/benchmark.h
Original file line number Diff line number Diff line change
Expand Up @@ -971,7 +971,7 @@ class Benchmark {

// Have "setup" and/or "teardown" invoked once for every benchmark run.
// If the benchmark is multi-threaded (will run in k threads concurrently),
// the setup callback will be be invoked exactly once (not k times) before
// the setup callback will be invoked exactly once (not k times) before
// each run with k threads. Time allowing (e.g. for a short benchmark), there
// may be multiple such runs per benchmark, each run with its own
// "setup"/"teardown".
Expand Down
2 changes: 1 addition & 1 deletion third-party/benchmark/test/complexity_test.cc
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ int AddComplexityTest(const std::string &test_name,
AddCases(
TC_ConsoleOut,
{{"^%bigo_name %bigo_str %bigo_str[ ]*$"},
{"^%bigo_name", MR_Not}, // Assert we we didn't only matched a name.
{"^%bigo_name", MR_Not}, // Assert we didn't only matched a name.
{"^%rms_name %rms %rms[ ]*$", MR_Next}});
AddCases(
TC_JSONOut,
Expand Down