- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 263 for Atack (0.04 sec)
-
src/net/http/pprof/pprof.go
} var profileDescriptions = map[string]string{ "allocs": "A sampling of all past memory allocations", "block": "Stack traces that led to blocking on synchronization primitives", "cmdline": "The command line invocation of the current program", "goroutine": "Stack traces of all current goroutines. Use debug=2 as a query parameter to export in the same format as an unrecovered panic.",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:34:05 UTC 2024 - 14.1K bytes - Viewed (0) -
src/internal/trace/oldtrace.go
// timestamp, M, P, G, stack. However, after they get turned into Event, // they have the arguments stack, M, P, G. // // In Go 1.21, CPU samples did not have Ms. mappedArgs = timedEventArgs{uint64(ev.StkID), ^uint64(0), uint64(ev.P), ev.G} default: return Event{}, fmt.Errorf("unexpected event type %v", ev.Type) } if oldtrace.EventDescriptions[ev.Type].Stack {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 17.2K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/inline.go
return p.list } func (ps *parseState) emph(dst, src []Inline) []Inline { const chars = "_*~\"'" var stack [len(chars)][]*emphPlain stackOf := func(c byte) int { return strings.IndexByte(chars, c) } trimStack := func() { for i := range stack { stk := &stack[i] for len(*stk) > 0 && (*stk)[len(*stk)-1].i >= len(dst) { *stk = (*stk)[:len(*stk)-1] } } } Src:
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/proc_test.go
// to notice if NumGoroutine and Stack are _always_ out of sync. for i := 0; ; i++ { // Give goroutines about to exit a chance to exit. // The NumGoroutine and Stack below need to see // the same state of the world, so anything we can do // to keep it quiet is good. runtime.Gosched() n := runtime.NumGoroutine() buf = buf[:runtime.Stack(buf, true)]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 25.8K bytes - Viewed (0) -
src/runtime/mspanset.go
// spanSetBlockAlloc represents a concurrent pool of spanSetBlocks. type spanSetBlockAlloc struct { stack lfstack } // alloc tries to grab a spanSetBlock out of the pool, and if it fails // persistentallocs a new one and returns it. func (p *spanSetBlockAlloc) alloc() *spanSetBlock { if s := (*spanSetBlock)(p.stack.pop()); s != nil { return s }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
src/log/slog/value.go
rv = AnyValue(fmt.Errorf("LogValue panicked\n%s", stack(3, 5))) } }() for i := 0; i < maxLogValues; i++ { if v.Kind() != KindLogValuer { return v } v = v.LogValuer().LogValue() } err := fmt.Errorf("LogValue called too many times on Value of type %T", orig.Any()) return AnyValue(err) } func stack(skip, nFrames int) string { pcs := make([]uintptr, nFrames+1)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 16:12:08 UTC 2024 - 13.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
if !ok { v.Fatalf("store aux is not a type: %s", v.LongString()) } if !t.HasPointers() { return false } dst := v.Args[0] if IsStackAddr(dst) { return false // writes into the stack don't need write barrier } // If we're writing to a place that might have heap pointers, we need // the write barrier. if mightContainHeapPointer(dst, t.Size(), v.MemoryArg(), zeroes) { return true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0) -
src/cmd/trace/gstate.go
func (gs *gState[R]) setStartCause(ts trace.Time, name string, resource uint64, stack trace.Stack) { gs.startCause.time = ts gs.startCause.name = name gs.startCause.resource = resource gs.startCause.stack = stack } // created indicates that this goroutine was just created by the provided creator. func (gs *gState[R]) created(ts trace.Time, creator R, stack trace.Stack) { if creator == R(noResource) { return }
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/runtime/mgcstack.go
// on the stack whose address is taken, and which themselves contain a // pointer. We call these variables "stack objects". // // We begin by determining all the stack objects on the stack and all // the statically live pointers that may point into the stack. We then // process each pointer to see if it points to a stack object. If it // does, we scan that stack object. It may contain pointers into the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 21 21:06:52 UTC 2023 - 10.6K bytes - Viewed (0) -
src/cmd/trace/pprof.go
stacks map[trace.Stack]*traceviewer.ProfileRecord // pcs is the source-of-truth for deduplication. It is a map of // the actual PCs in the stack to a trace.Stack. pcs map[[pprofMaxStack]uint64]trace.Stack } func newStackMap() *stackMap { return &stackMap{ stacks: make(map[trace.Stack]*traceviewer.ProfileRecord), pcs: make(map[[pprofMaxStack]uint64]trace.Stack), } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.1K bytes - Viewed (0)