- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 120 for Atack (0.33 sec)
-
src/runtime/lockrank_on.go
// // However, we switch to the systemstack to record the lock held to ensure that // we record an accurate lock ordering. e.g., without systemstack, a stack // split on entry to lock2() would record stack split locks as taken after l, // even though l is not actually locked yet. func lockWithRank(l *mutex, rank lockRank) { if l == &debuglock || l == &paniclk || l == &raceFiniLock { // debuglock is only used for println/printlock(). Don't do lock
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 22 14:29:04 UTC 2024 - 10.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/source.go
} sp.files[fname] = file } callees := frames[:i] stack := make([]callID, 0, len(callees)) for j := len(callees) - 1; j >= 0; j-- { // Reverse so caller is first stack = append(stack, callID{ file: callees[j].File, line: callees[j].Line, }) } file.lines[f.Line] = append(file.lines[f.Line], sourceInst{addr, stack}) // Remember the first function name encountered per source line
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31.3K bytes - Viewed (0) -
src/cmd/go/internal/work/security.go
re(`-f(no-)?omit-frame-pointer`), re(`-f(no-)?openmp(-simd)?`), re(`-f(no-)?permissive`), re(`-f(no-)?(pic|PIC|pie|PIE)`), re(`-f(no-)?plt`), re(`-f(no-)?rtti`), re(`-f(no-)?split-stack`), re(`-f(no-)?stack-(.+)`), re(`-f(no-)?strict-aliasing`), re(`-f(un)signed-char`), re(`-f(no-)?use-linker-plugin`), // safe if -B is not used; we don't permit -B re(`-f(no-)?visibility-inlines-hidden`), re(`-fsanitize=(.+)`),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:47:34 UTC 2024 - 10K bytes - Viewed (0) -
src/runtime/debug/garbage.go
// SetMaxStack sets the maximum amount of memory that // can be used by a single goroutine stack. // If any goroutine exceeds this limit while growing its stack, // the program crashes. // SetMaxStack returns the previous setting. // The initial setting is 1 GB on 64-bit systems, 250 MB on 32-bit systems. // There may be a system-imposed maximum stack limit regardless // of the value provided to SetMaxStack. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 9.9K bytes - Viewed (0) -
src/os/exec/exec.go
if v == "2" { // Obtain the caller stack. (This is equivalent to runtime/debug.Stack, // copied to avoid importing the whole package.) stack := make([]byte, 1024) for { n := runtime.Stack(stack, false) if n < len(stack) { stack = stack[:n] break } stack = make([]byte, 2*len(stack)) } if i := bytes.Index(stack, []byte("\nos/exec.Command(")); i >= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 20:13:53 UTC 2024 - 41.4K bytes - Viewed (0) -
src/text/template/exec.go
node parse.Node // current node, for errors vars []variable // push-down stack of variable values. depth int // the height of the stack of executing templates. } // variable holds the dynamic value of a variable such as $, $x etc. type variable struct { name string value reflect.Value } // push pushes a new variable on the stack. func (s *state) push(name string, value reflect.Value) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:22:24 UTC 2024 - 32K bytes - Viewed (0) -
src/internal/trace/summary.go
} } // The goroutine hasn't been identified yet. Take the transition stack // and identify the goroutine by the root frame of that stack. // This root frame will be identical for all transitions on this // goroutine, because it represents its immutable start point. if g.Name == "" { stk := st.Stack if stk != NoStack { var frame StackFrame var ok bool
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 20.7K bytes - Viewed (0) -
src/testing/fuzz.go
// useful since there's no way to re-run them deterministically. f.testContext.match.clearSubNames() } // Record the stack trace at the point of this call so that if the subtest // function - which runs in a separate stack - is marked as a helper, we can // continue walking the stack into the parent test. var pc [maxStackLen]uintptr n := runtime.Callers(2, pc[:]) t := &T{ common: common{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 22:55:25 UTC 2024 - 22.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/check.go
methods map[*TypeName][]*Func // maps package scope type names to associated non-blank (non-interface) methods untyped map[syntax.Expr]exprInfo // map of expressions without final type delayed []action // stack of delayed action segments; segments are processed in FIFO order objPath []Object // path of object dependencies during type inference (for cycle reporting)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 23.3K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/report.go
*graph.NodeInfo inline bool } var stack []stk for _, loc := range sample.Location { nodes := locations[loc.ID] for i, n := range nodes { // The inline flag may be inaccurate if 'show' or 'hide' filter is // used. See https://github.com/google/pprof/issues/511. inline := i != len(nodes)-1 stack = append(stack, stk{&n.Info, inline}) } } if len(stack) == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 37.5K bytes - Viewed (0)