graph 364 daemons/controld/controld_fencing.c fail_incompletable_stonith(pcmk__graph_t *graph) graph 370 daemons/controld/controld_fencing.c if (graph == NULL) { graph 374 daemons/controld/controld_fencing.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 394 daemons/controld/controld_fencing.c pcmk__update_graph(graph, action); graph 909 daemons/controld/controld_fencing.c controld_execute_fence_action(pcmk__graph_t *graph, graph 26 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 148 daemons/controld/controld_schedulerd.c crm_xml_add(fsa_input.msg, F_CRM_TGRAPH_INPUT, reply->data.graph.input); graph 151 daemons/controld/controld_schedulerd.c add_node_copy(crm_data_node, reply->data.graph.tgraph); graph 29 daemons/controld/controld_te_actions.c te_start_action_timer(const pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 31 daemons/controld/controld_te_actions.c action->timer = g_timeout_add(action->timeout + graph->network_delay, graph 46 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 153 daemons/controld/controld_te_actions.c graph->completion_action = pcmk__graph_shutdown; graph 154 daemons/controld/controld_te_actions.c graph->abort_reason = "local shutdown"; graph 155 daemons/controld/controld_te_actions.c te_action_confirmed(action, graph); graph 179 daemons/controld/controld_te_actions.c te_action_confirmed(action, graph); graph 184 daemons/controld/controld_te_actions.c action->id, task, on_node, action->timeout, graph->network_delay); graph 185 daemons/controld/controld_te_actions.c action->timeout = (int) graph->network_delay; graph 187 daemons/controld/controld_te_actions.c te_start_action_timer(graph, action); graph 333 daemons/controld/controld_te_actions.c execute_rsc_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 442 daemons/controld/controld_te_actions.c action->id, task, task_uuid, on_node, action->timeout, graph->network_delay); graph 443 daemons/controld/controld_te_actions.c action->timeout = (int) graph->network_delay; graph 446 daemons/controld/controld_te_actions.c te_start_action_timer(graph, action); graph 550 daemons/controld/controld_te_actions.c allowed_on_node(const pcmk__graph_t *graph, const pcmk__graph_action_t *action, graph 580 daemons/controld/controld_te_actions.c } else if(graph->migration_limit > 0 && r->migrate_jobs >= graph->migration_limit) { graph 583 daemons/controld/controld_te_actions.c target, graph->migration_limit, r->migrate_jobs, id); graph 603 daemons/controld/controld_te_actions.c graph_action_allowed(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 622 daemons/controld/controld_te_actions.c if (!allowed_on_node(graph, action, target)) { graph 632 daemons/controld/controld_te_actions.c return allowed_on_node(graph, action, target); graph 642 daemons/controld/controld_te_actions.c te_action_confirmed(pcmk__graph_action_t *action, pcmk__graph_t *graph) graph 651 daemons/controld/controld_te_actions.c if (graph) { graph 652 daemons/controld/controld_te_actions.c pcmk__update_graph(graph, action); graph 667 daemons/controld/controld_te_actions.c notify_crmd(pcmk__graph_t *graph) graph 674 daemons/controld/controld_te_actions.c CRM_CHECK(graph->complete, graph->complete = true); graph 676 daemons/controld/controld_te_actions.c switch (graph->completion_action) { graph 717 daemons/controld/controld_te_actions.c crm_debug("Transition %d status: %s - %s", graph->id, type, graph 718 daemons/controld/controld_te_actions.c pcmk__s(graph->abort_reason, "unspecified reason")); graph 720 daemons/controld/controld_te_actions.c graph->abort_reason = NULL; graph 721 daemons/controld/controld_te_actions.c graph->completion_action = pcmk__graph_done; graph 27 daemons/controld/controld_te_events.c fail_incompletable_actions(pcmk__graph_t *graph, const char *down_node) graph 37 daemons/controld/controld_te_events.c if (graph == NULL || graph->complete) { graph 41 daemons/controld/controld_te_events.c gIter = graph->synapses; graph 79 daemons/controld/controld_te_events.c pcmk__update_graph(graph, action); graph 148 daemons/controld/controld_te_utils.c update_abort_priority(pcmk__graph_t *graph, int priority, graph 153 daemons/controld/controld_te_utils.c if (graph == NULL) { graph 157 daemons/controld/controld_te_utils.c if (graph->abort_priority < priority) { graph 158 daemons/controld/controld_te_utils.c crm_debug("Abort priority upgraded from %d to %d", graph->abort_priority, priority); graph 159 daemons/controld/controld_te_utils.c graph->abort_priority = priority; graph 160 daemons/controld/controld_te_utils.c if (graph->abort_reason != NULL) { graph 161 daemons/controld/controld_te_utils.c crm_debug("'%s' abort superseded by %s", graph->abort_reason, abort_reason); graph 163 daemons/controld/controld_te_utils.c graph->abort_reason = abort_reason; graph 167 daemons/controld/controld_te_utils.c if (graph->completion_action < action) { graph 169 daemons/controld/controld_te_utils.c abort2text(graph->completion_action), abort2text(action), abort_reason); graph 170 daemons/controld/controld_te_utils.c graph->completion_action = action; graph 22 daemons/controld/controld_transition.h gboolean fail_incompletable_actions(pcmk__graph_t *graph, const char *down_node); graph 37 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 data_set->graph = create_xml_node(NULL, XML_TAG_GRAPH); graph 85 daemons/schedulerd/schedulerd_messages.c crm_xml_add_int(data_set->graph, "transition_id", 0); graph 86 daemons/schedulerd/schedulerd_messages.c crm_xml_add_int(data_set->graph, "cluster-delay", 0); graph 130 daemons/schedulerd/schedulerd_messages.c reply = create_reply(msg, data_set->graph); graph 45 include/crm/common/ipc_schedulerd.h } graph; graph 183 include/crm/pengine/pe_types.h xmlNode *graph; graph 134 include/pcmki/pcmki_transition.h int (*pseudo) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 135 include/pcmki/pcmki_transition.h int (*rsc) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 136 include/pcmki/pcmki_transition.h int (*cluster) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 137 include/pcmki/pcmki_transition.h int (*fence) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 138 include/pcmki/pcmki_transition.h bool (*allowed) (pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 150 include/pcmki/pcmki_transition.h enum pcmk__graph_status pcmk__execute_graph(pcmk__graph_t *graph); graph 151 include/pcmki/pcmki_transition.h void pcmk__update_graph(pcmk__graph_t *graph, pcmk__graph_action_t *action); graph 152 include/pcmki/pcmki_transition.h void pcmk__free_graph(pcmk__graph_t *graph); graph 154 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 111 lib/pacemaker/pcmk_graph_consumer.c pcmk__update_graph(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 113 lib/pacemaker/pcmk_graph_consumer.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 168 lib/pacemaker/pcmk_graph_consumer.c should_fire_synapse(pcmk__graph_t *graph, pcmk__graph_synapse_t *synapse) graph 201 lib/pacemaker/pcmk_graph_consumer.c } else if (synapse->priority < graph->abort_priority) { graph 204 lib/pacemaker/pcmk_graph_consumer.c synapse->id, synapse->priority, graph->abort_priority); graph 205 lib/pacemaker/pcmk_graph_consumer.c graph->skipped++; graph 208 lib/pacemaker/pcmk_graph_consumer.c } else if (graph_fns->allowed && !(graph_fns->allowed(graph, a))) { graph 227 lib/pacemaker/pcmk_graph_consumer.c initiate_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 239 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->pseudo(graph, action); graph 243 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->rsc(graph, action); graph 250 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->fence(graph, action); graph 253 lib/pacemaker/pcmk_graph_consumer.c return graph_fns->cluster(graph, action); graph 272 lib/pacemaker/pcmk_graph_consumer.c fire_synapse(pcmk__graph_t *graph, pcmk__graph_synapse_t *synapse) graph 277 lib/pacemaker/pcmk_graph_consumer.c int rc = initiate_action(graph, action); graph 305 lib/pacemaker/pcmk_graph_consumer.c pseudo_action_dummy(pcmk__graph_t * graph, pcmk__graph_action_t *action) graph 323 lib/pacemaker/pcmk_graph_consumer.c graph->abort_priority = INFINITY; graph 328 lib/pacemaker/pcmk_graph_consumer.c pcmk__update_graph(graph, action); graph 348 lib/pacemaker/pcmk_graph_consumer.c pcmk__execute_graph(pcmk__graph_t *graph) graph 358 lib/pacemaker/pcmk_graph_consumer.c if (graph == NULL) { graph 362 lib/pacemaker/pcmk_graph_consumer.c graph->fired = 0; graph 363 lib/pacemaker/pcmk_graph_consumer.c graph->pending = 0; graph 364 lib/pacemaker/pcmk_graph_consumer.c graph->skipped = 0; graph 365 lib/pacemaker/pcmk_graph_consumer.c graph->completed = 0; graph 366 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete = 0; graph 369 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 373 lib/pacemaker/pcmk_graph_consumer.c graph->completed++; graph 376 lib/pacemaker/pcmk_graph_consumer.c graph->pending++; graph 380 lib/pacemaker/pcmk_graph_consumer.c graph->id, graph->completed, graph->pending); graph 383 lib/pacemaker/pcmk_graph_consumer.c for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 386 lib/pacemaker/pcmk_graph_consumer.c if ((graph->batch_limit > 0) graph 387 lib/pacemaker/pcmk_graph_consumer.c && (graph->pending >= graph->batch_limit)) { graph 390 lib/pacemaker/pcmk_graph_consumer.c graph->batch_limit); graph 394 lib/pacemaker/pcmk_graph_consumer.c graph->skipped++; graph 400 lib/pacemaker/pcmk_graph_consumer.c } else if (should_fire_synapse(graph, synapse)) { graph 401 lib/pacemaker/pcmk_graph_consumer.c graph->fired++; graph 402 lib/pacemaker/pcmk_graph_consumer.c if (fire_synapse(graph, synapse) != pcmk_rc_ok) { graph 405 lib/pacemaker/pcmk_graph_consumer.c graph->abort_priority = INFINITY; graph 406 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete++; graph 407 lib/pacemaker/pcmk_graph_consumer.c graph->fired--; graph 411 lib/pacemaker/pcmk_graph_consumer.c graph->pending++; graph 416 lib/pacemaker/pcmk_graph_consumer.c graph->incomplete++; graph 420 lib/pacemaker/pcmk_graph_consumer.c if ((graph->pending == 0) && (graph->fired == 0)) { graph 421 lib/pacemaker/pcmk_graph_consumer.c graph->complete = true; graph 423 lib/pacemaker/pcmk_graph_consumer.c if ((graph->incomplete != 0) && (graph->abort_priority <= 0)) { graph 428 lib/pacemaker/pcmk_graph_consumer.c } else if (graph->skipped != 0) { graph 439 lib/pacemaker/pcmk_graph_consumer.c } else if (graph->fired == 0) { graph 446 lib/pacemaker/pcmk_graph_consumer.c graph->id, graph->completed, graph->pending, graph->fired, graph 447 lib/pacemaker/pcmk_graph_consumer.c graph->skipped, graph->incomplete, graph->source, status); graph 791 lib/pacemaker/pcmk_graph_consumer.c pcmk__free_graph(pcmk__graph_t *graph) graph 793 lib/pacemaker/pcmk_graph_consumer.c if (graph != NULL) { graph 794 lib/pacemaker/pcmk_graph_consumer.c g_list_free_full(graph->synapses, free_graph_synapse); graph 795 lib/pacemaker/pcmk_graph_consumer.c free(graph->source); graph 796 lib/pacemaker/pcmk_graph_consumer.c free(graph); graph 65 lib/pacemaker/pcmk_graph_logging.c find_graph_action_by_id(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 (GList *sIter = graph->synapses; sIter != NULL; sIter = sIter->next) { graph 119 lib/pacemaker/pcmk_graph_logging.c synapse_pending_inputs(pcmk__graph_t *graph, graph 133 lib/pacemaker/pcmk_graph_logging.c } else if (find_graph_action_by_id(graph, input->id) != NULL) { graph 143 lib/pacemaker/pcmk_graph_logging.c log_unresolved_inputs(unsigned int log_level, pcmk__graph_t *graph, graph 151 lib/pacemaker/pcmk_graph_logging.c if (find_graph_action_by_id(graph, input->id) == NULL) { graph 178 lib/pacemaker/pcmk_graph_logging.c log_synapse(unsigned int log_level, pcmk__graph_t *graph, graph 185 lib/pacemaker/pcmk_graph_logging.c g_pending = synapse_pending_inputs(graph, synapse); graph 202 lib/pacemaker/pcmk_graph_logging.c log_unresolved_inputs(log_level, graph, synapse); graph 213 lib/pacemaker/pcmk_graph_logging.c pcmk__log_graph(unsigned int log_level, pcmk__graph_t *graph) graph 215 lib/pacemaker/pcmk_graph_logging.c if ((graph == NULL) || (graph->num_actions == 0)) { graph 224 lib/pacemaker/pcmk_graph_logging.c graph->id, graph->num_actions, graph 225 lib/pacemaker/pcmk_graph_logging.c graph->batch_limit, graph->network_delay); graph 227 lib/pacemaker/pcmk_graph_logging.c for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) { graph 228 lib/pacemaker/pcmk_graph_logging.c log_synapse(log_level, graph, (pcmk__graph_synapse_t *) lpc->data); graph 840 lib/pacemaker/pcmk_graph_producer.c xmlNode *syn = create_xml_node(data_set->graph, "synapse"); graph 997 lib/pacemaker/pcmk_graph_producer.c data_set->graph = create_xml_node(NULL, XML_TAG_GRAPH); graph 1000 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "cluster-delay", value); graph 1003 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "stonith-timeout", value); graph 1005 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "failed-stop-offset", "INFINITY"); graph 1008 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "failed-start-offset", "INFINITY"); graph 1010 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "failed-start-offset", "1"); graph 1014 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "batch-limit", value); graph 1016 lib/pacemaker/pcmk_graph_producer.c crm_xml_add_int(data_set->graph, "transition_id", transition_id); graph 1020 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "migration-limit", value); graph 1028 lib/pacemaker/pcmk_graph_producer.c crm_xml_add(data_set->graph, "recheck-by", recheck_epoch); graph 1077 lib/pacemaker/pcmk_graph_producer.c crm_log_xml_trace(data_set->graph, "graph"); graph 465 lib/pacemaker/pcmk_simulate.c simulate_pseudo_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 473 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 487 lib/pacemaker/pcmk_simulate.c simulate_resource_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 626 lib/pacemaker/pcmk_simulate.c graph->abort_priority = INFINITY; graph 642 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 656 lib/pacemaker/pcmk_simulate.c simulate_cluster_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 664 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 678 lib/pacemaker/pcmk_simulate.c simulate_fencing_action(pcmk__graph_t *graph, pcmk__graph_action_t *action) graph 720 lib/pacemaker/pcmk_simulate.c pcmk__update_graph(graph, action); graph 749 lib/pacemaker/pcmk_simulate.c transition = pcmk__unpack_graph(data_set->graph, crm_system_name); graph 909 lib/pacemaker/pcmk_simulate.c rc = write_xml_file(data_set->graph, graph_file, FALSE); graph 319 lib/pengine/status.c free_xml(data_set->graph); graph 5839 maint/gnulib/lib/gen-uni-tables.c PROPERTY(graph)