- Sort Score
- Result 10 results
- Languages All
Results 1 - 3 of 3 for storeNumber (0.53 sec)
-
src/cmd/compile/internal/ssa/schedule.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/nilcheck.go
} } } } } // allocate auxiliary date structures for computing store order sset := f.newSparseSet(f.NumValues()) defer f.retSparseSet(sset) storeNumber := f.Cache.allocInt32Slice(f.NumValues()) defer f.Cache.freeInt32Slice(storeNumber) // perform a depth first walk of the dominee tree for len(work) > 0 { node := work[len(work)-1] work = work[:len(work)-1] switch node.op { case Work:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 11.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
defer f.retSparseSet(sset) sset2 = f.newSparseSet(f.NumValues()) defer f.retSparseSet(sset2) storeNumber = f.Cache.allocInt32Slice(f.NumValues()) defer f.Cache.freeInt32Slice(storeNumber) } // order values in store order b.Values = storeOrder(b.Values, sset, storeNumber) again: // find the start and end of the last contiguous WB store sequence.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0)