node2              82 pengine/clone.c     node_t *node2 = NULL;
node2             116 pengine/clone.c         node2 = resource2->running_on->data;
node2             129 pengine/clone.c     if (node2) {
node2             130 pengine/clone.c         node_t *match = pe_hash_table_lookup(resource2->allowed_nodes, node2->details->id);
node2             134 pengine/clone.c             node2 = NULL;
node2             157 pengine/clone.c     if (node1 == NULL && node2 == NULL) {
node2             162 pengine/clone.c     if (node1 != node2) {
node2             166 pengine/clone.c         } else if (node2 == NULL) {
node2             173 pengine/clone.c     can2 = can_run_resources(node2);
node2             184 pengine/clone.c     node2 = parent_node_instance(resource2, node2);
node2             185 pengine/clone.c     if (node1 != NULL && node2 == NULL) {
node2             188 pengine/clone.c     } else if (node1 == NULL && node2 != NULL) {
node2             193 pengine/clone.c     if (node1 == NULL || node2 == NULL) {
node2             198 pengine/clone.c     if (node1->count < node2->count) {
node2             202 pengine/clone.c     } else if (node1->count > node2->count) {
node2             218 pengine/clone.c     if (node1 && node2) {
node2             284 pengine/clone.c         node2 = g_list_nth_data(resource2->running_on, 0);
node2             285 pengine/clone.c         node2 = g_hash_table_lookup(hash2, node2->details->id);
node2             287 pengine/clone.c         if (node1->weight < node2->weight) {
node2             289 pengine/clone.c                 crm_trace("%s > %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node2             294 pengine/clone.c                 crm_trace("%s < %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node2             299 pengine/clone.c         } else if (node1->weight > node2->weight) {
node2             300 pengine/clone.c             crm_trace("%s > %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node2             322 pengine/clone.c             node2 = g_list_nth_data(list2, lpc);
node2             328 pengine/clone.c             } else if (node2 == NULL) {
node2             334 pengine/clone.c             if (node1->weight < node2->weight) {
node2             339 pengine/clone.c             } else if (node1->weight > node2->weight) {
node2              35 pengine/utilization.c     const node_t *node2;
node2              48 pengine/utilization.c         crm_parse_int(g_hash_table_lookup(data->node2->details->utilization, key), "0");
node2              82 pengine/utilization.c compare_capacity(const node_t * node1, const node_t * node2)
node2              87 pengine/utilization.c     data.node2 = node2;
node2              91 pengine/utilization.c     g_hash_table_foreach(node2->details->utilization, do_compare_capacity2, &data);
node2             141 pengine/utils.c     const node_t *node2 = (const node_t *)b;
node2             157 pengine/utils.c     node2_weight = node2->weight;
node2             162 pengine/utils.c     if (can_run_resources(node2) == FALSE) {
node2             168 pengine/utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             174 pengine/utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             179 pengine/utils.c               node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             186 pengine/utils.c         result = compare_capacity(node1, node2);
node2             189 pengine/utils.c                       node1->details->uname, node2->details->uname, result);
node2             193 pengine/utils.c                       node1->details->uname, node2->details->uname, result);
node2             199 pengine/utils.c     if (node1->details->num_resources < node2->details->num_resources) {
node2             202 pengine/utils.c                   node2->details->uname, node2->details->num_resources);
node2             205 pengine/utils.c     } else if (node1->details->num_resources > node2->details->num_resources) {
node2             208 pengine/utils.c                   node2->details->uname, node2->details->num_resources);
node2             215 pengine/utils.c                   node2->details->uname, node2->details->num_resources);
node2             217 pengine/utils.c     } else if (active && active->details == node2->details) {
node2             220 pengine/utils.c                   node2->details->uname, node2->details->num_resources);
node2             224 pengine/utils.c     crm_trace("%s = %s", node1->details->uname, node2->details->uname);
node2             225 pengine/utils.c     return strcmp(node1->details->uname, node2->details->uname);
node2              73 pengine/utils.h extern int compare_capacity(const node_t * node1, const node_t * node2);