496 	int n = 0, i = 0;  in sort_reserve_entries()  local
501 		n++;  in sort_reserve_entries()
503 	if (n == 0)  in sort_reserve_entries()
506 	tbl = xmalloc(n * sizeof(*tbl));  in sort_reserve_entries()
513 	qsort(tbl, n, sizeof(*tbl), cmp_reserve_info);  in sort_reserve_entries()
516 	for (i = 0; i < (n-1); i++)  in sort_reserve_entries()
518 	tbl[n-1]->next = NULL;  in sort_reserve_entries()
535 	int n = 0, i = 0;  in sort_properties()  local
539 		n++;  in sort_properties()
541 	if (n == 0)  in sort_properties()
544 	tbl = xmalloc(n * sizeof(*tbl));  in sort_properties()
549 	qsort(tbl, n, sizeof(*tbl), cmp_prop);  in sort_properties()
552 	for (i = 0; i < (n-1); i++)  in sort_properties()
554 	tbl[n-1]->next = NULL;  in sort_properties()
571 	int n = 0, i = 0;  in sort_subnodes()  local
575 		n++;  in sort_subnodes()
577 	if (n == 0)  in sort_subnodes()
580 	tbl = xmalloc(n * sizeof(*tbl));  in sort_subnodes()
585 	qsort(tbl, n, sizeof(*tbl), cmp_subnode);  in sort_subnodes()
588 	for (i = 0; i < (n-1); i++)  in sort_subnodes()
590 	tbl[n-1]->next_sibling = NULL;  in sort_subnodes()