- Sort Score
- Result 10 results
- Languages All
Results 1 - 2 of 2 for loopnestfor (0.17 sec)
-
src/cmd/compile/internal/ssa/likelyadjust.go
func (l *loop) nearestOuterLoop(sdom SparseTree, b *Block) *loop { var o *loop for o = l.outer; o != nil && !sdom.IsAncestorEq(o.header, b); o = o.outer { } return o } func loopnestfor(f *Func) *loopnest { po := f.postorder() sdom := f.Sdom() b2l := make([]*loop, f.NumBlocks()) loops := make([]*loop, 0) visited := f.Cache.allocBoolSlice(f.NumBlocks()) defer f.Cache.freeBoolSlice(visited)
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/ssa/func.go
} return f.cachedSdom } // loopnest returns the loop nest information for f. func (f *Func) loopnest() *loopnest { if f.cachedLoopnest == nil { f.cachedLoopnest = loopnestfor(f) } return f.cachedLoopnest } // invalidateCFG tells f that its CFG has changed. func (f *Func) invalidateCFG() { f.cachedPostorder = nil f.cachedIdom = nil f.cachedSdom = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0)