graph 401 daemons/controld/controld_fencing.c fail_incompletable_stonith(pcmk__graph_t *graph) graph 407 daemons/controld/controld_fencing.c if (graph == NULL) { graph 411 daemons/controld/controld_fencing.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 431 daemons/controld/controld_fencing.c pcmk__update_graph(graph, action); graph 951 daemons/controld/controld_fencing.c controld_execute_fence_action(pcmk__graph_t *graph, graph 24 daemons/controld/controld_fencing.h int controld_execute_fence_action(pcmk__graph_t *graph, graph 127 daemons/controld/controld_schedulerd.c msg_ref = reply->data.graph.reference; graph 149 daemons/controld/controld_schedulerd.c crm_xml_add(fsa_input.msg, F_CRM_TGRAPH_INPUT, reply->data.graph.input); graph 152 daemons/controld/controld_schedulerd.c add_node_copy(crm_data_node, reply->data.graph.tgraph); graph 28 daemons/controld/controld_te_actions.c te_start_action_timer(const pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 30 daemons/controld/controld_te_actions.c action->timer = g_timeout_add(action->timeout + graph->network_delay, graph 45 daemons/controld/controld_te_actions.c execute_pseudo_action(pcmk__graph_t *graph, pcmk__graph_action_t *pseudo) graph 77 daemons/controld/controld_te_actions.c te_action_confirmed(pseudo, graph); graph 101 daemons/controld/controld_te_actions.c execute_cluster_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 155 daemons/controld/controld_te_actions.c graph->completion_action = pcmk__graph_shutdown; graph 156 daemons/controld/controld_te_actions.c graph->abort_reason = "local shutdown"; graph 157 daemons/controld/controld_te_actions.c te_action_confirmed(action, graph); graph 182 daemons/controld/controld_te_actions.c te_action_confirmed(action, graph); graph 187 daemons/controld/controld_te_actions.c action->id, task, on_node, action->timeout, graph->network_delay); graph 188 daemons/controld/controld_te_actions.c action->timeout = (int) graph->network_delay; graph 190 daemons/controld/controld_te_actions.c te_start_action_timer(graph, action); graph 339 daemons/controld/controld_te_actions.c execute_rsc_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 451 daemons/controld/controld_te_actions.c action->id, task, task_uuid, on_node, action->timeout, graph->network_delay); graph 452 daemons/controld/controld_te_actions.c action->timeout = (int) graph->network_delay; graph 455 daemons/controld/controld_te_actions.c te_start_action_timer(graph, action); graph 559 daemons/controld/controld_te_actions.c allowed_on_node(const pcmk__graph_t *graph, const pcmk__graph_action_t *action, graph 589 daemons/controld/controld_te_actions.c } else if(graph->migration_limit > 0 && r->migrate_jobs >= graph->migration_limit) { graph 593 daemons/controld/controld_te_actions.c target, graph->migration_limit, r->migrate_jobs, id); graph 613 daemons/controld/controld_te_actions.c graph_action_allowed(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 633 daemons/controld/controld_te_actions.c if (!allowed_on_node(graph, action, target)) { graph 643 daemons/controld/controld_te_actions.c return allowed_on_node(graph, action, target); graph 653 daemons/controld/controld_te_actions.c te_action_confirmed(pcmk__graph_action_t *action, pcmk__graph_t *graph) graph 662 daemons/controld/controld_te_actions.c if (graph) { graph 663 daemons/controld/controld_te_actions.c pcmk__update_graph(graph, action); graph 687 daemons/controld/controld_te_actions.c notify_crmd(pcmk__graph_t *graph) graph 695 daemons/controld/controld_te_actions.c CRM_CHECK(graph->complete, graph->complete = true); graph 697 daemons/controld/controld_te_actions.c switch (graph->completion_action) { graph 738 daemons/controld/controld_te_actions.c crm_debug("Transition %d status: %s - %s", graph->id, type, graph 739 daemons/controld/controld_te_actions.c pcmk__s(graph->abort_reason, "unspecified reason")); graph 741 daemons/controld/controld_te_actions.c graph->abort_reason = NULL; graph 742 daemons/controld/controld_te_actions.c graph->completion_action = pcmk__graph_done; graph 81 daemons/controld/controld_te_events.c fail_incompletable_actions(pcmk__graph_t *graph, const char *down_node) graph 91 daemons/controld/controld_te_events.c if (graph == NULL || graph->complete) { graph 95 daemons/controld/controld_te_events.c gIter = graph->synapses; graph 133 daemons/controld/controld_te_events.c pcmk__update_graph(graph, action); graph 317 daemons/controld/controld_te_utils.c update_abort_priority(pcmk__graph_t *graph, int priority, graph 322 daemons/controld/controld_te_utils.c if (graph == NULL) { graph 326 daemons/controld/controld_te_utils.c if (graph->abort_priority < priority) { graph 327 daemons/controld/controld_te_utils.c crm_debug("Abort priority upgraded from %d to %d", graph->abort_priority, priority); graph 328 daemons/controld/controld_te_utils.c graph->abort_priority = priority; graph 329 daemons/controld/controld_te_utils.c if (graph->abort_reason != NULL) { graph 330 daemons/controld/controld_te_utils.c crm_debug("'%s' abort superseded by %s", graph->abort_reason, abort_reason); graph 332 daemons/controld/controld_te_utils.c graph->abort_reason = abort_reason; graph 336 daemons/controld/controld_te_utils.c if (graph->completion_action < action) { graph 338 daemons/controld/controld_te_utils.c abort2text(graph->completion_action), abort2text(action), abort_reason); graph 339 daemons/controld/controld_te_utils.c graph->completion_action = action; graph 26 daemons/controld/controld_transition.h gboolean fail_incompletable_actions(pcmk__graph_t *graph, const char *down_node); graph 38 daemons/controld/controld_transition.h void notify_crmd(pcmk__graph_t * graph); graph 62 daemons/controld/controld_transition.h void te_action_confirmed(pcmk__graph_action_t *action, pcmk__graph_t *graph); graph 84 daemons/schedulerd/schedulerd_messages.c scheduler->graph = create_xml_node(NULL, XML_TAG_GRAPH); graph 85 daemons/schedulerd/schedulerd_messages.c crm_xml_add_int(scheduler->graph, "transition_id", 0); graph 86 daemons/schedulerd/schedulerd_messages.c crm_xml_add_int(scheduler->graph, "cluster-delay", 0); graph 130 daemons/schedulerd/schedulerd_messages.c reply = create_reply(msg, scheduler->graph); graph 45 include/crm/common/ipc_schedulerd.h } graph; graph 212 include/crm/common/scheduler.h xmlNode *graph; //!< Transition graph graph 144 include/pcmki/pcmki_transition.h int (*pseudo) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 145 include/pcmki/pcmki_transition.h int (*rsc) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 146 include/pcmki/pcmki_transition.h int (*cluster) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 147 include/pcmki/pcmki_transition.h int (*fence) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 148 include/pcmki/pcmki_transition.h bool (*allowed) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 161 include/pcmki/pcmki_transition.h enum pcmk__graph_status pcmk__execute_graph(pcmk__graph_t *graph); graph 162 include/pcmki/pcmki_transition.h void pcmk__update_graph(pcmk__graph_t *graph, graph 164 include/pcmki/pcmki_transition.h void pcmk__free_graph(pcmk__graph_t *graph); graph 166 include/pcmki/pcmki_transition.h void pcmk__log_graph(unsigned int log_level, pcmk__graph_t *graph); graph 112 lib/common/ipc_schedulerd.c reply_data.data.graph.reference = crm_element_value(reply, XML_ATTR_REFERENCE); graph 113 lib/common/ipc_schedulerd.c reply_data.data.graph.input = crm_element_value(reply, F_CRM_TGRAPH_INPUT); graph 114 lib/common/ipc_schedulerd.c reply_data.data.graph.tgraph = msg_data; graph 116 lib/pacemaker/pcmk_graph_consumer.c pcmk__update_graph(pcmk__graph_t *graph, const pcmk__graph_action_t *action) graph 118 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 175 lib/pacemaker/pcmk_graph_consumer.c should_fire_synapse(pcmk__graph_t *graph, pcmk__graph_synapse_t *synapse) graph 210 lib/pacemaker/pcmk_graph_consumer.c } else if (synapse->priority < graph->abort_priority) { graph 213 lib/pacemaker/pcmk_graph_consumer.c synapse->id, synapse->priority, graph->abort_priority); graph 214 lib/pacemaker/pcmk_graph_consumer.c graph->skipped++; graph 217 lib/pacemaker/pcmk_graph_consumer.c } else if (graph_fns->allowed && !(graph_fns->allowed(graph, a))) { graph 236 lib/pacemaker/pcmk_graph_consumer.c initiate_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 248 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->pseudo(graph, action); graph 252 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->rsc(graph, action); graph 259 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->fence(graph, action); graph 262 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->cluster(graph, action); graph 282 lib/pacemaker/pcmk_graph_consumer.c fire_synapse(pcmk__graph_t *graph, pcmk__graph_synapse_t *synapse) graph 287 lib/pacemaker/pcmk_graph_consumer.c int rc = initiate_action(graph, action); graph 316 lib/pacemaker/pcmk_graph_consumer.c pseudo_action_dummy(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 334 lib/pacemaker/pcmk_graph_consumer.c graph->abort_priority = INFINITY; graph 339 lib/pacemaker/pcmk_graph_consumer.c pcmk__update_graph(graph, action); graph 359 lib/pacemaker/pcmk_graph_consumer.c pcmk__execute_graph(pcmk__graph_t *graph) graph 369 lib/pacemaker/pcmk_graph_consumer.c if (graph == NULL) { graph 373 lib/pacemaker/pcmk_graph_consumer.c graph->fired = 0; graph 374 lib/pacemaker/pcmk_graph_consumer.c graph->pending = 0; graph 375 lib/pacemaker/pcmk_graph_consumer.c graph->skipped = 0; graph 376 lib/pacemaker/pcmk_graph_consumer.c graph->completed = 0; graph 377 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete = 0; graph 380 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 384 lib/pacemaker/pcmk_graph_consumer.c graph->completed++; graph 388 lib/pacemaker/pcmk_graph_consumer.c graph->pending++; graph 392 lib/pacemaker/pcmk_graph_consumer.c graph->id, graph->completed, graph->pending); graph 395 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 398 lib/pacemaker/pcmk_graph_consumer.c if ((graph->batch_limit > 0) graph 399 lib/pacemaker/pcmk_graph_consumer.c && (graph->pending >= graph->batch_limit)) { graph 402 lib/pacemaker/pcmk_graph_consumer.c graph->batch_limit); graph 406 lib/pacemaker/pcmk_graph_consumer.c graph->skipped++; graph 414 lib/pacemaker/pcmk_graph_consumer.c } else if (should_fire_synapse(graph, synapse)) { graph 415 lib/pacemaker/pcmk_graph_consumer.c graph->fired++; graph 416 lib/pacemaker/pcmk_graph_consumer.c if (fire_synapse(graph, synapse) != pcmk_rc_ok) { graph 419 lib/pacemaker/pcmk_graph_consumer.c graph->abort_priority = INFINITY; graph 420 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete++; graph 421 lib/pacemaker/pcmk_graph_consumer.c graph->fired--; graph 425 lib/pacemaker/pcmk_graph_consumer.c graph->pending++; graph 430 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete++; graph 434 lib/pacemaker/pcmk_graph_consumer.c if ((graph->pending == 0) && (graph->fired == 0)) { graph 435 lib/pacemaker/pcmk_graph_consumer.c graph->complete = true; graph 437 lib/pacemaker/pcmk_graph_consumer.c if ((graph->incomplete != 0) && (graph->abort_priority <= 0)) { graph 442 lib/pacemaker/pcmk_graph_consumer.c } else if (graph->skipped != 0) { graph 453 lib/pacemaker/pcmk_graph_consumer.c } else if (graph->fired == 0) { graph 460 lib/pacemaker/pcmk_graph_consumer.c graph->id, graph->completed, graph->pending, graph->fired, graph 461 lib/pacemaker/pcmk_graph_consumer.c graph->skipped, graph->incomplete, graph->source, status); graph 810 lib/pacemaker/pcmk_graph_consumer.c pcmk__free_graph(pcmk__graph_t *graph) graph 812 lib/pacemaker/pcmk_graph_consumer.c if (graph != NULL) { graph 813 lib/pacemaker/pcmk_graph_consumer.c g_list_free_full(graph->synapses, free_graph_synapse); graph 814 lib/pacemaker/pcmk_graph_consumer.c free(graph->source); graph 815 lib/pacemaker/pcmk_graph_consumer.c free(graph->failed_stop_offset); graph 816 lib/pacemaker/pcmk_graph_consumer.c free(graph->failed_start_offset); graph 817 lib/pacemaker/pcmk_graph_consumer.c free(graph); graph 65 lib/pacemaker/pcmk_graph_logging.c find_graph_action_by_id(const pcmk__graph_t *graph, int id) graph 67 lib/pacemaker/pcmk_graph_logging.c if (graph == NULL) { graph 71 lib/pacemaker/pcmk_graph_logging.c for (const GList *synapse_iter = graph->synapses; graph 120 lib/pacemaker/pcmk_graph_logging.c synapse_pending_inputs(const pcmk__graph_t *graph, graph 134 lib/pacemaker/pcmk_graph_logging.c } else if (find_graph_action_by_id(graph, input->id) != NULL) { graph 144 lib/pacemaker/pcmk_graph_logging.c log_unresolved_inputs(unsigned int log_level, pcmk__graph_t *graph, graph 152 lib/pacemaker/pcmk_graph_logging.c if (find_graph_action_by_id(graph, input->id) == NULL) { graph 179 lib/pacemaker/pcmk_graph_logging.c log_synapse(unsigned int log_level, pcmk__graph_t *graph, graph 186 lib/pacemaker/pcmk_graph_logging.c g_pending = synapse_pending_inputs(graph, synapse); graph 203 lib/pacemaker/pcmk_graph_logging.c log_unresolved_inputs(log_level, graph, synapse); graph 214 lib/pacemaker/pcmk_graph_logging.c pcmk__log_graph(unsigned int log_level, pcmk__graph_t *graph) graph 216 lib/pacemaker/pcmk_graph_logging.c if ((graph == NULL) || (graph->num_actions == 0)) { graph 225 lib/pacemaker/pcmk_graph_logging.c graph->id, graph->num_actions, graph 226 lib/pacemaker/pcmk_graph_logging.c graph->batch_limit, graph->network_delay); graph 228 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 229 lib/pacemaker/pcmk_graph_logging.c log_synapse(log_level, graph, (pcmk__graph_synapse_t *) lpc->data); graph 854 lib/pacemaker/pcmk_graph_producer.c xmlNode *syn = create_xml_node(scheduler->graph, "synapse"); graph 1011 lib/pacemaker/pcmk_graph_producer.c scheduler->graph = create_xml_node(NULL, XML_TAG_GRAPH); graph 1014 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "cluster-delay", value); graph 1017 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "stonith-timeout", value); graph 1019 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "failed-stop-offset", "INFINITY"); graph 1022 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "failed-start-offset", "INFINITY"); graph 1024 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "failed-start-offset", "1"); graph 1028 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "batch-limit", value); graph 1030 lib/pacemaker/pcmk_graph_producer.c crm_xml_add_int(scheduler->graph, "transition_id", transition_id); graph 1034 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "migration-limit", value); graph 1042 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(scheduler->graph, "recheck-by", recheck_epoch); graph 1095 lib/pacemaker/pcmk_graph_producer.c crm_log_xml_trace(scheduler->graph, "graph"); graph 470 lib/pacemaker/pcmk_simulate.c simulate_pseudo_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 478 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 492 lib/pacemaker/pcmk_simulate.c simulate_resource_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 633 lib/pacemaker/pcmk_simulate.c graph->abort_priority = INFINITY; graph 649 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 663 lib/pacemaker/pcmk_simulate.c simulate_cluster_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 671 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 685 lib/pacemaker/pcmk_simulate.c simulate_fencing_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 727 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 756 lib/pacemaker/pcmk_simulate.c transition = pcmk__unpack_graph(scheduler->graph, crm_system_name); graph 928 lib/pacemaker/pcmk_simulate.c rc = write_xml_file(scheduler->graph, graph_file, FALSE); graph 319 lib/pengine/status.c free_xml(scheduler->graph); graph 5839 maint/gnulib/lib/gen-uni-tables.c PROPERTY(graph)