update obsolete comment.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@123965 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Transforms/InstCombine/InstructionCombining.cpp b/lib/Transforms/InstCombine/InstructionCombining.cpp
index 2e908e73f93483c0471fb6573a39b936e46fc33b..06fbaad3e48bbac96fe1f5b879cd79a8268fd1e6 100644 (file)
--- a/lib/Transforms/InstCombine/InstructionCombining.cpp
+++ b/lib/Transforms/InstCombine/InstructionCombining.cpp
@@ -532,10 +532,9 @@ Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
   if (NumPHIValues == 0)
     return 0;
   
-  // We normally only transform phis with a single use, unless we're trying
-  // hard to make jump threading happen.  However, if a PHI has multiple uses
-  // and they are all the same operation, we can fold *all* of the uses into the
-  // PHI.
+  // We normally only transform phis with a single use.  However, if a PHI has
+  // multiple uses and they are all the same operation, we can fold *all* of the
+  // uses into the PHI.
   if (!PN->hasOneUse()) {
     // Walk the use list for the instruction, comparing them to I.
     for (Value::use_iterator UI = PN->use_begin(), E = PN->use_end();