- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 107 for Atack (0.07 sec)
-
src/runtime/debug/example_monitor_test.go
// // To observe the monitor in action, replace the entire text // of this comment with "Output:" and run this command: // // $ go test -run=ExampleSetCrashOutput_monitor runtime/debug // panic: oops // ...stack... // monitor: saved crash report at /tmp/10804884239807998216.crash } // appmain represents the 'main' function of your application. func appmain() { monitor() // Run the application. println("hello")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 15:19:04 UTC 2024 - 2.7K bytes - Viewed (0) -
src/runtime/rand.go
// so we don't need to use mp.locks // on the fast path, which is that the // first attempt succeeds. x, ok := c.Next() if ok { return x } mp.locks++ // hold m even though c.Refill may do stack split checks c.Refill() mp.locks-- } } // mrandinit initializes the random state of an m. func mrandinit(mp *m) { var seed [4]uint64 for i := range seed { seed[i] = bootstrapRand()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 14:32:47 UTC 2024 - 8K bytes - Viewed (0) -
src/cmd/compile/internal/types2/errors.go
) func assert(p bool) { if !p { msg := "assertion failed" // Include information about the assertion location. Due to panic recovery, // this location is otherwise buried in the middle of the panicking stack. if _, file, line, ok := runtime.Caller(1); ok { msg = fmt.Sprintf("%s:%d: %s", file, line, msg) } panic(msg) } } // An errorDesc describes part of a type-checking error. type errorDesc struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 22:06:18 UTC 2024 - 6.6K bytes - Viewed (0) -
src/runtime/coro.go
// and then blocks the current goroutine on c. func coroswitch(c *coro) { gp := getg() gp.coroarg = c mcall(coroswitch_m) } // coroswitch_m is the implementation of coroswitch // that runs on the m stack. // // Note: Coroutine switches are expected to happen at // an order of magnitude (or more) higher frequency // than regular goroutine switches, so this path is heavily // optimized to remove unnecessary work.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:09:18 UTC 2024 - 7.4K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/stacks.go
inlined := (j != len(loc.Line)-1) stack.Sources = append(stack.Sources, getSrc(line, inlined)) } } leaf := stack.Sources[len(stack.Sources)-1] s.Sources[leaf].Self += value s.Stacks = append(s.Stacks, stack) } } func (s *StackSet) fillPlaces() { for i, stack := range s.Stacks { seenSrcs := map[int]bool{} for j, src := range stack.Sources { if seenSrcs[src] { continue
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 5.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/driver/driver.go
BuildID() string // SourceLine reports the source line information for a given // address in the file. Due to inlining, the source line information // is in general a list of positions representing a call stack, // with the leaf function first. SourceLine(addr uint64) ([]Frame, error) // Symbols returns a list of symbols in the object file. // If r is not nil, Symbols restricts the list to symbols
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 9.8K bytes - Viewed (0) -
src/cmd/trace/goroutinegen.go
gs.augmentName(st.Stack) // Handle the goroutine state transition. from, to := st.Goroutine() if from == to { // Filter out no-op events. return } if from.Executing() && !to.Executing() { if to == trace.GoWaiting { // Goroutine started blocking. gs.block(ev.Time(), ev.Stack(), st.Reason, ctx) } else { gs.stop(ev.Time(), ev.Stack(), ctx) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 4.6K bytes - Viewed (0) -
src/runtime/debug.go
// // This must be deeply nosplit because it is called from a function // prologue before the stack is set up and because the compiler will // call it from any splittable prologue (leading to infinite // recursion). // // Ideally it should also use very little stack because the linker // doesn't currently account for this in nosplit stack depth checking. // // Ensure mayMoreStackPreempt can be called for all ABIs. // //go:nosplit
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 11 20:38:24 UTC 2024 - 4.2K bytes - Viewed (0) -
src/runtime/trace_cgo_test.go
if wantEvent := logs[category]; wantEvent == nil { logs[category] = &event } else if got, want := dumpStackV2(&event), dumpStackV2(wantEvent); got != want { t.Errorf("%q: got stack:\n%s\nwant stack:\n%s\n", category, got, want) } } } } func mustFindLogV2(t *testing.T, trc io.Reader, category string) trace.Event { r, err := trace.NewReader(trc) if err != nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 2.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/lostcancel/lostcancel.go
// Find the set of cancel vars to analyze. stack := make([]ast.Node, 0, 32) ast.Inspect(node, func(n ast.Node) bool { switch n.(type) { case *ast.FuncLit: if len(stack) > 0 { return false // don't stray into nested functions } case nil: stack = stack[:len(stack)-1] // pop return true } stack = append(stack, n) // push
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 19:00:13 UTC 2024 - 9K bytes - Viewed (0)