@@ -1263,8 +1263,7 @@ AssertionIndex Compiler::optCreateAssertion(GenTree* op1,
12631263 // └──▌ ADD int
12641264 // ├──▌ LCL_VAR int V10 tmp6 -> copy propagated to [V35 tmp31]
12651265 // └──▌ COMMA int
1266- // ├──▌ ASG int
1267- // │ ├──▌ LCL_VAR int V35 tmp31
1266+ // ├──▌ STORE_LCL_VAR int V35 tmp31
12681267 // │ └──▌ LCL_FLD int V03 loc1 [+4]
12691268 if (lclVar2->lvRedefinedInEmbeddedStatement )
12701269 {
@@ -1697,7 +1696,7 @@ void Compiler::optDebugCheckAssertion(AssertionDsc* assertion)
16971696
16981697 case O2K_ZEROOBJ:
16991698 {
1700- // We only make these assertion for assignments (not control flow).
1699+ // We only make these assertion for stores (not control flow).
17011700 assert (assertion->assertionKind == OAK_EQUAL);
17021701 // We use "optLocalAssertionIsEqualOrNotEqual" to find these.
17031702 assert (assertion->op2 .u1 .iconVal == 0 );
@@ -2080,8 +2079,8 @@ AssertionInfo Compiler::optAssertionGenJtrue(GenTree* tree)
20802079 // Look through any CSEs so we see the actual trees providing values, if possible.
20812080 // This is important for exact type assertions, which need to see the GT_IND.
20822081 //
2083- GenTree* op1 = relop->AsOp ()->gtOp1 ->gtCommaAssignVal ();
2084- GenTree* op2 = relop->AsOp ()->gtOp2 ->gtCommaAssignVal ();
2082+ GenTree* op1 = relop->AsOp ()->gtOp1 ->gtCommaStoreVal ();
2083+ GenTree* op2 = relop->AsOp ()->gtOp2 ->gtCommaStoreVal ();
20852084
20862085 // Check for op1 or op2 to be lcl var and if so, keep it in op1.
20872086 if ((op1->gtOper != GT_LCL_VAR) && (op2->gtOper == GT_LCL_VAR))
@@ -2231,9 +2230,8 @@ AssertionIndex Compiler::optAssertionGenPhiDefn(GenTree* tree)
22312230
22322231/* ****************************************************************************
22332232 *
2234- * If this statement creates a value assignment or assertion
2235- * then assign an index to the given value assignment by adding
2236- * it to the lookup table, if necessary.
2233+ * If this node creates an assertion then assign an index to the assertion
2234+ * by adding it to the lookup table, if necessary.
22372235 */
22382236void Compiler::optAssertionGen (GenTree* tree)
22392237{
@@ -2258,7 +2256,7 @@ void Compiler::optAssertionGen(GenTree* tree)
22582256 switch (tree->OperGet ())
22592257 {
22602258 case GT_STORE_LCL_VAR:
2261- // VN takes care of non local assertions for assignments and data flow.
2259+ // VN takes care of non local assertions for data flow.
22622260 if (optLocalAssertionProp)
22632261 {
22642262 assertionInfo = optCreateAssertion (tree, tree->AsLclVar ()->Data (), OAK_EQUAL);
@@ -2587,7 +2585,7 @@ GenTree* Compiler::optVNConstantPropOnTree(BasicBlock* block, GenTree* tree)
25872585 }
25882586 else
25892587 {
2590- // Implicit assignment conversion to float or double
2588+ // Implicit conversion to float or double
25912589 assert (varTypeIsFloating (tree->TypeGet ()));
25922590 conValTree = gtNewDconNode (value, tree->TypeGet ());
25932591 }
@@ -2604,7 +2602,7 @@ GenTree* Compiler::optVNConstantPropOnTree(BasicBlock* block, GenTree* tree)
26042602 }
26052603 else
26062604 {
2607- // Implicit assignment conversion to float or double
2605+ // Implicit conversion to float or double
26082606 assert (varTypeIsFloating (tree->TypeGet ()));
26092607 conValTree = gtNewDconNode (value, tree->TypeGet ());
26102608 }
@@ -2631,7 +2629,7 @@ GenTree* Compiler::optVNConstantPropOnTree(BasicBlock* block, GenTree* tree)
26312629 switch (tree->TypeGet ())
26322630 {
26332631 case TYP_INT:
2634- // Implicit assignment conversion to smaller integer
2632+ // Implicit conversion to smaller integer
26352633 conValTree = gtNewIconNode (static_cast <int >(value));
26362634 break ;
26372635
@@ -2693,7 +2691,7 @@ GenTree* Compiler::optVNConstantPropOnTree(BasicBlock* block, GenTree* tree)
26932691 break ;
26942692
26952693 case TYP_LONG:
2696- // Implicit assignment conversion to larger integer
2694+ // Implicit conversion to larger integer
26972695 conValTree = gtNewLconNode (value);
26982696 break ;
26992697
@@ -3486,7 +3484,7 @@ GenTree* Compiler::optAssertionProp_LocalStore(ASSERT_VALARG_TP assertions, GenT
34863484 }
34873485 }
34883486
3489- // We might have simplified the value but were not able to remove the assignment
3487+ // We might have simplified the value but were not able to remove the store.
34903488 //
34913489 if (madeChanges)
34923490 {
@@ -3959,7 +3957,7 @@ GenTree* Compiler::optAssertionPropGlobal_RelOp(ASSERT_VALARG_TP assertions, Gen
39593957 // Note we can't trust the OAK_EQUAL as the value could end up being a NaN
39603958 // violating the assertion. However, we create OAK_EQUAL assertions for floating
39613959 // point only on JTrue nodes, so if the condition held earlier, it will hold
3962- // now. We don't create OAK_EQUAL assertion on floating point from GT_ASG
3960+ // now. We don't create OAK_EQUAL assertion on floating point from stores
39633961 // because we depend on value num which would constant prop the NaN.
39643962 op1->BashToConst (0.0 , op1->TypeGet ());
39653963 op2->BashToConst (0.0 , op2->TypeGet ());
@@ -4872,7 +4870,7 @@ void Compiler::optImpliedAssertions(AssertionIndex assertionIndex, ASSERT_TP& ac
48724870 }
48734871 }
48744872 }
4875- // Is curAssertion a constant assignment of a 32-bit integer?
4873+ // Is curAssertion a constant store of a 32-bit integer?
48764874 // (i.e GT_LVL_VAR X == GT_CNS_INT)
48774875 else if ((curAssertion->assertionKind == OAK_EQUAL) && (curAssertion->op1 .kind == O1K_LCLVAR) &&
48784876 (curAssertion->op2 .kind == O2K_CONST_INT))
@@ -5119,7 +5117,7 @@ void Compiler::optImpliedByCopyAssertion(AssertionDsc* copyAssertion, AssertionD
51195117 return ;
51205118 }
51215119
5122- // Is depAssertion a constant assignment of a 32-bit integer?
5120+ // Is depAssertion a constant store of a 32-bit integer?
51235121 // (i.e GT_LVL_VAR X == GT_CNS_INT)
51245122 bool depIsConstAssertion = ((depAssertion->assertionKind == OAK_EQUAL) && (depAssertion->op1 .kind == O1K_LCLVAR) &&
51255123 (depAssertion->op2 .kind == O2K_CONST_INT));
@@ -5930,7 +5928,7 @@ PhaseStatus Compiler::optAssertionPropMain()
59305928 // Assertion prop can speculatively create trees.
59315929 INDEBUG (const unsigned baseTreeID = compGenTreeID);
59325930
5933- // First discover all value assignments and record them in the table.
5931+ // First discover all assertions and record them in the table.
59345932 for (BasicBlock* const block : Blocks ())
59355933 {
59365934 compCurBB = block;
0 commit comments