Lines Matching defs:be_nodes
113 be_node_list_t *node, *be_nodes = NULL;
143 ret = _be_list(NULL, &be_nodes);
148 * iterate through be_nodes,
153 for (node = be_nodes; node != NULL; node = node->be_next_node) {
164 be_free_list(be_nodes);
174 be_free_list(be_nodes);
281 be_free_list(be_nodes);
3640 be_node_list_t *be_nodes = NULL;
3677 &be_nodes) != BE_SUCCESS) {
3682 } else if (_be_list(NULL, &be_nodes) != BE_SUCCESS) {
3687 for (cur_be = be_nodes; cur_be != NULL; cur_be = cur_be->be_next_node) {
3780 be_free_list(be_nodes);
3793 be_free_list(be_nodes);
3798 be_free_list(be_nodes);
3888 be_node_list_t *be_nodes = NULL;
3974 if (_be_list(NULL, &be_nodes) == BE_SUCCESS) {
3975 while (be_nodes != NULL) {
3976 if (strcmp(pool, be_nodes->be_rpool) == 0) {
3977 (void) be_append_menu(be_nodes->be_node_name,
3978 be_nodes->be_rpool, NULL, NULL, NULL);
3980 if (be_nodes->be_active_on_boot) {
3981 be_rpool = strdup(be_nodes->be_rpool);
3982 be_name = strdup(be_nodes->be_node_name);
3985 be_nodes = be_nodes->be_next_node;
3988 be_free_list(be_nodes);