1 #define JEMALLOC_EXTENT_C_
2 #include "jemalloc/internal/jemalloc_internal.h"
4 /******************************************************************************/
7 * Round down to the nearest chunk size that can actually be requested during
8 * normal huge allocation.
10 JEMALLOC_INLINE_C size_t
11 extent_quantize(size_t size)
18 ind = size2index(size + 1);
20 /* Avoid underflow. */
21 return (index2size(0));
23 ret = index2size(ind - 1);
29 extent_sz_comp(const extent_node_t *a, const extent_node_t *b)
31 size_t a_qsize = extent_quantize(extent_node_size_get(a));
32 size_t b_qsize = extent_quantize(extent_node_size_get(b));
34 return ((a_qsize > b_qsize) - (a_qsize < b_qsize));
38 extent_sn_comp(const extent_node_t *a, const extent_node_t *b)
40 size_t a_sn = extent_node_sn_get(a);
41 size_t b_sn = extent_node_sn_get(b);
43 return ((a_sn > b_sn) - (a_sn < b_sn));
47 extent_ad_comp(const extent_node_t *a, const extent_node_t *b)
49 uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a);
50 uintptr_t b_addr = (uintptr_t)extent_node_addr_get(b);
52 return ((a_addr > b_addr) - (a_addr < b_addr));
56 extent_szsnad_comp(const extent_node_t *a, const extent_node_t *b)
60 ret = extent_sz_comp(a, b);
64 ret = extent_sn_comp(a, b);
68 ret = extent_ad_comp(a, b);
72 /* Generate red-black tree functions. */
73 rb_gen(, extent_tree_szsnad_, extent_tree_t, extent_node_t, szsnad_link,
76 /* Generate red-black tree functions. */
77 rb_gen(, extent_tree_ad_, extent_tree_t, extent_node_t, ad_link, extent_ad_comp)