Lines Matching defs:leaves_num
68 size_t leaves_num;
250 if (++(sl->leaves_num) > sl->leaves_sz) {
251 sl->leaves_sz = sl->leaves_num + 128;
255 sl->leaves[sl->leaves_num - 1] = item;
354 sl->leaves_num = sl->tosort_num;
355 sl->leaves_sz = sl->leaves_num;
365 if (mergesort(sl->leaves, sl->leaves_num,
371 DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,
376 sl->leaves, sl->leaves_num *
379 sort_left_dec(sl->leaves_num);
404 if (sl->leaves_num > 1) {
407 mergesort(sl->leaves, sl->leaves_num,
411 DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,
416 DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,
422 sl->leaves_sz = sl->leaves_num;
428 sl->leaves_num * sizeof(struct sort_list_item*));
429 sl->start_position += sl->leaves_num;
430 sort_left_dec(sl->leaves_num);
434 sl->leaves_num = 0;
476 sl->leaves_num * sizeof(struct sort_list_item*));
477 sort_left_dec(sl->leaves_num);
549 if (sl->leaves_num > 1) {
552 mergesort(sl->leaves, sl->leaves_num,
556 DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,
561 DEFAULT_SORT_FUNC_RADIXSORT(sl->leaves, sl->leaves_num,
569 sl->leaves_num * sizeof(struct sort_list_item*));
570 sl->start_position += sl->leaves_num;
571 sort_left_dec(sl->leaves_num);
603 sl->leaves_num * sizeof(struct sort_list_item*));
605 sort_left_dec(sl->leaves_num);