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/code-stubs.h" | 5 #include "src/code-stubs.h" |
6 #include "src/compiler/change-lowering.h" | 6 #include "src/compiler/change-lowering.h" |
7 #include "src/compiler/js-graph.h" | 7 #include "src/compiler/js-graph.h" |
8 #include "src/compiler/linkage.h" | 8 #include "src/compiler/linkage.h" |
9 #include "src/compiler/node-properties.h" | 9 #include "src/compiler/node-properties.h" |
10 #include "src/compiler/simplified-operator.h" | 10 #include "src/compiler/simplified-operator.h" |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 } | 60 } |
61 int SmiValueSize() const { | 61 int SmiValueSize() const { |
62 return Is32() ? SmiTagging<4>::SmiValueSize() | 62 return Is32() ? SmiTagging<4>::SmiValueSize() |
63 : SmiTagging<8>::SmiValueSize(); | 63 : SmiTagging<8>::SmiValueSize(); |
64 } | 64 } |
65 | 65 |
66 Reduction Reduce(Node* node) { | 66 Reduction Reduce(Node* node) { |
67 MachineOperatorBuilder machine(zone(), WordRepresentation()); | 67 MachineOperatorBuilder machine(zone(), WordRepresentation()); |
68 JSOperatorBuilder javascript(zone()); | 68 JSOperatorBuilder javascript(zone()); |
69 JSGraph jsgraph(isolate(), graph(), common(), &javascript, &machine); | 69 JSGraph jsgraph(isolate(), graph(), common(), &javascript, &machine); |
70 CompilationInfo info(isolate(), zone()); | 70 ChangeLowering reducer(&jsgraph); |
71 Linkage linkage(zone(), &info); | |
72 ChangeLowering reducer(&jsgraph, &linkage); | |
73 return reducer.Reduce(node); | 71 return reducer.Reduce(node); |
74 } | 72 } |
75 | 73 |
76 SimplifiedOperatorBuilder* simplified() { return &simplified_; } | 74 SimplifiedOperatorBuilder* simplified() { return &simplified_; } |
77 | 75 |
78 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, | 76 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, |
79 const Matcher<Node*>& control_matcher) { | 77 const Matcher<Node*>& control_matcher) { |
80 return IsCall(_, IsHeapConstant(Unique<HeapObject>::CreateImmovable( | 78 return IsCall(_, IsHeapConstant(Unique<HeapObject>::CreateImmovable( |
81 AllocateHeapNumberStub(isolate()).GetCode())), | 79 AllocateHeapNumberStub(isolate()).GetCode())), |
82 IsNumberConstant(BitEq(0.0)), effect_matcher, | 80 IsNumberConstant(BitEq(0.0)), effect_matcher, |
(...skipping 371 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
454 IsIfTrue(AllOf(CaptureEq(&branch), | 452 IsIfTrue(AllOf(CaptureEq(&branch), |
455 IsBranch(IsUint32LessThanOrEqual( | 453 IsBranch(IsUint32LessThanOrEqual( |
456 val, IsInt32Constant(SmiMaxValue())), | 454 val, IsInt32Constant(SmiMaxValue())), |
457 graph()->start()))), | 455 graph()->start()))), |
458 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); | 456 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); |
459 } | 457 } |
460 | 458 |
461 } // namespace compiler | 459 } // namespace compiler |
462 } // namespace internal | 460 } // namespace internal |
463 } // namespace v8 | 461 } // namespace v8 |
OLD | NEW |