Lines Matching refs:Node
13 #include "test/unittests/compiler/node-test-utils.h"
29 AdvancedReducer::Editor* editor, Node* node,
34 return reducer.Reduce(node);
37 Reduction Reduce(Node* node, MachineOperatorBuilder::Flags flags =
40 return Reduce(&editor, node, flags);
76 Node* const control = graph()->start();
77 Node* const branch =
79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
80 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
93 Node* const control = graph()->start();
94 Node* const branch =
96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
97 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
110 Node* const control = graph()->start();
111 Node* const branch =
113 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
114 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
127 Node* const control = graph()->start();
128 Node* const branch =
130 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
131 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
144 Node* const control = graph()->start();
145 Node* const branch =
147 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
148 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
161 Node* const control = graph()->start();
162 Node* const branch =
164 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
165 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
177 Node* const value = Parameter(0);
179 Node* const control = graph()->start();
180 Node* const branch = graph()->NewNode(
183 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
184 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
201 Node* const value = Parameter(0);
202 Node* const control = graph()->start();
203 Node* const branch = graph()->NewNode(common()->Branch(), value, control);
204 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
205 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
215 Node* const value = Parameter(0);
216 Node* const control = graph()->start();
217 Node* const branch = graph()->NewNode(common()->Branch(), value, control);
218 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch);
219 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch);
234 Node* inputs[kMaxInputs];
235 Node* const input = graph()->NewNode(&kOp0);
241 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
259 Node* const e0 = graph()->NewNode(&kOp0);
260 Node* const loop =
263 Node* const ephi = graph()->NewNode(common()->EffectPhi(2), e0, e0, loop);
279 Node* inputs[kMaxInputs];
280 Node* const input = graph()->NewNode(&kOp0);
287 Node* const merge = graph()->NewNode(common()->Merge(value_input_count),
306 Node* const p0 = Parameter(0);
307 Node* const loop =
310 Node* const phi = graph()->NewNode(
322 Node* p0 = Parameter(0);
323 Node* c0 = Float32Constant(0.0);
324 Node* check = graph()->NewNode(machine()->Float32LessThan(), c0, p0);
325 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
326 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
327 Node* vtrue = p0;
328 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
329 Node* vfalse = graph()->NewNode(machine()->Float32Sub(), c0, p0);
330 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
331 Node* phi = graph()->NewNode(
342 Node* p0 = Parameter(0);
343 Node* c0 = Float64Constant(0.0);
344 Node* check = graph()->NewNode(machine()->Float64LessThan(), c0, p0);
345 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
346 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
347 Node* vtrue = p0;
348 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
349 Node* vfalse = graph()->NewNode(machine()->Float64Sub(), c0, p0);
350 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
351 Node* phi = graph()->NewNode(
362 Node* p0 = Parameter(0);
363 Node* p1 = Parameter(1);
364 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1);
365 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
366 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
367 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
368 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
369 Node* phi = graph()->NewNode(
380 Node* p0 = Parameter(0);
381 Node* p1 = Parameter(1);
382 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1);
383 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
384 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
385 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
386 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
387 Node* phi = graph()->NewNode(
398 Node* p0 = Parameter(0);
399 Node* p1 = Parameter(1);
400 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1);
401 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
402 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
403 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
404 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
405 Node* phi = graph()->NewNode(
416 Node* p0 = Parameter(0);
417 Node* p1 = Parameter(1);
418 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1);
419 Node* branch = graph()->NewNode(common()->Branch(), check, graph()->start());
420 Node
421 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
422 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
423 Node* phi = graph()->NewNode(
438 Node* cond = Parameter(2);
439 Node* branch = graph()->NewNode(common()->Branch(), cond, graph()->start());
440 Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
441 Node* etrue = graph()->start();
442 Node* vtrue = Parameter(0);
443 Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
444 Node* efalse = graph()->start();
445 Node* vfalse = Parameter(1);
446 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
447 Node* ephi = graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge);
448 Node* phi = graph()->NewNode(common()->Phi(MachineRepresentation::kTagged, 2),
450 Node* ret = graph()->NewNode(common()->Return(), phi, ephi, merge);
467 Node* const input = graph()->NewNode(&kOp0);
480 Node* p0 = Parameter(0);
481 Node* p1 = Parameter(1);
482 Node* select =
492 Node* p0 = Parameter(0);
493 Node* p1 = Parameter(1);
494 Node* select =
504 Node* p0 = Parameter(0);
505 Node* p1 = Parameter(1);
506 Node* select =
516 Node* p0 = Parameter(0);
517 Node* p1 = Parameter(1);
518 Node* select =
528 Node* p0 = Parameter(0);
529 Node* p1 = Parameter(1);
530 Node* select =
540 Node* p0 = Parameter(0);
541 Node* p1 = Parameter(1);
542 Node* select = graph()->NewNode(
551 Node* p0 = Parameter(0);
552 Node* c0 = Float32Constant(0.0);
553 Node* check = graph()->NewNode(machine()->Float32LessThan(), c0, p0);
554 Node* select =
564 Node* p0 = Parameter(0);
565 Node* c0 = Float64Constant(0.0);
566 Node* check = graph()->NewNode(machine()->Float64LessThan(), c0, p0);
567 Node* select =
577 Node* p0 = Parameter(0);
578 Node* p1 = Parameter(1);
579 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1);
580 Node* select = graph()->NewNode(
589 Node* p0 = Parameter(0);
590 Node* p1 = Parameter(1);
591 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1);
592 Node* select = graph()->NewNode(
601 Node* p0 = Parameter(0);
602 Node* p1 = Parameter(1);
603 Node* check = graph()->NewNode(machine()->Float32LessThan(), p0, p1);
604 Node* select = graph()->NewNode(
613 Node* p0 = Parameter(0);
614 Node* p1 = Parameter(1);
615 Node* check = graph()->NewNode(machine()->Float64LessThan(), p0, p1);
616 Node* select = graph()->NewNode(
