Lines Matching defs:graph
45 // 1.) PROPAGATE: Traverse the graph from the end, pushing usage information
295 count_(jsgraph->graph()->NodeCount()),
320 typing_stack_.push({graph()->end(), 0});
321 GetInfo(graph()->end())->set_pushed();
598 EnqueueInitial(jsgraph_->graph()->end());
1136 2, jsgraph_->graph()->NewNode(jsgraph_->common()->TypedStateValues(
1254 Graph* graph() const { return jsgraph_->graph(); }
2877 0, jsgraph_->graph()->NewNode(
3243 graph
3253 ZoneQueue<Node*> queue_; // queue for traversing the graph
3259 ZoneStack<NodeState> typing_stack_; // stack for graph typing.
3309 Node* check0 = graph()->NewNode(simplified()->ObjectIsSmi(), value);
3311 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control);
3313 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
3317 vtrue0 = graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), value);
3318 vtrue0 = graph()->NewNode(machine()->ChangeInt32ToFloat64(), vtrue0);
3321 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
3336 vfalse0 = efalse0 = if_false0 = graph()->NewNode(
3345 if_false0 = graph()->NewNode(common()->IfSuccess(), vfalse0);
3348 Node* check1 = graph()->NewNode(simplified()->ObjectIsSmi(), vfalse0);
3349 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0);
3351 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3356 graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), vfalse0);
3357 vtrue1 = graph()->NewNode(machine()->ChangeInt32ToFloat64(), vtrue1);
3360 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3364 vfalse1 = efalse1 = graph()->NewNode(
3369 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
3371 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
3373 graph()->NewNode(common()->Phi(MachineRepresentation::kFloat64, 2),
3377 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
3378 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
3379 value = graph()->NewNode(common()->Phi(MachineRepresentation::kFloat64, 2),
3411 Node* check0 = graph()->NewNode(simplified()->ObjectIsSmi(), value);
3413 graph()->NewNode(common()->Branch(BranchHint::kTrue), check0, control);
3415 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
3418 graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), value);
3420 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
3435 vfalse0 = efalse0 = if_false0 = graph()->NewNode(
3444 if_false0 = graph()->NewNode(common()->IfSuccess(), vfalse0);
3447 Node* check1 = graph()->NewNode(simplified()->ObjectIsSmi(), vfalse0);
3448 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0);
3450 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3453 graph()->NewNode(simplified()->ChangeTaggedSignedToInt32(), vfalse0);
3455 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3459 vfalse1 = efalse1 = graph()->NewNode(
3462 vfalse1 = graph()->NewNode(machine()->TruncateFloat64ToWord32(), vfalse1);
3465 if_false0 = graph()->NewNode(common()->Merge(2), if_true1, if_false1);
3467 graph()->NewNode(common()->EffectPhi(2), etrue1, efalse1, if_false0);
3468 vfalse0 = graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2),
3472 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0);
3473 effect = graph()->NewNode(common()->EffectPhi(2), etrue0, efalse0, control);
3474 value = graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2),
3501 Node* result = graph()->NewNode(machine()->Float64RoundUp().placeholder(),
3503 return graph()->NewNode(
3505 graph()->NewNode(
3507 graph()->NewNode(machine()->Float64Sub(), result, one_half), input),
3508 result, graph()->NewNode(machine()->Float64Sub(), result, one));
3518 return graph()->NewNode(
3520 graph()->NewNode(machine()->Float64LessThan(), input, zero), minus_one,
3521 graph()->NewNode(
3523 graph()->NewNode(machine()->Float64LessThan(), zero, input), one,
3535 Node* sign = graph()->NewNode(machine()->Word32Sar(), input,
3537 return graph()->NewNode(machine()->Int32Sub(),
3538 graph()->NewNode(machine()->Word32Xor(), input, sign),
3550 return graph()->NewNode(machine()->Int32Sub(), zero, lhs);
3554 return graph()->NewNode(machine()->Int32Div(), lhs, rhs, graph()->start());
3575 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
3576 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0,
3577 graph()->start());
3579 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
3580 Node* true0 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true0);
3582 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
3585 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one);
3586 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0);
3588 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3589 Node* true1 = graph()->NewNode(machine()->Int32Div(), lhs, rhs, if_true1);
3591 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3594 Node* check2 = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
3595 Node* branch2 = graph()->NewNode(common()->Branch(), check2, if_false1);
3597 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
3600 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2);
3601 Node* false2 = graph()->NewNode(machine()->Int32Sub(), zero, lhs);
3603 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2);
3604 false1 = graph()->NewNode(phi_op, true2, false2, if_false1);
3607 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1);
3608 false0 = graph()->NewNode(phi_op, true1, false1, if_false0);
3611 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0);
3612 return graph()->NewNode(phi_op, true0, false0, merge0);
3625 return graph()->NewNode(machine()->Int32Mod(), lhs, rhs, graph()->start());
3652 Node* check0 = graph()->NewNode(machine()->Int32LessThan(), zero, rhs);
3653 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kTrue), check0,
3654 graph()->start());
3656 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
3659 Node* msk = graph()->NewNode(machine()->Int32Add(), rhs, minus_one);
3661 Node* check1 = graph
3662 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_true0);
3664 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3665 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
3667 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3670 Node* check2 = graph()->NewNode(machine()->Int32LessThan(), lhs, zero);
3671 Node* branch2 = graph()->NewNode(common()->Branch(BranchHint::kFalse),
3674 Node* if_true2 = graph()->NewNode(common()->IfTrue(), branch2);
3675 Node* true2 = graph()->NewNode(
3677 graph()->NewNode(machine()->Word32And(),
3678 graph()->NewNode(machine()->Int32Sub(), zero, lhs),
3681 Node* if_false2 = graph()->NewNode(common()->IfFalse(), branch2);
3682 Node* false2 = graph()->NewNode(machine()->Word32And(), lhs, msk);
3684 if_false1 = graph()->NewNode(merge_op, if_true2, if_false2);
3685 false1 = graph()->NewNode(phi_op, true2, false2, if_false1);
3688 if_true0 = graph()->NewNode(merge_op, if_true1, if_false1);
3689 true0 = graph()->NewNode(phi_op, true1, false1, if_true0);
3692 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
3695 Node* check1 = graph()->NewNode(machine()->Int32LessThan(), rhs, minus_one);
3696 Node* branch1 = graph()->NewNode(common()->Branch(BranchHint::kTrue),
3699 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3700 Node* true1 = graph()->NewNode(machine()->Int32Mod(), lhs, rhs, if_true1);
3702 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3705 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1);
3706 false0 = graph()->NewNode(phi_op, true1, false1, if_false0);
3709 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0);
3710 return graph()->NewNode(phi_op, true0, false0, merge0);
3720 return graph()->NewNode(
3722 graph()->NewNode(machine()->Int32LessThan(), input, zero), minus_one,
3723 graph()->NewNode(
3725 graph()->NewNode(machine()->Int32LessThan(), zero, input), one,
3738 return graph()->NewNode(machine()->Uint32Div(), lhs, rhs, graph()->start());
3741 Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
3742 Diamond d(graph(), common(), check, BranchHint::kFalse);
3743 Node* div = graph()->NewNode(machine()->Uint32Div(), lhs, rhs, d.if_false);
3757 return graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, graph()->start());
3778 Node* check0 = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
3779 Node* branch0 = graph()->NewNode(common()->Branch(BranchHint::kFalse), check0,
3780 graph()->start());
3782 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
3785 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
3788 Node* msk = graph()->NewNode(machine()->Int32Add(), rhs, minus_one);
3790 Node* check1 = graph()->NewNode(machine()->Word32And(), rhs, msk);
3791 Node* branch1 = graph()->NewNode(common()->Branch(), check1, if_false0);
3793 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
3794 Node* true1 = graph()->NewNode(machine()->Uint32Mod(), lhs, rhs, if_true1);
3796 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1);
3797 Node* false1 = graph()->NewNode(machine()->Word32And(), lhs, msk);
3799 if_false0 = graph()->NewNode(merge_op, if_true1, if_false1);
3800 false0 = graph()->NewNode(phi_op, true1, false1, if_false0);
3803 Node* merge0 = graph()->NewNode(merge_op, if_true0, if_false0);
3804 return graph()->NewNode(phi_op, true0, false0, merge0);
3812 node->ReplaceInput(0, graph()->NewNode(op, lhs, rhs));
3814 node->AppendInput(graph()->zone(), lhs);
3823 node->InsertInput(graph()->zone(), 0, graph()->NewNode(op, lhs, rhs));
3833 node->ReplaceInput(1, graph()->NewNode(machine()->Word32And(), rhs,
3844 node->ReplaceInput(0, graph()->NewNode(op, input, zero));
3845 node->AppendInput(graph()->zone(), zero);
3852 node->ReplaceInput(0, graph()->NewNode(machine()->Float64Equal(), input,
3854 node->AppendInput(graph()->zone(), jsgraph()->Int32Constant(0));
3862 node->AppendInput(graph()->zone(),
3863 graph()->NewNode(machine()->Float64Abs(), input));
3873 0, graph()->NewNode(machine()->Float64LessThan(), min, input));
3875 graph()->zone(),
3876 graph()->NewNode(
3878 graph()->NewNode(machine()->Float64LessThan(), input, max), input,
3880 node->AppendInput(graph()->zone(), min);
3891 0, graph()->NewNode(
3893 graph()->NewNode(machine()->Float64LessThan(), min, input),
3894 graph()->NewNode(
3896 graph()->NewNode(machine()->Float64LessThan(), input, max),
3909 0, graph()->NewNode(machine()->Int32LessThanOrEqual(), input, max));
3911 graph()->zone(),
3912 graph()->NewNode(common()->Select(MachineRepresentation::kWord32),
3913 graph()->NewNode(machine()->Int32LessThan(), input, min),
3915 node->AppendInput(graph()->zone(), max);
3925 0, graph()->NewNode(machine()->Uint32LessThanOrEqual(), input, max));
3926 node->AppendInput(graph()->zone(), input);
3927 node->AppendInput(graph()->zone(), max);
3963 Linkage::GetStubCallDescriptor(graph()->zone(), callable.descriptor(),
3976 Linkage::GetStubCallDescriptor(graph()->zone(), callable.descriptor(),
3988 Linkage::GetStubCallDescriptor(graph()->zone(), callable.descriptor(),
