- Sort Score
- Result 10 results
- Languages All
Results 91 - 100 of 694 for Atack (0.03 sec)
-
src/testing/testing.go
testName, ok, _ := t.context.match.fullName(&t.common, name) if !ok || shouldFailFast() { return true } // 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: Thu May 23 01:00:11 UTC 2024 - 76.1K bytes - Viewed (0) -
test/fixedbugs/issue41635.go
// license that can be found in the LICENSE file. package p func f() { // ERROR "" n, m := 100, 200 _ = make([]byte, 1<<17) // ERROR "too large for stack" "" _ = make([]byte, 100, 1<<17) // ERROR "too large for stack" "" _ = make([]byte, n, 1<<17) // ERROR "too large for stack" "" _ = make([]byte, n) // ERROR "non-constant size" "" _ = make([]byte, 100, m) // ERROR "non-constant size" ""
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Oct 03 13:02:20 UTC 2020 - 546 bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/prune.go
break } } return funcName } // Prune removes all nodes beneath a node matching dropRx, and not // matching keepRx. If the root node of a Sample matches, the sample // will have an empty stack. func (p *Profile) Prune(dropRx, keepRx *regexp.Regexp) { prune := make(map[uint64]bool) pruneBeneath := make(map[uint64]bool) // simplifyFunc can be expensive, so cache results.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 22 18:58:12 UTC 2022 - 5.5K bytes - Viewed (0) -
src/internal/trace/raw/textreader.go
} if spec.IsStack { len := int(args[1]) for i := 0; i < len; i++ { line, err := r.nextLine() if err == io.EOF { return Event{}, fmt.Errorf("unexpected EOF while reading stack: args=%v", args) } if err != nil { return Event{}, err } frame, err := readArgs(line, frameFields) if err != nil { return Event{}, err } args = append(args, frame...) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 4.9K bytes - Viewed (0) -
src/net/iprawsock_test.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package net import ( "internal/testenv" "reflect" "testing" ) // The full stack test cases for IPConn have been moved to the // following: // golang.org/x/net/ipv4 // golang.org/x/net/ipv6 // golang.org/x/net/icmp type resolveIPAddrTest struct { network string litAddrOrName string
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 18 17:20:52 UTC 2023 - 6K bytes - Viewed (0) -
test/fixedbugs/issue29735.go
// lies between two functions. package main import ( "runtime" ) func main() { var stack [1]uintptr runtime.Callers(1, stack[:]) f() // inlined function, to give main some inlining info for i := uintptr(0); true; i++ { f := runtime.FuncForPC(stack[0] + i) if f.Name() != "main.main" && f.Name() != "main.f" { // Reached next function successfully. break } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 14 23:37:39 UTC 2019 - 686 bytes - Viewed (0) -
src/runtime/os_netbsd.go
// signal stack of the creating thread. We always create a // new signal stack here, to avoid having two Go threads using // the same signal stack. This breaks the case of a thread // created in C that calls sigaltstack and then calls a Go // function, because we will lose track of the C code's // sigaltstack, but it's the best we can do. signalstack(&gp.m.gsignal.stack) gp.m.newSigstack = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 10.1K bytes - Viewed (0) -
src/cmd/internal/obj/textflag.go
TLSBSS = 256 // Do not insert instructions to allocate a stack frame for this function. // Only valid on functions that declare a frame size of 0. // TODO(mwhudson): only implemented for ppc64x at present. NOFRAME = 512 // Function can call reflect.Type.Method or reflect.Type.MethodByName. REFLECTMETHOD = 1024 // Function is the outermost frame of the call stack. Call stack unwinders // should stop at this function. TOPFRAME = 2048
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 06 20:25:30 UTC 2023 - 1.7K bytes - Viewed (0) -
test/fixedbugs/issue4316.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Issue 4316: the stack overflow check in the linker // is confused when it encounters a split-stack function // that needs 0 bytes of stack space. package main type Peano *Peano func makePeano(n int) *Peano { if n == 0 { return nil } p := Peano(makePeano(n - 1))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 972 bytes - Viewed (0) -
test/fixedbugs/issue27278.go
return []string{} } func main() { poison() f() } //go:noinline func f() { (&T{}).M() grow(10000) } // grow stack, triggers stack copy func grow(n int) { if n == 0 { return } grow(n-1) } // put some junk on stack, which cannot be valid address //go:noinline func poison() { x := [10]int{1, 2, 3, 4, 5, 6, 7, 8, 9, 10} g = x }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 30 02:19:37 UTC 2018 - 865 bytes - Viewed (0)