| OLD | NEW |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/bit-vector.h" | 5 #include "src/bit-vector.h" |
| 6 #include "src/compiler/control-equivalence.h" | 6 #include "src/compiler/control-equivalence.h" |
| 7 #include "src/compiler/graph-visualizer.h" | 7 #include "src/compiler/graph-visualizer.h" |
| 8 #include "src/compiler/node-properties.h" | 8 #include "src/compiler/node-properties.h" |
| 9 #include "src/zone-containers.h" | 9 #include "src/zone-containers.h" |
| 10 #include "test/unittests/compiler/graph-unittest.h" | 10 #include "test/unittests/compiler/graph-unittest.h" |
| 11 | 11 |
| 12 namespace v8 { | 12 namespace v8 { |
| 13 namespace internal { | 13 namespace internal { |
| 14 namespace compiler { | 14 namespace compiler { |
| 15 | 15 |
| 16 #define ASSERT_EQUIVALENCE(...) \ | 16 #define ASSERT_EQUIVALENCE(...) \ |
| 17 do { \ | 17 do { \ |
| 18 Node* __n[] = {__VA_ARGS__}; \ | 18 Node* __n[] = {__VA_ARGS__}; \ |
| 19 ASSERT_TRUE(IsEquivalenceClass(arraysize(__n), __n)); \ | 19 ASSERT_TRUE(IsEquivalenceClass(arraysize(__n), __n)); \ |
| 20 } while (false); | 20 } while (false) |
| 21 | 21 |
| 22 class ControlEquivalenceTest : public GraphTest { | 22 class ControlEquivalenceTest : public GraphTest { |
| 23 public: | 23 public: |
| 24 ControlEquivalenceTest() : all_nodes_(zone()), classes_(zone()) { | 24 ControlEquivalenceTest() : all_nodes_(zone()), classes_(zone()) { |
| 25 Store(graph()->start()); | 25 Store(graph()->start()); |
| 26 } | 26 } |
| 27 | 27 |
| 28 protected: | 28 protected: |
| 29 void ComputeEquivalence(Node* node) { | 29 void ComputeEquivalence(Node* node) { |
| 30 graph()->SetEnd(graph()->NewNode(common()->End(), node)); | 30 graph()->SetEnd(graph()->NewNode(common()->End(), node)); |
| (...skipping 215 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 246 ASSERT_EQUIVALENCE(t2); | 246 ASSERT_EQUIVALENCE(t2); |
| 247 ASSERT_EQUIVALENCE(f2); | 247 ASSERT_EQUIVALENCE(f2); |
| 248 ASSERT_EQUIVALENCE(f3); | 248 ASSERT_EQUIVALENCE(f3); |
| 249 ASSERT_EQUIVALENCE(lp); | 249 ASSERT_EQUIVALENCE(lp); |
| 250 } | 250 } |
| 251 | 251 |
| 252 | 252 |
| 253 } // namespace compiler | 253 } // namespace compiler |
| 254 } // namespace internal | 254 } // namespace internal |
| 255 } // namespace v8 | 255 } // namespace v8 |
| OLD | NEW |