Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 70 of 694 for Atack (0.03 sec)

  1. src/runtime/testdata/testprog/checkptr.go

    }
    
    // CheckPtrAlignmentNilPtr tests that checkptrAlignment doesn't crash
    // on nil pointers (#47430).
    func CheckPtrAlignmentNilPtr() {
    	var do func(int)
    	do = func(n int) {
    		// Inflate the stack so runtime.shrinkstack gets called during GC
    		if n > 0 {
    			do(n - 1)
    		}
    
    		var p unsafe.Pointer
    		_ = (*int)(p)
    	}
    
    	go func() {
    		for {
    			runtime.GC()
    		}
    	}()
    
    	go func() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Aug 31 17:15:15 UTC 2022
    - 2.4K bytes
    - Viewed (0)
  2. src/runtime/mspanset.go

    // spanSetBlockAlloc represents a concurrent pool of spanSetBlocks.
    type spanSetBlockAlloc struct {
    	stack lfstack
    }
    
    // alloc tries to grab a spanSetBlock out of the pool, and if it fails
    // persistentallocs a new one and returns it.
    func (p *spanSetBlockAlloc) alloc() *spanSetBlock {
    	if s := (*spanSetBlock)(p.stack.pop()); s != nil {
    		return s
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Mar 25 19:53:03 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  3. src/runtime/mpagecache.go

    }
    
    // flush empties out unallocated free pages in the given cache
    // into s. Then, it clears the cache, such that empty returns
    // true.
    //
    // p.mheapLock must be held.
    //
    // Must run on the system stack because p.mheapLock must be held.
    //
    //go:systemstack
    func (c *pageCache) flush(p *pageAlloc) {
    	assertLockHeld(p.mheapLock)
    
    	if c.empty() {
    		return
    	}
    	ci := chunkIndex(c.base)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Apr 19 14:30:00 UTC 2023
    - 5.6K bytes
    - Viewed (0)
  4. src/cmd/cgo/internal/test/callback_windows.go

    	}
    	return i;
    #else
    	return 0;
    #endif
    }
    */
    import "C"
    
    import (
    	"internal/testenv"
    	"reflect"
    	"runtime"
    	"strings"
    	"testing"
    	"unsafe"
    )
    
    // Test that the stack can be unwound through a call out and call back
    // into Go.
    func testCallbackCallersSEH(t *testing.T) {
    	testenv.SkipIfOptimizationOff(t) // This test requires inlining.
    	if runtime.Compiler != "gc" {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Nov 29 16:01:37 UTC 2023
    - 2.6K bytes
    - Viewed (0)
  5. test/peano.go

    // Factorial
    
    var results = [...]int{
    	1, 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800,
    	39916800, 479001600,
    }
    
    func main() {
    	max := 9
    	if runtime.GOARCH == "wasm" {
    		max = 7 // stack size is limited
    	}
    	for i := 0; i <= max; i++ {
    		if f := count(fact(gen(i))); f != results[i] {
    			println("FAIL:", i, "!:", f, "!=", results[i])
    			panic(0)
    		}
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Apr 30 19:39:18 UTC 2018
    - 2.2K bytes
    - Viewed (0)
  6. src/log/slog/value.go

    			rv = AnyValue(fmt.Errorf("LogValue panicked\n%s", stack(3, 5)))
    		}
    	}()
    
    	for i := 0; i < maxLogValues; i++ {
    		if v.Kind() != KindLogValuer {
    			return v
    		}
    		v = v.LogValuer().LogValue()
    	}
    	err := fmt.Errorf("LogValue called too many times on Value of type %T", orig.Any())
    	return AnyValue(err)
    }
    
    func stack(skip, nFrames int) string {
    	pcs := make([]uintptr, nFrames+1)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 16 16:12:08 UTC 2024
    - 13.3K bytes
    - Viewed (0)
  7. src/cmd/compile/internal/ssa/writebarrier.go

    	if !ok {
    		v.Fatalf("store aux is not a type: %s", v.LongString())
    	}
    	if !t.HasPointers() {
    		return false
    	}
    	dst := v.Args[0]
    	if IsStackAddr(dst) {
    		return false // writes into the stack don't need write barrier
    	}
    	// If we're writing to a place that might have heap pointers, we need
    	// the write barrier.
    	if mightContainHeapPointer(dst, t.Size(), v.MemoryArg(), zeroes) {
    		return true
    	}
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 08 19:09:14 UTC 2023
    - 23.5K bytes
    - Viewed (0)
  8. src/cmd/trace/jsontrace_test.go

    	}
    }
    
    // filterStackRootFunc returns an event filter that returns true if the function
    // at the root of the stack trace is named name.
    func filterStackRootFunc(name string) eventFilterFn {
    	return func(e *format.Event, data *format.Data) bool {
    		frames := stackFrames(data, e.Stack)
    		rootFrame := frames[len(frames)-1]
    		return strings.HasPrefix(rootFrame, name+":")
    	}
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 7.8K bytes
    - Viewed (0)
  9. src/syscall/exec_bsd.go

    // they might have been locked at the time of the fork. This means
    // no rescheduling, no malloc calls, and no new stack segments.
    // For the same reason compiler does not race instrument it.
    // The calls to RawSyscall are okay because they are assembly
    // functions that do not grow the stack.
    //
    //go:norace
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Sep 29 18:51:35 UTC 2023
    - 7.9K bytes
    - Viewed (0)
  10. src/net/packetconn_test.go

    // license that can be found in the LICENSE file.
    
    // This file implements API tests across platforms and should never have a build
    // constraint.
    
    package net
    
    import (
    	"os"
    	"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
    
    func packetConnTestData(t *testing.T, network string) ([]byte, func()) {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Sep 18 17:20:52 UTC 2023
    - 3K bytes
    - Viewed (0)
Back to top