Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 65 for Atack (0.15 sec)

  1. src/runtime/checkptr.go

    //
    //go:linkname checkptrBase
    func checkptrBase(p unsafe.Pointer) uintptr {
    	// stack
    	if gp := getg(); gp.stack.lo <= uintptr(p) && uintptr(p) < gp.stack.hi {
    		// TODO(mdempsky): Walk the stack to identify the
    		// specific stack frame or even stack object that p
    		// points into.
    		//
    		// In the mean time, use "1" as a pseudo-address to
    		// represent the stack. This is an invalid address on
    		// all platforms, so it's guaranteed to be distinct
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 00:18:55 UTC 2024
    - 3.6K bytes
    - Viewed (0)
  2. 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)
  3. src/cmd/compile/internal/ssagen/nowb.go

    				call = funcs[call.target]
    			}
    			// Seeing this error in a failed CI run? It indicates that
    			// a function in the runtime package marked nowritebarrierrec
    			// (the outermost stack element) was found, by a static
    			// reachability analysis over the fully lowered optimized code,
    			// to call a function (fn) that involves a write barrier.
    			//
    			// Even if the call path is infeasable,
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 17:29:46 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  4. src/runtime/traceexp.go

    	traceEvHeapObjectFree  // heap object free [timestamp, id]
    
    	// Experimental goroutine stack events. IDs map reversibly to addresses.
    	traceEvGoroutineStack      // stack exists [timestamp, id, order]
    	traceEvGoroutineStackAlloc // stack alloc [timestamp, id, order]
    	traceEvGoroutineStackFree  // stack free [timestamp, id]
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 17:47:01 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  5. src/cmd/go/internal/work/security_test.go

    	{"-fno-pie"},
    	{"-fPIE"},
    	{"-fno-PIE"},
    	{"-fsplit-stack"},
    	{"-fno-split-stack"},
    	{"-fstack-xxx"},
    	{"-fno-stack-xxx"},
    	{"-fsanitize=hands"},
    	{"-g"},
    	{"-ggdb"},
    	{"-march=souza"},
    	{"-mcmodel=medium"},
    	{"-mcpu=123"},
    	{"-mfpu=123"},
    	{"-mlarge-data-threshold=16"},
    	{"-mtune=happybirthday"},
    	{"-mstack-overflow"},
    	{"-mno-stack-overflow"},
    	{"-mmacosx-version"},
    	{"-mnop-fun-dllimport"},
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon May 20 15:47:34 UTC 2024
    - 7.3K bytes
    - Viewed (0)
  6. src/internal/trace/base.go

    		},
    	}
    	e.base.args[0] = uint64(s.stack)
    	return e
    }
    
    // stack represents a goroutine stack sample.
    type stack struct {
    	pcs []uint64
    }
    
    func (s stack) String() string {
    	var sb strings.Builder
    	for _, frame := range s.pcs {
    		fmt.Fprintf(&sb, "\t%#v\n", frame)
    	}
    	return sb.String()
    }
    
    // frame represents a single stack frame.
    type frame struct {
    	pc     uint64
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 17 18:48:18 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  7. src/runtime/lock_sema.go

    	gp.m.blocked = false
    }
    
    //go:nosplit
    func notetsleep_internal(n *note, ns int64, gp *g, deadline int64) bool {
    	// gp and deadline are logically local variables, but they are written
    	// as parameters so that the stack space they require is charged
    	// to the caller.
    	// This reduces the nosplit footprint of notetsleep_internal.
    	gp = getg()
    
    	// Register for wakeup on n->waitm.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:57:37 UTC 2024
    - 6.8K bytes
    - Viewed (0)
  8. src/net/main_test.go

    func runningGoroutines() []string {
    	var gss []string
    	b := make([]byte, 2<<20)
    	b = b[:runtime.Stack(b, true)]
    	for _, s := range strings.Split(string(b), "\n\n") {
    		_, stack, _ := strings.Cut(s, "\n")
    		stack = strings.TrimSpace(stack)
    		if !strings.Contains(stack, "created by net") {
    			continue
    		}
    		gss = append(gss, stack)
    	}
    	slices.Sort(gss)
    	return gss
    }
    
    func printInflightSockets() {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 23 01:00:11 UTC 2024
    - 7.5K bytes
    - Viewed (0)
  9. test/fixedbugs/bug385_64.go

    // license that can be found in the LICENSE file.
    
    // Issue 2444
    // Issue 4666: issue with arrays of exactly 4GB.
    
    package main
    
    var z [10 << 20]byte
    
    func main() { // GC_ERROR "stack frame too large"
    	// seq 1 206 | sed 's/.*/	var x& [10<<20]byte/'
    	// seq 1 206 | sed 's/.*/	z = x&/'
    	var x1 [10<<20]byte
    	var x2 [10<<20]byte
    	var x3 [10<<20]byte
    	var x4 [10<<20]byte
    	var x5 [10<<20]byte
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 09 16:41:23 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  10. src/runtime/tracetype.go

    // Use of this source code is governed by a BSD-style
    // license that can be found in the LICENSE file.
    
    // Trace stack table and acquisition.
    
    package runtime
    
    import (
    	"internal/abi"
    	"internal/goarch"
    	"unsafe"
    )
    
    // traceTypeTable maps stack traces (arrays of PC's) to unique uint32 ids.
    // It is lock-free for reading.
    type traceTypeTable struct {
    	tab traceMap
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 22 20:31:27 UTC 2024
    - 2.3K bytes
    - Viewed (0)
Back to top