nw                116 lib/pacemaker/pcmk_sched_nodes.c     struct node_weight_s *nw = data;
nw                155 lib/pacemaker/pcmk_sched_nodes.c     if (pcmk__str_eq(nw->data_set->placement_strategy, "minimal",
nw                160 lib/pacemaker/pcmk_sched_nodes.c     if (pcmk__str_eq(nw->data_set->placement_strategy, "balanced",
nw                191 lib/pacemaker/pcmk_sched_nodes.c     if (nw->active != NULL) {
nw                192 lib/pacemaker/pcmk_sched_nodes.c         if (nw->active->details == node1->details) {
nw                197 lib/pacemaker/pcmk_sched_nodes.c         } else if (nw->active->details == node2->details) {
nw                225 lib/pacemaker/pcmk_sched_nodes.c     struct node_weight_s nw = { active_node, data_set };
nw                227 lib/pacemaker/pcmk_sched_nodes.c     return g_list_sort_with_data(nodes, compare_nodes, &nw);