Lines Matching defs:list
105 * If NULL a list of all BEs will be returned.
106 * be_nodes - A reference pointer to the list of BEs. The list
144 * Description: Sort BE node list
146 * pointer to address of list head
152 * node list sorted by name
202 * If NULL a list of all BEs will be returned.
203 * be_nodes - A reference pointer to the list of BEs. The list
291 * Description: Frees up all the data allocated for the list of BEs,
304 be_node_list_t *list = be_nodes;
306 while (list != NULL) {
307 be_dataset_list_t *datasets = list->be_node_datasets;
308 be_snapshot_list_t *snapshots = list->be_node_snapshots;
327 temp_node = list;
328 list = list->be_next_node;
345 * zbe_nodes - A reference pointer to the list of BEs. The list
587 * We're at the end of the list add the
653 * We're at the end of the list add
688 * Description: Sort BE node list
690 * pointer to address of list head
696 * node list sorted by name
711 /* build array of linked list BE struct pointers */
726 /* in-place list quicksort using qsort(3C) */
730 ptrlist[nbe] = NULL; /* add linked list terminator */
731 *pstart = ptrlist[0]; /* set new linked list header */
732 /* for each BE in list */
736 /* rewrite list pointer chain, including terminator */
749 /* build array of linked list snapshot struct ptrs */
758 /* in-place list quicksort using qsort(3C) */
761 /* rewrite list pointer chain, including terminator */
779 /* build array of linked list dataset struct ptrs */
788 /* in-place list quicksort using qsort(3C) */
791 /* rewrite list pointer chain, including terminator */
807 * will sort BE list from oldest to most recent
834 * will sort BE list from recent to oldest
891 * will sort BE list in growing order
918 * will sort BE list in shrinking