Lines Matching defs:graph

10 #include "src/compiler/js-graph.h"
196 // Constructs a GraphAssembler. If {schedule} is not null, the graph assembler
419 // Add an inline reducers such that nodes added to the graph will be run
439 Graph* graph() const { return mcgraph_->graph(); }
452 // The internal scope is only here to increment the graph assembler's
531 // subgraph created by the graph assembler changes.
535 // added to the graph with the graph assembler.
579 AddNode(graph()->NewNode(common()->LoopExit(), control(),
581 AddNode(graph()->NewNode(common()->LoopExitEffect(), effect(), control()));
583 var_array[i] = AddNode(graph()->NewNode(
593 graph()->NewNode(common()->Loop(2), control(), control());
594 label->effect_ = graph()->NewNode(common()->EffectPhi(2), effect(),
596 Node* terminate = graph()->NewNode(common()->Terminate(), label->effect_,
598 NodeProperties::MergeControlToEnd(graph(), common(), terminate);
601 graph()->NewNode(common()->Phi(label->representations_[i], 2),
627 graph()->NewNode(common()->Merge(2), label->control_, control());
628 label->effect_ = graph()->NewNode(common()->EffectPhi(2), label->effect_,
631 label->bindings_[i] = graph()->NewNode(
638 label->control_->AppendInput(graph()->zone(), control());
644 label->effect_->AppendInput(graph()->zone(), label->control_);
651 label->bindings_[i]->AppendInput(graph()->zone(), label->control_);
659 old_type, NodeProperties::GetType(var_array[i]), graph()->zone());
689 control_ = AddNode(graph()->NewNode(common()->Merge(1), control()));
721 Node* branch = graph()->NewNode(common()->Branch(hint), condition, control());
723 control_ = graph()->NewNode(common()->IfTrue(), branch);
726 control_ = graph()->NewNode(common()->IfFalse(), branch);
748 Node* branch = graph()->NewNode(common()->Branch(hint), condition, control());
750 control_ = graph()->NewNode(common()->IfTrue(), branch);
753 control_ = AddNode(graph()->NewNode(common()->IfFalse(), branch));
760 Node* branch = graph()->NewNode(common()->Branch(hint), condition, control());
762 control_ = graph()->NewNode(common()->IfFalse(), branch);
765 control_ = AddNode(graph()->NewNode(common()->IfTrue(), branch));
803 // Constructs a JSGraphAssembler. If {schedule} is not null, the graph