Typo (dotnet#18122)

* acquringing -> acquiring

* Activ -> Active

* activley -> actively

* acutal -> actual

* bIncomingIPAdddefed -> bIncomingIPAddRefed

* adddr -> addr

* readding -> reading

* Addfunction -> AddFunction

* additionnal -> additional

* Additonal -> Additional

* Additonally -> Additionally

* Addresss -> Address

* addtion -> addition

* aded -> added

* aditional -> additional

* adjustements -> adjustments

* Adress -> Address

* afer -> after

* aformentioned -> aforementioned

* afte -> after

* agains -> against

* agaisnt -> against

* aggresively -> aggressively

* aggreates -> aggregates

* aggregious -> egregious

* aginst -> against

* agregates -> aggregates

* Agressive -> Aggressive

* ahve -> have

* ajdust -> adjust

* ajust -> adjust

* alement -> element

* algoritm -> algorithm

* alighnment -> alignment

* alignmant -> alignment

* constraits -> constraints

* Allcator -> Allocator

* alllocate -> allocate

* alloacted -> allocated

* allocatate -> allocate

* allocatoror -> allocator

* alloctaed -> allocated

* alloction -> allocation

* alloted -> allotted

* allt he -> all the

* alltogether -> altogether

* alocate -> allocate

* alocated -> allocated

* Alocates -> Allocates

* alogrithm -> algorithm

* aloocate -> allocate

* alot -> a lot

* alwasy -> always

* alwyas -> always

* alwys -> always

src/debug/daccess/dacdbiimplstackwalk.cpp

@@ -54,7 +54,7 @@ struct StackWalkData
 };
 
 // Helper to allocate stackwalk datastructures for given parameters.
-// This is allocated on the local heap (and not via the forDbi allocatoror on the dac-cache), and then 
+// This is allocated on the local heap (and not via the forDbi allocator on the dac-cache), and then 
 // freed via code:DacDbiInterfaceImpl::DeleteStackWalk
 // 
 // Throws on error (mainly OOM).

src/debug/daccess/dacfn.cpp

@@ -360,7 +360,7 @@ DacInstantiateTypeByAddressHelper(TADDR addr, ULONG32 size, bool throwEx, bool f
 {
 #ifdef _PREFIX_
 
-    // Dac accesses are not interesting for PREfix and cause alot of PREfix noise
+    // Dac accesses are not interesting for PREfix and cause a lot of PREfix noise
     // so we just return the unmodified pointer for our PREFIX builds
     return (PVOID)addr;
 

src/debug/di/process.cpp

@@ -12800,7 +12800,7 @@ void CordbProcess::HandleDebugEventForInteropDebugging(const DEBUG_EVENT * pEven
         // of the queue or if the process is currently synchronized. Of course, we only do this if the
         // process is initialized.
         //
-        // Note: we also hijack these left over in-band events if we're activley trying to send the
+        // Note: we also hijack these left over in-band events if we're actively trying to send the
         // managed continue message to the Left Side. This is controlled by m_specialDeferment below.
 
         // Only exceptions can be IB events - everything else is OOB.

src/debug/di/rsthread.cpp

@@ -1209,7 +1209,7 @@ HRESULT CordbThread::CreateEval(ICorDebugEval ** ppEval)
 // we can compare DAC & the RS and make sure DACs working.
 void CheckAgainstDAC(CordbFunction * pFunc, void * pIP, mdMethodDef mdExpected)
 {
-    // This is a hook to add DAC checks agaisnt a {function, ip}
+    // This is a hook to add DAC checks against a {function, ip}
 }
 
 
@@ -4184,7 +4184,7 @@ void CordbUnmanagedThread::SetupForSkipBreakpoint(NativePatch * pNativePatch)
     }
 #endif
 #if defined(DBG_TARGET_X86)
-    STRESS_LOG2(LF_CORDB, LL_INFO100, "CUT::SetupSkip. adddr=%p. Opcode=%x\n", pNativePatch->pAddress, (DWORD) pNativePatch->opcode);
+    STRESS_LOG2(LF_CORDB, LL_INFO100, "CUT::SetupSkip. addr=%p. Opcode=%x\n", pNativePatch->pAddress, (DWORD) pNativePatch->opcode);
 #endif
 
     // Replace the BP w/ the opcode.
@@ -4224,11 +4224,11 @@ void CordbUnmanagedThread::FixupForSkipBreakpoint()
     if (GetProcess()->GetNativePatch(m_pPatchSkipAddress) != NULL)
     {
         ApplyRemotePatch(GetProcess(), m_pPatchSkipAddress);
-        STRESS_LOG1(LF_CORDB, LL_INFO100, "CUT::FixupSetupSkip. adddr=%p\n", m_pPatchSkipAddress);
+        STRESS_LOG1(LF_CORDB, LL_INFO100, "CUT::FixupSetupSkip. addr=%p\n", m_pPatchSkipAddress);
     }
     else
     {
-        STRESS_LOG1(LF_CORDB, LL_INFO100, "CUT::FixupSetupSkip. Patch removed. Not-readding. adddr=%p\n", m_pPatchSkipAddress);
+        STRESS_LOG1(LF_CORDB, LL_INFO100, "CUT::FixupSetupSkip. Patch removed. Not-reading. addr=%p\n", m_pPatchSkipAddress);
     }
 
     m_pPatchSkipAddress = NULL;

src/debug/ee/controller.cpp

@@ -5820,12 +5820,12 @@ bool DebuggerStepper::TrapStep(ControllerStackInfo *info, bool in)
     // What if the thread is stopped at a managed debug event outside of a filter ctx? Eg, stopped
     // somewhere directly in mscorwks (like sending a LogMsg or ClsLoad event) or even at WaitForSingleObject.
     // ActiveFrame is either the stepper's initial frame or the frame of a filterctx.
-    bool fIsActivFrameLive = (info->m_activeFrame.fp == info->m_bottomFP);
+    bool fIsActiveFrameLive = (info->m_activeFrame.fp == info->m_bottomFP);
 
     // If this thread isn't stopped in managed code, it can't be at the active frame.
     if (GetManagedStoppedCtx(this->GetThread()) == NULL)
     {
-        fIsActivFrameLive = false;
+        fIsActiveFrameLive = false;
     }
 
     bool fIsJump             = false;
@@ -5834,7 +5834,7 @@ bool DebuggerStepper::TrapStep(ControllerStackInfo *info, bool in)
     // If m_activeFrame is not the actual active frame,
     // we should skip this first switch - never single step, and
     // assume our context is bogus.
-    if (fIsActivFrameLive)
+    if (fIsActiveFrameLive)
     {
         LOG((LF_CORDB,LL_INFO10000, "DC::TS: immediate?\n"));
 
@@ -5974,7 +5974,7 @@ bool DebuggerStepper::TrapStep(ControllerStackInfo *info, bool in)
                 walker.Next();
             }
         }
-    } // if (fIsActivFrameLive)
+    } // if (fIsActiveFrameLive)
 
     //
     // Use our range, if we're in the original

src/debug/ee/debugger.cpp

@@ -12965,7 +12965,7 @@ BOOL EnCSequencePointHelper::ShouldSetRemapBreakpoint(unsigned int offsetIndex)
 
 //-----------------------------------------------------------------------------
 // For each function that's EnC-ed, the EE will call either UpdateFunction
-// (if the function already is loaded + jitted) or Addfunction
+// (if the function already is loaded + jitted) or AddFunction
 // 
 // This is called before the EE updates the MethodDesc, so pMD does not yet
 // point to the version we'll be remapping to.
@@ -15103,7 +15103,7 @@ HRESULT Debugger::TerminateAppDomainIPC(void)
     m_pAppDomainCB->m_iNumOfUsedSlots = 0;
     m_pAppDomainCB->m_iTotalSlots = 0;
 
-    // Now delete the memory alloacted for AppDomainInfo  array
+    // Now delete the memory allocated for AppDomainInfo  array
     delete [] m_pAppDomainCB->m_rgListOfAppDomains;
     m_pAppDomainCB->m_rgListOfAppDomains = NULL;
 

src/gc/handletable.cpp

@@ -80,7 +80,7 @@ __inline PTR_HandleTable Table(HHANDLETABLE hTable)
 /*
  * HndCreateHandleTable
  *
- * Alocates and initializes a handle table.
+ * Allocates and initializes a handle table.
  *
  */
 HHANDLETABLE HndCreateHandleTable(const uint32_t *pTypeFlags, uint32_t uTypeCount, ADIndex uADIndex)

src/jit/codegencommon.cpp

@@ -9035,7 +9035,7 @@ void CodeGen::genFnEpilog(BasicBlock* block)
                 //
                 // Case 2: localloc used
                 // genSPToFPDelta = Min(240, (int)compiler->lvaOutgoingArgSpaceSize)
-                // Offset = Amount to be aded to RBP to point at callee saved int regs.
+                // Offset = Amount to be added to RBP to point at callee saved int regs.
                 offset = genSPtoFPdelta() - compiler->compLclFrameSize;
 
                 // Offset should fit within a byte if localloc is not used.

src/jit/compiler.cpp

@@ -472,7 +472,7 @@ var_types Compiler::getJitGCType(BYTE gcType)
 // Return Value:
 //     Two [or more] values are written into the gcPtrs array
 //
-// Note that for ARM64 there will alwys be exactly two pointer sized fields
+// Note that for ARM64 there will always be exactly two pointer sized fields
 
 void Compiler::getStructGcPtrsFromOp(GenTree* op, BYTE* gcPtrsOut)
 {
@@ -5811,7 +5811,7 @@ int Compiler::compCompileHelper(CORINFO_MODULE_HANDLE            classPtr,
 
 #endif
 
-    // Check for COMPlus_AgressiveInlining
+    // Check for COMPlus_AggressiveInlining
     if (JitConfig.JitAggressiveInlining())
     {
         compDoAggressiveInlining = true;

src/jit/earlyprop.cpp

@@ -362,7 +362,7 @@ GenTree* Compiler::optEarlyPropRewriteTree(GenTree* tree)
         }
 
         DecLclVarRefCountsVisitor::WalkTree(this, tree);
-        // acutalValClone has small tree node size, it is safe to use CopyFrom here.
+        // actualValClone has small tree node size, it is safe to use CopyFrom here.
         tree->ReplaceWith(actualValClone, this);
         IncLclVarRefCountsVisitor::WalkTree(this, tree);
 

src/jit/emitxarch.cpp

@@ -5971,7 +5971,7 @@ void emitter::emitIns_Call(EmitCallType          callType,
 #if STACK_PROBES
     if (emitComp->opts.compNeedStackProbes)
     {
-        // If we've pushed more than JIT_RESERVED_STACK allows, do an aditional stack probe
+        // If we've pushed more than JIT_RESERVED_STACK allows, do an additional stack probe
         // Else, just make sure the prolog does a probe for us. Invariant we're trying
         // to get is that at any point we go out to unmanaged code, there is at least
         // CORINFO_STACKPROBE_DEPTH bytes of stack available.
@@ -5991,7 +5991,7 @@ void emitter::emitIns_Call(EmitCallType          callType,
              // localloc and on the prolog (invariant is that
              // genStackLevel is 0 on basic block entry and exit and
              // after any alloca). genStackLevel will include any arguments
-             // to the call, so we will insert an aditional probe if
+             // to the call, so we will insert an additional probe if
              // we've consumed more than JIT_RESERVED_STACK bytes
              // of stack, which is what the prolog probe covers (in
              // addition to the EE requested size)

src/jit/inlinepolicy.cpp

@@ -701,7 +701,7 @@ double DefaultPolicy::DetermineMultiplier()
     if (additionalMultiplier != 0)
     {
         multiplier += additionalMultiplier;
-        JITDUMP("\nmultiplier increased via JitInlineAdditonalMultiplier=%d to %g.", additionalMultiplier, multiplier);
+        JITDUMP("\nmultiplier increased via JitInlineAdditionalMultiplier=%d to %g.", additionalMultiplier, multiplier);
     }
 
     if (m_RootCompiler->compInlineStress())

src/jit/lsra.cpp

@@ -7704,7 +7704,7 @@ void LinearScan::resolveEdges()
     // We will try to avoid resolution across critical edges in cases where all the critical-edge
     // targets of a block have the same home.  We will then split the edges only for the
     // remaining mismatches.  We visit the out-edges, as that allows us to share the moves that are
-    // common among allt he targets.
+    // common among all the targets.
 
     if (hasCriticalEdges)
     {
@@ -10140,7 +10140,7 @@ void LinearScan::verifyFinalAllocation()
     }
 
     // Now, verify the resolution blocks.
-    // Currently these are nearly always at the end of the method, but that may not alwyas be the case.
+    // Currently these are nearly always at the end of the method, but that may not always be the case.
     // So, we'll go through all the BBs looking for blocks whose bbNum is greater than bbNumMaxBeforeResolution.
     for (BasicBlock* currentBlock = compiler->fgFirstBB; currentBlock != nullptr; currentBlock = currentBlock->bbNext)
     {

src/jit/regalloc.cpp

@@ -59,7 +59,7 @@ DWORD Compiler::getCanDoubleAlign()
 //    - We pay one extra memory reference for each variable that could have been enregistered in EBP (refCntWtdEBP).
 //
 //    If the misalignment penalty is estimated to be less than the bytes used, we don't double align.
-//    Otherwise, we compare the weighted ref count of ebp-enregistered variables aginst double the
+//    Otherwise, we compare the weighted ref count of ebp-enregistered variables against double the
 //    ref count for double-aligned values.
 //
 bool Compiler::shouldDoubleAlign(

src/jit/scopeinfo.cpp

@@ -1194,7 +1194,7 @@ void CodeGen::psiMoveToReg(unsigned varNum, regNumber reg, regNumber otherReg)
  *                      CodeGen::psiMoveToStack
  *
  * A incoming register-argument is being moved to its final home on the stack
- * (ie. all adjustements to {F/S}PBASE have been made
+ * (ie. all adjustments to {F/S}PBASE have been made
  */
 
 void CodeGen::psiMoveToStack(unsigned varNum)

src/jit/simdcodegenxarch.cpp

@@ -2232,7 +2232,7 @@ void CodeGen::genSIMDIntrinsicDotProduct(GenTreeSIMD* simdNode)
             // tmp = v0
             // tmp = shuffle(tmp, tmp, SHUFFLE_XYZW)          // tmp = (0+1, 1+0, 2+3, 3+2)
             // v0 = v0 + tmp                                  // v0  = (0+1+2+3, 0+1+2+3, 0+1+2+3, 0+1+2+3)
-            //                                                // Essentially horizontal addtion of all elements.
+            //                                                // Essentially horizontal addition of all elements.
             //                                                // We could achieve the same using SSEv3 instruction
             //                                                // HADDPS.
             //

src/jit/valuenum.cpp

@@ -6618,7 +6618,7 @@ void Compiler::fgValueNumberTree(GenTree* tree, bool evalAsgLhsInd)
         else if ((oper == GT_IND) || GenTree::OperIsBlk(oper))
         {
             // So far, we handle cases in which the address is a ptr-to-local, or if it's
-            // a pointer to an object field or array alement.  Other cases become uses of
+            // a pointer to an object field or array element.  Other cases become uses of
             // the current ByrefExposed value and the pointer value, so that at least we
             // can recognize redundant loads with no stores between them.
             GenTree*             addr         = tree->AsIndir()->Addr();

src/md/ceefilegen/blobfetcher.cpp

@@ -88,7 +88,7 @@ char * CBlobFetcher::CPillar::MakeNewBlock(unsigned len, unsigned pad) {
 
     _ASSERTE(pad < maxAlign);
 
-    // Make sure we have memory in this block to allocatate
+    // Make sure we have memory in this block to allocate
     if (m_dataStart == NULL) {
 
         // make sure allocate at least as big as length

src/pal/src/file/find.cpp

@@ -857,7 +857,7 @@ finding no matches but without any error occurring) or FALSE if any error
 occurs.  It calls SetLastError() if it returns FALSE.
 
 Sorting doesn't seem to be consistent on all Windows platform, and it's
-not required for Rotor to have the same sorting alogrithm than Windows 2000.
+not required for Rotor to have the same sorting algorithm than Windows 2000.
 This implementation will give slightly different result for the sort list 
 than Windows 2000.
 

src/pal/src/loader/module.cpp

@@ -1378,7 +1378,7 @@ static LPWSTR LOADGetModuleFileName(MODSTRUCT *module)
 
     /* return "real" name of module if it is known. we have this if LoadLibrary
        was given an absolute or relative path; we can also determine it at the
-       first GetProcAdress call. */
+       first GetProcAddress call. */
     TRACE("Returning full path name of module\n");
     return module->lib_name;
 }

src/pal/src/map/map.cpp

@@ -2351,7 +2351,7 @@ void * MAPMapPEFile(HANDLE hFile)
     InternalEnterCriticalSection(pThread, &mapping_critsec);
 
 #ifdef BIT64
-    // First try to reserve virtual memory using ExecutableAllcator. This allows all PE images to be
+    // First try to reserve virtual memory using ExecutableAllocator. This allows all PE images to be
     // near each other and close to the coreclr library which also allows the runtime to generate
     // more efficient code (by avoiding usage of jump stubs). Alignment to a 64 KB granularity should
     // not be necessary (alignment to page size should be sufficient), but see

src/pal/src/objmgr/shmobjectmanager.cpp

@@ -1158,7 +1158,7 @@ CSharedMemoryObjectManager::ImportSharedObjectIntoProcess(
     }
     else
     {
-        ERROR("Unable to alllocate new object\n");
+        ERROR("Unable to allocate new object\n");
         palError = ERROR_OUTOFMEMORY;
         goto ImportSharedObjectIntoProcessExit;
     }

src/pal/tests/palsuite/file_io/ReadFile/test2/ReadFile.cpp

@@ -145,7 +145,7 @@ int __cdecl main(int argc, char *argv[])
         return FAIL;
     }
 
-    /* aloocate read-write memery for readBuffer */
+    /* allocate read-write memery for readBuffer */
     if (!(readBuffer = (char*) VirtualAlloc(NULL, BUFFER_SIZE, MEM_COMMIT, PAGE_READWRITE)))
 	{
 		Fail("VirtualAlloc failed: GetLastError returns %d\n", GetLastError());

src/utilcode/clrhost_nodependencies.cpp

@@ -200,7 +200,7 @@ ClrDebugState *CLRInitDebugState()
         pNewClrDebugState = (ClrDebugState*)::HeapAlloc(GetProcessHeap(), 0, sizeof(ClrDebugState));
         if (pNewClrDebugState != NULL)
         {
-            // Only allocate a DbgStateLockData if its owning ClrDebugState was successfully alloctaed
+            // Only allocate a DbgStateLockData if its owning ClrDebugState was successfully allocated
             pNewLockData  = (DbgStateLockData *)::HeapAlloc(GetProcessHeap(), 0, sizeof(DbgStateLockData));
         }
 #define GetProcessHeap() Dont_Use_GetProcessHeap()

src/utilcode/debug.cpp

@@ -307,7 +307,7 @@ BOOL LaunchJITDebugger()
 // This function is called in order to ultimately return an out of memory
 // failed hresult.  But this guy will check what environment you are running
 // in and give an assert for running in a debug build environment.  Usually
-// out of memory on a dev machine is a bogus alloction, and this allows you
+// out of memory on a dev machine is a bogus allocation, and this allows you
 // to catch such errors.  But when run in a stress envrionment where you are
 // trying to get out of memory, assert behavior stops the tests.
 //*****************************************************************************

src/utilcode/sbuffer.cpp

@@ -88,7 +88,7 @@ void SBuffer::Replace(const Iterator &i, COUNT_T deleteSize, COUNT_T insertSize)
     COUNT_T startRange = (COUNT_T) (i.m_ptr - m_buffer);
     // The PRECONDITION(CheckIterationRange(i, deleteSize)) should check this in
     // contract-checking builds, but this ensures we don't integer overflow if someone
-    // passes in an aggregious deleteSize by capping it to the remaining length in the
+    // passes in an egregious deleteSize by capping it to the remaining length in the
     // buffer.
     if ((COUNT_T)(m_buffer + m_size - i.m_ptr) < deleteSize)
     {

src/utilcode/securitywrapper.cpp

@@ -694,7 +694,7 @@ Sid Win32SecurityDescriptor::GetOwner()
 
 //-----------------------------------------------------------------------------
 // Initialize this instance of a SecurityDescriptor with the SD for the handle.
-// The handle must ahve READ_CONTROL permissions to do this.
+// The handle must have READ_CONTROL permissions to do this.
 // Throws on error.
 //-----------------------------------------------------------------------------
 HRESULT Win32SecurityDescriptor::InitFromHandleNoThrow(HANDLE h)

src/vm/codeman.cpp

@@ -5092,7 +5092,7 @@ PCODE ExecutionManager::getNextJumpStub(MethodDesc* pMD, PCODE target,
     }
 
     // allocJumpStubBlock will allocate from the LoaderCodeHeap for normal methods
-    // and will alocate from a HostCodeHeap for LCG methods.
+    // and will allocate from a HostCodeHeap for LCG methods.
     //
     // note that this can throw an OOM exception
 

src/vm/comcache.cpp

@@ -803,7 +803,7 @@ void IUnkEntry::ReleaseStream()
     }
 }
 
-// Indicates if the COM component being wrapped by the IUnkEntry aggreates the FTM
+// Indicates if the COM component being wrapped by the IUnkEntry aggregates the FTM
 bool IUnkEntry::IsFreeThreaded()
 {
     LIMITED_METHOD_CONTRACT;
@@ -1063,7 +1063,7 @@ bool IUnkEntry::IsComponentFreeThreaded(IUnknown *pUnk)
     {
         SafeComHolderPreemp<IMarshal> pMarshal = NULL;
 
-        // If not, then we can try to determine if the component agregates the FTM via IMarshal.
+        // If not, then we can try to determine if the component aggregates the FTM via IMarshal.
         hr = SafeQueryInterfacePreemp(pUnk, IID_IMarshal, (IUnknown **)&pMarshal);
         LogInteropQI(pUnk, IID_IMarshal, hr, "IUnkEntry::IsComponentFreeThreaded: QI for IMarshal");
         if (SUCCEEDED(hr))
@@ -1226,7 +1226,7 @@ DWORD WINAPI MDAContextSwitchDeadlockThreadProc(LPVOID lpParameter)
 
     if (retval == WAIT_TIMEOUT)
     {
-        // We didn't transition into the context within the alloted timeout period.
+        // We didn't transition into the context within the allotted timeout period.
         // We'll fire the mda and close the event, but we can't delete is as the
         //  thread may still complete the transition and attempt to signal the event.
         //  So we'll just leak it and let the transition thread recognize that the

src/vm/cominterfacemarshaler.cpp

@@ -1125,7 +1125,7 @@ OBJECTREF COMInterfaceMarshaler::WrapWithComObject()
             &oref,      // pComObj
             NULL,       // ppIncomingIP
             NULL,       // pIncomingItfMT
-            false       // bIncomingIPAdddefed
+            false       // bIncomingIPAddRefed
             );
     }
     GCPROTECT_END();

src/vm/debugdebugger.cpp

@@ -660,7 +660,7 @@ FCIMPL4(void, DebugStackTrace::GetStackFramesInternal,
                                             // look for the entry matching the one we're looking for
                                             if (offsets[j] >= dwCurILOffset)
                                             {
-                                                // if this offset is > what we're looking for, ajdust the index
+                                                // if this offset is > what we're looking for, adjust the index
                                                 if (offsets[j] > dwCurILOffset && j > 0)
                                                 {
                                                     j--;