pcmk_sched_promotable.c

Go to the documentation of this file.

/*
 * Copyright 2004-2023 the Pacemaker project contributors
 *
 * The version control history for this file may have further details.
 *
 * This source code is licensed under the GNU General Public License version 2
 * or later (GPLv2+) WITHOUT ANY WARRANTY.
 */
 
#include <crm_internal.h>
 
#include <crm/msg_xml.h>
#include <pacemaker-internal.h>
 
#include "libpacemaker_private.h"
 
static void
order_instance_promotion(pe_resource_t *clone, pe_resource_t *child,
                         pe_resource_t *last)
{
    // "Promote clone" -> promote instance -> "clone promoted"
    pcmk__order_resource_actions(clone, RSC_PROMOTE, child, RSC_PROMOTE,
                                 pe_order_optional);
    pcmk__order_resource_actions(child, RSC_PROMOTE, clone, RSC_PROMOTED,
                                 pe_order_optional);
 
    // If clone is ordered, order this instance relative to last
    if ((last != NULL) && pe__clone_is_ordered(clone)) {
        pcmk__order_resource_actions(last, RSC_PROMOTE, child, RSC_PROMOTE,
                                     pe_order_optional);
    }
}
 
static void
order_instance_demotion(pe_resource_t *clone, pe_resource_t *child,
                        pe_resource_t *last)
{
    // "Demote clone" -> demote instance -> "clone demoted"
    pcmk__order_resource_actions(clone, RSC_DEMOTE, child, RSC_DEMOTE,
                                 pe_order_implies_first_printed);
    pcmk__order_resource_actions(child, RSC_DEMOTE, clone, RSC_DEMOTED,
                                 pe_order_implies_then_printed);
 
    // If clone is ordered, order this instance relative to last
    if ((last != NULL) && pe__clone_is_ordered(clone)) {
        pcmk__order_resource_actions(child, RSC_DEMOTE, last, RSC_DEMOTE,
                                     pe_order_optional);
    }
}
 
static void
check_for_role_change(const pe_resource_t *rsc, bool *demoting, bool *promoting)
{
    const GList *iter = NULL;
 
    // If this is a cloned group, check group members recursively
    if (rsc->children != NULL) {
        for (iter = rsc->children; iter != NULL; iter = iter->next) {
            check_for_role_change((const pe_resource_t *) iter->data,
                                  demoting, promoting);
        }
        return;
    }
 
    for (iter = rsc->actions; iter != NULL; iter = iter->next) {
        const pe_action_t *action = (const pe_action_t *) iter->data;
 
        if (*promoting && *demoting) {
            return;
 
        } else if (pcmk_is_set(action->flags, pe_action_optional)) {
            continue;
 
        } else if (pcmk__str_eq(RSC_DEMOTE, action->task, pcmk__str_none)) {
            *demoting = true;
 
        } else if (pcmk__str_eq(RSC_PROMOTE, action->task, pcmk__str_none)) {
            *promoting = true;
        }
    }
}
 
static void
apply_promoted_locations(pe_resource_t *child,
                         const GList *location_constraints,
                         const pe_node_t *chosen)
{
    for (const GList *iter = location_constraints; iter; iter = iter->next) {
        const pe__location_t *location = iter->data;
        pe_node_t *weighted_node = NULL;
 
        if (location->role_filter == RSC_ROLE_PROMOTED) {
            weighted_node = pe_find_node_id(location->node_list_rh,
                                            chosen->details->id);
        }
        if (weighted_node != NULL) {
            int new_priority = pcmk__add_scores(child->priority,
                                                weighted_node->weight);
 
            pe_rsc_trace(child,
                         "Applying location %s to %s promotion priority on %s: "
                         "%s + %s = %s",
                         location->id, child->id, pe__node_name(weighted_node),
                         pcmk_readable_score(child->priority),
                         pcmk_readable_score(weighted_node->weight),
                         pcmk_readable_score(new_priority));
            child->priority = new_priority;
        }
    }
}
 
static pe_node_t *
node_to_be_promoted_on(const pe_resource_t *rsc)
{
    pe_node_t *node = NULL;
    pe_node_t *local_node = NULL;
    const pe_resource_t *parent = NULL;
 
    // If this is a cloned group, bail if any group member can't be promoted
    for (GList *iter = rsc->children; iter != NULL; iter = iter->next) {
        pe_resource_t *child = (pe_resource_t *) iter->data;
 
        if (node_to_be_promoted_on(child) == NULL) {
            pe_rsc_trace(rsc,
                         "%s can't be promoted because member %s can't",
                         rsc->id, child->id);
            return NULL;
        }
    }
 
    node = rsc->fns->location(rsc, NULL, FALSE);
    if (node == NULL) {
        pe_rsc_trace(rsc, "%s can't be promoted because it won't be active",
                     rsc->id);
        return NULL;
 
    } else if (!pcmk_is_set(rsc->flags, pe_rsc_managed)) {
        if (rsc->fns->state(rsc, TRUE) == RSC_ROLE_PROMOTED) {
            crm_notice("Unmanaged instance %s will be left promoted on %s",
                       rsc->id, pe__node_name(node));
        } else {
            pe_rsc_trace(rsc, "%s can't be promoted because it is unmanaged",
                         rsc->id);
            return NULL;
        }
 
    } else if (rsc->priority < 0) {
        pe_rsc_trace(rsc,
                     "%s can't be promoted because its promotion priority %d "
                     "is negative",
                     rsc->id, rsc->priority);
        return NULL;
 
    } else if (!pcmk__node_available(node, false, true)) {
        pe_rsc_trace(rsc, "%s can't be promoted because %s can't run resources",
                     rsc->id, pe__node_name(node));
        return NULL;
    }
 
    parent = pe__const_top_resource(rsc, false);
    local_node = pe_hash_table_lookup(parent->allowed_nodes, node->details->id);
 
    if (local_node == NULL) {
        /* It should not be possible for the scheduler to have allocated the
         * instance to a node where its parent is not allowed, but it's good to
         * have a fail-safe.
         */
        if (pcmk_is_set(rsc->flags, pe_rsc_managed)) {
            crm_warn("%s can't be promoted because %s is not allowed on %s "
                     "(scheduler bug?)",
                     rsc->id, parent->id, pe__node_name(node));
        } // else the instance is unmanaged and already promoted
        return NULL;
 
    } else if ((local_node->count >= pe__clone_promoted_node_max(parent))
               && pcmk_is_set(rsc->flags, pe_rsc_managed)) {
        pe_rsc_trace(rsc,
                     "%s can't be promoted because %s has "
                     "maximum promoted instances already",
                     rsc->id, pe__node_name(node));
        return NULL;
    }
 
    return local_node;
}
 
static gint
cmp_promotable_instance(gconstpointer a, gconstpointer b)
{
    const pe_resource_t *rsc1 = (const pe_resource_t *) a;
    const pe_resource_t *rsc2 = (const pe_resource_t *) b;
 
    enum rsc_role_e role1 = RSC_ROLE_UNKNOWN;
    enum rsc_role_e role2 = RSC_ROLE_UNKNOWN;
 
    CRM_ASSERT((rsc1 != NULL) && (rsc2 != NULL));
 
    // Check sort index set by pcmk__set_instance_roles()
    if (rsc1->sort_index > rsc2->sort_index) {
        pe_rsc_trace(rsc1,
                     "%s has higher promotion priority than %s "
                     "(sort index %d > %d)",
                     rsc1->id, rsc2->id, rsc1->sort_index, rsc2->sort_index);
        return -1;
    } else if (rsc1->sort_index < rsc2->sort_index) {
        pe_rsc_trace(rsc1,
                     "%s has lower promotion priority than %s "
                     "(sort index %d < %d)",
                     rsc1->id, rsc2->id, rsc1->sort_index, rsc2->sort_index);
        return 1;
    }
 
    // If those are the same, prefer instance whose current role is higher
    role1 = rsc1->fns->state(rsc1, TRUE);
    role2 = rsc2->fns->state(rsc2, TRUE);
    if (role1 > role2) {
        pe_rsc_trace(rsc1,
                     "%s has higher promotion priority than %s "
                     "(higher current role)",
                     rsc1->id, rsc2->id);
        return -1;
    } else if (role1 < role2) {
        pe_rsc_trace(rsc1,
                     "%s has lower promotion priority than %s "
                     "(lower current role)",
                     rsc1->id, rsc2->id);
        return 1;
    }
 
    // Finally, do normal clone instance sorting
    return pcmk__cmp_instance(a, b);
}
 
static void
add_sort_index_to_node_weight(gpointer data, gpointer user_data)
{
    const pe_resource_t *child = (const pe_resource_t *) data;
    pe_resource_t *clone = (pe_resource_t *) user_data;
 
    pe_node_t *node = NULL;
    const pe_node_t *chosen = NULL;
 
    if (child->sort_index < 0) {
        pe_rsc_trace(clone, "Not adding sort index of %s: negative", child->id);
        return;
    }
 
    chosen = child->fns->location(child, NULL, FALSE);
    if (chosen == NULL) {
        pe_rsc_trace(clone, "Not adding sort index of %s: inactive", child->id);
        return;
    }
 
    node = (pe_node_t *) pe_hash_table_lookup(clone->allowed_nodes,
                                              chosen->details->id);
    CRM_ASSERT(node != NULL);
 
    node->weight = pcmk__add_scores(child->sort_index, node->weight);
    pe_rsc_trace(clone,
                 "Added cumulative priority of %s (%s) to score on %s (now %s)",
                 child->id, pcmk_readable_score(child->sort_index),
                 pe__node_name(node), pcmk_readable_score(node->weight));
}
 
static void
apply_coloc_to_dependent(gpointer data, gpointer user_data)
{
    pcmk__colocation_t *constraint = (pcmk__colocation_t *) data;
    pe_resource_t *clone = (pe_resource_t *) user_data;
    pe_resource_t *primary = constraint->primary;
    uint32_t flags = pcmk__coloc_select_default;
    float factor = constraint->score / (float) INFINITY;
 
    if (constraint->dependent_role != RSC_ROLE_PROMOTED) {
        return;
    }
    if (constraint->score < INFINITY) {
        flags = pcmk__coloc_select_active;
    }
    pe_rsc_trace(clone, "Applying colocation %s (promoted %s with %s) @%s",
                 constraint->id, constraint->dependent->id,
                 constraint->primary->id,
                 pcmk_readable_score(constraint->score));
    primary->cmds->add_colocated_node_scores(primary, clone->id,
                                             &clone->allowed_nodes,
                                             constraint->node_attribute, factor,
                                             flags);
}
 
static void
apply_coloc_to_primary(gpointer data, gpointer user_data)
{
    pcmk__colocation_t *constraint = (pcmk__colocation_t *) data;
    pe_resource_t *clone = (pe_resource_t *) user_data;
    pe_resource_t *dependent = constraint->dependent;
    const float factor = constraint->score / (float) INFINITY;
    const uint32_t flags = pcmk__coloc_select_active
                           |pcmk__coloc_select_nonnegative;
 
    if ((constraint->primary_role != RSC_ROLE_PROMOTED)
         || !pcmk__colocation_has_influence(constraint, NULL)) {
        return;
    }
 
    pe_rsc_trace(clone, "Applying colocation %s (%s with promoted %s) @%s",
                 constraint->id, constraint->dependent->id,
                 constraint->primary->id,
                 pcmk_readable_score(constraint->score));
    dependent->cmds->add_colocated_node_scores(dependent, clone->id,
                                               &clone->allowed_nodes,
                                               constraint->node_attribute,
                                               factor, flags);
}
 
static void
set_sort_index_to_node_weight(gpointer data, gpointer user_data)
{
    pe_resource_t *child = (pe_resource_t *) data;
    const pe_resource_t *clone = (const pe_resource_t *) user_data;
 
    pe_node_t *chosen = child->fns->location(child, NULL, FALSE);
 
    if (!pcmk_is_set(child->flags, pe_rsc_managed)
        && (child->next_role == RSC_ROLE_PROMOTED)) {
        child->sort_index = INFINITY;
        pe_rsc_trace(clone,
                     "Final sort index for %s is INFINITY (unmanaged promoted)",
                     child->id);
 
    } else if ((chosen == NULL) || (child->sort_index < 0)) {
        pe_rsc_trace(clone,
                     "Final sort index for %s is %d (ignoring node weight)",
                     child->id, child->sort_index);
 
    } else {
        const pe_node_t *node = NULL;
 
        node = pe_hash_table_lookup(clone->allowed_nodes, chosen->details->id);
        CRM_ASSERT(node != NULL);
 
        child->sort_index = node->weight;
        pe_rsc_trace(clone,
                     "Merging weights for %s: final sort index for %s is %d",
                     clone->id, child->id, child->sort_index);
    }
}
 
static void
sort_promotable_instances(pe_resource_t *clone)
{
    if (pe__set_clone_flag(clone, pe__clone_promotion_constrained)
            == pcmk_rc_already) {
        return;
    }
    pe__set_resource_flags(clone, pe_rsc_merging);
 
    for (GList *iter = clone->children; iter != NULL; iter = iter->next) {
        pe_resource_t *child = (pe_resource_t *) iter->data;
 
        pe_rsc_trace(clone,
                     "Merging weights for %s: initial sort index for %s is %d",
                     clone->id, child->id, child->sort_index);
    }
    pe__show_node_weights(true, clone, "Before", clone->allowed_nodes,
                          clone->cluster);
 
    /* Because the this_with_colocations() and with_this_colocations() methods
     * boil down to copies of rsc_cons and rsc_cons_lhs for clones, we can use
     * those here directly for efficiency.
     */
    g_list_foreach(clone->children, add_sort_index_to_node_weight, clone);
    g_list_foreach(clone->rsc_cons, apply_coloc_to_dependent, clone);
    g_list_foreach(clone->rsc_cons_lhs, apply_coloc_to_primary, clone);
 
    // Ban resource from all nodes if it needs a ticket but doesn't have it
    pcmk__require_promotion_tickets(clone);
 
    pe__show_node_weights(true, clone, "After", clone->allowed_nodes,
                          clone->cluster);
 
    // Reset sort indexes to final node weights
    g_list_foreach(clone->children, set_sort_index_to_node_weight, clone);
 
    // Finally, sort instances in descending order of promotion priority
    clone->children = g_list_sort(clone->children, cmp_promotable_instance);
    pe__clear_resource_flags(clone, pe_rsc_merging);
}
 
static pe_resource_t *
find_active_anon_instance(const pe_resource_t *clone, const char *id,
                          const pe_node_t *node)
{
    for (GList *iter = clone->children; iter; iter = iter->next) {
        pe_resource_t *child = iter->data;
        pe_resource_t *active = NULL;
 
        // Use ->find_rsc() in case this is a cloned group
        active = clone->fns->find_rsc(child, id, node,
                                      pe_find_clone|pe_find_current);
        if (active != NULL) {
            return active;
        }
    }
    return NULL;
}
 
/*
 * \brief Check whether an anonymous clone instance is known on a node
 *
 * \param[in] clone  Anonymous clone to check
 * \param[in] id     Instance ID (without instance number) to check
 * \param[in] node   Node to check
 *
 * \return true if \p id instance of \p clone is known on \p node,
 *         otherwise false
 */
static bool
anonymous_known_on(const pe_resource_t *clone, const char *id,
                   const pe_node_t *node)
{
    for (GList *iter = clone->children; iter; iter = iter->next) {
        pe_resource_t *child = iter->data;
 
        /* Use ->find_rsc() because this might be a cloned group, and knowing
         * that other members of the group are known here implies nothing.
         */
        child = clone->fns->find_rsc(child, id, NULL, pe_find_clone);
        CRM_LOG_ASSERT(child != NULL);
        if (child != NULL) {
            if (g_hash_table_lookup(child->known_on, node->details->id)) {
                return true;
            }
        }
    }
    return false;
}
 
static bool
is_allowed(const pe_resource_t *rsc, const pe_node_t *node)
{
    pe_node_t *allowed = pe_hash_table_lookup(rsc->allowed_nodes,
                                              node->details->id);
 
    return (allowed != NULL) && (allowed->weight >= 0);
}
 
static bool
promotion_score_applies(const pe_resource_t *rsc, const pe_node_t *node)
{
    char *id = clone_strip(rsc->id);
    const pe_resource_t *parent = pe__const_top_resource(rsc, false);
    pe_resource_t *active = NULL;
    const char *reason = "allowed";
 
    // Some checks apply only to anonymous clone instances
    if (!pcmk_is_set(rsc->flags, pe_rsc_unique)) {
 
        // If instance is active on the node, its score definitely applies
        active = find_active_anon_instance(parent, id, node);
        if (active == rsc) {
            reason = "active";
            goto check_allowed;
        }
 
        /* If *no* instance is active on this node, this instance's score will
         * count if it has been probed on this node.
         */
        if ((active == NULL) && anonymous_known_on(parent, id, node)) {
            reason = "probed";
            goto check_allowed;
        }
    }
 
    /* If this clone's status is unknown on *all* nodes (e.g. cluster startup),
     * take all instances' scores into account, to make sure we use any
     * permanent promotion scores.
     */
    if ((rsc->running_on == NULL) && (g_hash_table_size(rsc->known_on) == 0)) {
        reason = "none probed";
        goto check_allowed;
    }
 
    /* Otherwise, we've probed and/or started the resource *somewhere*, so
     * consider promotion scores on nodes where we know the status.
     */
    if ((pe_hash_table_lookup(rsc->known_on, node->details->id) != NULL)
        || (pe_find_node_id(rsc->running_on, node->details->id) != NULL)) {
        reason = "known";
    } else {
        pe_rsc_trace(rsc,
                     "Ignoring %s promotion score (for %s) on %s: not probed",
                     rsc->id, id, pe__node_name(node));
        free(id);
        return false;
    }
 
check_allowed:
    if (is_allowed(rsc, node)) {
        pe_rsc_trace(rsc, "Counting %s promotion score (for %s) on %s: %s",
                     rsc->id, id, pe__node_name(node), reason);
        free(id);
        return true;
    }
 
    pe_rsc_trace(rsc, "Ignoring %s promotion score (for %s) on %s: not allowed",
                 rsc->id, id, pe__node_name(node));
    free(id);
    return false;
}
 
static const char *
promotion_attr_value(const pe_resource_t *rsc, const pe_node_t *node,
                     const char *name)
{
    char *attr_name = NULL;
    const char *attr_value = NULL;
 
    CRM_CHECK((rsc != NULL) && (node != NULL) && (name != NULL), return NULL);
 
    attr_name = pcmk_promotion_score_name(name);
    attr_value = pe_node_attribute_calculated(node, attr_name, rsc);
    free(attr_name);
    return attr_value;
}
 
static int
promotion_score(const pe_resource_t *rsc, const pe_node_t *node,
                bool *is_default)
{
    char *name = NULL;
    const char *attr_value = NULL;
 
    if (is_default != NULL) {
        *is_default = true;
    }
 
    CRM_CHECK((rsc != NULL) && (node != NULL), return 0);
 
    /* If this is an instance of a cloned group, the promotion score is the sum
     * of all members' promotion scores.
     */
    if (rsc->children != NULL) {
        int score = 0;
 
        for (const GList *iter = rsc->children;
             iter != NULL; iter = iter->next) {
 
            const pe_resource_t *child = (const pe_resource_t *) iter->data;
            bool child_default = false;
            int child_score = promotion_score(child, node, &child_default);
 
            if (!child_default && (is_default != NULL)) {
                *is_default = false;
            }
            score += child_score;
        }
        return score;
    }
 
    if (!promotion_score_applies(rsc, node)) {
        return 0;
    }
 
    /* For the promotion score attribute name, use the name the resource is
     * known as in resource history, since that's what crm_attribute --promotion
     * would have used.
     */
    name = (rsc->clone_name == NULL)? rsc->id : rsc->clone_name;
 
    attr_value = promotion_attr_value(rsc, node, name);
    if (attr_value != NULL) {
        pe_rsc_trace(rsc, "Promotion score for %s on %s = %s",
                     name, pe__node_name(node), pcmk__s(attr_value, "(unset)"));
    } else if (!pcmk_is_set(rsc->flags, pe_rsc_unique)) {
        /* If we don't have any resource history yet, we won't have clone_name.
         * In that case, for anonymous clones, try the resource name without
         * any instance number.
         */
        name = clone_strip(rsc->id);
        if (strcmp(rsc->id, name) != 0) {
            attr_value = promotion_attr_value(rsc, node, name);
            pe_rsc_trace(rsc, "Promotion score for %s on %s (for %s) = %s",
                         name, pe__node_name(node), rsc->id,
                         pcmk__s(attr_value, "(unset)"));
        }
        free(name);
    }
 
    if (attr_value == NULL) {
        return 0;
    }
 
    if (is_default != NULL) {
        *is_default = false;
    }
    return char2score(attr_value);
}
 
void
pcmk__add_promotion_scores(pe_resource_t *rsc)
{
    if (pe__set_clone_flag(rsc, pe__clone_promotion_added) == pcmk_rc_already) {
        return;
    }
 
    for (GList *iter = rsc->children; iter != NULL; iter = iter->next) {
        pe_resource_t *child_rsc = (pe_resource_t *) iter->data;
 
        GHashTableIter iter;
        pe_node_t *node = NULL;
        int score, new_score;
 
        g_hash_table_iter_init(&iter, child_rsc->allowed_nodes);
        while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
            if (!pcmk__node_available(node, false, false)) {
                /* This node will never be promoted, so don't apply the
                 * promotion score, as that may lead to clone shuffling.
                 */
                continue;
            }
 
            score = promotion_score(child_rsc, node, NULL);
            if (score > 0) {
                new_score = pcmk__add_scores(node->weight, score);
                if (new_score != node->weight) { // Could remain INFINITY
                    node->weight = new_score;
                    pe_rsc_trace(rsc,
                                 "Added %s promotion priority (%s) to score "
                                 "on %s (now %s)",
                                 child_rsc->id, pcmk_readable_score(score),
                                 pe__node_name(node),
                                 pcmk_readable_score(new_score));
                }
            }
 
            if (score > child_rsc->priority) {
                pe_rsc_trace(rsc,
                             "Updating %s priority to promotion score (%d->%d)",
                             child_rsc->id, child_rsc->priority, score);
                child_rsc->priority = score;
            }
        }
    }
}
 
static void
set_current_role_unpromoted(void *data, void *user_data)
{
    pe_resource_t *rsc = (pe_resource_t *) data;
 
    if (rsc->role == RSC_ROLE_STARTED) {
        // Promotable clones should use unpromoted role instead of started
        rsc->role = RSC_ROLE_UNPROMOTED;
    }
    g_list_foreach(rsc->children, set_current_role_unpromoted, NULL);
}
 
static void
set_next_role_unpromoted(void *data, void *user_data)
{
    pe_resource_t *rsc = (pe_resource_t *) data;
    GList *assigned = NULL;
 
    rsc->fns->location(rsc, &assigned, FALSE);
    if (assigned == NULL) {
        pe__set_next_role(rsc, RSC_ROLE_STOPPED, "stopped instance");
    } else {
        pe__set_next_role(rsc, RSC_ROLE_UNPROMOTED, "unpromoted instance");
        g_list_free(assigned);
    }
    g_list_foreach(rsc->children, set_next_role_unpromoted, NULL);
}
 
static void
set_next_role_promoted(void *data, gpointer user_data)
{
    pe_resource_t *rsc = (pe_resource_t *) data;
 
    if (rsc->next_role == RSC_ROLE_UNKNOWN) {
        pe__set_next_role(rsc, RSC_ROLE_PROMOTED, "promoted instance");
    }
    g_list_foreach(rsc->children, set_next_role_promoted, NULL);
}
 
static void
show_promotion_score(pe_resource_t *instance)
{
    pe_node_t *chosen = instance->fns->location(instance, NULL, FALSE);
 
    if (pcmk_is_set(instance->cluster->flags, pe_flag_show_scores)
        && !pcmk__is_daemon && (instance->cluster->priv != NULL)) {
 
        pcmk__output_t *out = instance->cluster->priv;
 
        out->message(out, "promotion-score", instance, chosen,
                     pcmk_readable_score(instance->sort_index));
    } else {
        pe_rsc_debug(pe__const_top_resource(instance, false),
                     "%s promotion score on %s: sort=%s priority=%s",
                     instance->id,
                     ((chosen == NULL)? "none" : pe__node_name(chosen)),
                     pcmk_readable_score(instance->sort_index),
                     pcmk_readable_score(instance->priority));
    }
}
 
static void
set_instance_priority(gpointer data, gpointer user_data)
{
    pe_resource_t *instance = (pe_resource_t *) data;
    const pe_resource_t *clone = (const pe_resource_t *) user_data;
    const pe_node_t *chosen = NULL;
    enum rsc_role_e next_role = RSC_ROLE_UNKNOWN;
    GList *list = NULL;
 
    pe_rsc_trace(clone, "Assigning priority for %s: %s", instance->id,
                 role2text(instance->next_role));
 
    if (instance->fns->state(instance, TRUE) == RSC_ROLE_STARTED) {
        set_current_role_unpromoted(instance, NULL);
    }
 
    // Only an instance that will be active can be promoted
    chosen = instance->fns->location(instance, &list, FALSE);
    if (pcmk__list_of_multiple(list)) {
        pcmk__config_err("Cannot promote non-colocated child %s",
                         instance->id);
    }
    g_list_free(list);
    if (chosen == NULL) {
        return;
    }
 
    next_role = instance->fns->state(instance, FALSE);
    switch (next_role) {
        case RSC_ROLE_STARTED:
        case RSC_ROLE_UNKNOWN:
            // Set instance priority to its promotion score (or -1 if none)
            {
                bool is_default = false;
 
                instance->priority = promotion_score(instance, chosen,
                                                      &is_default);
                if (is_default) {
                    /*
                     * Default to -1 if no value is set. This allows
                     * instances eligible for promotion to be specified
                     * based solely on rsc_location constraints, but
                     * prevents any instance from being promoted if neither
                     * a constraint nor a promotion score is present
                     */
                    instance->priority = -1;
                }
            }
            break;
 
        case RSC_ROLE_UNPROMOTED:
        case RSC_ROLE_STOPPED:
            // Instance can't be promoted
            instance->priority = -INFINITY;
            break;
 
        case RSC_ROLE_PROMOTED:
            // Nothing needed (re-creating actions after scheduling fencing)
            break;
 
        default:
            CRM_CHECK(FALSE, crm_err("Unknown resource role %d for %s",
                                     next_role, instance->id));
    }
 
    // Add relevant location constraint scores for promoted role
    apply_promoted_locations(instance, instance->rsc_location, chosen);
    apply_promoted_locations(instance, clone->rsc_location, chosen);
 
    // Consider instance's role-based colocations with other resources
    list = pcmk__this_with_colocations(instance);
    for (GList *iter = list; iter != NULL; iter = iter->next) {
        pcmk__colocation_t *cons = (pcmk__colocation_t *) iter->data;
 
        instance->cmds->apply_coloc_score(instance, cons->primary, cons, true);
    }
    g_list_free(list);
 
    instance->sort_index = instance->priority;
    if (next_role == RSC_ROLE_PROMOTED) {
        instance->sort_index = INFINITY;
    }
    pe_rsc_trace(clone, "Assigning %s priority = %d",
                 instance->id, instance->priority);
}
 
static void
set_instance_role(gpointer data, gpointer user_data)
{
    pe_resource_t *instance = (pe_resource_t *) data;
    int *count = (int *) user_data;
 
    const pe_resource_t *clone = pe__const_top_resource(instance, false);
    pe_node_t *chosen = NULL;
 
    show_promotion_score(instance);
 
    if (instance->sort_index < 0) {
        pe_rsc_trace(clone, "Not supposed to promote instance %s",
                     instance->id);
 
    } else if ((*count < pe__clone_promoted_max(instance))
               || !pcmk_is_set(clone->flags, pe_rsc_managed)) {
        chosen = node_to_be_promoted_on(instance);
    }
 
    if (chosen == NULL) {
        set_next_role_unpromoted(instance, NULL);
        return;
    }
 
    if ((instance->role < RSC_ROLE_PROMOTED)
        && !pcmk_is_set(instance->cluster->flags, pe_flag_have_quorum)
        && (instance->cluster->no_quorum_policy == no_quorum_freeze)) {
        crm_notice("Clone instance %s cannot be promoted without quorum",
                   instance->id);
        set_next_role_unpromoted(instance, NULL);
        return;
    }
 
    chosen->count++;
    pe_rsc_info(clone, "Choosing %s (%s) on %s for promotion",
                instance->id, role2text(instance->role),
                pe__node_name(chosen));
    set_next_role_promoted(instance, NULL);
    (*count)++;
}
 
void
pcmk__set_instance_roles(pe_resource_t *rsc)
{
    int promoted = 0;
    GHashTableIter iter;
    pe_node_t *node = NULL;
 
    // Repurpose count to track the number of promoted instances allocated
    g_hash_table_iter_init(&iter, rsc->allowed_nodes);
    while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
        node->count = 0;
    }
 
    // Set instances' promotion priorities and sort by highest priority first
    g_list_foreach(rsc->children, set_instance_priority, rsc);
    sort_promotable_instances(rsc);
 
    // Choose the first N eligible instances to be promoted
    g_list_foreach(rsc->children, set_instance_role, &promoted);
    pe_rsc_info(rsc, "%s: Promoted %d instances of a possible %d",
                rsc->id, promoted, pe__clone_promoted_max(rsc));
}
 
static void
create_promotable_instance_actions(pe_resource_t *clone,
                                   bool *any_promoting, bool *any_demoting)
{
    for (GList *iter = clone->children; iter != NULL; iter = iter->next) {
        pe_resource_t *instance = (pe_resource_t *) iter->data;
 
        instance->cmds->create_actions(instance);
        check_for_role_change(instance, any_demoting, any_promoting);
    }
}
 
static void
reset_instance_priorities(pe_resource_t *clone)
{
    for (GList *iter = clone->children; iter != NULL; iter = iter->next) {
        pe_resource_t *instance = (pe_resource_t *) iter->data;
 
        instance->priority = clone->priority;
    }
}
 
void
pcmk__create_promotable_actions(pe_resource_t *clone)
{
    bool any_promoting = false;
    bool any_demoting = false;
 
    // Create actions for each clone instance individually
    create_promotable_instance_actions(clone, &any_promoting, &any_demoting);
 
    // Create pseudo-actions for clone as a whole
    pe__create_promotable_pseudo_ops(clone, any_promoting, any_demoting);
 
    // Undo our temporary repurposing of resource priority for instances
    reset_instance_priorities(clone);
}
 
void
pcmk__order_promotable_instances(pe_resource_t *clone)
{
    pe_resource_t *previous = NULL; // Needed for ordered clones
 
    pcmk__promotable_restart_ordering(clone);
 
    for (GList *iter = clone->children; iter != NULL; iter = iter->next) {
        pe_resource_t *instance = (pe_resource_t *) iter->data;
 
        // Demote before promote
        pcmk__order_resource_actions(instance, RSC_DEMOTE,
                                     instance, RSC_PROMOTE,
                                     pe_order_optional);
 
        order_instance_promotion(clone, instance, previous);
        order_instance_demotion(clone, instance, previous);
        previous = instance;
    }
}
 
static void
update_dependent_allowed_nodes(pe_resource_t *dependent,
                               const pe_node_t *primary_node,
                               const pcmk__colocation_t *colocation)
{
    GHashTableIter iter;
    pe_node_t *node = NULL;
    const char *primary_value = NULL;
    const char *attr = NULL;
 
    if (colocation->score >= INFINITY) {
        return; // Colocation is mandatory, so allowed node scores don't matter
    }
 
    // Get value of primary's colocation node attribute
    attr = colocation->node_attribute;
    if (attr == NULL) {
        attr = CRM_ATTR_UNAME;
    }
    primary_value = pe_node_attribute_raw(primary_node, attr);
 
    pe_rsc_trace(colocation->primary,
                 "Applying %s (%s with %s on %s by %s @%d) to %s",
                 colocation->id, colocation->dependent->id,
                 colocation->primary->id, pe__node_name(primary_node), attr,
                 colocation->score, dependent->id);
 
    g_hash_table_iter_init(&iter, dependent->allowed_nodes);
    while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
        const char *dependent_value = pe_node_attribute_raw(node, attr);
 
        if (pcmk__str_eq(primary_value, dependent_value, pcmk__str_casei)) {
            node->weight = pcmk__add_scores(node->weight, colocation->score);
            pe_rsc_trace(colocation->primary,
                         "Added %s score (%s) to %s (now %s)",
                         colocation->id, pcmk_readable_score(colocation->score),
                         pe__node_name(node),
                         pcmk_readable_score(node->weight));
        }
    }
}
 
void
pcmk__update_dependent_with_promotable(const pe_resource_t *primary,
                                       pe_resource_t *dependent,
                                       const pcmk__colocation_t *colocation)
{
    GList *affected_nodes = NULL;
 
    /* Build a list of all nodes where an instance of the primary will be, and
     * (for optional colocations) update the dependent's allowed node scores for
     * each one.
     */
    for (GList *iter = primary->children; iter != NULL; iter = iter->next) {
        pe_resource_t *instance = (pe_resource_t *) iter->data;
        pe_node_t *node = instance->fns->location(instance, NULL, FALSE);
 
        if (node == NULL) {
            continue;
        }
        if (instance->fns->state(instance, FALSE) == colocation->primary_role) {
            update_dependent_allowed_nodes(dependent, node, colocation);
            affected_nodes = g_list_prepend(affected_nodes, node);
        }
    }
 
    /* For mandatory colocations, add the primary's node weight to the
     * dependent's node weight for each affected node, and ban the dependent
     * from all other nodes.
     *
     * However, skip this for promoted-with-promoted colocations, otherwise
     * inactive dependent instances can't start (in the unpromoted role).
     */
    if ((colocation->score >= INFINITY)
        && ((colocation->dependent_role != RSC_ROLE_PROMOTED)
            || (colocation->primary_role != RSC_ROLE_PROMOTED))) {
 
        pe_rsc_trace(colocation->primary,
                     "Applying %s (mandatory %s with %s) to %s",
                     colocation->id, colocation->dependent->id,
                     colocation->primary->id, dependent->id);
        node_list_exclude(dependent->allowed_nodes, affected_nodes,
                          TRUE);
    }
    g_list_free(affected_nodes);
}
 
void
pcmk__update_promotable_dependent_priority(const pe_resource_t *primary,
                                           pe_resource_t *dependent,
                                           const pcmk__colocation_t *colocation)
{
    pe_resource_t *primary_instance = NULL;
 
    // Look for a primary instance where dependent will be
    primary_instance = pcmk__find_compatible_instance(dependent, primary,
                                                      colocation->primary_role,
                                                      false);
 
    if (primary_instance != NULL) {
        // Add primary instance's priority to dependent's
        int new_priority = pcmk__add_scores(dependent->priority,
                                            colocation->score);
 
        pe_rsc_trace(colocation->primary,
                     "Applying %s (%s with %s) to %s priority (%s + %s = %s)",
                     colocation->id, colocation->dependent->id,
                     colocation->primary->id, dependent->id,
                     pcmk_readable_score(dependent->priority),
                     pcmk_readable_score(colocation->score),
                     pcmk_readable_score(new_priority));
        dependent->priority = new_priority;
 
    } else if (colocation->score >= INFINITY) {
        // Mandatory colocation, but primary won't be here
        pe_rsc_trace(colocation->primary,
                     "Applying %s (%s with %s) to %s: can't be promoted",
                     colocation->id, colocation->dependent->id,
                     colocation->primary->id, dependent->id);
        dependent->priority = -INFINITY;
    }
}