right             268 daemons/controld/controld_join_dc.c compare_int_fields(xmlNode * left, xmlNode * right, const char *field)
right             271 daemons/controld/controld_join_dc.c     const char *elem_r = crm_element_value(right, field);
right             140 include/crm/common/xml.h xmlNode *diff_xml_object(xmlNode * left, xmlNode * right, gboolean suppress);
right             142 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right,
right              33 lib/common/patchset.c                                      xmlNode *right, gboolean *changed);
right            1460 lib/common/patchset.c subtract_xml_comment(xmlNode *parent, xmlNode *left, xmlNode *right,
right            1466 lib/common/patchset.c     if ((right == NULL) || !pcmk__str_eq((const char *)left->content,
right            1467 lib/common/patchset.c                                          (const char *)right->content,
right            1481 lib/common/patchset.c subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right,
right            1504 lib/common/patchset.c         return subtract_xml_comment(parent, left, right, changed);
right            1508 lib/common/patchset.c     if (right == NULL) {
right            1522 lib/common/patchset.c     CRM_CHECK(pcmk__str_eq(crm_element_name(left), crm_element_name(right),
right            1527 lib/common/patchset.c     value = crm_element_value(right, XML_DIFF_MARKER);
right            1542 lib/common/patchset.c         right_child = pcmk__xml_match(right, left_child, false);
right            1585 lib/common/patchset.c         right_attr = xmlHasProp(right, (pcmkXmlStr) prop_name);
right            1590 lib/common/patchset.c         right_val = crm_element_value(right, prop_name);
right              37 libltdl/slist.c static SList *	slist_sort_merge    (SList *left, SList *right,
right             273 libltdl/slist.c slist_sort_merge (SList *left, SList *right, SListCompare *compare,
right             280 libltdl/slist.c   while (left && right)
right             282 libltdl/slist.c       if ((*compare) (left, right, userdata) <= 0)
right             289 libltdl/slist.c 	  insert = insert->next = right;
right             290 libltdl/slist.c 	  right = right->next;
right             294 libltdl/slist.c   insert->next = left ? left : right;
right             309 libltdl/slist.c   SList *left, *right;
right             316 libltdl/slist.c   right = slist->next;
right             318 libltdl/slist.c   if (!right)
right             323 libltdl/slist.c   while (right && (right = right->next))
right             325 libltdl/slist.c       if (!right || !(right = right->next))
right             329 libltdl/slist.c   right = slist->next;
right             334 libltdl/slist.c 			   slist_sort (right, compare, userdata),