- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for succstorage (0.19 sec)
-
src/cmd/compile/internal/ssa/func.go
if f.freeBlocks != nil { b = f.freeBlocks f.freeBlocks = b.succstorage[0].b b.succstorage[0].b = nil } else { ID := f.bid.get() if int(ID) < len(f.Cache.blocks) { b = &f.Cache.blocks[ID] b.ID = ID } else { b = &Block{ID: ID} } } b.Kind = kind b.Func = f b.Preds = b.predstorage[:0] b.Succs = b.succstorage[:0] b.Values = b.valstorage[:0] f.Blocks = append(f.Blocks, b)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 25.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
// After the scheduling pass, this list is ordered. Values []*Value // The containing function Func *Func // Storage for Succs, Preds and Values. succstorage [2]Edge predstorage [4]Edge valstorage [9]*Value } // Edge represents a CFG edge. // Example edges for b branching to either c or d. // (c and d have other predecessors.) // // b.Succs = [{c,3}, {d,1}]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
} } } for _, c := range b.ControlValues() { if !valueMark[c.ID] { f.Fatalf("control value for %s is missing: %v", b, c) } } } for b := f.freeBlocks; b != nil; b = b.succstorage[0].b { if blockMark[b.ID] { f.Fatalf("used block b%d in free list", b.ID) } } for v := f.freeValues; v != nil; v = v.argstorage[0] { if valueMark[v.ID] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0)