- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 269 for Atack (0.04 sec)
-
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) -
src/cmd/trace/tasks.go
http.Error(w, err.Error(), http.StatusBadRequest) return } type event struct { WhenString string Elapsed time.Duration Goroutine trace.GoID What string // TODO: include stack trace of creation time } type task struct { WhenString string ID trace.TaskID Duration time.Duration Complete bool Events []event
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 11.8K bytes - Viewed (0) -
src/runtime/stack_test.go
// stack grows as part of starting the deferred function. It calls Goexit at various // stack depths, forcing the deferred function (with >4kB of args) to be run at // the bottom of the stack. The goal is to find a stack depth less than 4kB from // the end of the stack. Each trial runs in a different goroutine so that an earlier // stack growth does not invalidate a later attempt.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 14 00:03:57 UTC 2023 - 23.1K bytes - Viewed (0) -
src/syscall/syscall_linux.go
// // //go:uintptrkeepalive because the uintptr argument may be converted pointers // that need to be kept alive in the caller. // // //go:nosplit because stack copying does not account for uintptrkeepalive, so // the stack must not grow. Stack copying cannot blindly assume that all // uintptr arguments are pointers, because some values may look like pointers,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:12:46 UTC 2024 - 35.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/validtype.go
// its value is looked up in the type argument list of the instantiated // (enclosing) type, if it exists. Otherwise the type parameter must be from // an enclosing function and can be ignored. // The nest list describes the stack (the "nest in memory") of types which // contain (or embed in the case of interfaces) other types. For instance, a // struct named S which contains a field of named type F contains (the memory
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 15 13:22:37 UTC 2024 - 10.2K bytes - Viewed (0)