nodes 87 include/crm/common/ipc_controld.h GList *nodes; // list of pcmk_controld_api_node_t * nodes 29 include/crm/common/location_internal.h GList *nodes; // Copies of affected nodes, with score nodes 127 include/crm/common/nodes_internal.h pcmk_node_t *pcmk__find_node_in_list(const GList *nodes, const char *node_name); nodes 97 include/crm/common/scheduler.h GList *nodes; // Nodes in cluster nodes 161 include/crm/pengine/internal.h const char *comment, GHashTable *nodes, nodes 164 include/crm/pengine/internal.h #define pe__show_node_scores(level, rsc, text, nodes, scheduler) \ nodes 166 include/crm/pengine/internal.h (level), (rsc), (text), (nodes), (scheduler)) nodes 182 lib/common/ipc_controld.c data->data.nodes = g_list_prepend(data->data.nodes, node_info); nodes 292 lib/common/ipc_controld.c g_list_free_full(reply_data.data.nodes, free); nodes 170 lib/common/nodes.c pcmk__find_node_in_list(const GList *nodes, const char *node_name) nodes 173 lib/common/nodes.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { nodes 105 lib/common/scheduler.c return pcmk__find_node_in_list(scheduler->nodes, node_name); nodes 25 lib/common/tests/nodes/pcmk__find_node_in_list_test.c GList *nodes = NULL; nodes 36 lib/common/tests/nodes/pcmk__find_node_in_list_test.c nodes = g_list_append(nodes, a); nodes 37 lib/common/tests/nodes/pcmk__find_node_in_list_test.c nodes = g_list_append(nodes, b); nodes 39 lib/common/tests/nodes/pcmk__find_node_in_list_test.c assert_ptr_equal(a, pcmk__find_node_in_list(nodes, "cluster1")); nodes 40 lib/common/tests/nodes/pcmk__find_node_in_list_test.c assert_null(pcmk__find_node_in_list(nodes, "cluster10")); nodes 41 lib/common/tests/nodes/pcmk__find_node_in_list_test.c assert_null(pcmk__find_node_in_list(nodes, "nodecluster1")); nodes 42 lib/common/tests/nodes/pcmk__find_node_in_list_test.c assert_ptr_equal(b, pcmk__find_node_in_list(nodes, "CLUSTER2")); nodes 43 lib/common/tests/nodes/pcmk__find_node_in_list_test.c assert_null(pcmk__find_node_in_list(nodes, "xyz")); nodes 49 lib/common/tests/nodes/pcmk__find_node_in_list_test.c g_list_free(nodes); nodes 249 lib/pacemaker/libpacemaker_private.h const char *log_id, GHashTable **nodes, nodes 542 lib/pacemaker/libpacemaker_private.h const char *log_id, GHashTable **nodes, nodes 791 lib/pacemaker/libpacemaker_private.h GHashTable **nodes, nodes 1002 lib/pacemaker/libpacemaker_private.h bool pcmk__any_node_available(GHashTable *nodes); nodes 1005 lib/pacemaker/libpacemaker_private.h GHashTable *pcmk__copy_node_table(GHashTable *nodes); nodes 1014 lib/pacemaker/libpacemaker_private.h GList *pcmk__sort_nodes(GList *nodes, pcmk_node_t *active_node); nodes 87 lib/pacemaker/pcmk_graph_producer.c for (const GList *iter = scheduler->nodes; nodes 80 lib/pacemaker/pcmk_output.c for (lpc2 = cons->nodes; lpc2 != NULL; lpc2 = lpc2->next) { nodes 569 lib/pacemaker/pcmk_output.c for (lpc2 = cons->nodes; lpc2 != NULL; lpc2 = lpc2->next) { nodes 1832 lib/pacemaker/pcmk_output.c CHECK_RC(rc, out->message(out, "node-list", scheduler->nodes, unames, nodes 1969 lib/pacemaker/pcmk_output.c out->message(out, "node-list", scheduler->nodes, unames, resources, nodes 2053 lib/pacemaker/pcmk_output.c out->message(out, "node-list", scheduler->nodes, unames, resources, nodes 1922 lib/pacemaker/pcmk_sched_actions.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { nodes 1654 lib/pacemaker/pcmk_sched_colocation.c add_node_scores_matching_attr(GHashTable *nodes, nodes 1665 lib/pacemaker/pcmk_sched_colocation.c g_hash_table_iter_init(&iter, nodes); nodes 1802 lib/pacemaker/pcmk_sched_colocation.c GHashTable **nodes, nodes 1808 lib/pacemaker/pcmk_sched_colocation.c pcmk__assert((source_rsc != NULL) && (nodes != NULL) nodes 1810 lib/pacemaker/pcmk_sched_colocation.c || ((target_rsc == NULL) && (*nodes == NULL)))); nodes 1824 lib/pacemaker/pcmk_sched_colocation.c if (*nodes == NULL) { nodes 1832 lib/pacemaker/pcmk_sched_colocation.c work = pcmk__copy_node_table(*nodes); nodes 1910 lib/pacemaker/pcmk_sched_colocation.c if (*nodes != NULL) { nodes 1911 lib/pacemaker/pcmk_sched_colocation.c g_hash_table_destroy(*nodes); nodes 1913 lib/pacemaker/pcmk_sched_colocation.c *nodes = work; nodes 691 lib/pacemaker/pcmk_sched_group.c node_list_orig = location->nodes; nodes 722 lib/pacemaker/pcmk_sched_group.c location->nodes = node_list_copy; nodes 728 lib/pacemaker/pcmk_sched_group.c location->nodes = node_list_orig; nodes 942 lib/pacemaker/pcmk_sched_group.c const char *log_id, GHashTable **nodes, nodes 948 lib/pacemaker/pcmk_sched_group.c pcmk__assert(pcmk__is_group(source_rsc) && (nodes != NULL) nodes 950 lib/pacemaker/pcmk_sched_group.c || ((target_rsc == NULL) && (*nodes == NULL)))); nodes 979 lib/pacemaker/pcmk_sched_group.c if (*nodes == NULL) { nodes 988 lib/pacemaker/pcmk_sched_group.c nodes, colocation, factor, nodes 149 lib/pacemaker/pcmk_sched_instances.c apply_parent_colocations(const pcmk_resource_t *rsc, GHashTable **nodes) nodes 159 lib/pacemaker/pcmk_sched_instances.c nodes, colocation, factor, nodes 174 lib/pacemaker/pcmk_sched_instances.c nodes, colocation, factor, nodes 1197 lib/pacemaker/pcmk_sched_instances.c GList *nodes = NULL; nodes 1214 lib/pacemaker/pcmk_sched_instances.c nodes = pcmk__sort_nodes(g_hash_table_get_values(allowed_nodes), NULL); nodes 1215 lib/pacemaker/pcmk_sched_instances.c for (GList *iter = nodes; (iter != NULL) && (instance == NULL); nodes 1226 lib/pacemaker/pcmk_sched_instances.c g_list_free(nodes); nodes 263 lib/pacemaker/pcmk_sched_location.c for (iter = rsc->priv->scheduler->nodes; nodes 285 lib/pacemaker/pcmk_sched_location.c location_rule->nodes = g_list_prepend(location_rule->nodes, local); nodes 295 lib/pacemaker/pcmk_sched_location.c if (location_rule->nodes == NULL) { nodes 299 lib/pacemaker/pcmk_sched_location.c rule_id, g_list_length(location_rule->nodes)); nodes 661 lib/pacemaker/pcmk_sched_location.c new_con->nodes = NULL; nodes 685 lib/pacemaker/pcmk_sched_location.c new_con->nodes = g_list_prepend(NULL, copy); nodes 742 lib/pacemaker/pcmk_sched_location.c if (location->nodes == NULL) { nodes 748 lib/pacemaker/pcmk_sched_location.c for (GList *iter = location->nodes; iter != NULL; iter = iter->next) { nodes 67 lib/pacemaker/pcmk_sched_nodes.c pcmk__copy_node_table(GHashTable *nodes) nodes 73 lib/pacemaker/pcmk_sched_nodes.c if (nodes == NULL) { nodes 77 lib/pacemaker/pcmk_sched_nodes.c g_hash_table_iter_init(&iter, nodes); nodes 329 lib/pacemaker/pcmk_sched_nodes.c pcmk__sort_nodes(GList *nodes, pcmk_node_t *active_node) nodes 331 lib/pacemaker/pcmk_sched_nodes.c return g_list_sort_with_data(nodes, compare_nodes, active_node); nodes 344 lib/pacemaker/pcmk_sched_nodes.c pcmk__any_node_available(GHashTable *nodes) nodes 349 lib/pacemaker/pcmk_sched_nodes.c if (nodes == NULL) { nodes 352 lib/pacemaker/pcmk_sched_nodes.c g_hash_table_iter_init(&iter, nodes); nodes 387 lib/pacemaker/pcmk_sched_nodes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { nodes 137 lib/pacemaker/pcmk_sched_primitive.c GList *nodes = g_hash_table_get_values(rsc->priv->allowed_nodes); nodes 139 lib/pacemaker/pcmk_sched_primitive.c if (nodes != NULL) { nodes 140 lib/pacemaker/pcmk_sched_primitive.c return pcmk__sort_nodes(nodes, pcmk__current_node(rsc)); nodes 169 lib/pacemaker/pcmk_sched_primitive.c GList *nodes = NULL; nodes 184 lib/pacemaker/pcmk_sched_primitive.c nodes = sorted_allowed_nodes(rsc); nodes 185 lib/pacemaker/pcmk_sched_primitive.c if (nodes != NULL) { nodes 186 lib/pacemaker/pcmk_sched_primitive.c best = (pcmk_node_t *) nodes->data; // First node has best score nodes 189 lib/pacemaker/pcmk_sched_primitive.c if ((prefer != NULL) && (nodes != NULL)) { nodes 219 lib/pacemaker/pcmk_sched_primitive.c g_list_length(nodes)); nodes 255 lib/pacemaker/pcmk_sched_primitive.c for (GList *iter = nodes->next; iter; iter = iter->next) { nodes 285 lib/pacemaker/pcmk_sched_primitive.c pcmk__node_name(chosen), rsc->id, g_list_length(nodes)); nodes 289 lib/pacemaker/pcmk_sched_primitive.c g_list_free(nodes); nodes 1715 lib/pacemaker/pcmk_sched_primitive.c g_list_foreach(scheduler->nodes, ban_if_not_locked, rsc); nodes 882 lib/pacemaker/pcmk_sched_probes.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { nodes 137 lib/pacemaker/pcmk_sched_promotable.c constraint_node = pe_find_node_id(location->nodes, nodes 520 lib/pacemaker/pcmk_sched_recurring.c for (GList *iter = rsc->priv->scheduler->nodes; nodes 653 lib/pacemaker/pcmk_sched_resource.c get_node_score(const pcmk_node_t *node, GHashTable *nodes) nodes 657 lib/pacemaker/pcmk_sched_resource.c if ((node != NULL) && (nodes != NULL)) { nodes 658 lib/pacemaker/pcmk_sched_resource.c found_node = g_hash_table_lookup(nodes, node->priv->id); nodes 686 lib/pacemaker/pcmk_sched_resource.c const GList *nodes = data; nodes 712 lib/pacemaker/pcmk_sched_resource.c if (nodes == NULL) { nodes 751 lib/pacemaker/pcmk_sched_resource.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { nodes 794 lib/pacemaker/pcmk_sched_resource.c GList *nodes = g_list_copy(scheduler->nodes); nodes 796 lib/pacemaker/pcmk_sched_resource.c nodes = pcmk__sort_nodes(nodes, NULL); nodes 798 lib/pacemaker/pcmk_sched_resource.c g_list_sort_with_data(scheduler->priv->resources, cmp_resources, nodes); nodes 799 lib/pacemaker/pcmk_sched_resource.c g_list_free(nodes); nodes 473 lib/pacemaker/pcmk_sched_utilization.c for (const GList *iter = scheduler->nodes; nodes 270 lib/pacemaker/pcmk_scheduler.c for (GList *node_iter = scheduler->nodes; node_iter != NULL; nodes 355 lib/pacemaker/pcmk_scheduler.c for (GList *iter = rsc->priv->scheduler->nodes; nodes 558 lib/pacemaker/pcmk_scheduler.c for (GList *iter = scheduler->nodes; iter != NULL; iter = iter->next) { nodes 2009 lib/pengine/bundle.c GHashTable *nodes = NULL; nodes 2052 lib/pengine/bundle.c nodes = g_hash_table_new(NULL, NULL); nodes 2061 lib/pengine/bundle.c if (g_hash_table_insert(nodes, (gpointer) node->details, nodes 2072 lib/pengine/bundle.c g_hash_table_destroy(nodes); nodes 217 lib/pengine/clone.c g_list_length(scheduler->nodes)); nodes 357 lib/pengine/clone.c QB_MAX(1, g_list_length(scheduler->nodes))); nodes 882 lib/pengine/clone.c GList *nodes = nodes_with_status(stopped, status); nodes 883 lib/pengine/clone.c GString *nodes_str = node_list_to_str(nodes); nodes 893 lib/pengine/clone.c g_list_free(nodes); nodes 985 lib/pengine/clone.c if (clone_data->clone_max == g_list_length(scheduler->nodes)) { nodes 144 lib/pengine/native.c pe__node_list2table(scheduler->nodes); nodes 1202 lib/pengine/pe_actions.c for (gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { nodes 679 lib/pengine/pe_notif.c GList *nodes = NULL; nodes 744 lib/pengine/pe_notif.c nodes = g_hash_table_get_values(n_data->allowed_nodes); nodes 750 lib/pengine/pe_notif.c nodes = g_list_sort(nodes, pe__cmp_node_name); nodes 752 lib/pengine/pe_notif.c get_node_names(nodes, &node_list, NULL); nodes 754 lib/pengine/pe_notif.c g_list_free(nodes); nodes 759 lib/pengine/pe_notif.c get_node_names(rsc->priv->scheduler->nodes, &node_list, &metal_list); nodes 762 lib/pengine/pe_notif.c get_node_names(rsc->priv->scheduler->nodes, &node_list, NULL); nodes 374 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { nodes 454 lib/pengine/pe_output.c out->message(out, "cluster-counts", g_list_length(scheduler->nodes), nodes 530 lib/pengine/pe_output.c out->message(out, "cluster-counts", g_list_length(scheduler->nodes), nodes 743 lib/pengine/pe_output.c for (gIter2 = location->nodes; gIter2 != NULL; gIter2 = gIter2->next) { nodes 2345 lib/pengine/pe_output.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { nodes 2538 lib/pengine/pe_output.c GList *nodes = va_arg(args, GList *); nodes 2546 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { nodes 2566 lib/pengine/pe_output.c GList *nodes = va_arg(args, GList *); nodes 2581 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { nodes 2672 lib/pengine/pe_output.c GList *nodes = va_arg(args, GList *); nodes 2683 lib/pengine/pe_output.c for (GList *gIter = nodes; gIter != NULL; gIter = gIter->next) { nodes 2723 lib/pengine/pe_output.c pcmk_node_t *node = pe_find_node_id(scheduler->nodes, nodes 250 lib/pengine/status.c pe_free_nodes(GList *nodes) nodes 252 lib/pengine/status.c for (GList *iterator = nodes; iterator != NULL; iterator = iterator->next) { nodes 286 lib/pengine/status.c if (nodes != NULL) { nodes 287 lib/pengine/status.c g_list_free(nodes); nodes 320 lib/pengine/status.c g_list_free_full(cons->nodes, pcmk__free_node_copy); nodes 372 lib/pengine/status.c pe_free_nodes(scheduler->nodes); nodes 488 lib/pengine/status.c pe_find_node_any(const GList *nodes, const char *id, const char *uname) nodes 493 lib/pengine/status.c match = pe_find_node_id(nodes, id); nodes 496 lib/pengine/status.c match = pcmk__find_node_in_list(nodes, uname); nodes 510 lib/pengine/status.c pe_find_node_id(const GList *nodes, const char *id) nodes 512 lib/pengine/status.c for (const GList *iter = nodes; iter != NULL; iter = iter->next) { nodes 540 lib/pengine/status.c pe_find_node(const GList *nodes, const char *node_name) nodes 542 lib/pengine/status.c return pcmk__find_node_in_list(nodes, node_name); nodes 75 lib/pengine/tags.c pcmk_node_t *node = pe_find_node_id(scheduler->nodes, id); nodes 25 lib/pengine/tests/status/pe_find_node_any_test.c GList *nodes = NULL; nodes 39 lib/pengine/tests/status/pe_find_node_any_test.c nodes = g_list_append(nodes, a); nodes 40 lib/pengine/tests/status/pe_find_node_any_test.c nodes = g_list_append(nodes, b); nodes 42 lib/pengine/tests/status/pe_find_node_any_test.c assert_ptr_equal(b, pe_find_node_any(nodes, "id2", NULL)); nodes 43 lib/pengine/tests/status/pe_find_node_any_test.c assert_ptr_equal(b, pe_find_node_any(nodes, "ID2", NULL)); nodes 45 lib/pengine/tests/status/pe_find_node_any_test.c assert_ptr_equal(a, pe_find_node_any(nodes, "xyz", "cluster1")); nodes 46 lib/pengine/tests/status/pe_find_node_any_test.c assert_ptr_equal(a, pe_find_node_any(nodes, NULL, "cluster1")); nodes 48 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, "id10", NULL)); nodes 49 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, "nodeid1", NULL)); nodes 50 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, NULL, "cluster10")); nodes 51 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, NULL, "nodecluster1")); nodes 52 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, "id3", "cluster3")); nodes 53 lib/pengine/tests/status/pe_find_node_any_test.c assert_null(pe_find_node_any(nodes, NULL, NULL)); nodes 59 lib/pengine/tests/status/pe_find_node_any_test.c g_list_free(nodes); nodes 23 lib/pengine/tests/status/pe_find_node_id_test.c GList *nodes = NULL; nodes 34 lib/pengine/tests/status/pe_find_node_id_test.c nodes = g_list_append(nodes, a); nodes 35 lib/pengine/tests/status/pe_find_node_id_test.c nodes = g_list_append(nodes, b); nodes 37 lib/pengine/tests/status/pe_find_node_id_test.c assert_ptr_equal(a, pe_find_node_id(nodes, "id1")); nodes 38 lib/pengine/tests/status/pe_find_node_id_test.c assert_null(pe_find_node_id(nodes, "id10")); nodes 39 lib/pengine/tests/status/pe_find_node_id_test.c assert_null(pe_find_node_id(nodes, "nodeid1")); nodes 40 lib/pengine/tests/status/pe_find_node_id_test.c assert_ptr_equal(b, pe_find_node_id(nodes, "ID2")); nodes 41 lib/pengine/tests/status/pe_find_node_id_test.c assert_null(pe_find_node_id(nodes, "xyz")); nodes 47 lib/pengine/tests/status/pe_find_node_id_test.c g_list_free(nodes); nodes 509 lib/pengine/unpack.c scheduler->nodes = g_list_insert_sorted(scheduler->nodes, new_node, nodes 1216 lib/pengine/unpack.c this_node = pe_find_node_any(scheduler->nodes, id, uname); nodes 1305 lib/pengine/unpack.c this_node = pe_find_node_any(scheduler->nodes, id, uname); nodes 1443 lib/pengine/unpack.c for (GList *gIter = scheduler->nodes; gIter != NULL; gIter = gIter->next) { nodes 3574 lib/pengine/unpack.c rsc->priv->allowed_nodes = pe__node_list2table(scheduler->nodes); nodes 180 lib/pengine/utils.c GHashTable *nodes, pcmk_scheduler_t *scheduler) nodes 185 lib/pengine/utils.c GList *list = g_list_sort(g_hash_table_get_values(nodes), nodes 211 lib/pengine/utils.c GHashTable *nodes) nodes 219 lib/pengine/utils.c g_hash_table_iter_init(&iter, nodes); nodes 254 lib/pengine/utils.c const char *comment, GHashTable *nodes, nodes 261 lib/pengine/utils.c if (nodes == NULL) { nodes 267 lib/pengine/utils.c pe__log_node_weights(file, function, line, rsc, comment, nodes); nodes 269 lib/pengine/utils.c pe__output_node_weights(rsc, comment, nodes, scheduler); nodes 372 lib/pengine/utils.c GList *gIter = scheduler->nodes; nodes 816 lib/pengine/utils.c GList *nodes = NULL; nodes 823 lib/pengine/utils.c nodes = g_list_prepend(nodes, strdup("*")); nodes 831 lib/pengine/utils.c nodes = g_list_prepend(nodes, strdup(s)); nodes 839 lib/pengine/utils.c nodes = pe__unames_with_tag(scheduler, s); nodes 843 lib/pengine/utils.c return nodes; nodes 174 tools/crm_node.c GList *nodes = va_arg(args, GList *); nodes 176 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { nodes 189 tools/crm_node.c GList *nodes = va_arg(args, GList *); nodes 193 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { nodes 242 tools/crm_node.c GList *nodes = va_arg(args, GList *); nodes 246 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { nodes 266 tools/crm_node.c GList *nodes = va_arg(args, GList *); nodes 270 tools/crm_node.c for (GList *node_iter = nodes; node_iter != NULL; node_iter = node_iter->next) { nodes 372 tools/crm_node.c reply->data.nodes = g_list_sort(reply->data.nodes, sort_node); nodes 375 tools/crm_node.c out->message(out, "partition-list", reply->data.nodes); nodes 377 tools/crm_node.c out->message(out, "simple-node-list", reply->data.nodes); nodes 943 tools/crm_resource.c rc = cli_resource_clear(options.rsc_id, NULL, scheduler->nodes, nodes 1836 tools/crm_resource.c GList *nodes = cli_resource_search(rsc, options.rsc_id, scheduler); nodes 1837 tools/crm_resource.c rc = out->message(out, "resource-search-list", nodes, options.rsc_id); nodes 1838 tools/crm_resource.c g_list_free_full(nodes, free); nodes 577 tools/crm_resource_print.c GList *nodes = va_arg(args, GList *); nodes 583 tools/crm_resource_print.c if (!out->is_quiet(out) && nodes == NULL) { nodes 588 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { nodes 621 tools/crm_resource_print.c GList *nodes = va_arg(args, GList *); nodes 628 tools/crm_resource_print.c for (GList *lpc = nodes; lpc != NULL; lpc = lpc->next) { nodes 970 tools/crm_resource_runtime.c GList *nodes = g_hash_table_get_values(rsc->priv->probed_nodes); nodes 972 tools/crm_resource_runtime.c if(nodes == NULL && force) { nodes 973 tools/crm_resource_runtime.c nodes = pcmk__copy_node_list(scheduler->nodes, false); nodes 975 tools/crm_resource_runtime.c } else if ((nodes == NULL) nodes 983 tools/crm_resource_runtime.c nodes = g_list_prepend(nodes, node); nodes 987 tools/crm_resource_runtime.c } else if(nodes == NULL) { nodes 988 tools/crm_resource_runtime.c nodes = g_hash_table_get_values(rsc->priv->allowed_nodes); nodes 991 tools/crm_resource_runtime.c for (lpc = nodes; lpc != NULL; lpc = lpc->next) { nodes 1000 tools/crm_resource_runtime.c g_list_free(nodes); nodes 1005 tools/crm_resource_runtime.c g_list_free(nodes); nodes 1097 tools/crm_resource_runtime.c for (GList *iter = scheduler->nodes; iter; iter = iter->next) { nodes 2331 tools/crm_resource_runtime.c GList *nodes = cli_resource_search(rsc, requested_name, scheduler); nodes 2332 tools/crm_resource_runtime.c if(nodes != NULL && force == FALSE) { nodes 2342 tools/crm_resource_runtime.c g_list_free_full(nodes, free); nodes 2460 tools/crm_resource_runtime.c cli_resource_clear(rsc_id, NULL, scheduler->nodes, cib, false, force); nodes 2463 tools/crm_resource_runtime.c cli_resource_clear(rsc_id, dest->priv->name, scheduler->nodes, cib, true,