node              137 daemons/attrd/attrd_alerts.c attrd_send_attribute_alert(const char *node, int nodeid,
node              144 daemons/attrd/attrd_alerts.c                                      node, nodeid, attr, value);
node              171 daemons/attrd/attrd_ipc.c             crm_node_t *node = pcmk__search_cluster_node_cache(nodeid, NULL);
node              174 daemons/attrd/attrd_ipc.c             if (node && node->uname) {
node              176 daemons/attrd/attrd_ipc.c                 host = node->uname;
node              250 daemons/attrd/attrd_messages.c attrd_send_message(crm_node_t * node, xmlNode * data)
node              255 daemons/attrd/attrd_messages.c     return send_cluster_message(node, crm_msg_attrd, data, TRUE);
node              100 daemons/attrd/pacemaker-attrd.h int attrd_send_attribute_alert(const char *node, int nodeid,
node              164 daemons/attrd/pacemaker-attrd.h gboolean attrd_send_message(crm_node_t * node, xmlNode * data);
node              278 daemons/based/pacemaker-based.c cib_peer_update_callback(enum crm_status_type type, crm_node_t * node, const void *data)
node              283 daemons/based/pacemaker-based.c                 && !pcmk_is_set(node->processes, crm_get_cluster_proc())) {
node              287 daemons/based/pacemaker-based.c                 if ((node->processes ^ old) & crm_proc_cpg) {
node              289 daemons/based/pacemaker-based.c                              node->uname);
node               34 daemons/controld/controld_alerts.c crmd_alert_node_event(crm_node_t *node)
node               48 daemons/controld/controld_alerts.c                          node->uname, node->id, node->state);
node               73 daemons/controld/controld_alerts.c crmd_alert_resource_op(const char *node, lrmd_event_data_t * op)
node               86 daemons/controld/controld_alerts.c     lrmd_send_resource_alert((lrmd_t *) lrm_state->conn, crmd_alert_list, node,
node               18 daemons/controld/controld_alerts.h void crmd_alert_node_event(crm_node_t *node);
node               20 daemons/controld/controld_alerts.h void crmd_alert_resource_op(const char *node, lrmd_event_data_t *op);
node              315 daemons/controld/controld_based.c controld_delete_resource_history(const char *rsc_id, const char *node,
node              322 daemons/controld/controld_based.c     CRM_CHECK((rsc_id != NULL) && (node != NULL), return EINVAL);
node              324 daemons/controld/controld_based.c     desc = crm_strdup_printf("resource history for %s on %s", rsc_id, node);
node              332 daemons/controld/controld_based.c     xpath = crm_strdup_printf(XPATH_RESOURCE_HISTORY, node, rsc_id);
node              339 daemons/controld/controld_based.c                 CRM_XS " rc=%d", rsc_id, node,
node               80 daemons/controld/controld_callbacks.c node_alive(const crm_node_t *node)
node               82 daemons/controld/controld_callbacks.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node               84 daemons/controld/controld_callbacks.c         return pcmk__str_eq(node->state, CRM_NODE_MEMBER, pcmk__str_casei) ? 1: -1;
node               86 daemons/controld/controld_callbacks.c     } else if (crm_is_peer_active(node)) {
node               90 daemons/controld/controld_callbacks.c     } else if (!pcmk_is_set(node->processes, crm_get_cluster_proc())
node               91 daemons/controld/controld_callbacks.c                && !pcmk__str_eq(node->state, CRM_NODE_MEMBER, pcmk__str_casei)) {
node              105 daemons/controld/controld_callbacks.c peer_update_callback(enum crm_status_type type, crm_node_t * node, const void *data)
node              109 daemons/controld/controld_callbacks.c     bool is_remote = pcmk_is_set(node->flags, crm_remote_node);
node              120 daemons/controld/controld_callbacks.c         && pcmk_is_set(node->processes, crm_get_cluster_proc())
node              129 daemons/controld/controld_callbacks.c         crm_debug("Sending hello to node %u so that it learns our node name", node->id);
node              130 daemons/controld/controld_callbacks.c         send_cluster_message(node, crm_msg_crmd, query, FALSE);
node              135 daemons/controld/controld_callbacks.c     if (node->uname == NULL) {
node              144 daemons/controld/controld_callbacks.c                      node->uname, state_text(node->state));
node              151 daemons/controld/controld_callbacks.c             CRM_CHECK(!pcmk__str_eq(data, node->state, pcmk__str_casei),
node              156 daemons/controld/controld_callbacks.c                      node->uname, state_text(node->state), state_text(data));
node              158 daemons/controld/controld_callbacks.c             if (pcmk__str_eq(CRM_NODE_MEMBER, node->state, pcmk__str_casei)) {
node              161 daemons/controld/controld_callbacks.c                     remove_stonith_cleanup(node->uname);
node              164 daemons/controld/controld_callbacks.c                 controld_remove_voter(node->uname);
node              167 daemons/controld/controld_callbacks.c             crmd_alert_node_event(node);
node              173 daemons/controld/controld_callbacks.c             appeared = pcmk_is_set(node->processes, crm_get_cluster_proc());
node              176 daemons/controld/controld_callbacks.c                      node->uname, (appeared? "now" : "no longer"),
node              178 daemons/controld/controld_callbacks.c                      old, node->processes);
node              180 daemons/controld/controld_callbacks.c             if (!pcmk_is_set((node->processes ^ old), crm_get_cluster_proc())) {
node              185 daemons/controld/controld_callbacks.c                           crm_get_cluster_proc(), old, node->processes);
node              191 daemons/controld/controld_callbacks.c                 controld_remove_voter(node->uname);
node              203 daemons/controld/controld_callbacks.c             if (pcmk__str_eq(node->uname, fsa_our_uname, pcmk__str_casei) && !appeared) {
node              208 daemons/controld/controld_callbacks.c             } else if (pcmk__str_eq(node->uname, fsa_our_dc, pcmk__str_casei) && crm_is_peer_active(node) == FALSE) {
node              222 daemons/controld/controld_callbacks.c                     controld_delete_node_state(node->uname,
node              235 daemons/controld/controld_callbacks.c                     controld_delete_node_state(node->uname,
node              246 daemons/controld/controld_callbacks.c         int alive = node_alive(node);
node              247 daemons/controld/controld_callbacks.c         pcmk__graph_action_t *down = match_down_event(node->uuid);
node              263 daemons/controld/controld_callbacks.c                           (pcmk_is_set(down->flags, pcmk__graph_action_confirmed)? "after" : "before"), node->uname);
node              270 daemons/controld/controld_callbacks.c                     crmd_peer_down(node, FALSE);
node              275 daemons/controld/controld_callbacks.c                              task, node->uname, down->id);
node              278 daemons/controld/controld_callbacks.c                                task, node->uname, down->id);
node              285 daemons/controld/controld_callbacks.c                           node->uname,
node              294 daemons/controld/controld_callbacks.c                          "current DC", node->uname);
node              297 daemons/controld/controld_callbacks.c                          node->uname);
node              300 daemons/controld/controld_callbacks.c                 crm_update_peer_join(__func__, node, crm_join_none);
node              305 daemons/controld/controld_callbacks.c             fail_incompletable_actions(transition_graph, node->uuid);
node              309 daemons/controld/controld_callbacks.c                       node->uname);
node              326 daemons/controld/controld_callbacks.c         update = create_node_state_update(node, flags, NULL, __func__);
node              328 daemons/controld/controld_callbacks.c             crm_debug("Node state update not yet possible for %s", node->uname);
node               21 daemons/controld/controld_callbacks.h extern void peer_update_callback(enum crm_status_type type, crm_node_t * node, const void *data);
node              264 daemons/controld/controld_election.c             crm_node_t *node = crm_get_peer(0, fsa_our_uname);
node              266 daemons/controld/controld_election.c             pcmk__update_peer_expected(__func__, node, CRMD_JOINSTATE_DOWN);
node              267 daemons/controld/controld_election.c             update = create_node_state_update(node, node_update_expected, NULL,
node               36 daemons/controld/controld_join_dc.c crm_update_peer_join(const char *source, crm_node_t * node, enum crm_join_phase phase)
node               40 daemons/controld/controld_join_dc.c     CRM_CHECK(node != NULL, return);
node               43 daemons/controld/controld_join_dc.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node               47 daemons/controld/controld_join_dc.c     last = node->join;
node               52 daemons/controld/controld_join_dc.c                   node->uname, current_join_id, crm_join_phase_str(last),
node               53 daemons/controld/controld_join_dc.c                   node->id, source);
node               56 daemons/controld/controld_join_dc.c         node->join = phase;
node               59 daemons/controld/controld_join_dc.c                  node->uname, current_join_id, crm_join_phase_str(phase),
node               60 daemons/controld/controld_join_dc.c                  crm_join_phase_str(last), node->id, source);
node               65 daemons/controld/controld_join_dc.c                  current_join_id, node->uname, crm_join_phase_str(last),
node               66 daemons/controld/controld_join_dc.c                  crm_join_phase_str(phase), node->id, source);
node               34 daemons/controld/controld_membership.c     crm_node_t *node = value;
node               36 daemons/controld/controld_membership.c     if (crm_is_peer_active(node) == FALSE) {
node               37 daemons/controld/controld_membership.c         crm_update_peer_join(__func__, node, crm_join_none);
node               39 daemons/controld/controld_membership.c         if(node && node->uname) {
node               40 daemons/controld/controld_membership.c             if (pcmk__str_eq(fsa_our_uname, node->uname, pcmk__str_casei)) {
node               44 daemons/controld/controld_membership.c             } else if (AM_I_DC == FALSE && pcmk__str_eq(node->uname, fsa_our_dc, pcmk__str_casei)) {
node               45 daemons/controld/controld_membership.c                 crm_warn("Our DC node (%s) left the cluster", node->uname);
node               53 daemons/controld/controld_membership.c         if(node && node->uuid) {
node               54 daemons/controld/controld_membership.c             fail_incompletable_actions(transition_graph, node->uuid);
node              127 daemons/controld/controld_membership.c create_node_state_update(crm_node_t *node, int flags, xmlNode *parent,
node              133 daemons/controld/controld_membership.c     if (!node->state) {
node              134 daemons/controld/controld_membership.c         crm_info("Node update for %s cancelled: no state, not seen yet", node->uname);
node              140 daemons/controld/controld_membership.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node              144 daemons/controld/controld_membership.c     set_uuid(node_state, XML_ATTR_UUID, node);
node              147 daemons/controld/controld_membership.c         crm_info("Node update for %s cancelled: no id", node->uname);
node              152 daemons/controld/controld_membership.c     crm_xml_add(node_state, XML_ATTR_UNAME, node->uname);
node              154 daemons/controld/controld_membership.c     if ((flags & node_update_cluster) && node->state) {
node              156 daemons/controld/controld_membership.c                                pcmk__str_eq(node->state, CRM_NODE_MEMBER, pcmk__str_casei));
node              159 daemons/controld/controld_membership.c     if (!pcmk_is_set(node->flags, crm_remote_node)) {
node              162 daemons/controld/controld_membership.c             if (pcmk_is_set(node->processes, crm_get_cluster_proc())) {
node              169 daemons/controld/controld_membership.c             if (node->join <= crm_join_none) {
node              178 daemons/controld/controld_membership.c             crm_xml_add(node_state, XML_NODE_EXPECTED, node->expected);
node              227 daemons/controld/controld_membership.c         crm_node_t *node = NULL;
node              242 daemons/controld/controld_membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              243 daemons/controld/controld_membership.c             if (node->uuid
node              244 daemons/controld/controld_membership.c                 && pcmk__str_eq(node->uuid, node_uuid, pcmk__str_casei)
node              245 daemons/controld/controld_membership.c                 && node->uname
node              246 daemons/controld/controld_membership.c                 && pcmk__str_eq(node->uname, node_uname, pcmk__str_casei)) {
node              311 daemons/controld/controld_membership.c         crm_node_t *node = NULL;
node              315 daemons/controld/controld_membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              318 daemons/controld/controld_membership.c             if ((node->uuid != NULL) && (node->uname != NULL)) {
node              319 daemons/controld/controld_membership.c                 crm_trace("Creating node entry for %s/%s", node->uname, node->uuid);
node              328 daemons/controld/controld_membership.c                 crm_xml_add(new_node, XML_ATTR_ID, node->uuid);
node              329 daemons/controld/controld_membership.c                 crm_xml_add(new_node, XML_ATTR_UNAME, node->uname);
node              335 daemons/controld/controld_membership.c                                "[@" XML_ATTR_UNAME "='", node->uname, "']"
node              336 daemons/controld/controld_membership.c                                "[@" XML_ATTR_ID "!='", node->uuid, "']", NULL);
node              342 daemons/controld/controld_membership.c                 fsa_register_cib_callback(call_id, FALSE, strdup(node->uuid),
node              365 daemons/controld/controld_membership.c         crm_node_t *node = NULL;
node              370 daemons/controld/controld_membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              371 daemons/controld/controld_membership.c             create_node_state_update(node, flags, node_list, source);
node              376 daemons/controld/controld_membership.c             while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              377 daemons/controld/controld_membership.c                 create_node_state_update(node, flags, node_list, source);
node              659 daemons/controld/controld_messages.c         const char *node = NULL;
node              668 daemons/controld/controld_messages.c         node = crm_element_value(msg_data, XML_LRM_ATTR_TARGET);
node              671 daemons/controld/controld_messages.c                   "(clearing CIB resource history only)", rsc_id, node,
node              673 daemons/controld/controld_messages.c         rc = controld_delete_resource_history(rsc_id, node, user_name,
node              676 daemons/controld/controld_messages.c             rc = controld_delete_resource_history(rsc_id, node, user_name,
node              793 daemons/controld/controld_messages.c     crm_node_t *node = NULL;
node              800 daemons/controld/controld_messages.c     while (g_hash_table_iter_next(&iter, NULL, (gpointer *) & node)) {
node              803 daemons/controld/controld_messages.c         crm_xml_add_ll(xml, XML_ATTR_ID, (long long) node->id); // uint32_t
node              804 daemons/controld/controld_messages.c         crm_xml_add(xml, XML_ATTR_UNAME, node->uname);
node              805 daemons/controld/controld_messages.c         crm_xml_add(xml, XML_NODE_IN_CLUSTER, node->state);
node              831 daemons/controld/controld_messages.c     crm_node_t *node = NULL;
node              856 daemons/controld/controld_messages.c     node = pcmk__search_node_caches(node_id, value, CRM_GET_PEER_ANY);
node              857 daemons/controld/controld_messages.c     if (node) {
node              858 daemons/controld/controld_messages.c         crm_xml_add_int(reply_data, XML_ATTR_ID, node->id);
node              859 daemons/controld/controld_messages.c         crm_xml_add(reply_data, XML_ATTR_UUID, node->uuid);
node              860 daemons/controld/controld_messages.c         crm_xml_add(reply_data, XML_ATTR_UNAME, node->uname);
node              861 daemons/controld/controld_messages.c         crm_xml_add(reply_data, XML_NODE_IS_PEER, node->state);
node              863 daemons/controld/controld_messages.c                                pcmk_is_set(node->flags, crm_remote_node));
node              980 daemons/controld/controld_messages.c         crm_node_t *node = pcmk__search_cluster_node_cache(0, from);
node              982 daemons/controld/controld_messages.c         pcmk__update_peer_expected(__func__, node, CRMD_JOINSTATE_DOWN);
node              178 daemons/controld/controld_remote_ra.c     crm_node_t *node;
node              207 daemons/controld/controld_remote_ra.c     node = crm_remote_peer_get(node_name);
node              208 daemons/controld/controld_remote_ra.c     CRM_CHECK(node != NULL, return);
node              209 daemons/controld/controld_remote_ra.c     pcmk__update_peer_state(__func__, node, CRM_NODE_MEMBER, 0);
node              220 daemons/controld/controld_remote_ra.c     state = create_node_state_update(node, node_update_cluster, update,
node              261 daemons/controld/controld_remote_ra.c     crm_node_t *node;
node              278 daemons/controld/controld_remote_ra.c     node = crm_remote_peer_get(node_name);
node              279 daemons/controld/controld_remote_ra.c     CRM_CHECK(node != NULL, return);
node              280 daemons/controld/controld_remote_ra.c     pcmk__update_peer_state(__func__, node, CRM_NODE_LOST, 0);
node              287 daemons/controld/controld_remote_ra.c     create_node_state_update(node, node_update_cluster, update, __func__);
node              320 daemons/controld/controld_remote_ra.c         crm_node_t *node = crm_remote_peer_get(cmd->rsc_id);
node              322 daemons/controld/controld_remote_ra.c         CRM_CHECK(node != NULL, return);
node              323 daemons/controld/controld_remote_ra.c         pcmk__update_peer_state(__func__, node, CRM_NODE_MEMBER, 0);
node             1278 daemons/controld/controld_remote_ra.c     crm_node_t *node;
node             1281 daemons/controld/controld_remote_ra.c     node = crm_remote_peer_get(lrm_state->node_name);
node             1282 daemons/controld/controld_remote_ra.c     CRM_CHECK(node != NULL, return);
node             1284 daemons/controld/controld_remote_ra.c     state = create_node_state_update(node, node_update_none, update,
node             1313 daemons/controld/controld_remote_ra.c         xmlNode *node;
node             1316 daemons/controld/controld_remote_ra.c         for (node =
node             1318 daemons/controld/controld_remote_ra.c             node != NULL; node = pcmk__xml_next(node)) {
node             1319 daemons/controld/controld_remote_ra.c             lrm_state_t *lrm_state = lrm_state_find(ID(node));
node             1327 daemons/controld/controld_remote_ra.c                 pcmk__scan_min_int(crm_element_value(node, XML_NODE_IS_MAINTENANCE),
node               53 daemons/controld/controld_te_actions.c         crm_node_t *node = NULL;
node               56 daemons/controld/controld_te_actions.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node               59 daemons/controld/controld_te_actions.c             if (pcmk__str_eq(fsa_our_uname, node->uname, pcmk__str_casei)) {
node               63 daemons/controld/controld_te_actions.c             cmd = create_request(task, pseudo->xml, node->uname,
node               65 daemons/controld/controld_te_actions.c             send_cluster_message(node, crm_msg_crmd, cmd, FALSE);
node              149 daemons/controld/controld_te_callbacks.c             const char *node = get_node_id(rsc_op);
node              151 daemons/controld/controld_te_callbacks.c             process_graph_event(rsc_op, node);
node              179 daemons/controld/controld_te_callbacks.c             const char *node = get_node_id(match);
node              180 daemons/controld/controld_te_callbacks.c             pcmk__graph_action_t *cancelled = get_cancel_action(op_id, node);
node              184 daemons/controld/controld_te_callbacks.c                           (const char *) rsc_op_xpath->str, op_id, node);
node              192 daemons/controld/controld_te_callbacks.c                           op_id, node, cancelled->id);
node              207 daemons/controld/controld_te_callbacks.c process_lrm_resource_diff(xmlNode *lrm_resource, const char *node)
node              211 daemons/controld/controld_te_callbacks.c         process_graph_event(rsc_op, node);
node              221 daemons/controld/controld_te_callbacks.c process_resource_updates(const char *node, xmlNode *xml, xmlNode *change,
node              261 daemons/controld/controld_te_callbacks.c         process_lrm_resource_diff(rsc, node);
node              621 daemons/controld/controld_te_callbacks.c             const char *node = get_node_id(rsc_op);
node              623 daemons/controld/controld_te_callbacks.c             process_graph_event(rsc_op, node);
node               68 daemons/controld/controld_te_events.c                 crm_node_t *node = crm_get_peer(0, router);
node               69 daemons/controld/controld_te_events.c                 if (node) {
node               70 daemons/controld/controld_te_events.c                     router_uuid = node->uuid;
node              195 daemons/controld/controld_te_events.c             fail_pair->node = on_uname;
node              209 daemons/controld/controld_te_events.c         last_pair->node = on_uname;
node              251 daemons/controld/controld_te_events.c get_cancel_action(const char *id, const char *node)
node              273 daemons/controld/controld_te_events.c                 crm_trace("Wrong key %s for %s on %s", task, id, node);
node              278 daemons/controld/controld_te_events.c             if (node && !pcmk__str_eq(target, node, pcmk__str_casei)) {
node              279 daemons/controld/controld_te_events.c                 crm_trace("Wrong node %s for %s on %s", target, id, node);
node              283 daemons/controld/controld_te_events.c             crm_trace("Found %s on %s", id, node);
node               39 daemons/controld/controld_throttle.c     char *node;
node              390 daemons/controld/controld_throttle.c     free(r->node);
node              493 daemons/controld/controld_throttle.c throttle_get_job_limit(const char *node)
node              498 daemons/controld/controld_throttle.c     r = g_hash_table_lookup(throttle_records, node);
node              501 daemons/controld/controld_throttle.c         r->node = strdup(node);
node              504 daemons/controld/controld_throttle.c         crm_trace("Defaulting to local values for unknown node %s", node);
node              506 daemons/controld/controld_throttle.c         g_hash_table_insert(throttle_records, r->node, r);
node              524 daemons/controld/controld_throttle.c             crm_err("Unknown throttle mode %.4x on %s", r->mode, node);
node              545 daemons/controld/controld_throttle.c         r->node = strdup(from);
node              546 daemons/controld/controld_throttle.c         g_hash_table_insert(throttle_records, r->node, r);
node               16 daemons/controld/controld_throttle.h int throttle_get_job_limit(const char *node);
node               18 daemons/controld/controld_transition.h pcmk__graph_action_t *get_cancel_action(const char *id, const char *node);
node              857 daemons/controld/controld_utils.c     xmlNode *node = lrm_rsc_op;
node              859 daemons/controld/controld_utils.c     while (node != NULL && !pcmk__str_eq(XML_CIB_TAG_STATE, TYPE(node), pcmk__str_casei)) {
node              860 daemons/controld/controld_utils.c         node = node->parent;
node              863 daemons/controld/controld_utils.c     CRM_CHECK(node != NULL, return NULL);
node              864 daemons/controld/controld_utils.c     return ID(node);
node               80 daemons/controld/controld_utils.h void crm_update_peer_join(const char *source, crm_node_t * node, enum crm_join_phase phase);
node               81 daemons/controld/controld_utils.h xmlNode *create_node_state_update(crm_node_t *node, int flags,
node              113 daemons/controld/controld_utils.h int controld_delete_resource_history(const char *rsc_id, const char *node,
node              650 daemons/fenced/fenced_commands.c         crm_node_t *node = crm_get_peer(0, cmd->target);
node              652 daemons/fenced/fenced_commands.c         cmd->target_nodeid = node->id;
node             2892 daemons/fenced/fenced_commands.c             crm_node_t *node = NULL;
node             2895 daemons/fenced/fenced_commands.c             node = pcmk__search_known_node_cache(nodeid, NULL, CRM_GET_PEER_ANY);
node             2896 daemons/fenced/fenced_commands.c             if (node != NULL) {
node             2897 daemons/fenced/fenced_commands.c                 host = node->uname;
node              469 daemons/fenced/fenced_history.c             crm_node_t *node;
node              472 daemons/fenced/fenced_history.c             node = pcmk__search_known_node_cache(nodeid, NULL, CRM_GET_PEER_ANY);
node              473 daemons/fenced/fenced_history.c             if (node) {
node              474 daemons/fenced/fenced_history.c                 target = node->uname;
node              844 daemons/fenced/fenced_remote.c topology_matches(const stonith_topology_t *tp, const char *node)
node              848 daemons/fenced/fenced_remote.c     CRM_CHECK(node && tp && tp->target, return FALSE);
node              857 daemons/fenced/fenced_remote.c             if (node_has_attr(node, tp->target_attribute, tp->target_value)) {
node              858 daemons/fenced/fenced_remote.c                 crm_notice("Matched %s with %s by attribute", node, tp->target);
node              870 daemons/fenced/fenced_remote.c                 int status = regexec(&r_patt, node, 0, NULL, 0);
node              874 daemons/fenced/fenced_remote.c                     crm_notice("Matched %s with %s by name", node, tp->target);
node              881 daemons/fenced/fenced_remote.c             crm_trace("Testing %s against %s", node, tp->target);
node              882 daemons/fenced/fenced_remote.c             return pcmk__str_eq(tp->target, node, pcmk__str_casei);
node              887 daemons/fenced/fenced_remote.c     crm_trace("No match for %s with %s", node, tp->target);
node             1212 daemons/fenced/fenced_remote.c         crm_node_t *node;
node             1215 daemons/fenced/fenced_remote.c         node = pcmk__search_known_node_cache(nodeid, NULL, CRM_GET_PEER_ANY);
node             1220 daemons/fenced/fenced_remote.c         if (node && node->uname) {
node             1222 daemons/fenced/fenced_remote.c             op->target = strdup(node->uname);
node              436 daemons/fenced/pacemaker-fenced.c topology_remove_helper(const char *node, int level)
node              444 daemons/fenced/pacemaker-fenced.c     crm_xml_add(data, XML_ATTR_STONITH_TARGET, node);
node              598 daemons/fenced/pacemaker-fenced.c     pe_node_t *node = NULL;
node              602 daemons/fenced/pacemaker-fenced.c         while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node              603 daemons/fenced/pacemaker-fenced.c             if (node && strcmp(node->details->uname, stonith_our_uname) == 0) {
node              606 daemons/fenced/pacemaker-fenced.c             node = NULL;
node              609 daemons/fenced/pacemaker-fenced.c     return node;
node              683 daemons/fenced/pacemaker-fenced.c     pe_node_t *node = NULL;
node              724 daemons/fenced/pacemaker-fenced.c     node = our_node_allowed_for(rsc);
node              729 daemons/fenced/pacemaker-fenced.c     if(node == NULL) {
node              735 daemons/fenced/pacemaker-fenced.c         while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node              736 daemons/fenced/pacemaker-fenced.c             crm_trace("Available: %s = %d", pe__node_name(node), node->weight);
node              741 daemons/fenced/pacemaker-fenced.c     } else if(node->weight < 0 || (parent && parent->weight < 0)) {
node              743 daemons/fenced/pacemaker-fenced.c         int score = (node->weight < 0)? node->weight : parent->weight;
node              761 daemons/fenced/pacemaker-fenced.c         crm_debug("Device %s is allowed on %s: score=%d", rsc->id, stonith_our_uname, node->weight);
node              762 daemons/fenced/pacemaker-fenced.c         rsc_params = pe_rsc_params(rsc, node, data_set);
node              763 daemons/fenced/pacemaker-fenced.c         get_meta_attributes(rsc->meta, rsc, node, data_set);
node              989 daemons/fenced/pacemaker-fenced.c node_has_attr(const char *node, const char *name, const char *value)
node              994 daemons/fenced/pacemaker-fenced.c     CRM_CHECK((local_cib != NULL) && (node != NULL) && (name != NULL)
node             1005 daemons/fenced/pacemaker-fenced.c                    "[@" XML_ATTR_UNAME "='", node, "']/" XML_TAG_ATTR_SETS
node             1027 daemons/fenced/pacemaker-fenced.c node_does_watchdog_fencing(const char *node)
node             1030 daemons/fenced/pacemaker-fenced.c             pcmk__str_in_list(node, stonith_watchdog_targets, pcmk__str_casei));
node             1360 daemons/fenced/pacemaker-fenced.c st_peer_update_callback(enum crm_status_type type, crm_node_t * node, const void *data)
node             1363 daemons/fenced/pacemaker-fenced.c         && !pcmk_is_set(node->flags, crm_remote_node)) {
node             1374 daemons/fenced/pacemaker-fenced.c         crm_debug("Broadcasting our uname because of node %u", node->id);
node              279 daemons/fenced/pacemaker-fenced.h gboolean node_has_attr(const char *node, const char *name, const char *value);
node              281 daemons/fenced/pacemaker-fenced.h gboolean node_does_watchdog_fencing(const char *node);
node              123 include/crm/cluster.h gboolean send_cluster_message(crm_node_t *node, enum crm_ais_msg_types service,
node              140 include/crm/cluster.h gboolean crm_is_peer_active(const crm_node_t * node);
node              154 include/crm/cluster.h gboolean crm_is_corosync_peer_active(const crm_node_t * node);
node              156 include/crm/cluster.h                            gboolean local, crm_node_t * node,
node              162 include/crm/cluster.h const char *crm_peer_uuid(crm_node_t *node);
node              164 include/crm/cluster.h void set_uuid(xmlNode *xml, const char *attr, crm_node_t *node);
node              115 include/crm/cluster/internal.h crm_node_t *pcmk__update_peer_state(const char *source, crm_node_t *node,
node              118 include/crm/cluster/internal.h void pcmk__update_peer_expected(const char *source, crm_node_t *node,
node               73 include/crm/common/internal.h void pcmk__xe_add_node(xmlNode *xml, const char *node, int nodeid);
node               92 include/crm/common/internal.h pcmk__xe_set_bool_attr(xmlNodePtr node, const char *name, bool value);
node              105 include/crm/common/internal.h pcmk__xe_attr_is_true(const xmlNode *node, const char *name);
node              123 include/crm/common/internal.h pcmk__xe_get_bool_attr(const xmlNode *node, const char *name, bool *value);
node              174 include/crm/common/internal.h                            const char *node);
node               28 include/crm/common/ipc_attrd_internal.h     const char *node;
node               69 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_clear_failures(pcmk_ipc_api_t *api, const char *node,
node               87 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_delete(pcmk_ipc_api_t *api, const char *node, const char *name,
node              105 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_purge(pcmk_ipc_api_t *api, const char *node);
node              119 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_query(pcmk_ipc_api_t *api, const char *node, const char *name,
node              137 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_refresh(pcmk_ipc_api_t *api, const char *node);
node              160 include/crm/common/ipc_attrd_internal.h int pcmk__attrd_api_update(pcmk_ipc_api_t *api, const char *node, const char *name,
node               48 include/crm/common/nvpair.h const char *crm_xml_add(xmlNode *node, const char *name, const char *value);
node               49 include/crm/common/nvpair.h const char *crm_xml_replace(xmlNode *node, const char *name, const char *value);
node               50 include/crm/common/nvpair.h const char *crm_xml_add_int(xmlNode *node, const char *name, int value);
node               51 include/crm/common/nvpair.h const char *crm_xml_add_ll(xmlNode *node, const char *name, long long value);
node               52 include/crm/common/nvpair.h const char *crm_xml_add_ms(xmlNode *node, const char *name, guint ms);
node              759 include/crm/common/output_internal.h pcmk__output_xml_add_node(pcmk__output_t *out, xmlNodePtr node);
node               55 include/crm/common/xml.h xmlDoc *getDocPtr(xmlNode * node);
node               47 include/crm/common/xml_compat.h crm_xml_add_boolean(xmlNode *node, const char *name, gboolean value)
node               49 include/crm/common/xml_compat.h     return crm_xml_add(node, name, (value? "true" : "false"));
node              276 include/crm/common/xml_internal.h pcmk__xe_set_propv(xmlNodePtr node, va_list pairs);
node              289 include/crm/common/xml_internal.h pcmk__xe_set_props(xmlNodePtr node, ...)
node              316 include/crm/common/xml_internal.h pcmk__xpath_node_id(const char *xpath, const char *node);
node               80 include/crm/fencing/internal.h xmlNode *create_level_registration_xml(const char *node, const char *pattern,
node              218 include/crm/fencing/internal.h gboolean stonith__watchdog_fencing_enabled_for_node(const char *node);
node              219 include/crm/fencing/internal.h gboolean stonith__watchdog_fencing_enabled_for_node_api(stonith_t *st, const char *node);
node               25 include/crm/lrmd_internal.h                               const char *node, uint32_t nodeid,
node               28 include/crm/lrmd_internal.h                          const char *node, uint32_t nodeid, const char *state);
node               33 include/crm/lrmd_internal.h                              const char *node, lrmd_event_data_t *op);
node               23 include/crm/pengine/complex.h GHashTable *pe_rsc_params(pe_resource_t *rsc, const pe_node_t *node,
node               26 include/crm/pengine/complex.h                          pe_node_t *node, pe_working_set_t *data_set);
node               28 include/crm/pengine/complex.h                         const pe_node_t *node, pe_working_set_t *data_set);
node              240 include/crm/pengine/internal.h bool pe_can_fence(pe_working_set_t *data_set, pe_node_t *node);
node              244 include/crm/pengine/internal.h char *native_parameter(pe_resource_t * rsc, pe_node_t * node, gboolean create, const char *name,
node              252 include/crm/pengine/internal.h void native_add_running(pe_resource_t * rsc, pe_node_t * node, pe_working_set_t * data_set, gboolean failed);
node              259 include/crm/pengine/internal.h pe_resource_t *native_find_rsc(pe_resource_t *rsc, const char *id, const pe_node_t *node,
node              283 include/crm/pengine/internal.h gchar * pcmk__native_output_string(pe_resource_t *rsc, const char *name, pe_node_t *node,
node              288 include/crm/pengine/internal.h char *pe__node_display_name(pe_node_t *node, bool print_detail);
node              349 include/crm/pengine/internal.h int pe_get_failcount(pe_node_t *node, pe_resource_t *rsc, time_t *last_failure,
node              353 include/crm/pengine/internal.h pe_action_t *pe__clear_failcount(pe_resource_t *rsc, pe_node_t *node,
node              405 include/crm/pengine/internal.h #  define delete_action(rsc, node, optional) custom_action(		\
node              406 include/crm/pengine/internal.h 		rsc, delete_key(rsc), CRMD_ACTION_DELETE, node,		\
node              410 include/crm/pengine/internal.h #  define stopped_action(rsc, node, optional) custom_action(		\
node              411 include/crm/pengine/internal.h 		rsc, stopped_key(rsc), CRMD_ACTION_STOPPED, node,	\
node              415 include/crm/pengine/internal.h #  define stop_action(rsc, node, optional) custom_action(			\
node              416 include/crm/pengine/internal.h 		rsc, stop_key(rsc), CRMD_ACTION_STOP, node,		\
node              421 include/crm/pengine/internal.h #  define start_action(rsc, node, optional) custom_action(		\
node              422 include/crm/pengine/internal.h 		rsc, start_key(rsc), CRMD_ACTION_START, node,		\
node              426 include/crm/pengine/internal.h #  define started_action(rsc, node, optional) custom_action(		\
node              427 include/crm/pengine/internal.h 		rsc, started_key(rsc), CRMD_ACTION_STARTED, node,	\
node              431 include/crm/pengine/internal.h #  define promote_action(rsc, node, optional) custom_action(		\
node              432 include/crm/pengine/internal.h 		rsc, promote_key(rsc), CRMD_ACTION_PROMOTE, node,	\
node              436 include/crm/pengine/internal.h #  define promoted_action(rsc, node, optional) custom_action(		\
node              437 include/crm/pengine/internal.h 		rsc, promoted_key(rsc), CRMD_ACTION_PROMOTED, node,	\
node              441 include/crm/pengine/internal.h #  define demote_action(rsc, node, optional) custom_action(		\
node              442 include/crm/pengine/internal.h 		rsc, demote_key(rsc), CRMD_ACTION_DEMOTE, node,		\
node              446 include/crm/pengine/internal.h #  define demoted_action(rsc, node, optional) custom_action(		\
node              447 include/crm/pengine/internal.h 		rsc, demoted_key(rsc), CRMD_ACTION_DEMOTED, node,	\
node              461 include/crm/pengine/internal.h GList *pe__resource_actions(const pe_resource_t *rsc, const pe_node_t *node,
node              466 include/crm/pengine/internal.h extern void resource_location(pe_resource_t * rsc, pe_node_t * node, int score, const char *tag,
node              527 include/crm/pengine/internal.h                                          guint *interval_ms, pe_node_t *node,
node              534 include/crm/pengine/internal.h op_digest_cache_t *rsc_action_digest_cmp(pe_resource_t * rsc, xmlNode * xml_op, pe_node_t * node,
node              537 include/crm/pengine/internal.h pe_action_t *pe_fence_op(pe_node_t * node, const char *op, bool optional, const char *reason, bool priority_delay, pe_working_set_t * data_set);
node              539 include/crm/pengine/internal.h     pe_resource_t * rsc, pe_node_t *node, const char *reason, pe_action_t *dependency, pe_working_set_t * data_set);
node              555 include/crm/pengine/internal.h void pe_fence_node(pe_working_set_t * data_set, pe_node_t * node, const char *reason, bool priority_delay);
node              562 include/crm/pengine/internal.h                   pe_node_t *node, long options, void *print_data);
node              563 include/crm/pengine/internal.h int pe__common_output_text(pcmk__output_t *out, pe_resource_t * rsc, const char *name, pe_node_t *node, unsigned int options);
node              564 include/crm/pengine/internal.h int pe__common_output_html(pcmk__output_t *out, pe_resource_t * rsc, const char *name, pe_node_t *node, unsigned int options);
node              566 include/crm/pengine/internal.h                                        const pe_node_t *node);
node              572 include/crm/pengine/internal.h const char *pe_node_attribute_calculated(const pe_node_t *node,
node              575 include/crm/pengine/internal.h const char *pe_node_attribute_raw(const pe_node_t *node, const char *name);
node              578 include/crm/pengine/internal.h void pe__add_param_check(xmlNode *rsc_op, pe_resource_t *rsc, pe_node_t *node,
node              586 include/crm/pengine/internal.h bool pe__shutdown_requested(pe_node_t *node);
node              603 include/crm/pengine/internal.h pe_action_t *pe__clear_resource_history(pe_resource_t *rsc, pe_node_t *node,
node              609 include/crm/pengine/internal.h bool pe__uname_has_tag(pe_working_set_t *data_set, const char *node, const char *tag);
node              627 include/crm/pengine/internal.h int pe__sum_node_health_scores(const pe_node_t *node, int base_health);
node              628 include/crm/pengine/internal.h int pe__node_health(pe_node_t *node);
node              654 include/crm/pengine/internal.h pe__node_name(const pe_node_t *node)
node              656 include/crm/pengine/internal.h     if (node == NULL) {
node              659 include/crm/pengine/internal.h     } else if (node->details->uname != NULL) {
node              660 include/crm/pengine/internal.h         return node->details->uname;
node              662 include/crm/pengine/internal.h     } else if (node->details->id != NULL) {
node              663 include/crm/pengine/internal.h         return node->details->id;
node               47 include/crm/pengine/pe_types.h                                 const pe_node_t *node, int flags);
node              407 include/crm/pengine/pe_types.h     pe_node_t *node;
node               22 include/crm/pengine/remote_internal.h bool pe__is_remote_node(const pe_node_t *node);
node               23 include/crm/pengine/remote_internal.h bool pe__is_guest_node(const pe_node_t *node);
node               24 include/crm/pengine/remote_internal.h bool pe__is_guest_or_remote_node(const pe_node_t *node);
node               25 include/crm/pengine/remote_internal.h bool pe__is_bundle_node(const pe_node_t *node);
node               43 include/crm/pengine/status.h GList *find_operations(const char *rsc, const char *node, gboolean active_filter,
node              223 include/crm/stonith-ng.h     int (*remove_level)(stonith_t *st, int options, const char *node,
node              238 include/crm/stonith-ng.h     int (*register_level)(stonith_t *st, int options, const char *node,
node              359 include/crm/stonith-ng.h     int (*fence)(stonith_t *stonith, int call_options, const char *node,
node              385 include/crm/stonith-ng.h     int (*history)(stonith_t *stonith, int call_options, const char *node,
node              468 include/crm/stonith-ng.h                              const char *node, const char *pattern,
node              495 include/crm/stonith-ng.h                                const char *node, const char *pattern,
node              543 include/crm/stonith-ng.h                             const char *node, const char *action, int timeout,
node              139 include/pacemaker.h                           pe_node_t *node, GHashTable *overrides,
node               18 include/pcmki/pcmki_resource.h                            pe_node_t *node, GHashTable *overrides);
node               24 include/pcmki/pcmki_sched_allocate.h bool pcmk__bundle_create_probe(pe_resource_t *rsc, pe_node_t *node);
node               28 include/pcmki/pcmki_sched_allocate.h                                                const pe_node_t *node);
node               40 include/pcmki/pcmki_sched_allocate.h                                         const pe_node_t *node);
node               42 include/pcmki/pcmki_sched_allocate.h bool clone_create_probe(pe_resource_t *rsc, pe_node_t *node);
node               51 include/pcmki/pcmki_sched_allocate.h                                     const pe_node_t *node, uint32_t flags,
node               39 include/pcmki/pcmki_sched_utils.h                                           const pe_node_t *node);
node               45 include/pcmki/pcmki_sched_utils.h                                  const char *node, const char *origin);
node              133 lib/cluster/cluster.c send_cluster_message(crm_node_t *node, enum crm_ais_msg_types service,
node              139 lib/cluster/cluster.c             return pcmk__cpg_send_xml(data, node, service);
node              224 lib/cluster/cluster.c     crm_node_t *node = NULL;
node              235 lib/cluster/cluster.c     while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              236 lib/cluster/cluster.c         if (pcmk__str_eq(node->uuid, uuid, pcmk__str_casei)) {
node              237 lib/cluster/cluster.c             if (node->uname != NULL) {
node              238 lib/cluster/cluster.c                 return node->uname;
node              243 lib/cluster/cluster.c     node = NULL;
node              255 lib/cluster/cluster.c         node = pcmk__search_cluster_node_cache((uint32_t) id, NULL);
node              256 lib/cluster/cluster.c         if (node != NULL) {
node              258 lib/cluster/cluster.c                      node->uname, node->id, uuid);
node              259 lib/cluster/cluster.c             node->uuid = strdup(uuid);
node              260 lib/cluster/cluster.c             return node->uname;
node              277 lib/cluster/cluster.c set_uuid(xmlNode *xml, const char *attr, crm_node_t *node)
node              279 lib/cluster/cluster.c     crm_xml_add(xml, attr, crm_peer_uuid(node));
node               55 lib/cluster/corosync.c pcmk__corosync_uuid(crm_node_t *node)
node               57 lib/cluster/corosync.c     if ((node != NULL) && is_corosync_cluster()) {
node               58 lib/cluster/corosync.c         if (node->id > 0) {
node               59 lib/cluster/corosync.c             return crm_strdup_printf("%u", node->id);
node               61 lib/cluster/corosync.c             crm_info("Node %s is not yet known by Corosync", node->uname);
node              272 lib/cluster/corosync.c     crm_node_t *node = NULL;
node              301 lib/cluster/corosync.c     while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              302 lib/cluster/corosync.c         node->last_seen = 0;
node              312 lib/cluster/corosync.c         node = crm_get_peer(id, NULL);
node              313 lib/cluster/corosync.c         if (node->uname == NULL) {
node              317 lib/cluster/corosync.c             node = crm_get_peer(id, name);
node              322 lib/cluster/corosync.c         pcmk__update_peer_state(__func__, node, CRM_NODE_MEMBER, ring_id);
node              531 lib/cluster/corosync.c crm_is_corosync_peer_active(const crm_node_t *node)
node              533 lib/cluster/corosync.c     if (node == NULL) {
node              537 lib/cluster/corosync.c     } else if (!pcmk__str_eq(node->state, CRM_NODE_MEMBER, pcmk__str_casei)) {
node              539 lib/cluster/corosync.c                   node->uname, node->state);
node              542 lib/cluster/corosync.c     } else if (!pcmk_is_set(node->processes, crm_proc_cpg)) {
node              544 lib/cluster/corosync.c                   node->uname, node->processes);
node              627 lib/cluster/corosync.c             crm_node_t *node = NULL;
node              630 lib/cluster/corosync.c             while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              631 lib/cluster/corosync.c                 if(node && node->uname && strcasecmp(node->uname, name) == 0) {
node              632 lib/cluster/corosync.c                     if (node->id && node->id != nodeid) {
node              633 lib/cluster/corosync.c                         crm_crit("Nodes %u and %u share the same name '%s': shutting down", node->id,
node              650 lib/cluster/corosync.c                 xmlNode *node = create_xml_node(xml_parent, XML_CIB_TAG_NODE);
node              652 lib/cluster/corosync.c                 crm_xml_set_id(node, "%u", nodeid);
node              653 lib/cluster/corosync.c                 crm_xml_add(node, XML_ATTR_UNAME, name);
node              892 lib/cluster/cpg.c pcmk__cpg_send_xml(xmlNode *msg, crm_node_t *node, enum crm_ais_msg_types dest)
node              898 lib/cluster/cpg.c     rc = send_cluster_text(crm_class_cluster, data, FALSE, node, dest);
node              917 lib/cluster/cpg.c                   gboolean local, crm_node_t *node, enum crm_ais_msg_types dest)
node              968 lib/cluster/cpg.c     if (node) {
node              969 lib/cluster/cpg.c         if (node->uname) {
node              970 lib/cluster/cpg.c             target = strdup(node->uname);
node              971 lib/cluster/cpg.c             msg->host.size = strlen(node->uname);
node              973 lib/cluster/cpg.c             memcpy(msg->host.uname, node->uname, msg->host.size);
node              975 lib/cluster/cpg.c             target = crm_strdup_printf("%u", node->id);
node              977 lib/cluster/cpg.c         msg->host.id = node->id;
node               44 lib/cluster/crmcluster_private.h gboolean pcmk__cpg_send_xml(xmlNode *msg, crm_node_t *node,
node              368 lib/cluster/election.c             const crm_node_t *node;
node              373 lib/cluster/election.c             while (g_hash_table_iter_next(&gIter, NULL, (gpointer *) & node)) {
node              374 lib/cluster/election.c                 if (crm_is_peer_active(node)) {
node              375 lib/cluster/election.c                     crm_warn("* expected vote: %s", node->uname);
node               84 lib/cluster/membership.c static void update_peer_uname(crm_node_t *node, const char *uname);
node              109 lib/cluster/membership.c     crm_node_t *node;
node              117 lib/cluster/membership.c     node = g_hash_table_lookup(crm_remote_peer_cache, node_name);
node              118 lib/cluster/membership.c     if (node) {
node              119 lib/cluster/membership.c         return node;
node              123 lib/cluster/membership.c     node = calloc(1, sizeof(crm_node_t));
node              124 lib/cluster/membership.c     if (node == NULL) {
node              129 lib/cluster/membership.c     set_peer_flags(node, crm_remote_node);
node              130 lib/cluster/membership.c     node->uuid = strdup(node_name);
node              131 lib/cluster/membership.c     if (node->uuid == NULL) {
node              132 lib/cluster/membership.c         free(node);
node              138 lib/cluster/membership.c     g_hash_table_replace(crm_remote_peer_cache, node->uuid, node);
node              142 lib/cluster/membership.c     update_peer_uname(node, node_name);
node              143 lib/cluster/membership.c     return node;
node              196 lib/cluster/membership.c     crm_node_t *node;
node              206 lib/cluster/membership.c     node = g_hash_table_lookup(crm_remote_peer_cache, remote);
node              208 lib/cluster/membership.c     if (node == NULL) {
node              210 lib/cluster/membership.c         node = crm_remote_peer_get(remote);
node              211 lib/cluster/membership.c         CRM_ASSERT(node);
node              213 lib/cluster/membership.c             pcmk__update_peer_state(__func__, node, state, 0);
node              216 lib/cluster/membership.c     } else if (pcmk_is_set(node->flags, crm_node_dirty)) {
node              218 lib/cluster/membership.c         clear_peer_flags(node, crm_node_dirty);
node              220 lib/cluster/membership.c             pcmk__update_peer_state(__func__, node, state, 0);
node              281 lib/cluster/membership.c crm_is_peer_active(const crm_node_t * node)
node              283 lib/cluster/membership.c     if(node == NULL) {
node              287 lib/cluster/membership.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node              294 lib/cluster/membership.c         return crm_is_corosync_peer_active(node);
node              304 lib/cluster/membership.c     crm_node_t *node = value;
node              310 lib/cluster/membership.c     } else if (search->id && node->id != search->id) {
node              313 lib/cluster/membership.c     } else if (search->id == 0 && !pcmk__str_eq(node->uname, search->uname, pcmk__str_casei)) {
node              318 lib/cluster/membership.c                  (node->uname? node->uname : "unknown"), node->id);
node              366 lib/cluster/membership.c     crm_node_t *node = value;
node              368 lib/cluster/membership.c     if (crm_is_peer_active(node)) {
node              387 lib/cluster/membership.c     crm_node_t *node = data;
node              389 lib/cluster/membership.c     crm_trace("Destroying entry for node %u: %s", node->id, node->uname);
node              391 lib/cluster/membership.c     free(node->uname);
node              392 lib/cluster/membership.c     free(node->state);
node              393 lib/cluster/membership.c     free(node->uuid);
node              394 lib/cluster/membership.c     free(node->expected);
node              395 lib/cluster/membership.c     free(node);
node              479 lib/cluster/membership.c     crm_node_t *node = NULL;
node              482 lib/cluster/membership.c     while (g_hash_table_iter_next(&iter, (gpointer *) &id, (gpointer *) &node)) {
node              483 lib/cluster/membership.c         do_crm_log(level, "%s: Node %u/%s = %p - %s", caller, node->id, node->uname, node, id);
node              506 lib/cluster/membership.c     crm_node_t *node = NULL;
node              513 lib/cluster/membership.c         node = g_hash_table_lookup(crm_remote_peer_cache, uname);
node              516 lib/cluster/membership.c     if ((node == NULL) && pcmk_is_set(flags, CRM_GET_PEER_CLUSTER)) {
node              517 lib/cluster/membership.c         node = pcmk__search_cluster_node_cache(id, uname);
node              519 lib/cluster/membership.c     return node;
node              534 lib/cluster/membership.c     crm_node_t *node = NULL;
node              541 lib/cluster/membership.c         node = g_hash_table_lookup(crm_remote_peer_cache, uname);
node              544 lib/cluster/membership.c     if ((node == NULL) && pcmk_is_set(flags, CRM_GET_PEER_CLUSTER)) {
node              545 lib/cluster/membership.c         node = crm_get_peer(id, uname);
node              547 lib/cluster/membership.c     return node;
node              563 lib/cluster/membership.c     crm_node_t *node = NULL;
node              573 lib/cluster/membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              574 lib/cluster/membership.c             if(node->uname && strcasecmp(node->uname, uname) == 0) {
node              575 lib/cluster/membership.c                 crm_trace("Name match: %s = %p", node->uname, node);
node              576 lib/cluster/membership.c                 by_name = node;
node              584 lib/cluster/membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node              585 lib/cluster/membership.c             if(node->id == id) {
node              586 lib/cluster/membership.c                 crm_trace("ID match: %u = %p", node->id, node);
node              587 lib/cluster/membership.c                 by_id = node;
node              593 lib/cluster/membership.c     node = by_id; /* Good default */
node              605 lib/cluster/membership.c             node = NULL; /* Create a new one */
node              608 lib/cluster/membership.c             node = by_name;
node              648 lib/cluster/membership.c     return node;
node              653 lib/cluster/membership.c remove_conflicting_peer(crm_node_t *node)
node              659 lib/cluster/membership.c     if (node->id == 0 || node->uname == NULL) {
node              670 lib/cluster/membership.c             && existing_node->id != node->id
node              672 lib/cluster/membership.c             && strcasecmp(existing_node->uname, node->uname) == 0) {
node              679 lib/cluster/membership.c                      existing_node->id, existing_node->uname, node->id);
node              702 lib/cluster/membership.c     crm_node_t *node = NULL;
node              709 lib/cluster/membership.c     node = pcmk__search_cluster_node_cache(id, uname);
node              713 lib/cluster/membership.c     if ((node == NULL || node->uname == NULL) && (uname == NULL)) { 
node              722 lib/cluster/membership.c         if (node == NULL) {
node              723 lib/cluster/membership.c             node = pcmk__search_cluster_node_cache(id, uname);
node              728 lib/cluster/membership.c     if (node == NULL) {
node              731 lib/cluster/membership.c         node = calloc(1, sizeof(crm_node_t));
node              732 lib/cluster/membership.c         CRM_ASSERT(node);
node              735 lib/cluster/membership.c                  uniqueid, node, uname, id, 1 + g_hash_table_size(crm_peer_cache));
node              736 lib/cluster/membership.c         g_hash_table_replace(crm_peer_cache, uniqueid, node);
node              739 lib/cluster/membership.c     if(id > 0 && uname && (node->id == 0 || node->uname == NULL)) {
node              743 lib/cluster/membership.c     if(id > 0 && node->id == 0) {
node              744 lib/cluster/membership.c         node->id = id;
node              747 lib/cluster/membership.c     if (uname && (node->uname == NULL)) {
node              748 lib/cluster/membership.c         update_peer_uname(node, uname);
node              751 lib/cluster/membership.c     if(node->uuid == NULL) {
node              752 lib/cluster/membership.c         const char *uuid = crm_peer_uuid(node);
node              758 lib/cluster/membership.c             crm_info("Cannot obtain a UUID for node %u/%s", id, node->uname);
node              764 lib/cluster/membership.c     return node;
node              779 lib/cluster/membership.c update_peer_uname(crm_node_t *node, const char *uname)
node              783 lib/cluster/membership.c     CRM_CHECK(node != NULL,
node              787 lib/cluster/membership.c     if (pcmk__str_eq(uname, node->uname, pcmk__str_casei)) {
node              800 lib/cluster/membership.c     pcmk__str_update(&node->uname, uname);
node              803 lib/cluster/membership.c         peer_status_callback(crm_status_uname, node, NULL);
node              807 lib/cluster/membership.c     if (is_corosync_cluster() && !pcmk_is_set(node->flags, crm_remote_node)) {
node              808 lib/cluster/membership.c         remove_conflicting_peer(node);
node              872 lib/cluster/membership.c crm_update_peer_proc(const char *source, crm_node_t * node, uint32_t flag, const char *status)
node              877 lib/cluster/membership.c     CRM_CHECK(node != NULL, crm_err("%s: Could not set %s to %s for NULL",
node              882 lib/cluster/membership.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node              883 lib/cluster/membership.c         return node;
node              886 lib/cluster/membership.c     last = node->processes;
node              888 lib/cluster/membership.c         node->processes = flag;
node              889 lib/cluster/membership.c         if (node->processes != last) {
node              894 lib/cluster/membership.c         if ((node->processes & flag) != flag) {
node              895 lib/cluster/membership.c             node->processes = pcmk__set_flags_as(__func__, __LINE__,
node              897 lib/cluster/membership.c                                                  node->uname, node->processes,
node              902 lib/cluster/membership.c     } else if (node->processes & flag) {
node              903 lib/cluster/membership.c         node->processes = pcmk__clear_flags_as(__func__, __LINE__,
node              905 lib/cluster/membership.c                                                node->uname, node->processes,
node              912 lib/cluster/membership.c             crm_info("%s: Node %s[%u] - all processes are now offline", source, node->uname,
node              913 lib/cluster/membership.c                      node->id);
node              915 lib/cluster/membership.c             crm_info("%s: Node %s[%u] - %s is now %s", source, node->uname, node->id,
node              923 lib/cluster/membership.c             peer_status_callback(crm_status_processes, node, &last);
node              936 lib/cluster/membership.c             if (pcmk_is_set(node->processes, crm_get_cluster_proc())) {
node              941 lib/cluster/membership.c             node = pcmk__update_peer_state(__func__, node, peer_state, 0);
node              944 lib/cluster/membership.c         crm_trace("%s: Node %s[%u] - %s is unchanged (%s)", source, node->uname, node->id,
node              947 lib/cluster/membership.c     return node;
node              959 lib/cluster/membership.c pcmk__update_peer_expected(const char *source, crm_node_t *node,
node              965 lib/cluster/membership.c     CRM_CHECK(node != NULL, crm_err("%s: Could not set 'expected' to %s", source, expected);
node              969 lib/cluster/membership.c     if (pcmk_is_set(node->flags, crm_remote_node)) {
node              973 lib/cluster/membership.c     last = node->expected;
node              974 lib/cluster/membership.c     if (expected != NULL && !pcmk__str_eq(node->expected, expected, pcmk__str_casei)) {
node              975 lib/cluster/membership.c         node->expected = strdup(expected);
node              980 lib/cluster/membership.c         crm_info("%s: Node %s[%u] - expected state is now %s (was %s)", source, node->uname, node->id,
node              984 lib/cluster/membership.c         crm_trace("%s: Node %s[%u] - expected state is unchanged (%s)", source, node->uname,
node              985 lib/cluster/membership.c                   node->id, expected);
node             1006 lib/cluster/membership.c update_peer_state_iter(const char *source, crm_node_t *node, const char *state,
node             1011 lib/cluster/membership.c     CRM_CHECK(node != NULL,
node             1018 lib/cluster/membership.c         node->when_lost = 0;
node             1020 lib/cluster/membership.c             node->last_seen = membership;
node             1024 lib/cluster/membership.c     if (state && !pcmk__str_eq(node->state, state, pcmk__str_casei)) {
node             1025 lib/cluster/membership.c         char *last = node->state;
node             1027 lib/cluster/membership.c         node->state = strdup(state);
node             1029 lib/cluster/membership.c                    " nodeid=%u previous=%s source=%s", node->uname, state,
node             1030 lib/cluster/membership.c                    node->id, (last? last : "unknown"), source);
node             1032 lib/cluster/membership.c             peer_status_callback(crm_status_nstate, node, last);
node             1037 lib/cluster/membership.c             && !pcmk_is_set(node->flags, crm_remote_node)) {
node             1043 lib/cluster/membership.c                 crm_notice("Purged 1 peer with id=%u and/or uname=%s from the membership cache", node->id, node->uname);
node             1047 lib/cluster/membership.c                 reap_crm_member(node->id, node->uname);
node             1049 lib/cluster/membership.c             node = NULL;
node             1054 lib/cluster/membership.c                   " nodeid=%u source=%s", node->uname, state, node->id, source);
node             1056 lib/cluster/membership.c     return node;
node             1075 lib/cluster/membership.c pcmk__update_peer_state(const char *source, crm_node_t *node,
node             1078 lib/cluster/membership.c     return update_peer_state_iter(source, node, state, membership, NULL);
node             1091 lib/cluster/membership.c     crm_node_t *node = NULL;
node             1095 lib/cluster/membership.c     while (g_hash_table_iter_next(&iter, NULL, (gpointer *)&node)) {
node             1096 lib/cluster/membership.c         if (node->last_seen != membership) {
node             1097 lib/cluster/membership.c             if (node->state) {
node             1103 lib/cluster/membership.c                 update_peer_state_iter(__func__, node, CRM_NODE_LOST,
node             1108 lib/cluster/membership.c                          node->uname, node->id);
node             1118 lib/cluster/membership.c     crm_node_t *node = NULL;
node             1124 lib/cluster/membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node             1125 lib/cluster/membership.c             if (node->uname && strcasecmp(node->uname, uname) == 0) {
node             1126 lib/cluster/membership.c                 crm_trace("Name match: %s = %p", node->uname, node);
node             1127 lib/cluster/membership.c                 by_name = node;
node             1135 lib/cluster/membership.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node             1136 lib/cluster/membership.c             if(strcasecmp(node->uuid, id) == 0) {
node             1137 lib/cluster/membership.c                 crm_trace("ID match: %s= %p", id, node);
node             1138 lib/cluster/membership.c                 by_id = node;
node             1144 lib/cluster/membership.c     node = by_id; /* Good default */
node             1153 lib/cluster/membership.c             node = NULL;
node             1156 lib/cluster/membership.c             node = by_name;
node             1163 lib/cluster/membership.c             node = NULL;
node             1175 lib/cluster/membership.c         node = by_name;
node             1178 lib/cluster/membership.c         node = NULL;
node             1181 lib/cluster/membership.c     if (node == NULL) {
node             1189 lib/cluster/membership.c     return node;
node             1197 lib/cluster/membership.c     crm_node_t * node =  NULL;
node             1200 lib/cluster/membership.c     node = find_known_node(id, uname);
node             1202 lib/cluster/membership.c     if (node == NULL) {
node             1205 lib/cluster/membership.c         node = calloc(1, sizeof(crm_node_t));
node             1206 lib/cluster/membership.c         CRM_ASSERT(node != NULL);
node             1208 lib/cluster/membership.c         node->uname = strdup(uname);
node             1209 lib/cluster/membership.c         CRM_ASSERT(node->uname != NULL);
node             1211 lib/cluster/membership.c         node->uuid = strdup(id);
node             1212 lib/cluster/membership.c         CRM_ASSERT(node->uuid != NULL);
node             1214 lib/cluster/membership.c         g_hash_table_replace(known_node_cache, uniqueid, node);
node             1216 lib/cluster/membership.c     } else if (pcmk_is_set(node->flags, crm_node_dirty)) {
node             1217 lib/cluster/membership.c         pcmk__str_update(&node->uname, uname);
node             1220 lib/cluster/membership.c         clear_peer_flags(node, crm_node_dirty);
node             1260 lib/cluster/membership.c     crm_node_t *node = NULL;
node             1265 lib/cluster/membership.c     node = pcmk__search_node_caches(id, uname, flags);
node             1267 lib/cluster/membership.c     if (node || !(flags & CRM_GET_PEER_CLUSTER)) {
node             1268 lib/cluster/membership.c         return node;
node             1275 lib/cluster/membership.c     node = find_known_node(id_str, uname);
node             1278 lib/cluster/membership.c     return node;
node               33 lib/common/ipc_attrd.c     for (xmlNode *node = first_named_child(msg_data, XML_CIB_TAG_NODE);
node               34 lib/common/ipc_attrd.c          node != NULL; node = crm_next_same_xml(node)) {
node               39 lib/common/ipc_attrd.c         pair->node = crm_element_value(node, PCMK__XA_ATTR_NODE_NAME);
node               41 lib/common/ipc_attrd.c         pair->value = crm_element_value(node, PCMK__XA_ATTR_VALUE);
node              203 lib/common/ipc_attrd.c pcmk__attrd_api_clear_failures(pcmk_ipc_api_t *api, const char *node,
node              212 lib/common/ipc_attrd.c     const char *target = pcmk__node_attr_target(node);
node              215 lib/common/ipc_attrd.c         node = target;
node              219 lib/common/ipc_attrd.c     pcmk__xe_add_node(request, node, 0);
node              254 lib/common/ipc_attrd.c               (node? node : "all nodes"), pcmk_rc_str(rc), rc);
node              260 lib/common/ipc_attrd.c pcmk__attrd_api_delete(pcmk_ipc_api_t *api, const char *node, const char *name,
node              269 lib/common/ipc_attrd.c     target = pcmk__node_attr_target(node);
node              272 lib/common/ipc_attrd.c         node = target;
node              279 lib/common/ipc_attrd.c     return pcmk__attrd_api_update(api, node, name, NULL, NULL, NULL, NULL, options);
node              283 lib/common/ipc_attrd.c pcmk__attrd_api_purge(pcmk_ipc_api_t *api, const char *node)
node              287 lib/common/ipc_attrd.c     const char *display_host = (node ? node : "localhost");
node              288 lib/common/ipc_attrd.c     const char *target = pcmk__node_attr_target(node);
node              291 lib/common/ipc_attrd.c         node = target;
node              297 lib/common/ipc_attrd.c     pcmk__xe_add_node(request, node, 0);
node              324 lib/common/ipc_attrd.c pcmk__attrd_api_query(pcmk_ipc_api_t *api, const char *node, const char *name,
node              335 lib/common/ipc_attrd.c     target = pcmk__node_attr_target(node);
node              338 lib/common/ipc_attrd.c         node = target;
node              345 lib/common/ipc_attrd.c     pcmk__xe_add_node(request, node, 0);
node              350 lib/common/ipc_attrd.c     if (node) {
node              352 lib/common/ipc_attrd.c                   name, node, pcmk_rc_str(rc), rc);
node              362 lib/common/ipc_attrd.c pcmk__attrd_api_refresh(pcmk_ipc_api_t *api, const char *node)
node              366 lib/common/ipc_attrd.c     const char *display_host = (node ? node : "localhost");
node              367 lib/common/ipc_attrd.c     const char *target = pcmk__node_attr_target(node);
node              370 lib/common/ipc_attrd.c         node = target;
node              376 lib/common/ipc_attrd.c     pcmk__xe_add_node(request, node, 0);
node              415 lib/common/ipc_attrd.c populate_update_op(xmlNode *op, const char *node, const char *name, const char *value,
node              428 lib/common/ipc_attrd.c     pcmk__xe_add_node(op, node, 0);
node              437 lib/common/ipc_attrd.c pcmk__attrd_api_update(pcmk_ipc_api_t *api, const char *node, const char *name,
node              443 lib/common/ipc_attrd.c     const char *display_host = (node ? node : "localhost");
node              450 lib/common/ipc_attrd.c     target = pcmk__node_attr_target(node);
node              453 lib/common/ipc_attrd.c         node = target;
node              457 lib/common/ipc_attrd.c     populate_update_op(request, node, name, value, dampen, set, options);
node              536 lib/common/ipc_attrd.c             target = pcmk__node_attr_target(pair->node);
node              539 lib/common/ipc_attrd.c                 pair->node = target;
node              542 lib/common/ipc_attrd.c             populate_update_op(child, pair->node, pair->name, pair->value, dampen,
node              545 lib/common/ipc_attrd.c             rc = pcmk__attrd_api_update(api, pair->node, pair->name, pair->value,
node              127 lib/common/ipc_controld.c     for (xmlNode *node = first_named_child(msg_data, XML_CIB_TAG_NODE);
node              128 lib/common/ipc_controld.c          node != NULL; node = crm_next_same_xml(node)) {
node              133 lib/common/ipc_controld.c         crm_element_value_ll(node, XML_ATTR_ID, &id_ll);
node              137 lib/common/ipc_controld.c         node_info->uname = crm_element_value(node, XML_ATTR_UNAME);
node              138 lib/common/ipc_controld.c         node_info->state = crm_element_value(node, XML_NODE_IN_CLUSTER);
node              289 lib/common/ipc_controld.c                           const char *node, xmlNode *msg_data)
node              298 lib/common/ipc_controld.c     if ((node == NULL) && !strcmp(op, CRM_OP_PING)) {
node              303 lib/common/ipc_controld.c     return create_request(op, msg_data, node, sys_to,
node               15 lib/common/nodes.c pcmk__xe_add_node(xmlNode *xml, const char *node, int nodeid)
node               17 lib/common/nodes.c     if (node != NULL) {
node               18 lib/common/nodes.c         crm_xml_add(xml, PCMK__XA_ATTR_NODE_NAME, node);
node              323 lib/common/nvpair.c crm_xml_add(xmlNode *node, const char *name, const char *value)
node              328 lib/common/nvpair.c     CRM_CHECK(node != NULL, return NULL);
node              335 lib/common/nvpair.c     if (pcmk__tracking_xml_changes(node, FALSE)) {
node              336 lib/common/nvpair.c         const char *old = crm_element_value(node, name);
node              343 lib/common/nvpair.c     if (dirty && (pcmk__check_acl(node, name, pcmk__xf_acl_create) == FALSE)) {
node              344 lib/common/nvpair.c         crm_trace("Cannot add %s=%s to %s", name, value, node->name);
node              348 lib/common/nvpair.c     attr = xmlSetProp(node, (pcmkXmlStr) name, (pcmkXmlStr) value);
node              368 lib/common/nvpair.c crm_xml_replace(xmlNode *node, const char *name, const char *value)
node              374 lib/common/nvpair.c     CRM_CHECK(node != NULL, return NULL);
node              377 lib/common/nvpair.c     old_value = crm_element_value(node, name);
node              382 lib/common/nvpair.c     if (pcmk__check_acl(node, name, pcmk__xf_acl_write) == FALSE) {
node              384 lib/common/nvpair.c         crm_trace("Cannot replace %s=%s to %s", name, value, node->name);
node              388 lib/common/nvpair.c         xml_remove_prop(node, name);
node              392 lib/common/nvpair.c     if (pcmk__tracking_xml_changes(node, FALSE)) {
node              398 lib/common/nvpair.c     attr = xmlSetProp(node, (pcmkXmlStr) name, (pcmkXmlStr) value);
node              419 lib/common/nvpair.c crm_xml_add_int(xmlNode *node, const char *name, int value)
node              422 lib/common/nvpair.c     const char *added = crm_xml_add(node, name, number);
node              441 lib/common/nvpair.c crm_xml_add_ms(xmlNode *node, const char *name, guint ms)
node              444 lib/common/nvpair.c     const char *added = crm_xml_add(node, name, number);
node              942 lib/common/nvpair.c pcmk__xe_set_bool_attr(xmlNodePtr node, const char *name, bool value)
node              944 lib/common/nvpair.c     crm_xml_add(node, name, value ? XML_BOOLEAN_TRUE : XML_BOOLEAN_FALSE);
node              948 lib/common/nvpair.c pcmk__xe_get_bool_attr(const xmlNode *node, const char *name, bool *value)
node              953 lib/common/nvpair.c     if (node == NULL) {
node              959 lib/common/nvpair.c     xml_value = crm_element_value(node, name);
node              975 lib/common/nvpair.c pcmk__xe_attr_is_true(const xmlNode *node, const char *name)
node              980 lib/common/nvpair.c     rc = pcmk__xe_get_bool_attr(node, name, &value);
node              297 lib/common/operations.c                      const char *node)
node              299 lib/common/operations.c     CRM_CHECK(node != NULL, return NULL);
node              301 lib/common/operations.c                              action_id, transition_id, target_rc, 36, node);
node              282 lib/common/output_html.c     htmlNodePtr node = NULL;
node              286 lib/common/output_html.c     node = pcmk__output_create_html_node(out, "pre", NULL, NULL, buf);
node              287 lib/common/output_html.c     crm_xml_add(node, "lang", "xml");
node              296 lib/common/output_html.c     xmlNodePtr node = NULL;
node              329 lib/common/output_html.c     node = pcmk__output_xml_create_parent(out, "ul", NULL);
node              330 lib/common/output_html.c     g_queue_push_tail(priv->parent_q, node);
node              435 lib/common/output_html.c     htmlNodePtr node = NULL;
node              440 lib/common/output_html.c     node = pcmk__output_create_xml_text_node(out, element_name, text);
node              443 lib/common/output_html.c         crm_xml_add(node, "class", class_name);
node              447 lib/common/output_html.c         crm_xml_add(node, "id", id);
node              450 lib/common/output_html.c     return node;
node              130 lib/common/output_log.c     xmlNodePtr node = NULL;
node              136 lib/common/output_log.c     node = create_xml_node(NULL, name);
node              137 lib/common/output_log.c     xmlNodeSetContent(node, (pcmkXmlStr) buf);
node              138 lib/common/output_log.c     do_crm_log_xml(priv->log_level, name, node);
node              139 lib/common/output_log.c     free(node);
node              250 lib/common/output_text.c     text_list_data_t *node = NULL;
node              255 lib/common/output_text.c     node = g_queue_pop_tail(priv->parent_q);
node              257 lib/common/output_text.c     if (node->singular_noun != NULL && node->plural_noun != NULL) {
node              258 lib/common/output_text.c         if (node->len == 1) {
node              259 lib/common/output_text.c             pcmk__indented_printf(out, "%d %s found\n", node->len, node->singular_noun);
node              261 lib/common/output_text.c             pcmk__indented_printf(out, "%d %s found\n", node->len, node->plural_noun);
node              265 lib/common/output_text.c     free(node);
node              146 lib/common/output_xml.c     xmlNodePtr node = (xmlNodePtr) user_data;
node              147 lib/common/output_xml.c     pcmk_create_xml_text_node(node, "error", str);
node              153 lib/common/output_xml.c     xmlNodePtr node;
node              166 lib/common/output_xml.c         GSList *node = priv->errors;
node              172 lib/common/output_xml.c         while (node != NULL) {
node              173 lib/common/output_xml.c             fprintf(stderr, "%s\n", (char *) node->data);
node              174 lib/common/output_xml.c             node = node->next;
node              179 lib/common/output_xml.c         node = create_xml_node(priv->root, "status");
node              180 lib/common/output_xml.c         pcmk__xe_set_props(node, "code", rc_as_str,
node              185 lib/common/output_xml.c             xmlNodePtr errors_node = create_xml_node(node, "errors");
node              218 lib/common/output_xml.c     xmlNodePtr node, child_node;
node              225 lib/common/output_xml.c     node = pcmk__output_xml_create_parent(out, "command",
node              230 lib/common/output_xml.c         child_node = pcmk_create_xml_text_node(node, "output", proc_stdout);
node              235 lib/common/output_xml.c         child_node = pcmk_create_xml_text_node(node, "output", proc_stderr);
node              239 lib/common/output_xml.c     pcmk__output_xml_add_node(out, node);
node              375 lib/common/output_xml.c         xmlNodePtr node;
node              377 lib/common/output_xml.c         node = g_queue_pop_tail(priv->parent_q);
node              378 lib/common/output_xml.c         buf = crm_strdup_printf("%lu", xmlChildElementCount(node));
node              379 lib/common/output_xml.c         crm_xml_add(node, "count", buf);
node              440 lib/common/output_xml.c     xmlNodePtr node = NULL;
node              445 lib/common/output_xml.c     node = pcmk__output_create_xml_node(out, name, NULL);
node              448 lib/common/output_xml.c     pcmk__xe_set_propv(node, args);
node              451 lib/common/output_xml.c     pcmk__output_xml_push_parent(out, node);
node              452 lib/common/output_xml.c     return node;
node              456 lib/common/output_xml.c pcmk__output_xml_add_node(pcmk__output_t *out, xmlNodePtr node) {
node              460 lib/common/output_xml.c     CRM_ASSERT(node != NULL);
node              465 lib/common/output_xml.c     xmlAddChild(g_queue_peek_tail(priv->parent_q), node);
node              470 lib/common/output_xml.c     xmlNodePtr node = NULL;
node              479 lib/common/output_xml.c     node = create_xml_node(g_queue_peek_tail(priv->parent_q), name);
node              481 lib/common/output_xml.c     pcmk__xe_set_propv(node, args);
node              484 lib/common/output_xml.c     return node;
node              489 lib/common/output_xml.c     xmlNodePtr node = NULL;
node              494 lib/common/output_xml.c     node = pcmk__output_create_xml_node(out, name, NULL);
node              495 lib/common/output_xml.c     xmlNodeSetContent(node, (pcmkXmlStr) content);
node              496 lib/common/output_xml.c     return node;
node               18 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     xmlNode *node = string2xml("<node/>");
node               22 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     assert_false(pcmk__xe_attr_is_true(node, NULL));
node               24 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     free_xml(node);
node               30 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     xmlNode *node = string2xml("<node a=\"true\" b=\"false\"/>");
node               32 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     assert_false(pcmk__xe_attr_is_true(node, "c"));
node               33 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     free_xml(node);
node               39 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     xmlNode *node = string2xml("<node a=\"true\" b=\"false\"/>");
node               41 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     assert_true(pcmk__xe_attr_is_true(node, "a"));
node               42 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     assert_false(pcmk__xe_attr_is_true(node, "b"));
node               44 lib/common/tests/nvpair/pcmk__xe_attr_is_true_test.c     free_xml(node);
node               18 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     xmlNode *node = string2xml("<node/>");
node               23 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, NULL, &value), EINVAL);
node               24 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, "whatever", NULL), EINVAL);
node               26 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     free_xml(node);
node               32 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     xmlNode *node = string2xml("<node a=\"true\" b=\"false\"/>");
node               35 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, "c", &value), ENODATA);
node               36 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     free_xml(node);
node               42 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     xmlNode *node = string2xml("<node a=\"true\" b=\"false\" c=\"blah\"/>");
node               46 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, "a", &value), pcmk_rc_ok);
node               49 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, "b", &value), pcmk_rc_ok);
node               51 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     assert_int_equal(pcmk__xe_get_bool_attr(node, "c", &value), pcmk_rc_unknown_format);
node               53 lib/common/tests/nvpair/pcmk__xe_get_bool_attr_test.c     free_xml(node);
node               19 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     xmlNode *node = string2xml("<node/>");
node               21 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     pcmk__xe_set_bool_attr(node, "a", true);
node               22 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     pcmk__xe_set_bool_attr(node, "b", false);
node               24 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     assert_string_equal(crm_element_value(node, "a"), XML_BOOLEAN_TRUE);
node               25 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     assert_string_equal(crm_element_value(node, "b"), XML_BOOLEAN_FALSE);
node               27 lib/common/tests/nvpair/pcmk__xe_set_bool_attr_test.c     free_xml(node);
node               17 lib/common/tests/operations/pcmk_xe_is_probe_test.c     xmlNode *node = NULL;
node               21 lib/common/tests/operations/pcmk_xe_is_probe_test.c     node = string2xml("<lrm_rsc_op/>");
node               22 lib/common/tests/operations/pcmk_xe_is_probe_test.c     assert_false(pcmk_xe_is_probe(node));
node               23 lib/common/tests/operations/pcmk_xe_is_probe_test.c     free_xml(node);
node               25 lib/common/tests/operations/pcmk_xe_is_probe_test.c     node = string2xml("<lrm_rsc_op operation_key=\"blah\" interval=\"30s\"/>");
node               26 lib/common/tests/operations/pcmk_xe_is_probe_test.c     assert_false(pcmk_xe_is_probe(node));
node               27 lib/common/tests/operations/pcmk_xe_is_probe_test.c     free_xml(node);
node               29 lib/common/tests/operations/pcmk_xe_is_probe_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"30s\"/>");
node               30 lib/common/tests/operations/pcmk_xe_is_probe_test.c     assert_false(pcmk_xe_is_probe(node));
node               31 lib/common/tests/operations/pcmk_xe_is_probe_test.c     free_xml(node);
node               33 lib/common/tests/operations/pcmk_xe_is_probe_test.c     node = string2xml("<lrm_rsc_op operation=\"start\" interval=\"0\"/>");
node               34 lib/common/tests/operations/pcmk_xe_is_probe_test.c     assert_false(pcmk_xe_is_probe(node));
node               35 lib/common/tests/operations/pcmk_xe_is_probe_test.c     free_xml(node);
node               37 lib/common/tests/operations/pcmk_xe_is_probe_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\"/>");
node               38 lib/common/tests/operations/pcmk_xe_is_probe_test.c     assert_true(pcmk_xe_is_probe(node));
node               39 lib/common/tests/operations/pcmk_xe_is_probe_test.c     free_xml(node);
node               16 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     xmlNode *node = NULL;
node               22 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"start\" interval=\"0\"/>");
node               23 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               24 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               29 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     xmlNode *node = NULL;
node               31 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\"/>");
node               32 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               33 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               35 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"\"/>");
node               36 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               37 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               42 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     xmlNode *node = NULL;
node               45 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"3\"/>");
node               46 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               47 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               49 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"3\"/>");
node               50 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               51 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               54 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"0\"/>");
node               55 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               56 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               58 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"2\" op-status=\"0\"/>");
node               59 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               60 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               62 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"0\"/>");
node               63 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               64 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               66 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"6\" op-status=\"0\"/>");
node               67 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               68 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               70 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"7\" op-status=\"0\"/>");
node               71 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               72 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               75 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"7\"/>");
node               76 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               77 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               79 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"7\"/>");
node               80 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               81 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               84 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"4\"/>");
node               85 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               86 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               88 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"2\" op-status=\"4\"/>");
node               89 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               90 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               92 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"4\"/>");
node               93 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node               94 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node               96 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"6\" op-status=\"4\"/>");
node               97 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node               98 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              100 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"7\" op-status=\"4\"/>");
node              101 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              102 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              105 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"5\"/>");
node              106 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              107 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              109 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"2\" op-status=\"5\"/>");
node              110 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node              111 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              113 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"5\"/>");
node              114 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node              115 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              117 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"6\" op-status=\"5\"/>");
node              118 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              119 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              121 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"7\" op-status=\"5\"/>");
node              122 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              123 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              126 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"0\" op-status=\"6\"/>");
node              127 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              128 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              130 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"2\" op-status=\"6\"/>");
node              131 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node              132 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              134 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"5\" op-status=\"6\"/>");
node              135 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_true(pcmk_xe_mask_probe_failure(node));
node              136 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              138 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"6\" op-status=\"6\"/>");
node              139 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              140 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              142 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     node = string2xml("<lrm_rsc_op operation=\"monitor\" interval=\"0\" rc-code=\"7\" op-status=\"6\"/>");
node              143 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     assert_false(pcmk_xe_mask_probe_failure(node));
node              144 lib/common/tests/operations/pcmk_xe_mask_probe_failure_test.c     free_xml(node);
node              212 lib/common/xml.c free_private_data(xmlNode *node)
node              240 lib/common/xml.c     if (node->name == NULL || node->name[0] != ' ') {
node              241 lib/common/xml.c         if (node->_private) {
node              242 lib/common/xml.c             if (node->type == XML_DOCUMENT_NODE) {
node              243 lib/common/xml.c                 reset_xml_private_data(node->_private);
node              245 lib/common/xml.c                 CRM_ASSERT(((xml_node_private_t *) node->_private)->check
node              249 lib/common/xml.c             free(node->_private);
node              250 lib/common/xml.c             node->_private = NULL;
node              257 lib/common/xml.c new_private_data(xmlNode *node)
node              259 lib/common/xml.c     switch (node->type) {
node              267 lib/common/xml.c             node->_private = docpriv;
node              279 lib/common/xml.c             node->_private = nodepriv;
node              280 lib/common/xml.c             if (pcmk__tracking_xml_changes(node, FALSE)) {
node              284 lib/common/xml.c                 mark_xml_node_dirty(node);
node              294 lib/common/xml.c             crm_trace("Ignoring %p %d", node, node->type);
node              295 lib/common/xml.c             CRM_LOG_ASSERT(node->type == XML_ELEMENT_NODE);
node              711 lib/common/xml.c getDocPtr(xmlNode * node)
node              715 lib/common/xml.c     CRM_CHECK(node != NULL, return NULL);
node              717 lib/common/xml.c     doc = node->doc;
node              720 lib/common/xml.c         xmlDocSetRootElement(doc, node);
node              721 lib/common/xml.c         xmlSetTreeDoc(node, doc);
node              752 lib/common/xml.c     xmlNode *node = NULL;
node              761 lib/common/xml.c         node = xmlNewDocRawNode(doc, NULL, (pcmkXmlStr) name, NULL);
node              762 lib/common/xml.c         xmlDocSetRootElement(doc, node);
node              766 lib/common/xml.c         node = xmlNewDocRawNode(doc, NULL, (pcmkXmlStr) name, NULL);
node              767 lib/common/xml.c         xmlAddChild(parent, node);
node              769 lib/common/xml.c     pcmk__mark_xml_created(node);
node              770 lib/common/xml.c     return node;
node              776 lib/common/xml.c     xmlNode *node = create_xml_node(parent, name);
node              778 lib/common/xml.c     if (node != NULL) {
node              779 lib/common/xml.c         xmlNodeSetContent(node, (pcmkXmlStr) content);
node              782 lib/common/xml.c     return node;
node              789 lib/common/xml.c     xmlNode *node = pcmk_create_xml_text_node(parent, element_name, text);
node              792 lib/common/xml.c         crm_xml_add(node, "class", class_name);
node              796 lib/common/xml.c         crm_xml_add(node, "id", id);
node              799 lib/common/xml.c     return node;
node             3085 lib/common/xml.c pcmk__xe_set_propv(xmlNodePtr node, va_list pairs)
node             3097 lib/common/xml.c             crm_xml_add(node, name, value);
node             3103 lib/common/xml.c pcmk__xe_set_props(xmlNodePtr node, ...)
node             3106 lib/common/xml.c     va_start(pairs, node);
node             3107 lib/common/xml.c     pcmk__xe_set_propv(node, pairs);
node             3120 lib/common/xml.c     for (xmlNode *node = children; node != NULL; node = node->next) {
node             3121 lib/common/xml.c         if (node->type == XML_ELEMENT_NODE &&
node             3122 lib/common/xml.c             pcmk__str_eq(child_element_name, (const char *) node->name, pcmk__str_null_matches)) {
node             3123 lib/common/xml.c             int rc = handler(node, userdata);
node              315 lib/common/xpath.c pcmk__xpath_node_id(const char *xpath, const char *node)
node              322 lib/common/xpath.c     if (node == NULL || xpath == NULL) {
node              326 lib/common/xpath.c     patt = crm_strdup_printf("/%s[@id=", node);
node              172 lib/fencing/st_client.c stonith__watchdog_fencing_enabled_for_node_api(stonith_t *st, const char *node)
node              207 lib/fencing/st_client.c                 rv = pcmk__str_in_list(node, targets, pcmk__str_casei);
node              226 lib/fencing/st_client.c               node, rv?"":"not ");
node              231 lib/fencing/st_client.c stonith__watchdog_fencing_enabled_for_node(const char *node)
node              233 lib/fencing/st_client.c     return stonith__watchdog_fencing_enabled_for_node_api(NULL, node);
node              363 lib/fencing/st_client.c                               const char *node, const char *pattern,
node              369 lib/fencing/st_client.c     CRM_CHECK(node || pattern || (attr && value), return -EINVAL);
node              374 lib/fencing/st_client.c     if (node) {
node              375 lib/fencing/st_client.c         crm_xml_add(data, XML_ATTR_STONITH_TARGET, node);
node              393 lib/fencing/st_client.c stonith_api_remove_level(stonith_t * st, int options, const char *node, int level)
node              395 lib/fencing/st_client.c     return stonith_api_remove_level_full(st, options, node,
node              415 lib/fencing/st_client.c create_level_registration_xml(const char *node, const char *pattern,
node              422 lib/fencing/st_client.c     CRM_CHECK(node || pattern || (attr && value), return NULL);
node              431 lib/fencing/st_client.c     if (node) {
node              432 lib/fencing/st_client.c         crm_xml_add(data, XML_ATTR_STONITH_TARGET, node);
node              454 lib/fencing/st_client.c stonith_api_register_level_full(stonith_t *st, int options, const char *node,
node              460 lib/fencing/st_client.c     xmlNode *data = create_level_registration_xml(node, pattern, attr, value,
node              471 lib/fencing/st_client.c stonith_api_register_level(stonith_t * st, int options, const char *node, int level,
node              474 lib/fencing/st_client.c     return stonith_api_register_level_full(st, options, node, NULL, NULL, NULL,
node              661 lib/fencing/st_client.c stonith_api_fence_with_delay(stonith_t * stonith, int call_options, const char *node,
node              668 lib/fencing/st_client.c     crm_xml_add(data, F_STONITH_TARGET, node);
node              681 lib/fencing/st_client.c stonith_api_fence(stonith_t * stonith, int call_options, const char *node, const char *action,
node              684 lib/fencing/st_client.c     return stonith_api_fence_with_delay(stonith, call_options, node, action,
node              696 lib/fencing/st_client.c stonith_api_history(stonith_t * stonith, int call_options, const char *node,
node              706 lib/fencing/st_client.c     if (node) {
node              708 lib/fencing/st_client.c         crm_xml_add(data, F_STONITH_TARGET, node);
node              711 lib/fencing/st_client.c     stonith__set_call_options(call_options, node, st_opt_sync_call);
node              444 lib/fencing/st_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "fence_event",
node              453 lib/fencing/st_output.c             pcmk__xe_set_props(node, "status", "failed",
node              459 lib/fencing/st_output.c             crm_xml_add(node, "status", "success");
node              464 lib/fencing/st_output.c             pcmk__xe_set_props(node, "status", "pending",
node              473 lib/fencing/st_output.c         crm_xml_add(node, "delegate", event->delegate);
node              478 lib/fencing/st_output.c         crm_xml_add(node, "completed", buf);
node              540 lib/fencing/st_output.c     xmlNodePtr node = pcmk__output_create_xml_node(
node              545 lib/fencing/st_output.c         crm_xml_add(node, "device", device);
node              548 lib/fencing/st_output.c     pcmk__output_xml_push_parent(out, node);
node              236 lib/lrmd/lrmd_alerts.c                           const char *node, uint32_t nodeid,
node              246 lib/lrmd/lrmd_alerts.c     params = alert_key2param(params, PCMK__alert_key_node, node);
node              274 lib/lrmd/lrmd_alerts.c                      const char *node, uint32_t nodeid, const char *state)
node              283 lib/lrmd/lrmd_alerts.c     params = alert_key2param(params, PCMK__alert_key_node, node);
node              344 lib/lrmd/lrmd_alerts.c                          const char *node, lrmd_event_data_t *op)
node              366 lib/lrmd/lrmd_alerts.c     params = alert_key2param(params, PCMK__alert_key_node, node);
node               71 lib/lrmd/lrmd_output.c     xmlNodePtr node = pcmk__output_xml_create_parent(out, "agents",
node               76 lib/lrmd/lrmd_output.c         crm_xml_add(node, "provider", provider);
node              103 lib/lrmd/lrmd_output.c     xmlNodePtr node = pcmk__output_xml_create_parent(out, "providers",
node              108 lib/lrmd/lrmd_output.c         crm_xml_add(node, "agent", agent_spec);
node               85 lib/pacemaker/libpacemaker_private.h     bool (*create_probe)(pe_resource_t *rsc, pe_node_t *node);
node              155 lib/pacemaker/libpacemaker_private.h                                          const pe_node_t *node);
node              180 lib/pacemaker/libpacemaker_private.h                                        const pe_node_t *node, uint32_t flags,
node              242 lib/pacemaker/libpacemaker_private.h                                       const pe_node_t *node, uint32_t flags,
node              251 lib/pacemaker/libpacemaker_private.h                                      guint interval_ms, const pe_node_t *node);
node              254 lib/pacemaker/libpacemaker_private.h pe_action_t *pcmk__new_shutdown_action(pe_node_t *node);
node              266 lib/pacemaker/libpacemaker_private.h bool pcmk__check_action_config(pe_resource_t *rsc, pe_node_t *node,
node              281 lib/pacemaker/libpacemaker_private.h                            const pe_node_t *node, const char *reason);
node              285 lib/pacemaker/libpacemaker_private.h                                 guint interval_ms, pe_node_t *node);
node              310 lib/pacemaker/libpacemaker_private.h void pcmk__order_vs_unfence(pe_resource_t *rsc, pe_node_t *node,
node              314 lib/pacemaker/libpacemaker_private.h void pcmk__fence_guest(pe_node_t *node);
node              317 lib/pacemaker/libpacemaker_private.h bool pcmk__node_unfenced(pe_node_t *node);
node              476 lib/pacemaker/libpacemaker_private.h void pcmk__order_stops_before_shutdown(pe_node_t *node,
node              555 lib/pacemaker/libpacemaker_private.h bool pcmk__is_failed_remote_node(pe_node_t *node);
node              561 lib/pacemaker/libpacemaker_private.h bool pcmk__rsc_corresponds_to_guest(pe_resource_t *rsc, pe_node_t *node);
node              586 lib/pacemaker/libpacemaker_private.h                                                   const pe_node_t *node);
node              595 lib/pacemaker/libpacemaker_private.h void pcmk__schedule_cleanup(pe_resource_t *rsc, const pe_node_t *node,
node              632 lib/pacemaker/libpacemaker_private.h                                               const pe_node_t *node);
node              637 lib/pacemaker/libpacemaker_private.h                                             const pe_node_t *node,
node              679 lib/pacemaker/libpacemaker_private.h xmlNode *pcmk__inject_node(cib_t *cib_conn, const char *node, const char *uuid);
node              682 lib/pacemaker/libpacemaker_private.h xmlNode *pcmk__inject_node_state_change(cib_t *cib_conn, const char *node,
node              706 lib/pacemaker/libpacemaker_private.h bool pcmk__node_available(const pe_node_t *node, bool consider_score,
node              723 lib/pacemaker/libpacemaker_private.h                                   const pe_node_t *node);
node              732 lib/pacemaker/libpacemaker_private.h bool pcmk__rsc_agent_changed(pe_resource_t *rsc, pe_node_t *node,
node              753 lib/pacemaker/libpacemaker_private.h bool pcmk__assign_resource(pe_resource_t *rsc, pe_node_t *node, bool force);
node              759 lib/pacemaker/libpacemaker_private.h bool pcmk__threshold_reached(pe_resource_t *rsc, pe_node_t *node,
node              775 lib/pacemaker/libpacemaker_private.h bool pcmk__probe_rsc_on_node(pe_resource_t *rsc, pe_node_t *node);
node              781 lib/pacemaker/libpacemaker_private.h bool pcmk__probe_resource_list(GList *rscs, pe_node_t *node);
node               41 lib/pacemaker/pcmk_fence.c     char *node = NULL;
node               60 lib/pacemaker/pcmk_fence.c         node = target;
node               65 lib/pacemaker/pcmk_fence.c         rc = st->cmds->register_level_full(st, st_opts, node, pattern,
node               69 lib/pacemaker/pcmk_fence.c         rc = st->cmds->remove_level_full(st, st_opts, node, pattern,
node               36 lib/pacemaker/pcmk_graph_producer.c     (((a)->node == NULL)? "no node" : (a)->node->details->uname)
node               64 lib/pacemaker/pcmk_graph_producer.c add_node_to_xml(const pe_node_t *node, void *xml)
node               66 lib/pacemaker/pcmk_graph_producer.c     add_node_to_xml_by_id(node->details->id, (xmlNode *) xml);
node               86 lib/pacemaker/pcmk_graph_producer.c         pe_node_t *node = (pe_node_t *) gIter->data;
node               87 lib/pacemaker/pcmk_graph_producer.c         struct pe_node_shared_s *details = node->details;
node               89 lib/pacemaker/pcmk_graph_producer.c         if (!pe__is_guest_or_remote_node(node)) {
node               96 lib/pacemaker/pcmk_graph_producer.c                     add_node_to_xml_by_id(node->details->id, maintenance),
node              141 lib/pacemaker/pcmk_graph_producer.c     CRM_CHECK(xml && action && action->node && data_set, return);
node              147 lib/pacemaker/pcmk_graph_producer.c         add_node_to_xml_by_id(action->node->details->id, downed);
node              156 lib/pacemaker/pcmk_graph_producer.c             add_node_to_xml_by_id(action->node->details->id, downed);
node              157 lib/pacemaker/pcmk_graph_producer.c             pe_foreach_guest_node(data_set, action->node, add_node_to_xml, downed);
node              225 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(xml, XML_LRM_ATTR_TARGET, action->node->details->uname);
node              226 lib/pacemaker/pcmk_graph_producer.c     crm_xml_add(xml, XML_LRM_ATTR_TARGET_UUID, action->node->details->id);
node              335 lib/pacemaker/pcmk_graph_producer.c     if ((action->rsc != NULL) && (action->node != NULL)) {
node              337 lib/pacemaker/pcmk_graph_producer.c         GHashTable *params = pe_rsc_params(action->rsc, action->node,
node              363 lib/pacemaker/pcmk_graph_producer.c                && (action->node != NULL)) {
node              370 lib/pacemaker/pcmk_graph_producer.c         g_hash_table_foreach(action->node->details->attrs, hash2metafield, args_xml);
node              448 lib/pacemaker/pcmk_graph_producer.c     if (needs_node_info && (action->node != NULL)) {
node              451 lib/pacemaker/pcmk_graph_producer.c                             strdup(action->node->details->uname));
node              453 lib/pacemaker/pcmk_graph_producer.c                             strdup(action->node->details->id));
node              471 lib/pacemaker/pcmk_graph_producer.c     if (needs_node_info && (action->node != NULL)) {
node              535 lib/pacemaker/pcmk_graph_producer.c     if (action->node == NULL) {
node              546 lib/pacemaker/pcmk_graph_producer.c                   action->uuid, action->id, pe__node_name(action->node));
node              548 lib/pacemaker/pcmk_graph_producer.c     } else if (pe__is_guest_node(action->node)
node              549 lib/pacemaker/pcmk_graph_producer.c                && !action->node->details->remote_requires_reset) {
node              552 lib/pacemaker/pcmk_graph_producer.c                   action->uuid, action->id, pe__node_name(action->node));
node              554 lib/pacemaker/pcmk_graph_producer.c     } else if (!action->node->details->online) {
node              561 lib/pacemaker/pcmk_graph_producer.c     } else if (action->node->details->unclean) {
node              654 lib/pacemaker/pcmk_graph_producer.c         pe_node_t *input_node = input->action->node;
node              676 lib/pacemaker/pcmk_graph_producer.c         } else if ((input_node == NULL) || (action->node == NULL)
node              677 lib/pacemaker/pcmk_graph_producer.c                    || (input_node->details != action->node->details)) {
node              682 lib/pacemaker/pcmk_graph_producer.c                       (action->node? action->node->details->uname : "<none>"),
node              697 lib/pacemaker/pcmk_graph_producer.c         if (input->action->node && action->node
node              698 lib/pacemaker/pcmk_graph_producer.c             && (input->action->node->details != action->node->details)) {
node              703 lib/pacemaker/pcmk_graph_producer.c                       pe__node_name(action->node),
node              704 lib/pacemaker/pcmk_graph_producer.c                       pe__node_name(input->action->node));
node              769 lib/pacemaker/pcmk_graph_producer.c                   input->action->node? input->action->node->details->uname : "",
node              771 lib/pacemaker/pcmk_graph_producer.c                   action->node? action->node->details->uname : "",
node              784 lib/pacemaker/pcmk_graph_producer.c                   action->node? action->node->details->uname : "",
node              786 lib/pacemaker/pcmk_graph_producer.c                   init_action->node? init_action->node->details->uname : "");
node              795 lib/pacemaker/pcmk_graph_producer.c               action->node? action->node->details->uname : "",
node              797 lib/pacemaker/pcmk_graph_producer.c               input->action->node? input->action->node->details->uname : "",
node              800 lib/pacemaker/pcmk_graph_producer.c               init_action->node? init_action->node->details->uname : "");
node              819 lib/pacemaker/pcmk_graph_producer.c                   input->action->node? input->action->node->details->uname : "",
node              821 lib/pacemaker/pcmk_graph_producer.c                   action->node? action->node->details->uname : "",
node              900 lib/pacemaker/pcmk_graph_producer.c               ((action->node == NULL)? "" : " on "),
node              901 lib/pacemaker/pcmk_graph_producer.c               ((action->node == NULL)? "" : action->node->details->uname));
node             1053 lib/pacemaker/pcmk_graph_producer.c             && (action->node != NULL)
node             1054 lib/pacemaker/pcmk_graph_producer.c             && action->node->details->shutdown
node             1066 lib/pacemaker/pcmk_graph_producer.c                          action->node->details->unclean? "fence" : "shut down",
node             1067 lib/pacemaker/pcmk_graph_producer.c                          pe__node_name(action->node), action->rsc->id,
node              123 lib/pacemaker/pcmk_injections.c create_node_entry(cib_t *cib_conn, const char *node)
node              126 lib/pacemaker/pcmk_injections.c     char *xpath = crm_strdup_printf(XPATH_NODE_CONFIG, node);
node              134 lib/pacemaker/pcmk_injections.c         crm_xml_add(cib_object, XML_ATTR_ID, node); // Use node name as ID
node              135 lib/pacemaker/pcmk_injections.c         crm_xml_add(cib_object, XML_ATTR_UNAME, node);
node              222 lib/pacemaker/pcmk_injections.c pcmk__inject_node(cib_t *cib_conn, const char *node, const char *uuid)
node              226 lib/pacemaker/pcmk_injections.c     char *xpath = crm_strdup_printf(XPATH_NODE_STATE, node);
node              229 lib/pacemaker/pcmk_injections.c         create_node_entry(cib_conn, node);
node              248 lib/pacemaker/pcmk_injections.c             query_node_uuid(cib_conn, node, &found_uuid, NULL);
node              255 lib/pacemaker/pcmk_injections.c         crm_xml_add(cib_object, XML_ATTR_UNAME, node);
node              263 lib/pacemaker/pcmk_injections.c         crm_trace("Injecting node state for %s (rc=%d)", node, rc);
node              282 lib/pacemaker/pcmk_injections.c pcmk__inject_node_state_change(cib_t *cib_conn, const char *node, bool up)
node              284 lib/pacemaker/pcmk_injections.c     xmlNode *cib_node = pcmk__inject_node(cib_conn, node, NULL);
node              318 lib/pacemaker/pcmk_injections.c     const char *node = crm_element_value(cib_node, XML_ATTR_UNAME);
node              319 lib/pacemaker/pcmk_injections.c     char *xpath = crm_strdup_printf(XPATH_RSC_HISTORY, node, resource);
node              529 lib/pacemaker/pcmk_injections.c     char *node = NULL;
node              546 lib/pacemaker/pcmk_injections.c     node = calloc(1, strlen(spec) + 1);
node              547 lib/pacemaker/pcmk_injections.c     rc = sscanf(spec, "%[^@]@%[^=]=%d", key, node, &outcome);
node              566 lib/pacemaker/pcmk_injections.c     cib_node = pcmk__inject_node(cib, node, NULL);
node              589 lib/pacemaker/pcmk_injections.c     free(node);
node              631 lib/pacemaker/pcmk_injections.c         char *node = (char *) iter->data;
node              633 lib/pacemaker/pcmk_injections.c         out->message(out, "inject-modify-node", "Online", node);
node              635 lib/pacemaker/pcmk_injections.c         cib_node = pcmk__inject_node_state_change(cib, node, true);
node              645 lib/pacemaker/pcmk_injections.c         char *node = (char *) iter->data;
node              648 lib/pacemaker/pcmk_injections.c         out->message(out, "inject-modify-node", "Offline", node);
node              650 lib/pacemaker/pcmk_injections.c         cib_node = pcmk__inject_node_state_change(cib, node, false);
node              659 lib/pacemaker/pcmk_injections.c                                   node, XML_CIB_TAG_LRM);
node              665 lib/pacemaker/pcmk_injections.c                                   node, XML_TAG_TRANSIENT_NODEATTRS);
node              672 lib/pacemaker/pcmk_injections.c         char *node = (char *) iter->data;
node              674 lib/pacemaker/pcmk_injections.c         out->message(out, "inject-modify-node", "Failing", node);
node              676 lib/pacemaker/pcmk_injections.c         cib_node = pcmk__inject_node_state_change(cib, node, true);
node               43 lib/pacemaker/pcmk_output.c     xmlNodePtr node = NULL;
node               45 lib/pacemaker/pcmk_output.c     node = pcmk__output_create_xml_node(out, XML_CONS_TAG_RSC_DEPEND,
node               53 lib/pacemaker/pcmk_output.c         xmlSetProp(node, (pcmkXmlStr) "node-attribute", (pcmkXmlStr) cons->node_attribute);
node               57 lib/pacemaker/pcmk_output.c         xmlSetProp(node, (pcmkXmlStr) "rsc-role",
node               62 lib/pacemaker/pcmk_output.c         xmlSetProp(node, (pcmkXmlStr) "with-rsc-role",
node               80 lib/pacemaker/pcmk_output.c             pe_node_t *node = (pe_node_t *) lpc2->data;
node               87 lib/pacemaker/pcmk_output.c                                          "node", node->details->uname,
node               90 lib/pacemaker/pcmk_output.c                                          "score", pcmk_readable_score(node->weight),
node              529 lib/pacemaker/pcmk_output.c             pe_node_t *node = (pe_node_t *) lpc2->data;
node              533 lib/pacemaker/pcmk_output.c                            pe__node_name(node),
node              534 lib/pacemaker/pcmk_output.c                            pcmk_readable_score(node->weight), cons->id,
node              878 lib/pacemaker/pcmk_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node              899 lib/pacemaker/pcmk_output.c     if ((node != NULL) && (node->details->uname != NULL)) {
node              900 lib/pacemaker/pcmk_output.c         node_desc = node->details->uname;
node              948 lib/pacemaker/pcmk_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node              958 lib/pacemaker/pcmk_output.c                                        "node", pcmk__s(node->details->uname, ""),
node             1119 lib/pacemaker/pcmk_output.c             pe_node_t *node = (pe_node_t *) gIter->data;
node             1122 lib/pacemaker/pcmk_output.c             possible_matches = find_actions(rsc->actions, key, node);
node             1132 lib/pacemaker/pcmk_output.c             if (out->message(out, "rsc-action-item", "Stop", rsc, node, NULL,
node             1225 lib/pacemaker/pcmk_output.c     const char *node = va_arg(args, const char *);
node             1234 lib/pacemaker/pcmk_output.c         out->list_item(out, NULL, "Cluster action:  %s for %s on %s", task, ID(rsc), node);
node             1236 lib/pacemaker/pcmk_output.c         out->list_item(out, NULL, "Cluster action:  %s on %s", task, node);
node             1246 lib/pacemaker/pcmk_output.c     const char *node = va_arg(args, const char *);
node             1258 lib/pacemaker/pcmk_output.c                                             "node", node,
node             1411 lib/pacemaker/pcmk_output.c     xmlNodePtr node = NULL;
node             1417 lib/pacemaker/pcmk_output.c     node = pcmk__output_xml_create_parent(out, "modifications", NULL);
node             1420 lib/pacemaker/pcmk_output.c         crm_xml_add(node, "quorum", quorum);
node             1424 lib/pacemaker/pcmk_output.c         crm_xml_add(node, "watchdog", watchdog);
node             1435 lib/pacemaker/pcmk_output.c     char *node = va_arg(args, char *);
node             1442 lib/pacemaker/pcmk_output.c         out->list_item(out, NULL, "Bringing node %s online", node);
node             1445 lib/pacemaker/pcmk_output.c         out->list_item(out, NULL, "Taking node %s offline", node);
node             1448 lib/pacemaker/pcmk_output.c         out->list_item(out, NULL, "Failing node %s", node);
node             1460 lib/pacemaker/pcmk_output.c     char *node = va_arg(args, char *);
node             1468 lib/pacemaker/pcmk_output.c                                  "node", node,
node             1515 lib/pacemaker/pcmk_output.c     const char *node = va_arg(args, const char *);
node             1522 lib/pacemaker/pcmk_output.c     out->list_item(out, NULL, "Pseudo action:   %s%s%s", task, node ? " on " : "",
node             1523 lib/pacemaker/pcmk_output.c                    node ? node : "");
node             1531 lib/pacemaker/pcmk_output.c     const char *node = va_arg(args, const char *);
node             1543 lib/pacemaker/pcmk_output.c     if (node) {
node             1544 lib/pacemaker/pcmk_output.c         crm_xml_add(xml_node, "node", node);
node             1556 lib/pacemaker/pcmk_output.c     char *node = va_arg(args, char *);
node             1565 lib/pacemaker/pcmk_output.c                        rsc, operation, interval_ms, node);
node             1568 lib/pacemaker/pcmk_output.c                        rsc, operation, node);
node             1580 lib/pacemaker/pcmk_output.c     char *node = va_arg(args, char *);
node             1592 lib/pacemaker/pcmk_output.c                                             "node", node,
node             1969 lib/pacemaker/pcmk_output.c     xmlNodePtr node = NULL;
node             1971 lib/pacemaker/pcmk_output.c     node = pcmk__output_create_xml_node(out, "attribute",
node             1977 lib/pacemaker/pcmk_output.c         crm_xml_add(node, "scope", scope);
node             1981 lib/pacemaker/pcmk_output.c         crm_xml_add(node, "id", instance);
node             1985 lib/pacemaker/pcmk_output.c         crm_xml_add(node, "host", host);
node               31 lib/pacemaker/pcmk_resource.c best_op(pe_resource_t *rsc, pe_node_t *node, pe_working_set_t *data_set)
node               42 lib/pacemaker/pcmk_resource.c     xpath = crm_strdup_printf(XPATH_OP_HISTORY, node->details->uname, rsc->id);
node              118 lib/pacemaker/pcmk_resource.c                        pe_node_t *node, GHashTable *overrides)
node              126 lib/pacemaker/pcmk_resource.c     if ((out == NULL) || (rsc == NULL) || (node == NULL)) {
node              135 lib/pacemaker/pcmk_resource.c     xml_op = best_op(rsc, node, rsc->cluster);
node              148 lib/pacemaker/pcmk_resource.c     digests = pe__calculate_digests(rsc, task, &interval_ms, node, xml_op,
node              150 lib/pacemaker/pcmk_resource.c     rc = out->message(out, "digests", rsc, node, task, interval_ms, digests);
node              158 lib/pacemaker/pcmk_resource.c                       pe_node_t *node, GHashTable *overrides,
node              169 lib/pacemaker/pcmk_resource.c     rc = pcmk__resource_digests(out, rsc, node, overrides);
node               31 lib/pacemaker/pcmk_sched_actions.c action_flags_for_ordering(pe_action_t *action, pe_node_t *node)
node               46 lib/pacemaker/pcmk_sched_actions.c     if ((node == NULL) || !pe_rsc_is_clone(action->rsc)) {
node               56 lib/pacemaker/pcmk_sched_actions.c     flags = action->rsc->cmds->action_flags(action, node);
node              231 lib/pacemaker/pcmk_sched_actions.c     pe_node_t *node = then->node;
node              241 lib/pacemaker/pcmk_sched_actions.c         node = first->node;
node              245 lib/pacemaker/pcmk_sched_actions.c                      first->uuid, then->uuid, pe__node_name(node));
node              251 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              269 lib/pacemaker/pcmk_sched_actions.c         changed |= then->rsc->cmds->update_ordered_actions(first, then, node,
node              281 lib/pacemaker/pcmk_sched_actions.c                                                                 node,
node              299 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              314 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              349 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              363 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              383 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              398 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              412 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              426 lib/pacemaker/pcmk_sched_actions.c                                                                node,
node              490 lib/pacemaker/pcmk_sched_actions.c     (((a)->node == NULL)? "no node" : (a)->node->details->uname)
node              536 lib/pacemaker/pcmk_sched_actions.c         pe_node_t *then_node = then->node;
node              537 lib/pacemaker/pcmk_sched_actions.c         pe_node_t *first_node = first->node;
node              727 lib/pacemaker/pcmk_sched_actions.c         && (then->node != NULL)
node              729 lib/pacemaker/pcmk_sched_actions.c         && (then->node->details == ((pe_node_t *) then_on->data)->details)
node              836 lib/pacemaker/pcmk_sched_actions.c                              const pe_node_t *node, uint32_t flags,
node              926 lib/pacemaker/pcmk_sched_actions.c                      then->uuid, pe__node_name(then->node),
node              940 lib/pacemaker/pcmk_sched_actions.c                      first->uuid, pe__node_name(first->node),
node              965 lib/pacemaker/pcmk_sched_actions.c         if (action->node != NULL) {
node              966 lib/pacemaker/pcmk_sched_actions.c             node_uname = action->node->details->uname;
node              967 lib/pacemaker/pcmk_sched_actions.c             node_uuid = action->node->details->id;
node             1051 lib/pacemaker/pcmk_sched_actions.c pcmk__new_shutdown_action(pe_node_t *node)
node             1056 lib/pacemaker/pcmk_sched_actions.c     CRM_ASSERT(node != NULL);
node             1059 lib/pacemaker/pcmk_sched_actions.c                                     node->details->uname);
node             1061 lib/pacemaker/pcmk_sched_actions.c     shutdown_op = custom_action(NULL, shutdown_id, CRM_OP_SHUTDOWN, node, FALSE,
node             1062 lib/pacemaker/pcmk_sched_actions.c                                 TRUE, node->details->data_set);
node             1064 lib/pacemaker/pcmk_sched_actions.c     pcmk__order_stops_before_shutdown(node, shutdown_op);
node             1116 lib/pacemaker/pcmk_sched_actions.c                          const char *node, const char *origin)
node             1132 lib/pacemaker/pcmk_sched_actions.c               ((node == NULL)? "no node" : node), caller_version, origin);
node             1222 lib/pacemaker/pcmk_sched_actions.c     crm_xml_add(xml_op, XML_LRM_ATTR_TARGET, node); /* For context during triage */
node             1300 lib/pacemaker/pcmk_sched_actions.c         || (action->rsc->lock_node == NULL) || (action->node == NULL)
node             1301 lib/pacemaker/pcmk_sched_actions.c         || (action->node->details != action->rsc->lock_node->details)) {
node             1308 lib/pacemaker/pcmk_sched_actions.c     if (action->node->details->shutdown && (action->task != NULL)
node             1418 lib/pacemaker/pcmk_sched_actions.c         if (pe__is_guest_node(action->node)) {
node             1420 lib/pacemaker/pcmk_sched_actions.c                                           pe__node_name(action->node),
node             1421 lib/pacemaker/pcmk_sched_actions.c                                           action->node->details->remote_rsc->container->id);
node             1422 lib/pacemaker/pcmk_sched_actions.c         } else if (action->node != NULL) {
node             1423 lib/pacemaker/pcmk_sched_actions.c             node_name = crm_strdup_printf("%s", pe__node_name(action->node));
node             1528 lib/pacemaker/pcmk_sched_actions.c               pe_node_t *node)
node             1535 lib/pacemaker/pcmk_sched_actions.c     trigger_unfencing(rsc, node, "Device parameters changed", NULL,
node             1547 lib/pacemaker/pcmk_sched_actions.c schedule_reload(pe_resource_t *rsc, pe_node_t *node)
node             1553 lib/pacemaker/pcmk_sched_actions.c         g_list_foreach(rsc->children, (GFunc) schedule_reload, node);
node             1558 lib/pacemaker/pcmk_sched_actions.c     if ((node == NULL)
node             1565 lib/pacemaker/pcmk_sched_actions.c                      (node == NULL)? "inactive" : node->details->uname);
node             1575 lib/pacemaker/pcmk_sched_actions.c         custom_action(rsc, stop_key(rsc), CRMD_ACTION_STOP, node, FALSE, TRUE,
node             1582 lib/pacemaker/pcmk_sched_actions.c     reload = custom_action(rsc, reload_key(rsc), CRMD_ACTION_RELOAD_AGENT, node,
node             1610 lib/pacemaker/pcmk_sched_actions.c pcmk__check_action_config(pe_resource_t *rsc, pe_node_t *node, xmlNode *xml_op)
node             1616 lib/pacemaker/pcmk_sched_actions.c     CRM_CHECK((rsc != NULL) && (node != NULL) && (xml_op != NULL),
node             1629 lib/pacemaker/pcmk_sched_actions.c                          pe__node_name(node));
node             1634 lib/pacemaker/pcmk_sched_actions.c                                   task, interval_ms, node, "orphan");
node             1639 lib/pacemaker/pcmk_sched_actions.c                          pe__node_name(node));
node             1646 lib/pacemaker/pcmk_sched_actions.c               pe__node_name(node));
node             1648 lib/pacemaker/pcmk_sched_actions.c     digest_data = rsc_action_digest_cmp(rsc, xml_op, node, rsc->cluster);
node             1658 lib/pacemaker/pcmk_sched_actions.c                       pe__node_name(node),
node             1667 lib/pacemaker/pcmk_sched_actions.c             force_restart(rsc, task, interval_ms, node);
node             1680 lib/pacemaker/pcmk_sched_actions.c                 pcmk__reschedule_recurring(rsc, task, interval_ms, node);
node             1685 lib/pacemaker/pcmk_sched_actions.c                 trigger_unfencing(rsc, node,
node             1689 lib/pacemaker/pcmk_sched_actions.c                 schedule_reload(rsc, node);
node             1697 lib/pacemaker/pcmk_sched_actions.c                 force_restart(rsc, task, interval_ms, node);
node             1746 lib/pacemaker/pcmk_sched_actions.c process_rsc_history(xmlNode *rsc_entry, pe_resource_t *rsc, pe_node_t *node)
node             1763 lib/pacemaker/pcmk_sched_actions.c             pcmk__schedule_cleanup(rsc, node, false);
node             1768 lib/pacemaker/pcmk_sched_actions.c     if (pe_find_node_id(rsc->running_on, node->details->id) == NULL) {
node             1769 lib/pacemaker/pcmk_sched_actions.c         if (pcmk__rsc_agent_changed(rsc, node, rsc_entry, false)) {
node             1770 lib/pacemaker/pcmk_sched_actions.c             pcmk__schedule_cleanup(rsc, node, false);
node             1775 lib/pacemaker/pcmk_sched_actions.c                      rsc->id, pe__node_name(node));
node             1780 lib/pacemaker/pcmk_sched_actions.c                  rsc->id, pe__node_name(node));
node             1782 lib/pacemaker/pcmk_sched_actions.c     if (pcmk__rsc_agent_changed(rsc, node, rsc_entry, true)) {
node             1783 lib/pacemaker/pcmk_sched_actions.c         pcmk__schedule_cleanup(rsc, node, false);
node             1807 lib/pacemaker/pcmk_sched_actions.c                 || node->details->maintenance)) {
node             1811 lib/pacemaker/pcmk_sched_actions.c                                   task, interval_ms, node, "maintenance mode");
node             1828 lib/pacemaker/pcmk_sched_actions.c                 pe__add_param_check(rsc_op, rsc, node, pe_check_active,
node             1831 lib/pacemaker/pcmk_sched_actions.c             } else if (pcmk__check_action_config(rsc, node, rsc_op)
node             1832 lib/pacemaker/pcmk_sched_actions.c                        && (pe_get_failcount(node, rsc, NULL, pe_fc_effective,
node             1834 lib/pacemaker/pcmk_sched_actions.c                 pe__clear_failcount(rsc, node, "action definition changed",
node             1857 lib/pacemaker/pcmk_sched_actions.c process_node_history(pe_node_t *node, xmlNode *lrm_rscs, pe_working_set_t *data_set)
node             1859 lib/pacemaker/pcmk_sched_actions.c     crm_trace("Processing node history for %s", pe__node_name(node));
node             1870 lib/pacemaker/pcmk_sched_actions.c                     process_rsc_history(rsc_entry, rsc, node);
node             1905 lib/pacemaker/pcmk_sched_actions.c         pe_node_t *node = (pe_node_t *) iter->data;
node             1911 lib/pacemaker/pcmk_sched_actions.c         if (node->details->maintenance
node             1912 lib/pacemaker/pcmk_sched_actions.c             || pcmk__node_available(node, false, false)) {
node             1917 lib/pacemaker/pcmk_sched_actions.c             xpath = crm_strdup_printf(XPATH_NODE_HISTORY, node->details->uname);
node             1921 lib/pacemaker/pcmk_sched_actions.c             process_node_history(node, history, data_set);
node               43 lib/pacemaker/pcmk_sched_allocate.c check_params(pe_resource_t *rsc, pe_node_t *node, xmlNode *rsc_op,
node               51 lib/pacemaker/pcmk_sched_allocate.c             if (pcmk__check_action_config(rsc, node, rsc_op)
node               52 lib/pacemaker/pcmk_sched_allocate.c                 && pe_get_failcount(node, rsc, NULL, pe_fc_effective, NULL,
node               59 lib/pacemaker/pcmk_sched_allocate.c             digest_data = rsc_action_digest_cmp(rsc, rsc_op, node, data_set);
node               64 lib/pacemaker/pcmk_sched_allocate.c                               rsc->id, ID(rsc_op), node->details->id);
node               75 lib/pacemaker/pcmk_sched_allocate.c         pe__clear_failcount(rsc, node, reason, data_set);
node               90 lib/pacemaker/pcmk_sched_allocate.c failcount_clear_action_exists(pe_node_t *node, pe_resource_t *rsc)
node               92 lib/pacemaker/pcmk_sched_allocate.c     GList *list = pe__resource_actions(rsc, node, CRM_OP_CLEAR_FAILCOUNT, TRUE);
node              109 lib/pacemaker/pcmk_sched_allocate.c check_failure_threshold(pe_resource_t *rsc, pe_node_t *node)
node              114 lib/pacemaker/pcmk_sched_allocate.c                        node);
node              117 lib/pacemaker/pcmk_sched_allocate.c     } else if (failcount_clear_action_exists(node, rsc)) {
node              133 lib/pacemaker/pcmk_sched_allocate.c         if (pcmk__threshold_reached(rsc, node, &failed)) {
node              134 lib/pacemaker/pcmk_sched_allocate.c             resource_location(failed, node, -INFINITY, "__fail_limit__",
node              153 lib/pacemaker/pcmk_sched_allocate.c apply_exclusive_discovery(pe_resource_t *rsc, pe_node_t *node)
node              159 lib/pacemaker/pcmk_sched_allocate.c         g_list_foreach(rsc->children, (GFunc) apply_exclusive_discovery, node);
node              161 lib/pacemaker/pcmk_sched_allocate.c         match = g_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node              179 lib/pacemaker/pcmk_sched_allocate.c     pe_node_t *node = NULL;
node              195 lib/pacemaker/pcmk_sched_allocate.c     node = rsc->running_on->data;
node              204 lib/pacemaker/pcmk_sched_allocate.c                                  node->details->id) == NULL)) {
node              208 lib/pacemaker/pcmk_sched_allocate.c                      rsc->id, pe__node_name(node));
node              213 lib/pacemaker/pcmk_sched_allocate.c                  rsc->id, rsc->stickiness, pe__node_name(node));
node              214 lib/pacemaker/pcmk_sched_allocate.c     resource_location(rsc, node, rsc->stickiness, "stickiness",
node              252 lib/pacemaker/pcmk_sched_allocate.c         pe_node_t *node = (pe_node_t *) iter->data;
node              254 lib/pacemaker/pcmk_sched_allocate.c         if ((node != NULL) && (node->weight >= 0) && node->details->online
node              255 lib/pacemaker/pcmk_sched_allocate.c             && (node->details->type != node_ping)) {
node              283 lib/pacemaker/pcmk_sched_allocate.c             pe_node_t *node = (pe_node_t *) node_iter->data;
node              286 lib/pacemaker/pcmk_sched_allocate.c             check_failure_threshold(rsc, node);
node              287 lib/pacemaker/pcmk_sched_allocate.c             apply_exclusive_discovery(rsc, node);
node              360 lib/pacemaker/pcmk_sched_allocate.c         pe_node_t *node = (pe_node_t *) iter->data;
node              363 lib/pacemaker/pcmk_sched_allocate.c         if (!node->details->online) {
node              366 lib/pacemaker/pcmk_sched_allocate.c         if (pe_get_failcount(node, rsc, NULL, pe_fc_effective, NULL,
node              371 lib/pacemaker/pcmk_sched_allocate.c         clear_op = pe__clear_failcount(rsc, node, "it is orphaned", data_set);
node              464 lib/pacemaker/pcmk_sched_allocate.c needs_fencing(pe_node_t *node, bool have_managed, pe_working_set_t *data_set)
node              466 lib/pacemaker/pcmk_sched_allocate.c     return have_managed && node->details->unclean
node              467 lib/pacemaker/pcmk_sched_allocate.c            && pe_can_fence(data_set, node);
node              479 lib/pacemaker/pcmk_sched_allocate.c needs_shutdown(pe_node_t *node)
node              481 lib/pacemaker/pcmk_sched_allocate.c     if (pe__is_guest_or_remote_node(node)) {
node              487 lib/pacemaker/pcmk_sched_allocate.c     return node->details->online && node->details->shutdown;
node              522 lib/pacemaker/pcmk_sched_allocate.c schedule_fencing(pe_node_t *node, pe_working_set_t *data_set)
node              524 lib/pacemaker/pcmk_sched_allocate.c     pe_action_t *fencing = pe_fence_op(node, NULL, FALSE, "node is unclean",
node              527 lib/pacemaker/pcmk_sched_allocate.c     pe_warn("Scheduling node %s for fencing", pe__node_name(node));
node              554 lib/pacemaker/pcmk_sched_allocate.c         pe_node_t *node = (pe_node_t *) iter->data;
node              560 lib/pacemaker/pcmk_sched_allocate.c         if (pe__is_guest_node(node)) {
node              561 lib/pacemaker/pcmk_sched_allocate.c             if (node->details->remote_requires_reset && have_managed
node              562 lib/pacemaker/pcmk_sched_allocate.c                 && pe_can_fence(data_set, node)) {
node              563 lib/pacemaker/pcmk_sched_allocate.c                 pcmk__fence_guest(node);
node              568 lib/pacemaker/pcmk_sched_allocate.c         if (needs_fencing(node, have_managed, data_set)) {
node              569 lib/pacemaker/pcmk_sched_allocate.c             fencing = schedule_fencing(node, data_set);
node              572 lib/pacemaker/pcmk_sched_allocate.c             if (node->details->is_dc) {
node              578 lib/pacemaker/pcmk_sched_allocate.c         } else if (needs_shutdown(node)) {
node              579 lib/pacemaker/pcmk_sched_allocate.c             pe_action_t *down_op = pcmk__new_shutdown_action(node);
node              582 lib/pacemaker/pcmk_sched_allocate.c             if (node->details->is_dc) {
node              589 lib/pacemaker/pcmk_sched_allocate.c         if ((fencing == NULL) && node->details->unclean) {
node              592 lib/pacemaker/pcmk_sched_allocate.c                     pe__node_name(node));
node               23 lib/pacemaker/pcmk_sched_bundle.c is_bundle_node(pe__bundle_variant_data_t *data, pe_node_t *node)
node               28 lib/pacemaker/pcmk_sched_bundle.c         if (node->details == replica->node->details) {
node              130 lib/pacemaker/pcmk_sched_bundle.c             pe_node_t *node = NULL;
node              134 lib/pacemaker/pcmk_sched_bundle.c             while (g_hash_table_iter_next(&iter, NULL, (gpointer *) & node)) {
node              135 lib/pacemaker/pcmk_sched_bundle.c                 if (node->details != replica->node->details) {
node              136 lib/pacemaker/pcmk_sched_bundle.c                     node->weight = -INFINITY;
node              137 lib/pacemaker/pcmk_sched_bundle.c                 } else if (!pcmk__threshold_reached(replica->child, node,
node              139 lib/pacemaker/pcmk_sched_bundle.c                     node->weight = INFINITY;
node              146 lib/pacemaker/pcmk_sched_bundle.c             replica->child->cmds->assign(replica->child, replica->node);
node              153 lib/pacemaker/pcmk_sched_bundle.c         pe_node_t *node = NULL;
node              156 lib/pacemaker/pcmk_sched_bundle.c         while (g_hash_table_iter_next(&iter, NULL, (gpointer *) & node)) {
node              157 lib/pacemaker/pcmk_sched_bundle.c             if (is_bundle_node(bundle_data, node)) {
node              158 lib/pacemaker/pcmk_sched_bundle.c                 node->weight = 0;
node              160 lib/pacemaker/pcmk_sched_bundle.c                 node->weight = -INFINITY;
node              386 lib/pacemaker/pcmk_sched_bundle.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              388 lib/pacemaker/pcmk_sched_bundle.c         pair = compatible_replica_for_node(rsc_lh, node, rsc, filter, current);
node              545 lib/pacemaker/pcmk_sched_bundle.c pcmk__bundle_action_flags(pe_action_t *action, const pe_node_t *node)
node              562 lib/pacemaker/pcmk_sched_bundle.c                 return summary_action_flags(action, data->child->children, node);
node              569 lib/pacemaker/pcmk_sched_bundle.c     flags = summary_action_flags(action, containers, node);
node              611 lib/pacemaker/pcmk_sched_bundle.c                       const pe_node_t *node)
node              623 lib/pacemaker/pcmk_sched_bundle.c                 && pe__same_node(node, replica->node)) {
node              633 lib/pacemaker/pcmk_sched_bundle.c                                 const pe_node_t *node, uint32_t filter,
node              684 lib/pacemaker/pcmk_sched_bundle.c                                                   node);
node              692 lib/pacemaker/pcmk_sched_bundle.c                                                  NULL, task2text(task), node);
node              694 lib/pacemaker/pcmk_sched_bundle.c                 first_action = find_first_action(first_child->actions, NULL, task2text(task), node);
node              697 lib/pacemaker/pcmk_sched_bundle.c             then_replica = replica_for_container(then->rsc, then_child, node);
node              708 lib/pacemaker/pcmk_sched_bundle.c                                                 NULL, then->task, node);
node              710 lib/pacemaker/pcmk_sched_bundle.c                 then_action = find_first_action(then_child->actions, NULL, then->task, node);
node              755 lib/pacemaker/pcmk_sched_bundle.c                                                                     node,
node              756 lib/pacemaker/pcmk_sched_bundle.c                                                                     first_child->cmds->action_flags(first_action, node),
node              831 lib/pacemaker/pcmk_sched_bundle.c                            const pe_node_t *node, uint32_t flags,
node              840 lib/pacemaker/pcmk_sched_bundle.c         changed = multi_update_interleave_actions(first, then, node, filter,
node              848 lib/pacemaker/pcmk_sched_bundle.c         changed |= pcmk__update_ordered_actions(first, then, node, flags,
node              856 lib/pacemaker/pcmk_sched_bundle.c             pe_action_t *then_child_action = find_first_action(then_child->actions, NULL, then->task, node);
node              860 lib/pacemaker/pcmk_sched_bundle.c                                                                            node);
node              865 lib/pacemaker/pcmk_sched_bundle.c                                                                                    node,
node             1010 lib/pacemaker/pcmk_sched_bundle.c pcmk__bundle_create_probe(pe_resource_t *rsc, pe_node_t *node)
node             1024 lib/pacemaker/pcmk_sched_bundle.c             && replica->ip->cmds->create_probe(replica->ip, node)) {
node             1027 lib/pacemaker/pcmk_sched_bundle.c         if ((replica->child != NULL) && (node->details == replica->node->details)
node             1028 lib/pacemaker/pcmk_sched_bundle.c             && replica->child->cmds->create_probe(replica->child, node)) {
node             1033 lib/pacemaker/pcmk_sched_bundle.c                                                       node)) {
node             1068 lib/pacemaker/pcmk_sched_bundle.c             && replica->remote->cmds->create_probe(replica->remote, node)) {
node             1077 lib/pacemaker/pcmk_sched_bundle.c                                                    probe_uuid, NULL, node);
node             1083 lib/pacemaker/pcmk_sched_bundle.c                           replica->remote->id, pe__node_name(node));
node               23 lib/pacemaker/pcmk_sched_clone.c can_run_instance(pe_resource_t * rsc, pe_node_t * node, int limit)
node               27 lib/pacemaker/pcmk_sched_clone.c     if (node == NULL && rsc->allowed_nodes) {
node               36 lib/pacemaker/pcmk_sched_clone.c     if (!node) {
node               40 lib/pacemaker/pcmk_sched_clone.c     } else if (!pcmk__node_available(node, false, false)) {
node               47 lib/pacemaker/pcmk_sched_clone.c     local_node = pcmk__top_allowed_node(rsc, node);
node               51 lib/pacemaker/pcmk_sched_clone.c                  rsc->id, pe__node_name(node));
node               55 lib/pacemaker/pcmk_sched_clone.c         common_update_score(rsc, node->details->id, local_node->weight);
node               57 lib/pacemaker/pcmk_sched_clone.c                      rsc->id, pe__node_name(node));
node               61 lib/pacemaker/pcmk_sched_clone.c                      rsc->id, pe__node_name(node), local_node->count);
node               66 lib/pacemaker/pcmk_sched_clone.c                      rsc->id, pe__node_name(node), local_node->count, limit);
node               70 lib/pacemaker/pcmk_sched_clone.c     if (node) {
node               71 lib/pacemaker/pcmk_sched_clone.c         common_update_score(rsc, node->details->id, -INFINITY);
node              189 lib/pacemaker/pcmk_sched_clone.c         pe_node_t *node = nIter->data;
node              191 lib/pacemaker/pcmk_sched_clone.c         node->count = 0;
node              192 lib/pacemaker/pcmk_sched_clone.c         if (pcmk__node_available(node, false, false)) {
node              624 lib/pacemaker/pcmk_sched_clone.c     pe_node_t *node = NULL;
node              630 lib/pacemaker/pcmk_sched_clone.c         node = child_rsc->fns->location(child_rsc, NULL, current);
node              638 lib/pacemaker/pcmk_sched_clone.c     if (node && (node->details == local_node->details)) {
node              641 lib/pacemaker/pcmk_sched_clone.c     } else if (node) {
node              642 lib/pacemaker/pcmk_sched_clone.c         crm_trace("%s - %s vs %s", child_rsc->id, pe__node_name(node),
node              671 lib/pacemaker/pcmk_sched_clone.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              673 lib/pacemaker/pcmk_sched_clone.c         pair = find_compatible_child_by_node(local_child, node, rsc, filter, current);
node              868 lib/pacemaker/pcmk_sched_clone.c                      const pe_node_t *node)
node              881 lib/pacemaker/pcmk_sched_clone.c         child_action = find_first_action(child->actions, NULL, task_s, child->children ? NULL : node);
node              883 lib/pacemaker/pcmk_sched_clone.c                      pe__node_name(node), child_action?child_action->uuid:"NA");
node              885 lib/pacemaker/pcmk_sched_clone.c             enum pe_action_flags child_flags = child->cmds->action_flags(child_action, node);
node              903 lib/pacemaker/pcmk_sched_clone.c         if (node == NULL) {
node              912 lib/pacemaker/pcmk_sched_clone.c clone_action_flags(pe_action_t *action, const pe_node_t *node)
node              914 lib/pacemaker/pcmk_sched_clone.c     return summary_action_flags(action, action->rsc->children, node);
node              978 lib/pacemaker/pcmk_sched_clone.c rsc_known_on(const pe_resource_t *rsc, const pe_node_t *node)
node              986 lib/pacemaker/pcmk_sched_clone.c             if (rsc_known_on(child, node)) {
node              997 lib/pacemaker/pcmk_sched_clone.c             if (node->details == known_node->details) {
node             1007 lib/pacemaker/pcmk_sched_clone.c find_instance_on(const pe_resource_t *clone, const pe_node_t *node)
node             1012 lib/pacemaker/pcmk_sched_clone.c         if (rsc_known_on(child, node)) {
node             1021 lib/pacemaker/pcmk_sched_clone.c probe_anonymous_clone(pe_resource_t *rsc, pe_node_t *node,
node             1025 lib/pacemaker/pcmk_sched_clone.c     pe_resource_t *child = find_instance_on(rsc, node);
node             1037 lib/pacemaker/pcmk_sched_clone.c                 if (local_node && (local_node->details == node->details)) {
node             1049 lib/pacemaker/pcmk_sched_clone.c     return child->cmds->create_probe(child, node);
node             1063 lib/pacemaker/pcmk_sched_clone.c clone_create_probe(pe_resource_t *rsc, pe_node_t *node)
node             1074 lib/pacemaker/pcmk_sched_clone.c         pe_node_t *allowed = g_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node             1083 lib/pacemaker/pcmk_sched_clone.c             g_hash_table_remove(rsc->allowed_nodes, node->details->id);
node             1091 lib/pacemaker/pcmk_sched_clone.c         return pcmk__probe_resource_list(rsc->children, node);
node             1093 lib/pacemaker/pcmk_sched_clone.c         return probe_anonymous_clone(rsc, node, rsc->cluster);
node             1050 lib/pacemaker/pcmk_sched_colocation.c     pe_node_t *node = NULL;
node             1067 lib/pacemaker/pcmk_sched_colocation.c     while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node             1070 lib/pacemaker/pcmk_sched_colocation.c                          colocation->id, dependent->id, pe__node_name(node),
node             1072 lib/pacemaker/pcmk_sched_colocation.c             node->weight = pcmk__add_scores(-colocation->score, node->weight);
node             1074 lib/pacemaker/pcmk_sched_colocation.c         } else if (pcmk__str_eq(pe_node_attribute_raw(node, attribute), value,
node             1079 lib/pacemaker/pcmk_sched_colocation.c                              pe__node_name(node), colocation->score);
node             1080 lib/pacemaker/pcmk_sched_colocation.c                 node->weight = pcmk__add_scores(colocation->score,
node             1081 lib/pacemaker/pcmk_sched_colocation.c                                                 node->weight);
node             1086 lib/pacemaker/pcmk_sched_colocation.c                          colocation->id, dependent->id, pe__node_name(node),
node             1088 lib/pacemaker/pcmk_sched_colocation.c             node->weight = pcmk__add_scores(-colocation->score, node->weight);
node             1176 lib/pacemaker/pcmk_sched_colocation.c     pe_node_t *node = NULL;
node             1182 lib/pacemaker/pcmk_sched_colocation.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node             1184 lib/pacemaker/pcmk_sched_colocation.c         if ((node->weight > best_score) && pcmk__node_available(node, false, false)
node             1185 lib/pacemaker/pcmk_sched_colocation.c             && pcmk__str_eq(value, pe_node_attribute_raw(node, attr), pcmk__str_casei)) {
node             1187 lib/pacemaker/pcmk_sched_colocation.c             best_score = node->weight;
node             1188 lib/pacemaker/pcmk_sched_colocation.c             best_node = node->details->uname;
node             1225 lib/pacemaker/pcmk_sched_colocation.c     pe_node_t *node = NULL;
node             1233 lib/pacemaker/pcmk_sched_colocation.c     while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node             1240 lib/pacemaker/pcmk_sched_colocation.c                                               pe_node_attribute_raw(node, attr));
node             1249 lib/pacemaker/pcmk_sched_colocation.c                       pe__node_name(node), node->weight, factor, score);
node             1253 lib/pacemaker/pcmk_sched_colocation.c         if (node->weight == INFINITY_HACK) {
node             1255 lib/pacemaker/pcmk_sched_colocation.c                       pe__node_name(node), node->weight, factor, score);
node             1276 lib/pacemaker/pcmk_sched_colocation.c         new_score = pcmk__add_scores(weight, node->weight);
node             1278 lib/pacemaker/pcmk_sched_colocation.c         if (only_positive && (new_score < 0) && (node->weight > 0)) {
node             1281 lib/pacemaker/pcmk_sched_colocation.c                       pe__node_name(node), node->weight, factor, score,
node             1283 lib/pacemaker/pcmk_sched_colocation.c             node->weight = INFINITY_HACK;
node             1287 lib/pacemaker/pcmk_sched_colocation.c         if (only_positive && (new_score < 0) && (node->weight == 0)) {
node             1289 lib/pacemaker/pcmk_sched_colocation.c                       pe__node_name(node), node->weight, factor, score,
node             1294 lib/pacemaker/pcmk_sched_colocation.c         crm_trace("%s: %d + %f * %d = %d", pe__node_name(node),
node             1295 lib/pacemaker/pcmk_sched_colocation.c                   node->weight, factor, score, new_score);
node             1296 lib/pacemaker/pcmk_sched_colocation.c         node->weight = new_score;
node             1500 lib/pacemaker/pcmk_sched_colocation.c         pe_node_t *node = NULL;
node             1504 lib/pacemaker/pcmk_sched_colocation.c         while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node             1505 lib/pacemaker/pcmk_sched_colocation.c             if (node->weight == INFINITY_HACK) {
node             1506 lib/pacemaker/pcmk_sched_colocation.c                 node->weight = 1;
node               29 lib/pacemaker/pcmk_sched_fencing.c rsc_is_known_on(pe_resource_t *rsc, const pe_node_t *node)
node               31 lib/pacemaker/pcmk_sched_fencing.c    if (pe_hash_table_lookup(rsc->known_on, node->details->id)) {
node               36 lib/pacemaker/pcmk_sched_fencing.c               && pe_hash_table_lookup(rsc->parent->known_on, node->details->id)) {
node               61 lib/pacemaker/pcmk_sched_fencing.c     CRM_CHECK(stonith_op && stonith_op->node, return);
node               62 lib/pacemaker/pcmk_sched_fencing.c     target = stonith_op->node;
node              120 lib/pacemaker/pcmk_sched_fencing.c     CRM_CHECK(stonith_op && stonith_op->node, return);
node              121 lib/pacemaker/pcmk_sched_fencing.c     target = stonith_op->node;
node              203 lib/pacemaker/pcmk_sched_fencing.c                   rsc->id, pe__node_name(node));
node              218 lib/pacemaker/pcmk_sched_fencing.c         if (!(action->node->details->online) || action->node->details->unclean
node              309 lib/pacemaker/pcmk_sched_fencing.c pcmk__order_vs_unfence(pe_resource_t *rsc, pe_node_t *node, pe_action_t *action,
node              327 lib/pacemaker/pcmk_sched_fencing.c         pe_action_t *unfence = pe_fence_op(node, "on", TRUE, NULL, FALSE,
node              332 lib/pacemaker/pcmk_sched_fencing.c         if (!pcmk__node_unfenced(node)) {
node              337 lib/pacemaker/pcmk_sched_fencing.c             trigger_unfencing(NULL, node, reason, NULL, rsc->cluster);
node              350 lib/pacemaker/pcmk_sched_fencing.c pcmk__fence_guest(pe_node_t *node)
node              364 lib/pacemaker/pcmk_sched_fencing.c     CRM_ASSERT(node != NULL);
node              369 lib/pacemaker/pcmk_sched_fencing.c     container = node->details->remote_rsc->container;
node              383 lib/pacemaker/pcmk_sched_fencing.c     stonith_op = pe_fence_op(node, fence_action, FALSE, "guest is unclean",
node              384 lib/pacemaker/pcmk_sched_fencing.c                              FALSE, node->details->data_set);
node              392 lib/pacemaker/pcmk_sched_fencing.c         pe_action_t *parent_stonith_op = pe_fence_op(stop->node, NULL, FALSE,
node              394 lib/pacemaker/pcmk_sched_fencing.c                                                      node->details->data_set);
node              397 lib/pacemaker/pcmk_sched_fencing.c                  pe__node_name(node), stonith_op->id,
node              398 lib/pacemaker/pcmk_sched_fencing.c                  pe__node_name(stop->node));
node              407 lib/pacemaker/pcmk_sched_fencing.c                  pe__node_name(node), stonith_op->id,
node              417 lib/pacemaker/pcmk_sched_fencing.c         stop = find_first_action(node->details->remote_rsc->actions, NULL,
node              424 lib/pacemaker/pcmk_sched_fencing.c                      pe__node_name(node), stonith_op->id, stop->id);
node              430 lib/pacemaker/pcmk_sched_fencing.c                      pe__node_name(node), stonith_op->id);
node              435 lib/pacemaker/pcmk_sched_fencing.c     pcmk__order_vs_fence(stonith_op, node->details->data_set);
node              448 lib/pacemaker/pcmk_sched_fencing.c pcmk__node_unfenced(pe_node_t *node)
node              450 lib/pacemaker/pcmk_sched_fencing.c     const char *unfenced = pe_node_attribute_raw(node, CRM_ATTR_UNFENCED);
node              465 lib/pacemaker/pcmk_sched_fencing.c     pe_node_t *node = (pe_node_t *) data;
node              468 lib/pacemaker/pcmk_sched_fencing.c     pe_action_t *unfence = pe_fence_op(node, "on", true, NULL, false,
node              130 lib/pacemaker/pcmk_sched_group.c         pe_node_t *node = NULL;
node              134 lib/pacemaker/pcmk_sched_group.c         node = member->cmds->assign(member, prefer);
node              136 lib/pacemaker/pcmk_sched_group.c             first_assigned_node = node;
node              511 lib/pacemaker/pcmk_sched_group.c pcmk__group_action_flags(pe_action_t *action, const pe_node_t *node)
node              528 lib/pacemaker/pcmk_sched_group.c                                                        task_s, node);
node              533 lib/pacemaker/pcmk_sched_group.c             member_flags = member->cmds->action_flags(member_action, node);
node              596 lib/pacemaker/pcmk_sched_group.c                                    const pe_node_t *node, uint32_t flags,
node              608 lib/pacemaker/pcmk_sched_group.c     changed |= pcmk__update_ordered_actions(first, then, node, flags, filter,
node              616 lib/pacemaker/pcmk_sched_group.c                                                        then->task, node);
node              620 lib/pacemaker/pcmk_sched_group.c                                                             member_action, node,
node               23 lib/pacemaker/pcmk_sched_location.c                pe_node_t *node, pe_resource_t *rsc)
node               34 lib/pacemaker/pcmk_sched_location.c         const char *attr_score = pe_node_attribute_calculated(node, score, rsc);
node               38 lib/pacemaker/pcmk_sched_location.c                       rule, pe__node_name(node), score);
node               43 lib/pacemaker/pcmk_sched_location.c                       rule, pe__node_name(node), attr_score, score);
node              132 lib/pacemaker/pcmk_sched_location.c             pe_node_t *node = (pe_node_t *) gIter->data;
node              134 lib/pacemaker/pcmk_sched_location.c             node->weight = get_node_score(rule_id, score, raw_score, node, rsc);
node              140 lib/pacemaker/pcmk_sched_location.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              143 lib/pacemaker/pcmk_sched_location.c             .params = pe_rsc_params(rsc, node, data_set),
node              147 lib/pacemaker/pcmk_sched_location.c         accept = pe_test_rule(rule_xml, node->details->attrs, RSC_ROLE_UNKNOWN,
node              151 lib/pacemaker/pcmk_sched_location.c                   pe__node_name(node));
node              153 lib/pacemaker/pcmk_sched_location.c         score_f = get_node_score(rule_id, score, raw_score, node, rsc);
node              156 lib/pacemaker/pcmk_sched_location.c             pe_node_t *local = pe_find_node_id(match_L, node->details->id);
node              162 lib/pacemaker/pcmk_sched_location.c                 local = pe__copy_node(node);
node              170 lib/pacemaker/pcmk_sched_location.c                       pe__node_name(node), local->weight);
node              174 lib/pacemaker/pcmk_sched_location.c             pe_node_t *delete = pe_find_node_id(match_L, node->details->id);
node              178 lib/pacemaker/pcmk_sched_location.c                 crm_trace("%s did not match", pe__node_name(node));
node              207 lib/pacemaker/pcmk_sched_location.c     const char *node = crm_element_value(xml_obj, XML_CIB_TAG_NODE);
node              220 lib/pacemaker/pcmk_sched_location.c     if ((node != NULL) && (score != NULL)) {
node              222 lib/pacemaker/pcmk_sched_location.c         pe_node_t *match = pe_find_node(data_set->nodes, node);
node              541 lib/pacemaker/pcmk_sched_location.c                    pe_node_t *node, pe_working_set_t *data_set)
node              553 lib/pacemaker/pcmk_sched_location.c     } else if (node == NULL) {
node              580 lib/pacemaker/pcmk_sched_location.c         if (node != NULL) {
node              581 lib/pacemaker/pcmk_sched_location.c             pe_node_t *copy = pe__copy_node(node);
node              652 lib/pacemaker/pcmk_sched_location.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              656 lib/pacemaker/pcmk_sched_location.c                                                            node->details->id);
node              659 lib/pacemaker/pcmk_sched_location.c                          node->weight, pe__node_name(node));
node              660 lib/pacemaker/pcmk_sched_location.c             weighted_node = pe__copy_node(node);
node              666 lib/pacemaker/pcmk_sched_location.c                          node->weight, pe__node_name(node));
node              668 lib/pacemaker/pcmk_sched_location.c                                                      node->weight);
node               31 lib/pacemaker/pcmk_sched_nodes.c pcmk__node_available(const pe_node_t *node, bool consider_score,
node               34 lib/pacemaker/pcmk_sched_nodes.c     if ((node == NULL) || (node->details == NULL) || !node->details->online
node               35 lib/pacemaker/pcmk_sched_nodes.c             || node->details->shutdown || node->details->unclean
node               36 lib/pacemaker/pcmk_sched_nodes.c             || node->details->standby || node->details->maintenance) {
node               40 lib/pacemaker/pcmk_sched_nodes.c     if (consider_score && (node->weight < 0)) {
node               45 lib/pacemaker/pcmk_sched_nodes.c     if (consider_guest && pe__is_guest_node(node)) {
node               46 lib/pacemaker/pcmk_sched_nodes.c         pe_resource_t *guest = node->details->remote_rsc->container;
node               69 lib/pacemaker/pcmk_sched_nodes.c     pe_node_t *node = NULL;
node               76 lib/pacemaker/pcmk_sched_nodes.c     while (g_hash_table_iter_next(&iter, NULL, (gpointer *) &node)) {
node               77 lib/pacemaker/pcmk_sched_nodes.c         pe_node_t *new_node = pe__copy_node(node);
node              255 lib/pacemaker/pcmk_sched_nodes.c     pe_node_t *node = NULL;
node              261 lib/pacemaker/pcmk_sched_nodes.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              262 lib/pacemaker/pcmk_sched_nodes.c         if (pcmk__node_available(node, true, false)) {
node              295 lib/pacemaker/pcmk_sched_nodes.c         pe_node_t *node = (pe_node_t *) iter->data;
node              296 lib/pacemaker/pcmk_sched_nodes.c         int health = pe__sum_node_health_scores(node, base_health);
node              303 lib/pacemaker/pcmk_sched_nodes.c                  pe__node_name(node), health);
node              319 lib/pacemaker/pcmk_sched_nodes.c                 pcmk__new_location(strategy_str, rsc, health, NULL, node,
node              323 lib/pacemaker/pcmk_sched_nodes.c                              rsc->id, pe__node_name(node));
node              340 lib/pacemaker/pcmk_sched_nodes.c pcmk__top_allowed_node(const pe_resource_t *rsc, const pe_node_t *node)
node              344 lib/pacemaker/pcmk_sched_nodes.c     if ((rsc == NULL) || (node == NULL)) {
node              351 lib/pacemaker/pcmk_sched_nodes.c     return pe_hash_table_lookup(allowed_nodes, node->details->id);
node             1075 lib/pacemaker/pcmk_sched_ordering.c         && pcmk__rsc_corresponds_to_guest(action->rsc, input->action->node)) {
node             1124 lib/pacemaker/pcmk_sched_ordering.c pcmk__order_stops_before_shutdown(pe_node_t *node, pe_action_t *shutdown_op)
node             1126 lib/pacemaker/pcmk_sched_ordering.c     for (GList *iter = node->details->data_set->actions;
node             1132 lib/pacemaker/pcmk_sched_ordering.c         if ((action->rsc == NULL) || (action->node == NULL)
node             1133 lib/pacemaker/pcmk_sched_ordering.c             || (action->node->details != node->details)
node             1144 lib/pacemaker/pcmk_sched_ordering.c                          action->uuid, pe__node_name(node));
node             1147 lib/pacemaker/pcmk_sched_ordering.c         } else if (node->details->maintenance) {
node             1151 lib/pacemaker/pcmk_sched_ordering.c                          action->uuid, pe__node_name(node));
node             1164 lib/pacemaker/pcmk_sched_ordering.c                          action->uuid, pe__node_name(node));
node             1169 lib/pacemaker/pcmk_sched_ordering.c                      action->uuid, pe__node_name(node));
node             1174 lib/pacemaker/pcmk_sched_ordering.c                            node->details->data_set);
node             1430 lib/pacemaker/pcmk_sched_ordering.c                   before_desc, pe__node_name(before->node),
node             1431 lib/pacemaker/pcmk_sched_ordering.c                   after_desc, pe__node_name(after->node));
node               19 lib/pacemaker/pcmk_sched_primitive.c static void stop_resource(pe_resource_t *rsc, pe_node_t *node, bool optional);
node               20 lib/pacemaker/pcmk_sched_primitive.c static void start_resource(pe_resource_t *rsc, pe_node_t *node, bool optional);
node               21 lib/pacemaker/pcmk_sched_primitive.c static void demote_resource(pe_resource_t *rsc, pe_node_t *node, bool optional);
node               22 lib/pacemaker/pcmk_sched_primitive.c static void promote_resource(pe_resource_t *rsc, pe_node_t *node,
node               24 lib/pacemaker/pcmk_sched_primitive.c static void assert_role_error(pe_resource_t *rsc, pe_node_t *node,
node               77 lib/pacemaker/pcmk_sched_primitive.c typedef void (*rsc_transition_fn)(pe_resource_t *rsc, pe_node_t *node,
node              799 lib/pacemaker/pcmk_sched_primitive.c     pe_node_t *node = NULL;
node              802 lib/pacemaker/pcmk_sched_primitive.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              803 lib/pacemaker/pcmk_sched_primitive.c         if (node->details->remote_rsc != NULL) {
node              804 lib/pacemaker/pcmk_sched_primitive.c             node->weight = -INFINITY;
node              952 lib/pacemaker/pcmk_sched_primitive.c                 pe_node_t *node = item->data;
node              954 lib/pacemaker/pcmk_sched_primitive.c                 if (node->details->remote_rsc != remote_rsc) {
node              955 lib/pacemaker/pcmk_sched_primitive.c                     node->weight = -INFINITY;
node             1060 lib/pacemaker/pcmk_sched_primitive.c pcmk__primitive_action_flags(pe_action_t *action, const pe_node_t *node)
node             1080 lib/pacemaker/pcmk_sched_primitive.c is_expected_node(const pe_resource_t *rsc, const pe_node_t *node)
node             1085 lib/pacemaker/pcmk_sched_primitive.c            && pe__same_node(rsc->allocated_to, node);
node             1097 lib/pacemaker/pcmk_sched_primitive.c stop_resource(pe_resource_t *rsc, pe_node_t *node, bool optional)
node             1178 lib/pacemaker/pcmk_sched_primitive.c start_resource(pe_resource_t *rsc, pe_node_t *node, bool optional)
node             1182 lib/pacemaker/pcmk_sched_primitive.c     CRM_ASSERT(node != NULL);
node             1186 lib/pacemaker/pcmk_sched_primitive.c                  pe__node_name(node), node->weight);
node             1187 lib/pacemaker/pcmk_sched_primitive.c     start = start_action(rsc, node, TRUE);
node             1189 lib/pacemaker/pcmk_sched_primitive.c     pcmk__order_vs_unfence(rsc, node, start, pe_order_implies_then);
node             1195 lib/pacemaker/pcmk_sched_primitive.c     if (is_expected_node(rsc, node)) {
node             1202 lib/pacemaker/pcmk_sched_primitive.c                      rsc->id, pe__node_name(node));
node             1216 lib/pacemaker/pcmk_sched_primitive.c promote_resource(pe_resource_t *rsc, pe_node_t *node, bool optional)
node             1222 lib/pacemaker/pcmk_sched_primitive.c     CRM_ASSERT(node != NULL);
node             1225 lib/pacemaker/pcmk_sched_primitive.c     action_list = pe__resource_actions(rsc, node, RSC_START, true);
node             1236 lib/pacemaker/pcmk_sched_primitive.c         pe_action_t *promote = promote_action(rsc, node, optional);
node             1240 lib/pacemaker/pcmk_sched_primitive.c                      pe__node_name(node));
node             1242 lib/pacemaker/pcmk_sched_primitive.c         if (is_expected_node(rsc, node)) {
node             1249 lib/pacemaker/pcmk_sched_primitive.c                          rsc->id, pe__node_name(node));
node             1254 lib/pacemaker/pcmk_sched_primitive.c                      rsc->id, pe__node_name(node));
node             1255 lib/pacemaker/pcmk_sched_primitive.c         action_list = pe__resource_actions(rsc, node, RSC_PROMOTE, true);
node             1274 lib/pacemaker/pcmk_sched_primitive.c demote_resource(pe_resource_t *rsc, pe_node_t *node, bool optional)
node             1299 lib/pacemaker/pcmk_sched_primitive.c assert_role_error(pe_resource_t *rsc, pe_node_t *node, bool optional)
node             1313 lib/pacemaker/pcmk_sched_primitive.c pcmk__schedule_cleanup(pe_resource_t *rsc, const pe_node_t *node, bool optional)
node             1322 lib/pacemaker/pcmk_sched_primitive.c     CRM_CHECK((rsc != NULL) && (node != NULL), return);
node             1326 lib/pacemaker/pcmk_sched_primitive.c                      rsc->id, pe__node_name(node));
node             1330 lib/pacemaker/pcmk_sched_primitive.c     if (node->details->unclean || !node->details->online) {
node             1332 lib/pacemaker/pcmk_sched_primitive.c                      rsc->id, pe__node_name(node));
node             1336 lib/pacemaker/pcmk_sched_primitive.c     crm_notice("Scheduling clean-up of %s on %s", rsc->id, pe__node_name(node));
node             1337 lib/pacemaker/pcmk_sched_primitive.c     delete_action(rsc, node, optional);
node             1425 lib/pacemaker/pcmk_sched_primitive.c shutdown_time(const pe_node_t *node)
node             1427 lib/pacemaker/pcmk_sched_primitive.c     const char *shutdown = pe_node_attribute_raw(node, XML_CIB_ATTR_SHUTDOWN);
node             1437 lib/pacemaker/pcmk_sched_primitive.c     return (result == 0)? get_effective_time(node->details->data_set) : result;
node             1450 lib/pacemaker/pcmk_sched_primitive.c     pe_node_t *node = (pe_node_t *) data;
node             1453 lib/pacemaker/pcmk_sched_primitive.c     if (strcmp(node->details->uname, rsc->lock_node->details->uname) != 0) {
node             1454 lib/pacemaker/pcmk_sched_primitive.c         resource_location(rsc, node, -CRM_SCORE_INFINITY,
node             1489 lib/pacemaker/pcmk_sched_primitive.c         pe_node_t *node = rsc->running_on->data;
node             1491 lib/pacemaker/pcmk_sched_primitive.c         if (node->details->shutdown) {
node             1492 lib/pacemaker/pcmk_sched_primitive.c             if (node->details->unclean) {
node             1494 lib/pacemaker/pcmk_sched_primitive.c                              rsc->id, pe__node_name(node));
node             1496 lib/pacemaker/pcmk_sched_primitive.c                 rsc->lock_node = node;
node             1497 lib/pacemaker/pcmk_sched_primitive.c                 rsc->lock_time = shutdown_time(node);
node               28 lib/pacemaker/pcmk_sched_probes.c add_expected_result(pe_action_t *probe, pe_resource_t *rsc, pe_node_t *node)
node               31 lib/pacemaker/pcmk_sched_probes.c     pe_node_t *running = pe_find_node_id(rsc->running_on, node->details->id);
node               52 lib/pacemaker/pcmk_sched_probes.c pcmk__probe_resource_list(GList *rscs, pe_node_t *node)
node               59 lib/pacemaker/pcmk_sched_probes.c         if (rsc->cmds->create_probe(rsc, node)) {
node               95 lib/pacemaker/pcmk_sched_probes.c guest_resource_will_stop(pe_node_t *node)
node               97 lib/pacemaker/pcmk_sched_probes.c     pe_resource_t *guest_rsc = node->details->remote_rsc->container;
node              102 lib/pacemaker/pcmk_sched_probes.c     return node->details->remote_requires_reset
node              103 lib/pacemaker/pcmk_sched_probes.c            || node->details->unclean
node              124 lib/pacemaker/pcmk_sched_probes.c probe_action(pe_resource_t *rsc, pe_node_t *node)
node              130 lib/pacemaker/pcmk_sched_probes.c               role2text(rsc->role), rsc->id, pe__node_name(node));
node              132 lib/pacemaker/pcmk_sched_probes.c     probe = custom_action(rsc, key, RSC_STATUS, node, FALSE, TRUE,
node              136 lib/pacemaker/pcmk_sched_probes.c     pcmk__order_vs_unfence(rsc, node, probe, pe_order_optional);
node              137 lib/pacemaker/pcmk_sched_probes.c     add_expected_result(probe, rsc, node);
node              153 lib/pacemaker/pcmk_sched_probes.c pcmk__probe_rsc_on_node(pe_resource_t *rsc, pe_node_t *node)
node              161 lib/pacemaker/pcmk_sched_probes.c     CRM_CHECK((rsc != NULL) && (node != NULL), return false);
node              168 lib/pacemaker/pcmk_sched_probes.c     if (pe__is_guest_or_remote_node(node)) {
node              175 lib/pacemaker/pcmk_sched_probes.c         } else if (pe__is_guest_node(node)
node              188 lib/pacemaker/pcmk_sched_probes.c         return pcmk__probe_resource_list(rsc->children, node);
node              199 lib/pacemaker/pcmk_sched_probes.c     } else if (g_hash_table_lookup(rsc->known_on, node->details->id) != NULL) {
node              204 lib/pacemaker/pcmk_sched_probes.c     allowed = g_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node              224 lib/pacemaker/pcmk_sched_probes.c         allowed = node;
node              231 lib/pacemaker/pcmk_sched_probes.c     if (pe__is_guest_node(node)) {
node              232 lib/pacemaker/pcmk_sched_probes.c         pe_resource_t *guest = node->details->remote_rsc->container;
node              240 lib/pacemaker/pcmk_sched_probes.c         } else if (guest_resource_will_stop(node)) {
node              252 lib/pacemaker/pcmk_sched_probes.c     probe = probe_action(rsc, node);
node              283 lib/pacemaker/pcmk_sched_probes.c                  rsc->id, node->details->id, reason);
node              301 lib/pacemaker/pcmk_sched_probes.c          && (probe->node != NULL) && (then->node != NULL)
node              302 lib/pacemaker/pcmk_sched_probes.c          && (probe->node->details == then->node->details)) {
node              312 lib/pacemaker/pcmk_sched_probes.c         && (probe->node != NULL) && (then->node != NULL)
node              313 lib/pacemaker/pcmk_sched_probes.c         && (probe->node->details != then->node->details)) {
node              484 lib/pacemaker/pcmk_sched_probes.c               probe->uuid, pe__node_name(probe->node),
node              485 lib/pacemaker/pcmk_sched_probes.c               after->uuid, pe__node_name(after->node));
node              576 lib/pacemaker/pcmk_sched_probes.c                   after->uuid, pe__node_name(after->node),
node              578 lib/pacemaker/pcmk_sched_probes.c                   pe__node_name(after_wrapper->action->node),
node              783 lib/pacemaker/pcmk_sched_probes.c         pe_node_t *node = (pe_node_t *) iter->data;
node              786 lib/pacemaker/pcmk_sched_probes.c         if (!node->details->online) { // Don't probe offline nodes
node              787 lib/pacemaker/pcmk_sched_probes.c             if (pcmk__is_failed_remote_node(node)) {
node              788 lib/pacemaker/pcmk_sched_probes.c                 pe_fence_node(data_set, node,
node              793 lib/pacemaker/pcmk_sched_probes.c         } else if (node->details->unclean) { // ... or nodes that need fencing
node              796 lib/pacemaker/pcmk_sched_probes.c         } else if (!node->details->rsc_discovery_enabled) {
node              806 lib/pacemaker/pcmk_sched_probes.c         probed = pe_node_attribute_raw(node, CRM_OP_PROBED);
node              812 lib/pacemaker/pcmk_sched_probes.c                                                        node->details->uname),
node              813 lib/pacemaker/pcmk_sched_probes.c                                      CRM_OP_REPROBE, node, FALSE, TRUE,
node              821 lib/pacemaker/pcmk_sched_probes.c         pcmk__probe_resource_list(data_set->resources, node);
node              156 lib/pacemaker/pcmk_sched_promotable.c     pe_node_t *node = NULL;
node              172 lib/pacemaker/pcmk_sched_promotable.c     node = rsc->fns->location(rsc, NULL, FALSE);
node              173 lib/pacemaker/pcmk_sched_promotable.c     if (node == NULL) {
node              181 lib/pacemaker/pcmk_sched_promotable.c                        rsc->id, pe__node_name(node));
node              195 lib/pacemaker/pcmk_sched_promotable.c     } else if (!pcmk__node_available(node, false, true)) {
node              197 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, pe__node_name(node));
node              201 lib/pacemaker/pcmk_sched_promotable.c     local_node = pe_hash_table_lookup(parent->allowed_nodes, node->details->id);
node              211 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, parent->id, pe__node_name(node));
node              220 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, pe__node_name(node));
node              302 lib/pacemaker/pcmk_sched_promotable.c     pe_node_t *node = NULL;
node              316 lib/pacemaker/pcmk_sched_promotable.c     node = (pe_node_t *) pe_hash_table_lookup(clone->allowed_nodes,
node              318 lib/pacemaker/pcmk_sched_promotable.c     CRM_ASSERT(node != NULL);
node              322 lib/pacemaker/pcmk_sched_promotable.c                  pe__node_name(node));
node              323 lib/pacemaker/pcmk_sched_promotable.c     node->weight = pcmk__add_scores(child->sort_index, node->weight);
node              414 lib/pacemaker/pcmk_sched_promotable.c         pe_node_t *node = NULL;
node              416 lib/pacemaker/pcmk_sched_promotable.c         node = (pe_node_t *) pe_hash_table_lookup(clone->allowed_nodes,
node              418 lib/pacemaker/pcmk_sched_promotable.c         CRM_ASSERT(node != NULL);
node              420 lib/pacemaker/pcmk_sched_promotable.c         child->sort_index = node->weight;
node              482 lib/pacemaker/pcmk_sched_promotable.c                           const pe_node_t *node)
node              489 lib/pacemaker/pcmk_sched_promotable.c         active = clone->fns->find_rsc(child, id, node,
node              510 lib/pacemaker/pcmk_sched_promotable.c                    const pe_node_t *node)
node              521 lib/pacemaker/pcmk_sched_promotable.c             if (g_hash_table_lookup(child->known_on, node->details->id)) {
node              539 lib/pacemaker/pcmk_sched_promotable.c is_allowed(const pe_resource_t *rsc, const pe_node_t *node)
node              542 lib/pacemaker/pcmk_sched_promotable.c                                               node->details->id);
node              557 lib/pacemaker/pcmk_sched_promotable.c promotion_score_applies(pe_resource_t *rsc, const pe_node_t *node)
node              568 lib/pacemaker/pcmk_sched_promotable.c         active = find_active_anon_instance(parent, id, node);
node              577 lib/pacemaker/pcmk_sched_promotable.c         if ((active == NULL) && anonymous_known_on(parent, id, node)) {
node              595 lib/pacemaker/pcmk_sched_promotable.c     if ((pe_hash_table_lookup(rsc->known_on, node->details->id) != NULL)
node              596 lib/pacemaker/pcmk_sched_promotable.c         || (pe_find_node_id(rsc->running_on, node->details->id) != NULL)) {
node              601 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, id, pe__node_name(node));
node              607 lib/pacemaker/pcmk_sched_promotable.c     if (is_allowed(rsc, node)) {
node              609 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, id, pe__node_name(node), reason);
node              615 lib/pacemaker/pcmk_sched_promotable.c                  rsc->id, id, pe__node_name(node));
node              631 lib/pacemaker/pcmk_sched_promotable.c promotion_attr_value(pe_resource_t *rsc, const pe_node_t *node,
node              637 lib/pacemaker/pcmk_sched_promotable.c     CRM_CHECK((rsc != NULL) && (node != NULL) && (name != NULL), return NULL);
node              640 lib/pacemaker/pcmk_sched_promotable.c     attr_value = pe_node_attribute_calculated(node, attr_name, rsc);
node              656 lib/pacemaker/pcmk_sched_promotable.c promotion_score(pe_resource_t *rsc, const pe_node_t *node, bool *is_default)
node              665 lib/pacemaker/pcmk_sched_promotable.c     CRM_CHECK((rsc != NULL) && (node != NULL), return 0);
node              676 lib/pacemaker/pcmk_sched_promotable.c             int child_score = promotion_score(child, node, &child_default);
node              686 lib/pacemaker/pcmk_sched_promotable.c     if (!promotion_score_applies(rsc, node)) {
node              696 lib/pacemaker/pcmk_sched_promotable.c     attr_value = promotion_attr_value(rsc, node, name);
node              699 lib/pacemaker/pcmk_sched_promotable.c                      name, pe__node_name(node), pcmk__s(attr_value, "(unset)"));
node              707 lib/pacemaker/pcmk_sched_promotable.c             attr_value = promotion_attr_value(rsc, node, name);
node              709 lib/pacemaker/pcmk_sched_promotable.c                          name, pe__node_name(node), rsc->id,
node              742 lib/pacemaker/pcmk_sched_promotable.c         pe_node_t *node = NULL;
node              746 lib/pacemaker/pcmk_sched_promotable.c         while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              747 lib/pacemaker/pcmk_sched_promotable.c             if (!pcmk__node_available(node, false, false)) {
node              754 lib/pacemaker/pcmk_sched_promotable.c             score = promotion_score(child_rsc, node, NULL);
node              756 lib/pacemaker/pcmk_sched_promotable.c                 new_score = pcmk__add_scores(node->weight, score);
node              757 lib/pacemaker/pcmk_sched_promotable.c                 if (new_score != node->weight) {
node              761 lib/pacemaker/pcmk_sched_promotable.c                                  child_rsc->id, pe__node_name(node),
node              762 lib/pacemaker/pcmk_sched_promotable.c                                  node->weight, new_score);
node              763 lib/pacemaker/pcmk_sched_promotable.c                     node->weight = new_score;
node             1016 lib/pacemaker/pcmk_sched_promotable.c     pe_node_t *node = NULL;
node             1020 lib/pacemaker/pcmk_sched_promotable.c     while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node             1021 lib/pacemaker/pcmk_sched_promotable.c         node->count = 0;
node             1138 lib/pacemaker/pcmk_sched_promotable.c     pe_node_t *node = NULL;
node             1160 lib/pacemaker/pcmk_sched_promotable.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node             1161 lib/pacemaker/pcmk_sched_promotable.c         const char *dependent_value = pe_node_attribute_raw(node, attr);
node             1165 lib/pacemaker/pcmk_sched_promotable.c                          pe__node_name(node), node->weight, colocation->score);
node             1166 lib/pacemaker/pcmk_sched_promotable.c             node->weight = pcmk__add_scores(node->weight, colocation->score);
node             1191 lib/pacemaker/pcmk_sched_promotable.c         pe_node_t *node = instance->fns->location(instance, NULL, FALSE);
node             1193 lib/pacemaker/pcmk_sched_promotable.c         if (node == NULL) {
node             1197 lib/pacemaker/pcmk_sched_promotable.c             update_dependent_allowed_nodes(dependent, node, colocation);
node             1198 lib/pacemaker/pcmk_sched_promotable.c             affected_nodes = g_list_prepend(affected_nodes, node);
node              188 lib/pacemaker/pcmk_sched_recurring.c                                     const pe_node_t *node, const char *key,
node              193 lib/pacemaker/pcmk_sched_recurring.c     if (node == NULL) { // Should only be possible if unmanaged and stopped
node              206 lib/pacemaker/pcmk_sched_recurring.c     possible_matches = find_actions_exact(rsc->actions, key, node);
node              209 lib/pacemaker/pcmk_sched_recurring.c                      key, pe__node_name(node));
node              240 lib/pacemaker/pcmk_sched_recurring.c                         const pe_node_t *node, const struct op_history *op)
node              250 lib/pacemaker/pcmk_sched_recurring.c     is_optional = active_recurring_should_be_optional(rsc, node, op->key,
node              262 lib/pacemaker/pcmk_sched_recurring.c                                                              node);
node              301 lib/pacemaker/pcmk_sched_recurring.c                  pe__node_name(node));
node              303 lib/pacemaker/pcmk_sched_recurring.c     mon = custom_action(rsc, strdup(op->key), op->name, node, is_optional, TRUE,
node              310 lib/pacemaker/pcmk_sched_recurring.c     } else if ((node == NULL) || !node->details->online
node              311 lib/pacemaker/pcmk_sched_recurring.c                || node->details->unclean) {
node              319 lib/pacemaker/pcmk_sched_recurring.c                     rsc->id, pe__node_name(node));
node              327 lib/pacemaker/pcmk_sched_recurring.c     if ((node == NULL) || pcmk_is_set(rsc->flags, pe_rsc_managed)) {
node              364 lib/pacemaker/pcmk_sched_recurring.c cancel_if_running(pe_resource_t *rsc, const pe_node_t *node, const char *key,
node              367 lib/pacemaker/pcmk_sched_recurring.c     GList *possible_matches = find_actions_exact(rsc->actions, key, node);
node              375 lib/pacemaker/pcmk_sched_recurring.c     cancel_op = pcmk__new_cancel_action(rsc, name, interval_ms, node);
node              396 lib/pacemaker/pcmk_sched_recurring.c                 pe__node_name(node), role2text(rsc->next_role));
node              408 lib/pacemaker/pcmk_sched_recurring.c order_after_probes(pe_resource_t *rsc, const pe_node_t *node,
node              411 lib/pacemaker/pcmk_sched_recurring.c     GList *probes = pe__resource_actions(rsc, node, RSC_STATUS, FALSE);
node              429 lib/pacemaker/pcmk_sched_recurring.c order_after_stops(pe_resource_t *rsc, const pe_node_t *node,
node              432 lib/pacemaker/pcmk_sched_recurring.c     GList *stop_ops = pe__resource_actions(rsc, node, RSC_STOP, TRUE);
node              441 lib/pacemaker/pcmk_sched_recurring.c                          action->uuid, pe__node_name(node));
node              447 lib/pacemaker/pcmk_sched_recurring.c                       action->uuid, pe__node_name(node));
node              470 lib/pacemaker/pcmk_sched_recurring.c recurring_op_for_inactive(pe_resource_t *rsc, const pe_node_t *node,
node              496 lib/pacemaker/pcmk_sched_recurring.c         if ((node != NULL)
node              497 lib/pacemaker/pcmk_sched_recurring.c             && pcmk__str_eq(stop_node->details->uname, node->details->uname,
node              499 lib/pacemaker/pcmk_sched_recurring.c             cancel_if_running(rsc, node, op->key, op->name, op->interval_ms);
node              615 lib/pacemaker/pcmk_sched_recurring.c                         const pe_node_t *node)
node              621 lib/pacemaker/pcmk_sched_recurring.c     CRM_ASSERT((rsc != NULL) && (task != NULL) && (node != NULL));
node              626 lib/pacemaker/pcmk_sched_recurring.c     cancel_op = custom_action(rsc, key, RSC_CANCEL, node, FALSE, TRUE,
node              653 lib/pacemaker/pcmk_sched_recurring.c                       guint interval_ms, const pe_node_t *node,
node              659 lib/pacemaker/pcmk_sched_recurring.c               && (node != NULL) && (reason != NULL),
node              664 lib/pacemaker/pcmk_sched_recurring.c              pe__node_name(node), reason);
node              665 lib/pacemaker/pcmk_sched_recurring.c     cancel = pcmk__new_cancel_action(rsc, task, interval_ms, node);
node              684 lib/pacemaker/pcmk_sched_recurring.c                            guint interval_ms, pe_node_t *node)
node              688 lib/pacemaker/pcmk_sched_recurring.c     trigger_unfencing(rsc, node, "Device parameters changed (reschedule)",
node              691 lib/pacemaker/pcmk_sched_recurring.c                        task, node, TRUE, TRUE, rsc->cluster);
node               85 lib/pacemaker/pcmk_sched_remote.c get_remote_node_state(pe_node_t *node)
node               90 lib/pacemaker/pcmk_sched_remote.c     CRM_ASSERT(node != NULL);
node               92 lib/pacemaker/pcmk_sched_remote.c     remote_rsc = node->details->remote_rsc;
node              122 lib/pacemaker/pcmk_sched_remote.c             && node->details->remote_was_fenced
node              123 lib/pacemaker/pcmk_sched_remote.c             && !pe__shutdown_requested(node)) {
node              169 lib/pacemaker/pcmk_sched_remote.c     enum remote_connection_state state = get_remote_node_state(action->node);
node              177 lib/pacemaker/pcmk_sched_remote.c     CRM_ASSERT(pe__is_guest_or_remote_node(action->node));
node              179 lib/pacemaker/pcmk_sched_remote.c     remote_rsc = action->node->details->remote_rsc;
node              221 lib/pacemaker/pcmk_sched_remote.c                 pe_fence_node(data_set, action->node,
node              273 lib/pacemaker/pcmk_sched_remote.c                     pe_fence_node(data_set, action->node,
node              310 lib/pacemaker/pcmk_sched_remote.c     CRM_ASSERT(action->node != NULL);
node              311 lib/pacemaker/pcmk_sched_remote.c     CRM_ASSERT(pe__is_guest_or_remote_node(action->node));
node              313 lib/pacemaker/pcmk_sched_remote.c     remote_rsc = action->node->details->remote_rsc;
node              320 lib/pacemaker/pcmk_sched_remote.c         pe_fence_node(data_set, action->node, "container failed", FALSE);
node              431 lib/pacemaker/pcmk_sched_remote.c         if (action->node == NULL) {
node              435 lib/pacemaker/pcmk_sched_remote.c         if (!pe__is_guest_or_remote_node(action->node)) {
node              449 lib/pacemaker/pcmk_sched_remote.c         remote = action->node->details->remote_rsc;
node              465 lib/pacemaker/pcmk_sched_remote.c                 if ((rsc_action->node->details != action->node->details)
node              503 lib/pacemaker/pcmk_sched_remote.c pcmk__is_failed_remote_node(pe_node_t *node)
node              505 lib/pacemaker/pcmk_sched_remote.c     return pe__is_remote_node(node) && (node->details->remote_rsc != NULL)
node              506 lib/pacemaker/pcmk_sched_remote.c            && (get_remote_node_state(node) == remote_state_failed);
node              520 lib/pacemaker/pcmk_sched_remote.c pcmk__rsc_corresponds_to_guest(pe_resource_t *rsc, pe_node_t *node)
node              522 lib/pacemaker/pcmk_sched_remote.c     return (rsc != NULL) && (rsc->fillers != NULL) && (node != NULL)
node              523 lib/pacemaker/pcmk_sched_remote.c             && (node->details->remote_rsc != NULL)
node              524 lib/pacemaker/pcmk_sched_remote.c             && (node->details->remote_rsc->container == rsc);
node              550 lib/pacemaker/pcmk_sched_remote.c         || !pe__is_guest_or_remote_node(action->node)) {
node              554 lib/pacemaker/pcmk_sched_remote.c     CRM_ASSERT(action->node->details->remote_rsc != NULL);
node              556 lib/pacemaker/pcmk_sched_remote.c     began_on = pe__current_node(action->node->details->remote_rsc);
node              557 lib/pacemaker/pcmk_sched_remote.c     ended_on = action->node->details->remote_rsc->allocated_to;
node              558 lib/pacemaker/pcmk_sched_remote.c     if (action->node->details->remote_rsc
node              559 lib/pacemaker/pcmk_sched_remote.c         && (action->node->details->remote_rsc->container == NULL)
node              560 lib/pacemaker/pcmk_sched_remote.c         && action->node->details->remote_rsc->partial_migration_target) {
node              682 lib/pacemaker/pcmk_sched_remote.c     if (!pe__is_guest_node(action->node)) {
node              697 lib/pacemaker/pcmk_sched_remote.c             host = pe__current_node(action->node->details->remote_rsc->container);
node              706 lib/pacemaker/pcmk_sched_remote.c             host = action->node->details->remote_rsc->container->allocated_to;
node               99 lib/pacemaker/pcmk_sched_resource.c pcmk__rsc_agent_changed(pe_resource_t *rsc, pe_node_t *node,
node              115 lib/pacemaker/pcmk_sched_resource.c             trigger_unfencing(rsc, node, "Device definition changed", NULL,
node              120 lib/pacemaker/pcmk_sched_resource.c                            rsc->id, pe__node_name(node), attr_list[i],
node              127 lib/pacemaker/pcmk_sched_resource.c         custom_action(rsc, stop_key(rsc), CRMD_ACTION_STOP, node, FALSE, TRUE,
node              435 lib/pacemaker/pcmk_sched_resource.c pcmk__assign_resource(pe_resource_t *rsc, pe_node_t *node, bool force)
node              443 lib/pacemaker/pcmk_sched_resource.c         pcmk__finalize_assignment(rsc, node, force);
node              449 lib/pacemaker/pcmk_sched_resource.c             changed |= pcmk__assign_resource(child_rsc, node, force);
node              500 lib/pacemaker/pcmk_sched_resource.c pcmk__threshold_reached(pe_resource_t *rsc, pe_node_t *node,
node              517 lib/pacemaker/pcmk_sched_resource.c     fail_count = pe_get_failcount(node, rsc, NULL,
node              536 lib/pacemaker/pcmk_sched_resource.c                  rsc_to_ban->id, pe__node_name(node), fail_count,
node              547 lib/pacemaker/pcmk_sched_resource.c              pe__node_name(node), rsc->migration_threshold);
node              568 lib/pacemaker/pcmk_sched_resource.c get_node_weight(pe_node_t *node, GHashTable *nodes)
node              572 lib/pacemaker/pcmk_sched_resource.c     if ((node != NULL) && (nodes != NULL)) {
node              573 lib/pacemaker/pcmk_sched_resource.c         weighted_node = g_hash_table_lookup(nodes, node->details->id);
node              658 lib/pacemaker/pcmk_sched_resource.c         pe_node_t *node = (pe_node_t *) iter->data;
node              660 lib/pacemaker/pcmk_sched_resource.c         r1_weight = get_node_weight(node, r1_nodes);
node              661 lib/pacemaker/pcmk_sched_resource.c         r2_weight = get_node_weight(node, r2_nodes);
node              719 lib/pacemaker/pcmk_sched_resource.c new_node_table(pe_node_t *node)
node              723 lib/pacemaker/pcmk_sched_resource.c     node = pe__copy_node(node);
node              724 lib/pacemaker/pcmk_sched_resource.c     g_hash_table_insert(table, (gpointer) node->details->id, node);
node              854 lib/pacemaker/pcmk_sched_resource.c node_is_allowed(const pe_resource_t *rsc, pe_node_t **node)
node              856 lib/pacemaker/pcmk_sched_resource.c     if (*node != NULL) {
node              858 lib/pacemaker/pcmk_sched_resource.c                                                   (*node)->details->id);
node              861 lib/pacemaker/pcmk_sched_resource.c                          rsc->id, pe__node_name(*node));
node              862 lib/pacemaker/pcmk_sched_resource.c             *node = NULL;
node              204 lib/pacemaker/pcmk_sched_utilization.c     pe_node_t *node;
node              225 lib/pacemaker/pcmk_sched_utilization.c     node_value_s = g_hash_table_lookup(data->node->details->utilization, key);
node              233 lib/pacemaker/pcmk_sched_utilization.c                   (const char *) key, pe__node_name(data->node), remaining,
node              250 lib/pacemaker/pcmk_sched_utilization.c have_enough_capacity(pe_node_t *node, const char *rsc_id,
node              254 lib/pacemaker/pcmk_sched_utilization.c         .node = node,
node              301 lib/pacemaker/pcmk_sched_utilization.c     pe_node_t *node = NULL;
node              333 lib/pacemaker/pcmk_sched_utilization.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              334 lib/pacemaker/pcmk_sched_utilization.c         if (!pcmk__node_available(node, true, false)) {
node              338 lib/pacemaker/pcmk_sched_utilization.c         if (have_enough_capacity(node, rscs_id, unallocated_utilization)) {
node              344 lib/pacemaker/pcmk_sched_utilization.c             || (pcmk__compare_node_capacities(node, most_capable_node) < 0)) {
node              345 lib/pacemaker/pcmk_sched_utilization.c             most_capable_node = node;
node              352 lib/pacemaker/pcmk_sched_utilization.c         while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              353 lib/pacemaker/pcmk_sched_utilization.c             if (pcmk__node_available(node, true, false)
node              354 lib/pacemaker/pcmk_sched_utilization.c                 && !have_enough_capacity(node, rscs_id,
node              357 lib/pacemaker/pcmk_sched_utilization.c                              pe__node_name(node), rscs_id);
node              358 lib/pacemaker/pcmk_sched_utilization.c                 resource_location(rsc, node, -INFINITY, "__limit_utilization__",
node              367 lib/pacemaker/pcmk_sched_utilization.c         while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              368 lib/pacemaker/pcmk_sched_utilization.c             if (pcmk__node_available(node, true, false)
node              369 lib/pacemaker/pcmk_sched_utilization.c                 && !have_enough_capacity(node, rsc->id, rsc->utilization)) {
node              371 lib/pacemaker/pcmk_sched_utilization.c                              pe__node_name(node), rsc->id);
node              372 lib/pacemaker/pcmk_sched_utilization.c                 resource_location(rsc, node, -INFINITY, "__limit_utilization__",
node              397 lib/pacemaker/pcmk_sched_utilization.c new_load_stopped_op(const pe_node_t *node, pe_working_set_t *data_set)
node              400 lib/pacemaker/pcmk_sched_utilization.c                                                 node->details->uname);
node              403 lib/pacemaker/pcmk_sched_utilization.c     if (load_stopped->node == NULL) {
node              404 lib/pacemaker/pcmk_sched_utilization.c         load_stopped->node = pe__copy_node(node);
node              422 lib/pacemaker/pcmk_sched_utilization.c     pe_node_t *node = NULL;
node              430 lib/pacemaker/pcmk_sched_utilization.c         node = (pe_node_t *) iter->data;
node              431 lib/pacemaker/pcmk_sched_utilization.c         load_stopped = new_load_stopped_op(node, rsc->cluster);
node              438 lib/pacemaker/pcmk_sched_utilization.c         node = (pe_node_t *) iter->data;
node              439 lib/pacemaker/pcmk_sched_utilization.c         load_stopped = new_load_stopped_op(node, rsc->cluster);
node              462 lib/pacemaker/pcmk_sched_utilization.c         pe_node_t *node = (pe_node_t *) iter->data;
node              465 lib/pacemaker/pcmk_sched_utilization.c         out->message(out, "node-capacity", node, desc);
node               52 lib/pacemaker/pcmk_simulate.c     if (action->node != NULL) {
node               53 lib/pacemaker/pcmk_simulate.c         action_host = action->node->details->uname;
node              467 lib/pacemaker/pcmk_simulate.c     const char *node = crm_element_value(action->xml, XML_LRM_ATTR_TARGET);
node              471 lib/pacemaker/pcmk_simulate.c     out->message(out, "inject-pseudo-action", node, task);
node              506 lib/pacemaker/pcmk_simulate.c     char *node = crm_element_value_copy(action->xml, XML_LRM_ATTR_TARGET);
node              513 lib/pacemaker/pcmk_simulate.c         crm_debug("No history injection for %s op on %s", operation, node);
node              519 lib/pacemaker/pcmk_simulate.c         free(node);
node              531 lib/pacemaker/pcmk_simulate.c         free(node);
node              546 lib/pacemaker/pcmk_simulate.c         out->message(out, "inject-rsc-action", resource, operation, node,
node              562 lib/pacemaker/pcmk_simulate.c     cib_node = pcmk__inject_node(fake_cib, node,
node              563 lib/pacemaker/pcmk_simulate.c                                  ((router_node == NULL)? uuid: node));
node              574 lib/pacemaker/pcmk_simulate.c         free(node);
node              582 lib/pacemaker/pcmk_simulate.c     out->message(out, "inject-rsc-action", resource, op->op_type, node,
node              593 lib/pacemaker/pcmk_simulate.c                                 op->interval_ms, node);
node              604 lib/pacemaker/pcmk_simulate.c                                     op->op_type, op->interval_ms, node);
node              639 lib/pacemaker/pcmk_simulate.c     free(node);
node              658 lib/pacemaker/pcmk_simulate.c     const char *node = crm_element_value(action->xml, XML_LRM_ATTR_TARGET);
node              663 lib/pacemaker/pcmk_simulate.c     out->message(out, "inject-cluster-action", node, task, rsc);
node              334 lib/pacemaker/pcmk_status.c         pe_node_t *node = (pe_node_t *) iter->data;
node              336 lib/pacemaker/pcmk_status.c         if (node->details->standby && node->details->online) {
node              338 lib/pacemaker/pcmk_status.c         } else if (node->details->maintenance && node->details->online) {
node              340 lib/pacemaker/pcmk_status.c         } else if (node->details->online) {
node              344 lib/pacemaker/pcmk_status.c             pcmk__add_word(&offline_nodes, 0, pe__node_name(node));
node              456 lib/pengine/bundle.c         pe_node_t *node = NULL;
node              506 lib/pengine/bundle.c         node = pe_find_node(parent->cluster->nodes, uname);
node              507 lib/pengine/bundle.c         if (node == NULL) {
node              508 lib/pengine/bundle.c             node = pe_create_node(uname, uname, "remote", "-INFINITY",
node              511 lib/pengine/bundle.c             node->weight = -INFINITY;
node              513 lib/pengine/bundle.c         node->rsc_discover_mode = pe_discover_never;
node              535 lib/pengine/bundle.c         replica->node = pe__copy_node(node);
node              536 lib/pengine/bundle.c         replica->node->weight = 500;
node              537 lib/pengine/bundle.c         replica->node->rsc_discover_mode = pe_discover_exclusive;
node              545 lib/pengine/bundle.c                             (gpointer) replica->node->details->id,
node              546 lib/pengine/bundle.c                             pe__copy_node(replica->node));
node              549 lib/pengine/bundle.c             pe_node_t *copy = pe__copy_node(replica->node);
node              552 lib/pengine/bundle.c                                 (gpointer) replica->node->details->id, copy);
node              560 lib/pengine/bundle.c         while (g_hash_table_iter_next(&gIter, NULL, (void **)&node)) {
node              561 lib/pengine/bundle.c             if (pe__is_guest_or_remote_node(node)) {
node              563 lib/pengine/bundle.c                 node->weight = -INFINITY;
node              567 lib/pengine/bundle.c         replica->node->details->remote_rsc = replica->remote;
node              575 lib/pengine/bundle.c         g_hash_table_insert(replica->node->details->attrs,
node              713 lib/pengine/bundle.c     pe_node_t *node = NULL;
node              725 lib/pengine/bundle.c     node = replica->container->allocated_to;
node              726 lib/pengine/bundle.c     if (node == NULL) {
node              730 lib/pengine/bundle.c         node = pe__current_node(replica->container);
node              733 lib/pengine/bundle.c     if(node == NULL) {
node              739 lib/pengine/bundle.c               rsc->id, pe__node_name(node));
node              741 lib/pengine/bundle.c         crm_xml_add(xml, field, node->details->uname);
node              744 lib/pengine/bundle.c     return node->details->uname;
node             1140 lib/pengine/bundle.c pe__find_bundle_replica(const pe_resource_t *bundle, const pe_node_t *node)
node             1143 lib/pengine/bundle.c     CRM_ASSERT(bundle && node);
node             1150 lib/pengine/bundle.c         CRM_ASSERT(replica && replica->node);
node             1151 lib/pengine/bundle.c         if (replica->node->details == node->details) {
node             1319 lib/pengine/bundle.c                                pe_node_t *node, uint32_t show_opts)
node             1342 lib/pengine/bundle.c     pe__common_output_html(out, rsc, buffer, node, show_opts);
node             1447 lib/pengine/bundle.c                                pe_node_t *node, uint32_t show_opts)
node             1470 lib/pengine/bundle.c     pe__common_output_text(out, rsc, buffer, node, show_opts);
node             1581 lib/pengine/bundle.c     pe_node_t *node = NULL;
node             1603 lib/pengine/bundle.c     node = pe__current_node(replica->container);
node             1604 lib/pengine/bundle.c     common_print(rsc, pre_text, buffer, node, options, print_data);
node             1686 lib/pengine/bundle.c     if (replica->node) {
node             1687 lib/pengine/bundle.c         free(replica->node);
node             1688 lib/pengine/bundle.c         replica->node = NULL;
node              724 lib/pengine/clone.c                 pe_node_t *node = (pe_node_t *)nIter->data;
node              726 lib/pengine/clone.c                 if (pe_find_node(rsc->running_on, node->details->uname) == NULL) {
node              727 lib/pengine/clone.c                     pcmk__add_word(&stopped_list, 1024, node->details->uname);
node             1028 lib/pengine/clone.c                 pe_node_t *node = (pe_node_t *)nIter->data;
node             1030 lib/pengine/clone.c                 if (pe_find_node(rsc->running_on, node->details->uname) == NULL &&
node             1031 lib/pengine/clone.c                     pcmk__str_in_list(node->details->uname, only_node,
node             1033 lib/pengine/clone.c                     xmlNode *probe_op = pe__failed_probe_for_rsc(rsc, node->details->uname);
node             1047 lib/pengine/clone.c                         g_hash_table_insert(stopped, strdup(node->details->uname),
node             1050 lib/pengine/clone.c                         g_hash_table_insert(stopped, strdup(node->details->uname),
node              522 lib/pengine/common.c pe_node_attribute_calculated(const pe_node_t *node, const char *name,
node              527 lib/pengine/common.c     if(node == NULL) {
node              531 lib/pengine/common.c         return g_hash_table_lookup(node->details->attrs, name);
node              536 lib/pengine/common.c         return g_hash_table_lookup(node->details->attrs, name);
node              546 lib/pengine/common.c     CRM_ASSERT(node->details->remote_rsc);
node              547 lib/pengine/common.c     CRM_ASSERT(node->details->remote_rsc->container);
node              549 lib/pengine/common.c     if(node->details->remote_rsc->container->running_on) {
node              550 lib/pengine/common.c         pe_node_t *host = node->details->remote_rsc->container->running_on->data;
node              557 lib/pengine/common.c                  rsc->id, name, node->details->remote_rsc->container->id);
node              562 lib/pengine/common.c pe_node_attribute_raw(const pe_node_t *node, const char *name)
node              564 lib/pengine/common.c     if(node == NULL) {
node              567 lib/pengine/common.c     return g_hash_table_lookup(node->details->attrs, name);
node              143 lib/pengine/complex.c                     pe_node_t * node, pe_working_set_t * data_set)
node              160 lib/pengine/complex.c     if (node) {
node              161 lib/pengine/complex.c         rule_data.node_hash = node->details->attrs;
node              193 lib/pengine/complex.c                    const pe_node_t *node, pe_working_set_t *data_set)
node              204 lib/pengine/complex.c     if (node) {
node              205 lib/pengine/complex.c         rule_data.node_hash = node->details->attrs;
node              213 lib/pengine/complex.c         get_rsc_attributes(meta_hash, rsc->parent, node, data_set);
node              429 lib/pengine/complex.c pe_rsc_params(pe_resource_t *rsc, const pe_node_t *node,
node              444 lib/pengine/complex.c     if ((node != NULL) && (node->details->uname != NULL)) {
node              445 lib/pengine/complex.c         node_name = node->details->uname;
node              458 lib/pengine/complex.c         get_rsc_attributes(params_on_node, rsc, node, data_set);
node              875 lib/pengine/complex.c     pe_node_t *node = NULL;
node              877 lib/pengine/complex.c     node = pe_hash_table_lookup(rsc->allowed_nodes, id);
node              878 lib/pengine/complex.c     if (node != NULL) {
node              879 lib/pengine/complex.c         pe_rsc_trace(rsc, "Updating score for %s on %s: %d + %d", rsc->id, id, node->weight, score);
node              880 lib/pengine/complex.c         node->weight = pcmk__add_scores(node->weight, score);
node             1007 lib/pengine/complex.c     pe_node_t *node = NULL;
node             1024 lib/pengine/complex.c         node = node_iter->data;
node             1027 lib/pengine/complex.c         is_happy = node->details->online && !node->details->unclean;
node             1041 lib/pengine/complex.c             if (node->details == rsc->partial_migration_source->details) {
node             1043 lib/pengine/complex.c                 active = node;
node             1051 lib/pengine/complex.c                 active = node;
node             1058 lib/pengine/complex.c             active = node;
node               80 lib/pengine/failcounts.c block_failure(pe_node_t *node, pe_resource_t *rsc, xmlNode *xml_op,
node              131 lib/pengine/failcounts.c                                                node->details->uname, xml_name,
node              251 lib/pengine/failcounts.c pe_get_failcount(pe_node_t *node, pe_resource_t *rsc, time_t *last_failure,
node              264 lib/pengine/failcounts.c     g_hash_table_iter_init(&iter, node->details->attrs);
node              286 lib/pengine/failcounts.c         && block_failure(node, rsc, xml_op, data_set)) {
node              301 lib/pengine/failcounts.c                       rsc->id, pe__node_name(node), rsc->failure_timeout);
node              325 lib/pengine/failcounts.c             failcount += pe_get_failcount(node, filler, &filler_last_failure,
node              337 lib/pengine/failcounts.c                      pcmk__plural_s(failcount), pe__node_name(node));
node              343 lib/pengine/failcounts.c                  pcmk__plural_s(failcount), pe__node_name(node));
node              360 lib/pengine/failcounts.c pe__clear_failcount(pe_resource_t *rsc, pe_node_t *node,
node              366 lib/pengine/failcounts.c     CRM_CHECK(rsc && node && reason && data_set, return NULL);
node              369 lib/pengine/failcounts.c     clear = custom_action(rsc, key, CRM_OP_CLEAR_FAILCOUNT, node, FALSE, TRUE,
node              373 lib/pengine/failcounts.c                rsc->id, pe__node_name(node), reason, clear->uuid);
node               44 lib/pengine/native.c native_priority_to_node(pe_resource_t * rsc, pe_node_t * node, gboolean failed)
node               60 lib/pengine/native.c     node->details->priority += priority;
node               62 lib/pengine/native.c                  pe__node_name(node), node->details->priority,
node               69 lib/pengine/native.c     if (node->details->remote_rsc
node               70 lib/pengine/native.c         && node->details->remote_rsc->container) {
node               71 lib/pengine/native.c         GList *gIter = node->details->remote_rsc->container->running_on;
node               83 lib/pengine/native.c                          pe__node_name(node));
node               89 lib/pengine/native.c native_add_running(pe_resource_t * rsc, pe_node_t * node, pe_working_set_t * data_set, gboolean failed)
node               93 lib/pengine/native.c     CRM_CHECK(node != NULL, return);
node               98 lib/pengine/native.c         if (pcmk__str_eq(a_node->details->id, node->details->id, pcmk__str_casei)) {
node              103 lib/pengine/native.c     pe_rsc_trace(rsc, "Adding %s to %s %s", rsc->id, pe__node_name(node),
node              106 lib/pengine/native.c     rsc->running_on = g_list_append(rsc->running_on, node);
node              108 lib/pengine/native.c         node->details->running_rsc = g_list_append(node->details->running_rsc, rsc);
node              110 lib/pengine/native.c         native_priority_to_node(rsc, node, failed);
node              113 lib/pengine/native.c     if (rsc->variant == pe_native && node->details->maintenance) {
node              121 lib/pengine/native.c         resource_location(rsc, node, INFINITY, "not_managed_default", data_set);
node              123 lib/pengine/native.c         while(p && node->details->online) {
node              125 lib/pengine/native.c             p->running_on = g_list_append(p->running_on, node);
node              176 lib/pengine/native.c                   rsc->id, pe__node_name(node),
node              181 lib/pengine/native.c                      rsc->id, pe__node_name(node));
node              185 lib/pengine/native.c         native_add_running(rsc->parent, node, data_set, FALSE);
node              237 lib/pengine/native.c rsc_is_on_node(pe_resource_t *rsc, const pe_node_t *node, int flags)
node              240 lib/pengine/native.c                  rsc->id, pe__node_name(node));
node              247 lib/pengine/native.c             if (loc->details == node->details) {
node              257 lib/pengine/native.c                && (rsc->allocated_to->details == node->details)) {
node              318 lib/pengine/native.c native_parameter(pe_resource_t * rsc, pe_node_t * node, gboolean create, const char *name,
node              329 lib/pengine/native.c     params = pe_rsc_params(rsc, node, data_set);
node              497 lib/pengine/native.c             pe_node_t *node = (pe_node_t *) gIter->data;
node              500 lib/pengine/native.c                          pcmk__s(node->details->uname, ""), node->details->id,
node              501 lib/pengine/native.c                          pcmk__btoa(node->details->online == FALSE));
node              520 lib/pengine/native.c add_output_node(GString *s, const char *node, bool have_nodes)
node              523 lib/pengine/native.c     g_string_append(s, node);
node              542 lib/pengine/native.c pcmk__native_output_string(pe_resource_t *rsc, const char *name, pe_node_t *node,
node              563 lib/pengine/native.c     if ((node == NULL) && (rsc->lock_node != NULL)) {
node              564 lib/pengine/native.c         node = rsc->lock_node;
node              568 lib/pengine/native.c         node = NULL;
node              594 lib/pengine/native.c     if (node) {
node              595 lib/pengine/native.c         pcmk__add_word(&outstr, 0, pe__node_name(node));
node              600 lib/pengine/native.c         xmlNode *probe_op = pe__failed_probe_for_rsc(rsc, node ? node->details->uname : NULL);
node              611 lib/pengine/native.c     if (node && !(node->details->online) && node->details->unclean) {
node              614 lib/pengine/native.c     if (node && (node == rsc->lock_node)) {
node              681 lib/pengine/native.c                        const char *name, pe_node_t *node, uint32_t show_opts)
node              724 lib/pengine/native.c         gchar *s = pcmk__native_output_string(rsc, name, node, show_opts,
node              737 lib/pengine/native.c                        const char *name, pe_node_t *node, uint32_t show_opts)
node              756 lib/pengine/native.c         gchar *s = pcmk__native_output_string(rsc, name, node, show_opts,
node              772 lib/pengine/native.c              pe_node_t *node, long options, void *print_data)
node              822 lib/pengine/native.c         gchar *resource_s = pcmk__native_output_string(rsc, name, node, options,
node              894 lib/pengine/native.c     pe_node_t *node = NULL;
node              902 lib/pengine/native.c     node = pe__current_node(rsc);
node              904 lib/pengine/native.c     if (node == NULL) {
node              906 lib/pengine/native.c         node = rsc->pending_node;
node              909 lib/pengine/native.c     common_print(rsc, pre_text, rsc_printable_id(rsc), node, options, print_data);
node              975 lib/pengine/native.c             pe_node_t *node = (pe_node_t *) gIter->data;
node              978 lib/pengine/native.c                      "name", node->details->uname,
node              979 lib/pengine/native.c                      "id", node->details->id,
node              980 lib/pengine/native.c                      "cached", pcmk__btoa(node->details->online));
node              998 lib/pengine/native.c     pe_node_t *node = pe__current_node(rsc);
node             1006 lib/pengine/native.c     if (node == NULL) {
node             1008 lib/pengine/native.c         node = rsc->pending_node;
node             1010 lib/pengine/native.c     return pe__common_output_html(out, rsc, rsc_printable_id(rsc), node, show_opts);
node             1022 lib/pengine/native.c     pe_node_t *node = pe__current_node(rsc);
node             1030 lib/pengine/native.c     if (node == NULL) {
node             1032 lib/pengine/native.c         node = rsc->pending_node;
node             1034 lib/pengine/native.c     return pe__common_output_text(out, rsc, rsc_printable_id(rsc), node, show_opts);
node             1104 lib/pengine/native.c             pe_node_t *node = (pe_node_t *) gIter->data;
node             1106 lib/pengine/native.c             if (*list == NULL || pe_find_node_id(*list, node->details->id) == NULL) {
node             1107 lib/pengine/native.c                 *list = g_list_append(*list, node);
node             1163 lib/pengine/native.c                 pe_node_t *node = (pe_node_t *) gIter2->data;
node             1166 lib/pengine/native.c                 if (node->details->unclean == FALSE && node->details->online == FALSE &&
node             1171 lib/pengine/native.c                 node_table = g_hash_table_lookup(active_table, node->details->uname);
node             1174 lib/pengine/native.c                     g_hash_table_insert(active_table, strdup(node->details->uname), node_table);
node               54 lib/pengine/pe_actions.c find_existing_action(const char *key, pe_resource_t *rsc, const pe_node_t *node,
node               64 lib/pengine/pe_actions.c                            key, node);
node              168 lib/pengine/pe_actions.c            const pe_node_t *node, bool optional, bool for_graph,
node              181 lib/pengine/pe_actions.c     if (node) {
node              182 lib/pengine/pe_actions.c         action->node = pe__copy_node(node);
node              211 lib/pengine/pe_actions.c                      pe__node_name(node));
node              238 lib/pengine/pe_actions.c             .node_hash = action->node->details->attrs,
node              264 lib/pengine/pe_actions.c     if ((action->rsc != NULL) && (action->node != NULL)
node              270 lib/pengine/pe_actions.c                          action->uuid, pe__node_name(action->node),
node              325 lib/pengine/pe_actions.c     if (action->node == NULL) {
node              331 lib/pengine/pe_actions.c                && !(action->node->details->online)
node              332 lib/pengine/pe_actions.c                && (!pe__is_guest_node(action->node)
node              333 lib/pengine/pe_actions.c                    || action->node->details->remote_requires_reset)) {
node              337 lib/pengine/pe_actions.c                    action->uuid, pe__node_name(action->node));
node              341 lib/pengine/pe_actions.c             && !(action->node->details->unclean)) {
node              342 lib/pengine/pe_actions.c             pe_fence_node(data_set, action->node, "stop is unrunnable", false);
node              346 lib/pengine/pe_actions.c                && action->node->details->pending) {
node              350 lib/pengine/pe_actions.c                    action->uuid, pe__node_name(action->node));
node              354 lib/pengine/pe_actions.c         if (pe__is_guest_node(action->node)
node              355 lib/pengine/pe_actions.c             && !pe_can_fence(data_set, action->node)) {
node              363 lib/pengine/pe_actions.c                          action->uuid, pe__node_name(action->node));
node              368 lib/pengine/pe_actions.c                          action->uuid, pe__node_name(action->node));
node              376 lib/pengine/pe_actions.c                              action->uuid, pe__node_name(action->node));
node              386 lib/pengine/pe_actions.c                                  action->uuid, pe__node_name(action->node));
node              732 lib/pengine/pe_actions.c         GHashTable *params = pe_rsc_params(action->rsc, action->node, data_set);
node              962 lib/pengine/pe_actions.c         if (action->node != NULL) {
node             1014 lib/pengine/pe_actions.c node_priority_fencing_delay(pe_node_t * node, pe_working_set_t * data_set)
node             1029 lib/pengine/pe_actions.c     if (node->details->type != node_member) {
node             1034 lib/pengine/pe_actions.c     if (node->details->online) {
node             1073 lib/pengine/pe_actions.c     if (node->details->priority < top_priority) {
node             1081 lib/pengine/pe_actions.c pe_fence_op(pe_node_t * node, const char *op, bool optional, const char *reason,
node             1091 lib/pengine/pe_actions.c     op_key = crm_strdup_printf("%s-%s-%s", CRM_OP_FENCE, node->details->uname, op);
node             1095 lib/pengine/pe_actions.c         stonith_op = custom_action(NULL, op_key, CRM_OP_FENCE, node, TRUE, TRUE, data_set);
node             1097 lib/pengine/pe_actions.c         add_hash_param(stonith_op->meta, XML_LRM_ATTR_TARGET, node->details->uname);
node             1098 lib/pengine/pe_actions.c         add_hash_param(stonith_op->meta, XML_LRM_ATTR_TARGET_UUID, node->details->id);
node             1118 lib/pengine/pe_actions.c                 data = pe__compare_fencing_digest(match, agent, node, data_set);
node             1123 lib/pengine/pe_actions.c                                pe__node_name(node), match->id);
node             1129 lib/pengine/pe_actions.c                                   pe__node_name(node), match->id);
node             1174 lib/pengine/pe_actions.c             char *delay_s = pcmk__itoa(node_priority_fencing_delay(node, data_set));
node             1181 lib/pengine/pe_actions.c     if(optional == FALSE && pe_can_fence(data_set, node)) {
node             1210 lib/pengine/pe_actions.c     free(action->node);
node             1313 lib/pengine/pe_actions.c         } else if (action->node == NULL) {
node             1316 lib/pengine/pe_actions.c         } else if (on_node->details == action->node->details) {
node             1342 lib/pengine/pe_actions.c         } else if (action->node == NULL) {
node             1346 lib/pengine/pe_actions.c             action->node = pe__copy_node(on_node);
node             1349 lib/pengine/pe_actions.c         } else if (on_node->details == action->node->details) {
node             1372 lib/pengine/pe_actions.c         if ((action->node != NULL)
node             1374 lib/pengine/pe_actions.c             && pcmk__str_eq(on_node->details->id, action->node->details->id,
node             1398 lib/pengine/pe_actions.c pe__resource_actions(const pe_resource_t *rsc, const pe_node_t *node,
node             1405 lib/pengine/pe_actions.c         result = find_actions_exact(rsc->actions, key, node);
node             1407 lib/pengine/pe_actions.c         result = find_actions(rsc->actions, key, node);
node             1473 lib/pengine/pe_actions.c pe__clear_resource_history(pe_resource_t *rsc, pe_node_t *node,
node             1478 lib/pengine/pe_actions.c     CRM_ASSERT(rsc && node);
node             1480 lib/pengine/pe_actions.c     return custom_action(rsc, key, CRM_OP_LRM_DELETE, node, FALSE, TRUE,
node              100 lib/pengine/pe_digest.c                       pe_node_t *node, GHashTable *params,
node              131 lib/pengine/pe_digest.c                            task, node, TRUE, FALSE, data_set);
node              299 lib/pengine/pe_digest.c                       pe_node_t *node, xmlNode *xml_op, GHashTable *overrides,
node              324 lib/pengine/pe_digest.c     params = pe_rsc_params(rsc, node, data_set);
node              325 lib/pengine/pe_digest.c     calculate_main_digest(data, rsc, node, params, task, interval_ms, xml_op,
node              351 lib/pengine/pe_digest.c                   pe_node_t *node, xmlNode *xml_op, bool calc_secure,
node              357 lib/pengine/pe_digest.c     data = g_hash_table_lookup(node->details->digest_cache, key);
node              359 lib/pengine/pe_digest.c         data = pe__calculate_digests(rsc, task, &interval_ms, node, xml_op,
node              362 lib/pengine/pe_digest.c         g_hash_table_insert(node->details->digest_cache, strdup(key), data);
node              380 lib/pengine/pe_digest.c rsc_action_digest_cmp(pe_resource_t * rsc, xmlNode * xml_op, pe_node_t * node,
node              391 lib/pengine/pe_digest.c     CRM_ASSERT(node != NULL);
node              398 lib/pengine/pe_digest.c     data = rsc_action_digest(rsc, task, interval_ms, node, xml_op,
node              405 lib/pengine/pe_digest.c                     interval_ms, task, rsc->id, pe__node_name(node),
node              431 lib/pengine/pe_digest.c                         interval_ms, task, rsc->id, pe__node_name(node),
node              439 lib/pengine/pe_digest.c                         interval_ms, task, rsc->id, pe__node_name(node),
node              533 lib/pengine/pe_digest.c                            pe_node_t *node, pe_working_set_t *data_set)
node              539 lib/pengine/pe_digest.c                                                 node, NULL, TRUE, data_set);
node              542 lib/pengine/pe_digest.c     node_summary = pe_node_attribute_raw(node, CRM_ATTR_DIGESTS_ALL);
node              556 lib/pengine/pe_digest.c     node_summary = pe_node_attribute_raw(node, CRM_ATTR_DIGESTS_SECURE);
node              564 lib/pengine/pe_digest.c                       pe__node_name(node));
node              579 lib/pengine/pe_digest.c                       pe__node_name(node), digest);
node              586 lib/pengine/pe_digest.c                    rsc->id, pe__node_name(node), digest);
node               94 lib/pengine/pe_health.c pe__sum_node_health_scores(const pe_node_t *node, int base_health)
node               96 lib/pengine/pe_health.c     CRM_ASSERT(node != NULL);
node               97 lib/pengine/pe_health.c     g_hash_table_foreach(node->details->attrs, add_node_health_value,
node              112 lib/pengine/pe_health.c pe__node_health(pe_node_t *node)
node              121 lib/pengine/pe_health.c     CRM_ASSERT(node != NULL);
node              123 lib/pengine/pe_health.c     strategy = pe__health_strategy(node->details->data_set);
node              128 lib/pengine/pe_health.c     g_hash_table_iter_init(&iter, node->details->attrs);
node               16 lib/pengine/pe_notif.c     pe_node_t *node;
node               68 lib/pengine/pe_notif.c     if ((entry_a->node == NULL) && (entry_b->node == NULL)) {
node               71 lib/pengine/pe_notif.c     if (entry_a->node == NULL) {
node               74 lib/pengine/pe_notif.c     if (entry_b->node == NULL) {
node               79 lib/pengine/pe_notif.c     return strcmp(entry_a->node->details->id, entry_b->node->details->id);
node               98 lib/pengine/pe_notif.c     dup->node = entry->node;
node              126 lib/pengine/pe_notif.c         pe_node_t *node = (pe_node_t *) iter->data;
node              128 lib/pengine/pe_notif.c         if (node->details->uname == NULL) {
node              134 lib/pengine/pe_notif.c             pcmk__add_word(all_node_names, 1024, node->details->uname);
node              139 lib/pengine/pe_notif.c             if (pe__is_guest_node(node)
node              140 lib/pengine/pe_notif.c                 && (node->details->remote_rsc->container->running_on != NULL)) {
node              141 lib/pengine/pe_notif.c                 node = pe__current_node(node->details->remote_rsc->container);
node              142 lib/pengine/pe_notif.c                 if (node->details->uname == NULL) {
node              146 lib/pengine/pe_notif.c             pcmk__add_word(host_node_names, 1024, node->details->uname);
node              201 lib/pengine/pe_notif.c         CRM_LOG_ASSERT((node_names == NULL) || (entry->node != NULL));
node              202 lib/pengine/pe_notif.c         if ((node_names != NULL) && (entry->node == NULL)) {
node              215 lib/pengine/pe_notif.c         if ((node_names != NULL) && (entry->node->details->uname != NULL)) {
node              216 lib/pengine/pe_notif.c             pcmk__add_word(node_names, 1024, entry->node->details->uname);
node              306 lib/pengine/pe_notif.c new_notify_action(pe_resource_t *rsc, pe_node_t *node, pe_action_t *op,
node              315 lib/pengine/pe_notif.c     CRM_CHECK((rsc != NULL) && (node != NULL), return NULL);
node              322 lib/pengine/pe_notif.c     } else if (!node->details->online) {
node              329 lib/pengine/pe_notif.c                      rsc->id, pe__node_name(node), skip_reason);
node              337 lib/pengine/pe_notif.c                  rsc->id, pe__node_name(node), value, task);
node              341 lib/pengine/pe_notif.c     notify_action = custom_action(rsc, key, op->task, node,
node              364 lib/pengine/pe_notif.c new_post_notify_action(pe_resource_t *rsc, pe_node_t *node,
node              372 lib/pengine/pe_notif.c     notify = new_notify_action(rsc, node, n_data->post, n_data->post_done,
node              514 lib/pengine/pe_notif.c new_notify_entry(pe_resource_t *rsc, pe_node_t *node)
node              520 lib/pengine/pe_notif.c     entry->node = node;
node              537 lib/pengine/pe_notif.c     pe_node_t *node = NULL;
node              560 lib/pengine/pe_notif.c         node = rsc->running_on->data; // First is sufficient
node              562 lib/pengine/pe_notif.c     entry = new_notify_entry(rsc, node);
node              589 lib/pengine/pe_notif.c                     rsc->id, pe__node_name(node), role2text(rsc->role));
node              602 lib/pengine/pe_notif.c         if (!pcmk_is_set(op->flags, pe_action_optional) && (op->node != NULL)) {
node              605 lib/pengine/pe_notif.c             if ((task == stop_rsc) && op->node->details->unclean) {
node              611 lib/pengine/pe_notif.c             entry = new_notify_entry(rsc, op->node);
node              775 lib/pengine/pe_notif.c     if ((action != NULL) && (action->node != NULL)) {
node              776 lib/pengine/pe_notif.c         pe_resource_t *remote_rsc = action->node->details->remote_rsc;
node              811 lib/pengine/pe_notif.c         if (!pcmk_is_set(op->flags, pe_action_optional) && (op->node != NULL)) {
node              988 lib/pengine/pe_notif.c         add_notify_env(n_data, "notify_stop_uname", stop->node->details->uname);
node               47 lib/pengine/pe_output.c add_extra_info(pe_node_t *node, GList *rsc_list, pe_working_set_t *data_set,
node               59 lib/pengine/pe_output.c             if (add_extra_info(node, rsc->children, data_set, attrname,
node               69 lib/pengine/pe_output.c         params = pe_rsc_params(rsc, node, data_set);
node              162 lib/pengine/pe_output.c     xmlNodePtr node = user_data;
node              163 lib/pengine/pe_output.c     pcmk_create_xml_text_node(node, (const char *) key, (const char *) value);
node              313 lib/pengine/pe_output.c get_node_feature_set(pe_node_t *node) {
node              316 lib/pengine/pe_output.c     if (node->details->online && !pe__is_guest_or_remote_node(node)) {
node              317 lib/pengine/pe_output.c         feature_set = g_hash_table_lookup(node->details->attrs,
node              332 lib/pengine/pe_output.c         pe_node_t *node = gIter->data;
node              333 lib/pengine/pe_output.c         const char *node_feature_set = get_node_feature_set(node);
node              491 lib/pengine/pe_output.c pe__node_display_name(pe_node_t *node, bool print_detail)
node              498 lib/pengine/pe_output.c     CRM_ASSERT((node != NULL) && (node->details != NULL) && (node->details->uname != NULL));
node              501 lib/pengine/pe_output.c     if (print_detail && pe__is_guest_node(node)) {
node              502 lib/pengine/pe_output.c         const pe_resource_t *container = node->details->remote_rsc->container;
node              514 lib/pengine/pe_output.c     if (print_detail && !pcmk__str_eq(node->details->uname, node->details->id, pcmk__str_casei)) {
node              515 lib/pengine/pe_output.c         node_id = node->details->id;
node              519 lib/pengine/pe_output.c     name_len = strlen(node->details->uname) + 1;
node              530 lib/pengine/pe_output.c     strcpy(node_name, node->details->uname);
node              680 lib/pengine/pe_output.c             pe_node_t *node = (pe_node_t *) gIter2->data;
node              682 lib/pengine/pe_output.c             if (node->weight < 0) {
node              684 lib/pengine/pe_output.c                 out->message(out, "ban", node, location, show_opts);
node              829 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "li", NULL);
node              831 lib/pengine/pe_output.c     pcmk_create_html_node(node, "span", NULL, "bold", "Current DC: ");
node              836 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL, buf);
node              840 lib/pengine/pe_output.c             pcmk_create_html_node(node, "span", NULL, "warning",
node              843 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL, " partition");
node              845 lib/pengine/pe_output.c             pcmk_create_html_node(node, "span", NULL, NULL, " with");
node              847 lib/pengine/pe_output.c             pcmk_create_html_node(node, "span", NULL, "warning", " WITHOUT");
node              849 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL, " quorum");
node              851 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, "warning", "NONE");
node              961 lib/pengine/pe_output.c         xmlNodePtr node = pcmk__output_create_xml_node(out, "li", NULL);
node              963 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL, "Resource management: ");
node              964 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, "bold", "DISABLED");
node              965 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL,
node              968 lib/pengine/pe_output.c         xmlNodePtr node = pcmk__output_create_xml_node(out, "li", NULL);
node              970 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL, "Resource management: ");
node              971 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, "bold", "STOPPED");
node              972 lib/pengine/pe_output.c         pcmk_create_html_node(node, "span", NULL, NULL,
node             1083 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "li", NULL);
node             1085 lib/pengine/pe_output.c     pcmk_create_html_node(node, "span", NULL, "bold", "Stack: ");
node             1086 lib/pengine/pe_output.c     pcmk_create_html_node(node, "span", NULL, NULL, stack_s);
node             1361 lib/pengine/pe_output.c     xmlNodePtr node = NULL;
node             1368 lib/pengine/pe_output.c     node = pcmk__output_create_xml_node(out, "failure",
node             1393 lib/pengine/pe_output.c         pcmk__xe_set_props(node, XML_RSC_OP_LAST_CHANGE, rc_change,
node             1462 lib/pengine/pe_output.c status_node(pe_node_t *node, xmlNodePtr parent, uint32_t show_opts)
node             1464 lib/pengine/pe_output.c     int health = pe__node_health(node);
node             1467 lib/pengine/pe_output.c     if (node->details->online) {
node             1474 lib/pengine/pe_output.c     if (node->details->standby_onfail && (node->details->running_rsc != NULL)) {
node             1478 lib/pengine/pe_output.c     } else if (node->details->standby_onfail) {
node             1481 lib/pengine/pe_output.c     } else if (node->details->standby && (node->details->running_rsc != NULL)) {
node             1484 lib/pengine/pe_output.c     } else if (node->details->standby) {
node             1489 lib/pengine/pe_output.c     if (node->details->maintenance) {
node             1505 lib/pengine/pe_output.c         const char *feature_set = get_node_feature_set(node);
node             1518 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             1524 lib/pengine/pe_output.c     char *node_name = pe__node_display_name(node, pcmk_is_set(show_opts, pcmk_show_node_id));
node             1530 lib/pengine/pe_output.c             GList *rscs = pe__filter_rsc_list(node->details->running_rsc, only_rsc);
node             1535 lib/pengine/pe_output.c             status_node(node, item_node, show_opts);
node             1554 lib/pengine/pe_output.c             status_node(node, item_node, show_opts);
node             1556 lib/pengine/pe_output.c             for (lpc2 = node->details->running_rsc; lpc2 != NULL; lpc2 = lpc2->next) {
node             1574 lib/pengine/pe_output.c             status_node(node, item_node, show_opts);
node             1595 lib/pengine/pe_output.c node_text_status(pe_node_t *node)
node             1597 lib/pengine/pe_output.c     if (node->details->unclean) {
node             1598 lib/pengine/pe_output.c         if (node->details->online) {
node             1601 lib/pengine/pe_output.c         } else if (node->details->pending) {
node             1608 lib/pengine/pe_output.c     } else if (node->details->pending) {
node             1611 lib/pengine/pe_output.c     } else if (node->details->standby_onfail && node->details->online) {
node             1614 lib/pengine/pe_output.c     } else if (node->details->standby) {
node             1615 lib/pengine/pe_output.c         if (node->details->online) {
node             1616 lib/pengine/pe_output.c             if (node->details->running_rsc) {
node             1625 lib/pengine/pe_output.c     } else if (node->details->maintenance) {
node             1626 lib/pengine/pe_output.c         if (node->details->online) {
node             1632 lib/pengine/pe_output.c     } else if (node->details->online) {
node             1642 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             1649 lib/pengine/pe_output.c         char *node_name = pe__node_display_name(node, pcmk_is_set(show_opts, pcmk_show_node_id));
node             1651 lib/pengine/pe_output.c         int health = pe__node_health(node);
node             1654 lib/pengine/pe_output.c         if (pe__is_guest_node(node)) {
node             1656 lib/pengine/pe_output.c         } else if (pe__is_remote_node(node)) {
node             1661 lib/pengine/pe_output.c         pcmk__g_strcat(str, " ", node_name, ": ", node_text_status(node), NULL);
node             1669 lib/pengine/pe_output.c             const char *feature_set = get_node_feature_set(node);
node             1678 lib/pengine/pe_output.c                 GList *rscs = pe__filter_rsc_list(node->details->running_rsc, only_rsc);
node             1699 lib/pengine/pe_output.c                 for (gIter2 = node->details->running_rsc; gIter2 != NULL; gIter2 = gIter2->next) {
node             1717 lib/pengine/pe_output.c         char *node_name = pe__node_display_name(node, pcmk_is_set(show_opts, pcmk_show_node_id));
node             1728 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             1736 lib/pengine/pe_output.c         char *length_s = pcmk__itoa(g_list_length(node->details->running_rsc));
node             1737 lib/pengine/pe_output.c         int health = pe__node_health(node);
node             1741 lib/pengine/pe_output.c         switch (node->details->type) {
node             1761 lib/pengine/pe_output.c         feature_set = get_node_feature_set(node);
node             1764 lib/pengine/pe_output.c                                  "name", node->details->uname,
node             1765 lib/pengine/pe_output.c                                  "id", node->details->id,
node             1766 lib/pengine/pe_output.c                                  "online", pcmk__btoa(node->details->online),
node             1767 lib/pengine/pe_output.c                                  "standby", pcmk__btoa(node->details->standby),
node             1768 lib/pengine/pe_output.c                                  "standby_onfail", pcmk__btoa(node->details->standby_onfail),
node             1769 lib/pengine/pe_output.c                                  "maintenance", pcmk__btoa(node->details->maintenance),
node             1770 lib/pengine/pe_output.c                                  "pending", pcmk__btoa(node->details->pending),
node             1771 lib/pengine/pe_output.c                                  "unclean", pcmk__btoa(node->details->unclean),
node             1774 lib/pengine/pe_output.c                                  "shutdown", pcmk__btoa(node->details->shutdown),
node             1775 lib/pengine/pe_output.c                                  "expected_up", pcmk__btoa(node->details->expected_up),
node             1776 lib/pengine/pe_output.c                                  "is_dc", pcmk__btoa(node->details->is_dc),
node             1780 lib/pengine/pe_output.c         if (pe__is_guest_node(node)) {
node             1782 lib/pengine/pe_output.c             crm_xml_add(xml_node, "id_as_resource", node->details->remote_rsc->container->id);
node             1788 lib/pengine/pe_output.c             for (lpc = node->details->running_rsc; lpc != NULL; lpc = lpc->next) {
node             1802 lib/pengine/pe_output.c                                        "name", node->details->uname,
node             1896 lib/pengine/pe_output.c         pe_node_t *node = pe__current_node(rsc);
node             1900 lib/pengine/pe_output.c         if (node == NULL) {
node             1901 lib/pengine/pe_output.c             node = rsc->pending_node;
node             1904 lib/pengine/pe_output.c         node_str = pcmk__native_output_string(rsc, rsc_printable_id(rsc), node,
node             1942 lib/pengine/pe_output.c     xmlNode *node = NULL;
node             1946 lib/pengine/pe_output.c     node = pcmk__output_create_xml_node(out, "operation",
node             1965 lib/pengine/pe_output.c         pcmk__xe_set_props(node, "rsc", rsc_printable_id(rsc),
node             1973 lib/pengine/pe_output.c         pcmk__xe_set_props(node, XML_RSC_OP_LAST_CHANGE,
node             1990 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "attribute",
node             1997 lib/pengine/pe_output.c         crm_xml_add(node, "expected", buf);
node             2018 lib/pengine/pe_output.c         pe_node_t *node = gIter->data;
node             2024 lib/pengine/pe_output.c         if (!node || !node->details || !node->details->online) {
node             2028 lib/pengine/pe_output.c         g_hash_table_iter_init(&iter, node->details->attrs);
node             2037 lib/pengine/pe_output.c         if (!pcmk__str_in_list(node->details->uname, only_node, pcmk__str_star_matches|pcmk__str_casei)) {
node             2044 lib/pengine/pe_output.c         out->message(out, "node", node, show_opts, false, only_node, only_rsc);
node             2052 lib/pengine/pe_output.c             value = pe_node_attribute_raw(node, name);
node             2054 lib/pengine/pe_output.c             add_extra = add_extra_info(node, node->details->running_rsc,
node             2074 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2078 lib/pengine/pe_output.c                                         comment, pe__node_name(node));
node             2080 lib/pengine/pe_output.c     g_hash_table_foreach(node->details->utilization, append_dump_text, &dump_text);
node             2091 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2095 lib/pengine/pe_output.c                                                        "node", node->details->uname,
node             2098 lib/pengine/pe_output.c     g_hash_table_foreach(node->details->utilization, add_dump_node, xml_node);
node             2108 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2149 lib/pengine/pe_output.c             int failcount = pe_get_failcount(node, rsc, &last_failure, pe_fc_default,
node             2158 lib/pengine/pe_output.c                 out->message(out, "node", node, show_opts, false, only_node,
node             2175 lib/pengine/pe_output.c                 out->message(out, "node", node, show_opts, false, only_node,
node             2179 lib/pengine/pe_output.c             out->message(out, "resource-operation-list", data_set, rsc, node,
node             2200 lib/pengine/pe_output.c         pe_node_t *node = (pe_node_t *) gIter->data;
node             2202 lib/pengine/pe_output.c         if (!pcmk__str_in_list(node->details->uname, only_node,
node             2209 lib/pengine/pe_output.c         out->message(out, "node", node, show_opts, true, only_node, only_rsc);
node             2235 lib/pengine/pe_output.c         pe_node_t *node = (pe_node_t *) gIter->data;
node             2236 lib/pengine/pe_output.c         char *node_name = pe__node_display_name(node, pcmk_is_set(show_opts, pcmk_show_node_id));
node             2238 lib/pengine/pe_output.c         if (!pcmk__str_in_list(node->details->uname, only_node,
node             2247 lib/pengine/pe_output.c         if (node->details->unclean || node->details->pending
node             2248 lib/pengine/pe_output.c             || (node->details->standby_onfail && node->details->online)
node             2249 lib/pengine/pe_output.c             || node->details->standby || node->details->maintenance
node             2252 lib/pengine/pe_output.c             || (pe__node_health(node) <= 0)) {
node             2255 lib/pengine/pe_output.c         } else if (node->details->online) {
node             2257 lib/pengine/pe_output.c             if (pe__is_guest_node(node)) {
node             2260 lib/pengine/pe_output.c             } else if (pe__is_remote_node(node)) {
node             2271 lib/pengine/pe_output.c             if (pe__is_remote_node(node)) {
node             2274 lib/pengine/pe_output.c             } else if (pe__is_guest_node(node)) {
node             2285 lib/pengine/pe_output.c         out->message(out, "node", node, show_opts, true, only_node, only_rsc);
node             2331 lib/pengine/pe_output.c         pe_node_t *node = (pe_node_t *) gIter->data;
node             2333 lib/pengine/pe_output.c         if (!pcmk__str_in_list(node->details->uname, only_node,
node             2338 lib/pengine/pe_output.c         out->message(out, "node", node, show_opts, true, only_node, only_rsc);
node             2367 lib/pengine/pe_output.c         pe_node_t *node = pe_find_node_id(data_set->nodes, ID(node_state));
node             2369 lib/pengine/pe_output.c         if (!node || !node->details || !node->details->online) {
node             2373 lib/pengine/pe_output.c         if (!pcmk__str_in_list(node->details->uname, only_node,
node             2381 lib/pengine/pe_output.c         out->message(out, "node-history-list", data_set, node, node_state,
node             2417 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "node_weight",
node             2424 lib/pengine/pe_output.c         crm_xml_add(node, "id", rsc->id);
node             2458 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "operation_history",
node             2468 lib/pengine/pe_output.c         crm_xml_add(node, "interval", s);
node             2478 lib/pengine/pe_output.c             crm_xml_add(node, XML_RSC_OP_LAST_CHANGE, pcmk__epoch2str(&epoch));
node             2484 lib/pengine/pe_output.c             crm_xml_add(node, XML_RSC_OP_T_EXEC, s);
node             2490 lib/pengine/pe_output.c             crm_xml_add(node, XML_RSC_OP_T_QUEUE, s);
node             2521 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "promotion_score",
node             2527 lib/pengine/pe_output.c         crm_xml_add(node, "node", chosen->details->uname);
node             2594 lib/pengine/pe_output.c     xmlNodePtr node = pcmk__output_xml_create_parent(out, "resource_history",
node             2599 lib/pengine/pe_output.c         pcmk__xe_set_bool_attr(node, "orphan", true);
node             2603 lib/pengine/pe_output.c         pcmk__xe_set_props(node, "orphan", "false",
node             2611 lib/pengine/pe_output.c             crm_xml_add(node, PCMK__FAIL_COUNT_PREFIX, s);
node             2616 lib/pengine/pe_output.c             crm_xml_add(node, PCMK__LAST_FAILURE_PREFIX, pcmk__epoch2str(&last_failure));
node             2755 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2782 lib/pengine/pe_output.c             int failcount = pe_get_failcount(node, rsc, &last_failure, pe_fc_default,
node             2807 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2811 lib/pengine/pe_output.c                                         fn, rsc->id, pe__node_name(node));
node             2825 lib/pengine/pe_output.c     pe_node_t *node = va_arg(args, pe_node_t *);
node             2830 lib/pengine/pe_output.c                                                        "node", node->details->uname,
node             2889 lib/pengine/pe_output.c     xmlNodePtr node = NULL;
node             2891 lib/pengine/pe_output.c     node = pcmk__output_create_xml_node(out, "ticket",
node             2898 lib/pengine/pe_output.c         crm_xml_add(node, "last-granted", pcmk__epoch2str(&ticket->last_granted));
node               77 lib/pengine/pe_status_private.h                                               pe_node_t *node,
node               25 lib/pengine/remote.c pe__is_remote_node(const pe_node_t *node)
node               27 lib/pengine/remote.c     return (node != NULL) && (node->details->type == node_remote)
node               28 lib/pengine/remote.c            && ((node->details->remote_rsc == NULL)
node               29 lib/pengine/remote.c                || (node->details->remote_rsc->container == NULL));
node               33 lib/pengine/remote.c pe__is_guest_node(const pe_node_t *node)
node               35 lib/pengine/remote.c     return (node != NULL) && (node->details->type == node_remote)
node               36 lib/pengine/remote.c            && (node->details->remote_rsc != NULL)
node               37 lib/pengine/remote.c            && (node->details->remote_rsc->container != NULL);
node               41 lib/pengine/remote.c pe__is_guest_or_remote_node(const pe_node_t *node)
node               43 lib/pengine/remote.c     return (node != NULL) && (node->details->type == node_remote);
node               47 lib/pengine/remote.c pe__is_bundle_node(const pe_node_t *node)
node               49 lib/pengine/remote.c     return pe__is_guest_node(node)
node               50 lib/pengine/remote.c            && pe_rsc_is_bundled(node->details->remote_rsc);
node              215 lib/pengine/remote.c     pe_node_t *node;    // Known node corresponding to history entry
node              220 lib/pengine/remote.c pe__add_param_check(xmlNode *rsc_op, pe_resource_t *rsc, pe_node_t *node,
node              225 lib/pengine/remote.c     CRM_CHECK(data_set && rsc_op && rsc && node, return);
node              233 lib/pengine/remote.c     check_op->node = node;
node              255 lib/pengine/remote.c         cb(check_op->rsc, check_op->node, check_op->rsc_op,
node              196 lib/pengine/status.c         pe_node_t *node = (pe_node_t *) iterator->data;
node              199 lib/pengine/status.c         if (node == NULL) {
node              202 lib/pengine/status.c         if (node->details == NULL) {
node              203 lib/pengine/status.c             free(node);
node              210 lib/pengine/status.c         crm_trace("Freeing node %s", (pe__is_guest_or_remote_node(node)?
node              211 lib/pengine/status.c                   "(guest or remote)" : pe__node_name(node)));
node              213 lib/pengine/status.c         if (node->details->attrs != NULL) {
node              214 lib/pengine/status.c             g_hash_table_destroy(node->details->attrs);
node              216 lib/pengine/status.c         if (node->details->utilization != NULL) {
node              217 lib/pengine/status.c             g_hash_table_destroy(node->details->utilization);
node              219 lib/pengine/status.c         if (node->details->digest_cache != NULL) {
node              220 lib/pengine/status.c             g_hash_table_destroy(node->details->digest_cache);
node              222 lib/pengine/status.c         g_list_free(node->details->running_rsc);
node              223 lib/pengine/status.c         g_list_free(node->details->allocated_rsc);
node              224 lib/pengine/status.c         free(node->details);
node              225 lib/pengine/status.c         free(node);
node              432 lib/pengine/status.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              434 lib/pengine/status.c         if (node && pcmk__str_eq(node->details->id, id, pcmk__str_casei)) {
node              435 lib/pengine/status.c             return node;
node              448 lib/pengine/status.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              450 lib/pengine/status.c         if (node && pcmk__str_eq(node->details->uname, uname, pcmk__str_casei)) {
node              451 lib/pengine/status.c             return node;
node               70 lib/pengine/tags.c         pe_node_t *node = pe_find_node_id(data_set->nodes, id);
node               72 lib/pengine/tags.c         if (!node) {
node               77 lib/pengine/tags.c         retval = g_list_append(retval, strdup(node->details->uname));
node               51 lib/pengine/unpack.c static void unpack_rsc_op(pe_resource_t *rsc, pe_node_t *node, xmlNode *xml_op,
node               57 lib/pengine/unpack.c static void add_node_attrs(xmlNode *attrs, pe_node_t *node, bool overwrite,
node               62 lib/pengine/unpack.c static void unpack_node_lrm(pe_node_t *node, xmlNode *xml,
node               70 lib/pengine/unpack.c is_dangling_guest_node(pe_node_t *node)
node               75 lib/pengine/unpack.c     if (pe__is_guest_or_remote_node(node) &&
node               76 lib/pengine/unpack.c         node->details->remote_rsc &&
node               77 lib/pengine/unpack.c         node->details->remote_rsc->container == NULL &&
node               78 lib/pengine/unpack.c         pcmk_is_set(node->details->remote_rsc->flags,
node               95 lib/pengine/unpack.c pe_fence_node(pe_working_set_t * data_set, pe_node_t * node,
node               98 lib/pengine/unpack.c     CRM_CHECK(node, return);
node              101 lib/pengine/unpack.c     if (pe__is_guest_node(node)) {
node              102 lib/pengine/unpack.c         pe_resource_t *rsc = node->details->remote_rsc->container;
node              109 lib/pengine/unpack.c                            pe__node_name(node), reason, rsc->id);
node              113 lib/pengine/unpack.c                          pe__node_name(node), rsc->id, reason);
node              119 lib/pengine/unpack.c                 node->details->remote_requires_reset = TRUE;
node              124 lib/pengine/unpack.c     } else if (is_dangling_guest_node(node)) {
node              128 lib/pengine/unpack.c                  pe__node_name(node), reason);
node              129 lib/pengine/unpack.c         pe__set_resource_flags(node->details->remote_rsc,
node              132 lib/pengine/unpack.c     } else if (pe__is_remote_node(node)) {
node              133 lib/pengine/unpack.c         pe_resource_t *rsc = node->details->remote_rsc;
node              138 lib/pengine/unpack.c                        pe__node_name(node), reason);
node              139 lib/pengine/unpack.c         } else if(node->details->remote_requires_reset == FALSE) {
node              140 lib/pengine/unpack.c             node->details->remote_requires_reset = TRUE;
node              142 lib/pengine/unpack.c                      pe__node_name(node),
node              143 lib/pengine/unpack.c                      pe_can_fence(data_set, node)? "will be fenced" : "is unclean",
node              146 lib/pengine/unpack.c         node->details->unclean = TRUE;
node              148 lib/pengine/unpack.c         pe_fence_op(node, NULL, TRUE, reason, FALSE, data_set);
node              150 lib/pengine/unpack.c     } else if (node->details->unclean) {
node              152 lib/pengine/unpack.c                   pe__node_name(node),
node              153 lib/pengine/unpack.c                   pe_can_fence(data_set, node)? "would also be fenced" : "also is unclean",
node              158 lib/pengine/unpack.c                  pe__node_name(node),
node              159 lib/pengine/unpack.c                  pe_can_fence(data_set, node)? "will be fenced" : "is unclean",
node              161 lib/pengine/unpack.c         node->details->unclean = TRUE;
node              162 lib/pengine/unpack.c         pe_fence_op(node, NULL, TRUE, reason, priority_delay, data_set);
node             1034 lib/pengine/unpack.c unpack_transient_attributes(xmlNode *state, pe_node_t *node,
node             1040 lib/pengine/unpack.c     add_node_attrs(attrs, node, TRUE, data_set);
node             1042 lib/pengine/unpack.c     if (crm_is_true(pe_node_attribute_raw(node, "standby"))) {
node             1043 lib/pengine/unpack.c         crm_info("%s is in standby mode", pe__node_name(node));
node             1044 lib/pengine/unpack.c         node->details->standby = TRUE;
node             1047 lib/pengine/unpack.c     if (crm_is_true(pe_node_attribute_raw(node, "maintenance"))) {
node             1048 lib/pengine/unpack.c         crm_info("%s is in maintenance mode", pe__node_name(node));
node             1049 lib/pengine/unpack.c         node->details->maintenance = TRUE;
node             1052 lib/pengine/unpack.c     discovery = pe_node_attribute_raw(node, XML_NODE_ATTR_RSC_DISCOVERY);
node             1056 lib/pengine/unpack.c                  "is not allowed for cluster nodes", pe__node_name(node));
node             1289 lib/pengine/unpack.c             pe_node_t *node = pe__current_node(container);
node             1291 lib/pengine/unpack.c             if (node) {
node             1292 lib/pengine/unpack.c                 stop_action(container, node, FALSE);
node             1699 lib/pengine/unpack.c         pe_node_t *node;
node             1702 lib/pengine/unpack.c         node = pe_find_node(data_set->nodes, rsc_id);
node             1703 lib/pengine/unpack.c         if (node == NULL) {
node             1704 lib/pengine/unpack.c 	        node = pe_create_node(rsc_id, rsc_id, "remote", NULL, data_set);
node             1708 lib/pengine/unpack.c         if (node) {
node             1710 lib/pengine/unpack.c             node->details->shutdown = TRUE;
node             1730 lib/pengine/unpack.c                         pe_node_t *node, pe_working_set_t *data_set)
node             1738 lib/pengine/unpack.c                  top->id, parent->id, rsc_id, pe__node_name(node));
node             1757 lib/pengine/unpack.c find_anonymous_clone(pe_working_set_t * data_set, pe_node_t * node, pe_resource_t * parent,
node             1771 lib/pengine/unpack.c                  rsc_id, pe__node_name(node), parent->id);
node             1799 lib/pengine/unpack.c             if (((pe_node_t *)locations->data)->details == node->details) {
node             1819 lib/pengine/unpack.c                                    parent->id, pe__node_name(node));
node             1841 lib/pengine/unpack.c                     && (inactive_instance->pending_node->details != node->details)) {
node             1866 lib/pengine/unpack.c         && (!node->details->online || node->details->unclean)
node             1867 lib/pengine/unpack.c         && !pe__is_guest_node(node)
node             1874 lib/pengine/unpack.c         rsc = create_anonymous_orphan(parent, rsc_id, node, data_set);
node             1881 lib/pengine/unpack.c unpack_find_resource(pe_working_set_t * data_set, pe_node_t * node, const char *rsc_id,
node             1920 lib/pengine/unpack.c             rsc = pe__find_bundle_replica(parent->parent, node);
node             1924 lib/pengine/unpack.c             rsc = find_anonymous_clone(data_set, node, parent, base);
node             1935 lib/pengine/unpack.c                      rsc_id, pe__node_name(node), rsc->id,
node             1942 lib/pengine/unpack.c process_orphan_resource(xmlNode * rsc_entry, pe_node_t * node, pe_working_set_t * data_set)
node             1947 lib/pengine/unpack.c     crm_debug("Detected orphan resource %s on %s", rsc_id, pe__node_name(node));
node             1965 lib/pengine/unpack.c process_rsc_state(pe_resource_t * rsc, pe_node_t * node,
node             1975 lib/pengine/unpack.c                  rsc->id, role2text(rsc->role), pe__node_name(node),
node             1983 lib/pengine/unpack.c             if (g_hash_table_lookup(iter->known_on, node->details->id) == NULL) {
node             1984 lib/pengine/unpack.c                 pe_node_t *n = pe__copy_node(node);
node             2002 lib/pengine/unpack.c         && node->details->online == FALSE
node             2003 lib/pengine/unpack.c         && node->details->maintenance == FALSE
node             2015 lib/pengine/unpack.c         if (pe__is_guest_node(node)) {
node             2020 lib/pengine/unpack.c             if (pe__is_remote_node(node) && node->details->remote_rsc
node             2021 lib/pengine/unpack.c                 && !pcmk_is_set(node->details->remote_rsc->flags, pe_rsc_failed)) {
node             2029 lib/pengine/unpack.c                 node->details->unseen = TRUE;
node             2042 lib/pengine/unpack.c             pe_fence_node(data_set, node, reason, FALSE);
node             2050 lib/pengine/unpack.c     if (node->details->unclean) {
node             2064 lib/pengine/unpack.c             demote_action(rsc, node, FALSE);
node             2072 lib/pengine/unpack.c             pe_fence_node(data_set, node, reason, FALSE);
node             2077 lib/pengine/unpack.c             node->details->standby = TRUE;
node             2078 lib/pengine/unpack.c             node->details->standby_onfail = TRUE;
node             2093 lib/pengine/unpack.c             resource_location(rsc, node, -INFINITY, "__action_migration_auto__", data_set);
node             2103 lib/pengine/unpack.c                 stop_action(rsc, node, FALSE);
node             2118 lib/pengine/unpack.c                 stop_action(rsc->container, node, FALSE);
node             2120 lib/pengine/unpack.c                 stop_action(rsc, node, FALSE);
node             2145 lib/pengine/unpack.c                 stop_action(rsc, node, FALSE);
node             2171 lib/pengine/unpack.c                                   rsc->id, pe__node_name(node));
node             2176 lib/pengine/unpack.c                                   rsc->id, pe__node_name(node));
node             2180 lib/pengine/unpack.c         native_add_running(rsc, node, data_set, (save_on_fail != action_fail_ignore));
node             2202 lib/pengine/unpack.c         GList *possible_matches = pe__resource_actions(rsc, node, RSC_STOP,
node             2220 lib/pengine/unpack.c         && rsc->partial_migration_source->details == node->details
node             2230 lib/pengine/unpack.c process_recurring(pe_node_t * node, pe_resource_t * rsc,
node             2251 lib/pengine/unpack.c         if (node->details->online == FALSE) {
node             2253 lib/pengine/unpack.c                          rsc->id, pe__node_name(node));
node             2259 lib/pengine/unpack.c                          id, pe__node_name(node));
node             2264 lib/pengine/unpack.c                          id, pe__node_name(node), counter);
node             2271 lib/pengine/unpack.c                          id, pe__node_name(node));
node             2278 lib/pengine/unpack.c                          id, pe__node_name(node));
node             2284 lib/pengine/unpack.c         pe_rsc_trace(rsc, "Creating %s on %s", key, pe__node_name(node));
node             2285 lib/pengine/unpack.c         custom_action(rsc, key, task, node, TRUE, TRUE, data_set);
node             2339 lib/pengine/unpack.c unpack_shutdown_lock(xmlNode *rsc_entry, pe_resource_t *rsc, pe_node_t *node,
node             2351 lib/pengine/unpack.c                         rsc->id, pe__node_name(node));
node             2352 lib/pengine/unpack.c             pe__clear_resource_history(rsc, node, data_set);
node             2354 lib/pengine/unpack.c             rsc->lock_node = node;
node             2371 lib/pengine/unpack.c unpack_lrm_resource(pe_node_t *node, xmlNode *lrm_resource,
node             2399 lib/pengine/unpack.c               rsc_id, pe__node_name(node));
node             2416 lib/pengine/unpack.c     rsc = unpack_find_resource(data_set, node, rsc_id, lrm_resource);
node             2422 lib/pengine/unpack.c             rsc = process_orphan_resource(lrm_resource, node, data_set);
node             2429 lib/pengine/unpack.c         unpack_shutdown_lock(lrm_resource, rsc, node, data_set);
node             2445 lib/pengine/unpack.c         unpack_rsc_op(rsc, node, rsc_op, &last_failure, &on_fail, data_set);
node             2450 lib/pengine/unpack.c     process_recurring(node, rsc, start_index, stop_index, sorted_op_list, data_set);
node             2455 lib/pengine/unpack.c     process_rsc_state(rsc, node, on_fail, migrate_op, data_set);
node             2525 lib/pengine/unpack.c unpack_node_lrm(pe_node_t *node, xmlNode *xml, pe_working_set_t *data_set)
node             2543 lib/pengine/unpack.c         pe_resource_t *rsc = unpack_lrm_resource(node, rsc_entry, data_set);
node             2574 lib/pengine/unpack.c     pe_node_t *node = value;
node             2577 lib/pengine/unpack.c     node->weight = *score;
node             2581 lib/pengine/unpack.c find_lrm_op(const char *resource, const char *op, const char *node, const char *source,
node             2587 lib/pengine/unpack.c     CRM_CHECK((resource != NULL) && (op != NULL) && (node != NULL),
node             2592 lib/pengine/unpack.c                    "//" XML_CIB_TAG_STATE "[@" XML_ATTR_UNAME "='", node, "']"
node             2797 lib/pengine/unpack.c unpack_migrate_to_success(pe_resource_t *rsc, pe_node_t *node, xmlNode *xml_op,
node             2849 lib/pengine/unpack.c     CRM_CHECK(source && target && !strcmp(source, node->details->uname), return);
node             2900 lib/pengine/unpack.c         rsc->dangling_migrations = g_list_prepend(rsc->dangling_migrations, node);
node             2954 lib/pengine/unpack.c unpack_migrate_to_failure(pe_resource_t *rsc, pe_node_t *node, xmlNode *xml_op,
node             2962 lib/pengine/unpack.c     CRM_CHECK(source && target && !strcmp(source, node->details->uname), return);
node             3001 lib/pengine/unpack.c         rsc->dangling_migrations = g_list_prepend(rsc->dangling_migrations, node);
node             3006 lib/pengine/unpack.c unpack_migrate_from_failure(pe_resource_t *rsc, pe_node_t *node,
node             3014 lib/pengine/unpack.c     CRM_CHECK(source && target && !strcmp(target, node->details->uname), return);
node             3048 lib/pengine/unpack.c record_failed_op(xmlNode *op, const pe_node_t *node,
node             3054 lib/pengine/unpack.c     if (node->details->online == FALSE) {
node             3062 lib/pengine/unpack.c         if(pcmk__str_eq(op_key, key, pcmk__str_casei) && pcmk__str_eq(uname, node->details->uname, pcmk__str_casei)) {
node             3064 lib/pengine/unpack.c                       op_key, pe__node_name(node));
node             3069 lib/pengine/unpack.c     crm_trace("Adding entry %s on %s", op_key, pe__node_name(node));
node             3070 lib/pengine/unpack.c     crm_xml_add(op, XML_ATTR_UNAME, node->details->uname);
node             3195 lib/pengine/unpack.c unpack_rsc_op_failure(pe_resource_t * rsc, pe_node_t * node, int rc, xmlNode * xml_op, xmlNode ** last_failure,
node             3223 lib/pengine/unpack.c                   (is_probe? "probe" : task), rsc->id, pe__node_name(node),
node             3230 lib/pengine/unpack.c                  (is_probe? "probe" : task), rsc->id, pe__node_name(node),
node             3242 lib/pengine/unpack.c                        rsc->id, pe__node_name(node));
node             3245 lib/pengine/unpack.c         record_failed_op(xml_op, node, rsc, data_set);
node             3256 lib/pengine/unpack.c         resource_location(rsc, node, -INFINITY, "__stop_fail__", data_set);
node             3259 lib/pengine/unpack.c         unpack_migrate_to_failure(rsc, node, xml_op, data_set);
node             3262 lib/pengine/unpack.c         unpack_migrate_from_failure(rsc, node, xml_op, data_set);
node             3298 lib/pengine/unpack.c                  pcmk__btoa(node->details->unclean),
node             3348 lib/pengine/unpack.c check_recoverable(pe_resource_t *rsc, pe_node_t *node, const char *task,
node             3356 lib/pengine/unpack.c     if (pe_can_fence(node->details->data_set, node)) {
node             3363 lib/pengine/unpack.c                 CRM_XS " rc=%d id=%s", rsc->id, task, pe__node_name(node),
node             3400 lib/pengine/unpack.c remap_operation(xmlNode *xml_op, pe_resource_t *rsc, pe_node_t *node,
node             3414 lib/pengine/unpack.c             if (!node->details->shutdown || node->details->online) {
node             3415 lib/pengine/unpack.c                 record_failed_op(xml_op, node, rsc, data_set);
node             3463 lib/pengine/unpack.c                  key, pe__node_name(node));
node             3468 lib/pengine/unpack.c                      key, pe__node_name(node),
node             3479 lib/pengine/unpack.c                             rsc->id, pe__node_name(node),
node             3502 lib/pengine/unpack.c                             rsc->id, pe__node_name(node),
node             3525 lib/pengine/unpack.c                     check_recoverable(rsc, node, task, *rc, xml_op);
node             3536 lib/pengine/unpack.c             check_recoverable(rsc, node, task, *rc, xml_op);
node             3544 lib/pengine/unpack.c                          *rc, task, rsc->id, pe__node_name(node),
node             3558 lib/pengine/unpack.c                               pe_resource_t *rsc, pe_node_t *node,
node             3568 lib/pengine/unpack.c             pe__add_param_check(xml_op, rsc, node, pe_check_last_failure,
node             3574 lib/pengine/unpack.c             digest_data = rsc_action_digest_cmp(rsc, xml_op, node, data_set);
node             3579 lib/pengine/unpack.c                               rsc->id, get_op_key(xml_op), node->details->id);
node             3671 lib/pengine/unpack.c check_operation_expiry(pe_resource_t *rsc, pe_node_t *node, int rc,
node             3701 lib/pengine/unpack.c         unexpired_fail_count = pe_get_failcount(node, rsc, &last_failure,
node             3718 lib/pengine/unpack.c         if (pe_get_failcount(node, rsc, NULL, pe_fc_default, xml_op, data_set)) {
node             3745 lib/pengine/unpack.c         && should_clear_for_param_change(xml_op, task, rsc, node, data_set)) {
node             3751 lib/pengine/unpack.c         pe_action_t *clear_op = pe__clear_failcount(rsc, node, clear_reason,
node             3811 lib/pengine/unpack.c update_resource_state(pe_resource_t * rsc, pe_node_t * node, xmlNode * xml_op, const char * task, int rc,
node             3864 lib/pengine/unpack.c         unpack_migrate_to_success(rsc, node, xml_op, data_set);
node             3867 lib/pengine/unpack.c         pe_rsc_trace(rsc, "%s active on %s", rsc->id, pe__node_name(node));
node             3908 lib/pengine/unpack.c unpack_rsc_op(pe_resource_t *rsc, pe_node_t *node, xmlNode *xml_op,
node             3927 lib/pengine/unpack.c     CRM_CHECK(rsc && node && xml_op, return);
node             3957 lib/pengine/unpack.c                  task_key, task, task_id, status, rc, pe__node_name(node),
node             3960 lib/pengine/unpack.c     if (node->details->unclean) {
node             3964 lib/pengine/unpack.c                      rsc->id, pe__node_name(node));
node             3980 lib/pengine/unpack.c         && check_operation_expiry(rsc, node, rc, xml_op, data_set)) {
node             3987 lib/pengine/unpack.c     remap_operation(xml_op, rsc, node, data_set, on_fail, target_rc,
node             4005 lib/pengine/unpack.c                        task_key, pe__node_name(node), rc, target_rc, magic);
node             4008 lib/pengine/unpack.c         } else if(node->details->online && node->details->unclean == FALSE) {
node             4021 lib/pengine/unpack.c                        task_key, pe__node_name(node), rc, target_rc, magic);
node             4030 lib/pengine/unpack.c                    pe__node_name(node));
node             4031 lib/pengine/unpack.c         update_resource_state(rsc, node, xml_op, task, target_rc, *last_failure,
node             4033 lib/pengine/unpack.c         crm_xml_add(xml_op, XML_ATTR_UNAME, node->details->uname);
node             4035 lib/pengine/unpack.c         record_failed_op(xml_op, node, rsc, data_set);
node             4036 lib/pengine/unpack.c         resource_location(parent, node, -INFINITY, "masked-probe-failure", data_set);
node             4045 lib/pengine/unpack.c                    ID(xml_op), task, rsc->id, pe__node_name(node),
node             4057 lib/pengine/unpack.c             } else if (!strcmp(task, CRMD_ACTION_MIGRATE) && node->details->unclean) {
node             4070 lib/pengine/unpack.c                     rsc->pending_node = node;
node             4079 lib/pengine/unpack.c                     rsc->pending_node = node;
node             4087 lib/pengine/unpack.c                          task, rsc->id, pe__node_name(node),
node             4089 lib/pengine/unpack.c             update_resource_state(rsc, node, xml_op, task, rc, *last_failure, on_fail, data_set);
node             4098 lib/pengine/unpack.c                          task, rsc->id, pe__node_name(node), status, rc,
node             4103 lib/pengine/unpack.c             resource_location(parent, node, -INFINITY, "hard-error", data_set);
node             4104 lib/pengine/unpack.c             unpack_rsc_op_failure(rsc, node, rc, xml_op, last_failure, on_fail, data_set);
node             4108 lib/pengine/unpack.c             if (pe__is_guest_or_remote_node(node)
node             4109 lib/pengine/unpack.c                 && pcmk_is_set(node->details->remote_rsc->flags, pe_rsc_managed)) {
node             4116 lib/pengine/unpack.c                 pe__set_resource_flags(node->details->remote_rsc,
node             4144 lib/pengine/unpack.c                  pe__node_name(node), last_change_str(xml_op), rc,
node             4147 lib/pengine/unpack.c         update_resource_state(rsc, node, xml_op, task, target_rc, *last_failure,
node             4149 lib/pengine/unpack.c         crm_xml_add(xml_op, XML_ATTR_UNAME, node->details->uname);
node             4152 lib/pengine/unpack.c         record_failed_op(xml_op, node, rsc, data_set);
node             4160 lib/pengine/unpack.c         unpack_rsc_op_failure(rsc, node, rc, xml_op, last_failure, on_fail,
node             4167 lib/pengine/unpack.c                        parent->id, pe__node_name(node),
node             4171 lib/pengine/unpack.c             resource_location(parent, node, -INFINITY, "hard-error", data_set);
node             4190 lib/pengine/unpack.c add_node_attrs(xmlNode *xml_obj, pe_node_t *node, bool overwrite,
node             4204 lib/pengine/unpack.c     g_hash_table_insert(node->details->attrs,
node             4205 lib/pengine/unpack.c                         strdup(CRM_ATTR_UNAME), strdup(node->details->uname));
node             4207 lib/pengine/unpack.c     g_hash_table_insert(node->details->attrs, strdup(CRM_ATTR_ID),
node             4208 lib/pengine/unpack.c                         strdup(node->details->id));
node             4209 lib/pengine/unpack.c     if (pcmk__str_eq(node->details->id, data_set->dc_uuid, pcmk__str_casei)) {
node             4210 lib/pengine/unpack.c         data_set->dc_node = node;
node             4211 lib/pengine/unpack.c         node->details->is_dc = TRUE;
node             4212 lib/pengine/unpack.c         g_hash_table_insert(node->details->attrs,
node             4215 lib/pengine/unpack.c         g_hash_table_insert(node->details->attrs,
node             4221 lib/pengine/unpack.c         g_hash_table_insert(node->details->attrs, strdup(CRM_ATTR_CLUSTER_NAME),
node             4226 lib/pengine/unpack.c                                node->details->attrs, NULL, overwrite, data_set);
node             4228 lib/pengine/unpack.c     if (pe_node_attribute_raw(node, CRM_ATTR_SITE_NAME) == NULL) {
node             4229 lib/pengine/unpack.c         const char *site_name = pe_node_attribute_raw(node, "site-name");
node             4232 lib/pengine/unpack.c             g_hash_table_insert(node->details->attrs,
node             4238 lib/pengine/unpack.c             g_hash_table_insert(node->details->attrs,
node             4246 lib/pengine/unpack.c extract_operations(const char *node, const char *rsc, xmlNode * rsc_entry, gboolean active_filter)
node             4268 lib/pengine/unpack.c             crm_xml_add(rsc_op, XML_ATTR_UNAME, node);
node             4310 lib/pengine/unpack.c find_operations(const char *rsc, const char *node, gboolean active_filter,
node             4329 lib/pengine/unpack.c             if (node != NULL && !pcmk__str_eq(uname, node, pcmk__str_casei)) {
node               36 lib/pengine/utils.c pe_can_fence(pe_working_set_t *data_set, pe_node_t *node)
node               38 lib/pengine/utils.c     if (pe__is_guest_node(node)) {
node               42 lib/pengine/utils.c         pe_resource_t *rsc = node->details->remote_rsc->container;
node               66 lib/pengine/utils.c     } else if(node == NULL) {
node               69 lib/pengine/utils.c     } else if(node->details->online) {
node               71 lib/pengine/utils.c                    pe__node_name(node));
node               75 lib/pengine/utils.c     crm_trace("Cannot fence %s", pe__node_name(node));
node              115 lib/pengine/utils.c     pe_node_t *node = NULL;
node              118 lib/pengine/utils.c     while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node              120 lib/pengine/utils.c         other_node = pe_find_node_id(list, node->details->id);
node              122 lib/pengine/utils.c             node->weight = -INFINITY;
node              124 lib/pengine/utils.c             node->weight = pcmk__add_scores(node->weight, other_node->weight);
node              129 lib/pengine/utils.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              131 lib/pengine/utils.c         other_node = pe_hash_table_lookup(result, node->details->id);
node              134 lib/pengine/utils.c             pe_node_t *new_node = pe__copy_node(node);
node              220 lib/pengine/utils.c         pe_node_t *node = (pe_node_t *) gIter->data;
node              222 lib/pengine/utils.c         out->message(out, "node-weight", rsc, comment, node->details->uname,
node              223 lib/pengine/utils.c                      pcmk_readable_score(node->weight));
node              244 lib/pengine/utils.c     pe_node_t *node = NULL;
node              250 lib/pengine/utils.c     while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              256 lib/pengine/utils.c                                         pe__node_name(node),
node              257 lib/pengine/utils.c                                         pcmk_readable_score(node->weight));
node              261 lib/pengine/utils.c                                         comment, pe__node_name(node),
node              262 lib/pengine/utils.c                                         pcmk_readable_score(node->weight));
node              352 lib/pengine/utils.c resource_node_score(pe_resource_t * rsc, pe_node_t * node, int score, const char *tag)
node              356 lib/pengine/utils.c     if ((rsc->exclusive_discover || (node->rsc_discover_mode == pe_discover_never))
node              370 lib/pengine/utils.c             resource_node_score(child_rsc, node, score, tag);
node              375 lib/pengine/utils.c                  tag, rsc->id, pe__node_name(node), score);
node              376 lib/pengine/utils.c     match = pe_hash_table_lookup(rsc->allowed_nodes, node->details->id);
node              378 lib/pengine/utils.c         match = pe__copy_node(node);
node              385 lib/pengine/utils.c resource_location(pe_resource_t * rsc, pe_node_t * node, int score, const char *tag,
node              388 lib/pengine/utils.c     if (node != NULL) {
node              389 lib/pengine/utils.c         resource_node_score(rsc, node, score, tag);
node              410 lib/pengine/utils.c     if (node == NULL && score == -INFINITY) {
node              605 lib/pengine/utils.c     pe_resource_t * rsc, pe_node_t *node, const char *reason, pe_action_t *dependency, pe_working_set_t * data_set) 
node              616 lib/pengine/utils.c     } else if(node
node              617 lib/pengine/utils.c               && node->details->online
node              618 lib/pengine/utils.c               && node->details->unclean == FALSE
node              619 lib/pengine/utils.c               && node->details->shutdown == FALSE) {
node              620 lib/pengine/utils.c         pe_action_t *unfence = pe_fence_op(node, "on", FALSE, reason, FALSE, data_set);
node              630 lib/pengine/utils.c         while (g_hash_table_iter_next(&iter, NULL, (void **)&node)) {
node              631 lib/pengine/utils.c             if(node->details->online && node->details->unclean == FALSE && node->details->shutdown == FALSE) {
node              632 lib/pengine/utils.c                 trigger_unfencing(rsc, node, reason, dependency, data_set);
node              688 lib/pengine/utils.c pe__shutdown_requested(pe_node_t *node)
node              690 lib/pengine/utils.c     const char *shutdown = pe_node_attribute_raw(node, XML_CIB_ATTR_SHUTDOWN);
node              757 lib/pengine/utils.c         pe_node_t *node = (pe_node_t *) ele->data;
node              758 lib/pengine/utils.c         if (pcmk__str_in_list(node->details->uname, node_list,
node              804 lib/pengine/utils.c         pe_node_t *node = pe_find_node(data_set->nodes, s);
node              806 lib/pengine/utils.c         if (node) {
node               44 lib/pengine/variant.h     pe_node_t *node;
node              376 maint/gnulib/lib/clean-temp-simple.c       gl_list_node_t node = gl_list_search (list, absolute_file_name);
node              377 maint/gnulib/lib/clean-temp-simple.c       if (node != NULL)
node              379 maint/gnulib/lib/clean-temp-simple.c           char *old_string = (char *) gl_list_node_value (list, node);
node              381 maint/gnulib/lib/clean-temp-simple.c           gl_list_remove_node (list, node);
node              301 maint/gnulib/lib/clean-temp.c   gl_list_node_t node;
node              303 maint/gnulib/lib/clean-temp.c   node = gl_list_search (list, absolute_file_name);
node              304 maint/gnulib/lib/clean-temp.c   if (node != NULL)
node              306 maint/gnulib/lib/clean-temp.c       char *old_string = (char *) gl_list_node_value (list, node);
node              308 maint/gnulib/lib/clean-temp.c       gl_list_remove_node (list, node);
node              348 maint/gnulib/lib/clean-temp.c   gl_list_node_t node;
node              350 maint/gnulib/lib/clean-temp.c   node = gl_list_search (list, absolute_dir_name);
node              351 maint/gnulib/lib/clean-temp.c   if (node != NULL)
node              353 maint/gnulib/lib/clean-temp.c       char *old_string = (char *) gl_list_node_value (list, node);
node              355 maint/gnulib/lib/clean-temp.c       gl_list_remove_node (list, node);
node              416 maint/gnulib/lib/clean-temp.c   gl_list_node_t node;
node              421 maint/gnulib/lib/clean-temp.c   while (gl_list_iterator_next (&iter, &element, &node))
node              426 maint/gnulib/lib/clean-temp.c       gl_list_remove_node (list, node);
node              435 maint/gnulib/lib/clean-temp.c   while (gl_list_iterator_next (&iter, &element, &node))
node              440 maint/gnulib/lib/clean-temp.c       gl_list_remove_node (list, node);
node              708 maint/gnulib/lib/clean-temp.c   gl_list_node_t node;
node              709 maint/gnulib/lib/clean-temp.c   if (gl_list_iterator_next (&iter, &elt, &node))
node              725 maint/gnulib/lib/clean-temp.c         gl_list_node_t node_to_free = node;
node              727 maint/gnulib/lib/clean-temp.c         bool have_next = gl_list_iterator_next (&iter, &elt, &node);
node              770 maint/gnulib/lib/clean-temp.c   gl_list_node_t node;
node              771 maint/gnulib/lib/clean-temp.c   if (gl_list_iterator_next (&iter, &elt, &node))
node              787 maint/gnulib/lib/clean-temp.c         gl_list_node_t node_to_free = node;
node              789 maint/gnulib/lib/clean-temp.c         bool have_next = gl_list_iterator_next (&iter, &elt, &node);
node              419 maint/gnulib/lib/getaddrinfo.c              char *restrict node, socklen_t nodelen,
node              426 maint/gnulib/lib/getaddrinfo.c     return getnameinfo_ptr (sa, salen, node, nodelen,
node              431 maint/gnulib/lib/getaddrinfo.c   if ((node && nodelen > 0 && !(flags & NI_NUMERICHOST)) ||
node              457 maint/gnulib/lib/getaddrinfo.c   if (node && nodelen > 0 && flags & NI_NUMERICHOST)
node              465 maint/gnulib/lib/getaddrinfo.c                           node, nodelen))
node              474 maint/gnulib/lib/getaddrinfo.c                           node, nodelen))
node              361 maint/gnulib/lib/git-merge-changelog.c     gl_list_node_t node;
node              362 maint/gnulib/lib/git-merge-changelog.c     while (gl_list_iterator_next (&iter, &elt, &node))
node              801 maint/gnulib/lib/git-merge-changelog.c     gl_list_node_t node;
node              802 maint/gnulib/lib/git-merge-changelog.c     while (gl_list_iterator_next (&iter, &elt, &node))
node             1666 maint/gnulib/lib/git-merge-changelog.c         gl_list_node_t node;
node             1667 maint/gnulib/lib/git-merge-changelog.c         while (gl_list_iterator_next (&iter, &elt, &node))
node               31 maint/gnulib/lib/gl_anyavltree_list2.h   gl_list_node_t node =
node               33 maint/gnulib/lib/gl_anyavltree_list2.h   if (node == NULL)
node               38 maint/gnulib/lib/gl_anyavltree_list2.h       node->left = create_subtree_with_contents (half1, contents);
node               39 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->left == NULL)
node               41 maint/gnulib/lib/gl_anyavltree_list2.h       node->left->parent = node;
node               44 maint/gnulib/lib/gl_anyavltree_list2.h     node->left = NULL;
node               46 maint/gnulib/lib/gl_anyavltree_list2.h   node->value = contents[half1];
node               50 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = create_subtree_with_contents (half2, contents + half1 + 1);
node               51 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->right == NULL)
node               53 maint/gnulib/lib/gl_anyavltree_list2.h       node->right->parent = node;
node               56 maint/gnulib/lib/gl_anyavltree_list2.h     node->right = NULL;
node               62 maint/gnulib/lib/gl_anyavltree_list2.h   node->balance = (count > 1 && (count & (count - 1)) == 0 ? 1 : 0);
node               64 maint/gnulib/lib/gl_anyavltree_list2.h   node->branch_size = count;
node               66 maint/gnulib/lib/gl_anyavltree_list2.h   return node;
node               69 maint/gnulib/lib/gl_anyavltree_list2.h   if (node->left != NULL)
node               70 maint/gnulib/lib/gl_anyavltree_list2.h     free_subtree (node->left);
node               72 maint/gnulib/lib/gl_anyavltree_list2.h   free (node);
node              147 maint/gnulib/lib/gl_anyavltree_list2.h            gl_list_node_t node, int height_diff, gl_list_node_t parent)
node              157 maint/gnulib/lib/gl_anyavltree_list2.h       child = node;
node              158 maint/gnulib/lib/gl_anyavltree_list2.h       node = parent;
node              160 maint/gnulib/lib/gl_anyavltree_list2.h       previous_balance = node->balance;
node              166 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->left != NULL || node->right != NULL)
node              167 maint/gnulib/lib/gl_anyavltree_list2.h         balance_diff = (child == node->right ? height_diff : -height_diff);
node              174 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance += balance_diff;
node              180 maint/gnulib/lib/gl_anyavltree_list2.h           if (node->parent == NULL)
node              183 maint/gnulib/lib/gl_anyavltree_list2.h           else if (node->parent->left == node)
node              184 maint/gnulib/lib/gl_anyavltree_list2.h             nodep = &node->parent->left;
node              185 maint/gnulib/lib/gl_anyavltree_list2.h           else if (node->parent->right == node)
node              186 maint/gnulib/lib/gl_anyavltree_list2.h             nodep = &node->parent->right;
node              190 maint/gnulib/lib/gl_anyavltree_list2.h           nodeleft = node->left;
node              191 maint/gnulib/lib/gl_anyavltree_list2.h           noderight = node->right;
node              213 maint/gnulib/lib/gl_anyavltree_list2.h                   node->left = nodeleftright;
node              214 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleft->right = node;
node              216 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleft->parent = node->parent;
node              217 maint/gnulib/lib/gl_anyavltree_list2.h                   node->parent = nodeleft;
node              219 maint/gnulib/lib/gl_anyavltree_list2.h                     nodeleftright->parent = node;
node              222 maint/gnulib/lib/gl_anyavltree_list2.h                   node->balance = - nodeleft->balance;
node              224 maint/gnulib/lib/gl_anyavltree_list2.h                   node->branch_size =
node              228 maint/gnulib/lib/gl_anyavltree_list2.h                     nodeleftleft->branch_size + 1 + node->branch_size;
node              254 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t R = node->left = nodeleftright->right;
node              256 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->right = node;
node              258 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->parent = node->parent;
node              262 maint/gnulib/lib/gl_anyavltree_list2.h                     R->parent = node;
node              264 maint/gnulib/lib/gl_anyavltree_list2.h                   node->parent = nodeleftright;
node              267 maint/gnulib/lib/gl_anyavltree_list2.h                   node->balance = (nodeleftright->balance < 0 ? 1 : 0);
node              273 maint/gnulib/lib/gl_anyavltree_list2.h                   node->branch_size =
node              274 maint/gnulib/lib/gl_anyavltree_list2.h                     (node->left != NULL ? node->left->branch_size : 0)
node              275 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (node->right != NULL ? node->right->branch_size : 0);
node              277 maint/gnulib/lib/gl_anyavltree_list2.h                     nodeleft->branch_size + 1 + node->branch_size;
node              311 maint/gnulib/lib/gl_anyavltree_list2.h                   node->right = noderightleft;
node              312 maint/gnulib/lib/gl_anyavltree_list2.h                   noderight->left = node;
node              314 maint/gnulib/lib/gl_anyavltree_list2.h                   noderight->parent = node->parent;
node              315 maint/gnulib/lib/gl_anyavltree_list2.h                   node->parent = noderight;
node              317 maint/gnulib/lib/gl_anyavltree_list2.h                     noderightleft->parent = node;
node              320 maint/gnulib/lib/gl_anyavltree_list2.h                   node->balance = - noderight->balance;
node              322 maint/gnulib/lib/gl_anyavltree_list2.h                   node->branch_size =
node              326 maint/gnulib/lib/gl_anyavltree_list2.h                     node->branch_size + 1 + noderightright->branch_size;
node              351 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t L = node->right = noderightleft->left;
node              353 maint/gnulib/lib/gl_anyavltree_list2.h                   noderightleft->left = node;
node              356 maint/gnulib/lib/gl_anyavltree_list2.h                   noderightleft->parent = node->parent;
node              358 maint/gnulib/lib/gl_anyavltree_list2.h                     L->parent = node;
node              361 maint/gnulib/lib/gl_anyavltree_list2.h                   node->parent = noderightleft;
node              364 maint/gnulib/lib/gl_anyavltree_list2.h                   node->balance = (noderightleft->balance > 0 ? -1 : 0);
node              368 maint/gnulib/lib/gl_anyavltree_list2.h                   node->branch_size =
node              369 maint/gnulib/lib/gl_anyavltree_list2.h                     (node->left != NULL ? node->left->branch_size : 0)
node              370 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (node->right != NULL ? node->right->branch_size : 0);
node              375 maint/gnulib/lib/gl_anyavltree_list2.h                     node->branch_size + 1 + noderight->branch_size;
node              389 maint/gnulib/lib/gl_anyavltree_list2.h           node = *nodep;
node              398 maint/gnulib/lib/gl_anyavltree_list2.h             height_diff = (node->balance == 0 ? 0 : 1);
node              404 maint/gnulib/lib/gl_anyavltree_list2.h       parent = node->parent;
node              411 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_remove_node_from_tree (gl_list_t list, gl_list_node_t node)
node              413 maint/gnulib/lib/gl_anyavltree_list2.h   gl_list_node_t parent = node->parent;
node              415 maint/gnulib/lib/gl_anyavltree_list2.h   if (node->left == NULL)
node              418 maint/gnulib/lib/gl_anyavltree_list2.h       gl_list_node_t child = node->right;
node              426 maint/gnulib/lib/gl_anyavltree_list2.h           if (parent->left == node)
node              442 maint/gnulib/lib/gl_anyavltree_list2.h   else if (node->right == NULL)
node              447 maint/gnulib/lib/gl_anyavltree_list2.h       gl_list_node_t child = node->left;
node              454 maint/gnulib/lib/gl_anyavltree_list2.h           if (parent->left == node)
node              477 maint/gnulib/lib/gl_anyavltree_list2.h       for (subst = node->left; subst->right != NULL; )
node              495 maint/gnulib/lib/gl_anyavltree_list2.h       if (subst_parent != node)
node              513 maint/gnulib/lib/gl_anyavltree_list2.h       if (subst_parent != node)
node              515 maint/gnulib/lib/gl_anyavltree_list2.h           subst->left = node->left;
node              518 maint/gnulib/lib/gl_anyavltree_list2.h       subst->right = node->right;
node              520 maint/gnulib/lib/gl_anyavltree_list2.h       subst->balance = node->balance;
node              521 maint/gnulib/lib/gl_anyavltree_list2.h       subst->branch_size = node->branch_size;
node              525 maint/gnulib/lib/gl_anyavltree_list2.h       else if (parent->left == node)
node              533 maint/gnulib/lib/gl_anyavltree_list2.h       rebalance (list, child, -1, subst_parent != node ? subst_parent : subst);
node              567 maint/gnulib/lib/gl_anyavltree_list2.h       gl_list_node_t node;
node              569 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = list->root; node->left != NULL; )
node              570 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->left;
node              572 maint/gnulib/lib/gl_anyavltree_list2.h       node->left = new_node;
node              573 maint/gnulib/lib/gl_anyavltree_list2.h       new_node->parent = node;
node              574 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance--;
node              580 maint/gnulib/lib/gl_anyavltree_list2.h         for (p = node; p != NULL; p = p->parent)
node              585 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->right == NULL && node->parent != NULL)
node              586 maint/gnulib/lib/gl_anyavltree_list2.h         rebalance (list, node, 1, node->parent);
node              635 maint/gnulib/lib/gl_anyavltree_list2.h       gl_list_node_t node;
node              637 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = list->root; node->right != NULL; )
node              638 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->right;
node              640 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
node              641 maint/gnulib/lib/gl_anyavltree_list2.h       new_node->parent = node;
node              642 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance++;
node              648 maint/gnulib/lib/gl_anyavltree_list2.h         for (p = node; p != NULL; p = p->parent)
node              653 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->left == NULL && node->parent != NULL)
node              654 maint/gnulib/lib/gl_anyavltree_list2.h         rebalance (list, node, 1, node->parent);
node              674 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              698 maint/gnulib/lib/gl_anyavltree_list2.h   if (node->left == NULL)
node              700 maint/gnulib/lib/gl_anyavltree_list2.h       node->left = new_node;
node              701 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance--;
node              702 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->right == NULL);
node              706 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = node->left; node->right != NULL; )
node              707 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->right;
node              708 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
node              709 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance++;
node              710 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->left == NULL);
node              712 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->parent = node;
node              718 maint/gnulib/lib/gl_anyavltree_list2.h     for (p = node; p != NULL; p = p->parent)
node              723 maint/gnulib/lib/gl_anyavltree_list2.h   if (height_inc && node->parent != NULL)
node              724 maint/gnulib/lib/gl_anyavltree_list2.h     rebalance (list, node, 1, node->parent);
node              743 maint/gnulib/lib/gl_anyavltree_list2.h gl_tree_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              767 maint/gnulib/lib/gl_anyavltree_list2.h   if (node->right == NULL)
node              769 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
node              770 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance++;
node              771 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->left == NULL);
node              775 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = node->right; node->left != NULL; )
node              776 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->left;
node              777 maint/gnulib/lib/gl_anyavltree_list2.h       node->left = new_node;
node              778 maint/gnulib/lib/gl_anyavltree_list2.h       node->balance--;
node              779 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->right == NULL);
node              781 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->parent = node;
node              787 maint/gnulib/lib/gl_anyavltree_list2.h     for (p = node; p != NULL; p = p->parent)
node              792 maint/gnulib/lib/gl_anyavltree_list2.h   if (height_inc && node->parent != NULL)
node              793 maint/gnulib/lib/gl_anyavltree_list2.h     rebalance (list, node, 1, node->parent);
node               48 maint/gnulib/lib/gl_anyhash2.h           gl_hash_entry_t node = old_table[--i];
node               50 maint/gnulib/lib/gl_anyhash2.h           while (node != NULL)
node               52 maint/gnulib/lib/gl_anyhash2.h               gl_hash_entry_t next = node->hash_next;
node               54 maint/gnulib/lib/gl_anyhash2.h               size_t bucket = node->hashcode % new_size;
node               55 maint/gnulib/lib/gl_anyhash2.h               node->hash_next = new_table[bucket];
node               56 maint/gnulib/lib/gl_anyhash2.h               new_table[bucket] = node;
node               58 maint/gnulib/lib/gl_anyhash2.h               node = next;
node              115 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node =
node              118 maint/gnulib/lib/gl_anylinked_list2.h       if (node == NULL)
node              121 maint/gnulib/lib/gl_anylinked_list2.h       node->value = *contents;
node              123 maint/gnulib/lib/gl_anylinked_list2.h       node->h.hashcode =
node              125 maint/gnulib/lib/gl_anylinked_list2.h          ? list->base.hashcode_fn (node->value)
node              126 maint/gnulib/lib/gl_anylinked_list2.h          : (size_t)(uintptr_t) node->value);
node              129 maint/gnulib/lib/gl_anylinked_list2.h       if (add_to_bucket (list, node) < 0)
node              131 maint/gnulib/lib/gl_anylinked_list2.h           free (node);
node              137 maint/gnulib/lib/gl_anylinked_list2.h       node->prev = tail;
node              138 maint/gnulib/lib/gl_anylinked_list2.h       tail->next = node;
node              139 maint/gnulib/lib/gl_anylinked_list2.h       tail = node;
node              148 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node;
node              150 maint/gnulib/lib/gl_anylinked_list2.h     for (node = tail; node != &list->root; )
node              152 maint/gnulib/lib/gl_anylinked_list2.h         gl_list_node_t prev = node->prev;
node              154 maint/gnulib/lib/gl_anylinked_list2.h         free (node);
node              155 maint/gnulib/lib/gl_anylinked_list2.h         node = prev;
node              174 maint/gnulib/lib/gl_anylinked_list2.h                       gl_list_node_t node)
node              176 maint/gnulib/lib/gl_anylinked_list2.h   return node->value;
node              181 maint/gnulib/lib/gl_anylinked_list2.h                              gl_list_node_t node,
node              185 maint/gnulib/lib/gl_anylinked_list2.h   if (elt != node->value)
node              192 maint/gnulib/lib/gl_anylinked_list2.h       if (new_hashcode != node->h.hashcode)
node              194 maint/gnulib/lib/gl_anylinked_list2.h           remove_from_bucket (list, node);
node              195 maint/gnulib/lib/gl_anylinked_list2.h           node->value = elt;
node              196 maint/gnulib/lib/gl_anylinked_list2.h           node->h.hashcode = new_hashcode;
node              197 maint/gnulib/lib/gl_anylinked_list2.h           if (add_to_bucket (list, node) < 0)
node              202 maint/gnulib/lib/gl_anylinked_list2.h               gl_list_node_t before_removed = node->prev;
node              203 maint/gnulib/lib/gl_anylinked_list2.h               gl_list_node_t after_removed = node->next;
node              207 maint/gnulib/lib/gl_anylinked_list2.h               free (node);
node              212 maint/gnulib/lib/gl_anylinked_list2.h         node->value = elt;
node              215 maint/gnulib/lib/gl_anylinked_list2.h   node->value = elt;
node              221 maint/gnulib/lib/gl_anylinked_list2.h gl_linked_next_node (gl_list_t list, gl_list_node_t node)
node              223 maint/gnulib/lib/gl_anylinked_list2.h   return (node->next != &list->root ? node->next : NULL);
node              227 maint/gnulib/lib/gl_anylinked_list2.h gl_linked_previous_node (gl_list_t list, gl_list_node_t node)
node              229 maint/gnulib/lib/gl_anylinked_list2.h   return (node->prev != &list->root ? node->prev : NULL);
node              254 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node              262 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
node              264 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node              269 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.prev;
node              271 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              273 maint/gnulib/lib/gl_anylinked_list2.h   return node->value;
node              280 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node              288 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
node              290 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node              295 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.prev;
node              297 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              300 maint/gnulib/lib/gl_anylinked_list2.h   if (elt != node->value)
node              307 maint/gnulib/lib/gl_anylinked_list2.h       if (new_hashcode != node->h.hashcode)
node              309 maint/gnulib/lib/gl_anylinked_list2.h           remove_from_bucket (list, node);
node              310 maint/gnulib/lib/gl_anylinked_list2.h           node->value = elt;
node              311 maint/gnulib/lib/gl_anylinked_list2.h           node->h.hashcode = new_hashcode;
node              312 maint/gnulib/lib/gl_anylinked_list2.h           if (add_to_bucket (list, node) < 0)
node              317 maint/gnulib/lib/gl_anylinked_list2.h               gl_list_node_t before_removed = node->prev;
node              318 maint/gnulib/lib/gl_anylinked_list2.h               gl_list_node_t after_removed = node->next;
node              322 maint/gnulib/lib/gl_anylinked_list2.h               free (node);
node              327 maint/gnulib/lib/gl_anylinked_list2.h         node->value = elt;
node              330 maint/gnulib/lib/gl_anylinked_list2.h   node->value = elt;
node              332 maint/gnulib/lib/gl_anylinked_list2.h   return node;
node              357 maint/gnulib/lib/gl_anylinked_list2.h         gl_list_node_t node;
node              359 maint/gnulib/lib/gl_anylinked_list2.h         for (node = (gl_list_node_t) list->table[bucket];
node              360 maint/gnulib/lib/gl_anylinked_list2.h              node != NULL;
node              361 maint/gnulib/lib/gl_anylinked_list2.h              node = (gl_list_node_t) node->h.hash_next)
node              362 maint/gnulib/lib/gl_anylinked_list2.h           if (node->h.hashcode == hashcode
node              364 maint/gnulib/lib/gl_anylinked_list2.h                   ? equals (elt, node->value)
node              365 maint/gnulib/lib/gl_anylinked_list2.h                   : elt == node->value))
node              367 maint/gnulib/lib/gl_anylinked_list2.h               found = node;
node              372 maint/gnulib/lib/gl_anylinked_list2.h           for (node = list->root.next; ; node = node->next)
node              374 maint/gnulib/lib/gl_anylinked_list2.h               if (node == found)
node              383 maint/gnulib/lib/gl_anylinked_list2.h             for (node = list->root.prev; ; node = node->prev)
node              385 maint/gnulib/lib/gl_anylinked_list2.h                 if (node == found)
node              398 maint/gnulib/lib/gl_anylinked_list2.h         gl_list_node_t node;
node              400 maint/gnulib/lib/gl_anylinked_list2.h         for (node = (gl_list_node_t) list->table[bucket];
node              401 maint/gnulib/lib/gl_anylinked_list2.h              node != NULL;
node              402 maint/gnulib/lib/gl_anylinked_list2.h              node = (gl_list_node_t) node->h.hash_next)
node              403 maint/gnulib/lib/gl_anylinked_list2.h           if (node->h.hashcode == hashcode
node              405 maint/gnulib/lib/gl_anylinked_list2.h                   ? equals (elt, node->value)
node              406 maint/gnulib/lib/gl_anylinked_list2.h                   : elt == node->value))
node              409 maint/gnulib/lib/gl_anylinked_list2.h                 first_match = node;
node              421 maint/gnulib/lib/gl_anylinked_list2.h             node = list->root.next;
node              423 maint/gnulib/lib/gl_anylinked_list2.h               node = node->next;
node              427 maint/gnulib/lib/gl_anylinked_list2.h                  node = node->next, end_index--)
node              428 maint/gnulib/lib/gl_anylinked_list2.h               if (node->h.hashcode == hashcode
node              430 maint/gnulib/lib/gl_anylinked_list2.h                       ? equals (elt, node->value)
node              431 maint/gnulib/lib/gl_anylinked_list2.h                       : elt == node->value))
node              432 maint/gnulib/lib/gl_anylinked_list2.h                 return node;
node              441 maint/gnulib/lib/gl_anylinked_list2.h               for (node = list->root.next; node != &list->root; node = node->next)
node              443 maint/gnulib/lib/gl_anylinked_list2.h                   if (node == first_match)
node              452 maint/gnulib/lib/gl_anylinked_list2.h                 for (node = list->root.prev; ; node = node->prev)
node              454 maint/gnulib/lib/gl_anylinked_list2.h                     if (node == first_match)
node              465 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node = list->root.next;
node              469 maint/gnulib/lib/gl_anylinked_list2.h       node = node->next;
node              473 maint/gnulib/lib/gl_anylinked_list2.h         for (; end_index > 0; node = node->next, end_index--)
node              474 maint/gnulib/lib/gl_anylinked_list2.h           if (equals (elt, node->value))
node              475 maint/gnulib/lib/gl_anylinked_list2.h             return node;
node              479 maint/gnulib/lib/gl_anylinked_list2.h         for (; end_index > 0; node = node->next, end_index--)
node              480 maint/gnulib/lib/gl_anylinked_list2.h           if (elt == node->value)
node              481 maint/gnulib/lib/gl_anylinked_list2.h             return node;
node              508 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node;
node              514 maint/gnulib/lib/gl_anylinked_list2.h         for (node = (gl_list_node_t) list->table[bucket];
node              515 maint/gnulib/lib/gl_anylinked_list2.h              node != NULL;
node              516 maint/gnulib/lib/gl_anylinked_list2.h              node = (gl_list_node_t) node->h.hash_next)
node              517 maint/gnulib/lib/gl_anylinked_list2.h           if (node->h.hashcode == hashcode
node              519 maint/gnulib/lib/gl_anylinked_list2.h                   ? equals (elt, node->value)
node              520 maint/gnulib/lib/gl_anylinked_list2.h                   : elt == node->value))
node              529 maint/gnulib/lib/gl_anylinked_list2.h         for (node = (gl_list_node_t) list->table[bucket];
node              530 maint/gnulib/lib/gl_anylinked_list2.h              node != NULL;
node              531 maint/gnulib/lib/gl_anylinked_list2.h              node = (gl_list_node_t) node->h.hash_next)
node              532 maint/gnulib/lib/gl_anylinked_list2.h           if (node->h.hashcode == hashcode
node              534 maint/gnulib/lib/gl_anylinked_list2.h                   ? equals (elt, node->value)
node              535 maint/gnulib/lib/gl_anylinked_list2.h                   : elt == node->value))
node              538 maint/gnulib/lib/gl_anylinked_list2.h                 first_match = node;
node              552 maint/gnulib/lib/gl_anylinked_list2.h             node = list->root.next;
node              554 maint/gnulib/lib/gl_anylinked_list2.h               node = node->next;
node              558 maint/gnulib/lib/gl_anylinked_list2.h                  node = node->next, index++)
node              559 maint/gnulib/lib/gl_anylinked_list2.h               if (node->h.hashcode == hashcode
node              561 maint/gnulib/lib/gl_anylinked_list2.h                       ? equals (elt, node->value)
node              562 maint/gnulib/lib/gl_anylinked_list2.h                       : elt == node->value))
node              568 maint/gnulib/lib/gl_anylinked_list2.h         node = first_match;
node              572 maint/gnulib/lib/gl_anylinked_list2.h     if (node == NULL)
node              578 maint/gnulib/lib/gl_anylinked_list2.h         for (; node->prev != &list->root; node = node->prev)
node              589 maint/gnulib/lib/gl_anylinked_list2.h     gl_list_node_t node = list->root.next;
node              592 maint/gnulib/lib/gl_anylinked_list2.h       node = node->next;
node              598 maint/gnulib/lib/gl_anylinked_list2.h              node = node->next, index++)
node              599 maint/gnulib/lib/gl_anylinked_list2.h           if (equals (elt, node->value))
node              606 maint/gnulib/lib/gl_anylinked_list2.h              node = node->next, index++)
node              607 maint/gnulib/lib/gl_anylinked_list2.h           if (elt == node->value)
node              618 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node =
node              621 maint/gnulib/lib/gl_anylinked_list2.h   if (node == NULL)
node              624 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(const void *) node->value = elt;
node              626 maint/gnulib/lib/gl_anylinked_list2.h   node->h.hashcode =
node              628 maint/gnulib/lib/gl_anylinked_list2.h      ? list->base.hashcode_fn (node->value)
node              629 maint/gnulib/lib/gl_anylinked_list2.h      : (size_t)(uintptr_t) node->value);
node              632 maint/gnulib/lib/gl_anylinked_list2.h   if (add_to_bucket (list, node) < 0)
node              634 maint/gnulib/lib/gl_anylinked_list2.h       free (node);
node              640 maint/gnulib/lib/gl_anylinked_list2.h   node->prev = &list->root;
node              641 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->next = list->root.next;
node              642 maint/gnulib/lib/gl_anylinked_list2.h   node->next->prev = node;
node              643 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) list->root.next = node;
node              650 maint/gnulib/lib/gl_anylinked_list2.h   return node;
node              656 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node =
node              659 maint/gnulib/lib/gl_anylinked_list2.h   if (node == NULL)
node              662 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(const void *) node->value = elt;
node              664 maint/gnulib/lib/gl_anylinked_list2.h   node->h.hashcode =
node              666 maint/gnulib/lib/gl_anylinked_list2.h      ? list->base.hashcode_fn (node->value)
node              667 maint/gnulib/lib/gl_anylinked_list2.h      : (size_t)(uintptr_t) node->value);
node              670 maint/gnulib/lib/gl_anylinked_list2.h   if (add_to_bucket (list, node) < 0)
node              672 maint/gnulib/lib/gl_anylinked_list2.h       free (node);
node              678 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->next = &list->root;
node              679 maint/gnulib/lib/gl_anylinked_list2.h   node->prev = list->root.prev;
node              680 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->prev->next = node;
node              681 maint/gnulib/lib/gl_anylinked_list2.h   list->root.prev = node;
node              688 maint/gnulib/lib/gl_anylinked_list2.h   return node;
node              692 maint/gnulib/lib/gl_anylinked_list2.h gl_linked_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              716 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) new_node->next = node;
node              717 maint/gnulib/lib/gl_anylinked_list2.h   new_node->prev = node->prev;
node              719 maint/gnulib/lib/gl_anylinked_list2.h   node->prev = new_node;
node              730 maint/gnulib/lib/gl_anylinked_list2.h gl_linked_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              754 maint/gnulib/lib/gl_anylinked_list2.h   new_node->prev = node;
node              755 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) new_node->next = node->next;
node              757 maint/gnulib/lib/gl_anylinked_list2.h   ASYNCSAFE(gl_list_node_t) node->next = new_node;
node              799 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              801 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              803 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node              804 maint/gnulib/lib/gl_anylinked_list2.h       new_node->prev = node;
node              805 maint/gnulib/lib/gl_anylinked_list2.h       ASYNCSAFE(gl_list_node_t) new_node->next = node->next;
node              807 maint/gnulib/lib/gl_anylinked_list2.h       ASYNCSAFE(gl_list_node_t) node->next = new_node;
node              811 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              814 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              816 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              817 maint/gnulib/lib/gl_anylinked_list2.h       ASYNCSAFE(gl_list_node_t) new_node->next = node;
node              818 maint/gnulib/lib/gl_anylinked_list2.h       new_node->prev = node->prev;
node              820 maint/gnulib/lib/gl_anylinked_list2.h       node->prev = new_node;
node              832 maint/gnulib/lib/gl_anylinked_list2.h gl_linked_remove_node (gl_list_t list, gl_list_node_t node)
node              839 maint/gnulib/lib/gl_anylinked_list2.h   remove_from_bucket (list, node);
node              843 maint/gnulib/lib/gl_anylinked_list2.h   prev = node->prev;
node              844 maint/gnulib/lib/gl_anylinked_list2.h   next = node->next;
node              851 maint/gnulib/lib/gl_anylinked_list2.h     list->base.dispose_fn (node->value);
node              852 maint/gnulib/lib/gl_anylinked_list2.h   free (node);
node              868 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              871 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              873 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node              874 maint/gnulib/lib/gl_anylinked_list2.h       removed_node = node->next;
node              875 maint/gnulib/lib/gl_anylinked_list2.h       after_removed = node->next->next;
node              876 maint/gnulib/lib/gl_anylinked_list2.h       ASYNCSAFE(gl_list_node_t) node->next = after_removed;
node              877 maint/gnulib/lib/gl_anylinked_list2.h       after_removed->prev = node;
node              881 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              885 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              887 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              888 maint/gnulib/lib/gl_anylinked_list2.h       removed_node = node->prev;
node              889 maint/gnulib/lib/gl_anylinked_list2.h       before_removed = node->prev->prev;
node              890 maint/gnulib/lib/gl_anylinked_list2.h       node->prev = before_removed;
node              891 maint/gnulib/lib/gl_anylinked_list2.h       ASYNCSAFE(gl_list_node_t) before_removed->next = node;
node              907 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node = gl_linked_search_from_to (list, 0, list->count, elt);
node              909 maint/gnulib/lib/gl_anylinked_list2.h   if (node != NULL)
node              910 maint/gnulib/lib/gl_anylinked_list2.h     return gl_linked_remove_node (list, node);
node              919 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node              921 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; )
node              923 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t next = node->next;
node              925 maint/gnulib/lib/gl_anylinked_list2.h         dispose (node->value);
node              926 maint/gnulib/lib/gl_anylinked_list2.h       free (node);
node              927 maint/gnulib/lib/gl_anylinked_list2.h       node = next;
node              975 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              978 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              980 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              981 maint/gnulib/lib/gl_anylinked_list2.h       result.q = node;
node              983 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node              984 maint/gnulib/lib/gl_anylinked_list2.h       result.p = node;
node              989 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node              992 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
node              994 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node              995 maint/gnulib/lib/gl_anylinked_list2.h       result.p = node;
node              997 maint/gnulib/lib/gl_anylinked_list2.h       node = &list->root;
node              999 maint/gnulib/lib/gl_anylinked_list2.h         node = node->prev;
node             1000 maint/gnulib/lib/gl_anylinked_list2.h       result.q = node;
node             1005 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node             1008 maint/gnulib/lib/gl_anylinked_list2.h       node = list->root.next;
node             1010 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node             1011 maint/gnulib/lib/gl_anylinked_list2.h       result.p = node;
node             1013 maint/gnulib/lib/gl_anylinked_list2.h         node = node->next;
node             1014 maint/gnulib/lib/gl_anylinked_list2.h       result.q = node;
node             1032 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node = (gl_list_node_t) iterator->p;
node             1033 maint/gnulib/lib/gl_anylinked_list2.h       *eltp = node->value;
node             1035 maint/gnulib/lib/gl_anylinked_list2.h         *nodep = node;
node             1036 maint/gnulib/lib/gl_anylinked_list2.h       iterator->p = node->next;
node             1054 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node             1056 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
node             1058 maint/gnulib/lib/gl_anylinked_list2.h       int cmp = compar (node->value, elt);
node             1063 maint/gnulib/lib/gl_anylinked_list2.h         return node;
node             1085 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node             1089 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.next;
node             1091 maint/gnulib/lib/gl_anylinked_list2.h             node = node->next;
node             1096 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.prev;
node             1098 maint/gnulib/lib/gl_anylinked_list2.h             node = node->prev;
node             1103 maint/gnulib/lib/gl_anylinked_list2.h           int cmp = compar (node->value, elt);
node             1108 maint/gnulib/lib/gl_anylinked_list2.h             return node;
node             1109 maint/gnulib/lib/gl_anylinked_list2.h           node = node->next;
node             1120 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node             1123 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next, index = 0;
node             1124 maint/gnulib/lib/gl_anylinked_list2.h        node != &list->root;
node             1125 maint/gnulib/lib/gl_anylinked_list2.h        node = node->next, index++)
node             1127 maint/gnulib/lib/gl_anylinked_list2.h       int cmp = compar (node->value, elt);
node             1155 maint/gnulib/lib/gl_anylinked_list2.h       gl_list_node_t node;
node             1159 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.next;
node             1161 maint/gnulib/lib/gl_anylinked_list2.h             node = node->next;
node             1166 maint/gnulib/lib/gl_anylinked_list2.h           node = list->root.prev;
node             1168 maint/gnulib/lib/gl_anylinked_list2.h             node = node->prev;
node             1173 maint/gnulib/lib/gl_anylinked_list2.h           int cmp = compar (node->value, elt);
node             1179 maint/gnulib/lib/gl_anylinked_list2.h           node = node->next;
node             1191 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node             1193 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
node             1194 maint/gnulib/lib/gl_anylinked_list2.h     if (compar (node->value, elt) >= 0)
node             1195 maint/gnulib/lib/gl_anylinked_list2.h       return gl_linked_nx_add_before (list, node, elt);
node             1203 maint/gnulib/lib/gl_anylinked_list2.h   gl_list_node_t node;
node             1205 maint/gnulib/lib/gl_anylinked_list2.h   for (node = list->root.next; node != &list->root; node = node->next)
node             1207 maint/gnulib/lib/gl_anylinked_list2.h       int cmp = compar (node->value, elt);
node             1212 maint/gnulib/lib/gl_anylinked_list2.h         return gl_linked_remove_node (list, node);
node               34 maint/gnulib/lib/gl_anyrbtree_list2.h   gl_list_node_t node =
node               36 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node == NULL)
node               43 maint/gnulib/lib/gl_anyrbtree_list2.h       node->left =
node               45 maint/gnulib/lib/gl_anyrbtree_list2.h       if (node->left == NULL)
node               47 maint/gnulib/lib/gl_anyrbtree_list2.h       node->left->parent = node;
node               50 maint/gnulib/lib/gl_anyrbtree_list2.h     node->left = NULL;
node               52 maint/gnulib/lib/gl_anyrbtree_list2.h   node->value = contents[half1];
node               58 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right =
node               60 maint/gnulib/lib/gl_anyrbtree_list2.h       if (node->right == NULL)
node               62 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right->parent = node;
node               65 maint/gnulib/lib/gl_anyrbtree_list2.h     node->right = NULL;
node               67 maint/gnulib/lib/gl_anyrbtree_list2.h   node->color = (bh == 0 ? RED : BLACK);
node               69 maint/gnulib/lib/gl_anyrbtree_list2.h   node->branch_size = count;
node               71 maint/gnulib/lib/gl_anyrbtree_list2.h   return node;
node               74 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node->left != NULL)
node               75 maint/gnulib/lib/gl_anyrbtree_list2.h     free_subtree (node->left);
node               77 maint/gnulib/lib/gl_anyrbtree_list2.h   free (node);
node              228 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_add (gl_list_t list, gl_list_node_t node, gl_list_node_t parent)
node              241 maint/gnulib/lib/gl_anyrbtree_list2.h           node->color = RED;
node              261 maint/gnulib/lib/gl_anyrbtree_list2.h           node->color = RED;
node              263 maint/gnulib/lib/gl_anyrbtree_list2.h           node = grandparent;
node              284 maint/gnulib/lib/gl_anyrbtree_list2.h               if (parent->right == node)
node              287 maint/gnulib/lib/gl_anyrbtree_list2.h                   grandparent->left = rotate_left (parent, node);
node              288 maint/gnulib/lib/gl_anyrbtree_list2.h                   node = parent;
node              305 maint/gnulib/lib/gl_anyrbtree_list2.h               node->color = grandparent->color = RED;
node              309 maint/gnulib/lib/gl_anyrbtree_list2.h               if (parent->left == node)
node              312 maint/gnulib/lib/gl_anyrbtree_list2.h                   grandparent->right = rotate_right (node, parent);
node              313 maint/gnulib/lib/gl_anyrbtree_list2.h                   node = parent;
node              330 maint/gnulib/lib/gl_anyrbtree_list2.h               node->color = grandparent->color = RED;
node              336 maint/gnulib/lib/gl_anyrbtree_list2.h       parent = node->parent;
node              342 maint/gnulib/lib/gl_anyrbtree_list2.h           node->color = BLACK;
node              636 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_remove_node_from_tree (gl_list_t list, gl_list_node_t node)
node              638 maint/gnulib/lib/gl_anyrbtree_list2.h   gl_list_node_t parent = node->parent;
node              640 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node->left == NULL)
node              643 maint/gnulib/lib/gl_anyrbtree_list2.h       gl_list_node_t child = node->right;
node              656 maint/gnulib/lib/gl_anyrbtree_list2.h           if (parent->left == node)
node              669 maint/gnulib/lib/gl_anyrbtree_list2.h           if (child == NULL && node->color == BLACK)
node              673 maint/gnulib/lib/gl_anyrbtree_list2.h   else if (node->right == NULL)
node              678 maint/gnulib/lib/gl_anyrbtree_list2.h       gl_list_node_t child = node->left;
node              688 maint/gnulib/lib/gl_anyrbtree_list2.h           if (parent->left == node)
node              710 maint/gnulib/lib/gl_anyrbtree_list2.h       for (subst = node->left; subst->right != NULL; )
node              730 maint/gnulib/lib/gl_anyrbtree_list2.h       if (subst_parent != node)
node              748 maint/gnulib/lib/gl_anyrbtree_list2.h       if (subst_parent != node)
node              750 maint/gnulib/lib/gl_anyrbtree_list2.h           subst->left = node->left;
node              753 maint/gnulib/lib/gl_anyrbtree_list2.h       subst->right = node->right;
node              755 maint/gnulib/lib/gl_anyrbtree_list2.h       subst->color = node->color;
node              756 maint/gnulib/lib/gl_anyrbtree_list2.h       subst->branch_size = node->branch_size;
node              760 maint/gnulib/lib/gl_anyrbtree_list2.h       else if (parent->left == node)
node              775 maint/gnulib/lib/gl_anyrbtree_list2.h                                     subst_parent != node ? subst_parent : subst);
node              810 maint/gnulib/lib/gl_anyrbtree_list2.h       gl_list_node_t node;
node              812 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = list->root; node->left != NULL; )
node              813 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->left;
node              815 maint/gnulib/lib/gl_anyrbtree_list2.h       node->left = new_node;
node              816 maint/gnulib/lib/gl_anyrbtree_list2.h       new_node->parent = node;
node              822 maint/gnulib/lib/gl_anyrbtree_list2.h         for (p = node; p != NULL; p = p->parent)
node              827 maint/gnulib/lib/gl_anyrbtree_list2.h       rebalance_after_add (list, new_node, node);
node              876 maint/gnulib/lib/gl_anyrbtree_list2.h       gl_list_node_t node;
node              878 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = list->root; node->right != NULL; )
node              879 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->right;
node              881 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right = new_node;
node              882 maint/gnulib/lib/gl_anyrbtree_list2.h       new_node->parent = node;
node              888 maint/gnulib/lib/gl_anyrbtree_list2.h         for (p = node; p != NULL; p = p->parent)
node              893 maint/gnulib/lib/gl_anyrbtree_list2.h       rebalance_after_add (list, new_node, node);
node              913 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              934 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node->left == NULL)
node              935 maint/gnulib/lib/gl_anyrbtree_list2.h     node->left = new_node;
node              938 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = node->left; node->right != NULL; )
node              939 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->right;
node              940 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right = new_node;
node              942 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->parent = node;
node              948 maint/gnulib/lib/gl_anyrbtree_list2.h     for (p = node; p != NULL; p = p->parent)
node              953 maint/gnulib/lib/gl_anyrbtree_list2.h   rebalance_after_add (list, new_node, node);
node              972 maint/gnulib/lib/gl_anyrbtree_list2.h gl_tree_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              993 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node->right == NULL)
node              994 maint/gnulib/lib/gl_anyrbtree_list2.h     node->right = new_node;
node              997 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = node->right; node->left != NULL; )
node              998 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->left;
node              999 maint/gnulib/lib/gl_anyrbtree_list2.h       node->left = new_node;
node             1001 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->parent = node;
node             1007 maint/gnulib/lib/gl_anyrbtree_list2.h     for (p = node; p != NULL; p = p->parent)
node             1012 maint/gnulib/lib/gl_anyrbtree_list2.h   rebalance_after_add (list, new_node, node);
node               24 maint/gnulib/lib/gl_anytree_list1.h   gl_list_node_t node;
node               34 maint/gnulib/lib/gl_anytree_list1.h free_subtree (gl_list_node_t node)
node               36 maint/gnulib/lib/gl_anytree_list1.h   if (node->left != NULL)
node               37 maint/gnulib/lib/gl_anytree_list1.h     free_subtree (node->left);
node               38 maint/gnulib/lib/gl_anytree_list1.h   if (node->right != NULL)
node               39 maint/gnulib/lib/gl_anytree_list1.h     free_subtree (node->right);
node               40 maint/gnulib/lib/gl_anytree_list1.h   free (node);
node               64 maint/gnulib/lib/gl_anytree_list2.h                     gl_list_node_t node)
node               66 maint/gnulib/lib/gl_anytree_list2.h   return node->value;
node               71 maint/gnulib/lib/gl_anytree_list2.h                            gl_list_node_t node, const void *elt)
node               74 maint/gnulib/lib/gl_anytree_list2.h   if (elt != node->value)
node               81 maint/gnulib/lib/gl_anytree_list2.h       if (new_hashcode != node->h.hashcode)
node               83 maint/gnulib/lib/gl_anytree_list2.h           remove_from_bucket (list, node);
node               84 maint/gnulib/lib/gl_anytree_list2.h           node->value = elt;
node               85 maint/gnulib/lib/gl_anytree_list2.h           node->h.hashcode = new_hashcode;
node               86 maint/gnulib/lib/gl_anytree_list2.h           if (add_to_bucket (list, node) < 0)
node               91 maint/gnulib/lib/gl_anytree_list2.h               gl_tree_remove_node_from_tree (list, node);
node               92 maint/gnulib/lib/gl_anytree_list2.h               free (node);
node               97 maint/gnulib/lib/gl_anytree_list2.h         node->value = elt;
node              100 maint/gnulib/lib/gl_anytree_list2.h   node->value = elt;
node              107 maint/gnulib/lib/gl_anytree_list2.h                    gl_list_node_t node)
node              109 maint/gnulib/lib/gl_anytree_list2.h   if (node->right != NULL)
node              111 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
node              112 maint/gnulib/lib/gl_anytree_list2.h       while (node->left != NULL)
node              113 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              117 maint/gnulib/lib/gl_anytree_list2.h       while (node->parent != NULL && node->parent->right == node)
node              118 maint/gnulib/lib/gl_anytree_list2.h         node = node->parent;
node              119 maint/gnulib/lib/gl_anytree_list2.h       node = node->parent;
node              121 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              126 maint/gnulib/lib/gl_anytree_list2.h                        gl_list_node_t node)
node              128 maint/gnulib/lib/gl_anytree_list2.h   if (node->left != NULL)
node              130 maint/gnulib/lib/gl_anytree_list2.h       node = node->left;
node              131 maint/gnulib/lib/gl_anytree_list2.h       while (node->right != NULL)
node              132 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
node              136 maint/gnulib/lib/gl_anytree_list2.h       while (node->parent != NULL && node->parent->left == node)
node              137 maint/gnulib/lib/gl_anytree_list2.h         node = node->parent;
node              138 maint/gnulib/lib/gl_anytree_list2.h       node = node->parent;
node              140 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              146 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              148 maint/gnulib/lib/gl_anytree_list2.h   if (node != NULL)
node              150 maint/gnulib/lib/gl_anytree_list2.h       while (node->left != NULL)
node              151 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              153 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              159 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              161 maint/gnulib/lib/gl_anytree_list2.h   if (node != NULL)
node              163 maint/gnulib/lib/gl_anytree_list2.h       while (node->right != NULL)
node              164 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
node              166 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              174 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = root;
node              178 maint/gnulib/lib/gl_anytree_list2.h       if (node->left != NULL)
node              180 maint/gnulib/lib/gl_anytree_list2.h           if (position < node->left->branch_size)
node              182 maint/gnulib/lib/gl_anytree_list2.h               node = node->left;
node              185 maint/gnulib/lib/gl_anytree_list2.h           position -= node->left->branch_size;
node              190 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
node              192 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              198 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              200 maint/gnulib/lib/gl_anytree_list2.h   if (!(node != NULL && position < node->branch_size))
node              203 maint/gnulib/lib/gl_anytree_list2.h   node = node_at (node, position);
node              204 maint/gnulib/lib/gl_anytree_list2.h   return node->value;
node              210 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              212 maint/gnulib/lib/gl_anytree_list2.h   if (!(node != NULL && position < node->branch_size))
node              215 maint/gnulib/lib/gl_anytree_list2.h   node = node_at (node, position);
node              217 maint/gnulib/lib/gl_anytree_list2.h   if (elt != node->value)
node              224 maint/gnulib/lib/gl_anytree_list2.h       if (new_hashcode != node->h.hashcode)
node              226 maint/gnulib/lib/gl_anytree_list2.h           remove_from_bucket (list, node);
node              227 maint/gnulib/lib/gl_anytree_list2.h           node->value = elt;
node              228 maint/gnulib/lib/gl_anytree_list2.h           node->h.hashcode = new_hashcode;
node              229 maint/gnulib/lib/gl_anytree_list2.h           if (add_to_bucket (list, node) < 0)
node              234 maint/gnulib/lib/gl_anytree_list2.h               gl_tree_remove_node_from_tree (list, node);
node              235 maint/gnulib/lib/gl_anytree_list2.h               free (node);
node              240 maint/gnulib/lib/gl_anytree_list2.h         node->value = elt;
node              243 maint/gnulib/lib/gl_anytree_list2.h   node->value = elt;
node              245 maint/gnulib/lib/gl_anytree_list2.h   return node;
node              261 maint/gnulib/lib/gl_anytree_list2.h     gl_list_node_t node = list->root;
node              274 maint/gnulib/lib/gl_anytree_list2.h                 if (node == NULL)
node              276 maint/gnulib/lib/gl_anytree_list2.h                 stack_ptr->node = node;
node              278 maint/gnulib/lib/gl_anytree_list2.h                 node = node->left;
node              290 maint/gnulib/lib/gl_anytree_list2.h             node = stack_ptr->node;
node              292 maint/gnulib/lib/gl_anytree_list2.h             if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node              293 maint/gnulib/lib/gl_anytree_list2.h               return node;
node              299 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
node              315 maint/gnulib/lib/gl_anytree_list2.h                 if (node == NULL)
node              317 maint/gnulib/lib/gl_anytree_list2.h                 if (node->branch_size <= start_index)
node              319 maint/gnulib/lib/gl_anytree_list2.h                 stack_ptr->node = node;
node              321 maint/gnulib/lib/gl_anytree_list2.h                 node = node->left;
node              334 maint/gnulib/lib/gl_anytree_list2.h             node = stack_ptr->node;
node              337 maint/gnulib/lib/gl_anytree_list2.h                 (node->left != NULL ? node->left->branch_size : 0) + 1;
node              341 maint/gnulib/lib/gl_anytree_list2.h                   if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node              342 maint/gnulib/lib/gl_anytree_list2.h                     return node;
node              354 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
node              372 maint/gnulib/lib/gl_anytree_list2.h     gl_list_node_t node = list->root;
node              385 maint/gnulib/lib/gl_anytree_list2.h                 if (node == NULL)
node              387 maint/gnulib/lib/gl_anytree_list2.h                 stack_ptr->node = node;
node              389 maint/gnulib/lib/gl_anytree_list2.h                 node = node->left;
node              401 maint/gnulib/lib/gl_anytree_list2.h             node = stack_ptr->node;
node              403 maint/gnulib/lib/gl_anytree_list2.h             if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node              410 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
node              426 maint/gnulib/lib/gl_anytree_list2.h                 if (node == NULL)
node              428 maint/gnulib/lib/gl_anytree_list2.h                 if (node->branch_size <= start_index)
node              430 maint/gnulib/lib/gl_anytree_list2.h                 stack_ptr->node = node;
node              432 maint/gnulib/lib/gl_anytree_list2.h                 node = node->left;
node              445 maint/gnulib/lib/gl_anytree_list2.h             node = stack_ptr->node;
node              448 maint/gnulib/lib/gl_anytree_list2.h                 (node->left != NULL ? node->left->branch_size : 0) + 1;
node              452 maint/gnulib/lib/gl_anytree_list2.h                   if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node              465 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
node              489 maint/gnulib/lib/gl_anytree_list2.h gl_tree_remove_node (gl_list_t list, gl_list_node_t node)
node              495 maint/gnulib/lib/gl_anytree_list2.h   remove_from_bucket (list, node);
node              498 maint/gnulib/lib/gl_anytree_list2.h   gl_tree_remove_node_from_tree (list, node);
node              501 maint/gnulib/lib/gl_anytree_list2.h     list->base.dispose_fn (node->value);
node              502 maint/gnulib/lib/gl_anytree_list2.h   free (node);
node              509 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              511 maint/gnulib/lib/gl_anytree_list2.h   if (!(node != NULL && position < node->branch_size))
node              514 maint/gnulib/lib/gl_anytree_list2.h   node = node_at (node, position);
node              515 maint/gnulib/lib/gl_anytree_list2.h   return gl_tree_remove_node (list, node);
node              523 maint/gnulib/lib/gl_anytree_list2.h       gl_list_node_t node =
node              526 maint/gnulib/lib/gl_anytree_list2.h       if (node != NULL)
node              527 maint/gnulib/lib/gl_anytree_list2.h         return gl_tree_remove_node (list, node);
node              538 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              547 maint/gnulib/lib/gl_anytree_list2.h           if (node == NULL)
node              549 maint/gnulib/lib/gl_anytree_list2.h           stack_ptr->node = node;
node              551 maint/gnulib/lib/gl_anytree_list2.h           node = node->left;
node              560 maint/gnulib/lib/gl_anytree_list2.h           node = stack_ptr->node;
node              565 maint/gnulib/lib/gl_anytree_list2.h             list->base.dispose_fn (node->value);
node              566 maint/gnulib/lib/gl_anytree_list2.h           free (node);
node              570 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
node              585 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node;
node              590 maint/gnulib/lib/gl_anytree_list2.h   node = list->root;
node              591 maint/gnulib/lib/gl_anytree_list2.h   if (node != NULL)
node              592 maint/gnulib/lib/gl_anytree_list2.h     while (node->left != NULL)
node              593 maint/gnulib/lib/gl_anytree_list2.h       node = node->left;
node              594 maint/gnulib/lib/gl_anytree_list2.h   result.p = node;
node              636 maint/gnulib/lib/gl_anytree_list2.h       gl_list_node_t node = (gl_list_node_t) iterator->p;
node              637 maint/gnulib/lib/gl_anytree_list2.h       *eltp = node->value;
node              639 maint/gnulib/lib/gl_anytree_list2.h         *nodep = node;
node              641 maint/gnulib/lib/gl_anytree_list2.h       if (node->right != NULL)
node              643 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
node              644 maint/gnulib/lib/gl_anytree_list2.h           while (node->left != NULL)
node              645 maint/gnulib/lib/gl_anytree_list2.h             node = node->left;
node              649 maint/gnulib/lib/gl_anytree_list2.h           while (node->parent != NULL && node->parent->right == node)
node              650 maint/gnulib/lib/gl_anytree_list2.h             node = node->parent;
node              651 maint/gnulib/lib/gl_anytree_list2.h           node = node->parent;
node              653 maint/gnulib/lib/gl_anytree_list2.h       iterator->p = node;
node              671 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node;
node              673 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root; node != NULL; )
node              675 maint/gnulib/lib/gl_anytree_list2.h       int cmp = compar (node->value, elt);
node              678 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
node              680 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              685 maint/gnulib/lib/gl_anytree_list2.h           gl_list_node_t found = node;
node              686 maint/gnulib/lib/gl_anytree_list2.h           node = node->left;
node              687 maint/gnulib/lib/gl_anytree_list2.h           for (; node != NULL; )
node              689 maint/gnulib/lib/gl_anytree_list2.h               int cmp2 = compar (node->value, elt);
node              692 maint/gnulib/lib/gl_anytree_list2.h                 node = node->right;
node              698 maint/gnulib/lib/gl_anytree_list2.h                   found = node;
node              699 maint/gnulib/lib/gl_anytree_list2.h                   node = node->left;
node              714 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node;
node              721 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root; node != NULL; )
node              724 maint/gnulib/lib/gl_anytree_list2.h         (node->left != NULL ? node->left->branch_size : 0);
node              730 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
node              733 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              737 maint/gnulib/lib/gl_anytree_list2.h           int cmp = compar (node->value, elt);
node              743 maint/gnulib/lib/gl_anytree_list2.h               node = node->right;
node              746 maint/gnulib/lib/gl_anytree_list2.h             node = node->left;
node              751 maint/gnulib/lib/gl_anytree_list2.h               gl_list_node_t found = node;
node              752 maint/gnulib/lib/gl_anytree_list2.h               node = node->left;
node              753 maint/gnulib/lib/gl_anytree_list2.h               for (; node != NULL; )
node              756 maint/gnulib/lib/gl_anytree_list2.h                     (node->left != NULL ? node->left->branch_size : 0);
node              761 maint/gnulib/lib/gl_anytree_list2.h                       node = node->right;
node              766 maint/gnulib/lib/gl_anytree_list2.h                       int cmp2 = compar (node->value, elt);
node              771 maint/gnulib/lib/gl_anytree_list2.h                           node = node->right;
node              778 maint/gnulib/lib/gl_anytree_list2.h                           found = node;
node              779 maint/gnulib/lib/gl_anytree_list2.h                           node = node->left;
node              794 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node;
node              797 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root, position = 0; node != NULL; )
node              799 maint/gnulib/lib/gl_anytree_list2.h       int cmp = compar (node->value, elt);
node              803 maint/gnulib/lib/gl_anytree_list2.h           if (node->left != NULL)
node              804 maint/gnulib/lib/gl_anytree_list2.h             position += node->left->branch_size;
node              806 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
node              809 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              815 maint/gnulib/lib/gl_anytree_list2.h             position + (node->left != NULL ? node->left->branch_size : 0);
node              816 maint/gnulib/lib/gl_anytree_list2.h           node = node->left;
node              817 maint/gnulib/lib/gl_anytree_list2.h           for (; node != NULL; )
node              819 maint/gnulib/lib/gl_anytree_list2.h               int cmp2 = compar (node->value, elt);
node              823 maint/gnulib/lib/gl_anytree_list2.h                   if (node->left != NULL)
node              824 maint/gnulib/lib/gl_anytree_list2.h                     position += node->left->branch_size;
node              826 maint/gnulib/lib/gl_anytree_list2.h                   node = node->right;
node              835 maint/gnulib/lib/gl_anytree_list2.h                     + (node->left != NULL ? node->left->branch_size : 0);
node              836 maint/gnulib/lib/gl_anytree_list2.h                   node = node->left;
node              851 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node;
node              859 maint/gnulib/lib/gl_anytree_list2.h   for (node = list->root, position = 0; node != NULL; )
node              862 maint/gnulib/lib/gl_anytree_list2.h         (node->left != NULL ? node->left->branch_size : 0);
node              869 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
node              872 maint/gnulib/lib/gl_anytree_list2.h         node = node->left;
node              876 maint/gnulib/lib/gl_anytree_list2.h           int cmp = compar (node->value, elt);
node              883 maint/gnulib/lib/gl_anytree_list2.h               node = node->right;
node              886 maint/gnulib/lib/gl_anytree_list2.h             node = node->left;
node              892 maint/gnulib/lib/gl_anytree_list2.h                 position + (node->left != NULL ? node->left->branch_size : 0);
node              893 maint/gnulib/lib/gl_anytree_list2.h               node = node->left;
node              894 maint/gnulib/lib/gl_anytree_list2.h               for (; node != NULL; )
node              897 maint/gnulib/lib/gl_anytree_list2.h                     (node->left != NULL ? node->left->branch_size : 0);
node              902 maint/gnulib/lib/gl_anytree_list2.h                       node = node->right;
node              907 maint/gnulib/lib/gl_anytree_list2.h                       int cmp2 = compar (node->value, elt);
node              912 maint/gnulib/lib/gl_anytree_list2.h                           node = node->right;
node              920 maint/gnulib/lib/gl_anytree_list2.h                           node = node->left;
node              935 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = list->root;
node              937 maint/gnulib/lib/gl_anytree_list2.h   if (node == NULL)
node              942 maint/gnulib/lib/gl_anytree_list2.h       int cmp = compar (node->value, elt);
node              946 maint/gnulib/lib/gl_anytree_list2.h           if (node->right == NULL)
node              947 maint/gnulib/lib/gl_anytree_list2.h             return gl_tree_nx_add_after (list, node, elt);
node              948 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
node              952 maint/gnulib/lib/gl_anytree_list2.h           if (node->left == NULL)
node              953 maint/gnulib/lib/gl_anytree_list2.h             return gl_tree_nx_add_before (list, node, elt);
node              954 maint/gnulib/lib/gl_anytree_list2.h           node = node->left;
node              957 maint/gnulib/lib/gl_anytree_list2.h         return gl_tree_nx_add_before (list, node, elt);
node              965 maint/gnulib/lib/gl_anytree_list2.h   gl_list_node_t node = gl_tree_sortedlist_search (list, compar, elt);
node              966 maint/gnulib/lib/gl_anytree_list2.h   if (node != NULL)
node              967 maint/gnulib/lib/gl_anytree_list2.h     return gl_tree_remove_node (list, node);
node               23 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node;
node               62 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node;
node               64 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
node               67 maint/gnulib/lib/gl_anytree_omap.h                  ? compar (node->key, key)
node               68 maint/gnulib/lib/gl_anytree_omap.h                  : (node->key > key ? 1 :
node               69 maint/gnulib/lib/gl_anytree_omap.h                     node->key < key ? -1 : 0));
node               72 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
node               74 maint/gnulib/lib/gl_anytree_omap.h         node = node->left;
node               78 maint/gnulib/lib/gl_anytree_omap.h           *valuep = node->value;
node               91 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node;
node               93 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
node               95 maint/gnulib/lib/gl_anytree_omap.h       if (! threshold_fn (node->key, threshold))
node               96 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
node              101 maint/gnulib/lib/gl_anytree_omap.h           gl_omap_node_t found = node;
node              102 maint/gnulib/lib/gl_anytree_omap.h           node = node->left;
node              103 maint/gnulib/lib/gl_anytree_omap.h           for (; node != NULL; )
node              105 maint/gnulib/lib/gl_anytree_omap.h               if (! threshold_fn (node->key, threshold))
node              106 maint/gnulib/lib/gl_anytree_omap.h                 node = node->right;
node              109 maint/gnulib/lib/gl_anytree_omap.h                   found = node;
node              110 maint/gnulib/lib/gl_anytree_omap.h                   node = node->left;
node              126 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node = map->root;
node              128 maint/gnulib/lib/gl_anytree_omap.h   if (node == NULL)
node              140 maint/gnulib/lib/gl_anytree_omap.h                  ? compar (node->key, key)
node              141 maint/gnulib/lib/gl_anytree_omap.h                  : (node->key > key ? 1 :
node              142 maint/gnulib/lib/gl_anytree_omap.h                     node->key < key ? -1 : 0));
node              146 maint/gnulib/lib/gl_anytree_omap.h           if (node->right == NULL)
node              148 maint/gnulib/lib/gl_anytree_omap.h               if (gl_tree_nx_add_after (map, node, key, value) == NULL)
node              152 maint/gnulib/lib/gl_anytree_omap.h           node = node->right;
node              156 maint/gnulib/lib/gl_anytree_omap.h           if (node->left == NULL)
node              158 maint/gnulib/lib/gl_anytree_omap.h               if (gl_tree_nx_add_before (map, node, key, value) == NULL)
node              162 maint/gnulib/lib/gl_anytree_omap.h           node = node->left;
node              166 maint/gnulib/lib/gl_anytree_omap.h           *oldvaluep = node->value;
node              167 maint/gnulib/lib/gl_anytree_omap.h           node->value = value;
node              177 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node;
node              179 maint/gnulib/lib/gl_anytree_omap.h   for (node = map->root; node != NULL; )
node              182 maint/gnulib/lib/gl_anytree_omap.h                  ? compar (node->key, key)
node              183 maint/gnulib/lib/gl_anytree_omap.h                  : (node->key > key ? 1 :
node              184 maint/gnulib/lib/gl_anytree_omap.h                     node->key < key ? -1 : 0));
node              187 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
node              189 maint/gnulib/lib/gl_anytree_omap.h         node = node->left;
node              193 maint/gnulib/lib/gl_anytree_omap.h           *oldvaluep = node->value;
node              194 maint/gnulib/lib/gl_anytree_omap.h           gl_tree_remove_node (map, node);
node              205 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node = map->root;
node              214 maint/gnulib/lib/gl_anytree_omap.h           if (node == NULL)
node              216 maint/gnulib/lib/gl_anytree_omap.h           stack_ptr->node = node;
node              218 maint/gnulib/lib/gl_anytree_omap.h           node = node->left;
node              227 maint/gnulib/lib/gl_anytree_omap.h           node = stack_ptr->node;
node              232 maint/gnulib/lib/gl_anytree_omap.h             map->base.vdispose_fn (node->value);
node              234 maint/gnulib/lib/gl_anytree_omap.h             map->base.kdispose_fn (node->key);
node              235 maint/gnulib/lib/gl_anytree_omap.h           free (node);
node              239 maint/gnulib/lib/gl_anytree_omap.h       node = node->right;
node              252 maint/gnulib/lib/gl_anytree_omap.h   gl_omap_node_t node;
node              257 maint/gnulib/lib/gl_anytree_omap.h   node = map->root;
node              258 maint/gnulib/lib/gl_anytree_omap.h   if (node != NULL)
node              259 maint/gnulib/lib/gl_anytree_omap.h     while (node->left != NULL)
node              260 maint/gnulib/lib/gl_anytree_omap.h       node = node->left;
node              261 maint/gnulib/lib/gl_anytree_omap.h   result.p = node;
node              279 maint/gnulib/lib/gl_anytree_omap.h       gl_omap_node_t node = (gl_omap_node_t) iterator->p;
node              280 maint/gnulib/lib/gl_anytree_omap.h       *keyp = node->key;
node              281 maint/gnulib/lib/gl_anytree_omap.h       *valuep = node->value;
node              283 maint/gnulib/lib/gl_anytree_omap.h       if (node->right != NULL)
node              285 maint/gnulib/lib/gl_anytree_omap.h           node = node->right;
node              286 maint/gnulib/lib/gl_anytree_omap.h           while (node->left != NULL)
node              287 maint/gnulib/lib/gl_anytree_omap.h             node = node->left;
node              291 maint/gnulib/lib/gl_anytree_omap.h           while (node->parent != NULL && node->parent->right == node)
node              292 maint/gnulib/lib/gl_anytree_omap.h             node = node->parent;
node              293 maint/gnulib/lib/gl_anytree_omap.h           node = node->parent;
node              295 maint/gnulib/lib/gl_anytree_omap.h       iterator->p = node;
node               23 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node               58 maint/gnulib/lib/gl_anytree_oset.h gl_tree_next_node (gl_oset_node_t node)
node               60 maint/gnulib/lib/gl_anytree_oset.h   if (node->right != NULL)
node               62 maint/gnulib/lib/gl_anytree_oset.h       node = node->right;
node               63 maint/gnulib/lib/gl_anytree_oset.h       while (node->left != NULL)
node               64 maint/gnulib/lib/gl_anytree_oset.h         node = node->left;
node               68 maint/gnulib/lib/gl_anytree_oset.h       while (node->parent != NULL && node->parent->right == node)
node               69 maint/gnulib/lib/gl_anytree_oset.h         node = node->parent;
node               70 maint/gnulib/lib/gl_anytree_oset.h       node = node->parent;
node               72 maint/gnulib/lib/gl_anytree_oset.h   return node;
node               77 maint/gnulib/lib/gl_anytree_oset.h gl_tree_prev_node (gl_oset_node_t node)
node               79 maint/gnulib/lib/gl_anytree_oset.h   if (node->left != NULL)
node               81 maint/gnulib/lib/gl_anytree_oset.h       node = node->left;
node               82 maint/gnulib/lib/gl_anytree_oset.h       while (node->right != NULL)
node               83 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
node               87 maint/gnulib/lib/gl_anytree_oset.h       while (node->parent != NULL && node->parent->left == node)
node               88 maint/gnulib/lib/gl_anytree_oset.h         node = node->parent;
node               89 maint/gnulib/lib/gl_anytree_oset.h       node = node->parent;
node               91 maint/gnulib/lib/gl_anytree_oset.h   return node;
node               98 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node              100 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
node              103 maint/gnulib/lib/gl_anytree_oset.h                  ? compar (node->value, elt)
node              104 maint/gnulib/lib/gl_anytree_oset.h                  : (node->value > elt ? 1 :
node              105 maint/gnulib/lib/gl_anytree_oset.h                     node->value < elt ? -1 : 0));
node              108 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
node              110 maint/gnulib/lib/gl_anytree_oset.h         node = node->left;
node              124 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node              126 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
node              128 maint/gnulib/lib/gl_anytree_oset.h       if (! threshold_fn (node->value, threshold))
node              129 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
node              134 maint/gnulib/lib/gl_anytree_oset.h           gl_oset_node_t found = node;
node              135 maint/gnulib/lib/gl_anytree_oset.h           node = node->left;
node              136 maint/gnulib/lib/gl_anytree_oset.h           for (; node != NULL; )
node              138 maint/gnulib/lib/gl_anytree_oset.h               if (! threshold_fn (node->value, threshold))
node              139 maint/gnulib/lib/gl_anytree_oset.h                 node = node->right;
node              142 maint/gnulib/lib/gl_anytree_oset.h                   found = node;
node              143 maint/gnulib/lib/gl_anytree_oset.h                   node = node->left;
node              157 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node              159 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
node              162 maint/gnulib/lib/gl_anytree_oset.h                  ? compar (node->value, elt)
node              163 maint/gnulib/lib/gl_anytree_oset.h                  : (node->value > elt ? 1 :
node              164 maint/gnulib/lib/gl_anytree_oset.h                     node->value < elt ? -1 : 0));
node              167 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
node              169 maint/gnulib/lib/gl_anytree_oset.h         node = node->left;
node              172 maint/gnulib/lib/gl_anytree_oset.h         return node;
node              181 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node = set->root;
node              183 maint/gnulib/lib/gl_anytree_oset.h   if (node == NULL)
node              195 maint/gnulib/lib/gl_anytree_oset.h                  ? compar (node->value, elt)
node              196 maint/gnulib/lib/gl_anytree_oset.h                  : (node->value > elt ? 1 :
node              197 maint/gnulib/lib/gl_anytree_oset.h                     node->value < elt ? -1 : 0));
node              201 maint/gnulib/lib/gl_anytree_oset.h           if (node->right == NULL)
node              203 maint/gnulib/lib/gl_anytree_oset.h               if (gl_tree_nx_add_after (set, node, elt) == NULL)
node              207 maint/gnulib/lib/gl_anytree_oset.h           node = node->right;
node              211 maint/gnulib/lib/gl_anytree_oset.h           if (node->left == NULL)
node              213 maint/gnulib/lib/gl_anytree_oset.h               if (gl_tree_nx_add_before (set, node, elt) == NULL)
node              217 maint/gnulib/lib/gl_anytree_oset.h           node = node->left;
node              227 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node = gl_tree_search_node (set, elt);
node              229 maint/gnulib/lib/gl_anytree_oset.h   if (node != NULL)
node              230 maint/gnulib/lib/gl_anytree_oset.h     return gl_tree_remove_node (set, node);
node              262 maint/gnulib/lib/gl_anytree_oset.h               gl_oset_node_t node;
node              267 maint/gnulib/lib/gl_anytree_oset.h               node = set->root;
node              272 maint/gnulib/lib/gl_anytree_oset.h                              ? compar (node->value, elt)
node              273 maint/gnulib/lib/gl_anytree_oset.h                              : (node->value > elt ? 1 :
node              274 maint/gnulib/lib/gl_anytree_oset.h                                 node->value < elt ? -1 : 0));
node              278 maint/gnulib/lib/gl_anytree_oset.h                       if (node->right == NULL)
node              280 maint/gnulib/lib/gl_anytree_oset.h                           gl_tree_add_node_after (set, node, old_node);
node              283 maint/gnulib/lib/gl_anytree_oset.h                       node = node->right;
node              287 maint/gnulib/lib/gl_anytree_oset.h                       if (node->left == NULL)
node              289 maint/gnulib/lib/gl_anytree_oset.h                           gl_tree_add_node_before (set, node, old_node);
node              292 maint/gnulib/lib/gl_anytree_oset.h                       node = node->left;
node              312 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node = set->root;
node              321 maint/gnulib/lib/gl_anytree_oset.h           if (node == NULL)
node              323 maint/gnulib/lib/gl_anytree_oset.h           stack_ptr->node = node;
node              325 maint/gnulib/lib/gl_anytree_oset.h           node = node->left;
node              334 maint/gnulib/lib/gl_anytree_oset.h           node = stack_ptr->node;
node              339 maint/gnulib/lib/gl_anytree_oset.h             set->base.dispose_fn (node->value);
node              340 maint/gnulib/lib/gl_anytree_oset.h           free (node);
node              344 maint/gnulib/lib/gl_anytree_oset.h       node = node->right;
node              357 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node              362 maint/gnulib/lib/gl_anytree_oset.h   node = set->root;
node              363 maint/gnulib/lib/gl_anytree_oset.h   if (node != NULL)
node              364 maint/gnulib/lib/gl_anytree_oset.h     while (node->left != NULL)
node              365 maint/gnulib/lib/gl_anytree_oset.h       node = node->left;
node              366 maint/gnulib/lib/gl_anytree_oset.h   result.p = node;
node              384 maint/gnulib/lib/gl_anytree_oset.h   gl_oset_node_t node;
node              396 maint/gnulib/lib/gl_anytree_oset.h   for (node = set->root; node != NULL; )
node              398 maint/gnulib/lib/gl_anytree_oset.h       if (! threshold_fn (node->value, threshold))
node              399 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
node              404 maint/gnulib/lib/gl_anytree_oset.h           gl_oset_node_t found = node;
node              405 maint/gnulib/lib/gl_anytree_oset.h           node = node->left;
node              406 maint/gnulib/lib/gl_anytree_oset.h           for (; node != NULL; )
node              408 maint/gnulib/lib/gl_anytree_oset.h               if (! threshold_fn (node->value, threshold))
node              409 maint/gnulib/lib/gl_anytree_oset.h                 node = node->right;
node              412 maint/gnulib/lib/gl_anytree_oset.h                   found = node;
node              413 maint/gnulib/lib/gl_anytree_oset.h                   node = node->left;
node              429 maint/gnulib/lib/gl_anytree_oset.h       gl_oset_node_t node = (gl_oset_node_t) iterator->p;
node              430 maint/gnulib/lib/gl_anytree_oset.h       *eltp = node->value;
node              432 maint/gnulib/lib/gl_anytree_oset.h       node = gl_tree_next_node (node);
node              433 maint/gnulib/lib/gl_anytree_oset.h       iterator->p = node;
node               33 maint/gnulib/lib/gl_anytreehash_list1.h node_position (gl_list_node_t node)
node               37 maint/gnulib/lib/gl_anytreehash_list1.h   if (node->left != NULL)
node               38 maint/gnulib/lib/gl_anytreehash_list1.h     position += node->left->branch_size;
node               41 maint/gnulib/lib/gl_anytreehash_list1.h       gl_list_node_t parent = node->parent;
node               46 maint/gnulib/lib/gl_anytreehash_list1.h       if (parent->right == node)
node               53 maint/gnulib/lib/gl_anytreehash_list1.h       node = parent;
node               74 maint/gnulib/lib/gl_anytreehash_list1.h   gl_list_node_t node = (gl_list_node_t) x;
node               75 maint/gnulib/lib/gl_anytreehash_list1.h   size_t position = node_position (node);
node              123 maint/gnulib/lib/gl_anytreehash_list1.h                   gl_list_node_t node = gl_oset_first (nodes);
node              124 maint/gnulib/lib/gl_anytreehash_list1.h                   if (equals != NULL ? equals (value, node->value) : value == node->value)
node              134 maint/gnulib/lib/gl_anytreehash_list1.h                   gl_list_node_t node = (struct gl_list_node_impl *) entry;
node              135 maint/gnulib/lib/gl_anytreehash_list1.h                   if (equals != NULL ? equals (value, node->value) : value == node->value)
node              148 maint/gnulib/lib/gl_anytreehash_list1.h                       if (gl_oset_nx_add (nodes, node) < 0)
node              178 maint/gnulib/lib/gl_anytreehash_list1.h #define add_to_bucket(list,node) \
node              179 maint/gnulib/lib/gl_anytreehash_list1.h     __builtin_expect ((add_to_bucket) (list, node), 0)
node              219 maint/gnulib/lib/gl_anytreehash_list1.h               gl_list_node_t node = gl_oset_first (nodes);
node              220 maint/gnulib/lib/gl_anytreehash_list1.h               if (equals != NULL ? equals (value, node->value) : value == node->value)
node              229 maint/gnulib/lib/gl_anytreehash_list1.h                       node = gl_oset_first (nodes);
node              230 maint/gnulib/lib/gl_anytreehash_list1.h                       node->h.hash_next = entry->hash_next;
node              231 maint/gnulib/lib/gl_anytreehash_list1.h                       *entryp = &node->h;
node              267 maint/gnulib/lib/gl_anytreehash_list1.h   gl_list_node_t node = list->root;
node              276 maint/gnulib/lib/gl_anytreehash_list1.h           if (node == NULL)
node              278 maint/gnulib/lib/gl_anytreehash_list1.h           stack_ptr->node = node;
node              280 maint/gnulib/lib/gl_anytreehash_list1.h           node = node->left;
node              292 maint/gnulib/lib/gl_anytreehash_list1.h       node = stack_ptr->node;
node              294 maint/gnulib/lib/gl_anytreehash_list1.h       node->h.hashcode =
node              296 maint/gnulib/lib/gl_anytreehash_list1.h          ? list->base.hashcode_fn (node->value)
node              297 maint/gnulib/lib/gl_anytreehash_list1.h          : (size_t)(uintptr_t) node->value);
node              298 maint/gnulib/lib/gl_anytreehash_list1.h       if (add_to_bucket (list, node) < 0)
node              302 maint/gnulib/lib/gl_anytreehash_list1.h       node = node->right;
node              314 maint/gnulib/lib/gl_anytreehash_list1.h       node = node->left;
node              319 maint/gnulib/lib/gl_anytreehash_list1.h           if (node == NULL)
node              321 maint/gnulib/lib/gl_anytreehash_list1.h           stack_ptr->node = node;
node              323 maint/gnulib/lib/gl_anytreehash_list1.h           node = node->right;
node              335 maint/gnulib/lib/gl_anytreehash_list1.h       node = stack_ptr->node;
node              337 maint/gnulib/lib/gl_anytreehash_list1.h       remove_from_bucket (list, node);
node               47 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_list_node_t node = gl_oset_first (nodes);
node               48 maint/gnulib/lib/gl_anytreehash_list2.h                   if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node               57 maint/gnulib/lib/gl_anytreehash_list2.h                               || node_position (node) < end_index)
node               58 maint/gnulib/lib/gl_anytreehash_list2.h                             return node;
node               70 maint/gnulib/lib/gl_anytreehash_list2.h                               node = (gl_list_node_t) nodes_elt;
node               72 maint/gnulib/lib/gl_anytreehash_list2.h                                   || node_position (node) < end_index)
node               73 maint/gnulib/lib/gl_anytreehash_list2.h                                 return node;
node               82 maint/gnulib/lib/gl_anytreehash_list2.h                   gl_list_node_t node = (struct gl_list_node_impl *) entry;
node               83 maint/gnulib/lib/gl_anytreehash_list2.h                   if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node               90 maint/gnulib/lib/gl_anytreehash_list2.h                           size_t position = node_position (node);
node               95 maint/gnulib/lib/gl_anytreehash_list2.h                         return node;
node              107 maint/gnulib/lib/gl_anytreehash_list2.h               gl_list_node_t node = (struct gl_list_node_impl *) entry;
node              108 maint/gnulib/lib/gl_anytreehash_list2.h               if (equals != NULL ? equals (elt, node->value) : elt == node->value)
node              115 maint/gnulib/lib/gl_anytreehash_list2.h                       size_t position = node_position (node);
node              120 maint/gnulib/lib/gl_anytreehash_list2.h                     return node;
node              134 maint/gnulib/lib/gl_anytreehash_list2.h   gl_list_node_t node =
node              137 maint/gnulib/lib/gl_anytreehash_list2.h   if (node != NULL)
node              138 maint/gnulib/lib/gl_anytreehash_list2.h     return node_position (node);
node              174 maint/gnulib/lib/gl_anytreehash_list2.h     gl_list_node_t node = list->root;
node              183 maint/gnulib/lib/gl_anytreehash_list2.h             if (node == NULL)
node              185 maint/gnulib/lib/gl_anytreehash_list2.h             stack_ptr->node = node;
node              187 maint/gnulib/lib/gl_anytreehash_list2.h             node = node->left;
node              196 maint/gnulib/lib/gl_anytreehash_list2.h             node = stack_ptr->node;
node              201 maint/gnulib/lib/gl_anytreehash_list2.h               list->base.dispose_fn (node->value);
node              202 maint/gnulib/lib/gl_anytreehash_list2.h             free (node);
node              206 maint/gnulib/lib/gl_anytreehash_list2.h         node = node->right;
node               47 maint/gnulib/lib/gl_array_list.c #define NODE_TO_INDEX(node) ((uintptr_t)(node) - 1)
node              121 maint/gnulib/lib/gl_array_list.c gl_array_node_value (gl_list_t list, gl_list_node_t node)
node              123 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              131 maint/gnulib/lib/gl_array_list.c gl_array_node_nx_set_value (gl_list_t list, gl_list_node_t node,
node              134 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              143 maint/gnulib/lib/gl_array_list.c gl_array_next_node (gl_list_t list, gl_list_node_t node)
node              145 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              157 maint/gnulib/lib/gl_array_list.c gl_array_previous_node (gl_list_t list, gl_list_node_t node)
node              159 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              317 maint/gnulib/lib/gl_array_list.c gl_array_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              320 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              341 maint/gnulib/lib/gl_array_list.c gl_array_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              344 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              386 maint/gnulib/lib/gl_array_list.c gl_array_remove_node (gl_list_t list, gl_list_node_t node)
node              389 maint/gnulib/lib/gl_array_list.c   uintptr_t index = NODE_TO_INDEX (node);
node               43 maint/gnulib/lib/gl_avltree_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent)
node               46 maint/gnulib/lib/gl_avltree_list.c     (node->left != NULL ? check_invariants (node->left, node) : 0);
node               48 maint/gnulib/lib/gl_avltree_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
node               51 maint/gnulib/lib/gl_avltree_list.c   if (!(node->parent == parent))
node               53 maint/gnulib/lib/gl_avltree_list.c   if (!(node->branch_size
node               54 maint/gnulib/lib/gl_avltree_list.c         == (node->left != NULL ? node->left->branch_size : 0)
node               55 maint/gnulib/lib/gl_avltree_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
node               59 maint/gnulib/lib/gl_avltree_list.c   if (!(node->balance == balance))
node               38 maint/gnulib/lib/gl_avltree_omap.c #define NODE_PAYLOAD_ASSIGN(node) \
node               39 maint/gnulib/lib/gl_avltree_omap.c   node->key = key; \
node               40 maint/gnulib/lib/gl_avltree_omap.c   node->value = value;
node               41 maint/gnulib/lib/gl_avltree_omap.c #define NODE_PAYLOAD_DISPOSE(container, node) \
node               43 maint/gnulib/lib/gl_avltree_omap.c     container->base.kdispose_fn (node->key);
node               66 maint/gnulib/lib/gl_avltree_ordered.h            NODE_T node, int height_diff, NODE_T parent)
node               76 maint/gnulib/lib/gl_avltree_ordered.h       child = node;
node               77 maint/gnulib/lib/gl_avltree_ordered.h       node = parent;
node               79 maint/gnulib/lib/gl_avltree_ordered.h       previous_balance = node->balance;
node               85 maint/gnulib/lib/gl_avltree_ordered.h       if (node->left != NULL || node->right != NULL)
node               86 maint/gnulib/lib/gl_avltree_ordered.h         balance_diff = (child == node->right ? height_diff : -height_diff);
node               93 maint/gnulib/lib/gl_avltree_ordered.h       node->balance += balance_diff;
node               99 maint/gnulib/lib/gl_avltree_ordered.h           if (node->parent == NULL)
node              102 maint/gnulib/lib/gl_avltree_ordered.h           else if (node->parent->left == node)
node              103 maint/gnulib/lib/gl_avltree_ordered.h             nodep = &node->parent->left;
node              104 maint/gnulib/lib/gl_avltree_ordered.h           else if (node->parent->right == node)
node              105 maint/gnulib/lib/gl_avltree_ordered.h             nodep = &node->parent->right;
node              109 maint/gnulib/lib/gl_avltree_ordered.h           nodeleft = node->left;
node              110 maint/gnulib/lib/gl_avltree_ordered.h           noderight = node->right;
node              131 maint/gnulib/lib/gl_avltree_ordered.h                   node->left = nodeleftright;
node              132 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleft->right = node;
node              134 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleft->parent = node->parent;
node              135 maint/gnulib/lib/gl_avltree_ordered.h                   node->parent = nodeleft;
node              137 maint/gnulib/lib/gl_avltree_ordered.h                     nodeleftright->parent = node;
node              140 maint/gnulib/lib/gl_avltree_ordered.h                   node->balance = - nodeleft->balance;
node              166 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T R = node->left = nodeleftright->right;
node              168 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->right = node;
node              170 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->parent = node->parent;
node              174 maint/gnulib/lib/gl_avltree_ordered.h                     R->parent = node;
node              176 maint/gnulib/lib/gl_avltree_ordered.h                   node->parent = nodeleftright;
node              179 maint/gnulib/lib/gl_avltree_ordered.h                   node->balance = (nodeleftright->balance < 0 ? 1 : 0);
node              213 maint/gnulib/lib/gl_avltree_ordered.h                   node->right = noderightleft;
node              214 maint/gnulib/lib/gl_avltree_ordered.h                   noderight->left = node;
node              216 maint/gnulib/lib/gl_avltree_ordered.h                   noderight->parent = node->parent;
node              217 maint/gnulib/lib/gl_avltree_ordered.h                   node->parent = noderight;
node              219 maint/gnulib/lib/gl_avltree_ordered.h                     noderightleft->parent = node;
node              222 maint/gnulib/lib/gl_avltree_ordered.h                   node->balance = - noderight->balance;
node              247 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T L = node->right = noderightleft->left;
node              249 maint/gnulib/lib/gl_avltree_ordered.h                   noderightleft->left = node;
node              252 maint/gnulib/lib/gl_avltree_ordered.h                   noderightleft->parent = node->parent;
node              254 maint/gnulib/lib/gl_avltree_ordered.h                     L->parent = node;
node              257 maint/gnulib/lib/gl_avltree_ordered.h                   node->parent = noderightleft;
node              260 maint/gnulib/lib/gl_avltree_ordered.h                   node->balance = (noderightleft->balance > 0 ? -1 : 0);
node              276 maint/gnulib/lib/gl_avltree_ordered.h           node = *nodep;
node              285 maint/gnulib/lib/gl_avltree_ordered.h             height_diff = (node->balance == 0 ? 0 : 1);
node              291 maint/gnulib/lib/gl_avltree_ordered.h       parent = node->parent;
node              320 maint/gnulib/lib/gl_avltree_ordered.h       NODE_T node;
node              322 maint/gnulib/lib/gl_avltree_ordered.h       for (node = container->root; node->left != NULL; )
node              323 maint/gnulib/lib/gl_avltree_ordered.h         node = node->left;
node              325 maint/gnulib/lib/gl_avltree_ordered.h       node->left = new_node;
node              326 maint/gnulib/lib/gl_avltree_ordered.h       new_node->parent = node;
node              327 maint/gnulib/lib/gl_avltree_ordered.h       node->balance--;
node              330 maint/gnulib/lib/gl_avltree_ordered.h       if (node->right == NULL && node->parent != NULL)
node              331 maint/gnulib/lib/gl_avltree_ordered.h         rebalance (container, node, 1, node->parent);
node              340 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_before (CONTAINER_T container, NODE_T node, NODE_T new_node)
node              349 maint/gnulib/lib/gl_avltree_ordered.h   if (node->left == NULL)
node              351 maint/gnulib/lib/gl_avltree_ordered.h       node->left = new_node;
node              352 maint/gnulib/lib/gl_avltree_ordered.h       node->balance--;
node              353 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->right == NULL);
node              357 maint/gnulib/lib/gl_avltree_ordered.h       for (node = node->left; node->right != NULL; )
node              358 maint/gnulib/lib/gl_avltree_ordered.h         node = node->right;
node              359 maint/gnulib/lib/gl_avltree_ordered.h       node->right = new_node;
node              360 maint/gnulib/lib/gl_avltree_ordered.h       node->balance++;
node              361 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->left == NULL);
node              363 maint/gnulib/lib/gl_avltree_ordered.h   new_node->parent = node;
node              366 maint/gnulib/lib/gl_avltree_ordered.h   if (height_inc && node->parent != NULL)
node              367 maint/gnulib/lib/gl_avltree_ordered.h     rebalance (container, node, 1, node->parent);
node              373 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_nx_add_before (CONTAINER_T container, NODE_T node, NODE_PAYLOAD_PARAMS)
node              384 maint/gnulib/lib/gl_avltree_ordered.h   gl_tree_add_node_before (container, node, new_node);
node              390 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_add_node_after (CONTAINER_T container, NODE_T node, NODE_T new_node)
node              399 maint/gnulib/lib/gl_avltree_ordered.h   if (node->right == NULL)
node              401 maint/gnulib/lib/gl_avltree_ordered.h       node->right = new_node;
node              402 maint/gnulib/lib/gl_avltree_ordered.h       node->balance++;
node              403 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->left == NULL);
node              407 maint/gnulib/lib/gl_avltree_ordered.h       for (node = node->right; node->left != NULL; )
node              408 maint/gnulib/lib/gl_avltree_ordered.h         node = node->left;
node              409 maint/gnulib/lib/gl_avltree_ordered.h       node->left = new_node;
node              410 maint/gnulib/lib/gl_avltree_ordered.h       node->balance--;
node              411 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->right == NULL);
node              413 maint/gnulib/lib/gl_avltree_ordered.h   new_node->parent = node;
node              416 maint/gnulib/lib/gl_avltree_ordered.h   if (height_inc && node->parent != NULL)
node              417 maint/gnulib/lib/gl_avltree_ordered.h     rebalance (container, node, 1, node->parent);
node              423 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_nx_add_after (CONTAINER_T container, NODE_T node, NODE_PAYLOAD_PARAMS)
node              434 maint/gnulib/lib/gl_avltree_ordered.h   gl_tree_add_node_after (container, node, new_node);
node              439 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_remove_node_no_free (CONTAINER_T container, NODE_T node)
node              441 maint/gnulib/lib/gl_avltree_ordered.h   NODE_T parent = node->parent;
node              443 maint/gnulib/lib/gl_avltree_ordered.h   if (node->left == NULL)
node              446 maint/gnulib/lib/gl_avltree_ordered.h       NODE_T child = node->right;
node              454 maint/gnulib/lib/gl_avltree_ordered.h           if (parent->left == node)
node              462 maint/gnulib/lib/gl_avltree_ordered.h   else if (node->right == NULL)
node              467 maint/gnulib/lib/gl_avltree_ordered.h       NODE_T child = node->left;
node              474 maint/gnulib/lib/gl_avltree_ordered.h           if (parent->left == node)
node              489 maint/gnulib/lib/gl_avltree_ordered.h       for (subst = node->left; subst->right != NULL; )
node              507 maint/gnulib/lib/gl_avltree_ordered.h       if (subst_parent != node)
node              517 maint/gnulib/lib/gl_avltree_ordered.h       if (subst_parent != node)
node              519 maint/gnulib/lib/gl_avltree_ordered.h           subst->left = node->left;
node              522 maint/gnulib/lib/gl_avltree_ordered.h       subst->right = node->right;
node              524 maint/gnulib/lib/gl_avltree_ordered.h       subst->balance = node->balance;
node              528 maint/gnulib/lib/gl_avltree_ordered.h       else if (parent->left == node)
node              536 maint/gnulib/lib/gl_avltree_ordered.h       rebalance (container, child, -1, subst_parent != node ? subst_parent : subst);
node              543 maint/gnulib/lib/gl_avltree_ordered.h gl_tree_remove_node (CONTAINER_T container, NODE_T node)
node              545 maint/gnulib/lib/gl_avltree_ordered.h   gl_tree_remove_node_no_free (container, node);
node              546 maint/gnulib/lib/gl_avltree_ordered.h   NODE_PAYLOAD_DISPOSE (container, node)
node              547 maint/gnulib/lib/gl_avltree_ordered.h   free (node);
node              553 maint/gnulib/lib/gl_avltree_ordered.h check_invariants (NODE_T node, NODE_T parent, size_t *counterp)
node              556 maint/gnulib/lib/gl_avltree_ordered.h     (node->left != NULL ? check_invariants (node->left, node, counterp) : 0);
node              558 maint/gnulib/lib/gl_avltree_ordered.h     (node->right != NULL ? check_invariants (node->right, node, counterp) : 0);
node              561 maint/gnulib/lib/gl_avltree_ordered.h   if (!(node->parent == parent))
node              565 maint/gnulib/lib/gl_avltree_ordered.h   if (!(node->balance == balance))
node               37 maint/gnulib/lib/gl_avltree_oset.c #define NODE_PAYLOAD_ASSIGN(node) \
node               38 maint/gnulib/lib/gl_avltree_oset.c   node->value = elt;
node               39 maint/gnulib/lib/gl_avltree_oset.c #define NODE_PAYLOAD_DISPOSE(container, node) \
node               41 maint/gnulib/lib/gl_avltree_oset.c     container->base.dispose_fn (node->value);
node               65 maint/gnulib/lib/gl_avltreehash_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent)
node               68 maint/gnulib/lib/gl_avltreehash_list.c     (node->left != NULL ? check_invariants (node->left, node) : 0);
node               70 maint/gnulib/lib/gl_avltreehash_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
node               73 maint/gnulib/lib/gl_avltreehash_list.c   if (!(node->parent == parent))
node               75 maint/gnulib/lib/gl_avltreehash_list.c   if (!(node->branch_size
node               76 maint/gnulib/lib/gl_avltreehash_list.c         == (node->left != NULL ? node->left->branch_size : 0)
node               77 maint/gnulib/lib/gl_avltreehash_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
node               81 maint/gnulib/lib/gl_avltreehash_list.c   if (!(node->balance == balance))
node               50 maint/gnulib/lib/gl_carray_list.c #define NODE_TO_INDEX(node) ((uintptr_t)(node) - 1)
node              126 maint/gnulib/lib/gl_carray_list.c gl_carray_node_value (gl_list_t list, gl_list_node_t node)
node              128 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              141 maint/gnulib/lib/gl_carray_list.c gl_carray_node_nx_set_value (gl_list_t list, gl_list_node_t node,
node              144 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              158 maint/gnulib/lib/gl_carray_list.c gl_carray_next_node (gl_list_t list, gl_list_node_t node)
node              160 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              172 maint/gnulib/lib/gl_carray_list.c gl_carray_previous_node (gl_list_t list, gl_list_node_t node)
node              174 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              459 maint/gnulib/lib/gl_carray_list.c gl_carray_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              462 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              471 maint/gnulib/lib/gl_carray_list.c gl_carray_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              474 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              566 maint/gnulib/lib/gl_carray_list.c gl_carray_remove_node (gl_list_t list, gl_list_node_t node)
node              569 maint/gnulib/lib/gl_carray_list.c   uintptr_t index = NODE_TO_INDEX (node);
node              108 maint/gnulib/lib/gl_hash_map.c   gl_list_node_t node;
node              110 maint/gnulib/lib/gl_hash_map.c   for (node = (gl_list_node_t) map->table[bucket];
node              111 maint/gnulib/lib/gl_hash_map.c        node != NULL;
node              112 maint/gnulib/lib/gl_hash_map.c        node = (gl_list_node_t) node->h.hash_next)
node              113 maint/gnulib/lib/gl_hash_map.c     if (node->h.hashcode == hashcode
node              115 maint/gnulib/lib/gl_hash_map.c             ? equals (key, node->key)
node              116 maint/gnulib/lib/gl_hash_map.c             : key == node->key))
node              118 maint/gnulib/lib/gl_hash_map.c         *valuep = node->value;
node              137 maint/gnulib/lib/gl_hash_map.c     gl_list_node_t node;
node              139 maint/gnulib/lib/gl_hash_map.c     for (node = (gl_list_node_t) map->table[bucket];
node              140 maint/gnulib/lib/gl_hash_map.c          node != NULL;
node              141 maint/gnulib/lib/gl_hash_map.c          node = (gl_list_node_t) node->h.hash_next)
node              142 maint/gnulib/lib/gl_hash_map.c       if (node->h.hashcode == hashcode
node              144 maint/gnulib/lib/gl_hash_map.c               ? equals (key, node->key)
node              145 maint/gnulib/lib/gl_hash_map.c               : key == node->key))
node              147 maint/gnulib/lib/gl_hash_map.c           *oldvaluep = node->value;
node              148 maint/gnulib/lib/gl_hash_map.c           node->value = value;
node              154 maint/gnulib/lib/gl_hash_map.c   gl_list_node_t node =
node              157 maint/gnulib/lib/gl_hash_map.c   if (node == NULL)
node              160 maint/gnulib/lib/gl_hash_map.c   node->key = key;
node              161 maint/gnulib/lib/gl_hash_map.c   node->value = value;
node              162 maint/gnulib/lib/gl_hash_map.c   node->h.hashcode = hashcode;
node              165 maint/gnulib/lib/gl_hash_map.c   node->h.hash_next = map->table[bucket];
node              166 maint/gnulib/lib/gl_hash_map.c   map->table[bucket] = &node->h;
node              193 maint/gnulib/lib/gl_hash_map.c       gl_list_node_t node = *nodep;
node              194 maint/gnulib/lib/gl_hash_map.c       if (node->h.hashcode == hashcode
node              196 maint/gnulib/lib/gl_hash_map.c               ? equals (key, node->key)
node              197 maint/gnulib/lib/gl_hash_map.c               : key == node->key))
node              199 maint/gnulib/lib/gl_hash_map.c           *oldvaluep = node->value;
node              202 maint/gnulib/lib/gl_hash_map.c           *nodep = (gl_list_node_t) node->h.hash_next;
node              208 maint/gnulib/lib/gl_hash_map.c             map->base.kdispose_fn (node->key);
node              209 maint/gnulib/lib/gl_hash_map.c           free (node);
node              229 maint/gnulib/lib/gl_hash_map.c           gl_hash_entry_t node = table[--i];
node              231 maint/gnulib/lib/gl_hash_map.c           while (node != NULL)
node              233 maint/gnulib/lib/gl_hash_map.c               gl_hash_entry_t next = node->hash_next;
node              237 maint/gnulib/lib/gl_hash_map.c                 vdispose (((gl_list_node_t) node)->value);
node              239 maint/gnulib/lib/gl_hash_map.c                 kdispose (((gl_list_node_t) node)->key);
node              240 maint/gnulib/lib/gl_hash_map.c               free (node);
node              242 maint/gnulib/lib/gl_hash_map.c               node = next;
node              281 maint/gnulib/lib/gl_hash_map.c       gl_list_node_t node = (gl_list_node_t) iterator->p;
node              282 maint/gnulib/lib/gl_hash_map.c       *keyp = node->key;
node              283 maint/gnulib/lib/gl_hash_map.c       *valuep = node->value;
node              284 maint/gnulib/lib/gl_hash_map.c       iterator->p = (gl_list_node_t) node->h.hash_next;
node              298 maint/gnulib/lib/gl_hash_map.c               gl_list_node_t node = (gl_list_node_t) table[i++];
node              299 maint/gnulib/lib/gl_hash_map.c               if (node != NULL)
node              301 maint/gnulib/lib/gl_hash_map.c                   *keyp = node->key;
node              302 maint/gnulib/lib/gl_hash_map.c                   *valuep = node->value;
node              303 maint/gnulib/lib/gl_hash_map.c                   iterator->p = (gl_list_node_t) node->h.hash_next;
node              105 maint/gnulib/lib/gl_hash_set.c   gl_list_node_t node;
node              107 maint/gnulib/lib/gl_hash_set.c   for (node = (gl_list_node_t) set->table[bucket];
node              108 maint/gnulib/lib/gl_hash_set.c        node != NULL;
node              109 maint/gnulib/lib/gl_hash_set.c        node = (gl_list_node_t) node->h.hash_next)
node              110 maint/gnulib/lib/gl_hash_set.c     if (node->h.hashcode == hashcode
node              112 maint/gnulib/lib/gl_hash_set.c             ? equals (elt, node->value)
node              113 maint/gnulib/lib/gl_hash_set.c             : elt == node->value))
node              130 maint/gnulib/lib/gl_hash_set.c     gl_list_node_t node;
node              132 maint/gnulib/lib/gl_hash_set.c     for (node = (gl_list_node_t) set->table[bucket];
node              133 maint/gnulib/lib/gl_hash_set.c          node != NULL;
node              134 maint/gnulib/lib/gl_hash_set.c          node = (gl_list_node_t) node->h.hash_next)
node              135 maint/gnulib/lib/gl_hash_set.c       if (node->h.hashcode == hashcode
node              137 maint/gnulib/lib/gl_hash_set.c               ? equals (elt, node->value)
node              138 maint/gnulib/lib/gl_hash_set.c               : elt == node->value))
node              143 maint/gnulib/lib/gl_hash_set.c   gl_list_node_t node =
node              146 maint/gnulib/lib/gl_hash_set.c   if (node == NULL)
node              149 maint/gnulib/lib/gl_hash_set.c   node->value = elt;
node              150 maint/gnulib/lib/gl_hash_set.c   node->h.hashcode = hashcode;
node              153 maint/gnulib/lib/gl_hash_set.c   node->h.hash_next = set->table[bucket];
node              154 maint/gnulib/lib/gl_hash_set.c   set->table[bucket] = &node->h;
node              181 maint/gnulib/lib/gl_hash_set.c       gl_list_node_t node = *nodep;
node              182 maint/gnulib/lib/gl_hash_set.c       if (node->h.hashcode == hashcode
node              184 maint/gnulib/lib/gl_hash_set.c               ? equals (elt, node->value)
node              185 maint/gnulib/lib/gl_hash_set.c               : elt == node->value))
node              188 maint/gnulib/lib/gl_hash_set.c           *nodep = (gl_list_node_t) node->h.hash_next;
node              194 maint/gnulib/lib/gl_hash_set.c             set->base.dispose_fn (node->value);
node              195 maint/gnulib/lib/gl_hash_set.c           free (node);
node              214 maint/gnulib/lib/gl_hash_set.c           gl_hash_entry_t node = table[--i];
node              216 maint/gnulib/lib/gl_hash_set.c           while (node != NULL)
node              218 maint/gnulib/lib/gl_hash_set.c               gl_hash_entry_t next = node->hash_next;
node              222 maint/gnulib/lib/gl_hash_set.c                 dispose (((gl_list_node_t) node)->value);
node              223 maint/gnulib/lib/gl_hash_set.c               free (node);
node              225 maint/gnulib/lib/gl_hash_set.c               node = next;
node              263 maint/gnulib/lib/gl_hash_set.c       gl_list_node_t node = (gl_list_node_t) iterator->p;
node              264 maint/gnulib/lib/gl_hash_set.c       *eltp = node->value;
node              265 maint/gnulib/lib/gl_hash_set.c       iterator->p = (gl_list_node_t) node->h.hash_next;
node              279 maint/gnulib/lib/gl_hash_set.c               gl_list_node_t node = (gl_list_node_t) table[i++];
node              280 maint/gnulib/lib/gl_hash_set.c               if (node != NULL)
node              282 maint/gnulib/lib/gl_hash_set.c                   *eltp = node->value;
node              283 maint/gnulib/lib/gl_hash_set.c                   iterator->p = (gl_list_node_t) node->h.hash_next;
node               45 maint/gnulib/lib/gl_linkedhash_list.c add_to_bucket (gl_list_t list, gl_list_node_t node)
node               47 maint/gnulib/lib/gl_linkedhash_list.c   size_t bucket = node->h.hashcode % list->table_size;
node               49 maint/gnulib/lib/gl_linkedhash_list.c   node->h.hash_next = list->table[bucket];
node               50 maint/gnulib/lib/gl_linkedhash_list.c   list->table[bucket] = &node->h;
node               53 maint/gnulib/lib/gl_linkedhash_list.c #define add_to_bucket(list,node)  ((add_to_bucket) (list, node), 0)
node               57 maint/gnulib/lib/gl_linkedhash_list.c remove_from_bucket (gl_list_t list, gl_list_node_t node)
node               59 maint/gnulib/lib/gl_linkedhash_list.c   size_t bucket = node->h.hashcode % list->table_size;
node               64 maint/gnulib/lib/gl_linkedhash_list.c       if (*p == &node->h)
node               66 maint/gnulib/lib/gl_linkedhash_list.c           *p = node->h.hash_next;
node              133 maint/gnulib/lib/gl_linkedhash_map.c   gl_list_node_t node;
node              135 maint/gnulib/lib/gl_linkedhash_map.c   for (node = (gl_list_node_t) map->table[bucket];
node              136 maint/gnulib/lib/gl_linkedhash_map.c        node != NULL;
node              137 maint/gnulib/lib/gl_linkedhash_map.c        node = (gl_list_node_t) node->h.hash_next)
node              138 maint/gnulib/lib/gl_linkedhash_map.c     if (node->h.hashcode == hashcode
node              140 maint/gnulib/lib/gl_linkedhash_map.c             ? equals (key, node->key)
node              141 maint/gnulib/lib/gl_linkedhash_map.c             : key == node->key))
node              143 maint/gnulib/lib/gl_linkedhash_map.c         *valuep = node->value;
node              162 maint/gnulib/lib/gl_linkedhash_map.c     gl_list_node_t node;
node              164 maint/gnulib/lib/gl_linkedhash_map.c     for (node = (gl_list_node_t) map->table[bucket];
node              165 maint/gnulib/lib/gl_linkedhash_map.c          node != NULL;
node              166 maint/gnulib/lib/gl_linkedhash_map.c          node = (gl_list_node_t) node->h.hash_next)
node              167 maint/gnulib/lib/gl_linkedhash_map.c       if (node->h.hashcode == hashcode
node              169 maint/gnulib/lib/gl_linkedhash_map.c               ? equals (key, node->key)
node              170 maint/gnulib/lib/gl_linkedhash_map.c               : key == node->key))
node              172 maint/gnulib/lib/gl_linkedhash_map.c           *oldvaluep = node->value;
node              173 maint/gnulib/lib/gl_linkedhash_map.c           node->value = value;
node              179 maint/gnulib/lib/gl_linkedhash_map.c   gl_list_node_t node =
node              182 maint/gnulib/lib/gl_linkedhash_map.c   if (node == NULL)
node              185 maint/gnulib/lib/gl_linkedhash_map.c   ASYNCSAFE(const void *) node->key = key;
node              186 maint/gnulib/lib/gl_linkedhash_map.c   ASYNCSAFE(const void *) node->value = value;
node              187 maint/gnulib/lib/gl_linkedhash_map.c   node->h.hashcode = hashcode;
node              190 maint/gnulib/lib/gl_linkedhash_map.c   node->h.hash_next = map->table[bucket];
node              191 maint/gnulib/lib/gl_linkedhash_map.c   map->table[bucket] = &node->h;
node              194 maint/gnulib/lib/gl_linkedhash_map.c   ASYNCSAFE(gl_list_node_t) node->next = &map->root;
node              195 maint/gnulib/lib/gl_linkedhash_map.c   node->prev = map->root.prev;
node              196 maint/gnulib/lib/gl_linkedhash_map.c   ASYNCSAFE(gl_list_node_t) node->prev->next = node;
node              197 maint/gnulib/lib/gl_linkedhash_map.c   map->root.prev = node;
node              222 maint/gnulib/lib/gl_linkedhash_map.c       gl_list_node_t node = *nodep;
node              223 maint/gnulib/lib/gl_linkedhash_map.c       if (node->h.hashcode == hashcode
node              225 maint/gnulib/lib/gl_linkedhash_map.c               ? equals (key, node->key)
node              226 maint/gnulib/lib/gl_linkedhash_map.c               : key == node->key))
node              228 maint/gnulib/lib/gl_linkedhash_map.c           *oldvaluep = node->value;
node              231 maint/gnulib/lib/gl_linkedhash_map.c           *nodep = (gl_list_node_t) node->h.hash_next;
node              235 maint/gnulib/lib/gl_linkedhash_map.c             gl_list_node_t prev = node->prev;
node              236 maint/gnulib/lib/gl_linkedhash_map.c             gl_list_node_t next = node->next;
node              244 maint/gnulib/lib/gl_linkedhash_map.c             map->base.kdispose_fn (node->key);
node              245 maint/gnulib/lib/gl_linkedhash_map.c           free (node);
node              258 maint/gnulib/lib/gl_linkedhash_map.c   gl_list_node_t node;
node              260 maint/gnulib/lib/gl_linkedhash_map.c   for (node = map->root.next; node != &map->root; )
node              262 maint/gnulib/lib/gl_linkedhash_map.c       gl_list_node_t next = node->next;
node              264 maint/gnulib/lib/gl_linkedhash_map.c         vdispose (node->value);
node              266 maint/gnulib/lib/gl_linkedhash_map.c         kdispose (node->key);
node              267 maint/gnulib/lib/gl_linkedhash_map.c       free (node);
node              268 maint/gnulib/lib/gl_linkedhash_map.c       node = next;
node              303 maint/gnulib/lib/gl_linkedhash_map.c       gl_list_node_t node = (gl_list_node_t) iterator->p;
node              304 maint/gnulib/lib/gl_linkedhash_map.c       *keyp = node->key;
node              305 maint/gnulib/lib/gl_linkedhash_map.c       *valuep = node->value;
node              306 maint/gnulib/lib/gl_linkedhash_map.c       iterator->p = node->next;
node              130 maint/gnulib/lib/gl_linkedhash_set.c   gl_list_node_t node;
node              132 maint/gnulib/lib/gl_linkedhash_set.c   for (node = (gl_list_node_t) set->table[bucket];
node              133 maint/gnulib/lib/gl_linkedhash_set.c        node != NULL;
node              134 maint/gnulib/lib/gl_linkedhash_set.c        node = (gl_list_node_t) node->h.hash_next)
node              135 maint/gnulib/lib/gl_linkedhash_set.c     if (node->h.hashcode == hashcode
node              137 maint/gnulib/lib/gl_linkedhash_set.c             ? equals (elt, node->value)
node              138 maint/gnulib/lib/gl_linkedhash_set.c             : elt == node->value))
node              155 maint/gnulib/lib/gl_linkedhash_set.c     gl_list_node_t node;
node              157 maint/gnulib/lib/gl_linkedhash_set.c     for (node = (gl_list_node_t) set->table[bucket];
node              158 maint/gnulib/lib/gl_linkedhash_set.c          node != NULL;
node              159 maint/gnulib/lib/gl_linkedhash_set.c          node = (gl_list_node_t) node->h.hash_next)
node              160 maint/gnulib/lib/gl_linkedhash_set.c       if (node->h.hashcode == hashcode
node              162 maint/gnulib/lib/gl_linkedhash_set.c               ? equals (elt, node->value)
node              163 maint/gnulib/lib/gl_linkedhash_set.c               : elt == node->value))
node              168 maint/gnulib/lib/gl_linkedhash_set.c   gl_list_node_t node =
node              171 maint/gnulib/lib/gl_linkedhash_set.c   if (node == NULL)
node              174 maint/gnulib/lib/gl_linkedhash_set.c   ASYNCSAFE(const void *) node->value = elt;
node              175 maint/gnulib/lib/gl_linkedhash_set.c   node->h.hashcode = hashcode;
node              178 maint/gnulib/lib/gl_linkedhash_set.c   node->h.hash_next = set->table[bucket];
node              179 maint/gnulib/lib/gl_linkedhash_set.c   set->table[bucket] = &node->h;
node              182 maint/gnulib/lib/gl_linkedhash_set.c   ASYNCSAFE(gl_list_node_t) node->next = &set->root;
node              183 maint/gnulib/lib/gl_linkedhash_set.c   node->prev = set->root.prev;
node              184 maint/gnulib/lib/gl_linkedhash_set.c   ASYNCSAFE(gl_list_node_t) node->prev->next = node;
node              185 maint/gnulib/lib/gl_linkedhash_set.c   set->root.prev = node;
node              210 maint/gnulib/lib/gl_linkedhash_set.c       gl_list_node_t node = *nodep;
node              211 maint/gnulib/lib/gl_linkedhash_set.c       if (node->h.hashcode == hashcode
node              213 maint/gnulib/lib/gl_linkedhash_set.c               ? equals (elt, node->value)
node              214 maint/gnulib/lib/gl_linkedhash_set.c               : elt == node->value))
node              217 maint/gnulib/lib/gl_linkedhash_set.c           *nodep = (gl_list_node_t) node->h.hash_next;
node              221 maint/gnulib/lib/gl_linkedhash_set.c             gl_list_node_t prev = node->prev;
node              222 maint/gnulib/lib/gl_linkedhash_set.c             gl_list_node_t next = node->next;
node              230 maint/gnulib/lib/gl_linkedhash_set.c             set->base.dispose_fn (node->value);
node              231 maint/gnulib/lib/gl_linkedhash_set.c           free (node);
node              243 maint/gnulib/lib/gl_linkedhash_set.c   gl_list_node_t node;
node              245 maint/gnulib/lib/gl_linkedhash_set.c   for (node = set->root.next; node != &set->root; )
node              247 maint/gnulib/lib/gl_linkedhash_set.c       gl_list_node_t next = node->next;
node              249 maint/gnulib/lib/gl_linkedhash_set.c         dispose (node->value);
node              250 maint/gnulib/lib/gl_linkedhash_set.c       free (node);
node              251 maint/gnulib/lib/gl_linkedhash_set.c       node = next;
node              285 maint/gnulib/lib/gl_linkedhash_set.c       gl_list_node_t node = (gl_list_node_t) iterator->p;
node              286 maint/gnulib/lib/gl_linkedhash_set.c       *eltp = node->value;
node              287 maint/gnulib/lib/gl_linkedhash_set.c       iterator->p = node->next;
node              199 maint/gnulib/lib/gl_list.h extern const void * gl_list_node_value (gl_list_t list, gl_list_node_t node);
node              203 maint/gnulib/lib/gl_list.h extern void gl_list_node_set_value (gl_list_t list, gl_list_node_t node,
node              207 maint/gnulib/lib/gl_list.h extern int gl_list_node_nx_set_value (gl_list_t list, gl_list_node_t node,
node              212 maint/gnulib/lib/gl_list.h extern gl_list_node_t gl_list_next_node (gl_list_t list, gl_list_node_t node);
node              216 maint/gnulib/lib/gl_list.h extern gl_list_node_t gl_list_previous_node (gl_list_t list, gl_list_node_t node);
node              330 maint/gnulib/lib/gl_list.h extern gl_list_node_t gl_list_add_before (gl_list_t list, gl_list_node_t node,
node              335 maint/gnulib/lib/gl_list.h                                              gl_list_node_t node,
node              341 maint/gnulib/lib/gl_list.h extern gl_list_node_t gl_list_add_after (gl_list_t list, gl_list_node_t node,
node              345 maint/gnulib/lib/gl_list.h extern gl_list_node_t gl_list_nx_add_after (gl_list_t list, gl_list_node_t node,
node              360 maint/gnulib/lib/gl_list.h extern bool gl_list_remove_node (gl_list_t list, gl_list_node_t node);
node              530 maint/gnulib/lib/gl_list.h   const void * (*node_value) (gl_list_t list, gl_list_node_t node);
node              531 maint/gnulib/lib/gl_list.h   int (*node_nx_set_value) (gl_list_t list, gl_list_node_t node,
node              533 maint/gnulib/lib/gl_list.h   gl_list_node_t (*next_node) (gl_list_t list, gl_list_node_t node);
node              534 maint/gnulib/lib/gl_list.h   gl_list_node_t (*previous_node) (gl_list_t list, gl_list_node_t node);
node              546 maint/gnulib/lib/gl_list.h   gl_list_node_t (*nx_add_before) (gl_list_t list, gl_list_node_t node,
node              548 maint/gnulib/lib/gl_list.h   gl_list_node_t (*nx_add_after) (gl_list_t list, gl_list_node_t node,
node              552 maint/gnulib/lib/gl_list.h   bool (*remove_node) (gl_list_t list, gl_list_node_t node);
node              637 maint/gnulib/lib/gl_list.h gl_list_node_value (gl_list_t list, gl_list_node_t node)
node              640 maint/gnulib/lib/gl_list.h          ->node_value (list, node);
node              644 maint/gnulib/lib/gl_list.h gl_list_node_nx_set_value (gl_list_t list, gl_list_node_t node,
node              648 maint/gnulib/lib/gl_list.h          ->node_nx_set_value (list, node, elt);
node              652 maint/gnulib/lib/gl_list.h gl_list_next_node (gl_list_t list, gl_list_node_t node)
node              655 maint/gnulib/lib/gl_list.h          ->next_node (list, node);
node              659 maint/gnulib/lib/gl_list.h gl_list_previous_node (gl_list_t list, gl_list_node_t node)
node              662 maint/gnulib/lib/gl_list.h          ->previous_node (list, node);
node              780 maint/gnulib/lib/gl_list.h gl_list_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              783 maint/gnulib/lib/gl_list.h          ->nx_add_before (list, node, elt);
node              787 maint/gnulib/lib/gl_list.h gl_list_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              790 maint/gnulib/lib/gl_list.h          ->nx_add_after (list, node, elt);
node              801 maint/gnulib/lib/gl_list.h gl_list_remove_node (gl_list_t list, gl_list_node_t node)
node              804 maint/gnulib/lib/gl_list.h          ->remove_node (list, node);
node              124 maint/gnulib/lib/gl_list.hh   ELTYPE * node_value (gl_list_node_t node) const
node              125 maint/gnulib/lib/gl_list.hh     { return static_cast<ELTYPE *>(gl_list_node_value (_ptr, node)); }
node              129 maint/gnulib/lib/gl_list.hh   gl_list_node_t next_node (gl_list_node_t node) const
node              130 maint/gnulib/lib/gl_list.hh     { return gl_list_next_node (_ptr, node); }
node              134 maint/gnulib/lib/gl_list.hh   gl_list_node_t previous_node (gl_list_node_t node) const
node              135 maint/gnulib/lib/gl_list.hh     { return gl_list_previous_node (_ptr, node); }
node              197 maint/gnulib/lib/gl_list.hh   void node_set_value (gl_list_node_t node, ELTYPE * elt)
node              198 maint/gnulib/lib/gl_list.hh     { gl_list_node_set_value (_ptr, node, elt); }
node              230 maint/gnulib/lib/gl_list.hh   gl_list_node_t add_before (gl_list_node_t node, ELTYPE * elt)
node              231 maint/gnulib/lib/gl_list.hh     { return gl_list_add_before (_ptr, node, elt); }
node              235 maint/gnulib/lib/gl_list.hh   gl_list_node_t add_after (gl_list_node_t node, ELTYPE * elt)
node              236 maint/gnulib/lib/gl_list.hh     { return gl_list_add_after (_ptr, node, elt); }
node              245 maint/gnulib/lib/gl_list.hh   bool remove_node (gl_list_node_t node)
node              246 maint/gnulib/lib/gl_list.hh     { return gl_list_remove_node (_ptr, node); }
node               43 maint/gnulib/lib/gl_rbtree_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent)
node               46 maint/gnulib/lib/gl_rbtree_list.c     (node->left != NULL ? check_invariants (node->left, node) : 0);
node               48 maint/gnulib/lib/gl_rbtree_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
node               50 maint/gnulib/lib/gl_rbtree_list.c   if (!(node->parent == parent))
node               52 maint/gnulib/lib/gl_rbtree_list.c   if (!(node->branch_size
node               53 maint/gnulib/lib/gl_rbtree_list.c         == (node->left != NULL ? node->left->branch_size : 0)
node               54 maint/gnulib/lib/gl_rbtree_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
node               56 maint/gnulib/lib/gl_rbtree_list.c   if (!(node->color == BLACK || node->color == RED))
node               58 maint/gnulib/lib/gl_rbtree_list.c   if (parent == NULL && !(node->color == BLACK))
node               63 maint/gnulib/lib/gl_rbtree_list.c   return left_blackheight + (node->color == BLACK ? 1 : 0);
node               38 maint/gnulib/lib/gl_rbtree_omap.c #define NODE_PAYLOAD_ASSIGN(node) \
node               39 maint/gnulib/lib/gl_rbtree_omap.c   node->key = key; \
node               40 maint/gnulib/lib/gl_rbtree_omap.c   node->value = value;
node               41 maint/gnulib/lib/gl_rbtree_omap.c #define NODE_PAYLOAD_DISPOSE(container, node) \
node               43 maint/gnulib/lib/gl_rbtree_omap.c     container->base.kdispose_fn (node->key);
node              122 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_add (CONTAINER_T container, NODE_T node, NODE_T parent)
node              135 maint/gnulib/lib/gl_rbtree_ordered.h           node->color = RED;
node              155 maint/gnulib/lib/gl_rbtree_ordered.h           node->color = RED;
node              157 maint/gnulib/lib/gl_rbtree_ordered.h           node = grandparent;
node              178 maint/gnulib/lib/gl_rbtree_ordered.h               if (parent->right == node)
node              181 maint/gnulib/lib/gl_rbtree_ordered.h                   grandparent->left = rotate_left (parent, node);
node              182 maint/gnulib/lib/gl_rbtree_ordered.h                   node = parent;
node              199 maint/gnulib/lib/gl_rbtree_ordered.h               node->color = grandparent->color = RED;
node              203 maint/gnulib/lib/gl_rbtree_ordered.h               if (parent->left == node)
node              206 maint/gnulib/lib/gl_rbtree_ordered.h                   grandparent->right = rotate_right (node, parent);
node              207 maint/gnulib/lib/gl_rbtree_ordered.h                   node = parent;
node              224 maint/gnulib/lib/gl_rbtree_ordered.h               node->color = grandparent->color = RED;
node              230 maint/gnulib/lib/gl_rbtree_ordered.h       parent = node->parent;
node              236 maint/gnulib/lib/gl_rbtree_ordered.h           node->color = BLACK;
node              552 maint/gnulib/lib/gl_rbtree_ordered.h       NODE_T node;
node              554 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = container->root; node->left != NULL; )
node              555 maint/gnulib/lib/gl_rbtree_ordered.h         node = node->left;
node              557 maint/gnulib/lib/gl_rbtree_ordered.h       node->left = new_node;
node              558 maint/gnulib/lib/gl_rbtree_ordered.h       new_node->parent = node;
node              561 maint/gnulib/lib/gl_rbtree_ordered.h       rebalance_after_add (container, new_node, node);
node              570 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_before (CONTAINER_T container, NODE_T node, NODE_T new_node)
node              576 maint/gnulib/lib/gl_rbtree_ordered.h   if (node->left == NULL)
node              577 maint/gnulib/lib/gl_rbtree_ordered.h     node->left = new_node;
node              580 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = node->left; node->right != NULL; )
node              581 maint/gnulib/lib/gl_rbtree_ordered.h         node = node->right;
node              582 maint/gnulib/lib/gl_rbtree_ordered.h       node->right = new_node;
node              584 maint/gnulib/lib/gl_rbtree_ordered.h   new_node->parent = node;
node              587 maint/gnulib/lib/gl_rbtree_ordered.h   rebalance_after_add (container, new_node, node);
node              593 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_nx_add_before (CONTAINER_T container, NODE_T node, NODE_PAYLOAD_PARAMS)
node              604 maint/gnulib/lib/gl_rbtree_ordered.h   gl_tree_add_node_before (container, node, new_node);
node              610 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_add_node_after (CONTAINER_T container, NODE_T node, NODE_T new_node)
node              616 maint/gnulib/lib/gl_rbtree_ordered.h   if (node->right == NULL)
node              617 maint/gnulib/lib/gl_rbtree_ordered.h     node->right = new_node;
node              620 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = node->right; node->left != NULL; )
node              621 maint/gnulib/lib/gl_rbtree_ordered.h         node = node->left;
node              622 maint/gnulib/lib/gl_rbtree_ordered.h       node->left = new_node;
node              624 maint/gnulib/lib/gl_rbtree_ordered.h   new_node->parent = node;
node              627 maint/gnulib/lib/gl_rbtree_ordered.h   rebalance_after_add (container, new_node, node);
node              633 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_nx_add_after (CONTAINER_T container, NODE_T node, NODE_PAYLOAD_PARAMS)
node              644 maint/gnulib/lib/gl_rbtree_ordered.h   gl_tree_add_node_after (container, node, new_node);
node              649 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_remove_node_no_free (CONTAINER_T container, NODE_T node)
node              651 maint/gnulib/lib/gl_rbtree_ordered.h   NODE_T parent = node->parent;
node              653 maint/gnulib/lib/gl_rbtree_ordered.h   if (node->left == NULL)
node              656 maint/gnulib/lib/gl_rbtree_ordered.h       NODE_T child = node->right;
node              669 maint/gnulib/lib/gl_rbtree_ordered.h           if (parent->left == node)
node              674 maint/gnulib/lib/gl_rbtree_ordered.h           if (child == NULL && node->color == BLACK)
node              678 maint/gnulib/lib/gl_rbtree_ordered.h   else if (node->right == NULL)
node              683 maint/gnulib/lib/gl_rbtree_ordered.h       NODE_T child = node->left;
node              693 maint/gnulib/lib/gl_rbtree_ordered.h           if (parent->left == node)
node              707 maint/gnulib/lib/gl_rbtree_ordered.h       for (subst = node->left; subst->right != NULL; )
node              727 maint/gnulib/lib/gl_rbtree_ordered.h       if (subst_parent != node)
node              737 maint/gnulib/lib/gl_rbtree_ordered.h       if (subst_parent != node)
node              739 maint/gnulib/lib/gl_rbtree_ordered.h           subst->left = node->left;
node              742 maint/gnulib/lib/gl_rbtree_ordered.h       subst->right = node->right;
node              744 maint/gnulib/lib/gl_rbtree_ordered.h       subst->color = node->color;
node              748 maint/gnulib/lib/gl_rbtree_ordered.h       else if (parent->left == node)
node              763 maint/gnulib/lib/gl_rbtree_ordered.h                                     subst_parent != node ? subst_parent : subst);
node              771 maint/gnulib/lib/gl_rbtree_ordered.h gl_tree_remove_node (CONTAINER_T container, NODE_T node)
node              773 maint/gnulib/lib/gl_rbtree_ordered.h   gl_tree_remove_node_no_free (container, node);
node              774 maint/gnulib/lib/gl_rbtree_ordered.h   NODE_PAYLOAD_DISPOSE (container, node)
node              775 maint/gnulib/lib/gl_rbtree_ordered.h   free (node);
node              781 maint/gnulib/lib/gl_rbtree_ordered.h check_invariants (NODE_T node, NODE_T parent, size_t *counterp)
node              784 maint/gnulib/lib/gl_rbtree_ordered.h     (node->left != NULL ? check_invariants (node->left, node, counterp) : 0);
node              786 maint/gnulib/lib/gl_rbtree_ordered.h     (node->right != NULL ? check_invariants (node->right, node, counterp) : 0);
node              788 maint/gnulib/lib/gl_rbtree_ordered.h   if (!(node->parent == parent))
node              790 maint/gnulib/lib/gl_rbtree_ordered.h   if (!(node->color == BLACK || node->color == RED))
node              792 maint/gnulib/lib/gl_rbtree_ordered.h   if (parent == NULL && !(node->color == BLACK))
node              799 maint/gnulib/lib/gl_rbtree_ordered.h   return left_blackheight + (node->color == BLACK ? 1 : 0);
node               37 maint/gnulib/lib/gl_rbtree_oset.c #define NODE_PAYLOAD_ASSIGN(node) \
node               38 maint/gnulib/lib/gl_rbtree_oset.c   node->value = elt;
node               39 maint/gnulib/lib/gl_rbtree_oset.c #define NODE_PAYLOAD_DISPOSE(container, node) \
node               41 maint/gnulib/lib/gl_rbtree_oset.c     container->base.dispose_fn (node->value);
node               65 maint/gnulib/lib/gl_rbtreehash_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent)
node               68 maint/gnulib/lib/gl_rbtreehash_list.c     (node->left != NULL ? check_invariants (node->left, node) : 0);
node               70 maint/gnulib/lib/gl_rbtreehash_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
node               72 maint/gnulib/lib/gl_rbtreehash_list.c   if (!(node->parent == parent))
node               74 maint/gnulib/lib/gl_rbtreehash_list.c   if (!(node->branch_size
node               75 maint/gnulib/lib/gl_rbtreehash_list.c         == (node->left != NULL ? node->left->branch_size : 0)
node               76 maint/gnulib/lib/gl_rbtreehash_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
node               78 maint/gnulib/lib/gl_rbtreehash_list.c   if (!(node->color == BLACK || node->color == RED))
node               80 maint/gnulib/lib/gl_rbtreehash_list.c   if (parent == NULL && !(node->color == BLACK))
node               85 maint/gnulib/lib/gl_rbtreehash_list.c   return left_blackheight + (node->color == BLACK ? 1 : 0);
node               44 maint/gnulib/lib/gl_sublist.c #define NODE_TO_INDEX(node) ((uintptr_t)(node) - 1)
node               76 maint/gnulib/lib/gl_sublist.c gl_sublist_node_value (gl_list_t list, gl_list_node_t node)
node               78 maint/gnulib/lib/gl_sublist.c   uintptr_t index = NODE_TO_INDEX (node);
node               86 maint/gnulib/lib/gl_sublist.c gl_sublist_node_nx_set_value (gl_list_t list, gl_list_node_t node, const void *elt)
node               88 maint/gnulib/lib/gl_sublist.c   uintptr_t index = NODE_TO_INDEX (node);
node               98 maint/gnulib/lib/gl_sublist.c gl_sublist_next_node (gl_list_t list, gl_list_node_t node)
node              100 maint/gnulib/lib/gl_sublist.c   uintptr_t index = NODE_TO_INDEX (node);
node              113 maint/gnulib/lib/gl_sublist.c gl_sublist_previous_node (gl_list_t list, gl_list_node_t node)
node              115 maint/gnulib/lib/gl_sublist.c   uintptr_t index = NODE_TO_INDEX (node);
node              223 maint/gnulib/lib/gl_sublist.c gl_sublist_nx_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              225 maint/gnulib/lib/gl_sublist.c   size_t position = NODE_TO_INDEX (node);
node              236 maint/gnulib/lib/gl_sublist.c gl_sublist_nx_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              238 maint/gnulib/lib/gl_sublist.c   size_t position = NODE_TO_INDEX (node);
node              262 maint/gnulib/lib/gl_sublist.c gl_sublist_remove_node (gl_list_t list, gl_list_node_t node)
node              264 maint/gnulib/lib/gl_sublist.c   uintptr_t index = NODE_TO_INDEX (node);
node               55 maint/gnulib/lib/gl_xlist.h extern void gl_list_node_set_value (gl_list_t list, gl_list_node_t node,
node               63 maint/gnulib/lib/gl_xlist.h extern gl_list_node_t gl_list_add_before (gl_list_t list, gl_list_node_t node,
node               65 maint/gnulib/lib/gl_xlist.h extern gl_list_node_t gl_list_add_after (gl_list_t list, gl_list_node_t node,
node              112 maint/gnulib/lib/gl_xlist.h gl_list_node_set_value (gl_list_t list, gl_list_node_t node, const void *elt)
node              114 maint/gnulib/lib/gl_xlist.h   int result = gl_list_node_nx_set_value (list, node, elt);
node              165 maint/gnulib/lib/gl_xlist.h gl_list_add_before (gl_list_t list, gl_list_node_t node, const void *elt)
node              167 maint/gnulib/lib/gl_xlist.h   gl_list_node_t result = gl_list_nx_add_before (list, node, elt);
node              174 maint/gnulib/lib/gl_xlist.h gl_list_add_after (gl_list_t list, gl_list_node_t node, const void *elt)
node              176 maint/gnulib/lib/gl_xlist.h   gl_list_node_t result = gl_list_nx_add_after (list, node, elt);
node             2768 maint/gnulib/lib/localename.c   struct locale_hash_node *node;
node             2916 maint/gnulib/lib/localename.c   node = (struct locale_hash_node *) malloc (sizeof (struct locale_hash_node));
node             2917 maint/gnulib/lib/localename.c   if (node == NULL)
node             2924 maint/gnulib/lib/localename.c       free (node);
node             2929 maint/gnulib/lib/localename.c   node->locale = result;
node             2930 maint/gnulib/lib/localename.c   node->names = names;
node             2945 maint/gnulib/lib/localename.c           p->names = node->names;
node             2950 maint/gnulib/lib/localename.c         node->next = locale_hash_table[slot];
node             2951 maint/gnulib/lib/localename.c         locale_hash_table[slot] = node;
node             2957 maint/gnulib/lib/localename.c       free (node);
node             2968 maint/gnulib/lib/localename.c   struct locale_hash_node *node;
node             2975 maint/gnulib/lib/localename.c   node = (struct locale_hash_node *) malloc (sizeof (struct locale_hash_node));
node             2976 maint/gnulib/lib/localename.c   if (node == NULL)
node             2983 maint/gnulib/lib/localename.c       free (node);
node             2988 maint/gnulib/lib/localename.c   node->locale = result;
node             2994 maint/gnulib/lib/localename.c         node->names.category_name[category] =
node             3013 maint/gnulib/lib/localename.c         node->names = p->names;
node             3022 maint/gnulib/lib/localename.c             node->names.category_name[category] = "";
node             3037 maint/gnulib/lib/localename.c           p->names = node->names;
node             3042 maint/gnulib/lib/localename.c         node->next = locale_hash_table[slot];
node             3043 maint/gnulib/lib/localename.c         locale_hash_table[slot] = node;
node             3049 maint/gnulib/lib/localename.c       free (node);
node             1048 maint/gnulib/lib/mountlist.c     char node[9 + NAME_MAX];
node             1064 maint/gnulib/lib/mountlist.c         strcpy (node, "/dev/fs/");
node             1065 maint/gnulib/lib/mountlist.c         strcat (node, entry.d_name);
node             1067 maint/gnulib/lib/mountlist.c         if (statvfs (node, &dev) == 0)
node              244 maint/gnulib/lib/netdb.in.h                    char *restrict node, socklen_t nodelen,
node              253 maint/gnulib/lib/netdb.in.h                         char *restrict node, socklen_t nodelen,
node               41 maint/gnulib/lib/regcomp.c static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node);
node               42 maint/gnulib/lib/regcomp.c static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node);
node               44 maint/gnulib/lib/regcomp.c 				 bin_tree_t *node);
node               45 maint/gnulib/lib/regcomp.c static reg_errcode_t calc_first (void *extra, bin_tree_t *node);
node               46 maint/gnulib/lib/regcomp.c static reg_errcode_t calc_next (void *extra, bin_tree_t *node);
node               47 maint/gnulib/lib/regcomp.c static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node);
node               53 maint/gnulib/lib/regcomp.c 					 Idx node, bool root);
node              110 maint/gnulib/lib/regcomp.c static void free_token (re_token_t *node);
node              111 maint/gnulib/lib/regcomp.c static reg_errcode_t free_tree (void *extra, bin_tree_t *node);
node              112 maint/gnulib/lib/regcomp.c static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node);
node              289 maint/gnulib/lib/regcomp.c       Idx node = init_state->nodes.elems[node_cnt];
node              290 maint/gnulib/lib/regcomp.c       re_token_type_t type = dfa->nodes[node].type;
node              294 maint/gnulib/lib/regcomp.c 	  re_set_fastmap (fastmap, icase, dfa->nodes[node].opr.c);
node              303 maint/gnulib/lib/regcomp.c 	      *p++ = dfa->nodes[node].opr.c;
node              304 maint/gnulib/lib/regcomp.c 	      while (++node < dfa->nodes_len
node              305 maint/gnulib/lib/regcomp.c 		     &&	dfa->nodes[node].type == CHARACTER
node              306 maint/gnulib/lib/regcomp.c 		     && dfa->nodes[node].mb_partial)
node              307 maint/gnulib/lib/regcomp.c 		*p++ = dfa->nodes[node].opr.c;
node              322 maint/gnulib/lib/regcomp.c 	      bitset_word_t w = dfa->nodes[node].opr.sbcset[i];
node              330 maint/gnulib/lib/regcomp.c 	  re_charset_t *cset = dfa->nodes[node].opr.mbcset;
node             1048 maint/gnulib/lib/regcomp.c   Idx node;
node             1053 maint/gnulib/lib/regcomp.c   for (node = 0; node < dfa->nodes_len; ++node)
node             1054 maint/gnulib/lib/regcomp.c     switch (dfa->nodes[node].type)
node             1057 maint/gnulib/lib/regcomp.c 	if (dfa->nodes[node].opr.c >= ASCII_CHARS)
node             1061 maint/gnulib/lib/regcomp.c 	switch (dfa->nodes[node].opr.ctx_type)
node             1095 maint/gnulib/lib/regcomp.c 	      if (dfa->nodes[node].opr.sbcset[i] >> rshift != 0)
node             1106 maint/gnulib/lib/regcomp.c     for (node = 0; node < dfa->nodes_len; ++node)
node             1108 maint/gnulib/lib/regcomp.c 	if (dfa->nodes[node].type == CHARACTER
node             1109 maint/gnulib/lib/regcomp.c 	    && dfa->nodes[node].opr.c >= ASCII_CHARS)
node             1110 maint/gnulib/lib/regcomp.c 	  dfa->nodes[node].mb_partial = 0;
node             1111 maint/gnulib/lib/regcomp.c 	else if (dfa->nodes[node].type == OP_PERIOD)
node             1112 maint/gnulib/lib/regcomp.c 	  dfa->nodes[node].type = OP_UTF8_PERIOD;
node             1191 maint/gnulib/lib/regcomp.c   bin_tree_t *node, *prev;
node             1193 maint/gnulib/lib/regcomp.c   for (node = root; ; )
node             1197 maint/gnulib/lib/regcomp.c       while (node->left || node->right)
node             1198 maint/gnulib/lib/regcomp.c 	if (node->left)
node             1199 maint/gnulib/lib/regcomp.c 	  node = node->left;
node             1201 maint/gnulib/lib/regcomp.c 	  node = node->right;
node             1205 maint/gnulib/lib/regcomp.c 	  reg_errcode_t err = fn (extra, node);
node             1208 maint/gnulib/lib/regcomp.c 	  if (node->parent == NULL)
node             1210 maint/gnulib/lib/regcomp.c 	  prev = node;
node             1211 maint/gnulib/lib/regcomp.c 	  node = node->parent;
node             1214 maint/gnulib/lib/regcomp.c       while (node->right == prev || node->right == NULL);
node             1215 maint/gnulib/lib/regcomp.c       node = node->right;
node             1223 maint/gnulib/lib/regcomp.c   bin_tree_t *node;
node             1225 maint/gnulib/lib/regcomp.c   for (node = root; ; )
node             1227 maint/gnulib/lib/regcomp.c       reg_errcode_t err = fn (extra, node);
node             1232 maint/gnulib/lib/regcomp.c       if (node->left)
node             1233 maint/gnulib/lib/regcomp.c 	node = node->left;
node             1237 maint/gnulib/lib/regcomp.c 	  while (node->right == prev || node->right == NULL)
node             1239 maint/gnulib/lib/regcomp.c 	      prev = node;
node             1240 maint/gnulib/lib/regcomp.c 	      node = node->parent;
node             1241 maint/gnulib/lib/regcomp.c 	      if (!node)
node             1244 maint/gnulib/lib/regcomp.c 	  node = node->right;
node             1253 maint/gnulib/lib/regcomp.c optimize_subexps (void *extra, bin_tree_t *node)
node             1257 maint/gnulib/lib/regcomp.c   if (node->token.type == OP_BACK_REF && dfa->subexp_map)
node             1259 maint/gnulib/lib/regcomp.c       int idx = node->token.opr.idx;
node             1260 maint/gnulib/lib/regcomp.c       node->token.opr.idx = dfa->subexp_map[idx];
node             1261 maint/gnulib/lib/regcomp.c       dfa->used_bkref_map |= 1 << node->token.opr.idx;
node             1264 maint/gnulib/lib/regcomp.c   else if (node->token.type == SUBEXP
node             1265 maint/gnulib/lib/regcomp.c 	   && node->left && node->left->token.type == SUBEXP)
node             1267 maint/gnulib/lib/regcomp.c       Idx other_idx = node->left->token.opr.idx;
node             1269 maint/gnulib/lib/regcomp.c       node->left = node->left->left;
node             1270 maint/gnulib/lib/regcomp.c       if (node->left)
node             1271 maint/gnulib/lib/regcomp.c 	node->left->parent = node;
node             1273 maint/gnulib/lib/regcomp.c       dfa->subexp_map[other_idx] = dfa->subexp_map[node->token.opr.idx];
node             1284 maint/gnulib/lib/regcomp.c lower_subexps (void *extra, bin_tree_t *node)
node             1289 maint/gnulib/lib/regcomp.c   if (node->left && node->left->token.type == SUBEXP)
node             1291 maint/gnulib/lib/regcomp.c       node->left = lower_subexp (&err, preg, node->left);
node             1292 maint/gnulib/lib/regcomp.c       if (node->left)
node             1293 maint/gnulib/lib/regcomp.c 	node->left->parent = node;
node             1295 maint/gnulib/lib/regcomp.c   if (node->right && node->right->token.type == SUBEXP)
node             1297 maint/gnulib/lib/regcomp.c       node->right = lower_subexp (&err, preg, node->right);
node             1298 maint/gnulib/lib/regcomp.c       if (node->right)
node             1299 maint/gnulib/lib/regcomp.c 	node->right->parent = node;
node             1306 maint/gnulib/lib/regcomp.c lower_subexp (reg_errcode_t *err, regex_t *preg, bin_tree_t *node)
node             1309 maint/gnulib/lib/regcomp.c   bin_tree_t *body = node->left;
node             1317 maint/gnulib/lib/regcomp.c       && node->left != NULL
node             1318 maint/gnulib/lib/regcomp.c       && (node->token.opr.idx >= BITSET_WORD_BITS
node             1320 maint/gnulib/lib/regcomp.c 	       & ((bitset_word_t) 1 << node->token.opr.idx))))
node             1321 maint/gnulib/lib/regcomp.c     return node->left;
node             1336 maint/gnulib/lib/regcomp.c   op->token.opr.idx = cls->token.opr.idx = node->token.opr.idx;
node             1337 maint/gnulib/lib/regcomp.c   op->token.opt_subexp = cls->token.opt_subexp = node->token.opt_subexp;
node             1344 maint/gnulib/lib/regcomp.c calc_first (void *extra, bin_tree_t *node)
node             1347 maint/gnulib/lib/regcomp.c   if (node->token.type == CONCAT)
node             1349 maint/gnulib/lib/regcomp.c       node->first = node->left->first;
node             1350 maint/gnulib/lib/regcomp.c       node->node_idx = node->left->node_idx;
node             1354 maint/gnulib/lib/regcomp.c       node->first = node;
node             1355 maint/gnulib/lib/regcomp.c       node->node_idx = re_dfa_add_node (dfa, node->token);
node             1356 maint/gnulib/lib/regcomp.c       if (__glibc_unlikely (node->node_idx == -1))
node             1358 maint/gnulib/lib/regcomp.c       if (node->token.type == ANCHOR)
node             1359 maint/gnulib/lib/regcomp.c 	dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type;
node             1366 maint/gnulib/lib/regcomp.c calc_next (void *extra, bin_tree_t *node)
node             1368 maint/gnulib/lib/regcomp.c   switch (node->token.type)
node             1371 maint/gnulib/lib/regcomp.c       node->left->next = node;
node             1374 maint/gnulib/lib/regcomp.c       node->left->next = node->right->first;
node             1375 maint/gnulib/lib/regcomp.c       node->right->next = node->next;
node             1378 maint/gnulib/lib/regcomp.c       if (node->left)
node             1379 maint/gnulib/lib/regcomp.c 	node->left->next = node->next;
node             1380 maint/gnulib/lib/regcomp.c       if (node->right)
node             1381 maint/gnulib/lib/regcomp.c 	node->right->next = node->next;
node             1389 maint/gnulib/lib/regcomp.c link_nfa_nodes (void *extra, bin_tree_t *node)
node             1392 maint/gnulib/lib/regcomp.c   Idx idx = node->node_idx;
node             1395 maint/gnulib/lib/regcomp.c   switch (node->token.type)
node             1401 maint/gnulib/lib/regcomp.c       DEBUG_ASSERT (node->next == NULL);
node             1409 maint/gnulib/lib/regcomp.c 	if (node->left != NULL)
node             1410 maint/gnulib/lib/regcomp.c 	  left = node->left->first->node_idx;
node             1412 maint/gnulib/lib/regcomp.c 	  left = node->next->node_idx;
node             1413 maint/gnulib/lib/regcomp.c 	if (node->right != NULL)
node             1414 maint/gnulib/lib/regcomp.c 	  right = node->right->first->node_idx;
node             1416 maint/gnulib/lib/regcomp.c 	  right = node->next->node_idx;
node             1426 maint/gnulib/lib/regcomp.c       err = re_node_set_init_1 (dfa->edests + idx, node->next->node_idx);
node             1430 maint/gnulib/lib/regcomp.c       dfa->nexts[idx] = node->next->node_idx;
node             1431 maint/gnulib/lib/regcomp.c       if (node->token.type == OP_BACK_REF)
node             1436 maint/gnulib/lib/regcomp.c       DEBUG_ASSERT (!IS_EPSILON_NODE (node->token.type));
node             1437 maint/gnulib/lib/regcomp.c       dfa->nexts[idx] = node->next->node_idx;
node             1655 maint/gnulib/lib/regcomp.c calc_eclosure_iter (re_node_set *new_set, re_dfa_t *dfa, Idx node, bool root)
node             1661 maint/gnulib/lib/regcomp.c   err = re_node_set_alloc (&eclosure, dfa->edests[node].nelem + 1);
node             1666 maint/gnulib/lib/regcomp.c   eclosure.elems[eclosure.nelem++] = node;
node             1670 maint/gnulib/lib/regcomp.c   dfa->eclosures[node].nelem = -1;
node             1674 maint/gnulib/lib/regcomp.c   if (dfa->nodes[node].constraint
node             1675 maint/gnulib/lib/regcomp.c       && dfa->edests[node].nelem
node             1676 maint/gnulib/lib/regcomp.c       && !dfa->nodes[dfa->edests[node].elems[0]].duplicated)
node             1678 maint/gnulib/lib/regcomp.c       err = duplicate_node_closure (dfa, node, node, node,
node             1679 maint/gnulib/lib/regcomp.c 				    dfa->nodes[node].constraint);
node             1685 maint/gnulib/lib/regcomp.c   if (IS_EPSILON_NODE(dfa->nodes[node].type))
node             1686 maint/gnulib/lib/regcomp.c     for (i = 0; i < dfa->edests[node].nelem; ++i)
node             1689 maint/gnulib/lib/regcomp.c 	Idx edest = dfa->edests[node].elems[i];
node             1721 maint/gnulib/lib/regcomp.c     dfa->eclosures[node].nelem = 0;
node             1723 maint/gnulib/lib/regcomp.c     dfa->eclosures[node] = eclosure;
node             3704 maint/gnulib/lib/regcomp.c mark_opt_subexp (void *extra, bin_tree_t *node)
node             3707 maint/gnulib/lib/regcomp.c   if (node->token.type == SUBEXP && node->token.opr.idx == idx)
node             3708 maint/gnulib/lib/regcomp.c     node->token.opt_subexp = 1;
node             3716 maint/gnulib/lib/regcomp.c free_token (re_token_t *node)
node             3718 maint/gnulib/lib/regcomp.c   if (node->type == COMPLEX_BRACKET && node->duplicated == 0)
node             3719 maint/gnulib/lib/regcomp.c     free_charset (node->opr.mbcset);
node             3720 maint/gnulib/lib/regcomp.c   else if (node->type == SIMPLE_BRACKET && node->duplicated == 0)
node             3721 maint/gnulib/lib/regcomp.c     re_free (node->opr.sbcset);
node             3728 maint/gnulib/lib/regcomp.c free_tree (void *extra, bin_tree_t *node)
node             3730 maint/gnulib/lib/regcomp.c   free_token (&node->token);
node             3743 maint/gnulib/lib/regcomp.c   const bin_tree_t *node;
node             3747 maint/gnulib/lib/regcomp.c   for (node = root; ; )
node             3750 maint/gnulib/lib/regcomp.c       *p_new = create_token_tree (dfa, NULL, NULL, &node->token);
node             3758 maint/gnulib/lib/regcomp.c       if (node->left)
node             3760 maint/gnulib/lib/regcomp.c 	  node = node->left;
node             3766 maint/gnulib/lib/regcomp.c 	  while (node->right == prev || node->right == NULL)
node             3768 maint/gnulib/lib/regcomp.c 	      prev = node;
node             3769 maint/gnulib/lib/regcomp.c 	      node = node->parent;
node             3771 maint/gnulib/lib/regcomp.c 	      if (!node)
node             3774 maint/gnulib/lib/regcomp.c 	  node = node->right;
node             1614 maint/gnulib/lib/regex_internal.c       re_token_t *node = dfa->nodes + nodes->elems[i];
node             1615 maint/gnulib/lib/regex_internal.c       re_token_type_t type = node->type;
node             1616 maint/gnulib/lib/regex_internal.c       if (type == CHARACTER && !node->constraint)
node             1618 maint/gnulib/lib/regex_internal.c       newstate->accept_mb |= node->accept_mb;
node             1625 maint/gnulib/lib/regex_internal.c       else if (type == ANCHOR || node->constraint)
node             1664 maint/gnulib/lib/regex_internal.c       re_token_t *node = dfa->nodes + nodes->elems[i];
node             1665 maint/gnulib/lib/regex_internal.c       re_token_type_t type = node->type;
node             1666 maint/gnulib/lib/regex_internal.c       unsigned int constraint = node->constraint;
node             1670 maint/gnulib/lib/regex_internal.c       newstate->accept_mb |= node->accept_mb;
node              553 maint/gnulib/lib/regex_internal.h   Idx node;
node              565 maint/gnulib/lib/regex_internal.h   Idx node;
node              574 maint/gnulib/lib/regex_internal.h   Idx node;
node              617 maint/gnulib/lib/regex_internal.h   Idx node;
node               24 maint/gnulib/lib/regexec.c static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node,
node               27 maint/gnulib/lib/regexec.c static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node,
node               30 maint/gnulib/lib/regexec.c 						    Idx node, Idx str_idx);
node               94 maint/gnulib/lib/regexec.c 				      Idx node, Idx str_idx,
node              166 maint/gnulib/lib/regexec.c 			       const re_token_t *node, Idx idx);
node             1162 maint/gnulib/lib/regexec.c check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context)
node             1164 maint/gnulib/lib/regexec.c   re_token_type_t type = dfa->nodes[node].type;
node             1165 maint/gnulib/lib/regexec.c   unsigned int constraint = dfa->nodes[node].constraint;
node             1201 maint/gnulib/lib/regexec.c 		   Idx *pidx, Idx node, re_node_set *eps_via_nodes,
node             1205 maint/gnulib/lib/regexec.c   if (IS_EPSILON_NODE (dfa->nodes[node].type))
node             1208 maint/gnulib/lib/regexec.c       re_node_set *edests = &dfa->edests[node];
node             1210 maint/gnulib/lib/regexec.c       if (! re_node_set_contains (eps_via_nodes, node))
node             1212 maint/gnulib/lib/regexec.c           bool ok = re_node_set_insert (eps_via_nodes, node);
node             1249 maint/gnulib/lib/regexec.c       re_token_type_t type = dfa->nodes[node].type;
node             1251 maint/gnulib/lib/regexec.c       if (dfa->nodes[node].accept_mb)
node             1252 maint/gnulib/lib/regexec.c 	naccepted = check_node_accept_bytes (dfa, node, &mctx->input, *pidx);
node             1255 maint/gnulib/lib/regexec.c 	  Idx subexp_idx = dfa->nodes[node].opr.idx + 1;
node             1278 maint/gnulib/lib/regexec.c 	      bool ok = re_node_set_insert (eps_via_nodes, node);
node             1281 maint/gnulib/lib/regexec.c 	      dest_node = dfa->edests[node].elems[0];
node             1289 maint/gnulib/lib/regexec.c 	  || check_node_accept (mctx, dfa->nodes + node, *pidx))
node             1291 maint/gnulib/lib/regexec.c 	  Idx dest_node = dfa->nexts[node];
node             1323 maint/gnulib/lib/regexec.c   fs->stack[num].node = dest_node;
node             1347 maint/gnulib/lib/regexec.c   DEBUG_ASSERT (0 <= fs->stack[num].node);
node             1348 maint/gnulib/lib/regexec.c   return fs->stack[num].node;
node             1540 maint/gnulib/lib/regexec.c #define STATE_NODE_CONTAINS(state,node) \
node             1541 maint/gnulib/lib/regexec.c   ((state) != NULL && re_node_set_contains (&(state)->nodes, node))
node             1784 maint/gnulib/lib/regexec.c sub_epsilon_src_nodes (const re_dfa_t *dfa, Idx node, re_node_set *dest_nodes,
node             1789 maint/gnulib/lib/regexec.c     re_node_set *inv_eclosure = dfa->inveclosures + node;
node             1795 maint/gnulib/lib/regexec.c 	if (cur_node == node)
node             1845 maint/gnulib/lib/regexec.c       subexp_idx = dfa->nodes[ent->node].opr.idx;
node             1878 maint/gnulib/lib/regexec.c       Idx node = eclosures->elems[node_idx];
node             1879 maint/gnulib/lib/regexec.c       switch (dfa->nodes[node].type)
node             1890 maint/gnulib/lib/regexec.c 		  if (ent->node != node)
node             1904 maint/gnulib/lib/regexec.c 		  dst = dfa->edests[node].elems[0];
node             1930 maint/gnulib/lib/regexec.c 	  if ((boundaries & 1) && subexp_idx == dfa->nodes[node].opr.idx)
node             1935 maint/gnulib/lib/regexec.c 	  if ((boundaries & 2) && subexp_idx == dfa->nodes[node].opr.idx)
node             1993 maint/gnulib/lib/regexec.c       subexp_idx = dfa->nodes[ent->node].opr.idx;
node             2000 maint/gnulib/lib/regexec.c 	      Idx node = dest_nodes->elems[node_idx];
node             2001 maint/gnulib/lib/regexec.c 	      re_token_type_t type = dfa->nodes[node].type;
node             2003 maint/gnulib/lib/regexec.c 		  && subexp_idx == dfa->nodes[node].opr.idx)
node             2004 maint/gnulib/lib/regexec.c 		ops_node = node;
node             2006 maint/gnulib/lib/regexec.c 		       && subexp_idx == dfa->nodes[node].opr.idx)
node             2007 maint/gnulib/lib/regexec.c 		cls_node = node;
node             2024 maint/gnulib/lib/regexec.c 		Idx node = dest_nodes->elems[node_idx];
node             2025 maint/gnulib/lib/regexec.c 		if (!re_node_set_contains (dfa->inveclosures + node,
node             2027 maint/gnulib/lib/regexec.c 		    && !re_node_set_contains (dfa->eclosures + node,
node             2032 maint/gnulib/lib/regexec.c 		    err = sub_epsilon_src_nodes (dfa, node, dest_nodes,
node             2044 maint/gnulib/lib/regexec.c 	      Idx node = dest_nodes->elems[node_idx];
node             2045 maint/gnulib/lib/regexec.c 	      re_token_type_t type = dfa->nodes[node].type;
node             2048 maint/gnulib/lib/regexec.c 		  if (subexp_idx != dfa->nodes[node].opr.idx)
node             2052 maint/gnulib/lib/regexec.c 		  err = sub_epsilon_src_nodes (dfa, node, dest_nodes,
node             2070 maint/gnulib/lib/regexec.c   Idx node_idx, node;
node             2084 maint/gnulib/lib/regexec.c       node = candidates->elems[node_idx];
node             2085 maint/gnulib/lib/regexec.c       type = dfa->nodes[node].type;
node             2087 maint/gnulib/lib/regexec.c       if (node == sctx->last_node && str_idx == sctx->last_str_idx)
node             2102 maint/gnulib/lib/regexec.c 	  if (entry->node != node)
node             2106 maint/gnulib/lib/regexec.c 	  dst_node = (subexp_len ? dfa->nexts[node]
node             2107 maint/gnulib/lib/regexec.c 		      : dfa->edests[node].elems[0]);
node             2112 maint/gnulib/lib/regexec.c 	      || check_dst_limits (mctx, &sctx->limits, node,
node             2123 maint/gnulib/lib/regexec.c 	  local_sctx.last_node = node;
node             2369 maint/gnulib/lib/regexec.c       Idx node = cur_nodes->elems[node_idx];
node             2370 maint/gnulib/lib/regexec.c       if (dfa->nodes[node].type == OP_OPEN_SUBEXP
node             2371 maint/gnulib/lib/regexec.c 	  && dfa->nodes[node].opr.idx < BITSET_WORD_BITS
node             2373 maint/gnulib/lib/regexec.c 	      & ((bitset_word_t) 1 << dfa->nodes[node].opr.idx)))
node             2375 maint/gnulib/lib/regexec.c 	  err = match_ctx_add_subtop (mctx, node, str_idx);
node             2506 maint/gnulib/lib/regexec.c       const re_token_t *node = dfa->nodes + node_idx;
node             2510 maint/gnulib/lib/regexec.c       if (node->type != OP_BACK_REF)
node             2513 maint/gnulib/lib/regexec.c       if (node->constraint)
node             2517 maint/gnulib/lib/regexec.c 	  if (NOT_SATISFY_NEXT_CONSTRAINT (node->constraint, context))
node             2537 maint/gnulib/lib/regexec.c 	  if (bkref_ent->node != node_idx || bkref_ent->str_idx != cur_str_idx)
node             2618 maint/gnulib/lib/regexec.c 	if (entry->node == bkref_node)
node             2633 maint/gnulib/lib/regexec.c       if (dfa->nodes[sub_top->node].opr.idx != subexp_num)
node             2730 maint/gnulib/lib/regexec.c 	  err = check_arrival (mctx, sub_top->path, sub_top->node,
node             2765 maint/gnulib/lib/regexec.c   err = check_arrival (mctx, &sub_last->path, sub_last->node,
node             2794 maint/gnulib/lib/regexec.c       const re_token_t *node = dfa->nodes + cls_node;
node             2795 maint/gnulib/lib/regexec.c       if (node->type == type
node             2796 maint/gnulib/lib/regexec.c 	  && node->opr.idx == subexp_idx)
node             3164 maint/gnulib/lib/regexec.c       if (!re_node_set_contains (cur_nodes, ent->node))
node             3176 maint/gnulib/lib/regexec.c 	  next_node = dfa->edests[ent->node].elems[0];
node             3196 maint/gnulib/lib/regexec.c 	  next_node = dfa->nexts[ent->node];
node             3438 maint/gnulib/lib/regexec.c       re_token_t *node = &dfa->nodes[cur_nodes->elems[i]];
node             3439 maint/gnulib/lib/regexec.c       re_token_type_t type = node->type;
node             3440 maint/gnulib/lib/regexec.c       unsigned int constraint = node->constraint;
node             3444 maint/gnulib/lib/regexec.c 	bitset_set (accepts, node->opr.c);
node             3447 maint/gnulib/lib/regexec.c 	  bitset_merge (accepts, node->opr.sbcset);
node             3496 maint/gnulib/lib/regexec.c 	      if (type == CHARACTER && !node->word_char)
node             3513 maint/gnulib/lib/regexec.c 	      if (type == CHARACTER && node->word_char)
node             3539 maint/gnulib/lib/regexec.c 	  if (type == CHARACTER && !bitset_contain (dests_ch[j], node->opr.c))
node             3614 maint/gnulib/lib/regexec.c   const re_token_t *node = dfa->nodes + node_idx;
node             3618 maint/gnulib/lib/regexec.c   if (__glibc_unlikely (node->type == OP_UTF8_PERIOD))
node             3670 maint/gnulib/lib/regexec.c   if (node->type == OP_PERIOD)
node             3689 maint/gnulib/lib/regexec.c   if (node->type == COMPLEX_BRACKET)
node             3691 maint/gnulib/lib/regexec.c       const re_charset_t *cset = node->opr.mbcset;
node             3899 maint/gnulib/lib/regexec.c check_node_accept (const re_match_context_t *mctx, const re_token_t *node,
node             3904 maint/gnulib/lib/regexec.c   switch (node->type)
node             3907 maint/gnulib/lib/regexec.c       if (node->opr.c != ch)
node             3912 maint/gnulib/lib/regexec.c       if (!bitset_contain (node->opr.sbcset, ch))
node             3930 maint/gnulib/lib/regexec.c   if (node->constraint)
node             3936 maint/gnulib/lib/regexec.c       if (NOT_SATISFY_NEXT_CONSTRAINT (node->constraint, context))
node             4087 maint/gnulib/lib/regexec.c match_ctx_add_entry (re_match_context_t *mctx, Idx node, Idx str_idx, Idx from,
node             4109 maint/gnulib/lib/regexec.c   mctx->bkref_ents[mctx->nbkref_ents].node = node;
node             4158 maint/gnulib/lib/regexec.c match_ctx_add_subtop (re_match_context_t *mctx, Idx node, Idx str_idx)
node             4176 maint/gnulib/lib/regexec.c   mctx->sub_tops[mctx->nsub_tops]->node = node;
node             4186 maint/gnulib/lib/regexec.c match_ctx_add_sublast (re_sub_match_top_t *subtop, Idx node, Idx str_idx)
node             4204 maint/gnulib/lib/regexec.c       new_entry->node = node;
node              137 maint/gnulib/lib/tsearch.c check_tree_recurse (node p, int d_sofar, int d_total)
node              154 maint/gnulib/lib/tsearch.c check_tree (node root)
node              157 maint/gnulib/lib/tsearch.c   node p;
node              182 maint/gnulib/lib/tsearch.c maybe_split_for_insert (node *rootp, node *parentp, node *gparentp,
node              185 maint/gnulib/lib/tsearch.c   node root = *rootp;
node              186 maint/gnulib/lib/tsearch.c   node *rp, *lp;
node              205 maint/gnulib/lib/tsearch.c           node gp = *gparentp;
node              206 maint/gnulib/lib/tsearch.c           node p = *parentp;
node              267 maint/gnulib/lib/tsearch.c   node q;
node              268 maint/gnulib/lib/tsearch.c   node *parentp = NULL, *gparentp = NULL;
node              269 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
node              270 maint/gnulib/lib/tsearch.c   node *nextp;
node              285 maint/gnulib/lib/tsearch.c       node root = *rootp;
node              334 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
node              343 maint/gnulib/lib/tsearch.c       node root = *rootp;
node              365 maint/gnulib/lib/tsearch.c   node p, q, r, retval;
node              367 maint/gnulib/lib/tsearch.c   node *rootp = (node *) vrootp;
node              368 maint/gnulib/lib/tsearch.c   node root, unchained;
node              374 maint/gnulib/lib/tsearch.c   node *nodestack[100];
node              416 maint/gnulib/lib/tsearch.c       node *parent = rootp, *up = &root->right;
node              459 maint/gnulib/lib/tsearch.c           node *pp = nodestack[sp - 1];
node              520 maint/gnulib/lib/tsearch.c                       node q2 = q->left;
node              575 maint/gnulib/lib/tsearch.c                       node q2 = q->right;
node              665 maint/gnulib/lib/tsearch.c tdestroy_recurse (node root, __free_fn_t freefct)
node              679 maint/gnulib/lib/tsearch.c   node root = (node) vroot;
node               48 maint/gnulib/tests/test-array_omap.c   gl_list_node_t node;
node               57 maint/gnulib/tests/test-array_omap.c       ASSERT (gl_list_iterator_next (&iterk, &key2, &node));
node               58 maint/gnulib/tests/test-array_omap.c       ASSERT (gl_list_iterator_next (&iterv, &value2, &node));
node               63 maint/gnulib/tests/test-array_omap.c   ASSERT (!gl_list_iterator_next (&iterk, &key2, &node));
node               64 maint/gnulib/tests/test-array_omap.c   ASSERT (!gl_list_iterator_next (&iterv, &value2, &node));
node              315 tools/attrd_updater.c                      pair->node);
node              558 tools/crm_attribute.c output_one_attribute(xmlNode *node, void *userdata)
node              562 tools/crm_attribute.c     const char *name = crm_element_value(node, XML_NVPAIR_ATTR_NAME);
node              563 tools/crm_attribute.c     const char *value = crm_element_value(node, XML_NVPAIR_ATTR_VALUE);
node              564 tools/crm_attribute.c     const char *host = crm_element_value(node, PCMK__XA_ATTR_NODE_NAME);
node              291 tools/crm_mon.c     GSList *node = lst;
node              293 tools/crm_mon.c     while (node != NULL) {
node              294 tools/crm_mon.c         char *s = node->data;
node              310 tools/crm_mon.c         node = node->next;
node             1655 tools/crm_mon.c send_custom_trap(const char *node, const char *rsc, const char *task, int target_rc, int rc,
node             1673 tools/crm_mon.c     setenv("CRM_notify_node", node, 1);
node             1711 tools/crm_mon.c     const char *node = NULL;
node             1744 tools/crm_mon.c     node = crm_element_value(rsc_op, XML_LRM_ATTR_TARGET);
node             1750 tools/crm_mon.c     if(node == NULL && n) {
node             1751 tools/crm_mon.c         node = crm_element_value(n, XML_ATTR_UNAME);
node             1754 tools/crm_mon.c     if (node == NULL && n) {
node             1755 tools/crm_mon.c         node = ID(n);
node             1758 tools/crm_mon.c     if (node == NULL) {
node             1759 tools/crm_mon.c         node = node_id;
node             1762 tools/crm_mon.c     if (node == NULL) {
node             1770 tools/crm_mon.c         crm_notice("%s of %s on %s completed: %s", task, rsc, node, desc);
node             1777 tools/crm_mon.c         crm_warn("%s of %s on %s failed: %s", task, rsc, node, desc);
node             1781 tools/crm_mon.c         crm_warn("%s of %s on %s failed: %s", task, rsc, node, desc);
node             1785 tools/crm_mon.c         send_custom_trap(node, rsc, task, target_rc, rc, status, desc);
node             1808 tools/crm_mon.c     const char *node = crm_element_value(xml, XML_ATTR_UNAME);
node             1810 tools/crm_mon.c     if (node == NULL) {
node             1811 tools/crm_mon.c         node = ID(xml);
node             1814 tools/crm_mon.c     handle_rsc_op(xml, (void *) node);
node             1830 tools/crm_mon.c         const char *node = NULL;
node             1871 tools/crm_mon.c             node = crm_element_value(match, XML_ATTR_UNAME);
node             1872 tools/crm_mon.c             if (node == NULL) {
node             1873 tools/crm_mon.c                 node = ID(match);
node             1875 tools/crm_mon.c             handle_rsc_op(match, (void *) node);
node             1878 tools/crm_mon.c             node = ID(match);
node             1879 tools/crm_mon.c             handle_rsc_op(match, (void *) node);
node              257 tools/crm_mon_curses.c     curses_list_data_t *node = NULL;
node              262 tools/crm_mon_curses.c     node = g_queue_pop_tail(priv->parent_q);
node              264 tools/crm_mon_curses.c     if (node->singular_noun != NULL && node->plural_noun != NULL) {
node              265 tools/crm_mon_curses.c         if (node->len == 1) {
node              266 tools/crm_mon_curses.c             curses_indented_printf(out, "%d %s found\n", node->len, node->singular_noun);
node              268 tools/crm_mon_curses.c             curses_indented_printf(out, "%d %s found\n", node->len, node->plural_noun);
node              272 tools/crm_mon_curses.c     free(node);
node              233 tools/crm_node.c                 pcmk_controld_api_node_t *node = node_iter->data;
node              234 tools/crm_node.c                 const char *uname = (node->uname? node->uname : "");
node              235 tools/crm_node.c                 const char *state = (node->state? node->state : "");
node              239 tools/crm_node.c                            (unsigned long) node->id, uname, state);
node              334 tools/crm_node.c     xmlNode *node = NULL;
node              343 tools/crm_node.c     node = create_xml_node(NULL, XML_CIB_TAG_NODE);
node              346 tools/crm_node.c     crm_xml_add(node, XML_ATTR_UNAME, name);
node              349 tools/crm_node.c         crm_xml_set_id(node, "%ld", id);
node              350 tools/crm_node.c         crm_xml_add(node_state, XML_ATTR_ID, ID(node));
node              356 tools/crm_node.c     rc = cib->cmds->remove(cib, XML_CIB_TAG_NODES, node, cib_sync_call);
node             1013 tools/crm_resource.c cleanup(pcmk__output_t *out, pe_resource_t *rsc, pe_node_t *node)
node             1028 tools/crm_resource.c         cli_resource_check(out, rsc, node);
node             1283 tools/crm_resource.c         pe_node_t *node = pe_find_node(data_set->nodes, options.host_uname);
node             1285 tools/crm_resource.c         if (pe__is_guest_or_remote_node(node)) {
node             1286 tools/crm_resource.c             node = pe__current_node(node->details->remote_rsc);
node             1287 tools/crm_resource.c             if (node == NULL) {
node             1294 tools/crm_resource.c             router_node = node->details->uname;
node             1320 tools/crm_resource.c refresh_resource(pcmk__output_t *out, pe_resource_t *rsc, pe_node_t *node)
node             1335 tools/crm_resource.c         cli_resource_check(out, rsc, node);
node             1544 tools/crm_resource.c     pe_node_t *node = NULL;
node             1789 tools/crm_resource.c         node = pe_find_node(data_set->nodes, options.host_uname);
node             1791 tools/crm_resource.c         if (node == NULL) {
node             1867 tools/crm_resource.c             rc = cli_resource_restart(out, rsc, node, options.move_lifetime,
node             1893 tools/crm_resource.c             node = pe_find_node(data_set->nodes, options.host_uname);
node             1894 tools/crm_resource.c             if (node == NULL) {
node             1897 tools/crm_resource.c                 rc = pcmk__resource_digests(out, rsc, node,
node             1949 tools/crm_resource.c             if ((options.host_uname != NULL) && (node == NULL)) {
node             1953 tools/crm_resource.c                                   data_set->resources, rsc, node);
node             1982 tools/crm_resource.c             } else if (node == NULL) {
node             1985 tools/crm_resource.c                 rc = cli_resource_ban(out, options.rsc_id, node->details->uname,
node             2086 tools/crm_resource.c                 cleanup(out, rsc, node);
node             2094 tools/crm_resource.c                 refresh_resource(out, rsc, node);
node               61 tools/crm_resource.h                                    const char *rsc, const char *node, gboolean promoted_role_only);
node               73 tools/crm_resource.h                        pe_node_t *node);
node               85 tools/crm_resource.h int cli_resource_restart(pcmk__output_t *out, pe_resource_t *rsc, pe_node_t *node,
node              344 tools/crm_resource_ban.c                          const char *rsc, const char *node,
node              362 tools/crm_resource_ban.c     if ((node != NULL) || (rsc != NULL) || promoted_role_only) {
node              365 tools/crm_resource_ban.c         if (node != NULL) {
node              366 tools/crm_resource_ban.c             pcmk__g_strcat(buf, "@" XML_CIB_TAG_NODE "='", node, "'", NULL);
node              398 tools/crm_resource_ban.c     if (node != NULL) {
node              407 tools/crm_resource_ban.c                        "and @" XML_EXPR_ATTR_VALUE "='", node, "']]", NULL);
node              427 tools/crm_resource_ban.c                                const char *rsc, const char *node, gboolean promoted_role_only)
node              448 tools/crm_resource_ban.c         build_clear_xpath_string(buf, constraint_node, rsc, node,
node               69 tools/crm_resource_print.c     pe_node_t *node = pe__current_node(rsc);
node               77 tools/crm_resource_print.c     if (node != NULL) {
node               78 tools/crm_resource_print.c         host = node->details->uname;
node              278 tools/crm_resource_print.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "override",
node              284 tools/crm_resource_print.c         crm_xml_add(node, "rsc", rsc_name);
node              400 tools/crm_resource_print.c     xmlNodePtr node = pcmk__output_xml_create_parent(out, "resource-agent-action",
node              407 tools/crm_resource_print.c         crm_xml_add(node, "rsc", rsc_name);
node              411 tools/crm_resource_print.c         crm_xml_add(node, "provider", provider);
node              503 tools/crm_resource_print.c     xmlNodePtr node = pcmk__output_create_xml_node(out, "check",
node              508 tools/crm_resource_print.c         pcmk__xe_set_bool_attr(node, "remain_stopped", true);
node              512 tools/crm_resource_print.c         pcmk__xe_set_bool_attr(node, "promotable", false);
node              516 tools/crm_resource_print.c         pcmk__xe_set_bool_attr(node, "unmanaged", true);
node              520 tools/crm_resource_print.c         crm_xml_add(node, "locked-to", checks->lock_node);
node              524 tools/crm_resource_print.c         pcmk__xe_set_bool_attr(node, "unhealthy", true);
node              608 tools/crm_resource_print.c     pe_node_t *node = va_arg(args, pe_node_t *);
node              610 tools/crm_resource_print.c     const char *host_uname = (node == NULL)? NULL : node->details->uname;
node              642 tools/crm_resource_print.c         cli_resource_check(out, rsc, node);
node              645 tools/crm_resource_print.c         const char* host_uname =  node->details->uname;
node              646 tools/crm_resource_print.c         GList *allResources = node->details->allocated_rsc;
node              647 tools/crm_resource_print.c         GList *activeResources = node->details->running_rsc;
node              655 tools/crm_resource_print.c             cli_resource_check(out, rsc, node);
node              662 tools/crm_resource_print.c             cli_resource_check(out, rsc, node);
node              690 tools/crm_resource_print.c     pe_node_t *node = va_arg(args, pe_node_t *);
node              692 tools/crm_resource_print.c     const char *host_uname = (node == NULL)? NULL : node->details->uname;
node              725 tools/crm_resource_print.c         cli_resource_check(out, rsc, node);
node              728 tools/crm_resource_print.c         const char* host_uname =  node->details->uname;
node              729 tools/crm_resource_print.c         GList *allResources = node->details->allocated_rsc;
node              730 tools/crm_resource_print.c         GList *activeResources = node->details->running_rsc;
node              745 tools/crm_resource_print.c             cli_resource_check(out, rsc, node);
node              758 tools/crm_resource_print.c             cli_resource_check(out, rsc, node);
node               27 tools/crm_resource_runtime.c             pe_node_t *node = (pe_node_t *) iter2->data;
node               29 tools/crm_resource_runtime.c             ni->node_name = node->details->uname;
node               61 tools/crm_resource_runtime.c             pe_node_t *node = (pe_node_t *) iter->data;
node               63 tools/crm_resource_runtime.c             ni->node_name = node->details->uname;
node              507 tools/crm_resource_runtime.c         pe_node_t *node = pe_find_node(data_set->nodes, host_uname);
node              509 tools/crm_resource_runtime.c         if (node == NULL) {
node              514 tools/crm_resource_runtime.c         if (!(node->details->online)) {
node              522 tools/crm_resource_runtime.c         if (!cib_only && pe__is_guest_or_remote_node(node)) {
node              523 tools/crm_resource_runtime.c             node = pe__current_node(node->details->remote_rsc);
node              524 tools/crm_resource_runtime.c             if (node == NULL) {
node              529 tools/crm_resource_runtime.c             router_node = node->details->uname;
node              677 tools/crm_resource_runtime.c                      const char *interval_spec, pe_node_t *node)
node              683 tools/crm_resource_runtime.c     if (pe__is_guest_or_remote_node(node)) {
node              687 tools/crm_resource_runtime.c     rc = pcmk__attrd_api_clear_failures(NULL, node->details->uname, rsc_name,
node              703 tools/crm_resource_runtime.c     pe_node_t *node = NULL;
node              731 tools/crm_resource_runtime.c             pe_node_t *node = NULL;
node              734 tools/crm_resource_runtime.c             while (g_hash_table_iter_next(&iter, NULL, (void**)&node)) {
node              735 tools/crm_resource_runtime.c                 if(node->weight >= 0) {
node              736 tools/crm_resource_runtime.c                     nodes = g_list_prepend(nodes, node);
node              745 tools/crm_resource_runtime.c             node = (pe_node_t *) lpc->data;
node              747 tools/crm_resource_runtime.c             if (node->details->online) {
node              748 tools/crm_resource_runtime.c                 rc = cli_resource_delete(controld_api, node->details->uname, rsc,
node              762 tools/crm_resource_runtime.c     node = pe_find_node(data_set->nodes, host_uname);
node              764 tools/crm_resource_runtime.c     if (node == NULL) {
node              770 tools/crm_resource_runtime.c     if (!node->details->rsc_discovery_enabled) {
node              782 tools/crm_resource_runtime.c     rc = clear_rsc_fail_attrs(rsc, operation, interval_spec, node);
node              822 tools/crm_resource_runtime.c         pe_node_t *node = pe_find_node(data_set->nodes, node_name);
node              824 tools/crm_resource_runtime.c         if (node == NULL) {
node              828 tools/crm_resource_runtime.c         if (pe__is_guest_or_remote_node(node)) {
node              851 tools/crm_resource_runtime.c             pe_node_t *node = (pe_node_t *) iter->data;
node              853 tools/crm_resource_runtime.c             rc = clear_rsc_failures(out, controld_api, node->details->uname, NULL,
node              914 tools/crm_resource_runtime.c node_is_unhealthy(pe_node_t *node)
node              916 tools/crm_resource_runtime.c     switch (pe__health_strategy(node->details->data_set)) {
node              921 tools/crm_resource_runtime.c             if (pe__node_health(node) < 0) {
node              927 tools/crm_resource_runtime.c             if (pe__node_health(node) <= 0) {
node              944 tools/crm_resource_runtime.c check_node_health(resource_checks_t *checks, pe_node_t *node)
node              946 tools/crm_resource_runtime.c     if (node == NULL) {
node              952 tools/crm_resource_runtime.c         while (g_hash_table_iter_next(&iter, NULL, (void **) &node)) {
node              954 tools/crm_resource_runtime.c             if (!node_is_unhealthy(node)) {
node              963 tools/crm_resource_runtime.c     } else if (node_is_unhealthy(node)) {
node              969 tools/crm_resource_runtime.c cli_resource_check(pcmk__output_t *out, pe_resource_t *rsc, pe_node_t *node)
node              976 tools/crm_resource_runtime.c     check_node_health(&checks, node);
node              991 tools/crm_resource_runtime.c generate_resource_params(pe_resource_t *rsc, pe_node_t *node,
node             1003 tools/crm_resource_runtime.c     params = pe_rsc_params(rsc, node, data_set);
node             1012 tools/crm_resource_runtime.c     get_meta_attributes(meta, rsc, node, data_set);
node             1038 tools/crm_resource_runtime.c         pe_node_t *node = (pe_node_t *) hIter->data;
node             1040 tools/crm_resource_runtime.c         if (pcmk__strcase_any_of(host, node->details->uname, node->details->id, NULL)) {
node             1325 tools/crm_resource_runtime.c cli_resource_restart(pcmk__output_t *out, pe_resource_t *rsc, pe_node_t *node,
node             1351 tools/crm_resource_runtime.c     const char *host = node ? node->details->uname : NULL;
node             1369 tools/crm_resource_runtime.c         rsc = parent->fns->find_rsc(parent, lookup_id, node, pe_find_any|pe_find_current);
node             1686 tools/crm_resource_runtime.c         if (a->node) {
node             1688 tools/crm_resource_runtime.c                       a->id, a->uuid, pe__node_name(a->node));