63 	struct sort_list_item	**leaves;  member
249 		sl->leaves = sort_realloc(sl->leaves,  in add_leaf()
252 	sl->leaves[sl->leaves_num - 1] = item;  in add_leaf()
303 		if (sl->leaves)  in free_sort_level()
304 			sort_free(sl->leaves);  in free_sort_level()
379 			sl->leaves = sl->tosort;  in run_sort_level_next()
382 			sl->leaves = sort_realloc(sl->leaves,  in run_sort_level_next()
391 				if (mergesort(sl->leaves, sl->leaves_num,  in run_sort_level_next()
397 				DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,  in run_sort_level_next()
402 			    sl->leaves, sl->leaves_num *  in run_sort_level_next()
432 				mergesort(sl->leaves, sl->leaves_num,  in run_sort_level_next()
436 				DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,  in run_sort_level_next()
441 			DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,  in run_sort_level_next()
448 	sl->leaves = sort_realloc(sl->leaves, (sizeof(struct sort_list_item *) *  in run_sort_level_next()
452 		memcpy(sl->sorted + sl->start_position, sl->leaves,  in run_sort_level_next()
457 		sort_free(sl->leaves);  in run_sort_level_next()
458 		sl->leaves = NULL;  in run_sort_level_next()
500 		memcpy(sl->sorted + sl->start_position, sl->leaves,  in run_sort_level_next()
576 				mergesort(sl->leaves, sl->leaves_num,  in run_top_sort_level()
580 				DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,  in run_top_sort_level()
585 			DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,  in run_top_sort_level()
592 		memcpy(sl->tosort + sl->start_position, sl->leaves,  in run_top_sort_level()
626 		memcpy(sl->tosort + sl->start_position, sl->leaves,  in run_top_sort_level()