- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for LogStat (0.22 sec)
-
src/cmd/compile/internal/ssa/numberlines.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 14 21:26:13 UTC 2023 - 7.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/compile.go
time := tEnd.Sub(tStart).Nanoseconds() if p.time { f.LogStat("TIME(ns)", time) } if p.mem { var mEnd runtime.MemStats runtime.ReadMemStats(&mEnd) nBytes := mEnd.TotalAlloc - mStart.TotalAlloc nAllocs := mEnd.Mallocs - mStart.Mallocs f.LogStat("TIME(ns):BYTES:ALLOCS", time, nBytes, nAllocs) } } if p.dump != nil && p.dump[f.Name] {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:55:18 UTC 2024 - 18.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/cse.go
// them appropriately, so don't mess with them here. continue } b.ReplaceControl(i, x) } } } if f.pass.stats > 0 { f.LogStat("CSE REWRITES", rewrites) } } // An eqclass approximates an equivalence class. During the // algorithm it may represent the union of several of the // final equivalence classes. type eqclass []*Value
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 9.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
fmt.Println("before stackalloc") fmt.Println(f.String()) } s := newStackAllocState(f) s.init(f, spillLive) defer putStackAllocState(s) s.stackalloc() if f.pass.stats > 0 { f.LogStat("stack_alloc_stats", s.nArgSlot, "arg_slots", s.nNotNeed, "slot_not_needed", s.nNamedSlot, "named_slots", s.nAuto, "auto_slots", s.nReuse, "reused_slots", s.nSelfInterfere, "self_interfering") } return s.live
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/func.go
v.Pos = pos return v } // LogStat writes a string key and int value as a warning in a // tab-separated format easily handled by spreadsheets or awk. // file names, lines, and function names are included to provide enough (?) // context to allow item-by-item comparisons across runs. // For example: // awk 'BEGIN {FS="\t"} $3~/TIME/{sum+=$4} END{print "t(ns)=",sum}' t.log func (f *Func) LogStat(key string, args ...interface{}) {
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/likelyadjust.go
for _, l := range loops { x := len(l.exits) cf := 0 if !l.containsUnavoidableCall { cf = 1 } inner := 0 if l.isInner { inner++ } f.LogStat("loopstats:", l.depth, "depth", x, "exits", inner, "is_inner", cf, "always_calls", l.nBlocks, "n_blocks") } } if f.pass != nil && f.pass.debug > 1 && len(loops) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 31 21:41:20 UTC 2022 - 15.4K bytes - Viewed (0)