Fix some typos in comments

Commit migrated from https://github.com/dotnet/coreclr/commit/a8896b3b90d14830b9205ea2ed0824cd0591213a

diff --git a/src/coreclr/src/jit/block.cpp b/src/coreclr/src/jit/block.cpp
index 29c81aa91e7018fe8a2e2d8313bafeb2569dd1ed..50d352c5949cd39f6c0f5f876719749bc453679b 100644 (file)
--- a/src/coreclr/src/jit/block.cpp
+++ b/src/coreclr/src/jit/block.cpp
@@ -548,7 +548,7 @@ GenTreeStmt* BasicBlock::lastStmt()
 //
 // Notes:
 //    The last statement may be an embedded statement, when in linear order,
-//    so this method is provided to obtain the last top-level statment, which
+//    so this method is provided to obtain the last top-level statement, which
 //    will also contain the last tree nodes in execution order.
 
 GenTreeStmt* BasicBlock::lastTopLevelStmt()

diff --git a/src/coreclr/src/jit/flowgraph.cpp b/src/coreclr/src/jit/flowgraph.cpp
index cccffe8ad0d972cd603bb1b5c430337ce7315392..928b2b341cdf778d81d45567840f6976b711a0a0 100644 (file)
--- a/src/coreclr/src/jit/flowgraph.cpp
+++ b/src/coreclr/src/jit/flowgraph.cpp
@@ -702,7 +702,7 @@ GenTreeStmt*  Compiler::fgInsertStmtNearEnd(BasicBlock* block, GenTreePtr node)
  *
  *  Insert the given statement "stmt" after GT_STMT node "insertionPoint".
  *  Returns the newly inserted GT_STMT node.
- *  Note that the gtPrev list of statment nodes is circular, but the gtNext list is not.
+ *  Note that the gtPrev list of statement nodes is circular, but the gtNext list is not.
  */
 
 GenTreePtr          Compiler::fgInsertStmtAfter(BasicBlock* block,
@@ -18240,7 +18240,7 @@ void            Compiler::fgOrderBlockOps(GenTreePtr   tree,
 //      The nearest one might be 'stmt' itself.
 //
 // Arguments:
-//    stmt - The statment to start the search with.
+//    stmt - The statement to start the search with.
 //
 // Return Value:
 //    The nearest top-level statement, walking backwards.
@@ -18426,7 +18426,7 @@ void Compiler::fgDeleteTreeFromList(GenTreeStmt* stmt, GenTreePtr tree)
 
 
 //------------------------------------------------------------------------
-// fgTreeIsInStmt: return 'true' if 'tree' is in the execution order list of statment 'stmt'.
+// fgTreeIsInStmt: return 'true' if 'tree' is in the execution order list of statement 'stmt'.
 // This works for a single node or an entire tree, assuming a well-formed tree, where the entire
 // tree's set of nodes are in the statement execution order list.
 //
@@ -18540,7 +18540,7 @@ GenTreeStmt* Compiler::fgInsertTreeBeforeAsEmbedded(GenTree* tree, GenTree* inse
     fgInsertTreeInListBefore(tree, insertionPoint, stmt);
 
     // While inserting a statement as embedded, the parent specified has to be a top-level statement
-    // since we could be inserting it ahead of an already existing embedded statment
+    // since we could be inserting it ahead of an already existing embedded statement
     // in execution order.
     GenTreeStmt* topStmt = fgFindTopLevelStmtBackwards(stmt);
     GenTreeStmt* result = fgMakeEmbeddedStmt(block, tree, topStmt);
@@ -22237,7 +22237,7 @@ _Done:
 
     //
     // Detach the GT_CALL node from the original statement by hanging a "nothing" node under it,
-    // so that fgMorphStmts can remove the statment once we return from here.
+    // so that fgMorphStmts can remove the statement once we return from here.
     //
     iciStmt->gtStmt.gtStmtExpr = gtNewNothingNode();
 }

diff --git a/src/coreclr/src/jit/lower.cpp b/src/coreclr/src/jit/lower.cpp
index 10ecbadb4fc11ef87d14711a3ee9605ad6a278bd..140b5cbf976a27463fe3f1865e2bf45ff332ff80 100755 (executable)
--- a/src/coreclr/src/jit/lower.cpp
+++ b/src/coreclr/src/jit/lower.cpp
@@ -347,7 +347,7 @@ void Lowering::DecomposeNode(GenTreePtr* pTree, Compiler::fgWalkData* data)
             // this should be moved to a common function
             if (isEmbeddedStmt)
             {
-                // Find a parent statment containing storeIndHigh.
+                // Find a parent statement containing storeIndHigh.
                 GenTree* parentStmt = currStmt;
                 while ((parentStmt != nullptr) && (!parentStmt->AsStmt()->gtStmtIsTopLevel()))
                 {
@@ -850,7 +850,7 @@ void Lowering::DecomposeStoreInd(GenTree* tree)
 
     if (isEmbeddedStmt)
     {
-        // Find a parent statment containing storeIndHigh. 
+        // Find a parent statement containing storeIndHigh. 
         GenTree* parentStmt = currStmt;
         while ((parentStmt != nullptr) && (!parentStmt->AsStmt()->gtStmtIsTopLevel()))
         {
@@ -4801,7 +4801,7 @@ bool Lowering::NodesAreEquivalentLeaves(GenTreePtr tree1, GenTreePtr tree2)
 }
 
 /**
- * Takes care of replaing a GenTree node's child with a new tree.
+ * Takes care of replacing a GenTree node's child with a new tree.
  *
  *  Assumptions:
  *  a) replacementNode has been unlinked (orphaned) and the expression it represents

diff --git a/src/coreclr/src/jit/rationalize.cpp b/src/coreclr/src/jit/rationalize.cpp
index 4a669d4237bd9e93123e6445e6090cb0e39e1e8a..a321c55f2318208aa6c8502830a33aaeb3f32e60 100644 (file)
--- a/src/coreclr/src/jit/rationalize.cpp
+++ b/src/coreclr/src/jit/rationalize.cpp
@@ -418,7 +418,7 @@ Compiler::fgMakeEmbeddedStmt(BasicBlock* block, GenTree* tree, GenTree* parentSt
         // For this case, we are actually going to insert it BEFORE parentStmt.
         // However if we have a new prevStmt (i.e. there are some embedded statements
         // to be included in newStmt) then those need to be moved as well.
-        // Note, however, that all the tree links have alraedy been fixed up.
+        // Note, however, that all the tree links have already been fixed up.
         fgInsertStmtBefore(block, parentStmt, newStmt);
         if (foundEmbeddedStmts)
         {
@@ -500,7 +500,7 @@ Compiler::fgInsertLinearNodeBefore(GenTreePtr newNode, GenTreePtr before)
 //    The new statement.
 //
 // Assumptions:
-//    The callee must ensure that '*ppTree' is part of compCurStmt, and that
+//    The caller must ensure that '*ppTree' is part of compCurStmt, and that
 //    compCurStmt is in compCurBB;
 
 GenTreeStmt*
@@ -817,7 +817,7 @@ top:
     loc = RewriteSimpleTransforms(loc);
     DBEXEC(TRUE, ValidateStatement(loc));
 
-    JITDUMP("comma processing top level statment:\n");
+    JITDUMP("comma processing top level statement:\n");
     DISPTREE(loc.tree);
     JITDUMP("\n");