Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 1 | #define JEMALLOC_EXTENT_C_ |
Jason Evans | 376b152 | 2010-02-11 14:45:59 -0800 | [diff] [blame] | 2 | #include "jemalloc/internal/jemalloc_internal.h" |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 3 | |
| 4 | /******************************************************************************/ |
| 5 | |
Jason Evans | 8a03cf0 | 2015-05-04 09:58:36 -0700 | [diff] [blame^] | 6 | JEMALLOC_INLINE_C size_t |
| 7 | extent_quantize(size_t size) |
| 8 | { |
| 9 | |
| 10 | /* |
| 11 | * Round down to the nearest chunk size that can actually be requested |
| 12 | * during normal huge allocation. |
| 13 | */ |
| 14 | return (index2size(size2index(size + 1) - 1)); |
| 15 | } |
| 16 | |
Jason Evans | af1f592 | 2014-10-30 16:38:08 -0700 | [diff] [blame] | 17 | JEMALLOC_INLINE_C int |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 18 | extent_szad_comp(extent_node_t *a, extent_node_t *b) |
| 19 | { |
| 20 | int ret; |
Jason Evans | 8a03cf0 | 2015-05-04 09:58:36 -0700 | [diff] [blame^] | 21 | size_t a_qsize = extent_quantize(extent_node_size_get(a)); |
| 22 | size_t b_qsize = extent_quantize(extent_node_size_get(b)); |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 23 | |
Jason Evans | 8a03cf0 | 2015-05-04 09:58:36 -0700 | [diff] [blame^] | 24 | /* |
| 25 | * Compare based on quantized size rather than size, in order to sort |
| 26 | * equally useful extents only by address. |
| 27 | */ |
| 28 | ret = (a_qsize > b_qsize) - (a_qsize < b_qsize); |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 29 | if (ret == 0) { |
Jason Evans | ee41ad4 | 2015-02-15 18:04:46 -0800 | [diff] [blame] | 30 | uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a); |
| 31 | uintptr_t b_addr = (uintptr_t)extent_node_addr_get(b); |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 32 | |
| 33 | ret = (a_addr > b_addr) - (a_addr < b_addr); |
| 34 | } |
| 35 | |
| 36 | return (ret); |
| 37 | } |
| 38 | |
Jason Evans | f3ff752 | 2010-02-28 15:00:18 -0800 | [diff] [blame] | 39 | /* Generate red-black tree functions. */ |
Jason Evans | 2195ba4 | 2015-02-15 16:43:52 -0800 | [diff] [blame] | 40 | rb_gen(, extent_tree_szad_, extent_tree_t, extent_node_t, szad_link, |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 41 | extent_szad_comp) |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 42 | |
Jason Evans | af1f592 | 2014-10-30 16:38:08 -0700 | [diff] [blame] | 43 | JEMALLOC_INLINE_C int |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 44 | extent_ad_comp(extent_node_t *a, extent_node_t *b) |
| 45 | { |
Jason Evans | ee41ad4 | 2015-02-15 18:04:46 -0800 | [diff] [blame] | 46 | uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a); |
| 47 | uintptr_t b_addr = (uintptr_t)extent_node_addr_get(b); |
Jason Evans | e476f8a | 2010-01-16 09:53:50 -0800 | [diff] [blame] | 48 | |
| 49 | return ((a_addr > b_addr) - (a_addr < b_addr)); |
| 50 | } |
| 51 | |
Jason Evans | f3ff752 | 2010-02-28 15:00:18 -0800 | [diff] [blame] | 52 | /* Generate red-black tree functions. */ |
Jason Evans | 2195ba4 | 2015-02-15 16:43:52 -0800 | [diff] [blame] | 53 | rb_gen(, extent_tree_ad_, extent_tree_t, extent_node_t, ad_link, extent_ad_comp) |