Searched refs:heaps (Results 1 – 5 of 5) sorted by relevance
183 extent_heap_t heaps[NPSIZES+1]; member
288 extent_heap_new(&extents->heaps[i]); in extents_init()316 if (extent_heap_empty(&extents->heaps[pind])) { in extents_insert_locked()320 extent_heap_insert(&extents->heaps[pind], extent); in extents_insert_locked()342 extent_heap_remove(&extents->heaps[pind], extent); in extents_remove_locked()343 if (extent_heap_empty(&extents->heaps[pind])) { in extents_remove_locked()375 assert(!extent_heap_empty(&extents->heaps[i])); in extents_fit_alignment()376 extent_t *extent = extent_heap_first(&extents->heaps[i]); in extents_fit_alignment()412 assert(!extent_heap_empty(&extents->heaps[i])); in extents_best_fit_locked()413 extent_t *extent = extent_heap_first(&extents->heaps[i]); in extents_best_fit_locked()435 assert(!extent_heap_empty(&extents->heaps[i])); in extents_first_fit_locked()[all …]
59 DPDK has added support for creating new ``rte_malloc`` heaps referencing
254 is implemented through overloading the socket ID - externally allocated heaps
482 - Use pairing heaps rather than red-black trees for various hot data