- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 553 for mheap (0.09 sec)
-
src/runtime/mstats.go
// Mallocs is the cumulative count of heap objects allocated. // The number of live objects is Mallocs - Frees. Mallocs uint64 // Frees is the cumulative count of heap objects freed. Frees uint64 // Heap memory statistics. // // Interpreting the heap statistics requires some knowledge of // how Go organizes memory. Go divides the virtual address // space of the heap into "spans", which are contiguous
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 34.2K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
// the heap goal is defined in terms of bytes of objects, rather than pages like // RSS. As a result, we need to take into account for fragmentation internal to // spans. heapGoal / lastHeapGoal defines the ratio between the current heap goal // and the last heap goal, which tells us by how much the heap is growing and // shrinking. We estimate what the heap will grow to in terms of pages by taking
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
src/runtime/mgc.go
mheap_.pagesSwept.Store(0) mheap_.sweepArenas = mheap_.allArenas mheap_.reclaimIndex.Store(0) mheap_.reclaimCredit.Store(0) unlock(&mheap_.lock) sweep.centralIndex.clear() if !concurrentSweep || mode == gcForceBlockMode { // Special case synchronous sweep. // Record that no proportional sweeping has to happen. lock(&mheap_.lock) mheap_.sweepPagesPerByte = 0 unlock(&mheap_.lock)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/container/heap/heap.go
// Package heap provides heap operations for any type that implements // heap.Interface. A heap is a tree with the property that each node is the // minimum-valued node in its subtree. // // The minimum element in the tree is the root, at index 0. // // A heap is a common way to implement a priority queue. To build a priority // queue, implement the Heap interface with the (negative) priority as the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 12 14:39:10 UTC 2023 - 3.3K bytes - Viewed (0) -
pkg/scheduler/internal/heap/heap.go
return h.data.Peek() } // Pop returns the head of the heap and removes it. func (h *Heap) Pop() (interface{}, error) { obj := heap.Pop(h.data) if obj != nil { if h.metricRecorder != nil { h.metricRecorder.Dec() } return obj, nil } return nil, fmt.Errorf("object was removed from heap data") } // Get returns the requested item, or sets exists=false.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Apr 29 18:37:35 UTC 2022 - 6.7K bytes - Viewed (0) -
src/cmd/link/internal/ld/heap.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package ld import "cmd/link/internal/loader" // Min-heap implementation, for the deadcode pass. // Specialized for loader.Sym elements. type heap []loader.Sym func (h *heap) push(s loader.Sym) { *h = append(*h, s) // sift up n := len(*h) - 1 for n > 0 { p := (n - 1) / 2 // parent if (*h)[p] <= (*h)[n] { break
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 14 16:55:22 UTC 2023 - 1.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
MinMaxPriorityQueue<T> mmHeap; public InvertedMinMaxPriorityQueue(Comparator<T> comparator) { mmHeap = MinMaxPriorityQueue.orderedBy(comparator).create(); } @Override protected Queue<T> delegate() { return mmHeap; } @Override public @Nullable T poll() { return mmHeap.pollLast(); } } public enum HeapType {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Apr 19 19:24:36 UTC 2023 - 4.3K bytes - Viewed (0) -
src/container/heap/heap_test.go
// license that can be found in the LICENSE file. package heap import ( "math/rand" "testing" ) type myHeap []int func (h *myHeap) Less(i, j int) bool { return (*h)[i] < (*h)[j] } func (h *myHeap) Swap(i, j int) { (*h)[i], (*h)[j] = (*h)[j], (*h)[i] } func (h *myHeap) Len() int { return len(*h) } func (h *myHeap) Pop() (v any) { *h, v = (*h)[:h.Len()-1], (*h)[h.Len()-1] return
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 13 18:45:54 UTC 2021 - 3.4K bytes - Viewed (0) -
src/cmd/trace/testdata/go122.test
String id=179 data="net.setKeepAlive" String id=180 data="/usr/local/google/home/mknyszek/work/go-1/src/net/sockopt_posix.go" String id=181 data="runtime.(*mheap).alloc" String id=182 data="/usr/local/google/home/mknyszek/work/go-1/src/runtime/mheap.go" String id=183 data="runtime.(*mcentral).grow" String id=184 data="/usr/local/google/home/mknyszek/work/go-1/src/runtime/mcentral.go" String id=185
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 17:15:58 UTC 2024 - 166K bytes - Viewed (0) -
src/runtime/metrics.go
a.gcCyclesForced = uint64(memstats.numforcedgc) systemstack(func() { lock(&mheap_.lock) a.mSpanSys = memstats.mspan_sys.load() a.mSpanInUse = uint64(mheap_.spanalloc.inuse) a.mCacheSys = memstats.mcache_sys.load() a.mCacheInUse = uint64(mheap_.cachealloc.inuse) unlock(&mheap_.lock) }) } // cpuStatsAggregate represents CPU stats obtained from the runtime
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 26K bytes - Viewed (0)