| 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 // TODO(jochen): Remove this after the setting is turned on globally. | 5 // TODO(jochen): Remove this after the setting is turned on globally. |
| 6 #define V8_IMMINENT_DEPRECATION_WARNINGS | 6 #define V8_IMMINENT_DEPRECATION_WARNINGS |
| 7 | 7 |
| 8 #include "src/compiler/access-builder.h" | 8 #include "src/compiler/access-builder.h" |
| 9 #include "src/compiler/common-operator.h" | 9 #include "src/compiler/common-operator.h" |
| 10 #include "src/compiler/graph.h" | 10 #include "src/compiler/graph.h" |
| (...skipping 698 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 709 Node* header[] = {loop, phi}; | 709 Node* header[] = {loop, phi}; |
| 710 Node* body[] = {cond, branch, if_true}; | 710 Node* body[] = {cond, branch, if_true}; |
| 711 t.CheckLoop(header, 2, body, 3); | 711 t.CheckLoop(header, 2, body, 3); |
| 712 } | 712 } |
| 713 } | 713 } |
| 714 } | 714 } |
| 715 } | 715 } |
| 716 | 716 |
| 717 | 717 |
| 718 void RunEdgeMatrix2(int i) { | 718 void RunEdgeMatrix2(int i) { |
| 719 DCHECK(i >= 0 && i < 5); | 719 CHECK(i >= 0 && i < 5); |
| 720 for (int j = 0; j < 5; j++) { | 720 for (int j = 0; j < 5; j++) { |
| 721 for (int k = 0; k < 5; k++) { | 721 for (int k = 0; k < 5; k++) { |
| 722 LoopFinderTester t; | 722 LoopFinderTester t; |
| 723 | 723 |
| 724 Node* p1 = t.jsgraph.Int32Constant(11); | 724 Node* p1 = t.jsgraph.Int32Constant(11); |
| 725 Node* p2 = t.jsgraph.Int32Constant(22); | 725 Node* p2 = t.jsgraph.Int32Constant(22); |
| 726 Node* p3 = t.jsgraph.Int32Constant(33); | 726 Node* p3 = t.jsgraph.Int32Constant(33); |
| 727 | 727 |
| 728 // outer loop. | 728 // outer loop. |
| 729 Node* loop1 = t.graph.NewNode(t.common.Loop(2), t.start, t.start); | 729 Node* loop1 = t.graph.NewNode(t.common.Loop(2), t.start, t.start); |
| (...skipping 281 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1011 TEST(LaManyNested_62) { RunManyNestedLoops_i(62); } | 1011 TEST(LaManyNested_62) { RunManyNestedLoops_i(62); } |
| 1012 TEST(LaManyNested_63) { RunManyNestedLoops_i(63); } | 1012 TEST(LaManyNested_63) { RunManyNestedLoops_i(63); } |
| 1013 TEST(LaManyNested_64) { RunManyNestedLoops_i(64); } | 1013 TEST(LaManyNested_64) { RunManyNestedLoops_i(64); } |
| 1014 | 1014 |
| 1015 | 1015 |
| 1016 TEST(LaPhiTangle) { LoopFinderTester t; } | 1016 TEST(LaPhiTangle) { LoopFinderTester t; } |
| 1017 | 1017 |
| 1018 } // namespace compiler | 1018 } // namespace compiler |
| 1019 } // namespace internal | 1019 } // namespace internal |
| 1020 } // namespace v8 | 1020 } // namespace v8 |
| OLD | NEW |