14 // simplified: This is usually true and assuming it simplifies the logic (if
151 /// and see if it simplifies.
261   // Otherwise, return "L op' R" if it simplifies.  in expandBinOp()
303   // Transform: "(A op B) op C" ==> "A op (B op C)" if it simplifies completely.  in simplifyAssociativeBinOp()
311       // It does!  Return "A op V" if it simplifies or is already available.  in simplifyAssociativeBinOp()
315       // Otherwise return "A op V" if it simplifies.  in simplifyAssociativeBinOp()
323   // Transform: "A op (B op C)" ==> "(A op B) op C" if it simplifies completely.  in simplifyAssociativeBinOp()
331       // It does!  Return "V op C" if it simplifies or is already available.  in simplifyAssociativeBinOp()
335       // Otherwise return "V op C" if it simplifies.  in simplifyAssociativeBinOp()
347   // Transform: "(A op B) op C" ==> "(C op A) op B" if it simplifies completely.  in simplifyAssociativeBinOp()
355       // It does!  Return "V op B" if it simplifies or is already available.  in simplifyAssociativeBinOp()
359       // Otherwise return "V op B" if it simplifies.  in simplifyAssociativeBinOp()
367   // Transform: "A op (B op C)" ==> "B op (C op A)" if it simplifies completely.  in simplifyAssociativeBinOp()
375       // It does!  Return "B op V" if it simplifies or is already available.  in simplifyAssociativeBinOp()
379       // Otherwise return "B op V" if it simplifies.  in simplifyAssociativeBinOp()
828   // (X + Y) - Z -> X + (Y - Z) or Y + (X - Z) if everything simplifies.  in simplifySubInst()
832     // See if "V === Y - Z" simplifies.  in simplifySubInst()
834       // It does!  Now see if "X + V" simplifies.  in simplifySubInst()
840     // See if "V === X - Z" simplifies.  in simplifySubInst()
842       // It does!  Now see if "Y + V" simplifies.  in simplifySubInst()
850   // X - (Y + Z) -> (X - Y) - Z or (X - Z) - Y if everything simplifies.  in simplifySubInst()
854     // See if "V === X - Y" simplifies.  in simplifySubInst()
856       // It does!  Now see if "V - Z" simplifies.  in simplifySubInst()
862     // See if "V === X - Z" simplifies.  in simplifySubInst()
864       // It does!  Now see if "V - Y" simplifies.  in simplifySubInst()
872   // Z - (X - Y) -> (Z - X) + Y if everything simplifies.  in simplifySubInst()
876     // See if "V === Z - X" simplifies.  in simplifySubInst()
878       // It does!  Now see if "V + Y" simplifies.  in simplifySubInst()
885   // trunc(X) - trunc(Y) -> trunc(X - Y) if everything simplifies.  in simplifySubInst()
889       // See if "V === X - Y" simplifies.  in simplifySubInst()
891         // It does!  Now see if "trunc V" simplifies.  in simplifySubInst()
1960     // If x simplifies to true/false, we can simplify the and/or.  in simplifyAndOrWithICmpEq()
3549       // Otherwise, see if "A EqP B" simplifies.  in simplifyICmpWithMinMax()
3563       // Otherwise, see if "A InvEqP B" simplifies.  in simplifyICmpWithMinMax()
3623       // Otherwise, see if "A EqP B" simplifies.  in simplifyICmpWithMinMax()
3637       // Otherwise, see if "A InvEqP B" simplifies.  in simplifyICmpWithMinMax()
4428     // simplifies back to %arg. This can only happen because %mul does not  in simplifyWithOpReplaced()
7220 /// This routine returns 'true' only when *it* simplifies something. The passed
7250     // See if this instruction simplifies.  in replaceAndRecursivelySimplifyImpl()