- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 55 for notinheap (0.37 sec)
-
src/runtime/tracemap.go
// get shifted out during iteration, and new nodes will just be appended to the 0th child). type traceMapNode struct { _ sys.NotInHeap children [4]atomic.UnsafePointer // *traceMapNode (can't use generics because it's notinheap) hash uintptr id uint64 data []byte } // stealID steals an ID from the table, ensuring that it will not // appear in the table anymore.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 15 17:03:35 UTC 2024 - 4.5K bytes - Viewed (0) -
test/fixedbugs/issue40954.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 15:27:18 UTC 2022 - 874 bytes - Viewed (0) -
test/fixedbugs/notinheap3.go
// errorcheck -+ -0 -l -d=wb // Copyright 2016 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 write barrier elimination for notinheap. //go:build cgo package p import "runtime/cgo" type t1 struct { x *nih s []nih y [1024]byte // Prevent write decomposition } type t2 struct { x *ih s []ih y [1024]byte
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 17:46:15 UTC 2022 - 1.3K bytes - Viewed (0) -
src/runtime/cgo/cgo.go
#cgo solaris CPPFLAGS: -D_POSIX_PTHREAD_SEMANTICS */ import "C" import "runtime/internal/sys" // Incomplete is used specifically for the semantics of incomplete C types. type Incomplete struct { _ sys.NotInHeap
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 14:29:46 UTC 2023 - 1.1K bytes - Viewed (0) -
src/cmd/compile/internal/types/size.go
func PtrDataSize(t *Type) int64 { CalcSize(t) x := t.ptrBytes if t.Kind() == TPTR && t.Elem().NotInHeap() { // Note: this is done here instead of when we're setting // the ptrBytes field, because at that time (in NewPtr, usually) // the NotInHeap bit of the element type might not be set yet. x = 0 } return x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 15K bytes - Viewed (0) -
src/runtime/mgcstack.go
// Must be smaller than or equal to workbuf. type stackWorkBuf struct { _ sys.NotInHeap stackWorkBufHdr obj [(_WorkbufSize - unsafe.Sizeof(stackWorkBufHdr{})) / goarch.PtrSize]uintptr } // Header declaration must come after the buf declaration above, because of issue #14620. type stackWorkBufHdr struct { _ sys.NotInHeap workbufhdr next *stackWorkBuf // linked list of workbufs
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 21 21:06:52 UTC 2023 - 10.6K bytes - Viewed (0) -
src/runtime/malloc.go
type notInHeap struct{ _ sys.NotInHeap } func (p *notInHeap) add(bytes uintptr) *notInHeap { return (*notInHeap)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) + bytes)) } // computeRZlog computes the size of the redzone. // Refer to the implementation of the compiler-rt. func computeRZlog(userSize uintptr) uintptr { switch { case userSize <= (64 - 16):
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
r := sysReserve(nil, b) if r == nil { throw("failed to reserve page summary memory") } // Put this reservation into a slice. sl := notInHeapSlice{(*notInHeap)(r), 0, entries} p.summary[l] = *(*[]pallocSum)(unsafe.Pointer(&sl)) } } // sysGrow performs architecture-dependent operations on heap // growth for the page allocator, such as mapping in new memory
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/runtime/mcheckmark.go
// per-arena bitmap with a bit for every word in the arena. The mark // is stored on the bit corresponding to the first word of the marked // allocation. type checkmarksMap struct { _ sys.NotInHeap b [heapArenaBytes / goarch.PtrSize / 8]uint8 } // If useCheckmark is true, marking of an object uses the checkmark // bits instead of the standard mark bits. var useCheckmark = false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 2.8K bytes - Viewed (0) -
src/runtime/mpagealloc_32bit.go
// the new slice should start. for l, shift := range levelShift { entries := 1 << (heapAddrBits - shift) // Put this reservation into a slice. sl := notInHeapSlice{(*notInHeap)(reservation), 0, entries} p.summary[l] = *(*[]pallocSum)(unsafe.Pointer(&sl)) reservation = add(reservation, uintptr(entries)*pallocSumBytes) } } // See mpagealloc_64bit.go for details.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 20 20:08:25 UTC 2023 - 4.6K bytes - Viewed (0)