OLD | NEW |
---|---|
1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 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/js-create-lowering.h" | 5 #include "src/compiler/js-create-lowering.h" |
6 | 6 |
7 #include "src/allocation-site-scopes.h" | 7 #include "src/allocation-site-scopes.h" |
8 #include "src/code-factory.h" | 8 #include "src/code-factory.h" |
9 #include "src/compilation-dependencies.h" | 9 #include "src/compilation-dependencies.h" |
10 #include "src/compiler/access-builder.h" | 10 #include "src/compiler/access-builder.h" |
(...skipping 599 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
610 if_not_equal}; | 610 if_not_equal}; |
611 | 611 |
612 call_packed = | 612 call_packed = |
613 graph()->NewNode(common()->Call(desc), arraysize(inputs), inputs); | 613 graph()->NewNode(common()->Call(desc), arraysize(inputs), inputs); |
614 if_success_packed = graph()->NewNode(common()->IfSuccess(), call_packed); | 614 if_success_packed = graph()->NewNode(common()->IfSuccess(), call_packed); |
615 } | 615 } |
616 Node* merge = graph()->NewNode(common()->Merge(2), if_success_holey, | 616 Node* merge = graph()->NewNode(common()->Merge(2), if_success_holey, |
617 if_success_packed); | 617 if_success_packed); |
618 Node* effect_phi = graph()->NewNode(common()->EffectPhi(2), call_holey, | 618 Node* effect_phi = graph()->NewNode(common()->EffectPhi(2), call_holey, |
619 call_packed, merge); | 619 call_packed, merge); |
620 Node* phi = | 620 Node* phi = graph()->NewNode( |
621 graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), | 621 common()->Phi(MachineRepresentation::kTaggedPointer, 2), call_holey, |
mvstanton
2016/09/13 13:03:54
don't bother it is ignored, "current contract" is
| |
622 call_holey, call_packed, merge); | 622 call_packed, merge); |
623 | 623 |
624 ReplaceWithValue(node, phi, effect_phi, merge); | 624 ReplaceWithValue(node, phi, effect_phi, merge); |
625 return Changed(node); | 625 return Changed(node); |
626 } | 626 } |
627 | 627 |
628 DCHECK(arity > 1); | 628 DCHECK(arity > 1); |
629 ArrayNArgumentsConstructorStub stub(isolate()); | 629 ArrayNArgumentsConstructorStub stub(isolate()); |
630 CallDescriptor* desc = Linkage::GetStubCallDescriptor( | 630 CallDescriptor* desc = Linkage::GetStubCallDescriptor( |
631 isolate(), graph()->zone(), stub.GetCallInterfaceDescriptor(), arity + 1, | 631 isolate(), graph()->zone(), stub.GetCallInterfaceDescriptor(), arity + 1, |
632 CallDescriptor::kNeedsFrameState); | 632 CallDescriptor::kNeedsFrameState); |
(...skipping 656 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1289 return jsgraph()->simplified(); | 1289 return jsgraph()->simplified(); |
1290 } | 1290 } |
1291 | 1291 |
1292 MachineOperatorBuilder* JSCreateLowering::machine() const { | 1292 MachineOperatorBuilder* JSCreateLowering::machine() const { |
1293 return jsgraph()->machine(); | 1293 return jsgraph()->machine(); |
1294 } | 1294 } |
1295 | 1295 |
1296 } // namespace compiler | 1296 } // namespace compiler |
1297 } // namespace internal | 1297 } // namespace internal |
1298 } // namespace v8 | 1298 } // namespace v8 |
OLD | NEW |