- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 357 for Atack (0.03 sec)
-
src/cmd/internal/objabi/stack.go
) func StackNosplit(race bool) int { // This arithmetic must match that in runtime/stack.go:stackNosplit. return abi.StackNosplitBase * stackGuardMultiplier(race) } // stackGuardMultiplier returns a multiplier to apply to the default // stack guard size. Larger multipliers are used for non-optimized // builds that have larger stack frames or for specific targets. func stackGuardMultiplier(race bool) int {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 19:28:56 UTC 2023 - 904 bytes - Viewed (0) -
test/codegen/stack.go
// license that can be found in the LICENSE file. package codegen import "runtime" // This file contains code generation tests related to the use of the // stack. // Check that stack stores are optimized away. // 386:"TEXT\t.*, [$]0-" // amd64:"TEXT\t.*, [$]0-" // arm:"TEXT\t.*, [$]-4-" // arm64:"TEXT\t.*, [$]0-" // mips:"TEXT\t.*, [$]-4-" // ppc64x:"TEXT\t.*, [$]0-"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 3.4K bytes - Viewed (0) -
src/cmd/asm/internal/lex/stack.go
import ( "text/scanner" "cmd/internal/src" ) // A Stack is a stack of TokenReaders. As the top TokenReader hits EOF, // it resumes reading the next one down. type Stack struct { tr []TokenReader } // Push adds tr to the top (end) of the input stack. (Popping happens automatically.) func (s *Stack) Push(tr TokenReader) { s.tr = append(s.tr, tr) } func (s *Stack) Next() ScanToken { tos := s.tr[len(s.tr)-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 09 22:33:23 UTC 2017 - 1.2K bytes - Viewed (0) -
src/internal/abi/stack.go
// // This value must be multiplied by the stack guard multiplier, so do not // use it directly. See runtime/stack.go:stackNosplit and // cmd/internal/objabi/stack.go:StackNosplit. StackNosplitBase = 800 // We have three different sequences for stack bounds checks, depending on // whether the stack frame of a function is small, big, or huge. // After a stack split check the SP is allowed to be StackSmall bytes below
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 21 19:28:56 UTC 2023 - 1.3K bytes - Viewed (0) -
src/runtime/debug/stack.go
) // PrintStack prints to standard error the stack trace returned by runtime.Stack. func PrintStack() { os.Stderr.Write(Stack()) } // Stack returns a formatted stack trace of the goroutine that calls it. // It calls [runtime.Stack] with a large enough buffer to capture the entire trace. func Stack() []byte { buf := make([]byte, 1024) for { n := runtime.Stack(buf, false) if n < len(buf) { return buf[:n] }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 15:19:04 UTC 2024 - 3.2K bytes - Viewed (0) -
test/stack.go
// Copyright 2009 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. // Test stack splitting code. // Try to tickle stack splitting bugs by doing // go, defer, and closure calls at different stack depths. package main type T [20]int func g(c chan int, t T) { s := 0 for i := 0; i < len(t); i++ { s += t[i] } c <- s }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:48:19 UTC 2012 - 1.7K bytes - Viewed (0) -
src/runtime/symtabinl_test.go
} if len(stack) > 0 { stack += " " } stack += FmtSprintf("%s:%d", name, line-tiuStart) } if stack != prevStack { prevStack = stack t.Logf("tiuTest+%#x: %s", pc-pc1, stack) if _, ok := want[stack]; ok { want[stack]++ } } } // Check that we got all the stacks we wanted. for stack, count := range want { if count == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:41:45 UTC 2024 - 3K bytes - Viewed (0) -
src/runtime/debugcall.go
// explaining why. // //go:nosplit func debugCallCheck(pc uintptr) string { // No user calls from the system stack. if getg() != getg().m.curg { return debugCallSystemStack } if sp := getcallersp(); !(getg().stack.lo < sp && sp <= getg().stack.hi) { // Fast syscalls (nanotime) and racecall switch to the // g0 stack without switching g. We can't safely make // a call in this state. (We can't even safely // systemstack.)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 05 20:50:21 UTC 2024 - 7.1K bytes - Viewed (0) -
test/fixedbugs/issue10353.go
// Create a new goroutine to get a default-size stack segment. go func() { x := new(X) clos(x.foo)() c <- true }() <-c } type X int func (x *X) foo() { } func clos(x func()) func() { f := func() { print("") x() // This statement crashed, because the partial call was allocated on the old stack. } // Grow stack so that partial call x becomes invalid if allocated on stack.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 01 13:47:20 UTC 2015 - 917 bytes - Viewed (0) -
test/fixedbugs/issue7690.go
// issue 7690 - Stack and other routines did not back up initial PC // into CALL instruction, instead reporting line number of next instruction, // which might be on a different line. package main import ( "bytes" "regexp" "runtime" "strconv" ) func main() { buf1 := make([]byte, 1000) buf2 := make([]byte, 1000)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 1.2K bytes - Viewed (0)