- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 482 for mheap (0.08 sec)
-
src/runtime/internal/sys/nih.go
// - Maps and channels contains no-in-heap types are disallowed. // // 4. Write barriers on pointers to not-in-heap types can be omitted. // // The last point is the real benefit of NotInHeap. The runtime uses // it for low-level internal structures to avoid memory barriers in the // scheduler and the memory allocator where they are illegal or simply
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 02 18:24:50 UTC 2022 - 1.7K bytes - Viewed (0) -
src/runtime/time.go
} if heap[i].timer != tw.timer { heap[i] = tw } } // siftDown puts the timer at position i in the right place // in the heap by moving it down toward the bottom of the heap. func (ts *timers) siftDown(i int) { heap := ts.heap n := len(heap) if i >= n { badTimer() } if i*timerHeapN+1 >= n { return } tw := heap[i] when := tw.when if when <= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 14:36:24 UTC 2024 - 37.5K bytes - Viewed (0) -
test/escape4.go
p = alloc(3) // ERROR "inlining call to alloc" "moved to heap: x" } f() } func f2() {} // ERROR "can inline f2" // No inline for recover; panic now allowed to inline. func f3() { panic(1) } // ERROR "can inline f3" "1 escapes to heap" func f4() { recover() } func f5() *byte { // ERROR "can inline f5" type T struct { x [1]byte } t := new(T) // ERROR "new.T. escapes to heap"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Sep 14 19:43:26 UTC 2023 - 1.4K bytes - Viewed (0) -
pkg/test/loadbalancersim/timer/queue.go
} } }() return q } func (q *Queue) Len() int { q.mutex.Lock() defer q.mutex.Unlock() return q.heap.Len() } func (q *Queue) Schedule(handler func(), deadline time.Time) { // Add the timer to the heap. q.mutex.Lock() heap.Push(&q.heap, &entry{ handler: handler, deadline: deadline, index: 0, }) q.mutex.Unlock() // Request that the timer be reset.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 19:13:32 UTC 2023 - 3.6K bytes - Viewed (0) -
src/cmd/link/internal/ld/outbuf_mmap.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:20:31 UTC 2024 - 1.4K bytes - Viewed (0) -
pkg/test/loadbalancersim/loadbalancer/edf.go
func (pq priorityQueue) Less(i, j int) bool { // Flip logic to make this a min queue. if pq[i].deadline == pq[j].deadline { return pq[i].index < pq[j].index } return pq[i].deadline < pq[j].deadline } // Swap implements heap.Interface/sort.Interface func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] } // Push implements heap.Interface for pushing an item into the heap
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 19:13:32 UTC 2023 - 2.8K bytes - Viewed (0) -
src/runtime/traceexp.go
// Experimental heap span events. IDs map reversibly to base addresses. traceEvSpan // heap span exists [timestamp, id, npages, type/class] traceEvSpanAlloc // heap span alloc [timestamp, id, npages, type/class] traceEvSpanFree // heap span free [timestamp, id] // Experimental heap object events. IDs map reversibly to addresses. traceEvHeapObject // heap object exists [timestamp, id, type]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 2.4K bytes - Viewed (0) -
src/cmd/link/internal/ld/outbuf_nommap.go
package ld // Mmap allocates an in-heap output buffer with the given size. It copies // any old data (if any) to the new buffer. func (out *OutBuf) Mmap(filesize uint64) error { // We need space to put all the symbols before we apply relocations. oldheap := out.heap if filesize < uint64(len(oldheap)) { panic("mmap size too small") } out.heap = make([]byte, filesize) copy(out.heap, oldheap) return nil }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 19 11:20:31 UTC 2024 - 660 bytes - Viewed (0) -
src/runtime/testdata/testprogcgo/cgonoescape.go
// #cgo noescape annotations for a C function means its arguments won't escape to heap. // We assume that there won't be 100 new allocated heap objects in other places, // i.e. runtime.ReadMemStats or other runtime background works. // So, the tests are: // 1. at least 100 new allocated heap objects after invoking withoutNoEscape 100 times. // 2. less than 100 new allocated heap objects after invoking withoutNoEscape 100 times. /*
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 02 16:43:23 UTC 2023 - 1.8K bytes - Viewed (0) -
platforms/core-runtime/process-services/src/main/java/org/gradle/process/internal/health/memory/MaximumHeapHelper.java
import org.gradle.internal.jvm.Jvm; import java.util.Arrays; import java.util.Locale; /** * Helper to compute maximum heap sizes. */ public class MaximumHeapHelper { /** * Get the default maximum heap. * * Different JVMs on different systems may use a different default for maximum heap when unset. * This method implements a best effort approximation, omitting rules for low memory systems (<192MB total RAM).
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 09:10:02 UTC 2023 - 3K bytes - Viewed (0)