- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 693 for Stack0 (1.39 sec)
-
src/runtime/mprof.go
racewriterangepc(unsafe.Pointer(&dst.Stack0[0]), unsafe.Sizeof(dst.Stack0), getcallerpc(), abi.FuncPCABIInternal(MemProfile)) } if msanenabled { msanwrite(unsafe.Pointer(&dst.Stack0[0]), unsafe.Sizeof(dst.Stack0)) } if asanenabled { asanwrite(unsafe.Pointer(&dst.Stack0[0]), unsafe.Sizeof(dst.Stack0)) } i := copy(dst.Stack0[:], src.Stack) clear(dst.Stack0[i:]) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 53.3K bytes - Viewed (0) -
src/runtime/runtime2.go
} type g struct { // Stack parameters. // stack describes the actual stack memory: [stack.lo, stack.hi). // stackguard0 is the stack pointer compared in the Go stack growth prologue. // It is stack.lo+StackGuard normally, but can be StackPreempt to trigger a preemption. // stackguard1 is the stack pointer compared in the //go:systemstack stack growth prologue. // It is stack.lo+StackGuard on g0 and gsignal stacks.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 47.9K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.js
// listed in places. function totalValue(places) { const seen = new Set(); let pos = 0; let neg = 0; for (const place of places) { if (seen.has(place.Stack)) continue; // Do not double-count stacks seen.add(place.Stack); const stack = stacks.Stacks[place.Stack]; if (stack.Value < 0) { neg += -stack.Value; } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 18.5K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/stacks.go
return // error already reported } // Make stack data and generate corresponding JSON. stacks := rpt.Stacks() b, err := json.Marshal(stacks) if err != nil { http.Error(w, "error serializing stacks for flame graph", http.StatusInternalServerError) ui.options.UI.PrintErr(err) return } nodes := make([]string, len(stacks.Sources)) for i, src := range stacks.Sources { nodes[i] = src.FullName }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 1.7K bytes - Viewed (0) -
src/runtime/stack.go
// allocation. if newsize < fixedStack { return } // Compute how much of the stack is currently in use and only // shrink the stack if gp is using less than a quarter of its // current stack. The currently used stack includes everything // down to the SP plus the stack guard space that ensures // there's room for nosplit functions. avail := gp.stack.hi - gp.stack.lo
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 41.1K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/html/stacks.html
<!DOCTYPE html> <html> <head> <meta charset="utf-8"> <title>{{.Title}}</title> {{template "css" .}} {{template "stacks_css"}} </head> <body> {{template "header" .}} <div id="stack-holder"> <div id="stack-chart"></div> <div id="current-details"></div> </div> <div id="action-menu" class="submenu"> <span id="action-title"></span> <hr>
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 1K bytes - Viewed (0) -
src/internal/trace/testdata/testprog/stacks.go
defer trace.Stop() // in case of early return // Now we will do a bunch of things for which we verify stacks later. // It is impossible to ensure that a goroutine has actually blocked // on a channel, in a select or otherwise. So we kick off goroutines // that need to block first in the hope that while we are executing // the rest of the test, they will block. go func() { // func1 select {} }() go func() { // func2 var c chan int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 2.4K bytes - Viewed (0) -
src/runtime/debug/stack.go
) // PrintStack prints to standard error the stack trace returned by runtime.Stack. func PrintStack() { os.Stderr.Write(Stack()) } // Stack returns a formatted stack trace of the goroutine that calls it. // It calls [runtime.Stack] with a large enough buffer to capture the entire trace. func Stack() []byte { buf := make([]byte, 1024) for { n := runtime.Stack(buf, false) if n < len(buf) { return buf[:n] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 15:19:04 UTC 2024 - 3.2K bytes - Viewed (0) -
src/cmd/trace/pprof.go
m.pcs[pcs] = stack m.stacks[stack] = rec return rec } func (m *stackMap) profile() []traceviewer.ProfileRecord { prof := make([]traceviewer.ProfileRecord, 0, len(m.stacks)) for stack, record := range m.stacks { rec := *record i := 0 stack.Frames(func(frame trace.StackFrame) bool { rec.Stack = append(rec.Stack, &trace.Frame{ PC: frame.PC, Fn: frame.Func,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.1K bytes - Viewed (0) -
src/internal/trace/generation.go
return nil } // validateStackStrings makes sure all the string references in // the stack table are present in the string table. func validateStackStrings( stacks *dataTable[stackID, stack], strings *dataTable[stringID, string], frames map[uint64]frame, ) error { var err error stacks.forEach(func(id stackID, stk stack) bool { for _, pc := range stk.pcs { frame, ok := frames[pc] if !ok {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 22:14:45 UTC 2024 - 12.1K bytes - Viewed (0)