lihao/jemalloc
1
0
Fork 0
mirror of https://github.com/jemalloc/jemalloc.git synced 2026-07-24 05:33:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Quantize szad trees by size class.

Browse Source 
Treat sizes that round down to the same size class as size-equivalent
in trees that are used to search for first best fit, so that there are
only as many "firsts" as there are size classes.  This comes closer to
the ideal of first fit.
This commit is contained in:
Jason Evans
2015-03-06 17:14:05 -08:00
parent f044bb219e
commit 5707d6f952
4 changed files with 38 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
src/extent.c
View File

@@ -9,8 +9,14 @@ extent_szad_comp(extent_node_t *a, extent_node_t *b)
int ret;
size_t a_size = extent_node_size_get(a);
size_t b_size = extent_node_size_get(b);
/*
* Compute the index of the largest size class that the chunk can
* satisfy a request for.
*/
size_t a_index = size2index(a_size + 1) - 1;
size_t b_index = size2index(b_size + 1) - 1;
ret = (a_size > b_size) - (a_size < b_size);
ret = (a_index > b_index) - (a_index < b_index);
if (ret == 0) {
uintptr_t a_addr = (uintptr_t)extent_node_addr_get(a);
uintptr_t b_addr = (uintptr_t)extent_node_addr_get(b);