[lldb] Fix duplicate word typos; NFC

Those fixes were taken from https://reviews.llvm.org/D137338
This commit is contained in:
Fangrui Song 2023-09-01 21:32:24 -07:00
parent a8ac969b10
commit 678e3ee123
67 changed files with 74 additions and 74 deletions

View file

@ -93,7 +93,7 @@ void MultipleInheritanceCheck::registerMatchers(MatchFinder *Finder) {
void MultipleInheritanceCheck::check(const MatchFinder::MatchResult &Result) {
if (const auto *D = Result.Nodes.getNodeAs<CXXRecordDecl>("decl")) {
// Check against map to see if if the class inherits from multiple
// Check against map to see if the class inherits from multiple
// concrete classes
unsigned NumConcrete = 0;
for (const auto &I : D->bases()) {

View file

@ -601,7 +601,7 @@ void PPCallbacksTracker::appendArgument(const char *Name,
llvm::raw_string_ostream SS(Str);
SS << "[";
// Each argument is is a series of contiguous Tokens, terminated by a eof.
// Each argument is a series of contiguous Tokens, terminated by a eof.
// Go through each argument printing tokens until we reach eof.
for (unsigned I = 0; I < Value->getNumMacroArguments(); ++I) {
const Token *Current = Value->getUnexpArgument(I);

View file

@ -62,7 +62,7 @@ void f() {
// "new NoCopyMoveCtor{}" is processed differently in C++14/17 and C++20:
// * In C++14/17, it is recognized as aggregate initialization,
// no fixes will be generated although the generated fix is compilable.
// * In C++20, it is is recognized as default constructor initialization
// * In C++20, it is recognized as default constructor initialization
// (similar to "new NoCopyMoveCtor()"), the check will emit the fix and
// the fix is correct.
auto PNoCopyMoveCtor = std::unique_ptr<NoCopyMoveCtor>(new NoCopyMoveCtor{});

View file

@ -70,7 +70,7 @@ dfsan_label dfsan_read_label(const void *addr, size_t size);
/// from the address addr.
dfsan_origin dfsan_read_origin_of_first_taint(const void *addr, size_t size);
/// Returns whether the given label label contains the label elem.
/// Returns whether the given label contains the label elem.
int dfsan_has_label(dfsan_label label, dfsan_label elem);
/// Flushes the DFSan shadow, i.e. forgets about all labels currently associated

View file

@ -204,7 +204,7 @@ LOCAL_LABEL(divby0):
LOCAL_LABEL(block_skip_##shift) :; \
adcs r3, r3 // same as ((r3 << 1) | Carry). Carry is set if r0 >= r2.
// TODO: if current location counter is not not word aligned, we don't
// TODO: if current location counter is not word aligned, we don't
// need the .p2align and nop
// Label div0block must be word-aligned. First align block 31
.p2align 2

View file

@ -208,7 +208,7 @@ TEST_F(StackPrintTest, SKIP_ON_SPARC(TruncatesContents)) {
char tinybuf[10];
trace.PrintTo(tinybuf, sizeof(tinybuf));
// This the the truncation case.
// This the truncation case.
ASSERT_GT(actual_len, sizeof(tinybuf));
// The truncated contents should be a prefix of the full contents.

View file

@ -2565,7 +2565,7 @@ int sigaction_impl(int sig, const __sanitizer_sigaction *act,
// Copy act into sigactions[sig].
// Can't use struct copy, because compiler can emit call to memcpy.
// Can't use internal_memcpy, because it copies byte-by-byte,
// and signal handler reads the handler concurrently. It it can read
// and signal handler reads the handler concurrently. It can read
// some bytes from old value and some bytes from new value.
// Use volatile to prevent insertion of memcpy.
sigactions[sig].handler =

View file

@ -226,7 +226,7 @@ template <> LIBC_INLINE double fma<double>(double x, double y, double z) {
if (r_exp > 0) {
// The result is normal. We will shift the mantissa to the right by
// 63 - 52 = 11 bits (from the locations of the most significant bit).
// Then the rounding bit will correspond the the 11th bit, and the lowest
// Then the rounding bit will correspond the 11th bit, and the lowest
// 10 bits are merged into sticky bits.
round_bit = (result & 0x0400ULL) != 0;
sticky_bits |= (result & 0x03ffULL) != 0;

View file

@ -244,7 +244,7 @@ LIBC_INLINE int raise_except(int excepts) {
// We set the status flag for exception one at a time and call the
// fwait instruction to actually get the processor to raise the
// exception by calling the exception handler. This scheme is per
// the description in in "8.6 X87 FPU EXCEPTION SYNCHRONIZATION"
// the description in "8.6 X87 FPU EXCEPTION SYNCHRONIZATION"
// of the "Intel 64 and IA-32 Architectures Software Developer's
// Manual, Vol 1".

View file

@ -128,7 +128,7 @@ private:
// the ArgProvider can only return the next item in the list. This function is
// used in index mode when the item that needs to be read is not the next one.
// It moves cur_args to the index requested so the the appropriate value may
// It moves cur_args to the index requested so the appropriate value may
// be read. This may involve parsing the format string, and is in the worst
// case an O(n^2) operation.
bool args_to_index(size_t index);

View file

@ -86,7 +86,7 @@ private:
// the ArgList can only return the next item in the list. This function is
// used in index mode when the item that needs to be read is not the next one.
// It moves cur_args to the index requested so the the appropriate value may
// It moves cur_args to the index requested so the appropriate value may
// be read. This may involve parsing the format string, and is in the worst
// case an O(n^2) operation.
void args_to_index(size_t index);

View file

@ -114,7 +114,7 @@ public:
test_one_input(func, F(1234.0), I(1234), false);
test_one_input(func, F(-1234.0), I(-1234), false);
// The rest of this this function compares with an equivalent MPFR function
// The rest of this function compares with an equivalent MPFR function
// which rounds floating point numbers to long values. There is no MPFR
// function to round to long long or wider integer values. So, we will
// the remaining tests only if the width of I less than equal to that of

View file

@ -39,7 +39,7 @@ public:
SBTraceCursor CreateNewCursor(SBError &error, SBThread &thread);
/// Save the trace to the specified directory, which will be created if
/// needed. This will also create a a file \a <directory>/trace.json with the
/// needed. This will also create a file \a <directory>/trace.json with the
/// main properties of the trace session, along with others files which
/// contain the actual trace data. The trace.json file can be used later as
/// input for the "trace load" command to load the trace in LLDB, or for the

View file

@ -1084,7 +1084,7 @@ protected:
ModuleList::GetGlobalModuleListProperties().GetSymlinkMappings();
lldb::SectionListUP m_sections_up; ///< Unified section list for module that
/// is used by the ObjectFile and and
/// is used by the ObjectFile and
/// ObjectFile instances for the debug info
std::atomic<bool> m_did_load_objfile{false};

View file

@ -40,7 +40,7 @@ public:
static bool classof(const Expression *obj) { return obj->isA(&ID); }
// The IRPasses struct is filled in by a runtime after an expression is
// compiled and can be used to to run fixups/analysis passes as required.
// compiled and can be used to run fixups/analysis passes as required.
// EarlyPasses are run on the generated module before lldb runs its own IR
// fixups and inserts instrumentation code/pointer checks. LatePasses are run
// after the module has been processed by llvm, before the module is

View file

@ -82,7 +82,7 @@ public:
return ProtectedGetPropertyAtIndex(idx);
}
// Property can be be a property path like
// Property can be a property path like
// "target.process.extra-startup-command"
virtual const Property *
GetPropertyAtPath(const ExecutionContext *exe_ctx,

View file

@ -110,7 +110,7 @@ public:
/// Selects an architecture in an object file.
///
/// Object files that contain a single architecture should verify that the
/// specified \a arch matches the architecture in in object file and return
/// specified \a arch matches the architecture in the object file and return
/// \b true or \b false accordingly.
///
/// Object files that contain more than one architecture should attempt to

View file

@ -1224,7 +1224,7 @@ public:
/// this function if the platform fails to identify the host OS version. The
/// platform should be checked first in case you are running a simulator
/// platform that might itself be running natively, but have different
/// heuristics for figuring out which OS is is emulating.
/// heuristics for figuring out which OS is emulating.
///
/// \return
/// Returns the version tuple of the host OS. In case of failure an empty
@ -1840,7 +1840,7 @@ public:
///
/// \param[in] load_addr
/// The load address to query the range_info for. May include non
/// address bits, these will be removed by the the ABI plugin if there is
/// address bits, these will be removed by the ABI plugin if there is
/// one.
///
/// \param[out] range_info

View file

@ -25,7 +25,7 @@ private:
/// Constructor
///
/// The constructor for the target list is private. Clients can
/// get ahold of of the one and only target list through the
/// get ahold of the one and only target list through the
/// lldb_private::Debugger::GetSharedInstance().GetTargetList().
///
/// \see static TargetList& lldb_private::Debugger::GetTargetList().

View file

@ -58,7 +58,7 @@ public:
virtual void Dump(Stream *s) const = 0;
/// Save the trace to the specified directory, which will be created if
/// needed. This will also create a a file \a <directory>/trace.json with the
/// needed. This will also create a file \a <directory>/trace.json with the
/// main properties of the trace session, along with others files which
/// contain the actual trace data. The trace.json file can be used later as
/// input for the "trace load" command to load the trace in LLDB.

View file

@ -244,7 +244,7 @@ public:
if (first_intersect == m_entries.end())
return;
// We we can combine at least one entry, then we make a new collection and
// We can combine at least one entry, then we make a new collection and
// populate it accordingly, and then swap it into place.
auto pos = std::next(first_intersect);
Collection minimal_ranges(m_entries.begin(), pos);
@ -501,7 +501,7 @@ public:
}
}
// We we can combine at least one entry, then we make a new collection and
// We can combine at least one entry, then we make a new collection and
// populate it accordingly, and then swap it into place.
if (can_combine) {
Collection minimal_ranges;

View file

@ -413,7 +413,7 @@ const char *Breakpoint::GetConditionText() const {
void Breakpoint::SetCallback(BreakpointHitCallback callback, void *baton,
bool is_synchronous) {
// The default "Baton" class will keep a copy of "baton" and won't free or
// delete it when it goes goes out of scope.
// delete it when it goes out of scope.
m_options.SetCallback(callback, std::make_shared<UntypedBaton>(baton),
is_synchronous);

View file

@ -204,7 +204,7 @@ bool BreakpointLocation::IsCallbackSynchronous() {
void BreakpointLocation::SetCallback(BreakpointHitCallback callback,
void *baton, bool is_synchronous) {
// The default "Baton" class will keep a copy of "baton" and won't free or
// delete it when it goes goes out of scope.
// delete it when it goes out of scope.
GetLocationOptions().SetCallback(
callback, std::make_shared<UntypedBaton>(baton), is_synchronous);
SendBreakpointLocationChangedEvent(eBreakpointEventTypeCommandChanged);

View file

@ -49,7 +49,7 @@ break_id_t BreakpointSite::GetNextID() {
bool BreakpointSite::ShouldStop(StoppointCallbackContext *context) {
m_hit_counter.Increment();
// ShouldStop can do a lot of work, and might even come come back and hit
// ShouldStop can do a lot of work, and might even come back and hit
// this breakpoint site again. So don't hold the m_owners_mutex the whole
// while. Instead make a local copy of the collection and call ShouldStop on
// the copy.

View file

@ -66,7 +66,7 @@ Watchpoint::~Watchpoint() = default;
void Watchpoint::SetCallback(WatchpointHitCallback callback, void *baton,
bool is_synchronous) {
// The default "Baton" class will keep a copy of "baton" and won't free or
// delete it when it goes goes out of scope.
// delete it when it goes out of scope.
m_options.SetCallback(callback, std::make_shared<UntypedBaton>(baton),
is_synchronous);

View file

@ -1795,7 +1795,7 @@ protected:
return false;
}
// Is is important that we track the address used to request the region as
// It is important that we track the address used to request the region as
// this will give the correct section name in the case that regions overlap.
// On Windows we get mutliple regions that start at the same place but are
// different sizes and refer to different sections.

View file

@ -285,7 +285,7 @@ bool ConstStringTable::Encode(DataEncoder &encoder) {
size_t length_offset = encoder.GetByteSize();
encoder.AppendU32(0); // Total length of all strings which will be fixed up.
size_t strtab_offset = encoder.GetByteSize();
encoder.AppendU8(0); // Start the string table with with an empty string.
encoder.AppendU8(0); // Start the string table with an empty string.
for (auto s: m_strings) {
// Make sure all of the offsets match up with what we handed out!
assert(m_string_to_offset.find(s)->second ==

View file

@ -347,7 +347,7 @@ size_t ModuleList::RemoveOrphans(bool mandatory) {
}
size_t remove_count = 0;
// Modules might hold shared pointers to other modules, so removing one
// module might make other other modules orphans. Keep removing modules until
// module might make other modules orphans. Keep removing modules until
// there are no further modules that can be removed.
bool made_progress = true;
while (made_progress) {

View file

@ -824,7 +824,7 @@ static Status getXPCAuthorization(ProcessLaunchInfo &launch_info) {
if (copyRightStatus != errAuthorizationSuccess) {
// Eventually when the commandline supports running as root and the user
// is not
// logged in in the current audit session, we will need the trick in gdb
// logged in to the current audit session, we will need the trick in gdb
// where
// we ask the user to type in the root passwd in the terminal.
error.SetError(2, eErrorTypeGeneric);

View file

@ -46,7 +46,7 @@ public:
// in other environments there can be a large number of different functions
// involved in async traps.
bool CallFrameAddressIsValid(lldb::addr_t cfa) override {
// Make sure the stack call frame addresses are are 8 byte aligned
// Make sure the stack call frame addresses are 8 byte aligned
if (cfa & (8ull - 1ull))
return false; // Not 8 byte aligned
if (cfa == 0)

View file

@ -49,7 +49,7 @@ public:
// in other environments there can be a large number of different functions
// involved in async traps.
bool CallFrameAddressIsValid(lldb::addr_t cfa) override {
// Make sure the stack call frame addresses are are 8 byte aligned
// Make sure the stack call frame addresses are 8 byte aligned
if (cfa & (8ull - 1ull))
return false; // Not 8 byte aligned
if (cfa == 0)

View file

@ -37,7 +37,7 @@ public:
bool RegisterIsVolatile(const lldb_private::RegisterInfo *reg_info) override;
bool CallFrameAddressIsValid(lldb::addr_t cfa) override {
// Make sure the stack call frame addresses are are 4 byte aligned
// Make sure the stack call frame addresses are 4 byte aligned
if (cfa & (4ull - 1ull))
return false; // Not 4 byte aligned
if (cfa == 0)

View file

@ -37,7 +37,7 @@ public:
bool RegisterIsVolatile(const lldb_private::RegisterInfo *reg_info) override;
bool CallFrameAddressIsValid(lldb::addr_t cfa) override {
// Make sure the stack call frame addresses are are 4 byte aligned
// Make sure the stack call frame addresses are 4 byte aligned
if (cfa & (4ull - 1ull))
return false; // Not 4 byte aligned
if (cfa == 0)

View file

@ -52,7 +52,7 @@ public:
// If we were to enforce 16-byte alignment, we also need to relax to 4-byte
// alignment for non-darwin i386 targets.
bool CallFrameAddressIsValid(lldb::addr_t cfa) override {
// Make sure the stack call frame addresses are are 4 byte aligned
// Make sure the stack call frame addresses are 4 byte aligned
if (cfa & (4ull - 1ull))
return false; // Not 4 byte aligned
if (cfa == 0)

View file

@ -51,7 +51,7 @@ void ArchitectureArm::OverrideStopInfo(Thread &thread) const {
// stepping because the debugger stops regardless due to the BVR/BCR
// triggering a stop.
//
// It also means we can set breakpoints on instructions inside an an if/then
// It also means we can set breakpoints on instructions inside an if/then
// block and correctly skip them if we use the BKPT instruction. The ARM and
// Thumb BKPT instructions are unconditional even when executed in a Thumb IT
// block.

View file

@ -53,7 +53,7 @@ class ClangPersistentVariables;
/// struct so that it can be passed to the JITted version of the IR.
///
/// Fourth and finally, it "dematerializes" the struct after the JITted code
/// has has executed, placing the new values back where it found the old ones.
/// has executed, placing the new values back where it found the old ones.
class ClangExpressionDeclMap : public ClangASTSource {
public:
/// Constructor

View file

@ -165,7 +165,7 @@ protected:
uint64_t abort_cause; // unsigned int
};
/// Extract the `__crash_info` annotations from each of of the target's
/// Extract the `__crash_info` annotations from each of the target's
/// modules.
///
/// If the platform have a crashed processes with a `__crash_info` section,

View file

@ -467,7 +467,7 @@ ProcessSP PlatformWindows::DebugProcess(ProcessLaunchInfo &launch_info,
// mechanisms to do it for us, because it doesn't have the special knowledge
// required for setting up the background thread or passing the right flags.
//
// Another problem is that that LLDB's standard model for debugging a process
// Another problem is that LLDB's standard model for debugging a process
// is to first launch it, have it stop at the entry point, and then attach to
// it. In Windows this doesn't quite work, you have to specify as an
// argument to CreateProcess() that you're going to debug the process. So we

View file

@ -671,7 +671,7 @@ void NativeProcessLinux::MonitorSIGTRAP(const siginfo_t &info,
SetCurrentThreadID(main_thread->GetID());
main_thread->SetStoppedByExec();
// Tell coordinator about about the "new" (since exec) stopped main thread.
// Tell coordinator about the "new" (since exec) stopped main thread.
ThreadWasCreated(*main_thread);
// Let our delegate know we have just exec'd.

View file

@ -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

View file

@ -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) |

View file

@ -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

View file

@ -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."

View file

@ -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 {

View file

@ -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) {
@ -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.
@ -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;

View file

@ -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());
}

View file

@ -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,

View file

@ -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

View file

@ -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;
}

View file

@ -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) {

View file

@ -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
@ -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);
}

View file

@ -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);
@ -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);

View file

@ -670,7 +670,7 @@ kern_return_t MachTask::ShutDownExcecptionThread() {
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;

View file

@ -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

View file

@ -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);
}

View file

@ -60,7 +60,7 @@ protected:
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

View file

@ -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));

View file

@ -19,7 +19,7 @@
["\"", "\""],
["'", "'"]
],
// symbols that that can be used to surround a selection
// symbols that can be used to surround a selection
"surroundingPairs": [
["{", "}"],
["[", "]"],

View file

@ -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",

View file

@ -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
@ -3316,7 +3316,7 @@ restart_radix_check:
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;

View file

@ -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) +

View file

@ -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;

View file

@ -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) {

View file

@ -509,7 +509,7 @@ private:
/// 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.

View file

@ -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.

View file

@ -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".

View file

@ -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,