[turbofan] In store-store elimination, revisit as often as necessary.

src/compiler/store-store-elimination.cc

 // Copyright 2016 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <iterator>
 
 #include "src/compiler/store-store-elimination.h"
 
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/js-graph.h"
@@ skipping 387 matching lines @@
   if (!cur_set_changed) {
     // We will not be able to update the part of this chain above any more.
     // Exit.
     TRACE("+ No change: stabilized. Not visiting effect inputs.");
   } else {
     unobservable_for_id(node->id()) = before_set;
 
     // Mark effect inputs for visiting.
     for (int i = 0; i < node->op()->EffectInputCount(); i++) {
       Node* input = NodeProperties::GetEffectInput(node, i);
-      if (!HasBeenVisited(input)) {
-        TRACE("    marking #%d:%s for revisit", input->id(),
-              input->op()->mnemonic());
-        MarkForRevisit(input);
-      }
+      TRACE("    marking #%d:%s for revisit", input->id(),
+            input->op()->mnemonic());
+      MarkForRevisit(input);
     }
   }
 }
 
 // Compute the intersection of the UnobservablesSets of all effect uses and
 // return it. This function only works if {node} has an effect use.
 //
 // The result UnobservablesSet will always be visited.
 UnobservablesSet RedundantStoreFinder::RecomputeUseIntersection(Node* node) {
   // {first} == true indicates that we haven't looked at any elements yet.
@@ skipping 138 matching lines @@
   return !(*this == other);
 }
 
 bool UnobservableStore::operator<(const UnobservableStore other) const {
   return (id_ < other.id_) || (id_ == other.id_ && offset_ < other.offset_);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8