pair              189 lib/common/nvpair.c     pcmk_nvpair_t *pair = data;
pair              192 lib/common/nvpair.c     crm_xml_add(parent, pair->name, pair->value);
pair              399 lib/pacemaker/pcmk_sched_bundle.c     pe_resource_t *pair = NULL;
pair              414 lib/pacemaker/pcmk_sched_bundle.c         pair = compatible_replica_for_node(rsc_lh, node, rsc, filter, current);
pair              415 lib/pacemaker/pcmk_sched_bundle.c         if (pair) {
pair              423 lib/pacemaker/pcmk_sched_bundle.c     return pair;
pair             1027 lib/pacemaker/pcmk_sched_clone.c     pe_resource_t *pair = NULL;
pair             1044 lib/pacemaker/pcmk_sched_clone.c         pair = find_compatible_child_by_node(local_child, node, rsc, filter, current);
pair             1045 lib/pacemaker/pcmk_sched_clone.c         if (pair) {
pair             1053 lib/pacemaker/pcmk_sched_clone.c     return pair;
pair               93 lib/pengine/pe_output.c         char *pair = pcmk_format_nvpair("interval", interval_ms_s, "ms");
pair               94 lib/pengine/pe_output.c         interval_str = crm_strdup_printf(" %s", pair);
pair               95 lib/pengine/pe_output.c         free(pair);
pair              124 lib/pengine/pe_output.c             char *pair = pcmk_format_nvpair(XML_RSC_OP_T_EXEC, value, "ms");
pair              125 lib/pengine/pe_output.c             exec_str = crm_strdup_printf(" %s", pair);
pair              126 lib/pengine/pe_output.c             free(pair);
pair              131 lib/pengine/pe_output.c             char *pair = pcmk_format_nvpair(XML_RSC_OP_T_QUEUE, value, "ms");
pair              132 lib/pengine/pe_output.c             queue_str = crm_strdup_printf(" %s", pair);
pair              133 lib/pengine/pe_output.c             free(pair);
pair              568 lib/pengine/rules.c     sorted_set_t *pair = data;
pair              571 lib/pengine/rules.c     if (!pe_eval_rules(pair->attr_set, unpack_data->rule_data,
pair              577 lib/pengine/rules.c     if (get_versioned_rule(pair->attr_set) && !(unpack_data->rule_data->node_hash &&
pair              586 lib/pengine/rules.c               pair->name, pair->score,
pair              588 lib/pengine/rules.c     populate_hash(pair->attr_set, unpack_data->hash, unpack_data->overwrite, unpack_data->top);
pair              595 lib/pengine/rules.c     sorted_set_t *pair = data;
pair              598 lib/pengine/rules.c     if (pe_eval_rules(pair->attr_set, unpack_data->rule_data,
pair              600 lib/pengine/rules.c         add_versioned_attributes(pair->attr_set, unpack_data->hash);
pair              622 lib/pengine/rules.c     sorted_set_t *pair = NULL;
pair              633 lib/pengine/rules.c             pair = NULL;
pair              639 lib/pengine/rules.c             pair = calloc(1, sizeof(sorted_set_t));
pair              640 lib/pengine/rules.c             pair->name = ID(attr_set);
pair              641 lib/pengine/rules.c             pair->special_name = always_first;
pair              642 lib/pengine/rules.c             pair->attr_set = attr_set;
pair              645 lib/pengine/rules.c             pair->score = char2score(score);
pair              647 lib/pengine/rules.c             unsorted = g_list_prepend(unsorted, pair);