]> granicus.if.org Git - llvm/commitdiff
[SCCP] Update comment in visitBinaryOp() after recent changes.
authorDavide Italiano <davide@freebsd.org>
Thu, 19 Jan 2017 21:07:42 +0000 (21:07 +0000)
committerDavide Italiano <davide@freebsd.org>
Thu, 19 Jan 2017 21:07:42 +0000 (21:07 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@292519 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Transforms/Scalar/SCCP.cpp

index 34be90692481bccd870961c9a4dec7cc9f00a9b5..9c5fa5c1426595879fd94d198abada6a441ece49 100644 (file)
@@ -910,9 +910,10 @@ void SCCPSolver::visitBinaryOperator(Instruction &I) {
 
   // Otherwise, one of our operands is overdefined.  Try to produce something
   // better than overdefined with some tricks.
-
-  // If this is an AND or OR with 0 or -1, it doesn't matter that the other
-  // operand is overdefined.
+  // If this is:
+  // -> AND/MUL with 0
+  // -> OR with -1
+  // it doesn't matter that the other operand is overdefined.
   if (I.getOpcode() == Instruction::And || I.getOpcode() == Instruction::Mul ||
       I.getOpcode() == Instruction::Or) {
     LatticeVal *NonOverdefVal = nullptr;