645 	struct reserve_info *ri, **tbl;  in sort_reserve_entries()  local
656 	tbl = xmalloc(n * sizeof(*tbl));  in sort_reserve_entries()
661 		tbl[i++] = ri;  in sort_reserve_entries()
663 	qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);  in sort_reserve_entries()
665 	dti->reservelist = tbl[0];  in sort_reserve_entries()
667 		tbl[i]->next = tbl[i+1];  in sort_reserve_entries()
668 	tbl[n-1]->next = NULL;  in sort_reserve_entries()
670 	free(tbl);  in sort_reserve_entries()
686 	struct property *prop, **tbl;  in sort_properties()  local
694 	tbl = xmalloc(n * sizeof(*tbl));  in sort_properties()
697 		tbl[i++] = prop;  in sort_properties()
699 	qsort(tbl, n, sizeof(*tbl), cmp_prop);  in sort_properties()
701 	node->proplist = tbl[0];  in sort_properties()
703 		tbl[i]->next = tbl[i+1];  in sort_properties()
704 	tbl[n-1]->next = NULL;  in sort_properties()
706 	free(tbl);  in sort_properties()
722 	struct node *subnode, **tbl;  in sort_subnodes()  local
730 	tbl = xmalloc(n * sizeof(*tbl));  in sort_subnodes()
733 		tbl[i++] = subnode;  in sort_subnodes()
735 	qsort(tbl, n, sizeof(*tbl), cmp_subnode);  in sort_subnodes()
737 	node->children = tbl[0];  in sort_subnodes()
739 		tbl[i]->next_sibling = tbl[i+1];  in sort_subnodes()
740 	tbl[n-1]->next_sibling = NULL;  in sort_subnodes()
742 	free(tbl);  in sort_subnodes()