- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 44 for stk (0.04 sec)
-
src/cmd/vendor/rsc.io/markdown/inline.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 21.9K bytes - Viewed (0) -
src/runtime/stack_test.go
b := make([]byte, 1024) stk := string(b[:Stack(b, false)]) if !strings.HasPrefix(stk, "goroutine ") { t.Errorf("Stack (len %d):\n%s", len(stk), stk) t.Errorf("Stack output should begin with \"goroutine \"") } } func TestStackAllOutput(t *testing.T) { b := make([]byte, 1024) stk := string(b[:Stack(b, true)]) if !strings.HasPrefix(stk, "goroutine ") {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 23.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/phi.go
// variable/value pair to reinstate on exit n int32 // variable ID v *ssa.Value // Note: only one of b or n,v will be set. } var stk []stackEntry stk = append(stk, stackEntry{b: s.f.Entry}) for len(stk) > 0 { work := stk[len(stk)-1] stk = stk[:len(stk)-1] b := work.b if b == nil { // On exit from a block, this case will undo any assignments done below. values[work.n] = work.v
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 17:59:44 UTC 2022 - 15.2K bytes - Viewed (0) -
src/internal/trace/traceviewer/emitter.go
func (e *Emitter) Stack(stk []*trace.Frame) int { return e.buildBranch(e.frameTree, stk) } // buildBranch builds one branch in the prefix tree rooted at ctx.frameTree. func (e *Emitter) buildBranch(parent frameNode, stk []*trace.Frame) int { if len(stk) == 0 { return parent.id } last := len(stk) - 1 frame := stk[last] stk = stk[:last] node, ok := parent.children[frame.PC]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 21:29:58 UTC 2023 - 20.4K bytes - Viewed (0) -
src/runtime/pprof/proto.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Dec 13 20:40:52 UTC 2023 - 25.7K bytes - Viewed (0) -
src/cmd/go/internal/load/test.go
// the cycle as (for example) package p imports package q imports package r // imports package p. stk = append(stk, ptest.ImportPath) slices.Reverse(stk) return &PackageError{ ImportStack: stk, Err: errors.New("import cycle not allowed in test"), IsImportCycle: true, } } for _, dep := range p.Internal.Imports {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 14:01:23 UTC 2024 - 28.2K bytes - Viewed (0) -
src/cmd/trace/gstate.go
} } // augmentName attempts to use stk to augment the name of the goroutine // with stack information. This stack must be related to the goroutine // in some way, but it doesn't really matter which stack. func (gs *gState[R]) augmentName(stk trace.Stack) { if gs.named { return } if stk == trace.NoStack { return } name := lastFunc(stk) gs.baseName += fmt.Sprintf(" %s", name) gs.named = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 11.9K bytes - Viewed (0) -
src/internal/bisect/bisect.go
func (m *Matcher) stack(w Writer) bool { const maxStack = 16 var stk [maxStack]uintptr n := runtime.Callers(2, stk[:]) // caller #2 is not for printing; need it to normalize PCs if ASLR. if n <= 1 { return false } base := stk[0] // normalize PCs for i := range stk[:n] { stk[i] -= base } h := Hash(stk[:n]) if m.ShouldPrint(h) { var d *dedup for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 17:28:43 UTC 2024 - 22.9K bytes - Viewed (0) -
src/runtime/profbuf.go
// Only racing against reader, not other writers. count, time := b.takeOverflow() if count > 0 { var stk [1]uintptr stk[0] = uintptr(count) b.write(nil, int64(time), nil, stk[:]) } } else if hasOverflow || !b.canWriteRecord(len(stk)) { // Pending overflow without room to write overflow and new records // or no overflow but also no room for new record. b.incrementOverflow(now) b.wakeupExtra()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 18.2K bytes - Viewed (0) -
src/runtime/pprof/pprof.go
} if p.write != nil { panic("pprof: Add called on built-in Profile " + p.name) } stk := make([]uintptr, 32) n := runtime.Callers(skip+1, stk[:]) stk = stk[:n] if len(stk) == 0 { // The value for skip is too large, and there's no stack trace to record. stk = []uintptr{abi.FuncPCABIInternal(lostProfileEvent)} } p.mu.Lock() defer p.mu.Unlock() if p.m[value] != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 30.6K bytes - Viewed (0)