- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 990 for pgstack (0.13 sec)
-
src/runtime/sys_wasm.go
// license that can be found in the LICENSE file. package runtime import ( "internal/goarch" "runtime/internal/sys" "unsafe" ) type m0Stack struct { _ [8192 * sys.StackGuardMultiplier]byte } var wasmStack m0Stack func wasmDiv() func wasmTruncS() func wasmTruncU() //go:wasmimport gojs runtime.wasmExit func wasmExit(code int32)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 02 05:28:55 UTC 2023 - 758 bytes - Viewed (0) -
src/runtime/msan_arm64.s
JMP msancall<>(SB) // Switches SP to g0 stack and calls (FARG). Arguments already set. TEXT msancall<>(SB), NOSPLIT, $0-0 MOVD RSP, R19 // callee-saved CBZ g, g0stack // no g, still on a system stack MOVD g_m(g), R10 MOVD m_g0(R10), R11 CMP R11, g BEQ g0stack MOVD (g_sched+gobuf_sp)(R11), R4 MOVD R4, RSP g0stack: BL (FARG) MOVD R19, RSP
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jan 09 01:36:54 UTC 2024 - 2K bytes - Viewed (0) -
src/internal/trace/testdata/generators/go122-confuse-seq-across-generations.go
b10.Event("GoStop", "whatever", testgen.NoStack) // The running goroutine gets unblocked. b11 := g1.Batch(trace.ThreadID(1), 0) b11.Event("ProcStatus", trace.ProcID(1), go122.ProcRunning) b11.Event("GoStart", trace.GoID(1), testgen.Seq(1)) b11.Event("GoStop", "whatever", testgen.NoStack) g2 := t.Generation(2) // Start running the goroutine, but later.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:15:28 UTC 2024 - 2.1K 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/cmd/asm/internal/lex/stack.go
import ( "text/scanner" "cmd/internal/src" ) // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF, // it resumes reading the next one down. type Stack struct { tr []TokenReader } // Push adds tr to the top (end) of the input stack. (Popping happens automatically.) func (s *Stack) Push(tr TokenReader) { s.tr = append(s.tr, tr) } func (s *Stack) Next() ScanToken { tos := s.tr[len(s.tr)-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 09 22:33:23 UTC 2017 - 1.2K bytes - Viewed (0) -
src/internal/abi/stack.go
// // This value must be multiplied by the stack guard multiplier, so do not // use it directly. See runtime/stack.go:stackNosplit and // cmd/internal/objabi/stack.go:StackNosplit. StackNosplitBase = 800 // We have three different sequences for stack bounds checks, depending on // whether the stack frame of a function is small, big, or huge. // After a stack split check the SP is allowed to be StackSmall bytes below
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 19:28:56 UTC 2023 - 1.3K 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) -
test/stack.go
// Copyright 2009 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Test stack splitting code. // Try to tickle stack splitting bugs by doing // go, defer, and closure calls at different stack depths. package main type T [20]int func g(c chan int, t T) { s := 0 for i := 0; i < len(t); i++ { s += t[i] } c <- s }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:48:19 UTC 2012 - 1.7K bytes - Viewed (0) -
src/internal/trace/internal/testgen/go122/trace.go
g.strings[s] = id return id } // Stack registers a stack with the trace. // // This is a convenience function for easily adding correct // stacks to traces. func (g *Generation) Stack(stk []trace.StackFrame) uint64 { if len(stk) == 0 { return 0 } if len(stk) > 32 { panic("stack too big for test") } var stkc stack copy(stkc.stk[:], stk) stkc.len = len(stk)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 9.7K bytes - Viewed (0) -
src/internal/trace/testdata/generators/go122-task-across-generations.go
g2 := t.Generation(2) // That same goroutine emits a task end in the following generation. b2 := g2.Batch(trace.ThreadID(0), 5) b2.Event("ProcStatus", trace.ProcID(0), go122.ProcRunning) b2.Event("GoStatus", trace.GoID(1), trace.ThreadID(0), go122.GoRunning) b2.Event("UserTaskEnd", trace.TaskID(2), testgen.NoStack)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:15:28 UTC 2024 - 1.3K bytes - Viewed (0)