node1              81 pengine/clone.c     node_t *node1 = NULL;
node1             113 pengine/clone.c         node1 = resource1->running_on->data;
node1             119 pengine/clone.c     if (node1) {
node1             120 pengine/clone.c         node_t *match = pe_hash_table_lookup(resource1->allowed_nodes, node1->details->id);
node1             124 pengine/clone.c             node1 = NULL;
node1             157 pengine/clone.c     if (node1 == NULL && node2 == NULL) {
node1             162 pengine/clone.c     if (node1 != node2) {
node1             163 pengine/clone.c         if (node1 == NULL) {
node1             172 pengine/clone.c     can1 = can_run_resources(node1);
node1             183 pengine/clone.c     node1 = parent_node_instance(resource1, node1);
node1             185 pengine/clone.c     if (node1 != NULL && node2 == NULL) {
node1             188 pengine/clone.c     } else if (node1 == NULL && node2 != NULL) {
node1             193 pengine/clone.c     if (node1 == NULL || node2 == NULL) {
node1             198 pengine/clone.c     if (node1->count < node2->count) {
node1             202 pengine/clone.c     } else if (node1->count > node2->count) {
node1             218 pengine/clone.c     if (node1 && node2) {
node1             281 pengine/clone.c         node1 = g_list_nth_data(resource1->running_on, 0);
node1             282 pengine/clone.c         node1 = g_hash_table_lookup(hash1, node1->details->id);
node1             287 pengine/clone.c         if (node1->weight < node2->weight) {
node1             288 pengine/clone.c             if (node1->weight < 0) {
node1             289 pengine/clone.c                 crm_trace("%s > %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node1             294 pengine/clone.c                 crm_trace("%s < %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node1             299 pengine/clone.c         } else if (node1->weight > node2->weight) {
node1             300 pengine/clone.c             crm_trace("%s > %s: current score: %d %d", resource1->id, resource2->id, node1->weight, node2->weight);
node1             321 pengine/clone.c             node1 = g_list_nth_data(list1, lpc);
node1             323 pengine/clone.c             if (node1 == NULL) {
node1             334 pengine/clone.c             if (node1->weight < node2->weight) {
node1             339 pengine/clone.c             } else if (node1->weight > node2->weight) {
node1              34 pengine/utilization.c     const node_t *node1;
node1              64 pengine/utilization.c     if (g_hash_table_lookup_extended(data->node1->details->utilization, key, NULL, NULL)) {
node1              82 pengine/utilization.c compare_capacity(const node_t * node1, const node_t * node2)
node1              86 pengine/utilization.c     data.node1 = node1;
node1              90 pengine/utilization.c     g_hash_table_foreach(node1->details->utilization, do_compare_capacity1, &data);
node1             140 pengine/utils.c     const node_t *node1 = (const node_t *)a;
node1             156 pengine/utils.c     node1_weight = node1->weight;
node1             159 pengine/utils.c     if (can_run_resources(node1) == FALSE) {
node1             168 pengine/utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node1             174 pengine/utils.c                   node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node1             179 pengine/utils.c               node1->details->uname, node1_weight, node2->details->uname, node2_weight);
node1             186 pengine/utils.c         result = compare_capacity(node1, node2);
node1             189 pengine/utils.c                       node1->details->uname, node2->details->uname, result);
node1             193 pengine/utils.c                       node1->details->uname, node2->details->uname, result);
node1             199 pengine/utils.c     if (node1->details->num_resources < node2->details->num_resources) {
node1             201 pengine/utils.c                   node1->details->uname, node1->details->num_resources,
node1             205 pengine/utils.c     } else if (node1->details->num_resources > node2->details->num_resources) {
node1             207 pengine/utils.c                   node1->details->uname, node1->details->num_resources,
node1             212 pengine/utils.c     if (active && active->details == node1->details) {
node1             214 pengine/utils.c                   node1->details->uname, node1->details->num_resources,
node1             219 pengine/utils.c                   node1->details->uname, node1->details->num_resources,
node1             224 pengine/utils.c     crm_trace("%s = %s", node1->details->uname, node2->details->uname);
node1             225 pengine/utils.c     return strcmp(node1->details->uname, node2->details->uname);
node1              73 pengine/utils.h extern int compare_capacity(const node_t * node1, const node_t * node2);