parent 136 daemons/attrd/attrd_attributes.c attrd_add_value_xml(xmlNode *parent, const attribute_t *a, parent 139 daemons/attrd/attrd_attributes.c xmlNode *xml = pcmk__xe_create(parent, __func__); parent 203 daemons/attrd/pacemaker-attrd.h xmlNode *attrd_add_value_xml(xmlNode *parent, const attribute_t *a, parent 657 daemons/controld/controld_cib.c controld_add_resource_history_xml_as(const char *func, xmlNode *parent, parent 677 daemons/controld/controld_cib.c xml_op = pcmk__create_history_xml(parent, op, caller_version, target_rc, parent 79 daemons/controld/controld_cib.h void controld_add_resource_history_xml_as(const char *func, xmlNode *parent, parent 84 daemons/controld/controld_cib.h #define controld_add_resource_history_xml(parent, rsc, op, node_name) \ parent 85 daemons/controld/controld_cib.h controld_add_resource_history_xml_as(__func__, (parent), (rsc), \ parent 123 daemons/controld/controld_membership.c create_node_state_update(crm_node_t *node, int flags, xmlNode *parent, parent 134 daemons/controld/controld_membership.c node_state = pcmk__xe_create(parent, PCMK__XE_NODE_STATE); parent 384 daemons/controld/controld_te_utils.c for(search = reason; search; search = search->parent) { parent 393 daemons/controld/controld_te_utils.c for(search = reason; search; search = search->parent) { parent 832 daemons/controld/controld_utils.c node = node->parent; parent 41 daemons/controld/controld_utils.h xmlNode *parent, const char *source); parent 379 daemons/fenced/fenced_remote.c fencing_result2xml(xmlNode *parent, const remote_fencing_op_t *op) parent 381 daemons/fenced/fenced_remote.c xmlNode *notify_data = pcmk__xe_create(parent, PCMK__XE_ST_NOTIFY_FENCE); parent 164 daemons/fenced/fenced_scheduler.c if (pcmk__is_group(rsc->parent)) { parent 165 daemons/fenced/fenced_scheduler.c pcmk_node_t *group_node = local_node_allowed_for(rsc->parent); parent 408 include/crm/common/actions.h xmlNode *crm_create_op_xml(xmlNode *parent, const char *prefix, parent 64 include/crm/common/bundles_internal.h while (rsc->parent != NULL) { parent 65 include/crm/common/bundles_internal.h rsc = rsc->parent; parent 40 include/crm/common/nvpair.h xmlNode *crm_create_nvpair_xml(xmlNode *parent, const char *id, parent 46 include/crm/common/nvpair.h GHashTable *xml2list(const xmlNode *parent); parent 815 include/crm/common/output_internal.h pcmk__output_xml_push_parent(pcmk__output_t *out, xmlNodePtr parent); parent 868 include/crm/common/output_internal.h xmlNode *pcmk__html_create(xmlNode *parent, const char *name, const char *id, parent 409 include/crm/common/resources.h pcmk_resource_t *parent; // Resource's parent resource, if any parent 22 include/crm/common/schemas_internal.h void pcmk__build_schema_xml_node(xmlNode *parent, const char *name, parent 71 include/crm/common/xml.h xmlNode *sorted_xml(xmlNode * input, xmlNode * parent, gboolean recursive); parent 39 include/crm/common/xml_compat.h int add_node_nocopy(xmlNode * parent, const char *name, xmlNode * child); parent 42 include/crm/common/xml_compat.h xmlNode *find_entity(xmlNode *parent, const char *node_name, const char *id); parent 94 include/crm/common/xml_compat.h xmlNode *subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right, parent 102 include/crm/common/xml_compat.h xmlNode *create_xml_node(xmlNode *parent, const char *name); parent 105 include/crm/common/xml_compat.h xmlNode *pcmk_create_xml_text_node(xmlNode *parent, const char *name, parent 109 include/crm/common/xml_compat.h xmlNode *pcmk_create_html_node(xmlNode *parent, const char *element_name, parent 114 include/crm/common/xml_compat.h xmlNode *first_named_child(const xmlNode *parent, const char *name); parent 127 include/crm/common/xml_compat.h gboolean replace_xml_child(xmlNode *parent, xmlNode *child, xmlNode *update, parent 217 include/crm/common/xml_internal.h xmlNode *pcmk__xe_first_child(const xmlNode *parent, const char *node_name, parent 376 include/crm/common/xml_internal.h pcmk__xml_first_child(const xmlNode *parent) parent 378 include/crm/common/xml_internal.h xmlNode *child = (parent? parent->children : NULL); parent 424 include/crm/common/xml_internal.h xmlNode *pcmk__xe_create(xmlNode *parent, const char *name); parent 427 include/crm/common/xml_internal.h xmlNode *pcmk__xml_copy(xmlNode *parent, xmlNode *src); parent 28 include/crm/pengine/remote_internal.h xmlNode *pe_create_remote_xml(xmlNode *parent, const char *uname, parent 62 include/crm/pengine/status_compat.h while (rsc->parent != NULL) { parent 63 include/crm/pengine/status_compat.h rsc = rsc->parent; parent 40 include/pcmki/pcmki_scheduler.h xmlNode *pcmk__create_history_xml(xmlNode *parent, lrmd_event_data_t *event, parent 531 lib/cib/cib_ops.c add_cib_object(xmlNode * parent, xmlNode * new_obj) parent 536 lib/cib/cib_ops.c if ((parent == NULL) || (new_obj == NULL)) { parent 546 lib/cib/cib_ops.c if (pcmk__xe_first_child(parent, object_name, parent 570 lib/cib/cib_ops.c pcmk__xml_copy(parent, new_obj); parent 859 lib/cib/cib_ops.c xmlNode *parent = match; parent 861 lib/cib/cib_ops.c while (parent && parent->type == XML_ELEMENT_NODE) { parent 862 lib/cib/cib_ops.c const char *id = crm_element_value(parent, PCMK_XA_ID); parent 868 lib/cib/cib_ops.c parent->name, id, parent 871 lib/cib/cib_ops.c new_path = crm_strdup_printf("/%s%s", parent->name, parent 876 lib/cib/cib_ops.c parent = parent->parent; parent 883 lib/cib/cib_ops.c parent = pcmk__xe_create(*answer, PCMK__XE_XPATH_QUERY_PATH); parent 884 lib/cib/cib_ops.c crm_xml_add(parent, PCMK_XA_ID, path); parent 896 lib/cib/cib_ops.c xmlNode *parent = match->parent; parent 899 lib/cib/cib_ops.c pcmk__xml_copy(parent, input); parent 664 lib/common/acl.c xmlNode *parent = xml; parent 699 lib/common/acl.c while (parent && parent->_private) { parent 700 lib/common/acl.c xml_node_private_t *nodepriv = parent->_private; parent 716 lib/common/acl.c (parent != xml)? "Parent ": "", parent 722 lib/common/acl.c parent = parent->parent; parent 520 lib/common/actions.c crm_create_op_xml(xmlNode *parent, const char *prefix, const char *task, parent 527 lib/common/actions.c xml_op = pcmk__xe_create(parent, PCMK_XE_OP); parent 27 lib/common/cib.c const char *parent; // CIB element that this element is a child of parent 156 lib/common/cib.c return cib_sections[lpc].parent; parent 99 lib/common/crmcommon_private.h void pcmk__xml_update(xmlNode *parent, xmlNode *target, xmlNode *update, parent 107 lib/common/crmcommon_private.h void pcmk__xc_update(xmlNode *parent, xmlNode *target, xmlNode *update); parent 187 lib/common/nvpair.c xmlNode *parent = user_data; parent 189 lib/common/nvpair.c crm_xml_add(parent, pair->name, pair->value); parent 883 lib/common/nvpair.c crm_create_nvpair_xml(xmlNode *parent, const char *id, const char *name, parent 893 lib/common/nvpair.c nvp = pcmk__xe_create(parent, PCMK_XE_NVPAIR); parent 899 lib/common/nvpair.c pcmk__s(pcmk__xe_id(parent), PCMK_XE_NVPAIR), name); parent 943 lib/common/nvpair.c xml2list(const xmlNode *parent) parent 950 lib/common/nvpair.c CRM_CHECK(parent != NULL, return nvpair_hash); parent 952 lib/common/nvpair.c nvpair_list = pcmk__xe_first_child(parent, PCMK__XE_ATTRIBUTES, NULL, NULL); parent 954 lib/common/nvpair.c crm_trace("No attributes in %s", parent->name); parent 955 lib/common/nvpair.c crm_log_xml_trace(parent, "No attributes for resource op"); parent 483 lib/common/output_html.c pcmk__html_create(xmlNode *parent, const char *name, const char *id, parent 486 lib/common/output_html.c xmlNode *node = pcmk__xe_create(parent, name); parent 318 lib/common/output_xml.c xmlNodePtr parent = NULL; parent 323 lib/common/output_xml.c parent = pcmk__output_create_xml_node(out, name, NULL); parent 324 lib/common/output_xml.c if (parent == NULL) { parent 327 lib/common/output_xml.c cdata_node = xmlNewCDataBlock(parent->doc, (pcmkXmlStr) buf, strlen(buf)); parent 328 lib/common/output_xml.c xmlAddChild(parent, cdata_node); parent 498 lib/common/output_xml.c xmlNodePtr parent = NULL; parent 506 lib/common/output_xml.c parent = g_queue_peek_tail(priv->parent_q); parent 509 lib/common/output_xml.c CRM_CHECK(parent != NULL, return); parent 511 lib/common/output_xml.c pcmk__xml_copy(parent, node); parent 548 lib/common/output_xml.c pcmk__output_xml_push_parent(pcmk__output_t *out, xmlNodePtr parent) { parent 551 lib/common/output_xml.c pcmk__assert((out != NULL) && (out->priv != NULL) && (parent != NULL)); parent 558 lib/common/output_xml.c g_queue_push_tail(priv->parent_q, parent); parent 50 lib/common/patchset.c GString *xpath = pcmk__element_xpath(xml->parent); parent 108 lib/common/patchset.c change = pcmk__xe_create(change->parent, PCMK_XE_CHANGE_RESULT); parent 418 lib/common/patchset.c subtract_v1_xml_comment(xmlNode *parent, xmlNode *left, xmlNode *right, parent 429 lib/common/patchset.c deleted = pcmk__xml_copy(parent, left); parent 440 lib/common/patchset.c subtract_v1_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right, parent 463 lib/common/patchset.c return subtract_v1_xml_comment(parent, left, right, changed); parent 473 lib/common/patchset.c deleted = pcmk__xml_copy(parent, left); parent 492 lib/common/patchset.c diff = pcmk__xe_create(parent, name); parent 644 lib/common/patchset.c subtract_v1_xml_comment(target->parent, target, patch, &dummy); parent 683 lib/common/patchset.c process_v1_additions(xmlNode *parent, xmlNode *target, xmlNode *patch) parent 695 lib/common/patchset.c } else if ((parent == NULL) && (target == NULL)) { parent 706 lib/common/patchset.c pcmk__xml_copy(parent, patch); parent 716 lib/common/patchset.c pcmk__xc_update(parent, target, patch); parent 985 lib/common/patchset.c first_matching_xml_child(const xmlNode *parent, const char *name, parent 990 lib/common/patchset.c for (cIter = pcmk__xml_first_child(parent); cIter != NULL; parent 1190 lib/common/patchset.c if ((match->parent != NULL) && (match->parent->last != NULL)) { parent 1191 lib/common/patchset.c xmlAddNextSibling(match->parent->last, match); parent 1276 lib/common/patchset.c pcmk__assert(match->parent != NULL); parent 1277 lib/common/patchset.c match_child = match->parent->children; parent 1288 lib/common/patchset.c (match_child? match_child : match->parent->last)); parent 1294 lib/common/patchset.c pcmk__assert(match->parent->last != NULL); parent 1295 lib/common/patchset.c xmlAddNextSibling(match->parent->last, match); parent 1571 lib/common/patchset.c subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right, parent 1574 lib/common/patchset.c return subtract_v1_xml_object(parent, left, right, full, changed, marker); parent 85 lib/common/rules.c if ((xml != NULL) && (xml->parent != NULL)) { parent 86 lib/common/rules.c parent_id = pcmk__xe_id(xml->parent); parent 1488 lib/common/schemas.c add_schema_file_to_xml(xmlNode *parent, const char *file, GList **already_included) parent 1520 lib/common/schemas.c file_node = pcmk__xe_create(parent, PCMK_XA_FILE); parent 1524 lib/common/schemas.c xmlAddChild(file_node, xmlNewCDataBlock(parent->doc, (pcmkXmlStr) contents, parent 1536 lib/common/schemas.c add_schema_file_to_xml(parent, iter->data, already_included); parent 1558 lib/common/schemas.c pcmk__build_schema_xml_node(xmlNode *parent, const char *name, GList **already_included) parent 1560 lib/common/schemas.c xmlNode *schema_node = pcmk__xe_create(parent, PCMK__XA_SCHEMA); parent 54 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c xmlNode *parent = pcmk__xe_create(NULL, PCMK__XA_SCHEMAS); parent 56 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c pcmk__build_schema_xml_node(parent, "pacemaker-9.0", &already_included); parent 57 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c assert_null(parent->children); parent 59 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c free_xml(parent); parent 66 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c xmlNode *parent = pcmk__xe_create(NULL, PCMK__XA_SCHEMAS); parent 71 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c pcmk__build_schema_xml_node(parent, "pacemaker-3.0", &already_included); parent 74 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c assert_non_null(parent->children); parent 86 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c schema_node = pcmk__xe_first_child(parent, NULL, NULL, NULL); parent 101 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c free_xml(parent); parent 108 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c xmlNode *parent = pcmk__xe_create(NULL, PCMK__XA_SCHEMAS); parent 113 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c pcmk__build_schema_xml_node(parent, "pacemaker-2.0", &already_included); parent 114 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c pcmk__build_schema_xml_node(parent, "pacemaker-2.1", &already_included); parent 117 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c assert_non_null(parent->children); parent 122 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c schema_node = pcmk__xe_first_child(parent, NULL, NULL, NULL); parent 153 lib/common/tests/schemas/pcmk__build_schema_xml_node_test.c free_xml(parent); parent 84 lib/common/xml.c for (; xml != NULL; xml = xml->parent) { parent 481 lib/common/xml.c pcmk__xe_first_child(const xmlNode *parent, const char *node_name, parent 489 lib/common/xml.c if (parent != NULL) { parent 490 lib/common/xml.c child = parent->children; parent 495 lib/common/xml.c parent_name = (const char *) parent->name; parent 770 lib/common/xml.c pcmk__xe_create(xmlNode *parent, const char *name) parent 776 lib/common/xml.c if (parent == NULL) { parent 785 lib/common/xml.c node = xmlNewChild(parent, NULL, (pcmkXmlStr) name, NULL); parent 974 lib/common/xml.c pcmk__xml_copy(xmlNode *parent, xmlNode *src) parent 982 lib/common/xml.c if (parent == NULL) { parent 995 lib/common/xml.c copy = xmlDocCopyNode(src, parent->doc, 1); parent 998 lib/common/xml.c xmlAddChild(parent, copy); parent 1692 lib/common/xml.c pcmk__xml_update(xmlNode *parent, xmlNode *target, xmlNode *update, parent 1710 lib/common/xml.c pcmk__xc_update(parent, target, update); parent 1717 lib/common/xml.c CRM_CHECK((target != NULL) || (parent != NULL), goto done); parent 1745 lib/common/xml.c target = pcmk__xe_first_child(parent, update_name, update_id_attr, parent 1751 lib/common/xml.c target = pcmk__xe_create(parent, update_name); parent 2094 lib/common/xml.c sorted_xml(xmlNode *input, xmlNode *parent, gboolean recursive) parent 2102 lib/common/xml.c result = pcmk__xe_create(parent, (const char *) input->name); parent 2335 lib/common/xml.c find_entity(xmlNode *parent, const char *node_name, const char *id) parent 2337 lib/common/xml.c return pcmk__xe_first_child(parent, node_name, parent 2363 lib/common/xml.c add_node_copy(xmlNode *parent, xmlNode *src_node) parent 2367 lib/common/xml.c CRM_CHECK((parent != NULL) && (src_node != NULL), return NULL); parent 2369 lib/common/xml.c child = xmlDocCopyNode(src_node, parent->doc, 1); parent 2373 lib/common/xml.c xmlAddChild(parent, child); parent 2379 lib/common/xml.c add_node_nocopy(xmlNode *parent, const char *name, xmlNode *child) parent 2381 lib/common/xml.c add_node_copy(parent, child); parent 2493 lib/common/xml.c create_xml_node(xmlNode *parent, const char *name) parent 2500 lib/common/xml.c if (parent == NULL) { parent 2511 lib/common/xml.c node = xmlNewChild(parent, NULL, (pcmkXmlStr) name, NULL); parent 2521 lib/common/xml.c pcmk_create_xml_text_node(xmlNode *parent, const char *name, parent 2524 lib/common/xml.c xmlNode *node = pcmk__xe_create(parent, name); parent 2531 lib/common/xml.c pcmk_create_html_node(xmlNode *parent, const char *element_name, const char *id, parent 2534 lib/common/xml.c xmlNode *node = pcmk__html_create(parent, element_name, id, class_name); parent 2541 lib/common/xml.c first_named_child(const xmlNode *parent, const char *name) parent 2543 lib/common/xml.c return pcmk__xe_first_child(parent, name, NULL, NULL); parent 2580 lib/common/xml.c replace_xml_child(xmlNode * parent, xmlNode * child, xmlNode * update, gboolean delete_only) parent 2595 lib/common/xml.c is_match = (parent != NULL) parent 2632 lib/common/xml.c parent = child; parent 2633 lib/common/xml.c for (child = pcmk__xml_first_child(parent); child != NULL; parent 2637 lib/common/xml.c if (replace_xml_child(parent, child, update, delete_only)) { parent 49 lib/common/xml_attr.c if ((attr == NULL) || (attr->parent == NULL)) { parent 53 lib/common/xml_attr.c element = attr->parent; parent 77 lib/common/xml_attr.c xmlNode *parent = a->parent; parent 82 lib/common/xml_attr.c pcmk__mark_xml_node_dirty(parent); parent 99 lib/common/xml_comment.c pcmk__xc_update(xmlNode *parent, xmlNode *target, xmlNode *update) parent 105 lib/common/xml_comment.c target = pcmk__xc_match(parent, update, false); parent 109 lib/common/xml_comment.c pcmk__xml_copy(parent, update); parent 88 lib/common/xpath.c && match->parent && match->parent->type == XML_ELEMENT_NODE) { parent 90 lib/common/xpath.c match = match->parent; parent 117 lib/common/xpath.c xml = xpathObj->nodesetval->nodeTab[lpc]->parent; parent 119 lib/common/xpath.c for (; xml; xml = xml->parent) { parent 258 lib/common/xpath.c const xmlNode *parent = NULL; parent 266 lib/common/xpath.c parent = xml->parent; parent 267 lib/common/xpath.c xpath = pcmk__element_xpath(parent); parent 273 lib/common/xpath.c if (parent == NULL) { parent 275 lib/common/xpath.c } else if (parent->parent == NULL) { parent 158 lib/pacemaker/pcmk_acl.c if (!pcmk__check_acl(i_node->parent, parent 177 lib/pacemaker/pcmk_acl.c if (!pcmk__check_acl(i_node->parent, parent 181 lib/pacemaker/pcmk_acl.c } else if (!pcmk__check_acl(i_node->parent, parent 538 lib/pacemaker/pcmk_graph_consumer.c unpack_action(pcmk__graph_synapse_t *parent, xmlNode *xml_action) parent 577 lib/pacemaker/pcmk_graph_consumer.c action->synapse = parent; parent 361 lib/pacemaker/pcmk_graph_producer.c pcmk_resource_t *parent = action->rsc; parent 363 lib/pacemaker/pcmk_graph_producer.c while (parent != NULL) { parent 364 lib/pacemaker/pcmk_graph_producer.c parent->cmds->add_graph_meta(parent, args_xml); parent 365 lib/pacemaker/pcmk_graph_producer.c parent = parent->parent; parent 396 lib/pacemaker/pcmk_graph_producer.c create_graph_action(xmlNode *parent, pcmk_action_t *action, bool skip_details, parent 412 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_PSEUDO_EVENT); parent 414 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_CRM_EVENT); parent 420 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_CRM_EVENT); parent 425 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_CRM_EVENT); parent 433 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_PSEUDO_EVENT); parent 437 lib/pacemaker/pcmk_graph_producer.c action_xml = pcmk__xe_create(parent, PCMK__XE_RSC_OP); parent 1012 lib/pacemaker/pcmk_output.c add_digest_xml(xmlNode *parent, const char *type, const char *digest, parent 1016 lib/pacemaker/pcmk_output.c xmlNodePtr digest_xml = pcmk__xe_create(parent, PCMK_XE_DIGEST); parent 938 lib/pacemaker/pcmk_sched_actions.c if ((then->rsc != NULL) && (then->rsc->parent != NULL)) { parent 1119 lib/pacemaker/pcmk_sched_actions.c pcmk__create_history_xml(xmlNode *parent, lrmd_event_data_t *op, parent 1202 lib/pacemaker/pcmk_sched_actions.c xml_op = pcmk__xe_first_child(parent, PCMK__XE_LRM_RSC_OP, PCMK_XA_ID, parent 1205 lib/pacemaker/pcmk_sched_actions.c xml_op = pcmk__xe_create(parent, PCMK__XE_LRM_RSC_OP); parent 81 lib/pacemaker/pcmk_sched_bundle.c pcmk__set_rsc_flags(replica->child->parent, pcmk_rsc_assigning); parent 86 lib/pacemaker/pcmk_sched_bundle.c pcmk__clear_rsc_flags(replica->child->parent, pcmk_rsc_assigning); parent 369 lib/pacemaker/pcmk_sched_clone.c if (rsc->parent != NULL) { parent 370 lib/pacemaker/pcmk_sched_clone.c rsc->parent->cmds->with_this_colocations(rsc->parent, orig_rsc, list); parent 383 lib/pacemaker/pcmk_sched_clone.c if (rsc->parent != NULL) { parent 384 lib/pacemaker/pcmk_sched_clone.c rsc->parent->cmds->this_with_colocations(rsc->parent, orig_rsc, list); parent 1143 lib/pacemaker/pcmk_sched_colocation.c if (rsc->parent != NULL) { parent 1144 lib/pacemaker/pcmk_sched_colocation.c rsc = rsc->parent; // Bundle parent 1265 lib/pacemaker/pcmk_sched_colocation.c && (dependent_role_rsc->parent != NULL) parent 1266 lib/pacemaker/pcmk_sched_colocation.c && pcmk_is_set(dependent_role_rsc->parent->flags, pcmk_rsc_promotable) parent 1551 lib/pacemaker/pcmk_sched_colocation.c && pcmk__is_group(rsc->parent) parent 1552 lib/pacemaker/pcmk_sched_colocation.c && (rsc != rsc->parent->children->data)) { parent 1571 lib/pacemaker/pcmk_sched_colocation.c if (location->rsc == rsc->parent) { parent 116 lib/pacemaker/pcmk_sched_constraints.c pcmk_resource_t *parent = iter->data; parent 117 lib/pacemaker/pcmk_sched_constraints.c pcmk_resource_t *match = parent->fns->find_rsc(parent, id, NULL, parent 35 lib/pacemaker/pcmk_sched_fencing.c && pcmk__is_anonymous_clone(rsc->parent) parent 36 lib/pacemaker/pcmk_sched_fencing.c && (g_hash_table_lookup(rsc->parent->known_on, parent 199 lib/pacemaker/pcmk_sched_group.c pcmk__order_resource_actions(member->parent, PCMK_ACTION_DEMOTE, parent 202 lib/pacemaker/pcmk_sched_group.c member->parent, PCMK_ACTION_DEMOTED, parent 207 lib/pacemaker/pcmk_sched_group.c member->parent, PCMK_ACTION_PROMOTED, parent 211 lib/pacemaker/pcmk_sched_group.c pcmk__order_resource_actions(member->parent, PCMK_ACTION_PROMOTE, parent 217 lib/pacemaker/pcmk_sched_group.c pcmk__order_stops(member->parent, member, down_flags); parent 219 lib/pacemaker/pcmk_sched_group.c member->parent, PCMK_ACTION_STOPPED, parent 223 lib/pacemaker/pcmk_sched_group.c pcmk__order_starts(member->parent, member, parent 226 lib/pacemaker/pcmk_sched_group.c member->parent, PCMK_ACTION_RUNNING, parent 232 lib/pacemaker/pcmk_sched_group.c pcmk__order_starts(member->parent, member, parent 237 lib/pacemaker/pcmk_sched_group.c pcmk__order_resource_actions(member->parent, PCMK_ACTION_PROMOTE, parent 245 lib/pacemaker/pcmk_sched_group.c pcmk__order_starts(member->parent, member, pcmk__ar_none); parent 247 lib/pacemaker/pcmk_sched_group.c pcmk__order_resource_actions(member->parent, PCMK_ACTION_PROMOTE, parent 718 lib/pacemaker/pcmk_sched_group.c || pcmk__is_clone(rsc->parent)) { parent 771 lib/pacemaker/pcmk_sched_group.c if (rsc->parent != NULL) { parent 772 lib/pacemaker/pcmk_sched_group.c rsc->parent->cmds->with_this_colocations(rsc->parent, orig_rsc, parent 817 lib/pacemaker/pcmk_sched_group.c if (rsc->parent != NULL) { parent 818 lib/pacemaker/pcmk_sched_group.c rsc->parent->cmds->this_with_colocations(rsc->parent, orig_rsc, parent 968 lib/pacemaker/pcmk_sched_group.c || pcmk__is_clone(rsc->parent)) { parent 203 lib/pacemaker/pcmk_sched_instances.c pcmk__assert((instance1 != NULL) && (instance1->parent != NULL) parent 204 lib/pacemaker/pcmk_sched_instances.c && (instance2 != NULL) && (instance2->parent != NULL) parent 599 lib/pacemaker/pcmk_sched_instances.c pcmk_resource_t *parent = instance->parent; parent 601 lib/pacemaker/pcmk_sched_instances.c GHashTable *allowed_orig_parent = parent->allowed_nodes; parent 637 lib/pacemaker/pcmk_sched_instances.c parent->allowed_nodes = pcmk__copy_node_table(parent->allowed_nodes); parent 690 lib/pacemaker/pcmk_sched_instances.c g_hash_table_destroy(parent->allowed_nodes); parent 691 lib/pacemaker/pcmk_sched_instances.c parent->allowed_nodes = allowed_orig_parent; parent 431 lib/pacemaker/pcmk_sched_nodes.c } else if (rsc->parent == NULL) { parent 434 lib/pacemaker/pcmk_sched_nodes.c allowed_nodes = rsc->parent->allowed_nodes; parent 229 lib/pacemaker/pcmk_sched_primitive.c if (!pcmk__is_unique_clone(rsc->parent) parent 404 lib/pacemaker/pcmk_sched_primitive.c if ((rsc->parent != NULL) parent 405 lib/pacemaker/pcmk_sched_primitive.c && !pcmk_is_set(rsc->parent->flags, pcmk_rsc_assigning)) { parent 407 lib/pacemaker/pcmk_sched_primitive.c rsc->id, rsc->parent->id); parent 408 lib/pacemaker/pcmk_sched_primitive.c rsc->parent->cmds->assign(rsc->parent, prefer, stop_if_fail); parent 1150 lib/pacemaker/pcmk_sched_primitive.c if (rsc->parent != NULL) { parent 1151 lib/pacemaker/pcmk_sched_primitive.c rsc->parent->cmds->with_this_colocations(rsc->parent, orig_rsc, list); parent 1179 lib/pacemaker/pcmk_sched_primitive.c if (rsc->parent != NULL) { parent 1180 lib/pacemaker/pcmk_sched_primitive.c rsc->parent->cmds->this_with_colocations(rsc->parent, orig_rsc, list); parent 1506 lib/pacemaker/pcmk_sched_primitive.c const pcmk_resource_t *parent = NULL; parent 1533 lib/pacemaker/pcmk_sched_primitive.c for (parent = rsc; parent != NULL; parent = parent->parent) { parent 1534 lib/pacemaker/pcmk_sched_primitive.c if (parent->container != NULL) { parent 1536 lib/pacemaker/pcmk_sched_primitive.c parent->container->id); parent 633 lib/pacemaker/pcmk_sched_probes.c || (probe->rsc->parent == after->rsc) parent 636 lib/pacemaker/pcmk_sched_probes.c || (after->rsc != after_wrapper->action->rsc->parent)) { parent 170 lib/pacemaker/pcmk_sched_promotable.c const pcmk_resource_t *parent = NULL; parent 214 lib/pacemaker/pcmk_sched_promotable.c parent = pe__const_top_resource(rsc, false); parent 215 lib/pacemaker/pcmk_sched_promotable.c local_node = g_hash_table_lookup(parent->allowed_nodes, node->details->id); parent 225 lib/pacemaker/pcmk_sched_promotable.c rsc->id, parent->id, pcmk__node_name(node)); parent 229 lib/pacemaker/pcmk_sched_promotable.c } else if ((local_node->count >= pe__clone_promoted_node_max(parent)) parent 561 lib/pacemaker/pcmk_sched_promotable.c const pcmk_resource_t *parent = pe__const_top_resource(rsc, false); parent 569 lib/pacemaker/pcmk_sched_promotable.c active = find_active_anon_instance(parent, id, node); parent 578 lib/pacemaker/pcmk_sched_promotable.c if ((active == NULL) && anonymous_known_on(parent, id, node)) { parent 362 lib/pengine/bundle.c create_ip_resource(pcmk_resource_t *parent, pe__bundle_variant_data_t *data, parent 398 lib/pengine/bundle.c if (pe__unpack_resource(xml_ip, &replica->ip, parent, parent 399 lib/pengine/bundle.c parent->cluster) != pcmk_rc_ok) { parent 403 lib/pengine/bundle.c parent->children = g_list_append(parent->children, replica->ip); parent 422 lib/pengine/bundle.c create_container_resource(pcmk_resource_t *parent, parent 649 lib/pengine/bundle.c if (pe__unpack_resource(xml_container, &replica->container, parent, parent 650 lib/pengine/bundle.c parent->cluster) != pcmk_rc_ok) { parent 654 lib/pengine/bundle.c parent->children = g_list_append(parent->children, replica->container); parent 680 lib/pengine/bundle.c create_remote_resource(pcmk_resource_t *parent, pe__bundle_variant_data_t *data, parent 692 lib/pengine/bundle.c if (pe_find_resource(parent->cluster->resources, id) != NULL) { parent 698 lib/pengine/bundle.c pcmk__assert(pe_find_resource(parent->cluster->resources, parent 735 lib/pengine/bundle.c node = pcmk_find_node(parent->cluster, uname); parent 738 lib/pengine/bundle.c -PCMK_SCORE_INFINITY, parent->cluster); parent 761 lib/pengine/bundle.c g_list_foreach(parent->cluster->resources, (GFunc) disallow_node, parent 780 lib/pengine/bundle.c g_hash_table_insert(replica->child->parent->allowed_nodes, parent 783 lib/pengine/bundle.c if (pe__unpack_resource(xml_remote, &replica->remote, parent, parent 784 lib/pengine/bundle.c parent->cluster) != pcmk_rc_ok) { parent 816 lib/pengine/bundle.c parent->children = g_list_append(parent->children, replica->remote); parent 822 lib/pengine/bundle.c create_replica_resources(pcmk_resource_t *parent, parent 828 lib/pengine/bundle.c rc = create_container_resource(parent, data, replica); parent 833 lib/pengine/bundle.c rc = create_ip_resource(parent, data, replica); parent 838 lib/pengine/bundle.c rc = create_remote_resource(parent, data, replica); parent 902 lib/pengine/bundle.c while (top->parent != NULL) { parent 903 lib/pengine/bundle.c top = top->parent; parent 143 lib/pengine/complex.c pcmk_resource_t *p = rsc->parent; parent 158 lib/pengine/complex.c p = p->parent; parent 213 lib/pengine/complex.c if (rsc->parent != NULL) { parent 225 lib/pengine/complex.c if (rsc->parent) { parent 226 lib/pengine/complex.c g_hash_table_foreach(rsc->parent->meta, dup_attr, meta_hash); parent 250 lib/pengine/complex.c if (rsc->parent != NULL) { parent 251 lib/pengine/complex.c get_rsc_attributes(meta_hash, rsc->parent, node, scheduler); parent 692 lib/pengine/complex.c pcmk_resource_t *parent, pcmk_scheduler_t *scheduler) parent 748 lib/pengine/complex.c (*rsc)->parent = parent; parent 1031 lib/pengine/complex.c pcmk_resource_t *parent = child; parent 1033 lib/pengine/complex.c if (parent == NULL || rsc == NULL) { parent 1036 lib/pengine/complex.c while (parent->parent != NULL) { parent 1037 lib/pengine/complex.c if (parent->parent == rsc) { parent 1040 lib/pengine/complex.c parent = parent->parent; parent 1048 lib/pengine/complex.c pcmk_resource_t *parent = rsc; parent 1050 lib/pengine/complex.c if (parent == NULL) { parent 1053 lib/pengine/complex.c while ((parent->parent != NULL) && !pcmk__is_bundle(parent->parent)) { parent 1054 lib/pengine/complex.c parent = parent->parent; parent 1056 lib/pengine/complex.c return parent; parent 1073 lib/pengine/complex.c const pcmk_resource_t *parent = rsc; parent 1075 lib/pengine/complex.c if (parent == NULL) { parent 1078 lib/pengine/complex.c while (parent->parent != NULL) { parent 1079 lib/pengine/complex.c if (!include_bundle && pcmk__is_bundle(parent->parent)) { parent 1082 lib/pengine/complex.c parent = parent->parent; parent 1084 lib/pengine/complex.c return parent; parent 1111 lib/pengine/complex.c if ((rsc->parent == NULL) parent 120 lib/pengine/native.c pcmk_resource_t *p = rsc->parent; parent 129 lib/pengine/native.c p = p->parent; parent 160 lib/pengine/native.c if ((pcmk__is_group(rsc->parent) parent 161 lib/pengine/native.c || pcmk__is_bundle(rsc->parent)) parent 162 lib/pengine/native.c && (rsc->parent->recovery_type == pcmk_multiply_active_block)) { parent 163 lib/pengine/native.c GList *gIter = rsc->parent->children; parent 190 lib/pengine/native.c if (rsc->parent != NULL) { parent 191 lib/pengine/native.c native_add_running(rsc->parent, node, scheduler, FALSE); parent 206 lib/pengine/native.c pcmk_resource_t *parent = uber_parent(rsc); parent 215 lib/pengine/native.c && pcmk__is_clone(parent)) { parent 222 lib/pengine/native.c pe__force_anon(standard, parent, rsc->id, scheduler); parent 229 lib/pengine/native.c recursive_clear_unique(parent, NULL); parent 233 lib/pengine/native.c && pcmk_is_set(parent->flags, pcmk_rsc_promotable)) { parent 1449 lib/pengine/native.c } else if (check_parent && rsc->parent) { parent 1706 lib/pengine/pe_output.c status_node(pcmk_node_t *node, xmlNodePtr parent, uint32_t show_opts) parent 1713 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1718 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1725 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1732 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1738 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1744 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1751 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1758 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1763 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, parent 1772 lib/pengine/pe_output.c child = pcmk__html_create(parent, PCMK__XE_SPAN, NULL, NULL); parent 2454 lib/pengine/pe_output.c const pcmk_resource_t *parent = NULL; parent 2473 lib/pengine/pe_output.c parent = pe__const_top_resource(rsc, false); parent 2474 lib/pengine/pe_output.c if (pcmk__is_group(parent)) { parent 2477 lib/pengine/pe_output.c && !pcmk__str_in_list(rsc_printable_id(parent), only_rsc, parent 93 lib/pengine/pe_status_private.h pcmk_resource_t *parent, parent 125 lib/pengine/remote.c pe_create_remote_xml(xmlNode *parent, const char *uname, parent 133 lib/pengine/remote.c remote = pcmk__xe_create(parent, PCMK_XE_PRIMITIVE); parent 446 lib/pengine/status.c pcmk_resource_t *parent = rIter->data; parent 449 lib/pengine/status.c parent->fns->find_rsc(parent, id, NULL, flags); parent 546 lib/pengine/unpack.c expand_remote_rsc_meta(xmlNode *xml_obj, xmlNode *parent, pcmk_scheduler_t *data) parent 605 lib/pengine/unpack.c pe_create_remote_xml(parent, remote_name, container_id, parent 2078 lib/pengine/unpack.c create_anonymous_orphan(pcmk_resource_t *parent, const char *rsc_id, parent 2081 lib/pengine/unpack.c pcmk_resource_t *top = pe__create_clone_child(parent, scheduler); parent 2087 lib/pengine/unpack.c pcmk__rsc_debug(parent, "Created orphan %s for %s: %s on %s", parent 2088 lib/pengine/unpack.c top->id, parent->id, rsc_id, pcmk__node_name(node)); parent 2109 lib/pengine/unpack.c pcmk_resource_t *parent, const char *rsc_id) parent 2116 lib/pengine/unpack.c pcmk__assert(pcmk__is_anonymous_clone(parent)); parent 2119 lib/pengine/unpack.c pcmk__rsc_trace(parent, "Looking for %s on %s in %s", parent 2120 lib/pengine/unpack.c rsc_id, pcmk__node_name(node), parent->id); parent 2121 lib/pengine/unpack.c for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) { parent 2156 lib/pengine/unpack.c rsc = parent->fns->find_rsc(child, rsc_id, NULL, parent 2169 lib/pengine/unpack.c parent->id, pcmk__node_name(node)); parent 2173 lib/pengine/unpack.c pcmk__rsc_trace(parent, "Resource %s, active", rsc->id); parent 2180 lib/pengine/unpack.c pcmk__rsc_trace(parent, "Resource %s, skip inactive", child->id); parent 2184 lib/pengine/unpack.c inactive_instance = parent->fns->find_rsc(child, rsc_id, NULL, parent 2200 lib/pengine/unpack.c pcmk__rsc_trace(parent, "Resource %s, empty slot", parent 2221 lib/pengine/unpack.c && !pe__is_universal_clone(parent, scheduler)) { parent 2227 lib/pengine/unpack.c rsc = create_anonymous_orphan(parent, rsc_id, node, scheduler); parent 2228 lib/pengine/unpack.c pcmk__rsc_trace(parent, "Resource %s, orphan", rsc->id); parent 2238 lib/pengine/unpack.c pcmk_resource_t *parent = NULL; parent 2254 lib/pengine/unpack.c parent = uber_parent(clone0); parent 2255 lib/pengine/unpack.c crm_trace("%s found as %s (%s)", rsc_id, clone0_id, parent->id); parent 2268 lib/pengine/unpack.c parent = uber_parent(rsc); parent 2271 lib/pengine/unpack.c if (pcmk__is_anonymous_clone(parent)) { parent 2273 lib/pengine/unpack.c if (pcmk__is_bundled(parent)) { parent 2274 lib/pengine/unpack.c rsc = pe__find_bundle_replica(parent->parent, node); parent 2278 lib/pengine/unpack.c rsc = find_anonymous_clone(scheduler, node, parent, base); parent 2352 lib/pengine/unpack.c iter = iter->parent; parent 3707 lib/pengine/unpack.c if (fail_rsc->parent != NULL) { parent 3708 lib/pengine/unpack.c pcmk_resource_t *parent = uber_parent(fail_rsc); parent 3710 lib/pengine/unpack.c if (pcmk__is_anonymous_clone(parent)) { parent 3715 lib/pengine/unpack.c fail_rsc = parent; parent 4840 lib/pengine/unpack.c pcmk_resource_t *parent = rsc; parent 4914 lib/pengine/unpack.c parent = uber_parent(rsc); parent 4941 lib/pengine/unpack.c resource_location(parent, node, -PCMK_SCORE_INFINITY, parent 5014 lib/pengine/unpack.c parent->id, pcmk__node_name(node), parent 5018 lib/pengine/unpack.c resource_location(parent, node, -PCMK_SCORE_INFINITY, parent 5024 lib/pengine/unpack.c parent->id, parent 5028 lib/pengine/unpack.c resource_location(parent, NULL, -PCMK_SCORE_INFINITY, parent 806 lib/pengine/utils.c (rsc->parent && pcmk__str_in_list(rsc_printable_id(rsc->parent), filter, pcmk__str_star_matches))) { parent 885 lib/pengine/utils.c const pcmk_resource_t *parent = pe__const_top_resource(rsc, false); parent 888 lib/pengine/utils.c if (pcmk__is_clone(parent)) { parent 889 lib/pengine/utils.c rsc_id = pe__clone_child_id(parent); parent 408 maint/gnulib/lib/argp-help.c struct hol_cluster *parent; parent 515 maint/gnulib/lib/argp-help.c struct hol_cluster *parent, const struct argp *argp) parent 524 maint/gnulib/lib/argp-help.c cl->parent = parent; parent 526 maint/gnulib/lib/argp-help.c cl->depth = parent ? parent->depth + 1 : 0; parent 712 maint/gnulib/lib/argp-help.c if (cl1->parent == cl2->parent) parent 717 maint/gnulib/lib/argp-help.c int cmp = hol_cousin_cluster_cmp (cl1->parent, cl2->parent); parent 742 maint/gnulib/lib/argp-help.c cl1 = cl1->parent; parent 753 maint/gnulib/lib/argp-help.c cl2 = cl2->parent; parent 770 maint/gnulib/lib/argp-help.c while (cl->parent) parent 771 maint/gnulib/lib/argp-help.c cl = cl->parent; parent 1181 maint/gnulib/lib/argp-help.c cl1 = cl1->parent; parent 212 maint/gnulib/lib/argp-parse.c struct group *parent; parent 291 maint/gnulib/lib/argp-parse.c struct group *parent, unsigned parent_index, parent 357 maint/gnulib/lib/argp-parse.c group->parent = parent; parent 374 maint/gnulib/lib/argp-parse.c parent = group++; parent 377 maint/gnulib/lib/argp-parse.c parent = 0; parent 384 maint/gnulib/lib/argp-parse.c convert_options (children++->argp, parent, index++, group, cvt); parent 530 maint/gnulib/lib/argp-parse.c if (group->parent) parent 532 maint/gnulib/lib/argp-parse.c group->input = group->parent->child_inputs[group->parent_index]; parent 141 maint/gnulib/lib/fts-cycle.c FTSENT *parent = ent->fts_parent; parent 142 maint/gnulib/lib/fts-cycle.c if (parent != NULL && 0 <= parent->fts_level) parent 144 maint/gnulib/lib/fts-cycle.c *(parent->fts_statp), *st); parent 366 maint/gnulib/lib/fts.c FTSENT *parent = NULL; parent 446 maint/gnulib/lib/fts.c if ((parent = fts_alloc(sp, "", 0)) == NULL) parent 448 maint/gnulib/lib/fts.c parent->fts_level = FTS_ROOTPARENTLEVEL; parent 482 maint/gnulib/lib/fts.c p->fts_parent = parent; parent 542 maint/gnulib/lib/fts.c free(parent); parent 342 maint/gnulib/lib/get_ppid_of.c pid_t parent = get_ppid_of (pid); parent 343 maint/gnulib/lib/get_ppid_of.c printf ("PID=%lu PPID=%lu\n", (unsigned long) pid, (unsigned long) parent); parent 45 maint/gnulib/lib/gl_anyavltree_list1.h struct gl_list_node_impl *parent; parent 41 maint/gnulib/lib/gl_anyavltree_list2.h node->left->parent = node; parent 53 maint/gnulib/lib/gl_anyavltree_list2.h node->right->parent = node; parent 114 maint/gnulib/lib/gl_anyavltree_list2.h list->root->parent = NULL; parent 147 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t node, int height_diff, gl_list_node_t parent) parent 158 maint/gnulib/lib/gl_anyavltree_list2.h node = parent; parent 180 maint/gnulib/lib/gl_anyavltree_list2.h if (node->parent == NULL) parent 183 maint/gnulib/lib/gl_anyavltree_list2.h else if (node->parent->left == node) parent 184 maint/gnulib/lib/gl_anyavltree_list2.h nodep = &node->parent->left; parent 185 maint/gnulib/lib/gl_anyavltree_list2.h else if (node->parent->right == node) parent 186 maint/gnulib/lib/gl_anyavltree_list2.h nodep = &node->parent->right; parent 216 maint/gnulib/lib/gl_anyavltree_list2.h nodeleft->parent = node->parent; parent 217 maint/gnulib/lib/gl_anyavltree_list2.h node->parent = nodeleft; parent 219 maint/gnulib/lib/gl_anyavltree_list2.h nodeleftright->parent = node; parent 258 maint/gnulib/lib/gl_anyavltree_list2.h nodeleftright->parent = node->parent; parent 260 maint/gnulib/lib/gl_anyavltree_list2.h L->parent = nodeleft; parent 262 maint/gnulib/lib/gl_anyavltree_list2.h R->parent = node; parent 263 maint/gnulib/lib/gl_anyavltree_list2.h nodeleft->parent = nodeleftright; parent 264 maint/gnulib/lib/gl_anyavltree_list2.h node->parent = nodeleftright; parent 314 maint/gnulib/lib/gl_anyavltree_list2.h noderight->parent = node->parent; parent 315 maint/gnulib/lib/gl_anyavltree_list2.h node->parent = noderight; parent 317 maint/gnulib/lib/gl_anyavltree_list2.h noderightleft->parent = node; parent 356 maint/gnulib/lib/gl_anyavltree_list2.h noderightleft->parent = node->parent; parent 358 maint/gnulib/lib/gl_anyavltree_list2.h L->parent = node; parent 360 maint/gnulib/lib/gl_anyavltree_list2.h R->parent = noderight; parent 361 maint/gnulib/lib/gl_anyavltree_list2.h node->parent = noderightleft; parent 362 maint/gnulib/lib/gl_anyavltree_list2.h noderight->parent = noderightleft; parent 404 maint/gnulib/lib/gl_anyavltree_list2.h parent = node->parent; parent 405 maint/gnulib/lib/gl_anyavltree_list2.h if (parent == NULL) parent 413 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t parent = node->parent; parent 421 maint/gnulib/lib/gl_anyavltree_list2.h child->parent = parent; parent 422 maint/gnulib/lib/gl_anyavltree_list2.h if (parent == NULL) parent 426 maint/gnulib/lib/gl_anyavltree_list2.h if (parent->left == node) parent 427 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = child; parent 429 maint/gnulib/lib/gl_anyavltree_list2.h parent->right = child; parent 435 maint/gnulib/lib/gl_anyavltree_list2.h for (p = parent; p != NULL; p = p->parent) parent 439 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, child, -1, parent); parent 449 maint/gnulib/lib/gl_anyavltree_list2.h child->parent = parent; parent 450 maint/gnulib/lib/gl_anyavltree_list2.h if (parent == NULL) parent 454 maint/gnulib/lib/gl_anyavltree_list2.h if (parent->left == node) parent 455 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = child; parent 457 maint/gnulib/lib/gl_anyavltree_list2.h parent->right = child; parent 463 maint/gnulib/lib/gl_anyavltree_list2.h for (p = parent; p != NULL; p = p->parent) parent 467 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, child, -1, parent); parent 480 maint/gnulib/lib/gl_anyavltree_list2.h subst_parent = subst->parent; parent 498 maint/gnulib/lib/gl_anyavltree_list2.h child->parent = subst_parent; parent 506 maint/gnulib/lib/gl_anyavltree_list2.h for (p = subst_parent; p != NULL; p = p->parent) parent 516 maint/gnulib/lib/gl_anyavltree_list2.h subst->left->parent = subst; parent 519 maint/gnulib/lib/gl_anyavltree_list2.h subst->right->parent = subst; parent 522 maint/gnulib/lib/gl_anyavltree_list2.h subst->parent = parent; parent 523 maint/gnulib/lib/gl_anyavltree_list2.h if (parent == NULL) parent 525 maint/gnulib/lib/gl_anyavltree_list2.h else if (parent->left == node) parent 526 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = subst; parent 528 maint/gnulib/lib/gl_anyavltree_list2.h parent->right = subst; parent 563 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = NULL; parent 573 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; parent 580 maint/gnulib/lib/gl_anyavltree_list2.h for (p = node; p != NULL; p = p->parent) parent 585 maint/gnulib/lib/gl_anyavltree_list2.h if (node->right == NULL && node->parent != NULL) parent 586 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, node, 1, node->parent); parent 631 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = NULL; parent 641 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; parent 648 maint/gnulib/lib/gl_anyavltree_list2.h for (p = node; p != NULL; p = p->parent) parent 653 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left == NULL && node->parent != NULL) parent 654 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, node, 1, node->parent); parent 712 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; parent 718 maint/gnulib/lib/gl_anyavltree_list2.h for (p = node; p != NULL; p = p->parent) parent 723 maint/gnulib/lib/gl_anyavltree_list2.h if (height_inc && node->parent != NULL) parent 724 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, node, 1, node->parent); parent 781 maint/gnulib/lib/gl_anyavltree_list2.h new_node->parent = node; parent 787 maint/gnulib/lib/gl_anyavltree_list2.h for (p = node; p != NULL; p = p->parent) parent 792 maint/gnulib/lib/gl_anyavltree_list2.h if (height_inc && node->parent != NULL) parent 793 maint/gnulib/lib/gl_anyavltree_list2.h rebalance (list, node, 1, node->parent); parent 51 maint/gnulib/lib/gl_anyrbtree_list1.h struct gl_list_node_impl *parent; parent 47 maint/gnulib/lib/gl_anyrbtree_list2.h node->left->parent = node; parent 62 maint/gnulib/lib/gl_anyrbtree_list2.h node->right->parent = node; parent 129 maint/gnulib/lib/gl_anyrbtree_list2.h list->root->parent = NULL; parent 176 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->parent = b_node->parent; parent 177 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->parent = d_node; parent 179 maint/gnulib/lib/gl_anyrbtree_list2.h c_node->parent = b_node; parent 210 maint/gnulib/lib/gl_anyrbtree_list2.h b_node->parent = d_node->parent; parent 211 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->parent = b_node; parent 213 maint/gnulib/lib/gl_anyrbtree_list2.h c_node->parent = d_node; parent 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) parent 238 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->color == BLACK) parent 245 maint/gnulib/lib/gl_anyrbtree_list2.h grandparent = parent->parent; parent 249 maint/gnulib/lib/gl_anyrbtree_list2.h if (grandparent->left == parent) parent 251 maint/gnulib/lib/gl_anyrbtree_list2.h else if (grandparent->right == parent) parent 262 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = uncle->color = BLACK; parent 273 maint/gnulib/lib/gl_anyrbtree_list2.h if (grandparent->parent == NULL) parent 275 maint/gnulib/lib/gl_anyrbtree_list2.h else if (grandparent->parent->left == grandparent) parent 276 maint/gnulib/lib/gl_anyrbtree_list2.h grandparentp = &grandparent->parent->left; parent 277 maint/gnulib/lib/gl_anyrbtree_list2.h else if (grandparent->parent->right == grandparent) parent 278 maint/gnulib/lib/gl_anyrbtree_list2.h grandparentp = &grandparent->parent->right; parent 282 maint/gnulib/lib/gl_anyrbtree_list2.h if (grandparent->left == parent) parent 284 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->right == node) parent 287 maint/gnulib/lib/gl_anyrbtree_list2.h grandparent->left = rotate_left (parent, node); parent 288 maint/gnulib/lib/gl_anyrbtree_list2.h node = parent; parent 289 maint/gnulib/lib/gl_anyrbtree_list2.h parent = grandparent->left; parent 303 maint/gnulib/lib/gl_anyrbtree_list2.h *grandparentp = rotate_right (parent, grandparent); parent 304 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 309 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) parent 312 maint/gnulib/lib/gl_anyrbtree_list2.h grandparent->right = rotate_right (node, parent); parent 313 maint/gnulib/lib/gl_anyrbtree_list2.h node = parent; parent 314 maint/gnulib/lib/gl_anyrbtree_list2.h parent = grandparent->right; parent 328 maint/gnulib/lib/gl_anyrbtree_list2.h *grandparentp = rotate_left (grandparent, parent); parent 329 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 336 maint/gnulib/lib/gl_anyrbtree_list2.h parent = node->parent; parent 338 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent == NULL) parent 353 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_remove (gl_list_t list, gl_list_node_t child, gl_list_node_t parent) parent 363 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->parent == NULL) parent 365 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->parent->left == parent) parent 366 maint/gnulib/lib/gl_anyrbtree_list2.h parentp = &parent->parent->left; parent 367 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->parent->right == parent) parent 368 maint/gnulib/lib/gl_anyrbtree_list2.h parentp = &parent->parent->right; parent 372 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == child) parent 374 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t sibling = parent->right; parent 398 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_left (parent, sibling); parent 399 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = RED; parent 405 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->right; parent 426 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_left (parent, sibling); parent 427 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->color = parent->color; parent 428 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 449 maint/gnulib/lib/gl_anyrbtree_list2.h parent->right = rotate_right (sibling->left, sibling); parent 452 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->right; parent 456 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_left (parent, sibling); parent 457 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->color = parent->color; parent 458 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 464 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->color == BLACK) parent 476 maint/gnulib/lib/gl_anyrbtree_list2.h child = parent; parent 488 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 494 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->right == child) parent 496 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t sibling = parent->left; parent 520 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_right (sibling, parent); parent 521 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = RED; parent 527 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->left; parent 548 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_right (sibling, parent); parent 549 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->color = parent->color; parent 550 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 571 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = rotate_left (sibling, sibling->right); parent 574 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->left; parent 578 maint/gnulib/lib/gl_anyrbtree_list2.h *parentp = rotate_right (sibling, parent); parent 579 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->color = parent->color; parent 580 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 586 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->color == BLACK) parent 598 maint/gnulib/lib/gl_anyrbtree_list2.h child = parent; parent 610 maint/gnulib/lib/gl_anyrbtree_list2.h parent->color = BLACK; parent 620 maint/gnulib/lib/gl_anyrbtree_list2.h parent = child->parent; parent 630 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent == NULL) parent 638 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t parent = node->parent; parent 647 maint/gnulib/lib/gl_anyrbtree_list2.h child->parent = parent; parent 652 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent == NULL) parent 656 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) parent 657 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = child; parent 659 maint/gnulib/lib/gl_anyrbtree_list2.h parent->right = child; parent 665 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = parent; p != NULL; p = p->parent) parent 670 maint/gnulib/lib/gl_anyrbtree_list2.h rebalance_after_remove (list, child, parent); parent 680 maint/gnulib/lib/gl_anyrbtree_list2.h child->parent = parent; parent 684 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent == NULL) parent 688 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) parent 689 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = child; parent 691 maint/gnulib/lib/gl_anyrbtree_list2.h parent->right = child; parent 697 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = parent; p != NULL; p = p->parent) parent 713 maint/gnulib/lib/gl_anyrbtree_list2.h subst_parent = subst->parent; parent 733 maint/gnulib/lib/gl_anyrbtree_list2.h child->parent = subst_parent; parent 741 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = subst_parent; p != NULL; p = p->parent) parent 751 maint/gnulib/lib/gl_anyrbtree_list2.h subst->left->parent = subst; parent 754 maint/gnulib/lib/gl_anyrbtree_list2.h subst->right->parent = subst; parent 757 maint/gnulib/lib/gl_anyrbtree_list2.h subst->parent = parent; parent 758 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent == NULL) parent 760 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->left == node) parent 761 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = subst; parent 763 maint/gnulib/lib/gl_anyrbtree_list2.h parent->right = subst; parent 806 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = NULL; parent 816 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; parent 822 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = node; p != NULL; p = p->parent) parent 872 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = NULL; parent 882 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; parent 888 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = node; p != NULL; p = p->parent) parent 942 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; parent 948 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = node; p != NULL; p = p->parent) parent 1001 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->parent = node; parent 1007 maint/gnulib/lib/gl_anyrbtree_list2.h for (p = node; p != NULL; p = p->parent) parent 117 maint/gnulib/lib/gl_anytree_list2.h while (node->parent != NULL && node->parent->right == node) parent 118 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 119 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 136 maint/gnulib/lib/gl_anytree_list2.h while (node->parent != NULL && node->parent->left == node) parent 137 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 138 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 649 maint/gnulib/lib/gl_anytree_list2.h while (node->parent != NULL && node->parent->right == node) parent 650 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 651 maint/gnulib/lib/gl_anytree_list2.h node = node->parent; parent 291 maint/gnulib/lib/gl_anytree_omap.h while (node->parent != NULL && node->parent->right == node) parent 292 maint/gnulib/lib/gl_anytree_omap.h node = node->parent; parent 293 maint/gnulib/lib/gl_anytree_omap.h node = node->parent; parent 68 maint/gnulib/lib/gl_anytree_oset.h while (node->parent != NULL && node->parent->right == node) parent 69 maint/gnulib/lib/gl_anytree_oset.h node = node->parent; parent 70 maint/gnulib/lib/gl_anytree_oset.h node = node->parent; parent 87 maint/gnulib/lib/gl_anytree_oset.h while (node->parent != NULL && node->parent->left == node) parent 88 maint/gnulib/lib/gl_anytree_oset.h node = node->parent; parent 89 maint/gnulib/lib/gl_anytree_oset.h node = node->parent; parent 41 maint/gnulib/lib/gl_anytreehash_list1.h gl_list_node_t parent = node->parent; parent 43 maint/gnulib/lib/gl_anytreehash_list1.h if (parent == NULL) parent 46 maint/gnulib/lib/gl_anytreehash_list1.h if (parent->right == node) parent 49 maint/gnulib/lib/gl_anytreehash_list1.h if (parent->left != NULL) parent 50 maint/gnulib/lib/gl_anytreehash_list1.h position += parent->left->branch_size; parent 53 maint/gnulib/lib/gl_anytreehash_list1.h node = parent; parent 43 maint/gnulib/lib/gl_avltree_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent) parent 51 maint/gnulib/lib/gl_avltree_list.c if (!(node->parent == parent)) parent 38 maint/gnulib/lib/gl_avltree_ordered.h struct NODE_IMPL *parent; parent 66 maint/gnulib/lib/gl_avltree_ordered.h NODE_T node, int height_diff, NODE_T parent) parent 77 maint/gnulib/lib/gl_avltree_ordered.h node = parent; parent 99 maint/gnulib/lib/gl_avltree_ordered.h if (node->parent == NULL) parent 102 maint/gnulib/lib/gl_avltree_ordered.h else if (node->parent->left == node) parent 103 maint/gnulib/lib/gl_avltree_ordered.h nodep = &node->parent->left; parent 104 maint/gnulib/lib/gl_avltree_ordered.h else if (node->parent->right == node) parent 105 maint/gnulib/lib/gl_avltree_ordered.h nodep = &node->parent->right; parent 134 maint/gnulib/lib/gl_avltree_ordered.h nodeleft->parent = node->parent; parent 135 maint/gnulib/lib/gl_avltree_ordered.h node->parent = nodeleft; parent 137 maint/gnulib/lib/gl_avltree_ordered.h nodeleftright->parent = node; parent 170 maint/gnulib/lib/gl_avltree_ordered.h nodeleftright->parent = node->parent; parent 172 maint/gnulib/lib/gl_avltree_ordered.h L->parent = nodeleft; parent 174 maint/gnulib/lib/gl_avltree_ordered.h R->parent = node; parent 175 maint/gnulib/lib/gl_avltree_ordered.h nodeleft->parent = nodeleftright; parent 176 maint/gnulib/lib/gl_avltree_ordered.h node->parent = nodeleftright; parent 216 maint/gnulib/lib/gl_avltree_ordered.h noderight->parent = node->parent; parent 217 maint/gnulib/lib/gl_avltree_ordered.h node->parent = noderight; parent 219 maint/gnulib/lib/gl_avltree_ordered.h noderightleft->parent = node; parent 252 maint/gnulib/lib/gl_avltree_ordered.h noderightleft->parent = node->parent; parent 254 maint/gnulib/lib/gl_avltree_ordered.h L->parent = node; parent 256 maint/gnulib/lib/gl_avltree_ordered.h R->parent = noderight; parent 257 maint/gnulib/lib/gl_avltree_ordered.h node->parent = noderightleft; parent 258 maint/gnulib/lib/gl_avltree_ordered.h noderight->parent = noderightleft; parent 291 maint/gnulib/lib/gl_avltree_ordered.h parent = node->parent; parent 292 maint/gnulib/lib/gl_avltree_ordered.h if (parent == NULL) parent 316 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = NULL; parent 326 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; parent 330 maint/gnulib/lib/gl_avltree_ordered.h if (node->right == NULL && node->parent != NULL) parent 331 maint/gnulib/lib/gl_avltree_ordered.h rebalance (container, node, 1, node->parent); parent 363 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; parent 366 maint/gnulib/lib/gl_avltree_ordered.h if (height_inc && node->parent != NULL) parent 367 maint/gnulib/lib/gl_avltree_ordered.h rebalance (container, node, 1, node->parent); parent 413 maint/gnulib/lib/gl_avltree_ordered.h new_node->parent = node; parent 416 maint/gnulib/lib/gl_avltree_ordered.h if (height_inc && node->parent != NULL) parent 417 maint/gnulib/lib/gl_avltree_ordered.h rebalance (container, node, 1, node->parent); parent 441 maint/gnulib/lib/gl_avltree_ordered.h NODE_T parent = node->parent; parent 449 maint/gnulib/lib/gl_avltree_ordered.h child->parent = parent; parent 450 maint/gnulib/lib/gl_avltree_ordered.h if (parent == NULL) parent 454 maint/gnulib/lib/gl_avltree_ordered.h if (parent->left == node) parent 455 maint/gnulib/lib/gl_avltree_ordered.h parent->left = child; parent 457 maint/gnulib/lib/gl_avltree_ordered.h parent->right = child; parent 459 maint/gnulib/lib/gl_avltree_ordered.h rebalance (container, child, -1, parent); parent 469 maint/gnulib/lib/gl_avltree_ordered.h child->parent = parent; parent 470 maint/gnulib/lib/gl_avltree_ordered.h if (parent == NULL) parent 474 maint/gnulib/lib/gl_avltree_ordered.h if (parent->left == node) parent 475 maint/gnulib/lib/gl_avltree_ordered.h parent->left = child; parent 477 maint/gnulib/lib/gl_avltree_ordered.h parent->right = child; parent 479 maint/gnulib/lib/gl_avltree_ordered.h rebalance (container, child, -1, parent); parent 492 maint/gnulib/lib/gl_avltree_ordered.h subst_parent = subst->parent; parent 510 maint/gnulib/lib/gl_avltree_ordered.h child->parent = subst_parent; parent 520 maint/gnulib/lib/gl_avltree_ordered.h subst->left->parent = subst; parent 523 maint/gnulib/lib/gl_avltree_ordered.h subst->right->parent = subst; parent 525 maint/gnulib/lib/gl_avltree_ordered.h subst->parent = parent; parent 526 maint/gnulib/lib/gl_avltree_ordered.h if (parent == NULL) parent 528 maint/gnulib/lib/gl_avltree_ordered.h else if (parent->left == node) parent 529 maint/gnulib/lib/gl_avltree_ordered.h parent->left = subst; parent 531 maint/gnulib/lib/gl_avltree_ordered.h parent->right = subst; parent 553 maint/gnulib/lib/gl_avltree_ordered.h check_invariants (NODE_T node, NODE_T parent, size_t *counterp) parent 561 maint/gnulib/lib/gl_avltree_ordered.h if (!(node->parent == parent)) parent 65 maint/gnulib/lib/gl_avltreehash_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent) parent 73 maint/gnulib/lib/gl_avltreehash_list.c if (!(node->parent == parent)) parent 43 maint/gnulib/lib/gl_rbtree_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent) parent 50 maint/gnulib/lib/gl_rbtree_list.c if (!(node->parent == parent)) parent 58 maint/gnulib/lib/gl_rbtree_list.c if (parent == NULL && !(node->color == BLACK)) parent 44 maint/gnulib/lib/gl_rbtree_ordered.h struct NODE_IMPL *parent; parent 84 maint/gnulib/lib/gl_rbtree_ordered.h d_node->parent = b_node->parent; parent 85 maint/gnulib/lib/gl_rbtree_ordered.h b_node->parent = d_node; parent 87 maint/gnulib/lib/gl_rbtree_ordered.h c_node->parent = b_node; parent 110 maint/gnulib/lib/gl_rbtree_ordered.h b_node->parent = d_node->parent; parent 111 maint/gnulib/lib/gl_rbtree_ordered.h d_node->parent = b_node; parent 113 maint/gnulib/lib/gl_rbtree_ordered.h c_node->parent = d_node; parent 122 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_add (CONTAINER_T container, NODE_T node, NODE_T parent) parent 132 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->color == BLACK) parent 139 maint/gnulib/lib/gl_rbtree_ordered.h grandparent = parent->parent; parent 143 maint/gnulib/lib/gl_rbtree_ordered.h if (grandparent->left == parent) parent 145 maint/gnulib/lib/gl_rbtree_ordered.h else if (grandparent->right == parent) parent 156 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = uncle->color = BLACK; parent 167 maint/gnulib/lib/gl_rbtree_ordered.h if (grandparent->parent == NULL) parent 169 maint/gnulib/lib/gl_rbtree_ordered.h else if (grandparent->parent->left == grandparent) parent 170 maint/gnulib/lib/gl_rbtree_ordered.h grandparentp = &grandparent->parent->left; parent 171 maint/gnulib/lib/gl_rbtree_ordered.h else if (grandparent->parent->right == grandparent) parent 172 maint/gnulib/lib/gl_rbtree_ordered.h grandparentp = &grandparent->parent->right; parent 176 maint/gnulib/lib/gl_rbtree_ordered.h if (grandparent->left == parent) parent 178 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->right == node) parent 181 maint/gnulib/lib/gl_rbtree_ordered.h grandparent->left = rotate_left (parent, node); parent 182 maint/gnulib/lib/gl_rbtree_ordered.h node = parent; parent 183 maint/gnulib/lib/gl_rbtree_ordered.h parent = grandparent->left; parent 197 maint/gnulib/lib/gl_rbtree_ordered.h *grandparentp = rotate_right (parent, grandparent); parent 198 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 203 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) parent 206 maint/gnulib/lib/gl_rbtree_ordered.h grandparent->right = rotate_right (node, parent); parent 207 maint/gnulib/lib/gl_rbtree_ordered.h node = parent; parent 208 maint/gnulib/lib/gl_rbtree_ordered.h parent = grandparent->right; parent 222 maint/gnulib/lib/gl_rbtree_ordered.h *grandparentp = rotate_left (grandparent, parent); parent 223 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 230 maint/gnulib/lib/gl_rbtree_ordered.h parent = node->parent; parent 232 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL) parent 247 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_remove (CONTAINER_T container, NODE_T child, NODE_T parent) parent 257 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->parent == NULL) parent 259 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->parent->left == parent) parent 260 maint/gnulib/lib/gl_rbtree_ordered.h parentp = &parent->parent->left; parent 261 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->parent->right == parent) parent 262 maint/gnulib/lib/gl_rbtree_ordered.h parentp = &parent->parent->right; parent 266 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == child) parent 268 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T sibling = parent->right; parent 292 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_left (parent, sibling); parent 293 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = RED; parent 299 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->right; parent 320 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_left (parent, sibling); parent 321 maint/gnulib/lib/gl_rbtree_ordered.h sibling->color = parent->color; parent 322 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 343 maint/gnulib/lib/gl_rbtree_ordered.h parent->right = rotate_right (sibling->left, sibling); parent 346 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->right; parent 350 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_left (parent, sibling); parent 351 maint/gnulib/lib/gl_rbtree_ordered.h sibling->color = parent->color; parent 352 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 358 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->color == BLACK) parent 370 maint/gnulib/lib/gl_rbtree_ordered.h child = parent; parent 382 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 388 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->right == child) parent 390 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T sibling = parent->left; parent 414 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_right (sibling, parent); parent 415 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = RED; parent 421 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->left; parent 442 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_right (sibling, parent); parent 443 maint/gnulib/lib/gl_rbtree_ordered.h sibling->color = parent->color; parent 444 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 465 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = rotate_left (sibling, sibling->right); parent 468 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->left; parent 472 maint/gnulib/lib/gl_rbtree_ordered.h *parentp = rotate_right (sibling, parent); parent 473 maint/gnulib/lib/gl_rbtree_ordered.h sibling->color = parent->color; parent 474 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 480 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->color == BLACK) parent 492 maint/gnulib/lib/gl_rbtree_ordered.h child = parent; parent 504 maint/gnulib/lib/gl_rbtree_ordered.h parent->color = BLACK; parent 514 maint/gnulib/lib/gl_rbtree_ordered.h parent = child->parent; parent 524 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL) parent 548 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = NULL; parent 558 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; parent 584 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; parent 624 maint/gnulib/lib/gl_rbtree_ordered.h new_node->parent = node; parent 651 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T parent = node->parent; parent 660 maint/gnulib/lib/gl_rbtree_ordered.h child->parent = parent; parent 665 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL) parent 669 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) parent 670 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = child; parent 672 maint/gnulib/lib/gl_rbtree_ordered.h parent->right = child; parent 675 maint/gnulib/lib/gl_rbtree_ordered.h rebalance_after_remove (container, child, parent); parent 685 maint/gnulib/lib/gl_rbtree_ordered.h child->parent = parent; parent 689 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL) parent 693 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) parent 694 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = child; parent 696 maint/gnulib/lib/gl_rbtree_ordered.h parent->right = child; parent 710 maint/gnulib/lib/gl_rbtree_ordered.h subst_parent = subst->parent; parent 730 maint/gnulib/lib/gl_rbtree_ordered.h child->parent = subst_parent; parent 740 maint/gnulib/lib/gl_rbtree_ordered.h subst->left->parent = subst; parent 743 maint/gnulib/lib/gl_rbtree_ordered.h subst->right->parent = subst; parent 745 maint/gnulib/lib/gl_rbtree_ordered.h subst->parent = parent; parent 746 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL) parent 748 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->left == node) parent 749 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = subst; parent 751 maint/gnulib/lib/gl_rbtree_ordered.h parent->right = subst; parent 781 maint/gnulib/lib/gl_rbtree_ordered.h check_invariants (NODE_T node, NODE_T parent, size_t *counterp) parent 788 maint/gnulib/lib/gl_rbtree_ordered.h if (!(node->parent == parent)) parent 792 maint/gnulib/lib/gl_rbtree_ordered.h if (parent == NULL && !(node->color == BLACK)) parent 65 maint/gnulib/lib/gl_rbtreehash_list.c check_invariants (gl_list_node_t node, gl_list_node_t parent) parent 72 maint/gnulib/lib/gl_rbtreehash_list.c if (!(node->parent == parent)) parent 80 maint/gnulib/lib/gl_rbtreehash_list.c if (parent == NULL && !(node->color == BLACK)) parent 1208 maint/gnulib/lib/regcomp.c if (node->parent == NULL) parent 1211 maint/gnulib/lib/regcomp.c node = node->parent; parent 1240 maint/gnulib/lib/regcomp.c node = node->parent; parent 1271 maint/gnulib/lib/regcomp.c node->left->parent = node; parent 1293 maint/gnulib/lib/regcomp.c node->left->parent = node; parent 1299 maint/gnulib/lib/regcomp.c node->right->parent = node; parent 3683 maint/gnulib/lib/regcomp.c tree->parent = NULL; parent 3694 maint/gnulib/lib/regcomp.c left->parent = tree; parent 3696 maint/gnulib/lib/regcomp.c right->parent = tree; parent 3745 maint/gnulib/lib/regcomp.c bin_tree_t **p_new = &dup_root, *dup_node = root->parent; parent 3753 maint/gnulib/lib/regcomp.c (*p_new)->parent = dup_node; parent 3769 maint/gnulib/lib/regcomp.c node = node->parent; parent 3770 maint/gnulib/lib/regcomp.c dup_node = dup_node->parent; parent 461 maint/gnulib/lib/regex_internal.h struct bin_tree_t *parent; parent 416 maint/gnulib/lib/tsearch.c node *parent = rootp, *up = &root->right; parent 421 maint/gnulib/lib/tsearch.c nodestack[sp++] = parent; parent 422 maint/gnulib/lib/tsearch.c parent = up; parent 1871 tools/crm_mon.c n = n->parent; parent 1746 tools/crm_resource.c if (pcmk__is_clone(rsc->parent) && (strchr(options.rsc_id, ':') != NULL) parent 87 tools/crm_resource_print.c rsc->clone_name ? rsc->clone_name : rsc->id, rsc->parent ? rsc->parent->id : "NA", parent 537 tools/crm_resource_print.c const pcmk_resource_t *parent = pe__const_top_resource(checks->rsc, false); parent 547 tools/crm_resource_print.c parent->id); parent 552 tools/crm_resource_print.c parent->id); parent 557 tools/crm_resource_print.c parent->id); parent 562 tools/crm_resource_print.c parent->id, checks->lock_node); parent 569 tools/crm_resource_print.c parent->id, parent 583 tools/crm_resource_print.c const pcmk_resource_t *parent = pe__const_top_resource(checks->rsc, false); parent 586 tools/crm_resource_print.c PCMK_XA_ID, parent->id, parent 54 tools/crm_resource_runtime.c const pcmk_resource_t *parent = pe__const_top_resource(rsc, false); parent 60 tools/crm_resource_runtime.c } else if (pcmk__is_clone(parent) parent 66 tools/crm_resource_runtime.c retval = build_node_info_list(parent); parent 210 tools/crm_resource_runtime.c if (pcmk__is_clone(rsc->parent)) { parent 215 tools/crm_resource_runtime.c rsc = rsc->parent; parent 221 tools/crm_resource_runtime.c } else if ((rsc->parent == NULL) && (rsc->children != NULL) parent 441 tools/crm_resource_runtime.c attr_set_type = (const char *) xml_search->parent->name; parent 445 tools/crm_resource_runtime.c rsc_attr_set = crm_element_value(xml_search->parent, PCMK_XA_ID); parent 1561 tools/crm_resource_runtime.c pcmk_resource_t *parent = uber_parent(rsc); parent 1571 tools/crm_resource_runtime.c rsc = parent->parent; parent 1576 tools/crm_resource_runtime.c if (pcmk__is_clone(parent) && !running) { parent 1577 tools/crm_resource_runtime.c if (pcmk__is_unique_clone(parent)) { parent 1583 tools/crm_resource_runtime.c rsc = parent->fns->find_rsc(parent, lookup_id, node, parent 1606 tools/crm_resource_runtime.c if (pcmk__is_unique_clone(parent)) { parent 1615 tools/crm_resource_runtime.c } else if (pcmk__is_clone(parent)) { parent 1618 tools/crm_resource_runtime.c lookup_id = strdup(parent->id); parent 2273 tools/crm_resource_runtime.c rid = pcmk__is_anonymous_clone(rsc->parent)? requested_name : rsc->id;