version 1.2, 2015/03/17 17:49:27 |
version 1.3, 2015/04/01 20:58:13 |
|
|
static inline void |
static inline void |
add_leaf(struct sort_level *sl, struct sort_list_item *item) |
add_leaf(struct sort_level *sl, struct sort_list_item *item) |
{ |
{ |
|
|
if (++(sl->leaves_num) > sl->leaves_sz) { |
if (++(sl->leaves_num) > sl->leaves_sz) { |
sl->leaves_sz = sl->leaves_num + 128; |
sl->leaves_sz = sl->leaves_num + 128; |
sl->leaves = sort_reallocarray(sl->leaves, sl->leaves_sz, |
sl->leaves = sort_reallocarray(sl->leaves, sl->leaves_sz, |
|
|
static void |
static void |
free_sort_level(struct sort_level *sl) |
free_sort_level(struct sort_level *sl) |
{ |
{ |
|
|
if (sl) { |
if (sl) { |
if (sl->leaves) |
if (sl->leaves) |
sort_free(sl->leaves); |
sort_free(sl->leaves); |