Lines Matching refs:NewNode
78 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()
130 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
131 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
146 graph()->NewNode(common()->Branch(hint), FalseConstant(), control); in TEST_F()
147 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
148 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
163 graph()->NewNode(common()->Branch(hint), TrueConstant(), control); in TEST_F()
164 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
165 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
180 Node* const branch = graph()->NewNode( in TEST_F()
182 graph()->NewNode(simplified()->BooleanNot(), value), control); in TEST_F()
183 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
184 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
203 Node* const branch = graph()->NewNode(common()->Branch(), value, control); in TEST_F()
204 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
205 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
207 Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false)); in TEST_F()
217 Node* const branch = graph()->NewNode(common()->Branch(), value, control); in TEST_F()
218 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
219 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
221 Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true)); in TEST_F()
235 Node* const input = graph()->NewNode(&kOp0); in TEST_F()
241 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F()
250 Reduce(&editor, graph()->NewNode(common()->EffectPhi(value_input_count), in TEST_F()
259 Node* const e0 = graph()->NewNode(&kOp0); in TEST_F()
261 graph()->NewNode(common()->Loop(2), graph()->start(), graph()->start()); in TEST_F()
263 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e0, loop); in TEST_F()
280 Node* const input = graph()->NewNode(&kOp0); in TEST_F()
287 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F()
296 &editor, graph()->NewNode(common()->Phi(rep, value_input_count), in TEST_F()
308 graph()->NewNode(common()->Loop(2), graph()->start(), graph()->start()); in TEST_F()
310 Node* const phi = graph()->NewNode( in TEST_F()
324 Node* check = graph()->NewNode(machine()->Float32LessThan(), c0, p0); in TEST_F()
325 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
326 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
328 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
329 Node* vfalse = graph()->NewNode(machine()->Float32Sub(), c0, p0); in TEST_F()
330 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
331 Node* phi = graph()->NewNode( in TEST_F()
344 Node* check = graph()->NewNode(machine()->Float64LessThan(), c0, p0); in TEST_F()
345 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
346 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
348 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
349 Node* vfalse = graph()->NewNode(machine()->Float64Sub(), c0, p0); in TEST_F()
350 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
351 Node* phi = graph()->NewNode( in TEST_F()
364 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1); in TEST_F()
365 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
366 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
367 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
368 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
369 Node* phi = graph()->NewNode( in TEST_F()
382 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1); in TEST_F()
383 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
384 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
385 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
386 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
387 Node* phi = graph()->NewNode( in TEST_F()
400 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1); in TEST_F()
401 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
402 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
403 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
404 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
405 Node* phi = graph()->NewNode( in TEST_F()
418 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1); in TEST_F()
419 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start()); in TEST_F()
420 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
421 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
422 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
423 Node* phi = graph()->NewNode( in TEST_F()
439 Node* branch = graph()->NewNode(common()->Branch(), cond, graph()->start()); in TEST_F()
440 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
443 Node* if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
446 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
447 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge); in TEST_F()
448 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2), in TEST_F()
450 Node* ret = graph()->NewNode(common()->Return(), phi, ephi, merge); in TEST_F()
451 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
467 Node* const input = graph()->NewNode(&kOp0); in TEST_F()
471 graph()->NewNode(common()->Select(rep, hint), input, input, input)); in TEST_F()
483 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in TEST_F()
495 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in TEST_F()
507 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in TEST_F()
519 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in TEST_F()
531 graph()->NewNode(common()->Select(MachineRepresentation::kTagged), in TEST_F()
542 Node* select = graph()->NewNode( in TEST_F()
553 Node* check = graph()->NewNode(machine()->Float32LessThan(), c0, p0); in TEST_F()
555 graph()->NewNode(common()->Select(MachineRepresentation::kFloat32), check, in TEST_F()
556 p0, graph()->NewNode(machine()->Float32Sub(), c0, p0)); in TEST_F()
566 Node* check = graph()->NewNode(machine()->Float64LessThan(), c0, p0); in TEST_F()
568 graph()->NewNode(common()->Select(MachineRepresentation::kFloat64), check, in TEST_F()
569 p0, graph()->NewNode(machine()->Float64Sub(), c0, p0)); in TEST_F()
579 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1); in TEST_F()
580 Node* select = graph()->NewNode( in TEST_F()
591 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1); in TEST_F()
592 Node* select = graph()->NewNode( in TEST_F()
603 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1); in TEST_F()
604 Node* select = graph()->NewNode( in TEST_F()
615 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1); in TEST_F()
616 Node* select = graph()->NewNode( in TEST_F()