node2              75 include/pcmki/pcmki_sched_utils.h extern int compare_capacity(const pe_node_t * node1, const pe_node_t * node2);
node2             101 lib/pacemaker/pcmk_sched_clone.c     pe_node_t *node2 = NULL;
node2             181 lib/pacemaker/pcmk_sched_clone.c     node2 = g_hash_table_lookup(hash2, current_node2->details->id);
node2             183 lib/pacemaker/pcmk_sched_clone.c     if (node1->weight < node2->weight) {
node2             186 lib/pacemaker/pcmk_sched_clone.c                       rsc1->id, rsc2->id, node1->weight, node2->weight);
node2             192 lib/pacemaker/pcmk_sched_clone.c                       rsc1->id, rsc2->id, node1->weight, node2->weight);
node2             197 lib/pacemaker/pcmk_sched_clone.c     } else if (node1->weight > node2->weight) {
node2             199 lib/pacemaker/pcmk_sched_clone.c                   rsc1->id, rsc2->id, node1->weight, node2->weight);
node2             216 lib/pacemaker/pcmk_sched_clone.c         node2 = (pe_node_t *) gIter2->data;
node2             223 lib/pacemaker/pcmk_sched_clone.c         } else if (node2 == NULL) {
node2             229 lib/pacemaker/pcmk_sched_clone.c         if (node1->weight < node2->weight) {
node2             234 lib/pacemaker/pcmk_sched_clone.c         } else if (node1->weight > node2->weight) {
node2             255 lib/pacemaker/pcmk_sched_clone.c     pe_node_t *node2 = NULL;
node2             297 lib/pacemaker/pcmk_sched_clone.c     node2 = current_node2;
node2             308 lib/pacemaker/pcmk_sched_clone.c     if (node2 != NULL) {
node2             309 lib/pacemaker/pcmk_sched_clone.c         pe_node_t *match = pe_hash_table_lookup(resource2->allowed_nodes, node2->details->id);
node2             313 lib/pacemaker/pcmk_sched_clone.c             node2 = NULL;
node2             340 lib/pacemaker/pcmk_sched_clone.c     if (node1 == NULL && node2 == NULL) {
node2             348 lib/pacemaker/pcmk_sched_clone.c     } else if (node2 == NULL) {
node2             355 lib/pacemaker/pcmk_sched_clone.c     can2 = can_run_resources(node2);
node2             369 lib/pacemaker/pcmk_sched_clone.c     node2 = parent_node_instance(resource2, node2);
node2             370 lib/pacemaker/pcmk_sched_clone.c     if (node1 == NULL && node2 == NULL) {
node2             378 lib/pacemaker/pcmk_sched_clone.c     } else if (node2 == NULL) {
node2             386 lib/pacemaker/pcmk_sched_clone.c     if (node1->count < node2->count) {
node2             390 lib/pacemaker/pcmk_sched_clone.c     } else if (node1->count > node2->count) {
node2              25 lib/pacemaker/pcmk_sched_utilization.c     const pe_node_t *node2;
node2              53 lib/pacemaker/pcmk_sched_utilization.c     node2_capacity = utilization_value(g_hash_table_lookup(data->node2->details->utilization, key));
node2              87 lib/pacemaker/pcmk_sched_utilization.c compare_capacity(const pe_node_t * node1, const pe_node_t * node2)
node2              92 lib/pacemaker/pcmk_sched_utilization.c     data.node2 = node2;
node2              96 lib/pacemaker/pcmk_sched_utilization.c     g_hash_table_foreach(node2->details->utilization, do_compare_capacity2, &data);
node2             156 lib/pacemaker/pcmk_sched_utils.c     const pe_node_t *node2 = (const pe_node_t *)b;
node2             172 lib/pacemaker/pcmk_sched_utils.c     node2_weight = node2->weight;
node2             177 lib/pacemaker/pcmk_sched_utils.c     if (can_run_resources(node2) == FALSE) {
node2             183 lib/pacemaker/pcmk_sched_utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             189 lib/pacemaker/pcmk_sched_utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             194 lib/pacemaker/pcmk_sched_utils.c               node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node2             201 lib/pacemaker/pcmk_sched_utils.c         result = compare_capacity(node1, node2);
node2             204 lib/pacemaker/pcmk_sched_utils.c                       node1->details->uname, node2->details->uname, result);
node2             208 lib/pacemaker/pcmk_sched_utils.c                       node1->details->uname, node2->details->uname, result);
node2             214 lib/pacemaker/pcmk_sched_utils.c     if (node1->details->num_resources < node2->details->num_resources) {
node2             217 lib/pacemaker/pcmk_sched_utils.c                   node2->details->uname, node2->details->num_resources);
node2             220 lib/pacemaker/pcmk_sched_utils.c     } else if (node1->details->num_resources > node2->details->num_resources) {
node2             223 lib/pacemaker/pcmk_sched_utils.c                   node2->details->uname, node2->details->num_resources);
node2             230 lib/pacemaker/pcmk_sched_utils.c                   node2->details->uname, node2->details->num_resources);
node2             232 lib/pacemaker/pcmk_sched_utils.c     } else if (nw->active && nw->active->details == node2->details) {
node2             235 lib/pacemaker/pcmk_sched_utils.c                   node2->details->uname, node2->details->num_resources);
node2             239 lib/pacemaker/pcmk_sched_utils.c     crm_trace("%s = %s", node1->details->uname, node2->details->uname);
node2             240 lib/pacemaker/pcmk_sched_utils.c     return strcmp(node1->details->uname, node2->details->uname);