Lines Matching full:nodes

27 STATISTIC(TotalFineGrainedNodes, "Number of fine-grained nodes created.");
28 STATISTIC(TotalPiBlockNodes, "Number of pi-block nodes created.");
30 "Number of confused memory dependencies between two nodes.");
71 // root node and N (if N is not yet visited). All the nodes reachable from N in createAndConnectRootNode()
72 // are marked as visited and are skipped in the DFS of subsequent nodes. in createAndConnectRootNode()
77 // root node is added to both nodes if B is visited before A. While it does in createAndConnectRootNode()
99 // the nodes in that SCC. in createPiBlocks()
100 // 2. Identify incoming edges incident to the nodes inside of the SCC and in createPiBlocks()
102 // 3. Identify outgoing edges from the nodes inside of the SCC to nodes in createPiBlocks()
106 // Adding nodes as we iterate through the SCCs cause the SCC in createPiBlocks()
108 // collect a list of nodes that are part of an SCC, and then iterate over in createPiBlocks()
109 // those lists to create the pi-block nodes. Each element of the list is a in createPiBlocks()
110 // list of nodes in an SCC. Note: trivial SCCs containing a single node are in createPiBlocks()
120 << " nodes in it.\n"); in createPiBlocks()
122 // SCC iterator may put the nodes in an order that's different from the in createPiBlocks()
124 // nodes based on ordinal numbers computed earlier. in createPiBlocks()
136 // We have the set of nodes in the SCC. We go through the set of nodes in createPiBlocks()
140 // Skip the SCC node and all the nodes inside of it. in createPiBlocks()
151 // are more than one edges from an outside node to inside nodes, we only in createPiBlocks()
153 // there are more than one edges from inside nodes to an outside node, in createPiBlocks()
369 // unique edge that we can create between these two nodes, so we in createMemoryDependencyEdges()
383 // This algorithm works by first collecting a set of candidate nodes that have in simplify()
390 // A mapping between nodes and their in-degree. To save space, this map in simplify()
391 // only contains nodes that are targets of nodes in the CandidateSourceNodes. in simplify()
436 // As nodes get merged, we need to skip any node that has been removed from in simplify()
500 size_t OldSize = Graph.Nodes.size(); in sortNodesTopologically()
501 Graph.Nodes.clear(); in sortNodesTopologically()
502 append_range(Graph.Nodes, reverse(NodesInPO)); in sortNodesTopologically()
503 if (Graph.Nodes.size() != OldSize) in sortNodesTopologically()
505 "Expected the number of nodes to stay the same after the sort"); in sortNodesTopologically()