- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 223 for heapUp (0.12 sec)
-
src/runtime/mbarrier.go
// // 1. shade(*slot) prevents a mutator from hiding an object by moving // the sole pointer to it from the heap to its stack. If it attempts // to unlink an object from the heap, this will shade it. // // 2. shade(ptr) prevents a mutator from hiding an object by moving // the sole pointer to it from its stack into a black object in the // heap. If it attempts to install the pointer into a black object, // this will shade it. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 15.7K bytes - Viewed (0) -
src/runtime/pprof/pprof.go
// output to a writer during profiling. // // # Heap profile // // The heap profile reports statistics as of the most recently completed // garbage collection; it elides more recent allocation to avoid skewing // the profile away from live data and toward garbage. // If there has been no garbage collection at all, the heap profile reports // all known allocations. This exception helps mainly in programs running
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 30.6K bytes - Viewed (0) -
src/internal/trace/event/go122/event.go
// Experimental heap span events. Added in Go 1.23. EvSpan // heap span exists [timestamp, id, npages, type/class] EvSpanAlloc // heap span alloc [timestamp, id, npages, type/class] EvSpanFree // heap span free [timestamp, id] // Experimental heap object events. Added in Go 1.23. EvHeapObject // heap object exists [timestamp, id, type] EvHeapObjectAlloc // heap object alloc [timestamp, id, type]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 14.8K bytes - Viewed (0) -
src/net/http/pprof/pprof.go
// - gc=N (heap profile): N > 0: run a garbage collection cycle before profiling // - seconds=N (allocs, block, goroutine, heap, mutex, threadcreate profiles): return a delta profile // - seconds=N (cpu (profile), trace profiles): profile for the given duration // // # Usage examples // // Use the pprof tool to look at the heap profile: // // go tool pprof http://localhost:6060/debug/pprof/heap
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:34:05 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/metrics_test.go
case "/memory/classes/heap/objects:bytes": objects.totalBytes = samples[i].Value.Uint64() case "/gc/heap/objects:objects": objects.total = samples[i].Value.Uint64() case "/gc/heap/allocs:bytes": objects.allocdBytes = samples[i].Value.Uint64() case "/gc/heap/allocs:objects": objects.allocs = samples[i].Value.Uint64() case "/gc/heap/allocs-by-size:bytes":
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 45K bytes - Viewed (0) -
src/time/tick_test.go
return } } t.Errorf("len(C) = %d, want 1", n) } // Test simple stop; timer never in heap. tim.Stop() noTick() // Test modify of timer not in heap. tim.Reset(10000 * Second) noTick() if synctimerchan { // Test modify of timer in heap. tim.Reset(1) Sleep(sched) if l, c := len(C), cap(C); l != 0 || c != 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 11 17:10:37 UTC 2024 - 14.7K bytes - Viewed (0) -
src/runtime/arena.go
// Each chunk must be a multiple of the heap arena size, or the heap arena size must // be divisible by the arena chunks. The address space for each chunk, and each // corresponding heapArena for that address space, are eternally reserved for use as // arena chunks. That is, they can never be used for the general heap. Each chunk // is also represented by a single mspan, and is modeled as a single large heap
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K bytes - Viewed (0) -
src/runtime/mspanset.go
// span in the heap were stored in this set, and each span were // the minimum size (1 runtime page, 8 KiB), then roughly the // smallest heap which would be unrepresentable is 32 TiB in size. index atomicHeadTailIndex } const ( spanSetBlockEntries = 512 // 4KB on 64-bit spanSetInitSpineCap = 256 // Enough for 1GB heap on 64-bit ) type spanSetBlock struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.1K bytes - Viewed (0) -
src/runtime/mbitmap.go
} getg().m.traceback = 2 throw("found bad pointer in Go heap (incorrect use of unsafe or cgo?)") } // findObject returns the base address for the heap object containing // the address p, the object's span, and the index of the object in s. // If p does not point into a heap object, it returns base == 0. // // If p points is an invalid heap pointer and debug.invalidptr != 0, // findObject panics. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/runtime/mgcsweep.go
// but is critical when allocating new spans. The entry point for // this is mheap_.reclaim and it's driven by a sequential scan of // the page marks bitmap in the heap arenas. // // Both algorithms ultimately call mspan.sweep, which sweeps a single // heap span. package runtime import ( "internal/abi" "internal/runtime/atomic" "unsafe" ) var sweep sweepdata // State of background sweep.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:52:18 UTC 2024 - 32.9K bytes - Viewed (0)