right 283 crmd/join_dc.c compare_int_fields(xmlNode * left, xmlNode * right, const char *field) right 286 crmd/join_dc.c const char *elem_r = crm_element_value(right, field); right 89 include/crm/cib/internal.h int cib_compare_generation(xmlNode * left, xmlNode * right); right 172 include/crm/common/xml.h xmlNode *diff_xml_object(xmlNode * left, xmlNode * right, gboolean suppress); right 174 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right, right 66 lib/cib/cib_utils.c cib_compare_generation(xmlNode * left, xmlNode * right) right 77 lib/cib/cib_utils.c crm_log_xml_trace(right, "right"); right 85 lib/cib/cib_utils.c if (right != NULL) { right 86 lib/cib/cib_utils.c elem_r = crm_element_value(right, attributes[lpc]); right 107 lib/common/xml.c static xmlNode *subtract_xml_comment(xmlNode * parent, xmlNode * left, xmlNode * right, gboolean * changed); right 4366 lib/common/xml.c subtract_xml_comment(xmlNode * parent, xmlNode * left, xmlNode * right, right 4372 lib/common/xml.c if (right == NULL right 4373 lib/common/xml.c || safe_str_neq((const char *)left->content, (const char *)right->content)) { right 4386 lib/common/xml.c subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right, right 4413 lib/common/xml.c return subtract_xml_comment(parent, left, right, changed); right 4417 lib/common/xml.c if (right == NULL) { right 4430 lib/common/xml.c CRM_CHECK(safe_str_eq(crm_element_name(left), crm_element_name(right)), return NULL); right 4433 lib/common/xml.c value = crm_element_value(right, XML_DIFF_MARKER); right 4453 lib/common/xml.c right_child = find_element(right, left_child, FALSE); right 4503 lib/common/xml.c right_attr = xmlHasProp(right, (const xmlChar *)prop_name); right 4508 lib/common/xml.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),