usr.bin/sort/radixsort.c

282 			struct sort_level *slc;
288 				slc = sl->sublevels[i];
289 				if (slc)
290 					free_sort_level(slc);
303 	struct sort_level *slc;
423 			slc = sl->sublevels[i];
425 			if (slc) {
426 				slc->sorted = sl->sorted;
427 				slc->start_position = sl->start_position;
428 				sl->start_position += slc->tosort_num;
429 				if (SMALL_NODE(slc))
430 					run_sort_level_next(slc);
432 					push_ls(slc);
444 			slc = sl->sublevels[n];
446 			if (slc) {
447 				slc->sorted = sl->sorted;
448 				slc->start_position = sl->start_position;
449 				sl->start_position += slc->tosort_num;
450 				if (SMALL_NODE(slc))
451 					run_sort_level_next(slc);
453 					push_ls(slc);
473 	struct sort_level *slc;
476 		slc = pop_ls_st();
477 		if (slc == NULL) {
480 		run_sort_level_next(slc);
492 	struct sort_level *slc;
495 		slc = pop_ls_mt();
496 		if (slc == NULL) {
503 		run_sort_level_next(slc);
526 	struct sort_level *slc;
564 			slc = sl->sublevels[i];
566 			if (slc) {
567 				slc->sorted = sl->tosort;
568 				slc->start_position = sl->start_position;
569 				sl->start_position += slc->tosort_num;
570 				push_ls(slc);
581 			slc = sl->sublevels[n];
583 			if (slc) {
584 				slc->sorted = sl->tosort;
585 				slc->start_position = sl->start_position;
586 				sl->start_position += slc->tosort_num;
587 				push_ls(slc);