495 	struct reserve_info *ri, **tbl;  in sort_reserve_entries()  local
506 	tbl = xmalloc(n * sizeof(*tbl));  in sort_reserve_entries()
511 		tbl[i++] = ri;  in sort_reserve_entries()
513 	qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);  in sort_reserve_entries()
515 	bi->reservelist = tbl[0];  in sort_reserve_entries()
517 		tbl[i]->next = tbl[i+1];  in sort_reserve_entries()
518 	tbl[n-1]->next = NULL;  in sort_reserve_entries()
520 	free(tbl);  in sort_reserve_entries()
536 	struct property *prop, **tbl;  in sort_properties()  local
544 	tbl = xmalloc(n * sizeof(*tbl));  in sort_properties()
547 		tbl[i++] = prop;  in sort_properties()
549 	qsort(tbl, n, sizeof(*tbl), cmp_prop);  in sort_properties()
551 	node->proplist = tbl[0];  in sort_properties()
553 		tbl[i]->next = tbl[i+1];  in sort_properties()
554 	tbl[n-1]->next = NULL;  in sort_properties()
556 	free(tbl);  in sort_properties()
572 	struct node *subnode, **tbl;  in sort_subnodes()  local
580 	tbl = xmalloc(n * sizeof(*tbl));  in sort_subnodes()
583 		tbl[i++] = subnode;  in sort_subnodes()
585 	qsort(tbl, n, sizeof(*tbl), cmp_subnode);  in sort_subnodes()
587 	node->children = tbl[0];  in sort_subnodes()
589 		tbl[i]->next_sibling = tbl[i+1];  in sort_subnodes()
590 	tbl[n-1]->next_sibling = NULL;  in sort_subnodes()
592 	free(tbl);  in sort_subnodes()