Searched refs:DFS (Results 1 - 2 of 2) sorted by relevance

/openjdk10/hotspot/src/share/vm/opto/
H A Ddomgraph.cpp42 Tarjan *_parent; // Parent in DFS
84 // We can re-run the above DFS pass with the correct number of blocks,
98 for (uint i = number_of_blocks(); i >= 2; i--) { // For all vertices in DFS order
99 Tarjan *w = &tarjan[i]; // Get vertex from DFS
176 t->_semi = pre_order; // Block to DFS map
177 t->_label = t; // DFS to vertex map
185 // Save parent (current top block on stack) in DFS
254 // Perform DFS search. Setup 'vertex' as DFS to vertex mapping. Setup
255 // 'semi' as vertex to DFS mappin
[all...]
/openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java1477 // Start DFS and reverse back edges
1481 DFS(node);
1604 private void DFS(LayoutNode startNode) { method in class:HierarchicalLayoutManager.ReverseEdges

Completed in 45 milliseconds