Lines Matching refs:from
110 // Control nodes that were not control-reachable from end may float.
126 // We only update control nodes from {kUnknown} to {kFixed}. Ideally, we
171 DCHECK_EQ(node, edge.from());
186 void Scheduler::IncrementUnscheduledUseCount(Node* node, Node* from) {
200 node->op()->mnemonic(), from->id(), from->op()->mnemonic(),
205 void Scheduler::DecrementUnscheduledUseCount(Node* node, Node* from) {
220 node->op()->mnemonic(), from->id(), from->op()->mnemonic(),
234 // between them within a Schedule) from the node graph. Visits control edges of
235 // the graph backwards from an end node in order to find the connected control
251 // backwards from end through control edges, building and connecting the
848 // Otherwise, compute the loop information from the backedges in order
871 // Process additional outgoing edges from the loop header.
992 // Computes loop membership from the backedges of the control flow graph.
1004 // Compute loop membership starting from backedges.
1215 // Then, walk from bus stop to bus stop until we either find a bus (i.e. an
1302 // Build the block dominator tree resulting from the above seed.
1364 DCHECK_EQ(node, edge.from());
1420 // Visits one node from the queue and propagates its current schedule early
1552 // Visits one node from the queue of schedulable nodes and determines its
1642 if (!scheduler_->IsLive(edge.from())) continue;
1670 // If the (common dominator) {block} is marked, we know that all paths from
1685 if (!scheduler_->IsLive(edge.from())) continue;
1718 // can't hoist operations from this {block} out of the loop, as
1735 if (!scheduler_->IsLive(edge.from())) continue;
1751 // TODO(titzer): ignore uses from dead nodes (not visited in PrepareUses()).
1753 Node* use = edge.from();
1755 // If the use is from a coupled (i.e. floating) phi, compute the common
1764 // If the use is from a fixed (i.e. non-floating) phi, we use the
1775 // If the use is from a fixed (i.e. non-floating) merge, we use the
1954 void Scheduler::MovePlannedNodes(BasicBlock* from, BasicBlock* to) {
1955 TRACE("Move planned nodes from id:%d to id:%d\n", from->id().ToInt(),
1957 NodeVector* from_nodes = scheduled_nodes_[from->id().ToSize()];
1968 std::swap(scheduled_nodes_[from->id().ToSize()],