- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 55 for notinheap (0.37 sec)
-
src/runtime/mranges.go
sysStat *sysMemStat } func (a *addrRanges) init(sysStat *sysMemStat) { ranges := (*notInHeapSlice)(unsafe.Pointer(&a.ranges)) ranges.len = 0 ranges.cap = 16 ranges.array = (*notInHeap)(persistentalloc(unsafe.Sizeof(addrRange{})*uintptr(ranges.cap), goarch.PtrSize, sysStat)) a.sysStat = sysStat a.totalBytes = 0 } // findSucc returns the first index in a such that addr is
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
src/runtime/debuglog.go
l.w.varint(-1) } return l } // A dlogger writes to the debug log. // // To obtain a dlogger, call dlog(). When done with the dlogger, call // end(). type dlogger struct { _ sys.NotInHeap w debugLogWriter // allLink is the next dlogger in the allDloggers list. allLink *dlogger // owned indicates that this dlogger is owned by an M. This is // accessed atomically. owned atomic.Uint32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 18.3K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
// Yes, if the representation is a single pointer. func IsDirectIface(t *Type) bool { switch t.Kind() { case TPTR: // Pointers to notinheap types must be stored indirectly. See issue 42076. return !t.Elem().NotInHeap() case TCHAN, TMAP, TFUNC, TUNSAFEPTR: return true case TARRAY: // Array of 1 direct iface type can be direct.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
src/runtime/slice.go
"runtime/internal/sys" "unsafe" ) type slice struct { array unsafe.Pointer len int cap int } // A notInHeapSlice is a slice backed by runtime/internal/sys.NotInHeap memory. type notInHeapSlice struct { array *notInHeap len int cap int } func panicmakeslicelen() { panic(errorString("makeslice: len out of range")) } func panicmakeslicecap() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 12.2K bytes - Viewed (0) -
src/runtime/mheap.go
return mSpanState(b.s.Load()) } // mSpanList heads a linked list of spans. type mSpanList struct { _ sys.NotInHeap first *mspan // first span in list, or nil if none last *mspan // last span in list, or nil if none } type mspan struct { _ sys.NotInHeap next *mspan // next span in list, or nil if none prev *mspan // previous span in list, or nil if none
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/runtime/tracebuf.go
} // traceBuf is per-M tracing buffer. // // TODO(mknyszek): Rename traceBuf to traceBatch, since they map 1:1 with event batches. type traceBuf struct { _ sys.NotInHeap traceBufHeader arr [64<<10 - unsafe.Sizeof(traceBufHeader{})]byte // underlying buffer for traceBufHeader.buf } // byte appends v to buf. func (buf *traceBuf) byte(v byte) { buf.arr[buf.pos] = v
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 6.8K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/subr.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 05 19:45:58 UTC 2023 - 20.2K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
func walkMakeSlice(n *ir.MakeExpr, init *ir.Nodes) ir.Node { l := n.Len r := n.Cap if r == nil { r = safeExpr(l, init) l = r } t := n.Type() if t.Elem().NotInHeap() { base.Errorf("%v can't be allocated in Go; it is incomplete (or unallocatable)", t.Elem()) } if n.Esc() == ir.EscNone { if why := escape.HeapAllocReason(n); why != "" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
src/go/internal/gccgoimporter/importer_test.go
{pkgpath: "issue31540", name: "S", gccgoVersion: 7, want: "type S struct{b int; map[Y]Z}"}, // should want "type S struct{b int; A2}" (issue #44410) {pkgpath: "issue34182", name: "T1", want: "type T1 struct{f *T2}"}, {pkgpath: "notinheap", name: "S", want: "type S struct{}"}, } func TestGoxImporter(t *testing.T) { testenv.MustHaveExec(t) initmap := make(map[*types.Package]InitData) imp := GetImporter([]string{"testdata"}, initmap)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 15 20:17:57 UTC 2022 - 7.2K bytes - Viewed (0) -
src/reflect/deepequal.go
hard := func(v1, v2 Value) bool { switch v1.Kind() { case Pointer: if !v1.typ().Pointers() { // not-in-heap pointers can't be cyclic. // At least, all of our current uses of runtime/internal/sys.NotInHeap // have that property. The runtime ones aren't cyclic (and we don't use // DeepEqual on them anyway), and the cgo-generated ones are // all empty structs. return false } fallthrough
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:34:30 UTC 2024 - 7.4K bytes - Viewed (0)