Home
last modified time | relevance | path

Searched refs:heap (Results 1 - 25 of 527) sorted by relevance

12345678910>>...22

/third_party/mesa3d/src/gallium/drivers/d3d12/
H A Dd3d12_descriptor_pool.cpp49 ID3D12DescriptorHeap *heap; member
65 struct d3d12_descriptor_heap *heap = CALLOC_STRUCT(d3d12_descriptor_heap); in d3d12_descriptor_heap_new() local
67 heap->desc.NumDescriptors = num_descriptors; in d3d12_descriptor_heap_new()
68 heap->desc.Type = type; in d3d12_descriptor_heap_new()
69 heap->desc.Flags = flags; in d3d12_descriptor_heap_new()
70 if (FAILED(dev->CreateDescriptorHeap(&heap->desc, in d3d12_descriptor_heap_new()
71 IID_PPV_ARGS(&heap->heap)))) { in d3d12_descriptor_heap_new()
72 FREE(heap); in d3d12_descriptor_heap_new()
76 heap in d3d12_descriptor_heap_new()
88 d3d12_descriptor_heap_free(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_free() argument
96 d3d12_descriptor_heap_get(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_get() argument
102 d3d12_descriptor_heap_is_online(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_is_online() argument
108 d3d12_descriptor_heap_can_allocate(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_can_allocate() argument
115 d3d12_descriptor_heap_get_remaining_handles(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_get_remaining_handles() argument
121 d2d12_descriptor_heap_get_next_handle(struct d3d12_descriptor_heap *heap, struct d3d12_descriptor_handle *handle) d2d12_descriptor_heap_get_next_handle() argument
131 d3d12_descriptor_heap_alloc_handle(struct d3d12_descriptor_heap *heap, struct d3d12_descriptor_handle *handle) d3d12_descriptor_heap_alloc_handle() argument
173 d3d12_descriptor_heap_append_handles(struct d3d12_descriptor_heap *heap, D3D12_CPU_DESCRIPTOR_HANDLE *handles, unsigned num_handles) d3d12_descriptor_heap_append_handles() argument
188 d3d12_descriptor_heap_clear(struct d3d12_descriptor_heap *heap) d3d12_descriptor_heap_clear() argument
[all...]
/third_party/mbedtls/library/
H A Dmemory_buffer_alloc.c80 static buffer_alloc_ctx heap; variable
107 memory_header *cur = heap.first; in debug_chain()
116 cur = heap.first_free; in debug_chain()
167 memory_header *prv = heap.first, *cur; in verify_chain()
177 if (heap.first->prev != NULL) { in verify_chain()
185 cur = heap.first->next; in verify_chain()
213 memory_header *new, *cur = heap.first_free; in buffer_alloc_calloc()
222 if (heap.buf == NULL || heap.first == NULL) { in buffer_alloc_calloc()
262 heap in buffer_alloc_calloc()
[all...]
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-priority-queue.hh36 * Priority queue implemented as a binary heap. Supports extract minimum
47 hb_vector_t<item_t> heap; member
50 void init () { heap.init (); } in init()
52 void fini () { heap.fini (); } in fini()
54 void reset () { heap.resize (0); } in reset()
56 bool in_error () const { return heap.in_error (); } in in_error()
60 heap.push (item_t (priority, value)); in insert()
61 bubble_up (heap.length - 1); in insert()
66 item_t result = heap[0]; in pop_minimum()
68 heap[ in pop_minimum()
[all...]
/third_party/python/Lib/
H A Dheapq.py6 property of a heap is that a[0] is always its smallest element.
10 heap = [] # creates an empty heap
11 heappush(heap, item) # pushes a new item on the heap
12 item = heappop(heap) # pops the smallest item from the heap
13 item = heap[0] # smallest item on the heap without popping it
14 heapify(x) # transforms list into a heap, i
[all...]
/third_party/libuv/src/
H A Dheap-inl.h34 /* A binary min heap. The usual properties hold: the root is the lowest
38 * The heap function try hard to detect corrupted tree nodes at the cost
41 struct heap { struct
51 HEAP_EXPORT(void heap_init(struct heap* heap));
52 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap));
53 HEAP_EXPORT(void heap_insert(struct heap* heap,
56 HEAP_EXPORT(void heap_remove(struct heap* hea
63 HEAP_EXPORT(void heap_init(struct heap* heap)) HEAP_EXPORT() argument
68 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap)) HEAP_EXPORT() argument
73 heap_node_swap(struct heap* heap, struct heap_node* parent, struct heap_node* child) heap_node_swap() argument
107 HEAP_EXPORT(void heap_insert(struct heap* heap, struct heap_node* newnode, heap_compare_fn less_than)) HEAP_EXPORT() argument
151 HEAP_EXPORT(void heap_remove(struct heap* heap, struct heap_node* node, heap_compare_fn less_than)) HEAP_EXPORT() argument
246 HEAP_EXPORT(void heap_dequeue(struct heap* heap, heap_compare_fn less_than)) HEAP_EXPORT() argument
[all...]
/third_party/mesa3d/src/util/
H A Du_mm.c34 u_mmDumpMemInfo(const struct mem_block *heap) in u_mmDumpMemInfo() argument
36 debug_printf("Memory heap %p:\n", (void *) heap); in u_mmDumpMemInfo()
37 if (heap == NULL) { in u_mmDumpMemInfo()
38 debug_printf(" heap == 0\n"); in u_mmDumpMemInfo()
44 for (p = heap->next; p != heap; p = p->next) { in u_mmDumpMemInfo()
58 for (p = heap->next_free; p != heap; p = p->next_free) { in u_mmDumpMemInfo()
72 struct mem_block *heap, *bloc in u_mmInit() local
177 u_mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) u_mmAllocMem() argument
217 u_mmFindBlock(struct mem_block *heap, int start) u_mmFindBlock() argument
285 u_mmDestroy(struct mem_block *heap) u_mmDestroy() argument
[all...]
/third_party/node/deps/uv/src/
H A Dheap-inl.h33 /* A binary min heap. The usual properties hold: the root is the lowest
37 * The heap function try hard to detect corrupted tree nodes at the cost
40 struct heap { struct
50 HEAP_EXPORT(void heap_init(struct heap* heap));
51 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap));
52 HEAP_EXPORT(void heap_insert(struct heap* heap,
55 HEAP_EXPORT(void heap_remove(struct heap* hea
62 HEAP_EXPORT(void heap_init(struct heap* heap)) HEAP_EXPORT() argument
67 HEAP_EXPORT(struct heap_node* heap_min(const struct heap* heap)) HEAP_EXPORT() argument
72 heap_node_swap(struct heap* heap, struct heap_node* parent, struct heap_node* child) heap_node_swap() argument
106 HEAP_EXPORT(void heap_insert(struct heap* heap, struct heap_node* newnode, heap_compare_fn less_than)) HEAP_EXPORT() argument
150 HEAP_EXPORT(void heap_remove(struct heap* heap, struct heap_node* node, heap_compare_fn less_than)) HEAP_EXPORT() argument
239 HEAP_EXPORT(void heap_dequeue(struct heap* heap, heap_compare_fn less_than)) HEAP_EXPORT() argument
[all...]
/third_party/python/Modules/
H A D_heapqmodule.c25 siftdown(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) in siftdown() argument
31 assert(PyList_Check(heap)); in siftdown()
32 size = PyList_GET_SIZE(heap); in siftdown()
40 arr = _PyList_ITEMS(heap); in siftdown()
52 if (size != PyList_GET_SIZE(heap)) { in siftdown()
59 arr = _PyList_ITEMS(heap); in siftdown()
70 siftup(PyListObject *heap, Py_ssize_t pos) in siftup() argument
76 assert(PyList_Check(heap)); in siftup()
77 endpos = PyList_GET_SIZE(heap); in siftup()
85 arr = _PyList_ITEMS(heap); in siftup()
130 _heapq_heappush_impl(PyObject *module, PyObject *heap, PyObject *item) _heapq_heappush_impl() argument
142 heappop_internal(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) heappop_internal() argument
183 _heapq_heappop_impl(PyObject *module, PyObject *heap) _heapq_heappop_impl() argument
190 heapreplace_internal(PyObject *heap, PyObject *item, int siftup_func(PyListObject *, Py_ssize_t)) heapreplace_internal() argument
229 _heapq_heapreplace_impl(PyObject *module, PyObject *heap, PyObject *item) _heapq_heapreplace_impl() argument
249 _heapq_heappushpop_impl(PyObject *module, PyObject *heap, PyObject *item) _heapq_heappushpop_impl() argument
319 cache_friendly_heapify(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) cache_friendly_heapify() argument
352 heapify_internal(PyObject *heap, int siftup_func(PyListObject *, Py_ssize_t)) heapify_internal() argument
387 _heapq_heapify_impl(PyObject *module, PyObject *heap) _heapq_heapify_impl() argument
394 siftdown_max(PyListObject *heap, Py_ssize_t startpos, Py_ssize_t pos) siftdown_max() argument
439 siftup_max(PyListObject *heap, Py_ssize_t pos) siftup_max() argument
499 _heapq__heappop_max_impl(PyObject *module, PyObject *heap) _heapq__heappop_max_impl() argument
516 _heapq__heapreplace_max_impl(PyObject *module, PyObject *heap, PyObject *item) _heapq__heapreplace_max_impl() argument
533 _heapq__heapify_max_impl(PyObject *module, PyObject *heap) _heapq__heapify_max_impl() argument
[all...]
/third_party/libdrm/intel/
H A Dmm.c32 drm_private void mmDumpMemInfo(const struct mem_block *heap) in mmDumpMemInfo() argument
34 drmMsg("Memory heap %p:\n", (void *)heap); in mmDumpMemInfo()
35 if (heap == 0) { in mmDumpMemInfo()
36 drmMsg(" heap == 0\n"); in mmDumpMemInfo()
40 for (p = heap->next; p != heap; p = p->next) { in mmDumpMemInfo()
48 for (p = heap->next_free; p != heap; p = p->next_free) { in mmDumpMemInfo()
60 struct mem_block *heap, *bloc in mmInit() local
163 mmAllocMem(struct mem_block *heap, int size, int align2, int startSearch) mmAllocMem() argument
246 mmDestroy(struct mem_block *heap) mmDestroy() argument
[all...]
/third_party/node/deps/v8/src/heap/
H A Dincremental-marking-job.cc5 #include "src/heap/incremental-marking-job.h"
11 #include "src/heap/embedder-tracing.h"
12 #include "src/heap/gc-tracer.h"
13 #include "src/heap/heap-inl.h"
14 #include "src/heap/heap.h"
15 #include "src/heap/incremental-marking.h"
23 static StepResult Step(Heap* heap);
45 void IncrementalMarkingJob::Start(Heap* heap) { in Start() argument
50 ScheduleTask(Heap* heap, TaskType task_type) ScheduleTask() argument
84 Step(Heap* heap) Step() argument
100 Heap* heap = isolate()->heap(); RunInternal() local
[all...]
H A Dobjects-visiting.cc5 #include "src/heap/objects-visiting.h"
7 #include "src/heap/heap-inl.h"
8 #include "src/heap/mark-compact-inl.h"
9 #include "src/heap/objects-visiting-inl.h"
18 static bool MustRecordSlots(Heap* heap) { in MustRecordSlots() argument
19 return heap->gc_state() == Heap::MARK_COMPACT && in MustRecordSlots()
20 heap->mark_compact_collector()->is_compacting(); in MustRecordSlots()
28 Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) { in VisitWeakList() argument
29 HeapObject undefined = ReadOnlyRoots(heap) in VisitWeakList()
78 ClearWeakList(Heap* heap, Object list) ClearWeakList() argument
[all...]
H A Dmemory-reducer.cc5 #include "src/heap/memory-reducer.h"
8 #include "src/heap/gc-tracer.h"
9 #include "src/heap/heap-inl.h"
10 #include "src/heap/incremental-marking.h"
24 MemoryReducer::MemoryReducer(Heap* heap) in MemoryReducer() argument
25 : heap_(heap), in MemoryReducer()
27 reinterpret_cast<v8::Isolate*>(heap->isolate()))), in MemoryReducer()
33 : CancelableTask(memory_reducer->heap()->isolate()), in TimerTask()
38 Heap* heap in RunInternal() local
[all...]
H A Dlarge-spaces.cc5 #include "src/heap/large-spaces.h"
11 #include "src/heap/combined-heap.h"
12 #include "src/heap/incremental-marking.h"
13 #include "src/heap/list.h"
14 #include "src/heap/marking.h"
15 #include "src/heap/memory-allocator.h"
16 #include "src/heap/memory-chunk-inl.h"
17 #include "src/heap/remembered-set.h"
18 #include "src/heap/slo
110 LargeObjectSpace(Heap* heap, AllocationSpace id) LargeObjectSpace() argument
367 GetObjectIterator( Heap* heap) GetObjectIterator() argument
492 OldLargeObjectSpace(Heap* heap) OldLargeObjectSpace() argument
495 OldLargeObjectSpace(Heap* heap, AllocationSpace id) OldLargeObjectSpace() argument
498 NewLargeObjectSpace(Heap* heap, size_t capacity) NewLargeObjectSpace() argument
587 CodeLargeObjectSpace(Heap* heap) CodeLargeObjectSpace() argument
[all...]
H A Dincremental-marking.cc5 #include "src/heap/incremental-marking.h"
10 #include "src/heap/concurrent-marking.h"
11 #include "src/heap/embedder-tracing.h"
12 #include "src/heap/gc-idle-time-handler.h"
13 #include "src/heap/gc-tracer-inl.h"
14 #include "src/heap/gc-tracer.h"
15 #include "src/heap/heap-inl.h"
16 #include "src/heap/heap
45 Heap* heap = incremental_marking_->heap(); Step() local
54 IncrementalMarking(Heap* heap, WeakObjects* weak_objects) IncrementalMarking() argument
187 IncrementalMarkingRootMarkingVisitor(Heap* heap) IncrementalMarkingRootMarkingVisitor() argument
226 MarkRoots(Heap* heap) MarkRoots() argument
[all...]
H A Dheap-layout-tracer.cc5 #include "src/heap/heap-layout-tracer.h"
9 #include "src/heap/new-spaces.h"
10 #include "src/heap/paged-spaces.h"
11 #include "src/heap/read-only-spaces.h"
12 #include "src/heap/spaces-inl.h"
22 Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap(); in GCProloguePrintHeapLayout() local
24 PrintF("Before GC:%d,", heap->gc_count() + 1); in GCProloguePrintHeapLayout()
26 PrintHeapLayout(std::cout, heap); in GCProloguePrintHeapLayout()
34 Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap(); GCEpiloguePrintHeapLayout() local
52 PrintHeapLayout(std::ostream& os, Heap* heap) PrintHeapLayout() argument
[all...]
/third_party/skia/tests/
H A DTDPQueueTest.cpp15 SkTDPQueue<int, intless> heap; in simple_test() local
16 REPORTER_ASSERT(reporter, 0 == heap.count()); in simple_test()
18 heap.insert(0); in simple_test()
19 REPORTER_ASSERT(reporter, 1 == heap.count()); in simple_test()
20 REPORTER_ASSERT(reporter, 0 == heap.peek()); in simple_test()
21 heap.pop(); in simple_test()
22 REPORTER_ASSERT(reporter, 0 == heap.count()); in simple_test()
24 heap.insert(0); in simple_test()
25 heap.insert(1); in simple_test()
26 REPORTER_ASSERT(reporter, 2 == heap in simple_test()
[all...]
/third_party/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_heap.c29 nouveau_heap_init(struct nouveau_heap **heap, in nouveau_heap_init() argument
40 *heap = r; in nouveau_heap_init()
45 nouveau_heap_destroy(struct nouveau_heap **heap) in nouveau_heap_destroy() argument
47 if (!*heap) in nouveau_heap_destroy()
49 free(*heap); in nouveau_heap_destroy()
50 *heap = NULL; in nouveau_heap_destroy()
54 nouveau_heap_alloc(struct nouveau_heap *heap, unsigned size, void *priv, in nouveau_heap_alloc() argument
59 if (!heap || !size || !res || *res) in nouveau_heap_alloc()
62 while (heap) { in nouveau_heap_alloc()
63 if (!heap in nouveau_heap_alloc()
[all...]
/third_party/vk-gl-cts/framework/delibs/depool/
H A DdePoolHeap.h23 * \brief Memory pool heap class.
37 * \brief Declare a template pool heap class.
38 * \param TYPENAME Type name of the declared heap.
39 * \param VALUETYPE Type of the value contained in the heap.
42 * This macro declares a pool heap with all the necessary functions for
46 * The functions for operating the heap are:
50 * int Heap_getNumElements (const Heap* heap);
51 * deBool Heap_reserve (Heap* heap, int size);
52 * void Heap_reset (Heap* heap);
53 * deBool Heap_push (Heap* heap, Elemen
[all...]
H A DdePoolHeap.c21 * \brief Memory pool heap class.
57 * \brief Test heap functionality.
62 TestHeap* heap = TestHeap_create(pool); in dePoolHeap_selfTest() local
65 TestHeap_push(heap, HeapItem_create(10, 10)); in dePoolHeap_selfTest()
66 TestHeap_push(heap, HeapItem_create(0, 10)); in dePoolHeap_selfTest()
67 TestHeap_push(heap, HeapItem_create(20, 10)); in dePoolHeap_selfTest()
68 DE_TEST_ASSERT(TestHeap_getNumElements(heap) == 3); in dePoolHeap_selfTest()
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0); in dePoolHeap_selfTest()
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10); in dePoolHeap_selfTest()
72 DE_TEST_ASSERT(TestHeap_popMin(heap) in dePoolHeap_selfTest()
[all...]
/third_party/python/Modules/clinic/
H A D_heapqmodule.c.h6 "heappush($module, heap, item, /)\n"
9 "Push item onto heap, maintaining the heap invariant.");
15 _heapq_heappush_impl(PyObject *module, PyObject *heap, PyObject *item);
21 PyObject *heap; in _heapq_heappush() local
31 heap = args[0]; in _heapq_heappush()
33 return_value = _heapq_heappush_impl(module, heap, item); in _heapq_heappush()
40 "heappop($module, heap, /)\n"
43 "Pop the smallest item off the heap, maintaining the heap invarian
55 PyObject *heap; _heapq_heappop() local
92 PyObject *heap; _heapq_heapreplace() local
129 PyObject *heap; _heapq_heappushpop() local
163 PyObject *heap; _heapq_heapify() local
192 PyObject *heap; _heapq__heappop_max() local
222 PyObject *heap; _heapq__heapreplace_max() local
256 PyObject *heap; _heapq__heapify_max() local
[all...]
/third_party/mesa3d/src/imagination/vulkan/winsys/
H A Dpvr_winsys_helper.c77 struct pvr_winsys_heap *const heap) in pvr_winsys_helper_winsys_heap_init()
91 * region can only be at the beginning of the heap or at the end. in pvr_winsys_helper_winsys_heap_init()
100 heap->ws = ws; in pvr_winsys_helper_winsys_heap_init()
101 heap->base_addr = base_address; in pvr_winsys_helper_winsys_heap_init()
102 heap->reserved_addr = reserved_address; in pvr_winsys_helper_winsys_heap_init()
104 heap->size = size; in pvr_winsys_helper_winsys_heap_init()
105 heap->reserved_size = reserved_size; in pvr_winsys_helper_winsys_heap_init()
107 heap->page_size = 1 << log2_page_size; in pvr_winsys_helper_winsys_heap_init()
108 heap->log2_page_size = log2_page_size; in pvr_winsys_helper_winsys_heap_init()
110 util_vma_heap_init(&heap in pvr_winsys_helper_winsys_heap_init()
69 pvr_winsys_helper_winsys_heap_init( struct pvr_winsys *const ws, pvr_dev_addr_t base_address, uint64_t size, pvr_dev_addr_t reserved_address, uint64_t reserved_size, uint32_t log2_page_size, const struct pvr_winsys_static_data_offsets *const static_data_offsets, struct pvr_winsys_heap *const heap) pvr_winsys_helper_winsys_heap_init() argument
127 pvr_winsys_helper_winsys_heap_finish(struct pvr_winsys_heap *const heap) pvr_winsys_helper_winsys_heap_finish() argument
138 pvr_winsys_helper_heap_alloc(struct pvr_winsys_heap *const heap, uint64_t size, uint64_t alignment, struct pvr_winsys_vma *const vma_out) pvr_winsys_helper_heap_alloc() argument
179 struct pvr_winsys_heap *const heap = vma->heap; pvr_winsys_helper_heap_free() local
196 pvr_buffer_create_and_map(struct pvr_winsys *const ws, heap_alloc_reserved_func heap_alloc_reserved, struct pvr_winsys_heap *heap, pvr_dev_addr_t dev_addr, uint64_t size, uint64_t alignment, struct pvr_winsys_vma **const vma_out) pvr_buffer_create_and_map() argument
[all...]
/third_party/skia/src/gpu/d3d/
H A DGrD3DDescriptorTableManager.cpp33 void GrD3DDescriptorTableManager::recycle(Heap* heap) { in recycle() argument
34 // wrap the heap in an sk_sp and take ownership of it in recycle()
35 sk_sp<Heap> wrappedHeap(heap); in recycle()
37 SkASSERT(heap); in recycle()
38 switch (heap->type()) { in recycle()
54 std::unique_ptr<GrD3DDescriptorHeap> heap = in Make() local
57 if (!heap) { in Make()
61 return sk_sp< GrD3DDescriptorTableManager::Heap>(new Heap(gpu, heap, type, descriptorCount)); in Make()
84 sk_sp<Heap> heap = Heap::Make(gpu, fHeapType, fCurrentHeapDescriptorCount); in HeapPool() local
85 fDescriptorHeaps.push_back(heap); in HeapPool()
95 auto& heap = fDescriptorHeaps[fDescriptorHeaps.size() - 1]; allocateTable() local
108 sk_sp<GrD3DDescriptorTableManager::Heap> heap = allocateTable() local
129 sk_sp<GrD3DDescriptorTableManager::Heap> heap = prepForSubmit() local
135 recycle(sk_sp<Heap> heap) recycle() argument
[all...]
/third_party/node/deps/v8/src/heap/cppgc/
H A Dmarker.cc5 #include "src/heap/cppgc/marker.h"
11 #include "include/cppgc/heap-consistency.h"
14 #include "src/heap/cppgc/globals.h"
15 #include "src/heap/cppgc/heap-object-header.h"
16 #include "src/heap/cppgc/heap-page.h"
17 #include "src/heap/cppgc/heap-visitor.h"
18 #include "src/heap/cppg
35 EnterIncrementalMarkingIfNeeded(Marker::MarkingConfig config, HeapBase& heap) EnterIncrementalMarkingIfNeeded() argument
49 ExitIncrementalMarkingIfNeeded(Marker::MarkingConfig config, HeapBase& heap) ExitIncrementalMarkingIfNeeded() argument
80 GetNextIncrementalStepDuration(IncrementalMarkingSchedule& schedule, HeapBase& heap) GetNextIncrementalStepDuration() argument
151 MarkerBase(HeapBase& heap, cppgc::Platform* platform, MarkingConfig config) MarkerBase() argument
653 Marker(HeapBase& heap, cppgc::Platform* platform, MarkingConfig config) Marker() argument
[all...]
/third_party/python/Lib/test/
H A Dtest_heapq.py52 heap = []
54 self.check_invariant(heap)
58 self.module.heappush(heap, item)
59 self.check_invariant(heap)
61 while heap:
62 item = self.module.heappop(heap)
63 self.check_invariant(heap)
78 def check_invariant(self, heap):
79 # Check the heap invariant.
80 for pos, item in enumerate(heap)
[all...]
/third_party/node/deps/v8/src/extensions/
H A Dstatistics-extension.cc10 #include "src/heap/heap-inl.h" // crbug.com/v8/8499
66 Heap* heap = isolate->heap(); in GetCounters() local
70 heap->CollectAllGarbage(Heap::kNoGCFlags, in GetCounters()
106 if (heap->new_space()) { in GetCounters()
107 new_space_size = heap->new_space()->Size(); in GetCounters()
108 new_space_available = heap->new_space()->Available(); in GetCounters()
109 new_space_committed_memory = heap->new_space()->CommittedMemory(); in GetCounters()
113 {heap in GetCounters()
[all...]

Completed in 12 milliseconds

12345678910>>...22