- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 394 for value2 (0.64 sec)
-
src/cmd/vendor/github.com/google/pprof/profile/legacy_java_profile.go
if s.Value[0] == 0 { return nil, nil, fmt.Errorf("parsing sample %s: second value must be non-zero", line) } s.NumLabel = map[string][]int64{"bytes": {s.Value[1] / s.Value[0]}} s.Value[0], s.Value[1] = scaleHeapSample(s.Value[0], s.Value[1], javaHeapzSamplingRate) case "contention": if period := p.Period; period != 0 { s.Value[0] = s.Value[0] * p.Period
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 8.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
func storeOrder(values []*Value, sset *sparseSet, storeNumber []int32) []*Value { if len(values) == 0 { return values } f := values[0].Block.Func // find all stores // Members of values that are store values. // A constant bound allows this to be stack-allocated. 64 is // enough to cover almost every storeOrder call. stores := make([]*Value, 0, 64) hasNilCheck := false
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/regalloc.go
var oldSched []*Value for _, b := range s.visitOrder { nfirst := 0 for _, v := range b.Values { if !mustBeFirst(v.Op) { break } nfirst++ } oldSched = append(oldSched[:0], b.Values[nfirst:]...) b.Values = b.Values[:nfirst] b.Values = append(b.Values, start[b.ID]...) for _, v := range oldSched { b.Values = append(b.Values, v)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
func (s *stackAllocState) init(f *Func, spillLive [][]ID) { s.f = f // Initialize value information. if n := f.NumValues(); cap(s.values) >= n { s.values = s.values[:n] } else { s.values = make([]stackValState, n) } for _, b := range f.Blocks { for _, v := range b.Values { s.values[v.ID].typ = v.Type
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/check.go
// ops that generate memory values. ss.clear() for _, v := range b.Values { if v.Op == OpPhi || !v.Type.IsMemory() { continue } if m := v.MemoryArg(); m != nil { ss.add(m.ID) } } // There should be at most one remaining unoverwritten memory value. for _, v := range b.Values { if !v.Type.IsMemory() { continue }
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/compile/internal/ssa/value.go
for _, x := range a { x.Uses++ } } func (v *Value) SetArg(i int, w *Value) { v.Args[i].Uses-- v.Args[i] = w w.Uses++ } func (v *Value) SetArgs1(a *Value) { v.resetArgs() v.AddArg(a) } func (v *Value) SetArgs2(a, b *Value) { v.resetArgs() v.AddArg(a) v.AddArg(b) } func (v *Value) SetArgs3(a, b, c *Value) { v.resetArgs() v.AddArg(a) v.AddArg(b) v.AddArg(c)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:40:22 UTC 2024 - 16.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/decl.go
lhs0[i] = NewVar(name.Pos(), pkg, name.Value, nil) } // initialize all variables values := syntax.UnpackListExpr(s.Values) for i, obj := range lhs0 { var lhs []*Var var init syntax.Expr switch len(values) { case len(s.NameList): // lhs and rhs match init = values[i] case 1: // rhs is expected to be a multi-valued expression lhs = lhs0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 29.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/copyelim.go
} } } // Update named values. for _, name := range f.Names { values := f.NamedValues[*name] for i, v := range values { if v.Op == OpCopy { values[i] = v.Args[0] } } } } // copySource returns the (non-copy) op which is the // ultimate source of v. v must be a copy op. func copySource(v *Value) *Value { w := v.Args[0] // This loop is just:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 3.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/nilcheck.go
// points a value to itself. If a value is known non-nil because we // already did a nil check on it, it points to the nil check operation. nonNilValues := f.Cache.allocValueSlice(f.NumValues()) defer f.Cache.freeValueSlice(nonNilValues) // make an initial pass identifying any non-nil values for _, b := range f.Blocks { for _, v := range b.Values { // a value resulting from taking the address of a
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 11.3K bytes - Viewed (0) -
doc/next/6-stdlib/2-unique.md
The new [unique] package provides facilities for canonicalizing values (like "interning" or "hash-consing"). Any value of comparable type may be canonicalized with the new `Make[T]` function, which produces a reference to a canonical copy of the value in the form of a `Handle[T]`. Two `Handle[T]` are equal if and only if the values used to produce the handles are equal, allowing programs to deduplicate values and reduce their memory footprint.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:34:13 UTC 2024 - 566 bytes - Viewed (0)