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/compiler/change-lowering.h" | 5 #include "src/compiler/change-lowering.h" |
6 #include "src/compiler/js-graph.h" | 6 #include "src/compiler/js-graph.h" |
7 #include "src/compiler/node-properties-inl.h" | 7 #include "src/compiler/node-properties-inl.h" |
8 #include "src/compiler/simplified-operator.h" | 8 #include "src/compiler/simplified-operator.h" |
9 #include "test/unittests/compiler/compiler-test-utils.h" | 9 #include "test/unittests/compiler/compiler-test-utils.h" |
10 #include "test/unittests/compiler/graph-unittest.h" | 10 #include "test/unittests/compiler/graph-unittest.h" |
(...skipping 51 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
62 | 62 |
63 Node* Parameter(int32_t index = 0) { | 63 Node* Parameter(int32_t index = 0) { |
64 return graph()->NewNode(common()->Parameter(index), graph()->start()); | 64 return graph()->NewNode(common()->Parameter(index), graph()->start()); |
65 } | 65 } |
66 | 66 |
67 Reduction Reduce(Node* node) { | 67 Reduction Reduce(Node* node) { |
68 MachineOperatorBuilder machine(WordRepresentation()); | 68 MachineOperatorBuilder machine(WordRepresentation()); |
69 JSOperatorBuilder javascript(zone()); | 69 JSOperatorBuilder javascript(zone()); |
70 JSGraph jsgraph(graph(), common(), &javascript, &machine); | 70 JSGraph jsgraph(graph(), common(), &javascript, &machine); |
71 CompilationInfo info(isolate(), zone()); | 71 CompilationInfo info(isolate(), zone()); |
72 Linkage linkage(&info); | 72 Linkage linkage(zone(), &info); |
73 ChangeLowering reducer(&jsgraph, &linkage); | 73 ChangeLowering reducer(&jsgraph, &linkage); |
74 return reducer.Reduce(node); | 74 return reducer.Reduce(node); |
75 } | 75 } |
76 | 76 |
77 SimplifiedOperatorBuilder* simplified() { return &simplified_; } | 77 SimplifiedOperatorBuilder* simplified() { return &simplified_; } |
78 | 78 |
79 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, | 79 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, |
80 const Matcher<Node*>& control_matcher) { | 80 const Matcher<Node*>& control_matcher) { |
81 return IsCall( | 81 return IsCall( |
82 _, IsHeapConstant(Unique<HeapObject>::CreateImmovable( | 82 _, IsHeapConstant(Unique<HeapObject>::CreateImmovable( |
(...skipping 370 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
453 IsIfTrue(AllOf(CaptureEq(&branch), | 453 IsIfTrue(AllOf(CaptureEq(&branch), |
454 IsBranch(IsUint32LessThanOrEqual( | 454 IsBranch(IsUint32LessThanOrEqual( |
455 val, IsInt32Constant(SmiMaxValue())), | 455 val, IsInt32Constant(SmiMaxValue())), |
456 graph()->start()))), | 456 graph()->start()))), |
457 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); | 457 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); |
458 } | 458 } |
459 | 459 |
460 } // namespace compiler | 460 } // namespace compiler |
461 } // namespace internal | 461 } // namespace internal |
462 } // namespace v8 | 462 } // namespace v8 |
OLD | NEW |