parent 112 attrd/commands.c xmlNode *parent, const char *name, const char *set, const char *uuid, unsigned int timeout_ms, const char *user, parent 115 attrd/commands.c xmlNode *xml = create_xml_node(parent, __FUNCTION__); parent 1007 attrd/commands.c build_update_element(xmlNode *parent, attribute_t *a, const char *nodeid, const char *value) parent 1012 attrd/commands.c xml_obj = create_xml_node(parent, XML_CIB_TAG_STATE); parent 382 cib/messages.c delete_cib_object(xmlNode * parent, xmlNode * delete_spec) parent 399 cib/messages.c } else if (parent == NULL) { parent 404 cib/messages.c equiv_node = find_xml_node(parent, object_name, FALSE); parent 407 cib/messages.c equiv_node = find_entity(parent, object_name, object_id); parent 90 crmd/crmd_utils.h xmlNode *parent, const char *source); parent 659 crmd/lrm.c build_operation_update(xmlNode * parent, lrmd_rsc_info_t * rsc, lrmd_event_data_t * op, parent 688 crmd/lrm.c xml_op = create_operation_update(parent, op, caller_version, target_rc, fsa_our_uname, src, LOG_DEBUG); parent 143 crmd/membership.c create_node_state_update(crm_node_t *node, int flags, xmlNode *parent, parent 154 crmd/membership.c node_state = create_xml_node(parent, XML_CIB_TAG_STATE); parent 51 crmd/te_callbacks.c node = node->parent; parent 573 crmd/te_utils.c for(search = reason; search; search = search->parent) { parent 582 crmd/te_utils.c for(search = reason; search; search = search->parent) { parent 613 fencing/main.c node_t *parent = NULL; parent 646 fencing/main.c if (rsc->parent && (rsc->parent->variant == pe_group)) { parent 647 fencing/main.c parent = our_node_allowed_for(rsc->parent); parent 662 fencing/main.c } else if(node->weight < 0 || (parent && parent->weight < 0)) { parent 664 fencing/main.c char *score = score2char((node->weight < 0) ? node->weight : parent->weight); parent 400 include/crm/cluster/internal.h xmlNode *convert_ha_message(xmlNode * parent, HA_Message * msg, const char *field); parent 132 include/crm/common/util.h xmlNode *crm_create_op_xml(xmlNode *parent, const char *prefix, parent 56 include/crm/common/xml.h GHashTable *xml2list(xmlNode * parent); parent 58 include/crm/common/xml.h xmlNode *crm_create_nvpair_xml(xmlNode *parent, const char *id, parent 88 include/crm/common/xml.h xmlNode *create_xml_node(xmlNode * parent, const char *name); parent 147 include/crm/common/xml.h int add_node_nocopy(xmlNode * parent, const char *name, xmlNode * child); parent 174 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right, parent 188 include/crm/common/xml.h xmlNode *find_entity(xmlNode * parent, const char *node_name, const char *id); parent 192 include/crm/common/xml.h gboolean replace_xml_child(xmlNode * parent, xmlNode * child, xmlNode * update, parent 296 include/crm/common/xml.h __xml_first_child(xmlNode * parent) parent 300 include/crm/common/xml.h if (parent) { parent 301 include/crm/common/xml.h child = parent->children; parent 322 include/crm/common/xml.h __xml_first_child_element(xmlNode * parent) parent 326 include/crm/common/xml.h if (parent) { parent 327 include/crm/common/xml.h child = parent->children; parent 353 include/crm/common/xml.h xmlNode *first_named_child(xmlNode * parent, const char *name); parent 356 include/crm/common/xml.h xmlNode *sorted_xml(xmlNode * input, xmlNode * parent, gboolean recursive); parent 167 include/crm/compatibility.h # define xml_child_iter(parent, child, code) do { \ parent 168 include/crm/compatibility.h if(parent != NULL) { \ parent 170 include/crm/compatibility.h xmlNode *__crm_xml_iter = parent->children; \ parent 181 include/crm/compatibility.h # define xml_child_iter_filter(parent, child, filter, code) do { \ parent 182 include/crm/compatibility.h if(parent != NULL) { \ parent 184 include/crm/compatibility.h xmlNode *__crm_xml_iter = parent->children; \ parent 198 include/crm/compatibility.h # define xml_prop_iter(parent, prop_name, prop_value, code) do { \ parent 199 include/crm/compatibility.h if(parent != NULL) { \ parent 200 include/crm/compatibility.h xmlAttrPtr prop_iter = parent->properties; \ parent 205 include/crm/compatibility.h prop_value = crm_element_value(parent, prop_name); \ parent 214 include/crm/compatibility.h # define xml_prop_name_iter(parent, prop_name, code) do { \ parent 215 include/crm/compatibility.h if(parent != NULL) { \ parent 216 include/crm/compatibility.h xmlAttrPtr prop_iter = parent->properties; \ parent 228 include/crm/compatibility.h # define zap_xml_from_parent(parent, xml_obj) free_xml(xml_obj); xml_obj = NULL parent 238 include/crm/compatibility.h free_xml_from_parent(xmlNode * parent, xmlNode * a_node) parent 251 include/crm/compatibility.h # define slist_destroy(child_type, child, parent, a) do { \ parent 252 include/crm/compatibility.h GListPtr __crm_iter_head = parent; \ parent 259 include/crm/compatibility.h g_list_free(parent); \ parent 44 include/crm/pengine/complex.h resource_t *(*find_rsc) (resource_t * parent, const char *search, node_t * node, int flags); parent 106 include/crm/pengine/internal.h gboolean common_unpack(xmlNode * xml_obj, resource_t ** rsc, resource_t * parent, parent 29 include/crm/pengine/remote.h xmlNode *pe_create_remote_xml(xmlNode *parent, const char *uname, parent 263 include/crm/pengine/status.h resource_t *parent; parent 153 include/crm_internal.h xmlNode *create_operation_update(xmlNode *parent, lrmd_event_data_t *event, parent 389 lib/cib/cib_ops.c update_cib_object(xmlNode * parent, xmlNode * update) parent 399 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 = find_entity(parent, object_name, object_id); parent 416 lib/cib/cib_ops.c target = create_xml_node(parent, object_name); parent 484 lib/cib/cib_ops.c add_cib_object(xmlNode * parent, xmlNode * new_obj) parent 501 lib/cib/cib_ops.c } else if (parent == NULL) { parent 506 lib/cib/cib_ops.c equiv_node = find_xml_node(parent, object_name, FALSE); parent 509 lib/cib/cib_ops.c equiv_node = find_entity(parent, object_name, object_id); parent 519 lib/cib/cib_ops.c result = update_cib_object(parent, new_obj); parent 769 lib/cib/cib_ops.c xmlNode *parent = match; parent 771 lib/cib/cib_ops.c while (parent && parent->type == XML_ELEMENT_NODE) { parent 774 lib/cib/cib_ops.c const char *id = crm_element_value(parent, XML_ATTR_ID); parent 776 lib/cib/cib_ops.c extra += strlen((const char *)parent->name); parent 788 lib/cib/cib_ops.c snprintf(new_path, path_len + 1, "/%s[@id='%s']%s", parent->name, id, parent 791 lib/cib/cib_ops.c snprintf(new_path, path_len + 1, "/%s%s", parent->name, path ? path : ""); parent 795 lib/cib/cib_ops.c parent = parent->parent; parent 802 lib/cib/cib_ops.c parent = create_xml_node(*answer, "xpath-query-path"); parent 803 lib/cib/cib_ops.c crm_xml_add(parent, XML_ATTR_ID, path); parent 814 lib/cib/cib_ops.c xmlNode *parent = match->parent; parent 818 lib/cib/cib_ops.c add_node_copy(parent, input); parent 37 lib/cib/cib_utils.c const char *parent; parent 223 lib/cib/cib_utils.c return known_paths[lpc].parent; parent 44 lib/cluster/heartbeat.c convert_ha_field(xmlNode * parent, void *msg_v, int lpc) parent 59 lib/cluster/heartbeat.c CRM_CHECK(parent != NULL, return); parent 67 lib/cluster/heartbeat.c convert_ha_message(parent, msg->values[lpc], name); parent 71 lib/cluster/heartbeat.c convert_ha_message(parent, cl_get_struct(msg, name), name); parent 79 lib/cluster/heartbeat.c crm_xml_add(parent, name, value); parent 90 lib/cluster/heartbeat.c add_node_nocopy(parent, NULL, xml); parent 140 lib/cluster/heartbeat.c add_node_copy(parent, xml); parent 151 lib/cluster/heartbeat.c convert_ha_message(xmlNode * parent, HA_Message * msg, const char *field) parent 158 lib/cluster/heartbeat.c return parent); parent 164 lib/cluster/heartbeat.c } else if (parent && safe_str_neq(field, tag)) { parent 167 lib/cluster/heartbeat.c crm_element_name(parent), tag); parent 168 lib/cluster/heartbeat.c parent = create_xml_node(parent, field); parent 171 lib/cluster/heartbeat.c if (parent == NULL) { parent 172 lib/cluster/heartbeat.c parent = create_xml_node(NULL, tag); parent 173 lib/cluster/heartbeat.c child = parent; parent 176 lib/cluster/heartbeat.c child = create_xml_node(parent, tag); parent 183 lib/cluster/heartbeat.c return parent; parent 187 lib/cluster/heartbeat.c add_ha_nocopy(HA_Message * parent, HA_Message * child, const char *field) parent 189 lib/cluster/heartbeat.c int next = parent->nfields; parent 191 lib/cluster/heartbeat.c if (parent->nfields >= parent->nalloc && ha_msg_expand(parent) != HA_OK) { parent 196 lib/cluster/heartbeat.c parent->names[next] = strdup(field); parent 197 lib/cluster/heartbeat.c parent->nlens[next] = strlen(field); parent 198 lib/cluster/heartbeat.c parent->values[next] = child; parent 199 lib/cluster/heartbeat.c parent->vlens[next] = sizeof(HA_Message); parent 200 lib/cluster/heartbeat.c parent->types[next] = FT_UNCOMPRESS; parent 201 lib/cluster/heartbeat.c parent->nfields++; parent 205 lib/cluster/heartbeat.c convert_xml_message_struct(HA_Message * parent, xmlNode * src_node, const char *field) parent 230 lib/cluster/heartbeat.c if (parent == NULL) { parent 242 lib/cluster/heartbeat.c ha_msg_addstruct_compress(parent, field, holder); parent 246 lib/cluster/heartbeat.c add_ha_nocopy(parent, result, (const char *)src_node->name); parent 233 lib/common/logging.c struct stat parent; parent 260 lib/common/logging.c rc = stat(parent_dir, &parent); parent 439 lib/common/operations.c crm_create_op_xml(xmlNode *parent, const char *prefix, const char *task, parent 446 lib/common/operations.c xml_op = create_xml_node(parent, XML_ATTR_OP); parent 457 lib/common/operations.c create_operation_update(xmlNode * parent, lrmd_event_data_t * op, const char * caller_version, parent 536 lib/common/operations.c xml_op = find_entity(parent, XML_LRM_TAG_RSC_OP, op_id); parent 538 lib/common/operations.c xml_op = create_xml_node(parent, XML_LRM_TAG_RSC_OP); parent 107 lib/common/xml.c static xmlNode *subtract_xml_comment(xmlNode * parent, xmlNode * left, xmlNode * right, gboolean * changed); parent 109 lib/common/xml.c static int add_xml_comment(xmlNode * parent, xmlNode * target, xmlNode * update); parent 164 lib/common/xml.c for(; xml; xml = xml->parent) { parent 232 lib/common/xml.c xmlNode *parent = a->parent; parent 241 lib/common/xml.c __xml_node_dirty(parent); parent 250 lib/common/xml.c xmlNode * xml_node, xmlNode * parent); parent 252 lib/common/xml.c int add_xml_object(xmlNode * parent, xmlNode * target, xmlNode * update, gboolean as_diff); parent 985 lib/common/xml.c if(__get_prefix(NULL, xml->parent, buffer, offset) > 0) { parent 1038 lib/common/xml.c change = create_xml_node(change->parent, XML_DIFF_RESULT); parent 1625 lib/common/xml.c subtract_xml_comment(target->parent, target, patch, &dummy); parent 1665 lib/common/xml.c __add_xml_object(xmlNode * parent, xmlNode * target, xmlNode * patch) parent 1677 lib/common/xml.c } else if (parent == NULL && target == NULL) { parent 1689 lib/common/xml.c add_node_copy(parent, patch); parent 1700 lib/common/xml.c add_xml_comment(parent, target, patch); parent 1922 lib/common/xml.c __first_xml_child_match(xmlNode *parent, const char *name, const char *id, int position) parent 1926 lib/common/xml.c for (cIter = __xml_first_child(parent); cIter != NULL; cIter = __xml_next(cIter)) { parent 2096 lib/common/xml.c CRM_ASSERT(match->parent != NULL); parent 2097 lib/common/xml.c match_child = match->parent->children; parent 2105 lib/common/xml.c match_child?"next":"last", match_child?match_child:match->parent->last); parent 2111 lib/common/xml.c CRM_ASSERT(match->parent->last != NULL); parent 2112 lib/common/xml.c xmlAddNextSibling(match->parent->last, match); parent 2268 lib/common/xml.c find_entity(xmlNode * parent, const char *node_name, const char *id) parent 2272 lib/common/xml.c for (a_child = __xml_first_child(parent); a_child != NULL; a_child = __xml_next(a_child)) { parent 2282 lib/common/xml.c crm_trace("node <%s id=%s> not found in %s.", node_name, id, crm_element_name(parent)); parent 2405 lib/common/xml.c add_node_copy(xmlNode * parent, xmlNode * src_node) parent 2408 lib/common/xml.c xmlDoc *doc = getDocPtr(parent); parent 2413 lib/common/xml.c xmlAddChild(parent, child); parent 2419 lib/common/xml.c add_node_nocopy(xmlNode * parent, const char *name, xmlNode * child) parent 2421 lib/common/xml.c add_node_copy(parent, child); parent 2437 lib/common/xml.c xmlNode *parent = xml; parent 2466 lib/common/xml.c while(parent && parent->_private) { parent 2467 lib/common/xml.c xml_private_t *p = parent->_private; parent 2476 lib/common/xml.c parent = parent->parent; parent 2588 lib/common/xml.c create_xml_node(xmlNode * parent, const char *name) parent 2598 lib/common/xml.c if (parent == NULL) { parent 2604 lib/common/xml.c doc = getDocPtr(parent); parent 2606 lib/common/xml.c xmlAddChild(parent, node); parent 2617 lib/common/xml.c if(offset == 0 && prefix == NULL && xml->parent) { parent 2618 lib/common/xml.c offset = __get_prefix(NULL, xml->parent, buffer, offset); parent 4267 lib/common/xml.c xmlNode * xml_node, xmlNode * parent) parent 4272 lib/common/xml.c xmlNode *new_parent = parent; parent 4277 lib/common/xml.c us = create_xml_node(parent, name); parent 4366 lib/common/xml.c subtract_xml_comment(xmlNode * parent, xmlNode * left, xmlNode * right, parent 4376 lib/common/xml.c deleted = add_node_copy(parent, left); parent 4386 lib/common/xml.c subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right, parent 4413 lib/common/xml.c return subtract_xml_comment(parent, left, right, changed); parent 4421 lib/common/xml.c deleted = add_node_copy(parent, left); parent 4441 lib/common/xml.c diff = create_xml_node(parent, name); parent 4573 lib/common/xml.c add_xml_comment(xmlNode * parent, xmlNode * target, xmlNode * update) parent 4579 lib/common/xml.c target = find_xml_comment(parent, update, FALSE); parent 4583 lib/common/xml.c add_node_copy(parent, update); parent 4595 lib/common/xml.c add_xml_object(xmlNode * parent, xmlNode * target, xmlNode * update, gboolean as_diff) parent 4609 lib/common/xml.c return add_xml_comment(parent, target, update); parent 4619 lib/common/xml.c target = find_xml_node(parent, object_name, FALSE); parent 4622 lib/common/xml.c target = find_entity(parent, object_name, object_id); parent 4626 lib/common/xml.c target = create_xml_node(parent, object_name); parent 4738 lib/common/xml.c replace_xml_child(xmlNode * parent, xmlNode * child, xmlNode * update, gboolean delete_only) parent 4773 lib/common/xml.c if (can_delete && parent != NULL) { parent 4831 lib/common/xml.c crm_create_nvpair_xml(xmlNode *parent, const char *id, const char *name, parent 4841 lib/common/xml.c nvp = create_xml_node(parent, XML_CIB_TAG_NVPAIR); parent 4847 lib/common/xml.c const char *parent_id = ID(parent); parent 4931 lib/common/xml.c xml2list(xmlNode * parent) parent 4938 lib/common/xml.c CRM_CHECK(parent != NULL, return nvpair_hash); parent 4940 lib/common/xml.c nvpair_list = find_xml_node(parent, XML_TAG_ATTRS, FALSE); parent 4942 lib/common/xml.c crm_trace("No attributes in %s", crm_element_name(parent)); parent 4943 lib/common/xml.c crm_log_xml_trace(parent, "No attributes for resource op"); parent 5003 lib/common/xml.c xmlNode *parent = user_data; parent 5005 lib/common/xml.c crm_xml_add(parent, pair->name, pair->value); parent 5009 lib/common/xml.c sorted_xml(xmlNode * input, xmlNode * parent, gboolean recursive) parent 5024 lib/common/xml.c result = create_xml_node(parent, name); parent 5053 lib/common/xml.c first_named_child(xmlNode * parent, const char *name) parent 5057 lib/common/xml.c for (match = __xml_first_child(parent); match != NULL; match = __xml_next(match)) { parent 94 lib/common/xpath.c && match->parent && match->parent->type == XML_ELEMENT_NODE) { parent 96 lib/common/xpath.c match = match->parent; parent 123 lib/common/xpath.c xml = xpathObj->nodesetval->nodeTab[lpc]->parent; parent 125 lib/common/xpath.c for (; xml; xml = xml->parent) { parent 164 lib/pengine/complex.c if (rsc->parent != NULL) { parent 165 lib/pengine/complex.c g_hash_table_foreach(rsc->parent->meta, dup_attr, meta_hash); parent 187 lib/pengine/complex.c if (rsc->parent != NULL) { parent 188 lib/pengine/complex.c get_rsc_attributes(meta_hash, rsc->parent, node, data_set); parent 212 lib/pengine/complex.c if (rsc->parent != NULL) { parent 213 lib/pengine/complex.c pe_get_versioned_attributes(meta_hash, rsc->parent, node, data_set); parent 412 lib/pengine/complex.c if (top == rsc->parent && pe_rsc_is_clone(top)) { parent 466 lib/pengine/complex.c resource_t * parent, pe_working_set_t * data_set) parent 510 lib/pengine/complex.c (*rsc)->parent = parent; parent 882 lib/pengine/complex.c resource_t *parent = child; parent 884 lib/pengine/complex.c if (parent == NULL || rsc == NULL) { parent 887 lib/pengine/complex.c while (parent->parent != NULL) { parent 888 lib/pengine/complex.c if (parent->parent == rsc) { parent 891 lib/pengine/complex.c parent = parent->parent; parent 899 lib/pengine/complex.c resource_t *parent = rsc; parent 901 lib/pengine/complex.c if (parent == NULL) { parent 904 lib/pengine/complex.c while (parent->parent != NULL && parent->parent->variant != pe_container) { parent 905 lib/pengine/complex.c parent = parent->parent; parent 907 lib/pengine/complex.c return parent; parent 939 lib/pengine/complex.c if (rsc->parent == NULL && is_set(rsc->flags, pe_rsc_orphan)) { parent 136 lib/pengine/container.c resource_t *parent, container_variant_data_t *data, container_grouping_t *tuple, parent 171 lib/pengine/container.c if (common_unpack(xml_ip, &tuple->ip, parent, data_set) == false) { parent 175 lib/pengine/container.c parent->children = g_list_append(parent->children, tuple->ip); parent 182 lib/pengine/container.c resource_t *parent, container_variant_data_t *data, container_grouping_t *tuple, parent 330 lib/pengine/container.c if (common_unpack(xml_docker, &tuple->docker, parent, data_set) == FALSE) { parent 333 lib/pengine/container.c parent->children = g_list_append(parent->children, tuple->docker); parent 339 lib/pengine/container.c resource_t *parent, container_variant_data_t *data, container_grouping_t *tuple, parent 491 lib/pengine/container.c if (common_unpack(xml_docker, &tuple->docker, parent, data_set) == FALSE) { parent 494 lib/pengine/container.c parent->children = g_list_append(parent->children, tuple->docker); parent 524 lib/pengine/container.c resource_t *parent, container_variant_data_t *data, container_grouping_t *tuple, parent 620 lib/pengine/container.c g_hash_table_insert(tuple->child->parent->allowed_nodes, (gpointer) tuple->node->details->id, copy); parent 623 lib/pengine/container.c if (common_unpack(xml_remote, &tuple->remote, parent, data_set) == FALSE) { parent 653 lib/pengine/container.c parent->children = g_list_append(parent->children, tuple->remote); parent 660 lib/pengine/container.c resource_t *parent, container_variant_data_t *data, container_grouping_t *tuple, parent 665 lib/pengine/container.c create_docker_resource(parent, data, tuple, data_set) == FALSE) { parent 669 lib/pengine/container.c create_rkt_resource(parent, data, tuple, data_set) == FALSE) { parent 673 lib/pengine/container.c if(create_ip_resource(parent, data, tuple, data_set) == FALSE) { parent 676 lib/pengine/container.c if(create_remote_resource(parent, data, tuple, data_set) == FALSE) { parent 739 lib/pengine/container.c while (top->parent != NULL) { parent 740 lib/pengine/container.c top = top->parent; parent 1171 lib/pengine/container.c resource_t *parent = uber_parent(rsc); parent 1172 lib/pengine/container.c CRM_ASSERT(parent->parent); parent 1174 lib/pengine/container.c parent = parent->parent; parent 1175 lib/pengine/container.c get_container_variant_data(container_data, parent); parent 59 lib/pengine/native.c resource_t *p = rsc->parent; parent 67 lib/pengine/native.c p = p->parent; parent 97 lib/pengine/native.c if (rsc->parent parent 98 lib/pengine/native.c && (rsc->parent->variant == pe_group || rsc->parent->variant == pe_container) parent 99 lib/pengine/native.c && rsc->parent->recovery_type == recovery_block) { parent 100 lib/pengine/native.c GListPtr gIter = rsc->parent->children; parent 119 lib/pengine/native.c if (rsc->parent != NULL) { parent 120 lib/pengine/native.c native_add_running(rsc->parent, node, data_set); parent 129 lib/pengine/native.c resource_t *parent = uber_parent(rsc); parent 138 lib/pengine/native.c if (is_set(rsc->flags, pe_rsc_unique) && rsc->parent) { parent 148 lib/pengine/native.c const char *stateful = g_hash_table_lookup(parent->meta, "stateful"); parent 158 lib/pengine/remote.c pe_create_remote_xml(xmlNode *parent, const char *uname, parent 167 lib/pengine/remote.c remote = create_xml_node(parent, XML_CIB_TAG_RESOURCE); parent 260 lib/pengine/status.c resource_t *parent = rIter->data; parent 263 lib/pengine/status.c parent->fns->find_rsc(parent, id, NULL, flags); parent 426 lib/pengine/unpack.c for (xml_rsc = __xml_first_child(parent); xml_rsc != NULL; xml_rsc = __xml_next_element(xml_rsc)) { parent 447 lib/pengine/unpack.c expand_remote_rsc_meta(xmlNode *xml_obj, xmlNode *parent, pe_working_set_t *data) parent 493 lib/pengine/unpack.c pe_create_remote_xml(parent, remote_name, container_id, parent 1689 lib/pengine/unpack.c find_anonymous_clone(pe_working_set_t * data_set, node_t * node, resource_t * parent, parent 1696 lib/pengine/unpack.c CRM_ASSERT(parent != NULL); parent 1697 lib/pengine/unpack.c CRM_ASSERT(pe_rsc_is_clone(parent)); parent 1698 lib/pengine/unpack.c CRM_ASSERT(is_not_set(parent->flags, pe_rsc_unique)); parent 1701 lib/pengine/unpack.c pe_rsc_trace(parent, "Looking for %s on %s in %s", rsc_id, node->details->uname, parent->id); parent 1702 lib/pengine/unpack.c for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) { parent 1718 lib/pengine/unpack.c rsc = parent->fns->find_rsc(child, rsc_id, NULL, pe_find_clone); parent 1729 lib/pengine/unpack.c parent->id, node->details->uname); parent 1740 lib/pengine/unpack.c pe_rsc_trace(parent, "Looking for %s anywhere", rsc_id); parent 1741 lib/pengine/unpack.c for (rIter = parent->children; rsc == NULL && rIter; rIter = rIter->next) { parent 1753 lib/pengine/unpack.c rsc = parent->fns->find_rsc(child, rsc_id, NULL, pe_find_clone); parent 1754 lib/pengine/unpack.c pe_rsc_trace(parent, "Resource %s, empty slot", rsc->id); parent 1762 lib/pengine/unpack.c resource_t *top = create_child_clone(parent, -1, data_set); parent 1768 lib/pengine/unpack.c pe_rsc_debug(parent, "Created orphan %s for %s: %s on %s", top->id, parent->id, rsc_id, parent 1786 lib/pengine/unpack.c resource_t *parent = NULL; parent 1803 lib/pengine/unpack.c parent = uber_parent(clone0); parent 1806 lib/pengine/unpack.c crm_trace("%s not found: %s", rsc_id, parent ? parent->id : "orphan"); parent 1814 lib/pengine/unpack.c parent = uber_parent(rsc); parent 1817 lib/pengine/unpack.c if(parent && parent->parent) { parent 1820 lib/pengine/unpack.c } else if (pe_rsc_is_clone(parent)) { parent 1821 lib/pengine/unpack.c if (is_not_set(parent->flags, pe_rsc_unique)) { parent 1824 lib/pengine/unpack.c rsc = find_anonymous_clone(data_set, node, parent, base); parent 1886 lib/pengine/unpack.c iter = iter->parent; parent 2712 lib/pengine/unpack.c if (fail_rsc->parent) { parent 2713 lib/pengine/unpack.c resource_t *parent = uber_parent(fail_rsc); parent 2715 lib/pengine/unpack.c if (pe_rsc_is_clone(parent) parent 2716 lib/pengine/unpack.c && is_not_set(parent->flags, pe_rsc_unique)) { parent 2720 lib/pengine/unpack.c fail_rsc = parent; parent 3106 lib/pengine/unpack.c resource_t *parent = rsc; parent 3134 lib/pengine/unpack.c parent = uber_parent(rsc); parent 3255 lib/pengine/unpack.c resource_location(parent, node, -INFINITY, "hard-error", data_set); parent 3289 lib/pengine/unpack.c parent->id, node->details->uname, parent 3292 lib/pengine/unpack.c resource_location(parent, node, -INFINITY, "hard-error", data_set); parent 3296 lib/pengine/unpack.c parent->id, task, services_ocf_exitcode_str(rc), rc); parent 3298 lib/pengine/unpack.c resource_location(parent, NULL, -INFINITY, "fatal-error", data_set); parent 32 lib/transition/unpack.c unpack_action(synapse_t * parent, xmlNode * xml_action) parent 53 lib/transition/unpack.c action->synapse = parent; parent 396 pengine/allocate.c resource_t *parent = uber_parent(rsc); parent 397 pengine/allocate.c if(parent == NULL parent 398 pengine/allocate.c || pe_rsc_is_clone(parent) == FALSE parent 399 pengine/allocate.c || is_set(parent->flags, pe_rsc_unique)) { parent 50 pengine/clone.c if (node != NULL && rsc->parent) { parent 51 pengine/clone.c ret = pe_hash_table_lookup(rsc->parent->allowed_nodes, node->details->id); parent 236 pengine/clone.c if(resource1->parent) { parent 237 pengine/clone.c for (gIter = resource1->parent->rsc_cons; gIter; gIter = gIter->next) { parent 247 pengine/clone.c for (gIter = resource1->parent->rsc_cons_lhs; gIter; gIter = gIter->next) { parent 258 pengine/clone.c if(resource2->parent) { parent 259 pengine/clone.c for (gIter = resource2->parent->rsc_cons; gIter; gIter = gIter->next) { parent 269 pengine/clone.c for (gIter = resource2->parent->rsc_cons_lhs; gIter; gIter = gIter->next) { parent 434 pengine/clone.c append_parent_colocation(rsc->parent, rsc, all_coloc); parent 467 pengine/clone.c chosen->details->id, rsc->parent->id, parent 468 pengine/clone.c g_hash_table_size(rsc->parent->allowed_nodes)); parent 183 pengine/constraints.c resource_t *parent = rIter->data; parent 184 pengine/constraints.c resource_t *match = parent->fns->find_rsc(parent, id, NULL, parent 175 pengine/container.c set_bit(tuple->child->parent->flags, pe_rsc_allocating); parent 177 pengine/container.c clear_bit(tuple->child->parent->flags, pe_rsc_allocating); parent 157 pengine/graph.c if ((rsc->parent == NULL) parent 158 pengine/graph.c || (pe_rsc_is_clone(rsc) && (rsc->parent->variant == pe_container))) { parent 487 pengine/graph.c if (rsc->parent) { parent 493 pengine/graph.c rsc = rsc->parent; parent 1204 pengine/graph.c resource_t *parent = action->rsc; parent 1206 pengine/graph.c while (parent != NULL) { parent 1207 pengine/graph.c isolated |= parent->isolation_wrapper ? 1 : 0; parent 1208 pengine/graph.c parent->cmds->append_meta(parent, args_xml); parent 1209 pengine/graph.c parent = parent->parent; parent 89 pengine/group.c void group_update_pseudo_status(resource_t * parent, resource_t * child); parent 140 pengine/group.c group_update_pseudo_status(resource_t * parent, resource_t * child) parent 145 pengine/group.c get_group_variant_data(group_data, parent); parent 167 pengine/master.c resource_t *parent = uber_parent(rsc); parent 213 pengine/master.c get_clone_variant_data(clone_data, parent); parent 214 pengine/master.c local_node = pe_hash_table_lookup(parent->allowed_nodes, node->details->id); parent 402 pengine/master.c resource_t *parent = uber_parent(rsc); parent 404 pengine/master.c for (rIter = parent->children; rIter; rIter = rIter->next) { parent 406 pengine/master.c resource_t *active = parent->fns->find_rsc(child, key, node, pe_find_clone|pe_find_current); parent 425 pengine/master.c for (rIter = parent->children; rIter; rIter = rIter->next) { parent 436 pengine/master.c rsc = parent->fns->find_rsc(child, key, NULL, pe_find_clone); parent 150 pengine/native.c if (!pe_rsc_is_unique_clone(rsc->parent) parent 438 pengine/native.c if (rsc->parent && is_not_set(rsc->parent->flags, pe_rsc_allocating)) { parent 441 pengine/native.c rsc->parent->id); parent 442 pengine/native.c rsc->parent->cmds->allocate(rsc->parent, prefer, data_set); parent 1577 pengine/native.c rsc_lh->parent && parent 1578 pengine/native.c rsc_lh->parent->variant == pe_master && is_not_set(rsc_lh->flags, pe_rsc_provisional)) { parent 2051 pengine/native.c if(then->rsc && then->rsc->parent) { parent 2869 pengine/native.c if (rsc->parent == top) { parent 2870 pengine/native.c running = g_hash_table_lookup(rsc->parent->known_on, node->details->id); parent 3326 pengine/native.c resource_t *iso_parent, *last_parent, *parent; parent 3345 pengine/native.c for (parent = rsc; parent != NULL; parent = parent->parent) { parent 3346 pengine/native.c if (parent->container) { parent 3347 pengine/native.c crm_xml_add(xml, CRM_META"_"XML_RSC_ATTR_CONTAINER, parent->container->id); parent 3358 pengine/native.c iso_parent = iso_parent->parent; parent 432 pengine/utilization.c if (group_data->colocated || pe_rsc_is_clone(rsc->parent)) { parent 459 pengine/utilization.c if (group_data->colocated || pe_rsc_is_clone(rsc->parent)) { parent 3848 tools/crm_mon.c n = n->parent; parent 101 tools/crm_resource_print.c rsc->clone_name ? rsc->clone_name : rsc->id, rsc->parent ? rsc->parent->id : "NA", parent 63 tools/crm_resource_runtime.c resource_t *parent = uber_parent(rsc); parent 71 tools/crm_resource_runtime.c } else if (pe_rsc_is_clone(parent) parent 77 tools/crm_resource_runtime.c for (GListPtr iter = parent->children; iter; iter = iter->next) { parent 178 tools/crm_resource_runtime.c } else if(rsc->parent) { parent 179 tools/crm_resource_runtime.c switch(rsc->parent->variant) { parent 182 tools/crm_resource_runtime.c printf("Performing %s of '%s' for '%s' will not apply to its peers in '%s'\n", cmd, attr_name, rsc_id, rsc->parent->id); parent 192 tools/crm_resource_runtime.c rsc = rsc->parent; parent 202 tools/crm_resource_runtime.c } else if (rsc->parent && BE_QUIET == FALSE) { parent 203 tools/crm_resource_runtime.c printf("Forcing %s of '%s' for '%s' instead of '%s'\n", cmd, attr_name, rsc_id, rsc->parent->id); parent 205 tools/crm_resource_runtime.c } else if(rsc->parent == NULL && rsc->children) { parent 690 tools/crm_resource_runtime.c resource_t *parent = uber_parent(rsc); parent 692 tools/crm_resource_runtime.c find_resource_attr(cib_conn, XML_NVPAIR_ATTR_VALUE, parent->id, parent 695 tools/crm_resource_runtime.c find_resource_attr(cib_conn, XML_NVPAIR_ATTR_VALUE, parent->id, parent 704 tools/crm_resource_runtime.c printf("\n * The configuration specifies that '%s' should remain stopped\n", parent->id); parent 707 tools/crm_resource_runtime.c } else if(parent->variant == pe_master && role == RSC_ROLE_SLAVE) { parent 708 tools/crm_resource_runtime.c printf("\n * The configuration specifies that '%s' should not be promoted\n", parent->id); parent 714 tools/crm_resource_runtime.c printf("%s * The configuration prevents the cluster from stopping or starting '%s' (unmanaged)\n", need_nl == 0?"\n":"", parent->id); parent 1528 tools/crm_resource_runtime.c rid = pe_rsc_is_anon_clone(rsc->parent)? requested_name : rsc->id;