pair             5002 lib/common/xml.c     name_value_t *pair = data;
pair             5005 lib/common/xml.c     crm_xml_add(parent, pair->name, pair->value);
pair             5014 lib/common/xml.c     name_value_t *pair = NULL;
pair             5030 lib/common/xml.c         pair = calloc(1, sizeof(name_value_t));
pair             5031 lib/common/xml.c         pair->name = p_name;
pair             5032 lib/common/xml.c         pair->value = p_value;
pair             5033 lib/common/xml.c         unsorted = g_list_prepend(unsorted, pair);
pair             5034 lib/common/xml.c         pair = NULL;
pair              831 lib/pengine/rules.c     sorted_set_t *pair = data;
pair              834 lib/pengine/rules.c     if (test_ruleset(pair->attr_set, unpack_data->node_hash, unpack_data->now) == FALSE) {
pair              839 lib/pengine/rules.c     if (get_versioned_rule(pair->attr_set) && !(unpack_data->node_hash &&
pair              847 lib/pengine/rules.c     crm_trace("Adding attributes from %s", pair->name);
pair              848 lib/pengine/rules.c     populate_hash(pair->attr_set, unpack_data->hash, unpack_data->overwrite, unpack_data->top);
pair              855 lib/pengine/rules.c     sorted_set_t *pair = data;
pair              858 lib/pengine/rules.c     if (test_ruleset(pair->attr_set, unpack_data->node_hash, unpack_data->now) == FALSE) {
pair              862 lib/pengine/rules.c     add_versioned_attributes(pair->attr_set, unpack_data->hash);
pair              873 lib/pengine/rules.c     sorted_set_t *pair = NULL;
pair              885 lib/pengine/rules.c             pair = NULL;
pair              891 lib/pengine/rules.c             pair = calloc(1, sizeof(sorted_set_t));
pair              892 lib/pengine/rules.c             pair->name = ID(attr_set);
pair              893 lib/pengine/rules.c             pair->special_name = always_first;
pair              894 lib/pengine/rules.c             pair->attr_set = attr_set;
pair              897 lib/pengine/rules.c             pair->score = char2score(score);
pair              899 lib/pengine/rules.c             unsorted = g_list_prepend(unsorted, pair);
pair              903 lib/pengine/rules.c     if (pair != NULL) {
pair              984 pengine/clone.c     resource_t *pair = NULL;
pair             1001 pengine/clone.c         pair = find_compatible_child_by_node(local_child, node, rsc, filter, current);
pair             1002 pengine/clone.c         if (pair) {
pair             1010 pengine/clone.c     return pair;
pair              374 pengine/container.c     resource_t *pair = NULL;
pair              388 pengine/container.c         pair = find_compatible_tuple_by_node(rsc_lh, node, rsc, filter, current);
pair              389 pengine/container.c         if (pair) {
pair              397 pengine/container.c     return pair;