- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 228 for Atack (0.06 sec)
-
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) -
src/runtime/stkframe.go
sp uintptr // stack pointer at pc fp uintptr // stack pointer at caller aka frame pointer varp uintptr // top of local variables argp uintptr // pointer to function arguments } // reflectMethodValue is a partial duplicate of reflect.makeFuncImpl // and reflect.methodValue. type reflectMethodValue struct { fn uintptr stack *bitvector // ptrmap for both args and results
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 9.9K bytes - Viewed (0) -
src/cmd/trace/regions.go
Type: r.Name, } } func regionTopStackFrame(r *trace.UserRegionSummary) trace.StackFrame { var frame trace.StackFrame if r.Start != nil && r.Start.Stack() != trace.NoStack { r.Start.Stack().Frames(func(f trace.StackFrame) bool { frame = f return false }) } return frame } type regionStats struct { regionFingerprint Histogram traceviewer.TimeHistogram }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 14.3K bytes - Viewed (0) -
src/runtime/os_freebsd.go
func newosproc(mp *m) { stk := unsafe.Pointer(mp.g0.stack.hi) if false { print("newosproc stk=", stk, " m=", mp, " g=", mp.g0, " thr_start=", abi.FuncPCABI0(thr_start), " id=", mp.id, " ostk=", &mp, "\n") } param := thrparam{ start_func: abi.FuncPCABI0(thr_start), arg: unsafe.Pointer(mp), stack_base: mp.g0.stack.lo, stack_size: uintptr(stk) - mp.g0.stack.lo, child_tid: nil, // minit will record tid
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 11.6K bytes - Viewed (0) -
src/internal/trace/testtrace/validation.go
ctx.G = id state.binding = ctx } } else if old.Executing() && !new.Executing() { if tr.Stack != ev.Stack() { // This is a case where the transition is happening to a goroutine that is also executing, so // these two stacks should always match. e.Errorf("StateTransition.Stack doesn't match Event.Stack") } ctx := state.binding if ctx != nil { if ctx.G != id {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.9K bytes - Viewed (0) -
src/runtime/os_windows.go
} func gFromSP(mp *m, sp uintptr) *g { if gp := mp.g0; gp != nil && gp.stack.lo < sp && sp < gp.stack.hi { return gp } if gp := mp.gsignal; gp != nil && gp.stack.lo < sp && sp < gp.stack.hi { return gp } if gp := mp.curg; gp != nil && gp.stack.lo < sp && sp < gp.stack.hi { return gp } return nil } func profileLoop() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 22:55:25 UTC 2024 - 41.5K bytes - Viewed (0) -
src/runtime/select.go
// There are unlocked sudogs that point into gp's stack. Stack // copying must lock the channels of those sudogs. // Set activeStackChans here instead of before we try parking // because we could self-deadlock in stack growth on a // channel lock. gp.activeStackChans = true // Mark that it's safe for stack shrinking to occur now, // because any thread acquiring this G's stack for shrinking
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 13 21:36:04 UTC 2024 - 15K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/loopreschedchecks.go
mark := make([]markKind, f.NumBlocks()) stack := []backedgesState{} mark[f.Entry.ID] = notExplored stack = append(stack, backedgesState{f.Entry, 0}) for len(stack) > 0 { l := len(stack) x := stack[l-1] if x.i < len(x.b.Succs) { e := x.b.Succs[x.i] stack[l-1].i++ s := e.b if mark[s.ID] == notFound { mark[s.ID] = notExplored stack = append(stack, backedgesState{s, 0})
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 22 21:17:10 UTC 2023 - 16K bytes - Viewed (0) -
src/runtime/pprof/proto.go
// data[2] = count // data[3:3+n] = stack // If the count is 0 and the stack has length 1, // that's an overflow record inserted by the runtime // to indicate that stack[0] samples were lost. // Otherwise the count is usually 1, // but in a few special cases like lost non-Go samples // there can be larger counts. // Because many samples with the same stack arrive, // we want to deduplicate immediately, which we do
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/compile/internal/ssa/nilcheck.go
// instruction between a VarDef and that variable being // fully initialized. If there was, then anything scanning // the stack during the handling of that fault will see // a live but uninitialized pointer variable on the stack. // // If we have: // // NilCheck p // VarDef x // x = *p // // We can't rewrite that to //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 11.3K bytes - Viewed (0)