- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 229 for Atack (0.04 sec)
-
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/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) -
src/cmd/link/internal/ld/pe.go
// calls that may need more stack than we think. // // The default stack reserve size directly affects only the main // thread. // // For other threads, the runtime explicitly asks the kernel // to use the default stack size so that all stacks are // consistent. // // At thread start, in minit, the runtime queries the OS for // the actual stack bounds so that the stack size doesn't need
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 19:01:27 UTC 2023 - 48.8K bytes - Viewed (0) -
src/cmd/vendor/rsc.io/markdown/parse.go
if p.lineDepth < len(p.stack) { return p.stack[p.lineDepth].builder } return nil } func (p *parseState) nextB() blockBuilder { if p.lineDepth+1 < len(p.stack) { return p.stack[p.lineDepth+1].builder } return nil } func (p *parseState) trimStack(depth int) { if len(p.stack) < depth { panic("trimStack") } for len(p.stack) > depth { p.closeBlock() } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 13.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
{name: "PanicExtend", argLength: 4, aux: "Int64", typ: "Mem", call: true}, // arg0=idxHi, arg1=idxLo, arg2=len, arg3=mem, returns memory. // Function calls. Arguments to the call have already been written to the stack. // Return values appear on the stack. The method receiver, if any, is treated // as a phantom first argument. // TODO(josharian): ClosureCall and InterCall should have Int32 aux // to match StaticCall's 32 bit arg size limit.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0)