node2 192 include/crm/common/nodes_internal.h pcmk__same_node(const pcmk_node_t *node1, const pcmk_node_t *node2) node2 194 include/crm/common/nodes_internal.h return (node1 != NULL) && (node2 != NULL) node2 195 include/crm/common/nodes_internal.h && (node1->priv == node2->priv); node2 1101 lib/pacemaker/libpacemaker_private.h const pcmk_node_t *node2); node2 201 lib/pacemaker/pcmk_sched_instances.c pcmk_node_t *node2 = NULL; node2 221 lib/pacemaker/pcmk_sched_instances.c node2 = g_hash_table_lookup(colocated_scores2, current_node2->priv->id); node2 224 lib/pacemaker/pcmk_sched_instances.c if (node1->assign->score < node2->assign->score) { node2 227 lib/pacemaker/pcmk_sched_instances.c instance2->id, node2->assign->score, pcmk__node_name(node2)); node2 230 lib/pacemaker/pcmk_sched_instances.c } else if (node1->assign->score > node2->assign->score) { node2 233 lib/pacemaker/pcmk_sched_instances.c instance2->id, node2->assign->score, pcmk__node_name(node2)); node2 358 lib/pacemaker/pcmk_sched_instances.c pcmk_node_t *node2 = NULL; node2 371 lib/pacemaker/pcmk_sched_instances.c node2 = instance2->priv->fns->active_node(instance2, &nnodes2, NULL); node2 395 lib/pacemaker/pcmk_sched_instances.c can2 = node_is_allowed(instance2, &node2); node2 422 lib/pacemaker/pcmk_sched_instances.c if ((node1 == NULL) && (node2 == NULL)) { node2 431 lib/pacemaker/pcmk_sched_instances.c } else if (node2 == NULL) { node2 438 lib/pacemaker/pcmk_sched_instances.c can2 = pcmk__node_available(node2, false, false); node2 452 lib/pacemaker/pcmk_sched_instances.c node2 = pcmk__top_allowed_node(instance2, node2); node2 453 lib/pacemaker/pcmk_sched_instances.c if ((node1 == NULL) && (node2 == NULL)) { node2 464 lib/pacemaker/pcmk_sched_instances.c } else if (node2 == NULL) { node2 471 lib/pacemaker/pcmk_sched_instances.c if (node1->assign->count < node2->assign->count) { node2 476 lib/pacemaker/pcmk_sched_instances.c } else if (node1->assign->count > node2->assign->count) { node2 212 lib/pacemaker/pcmk_sched_nodes.c const pcmk_node_t *node2 = (const pcmk_node_t *) b; node2 232 lib/pacemaker/pcmk_sched_nodes.c if (pcmk__node_available(node2, false, false)) { node2 233 lib/pacemaker/pcmk_sched_nodes.c node2_score = node2->assign->score; node2 238 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node2 245 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node2 260 lib/pacemaker/pcmk_sched_nodes.c result = pcmk__compare_node_capacities(node1, node2); node2 263 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node2 268 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), result); node2 275 lib/pacemaker/pcmk_sched_nodes.c if (node1->priv->num_resources < node2->priv->num_resources) { node2 277 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node2 278 lib/pacemaker/pcmk_sched_nodes.c node1->priv->num_resources, node2->priv->num_resources); node2 281 lib/pacemaker/pcmk_sched_nodes.c } else if (node1->priv->num_resources > node2->priv->num_resources) { node2 283 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2), node2 284 lib/pacemaker/pcmk_sched_nodes.c node1->priv->num_resources, node2->priv->num_resources); node2 293 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node2 295 lib/pacemaker/pcmk_sched_nodes.c } else if (pcmk__same_node(preferred, node2)) { node2 297 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node2 304 lib/pacemaker/pcmk_sched_nodes.c result = strcmp(node1->priv->name, node2->priv->name); node2 307 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node2 311 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_name(node1), pcmk__node_name(node2)); node2 315 lib/pacemaker/pcmk_sched_nodes.c crm_trace("%s == %s", pcmk__node_name(node1), pcmk__node_name(node2)); node2 51 lib/pacemaker/pcmk_sched_utilization.c const pcmk_node_t *node2; node2 84 lib/pacemaker/pcmk_sched_utilization.c node2_value = g_hash_table_lookup(data->node2->priv->utilization, key); node2 107 lib/pacemaker/pcmk_sched_utilization.c const pcmk_node_t *node2) node2 111 lib/pacemaker/pcmk_sched_utilization.c .node2 = node2, node2 122 lib/pacemaker/pcmk_sched_utilization.c g_hash_table_foreach(node2->priv->utilization, compare_utilization_value, node2 19 lib/pengine/tests/utils/pe__cmp_node_name_test.c pcmk_node_t node2 = { .priv = &node2_private }; node2 27 lib/pengine/tests/utils/pe__cmp_node_name_test.c node2.priv->name = "node10"; node2 28 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), 0); node2 34 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(NULL, &node2), -1); node2 38 lib/pengine/tests/utils/pe__cmp_node_name_test.c node2.priv->name = "node10"; node2 39 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), -1); node2 48 lib/pengine/tests/utils/pe__cmp_node_name_test.c node2.priv->name = "node9"; node2 49 lib/pengine/tests/utils/pe__cmp_node_name_test.c assert_int_equal(pe__cmp_node_name(&node1, &node2), 1); node2 152 lib/pengine/utils.c const pcmk_node_t *node2 = (const pcmk_node_t *) b; node2 154 lib/pengine/utils.c if ((node1 == NULL) && (node2 == NULL)) { node2 162 lib/pengine/utils.c if (node2 == NULL) { node2 166 lib/pengine/utils.c return pcmk__numeric_strcasecmp(node1->priv->name, node2->priv->name);