order 379 include/crm/pengine/internal.h extern gboolean order_actions(pe_action_t * lh_action, pe_action_t * rh_action, enum pe_ordering order); order 1792 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order) order 1800 lib/pacemaker/pcmk_sched_allocate.c CRM_CHECK(order != NULL, return); order 1802 lib/pacemaker/pcmk_sched_allocate.c type = order->type; order 1803 lib/pacemaker/pcmk_sched_allocate.c rh_action = order->rh_action; order 1804 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Processing RH of ordering constraint %d", order->id); order 1810 lib/pacemaker/pcmk_sched_allocate.c rh_actions = find_actions_by_task(rsc->actions, rsc, order->rh_action_task); order 1815 lib/pacemaker/pcmk_sched_allocate.c " ignoring", rsc->id, order->rh_action_task); order 1826 lib/pacemaker/pcmk_sched_allocate.c order->rh_action_task); order 1850 lib/pacemaker/pcmk_sched_allocate.c rsc_order_first(pe_resource_t *lh_rsc, pe__ordering_t *order, order 1855 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *lh_action = order->lh_action; order 1856 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rh_rsc = order->rh_rsc; order 1858 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Processing LH of ordering constraint %d", order->id); order 1865 lib/pacemaker/pcmk_sched_allocate.c lh_actions = find_actions_by_task(lh_rsc->actions, lh_rsc, order->lh_action_task); order 1873 lib/pacemaker/pcmk_sched_allocate.c parse_op_key(order->lh_action_task, NULL, &op_type, &interval_ms); order 1879 lib/pacemaker/pcmk_sched_allocate.c lh_rsc->id, order->lh_action_task, order->id, order->rh_action_task); order 1884 lib/pacemaker/pcmk_sched_allocate.c lh_rsc->id, order->lh_action_task, order->id, order->rh_action_task); order 1888 lib/pacemaker/pcmk_sched_allocate.c lh_rsc->id, order->lh_action_task, order->id, order->rh_action_task); order 1900 lib/pacemaker/pcmk_sched_allocate.c if (rh_rsc == NULL && order->rh_action) { order 1901 lib/pacemaker/pcmk_sched_allocate.c rh_rsc = order->rh_action->rsc; order 1904 lib/pacemaker/pcmk_sched_allocate.c rsc_order_then(lh_action_iter, rh_rsc, order); order 1906 lib/pacemaker/pcmk_sched_allocate.c } else if (order->rh_action) { order 1907 lib/pacemaker/pcmk_sched_allocate.c order_actions(lh_action_iter, order->rh_action, order->type); order 2363 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order = gIter->data; order 2366 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *lh_rsc = order->lh_rsc; order 2367 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rh_rsc = order->rh_rsc; order 2368 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *lh_action = order->lh_action; order 2369 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *rh_action = order->rh_action; order 2370 lib/pacemaker/pcmk_sched_allocate.c const char *lh_action_task = order->lh_action_task; order 2371 lib/pacemaker/pcmk_sched_allocate.c const char *rh_action_task = order->rh_action_task; order 2420 lib/pacemaker/pcmk_sched_allocate.c if (order->type == pe_order_none) { order 2425 lib/pacemaker/pcmk_sched_allocate.c if (pcmk_is_set(order->type, pe_order_apply_first_non_migratable)) { order 2430 lib/pacemaker/pcmk_sched_allocate.c if (pcmk_is_set(order->type, pe_order_same_node)) { order 2435 lib/pacemaker/pcmk_sched_allocate.c if (order->type == pe_order_anti_colocation order 2436 lib/pacemaker/pcmk_sched_allocate.c || order->type == pe_order_load) { order 2437 lib/pacemaker/pcmk_sched_allocate.c order_type = order->type; order 2461 lib/pacemaker/pcmk_sched_allocate.c order->id, order->type); order 2814 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order = gIter->data; order 2815 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rsc = order->lh_rsc; order 2817 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Applying ordering constraint: %d", order->id); order 2821 lib/pacemaker/pcmk_sched_allocate.c rsc_order_first(rsc, order, data_set); order 2825 lib/pacemaker/pcmk_sched_allocate.c rsc = order->rh_rsc; order 2828 lib/pacemaker/pcmk_sched_allocate.c rsc_order_then(order->lh_action, rsc, order); order 2832 lib/pacemaker/pcmk_sched_allocate.c order_actions(order->lh_action, order->rh_action, order->type); order 1446 lib/pacemaker/pcmk_sched_constraints.c handle_migration_ordering(pe__ordering_t *order, pe_working_set_t *data_set) order 1453 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_rsc == NULL || order->rh_rsc == NULL) { order 1455 lib/pacemaker/pcmk_sched_constraints.c } else if (order->lh_rsc == order->rh_rsc) { order 1459 lib/pacemaker/pcmk_sched_constraints.c } else if (is_parent(order->lh_rsc, order->rh_rsc)) { order 1461 lib/pacemaker/pcmk_sched_constraints.c } else if (is_parent(order->rh_rsc, order->lh_rsc)) { order 1465 lib/pacemaker/pcmk_sched_constraints.c lh_migratable = pcmk_is_set(order->lh_rsc->flags, pe_rsc_allow_migrate); order 1466 lib/pacemaker/pcmk_sched_constraints.c rh_migratable = pcmk_is_set(order->rh_rsc->flags, pe_rsc_allow_migrate); order 1478 lib/pacemaker/pcmk_sched_constraints.c lh_task = task_from_action_or_key(order->lh_action, order->lh_action_task); order 1479 lib/pacemaker/pcmk_sched_constraints.c rh_task = task_from_action_or_key(order->rh_action, order->rh_action_task); order 1490 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1491 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_MIGRATED, 0), order 1492 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1493 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1504 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1505 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_START, 0), order 1506 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1507 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1521 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1522 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_STOP, 0), NULL, order 1523 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc, order 1524 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1529 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc->partial_migration_target) { order 1530 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1531 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_STOP, 0), order 1532 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1533 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATED, 0), order 1543 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1544 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_PROMOTE, 0), order 1545 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1546 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1556 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, pcmk__op_key(order->lh_rsc->id, RSC_DEMOTE, 0), NULL, order 1557 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc, pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), NULL, order 1562 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc->partial_migration_target) { order 1563 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1564 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_DEMOTE, 0), order 1565 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1566 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATED, 0), order 1583 lib/pacemaker/pcmk_sched_constraints.c pe__ordering_t *order = NULL; order 1600 lib/pacemaker/pcmk_sched_constraints.c order = calloc(1, sizeof(pe__ordering_t)); order 1608 lib/pacemaker/pcmk_sched_constraints.c order->id = data_set->order_id++; order 1609 lib/pacemaker/pcmk_sched_constraints.c order->type = type; order 1610 lib/pacemaker/pcmk_sched_constraints.c order->lh_rsc = lh_rsc; order 1611 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc = rh_rsc; order 1612 lib/pacemaker/pcmk_sched_constraints.c order->lh_action = lh_action; order 1613 lib/pacemaker/pcmk_sched_constraints.c order->rh_action = rh_action; order 1614 lib/pacemaker/pcmk_sched_constraints.c order->lh_action_task = lh_action_task; order 1615 lib/pacemaker/pcmk_sched_constraints.c order->rh_action_task = rh_action_task; order 1617 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_action_task == NULL && lh_action) { order 1618 lib/pacemaker/pcmk_sched_constraints.c order->lh_action_task = strdup(lh_action->uuid); order 1621 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_action_task == NULL && rh_action) { order 1622 lib/pacemaker/pcmk_sched_constraints.c order->rh_action_task = strdup(rh_action->uuid); order 1625 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_rsc == NULL && lh_action) { order 1626 lib/pacemaker/pcmk_sched_constraints.c order->lh_rsc = lh_action->rsc; order 1629 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc == NULL && rh_action) { order 1630 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc = rh_action->rsc; order 1633 lib/pacemaker/pcmk_sched_constraints.c data_set->ordering_constraints = g_list_prepend(data_set->ordering_constraints, order); order 1634 lib/pacemaker/pcmk_sched_constraints.c handle_migration_ordering(order, data_set); order 1636 lib/pacemaker/pcmk_sched_constraints.c return order->id; order 178 lib/pacemaker/pcmk_sched_graph.c pe_action_wrapper_t *order, pe_working_set_t *data_set) order 181 lib/pacemaker/pcmk_sched_graph.c enum pe_ordering type = order->type; order 320 lib/pacemaker/pcmk_sched_graph.c order->type = pe_order_none; order 2755 lib/pacemaker/pcmk_sched_native.c enum pe_ordering order, pe_working_set_t *data_set) order 2773 lib/pacemaker/pcmk_sched_native.c order_actions(unfence, action, order); order 228 lib/pengine/status.c pe__ordering_t *order = iterator->data; order 232 lib/pengine/status.c free(order->lh_action_task); order 233 lib/pengine/status.c free(order->rh_action_task); order 234 lib/pengine/status.c free(order); order 1883 lib/pengine/utils.c order_actions(pe_action_t * lh_action, pe_action_t * rh_action, enum pe_ordering order) order 1889 lib/pengine/utils.c if (order == pe_order_none) { order 1907 lib/pengine/utils.c if (after->action == rh_action && (after->type & order)) { order 1914 lib/pengine/utils.c wrapper->type = order; order 1921 lib/pengine/utils.c wrapper->type = order;