- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for NumValues (0.41 sec)
-
src/cmd/compile/internal/ssa/stackalloc.go
// the slot we used via an index into locations[v.Type]. slots := f.Cache.allocIntSlice(f.NumValues()) defer f.Cache.freeIntSlice(slots) for i := range slots { slots[i] = -1 } // Pick a stack slot for each value needing one. used := f.Cache.allocBoolSlice(f.NumValues()) defer f.Cache.freeBoolSlice(used) for _, b := range f.Blocks { for _, v := range b.Values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
func dse(f *Func) { var stores []*Value loadUse := f.newSparseSet(f.NumValues()) defer f.retSparseSet(loadUse) storeUse := f.newSparseSet(f.NumValues()) defer f.retSparseSet(storeUse) shadowed := f.newSparseMap(f.NumValues()) defer f.retSparseMap(shadowed)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
func schedule(f *Func) { // reusable priority queue priq := new(ValHeap) // "priority" for a value score := f.Cache.allocInt8Slice(f.NumValues()) defer f.Cache.freeInt8Slice(score) // maps mem values to the next live memory value nextMem := f.Cache.allocValueSlice(f.NumValues()) defer f.Cache.freeValueSlice(nextMem) // inBlockUses records whether a value is used in the block
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/vendor/github.com/google/pprof/internal/report/report.go
for k, vs := range s.NumLabel { if k == "bytes" { unit := o.NumLabelUnits[k] numValues := make([]int64, len(vs)) numUnit := make([]string, len(vs)) for i, v := range vs { numValues[i] = v numUnit[i] = unit } numLabels[k] = append(numLabels[k], numValues...) numUnits[k] = append(numUnits[k], numUnit...) } } s.NumLabel = numLabels
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 37.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/check.go
"cmd/internal/obj/s390x" "math" "math/bits" ) // checkFunc checks invariants of f. func checkFunc(f *Func) { blockMark := make([]bool, f.NumBlocks()) valueMark := make([]bool, f.NumValues()) for _, b := range f.Blocks { if blockMark[b.ID] { f.Fatalf("block %s appears twice in %s!", b, f.Name) } blockMark[b.ID] = true if b.Func != f {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 16:41:23 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/encode.go
labels[key] = append(labels[key], value) } else if l.numX != 0 || l.unitX != 0 { numValues := numLabels[key] units := numUnits[key] if l.unitX != 0 { var unit string unit, err = getString(p.stringTable, &l.unitX, err) units = padStringArray(units, len(numValues)) numUnits[key] = append(units, unit) } numLabels[key] = append(numLabels[key], l.numX) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 17.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
if !f.Config.unalignedOK { return } memcombineLoads(f) memcombineStores(f) } func memcombineLoads(f *Func) { // Find "OR trees" to start with. mark := f.newSparseSet(f.NumValues()) defer f.retSparseSet(mark) var order []*Value // Mark all values that are the argument of an OR. for _, b := range f.Blocks { for _, v := range b.Values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/func.go
} } // NumBlocks returns an integer larger than the id of any Block in the Func. func (f *Func) NumBlocks() int { return f.bid.num() } // NumValues returns an integer larger than the id of any Value in the Func. func (f *Func) NumValues() int { return f.vid.num() } // NameABI returns the function name followed by comma and the ABI number.
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/debug.go
b[i] = BlockDebug{} } } // A list of slots per Value. Reuse the previous child slices. if cap(state.valueNames) < f.NumValues() { old := state.valueNames state.valueNames = make([][]SlotID, f.NumValues()) copy(state.valueNames, old) } vn := state.valueNames[:f.NumValues()] for i := range vn { vn[i] = vn[i][:0] } // Slot and register contents for currentState. Cleared by reset().
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
func (lv *liveness) markUnsafePoints() { if IsUnsafe(lv.f) { // No complex analysis necessary. lv.allUnsafe = true return } lv.unsafePoints = bitvec.New(int32(lv.f.NumValues())) lv.unsafeBlocks = bitvec.New(int32(lv.f.NumBlocks())) // Mark architecture-specific unsafe points. for _, b := range lv.f.Blocks { for _, v := range b.Values { if v.Op.UnsafePoint() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0)