node1 192 include/crm/common/nodes_internal.h pcmk__same_node(const pcmk_node_t *node1, const pcmk_node_t *node2) node1 194 include/crm/common/nodes_internal.h return (node1 != NULL) && (node2 != NULL) node1 195 include/crm/common/nodes_internal.h && (node1->priv == node2->priv); node1 1100 lib/pacemaker/libpacemaker_private.h int pcmk__compare_node_capacities(const pcmk_node_t *node1, node1 200 lib/pacemaker/pcmk_sched_instances.c pcmk_node_t *node1 = NULL; node1 220 lib/pacemaker/pcmk_sched_instances.c node1 = g_hash_table_lookup(colocated_scores1, current_node1->priv->id); node1 224 lib/pacemaker/pcmk_sched_instances.c if (node1->assign->score < node2->assign->score) { node1 226 lib/pacemaker/pcmk_sched_instances.c instance1->id, node1->assign->score, pcmk__node_name(node1), node1 230 lib/pacemaker/pcmk_sched_instances.c } else if (node1->assign->score > node2->assign->score) { node1 232 lib/pacemaker/pcmk_sched_instances.c instance1->id, node1->assign->score, pcmk__node_name(node1), node1 357 lib/pacemaker/pcmk_sched_instances.c pcmk_node_t *node1 = NULL; node1 370 lib/pacemaker/pcmk_sched_instances.c node1 = instance1->priv->fns->active_node(instance1, &nnodes1, NULL); node1 394 lib/pacemaker/pcmk_sched_instances.c can1 = node_is_allowed(instance1, &node1); node1 422 lib/pacemaker/pcmk_sched_instances.c if ((node1 == NULL) && (node2 == NULL)) { node1 427 lib/pacemaker/pcmk_sched_instances.c } else if (node1 == NULL) { node1 437 lib/pacemaker/pcmk_sched_instances.c can1 = pcmk__node_available(node1, false, false); node1 451 lib/pacemaker/pcmk_sched_instances.c node1 = pcmk__top_allowed_node(instance1, node1); node1 453 lib/pacemaker/pcmk_sched_instances.c if ((node1 == NULL) && (node2 == NULL)) { node1 459 lib/pacemaker/pcmk_sched_instances.c } else if (node1 == NULL) { node1 471 lib/pacemaker/pcmk_sched_instances.c if (node1->assign->count < node2->assign->count) { node1 476 lib/pacemaker/pcmk_sched_instances.c } else if (node1->assign->count > node2->assign->count) { node1 211 lib/pacemaker/pcmk_sched_nodes.c const pcmk_node_t *node1 = (const pcmk_node_t *) a; node1 229 lib/pacemaker/pcmk_sched_nodes.c if (pcmk__node_available(node1, false, false)) { node1 230 lib/pacemaker/pcmk_sched_nodes.c node1_score = node1->assign->score; node1 238 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node1 245 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node1 252 lib/pacemaker/pcmk_sched_nodes.c if (pcmk__str_eq(node1->priv->scheduler->priv->placement_strategy, node1 257 lib/pacemaker/pcmk_sched_nodes.c if (pcmk__str_eq(node1->priv->scheduler->priv->placement_strategy, node1 260 lib/pacemaker/pcmk_sched_nodes.c result = pcmk__compare_node_capacities(node1, node2); node1 263 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node1 268 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), result); node1 275 lib/pacemaker/pcmk_sched_nodes.c if (node1->priv->num_resources < node2->priv->num_resources) { node1 277 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node1 278 lib/pacemaker/pcmk_sched_nodes.c node1->priv->num_resources, node2->priv->num_resources); node1 281 lib/pacemaker/pcmk_sched_nodes.c } else if (node1->priv->num_resources > node2->priv->num_resources) { node1 283 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node1 284 lib/pacemaker/pcmk_sched_nodes.c node1->priv->num_resources, node2->priv->num_resources); node1 291 lib/pacemaker/pcmk_sched_nodes.c if (pcmk__same_node(preferred, node1)) { node1 293 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node1 297 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node1 304 lib/pacemaker/pcmk_sched_nodes.c result = strcmp(node1->priv->name, node2->priv->name); node1 307 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node1 311 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node1 315 lib/pacemaker/pcmk_sched_nodes.c crm_trace("%s == %s", pcmk__node_name(node1), pcmk__node_name(node2)); node1 50 lib/pacemaker/pcmk_sched_utilization.c const pcmk_node_t *node1; node1 77 lib/pacemaker/pcmk_sched_utilization.c if (g_hash_table_lookup(data->node1->priv->utilization, key)) { node1 106 lib/pacemaker/pcmk_sched_utilization.c pcmk__compare_node_capacities(const pcmk_node_t *node1, node1 110 lib/pacemaker/pcmk_sched_utilization.c .node1 = node1, node1 117 lib/pacemaker/pcmk_sched_utilization.c g_hash_table_foreach(node1->priv->utilization, compare_utilization_value, node1 18 lib/pengine/tests/utils/pe__cmp_node_name_test.c pcmk_node_t node1 = { .priv = &node1_private }; node1 26 lib/pengine/tests/utils/pe__cmp_node_name_test.c node1.priv->name = "node10"; node1 28 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), 0); node1 37 lib/pengine/tests/utils/pe__cmp_node_name_test.c node1.priv->name = "node9"; node1 39 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), -1); node1 45 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, NULL), 1); node1 47 lib/pengine/tests/utils/pe__cmp_node_name_test.c node1.priv->name = "node10"; node1 49 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), 1); node1 151 lib/pengine/utils.c const pcmk_node_t *node1 = (const pcmk_node_t *) a; node1 154 lib/pengine/utils.c if ((node1 == NULL) && (node2 == NULL)) { node1 158 lib/pengine/utils.c if (node1 == NULL) { node1 166 lib/pengine/utils.c return pcmk__numeric_strcasecmp(node1->priv->name, node2->priv->name);