- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for defForUses (0.1 sec)
-
src/cmd/compile/internal/ssa/loopreschedchecks.go
// own trivial phi functions in their own dominance frontier, and this is handled recursively. func addDFphis(x *Value, h, b *Block, f *Func, defForUses []*Value, newphis map[*Block]rewrite, sdom SparseTree) { oldv := defForUses[b.ID] if oldv != x { // either a new definition replacing x, or nil if it is proven that there are no uses reachable from b return } idom := f.Idom() outer:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0)