Lines Matching refs:tbl
597 struct reserve_info *ri, **tbl; in sort_reserve_entries() local
608 tbl = xmalloc(n * sizeof(*tbl)); in sort_reserve_entries()
613 tbl[i++] = ri; in sort_reserve_entries()
615 qsort(tbl, n, sizeof(*tbl), cmp_reserve_info); in sort_reserve_entries()
617 bi->reservelist = tbl[0]; in sort_reserve_entries()
619 tbl[i]->next = tbl[i+1]; in sort_reserve_entries()
620 tbl[n-1]->next = NULL; in sort_reserve_entries()
622 free(tbl); in sort_reserve_entries()
638 struct property *prop, **tbl; in sort_properties() local
646 tbl = xmalloc(n * sizeof(*tbl)); in sort_properties()
649 tbl[i++] = prop; in sort_properties()
651 qsort(tbl, n, sizeof(*tbl), cmp_prop); in sort_properties()
653 node->proplist = tbl[0]; in sort_properties()
655 tbl[i]->next = tbl[i+1]; in sort_properties()
656 tbl[n-1]->next = NULL; in sort_properties()
658 free(tbl); in sort_properties()
674 struct node *subnode, **tbl; in sort_subnodes() local
682 tbl = xmalloc(n * sizeof(*tbl)); in sort_subnodes()
685 tbl[i++] = subnode; in sort_subnodes()
687 qsort(tbl, n, sizeof(*tbl), cmp_subnode); in sort_subnodes()
689 node->children = tbl[0]; in sort_subnodes()
691 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
692 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
694 free(tbl); in sort_subnodes()