- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 256 for Atack (0.03 sec)
-
src/runtime/metrics_test.go
}) { // stk is a call stack that is still on the user stack when // it calls runtime.unlock. Add the extra function that // we'll see, when the static lock ranking implementation of // runtime.unlockWithRank switches to the system stack. stk = append([]string{"runtime.unlockWithRank"}, stk...) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 45K bytes - Viewed (0) -
src/runtime/string.go
return unsafe.String((*byte)(p), n) } // stringDataOnStack reports whether the string's data is // stored on the current goroutine's stack. func stringDataOnStack(s string) bool { ptr := uintptr(unsafe.Pointer(unsafe.StringData(s))) stk := getg().stack return stk.lo <= ptr && ptr < stk.hi } func rawstringtmp(buf *tmpBuf, l int) (s string, b []byte) { if buf != nil && l <= len(buf) { b = buf[:l]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/module/module.go
// needing different casings of a file path, but it would be fairly illegible // to most programmers when those paths appeared in the file system // (including in file paths in compiler errors and stack traces) // in web server logs, and so on. Instead, we want a safe escaped form that // leaves most paths unaltered. // // The safe escaped form is to replace every uppercase letter
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 20:17:07 UTC 2024 - 26.9K bytes - Viewed (0) -
src/cmd/cover/cover.go
cv := mkCounterVarName(len(f.pkg.counterLengths)) f.fn.counterVar = cv } func (f *File) postFunc(fn ast.Node, funcname string, flit bool, body *ast.BlockStmt) { // Tack on single counter write if we are in "perfunc" mode. singleCtr := "" if pkgconfig.Granularity == "perfunc" { singleCtr = "; " + f.newCounter(fn.Pos(), fn.Pos(), 1) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
src/index/suffixarray/sais.go
// max(maxID, numLMS/2). This level of the recursion needs maxID, // and all deeper levels of the recursion will need no more than numLMS/2, // so this one allocation is guaranteed to suffice for the entire stack // of recursive calls. tmp := oldTmp if len(tmp) < len(saTmp) { tmp = saTmp } if len(tmp) < numLMS { // TestSAIS/forcealloc reaches this code. n := maxID if n < numLMS/2 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0) -
src/go/doc/testdata/testing.go
// it would run on a test failure. Because we send on c.signal during // a top-of-stack deferred function now, we know that the send // only happens after any other stacked defers have completed. runtime.Goexit() } // log generates the output. It's always at the same stack depth. func (c *common) log(s string) { c.output = append(c.output, decorate(s, true)...) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Oct 02 02:28:27 UTC 2022 - 11.8K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/driver/commands.go
"Matching includes the function name, filename or object name."), "tagroot": helpText( "Adds pseudo stack frames for labels key/value pairs at the callstack root.", "A comma-separated list of label keys.", "The first key creates frames at the new root."), "tagleaf": helpText( "Adds pseudo stack frames for labels key/value pairs at the callstack leaf.", "A comma-separated list of label keys.",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 18.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/predicates.go
// package is nil for objects in universe scope if a == nil || b == nil { return a == b } // a != nil && b != nil return a.path == b.path } // An ifacePair is a node in a stack of interface type pairs compared for identity. type ifacePair struct { x, y *Interface prev *ifacePair } func (p *ifacePair) identical(q *ifacePair) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 17.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
appendWalkStmt(init, ir.NewAssignStmt(base.Pos, vauto, a)) if vstat != nil && n.Prealloc == nil && n.Esc() != ir.EscNone { // If we allocated on the heap with ONEW, copy the static to the // heap (4). We skip this for stack temporaries, because // initStackTemp already handled the copy. a = ir.NewStarExpr(base.Pos, vauto) appendWalkStmt(init, ir.NewAssignStmt(base.Pos, a, vstat)) } // put dynamics into array (5)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:03:54 UTC 2023 - 19.5K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
// NewNat returns a new nat with a size of zero, just like new(Nat), but with // the preallocated capacity to hold a number of up to preallocTarget bits. // NewNat inlines, so the allocation can live on the stack. func NewNat() *Nat { limbs := make([]uint, 0, preallocLimbs) return &Nat{limbs} } // expand expands x to n limbs, leaving its value unchanged. func (x *Nat) expand(n int) *Nat { if len(x.limbs) > n {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0)