right             353 daemons/controld/controld_join_dc.c compare_int_fields(xmlNode * left, xmlNode * right, const char *field)
right             356 daemons/controld/controld_join_dc.c     const char *elem_r = crm_element_value(right, field);
right             145 include/crm/common/xml.h xmlNode *diff_xml_object(xmlNode * left, xmlNode * right, gboolean suppress);
right             147 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right,
right              30 lib/common/patchset.c                                      xmlNode *right, gboolean *changed);
right            1223 lib/common/patchset.c subtract_xml_comment(xmlNode *parent, xmlNode *left, xmlNode *right,
right            1229 lib/common/patchset.c     if ((right == NULL) || !pcmk__str_eq((const char *)left->content,
right            1230 lib/common/patchset.c                                          (const char *)right->content,
right            1244 lib/common/patchset.c subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right,
right            1267 lib/common/patchset.c         return subtract_xml_comment(parent, left, right, changed);
right            1271 lib/common/patchset.c     if (right == NULL) {
right            1285 lib/common/patchset.c     CRM_CHECK(pcmk__str_eq(crm_element_name(left), crm_element_name(right),
right            1290 lib/common/patchset.c     value = crm_element_value(right, XML_DIFF_MARKER);
right            1305 lib/common/patchset.c         right_child = pcmk__xml_match(right, left_child, false);
right            1348 lib/common/patchset.c         right_attr = xmlHasProp(right, (pcmkXmlStr) prop_name);
right            1353 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),
right             323 maint/gnulib/lib/des.c   int i, left, right, middle, cmp_result;
right             331 maint/gnulib/lib/des.c   right = 63;
right             332 maint/gnulib/lib/des.c   while (left <= right)
right             334 maint/gnulib/lib/des.c       middle = (left + right) / 2;
right             342 maint/gnulib/lib/des.c         right = middle - 1;
right             362 maint/gnulib/lib/des.c #define INITIAL_PERMUTATION(left, temp, right)          \
right             363 maint/gnulib/lib/des.c     DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f)    \
right             364 maint/gnulib/lib/des.c     DO_PERMUTATION(left, temp, right, 16, 0x0000ffff)   \
right             365 maint/gnulib/lib/des.c     DO_PERMUTATION(right, temp, left, 2, 0x33333333)    \
right             366 maint/gnulib/lib/des.c     DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff)    \
right             367 maint/gnulib/lib/des.c     right =  (right << 1) | (right >> 31);              \
right             368 maint/gnulib/lib/des.c     temp  =  (left ^ right) & 0xaaaaaaaa;               \
right             369 maint/gnulib/lib/des.c     right ^= temp;                                      \
right             376 maint/gnulib/lib/des.c #define FINAL_PERMUTATION(left, temp, right)            \
right             378 maint/gnulib/lib/des.c     temp  =  (left ^ right) & 0xaaaaaaaa;               \
right             380 maint/gnulib/lib/des.c     right ^= temp;                                      \
right             381 maint/gnulib/lib/des.c     right  =  (right << 31) | (right >> 1);             \
right             382 maint/gnulib/lib/des.c     DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff)    \
right             383 maint/gnulib/lib/des.c     DO_PERMUTATION(right, temp, left, 2, 0x33333333)    \
right             384 maint/gnulib/lib/des.c     DO_PERMUTATION(left, temp, right, 16, 0x0000ffff)   \
right             385 maint/gnulib/lib/des.c     DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f)
right             409 maint/gnulib/lib/des.c #define READ_64BIT_DATA(data, left, right)                                 \
right             414 maint/gnulib/lib/des.c     right = ((uint32_t) data[4] << 24)                                     \
right             419 maint/gnulib/lib/des.c #define WRITE_64BIT_DATA(data, left, right)                                \
right             422 maint/gnulib/lib/des.c     data[4] = (right >> 24) &0xff; data[5] = (right >> 16) &0xff;          \
right             423 maint/gnulib/lib/des.c     data[6] = (right >> 8) &0xff; data[7] = right &0xff;
right             440 maint/gnulib/lib/des.c   uint32_t left, right, work;
right             443 maint/gnulib/lib/des.c   READ_64BIT_DATA (rawkey, left, right)
right             444 maint/gnulib/lib/des.c     DO_PERMUTATION (right, work, left, 4, 0x0f0f0f0f)
right             445 maint/gnulib/lib/des.c     DO_PERMUTATION (right, work, left, 0, 0x10101010)
right             457 maint/gnulib/lib/des.c   right = ((rightkey_swap[(right >> 1) & 0xf] << 3)
right             458 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 9) & 0xf] << 2)
right             459 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 17) & 0xf] << 1)
right             460 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 25) & 0xf])
right             461 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 4) & 0xf] << 7)
right             462 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 12) & 0xf] << 6)
right             463 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 20) & 0xf] << 5)
right             464 maint/gnulib/lib/des.c            | (rightkey_swap[(right >> 28) & 0xf] << 4));
right             466 maint/gnulib/lib/des.c   right &= 0x0fffffff;
right             472 maint/gnulib/lib/des.c       right = ((right << encrypt_rotate_tab[round])
right             473 maint/gnulib/lib/des.c                | (right >> (28 - encrypt_rotate_tab[round]))) & 0x0fffffff;
right             485 maint/gnulib/lib/des.c                    | ((right >> 13) & 0x00002000)
right             486 maint/gnulib/lib/des.c                    | ((right >> 4) & 0x00001000)
right             487 maint/gnulib/lib/des.c                    | ((right << 6) & 0x00000800)
right             488 maint/gnulib/lib/des.c                    | ((right >> 1) & 0x00000400)
right             489 maint/gnulib/lib/des.c                    | ((right >> 14) & 0x00000200)
right             490 maint/gnulib/lib/des.c                    | (right & 0x00000100)
right             491 maint/gnulib/lib/des.c                    | ((right >> 5) & 0x00000020)
right             492 maint/gnulib/lib/des.c                    | ((right >> 10) & 0x00000010)
right             493 maint/gnulib/lib/des.c                    | ((right >> 3) & 0x00000008)
right             494 maint/gnulib/lib/des.c                    | ((right >> 18) & 0x00000004)
right             495 maint/gnulib/lib/des.c                    | ((right >> 26) & 0x00000002)
right             496 maint/gnulib/lib/des.c                    | ((right >> 24) & 0x00000001));
right             510 maint/gnulib/lib/des.c                    | ((right >> 2) & 0x00002000)
right             511 maint/gnulib/lib/des.c                    | ((right << 8) & 0x00001000)
right             512 maint/gnulib/lib/des.c                    | ((right >> 14) & 0x00000808)
right             513 maint/gnulib/lib/des.c                    | ((right >> 9) & 0x00000400)
right             514 maint/gnulib/lib/des.c                    | ((right) & 0x00000200)
right             515 maint/gnulib/lib/des.c                    | ((right << 7) & 0x00000100)
right             516 maint/gnulib/lib/des.c                    | ((right >> 7) & 0x00000020)
right             517 maint/gnulib/lib/des.c                    | ((right >> 3) & 0x00000011)
right             518 maint/gnulib/lib/des.c                    | ((right << 2) & 0x00000004)
right             519 maint/gnulib/lib/des.c                    | ((right >> 21) & 0x00000002));
right             553 maint/gnulib/lib/des.c   uint32_t left, right, work;
right             558 maint/gnulib/lib/des.c   READ_64BIT_DATA (from, left, right)
right             559 maint/gnulib/lib/des.c     INITIAL_PERMUTATION (left, work, right)
right             560 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             561 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             562 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             563 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             564 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             565 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             566 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             567 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             568 maint/gnulib/lib/des.c     FINAL_PERMUTATION (right, work, left)
right             569 maint/gnulib/lib/des.c     WRITE_64BIT_DATA (to, right, left)
right             626 maint/gnulib/lib/des.c   uint32_t left, right, work;
right             631 maint/gnulib/lib/des.c   READ_64BIT_DATA (from, left, right)
right             632 maint/gnulib/lib/des.c     INITIAL_PERMUTATION (left, work, right)
right             633 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             634 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             635 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             636 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             637 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             638 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             639 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             640 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             641 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             642 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             643 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             644 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             645 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             646 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             647 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             648 maint/gnulib/lib/des.c     DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys)
right             649 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             650 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             651 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             652 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             653 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             654 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             655 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             656 maint/gnulib/lib/des.c     DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys)
right             657 maint/gnulib/lib/des.c     FINAL_PERMUTATION (right, work, left)
right             658 maint/gnulib/lib/des.c     WRITE_64BIT_DATA (to, right, left)
right            3962 maint/gnulib/lib/dfa.c comsubs (char *left, char const *right)
right            3969 maint/gnulib/lib/dfa.c       char *rcp = strchr (right, *lcp);
right            3996 maint/gnulib/lib/dfa.c inboth (char **left, char **right)
right            4002 maint/gnulib/lib/dfa.c       for (idx_t rnum = 0; right[rnum] != NULL; rnum++)
right            4004 maint/gnulib/lib/dfa.c           char **temp = comsubs (left[lnum], right[rnum]);
right            4019 maint/gnulib/lib/dfa.c   char *right;
right            4032 maint/gnulib/lib/dfa.c   new_mp->right = xizalloc (size);
right            4045 maint/gnulib/lib/dfa.c   mp->left[0] = mp->right[0] = mp->is[0] = '\0';
right            4056 maint/gnulib/lib/dfa.c   free (mp->right);
right            4136 maint/gnulib/lib/dfa.c             ln = strlen (lmp->right);
right            4137 maint/gnulib/lib/dfa.c             rn = strlen (rmp->right);
right            4142 maint/gnulib/lib/dfa.c               if (lmp->right[ln - i - 1] != rmp->right[rn - i - 1])
right            4145 maint/gnulib/lib/dfa.c               lmp->right[j] = lmp->right[(ln - i) + j];
right            4146 maint/gnulib/lib/dfa.c             lmp->right[j] = '\0';
right            4187 maint/gnulib/lib/dfa.c             if (lmp->right[0] != '\0' && rmp->left[0] != '\0')
right            4189 maint/gnulib/lib/dfa.c                 idx_t lrlen = strlen (lmp->right);
right            4193 maint/gnulib/lib/dfa.c                 memcpy (tp, lmp->right, lrlen);
right            4201 maint/gnulib/lib/dfa.c               lmp->right[0] = '\0';
right            4202 maint/gnulib/lib/dfa.c             lmp->right = icatalloc (lmp->right, rmp->right);
right            4266 maint/gnulib/lib/dfa.c           mp->is[0] = mp->left[0] = mp->right[0]
right            4274 maint/gnulib/lib/dfa.c               mp->is[i] = mp->left[i] = mp->right[i]
right            4277 maint/gnulib/lib/dfa.c           mp->is[i] = mp->left[i] = mp->right[i] = '\0';
right              40 maint/gnulib/lib/gl_anyavltree_list1.h   struct gl_list_node_impl *right;  /* right branch, or NULL */
right              50 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = create_subtree_with_contents (half2, contents + half1 + 1);
right              51 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->right == NULL)
right              53 maint/gnulib/lib/gl_anyavltree_list2.h       node->right->parent = node;
right              56 maint/gnulib/lib/gl_anyavltree_list2.h     node->right = NULL;
right             166 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->left != NULL || node->right != NULL)
right             167 maint/gnulib/lib/gl_anyavltree_list2.h         balance_diff = (child == node->right ? height_diff : -height_diff);
right             185 maint/gnulib/lib/gl_anyavltree_list2.h           else if (node->parent->right == node)
right             186 maint/gnulib/lib/gl_anyavltree_list2.h             nodep = &node->parent->right;
right             191 maint/gnulib/lib/gl_anyavltree_list2.h           noderight = node->right;
right             203 maint/gnulib/lib/gl_anyavltree_list2.h               gl_list_node_t nodeleftright = nodeleft->right;
right             214 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleft->right = node;
right             253 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t L = nodeleft->right = nodeleftright->left;
right             254 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t R = node->left = nodeleftright->right;
right             256 maint/gnulib/lib/gl_anyavltree_list2.h                   nodeleftright->right = node;
right             272 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (nodeleft->right != NULL ? nodeleft->right->branch_size : 0);
right             275 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (node->right != NULL ? node->right->branch_size : 0);
right             301 maint/gnulib/lib/gl_anyavltree_list2.h               gl_list_node_t noderightright = noderight->right;
right             311 maint/gnulib/lib/gl_anyavltree_list2.h                   node->right = noderightleft;
right             351 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t L = node->right = noderightleft->left;
right             352 maint/gnulib/lib/gl_anyavltree_list2.h                   gl_list_node_t R = noderight->left = noderightleft->right;
right             354 maint/gnulib/lib/gl_anyavltree_list2.h                   noderightleft->right = noderight;
right             370 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (node->right != NULL ? node->right->branch_size : 0);
right             373 maint/gnulib/lib/gl_anyavltree_list2.h                     + 1 + (noderight->right != NULL ? noderight->right->branch_size : 0);
right             418 maint/gnulib/lib/gl_anyavltree_list2.h       gl_list_node_t child = node->right;
right             429 maint/gnulib/lib/gl_anyavltree_list2.h             parent->right = child;
right             442 maint/gnulib/lib/gl_anyavltree_list2.h   else if (node->right == NULL)
right             457 maint/gnulib/lib/gl_anyavltree_list2.h             parent->right = child;
right             477 maint/gnulib/lib/gl_anyavltree_list2.h       for (subst = node->left; subst->right != NULL; )
right             478 maint/gnulib/lib/gl_anyavltree_list2.h         subst = subst->right;
right             499 maint/gnulib/lib/gl_anyavltree_list2.h           subst_parent->right = child;
right             518 maint/gnulib/lib/gl_anyavltree_list2.h       subst->right = node->right;
right             519 maint/gnulib/lib/gl_anyavltree_list2.h       subst->right->parent = subst;
right             528 maint/gnulib/lib/gl_anyavltree_list2.h         parent->right = subst;
right             548 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->right = NULL;
right             585 maint/gnulib/lib/gl_anyavltree_list2.h       if (node->right == NULL && node->parent != NULL)
right             616 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->right = NULL;
right             637 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = list->root; node->right != NULL; )
right             638 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->right;
right             640 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
right             686 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->right = NULL;
right             702 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->right == NULL);
right             706 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = node->left; node->right != NULL; )
right             707 maint/gnulib/lib/gl_anyavltree_list2.h         node = node->right;
right             708 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
right             755 maint/gnulib/lib/gl_anyavltree_list2.h   new_node->right = NULL;
right             767 maint/gnulib/lib/gl_anyavltree_list2.h   if (node->right == NULL)
right             769 maint/gnulib/lib/gl_anyavltree_list2.h       node->right = new_node;
right             775 maint/gnulib/lib/gl_anyavltree_list2.h       for (node = node->right; node->left != NULL; )
right             779 maint/gnulib/lib/gl_anyavltree_list2.h       height_inc = (node->right == NULL);
right              46 maint/gnulib/lib/gl_anyrbtree_list1.h   struct gl_list_node_impl *right;  /* right branch, or NULL */
right              58 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right =
right              60 maint/gnulib/lib/gl_anyrbtree_list2.h       if (node->right == NULL)
right              62 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right->parent = node;
right              65 maint/gnulib/lib/gl_anyrbtree_list2.h     node->right = NULL;
right             171 maint/gnulib/lib/gl_anyrbtree_list2.h   gl_list_node_t e_node = d_node->right;
right             173 maint/gnulib/lib/gl_anyrbtree_list2.h   b_node->right = c_node;
right             204 maint/gnulib/lib/gl_anyrbtree_list2.h   gl_list_node_t c_node = b_node->right;
right             205 maint/gnulib/lib/gl_anyrbtree_list2.h   gl_list_node_t e_node = d_node->right;
right             208 maint/gnulib/lib/gl_anyrbtree_list2.h   b_node->right = d_node;
right             250 maint/gnulib/lib/gl_anyrbtree_list2.h         uncle = grandparent->right;
right             251 maint/gnulib/lib/gl_anyrbtree_list2.h       else if (grandparent->right == parent)
right             277 maint/gnulib/lib/gl_anyrbtree_list2.h           else if (grandparent->parent->right == grandparent)
right             278 maint/gnulib/lib/gl_anyrbtree_list2.h             grandparentp = &grandparent->parent->right;
right             284 maint/gnulib/lib/gl_anyrbtree_list2.h               if (parent->right == node)
right             312 maint/gnulib/lib/gl_anyrbtree_list2.h                   grandparent->right = rotate_right (node, parent);
right             314 maint/gnulib/lib/gl_anyrbtree_list2.h                   parent = grandparent->right;
right             367 maint/gnulib/lib/gl_anyrbtree_list2.h       else if (parent->parent->right == parent)
right             368 maint/gnulib/lib/gl_anyrbtree_list2.h         parentp = &parent->parent->right;
right             374 maint/gnulib/lib/gl_anyrbtree_list2.h           gl_list_node_t sibling = parent->right;
right             405 maint/gnulib/lib/gl_anyrbtree_list2.h               sibling = parent->right;
right             414 maint/gnulib/lib/gl_anyrbtree_list2.h           if (sibling->right != NULL && sibling->right->color == RED)
right             429 maint/gnulib/lib/gl_anyrbtree_list2.h               sibling->right->color = BLACK;
right             449 maint/gnulib/lib/gl_anyrbtree_list2.h               parent->right = rotate_right (sibling->left, sibling);
right             452 maint/gnulib/lib/gl_anyrbtree_list2.h               sibling = parent->right;
right             459 maint/gnulib/lib/gl_anyrbtree_list2.h               sibling->right->color = BLACK;
right             494 maint/gnulib/lib/gl_anyrbtree_list2.h       else if (parent->right == child)
right             526 maint/gnulib/lib/gl_anyrbtree_list2.h               parentp = &sibling->right;
right             554 maint/gnulib/lib/gl_anyrbtree_list2.h           else if (sibling->right != NULL && sibling->right->color == RED)
right             571 maint/gnulib/lib/gl_anyrbtree_list2.h               parent->left = rotate_left (sibling, sibling->right);
right             643 maint/gnulib/lib/gl_anyrbtree_list2.h       gl_list_node_t child = node->right;
right             659 maint/gnulib/lib/gl_anyrbtree_list2.h             parent->right = child;
right             673 maint/gnulib/lib/gl_anyrbtree_list2.h   else if (node->right == NULL)
right             691 maint/gnulib/lib/gl_anyrbtree_list2.h             parent->right = child;
right             710 maint/gnulib/lib/gl_anyrbtree_list2.h       for (subst = node->left; subst->right != NULL; )
right             711 maint/gnulib/lib/gl_anyrbtree_list2.h         subst = subst->right;
right             734 maint/gnulib/lib/gl_anyrbtree_list2.h           subst_parent->right = child;
right             753 maint/gnulib/lib/gl_anyrbtree_list2.h       subst->right = node->right;
right             754 maint/gnulib/lib/gl_anyrbtree_list2.h       subst->right->parent = subst;
right             763 maint/gnulib/lib/gl_anyrbtree_list2.h         parent->right = subst;
right             791 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->right = NULL;
right             857 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->right = NULL;
right             878 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = list->root; node->right != NULL; )
right             879 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->right;
right             881 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right = new_node;
right             923 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->right = NULL;
right             938 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = node->left; node->right != NULL; )
right             939 maint/gnulib/lib/gl_anyrbtree_list2.h         node = node->right;
right             940 maint/gnulib/lib/gl_anyrbtree_list2.h       node->right = new_node;
right             982 maint/gnulib/lib/gl_anyrbtree_list2.h   new_node->right = NULL;
right             993 maint/gnulib/lib/gl_anyrbtree_list2.h   if (node->right == NULL)
right             994 maint/gnulib/lib/gl_anyrbtree_list2.h     node->right = new_node;
right             997 maint/gnulib/lib/gl_anyrbtree_list2.h       for (node = node->right; node->left != NULL; )
right              38 maint/gnulib/lib/gl_anytree_list1.h   if (node->right != NULL)
right              39 maint/gnulib/lib/gl_anytree_list1.h     free_subtree (node->right);
right             109 maint/gnulib/lib/gl_anytree_list2.h   if (node->right != NULL)
right             111 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
right             117 maint/gnulib/lib/gl_anytree_list2.h       while (node->parent != NULL && node->parent->right == node)
right             131 maint/gnulib/lib/gl_anytree_list2.h       while (node->right != NULL)
right             132 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
right             163 maint/gnulib/lib/gl_anytree_list2.h       while (node->right != NULL)
right             164 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
right             190 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
right             299 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
right             354 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
right             410 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
right             465 maint/gnulib/lib/gl_anytree_list2.h             node = node->right;
right             570 maint/gnulib/lib/gl_anytree_list2.h       node = node->right;
right             641 maint/gnulib/lib/gl_anytree_list2.h       if (node->right != NULL)
right             643 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
right             649 maint/gnulib/lib/gl_anytree_list2.h           while (node->parent != NULL && node->parent->right == node)
right             678 maint/gnulib/lib/gl_anytree_list2.h         node = node->right;
right             692 maint/gnulib/lib/gl_anytree_list2.h                 node = node->right;
right             730 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
right             743 maint/gnulib/lib/gl_anytree_list2.h               node = node->right;
right             761 maint/gnulib/lib/gl_anytree_list2.h                       node = node->right;
right             771 maint/gnulib/lib/gl_anytree_list2.h                           node = node->right;
right             806 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
right             826 maint/gnulib/lib/gl_anytree_list2.h                   node = node->right;
right             869 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
right             883 maint/gnulib/lib/gl_anytree_list2.h               node = node->right;
right             902 maint/gnulib/lib/gl_anytree_list2.h                       node = node->right;
right             912 maint/gnulib/lib/gl_anytree_list2.h                           node = node->right;
right             946 maint/gnulib/lib/gl_anytree_list2.h           if (node->right == NULL)
right             948 maint/gnulib/lib/gl_anytree_list2.h           node = node->right;
right              72 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
right              96 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
right             106 maint/gnulib/lib/gl_anytree_omap.h                 node = node->right;
right             146 maint/gnulib/lib/gl_anytree_omap.h           if (node->right == NULL)
right             152 maint/gnulib/lib/gl_anytree_omap.h           node = node->right;
right             187 maint/gnulib/lib/gl_anytree_omap.h         node = node->right;
right             239 maint/gnulib/lib/gl_anytree_omap.h       node = node->right;
right             283 maint/gnulib/lib/gl_anytree_omap.h       if (node->right != NULL)
right             285 maint/gnulib/lib/gl_anytree_omap.h           node = node->right;
right             291 maint/gnulib/lib/gl_anytree_omap.h           while (node->parent != NULL && node->parent->right == node)
right              60 maint/gnulib/lib/gl_anytree_oset.h   if (node->right != NULL)
right              62 maint/gnulib/lib/gl_anytree_oset.h       node = node->right;
right              68 maint/gnulib/lib/gl_anytree_oset.h       while (node->parent != NULL && node->parent->right == node)
right              82 maint/gnulib/lib/gl_anytree_oset.h       while (node->right != NULL)
right              83 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
right             108 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
right             129 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
right             139 maint/gnulib/lib/gl_anytree_oset.h                 node = node->right;
right             167 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
right             201 maint/gnulib/lib/gl_anytree_oset.h           if (node->right == NULL)
right             207 maint/gnulib/lib/gl_anytree_oset.h           node = node->right;
right             278 maint/gnulib/lib/gl_anytree_oset.h                       if (node->right == NULL)
right             283 maint/gnulib/lib/gl_anytree_oset.h                       node = node->right;
right             344 maint/gnulib/lib/gl_anytree_oset.h       node = node->right;
right             399 maint/gnulib/lib/gl_anytree_oset.h         node = node->right;
right             409 maint/gnulib/lib/gl_anytree_oset.h                 node = node->right;
right              46 maint/gnulib/lib/gl_anytreehash_list1.h       if (parent->right == node)
right             302 maint/gnulib/lib/gl_anytreehash_list1.h       node = node->right;
right             323 maint/gnulib/lib/gl_anytreehash_list1.h           node = node->right;
right             206 maint/gnulib/lib/gl_anytreehash_list2.h         node = node->right;
right              48 maint/gnulib/lib/gl_avltree_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
right              55 maint/gnulib/lib/gl_avltree_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
right              33 maint/gnulib/lib/gl_avltree_ordered.h   struct NODE_IMPL *right;  /* right branch, or NULL */
right              85 maint/gnulib/lib/gl_avltree_ordered.h       if (node->left != NULL || node->right != NULL)
right              86 maint/gnulib/lib/gl_avltree_ordered.h         balance_diff = (child == node->right ? height_diff : -height_diff);
right             104 maint/gnulib/lib/gl_avltree_ordered.h           else if (node->parent->right == node)
right             105 maint/gnulib/lib/gl_avltree_ordered.h             nodep = &node->parent->right;
right             110 maint/gnulib/lib/gl_avltree_ordered.h           noderight = node->right;
right             121 maint/gnulib/lib/gl_avltree_ordered.h               NODE_T nodeleftright = nodeleft->right;
right             132 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleft->right = node;
right             165 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T L = nodeleft->right = nodeleftright->left;
right             166 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T R = node->left = nodeleftright->right;
right             168 maint/gnulib/lib/gl_avltree_ordered.h                   nodeleftright->right = node;
right             213 maint/gnulib/lib/gl_avltree_ordered.h                   node->right = noderightleft;
right             247 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T L = node->right = noderightleft->left;
right             248 maint/gnulib/lib/gl_avltree_ordered.h                   NODE_T R = noderight->left = noderightleft->right;
right             250 maint/gnulib/lib/gl_avltree_ordered.h                   noderightleft->right = noderight;
right             308 maint/gnulib/lib/gl_avltree_ordered.h   new_node->right = NULL;
right             330 maint/gnulib/lib/gl_avltree_ordered.h       if (node->right == NULL && node->parent != NULL)
right             345 maint/gnulib/lib/gl_avltree_ordered.h   new_node->right = NULL;
right             353 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->right == NULL);
right             357 maint/gnulib/lib/gl_avltree_ordered.h       for (node = node->left; node->right != NULL; )
right             358 maint/gnulib/lib/gl_avltree_ordered.h         node = node->right;
right             359 maint/gnulib/lib/gl_avltree_ordered.h       node->right = new_node;
right             395 maint/gnulib/lib/gl_avltree_ordered.h   new_node->right = NULL;
right             399 maint/gnulib/lib/gl_avltree_ordered.h   if (node->right == NULL)
right             401 maint/gnulib/lib/gl_avltree_ordered.h       node->right = new_node;
right             407 maint/gnulib/lib/gl_avltree_ordered.h       for (node = node->right; node->left != NULL; )
right             411 maint/gnulib/lib/gl_avltree_ordered.h       height_inc = (node->right == NULL);
right             446 maint/gnulib/lib/gl_avltree_ordered.h       NODE_T child = node->right;
right             457 maint/gnulib/lib/gl_avltree_ordered.h             parent->right = child;
right             462 maint/gnulib/lib/gl_avltree_ordered.h   else if (node->right == NULL)
right             477 maint/gnulib/lib/gl_avltree_ordered.h             parent->right = child;
right             489 maint/gnulib/lib/gl_avltree_ordered.h       for (subst = node->left; subst->right != NULL; )
right             490 maint/gnulib/lib/gl_avltree_ordered.h         subst = subst->right;
right             511 maint/gnulib/lib/gl_avltree_ordered.h           subst_parent->right = child;
right             522 maint/gnulib/lib/gl_avltree_ordered.h       subst->right = node->right;
right             523 maint/gnulib/lib/gl_avltree_ordered.h       subst->right->parent = subst;
right             531 maint/gnulib/lib/gl_avltree_ordered.h         parent->right = subst;
right             558 maint/gnulib/lib/gl_avltree_ordered.h     (node->right != NULL ? check_invariants (node->right, node, counterp) : 0);
right              70 maint/gnulib/lib/gl_avltreehash_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
right              77 maint/gnulib/lib/gl_avltreehash_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
right              48 maint/gnulib/lib/gl_rbtree_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
right              54 maint/gnulib/lib/gl_rbtree_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
right              39 maint/gnulib/lib/gl_rbtree_ordered.h   struct NODE_IMPL *right;  /* right branch, or NULL */
right              81 maint/gnulib/lib/gl_rbtree_ordered.h   b_node->right = c_node;
right             105 maint/gnulib/lib/gl_rbtree_ordered.h   NODE_T c_node = b_node->right;
right             108 maint/gnulib/lib/gl_rbtree_ordered.h   b_node->right = d_node;
right             144 maint/gnulib/lib/gl_rbtree_ordered.h         uncle = grandparent->right;
right             145 maint/gnulib/lib/gl_rbtree_ordered.h       else if (grandparent->right == parent)
right             171 maint/gnulib/lib/gl_rbtree_ordered.h           else if (grandparent->parent->right == grandparent)
right             172 maint/gnulib/lib/gl_rbtree_ordered.h             grandparentp = &grandparent->parent->right;
right             178 maint/gnulib/lib/gl_rbtree_ordered.h               if (parent->right == node)
right             206 maint/gnulib/lib/gl_rbtree_ordered.h                   grandparent->right = rotate_right (node, parent);
right             208 maint/gnulib/lib/gl_rbtree_ordered.h                   parent = grandparent->right;
right             261 maint/gnulib/lib/gl_rbtree_ordered.h       else if (parent->parent->right == parent)
right             262 maint/gnulib/lib/gl_rbtree_ordered.h         parentp = &parent->parent->right;
right             268 maint/gnulib/lib/gl_rbtree_ordered.h           NODE_T sibling = parent->right;
right             299 maint/gnulib/lib/gl_rbtree_ordered.h               sibling = parent->right;
right             308 maint/gnulib/lib/gl_rbtree_ordered.h           if (sibling->right != NULL && sibling->right->color == RED)
right             323 maint/gnulib/lib/gl_rbtree_ordered.h               sibling->right->color = BLACK;
right             343 maint/gnulib/lib/gl_rbtree_ordered.h               parent->right = rotate_right (sibling->left, sibling);
right             346 maint/gnulib/lib/gl_rbtree_ordered.h               sibling = parent->right;
right             353 maint/gnulib/lib/gl_rbtree_ordered.h               sibling->right->color = BLACK;
right             388 maint/gnulib/lib/gl_rbtree_ordered.h       else if (parent->right == child)
right             420 maint/gnulib/lib/gl_rbtree_ordered.h               parentp = &sibling->right;
right             448 maint/gnulib/lib/gl_rbtree_ordered.h           else if (sibling->right != NULL && sibling->right->color == RED)
right             465 maint/gnulib/lib/gl_rbtree_ordered.h               parent->left = rotate_left (sibling, sibling->right);
right             540 maint/gnulib/lib/gl_rbtree_ordered.h   new_node->right = NULL;
right             573 maint/gnulib/lib/gl_rbtree_ordered.h   new_node->right = NULL;
right             580 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = node->left; node->right != NULL; )
right             581 maint/gnulib/lib/gl_rbtree_ordered.h         node = node->right;
right             582 maint/gnulib/lib/gl_rbtree_ordered.h       node->right = new_node;
right             613 maint/gnulib/lib/gl_rbtree_ordered.h   new_node->right = NULL;
right             616 maint/gnulib/lib/gl_rbtree_ordered.h   if (node->right == NULL)
right             617 maint/gnulib/lib/gl_rbtree_ordered.h     node->right = new_node;
right             620 maint/gnulib/lib/gl_rbtree_ordered.h       for (node = node->right; node->left != NULL; )
right             656 maint/gnulib/lib/gl_rbtree_ordered.h       NODE_T child = node->right;
right             672 maint/gnulib/lib/gl_rbtree_ordered.h             parent->right = child;
right             678 maint/gnulib/lib/gl_rbtree_ordered.h   else if (node->right == NULL)
right             696 maint/gnulib/lib/gl_rbtree_ordered.h             parent->right = child;
right             707 maint/gnulib/lib/gl_rbtree_ordered.h       for (subst = node->left; subst->right != NULL; )
right             708 maint/gnulib/lib/gl_rbtree_ordered.h         subst = subst->right;
right             731 maint/gnulib/lib/gl_rbtree_ordered.h           subst_parent->right = child;
right             742 maint/gnulib/lib/gl_rbtree_ordered.h       subst->right = node->right;
right             743 maint/gnulib/lib/gl_rbtree_ordered.h       subst->right->parent = subst;
right             751 maint/gnulib/lib/gl_rbtree_ordered.h         parent->right = subst;
right             786 maint/gnulib/lib/gl_rbtree_ordered.h     (node->right != NULL ? check_invariants (node->right, node, counterp) : 0);
right              70 maint/gnulib/lib/gl_rbtreehash_list.c     (node->right != NULL ? check_invariants (node->right, node) : 0);
right              76 maint/gnulib/lib/gl_rbtreehash_list.c            + 1 + (node->right != NULL ? node->right->branch_size : 0)))
right             104 maint/gnulib/lib/regcomp.c 				bin_tree_t *left, bin_tree_t *right,
right             107 maint/gnulib/lib/regcomp.c 				      bin_tree_t *left, bin_tree_t *right,
right            1197 maint/gnulib/lib/regcomp.c       while (node->left || node->right)
right            1201 maint/gnulib/lib/regcomp.c 	  node = node->right;
right            1214 maint/gnulib/lib/regcomp.c       while (node->right == prev || node->right == NULL);
right            1215 maint/gnulib/lib/regcomp.c       node = node->right;
right            1237 maint/gnulib/lib/regcomp.c 	  while (node->right == prev || node->right == NULL)
right            1244 maint/gnulib/lib/regcomp.c 	  node = node->right;
right            1295 maint/gnulib/lib/regcomp.c   if (node->right && node->right->token.type == SUBEXP)
right            1297 maint/gnulib/lib/regcomp.c       node->right = lower_subexp (&err, preg, node->right);
right            1298 maint/gnulib/lib/regcomp.c       if (node->right)
right            1299 maint/gnulib/lib/regcomp.c 	node->right->parent = node;
right            1374 maint/gnulib/lib/regcomp.c       node->left->next = node->right->first;
right            1375 maint/gnulib/lib/regcomp.c       node->right->next = node->next;
right            1380 maint/gnulib/lib/regcomp.c       if (node->right)
right            1381 maint/gnulib/lib/regcomp.c 	node->right->next = node->next;
right            1407 maint/gnulib/lib/regcomp.c 	Idx left, right;
right            1413 maint/gnulib/lib/regcomp.c 	if (node->right != NULL)
right            1414 maint/gnulib/lib/regcomp.c 	  right = node->right->first->node_idx;
right            1416 maint/gnulib/lib/regcomp.c 	  right = node->next->node_idx;
right            1418 maint/gnulib/lib/regcomp.c 	DEBUG_ASSERT (right > -1);
right            1419 maint/gnulib/lib/regcomp.c 	err = re_node_set_init_2 (dfa->edests + idx, left, right);
right            3659 maint/gnulib/lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
right            3663 maint/gnulib/lib/regcomp.c   return create_token_tree (dfa, left, right, &t);
right            3667 maint/gnulib/lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
right            3685 maint/gnulib/lib/regcomp.c   tree->right = right;
right            3695 maint/gnulib/lib/regcomp.c   if (right != NULL)
right            3696 maint/gnulib/lib/regcomp.c     right->parent = tree;
right            3766 maint/gnulib/lib/regcomp.c 	  while (node->right == prev || node->right == NULL)
right            3774 maint/gnulib/lib/regcomp.c 	  node = node->right;
right            3775 maint/gnulib/lib/regcomp.c 	  p_new = &dup_node->right;
right            1345 maint/gnulib/lib/regex_internal.c   __re_size_t idx, right, mid;
right            1351 maint/gnulib/lib/regex_internal.c   right = set->nelem - 1;
right            1352 maint/gnulib/lib/regex_internal.c   while (idx < right)
right            1354 maint/gnulib/lib/regex_internal.c       mid = (idx + right) / 2;
right            1358 maint/gnulib/lib/regex_internal.c 	right = mid;
right             463 maint/gnulib/lib/regex_internal.h   struct bin_tree_t *right;
right            4137 maint/gnulib/lib/regexec.c   Idx left, right, mid, last;
right            4138 maint/gnulib/lib/regexec.c   last = right = mctx->nbkref_ents;
right            4139 maint/gnulib/lib/regexec.c   for (left = 0; left < right;)
right            4141 maint/gnulib/lib/regexec.c       mid = (left + right) / 2;
right            4145 maint/gnulib/lib/regexec.c 	right = mid;
right             121 maint/gnulib/lib/tsearch.c   struct node_t *right;
right             146 maint/gnulib/lib/tsearch.c   check_tree_recurse (p->right, d_sofar + (p->right && !p->right->red), d_total);
right             149 maint/gnulib/lib/tsearch.c   if (p->right)
right             150 maint/gnulib/lib/tsearch.c     assert (!(p->right->red && p->red));
right             187 maint/gnulib/lib/tsearch.c   rp = &(*rootp)->right;
right             224 maint/gnulib/lib/tsearch.c                   gp->right = *lp;
right             230 maint/gnulib/lib/tsearch.c                   p->right = *lp;
right             247 maint/gnulib/lib/tsearch.c                   gp->left = p->right;
right             248 maint/gnulib/lib/tsearch.c                   p->right = gp;
right             253 maint/gnulib/lib/tsearch.c                   gp->right = p->left;
right             295 maint/gnulib/lib/tsearch.c       nextp = r < 0 ? &root->left : &root->right;
right             313 maint/gnulib/lib/tsearch.c       q->left = q->right = NULL;
right             350 maint/gnulib/lib/tsearch.c       rootp = r < 0 ? &root->left : &root->right;
right             393 maint/gnulib/lib/tsearch.c                : &(*rootp)->right);
right             409 maint/gnulib/lib/tsearch.c   r = root->right;
right             416 maint/gnulib/lib/tsearch.c       node *parent = rootp, *up = &root->right;
right             434 maint/gnulib/lib/tsearch.c     r = unchained->right;
right             440 maint/gnulib/lib/tsearch.c       if (unchained == q->right)
right             441 maint/gnulib/lib/tsearch.c         q->right = r;
right             466 maint/gnulib/lib/tsearch.c               q = p->right;
right             479 maint/gnulib/lib/tsearch.c                   p->right = q->left;
right             485 maint/gnulib/lib/tsearch.c                   q = p->right;
right             490 maint/gnulib/lib/tsearch.c                   && (q->right == NULL || !q->right->red))
right             508 maint/gnulib/lib/tsearch.c                   if (q->right == NULL || !q->right->red)
right             522 maint/gnulib/lib/tsearch.c                       p->right = q2->left;
right             523 maint/gnulib/lib/tsearch.c                       q->left = q2->right;
right             524 maint/gnulib/lib/tsearch.c                       q2->right = q;
right             538 maint/gnulib/lib/tsearch.c                       q->right->red = 0;
right             541 maint/gnulib/lib/tsearch.c                       p->right = q->left;
right             559 maint/gnulib/lib/tsearch.c                   p->left = q->right;
right             560 maint/gnulib/lib/tsearch.c                   q->right = p;
right             562 maint/gnulib/lib/tsearch.c                   nodestack[sp++] = pp = &q->right;
right             565 maint/gnulib/lib/tsearch.c               if ((q->right == NULL || !q->right->red)
right             575 maint/gnulib/lib/tsearch.c                       node q2 = q->right;
right             577 maint/gnulib/lib/tsearch.c                       p->left = q2->right;
right             578 maint/gnulib/lib/tsearch.c                       q->right = q2->left;
right             580 maint/gnulib/lib/tsearch.c                       q2->right = p;
right             589 maint/gnulib/lib/tsearch.c                       p->left = q->right;
right             590 maint/gnulib/lib/tsearch.c                       q->right = p;
right             624 maint/gnulib/lib/tsearch.c   if (root->left == NULL && root->right == NULL)
right             632 maint/gnulib/lib/tsearch.c       if (root->right != NULL)
right             633 maint/gnulib/lib/tsearch.c         trecurse (root->right, action, level + 1);
right             669 maint/gnulib/lib/tsearch.c   if (root->right != NULL)
right             670 maint/gnulib/lib/tsearch.c     tdestroy_recurse (root->right, freefct);