Home
last modified time | relevance | path

Searched refs:NewNode (Results 1 – 25 of 103) sorted by relevance

12345

/external/v8/test/unittests/compiler/
Dnode-matchers-unittest.cc46 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
49 Node* d0 = graph()->NewNode(d0_op); in TEST_F()
52 Node* d1 = graph()->NewNode(d1_op); in TEST_F()
55 Node* d2 = graph()->NewNode(d2_op); in TEST_F()
58 Node* d3 = graph()->NewNode(d3_op); in TEST_F()
61 Node* d4 = graph()->NewNode(d4_op); in TEST_F()
64 Node* d5 = graph()->NewNode(d5_op); in TEST_F()
67 Node* d7 = graph()->NewNode(d7_op); in TEST_F()
70 Node* d8 = graph()->NewNode(d8_op); in TEST_F()
73 Node* d9 = graph()->NewNode(d9_op); in TEST_F()
[all …]
Dbranch-elimination-unittest.cc48 graph()->NewNode(common()->Branch(), condition, graph()->start()); in TEST_F()
50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch); in TEST_F()
52 graph()->NewNode(common()->Branch(), condition, outer_if_true); in TEST_F()
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch); in TEST_F()
54 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch); in TEST_F()
56 graph()->NewNode(common()->Merge(2), inner_if_true, inner_if_false); in TEST_F()
58 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), in TEST_F()
61 Node* outer_if_false = graph()->NewNode(common()->IfFalse(), outer_branch); in TEST_F()
63 graph()->NewNode(common()->Merge(2), inner_merge, outer_if_false); in TEST_F()
65 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), in TEST_F()
[all …]
Dscheduler-unittest.cc635 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
636 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
642 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
644 Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start()); in TEST_F()
645 Node* ret = graph()->NewNode(common()->Return(), p1, graph()->start(), in TEST_F()
648 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
657 Node* tv = graph->NewNode(common->Int32Constant(6)); in CreateDiamond()
658 Node* fv = graph->NewNode(common->Int32Constant(7)); in CreateDiamond()
659 Node* br = graph->NewNode(common->Branch(), cond, graph->start()); in CreateDiamond()
660 Node* t = graph->NewNode(common->IfTrue(), br); in CreateDiamond()
[all …]
Dcontrol-flow-optimizer-unittest.cc43 Node* branch0 = graph()->NewNode( in TEST_F()
45 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(0)), in TEST_F()
47 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in TEST_F()
48 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in TEST_F()
49 Node* branch1 = graph()->NewNode( in TEST_F()
51 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(1)), in TEST_F()
53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in TEST_F()
54 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in TEST_F()
56 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1); in TEST_F()
57 graph()->SetEnd(graph()->NewNode(common()->End(1), merge)); in TEST_F()
[all …]
Ddead-code-elimination-unittest.cc61 Node* const dead = graph()->NewNode(common()->Dead()); in TEST_F()
62 Node* const node = graph()->NewNode(&kOp0, value, effect, dead); in TEST_F()
78 Reduce(graph()->NewNode(common()->Branch(hint), Parameter(0), in TEST_F()
79 graph()->NewNode(common()->Dead()))); in TEST_F()
92 graph()->NewNode(common()->IfTrue(), graph()->NewNode(common()->Dead()))); in TEST_F()
103 Reduction const r = Reduce(graph()->NewNode( in TEST_F()
104 common()->IfFalse(), graph()->NewNode(common()->Dead()))); in TEST_F()
115 Reduction const r = Reduce(graph()->NewNode( in TEST_F()
116 common()->IfSuccess(), graph()->NewNode(common()->Dead()))); in TEST_F()
131 Reduce(graph()->NewNode(common()->IfException(hint), graph()->start(), in TEST_F()
[all …]
Dcommon-operator-reducer-unittest.cc78 graph()->NewNode(common()->Branch(hint), Int32Constant(0), control); in TEST_F()
79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
80 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
95 graph()->NewNode(common()->Branch(hint), Int32Constant(1), control); in TEST_F()
96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
97 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
112 graph()->NewNode(common()->Branch(hint), Int64Constant(0), control); in TEST_F()
113 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
114 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
129 graph()->NewNode(common()->Branch(hint), Int64Constant(1), control); in TEST_F()
[all …]
Dmachine-operator-reducer-unittest.cc272 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
287 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
289 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value))); in TEST_F()
297 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
312 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
314 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value))); in TEST_F()
322 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
337 graph()->NewNode(machine()->ChangeInt32ToFloat64(), Int32Constant(x))); in TEST_F()
351 graph()->NewNode(machine()->ChangeInt32ToInt64(), Int32Constant(x))); in TEST_F()
365 Reduce(graph()->NewNode(machine()->ChangeUint32ToFloat64(), in TEST_F()
[all …]
Dsimplified-operator-reducer-unittest.cc129 graph()->NewNode(simplified()->BooleanNot(), in TEST_F()
130 graph()->NewNode(simplified()->BooleanNot(), param0))); in TEST_F()
138 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); in TEST_F()
146 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); in TEST_F()
158 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
160 graph()->NewNode(simplified()->ChangeBoolToBit(), param0))); in TEST_F()
168 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(0))); in TEST_F()
176 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(1))); in TEST_F()
188 graph()->NewNode(simplified()->ChangeBoolToBit(), FalseConstant())); in TEST_F()
196 Reduce(graph()->NewNode(simplified()->ChangeBoolToBit(), TrueConstant())); in TEST_F()
[all …]
Dgraph-reducer-unittest.cc92 return Replace(graph_->NewNode(&kOpB0)); in Reduce()
95 return Replace(graph_->NewNode(&kOpB1, node->InputAt(0))); in Reduce()
99 graph_->NewNode(&kOpB2, node->InputAt(0), node->InputAt(1))); in Reduce()
118 return Replace(graph_->NewNode(&kOpB1, node)); in Reduce()
137 return Replace(graph_->NewNode(&kOpC1, graph_->NewNode(&kOpC1, node))); in Reduce()
243 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F()
244 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
262 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F()
263 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
293 Node* node = graph()->NewNode(&kMockOperator); in TEST_F()
[all …]
Dvalue-numbering-reducer-unittest.cc45 Node* na = graph()->NewNode(&kOp0); in TEST_F()
46 Node* nb = graph()->NewNode(&kOp0); in TEST_F()
47 Node* n1 = graph()->NewNode(&kOp1, na); in TEST_F()
48 Node* n2 = graph()->NewNode(&kOp1, nb); in TEST_F()
55 Node* n0 = graph()->NewNode(&kOp0); in TEST_F()
56 Node* n1 = graph()->NewNode(&kOp1, n0); in TEST_F()
59 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed()); in TEST_F()
65 Node* n0 = graph()->NewNode(&op); in TEST_F()
66 Node* n1 = graph()->NewNode(&op); in TEST_F()
77 inputs[i] = graph()->NewNode( in TEST_F()
[all …]
Dgraph-unittest.cc17 graph()->SetStart(graph()->NewNode(common()->Start(num_parameters))); in GraphTest()
18 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in GraphTest()
26 return graph()->NewNode(common()->Parameter(index), graph()->start()); in Parameter()
31 return graph()->NewNode(common()->Float32Constant(value)); in Float32Constant()
36 return graph()->NewNode(common()->Float64Constant(value)); in Float64Constant()
41 return graph()->NewNode(common()->Int32Constant(value)); in Int32Constant()
46 return graph()->NewNode(common()->Int64Constant(value)); in Int64Constant()
51 return graph()->NewNode(common()->NumberConstant(value)); in NumberConstant()
56 Node* node = graph()->NewNode(common()->HeapConstant(value)); in HeapConstant()
79 Node* state_values = graph()->NewNode(common()->StateValues(0)); in EmptyFrameState()
[all …]
Dtail-call-optimization-unittest.cc41 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
43 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
44 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
63 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
65 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
66 Node* if_exception = graph()->NewNode( in TEST_F()
68 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
69 Node* end = graph()->NewNode(common()->End(1), if_exception); in TEST_F()
89 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
91 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
[all …]
Dgraph-trimmer-unittest.cc44 Node* const start = graph()->NewNode(common()->Start(0)); in TEST_F()
45 Node* const end = graph()->NewNode(common()->End(1), start); in TEST_F()
56 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start()); in TEST_F()
57 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
65 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start()); in TEST_F()
66 Node* const live0 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
67 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
76 Node* const live0 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
77 Node* const live1 = graph()->NewNode(&kLive0, graph()->start()); in TEST_F()
78 graph()->SetEnd(graph()->NewNode(common()->End(1), live0)); in TEST_F()
/external/v8/test/cctest/compiler/
Dtest-node.cc146 Node* n0 = graph.NewNode(&dummy_operator0); in TEST()
147 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
148 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST()
149 Node* n3 = graph.NewNode(&dummy_operator0); in TEST()
171 Node* n0 = graph.NewNode(&dummy_operator0); in TEST()
172 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
182 Node* n2 = graph.NewNode(&dummy_operator0); in TEST()
195 Node* n0 = graph.NewNode(&dummy_operator0); in TEST()
196 Node* n1 = graph.NewNode(&dummy_operator0); in TEST()
197 Node* n2 = graph.NewNode(&dummy_operator0); in TEST()
[all …]
Dgraph-builder-tester.h81 Node* start = graph()->NewNode(common()->Start(num_parameters + 3)); in Begin()
88 graph()->NewNode(common()->Return(), value, effect_, graph()->start()); in Return()
94 Node* end = graph()->NewNode(common()->End(1), return_); in End()
100 return kPointerSize == 8 ? NewNode(common()->Int64Constant(intptr_value)) in PointerConstant()
104 return NewNode(common()->Int32Constant(value)); in Int32Constant()
107 return NewNode(common()->HeapConstant(object)); in HeapConstant()
110 Node* BooleanNot(Node* a) { return NewNode(simplified()->BooleanNot(), a); } in BooleanNot()
113 return NewNode(simplified()->NumberEqual(), a, b); in NumberEqual()
116 return NewNode(simplified()->NumberLessThan(), a, b); in NumberLessThan()
119 return NewNode(simplified()->NumberLessThanOrEqual(), a, b); in NumberLessThanOrEqual()
[all …]
Dtest-graph-visualizer.cc33 Node* start = graph.NewNode(common.Start(0)); in TEST()
35 Node* k = graph.NewNode(common.Int32Constant(0)); in TEST()
37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start); in TEST()
52 Node* start = graph.NewNode(common.Start(0)); in TEST()
54 Node* k = graph.NewNode(common.Int32Constant(0)); in TEST()
56 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start); in TEST()
71 Node* start = graph.NewNode(common.Start(0)); in TEST()
73 Node* k = graph.NewNode(common.Int32Constant(0)); in TEST()
75 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start); in TEST()
90 Node* start = graph.NewNode(common.Start(0)); in TEST()
[all …]
Dtest-loop-analysis.cc42 start(graph.NewNode(common.Start(1))), in LoopFinderTester()
43 end(graph.NewNode(common.End(1), start)), in LoopFinderTester()
44 p0(graph.NewNode(common.Parameter(0), start)), in LoopFinderTester()
48 self(graph.NewNode(common.Int32Constant(0xaabbccdd))), in LoopFinderTester()
49 dead(graph.NewNode(common.Dead())), in LoopFinderTester()
75 return SetSelfReferences(graph.NewNode(op(1, false), a, start)); in Phi()
79 return SetSelfReferences(graph.NewNode(op(2, false), a, b, start)); in Phi()
83 return SetSelfReferences(graph.NewNode(op(3, false), a, b, c, start)); in Phi()
87 return SetSelfReferences(graph.NewNode(op(4, false), a, b, c, d, start)); in Phi()
91 return SetSelfReferences(graph.NewNode(op(1, true), a, start)); in EffectPhi()
[all …]
Dtest-osr.cc53 start(graph.NewNode(common.Start(1))), in OsrDeconstructorTester()
54 p0(graph.NewNode(common.Parameter(0), start)), in OsrDeconstructorTester()
55 end(graph.NewNode(common.End(1), start)), in OsrDeconstructorTester()
56 osr_normal_entry(graph.NewNode(common.OsrNormalEntry(), start, start)), in OsrDeconstructorTester()
57 osr_loop_entry(graph.NewNode(common.OsrLoopEntry(), start, start)), in OsrDeconstructorTester()
58 self(graph.NewNode(common.Int32Constant(0xaabbccdd))) { in OsrDeconstructorTester()
62 osr_values[i] = graph.NewNode(common.OsrValue(i), osr_loop_entry); in OsrDeconstructorTester()
94 return graph.NewNode(common.Phi(MachineRepresentation::kTagged, count), in NewOsrPhi()
100 Node* loop = graph.NewNode(common.Loop(1), entry); in NewLoop()
153 Node* ret = T.graph.NewNode(T.common.Return(), osr_phi, T.start, loop); in TEST()
[all …]
Dtest-run-stubs.cc37 Node* start = graph.NewNode(common.Start(6)); in TEST()
39 Node* receiverParam = graph.NewNode(common.Parameter(1), start); in TEST()
40 Node* nameParam = graph.NewNode(common.Parameter(2), start); in TEST()
41 Node* slotParam = graph.NewNode(common.Parameter(3), start); in TEST()
42 Node* vectorParam = graph.NewNode(common.Parameter(4), start); in TEST()
43 Node* theCode = graph.NewNode(common.HeapConstant(code)); in TEST()
44 Node* dummyContext = graph.NewNode(common.NumberConstant(0.0)); in TEST()
46 graph.NewNode(common.Call(descriptor), theCode, receiverParam, nameParam, in TEST()
48 Node* ret = graph.NewNode(common.Return(), call, call, start); in TEST()
49 Node* end = graph.NewNode(common.End(1), ret); in TEST()
/external/v8/src/compiler/
Djs-native-context-specialization.cc101 Node* check = graph()->NewNode(simplified()->ReferenceEqual(Type::Name()), in ReduceNamedAccess()
104 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceNamedAccess()
105 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch)); in ReduceNamedAccess()
106 control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
110 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
111 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
112 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
113 Node* receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
119 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceNamedAccess()
134 Node* receiver_instance_type = this_effect = graph()->NewNode( in ReduceNamedAccess()
[all …]
Dchange-lowering.cc81 Node* effect = graph()->NewNode(common()->BeginRegion(), graph()->start()); in AllocateHeapNumberWithValue()
88 Node* heap_number = graph()->NewNode(allocate_heap_number_operator_.get(), in AllocateHeapNumberWithValue()
90 Node* store = graph()->NewNode( in AllocateHeapNumberWithValue()
94 return graph()->NewNode(common()->FinishRegion(), heap_number, store); in AllocateHeapNumberWithValue()
99 return graph()->NewNode(machine()->ChangeInt32ToFloat64(), value); in ChangeInt32ToFloat64()
105 value = graph()->NewNode(machine()->ChangeInt32ToInt64(), value); in ChangeInt32ToSmi()
107 return graph()->NewNode(machine()->WordShl(), value, SmiShiftBitsConstant()); in ChangeInt32ToSmi()
117 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant()); in ChangeSmiToInt32()
119 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value); in ChangeSmiToInt32()
126 return graph()->NewNode(machine()->ChangeUint32ToFloat64(), value); in ChangeUint32ToFloat64()
[all …]
Dgraph.h41 Node* NewNode(const Operator* op, int input_count, Node** inputs,
45 Node* NewNode(const Operator* op) { in NewNode() function
46 return NewNode(op, 0, static_cast<Node**>(nullptr)); in NewNode()
48 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode() function
49 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
51 return NewNode(op, arraysize(nodes), nodes); in NewNode()
53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
55 return NewNode(op, arraysize(nodes), nodes); in NewNode()
57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
59 return NewNode(op, arraysize(nodes), nodes); in NewNode()
[all …]
Djs-intrinsic-lowering.cc131 graph()->NewNode(machine()->Float64InsertHighWord32(), in ReduceConstructDouble()
132 graph()->NewNode(machine()->Float64InsertLowWord32(), in ReduceConstructDouble()
148 graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kEager), in ReduceDeoptimizeNow()
184 graph()->NewNode(simplified()->LoadField(access), cnt, effect, control); in ReduceIncrementStatsCounter()
186 graph()->NewNode(machine()->Int32Add(), load, jsgraph()->OneConstant()); in ReduceIncrementStatsCounter()
187 Node* store = graph()->NewNode(simplified()->StoreField(access), cnt, inc, in ReduceIncrementStatsCounter()
204 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceIsInstanceType()
205 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceIsInstanceType()
207 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in ReduceIsInstanceType()
211 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceIsInstanceType()
[all …]
Dwasm-compiler.cc66 g->SetEnd(g->NewNode(jsgraph->common()->End(1), node)); in MergeControlToEnd()
116 graph()->NewNode(jsgraph()->machine()->Word32Equal(), node, in TrapIfEq32()
132 graph()->NewNode(jsgraph()->machine()->Word64Equal(), node, in TrapIfEq64()
158 Node* branch = graph()->NewNode(common()->Branch(hint), cond, *control_ptr); in AddTrapIf()
159 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in AddTrapIf()
160 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in AddTrapIf()
196 graph()->NewNode(common()->Merge(1), *control_ptr); in BuildTrapCode()
198 graph()->NewNode(common()->EffectPhi(1), *effect_ptr, *control_ptr); in BuildTrapCode()
217 Node* node = graph()->NewNode( in BuildTrapCode()
225 graph()->NewNode(common()->Throw(), jsgraph()->ZeroConstant(), in BuildTrapCode()
[all …]
Djs-global-object-specialization.cc68 Node* value = effect = graph()->NewNode( in ReduceJSLoadGlobal()
133 Node* value = effect = graph()->NewNode( in ReduceJSLoadGlobal()
160 effect = graph()->NewNode(javascript()->StoreContext(0, result.index), in ReduceJSStoreGlobal()
186 graph()->NewNode(simplified()->ReferenceEqual(Type::Tagged()), value, in ReduceJSStoreGlobal()
189 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceJSStoreGlobal()
190 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in ReduceJSStoreGlobal()
192 graph()->NewNode(common()->Deoptimize(DeoptimizeKind::kEager), in ReduceJSStoreGlobal()
196 control = graph()->NewNode(common()->IfTrue(), branch); in ReduceJSStoreGlobal()
204 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), value); in ReduceJSStoreGlobal()
208 Node* branch = graph()->NewNode(common()->Branch(BranchHint::kFalse), in ReduceJSStoreGlobal()
[all …]

12345