- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for newSparseOrderedTree (0.14 sec)
-
src/cmd/compile/internal/ssa/sparsetree.go
} } t.numberBlock(f.Entry, 1) return t } // newSparseOrderedTree creates a SparseTree from a block-to-parent map (array indexed by Block.ID) // children will appear in the reverse of their order in reverseOrder // in particular, if reverseOrder is a dfs-reversePostOrder, then the root-to-children // walk of the tree will yield a pre-order. func newSparseOrderedTree(f *Func, parentOf, reverseOrder []*Block) SparseTree {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 8.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
// The ordering in the dominator tree matters; it's important that // the walk of the dominator tree also be a preorder (i.e., a node is // visited only after all its non-backedge predecessors have been visited). sdom := newSparseOrderedTree(f, idom, po) if f.pass.debug > 1 { fmt.Printf("before %s = %s\n", f.Name, sdom.treestructure(f.Entry)) } tofixBackedges := []edgeMem{}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0)