- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,946 for Stack0 (0.16 sec)
-
src/runtime/testdata/testprogcgo/stackswitch.c
stackSwitchCallback(); // Next, verify that switching stacks doesn't break callbacks. char *stack1 = malloc(STACK_SIZE); if (stack1 == NULL) { perror("malloc"); exit(1); } // Allocate the second stack before freeing the first to ensure we don't get // the same address from malloc. // // Will be freed in stackSwitchThread2. stack2 = malloc(STACK_SIZE); if (stack1 == NULL) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 26 15:17:33 UTC 2023 - 3.9K 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/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) -
releasenotes/notes/45564-virtualHost-Domains-for-dual-stack.yaml
apiVersion: release-notes/v2 kind: bug-fix area: traffic-management issue: - 45557 releaseNotes: - |
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jul 12 23:53:06 UTC 2023 - 229 bytes - Viewed (0) -
src/runtime/lfstack_test.go
if node == nil { t.Fatalf("stack is empty") } if node.data != 43 { t.Fatalf("no lifo") } // Pop another. node = toMyNode(LFStackPop(stack)) if node == nil { t.Fatalf("stack is empty") } if node.data != 42 { t.Fatalf("no lifo") } // Check the stack is empty again. if LFStackPop(stack) != nil { t.Fatalf("stack is not empty") } if *stack != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 17 23:12:04 UTC 2022 - 2.7K bytes - Viewed (0) -
src/cmd/trace/pprof.go
m.pcs[pcs] = stack m.stacks[stack] = rec return rec } func (m *stackMap) profile() []traceviewer.ProfileRecord { prof := make([]traceviewer.ProfileRecord, 0, len(m.stacks)) for stack, record := range m.stacks { rec := *record i := 0 stack.Frames(func(frame trace.StackFrame) bool { rec.Stack = append(rec.Stack, &trace.Frame{ PC: frame.PC, Fn: frame.Func,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.1K bytes - Viewed (0)