310 			struct sort_level *slc;  in free_sort_level()  local
316 				slc = sl->sublevels[i];  in free_sort_level()
317 				if (slc)  in free_sort_level()
318 					free_sort_level(slc);  in free_sort_level()
332 	struct sort_level *slc;  in run_sort_level_next()  local
465 			slc = sl->sublevels[i];  in run_sort_level_next()
467 			if (slc) {  in run_sort_level_next()
468 				slc->sorted = sl->sorted;  in run_sort_level_next()
469 				slc->start_position = sl->start_position;  in run_sort_level_next()
470 				sl->start_position += slc->tosort_num;  in run_sort_level_next()
471 				if (SMALL_NODE(slc))  in run_sort_level_next()
472 					run_sort_level_next(slc);  in run_sort_level_next()
474 					push_ls(slc);  in run_sort_level_next()
486 			slc = sl->sublevels[n];  in run_sort_level_next()
488 			if (slc) {  in run_sort_level_next()
489 				slc->sorted = sl->sorted;  in run_sort_level_next()
490 				slc->start_position = sl->start_position;  in run_sort_level_next()
491 				sl->start_position += slc->tosort_num;  in run_sort_level_next()
492 				if (SMALL_NODE(slc))  in run_sort_level_next()
493 					run_sort_level_next(slc);  in run_sort_level_next()
495 					push_ls(slc);  in run_sort_level_next()
515 	struct sort_level *slc;  in run_sort_cycle_st()  local
518 		slc = pop_ls_st();  in run_sort_cycle_st()
519 		if (slc == NULL) {  in run_sort_cycle_st()
522 		run_sort_level_next(slc);  in run_sort_cycle_st()
534 	struct sort_level *slc;  in run_sort_cycle_mt()  local
537 		slc = pop_ls_mt();  in run_sort_cycle_mt()
538 		if (slc == NULL)  in run_sort_cycle_mt()
540 		run_sort_level_next(slc);  in run_sort_cycle_mt()
561 	struct sort_level *slc;  in run_top_sort_level()  local
598 			slc = sl->sublevels[i];  in run_top_sort_level()
600 			if (slc) {  in run_top_sort_level()
601 				slc->sorted = sl->tosort;  in run_top_sort_level()
602 				slc->start_position = sl->start_position;  in run_top_sort_level()
603 				sl->start_position += slc->tosort_num;  in run_top_sort_level()
604 				push_ls(slc);  in run_top_sort_level()
615 			slc = sl->sublevels[n];  in run_top_sort_level()
617 			if (slc) {  in run_top_sort_level()
618 				slc->sorted = sl->tosort;  in run_top_sort_level()
619 				slc->start_position = sl->start_position;  in run_top_sort_level()
620 				sl->start_position += slc->tosort_num;  in run_top_sort_level()
621 				push_ls(slc);  in run_top_sort_level()