node_t            582 fencing/main.c static node_t *
node_t            586 fencing/main.c     node_t *node = NULL;
node_t            610 fencing/main.c     node_t *node = NULL;
node_t            613 fencing/main.c     node_t *parent = NULL;
node_t             44 include/crm/pengine/complex.h     resource_t *(*find_rsc) (resource_t * parent, const char *search, node_t * node, int flags);
node_t             46 include/crm/pengine/complex.h     char *(*parameter) (resource_t *, node_t *, gboolean, const char *, pe_working_set_t *);
node_t             50 include/crm/pengine/complex.h     node_t *(*location) (resource_t *, GListPtr *, gboolean);
node_t             55 include/crm/pengine/complex.h void get_meta_attributes(GHashTable * meta_hash, resource_t * rsc, node_t * node,
node_t             57 include/crm/pengine/complex.h void get_rsc_attributes(GHashTable * meta_hash, resource_t * rsc, node_t * node,
node_t             61 include/crm/pengine/complex.h void pe_get_versioned_attributes(xmlNode * meta_hash, resource_t * rsc, node_t * node,
node_t             57 include/crm/pengine/internal.h bool pe_can_fence(pe_working_set_t *data_set, node_t *node);
node_t             63 include/crm/pengine/internal.h char *native_parameter(resource_t * rsc, node_t * node, gboolean create, const char *name,
node_t             65 include/crm/pengine/internal.h node_t *native_location(resource_t * rsc, GListPtr * list, gboolean current);
node_t             71 include/crm/pengine/internal.h void native_add_running(resource_t * rsc, node_t * node, pe_working_set_t * data_set);
node_t             72 include/crm/pengine/internal.h node_t *rsc_known_on(resource_t * rsc, GListPtr * list);
node_t             80 include/crm/pengine/internal.h resource_t *native_find_rsc(resource_t * rsc, const char *id, node_t * node, int flags);
node_t            112 include/crm/pengine/internal.h extern node_t *node_copy(const node_t *this_node);
node_t            124 include/crm/pengine/internal.h int pe_get_failcount(node_t *node, resource_t *rsc, time_t *last_failure,
node_t            157 include/crm/pengine/internal.h extern void print_node(const char *pre_text, node_t * node, gboolean details);
node_t            164 include/crm/pengine/internal.h extern void dump_node_capacity(int level, const char *comment, node_t * node);
node_t            165 include/crm/pengine/internal.h extern void dump_rsc_utilization(int level, const char *comment, resource_t * rsc, node_t * node);
node_t            177 include/crm/pengine/internal.h extern action_t *custom_action(resource_t * rsc, char *key, const char *task, node_t * on_node,
node_t            230 include/crm/pengine/internal.h                                    node_t * on_node);
node_t            234 include/crm/pengine/internal.h extern GListPtr find_actions(GListPtr input, const char *key, const node_t *on_node);
node_t            235 include/crm/pengine/internal.h extern GListPtr find_actions_exact(GListPtr input, const char *key, node_t * on_node);
node_t            236 include/crm/pengine/internal.h extern GListPtr find_recurring_actions(GListPtr input, node_t * not_on_node);
node_t            240 include/crm/pengine/internal.h extern void resource_location(resource_t * rsc, node_t * node, int score, const char *tag,
node_t            296 include/crm/pengine/internal.h op_digest_cache_t *rsc_action_digest_cmp(resource_t * rsc, xmlNode * xml_op, node_t * node,
node_t            299 include/crm/pengine/internal.h action_t *pe_fence_op(node_t * node, const char *op, bool optional, const char *reason, pe_working_set_t * data_set);
node_t            301 include/crm/pengine/internal.h     resource_t * rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t * data_set);
node_t            316 include/crm/pengine/internal.h void pe_fence_node(pe_working_set_t * data_set, node_t * node, const char *reason);
node_t            318 include/crm/pengine/internal.h node_t *pe_create_node(const char *id, const char *uname, const char *type,
node_t            321 include/crm/pengine/internal.h void common_print(resource_t * rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data);
node_t            322 include/crm/pengine/internal.h resource_t *find_container_child(const char *stem, resource_t * rsc, node_t *node);
node_t             22 include/crm/pengine/remote.h gboolean is_baremetal_remote_node(node_t *node);
node_t             23 include/crm/pengine/remote.h gboolean is_container_remote_node(node_t *node);
node_t             24 include/crm/pengine/remote.h gboolean is_remote_node(node_t *node);
node_t             27 include/crm/pengine/remote.h void pe_foreach_guest_node(const pe_working_set_t *data_set, const node_t *host,
node_t             28 include/crm/pengine/remote.h                            void (*helper)(const node_t*, void*), void *user_data);
node_t             27 include/crm/pengine/status.h typedef struct node_s node_t;
node_t             91 include/crm/pengine/status.h     node_t *dc_node;
node_t            289 include/crm/pengine/status.h     node_t *allocated_to;
node_t            304 include/crm/pengine/status.h     node_t *partial_migration_target;
node_t            305 include/crm/pengine/status.h     node_t *partial_migration_source;
node_t            336 include/crm/pengine/status.h     node_t *node;
node_t            471 include/crm/pengine/status.h node_t *pe_find_node(GListPtr node_list, const char *uname);
node_t            472 include/crm/pengine/status.h node_t *pe_find_node_id(GListPtr node_list, const char *id);
node_t            473 include/crm/pengine/status.h node_t *pe_find_node_any(GListPtr node_list, const char *id, const char *uname);
node_t            460 lib/pengine/clone.c             node_t *location = child_rsc->fns->location(child_rsc, NULL, TRUE);
node_t            501 lib/pengine/clone.c         node_t *host = gIter->data;
node_t            515 lib/pengine/clone.c         node_t *host = gIter->data;
node_t            564 lib/pengine/clone.c                 node_t *node = (node_t *)nIter->data;
node_t            132 lib/pengine/complex.c                     node_t * node, pe_working_set_t * data_set)
node_t            175 lib/pengine/complex.c                    node_t * node, pe_working_set_t * data_set)
node_t            200 lib/pengine/complex.c                             node_t * node, pe_working_set_t * data_set)
node_t            860 lib/pengine/complex.c     node_t *node = NULL;
node_t            530 lib/pengine/container.c         node_t *node = NULL;
node_t            618 lib/pengine/container.c             node_t *copy = node_copy(tuple->node);
node_t           1168 lib/pengine/container.c find_container_child(const char *stem, resource_t * rsc, node_t *node) 
node_t           1273 lib/pengine/container.c     node_t *node = NULL;
node_t             73 lib/pengine/failcounts.c block_failure(node_t *node, resource_t *rsc, xmlNode *xml_op,
node_t            237 lib/pengine/failcounts.c pe_get_failcount(node_t *node, resource_t *rsc, time_t *last_failure,
node_t             32 lib/pengine/native.c native_add_running(resource_t * rsc, node_t * node, pe_working_set_t * data_set)
node_t             38 lib/pengine/native.c         node_t *a_node = (node_t *) gIter->data;
node_t             77 lib/pengine/native.c                     node_t *local_node = NULL;
node_t            162 lib/pengine/native.c rsc_is_on_node(resource_t *rsc, node_t *node, int flags)
node_t            170 lib/pengine/native.c             node_t *loc = (node_t *) iter->data;
node_t            188 lib/pengine/native.c native_find_rsc(resource_t * rsc, const char *id, node_t * on_node, int flags)
node_t            242 lib/pengine/native.c native_parameter(resource_t * rsc, node_t * node, gboolean create, const char *name,
node_t            290 lib/pengine/native.c         node_t *a_node = (node_t *) gIter->data;
node_t            457 lib/pengine/native.c             node_t *node = (node_t *) gIter->data;
node_t            479 lib/pengine/native.c common_print(resource_t * rsc, const char *pre_text, const char *name, node_t *node, long options, void *print_data)
node_t            652 lib/pengine/native.c             node_t *n = (node_t *) gIter->data;
node_t            701 lib/pengine/native.c         node_t *n = NULL;
node_t            716 lib/pengine/native.c         node_t *n = NULL;
node_t            729 lib/pengine/native.c     node_t *node = NULL;
node_t            762 lib/pengine/native.c node_t *
node_t            765 lib/pengine/native.c     node_t *one = NULL;
node_t            792 lib/pengine/native.c             node_t *node = (node_t *) gIter->data;
node_t            847 lib/pengine/native.c                 node_t *node = (node_t *) gIter2->data;
node_t             27 lib/pengine/remote.c     node_t *node;
node_t             44 lib/pengine/remote.c is_baremetal_remote_node(node_t *node)
node_t             53 lib/pengine/remote.c is_container_remote_node(node_t *node)
node_t             62 lib/pengine/remote.c is_remote_node(node_t *node)
node_t            114 lib/pengine/remote.c pe_foreach_guest_node(const pe_working_set_t *data_set, const node_t *host,
node_t            115 lib/pengine/remote.c                       void (*helper)(const node_t*, void*), void *user_data)
node_t            127 lib/pengine/remote.c             node_t *guest_node = pe_find_node(data_set->nodes, rsc->id);
node_t            148 lib/pengine/status.c         node_t *node = (node_t *) iterator->data;
node_t            272 lib/pengine/status.c node_t *
node_t            275 lib/pengine/status.c     node_t *match = pe_find_node_id(nodes, id);
node_t            284 lib/pengine/status.c node_t *
node_t            290 lib/pengine/status.c         node_t *node = (node_t *) gIter->data;
node_t            300 lib/pengine/status.c node_t *
node_t            306 lib/pengine/status.c         node_t *node = (node_t *) gIter->data;
node_t             45 lib/pengine/unpack.c gboolean unpack_rsc_op(resource_t * rsc, node_t * node, xmlNode * xml_op, xmlNode ** last_failure,
node_t             47 lib/pengine/unpack.c static gboolean determine_remote_online_status(pe_working_set_t * data_set, node_t * this_node);
node_t             53 lib/pengine/unpack.c is_dangling_container_remote_node(node_t *node)
node_t             77 lib/pengine/unpack.c pe_fence_node(pe_working_set_t * data_set, node_t * node, const char *reason)
node_t            355 lib/pengine/unpack.c node_t *
node_t            359 lib/pengine/unpack.c     node_t *new_node = NULL;
node_t            366 lib/pengine/unpack.c     new_node = calloc(1, sizeof(node_t));
node_t            500 lib/pengine/unpack.c handle_startup_fencing(pe_working_set_t *data_set, node_t *new_node)
node_t            528 lib/pengine/unpack.c     node_t *new_node = NULL;
node_t            682 lib/pengine/unpack.c     node_t *remote_node = NULL;
node_t           1004 lib/pengine/unpack.c unpack_handle_remote_attrs(node_t *this_node, xmlNode *state, pe_working_set_t * data_set) 
node_t           1076 lib/pengine/unpack.c         node_t *this_node = NULL;
node_t           1163 lib/pengine/unpack.c     node_t *this_node = NULL;
node_t           1269 lib/pengine/unpack.c         node_t *this_node = gIter->data;
node_t           1286 lib/pengine/unpack.c                                    node_t * this_node)
node_t           1320 lib/pengine/unpack.c                                 node_t * this_node)
node_t           1419 lib/pengine/unpack.c determine_remote_online_status(pe_working_set_t * data_set, node_t * this_node)
node_t           1489 lib/pengine/unpack.c determine_online_status(xmlNode * node_state, node_t * this_node, pe_working_set_t * data_set)
node_t           1661 lib/pengine/unpack.c         node_t *node;
node_t           1689 lib/pengine/unpack.c find_anonymous_clone(pe_working_set_t * data_set, node_t * node, resource_t * parent,
node_t           1714 lib/pengine/unpack.c             node_t *childnode = nIter->data;
node_t           1782 lib/pengine/unpack.c unpack_find_resource(pe_working_set_t * data_set, node_t * node, const char *rsc_id,
node_t           1839 lib/pengine/unpack.c process_orphan_resource(xmlNode * rsc_entry, node_t * node, pe_working_set_t * data_set)
node_t           1860 lib/pengine/unpack.c process_rsc_state(resource_t * rsc, node_t * node,
node_t           1864 lib/pengine/unpack.c     node_t *tmpnode = NULL;
node_t           1877 lib/pengine/unpack.c                 node_t *n = node_copy(node);
node_t           2083 lib/pengine/unpack.c process_recurring(node_t * node, resource_t * rsc,
node_t           2188 lib/pengine/unpack.c unpack_lrm_rsc_state(node_t * node, xmlNode * rsc_entry, pe_working_set_t * data_set)
node_t           2322 lib/pengine/unpack.c unpack_lrm_resources(node_t * node, xmlNode * lrm_rsc_list, pe_working_set_t * data_set)
node_t           2369 lib/pengine/unpack.c     node_t *node = value;
node_t           2410 lib/pengine/unpack.c unpack_rsc_migration(resource_t *rsc, node_t *node, xmlNode *xml_op, pe_working_set_t * data_set)
node_t           2444 lib/pengine/unpack.c         node_t *target = pe_find_node(data_set->nodes, migrate_target);
node_t           2445 lib/pengine/unpack.c         node_t *source = pe_find_node(data_set->nodes, migrate_source);
node_t           2502 lib/pengine/unpack.c unpack_rsc_migration_failure(resource_t *rsc, node_t *node, xmlNode *xml_op, pe_working_set_t * data_set) 
node_t           2530 lib/pengine/unpack.c             node_t *source = pe_find_node(data_set->nodes, migrate_source);
node_t           2560 lib/pengine/unpack.c             node_t *target = pe_find_node(data_set->nodes, migrate_target);
node_t           2576 lib/pengine/unpack.c record_failed_op(xmlNode *op, node_t* node, resource_t *rsc, pe_working_set_t * data_set)
node_t           2611 lib/pengine/unpack.c unpack_rsc_op_failure(resource_t * rsc, node_t * node, int rc, xmlNode * xml_op, xmlNode ** last_failure,
node_t           2735 lib/pengine/unpack.c     resource_t *rsc, int rc, int target_rc, node_t * node, xmlNode * xml_op, enum action_fail_response * on_fail, pe_working_set_t * data_set) 
node_t           2856 lib/pengine/unpack.c static bool check_operation_expiry(resource_t *rsc, node_t *node, int rc, xmlNode *xml_op, pe_working_set_t * data_set)
node_t           2883 lib/pengine/unpack.c             node_t *remote_node = pe_find_node(data_set->nodes, rsc->id);
node_t           3001 lib/pengine/unpack.c update_resource_state(resource_t * rsc, node_t * node, xmlNode * xml_op, const char * task, int rc,
node_t           3091 lib/pengine/unpack.c unpack_rsc_op(resource_t * rsc, node_t * node, xmlNode * xml_op, xmlNode ** last_failure,
node_t           3220 lib/pengine/unpack.c                 node_t *target = pe_find_node(data_set->nodes, migrate_target);
node_t           3310 lib/pengine/unpack.c add_node_attrs(xmlNode * xml_obj, node_t * node, gboolean overwrite, pe_working_set_t * data_set)
node_t           3427 lib/pengine/unpack.c     node_t *this_node = NULL;
node_t             37 lib/pengine/unpack.h extern gboolean unpack_lrm_resources(node_t * node, xmlNode * lrm_state,
node_t             40 lib/pengine/unpack.h extern gboolean add_node_attrs(xmlNode * attrs, node_t * node, gboolean overwrite,
node_t             43 lib/pengine/unpack.h extern gboolean determine_online_status(xmlNode * node_state, node_t * this_node,
node_t            100 lib/pengine/utils.c bool pe_can_fence(pe_working_set_t * data_set, node_t *node)
node_t            126 lib/pengine/utils.c node_t *
node_t            127 lib/pengine/utils.c node_copy(const node_t *this_node)
node_t            129 lib/pengine/utils.c     node_t *new_node = NULL;
node_t            133 lib/pengine/utils.c     new_node = calloc(1, sizeof(node_t));
node_t            151 lib/pengine/utils.c     node_t *other_node = NULL;
node_t            155 lib/pengine/utils.c     node_t *node = NULL;
node_t            169 lib/pengine/utils.c         node_t *node = (node_t *) gIter->data;
node_t            174 lib/pengine/utils.c             node_t *new_node = node_copy(node);
node_t            189 lib/pengine/utils.c         node_t *node = (node_t *) gIter->data;
node_t            190 lib/pengine/utils.c         node_t *n = node_copy(node);
node_t            205 lib/pengine/utils.c         node_t *new_node = NULL;
node_t            206 lib/pengine/utils.c         node_t *this_node = (node_t *) gIter->data;
node_t            227 lib/pengine/utils.c     const node_t *node_a = a;
node_t            228 lib/pengine/utils.c     const node_t *node_b = b;
node_t            239 lib/pengine/utils.c     node_t *node = NULL;
node_t            261 lib/pengine/utils.c             node_t *node = (node_t *) gIter->data;
node_t            322 lib/pengine/utils.c dump_node_capacity(int level, const char *comment, node_t * node)
node_t            343 lib/pengine/utils.c dump_rsc_utilization(int level, const char *comment, resource_t * rsc, node_t * node)
node_t            420 lib/pengine/utils.c               node_t * on_node, gboolean optional, gboolean save_action,
node_t           1240 lib/pengine/utils.c print_node(const char *pre_text, node_t * node, gboolean details)
node_t           1327 lib/pengine/utils.c find_recurring_actions(GListPtr input, node_t * not_on_node)
node_t           1385 lib/pengine/utils.c find_first_action(GListPtr input, const char *uuid, const char *task, node_t * on_node)
node_t           1415 lib/pengine/utils.c find_actions(GListPtr input, const char *key, const node_t *on_node)
node_t           1455 lib/pengine/utils.c find_actions_exact(GListPtr input, const char *key, node_t * on_node)
node_t           1484 lib/pengine/utils.c resource_node_score(resource_t * rsc, node_t * node, int score, const char *tag)
node_t           1486 lib/pengine/utils.c     node_t *match = NULL;
node_t           1516 lib/pengine/utils.c resource_location(resource_t * rsc, node_t * node, int score, const char *tag,
node_t           1526 lib/pengine/utils.c             node_t *node_iter = (node_t *) gIter->data;
node_t           1533 lib/pengine/utils.c         node_t *node_iter = NULL;
node_t           1890 lib/pengine/utils.c                   node_t * node, xmlNode * xml_op, pe_working_set_t * data_set) 
node_t           1980 lib/pengine/utils.c rsc_action_digest_cmp(resource_t * rsc, xmlNode * xml_op, node_t * node,
node_t           2033 lib/pengine/utils.c fencing_action_digest_cmp(resource_t * rsc, node_t * node, pe_working_set_t * data_set)
node_t           2139 lib/pengine/utils.c pe_fence_op(node_t * node, const char *op, bool optional, const char *reason, pe_working_set_t * data_set)
node_t           2222 lib/pengine/utils.c     resource_t * rsc, node_t *node, const char *reason, action_t *dependency, pe_working_set_t * data_set) 
node_t             63 lib/pengine/variant.h         node_t *node;
node_t             38 pengine/allocate.c extern void ReloadRsc(resource_t * rsc, node_t *node, pe_working_set_t * data_set);
node_t             39 pengine/allocate.c extern gboolean DeleteRsc(resource_t * rsc, node_t * node, gboolean optional, pe_working_set_t * data_set);
node_t            153 pengine/allocate.c check_rsc_parameters(resource_t * rsc, node_t * node, xmlNode * rsc_entry,
node_t            200 pengine/allocate.c CancelXmlOp(resource_t * rsc, xmlNode * xml_op, node_t * active_node,
node_t            244 pengine/allocate.c check_action_definition(resource_t * rsc, node_t * active_node, xmlNode * xml_op,
node_t            376 pengine/allocate.c check_actions_for(xmlNode * rsc_entry, resource_t * rsc, node_t * node, pe_working_set_t * data_set)
node_t            546 pengine/allocate.c     node_t *node = NULL;
node_t            622 pengine/allocate.c failcount_clear_action_exists(node_t * node, resource_t * rsc)
node_t            646 pengine/allocate.c check_migration_threshold(resource_t *rsc, node_t *node,
node_t            691 pengine/allocate.c common_apply_stickiness(resource_t * rsc, node_t * node, pe_working_set_t * data_set)
node_t            706 pengine/allocate.c         node_t *current = pe_find_node_id(rsc->running_on, node->details->id);
node_t            707 pengine/allocate.c         node_t *match = pe_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node_t            720 pengine/allocate.c             node_t *nIter = NULL;
node_t            845 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t            901 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t            939 pengine/allocate.c rsc_discover_filter(resource_t *rsc, node_t *node)
node_t            943 pengine/allocate.c     node_t *match;
node_t            975 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t            991 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1046 pengine/allocate.c     node_t *r1_node = NULL;
node_t           1047 pengine/allocate.c     node_t *r2_node = NULL;
node_t           1122 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1249 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1294 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1306 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1512 pengine/allocate.c         node_t *node = (node_t *) gIter->data;
node_t           1917 pengine/allocate.c     node_t *cluster_node = NULL;
node_t           1992 pengine/allocate.c     node_t *cluster_node = NULL;
node_t             31 pengine/allocate.h     node_t *(*allocate) (resource_t *, node_t *, pe_working_set_t *);
node_t             33 pengine/allocate.h      gboolean(*create_probe) (resource_t *, node_t *, action_t *, gboolean, pe_working_set_t *);
node_t             41 pengine/allocate.h     enum pe_action_flags (*action_flags) (action_t *, node_t *);
node_t             42 pengine/allocate.h     enum pe_graph_flags (*update_actions) (action_t *, action_t *, node_t *, enum pe_action_flags,
node_t             67 pengine/allocate.h extern node_t *native_color(resource_t * rsc, node_t * preferred, pe_working_set_t * data_set);
node_t             76 pengine/allocate.h extern enum pe_action_flags native_action_flags(action_t * action, node_t * node);
node_t             81 pengine/allocate.h extern gboolean native_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t             86 pengine/allocate.h extern node_t *group_color(resource_t * rsc, node_t * preferred, pe_working_set_t * data_set);
node_t             93 pengine/allocate.h extern enum pe_action_flags group_action_flags(action_t * action, node_t * node);
node_t             99 pengine/allocate.h extern node_t *container_color(resource_t * rsc, node_t * preferred, pe_working_set_t * data_set);
node_t            107 pengine/allocate.h extern enum pe_action_flags container_action_flags(action_t * action, node_t * node);
node_t            109 pengine/allocate.h extern gboolean container_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t            114 pengine/allocate.h extern node_t *clone_color(resource_t * rsc, node_t * preferred, pe_working_set_t * data_set);
node_t            122 pengine/allocate.h extern enum pe_action_flags clone_action_flags(action_t * action, node_t * node);
node_t            124 pengine/allocate.h extern gboolean clone_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t            129 pengine/allocate.h extern node_t *master_color(resource_t * rsc, node_t * preferred, pe_working_set_t * data_set);
node_t            164 pengine/allocate.h extern enum pe_graph_flags native_update_actions(action_t * first, action_t * then, node_t * node,
node_t            168 pengine/allocate.h extern enum pe_graph_flags group_update_actions(action_t * first, action_t * then, node_t * node,
node_t            171 pengine/allocate.h extern enum pe_graph_flags container_update_actions(action_t * first, action_t * then, node_t * node,
node_t             45 pengine/clone.c static node_t *
node_t             46 pengine/clone.c parent_node_instance(const resource_t * rsc, node_t * node)
node_t             48 pengine/clone.c     node_t *ret = NULL;
node_t             81 pengine/clone.c     node_t *node1 = NULL;
node_t             82 pengine/clone.c     node_t *node2 = NULL;
node_t            120 pengine/clone.c         node_t *match = pe_hash_table_lookup(resource1->allowed_nodes, node1->details->id);
node_t            130 pengine/clone.c         node_t *match = pe_hash_table_lookup(resource2->allowed_nodes, node2->details->id);
node_t            221 pengine/clone.c         node_t *n = NULL;
node_t            363 pengine/clone.c static node_t *
node_t            364 pengine/clone.c can_run_instance(resource_t * rsc, node_t * node, int limit)
node_t            366 pengine/clone.c     node_t *local_node = NULL;
node_t            412 pengine/clone.c static node_t *
node_t            413 pengine/clone.c color_instance(resource_t * rsc, node_t * prefer, gboolean all_coloc, int limit, pe_working_set_t * data_set)
node_t            415 pengine/clone.c     node_t *chosen = NULL;
node_t            437 pengine/clone.c         node_t *local_prefer = g_hash_table_lookup(rsc->allowed_nodes, prefer->details->id);
node_t            451 pengine/clone.c         node_t *local_node = parent_node_instance(rsc, chosen);
node_t            542 pengine/clone.c             node_t *child_node = child->running_on->data;
node_t            543 pengine/clone.c             node_t *local_node = parent_node_instance(child, child->running_on->data);
node_t            571 pengine/clone.c             node_t *child_node = child->running_on->data;
node_t            572 pengine/clone.c             node_t *local_node = parent_node_instance(child, child->running_on->data);
node_t            596 pengine/clone.c node_t *
node_t            597 pengine/clone.c clone_color(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t            929 pengine/clone.c assign_node(resource_t * rsc, node_t * node, gboolean force)
node_t            953 pengine/clone.c is_child_compatible(resource_t *child_rsc, node_t * local_node, enum rsc_role_e filter, gboolean current) 
node_t            955 pengine/clone.c     node_t *node = NULL;
node_t            987 pengine/clone.c     node_t *local_node = NULL;
node_t            999 pengine/clone.c         node_t *node = (node_t *) gIter->data;
node_t           1081 pengine/clone.c             node_t *chosen = child_rsc->fns->location(child_rsc, NULL, FALSE);
node_t           1142 pengine/clone.c summary_action_flags(action_t * action, GListPtr children, node_t * node)
node_t           1186 pengine/clone.c clone_action_flags(action_t * action, node_t * node)
node_t           1268 pengine/clone.c node_t *
node_t           1272 pengine/clone.c     node_t *one = NULL;
node_t           1297 pengine/clone.c             node_t *node = (node_t *) gIter->data;
node_t           1310 pengine/clone.c find_instance_on(resource_t * rsc, node_t * node)
node_t           1324 pengine/clone.c             node_t *known = (node_t *) gIter2->data;
node_t           1338 pengine/clone.c clone_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t           1355 pengine/clone.c         node_t *allowed = g_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node_t           1385 pengine/clone.c             node_t *local_node = NULL;
node_t            751 pengine/constraints.c         node_t *match = pe_find_node(data_set->nodes, node);
node_t            959 pengine/constraints.c get_node_score(const char *rule, const char *score, gboolean raw, node_t * node, resource_t *rsc)
node_t           1060 pengine/constraints.c             node_t *node = (node_t *) gIter->data;
node_t           1068 pengine/constraints.c         node_t *node = (node_t *) gIter->data;
node_t           1081 pengine/constraints.c             node_t *local = pe_find_node_id(match_L, node->details->id);
node_t           1098 pengine/constraints.c             node_t *delete = pe_find_node_id(match_L, node->details->id);
node_t             78 pengine/container.c migration_threshold_reached(resource_t *rsc, node_t *node,
node_t            116 pengine/container.c node_t *
node_t            117 pengine/container.c container_color(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t            344 pengine/container.c find_compatible_tuple_by_node(resource_t * rsc_lh, node_t * candidate, resource_t * rsc,
node_t            375 pengine/container.c     node_t *active_node_lh = NULL;
node_t            386 pengine/container.c         node_t *node = (node_t *) gIter->data;
node_t            487 pengine/container.c             node_t *chosen = tuple->docker->fns->location(tuple->docker, NULL, FALSE);
node_t            503 pengine/container.c container_action_flags(action_t * action, node_t * node)
node_t            533 pengine/container.c find_compatible_child_by_node(resource_t * local_child, node_t * local_node, resource_t * rsc,
node_t            566 pengine/container.c tuple_for_docker(resource_t *rsc, resource_t *docker, node_t *node)
node_t            584 pengine/container.c container_update_interleave_actions(action_t * first, action_t * then, node_t * node, enum pe_action_flags flags,
node_t            742 pengine/container.c container_update_actions(action_t * first, action_t * then, node_t * node, enum pe_action_flags flags,
node_t            859 pengine/container.c container_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t             36 pengine/graph.c get_action_flags(action_t * action, node_t * node)
node_t            185 pengine/graph.c graph_update_action(action_t * first, action_t * then, node_t * node,
node_t            560 pengine/graph.c         node_t *then_node = then->node;
node_t            561 pengine/graph.c         node_t *first_node = first->node;
node_t            642 pengine/graph.c             node_t *node = then->node;
node_t            713 pengine/graph.c shutdown_constraints(node_t * node, action_t * shutdown_op, pe_working_set_t * data_set)
node_t            769 pengine/graph.c stonith_constraints(node_t * node, action_t * stonith_op, pe_working_set_t * data_set)
node_t            780 pengine/graph.c static node_t *
node_t            783 pengine/graph.c     node_t *began_on = NULL;
node_t            784 pengine/graph.c     node_t *ended_on = NULL;
node_t            785 pengine/graph.c     node_t *router_node = NULL;
node_t            867 pengine/graph.c add_node_to_xml(const node_t *node, void *xml)
node_t            889 pengine/graph.c         node_t *node = (node_t *) gIter->data;
node_t           1068 pengine/graph.c         node_t *router_node = get_router_node(action);
node_t             30 pengine/group.c node_t *
node_t             31 pengine/group.c group_color(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t             33 pengine/group.c     node_t *node = NULL;
node_t             34 pengine/group.c     node_t *group_node = NULL;
node_t            374 pengine/group.c group_action_flags(action_t * action, node_t * node)
node_t            415 pengine/group.c group_update_actions(action_t * first, action_t * then, node_t * node, enum pe_action_flags flags,
node_t            162 pengine/master.c static node_t *
node_t            165 pengine/master.c     node_t *node = NULL;
node_t            166 pengine/master.c     node_t *local_node = NULL;
node_t            276 pengine/master.c     node_t *node = NULL;
node_t            277 pengine/master.c     node_t *chosen = NULL;
node_t            308 pengine/master.c         node = (node_t *) pe_hash_table_lookup(rsc->allowed_nodes, chosen->details->id);
node_t            385 pengine/master.c             node = (node_t *) pe_hash_table_lookup(rsc->allowed_nodes, chosen->details->id);
node_t            398 pengine/master.c filter_anonymous_instance(resource_t * rsc, node_t * node)
node_t            451 pengine/master.c lookup_master_score(resource_t * rsc, node_t *node, const char *name)
node_t            465 pengine/master.c master_score(resource_t * rsc, node_t * node, int not_set_value)
node_t            470 pengine/master.c     node_t *match = NULL;
node_t            500 pengine/master.c         node_t *known = pe_hash_table_lookup(rsc->known_on, node->details->id);
node_t            570 pengine/master.c         node_t *node = NULL;
node_t            650 pengine/master.c node_t *
node_t            651 pengine/master.c master_color(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t            658 pengine/master.c     node_t *node = NULL;
node_t            659 pengine/master.c     node_t *chosen = NULL;
node_t            964 pengine/master.c node_hash_update_one(GHashTable * hash, node_t * other, const char *attr, int score)
node_t            967 pengine/master.c     node_t *node = NULL;
node_t           1022 pengine/master.c             node_t *chosen = child_rsc->fns->location(child_rsc, NULL, FALSE);
node_t             42 pengine/native.c void Recurring(resource_t * rsc, action_t * start, node_t * node, pe_working_set_t * data_set);
node_t             43 pengine/native.c void RecurringOp(resource_t * rsc, action_t * start, node_t * node,
node_t             45 pengine/native.c void Recurring_Stopped(resource_t * rsc, action_t * start, node_t * node,
node_t             47 pengine/native.c void RecurringOp_Stopped(resource_t * rsc, action_t * start, node_t * node,
node_t             50 pengine/native.c void ReloadRsc(resource_t * rsc, node_t *node, pe_working_set_t * data_set);
node_t             51 pengine/native.c gboolean DeleteRsc(resource_t * rsc, node_t * node, gboolean optional, pe_working_set_t * data_set);
node_t             52 pengine/native.c gboolean StopRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set);
node_t             53 pengine/native.c gboolean StartRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set);
node_t             54 pengine/native.c gboolean DemoteRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set);
node_t             55 pengine/native.c gboolean PromoteRsc(resource_t * rsc, node_t * next, gboolean optional,
node_t             57 pengine/native.c gboolean RoleError(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set);
node_t             58 pengine/native.c gboolean NullOp(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set);
node_t             71 pengine/native.c gboolean (*rsc_action_matrix[RSC_ROLE_MAX][RSC_ROLE_MAX])(resource_t*,node_t*,gboolean,pe_working_set_t*) = {
node_t             83 pengine/native.c native_choose_node(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t             86 pengine/native.c     node_t *chosen = NULL;
node_t             87 pengine/native.c     node_t *best = NULL;
node_t            161 pengine/native.c             node_t *running = g_list_nth_data(rsc->running_on, 0);
node_t            168 pengine/native.c                     node_t *tmp = (node_t *) iter->data;
node_t            203 pengine/native.c     node_t *node = NULL;
node_t            243 pengine/native.c     node_t *node = NULL;
node_t            413 pengine/native.c         node_t *node = NULL;
node_t            432 pengine/native.c node_t *
node_t            433 pengine/native.c native_color(resource_t * rsc, node_t * prefer, pe_working_set_t * data_set)
node_t            519 pengine/native.c         node_t *assign_to = NULL;
node_t            563 pengine/native.c         node_t *remote_node = pe_find_node(data_set->nodes, rsc->id);
node_t            629 pengine/native.c RecurringOp(resource_t * rsc, action_t * start, node_t * node,
node_t            824 pengine/native.c Recurring(resource_t * rsc, action_t * start, node_t * node, pe_working_set_t * data_set)
node_t            840 pengine/native.c RecurringOp_Stopped(resource_t * rsc, action_t * start, node_t * node,
node_t            933 pengine/native.c         node_t *stop_node = (node_t *) gIter->data;
node_t           1048 pengine/native.c Recurring_Stopped(resource_t * rsc, action_t * start, node_t * node, pe_working_set_t * data_set)
node_t           1064 pengine/native.c handle_migration_actions(resource_t * rsc, node_t *current, node_t *chosen, pe_working_set_t * data_set)
node_t           1144 pengine/native.c     node_t *chosen = NULL;
node_t           1145 pengine/native.c     node_t *current = NULL;
node_t           1174 pengine/native.c         node_t *n = (node_t *) gIter->data;
node_t           1183 pengine/native.c         node_t *current = (node_t *) gIter->data;
node_t           1343 pengine/native.c     node_t *node = NULL;
node_t           1378 pengine/native.c         node_t *node = NULL;
node_t           1430 pengine/native.c         node_t *next = NULL;
node_t           1437 pengine/native.c             node_t *current = (node_t *) gIter->data;
node_t           1494 pengine/native.c             node_t *node = NULL;
node_t           1690 pengine/native.c     node_t *node = NULL;
node_t           1844 pengine/native.c                     node_t *node = (node_t *) gIter->data;
node_t           1876 pengine/native.c native_action_flags(action_t * action, node_t * node)
node_t           1882 pengine/native.c native_update_actions(action_t * first, action_t * then, node_t * node, enum pe_action_flags flags,
node_t           1908 pengine/native.c                    && then->node->details == ((node_t *) then_rsc->running_on->data)->details) {
node_t           2073 pengine/native.c     node_t *node = NULL;
node_t           2104 pengine/native.c         node_t *node = (node_t *) gIter->data;
node_t           2105 pengine/native.c         node_t *other_node = NULL;
node_t           2107 pengine/native.c         other_node = (node_t *) pe_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node_t           2288 pengine/native.c     node_t *next = NULL;
node_t           2289 pengine/native.c     node_t *current = NULL;
node_t           2439 pengine/native.c             node_t *node = (node_t *) gIter->data;
node_t           2488 pengine/native.c StopRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2496 pengine/native.c         node_t *current = (node_t *) gIter->data;
node_t           2540 pengine/native.c StartRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2570 pengine/native.c PromoteRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2616 pengine/native.c DemoteRsc(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2625 pengine/native.c         node_t *current = (node_t *) gIter->data;
node_t           2634 pengine/native.c RoleError(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2643 pengine/native.c NullOp(resource_t * rsc, node_t * next, gboolean optional, pe_working_set_t * data_set)
node_t           2651 pengine/native.c DeleteRsc(resource_t * rsc, node_t * node, gboolean optional, pe_working_set_t * data_set)
node_t           2751 pengine/native.c static node_t *
node_t           2752 pengine/native.c probe_anon_group_member(resource_t *rsc, node_t *node,
node_t           2778 pengine/native.c         node_t *running = NULL;
node_t           2798 pengine/native.c native_create_probe(resource_t * rsc, node_t * node, action_t * complete,
node_t           2804 pengine/native.c     node_t *running = NULL;
node_t           2805 pengine/native.c     node_t *allowed = NULL;
node_t           3056 pengine/native.c     node_t *target;
node_t           3107 pengine/native.c     node_t *target;
node_t           3276 pengine/native.c ReloadRsc(resource_t * rsc, node_t *node, pe_working_set_t * data_set)
node_t             27 pengine/notif.c     node_t *node;
node_t            104 pengine/notif.c         node_t *node = (node_t *) gIter->data;
node_t            237 pengine/notif.c pe_notify(resource_t * rsc, node_t * node, action_t * op, action_t * confirm,
node_t            282 pengine/notif.c pe_post_notify(resource_t * rsc, node_t * node, notify_data_t * n_data, pe_working_set_t * data_set)
node_t            690 pengine/notif.c                 node_t *current_node = (node_t *) gIter->data;
node_t            122 pengine/pengine.h extern gboolean shutdown_constraints(node_t * node, action_t * shutdown_op,
node_t            125 pengine/pengine.h extern gboolean stonith_constraints(node_t * node, action_t * stonith_op,
node_t             34 pengine/utilization.c     const node_t *node1;
node_t             35 pengine/utilization.c     const node_t *node2;
node_t             82 pengine/utilization.c compare_capacity(const node_t * node1, const node_t * node2)
node_t            136 pengine/utilization.c     node_t *node;
node_t            162 pengine/utilization.c have_enough_capacity(node_t * node, const char * rsc_id, GHashTable * utilization)
node_t            340 pengine/utilization.c process_utilization(resource_t * rsc, node_t ** prefer, pe_working_set_t * data_set)
node_t            348 pengine/utilization.c         node_t *node = NULL;
node_t            354 pengine/utilization.c             node_t *most_capable_node = NULL;
node_t             65 pengine/utils.c              node_t * foo_node, pe_working_set_t * data_set)
node_t             97 pengine/utils.c             node_t *copy = node_copy(foo_node);
node_t            111 pengine/utils.c can_run_resources(const node_t * node)
node_t            140 pengine/utils.c     const node_t *node1 = (const node_t *)a;
node_t            141 pengine/utils.c     const node_t *node2 = (const node_t *)b;
node_t            142 pengine/utils.c     const node_t *active = (node_t *) data;
node_t            232 pengine/utils.c         node_t *old = rsc->allocated_to;
node_t            247 pengine/utils.c native_assign_node(resource_t * rsc, GListPtr nodes, node_t * chosen, gboolean force)
node_t            416 pengine/utils.c     node_t *node = NULL;
node_t             27 pengine/utils.h                                    const char *discovery_mode, node_t * node,
node_t             44 pengine/utils.h extern gboolean can_run_resources(const node_t * node);
node_t             45 pengine/utils.h extern gboolean native_assign_node(resource_t * rsc, GListPtr candidates, node_t * chosen,
node_t             55 pengine/utils.h resource_t *find_compatible_child_by_node(resource_t * local_child, node_t * local_node, resource_t * rsc,
node_t             57 pengine/utils.h gboolean is_child_compatible(resource_t *child_rsc, node_t * local_node, enum rsc_role_e filter, gboolean current);
node_t             58 pengine/utils.h bool assign_node(resource_t * rsc, node_t * node, gboolean force);
node_t             59 pengine/utils.h enum pe_action_flags summary_action_flags(action_t * action, GListPtr children, node_t * node);
node_t             73 pengine/utils.h extern int compare_capacity(const node_t * node1, const node_t * node2);
node_t             77 pengine/utils.h extern void process_utilization(resource_t * rsc, node_t ** prefer, pe_working_set_t * data_set);
node_t             59 tools/crm_mon.c static char *get_node_display_name(node_t *node);
node_t            896 tools/crm_mon.c         node_t *node = (node_t *) gIter->data;
node_t           1014 tools/crm_mon.c print_node_start(FILE *stream, node_t *node)
node_t           1246 tools/crm_mon.c print_rsc_history_start(FILE *stream, pe_working_set_t *data_set, node_t *node,
node_t           1412 tools/crm_mon.c print_op_history(FILE *stream, pe_working_set_t *data_set, node_t *node,
node_t           1510 tools/crm_mon.c print_rsc_history(FILE *stream, pe_working_set_t *data_set, node_t *node,
node_t           1585 tools/crm_mon.c     node_t *node = pe_find_node_id(data_set->nodes, ID(node_state));
node_t           1620 tools/crm_mon.c print_attr_msg(FILE *stream, node_t * node, GListPtr rsc_list, const char *attrname, const char *attrvalue)
node_t           1723 tools/crm_mon.c     node_t *node;
node_t           1945 tools/crm_mon.c get_node_display_name(node_t *node)
node_t           1961 tools/crm_mon.c             node_t *host_node = (node_t *) node->details->remote_rsc->running_on->data;
node_t           2010 tools/crm_mon.c static void print_ban(FILE *stream, node_t *node, rsc_to_node_t *location)
node_t           2083 tools/crm_mon.c             node_t *node = (node_t *) gIter2->data;
node_t           2165 tools/crm_mon.c         data.node = (node_t *) gIter->data;
node_t           2403 tools/crm_mon.c     node_t *dc = data_set->dc_node;
node_t           2937 tools/crm_mon.c         node_t *node = (node_t *) gIter->data;
node_t           3110 tools/crm_mon.c         node_t *node = (node_t *) gIter->data;
node_t           3239 tools/crm_mon.c         node_t *node = (node_t *) gIter->data;
node_t            975 tools/crm_resource.c         node_t *dest = NULL;
node_t            989 tools/crm_resource.c         node_t *dest = NULL;
node_t           1008 tools/crm_resource.c         node_t *dest = pe_find_node(data_set.nodes, host_uname);
node_t           1020 tools/crm_resource.c             node_t *current = rsc->running_on->data;
node_t           1026 tools/crm_resource.c             node_t *current = NULL;
node_t           1164 tools/crm_resource.c             node_t *node = pe_find_node(data_set.nodes, host_uname);
node_t            101 tools/crm_resource.h                       node_t *node);
node_t             71 tools/crm_resource_ban.c             node_t *target = n->data;
node_t            224 tools/crm_resource_ban.c             node_t *target = n->data;
node_t             94 tools/crm_resource_print.c         node_t *tmp = rsc->running_on->data;
node_t            223 tools/crm_resource_print.c             node_t *node = (node_t *) lpc2->data;
node_t            318 tools/crm_resource_print.c     node_t *current = NULL;
node_t             35 tools/crm_resource_runtime.c         node_t *node = (node_t *) lpc->data;
node_t            473 tools/crm_resource_runtime.c         node_t *node = pe_find_node(data_set->nodes, host_uname);
node_t            567 tools/crm_resource_runtime.c     node_t *node = NULL;
node_t            611 tools/crm_resource_runtime.c             node = (node_t *) lpc->data;
node_t           1622 tools/crm_resource_runtime.c     node_t *current = NULL;
node_t           1623 tools/crm_resource_runtime.c     node_t *dest = pe_find_node(data_set->nodes, host_name);
node_t           1758 tools/crm_resource_runtime.c cli_resource_why_without_rsc_with_host(cib_t *cib_conn,GListPtr resources,node_t *node)
node_t           1797 tools/crm_resource_runtime.c                       node_t *node)
node_t             96 tools/crm_simulate.c         node_t *node = (node_t *) gIter->data;