sort_index 424 include/crm/common/resources.h int sort_index; //!< Promotion score on assigned node sort_index 263 lib/pacemaker/pcmk_sched_promotable.c if (rsc1->sort_index > rsc2->sort_index) { sort_index 267 lib/pacemaker/pcmk_sched_promotable.c rsc1->id, rsc2->id, rsc1->sort_index, rsc2->sort_index); sort_index 269 lib/pacemaker/pcmk_sched_promotable.c } else if (rsc1->sort_index < rsc2->sort_index) { sort_index 273 lib/pacemaker/pcmk_sched_promotable.c rsc1->id, rsc2->id, rsc1->sort_index, rsc2->sort_index); sort_index 318 lib/pacemaker/pcmk_sched_promotable.c if (child->sort_index < 0) { sort_index 332 lib/pacemaker/pcmk_sched_promotable.c node->weight = pcmk__add_scores(child->sort_index, node->weight); sort_index 335 lib/pacemaker/pcmk_sched_promotable.c child->id, pcmk_readable_score(child->sort_index), sort_index 418 lib/pacemaker/pcmk_sched_promotable.c child->sort_index = INFINITY; sort_index 423 lib/pacemaker/pcmk_sched_promotable.c } else if ((chosen == NULL) || (child->sort_index < 0)) { sort_index 426 lib/pacemaker/pcmk_sched_promotable.c child->id, child->sort_index); sort_index 433 lib/pacemaker/pcmk_sched_promotable.c child->sort_index = node->weight; sort_index 436 lib/pacemaker/pcmk_sched_promotable.c clone->id, child->id, child->sort_index); sort_index 462 lib/pacemaker/pcmk_sched_promotable.c clone->id, child->id, child->sort_index); sort_index 886 lib/pacemaker/pcmk_sched_promotable.c pcmk_readable_score(instance->sort_index)); sort_index 892 lib/pacemaker/pcmk_sched_promotable.c pcmk_readable_score(instance->sort_index), sort_index 982 lib/pacemaker/pcmk_sched_promotable.c instance->sort_index = instance->priority; sort_index 984 lib/pacemaker/pcmk_sched_promotable.c instance->sort_index = INFINITY; sort_index 1008 lib/pacemaker/pcmk_sched_promotable.c if (instance->sort_index < 0) {