parent            115 daemons/attrd/attrd_attributes.c attrd_add_value_xml(xmlNode *parent, const attribute_t *a,
parent            118 daemons/attrd/attrd_attributes.c     xmlNode *xml = create_xml_node(parent, __func__);
parent            125 daemons/attrd/attrd_cib.c build_update_element(xmlNode *parent, attribute_t *a, const char *nodeid, const char *value)
parent            130 daemons/attrd/attrd_cib.c     xml_obj = create_xml_node(parent, XML_CIB_TAG_STATE);
parent            166 daemons/attrd/pacemaker-attrd.h xmlNode *attrd_add_value_xml(xmlNode *parent, const attribute_t *a,
parent            684 daemons/controld/controld_execd.c build_operation_update(xmlNode * parent, const lrmd_rsc_info_t *rsc,
parent            703 daemons/controld/controld_execd.c     xml_op = pcmk__create_history_xml(parent, op, caller_version, target_rc,
parent            127 daemons/controld/controld_membership.c create_node_state_update(crm_node_t *node, int flags, xmlNode *parent,
parent            138 daemons/controld/controld_membership.c     node_state = create_xml_node(parent, XML_CIB_TAG_STATE);
parent            218 daemons/controld/controld_te_utils.c         for(search = reason; search; search = search->parent) {
parent            227 daemons/controld/controld_te_utils.c             for(search = reason; search; search = search->parent) {
parent            860 daemons/controld/controld_utils.c         node = node->parent;
parent             82 daemons/controld/controld_utils.h                                   xmlNode *parent, const char *source);
parent            686 daemons/fenced/pacemaker-fenced.c     pe_node_t *parent = NULL;
parent            725 daemons/fenced/pacemaker-fenced.c     if (rsc->parent && (rsc->parent->variant == pe_group)) {
parent            726 daemons/fenced/pacemaker-fenced.c         parent = our_node_allowed_for(rsc->parent);
parent            741 daemons/fenced/pacemaker-fenced.c     } else if(node->weight < 0 || (parent && parent->weight < 0)) {
parent            743 daemons/fenced/pacemaker-fenced.c         int score = (node->weight < 0)? node->weight : parent->weight;
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            801 include/crm/common/output_internal.h pcmk__output_xml_push_parent(pcmk__output_t *out, xmlNodePtr parent);
parent             73 include/crm/common/util.h xmlNode *crm_create_op_xml(xmlNode *parent, const char *prefix,
parent             87 include/crm/common/xml.h xmlNode *create_xml_node(xmlNode * parent, const char *name);
parent             97 include/crm/common/xml.h xmlNode *pcmk_create_xml_text_node(xmlNode * parent, const char *name, const char *content);
parent            105 include/crm/common/xml.h xmlNode *pcmk_create_html_node(xmlNode * parent, const char *element_name, const char *id,
parent            124 include/crm/common/xml.h int add_node_nocopy(xmlNode * parent, const char *name, xmlNode * child);
parent            151 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right,
parent            164 include/crm/common/xml.h gboolean replace_xml_child(xmlNode * parent, xmlNode * child, xmlNode * update,
parent            261 include/crm/common/xml.h xmlNode *first_named_child(const xmlNode *parent, const char *name);
parent            264 include/crm/common/xml.h xmlNode *sorted_xml(xmlNode * input, xmlNode * parent, gboolean recursive);
parent             34 include/crm/common/xml_compat.h xmlNode *find_entity(xmlNode *parent, const char *node_name, const char *id);
parent            159 include/crm/common/xml_internal.h xmlNode *pcmk__xe_match(const xmlNode *parent, const char *node_name,
parent            200 include/crm/common/xml_internal.h pcmk__xml_first_child(const xmlNode *parent)
parent            202 include/crm/common/xml_internal.h     xmlNode *child = (parent? parent->children : NULL);
parent            238 include/crm/common/xml_internal.h pcmk__xe_first_child(const xmlNode *parent)
parent            240 include/crm/common/xml_internal.h     xmlNode *child = (parent? parent->children : NULL);
parent             46 include/crm/pengine/pe_types.h     pe_resource_t *(*find_rsc) (pe_resource_t *parent, const char *search,
parent            336 include/crm/pengine/pe_types.h     pe_resource_t *parent;
parent             32 include/crm/pengine/remote_internal.h xmlNode *pe_create_remote_xml(xmlNode *parent, const char *uname,
parent             96 include/crm/pengine/status.h     return uber_parent(rsc)->parent != NULL;
parent             43 include/pcmki/pcmki_sched_utils.h xmlNode *pcmk__create_history_xml(xmlNode *parent, lrmd_event_data_t *event,
parent            387 lib/cib/cib_ops.c update_cib_object(xmlNode * parent, xmlNode * update)
parent            397 lib/cib/cib_ops.c     CRM_CHECK(parent != NULL, return -EINVAL);
parent            409 lib/cib/cib_ops.c         target = find_xml_node(parent, object_name, FALSE);
parent            412 lib/cib/cib_ops.c         target = pcmk__xe_match(parent, object_name, XML_ATTR_ID, object_id);
parent            416 lib/cib/cib_ops.c         target = create_xml_node(parent, object_name);
parent            500 lib/cib/cib_ops.c add_cib_object(xmlNode * parent, xmlNode * new_obj)
parent            506 lib/cib/cib_ops.c     if ((parent == NULL) || (new_obj == NULL)) {
parent            522 lib/cib/cib_ops.c         equiv_node = find_xml_node(parent, object_name, FALSE);
parent            524 lib/cib/cib_ops.c         equiv_node = pcmk__xe_match(parent, object_name, XML_ATTR_ID,
parent            531 lib/cib/cib_ops.c     return update_cib_object(parent, new_obj);
parent            782 lib/cib/cib_ops.c                 xmlNode *parent = match;
parent            784 lib/cib/cib_ops.c                 while (parent && parent->type == XML_ELEMENT_NODE) {
parent            785 lib/cib/cib_ops.c                     const char *id = crm_element_value(parent, XML_ATTR_ID);
parent            790 lib/cib/cib_ops.c                                                      parent->name, id,
parent            793 lib/cib/cib_ops.c                         new_path = crm_strdup_printf("/%s%s", parent->name,
parent            798 lib/cib/cib_ops.c                     parent = parent->parent;
parent            805 lib/cib/cib_ops.c                 parent = create_xml_node(*answer, "xpath-query-path");
parent            806 lib/cib/cib_ops.c                 crm_xml_add(parent, XML_ATTR_ID, path);
parent            818 lib/cib/cib_ops.c             xmlNode *parent = match->parent;
parent            822 lib/cib/cib_ops.c                 add_node_copy(parent, input);
parent            662 lib/common/acl.c         xmlNode *parent = xml;
parent            697 lib/common/acl.c         while (parent && parent->_private) {
parent            698 lib/common/acl.c             xml_node_private_t *nodepriv = parent->_private;
parent            714 lib/common/acl.c                                             (parent != xml)? "Parent ": "",
parent            720 lib/common/acl.c             parent = parent->parent;
parent             25 lib/common/cib.c     const char *parent; // CIB element that this element is a child of
parent            137 lib/common/cib.c             return cib_sections[lpc].parent;
parent             88 lib/common/crmcommon_private.h void pcmk__xml_update(xmlNode *parent, xmlNode *target, xmlNode *update,
parent             96 lib/common/crmcommon_private.h void pcmk__xc_update(xmlNode *parent, xmlNode *target, xmlNode *update);
parent            189 lib/common/nvpair.c     xmlNode *parent = user_data;
parent            191 lib/common/nvpair.c     crm_xml_add(parent, pair->name, pair->value);
parent            833 lib/common/nvpair.c crm_create_nvpair_xml(xmlNode *parent, const char *id, const char *name,
parent            843 lib/common/nvpair.c     nvp = create_xml_node(parent, XML_CIB_TAG_NVPAIR);
parent            849 lib/common/nvpair.c         const char *parent_id = ID(parent);
parent            896 lib/common/nvpair.c xml2list(const xmlNode *parent)
parent            903 lib/common/nvpair.c     CRM_CHECK(parent != NULL, return nvpair_hash);
parent            905 lib/common/nvpair.c     nvpair_list = find_xml_node(parent, XML_TAG_ATTRS, FALSE);
parent            907 lib/common/nvpair.c         crm_trace("No attributes in %s", crm_element_name(parent));
parent            908 lib/common/nvpair.c         crm_log_xml_trace(parent, "No attributes for resource op");
parent            474 lib/common/operations.c crm_create_op_xml(xmlNode *parent, const char *prefix, const char *task,
parent            481 lib/common/operations.c     xml_op = create_xml_node(parent, XML_ATTR_OP);
parent            284 lib/common/output_xml.c     xmlNodePtr parent = NULL;
parent            289 lib/common/output_xml.c     parent = pcmk__output_create_xml_node(out, name, NULL);
parent            290 lib/common/output_xml.c     cdata_node = xmlNewCDataBlock(getDocPtr(parent), (pcmkXmlStr) buf, strlen(buf));
parent            291 lib/common/output_xml.c     xmlAddChild(parent, cdata_node);
parent            500 lib/common/output_xml.c pcmk__output_xml_push_parent(pcmk__output_t *out, xmlNodePtr parent) {
parent            504 lib/common/output_xml.c     CRM_ASSERT(parent != NULL);
parent            509 lib/common/output_xml.c     g_queue_push_tail(priv->parent_q, parent);
parent             31 lib/common/patchset.c static xmlNode *subtract_xml_comment(xmlNode *parent, xmlNode *left,
parent             95 lib/common/patchset.c         GString *xpath = pcmk__element_xpath(xml->parent);
parent            153 lib/common/patchset.c         change = create_xml_node(change->parent, XML_DIFF_RESULT);
parent            652 lib/common/patchset.c         subtract_xml_comment(target->parent, target, patch, &dummy);
parent            689 lib/common/patchset.c process_v1_additions(xmlNode *parent, xmlNode *target, xmlNode *patch)
parent            701 lib/common/patchset.c     } else if ((parent == NULL) && (target == NULL)) {
parent            712 lib/common/patchset.c         add_node_copy(parent, patch);
parent            723 lib/common/patchset.c         pcmk__xc_update(parent, target, patch);
parent            974 lib/common/patchset.c first_matching_xml_child(const xmlNode *parent, const char *name,
parent            979 lib/common/patchset.c     for (cIter = pcmk__xml_first_child(parent); cIter != NULL;
parent           1183 lib/common/patchset.c                 if ((match->parent != NULL) && (match->parent->last != NULL)) {
parent           1184 lib/common/patchset.c                     xmlAddNextSibling(match->parent->last, match);
parent           1275 lib/common/patchset.c                 CRM_ASSERT(match->parent != NULL);
parent           1276 lib/common/patchset.c                 match_child = match->parent->children;
parent           1287 lib/common/patchset.c                           (match_child? match_child : match->parent->last));
parent           1293 lib/common/patchset.c                     CRM_ASSERT(match->parent->last != NULL);
parent           1294 lib/common/patchset.c                     xmlAddNextSibling(match->parent->last, match);
parent           1439 lib/common/patchset.c subtract_xml_comment(xmlNode *parent, xmlNode *left, xmlNode *right,
parent           1450 lib/common/patchset.c         deleted = add_node_copy(parent, left);
parent           1460 lib/common/patchset.c subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right,
parent           1483 lib/common/patchset.c         return subtract_xml_comment(parent, left, right, changed);
parent           1492 lib/common/patchset.c         deleted = add_node_copy(parent, left);
parent           1514 lib/common/patchset.c     diff = create_xml_node(parent, name);
parent             96 lib/common/xml.c     for(; xml; xml = xml->parent) {
parent            165 lib/common/xml.c     xmlNode *parent = a->parent;
parent            170 lib/common/xml.c     mark_xml_node_dirty(parent);
parent            520 lib/common/xml.c pcmk__xe_match(const xmlNode *parent, const char *node_name,
parent            526 lib/common/xml.c     for (xmlNode *child = pcmk__xml_first_child(parent); child != NULL;
parent            540 lib/common/xml.c               crm_element_name(parent));
parent            727 lib/common/xml.c add_node_copy(xmlNode * parent, xmlNode * src_node)
parent            730 lib/common/xml.c     xmlDoc *doc = getDocPtr(parent);
parent            735 lib/common/xml.c     xmlAddChild(parent, child);
parent            741 lib/common/xml.c add_node_nocopy(xmlNode * parent, const char *name, xmlNode * child)
parent            743 lib/common/xml.c     add_node_copy(parent, child);
parent            749 lib/common/xml.c create_xml_node(xmlNode * parent, const char *name)
parent            759 lib/common/xml.c     if (parent == NULL) {
parent            765 lib/common/xml.c         doc = getDocPtr(parent);
parent            767 lib/common/xml.c         xmlAddChild(parent, node);
parent            774 lib/common/xml.c pcmk_create_xml_text_node(xmlNode * parent, const char *name, const char *content)
parent            776 lib/common/xml.c     xmlNode *node = create_xml_node(parent, name);
parent            786 lib/common/xml.c pcmk_create_html_node(xmlNode * parent, const char *element_name, const char *id,
parent            789 lib/common/xml.c     xmlNode *node = pcmk_create_xml_text_node(parent, element_name, text);
parent           2618 lib/common/xml.c pcmk__xc_update(xmlNode *parent, xmlNode *target, xmlNode *update)
parent           2624 lib/common/xml.c         target = pcmk__xc_match(parent, update, false);
parent           2628 lib/common/xml.c         add_node_copy(parent, update);
parent           2649 lib/common/xml.c pcmk__xml_update(xmlNode *parent, xmlNode *target, xmlNode *update,
parent           2665 lib/common/xml.c         pcmk__xc_update(parent, target, update);
parent           2679 lib/common/xml.c     CRM_CHECK(target != NULL || parent != NULL, return);
parent           2682 lib/common/xml.c         target = pcmk__xe_match(parent, object_name,
parent           2687 lib/common/xml.c         target = create_xml_node(parent, object_name);
parent           2816 lib/common/xml.c replace_xml_child(xmlNode * parent, xmlNode * child, xmlNode * update, gboolean delete_only)
parent           2850 lib/common/xml.c     if (can_delete && parent != NULL) {
parent           2898 lib/common/xml.c sorted_xml(xmlNode *input, xmlNode *parent, gboolean recursive)
parent           2910 lib/common/xml.c     result = create_xml_node(parent, name);
parent           2930 lib/common/xml.c first_named_child(const xmlNode *parent, const char *name)
parent           2934 lib/common/xml.c     for (match = pcmk__xe_first_child(parent); match != NULL;
parent           3140 lib/common/xml.c find_entity(xmlNode *parent, const char *node_name, const char *id)
parent           3142 lib/common/xml.c     return pcmk__xe_match(parent, node_name,
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            283 lib/common/xpath.c     const xmlNode *parent = NULL;
parent            291 lib/common/xpath.c     parent = xml->parent;
parent            292 lib/common/xpath.c     xpath = pcmk__element_xpath(parent);
parent            298 lib/common/xpath.c     if (parent == NULL) {
parent            300 lib/common/xpath.c     } else if (parent->parent == NULL) {
parent            150 lib/pacemaker/pcmk_acl.c             if (!pcmk__check_acl(i_node->parent,
parent            165 lib/pacemaker/pcmk_acl.c             if (!pcmk__check_acl(i_node->parent, (const char *) i_node->name, pcmk__xf_acl_read))
parent            169 lib/pacemaker/pcmk_acl.c             else if (!pcmk__check_acl(i_node->parent, (const char *) i_node->name, pcmk__xf_acl_write))
parent            467 lib/pacemaker/pcmk_graph_consumer.c unpack_action(pcmk__graph_synapse_t *parent, xmlNode *xml_action)
parent            508 lib/pacemaker/pcmk_graph_consumer.c     action->synapse = parent;
parent            353 lib/pacemaker/pcmk_graph_producer.c         pe_resource_t *parent = action->rsc;
parent            355 lib/pacemaker/pcmk_graph_producer.c         while (parent != NULL) {
parent            356 lib/pacemaker/pcmk_graph_producer.c             parent->cmds->add_graph_meta(parent, args_xml);
parent            357 lib/pacemaker/pcmk_graph_producer.c             parent = parent->parent;
parent            387 lib/pacemaker/pcmk_graph_producer.c create_graph_action(xmlNode *parent, pe_action_t *action, bool skip_details,
parent            402 lib/pacemaker/pcmk_graph_producer.c         action_xml = create_xml_node(parent,
parent            410 lib/pacemaker/pcmk_graph_producer.c         action_xml = create_xml_node(parent, XML_GRAPH_TAG_CRM_EVENT);
parent            414 lib/pacemaker/pcmk_graph_producer.c         action_xml = create_xml_node(parent, XML_GRAPH_TAG_CRM_EVENT);
parent            422 lib/pacemaker/pcmk_graph_producer.c         action_xml = create_xml_node(parent, XML_GRAPH_TAG_PSEUDO_EVENT);
parent            426 lib/pacemaker/pcmk_graph_producer.c         action_xml = create_xml_node(parent, XML_GRAPH_TAG_RSC_OP);
parent            928 lib/pacemaker/pcmk_output.c add_digest_xml(xmlNode *parent, const char *type, const char *digest,
parent            932 lib/pacemaker/pcmk_output.c         xmlNodePtr digest_xml = create_xml_node(parent, "digest");
parent            145 lib/pacemaker/pcmk_sched_actions.c             && ((first_rsc->parent == NULL)
parent            147 lib/pacemaker/pcmk_sched_actions.c                     && (first_rsc->parent->variant == pe_container)))) {
parent            929 lib/pacemaker/pcmk_sched_actions.c         if ((then->rsc != NULL) && (then->rsc->parent != NULL)) {
parent           1114 lib/pacemaker/pcmk_sched_actions.c pcmk__create_history_xml(xmlNode *parent, lrmd_event_data_t *op,
parent           1195 lib/pacemaker/pcmk_sched_actions.c     xml_op = pcmk__xe_match(parent, XML_LRM_TAG_RSC_OP, XML_ATTR_ID, op_id);
parent           1197 lib/pacemaker/pcmk_sched_actions.c         xml_op = create_xml_node(parent, XML_LRM_TAG_RSC_OP);
parent            143 lib/pacemaker/pcmk_sched_bundle.c             pe__set_resource_flags(replica->child->parent, pe_rsc_allocating);
parent            147 lib/pacemaker/pcmk_sched_bundle.c             pe__clear_resource_flags(replica->child->parent,
parent             99 lib/pacemaker/pcmk_sched_clone.c     append_parent_colocation(rsc->parent, rsc, all_coloc);
parent            134 lib/pacemaker/pcmk_sched_clone.c                              chosen->details->id, rsc->parent->id,
parent            135 lib/pacemaker/pcmk_sched_clone.c                              g_hash_table_size(rsc->parent->allowed_nodes));
parent            859 lib/pacemaker/pcmk_sched_colocation.c     if (rsc->parent != NULL) {
parent            860 lib/pacemaker/pcmk_sched_colocation.c         rsc = rsc->parent; // Bundle
parent            942 lib/pacemaker/pcmk_sched_colocation.c         && (dependent->parent != NULL)
parent            943 lib/pacemaker/pcmk_sched_colocation.c         && pcmk_is_set(dependent->parent->flags, pe_rsc_promotable)
parent            111 lib/pacemaker/pcmk_sched_constraints.c         pe_resource_t *parent = rIter->data;
parent            112 lib/pacemaker/pcmk_sched_constraints.c         pe_resource_t *match = parent->fns->find_rsc(parent, id, NULL,
parent             35 lib/pacemaker/pcmk_sched_fencing.c               && pe_rsc_is_anon_clone(rsc->parent)
parent             36 lib/pacemaker/pcmk_sched_fencing.c               && pe_hash_table_lookup(rsc->parent->known_on, node->details->id)) {
parent            250 lib/pacemaker/pcmk_sched_group.c         pcmk__order_resource_actions(member->parent, RSC_DEMOTE,
parent            253 lib/pacemaker/pcmk_sched_group.c                                      member->parent, RSC_DEMOTED,
parent            258 lib/pacemaker/pcmk_sched_group.c                                      member->parent, RSC_PROMOTED,
parent            262 lib/pacemaker/pcmk_sched_group.c         pcmk__order_resource_actions(member->parent, RSC_PROMOTE,
parent            268 lib/pacemaker/pcmk_sched_group.c     pcmk__order_stops(member->parent, member, down_flags);
parent            269 lib/pacemaker/pcmk_sched_group.c     pcmk__order_resource_actions(member, RSC_STOP, member->parent, RSC_STOPPED,
parent            273 lib/pacemaker/pcmk_sched_group.c     pcmk__order_starts(member->parent, member, pe_order_implies_first_printed);
parent            274 lib/pacemaker/pcmk_sched_group.c     pcmk__order_resource_actions(member, RSC_START, member->parent, RSC_STARTED,
parent            280 lib/pacemaker/pcmk_sched_group.c         pcmk__order_starts(member->parent, member,
parent            285 lib/pacemaker/pcmk_sched_group.c             pcmk__order_resource_actions(member->parent, RSC_PROMOTE, member,
parent            293 lib/pacemaker/pcmk_sched_group.c         pcmk__order_starts(member->parent, member, pe_order_none);
parent            295 lib/pacemaker/pcmk_sched_group.c             pcmk__order_resource_actions(member->parent, RSC_PROMOTE, member,
parent            685 lib/pacemaker/pcmk_sched_group.c         || pe_rsc_is_clone(rsc->parent)) {
parent            727 lib/pacemaker/pcmk_sched_group.c         || pe_rsc_is_clone(rsc->parent)) {
parent            346 lib/pacemaker/pcmk_sched_nodes.c     } else if (rsc->parent == NULL) {
parent            349 lib/pacemaker/pcmk_sched_nodes.c         allowed_nodes = rsc->parent->allowed_nodes;
parent            211 lib/pacemaker/pcmk_sched_primitive.c         if (!pe_rsc_is_unique_clone(rsc->parent)
parent            391 lib/pacemaker/pcmk_sched_primitive.c     if ((rsc->parent != NULL)
parent            392 lib/pacemaker/pcmk_sched_primitive.c         && !pcmk_is_set(rsc->parent->flags, pe_rsc_allocating)) {
parent            394 lib/pacemaker/pcmk_sched_primitive.c                      rsc->id, rsc->parent->id);
parent            395 lib/pacemaker/pcmk_sched_primitive.c         rsc->parent->cmds->assign(rsc->parent, prefer);
parent           1356 lib/pacemaker/pcmk_sched_primitive.c     const pe_resource_t *parent = NULL;
parent           1383 lib/pacemaker/pcmk_sched_primitive.c     for (parent = rsc; parent != NULL; parent = parent->parent) {
parent           1384 lib/pacemaker/pcmk_sched_primitive.c         if (parent->container != NULL) {
parent           1386 lib/pacemaker/pcmk_sched_primitive.c                         parent->container->id);
parent            557 lib/pacemaker/pcmk_sched_probes.c                 || (probe->rsc->parent == after->rsc)
parent            560 lib/pacemaker/pcmk_sched_probes.c                 || (after->rsc != after_wrapper->action->rsc->parent)) {
parent            158 lib/pacemaker/pcmk_sched_promotable.c     pe_resource_t *parent = uber_parent(rsc);
parent            201 lib/pacemaker/pcmk_sched_promotable.c     local_node = pe_hash_table_lookup(parent->allowed_nodes, node->details->id);
parent            211 lib/pacemaker/pcmk_sched_promotable.c                      rsc->id, parent->id, pe__node_name(node));
parent            215 lib/pacemaker/pcmk_sched_promotable.c     } else if ((local_node->count >= pe__clone_promoted_node_max(parent))
parent            560 lib/pacemaker/pcmk_sched_promotable.c     pe_resource_t *parent = uber_parent(rsc);
parent            568 lib/pacemaker/pcmk_sched_promotable.c         active = find_active_anon_instance(parent, id, node);
parent            577 lib/pacemaker/pcmk_sched_promotable.c         if ((active == NULL) && anonymous_known_on(parent, id, node)) {
parent            741 lib/pacemaker/pcmk_sched_resource.c     for (iter = rsc->parent->rsc_cons; iter != NULL; iter = iter->next) {
parent            748 lib/pacemaker/pcmk_sched_resource.c     for (iter = rsc->parent->rsc_cons_lhs; iter != NULL; iter = iter->next) {
parent            787 lib/pacemaker/pcmk_sched_resource.c     CRM_ASSERT((instance1 != NULL) && (instance1->parent != NULL)
parent            788 lib/pacemaker/pcmk_sched_resource.c                && (instance2 != NULL) && (instance2->parent != NULL)
parent            136 lib/pengine/bundle.c create_ip_resource(pe_resource_t *parent, pe__bundle_variant_data_t *data,
parent            171 lib/pengine/bundle.c         if (pe__unpack_resource(xml_ip, &replica->ip, parent,
parent            172 lib/pengine/bundle.c                                 parent->cluster) != pcmk_rc_ok) {
parent            176 lib/pengine/bundle.c         parent->children = g_list_append(parent->children, replica->ip);
parent            195 lib/pengine/bundle.c create_container_resource(pe_resource_t *parent,
parent            421 lib/pengine/bundle.c     if (pe__unpack_resource(xml_container, &replica->container, parent,
parent            422 lib/pengine/bundle.c                             parent->cluster) != pcmk_rc_ok) {
parent            425 lib/pengine/bundle.c     parent->children = g_list_append(parent->children, replica->container);
parent            451 lib/pengine/bundle.c create_remote_resource(pe_resource_t *parent, pe__bundle_variant_data_t *data,
parent            463 lib/pengine/bundle.c         if (pe_find_resource(parent->cluster->resources, id) != NULL) {
parent            469 lib/pengine/bundle.c             CRM_ASSERT(pe_find_resource(parent->cluster->resources,
parent            506 lib/pengine/bundle.c         node = pe_find_node(parent->cluster->nodes, uname);
parent            509 lib/pengine/bundle.c                                   parent->cluster);
parent            532 lib/pengine/bundle.c         g_list_foreach(parent->cluster->resources, (GFunc) disallow_node,
parent            551 lib/pengine/bundle.c             g_hash_table_insert(replica->child->parent->allowed_nodes,
parent            554 lib/pengine/bundle.c         if (pe__unpack_resource(xml_remote, &replica->remote, parent,
parent            555 lib/pengine/bundle.c                                 parent->cluster) != pcmk_rc_ok) {
parent            587 lib/pengine/bundle.c         parent->children = g_list_append(parent->children, replica->remote);
parent            593 lib/pengine/bundle.c create_replica_resources(pe_resource_t *parent, pe__bundle_variant_data_t *data,
parent            598 lib/pengine/bundle.c     rc = create_container_resource(parent, data, replica);
parent            603 lib/pengine/bundle.c     rc = create_ip_resource(parent, data, replica);
parent            608 lib/pengine/bundle.c     rc = create_remote_resource(parent, data, replica);
parent            672 lib/pengine/bundle.c     while (top->parent != NULL) {
parent            673 lib/pengine/bundle.c         top = top->parent;
parent            105 lib/pengine/complex.c     pe_resource_t *p = rsc->parent;
parent            117 lib/pengine/complex.c         p = p->parent; 
parent            176 lib/pengine/complex.c     if (rsc->parent != NULL) {
parent            186 lib/pengine/complex.c     if (rsc->parent) {
parent            187 lib/pengine/complex.c         g_hash_table_foreach(rsc->parent->meta, dup_attr, meta_hash);
parent            212 lib/pengine/complex.c     if (rsc->parent != NULL) {
parent            213 lib/pengine/complex.c         get_rsc_attributes(meta_hash, rsc->parent, node, data_set);
parent            563 lib/pengine/complex.c                     pe_resource_t *parent, pe_working_set_t *data_set)
parent            620 lib/pengine/complex.c     (*rsc)->parent = parent;
parent            897 lib/pengine/complex.c     pe_resource_t *parent = child;
parent            899 lib/pengine/complex.c     if (parent == NULL || rsc == NULL) {
parent            902 lib/pengine/complex.c     while (parent->parent != NULL) {
parent            903 lib/pengine/complex.c         if (parent->parent == rsc) {
parent            906 lib/pengine/complex.c         parent = parent->parent;
parent            914 lib/pengine/complex.c     pe_resource_t *parent = rsc;
parent            916 lib/pengine/complex.c     if (parent == NULL) {
parent            919 lib/pengine/complex.c     while (parent->parent != NULL && parent->parent->variant != pe_container) {
parent            920 lib/pengine/complex.c         parent = parent->parent;
parent            922 lib/pengine/complex.c     return parent;
parent            949 lib/pengine/complex.c     if ((rsc->parent == NULL) && pcmk_is_set(rsc->flags, pe_rsc_orphan)) {
parent            118 lib/pengine/native.c         pe_resource_t *p = rsc->parent;
parent            126 lib/pengine/native.c             p = p->parent;
parent            156 lib/pengine/native.c                 if (rsc->parent
parent            157 lib/pengine/native.c                     && (rsc->parent->variant == pe_group || rsc->parent->variant == pe_container)
parent            158 lib/pengine/native.c                     && rsc->parent->recovery_type == recovery_block) {
parent            159 lib/pengine/native.c                     GList *gIter = rsc->parent->children;
parent            184 lib/pengine/native.c     if (rsc->parent != NULL) {
parent            185 lib/pengine/native.c         native_add_running(rsc->parent, node, data_set, FALSE);
parent            200 lib/pengine/native.c     pe_resource_t *parent = uber_parent(rsc);
parent            208 lib/pengine/native.c         && pcmk_is_set(rsc->flags, pe_rsc_unique) && pe_rsc_is_clone(parent)) {
parent            215 lib/pengine/native.c         pe__force_anon(standard, parent, rsc->id, data_set);
parent            222 lib/pengine/native.c         recursive_clear_unique(parent, NULL);
parent            226 lib/pengine/native.c         && pcmk_is_set(parent->flags, pe_rsc_promotable)) {
parent           1381 lib/pengine/native.c     } else if (check_parent && rsc->parent) {
parent           1385 lib/pengine/native.c             return up->parent->fns->is_filtered(up->parent, only_rsc, FALSE);
parent           1462 lib/pengine/pe_output.c status_node(pe_node_t *node, xmlNodePtr parent, uint32_t show_opts)
parent           1468 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "online", " online");
parent           1470 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "offline", " OFFLINE");
parent           1475 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "standby",
parent           1479 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "standby",
parent           1482 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "standby",
parent           1485 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "standby", " (in standby)");
parent           1490 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "maint",
parent           1496 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "health_red",
parent           1499 lib/pengine/pe_output.c         pcmk_create_html_node(parent, "span", NULL, "health_yellow",
parent           1508 lib/pengine/pe_output.c             pcmk_create_html_node(parent, "span", NULL, NULL, buf);
parent             54 lib/pengine/pe_status_private.h                              pe_resource_t *parent, pe_working_set_t *data_set);
parent            156 lib/pengine/remote.c pe_create_remote_xml(xmlNode *parent, const char *uname,
parent            164 lib/pengine/remote.c     remote = create_xml_node(parent, XML_CIB_TAG_RESOURCE);
parent            402 lib/pengine/status.c         pe_resource_t *parent = rIter->data;
parent            405 lib/pengine/status.c             parent->fns->find_rsc(parent, id, NULL, flags);
parent            456 lib/pengine/unpack.c expand_remote_rsc_meta(xmlNode *xml_obj, xmlNode *parent, pe_working_set_t *data)
parent            506 lib/pengine/unpack.c     pe_create_remote_xml(parent, remote_name, container_id,
parent           1729 lib/pengine/unpack.c create_anonymous_orphan(pe_resource_t *parent, const char *rsc_id,
parent           1732 lib/pengine/unpack.c     pe_resource_t *top = pe__create_clone_child(parent, data_set);
parent           1737 lib/pengine/unpack.c     pe_rsc_debug(parent, "Created orphan %s for %s: %s on %s",
parent           1738 lib/pengine/unpack.c                  top->id, parent->id, rsc_id, pe__node_name(node));
parent           1757 lib/pengine/unpack.c find_anonymous_clone(pe_working_set_t * data_set, pe_node_t * node, pe_resource_t * parent,
parent           1765 lib/pengine/unpack.c     CRM_ASSERT(parent != NULL);
parent           1766 lib/pengine/unpack.c     CRM_ASSERT(pe_rsc_is_clone(parent));
parent           1767 lib/pengine/unpack.c     CRM_ASSERT(!pcmk_is_set(parent->flags, pe_rsc_unique));
parent           1770 lib/pengine/unpack.c     pe_rsc_trace(parent, "Looking for %s on %s in %s",
parent           1771 lib/pengine/unpack.c                  rsc_id, pe__node_name(node), parent->id);
parent           1772 lib/pengine/unpack.c     for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) {
parent           1807 lib/pengine/unpack.c                 rsc = parent->fns->find_rsc(child, rsc_id, NULL, pe_find_clone);
parent           1819 lib/pengine/unpack.c                                    parent->id, pe__node_name(node));
parent           1823 lib/pengine/unpack.c                         pe_rsc_trace(parent, "Resource %s, active", rsc->id);
parent           1830 lib/pengine/unpack.c             pe_rsc_trace(parent, "Resource %s, skip inactive", child->id);
parent           1834 lib/pengine/unpack.c                 inactive_instance = parent->fns->find_rsc(child, rsc_id, NULL,
parent           1849 lib/pengine/unpack.c         pe_rsc_trace(parent, "Resource %s, empty slot", inactive_instance->id);
parent           1868 lib/pengine/unpack.c         && !pe__is_universal_clone(parent, data_set)) {
parent           1874 lib/pengine/unpack.c         rsc = create_anonymous_orphan(parent, rsc_id, node, data_set);
parent           1875 lib/pengine/unpack.c         pe_rsc_trace(parent, "Resource %s, orphan", rsc->id);
parent           1885 lib/pengine/unpack.c     pe_resource_t *parent = NULL;
parent           1900 lib/pengine/unpack.c             parent = uber_parent(clone0);
parent           1901 lib/pengine/unpack.c             crm_trace("%s found as %s (%s)", rsc_id, clone0_id, parent->id);
parent           1914 lib/pengine/unpack.c         parent = uber_parent(rsc);
parent           1917 lib/pengine/unpack.c     if (pe_rsc_is_anon_clone(parent)) {
parent           1919 lib/pengine/unpack.c         if (pe_rsc_is_bundled(parent)) {
parent           1920 lib/pengine/unpack.c             rsc = pe__find_bundle_replica(parent->parent, node);
parent           1924 lib/pengine/unpack.c             rsc = find_anonymous_clone(data_set, node, parent, base);
parent           1996 lib/pengine/unpack.c             iter = iter->parent;
parent           3310 lib/pengine/unpack.c         if (fail_rsc->parent) {
parent           3311 lib/pengine/unpack.c             pe_resource_t *parent = uber_parent(fail_rsc);
parent           3313 lib/pengine/unpack.c             if (pe_rsc_is_clone(parent)
parent           3314 lib/pengine/unpack.c                 && !pcmk_is_set(parent->flags, pe_rsc_unique)) {
parent           3318 lib/pengine/unpack.c                 fail_rsc = parent;
parent           3923 lib/pengine/unpack.c     pe_resource_t *parent = rsc;
parent           3953 lib/pengine/unpack.c         parent = uber_parent(rsc);
parent           4036 lib/pengine/unpack.c         resource_location(parent, node, -INFINITY, "masked-probe-failure", data_set);
parent           4103 lib/pengine/unpack.c             resource_location(parent, node, -INFINITY, "hard-error", data_set);
parent           4167 lib/pengine/unpack.c                        parent->id, pe__node_name(node),
parent           4171 lib/pengine/unpack.c             resource_location(parent, node, -INFINITY, "hard-error", data_set);
parent           4176 lib/pengine/unpack.c                     parent->id, services_ocf_exitcode_str(rc),
parent           4179 lib/pengine/unpack.c             resource_location(parent, NULL, -INFINITY, "fatal-error", data_set);
parent            785 lib/pengine/utils.c             (rsc->parent && pcmk__str_in_list(rsc_printable_id(rsc->parent), filter, pcmk__str_star_matches))) {
parent            861 lib/pengine/utils.c     pe_resource_t *parent = uber_parent(rsc);
parent            866 lib/pengine/utils.c     } else if (parent->variant == pe_clone) {
parent            867 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           1747 tools/crm_mon.c         n = n->parent;
parent           1777 tools/crm_resource.c         if (strchr(options.rsc_id, ':') != NULL && pe_rsc_is_clone(rsc->parent) &&
parent             83 tools/crm_resource_print.c               rsc->clone_name ? rsc->clone_name : rsc->id, rsc->parent ? rsc->parent->id : "NA",
parent            455 tools/crm_resource_print.c     pe_resource_t *parent = uber_parent(checks->rsc);
parent            465 tools/crm_resource_print.c                        parent->id);
parent            470 tools/crm_resource_print.c                        parent->id);
parent            475 tools/crm_resource_print.c                        parent->id);
parent            480 tools/crm_resource_print.c                        parent->id, checks->lock_node);
parent            487 tools/crm_resource_print.c                        parent->id,
parent            501 tools/crm_resource_print.c     pe_resource_t *parent = uber_parent(checks->rsc);
parent            504 tools/crm_resource_print.c                                                    "id", parent->id,
parent             45 tools/crm_resource_runtime.c     pe_resource_t *parent = uber_parent(rsc);
parent             51 tools/crm_resource_runtime.c     } else if (pe_rsc_is_clone(parent)
parent             57 tools/crm_resource_runtime.c         retval = build_node_info_list(parent);
parent            212 tools/crm_resource_runtime.c     if(rsc->parent && pe_clone == rsc->parent->variant) {
parent            220 tools/crm_resource_runtime.c             rsc = rsc->parent;
parent            225 tools/crm_resource_runtime.c     } else if(rsc->parent == NULL && rsc->children && pe_clone == rsc->variant) {
parent           1347 tools/crm_resource_runtime.c     pe_resource_t *parent = uber_parent(rsc);
parent           1357 tools/crm_resource_runtime.c         rsc = parent->parent;
parent           1362 tools/crm_resource_runtime.c     if (pe_rsc_is_clone(parent) && !running) {
parent           1363 tools/crm_resource_runtime.c         if (pe_rsc_is_unique_clone(parent)) {
parent           1369 tools/crm_resource_runtime.c         rsc = parent->fns->find_rsc(parent, lookup_id, node, pe_find_any|pe_find_current);
parent           1385 tools/crm_resource_runtime.c     if (pe_rsc_is_unique_clone(parent)) {
parent           1394 tools/crm_resource_runtime.c         } else if (pe_rsc_is_clone(parent)) {
parent           1397 tools/crm_resource_runtime.c             lookup_id = strdup(parent->id);
parent           1985 tools/crm_resource_runtime.c     rid = pe_rsc_is_anon_clone(rsc->parent)? requested_name : rsc->id;