order 360 include/crm/pengine/internal.h extern gboolean order_actions(pe_action_t * lh_action, pe_action_t * rh_action, enum pe_ordering order); order 1803 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order) order 1811 lib/pacemaker/pcmk_sched_allocate.c CRM_CHECK(order != NULL, return); order 1813 lib/pacemaker/pcmk_sched_allocate.c type = order->type; order 1814 lib/pacemaker/pcmk_sched_allocate.c rh_action = order->rh_action; order 1815 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Processing RH of ordering constraint %d", order->id); order 1821 lib/pacemaker/pcmk_sched_allocate.c rh_actions = find_actions_by_task(rsc->actions, rsc, order->rh_action_task); order 1826 lib/pacemaker/pcmk_sched_allocate.c " ignoring", rsc->id, order->rh_action_task); order 1837 lib/pacemaker/pcmk_sched_allocate.c order->rh_action_task); order 1861 lib/pacemaker/pcmk_sched_allocate.c rsc_order_first(pe_resource_t *lh_rsc, pe__ordering_t *order, order 1866 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *lh_action = order->lh_action; order 1867 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rh_rsc = order->rh_rsc; order 1869 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Processing LH of ordering constraint %d", order->id); order 1876 lib/pacemaker/pcmk_sched_allocate.c lh_actions = find_actions_by_task(lh_rsc->actions, lh_rsc, order->lh_action_task); order 1884 lib/pacemaker/pcmk_sched_allocate.c parse_op_key(order->lh_action_task, NULL, &op_type, &interval_ms); order 1890 lib/pacemaker/pcmk_sched_allocate.c lh_rsc->id, order->lh_action_task, order->id, order->rh_action_task); order 1896 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 lh_rsc->id, order->lh_action_task, order->id, order->rh_action_task); order 1912 lib/pacemaker/pcmk_sched_allocate.c if (rh_rsc == NULL && order->rh_action) { order 1913 lib/pacemaker/pcmk_sched_allocate.c rh_rsc = order->rh_action->rsc; order 1916 lib/pacemaker/pcmk_sched_allocate.c rsc_order_then(lh_action_iter, rh_rsc, order); order 1918 lib/pacemaker/pcmk_sched_allocate.c } else if (order->rh_action) { order 1919 lib/pacemaker/pcmk_sched_allocate.c order_actions(lh_action_iter, order->rh_action, order->type); order 2375 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order = gIter->data; order 2378 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *lh_rsc = order->lh_rsc; order 2379 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rh_rsc = order->rh_rsc; order 2380 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *lh_action = order->lh_action; order 2381 lib/pacemaker/pcmk_sched_allocate.c pe_action_t *rh_action = order->rh_action; order 2382 lib/pacemaker/pcmk_sched_allocate.c const char *lh_action_task = order->lh_action_task; order 2383 lib/pacemaker/pcmk_sched_allocate.c const char *rh_action_task = order->rh_action_task; order 2432 lib/pacemaker/pcmk_sched_allocate.c if (order->type == pe_order_none) { order 2437 lib/pacemaker/pcmk_sched_allocate.c if (pcmk_is_set(order->type, pe_order_apply_first_non_migratable)) { order 2442 lib/pacemaker/pcmk_sched_allocate.c if (pcmk_is_set(order->type, pe_order_same_node)) { order 2447 lib/pacemaker/pcmk_sched_allocate.c if (order->type == pe_order_anti_colocation order 2448 lib/pacemaker/pcmk_sched_allocate.c || order->type == pe_order_load) { order 2449 lib/pacemaker/pcmk_sched_allocate.c order_type = order->type; order 2473 lib/pacemaker/pcmk_sched_allocate.c order->id, order->type); order 2828 lib/pacemaker/pcmk_sched_allocate.c pe__ordering_t *order = gIter->data; order 2829 lib/pacemaker/pcmk_sched_allocate.c pe_resource_t *rsc = order->lh_rsc; order 2831 lib/pacemaker/pcmk_sched_allocate.c crm_trace("Applying ordering constraint: %d", order->id); order 2835 lib/pacemaker/pcmk_sched_allocate.c rsc_order_first(rsc, order, data_set); order 2839 lib/pacemaker/pcmk_sched_allocate.c rsc = order->rh_rsc; order 2842 lib/pacemaker/pcmk_sched_allocate.c rsc_order_then(order->lh_action, rsc, order); order 2846 lib/pacemaker/pcmk_sched_allocate.c order_actions(order->lh_action, order->rh_action, order->type); order 1453 lib/pacemaker/pcmk_sched_constraints.c handle_migration_ordering(pe__ordering_t *order, pe_working_set_t *data_set) order 1460 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_rsc == NULL || order->rh_rsc == NULL) { order 1462 lib/pacemaker/pcmk_sched_constraints.c } else if (order->lh_rsc == order->rh_rsc) { order 1466 lib/pacemaker/pcmk_sched_constraints.c } else if (is_parent(order->lh_rsc, order->rh_rsc)) { order 1468 lib/pacemaker/pcmk_sched_constraints.c } else if (is_parent(order->rh_rsc, order->lh_rsc)) { order 1472 lib/pacemaker/pcmk_sched_constraints.c lh_migratable = pcmk_is_set(order->lh_rsc->flags, pe_rsc_allow_migrate); order 1473 lib/pacemaker/pcmk_sched_constraints.c rh_migratable = pcmk_is_set(order->rh_rsc->flags, pe_rsc_allow_migrate); order 1485 lib/pacemaker/pcmk_sched_constraints.c lh_task = task_from_action_or_key(order->lh_action, order->lh_action_task); order 1486 lib/pacemaker/pcmk_sched_constraints.c rh_task = task_from_action_or_key(order->rh_action, order->rh_action_task); order 1497 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1498 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_MIGRATED, 0), order 1499 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1500 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1511 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1512 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_START, 0), order 1513 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1514 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1528 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1529 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_STOP, 0), NULL, order 1530 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc, order 1531 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1536 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc->partial_migration_target) { order 1537 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1538 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_STOP, 0), order 1539 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1540 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATED, 0), order 1550 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1551 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_PROMOTE, 0), order 1552 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1553 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), order 1563 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, pcmk__op_key(order->lh_rsc->id, RSC_DEMOTE, 0), NULL, order 1564 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc, pcmk__op_key(order->rh_rsc->id, RSC_MIGRATE, 0), NULL, order 1569 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc->partial_migration_target) { order 1570 lib/pacemaker/pcmk_sched_constraints.c custom_action_order(order->lh_rsc, order 1571 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->lh_rsc->id, RSC_DEMOTE, 0), order 1572 lib/pacemaker/pcmk_sched_constraints.c NULL, order->rh_rsc, order 1573 lib/pacemaker/pcmk_sched_constraints.c pcmk__op_key(order->rh_rsc->id, RSC_MIGRATED, 0), order 1590 lib/pacemaker/pcmk_sched_constraints.c pe__ordering_t *order = NULL; order 1607 lib/pacemaker/pcmk_sched_constraints.c order = calloc(1, sizeof(pe__ordering_t)); order 1615 lib/pacemaker/pcmk_sched_constraints.c order->id = data_set->order_id++; order 1616 lib/pacemaker/pcmk_sched_constraints.c order->type = type; order 1617 lib/pacemaker/pcmk_sched_constraints.c order->lh_rsc = lh_rsc; order 1618 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc = rh_rsc; order 1619 lib/pacemaker/pcmk_sched_constraints.c order->lh_action = lh_action; order 1620 lib/pacemaker/pcmk_sched_constraints.c order->rh_action = rh_action; order 1621 lib/pacemaker/pcmk_sched_constraints.c order->lh_action_task = lh_action_task; order 1622 lib/pacemaker/pcmk_sched_constraints.c order->rh_action_task = rh_action_task; order 1624 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_action_task == NULL && lh_action) { order 1625 lib/pacemaker/pcmk_sched_constraints.c order->lh_action_task = strdup(lh_action->uuid); order 1628 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_action_task == NULL && rh_action) { order 1629 lib/pacemaker/pcmk_sched_constraints.c order->rh_action_task = strdup(rh_action->uuid); order 1632 lib/pacemaker/pcmk_sched_constraints.c if (order->lh_rsc == NULL && lh_action) { order 1633 lib/pacemaker/pcmk_sched_constraints.c order->lh_rsc = lh_action->rsc; order 1636 lib/pacemaker/pcmk_sched_constraints.c if (order->rh_rsc == NULL && rh_action) { order 1637 lib/pacemaker/pcmk_sched_constraints.c order->rh_rsc = rh_action->rsc; order 1640 lib/pacemaker/pcmk_sched_constraints.c data_set->ordering_constraints = g_list_prepend(data_set->ordering_constraints, order); order 1641 lib/pacemaker/pcmk_sched_constraints.c handle_migration_ordering(order, data_set); order 1643 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 2481 lib/pacemaker/pcmk_sched_native.c enum pe_ordering order, pe_working_set_t *data_set) order 2499 lib/pacemaker/pcmk_sched_native.c order_actions(unfence, action, order); order 229 lib/pengine/status.c pe__ordering_t *order = iterator->data; order 233 lib/pengine/status.c free(order->lh_action_task); order 234 lib/pengine/status.c free(order->rh_action_task); order 235 lib/pengine/status.c free(order); order 1802 lib/pengine/utils.c order_actions(pe_action_t * lh_action, pe_action_t * rh_action, enum pe_ordering order) order 1808 lib/pengine/utils.c if (order == pe_order_none) { order 1826 lib/pengine/utils.c if (after->action == rh_action && (after->type & order)) { order 1833 lib/pengine/utils.c wrapper->type = order; order 1840 lib/pengine/utils.c wrapper->type = order;