Lines Matching defs:edge
170 for (Edge const edge : node->input_edges()) {
171 DCHECK_EQ(node, edge.from());
172 if (edge.index() != coupled_control_edge) {
173 DecrementUnscheduledUseCount(edge.to(), node);
886 // Use the next outgoing edge if there are any.
1362 for (auto edge : node->input_edges()) {
1363 Node* to = edge.to();
1364 DCHECK_EQ(node, edge.from());
1371 if (!is_scheduled && edge.index() != coupled_control_edge) {
1641 for (Edge edge : node->use_edges()) {
1642 if (!scheduler_->IsLive(edge.from())) continue;
1643 BasicBlock* use_block = GetBlockForUse(edge);
1684 for (Edge edge : node->use_edges()) {
1685 if (!scheduler_->IsLive(edge.from())) continue;
1686 BasicBlock* use_block = GetBlockForUse(edge);
1707 edge.UpdateTo(use_node);
1734 for (Edge edge : node->use_edges()) {
1735 if (!scheduler_->IsLive(edge.from())) continue;
1736 BasicBlock* use_block = GetBlockForUse(edge);
1750 BasicBlock* GetBlockForUse(Edge edge) {
1753 Node* use = edge.from();
1761 // DCHECK_EQ(edge.to(), NodeProperties::GetControlInput(use));
1767 TRACE(" input@%d into a fixed phi #%d:%s\n", edge.index(), use->id(),
1771 Node* input = NodeProperties::GetControlInput(merge, edge.index());
1778 TRACE(" input@%d into a fixed merge #%d:%s\n", edge.index(), use->id(),
1780 return FindPredecessorBlock(edge.to());