- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 183 for mheap (0.06 sec)
-
src/runtime/mklockrank.go
stackLarge, stackpool, wbufSpans # Above mheap is anything that can call the span allocator. < mheap; # Below mheap is the span allocator implementation. # # Specials: we're allowed to allocate a special while holding # an mspanSpecial lock, and they're part of the malloc implementation. # Pinner bits might be freed by the span allocator. mheap, mspanSpecial < mheapSpecial; mheap, mheapSpecial < globalAlloc;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 9.1K bytes - Viewed (0) -
src/runtime/mcentral.go
c.fullSwept(sg).push(s) } } } // grow allocates a new empty span from the heap and initializes it for c's size class. func (c *mcentral) grow() *mspan { npages := uintptr(class_to_allocnpages[c.spanclass.sizeclass()]) size := uintptr(class_to_size[c.spanclass.sizeclass()]) s := mheap_.alloc(npages, c.spanclass) if s == nil { return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K 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) -
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) -
staging/src/k8s.io/apimachinery/pkg/util/cache/expiring.go
} func (c *Expiring) gc(now time.Time) { for { // Return from gc if the heap is empty or the next element is not yet // expired. // // heap[0] is a peek at the next element in the heap, which is not obvious // from looking at the (*expiringHeap).Pop() implementation below. // heap.Pop() swaps the first entry with the last entry of the heap, then // calls (*expiringHeap).Pop() which returns the last element.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 22 15:51:23 UTC 2023 - 5.6K bytes - Viewed (0) -
src/runtime/traceallocfree.go
throw("traceSnapshotMemory: tracing is not enabled") } // Write out all the heap spans and heap objects. for _, s := range mheap_.allspans { if s.state.get() == mSpanDead { continue } // It's some kind of span, so trace that it exists. trace.SpanExists(s) // Write out allocated objects if it's a heap span. if s.state.get() != mSpanInUse { continue } // Find all allocated objects.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 20:32:51 UTC 2024 - 5.9K bytes - Viewed (0) -
test/fixedbugs/issue13799.go
// Heap -> stack pointer eventually causes badness when stack reallocation // occurs. var fn func() // ERROR "moved to heap: fn$" i := 0 // ERROR "moved to heap: i$" for ; i < maxI; i++ { // var fn func() // this makes it work, because fn stays off heap j := 0 // ERROR "moved to heap: j$" fn = func() { // ERROR "func literal escapes to heap$" m[i] = append(m[i], 0) if j < 25 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 18:50:24 UTC 2023 - 4.9K bytes - Viewed (0) -
src/internal/trace/batchcursor_test.go
heap[len(heap)-1].ev.time = 21 heapUpdate(heap, len(heap)-1) checkHeap(t, heap) if heap[len(heap)-1].ev.time != 21 { t.Fatalf("heap update failed, expected %d as heap min: %s", 21, heapDebugString(heap)) } // Update the last element to be smaller. heap[len(heap)-1].ev.time = 7 heapUpdate(heap, len(heap)-1) checkHeap(t, heap) if heap[len(heap)-1].ev.time == 21 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 3K bytes - Viewed (0) -
test/escape_closure.go
func ClosureCallArgs9() { // BAD: x should not leak x := 0 // ERROR "moved to heap: x" for { defer func(p *int) { // ERROR "func literal escapes to heap" "p does not escape" *p = 1 }(&x) } } func ClosureCallArgs10() { for { x := 0 // ERROR "moved to heap: x" defer func(p *int) { // ERROR "func literal escapes to heap" "p does not escape" *p = 1 }(&x) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 17 16:36:09 UTC 2023 - 4.6K bytes - Viewed (0)