- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for children (6.88 sec)
-
src/cmd/compile/internal/ssa/poset.go
po.flags &^= posetFlagUnsigned } } // Handle children func (po *poset) setchl(i uint32, l posetEdge) { po.nodes[i].l = l } func (po *poset) setchr(i uint32, r posetEdge) { po.nodes[i].r = r } func (po *poset) chl(i uint32) uint32 { return po.nodes[i].l.Target() } func (po *poset) chr(i uint32) uint32 { return po.nodes[i].r.Target() } func (po *poset) children(i uint32) (posetEdge, posetEdge) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/likelyadjust.go
} // assembleChildren initializes the children field of each // loop in the nest. Loop A is a child of loop B if A is // directly nested within B (based on the reducible-loops // detection above) func (ln *loopnest) assembleChildren() { if ln.initializedChildren { return } for _, l := range ln.loops { if l.outer != nil { l.outer.children = append(l.outer.children, l) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0) -
src/cmd/compile/internal/ir/visit.go
// if ... should visit children ... { // ir.DoChildren(x, do) // ... processing AFTER visiting children ... // } // if ... should stop parent DoChildren call from visiting siblings ... { // return true // } // return false // } // do(root) // // Since DoChildren does not return true itself, if the do function // never wants to stop the traversal, it can assume that DoChildren
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 23 14:29:16 UTC 2023 - 6K bytes - Viewed (0) -
src/cmd/compile/internal/types2/scope.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 20:08:23 UTC 2024 - 9.8K bytes - Viewed (0) -
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/dwarfgen/dwinl.go
callIdx = len(dwcalls.Calls) - 1 imap[inlIdx] = callIdx if parCallIdx != -1 { // Add this inline to parent's child list dwcalls.Calls[parCallIdx].Children = append(dwcalls.Calls[parCallIdx].Children, callIdx) } return callIdx } // Given a src.XPos, return its associated inlining index if it // corresponds to something created as a result of an inline, or -1 if
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:45:07 UTC 2024 - 12.8K bytes - Viewed (0) -
src/cmd/go/internal/fsys/fsys.go
} type node struct { actualFilePath string // empty if a directory children map[string]*node // path element → file or directory } func (n *node) isDir() bool { return n.actualFilePath == "" && n.children != nil } func (n *node) isDeleted() bool { return n.actualFilePath == "" && n.children == nil } // TODO(matloob): encapsulate these in an io/fs-like interface
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:35:34 UTC 2024 - 22.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/lca.go
sibling ID // next child of parent pos int32 // an index in the Euler tour where this block appears (any one of its occurrences) depth int32 // depth in dominator tree (root=0, its children=1, etc.) } func makeLCArange(f *Func) *lcaRange { dom := f.Idom() // Build tree blocks := make([]lcaRangeBlock, f.NumBlocks()) for _, b := range f.Blocks { blocks[b.ID].b = b
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 30 21:52:15 UTC 2023 - 3.8K bytes - Viewed (0) -
src/cmd/compile/internal/syntax/walk.go
package syntax import "fmt" // Inspect traverses an AST in pre-order: it starts by calling f(root); // root must not be nil. If f returns true, Inspect invokes f recursively // for each of the non-nil children of root, followed by a call of f(nil). // // See Walk for caveats about shared nodes. func Inspect(root Node, f func(Node) bool) { Walk(root, inspector(f)) } type inspector func(Node) bool
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 17 19:55:04 UTC 2023 - 5.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
// properties of the dominator tree idom []*ssa.Block // dominator parents tree []domBlock // dominator child+sibling level []int32 // level in dominator tree (0 = root or unreachable, 1 = children of root, ...) // scratch locations priq blockHeap // priority queue of blocks, higher level (toward leaves) = higher priority q []*ssa.Block // inner loop queue queued *sparseSet // has been put in q
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0)