| 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/compiler-test-utils.h" | 6 #include "src/compiler/compiler-test-utils.h" |
| 7 #include "src/compiler/graph-unittest.h" | 7 #include "src/compiler/graph-unittest.h" |
| 8 #include "src/compiler/js-graph.h" | 8 #include "src/compiler/js-graph.h" |
| 9 #include "src/compiler/node-properties-inl.h" | 9 #include "src/compiler/node-properties-inl.h" |
| 10 #include "src/compiler/simplified-operator.h" | 10 #include "src/compiler/simplified-operator.h" |
| (...skipping 69 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 80 MachineOperatorBuilder machine(zone(), WordRepresentation()); | 80 MachineOperatorBuilder machine(zone(), WordRepresentation()); |
| 81 ChangeLowering reducer(&jsgraph, &linkage, &machine); | 81 ChangeLowering reducer(&jsgraph, &linkage, &machine); |
| 82 return reducer.Reduce(node); | 82 return reducer.Reduce(node); |
| 83 } | 83 } |
| 84 | 84 |
| 85 SimplifiedOperatorBuilder* simplified() { return &simplified_; } | 85 SimplifiedOperatorBuilder* simplified() { return &simplified_; } |
| 86 | 86 |
| 87 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, | 87 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher, |
| 88 const Matcher<Node*>& control_matcher) { | 88 const Matcher<Node*>& control_matcher) { |
| 89 return IsCall( | 89 return IsCall( |
| 90 _, IsHeapConstant(PrintableUnique<HeapObject>::CreateImmovable( | 90 _, IsHeapConstant(Unique<HeapObject>::CreateImmovable( |
| 91 zone(), CEntryStub(isolate(), 1).GetCode())), | 91 CEntryStub(isolate(), 1).GetCode())), |
| 92 IsExternalConstant(ExternalReference( | 92 IsExternalConstant(ExternalReference( |
| 93 Runtime::FunctionForId(Runtime::kAllocateHeapNumber), isolate())), | 93 Runtime::FunctionForId(Runtime::kAllocateHeapNumber), isolate())), |
| 94 IsInt32Constant(0), IsNumberConstant(0.0), effect_matcher, | 94 IsInt32Constant(0), IsNumberConstant(0.0), effect_matcher, |
| 95 control_matcher); | 95 control_matcher); |
| 96 } | 96 } |
| 97 Matcher<Node*> IsWordEqual(const Matcher<Node*>& lhs_matcher, | 97 Matcher<Node*> IsWordEqual(const Matcher<Node*>& lhs_matcher, |
| 98 const Matcher<Node*>& rhs_matcher) { | 98 const Matcher<Node*>& rhs_matcher) { |
| 99 return Is32() ? IsWord32Equal(lhs_matcher, rhs_matcher) | 99 return Is32() ? IsWord32Equal(lhs_matcher, rhs_matcher) |
| 100 : IsWord64Equal(lhs_matcher, rhs_matcher); | 100 : IsWord64Equal(lhs_matcher, rhs_matcher); |
| 101 } | 101 } |
| (...skipping 356 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 458 IsIfTrue(AllOf(CaptureEq(&branch), | 458 IsIfTrue(AllOf(CaptureEq(&branch), |
| 459 IsBranch(IsUint32LessThanOrEqual( | 459 IsBranch(IsUint32LessThanOrEqual( |
| 460 val, IsInt32Constant(SmiMaxValue())), | 460 val, IsInt32Constant(SmiMaxValue())), |
| 461 graph()->start()))), | 461 graph()->start()))), |
| 462 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); | 462 AllOf(CaptureEq(&if_false), IsIfFalse(CaptureEq(&branch)))))); |
| 463 } | 463 } |
| 464 | 464 |
| 465 } // namespace compiler | 465 } // namespace compiler |
| 466 } // namespace internal | 466 } // namespace internal |
| 467 } // namespace v8 | 467 } // namespace v8 |
| OLD | NEW |