Fix dupe word typos.

src/coreclr/debug/daccess/daccess.cpp

@@ -3677,7 +3677,7 @@ ClrDataAccess::StartEnumAppDomains(
 
     EX_TRY
     {
-        // Only one app domain - use 1 to indicate there there is a next value
+        // Only one app domain - use 1 to indicate that there is a next value
         *handle = 1;
         status = S_OK;
     }

src/coreclr/debug/daccess/inspect.cpp

@@ -3555,7 +3555,7 @@ ClrDataTypeInstance::GetDefinition(
             // Instead, just use the same type handle.
             // XXX Microsoft - Generics issues?
 
-            // Question - what does the GetCl return return here? The underlying element type?
+            // Question - what does the GetCl return here? The underlying element type?
             // If so, we are lossing information.
             //
             defType = m_typeHandle;

src/coreclr/debug/di/divalue.cpp

@@ -1250,7 +1250,7 @@ HRESULT CordbReferenceValue::Build(CordbAppDomain *          appdomain,
     HRESULT hr = S_OK;
 
     // We can find the AD from an object handle (but not a normal object), so the AppDomain may
-    // be NULL if if it's an OH.
+    // be NULL if it's an OH.
     //_ASSERTE((appdomain != NULL) || objectRefsInHandles);
 
     // A reference, possibly to an object or value class

src/coreclr/debug/di/process.cpp

@@ -3288,7 +3288,7 @@ HRESULT CordbProcess::Terminate(unsigned int exitCode)
     // Since we're currently holding the stop-go lock, that means we at least get some serialization.
     //
     // Note that on Windows, the process isn't really terminated until we receive the EXIT_PROCESS_DEBUG_EVENT.
-    // Before then, we can still still access the debuggee's address space.  On the other, for Mac debugging,
+    // Before then, we can still access the debuggee's address space.  On the other, for Mac debugging,
     // the process can die any time after this call, and so we can no longer call into the DAC.
     GetShim()->GetNativePipeline()->TerminateProcess(exitCode);
 
@@ -5531,7 +5531,7 @@ void CordbProcess::RawDispatchEvent(
             }
 
             // This release may send an DB_IPCE_FUNC_EVAL_CLEANUP IPC event. That's ok b/c
-            // we're still synced even if if Continue was called inside the callback.
+            // we're still synced even if Continue was called inside the callback.
             // That's because the StopContinueHolder bumped up the stopcount.
             // Corresponding AddRef() in CallFunction().
             // @todo - this is leaked if we don't get an EvalComplete event (eg, process exits with

src/coreclr/debug/di/publish.cpp

@@ -716,7 +716,7 @@ HRESULT CorpubProcess::EnumAppDomains(ICorPublishAppDomainEnum **ppIEnum)
     }
     _ASSERTE(pADI != NULL);
 
-    // Collect all the AppDomain info info a list of CorpubAppDomains
+    // Collect all the AppDomain info into a list of CorpubAppDomains
     for (i = 0; i < tempBlock.m_iTotalSlots; i++)
     {
         if (!pADI[i].IsEmpty())

src/coreclr/debug/di/rspriv.h

@@ -4812,7 +4812,7 @@ class CordbType : public CordbBase, public ICorDebugType, public ICorDebugType2
     // Create a type from metadata
     static HRESULT SigToType(CordbModule * pModule, SigParser * pSigParser, const Instantiation * pInst, CordbType ** ppResultType);
 
-    // Create a type from from the data received from the left-side
+    // Create a type from the data received from the left-side
     static HRESULT TypeDataToType(CordbAppDomain *appdomain, DebuggerIPCE_ExpandedTypeData *data, CordbType **pRes);
     static HRESULT TypeDataToType(CordbAppDomain *appdomain, DebuggerIPCE_BasicTypeData *data, CordbType **pRes);
     static HRESULT InstantiateFromTypeHandle(CordbAppDomain * appdomain,

src/coreclr/debug/di/rsthread.cpp

@@ -705,7 +705,7 @@ HRESULT CordbThread::SetDebugState(CorDebugThreadState state)
 
         if (SUCCEEDED(hr))
         {
-            // This lets the debugger suspend / resume threads. This is only called when when the
+            // This lets the debugger suspend / resume threads. This is only called when the
             // target is already synchronized. That means all the threads are already suspended. So
             // setting the suspend bit here just means that the debugger's continue logic won't resume
             // this thread when we do a Continue.

src/coreclr/debug/ee/debugger.cpp

@@ -7209,7 +7209,7 @@ void Debugger::EnsureDebuggerAttached(Thread * pThread, EXCEPTION_POINTERS * pEx
     // Note that this isn't all that bad because if the debugger hasn't actually detached
     // in the middle then the second jit attach will complete almost instantly and thread 2
     // is unblocked. If the debugger did detach in the middle then it seems reasonable for
-    // thread 2 to continue to wait until until the debugger is attached once again for the
+    // thread 2 to continue to wait until the debugger is attached once again for the
     // second attach. Basically if one jit attach completes and restarts fast enough it might
     // just go unnoticed by some threads and it will be as if it never happened. Doesn't seem
     // that bad as long as we know another jit attach is again in progress.

src/coreclr/debug/ee/debugger.h

@@ -1681,7 +1681,7 @@ class MapSortIL : public CQuickSort<DebuggerILToNativeMap>
         {
             return 1;
         }
-        // call_instruction goes at the very very end of the table.
+        // call_instruction goes at the very end of the table.
         else if ((first->source & call_inst) == call_inst
             && (second->source & call_inst) == call_inst)
         {

src/coreclr/debug/ee/frameinfo.cpp

@@ -1157,7 +1157,7 @@ StackWalkAction TrackUMChain(CrawlFrame *pCF, DebuggerFrameData *d)
         // This check is probably unnecessary.  The client of the debugger stackwalker should make
         // the decision themselves as to what to do with the UM chain callbacks.
         //
-        // -- INCORRECT SEE SEE "CORRECTION" BELOW --
+        // -- INCORRECT SEE "CORRECTION" BELOW --
         // Currently, both
         // ControllerStackInfo and InterceptorStackInfo ignore UM chains completely anyway.
         // (For an example, refer to the cctor example in the previous comment.)

src/coreclr/debug/inc/dacdbiinterface.h

@@ -2767,7 +2767,7 @@ class IDacDbiInterface
     {
     public:
         //
-        // Store a copy of of the provided string.
+        // Store a copy of the provided string.
         //
         // Arguments:
         //     psz - The null-terminated unicode string to copy.

src/coreclr/debug/inc/dacdbistructures.inl

@@ -482,7 +482,7 @@ int SequencePoints::MapSortILMap::Compare(DebuggerILToNativeMap * first,
     {
         return 1;
     }
-    // call_instruction goes at the very very end of the table.
+    // call_instruction goes at the very end of the table.
     else if ((first->source & call_inst) == call_inst
         && (second->source & call_inst) == call_inst)
     {

src/coreclr/ildasm/dasm.cpp

@@ -886,7 +886,7 @@ void DumpMscorlib(void* GUICookie)
     //
     mdTypeDef tkObjectTypeDef = mdTypeDefNil;
 
-    // Lookup the type System.Object and see it it has a type definition in this assembly
+    // Lookup the type System.Object and see if it has a type definition in this assembly
     if (SUCCEEDED(g_pPubImport->FindTypeDefByName(W("System.Object"), mdTypeDefNil, &tkObjectTypeDef)))
     {
         if (tkObjectTypeDef != mdTypeDefNil)

src/coreclr/inc/clrconfig.h

@@ -90,7 +90,7 @@ class CLRConfig
     #define CONFIG_STRING_INFO_EX(symbol, name, description, lookupOptions)
 #endif // _DEBUG
 
-        // Now that we have defined what what the macros in file:CLRConfigValues.h mean, include it to generate the code.
+        // Now that we have defined what the macros in file:CLRConfigValues.h mean, include it to generate the code.
         #include "clrconfigvalues.h"
 
     #undef RETAIL_CONFIG_DWORD_INFO

src/coreclr/jit/compiler.cpp

@@ -3865,7 +3865,7 @@ void Compiler::compSetOptimizationLevel()
         theMinOptsValue = true;
     }
     // For PREJIT we never drop down to MinOpts
-    // unless unless CLFLG_MINOPT is set
+    // unless CLFLG_MINOPT is set
     else if (!opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT))
     {
         if ((unsigned)JitConfig.JitMinOptsCodeSize() < info.compILCodeSize)
@@ -3907,7 +3907,7 @@ void Compiler::compSetOptimizationLevel()
 #else  // !DEBUG
     // Retail check if we should force Minopts due to the complexity of the method
     // For PREJIT we never drop down to MinOpts
-    // unless unless CLFLG_MINOPT is set
+    // unless CLFLG_MINOPT is set
     if (!theMinOptsValue && !opts.jitFlags->IsSet(JitFlags::JIT_FLAG_PREJIT) &&
         ((DEFAULT_MIN_OPTS_CODE_SIZE < info.compILCodeSize) || (DEFAULT_MIN_OPTS_INSTR_COUNT < opts.instrCount) ||
          (DEFAULT_MIN_OPTS_BB_COUNT < fgBBcount) || (DEFAULT_MIN_OPTS_LV_NUM_COUNT < lvaCount) ||

src/coreclr/jit/compiler.h

@@ -215,14 +215,14 @@ class LclSsaVarDsc
     // The SSA number associated with the previous definition for partial (GTF_USEASG) defs.
     unsigned m_useDefSsaNum = SsaConfig::RESERVED_SSA_NUM;
     // Number of uses of this SSA def (may be an over-estimate).
-    // May not be accurate for for promoted fields.
+    // May not be accurate for promoted fields.
     unsigned short m_numUses = 0;
     // True if there may be phi args uses of this def
-    // May not be accurate for for promoted fields.
+    // May not be accurate for promoted fields.
     // (false implies all uses are non-phi).
     bool m_hasPhiUse = false;
     // True if there may be uses of the def in a different block.
-    // May not be accurate for for promoted fields.
+    // May not be accurate for promoted fields.
     bool m_hasGlobalUse = false;
 
 public:
@@ -5267,7 +5267,7 @@ class Compiler
 protected:
     bool fgReachable(BasicBlock* b1, BasicBlock* b2); // Returns true if block b1 can reach block b2
 
-    // Compute immediate dominators, the dominator tree and and its pre/post-order travsersal numbers.
+    // Compute immediate dominators, the dominator tree and its pre/post-order travsersal numbers.
     void fgComputeDoms();
 
     void fgCompDominatedByExceptionalEntryBlocks();

src/coreclr/jit/emit.cpp

@@ -985,7 +985,7 @@ insGroup* emitter::emitSavIG(bool emitAdd)
 
     if (!emitAdd)
     {
-        // Update the previous recorded live GC ref sets, but not if if we are
+        // Update the previous recorded live GC ref sets, but not if we are
         // starting an "overflow" buffer. Note that this is only used to
         // determine whether we need to store or not store the GC ref sets for
         // the next IG, which is dependent on exactly what the state of the

src/coreclr/jit/fgdiagnostic.cpp

@@ -642,7 +642,7 @@ FILE* Compiler::fgOpenFlowGraphFile(bool* wbDontClose, Phases phase, PhasePositi
             sprintf_s((char*)filename, charCount, FILENAME_PATTERN, escapedString, phasePositionString, phaseName,
                       tierName, type);
         }
-        fgxFile = fopen(filename, "wx"); // Open the file for writing only only if it doesn't already exist
+        fgxFile = fopen(filename, "wx"); // Open the file for writing only if it doesn't already exist
         if (fgxFile == nullptr)
         {
             // This filename already exists, so create a different one by appending ~2, ~3, etc...

src/coreclr/jit/fgopt.cpp

@@ -4124,7 +4124,7 @@ bool Compiler::fgOptimizeBranch(BasicBlock* bJump)
     }
 
     //
-    // We we are ngen-ing:
+    // We are ngen-ing:
     // If the uncondional branch is a rarely run block then
     // we are willing to have more code expansion since we
     // won't be running code from this page

src/coreclr/jit/fgprofile.cpp

@@ -3802,7 +3802,7 @@ void EfficientEdgeCountReconstructor::PropagateEdges(BasicBlock* block, BlockInf
         return;
     }
 
-    // We may not have have the same number of model edges and flow edges.
+    // We may not have the same number of model edges and flow edges.
     //
     // This can happen because bome BBJ_LEAVE blocks may have been missed during
     // our spanning tree walk since we don't know where all the finallies can return

src/coreclr/jit/hwintrinsiccodegenxarch.cpp

@@ -1920,7 +1920,7 @@ void CodeGen::genAvxFamilyIntrinsic(GenTreeHWIntrinsic* node)
             emitAttr    kmovAttr = EA_4BYTE;
 
             // TODO-XARCH-AVX512 note that this type/kmov combination assumes 512-bit vector types but would change
-            // if used for other vector lengths, i.e., TYPE_BYTE requires kmovq for for 512-bit vector, but kmovd
+            // if used for other vector lengths, i.e., TYPE_BYTE requires kmovq for 512-bit vector, but kmovd
             // for 256-bit vector.
             switch (baseType)
             {

src/coreclr/jit/importer.cpp

@@ -3087,7 +3087,7 @@ void Compiler::impImportAndPushBox(CORINFO_RESOLVED_TOKEN* pResolvedToken)
     // Spill any special side effects
     impSpillSpecialSideEff();
 
-    // Get get the expression to box from the stack.
+    // Get the expression to box from the stack.
     GenTree*   op1       = nullptr;
     GenTree*   op2       = nullptr;
     StackEntry se        = impPopStack();

src/coreclr/jit/importercalls.cpp

@@ -7153,7 +7153,7 @@ void Compiler::impDevirtualizeCall(GenTreeCall*            call,
                     // So, revise the box to simply create a local copy, use the address of that copy
                     // as the this pointer, and update the entry point to the unboxed entry.
                     //
-                    // Ideally, we then inline the boxed method and and if it turns out not to modify
+                    // Ideally, we then inline the boxed method and if it turns out not to modify
                     // the copy, we can undo the copy too.
                     GenTree* localCopyThis = nullptr;
 

src/coreclr/jit/indirectcalltransformer.cpp

@@ -1089,7 +1089,7 @@ class IndirectCallTransformer
             JITDUMP("Hot pred block is " FMT_BB " and cold pred block is " FMT_BB "\n", hotBlock->bbNum,
                     coldBlock->bbNum);
 
-            // Clone and and copy the statements in the check block up to
+            // Clone and copy the statements in the check block up to
             // and including lastStmt over to the hot block.
             //
             // This will be the "hot" copy of the code.

src/coreclr/jit/lir.h

@@ -92,7 +92,7 @@ class LIR final
     //     // View the block as a range
     //     LIR::Range& blockRange = LIR::AsRange(block);
     //
-    //     // Create a read only range from from it.
+    //     // Create a read only range from it.
     //     LIR::ReadOnlyRange readRange = blockRange;
     //
     //     // Remove the last node from the block

src/coreclr/jit/lowerxarch.cpp

@@ -597,7 +597,7 @@ void Lowering::LowerPutArgStk(GenTreePutArgStk* putArgStk)
                     // For the case where we cannot directly push the value, if we run out of registers,
                     // it would be better to defer computation until we are pushing the arguments rather
                     // than spilling, but this situation is not all that common, as most cases of FIELD_LIST
-                    // are promoted structs, which do not not have a large number of fields, and of those
+                    // are promoted structs, which do not have a large number of fields, and of those
                     // most are lclVars or copy-propagated constants.
 
                     fieldNode->SetRegOptional();
@@ -1769,7 +1769,7 @@ GenTree* Lowering::LowerHWIntrinsicCmpOp(GenTreeHWIntrinsic* node, genTreeOps cm
         //
         // However, if we have less than 8 elements then we have to change it up since we have less
         // than 8 bits in the output mask and unused bits will be set to 0. This occurs for 32-bit
-        // for Vector128 and and 64-bit elements when using either Vector128 or Vector256.
+        // for Vector128 and 64-bit elements when using either Vector128 or Vector256.
         //
         // To account for this, we will invert the comparison being done. So if the user wants
         // `x == y`, we will instead emit `mask = (x != y)`, we will still emit `kortest mask, mask`,

src/coreclr/jit/lsra.h

@@ -1692,7 +1692,7 @@ class LinearScan : public LinearScanInterface
     // Locals that are currently placed in registers via PUTARG_REG. These
     // locals are available due to the special PUTARG treatment, and we keep
     // track of them between the PUTARG_REG and CALL to ensure we keep the
-    // register they are placed in in the preference set.
+    // register they are placed in the preference set.
     PlacedLocal placedArgLocals[REG_COUNT];
     size_t      numPlacedArgLocals;
 

src/coreclr/jit/lsraarm64.cpp

@@ -970,7 +970,7 @@ int LinearScan::BuildNode(GenTree* tree)
             }
 
             // For ARMv8 exclusives the lifetime of the addr and data must be extended because
-            // it may be used used multiple during retries
+            // it may be used multiple during retries
 
             // For ARMv8.1 atomic cas the lifetime of the addr and data must be extended to prevent
             // them being reused as the target register which must be destroyed early
@@ -984,7 +984,7 @@ int LinearScan::BuildNode(GenTree* tree)
                 RefPosition* comparandUse = BuildUse(tree->AsCmpXchg()->gtOpComparand);
 
                 // For ARMv8 exclusives the lifetime of the comparand must be extended because
-                // it may be used used multiple during retries
+                // it may be used multiple during retries
                 if (!compiler->compOpportunisticallyDependsOn(InstructionSet_Atomics))
                 {
                     setDelayFree(comparandUse);
@@ -1031,7 +1031,7 @@ int LinearScan::BuildNode(GenTree* tree)
             }
 
             // For ARMv8 exclusives the lifetime of the addr and data must be extended because
-            // it may be used used multiple during retries
+            // it may be used multiple during retries
             if (!compiler->compOpportunisticallyDependsOn(InstructionSet_Atomics))
             {
                 // Internals may not collide with target

src/coreclr/jit/smallhash.h

@@ -573,7 +573,7 @@ class HashTableBase
 
     //------------------------------------------------------------------------
     // HashTableBase::Remove: removes a key from the hash table and asserts
-    //                        that it did exist in the the table.
+    //                        that it did exist in the table.
     //
     // Arguments:
     //    key   - The key to remove from the table.

src/coreclr/jit/utils.cpp

@@ -873,7 +873,7 @@ void ConfigMethodRange::InitRanges(const WCHAR* rangeStr, unsigned capacity)
         lastRange++;
     }
 
-    // If we didn't parse the full range string, note index of the the
+    // If we didn't parse the full range string, note index of the
     // first bad char.
     if ((m_badChar != 0) && (*p != 0))
     {

src/coreclr/jit/valuenum.cpp

@@ -816,7 +816,7 @@ int ValueNumStore::EvalComparison<double>(VNFunc vnf, double v0, double v1)
 {
     // Here we handle specialized double comparisons.
 
-    // We must check for a NaN argument as they they need special handling
+    // We must check for a NaN argument as they need special handling
     bool hasNanArg = (_isnan(v0) || _isnan(v1));
 
     if (vnf < VNF_Boundary)
@@ -880,7 +880,7 @@ int ValueNumStore::EvalComparison<float>(VNFunc vnf, float v0, float v1)
 {
     // Here we handle specialized float comparisons.
 
-    // We must check for a NaN argument as they they need special handling
+    // We must check for a NaN argument as they need special handling
     bool hasNanArg = (_isnanf(v0) || _isnanf(v1));
 
     if (vnf < VNF_Boundary)

src/coreclr/nativeaot/Runtime/CachedInterfaceDispatch.cpp

@@ -118,7 +118,7 @@ static void * UpdatePointerPairAtomically(void * pPairLocation,
     if (iUpdatedOldValue == iOldValue)
     {
         // Successful update. Return the previous value of the second pointer. For cache entry updates
-        // (fFailOnNonNull == true) this is guaranteed to be NULL in this case and the result being being
+        // (fFailOnNonNull == true) this is guaranteed to be NULL in this case and the result being
         // NULL in the success case is all the caller cares about. For indirection cell updates the second
         // pointer represents the old cache and the caller needs this data so they can schedule the cache
         // for deletion once it becomes safe to do so.