graph             362 daemons/controld/controld_fencing.c fail_incompletable_stonith(crm_graph_t *graph)
graph             368 daemons/controld/controld_fencing.c     if (graph == NULL) {
graph             372 daemons/controld/controld_fencing.c     for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) {
graph             391 daemons/controld/controld_fencing.c                 pcmk__update_graph(graph, action);
graph             900 daemons/controld/controld_fencing.c te_fence_node(crm_graph_t *graph, crm_action_t *action)
graph              26 daemons/controld/controld_fencing.h gboolean te_fence_node(crm_graph_t *graph, crm_action_t *action);
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(crm_graph_t * graph, crm_action_t * action)
graph              34 daemons/controld/controld_te_actions.c     action->timer->source_id = g_timeout_add(action->timer->timeout + graph->network_delay,
graph              41 daemons/controld/controld_te_actions.c te_pseudo_action(crm_graph_t * graph, crm_action_t * pseudo)
graph              72 daemons/controld/controld_te_actions.c     te_action_confirmed(pseudo, graph);
graph              87 daemons/controld/controld_te_actions.c te_crm_command(crm_graph_t * graph, crm_action_t * action)
graph             138 daemons/controld/controld_te_actions.c         graph->completion_action = tg_shutdown;
graph             139 daemons/controld/controld_te_actions.c         graph->abort_reason = "local shutdown";
graph             140 daemons/controld/controld_te_actions.c         te_action_confirmed(action, graph);
graph             164 daemons/controld/controld_te_actions.c         te_action_confirmed(action, graph);
graph             169 daemons/controld/controld_te_actions.c                     action->id, task, on_node, action->timeout, graph->network_delay);
graph             170 daemons/controld/controld_te_actions.c             action->timeout = (int) graph->network_delay;
graph             172 daemons/controld/controld_te_actions.c         te_start_action_timer(graph, action);
graph             296 daemons/controld/controld_te_actions.c te_rsc_command(crm_graph_t * graph, crm_action_t * action)
graph             403 daemons/controld/controld_te_actions.c                     action->id, task, task_uuid, on_node, action->timeout, graph->network_delay);
graph             404 daemons/controld/controld_te_actions.c             action->timeout = (int) graph->network_delay;
graph             407 daemons/controld/controld_te_actions.c         te_start_action_timer(graph, action);
graph             501 daemons/controld/controld_te_actions.c te_should_perform_action_on(crm_graph_t * graph, crm_action_t * action, const char *target)
graph             530 daemons/controld/controld_te_actions.c     } else if(graph->migration_limit > 0 && r->migrate_jobs >= graph->migration_limit) {
graph             533 daemons/controld/controld_te_actions.c                       target, graph->migration_limit, r->migrate_jobs, id);
graph             544 daemons/controld/controld_te_actions.c te_should_perform_action(crm_graph_t * graph, crm_action_t * action)
graph             563 daemons/controld/controld_te_actions.c         if(te_should_perform_action_on(graph, action, target) == FALSE) {
graph             573 daemons/controld/controld_te_actions.c     return te_should_perform_action_on(graph, action, target);
graph             583 daemons/controld/controld_te_actions.c te_action_confirmed(crm_action_t *action, crm_graph_t *graph)
graph             592 daemons/controld/controld_te_actions.c     if (graph) {
graph             593 daemons/controld/controld_te_actions.c         pcmk__update_graph(graph, action);
graph             608 daemons/controld/controld_te_actions.c notify_crmd(crm_graph_t * graph)
graph             615 daemons/controld/controld_te_actions.c     CRM_CHECK(graph->complete, graph->complete = TRUE);
graph             617 daemons/controld/controld_te_actions.c     switch (graph->completion_action) {
graph             658 daemons/controld/controld_te_actions.c     crm_debug("Transition %d status: %s - %s", graph->id, type, crm_str(graph->abort_reason));
graph             660 daemons/controld/controld_te_actions.c     graph->abort_reason = NULL;
graph             661 daemons/controld/controld_te_actions.c     graph->completion_action = tg_done;
graph              24 daemons/controld/controld_te_events.c fail_incompletable_actions(crm_graph_t * graph, const char *down_node)
graph              34 daemons/controld/controld_te_events.c     if (graph == NULL || graph->complete) {
graph              38 daemons/controld/controld_te_events.c     gIter = graph->synapses;
graph              75 daemons/controld/controld_te_events.c                 pcmk__update_graph(graph, action);
graph             152 daemons/controld/controld_te_utils.c update_abort_priority(crm_graph_t *graph, int priority,
graph             157 daemons/controld/controld_te_utils.c     if (graph == NULL) {
graph             161 daemons/controld/controld_te_utils.c     if (graph->abort_priority < priority) {
graph             162 daemons/controld/controld_te_utils.c         crm_debug("Abort priority upgraded from %d to %d", graph->abort_priority, priority);
graph             163 daemons/controld/controld_te_utils.c         graph->abort_priority = priority;
graph             164 daemons/controld/controld_te_utils.c         if (graph->abort_reason != NULL) {
graph             165 daemons/controld/controld_te_utils.c             crm_debug("'%s' abort superseded by %s", graph->abort_reason, abort_reason);
graph             167 daemons/controld/controld_te_utils.c         graph->abort_reason = abort_reason;
graph             171 daemons/controld/controld_te_utils.c     if (graph->completion_action < action) {
graph             173 daemons/controld/controld_te_utils.c                   abort2text(graph->completion_action), abort2text(action), abort_reason);
graph             174 daemons/controld/controld_te_utils.c         graph->completion_action = action;
graph              22 daemons/controld/controld_transition.h extern gboolean fail_incompletable_actions(crm_graph_t * graph, const char *down_node);
graph              38 daemons/controld/controld_transition.h extern void notify_crmd(crm_graph_t * graph);
graph              62 daemons/controld/controld_transition.h void te_action_confirmed(crm_action_t *action, crm_graph_t *graph);
graph              74 daemons/schedulerd/schedulerd_messages.c         data_set->graph = create_xml_node(NULL, XML_TAG_GRAPH);
graph              75 daemons/schedulerd/schedulerd_messages.c         crm_xml_add_int(data_set->graph, "transition_id", 0);
graph              76 daemons/schedulerd/schedulerd_messages.c         crm_xml_add_int(data_set->graph, "cluster-delay", 0);
graph             120 daemons/schedulerd/schedulerd_messages.c     reply = create_reply(msg, data_set->graph);
graph             153 daemons/schedulerd/schedulerd_messages.c         write_xml_fd(data_set->graph, graph_file, graph_file_fd, FALSE);
graph              45 include/crm/common/ipc_schedulerd.h         } graph;
graph             183 include/crm/pengine/pe_types.h     xmlNode *graph;
graph             146 include/pcmki/pcmki_transition.h     gboolean(*pseudo) (crm_graph_t * graph, crm_action_t * action);
graph             147 include/pcmki/pcmki_transition.h     gboolean(*rsc) (crm_graph_t * graph, crm_action_t * action);
graph             148 include/pcmki/pcmki_transition.h     gboolean(*crmd) (crm_graph_t * graph, crm_action_t * action);
graph             149 include/pcmki/pcmki_transition.h     gboolean(*stonith) (crm_graph_t * graph, crm_action_t * action);
graph             150 include/pcmki/pcmki_transition.h     gboolean(*allowed) (crm_graph_t * graph, crm_action_t * action);
graph             165 include/pcmki/pcmki_transition.h enum transition_status pcmk__execute_graph(crm_graph_t *graph);
graph             166 include/pcmki/pcmki_transition.h void pcmk__update_graph(crm_graph_t *graph, crm_action_t *action);
graph             167 include/pcmki/pcmki_transition.h void pcmk__free_graph(crm_graph_t *graph);
graph             169 include/pcmki/pcmki_transition.h void pcmk__log_graph(unsigned int log_level, crm_graph_t *graph);
graph             111 lib/common/ipc_schedulerd.c         reply_data.data.graph.reference = crm_element_value(reply, XML_ATTR_REFERENCE);
graph             112 lib/common/ipc_schedulerd.c         reply_data.data.graph.input = crm_element_value(reply, F_CRM_TGRAPH_INPUT);
graph             113 lib/common/ipc_schedulerd.c         reply_data.data.graph.tgraph = msg_data;
graph             111 lib/pacemaker/pcmk_graph_consumer.c pcmk__update_graph(crm_graph_t *graph, crm_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(crm_graph_t *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(crm_graph_t *graph, crm_action_t *action)
graph             239 lib/pacemaker/pcmk_graph_consumer.c             return graph_fns->pseudo(graph, action)? pcmk_rc_ok : pcmk_rc_error;
graph             243 lib/pacemaker/pcmk_graph_consumer.c             return graph_fns->rsc(graph, action)? pcmk_rc_ok : pcmk_rc_error;
graph             250 lib/pacemaker/pcmk_graph_consumer.c                 return graph_fns->stonith(graph, action)? pcmk_rc_ok : pcmk_rc_error;
graph             253 lib/pacemaker/pcmk_graph_consumer.c             return graph_fns->crmd(graph, action)? pcmk_rc_ok : pcmk_rc_error;
graph             272 lib/pacemaker/pcmk_graph_consumer.c fire_synapse(crm_graph_t *graph, synapse_t *synapse)
graph             278 lib/pacemaker/pcmk_graph_consumer.c         if (initiate_action(graph, action) != pcmk_rc_ok) {
graph             301 lib/pacemaker/pcmk_graph_consumer.c pseudo_action_dummy(crm_graph_t * graph, crm_action_t * action)
graph             319 lib/pacemaker/pcmk_graph_consumer.c         graph->abort_priority = INFINITY;
graph             324 lib/pacemaker/pcmk_graph_consumer.c     pcmk__update_graph(graph, action);
graph             344 lib/pacemaker/pcmk_graph_consumer.c pcmk__execute_graph(crm_graph_t *graph)
graph             354 lib/pacemaker/pcmk_graph_consumer.c     if (graph == NULL) {
graph             358 lib/pacemaker/pcmk_graph_consumer.c     graph->fired = 0;
graph             359 lib/pacemaker/pcmk_graph_consumer.c     graph->pending = 0;
graph             360 lib/pacemaker/pcmk_graph_consumer.c     graph->skipped = 0;
graph             361 lib/pacemaker/pcmk_graph_consumer.c     graph->completed = 0;
graph             362 lib/pacemaker/pcmk_graph_consumer.c     graph->incomplete = 0;
graph             365 lib/pacemaker/pcmk_graph_consumer.c     for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) {
graph             369 lib/pacemaker/pcmk_graph_consumer.c             graph->completed++;
graph             372 lib/pacemaker/pcmk_graph_consumer.c             graph->pending++;
graph             376 lib/pacemaker/pcmk_graph_consumer.c               graph->id, graph->completed, graph->pending);
graph             379 lib/pacemaker/pcmk_graph_consumer.c     for (lpc = graph->synapses; lpc != NULL; lpc = lpc->next) {
graph             382 lib/pacemaker/pcmk_graph_consumer.c         if ((graph->batch_limit > 0)
graph             383 lib/pacemaker/pcmk_graph_consumer.c             && (graph->pending >= graph->batch_limit)) {
graph             386 lib/pacemaker/pcmk_graph_consumer.c                       graph->batch_limit);
graph             390 lib/pacemaker/pcmk_graph_consumer.c             graph->skipped++;
graph             396 lib/pacemaker/pcmk_graph_consumer.c         } else if (should_fire_synapse(graph, synapse)) {
graph             397 lib/pacemaker/pcmk_graph_consumer.c             graph->fired++;
graph             398 lib/pacemaker/pcmk_graph_consumer.c             if (fire_synapse(graph, synapse) != pcmk_rc_ok) {
graph             401 lib/pacemaker/pcmk_graph_consumer.c                 graph->abort_priority = INFINITY;
graph             402 lib/pacemaker/pcmk_graph_consumer.c                 graph->incomplete++;
graph             403 lib/pacemaker/pcmk_graph_consumer.c                 graph->fired--;
graph             407 lib/pacemaker/pcmk_graph_consumer.c                 graph->pending++;
graph             412 lib/pacemaker/pcmk_graph_consumer.c             graph->incomplete++;
graph             416 lib/pacemaker/pcmk_graph_consumer.c     if ((graph->pending == 0) && (graph->fired == 0)) {
graph             417 lib/pacemaker/pcmk_graph_consumer.c         graph->complete = TRUE;
graph             419 lib/pacemaker/pcmk_graph_consumer.c         if ((graph->incomplete != 0) && (graph->abort_priority <= 0)) {
graph             424 lib/pacemaker/pcmk_graph_consumer.c         } else if (graph->skipped != 0) {
graph             435 lib/pacemaker/pcmk_graph_consumer.c     } else if (graph->fired == 0) {
graph             442 lib/pacemaker/pcmk_graph_consumer.c                graph->id, graph->completed, graph->pending, graph->fired,
graph             443 lib/pacemaker/pcmk_graph_consumer.c                graph->skipped, graph->incomplete, graph->source, status);
graph             785 lib/pacemaker/pcmk_graph_consumer.c pcmk__free_graph(crm_graph_t *graph)
graph             787 lib/pacemaker/pcmk_graph_consumer.c     if (graph != NULL) {
graph             788 lib/pacemaker/pcmk_graph_consumer.c         g_list_free_full(graph->synapses, free_graph_synapse);
graph             789 lib/pacemaker/pcmk_graph_consumer.c         free(graph->source);
graph             790 lib/pacemaker/pcmk_graph_consumer.c         free(graph);
graph              71 lib/pacemaker/pcmk_graph_logging.c find_graph_action_by_id(crm_graph_t *graph, int id)
graph              73 lib/pacemaker/pcmk_graph_logging.c     if (graph == NULL) {
graph              77 lib/pacemaker/pcmk_graph_logging.c     for (GList *sIter = graph->synapses; sIter != NULL; sIter = sIter->next) {
graph             113 lib/pacemaker/pcmk_graph_logging.c synapse_pending_inputs(crm_graph_t *graph, synapse_t *synapse)
graph             127 lib/pacemaker/pcmk_graph_logging.c         } else if (find_graph_action_by_id(graph, input->id) != NULL) {
graph             140 lib/pacemaker/pcmk_graph_logging.c log_unresolved_inputs(unsigned int log_level, crm_graph_t *graph,
graph             148 lib/pacemaker/pcmk_graph_logging.c         if (find_graph_action_by_id(graph, input->id) == NULL) {
graph             175 lib/pacemaker/pcmk_graph_logging.c log_synapse(unsigned int log_level, crm_graph_t *graph, synapse_t *synapse)
graph             180 lib/pacemaker/pcmk_graph_logging.c         pending = synapse_pending_inputs(graph, synapse);
graph             188 lib/pacemaker/pcmk_graph_logging.c         log_unresolved_inputs(log_level, graph, synapse);
graph             199 lib/pacemaker/pcmk_graph_logging.c pcmk__log_graph(unsigned int log_level, crm_graph_t *graph)
graph             201 lib/pacemaker/pcmk_graph_logging.c     if ((graph == NULL) || (graph->num_actions == 0)) {
graph             210 lib/pacemaker/pcmk_graph_logging.c                graph->id, graph->num_actions,
graph             211 lib/pacemaker/pcmk_graph_logging.c                graph->batch_limit, graph->network_delay);
graph             213 lib/pacemaker/pcmk_graph_logging.c     for (GList *lpc = graph->synapses; lpc != NULL; lpc = lpc->next) {
graph             214 lib/pacemaker/pcmk_graph_logging.c         log_synapse(log_level, graph, (synapse_t *) lpc->data);
graph             884 lib/pacemaker/pcmk_graph_producer.c     xmlNode *syn = create_xml_node(data_set->graph, "synapse");
graph            1008 lib/pacemaker/pcmk_graph_producer.c     data_set->graph = create_xml_node(NULL, XML_TAG_GRAPH);
graph            1011 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(data_set->graph, "cluster-delay", value);
graph            1014 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(data_set->graph, "stonith-timeout", value);
graph            1016 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(data_set->graph, "failed-stop-offset", "INFINITY");
graph            1019 lib/pacemaker/pcmk_graph_producer.c         crm_xml_add(data_set->graph, "failed-start-offset", "INFINITY");
graph            1021 lib/pacemaker/pcmk_graph_producer.c         crm_xml_add(data_set->graph, "failed-start-offset", "1");
graph            1025 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(data_set->graph, "batch-limit", value);
graph            1027 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add_int(data_set->graph, "transition_id", transition_id);
graph            1031 lib/pacemaker/pcmk_graph_producer.c         crm_xml_add(data_set->graph, "migration-limit", value);
graph            1039 lib/pacemaker/pcmk_graph_producer.c         crm_xml_add(data_set->graph, "recheck-by", recheck_epoch);
graph            1088 lib/pacemaker/pcmk_graph_producer.c     crm_log_xml_trace(data_set->graph, "graph");
graph             467 lib/pacemaker/pcmk_simulate.c simulate_pseudo_action(crm_graph_t *graph, crm_action_t *action)
graph             475 lib/pacemaker/pcmk_simulate.c     pcmk__update_graph(graph, action);
graph             489 lib/pacemaker/pcmk_simulate.c simulate_resource_action(crm_graph_t *graph, crm_action_t *action)
graph             628 lib/pacemaker/pcmk_simulate.c         graph->abort_priority = INFINITY;
graph             644 lib/pacemaker/pcmk_simulate.c     pcmk__update_graph(graph, action);
graph             658 lib/pacemaker/pcmk_simulate.c simulate_cluster_action(crm_graph_t *graph, crm_action_t *action)
graph             666 lib/pacemaker/pcmk_simulate.c     pcmk__update_graph(graph, action);
graph             680 lib/pacemaker/pcmk_simulate.c simulate_fencing_action(crm_graph_t *graph, crm_action_t *action)
graph             716 lib/pacemaker/pcmk_simulate.c     pcmk__update_graph(graph, action);
graph             745 lib/pacemaker/pcmk_simulate.c     transition = pcmk__unpack_graph(data_set->graph, crm_system_name);
graph             904 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)