Index: src/compiler/checkpoint-elimination.cc |
diff --git a/src/compiler/checkpoint-elimination.cc b/src/compiler/checkpoint-elimination.cc |
new file mode 100644 |
index 0000000000000000000000000000000000000000..20f503ba8f773fd35153046e0f57089dde486116 |
--- /dev/null |
+++ b/src/compiler/checkpoint-elimination.cc |
@@ -0,0 +1,43 @@ |
+// 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 "src/compiler/checkpoint-elimination.h" |
+ |
+#include "src/compiler/node-properties.h" |
+ |
+namespace v8 { |
+namespace internal { |
+namespace compiler { |
+ |
+CheckpointElimination::CheckpointElimination(Editor* editor) |
+ : AdvancedReducer(editor) {} |
+ |
+namespace { |
+ |
+// The given checkpoint is redundant if it is effect-wise dominated by another |
+// checkpoint and there is no observable write in between. For now we consider |
+// a linear effect chain only instead of true effect-wise dominance. |
+bool IsRedundantCheckPoint(Node* node) { |
+ Node* effect = NodeProperties::GetEffectInput(node); |
+ while (effect->op()->HasProperty(Operator::kNoWrite) && |
+ effect->op()->EffectInputCount() == 1) { |
+ if (effect->opcode() == IrOpcode::kCheckPoint) return true; |
+ effect = NodeProperties::GetEffectInput(effect); |
+ } |
+ return false; |
+} |
+ |
+} // namespace |
+ |
+Reduction CheckpointElimination::Reduce(Node* node) { |
+ if (node->opcode() != IrOpcode::kCheckPoint) return NoChange(); |
+ if (IsRedundantCheckPoint(node)) { |
+ return Replace(NodeProperties::GetEffectInput(node)); |
+ } |
+ return NoChange(); |
+} |
+ |
+} // namespace compiler |
+} // namespace internal |
+} // namespace v8 |