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 <limits> | 5 #include <limits> |
6 | 6 |
7 #include "src/compiler/control-builders.h" | 7 #include "src/compiler/control-builders.h" |
8 #include "src/compiler/generic-node-inl.h" | 8 #include "src/compiler/generic-node-inl.h" |
9 #include "src/compiler/graph-visualizer.h" | 9 #include "src/compiler/graph-visualizer.h" |
10 #include "src/compiler/node-properties-inl.h" | 10 #include "src/compiler/node-properties-inl.h" |
(...skipping 690 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
701 return graph()->NewNode(simplified()->ReferenceEqual(Type::Any()), node, | 701 return graph()->NewNode(simplified()->ReferenceEqual(Type::Any()), node, |
702 jsgraph.TrueConstant()); | 702 jsgraph.TrueConstant()); |
703 } | 703 } |
704 } | 704 } |
705 | 705 |
706 Node* Branch(Node* cond) { | 706 Node* Branch(Node* cond) { |
707 Node* br = graph()->NewNode(common()->Branch(), cond, start); | 707 Node* br = graph()->NewNode(common()->Branch(), cond, start); |
708 Node* tb = graph()->NewNode(common()->IfTrue(), br); | 708 Node* tb = graph()->NewNode(common()->IfTrue(), br); |
709 Node* fb = graph()->NewNode(common()->IfFalse(), br); | 709 Node* fb = graph()->NewNode(common()->IfFalse(), br); |
710 Node* m = graph()->NewNode(common()->Merge(2), tb, fb); | 710 Node* m = graph()->NewNode(common()->Merge(2), tb, fb); |
711 ret->ReplaceInput(NodeProperties::FirstControlIndex(ret), m); | 711 NodeProperties::ReplaceControlInput(ret, m); |
712 return br; | 712 return br; |
713 } | 713 } |
714 | 714 |
715 Node* Int64Constant(int64_t v) { | 715 Node* Int64Constant(int64_t v) { |
716 return graph()->NewNode(common()->Int64Constant(v)); | 716 return graph()->NewNode(common()->Int64Constant(v)); |
717 } | 717 } |
718 | 718 |
719 SimplifiedOperatorBuilder* simplified() { return &main_simplified_; } | 719 SimplifiedOperatorBuilder* simplified() { return &main_simplified_; } |
720 MachineOperatorBuilder* machine() { return &main_machine_; } | 720 MachineOperatorBuilder* machine() { return &main_machine_; } |
721 CommonOperatorBuilder* common() { return &main_common_; } | 721 CommonOperatorBuilder* common() { return &main_common_; } |
(...skipping 642 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1364 | 1364 |
1365 Node* store = t.graph()->NewNode(t.simplified()->StoreField(access), t.p0, | 1365 Node* store = t.graph()->NewNode(t.simplified()->StoreField(access), t.p0, |
1366 t.p1, t.start, t.start); | 1366 t.p1, t.start, t.start); |
1367 t.Effect(store); | 1367 t.Effect(store); |
1368 t.Lower(); | 1368 t.Lower(); |
1369 | 1369 |
1370 CHECK_EQ(IrOpcode::kStore, store->opcode()); | 1370 CHECK_EQ(IrOpcode::kStore, store->opcode()); |
1371 CHECK_EQ(t.p0, store->InputAt(0)); | 1371 CHECK_EQ(t.p0, store->InputAt(0)); |
1372 CheckChangeOf(IrOpcode::kChangeTaggedToFloat64, t.p1, store->InputAt(2)); | 1372 CheckChangeOf(IrOpcode::kChangeTaggedToFloat64, t.p1, store->InputAt(2)); |
1373 } | 1373 } |
OLD | NEW |