left 352 daemons/controld/controld_join_dc.c compare_int_fields(xmlNode * left, xmlNode * right, const char *field) left 354 daemons/controld/controld_join_dc.c const char *elem_l = crm_element_value(left, field); left 144 include/crm/common/xml.h xmlNode *diff_xml_object(xmlNode * left, xmlNode * right, gboolean suppress); left 146 include/crm/common/xml.h xmlNode *subtract_xml_object(xmlNode * parent, xmlNode * left, xmlNode * right, left 29 lib/common/patchset.c static xmlNode *subtract_xml_comment(xmlNode *parent, xmlNode *left, left 1214 lib/common/patchset.c subtract_xml_comment(xmlNode *parent, xmlNode *left, xmlNode *right, left 1217 lib/common/patchset.c CRM_CHECK(left != NULL, return NULL); left 1218 lib/common/patchset.c CRM_CHECK(left->type == XML_COMMENT_NODE, return NULL); left 1220 lib/common/patchset.c if ((right == NULL) || !pcmk__str_eq((const char *)left->content, left 1225 lib/common/patchset.c deleted = add_node_copy(parent, left); left 1235 lib/common/patchset.c subtract_xml_object(xmlNode *parent, xmlNode *left, xmlNode *right, left 1253 lib/common/patchset.c if (left == NULL) { left 1257 lib/common/patchset.c if (left->type == XML_COMMENT_NODE) { left 1258 lib/common/patchset.c return subtract_xml_comment(parent, left, right, changed); left 1261 lib/common/patchset.c id = ID(left); left 1262 lib/common/patchset.c name = (const char *) left->name; left 1268 lib/common/patchset.c deleted = add_node_copy(parent, left); left 1276 lib/common/patchset.c CRM_CHECK(pcmk__xe_is(left, (const char *) right->name), return NULL); left 1290 lib/common/patchset.c for (left_child = pcmk__xml_first_child(left); left_child != NULL; left 1308 lib/common/patchset.c for (pIter = pcmk__xe_first_attr(left); pIter != NULL; left 1321 lib/common/patchset.c for (xIter = pcmk__xe_first_attr(left); xIter != NULL; left 1349 lib/common/patchset.c for (pIter = pcmk__xe_first_attr(left); pIter != NULL; left 1379 lib/common/patchset.c for (pIter = pcmk__xe_first_attr(left); pIter != NULL; left 37 libltdl/slist.c static SList * slist_sort_merge (SList *left, SList *right, left 273 libltdl/slist.c slist_sort_merge (SList *left, SList *right, SListCompare *compare, left 280 libltdl/slist.c while (left && right) left 282 libltdl/slist.c if ((*compare) (left, right, userdata) <= 0) left 284 libltdl/slist.c insert = insert->next = left; left 285 libltdl/slist.c left = left->next; left 294 libltdl/slist.c insert->next = left ? left : right; left 309 libltdl/slist.c SList *left, *right; left 315 libltdl/slist.c left = slist; left 319 libltdl/slist.c return left; left 333 libltdl/slist.c return slist_sort_merge (slist_sort (left, compare, userdata), left 960 maint/gnulib/lib/argp-help.c unsigned left; left 982 maint/gnulib/lib/argp-help.c for (e = entries, left = hol->num_entries; left > 0; e++, left--) left 990 maint/gnulib/lib/argp-help.c for (left = more->num_entries; left > 0; e++, left--) left 323 maint/gnulib/lib/des.c int i, left, right, middle, cmp_result; left 330 maint/gnulib/lib/des.c left = 0; left 332 maint/gnulib/lib/des.c while (left <= right) left 334 maint/gnulib/lib/des.c middle = (left + right) / 2; left 340 maint/gnulib/lib/des.c left = middle + 1; left 362 maint/gnulib/lib/des.c #define INITIAL_PERMUTATION(left, temp, right) \ left 363 maint/gnulib/lib/des.c DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f) \ left 364 maint/gnulib/lib/des.c DO_PERMUTATION(left, temp, right, 16, 0x0000ffff) \ left 365 maint/gnulib/lib/des.c DO_PERMUTATION(right, temp, left, 2, 0x33333333) \ left 366 maint/gnulib/lib/des.c DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff) \ left 368 maint/gnulib/lib/des.c temp = (left ^ right) & 0xaaaaaaaa; \ left 370 maint/gnulib/lib/des.c left ^= temp; \ left 371 maint/gnulib/lib/des.c left = (left << 1) | (left >> 31); left 376 maint/gnulib/lib/des.c #define FINAL_PERMUTATION(left, temp, right) \ left 377 maint/gnulib/lib/des.c left = (left << 31) | (left >> 1); \ left 378 maint/gnulib/lib/des.c temp = (left ^ right) & 0xaaaaaaaa; \ left 379 maint/gnulib/lib/des.c left ^= temp; \ left 382 maint/gnulib/lib/des.c DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff) \ left 383 maint/gnulib/lib/des.c DO_PERMUTATION(right, temp, left, 2, 0x33333333) \ left 384 maint/gnulib/lib/des.c DO_PERMUTATION(left, temp, right, 16, 0x0000ffff) \ left 385 maint/gnulib/lib/des.c DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f) left 409 maint/gnulib/lib/des.c #define READ_64BIT_DATA(data, left, right) \ left 410 maint/gnulib/lib/des.c left = ((uint32_t) data[0] << 24) \ left 419 maint/gnulib/lib/des.c #define WRITE_64BIT_DATA(data, left, right) \ left 420 maint/gnulib/lib/des.c data[0] = (left >> 24) &0xff; data[1] = (left >> 16) &0xff; \ left 421 maint/gnulib/lib/des.c data[2] = (left >> 8) &0xff; data[3] = left &0xff; \ left 440 maint/gnulib/lib/des.c uint32_t left, right, work; left 443 maint/gnulib/lib/des.c READ_64BIT_DATA (rawkey, left, right) left 444 maint/gnulib/lib/des.c DO_PERMUTATION (right, work, left, 4, 0x0f0f0f0f) left 445 maint/gnulib/lib/des.c DO_PERMUTATION (right, work, left, 0, 0x10101010) left 446 maint/gnulib/lib/des.c left = ((leftkey_swap[(left >> 0) & 0xf] << 3) left 447 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 8) & 0xf] << 2) left 448 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 16) & 0xf] << 1) left 449 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 24) & 0xf]) left 450 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 5) & 0xf] << 7) left 451 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 13) & 0xf] << 6) left 452 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 21) & 0xf] << 5) left 453 maint/gnulib/lib/des.c | (leftkey_swap[(left >> 29) & 0xf] << 4)); left 455 maint/gnulib/lib/des.c left &= 0x0fffffff; left 470 maint/gnulib/lib/des.c left = ((left << encrypt_rotate_tab[round]) left 471 maint/gnulib/lib/des.c | (left >> (28 - encrypt_rotate_tab[round]))) & 0x0fffffff; left 475 maint/gnulib/lib/des.c *subkey++ = (((left << 4) & 0x24000000) left 476 maint/gnulib/lib/des.c | ((left << 28) & 0x10000000) left 477 maint/gnulib/lib/des.c | ((left << 14) & 0x08000000) left 478 maint/gnulib/lib/des.c | ((left << 18) & 0x02080000) left 479 maint/gnulib/lib/des.c | ((left << 6) & 0x01000000) left 480 maint/gnulib/lib/des.c | ((left << 9) & 0x00200000) left 481 maint/gnulib/lib/des.c | ((left >> 1) & 0x00100000) left 482 maint/gnulib/lib/des.c | ((left << 10) & 0x00040000) left 483 maint/gnulib/lib/des.c | ((left << 2) & 0x00020000) left 484 maint/gnulib/lib/des.c | ((left >> 10) & 0x00010000) left 498 maint/gnulib/lib/des.c *subkey++ = (((left << 15) & 0x20000000) left 499 maint/gnulib/lib/des.c | ((left << 17) & 0x10000000) left 500 maint/gnulib/lib/des.c | ((left << 10) & 0x08000000) left 501 maint/gnulib/lib/des.c | ((left << 22) & 0x04000000) left 502 maint/gnulib/lib/des.c | ((left >> 2) & 0x02000000) left 503 maint/gnulib/lib/des.c | ((left << 1) & 0x01000000) left 504 maint/gnulib/lib/des.c | ((left << 16) & 0x00200000) left 505 maint/gnulib/lib/des.c | ((left << 11) & 0x00100000) left 506 maint/gnulib/lib/des.c | ((left << 3) & 0x00080000) left 507 maint/gnulib/lib/des.c | ((left >> 6) & 0x00040000) left 508 maint/gnulib/lib/des.c | ((left << 15) & 0x00020000) left 509 maint/gnulib/lib/des.c | ((left >> 4) & 0x00010000) left 553 maint/gnulib/lib/des.c uint32_t left, right, work; left 558 maint/gnulib/lib/des.c READ_64BIT_DATA (from, left, right) left 559 maint/gnulib/lib/des.c INITIAL_PERMUTATION (left, work, right) left 560 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 561 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 562 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 563 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 564 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 565 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 566 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 567 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 568 maint/gnulib/lib/des.c FINAL_PERMUTATION (right, work, left) left 569 maint/gnulib/lib/des.c WRITE_64BIT_DATA (to, right, left) left 626 maint/gnulib/lib/des.c uint32_t left, right, work; left 631 maint/gnulib/lib/des.c READ_64BIT_DATA (from, left, right) left 632 maint/gnulib/lib/des.c INITIAL_PERMUTATION (left, work, right) left 633 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 634 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 635 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 636 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 637 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 638 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 639 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 640 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 641 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 642 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 643 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 644 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 645 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 646 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 647 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 648 maint/gnulib/lib/des.c DES_ROUND (left, right, work, keys) DES_ROUND (right, left, work, keys) left 649 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 650 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 651 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 652 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 653 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 654 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 655 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 656 maint/gnulib/lib/des.c DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) left 657 maint/gnulib/lib/des.c FINAL_PERMUTATION (right, work, left) left 658 maint/gnulib/lib/des.c WRITE_64BIT_DATA (to, right, left) left 435 maint/gnulib/lib/dfa.c idx_t left; /* Number of characters remaining. */ left 882 maint/gnulib/lib/dfa.c int nbytes = mbs_to_wchar (&dfa->lex.wctok, dfa->lex.ptr, dfa->lex.left, left 886 maint/gnulib/lib/dfa.c dfa->lex.left -= nbytes; left 895 maint/gnulib/lib/dfa.c if (! dfa->lex.left) left 991 maint/gnulib/lib/dfa.c if (dfa->lex.left == 0 left 1074 maint/gnulib/lib/dfa.c dfa->lex.left++; left 1168 maint/gnulib/lib/dfa.c idx_t left; left 1175 maint/gnulib/lib/dfa.c ls->left = dfa->lex.left; left 1177 maint/gnulib/lib/dfa.c dfa->lex.left = strlen (s); left 1184 maint/gnulib/lib/dfa.c dfa->lex.left = ls->left; left 1200 maint/gnulib/lib/dfa.c if (! dfa->lex.left) left 1209 maint/gnulib/lib/dfa.c if (dfa->lex.left == 0) left 1227 maint/gnulib/lib/dfa.c || dfa->lex.left == 0 left 1228 maint/gnulib/lib/dfa.c || ((dfa->lex.left left 1233 maint/gnulib/lib/dfa.c || ((dfa->lex.left left 1239 maint/gnulib/lib/dfa.c && dfa->lex.left > 0 && dfa->lex.ptr[0] == '\n')) left 1340 maint/gnulib/lib/dfa.c char const *lim = p + dfa->lex.left; left 1376 maint/gnulib/lib/dfa.c dfa->lex.left = lim - p; left 1970 maint/gnulib/lib/dfa.c d->lex.left = len; left 3962 maint/gnulib/lib/dfa.c comsubs (char *left, char const *right) left 3966 maint/gnulib/lib/dfa.c for (char *lcp = left; *lcp != '\0'; lcp++) left 3996 maint/gnulib/lib/dfa.c inboth (char **left, char **right) left 4000 maint/gnulib/lib/dfa.c for (idx_t lnum = 0; left[lnum] != NULL; lnum++) left 4004 maint/gnulib/lib/dfa.c char **temp = comsubs (left[lnum], right[rnum]); left 4018 maint/gnulib/lib/dfa.c char *left; left 4031 maint/gnulib/lib/dfa.c new_mp->left = xizalloc (size); left 4045 maint/gnulib/lib/dfa.c mp->left[0] = mp->right[0] = mp->is[0] = '\0'; left 4055 maint/gnulib/lib/dfa.c free (mp->left); left 4132 maint/gnulib/lib/dfa.c while (lmp->left[i] != '\0' && lmp->left[i] == rmp->left[i]) left 4134 maint/gnulib/lib/dfa.c lmp->left[i] = '\0'; left 4187 maint/gnulib/lib/dfa.c if (lmp->right[0] != '\0' && rmp->left[0] != '\0') left 4190 maint/gnulib/lib/dfa.c idx_t rllen = strlen (rmp->left); left 4192 maint/gnulib/lib/dfa.c memcpy (tp + lrlen, rmp->left, rllen + 1); left 4198 maint/gnulib/lib/dfa.c lmp->left = icatalloc (lmp->left, rmp->left); left 4266 maint/gnulib/lib/dfa.c mp->is[0] = mp->left[0] = mp->right[0] left 4274 maint/gnulib/lib/dfa.c mp->is[i] = mp->left[i] = mp->right[i] left 4277 maint/gnulib/lib/dfa.c mp->is[i] = mp->left[i] = mp->right[i] = '\0'; left 39 maint/gnulib/lib/gl_anyavltree_list1.h struct gl_list_node_impl *left; /* left branch, or NULL */ left 38 maint/gnulib/lib/gl_anyavltree_list2.h node->left = create_subtree_with_contents (half1, contents); left 39 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left == NULL) left 41 maint/gnulib/lib/gl_anyavltree_list2.h node->left->parent = node; left 44 maint/gnulib/lib/gl_anyavltree_list2.h node->left = NULL; left 69 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left != NULL) left 70 maint/gnulib/lib/gl_anyavltree_list2.h free_subtree (node->left); left 166 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left != NULL || node->right != NULL) left 183 maint/gnulib/lib/gl_anyavltree_list2.h else if (node->parent->left == node) left 184 maint/gnulib/lib/gl_anyavltree_list2.h nodep = &node->parent->left; left 190 maint/gnulib/lib/gl_anyavltree_list2.h nodeleft = node->left; left 202 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t nodeleftleft = nodeleft->left; left 213 maint/gnulib/lib/gl_anyavltree_list2.h node->left = nodeleftright; left 253 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t L = nodeleft->right = nodeleftright->left; left 254 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t R = node->left = nodeleftright->right; left 255 maint/gnulib/lib/gl_anyavltree_list2.h nodeleftright->left = nodeleft; left 271 maint/gnulib/lib/gl_anyavltree_list2.h (nodeleft->left != NULL ? nodeleft->left->branch_size : 0) left 274 maint/gnulib/lib/gl_anyavltree_list2.h (node->left != NULL ? node->left->branch_size : 0) left 300 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t noderightleft = noderight->left; left 312 maint/gnulib/lib/gl_anyavltree_list2.h noderight->left = node; left 351 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t L = node->right = noderightleft->left; left 352 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t R = noderight->left = noderightleft->right; left 353 maint/gnulib/lib/gl_anyavltree_list2.h noderightleft->left = node; left 369 maint/gnulib/lib/gl_anyavltree_list2.h (node->left != NULL ? node->left->branch_size : 0) left 372 maint/gnulib/lib/gl_anyavltree_list2.h (noderight->left != NULL ? noderight->left->branch_size : 0) left 415 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left == NULL) left 426 maint/gnulib/lib/gl_anyavltree_list2.h if (parent->left == node) left 427 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = child; left 447 maint/gnulib/lib/gl_anyavltree_list2.h gl_list_node_t child = node->left; left 454 maint/gnulib/lib/gl_anyavltree_list2.h if (parent->left == node) left 455 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = child; left 477 maint/gnulib/lib/gl_anyavltree_list2.h for (subst = node->left; subst->right != NULL; ) left 482 maint/gnulib/lib/gl_anyavltree_list2.h child = subst->left; left 515 maint/gnulib/lib/gl_anyavltree_list2.h subst->left = node->left; left 516 maint/gnulib/lib/gl_anyavltree_list2.h subst->left->parent = subst; left 525 maint/gnulib/lib/gl_anyavltree_list2.h else if (parent->left == node) left 526 maint/gnulib/lib/gl_anyavltree_list2.h parent->left = subst; left 547 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; left 569 maint/gnulib/lib/gl_anyavltree_list2.h for (node = list->root; node->left != NULL; ) left 570 maint/gnulib/lib/gl_anyavltree_list2.h node = node->left; left 572 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; left 615 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; left 653 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left == NULL && node->parent != NULL) left 685 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; left 698 maint/gnulib/lib/gl_anyavltree_list2.h if (node->left == NULL) left 700 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; left 706 maint/gnulib/lib/gl_anyavltree_list2.h for (node = node->left; node->right != NULL; ) left 710 maint/gnulib/lib/gl_anyavltree_list2.h height_inc = (node->left == NULL); left 754 maint/gnulib/lib/gl_anyavltree_list2.h new_node->left = NULL; left 771 maint/gnulib/lib/gl_anyavltree_list2.h height_inc = (node->left == NULL); left 775 maint/gnulib/lib/gl_anyavltree_list2.h for (node = node->right; node->left != NULL; ) left 776 maint/gnulib/lib/gl_anyavltree_list2.h node = node->left; left 777 maint/gnulib/lib/gl_anyavltree_list2.h node->left = new_node; left 45 maint/gnulib/lib/gl_anyrbtree_list1.h struct gl_list_node_impl *left; /* left branch, or NULL */ left 43 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = left 45 maint/gnulib/lib/gl_anyrbtree_list2.h if (node->left == NULL) left 47 maint/gnulib/lib/gl_anyrbtree_list2.h node->left->parent = node; left 50 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = NULL; left 74 maint/gnulib/lib/gl_anyrbtree_list2.h if (node->left != NULL) left 75 maint/gnulib/lib/gl_anyrbtree_list2.h free_subtree (node->left); left 169 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t a_node = b_node->left; left 170 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t c_node = d_node->left; left 174 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->left = b_node; left 203 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t a_node = b_node->left; left 207 maint/gnulib/lib/gl_anyrbtree_list2.h d_node->left = c_node; left 249 maint/gnulib/lib/gl_anyrbtree_list2.h if (grandparent->left == parent) left 252 maint/gnulib/lib/gl_anyrbtree_list2.h uncle = grandparent->left; left 275 maint/gnulib/lib/gl_anyrbtree_list2.h else if (grandparent->parent->left == grandparent) left 276 maint/gnulib/lib/gl_anyrbtree_list2.h grandparentp = &grandparent->parent->left; left 282 maint/gnulib/lib/gl_anyrbtree_list2.h if (grandparent->left == parent) left 287 maint/gnulib/lib/gl_anyrbtree_list2.h grandparent->left = rotate_left (parent, node); left 289 maint/gnulib/lib/gl_anyrbtree_list2.h parent = grandparent->left; left 309 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) left 365 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->parent->left == parent) left 366 maint/gnulib/lib/gl_anyrbtree_list2.h parentp = &parent->parent->left; left 372 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == child) left 404 maint/gnulib/lib/gl_anyrbtree_list2.h parentp = &sibling->left; left 432 maint/gnulib/lib/gl_anyrbtree_list2.h else if (sibling->left != NULL && sibling->left->color == RED) left 449 maint/gnulib/lib/gl_anyrbtree_list2.h parent->right = rotate_right (sibling->left, sibling); left 496 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t sibling = parent->left; left 527 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->left; left 536 maint/gnulib/lib/gl_anyrbtree_list2.h if (sibling->left != NULL && sibling->left->color == RED) left 551 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->left->color = BLACK; left 571 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = rotate_left (sibling, sibling->right); left 574 maint/gnulib/lib/gl_anyrbtree_list2.h sibling = parent->left; left 581 maint/gnulib/lib/gl_anyrbtree_list2.h sibling->left->color = BLACK; left 640 maint/gnulib/lib/gl_anyrbtree_list2.h if (node->left == NULL) left 656 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) left 657 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = child; left 678 maint/gnulib/lib/gl_anyrbtree_list2.h gl_list_node_t child = node->left; left 688 maint/gnulib/lib/gl_anyrbtree_list2.h if (parent->left == node) left 689 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = child; left 710 maint/gnulib/lib/gl_anyrbtree_list2.h for (subst = node->left; subst->right != NULL; ) left 715 maint/gnulib/lib/gl_anyrbtree_list2.h child = subst->left; left 750 maint/gnulib/lib/gl_anyrbtree_list2.h subst->left = node->left; left 751 maint/gnulib/lib/gl_anyrbtree_list2.h subst->left->parent = subst; left 760 maint/gnulib/lib/gl_anyrbtree_list2.h else if (parent->left == node) left 761 maint/gnulib/lib/gl_anyrbtree_list2.h parent->left = subst; left 790 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; left 812 maint/gnulib/lib/gl_anyrbtree_list2.h for (node = list->root; node->left != NULL; ) left 813 maint/gnulib/lib/gl_anyrbtree_list2.h node = node->left; left 815 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; left 856 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; left 922 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; left 934 maint/gnulib/lib/gl_anyrbtree_list2.h if (node->left == NULL) left 935 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; left 938 maint/gnulib/lib/gl_anyrbtree_list2.h for (node = node->left; node->right != NULL; ) left 981 maint/gnulib/lib/gl_anyrbtree_list2.h new_node->left = NULL; left 997 maint/gnulib/lib/gl_anyrbtree_list2.h for (node = node->right; node->left != NULL; ) left 998 maint/gnulib/lib/gl_anyrbtree_list2.h node = node->left; left 999 maint/gnulib/lib/gl_anyrbtree_list2.h node->left = new_node; left 36 maint/gnulib/lib/gl_anytree_list1.h if (node->left != NULL) left 37 maint/gnulib/lib/gl_anytree_list1.h free_subtree (node->left); left 112 maint/gnulib/lib/gl_anytree_list2.h while (node->left != NULL) left 113 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 128 maint/gnulib/lib/gl_anytree_list2.h if (node->left != NULL) left 130 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 136 maint/gnulib/lib/gl_anytree_list2.h while (node->parent != NULL && node->parent->left == node) left 150 maint/gnulib/lib/gl_anytree_list2.h while (node->left != NULL) left 151 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 178 maint/gnulib/lib/gl_anytree_list2.h if (node->left != NULL) left 180 maint/gnulib/lib/gl_anytree_list2.h if (position < node->left->branch_size) left 182 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 185 maint/gnulib/lib/gl_anytree_list2.h position -= node->left->branch_size; left 278 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 321 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 337 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0) + 1; left 389 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 432 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 448 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0) + 1; left 551 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 592 maint/gnulib/lib/gl_anytree_list2.h while (node->left != NULL) left 593 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 644 maint/gnulib/lib/gl_anytree_list2.h while (node->left != NULL) left 645 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 680 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 686 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 699 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 724 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0); left 733 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 746 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 752 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 756 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0); left 779 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 803 maint/gnulib/lib/gl_anytree_list2.h if (node->left != NULL) left 804 maint/gnulib/lib/gl_anytree_list2.h position += node->left->branch_size; left 809 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 815 maint/gnulib/lib/gl_anytree_list2.h position + (node->left != NULL ? node->left->branch_size : 0); left 816 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 823 maint/gnulib/lib/gl_anytree_list2.h if (node->left != NULL) left 824 maint/gnulib/lib/gl_anytree_list2.h position += node->left->branch_size; left 835 maint/gnulib/lib/gl_anytree_list2.h + (node->left != NULL ? node->left->branch_size : 0); left 836 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 862 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0); left 872 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 886 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 892 maint/gnulib/lib/gl_anytree_list2.h position + (node->left != NULL ? node->left->branch_size : 0); left 893 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 897 maint/gnulib/lib/gl_anytree_list2.h (node->left != NULL ? node->left->branch_size : 0); left 920 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 952 maint/gnulib/lib/gl_anytree_list2.h if (node->left == NULL) left 954 maint/gnulib/lib/gl_anytree_list2.h node = node->left; left 74 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 102 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 110 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 156 maint/gnulib/lib/gl_anytree_omap.h if (node->left == NULL) left 162 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 189 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 218 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 259 maint/gnulib/lib/gl_anytree_omap.h while (node->left != NULL) left 260 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 286 maint/gnulib/lib/gl_anytree_omap.h while (node->left != NULL) left 287 maint/gnulib/lib/gl_anytree_omap.h node = node->left; left 63 maint/gnulib/lib/gl_anytree_oset.h while (node->left != NULL) left 64 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 79 maint/gnulib/lib/gl_anytree_oset.h if (node->left != NULL) left 81 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 87 maint/gnulib/lib/gl_anytree_oset.h while (node->parent != NULL && node->parent->left == node) left 110 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 135 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 143 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 169 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 211 maint/gnulib/lib/gl_anytree_oset.h if (node->left == NULL) left 217 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 287 maint/gnulib/lib/gl_anytree_oset.h if (node->left == NULL) left 292 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 325 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 364 maint/gnulib/lib/gl_anytree_oset.h while (node->left != NULL) left 365 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 405 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 413 maint/gnulib/lib/gl_anytree_oset.h node = node->left; left 37 maint/gnulib/lib/gl_anytreehash_list1.h if (node->left != NULL) left 38 maint/gnulib/lib/gl_anytreehash_list1.h position += node->left->branch_size; left 49 maint/gnulib/lib/gl_anytreehash_list1.h if (parent->left != NULL) left 50 maint/gnulib/lib/gl_anytreehash_list1.h position += parent->left->branch_size; left 280 maint/gnulib/lib/gl_anytreehash_list1.h node = node->left; left 314 maint/gnulib/lib/gl_anytreehash_list1.h node = node->left; left 187 maint/gnulib/lib/gl_anytreehash_list2.h node = node->left; left 46 maint/gnulib/lib/gl_avltree_list.c (node->left != NULL ? check_invariants (node->left, node) : 0); left 54 maint/gnulib/lib/gl_avltree_list.c == (node->left != NULL ? node->left->branch_size : 0) left 32 maint/gnulib/lib/gl_avltree_ordered.h struct NODE_IMPL *left; /* left branch, or NULL */ left 85 maint/gnulib/lib/gl_avltree_ordered.h if (node->left != NULL || node->right != NULL) left 102 maint/gnulib/lib/gl_avltree_ordered.h else if (node->parent->left == node) left 103 maint/gnulib/lib/gl_avltree_ordered.h nodep = &node->parent->left; left 109 maint/gnulib/lib/gl_avltree_ordered.h nodeleft = node->left; left 131 maint/gnulib/lib/gl_avltree_ordered.h node->left = nodeleftright; left 165 maint/gnulib/lib/gl_avltree_ordered.h NODE_T L = nodeleft->right = nodeleftright->left; left 166 maint/gnulib/lib/gl_avltree_ordered.h NODE_T R = node->left = nodeleftright->right; left 167 maint/gnulib/lib/gl_avltree_ordered.h nodeleftright->left = nodeleft; left 203 maint/gnulib/lib/gl_avltree_ordered.h NODE_T noderightleft = noderight->left; left 214 maint/gnulib/lib/gl_avltree_ordered.h noderight->left = node; left 247 maint/gnulib/lib/gl_avltree_ordered.h NODE_T L = node->right = noderightleft->left; left 248 maint/gnulib/lib/gl_avltree_ordered.h NODE_T R = noderight->left = noderightleft->right; left 249 maint/gnulib/lib/gl_avltree_ordered.h noderightleft->left = node; left 307 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; left 322 maint/gnulib/lib/gl_avltree_ordered.h for (node = container->root; node->left != NULL; ) left 323 maint/gnulib/lib/gl_avltree_ordered.h node = node->left; left 325 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; left 344 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; left 349 maint/gnulib/lib/gl_avltree_ordered.h if (node->left == NULL) left 351 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; left 357 maint/gnulib/lib/gl_avltree_ordered.h for (node = node->left; node->right != NULL; ) left 361 maint/gnulib/lib/gl_avltree_ordered.h height_inc = (node->left == NULL); left 394 maint/gnulib/lib/gl_avltree_ordered.h new_node->left = NULL; left 403 maint/gnulib/lib/gl_avltree_ordered.h height_inc = (node->left == NULL); left 407 maint/gnulib/lib/gl_avltree_ordered.h for (node = node->right; node->left != NULL; ) left 408 maint/gnulib/lib/gl_avltree_ordered.h node = node->left; left 409 maint/gnulib/lib/gl_avltree_ordered.h node->left = new_node; left 443 maint/gnulib/lib/gl_avltree_ordered.h if (node->left == NULL) left 454 maint/gnulib/lib/gl_avltree_ordered.h if (parent->left == node) left 455 maint/gnulib/lib/gl_avltree_ordered.h parent->left = child; left 467 maint/gnulib/lib/gl_avltree_ordered.h NODE_T child = node->left; left 474 maint/gnulib/lib/gl_avltree_ordered.h if (parent->left == node) left 475 maint/gnulib/lib/gl_avltree_ordered.h parent->left = child; left 489 maint/gnulib/lib/gl_avltree_ordered.h for (subst = node->left; subst->right != NULL; ) left 494 maint/gnulib/lib/gl_avltree_ordered.h child = subst->left; left 519 maint/gnulib/lib/gl_avltree_ordered.h subst->left = node->left; left 520 maint/gnulib/lib/gl_avltree_ordered.h subst->left->parent = subst; left 528 maint/gnulib/lib/gl_avltree_ordered.h else if (parent->left == node) left 529 maint/gnulib/lib/gl_avltree_ordered.h parent->left = subst; left 556 maint/gnulib/lib/gl_avltree_ordered.h (node->left != NULL ? check_invariants (node->left, node, counterp) : 0); left 68 maint/gnulib/lib/gl_avltreehash_list.c (node->left != NULL ? check_invariants (node->left, node) : 0); left 76 maint/gnulib/lib/gl_avltreehash_list.c == (node->left != NULL ? node->left->branch_size : 0) left 46 maint/gnulib/lib/gl_rbtree_list.c (node->left != NULL ? check_invariants (node->left, node) : 0); left 53 maint/gnulib/lib/gl_rbtree_list.c == (node->left != NULL ? node->left->branch_size : 0) left 38 maint/gnulib/lib/gl_rbtree_ordered.h struct NODE_IMPL *left; /* left branch, or NULL */ left 79 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T c_node = d_node->left; left 82 maint/gnulib/lib/gl_rbtree_ordered.h d_node->left = b_node; left 107 maint/gnulib/lib/gl_rbtree_ordered.h d_node->left = c_node; left 143 maint/gnulib/lib/gl_rbtree_ordered.h if (grandparent->left == parent) left 146 maint/gnulib/lib/gl_rbtree_ordered.h uncle = grandparent->left; left 169 maint/gnulib/lib/gl_rbtree_ordered.h else if (grandparent->parent->left == grandparent) left 170 maint/gnulib/lib/gl_rbtree_ordered.h grandparentp = &grandparent->parent->left; left 176 maint/gnulib/lib/gl_rbtree_ordered.h if (grandparent->left == parent) left 181 maint/gnulib/lib/gl_rbtree_ordered.h grandparent->left = rotate_left (parent, node); left 183 maint/gnulib/lib/gl_rbtree_ordered.h parent = grandparent->left; left 203 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) left 259 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->parent->left == parent) left 260 maint/gnulib/lib/gl_rbtree_ordered.h parentp = &parent->parent->left; left 266 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == child) left 298 maint/gnulib/lib/gl_rbtree_ordered.h parentp = &sibling->left; left 326 maint/gnulib/lib/gl_rbtree_ordered.h else if (sibling->left != NULL && sibling->left->color == RED) left 343 maint/gnulib/lib/gl_rbtree_ordered.h parent->right = rotate_right (sibling->left, sibling); left 390 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T sibling = parent->left; left 421 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->left; left 430 maint/gnulib/lib/gl_rbtree_ordered.h if (sibling->left != NULL && sibling->left->color == RED) left 445 maint/gnulib/lib/gl_rbtree_ordered.h sibling->left->color = BLACK; left 465 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = rotate_left (sibling, sibling->right); left 468 maint/gnulib/lib/gl_rbtree_ordered.h sibling = parent->left; left 475 maint/gnulib/lib/gl_rbtree_ordered.h sibling->left->color = BLACK; left 539 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; left 554 maint/gnulib/lib/gl_rbtree_ordered.h for (node = container->root; node->left != NULL; ) left 555 maint/gnulib/lib/gl_rbtree_ordered.h node = node->left; left 557 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; left 572 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; left 576 maint/gnulib/lib/gl_rbtree_ordered.h if (node->left == NULL) left 577 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; left 580 maint/gnulib/lib/gl_rbtree_ordered.h for (node = node->left; node->right != NULL; ) left 612 maint/gnulib/lib/gl_rbtree_ordered.h new_node->left = NULL; left 620 maint/gnulib/lib/gl_rbtree_ordered.h for (node = node->right; node->left != NULL; ) left 621 maint/gnulib/lib/gl_rbtree_ordered.h node = node->left; left 622 maint/gnulib/lib/gl_rbtree_ordered.h node->left = new_node; left 653 maint/gnulib/lib/gl_rbtree_ordered.h if (node->left == NULL) left 669 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) left 670 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = child; left 683 maint/gnulib/lib/gl_rbtree_ordered.h NODE_T child = node->left; left 693 maint/gnulib/lib/gl_rbtree_ordered.h if (parent->left == node) left 694 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = child; left 707 maint/gnulib/lib/gl_rbtree_ordered.h for (subst = node->left; subst->right != NULL; ) left 712 maint/gnulib/lib/gl_rbtree_ordered.h child = subst->left; left 739 maint/gnulib/lib/gl_rbtree_ordered.h subst->left = node->left; left 740 maint/gnulib/lib/gl_rbtree_ordered.h subst->left->parent = subst; left 748 maint/gnulib/lib/gl_rbtree_ordered.h else if (parent->left == node) left 749 maint/gnulib/lib/gl_rbtree_ordered.h parent->left = subst; left 784 maint/gnulib/lib/gl_rbtree_ordered.h (node->left != NULL ? check_invariants (node->left, node, counterp) : 0); left 68 maint/gnulib/lib/gl_rbtreehash_list.c (node->left != NULL ? check_invariants (node->left, node) : 0); left 75 maint/gnulib/lib/gl_rbtreehash_list.c == (node->left != NULL ? node->left->branch_size : 0) left 104 maint/gnulib/lib/regcomp.c bin_tree_t *left, bin_tree_t *right, left 107 maint/gnulib/lib/regcomp.c bin_tree_t *left, bin_tree_t *right, left 1197 maint/gnulib/lib/regcomp.c while (node->left || node->right) left 1198 maint/gnulib/lib/regcomp.c if (node->left) left 1199 maint/gnulib/lib/regcomp.c node = node->left; left 1232 maint/gnulib/lib/regcomp.c if (node->left) left 1233 maint/gnulib/lib/regcomp.c node = node->left; left 1265 maint/gnulib/lib/regcomp.c && node->left && node->left->token.type == SUBEXP) left 1267 maint/gnulib/lib/regcomp.c Idx other_idx = node->left->token.opr.idx; left 1269 maint/gnulib/lib/regcomp.c node->left = node->left->left; left 1270 maint/gnulib/lib/regcomp.c if (node->left) left 1271 maint/gnulib/lib/regcomp.c node->left->parent = node; left 1289 maint/gnulib/lib/regcomp.c if (node->left && node->left->token.type == SUBEXP) left 1291 maint/gnulib/lib/regcomp.c node->left = lower_subexp (&err, preg, node->left); left 1292 maint/gnulib/lib/regcomp.c if (node->left) left 1293 maint/gnulib/lib/regcomp.c node->left->parent = node; left 1309 maint/gnulib/lib/regcomp.c bin_tree_t *body = node->left; left 1317 maint/gnulib/lib/regcomp.c && node->left != NULL left 1321 maint/gnulib/lib/regcomp.c return node->left; left 1349 maint/gnulib/lib/regcomp.c node->first = node->left->first; left 1350 maint/gnulib/lib/regcomp.c node->node_idx = node->left->node_idx; left 1371 maint/gnulib/lib/regcomp.c node->left->next = node; left 1374 maint/gnulib/lib/regcomp.c node->left->next = node->right->first; left 1378 maint/gnulib/lib/regcomp.c if (node->left) left 1379 maint/gnulib/lib/regcomp.c node->left->next = node->next; left 1407 maint/gnulib/lib/regcomp.c Idx left, right; left 1409 maint/gnulib/lib/regcomp.c if (node->left != NULL) left 1410 maint/gnulib/lib/regcomp.c left = node->left->first->node_idx; left 1412 maint/gnulib/lib/regcomp.c left = node->next->node_idx; left 1417 maint/gnulib/lib/regcomp.c DEBUG_ASSERT (left > -1); left 1419 maint/gnulib/lib/regcomp.c err = re_node_set_init_2 (dfa->edests + idx, left, right); left 3659 maint/gnulib/lib/regcomp.c create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, left 3663 maint/gnulib/lib/regcomp.c return create_token_tree (dfa, left, right, &t); left 3667 maint/gnulib/lib/regcomp.c create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, left 3684 maint/gnulib/lib/regcomp.c tree->left = left; left 3693 maint/gnulib/lib/regcomp.c if (left != NULL) left 3694 maint/gnulib/lib/regcomp.c left->parent = tree; left 3758 maint/gnulib/lib/regcomp.c if (node->left) left 3760 maint/gnulib/lib/regcomp.c node = node->left; left 3761 maint/gnulib/lib/regcomp.c p_new = &dup_node->left; left 462 maint/gnulib/lib/regex_internal.h struct bin_tree_t *left; left 4137 maint/gnulib/lib/regexec.c Idx left, right, mid, last; left 4139 maint/gnulib/lib/regexec.c for (left = 0; left < right;) left 4141 maint/gnulib/lib/regexec.c mid = (left + right) / 2; left 4143 maint/gnulib/lib/regexec.c left = mid + 1; left 4147 maint/gnulib/lib/regexec.c if (left < last && mctx->bkref_ents[left].str_idx == str_idx) left 4148 maint/gnulib/lib/regexec.c return left; left 120 maint/gnulib/lib/tsearch.c struct node_t *left; left 145 maint/gnulib/lib/tsearch.c check_tree_recurse (p->left, d_sofar + (p->left && !p->left->red), d_total); left 147 maint/gnulib/lib/tsearch.c if (p->left) left 148 maint/gnulib/lib/tsearch.c assert (!(p->left->red && p->red)); left 161 maint/gnulib/lib/tsearch.c for (p = root->left; p; p = p->left) left 188 maint/gnulib/lib/tsearch.c lp = &(*rootp)->left; left 222 maint/gnulib/lib/tsearch.c p->left = *rp; left 232 maint/gnulib/lib/tsearch.c gp->left = *rp; left 247 maint/gnulib/lib/tsearch.c gp->left = p->right; left 253 maint/gnulib/lib/tsearch.c gp->right = p->left; left 254 maint/gnulib/lib/tsearch.c p->left = gp; left 295 maint/gnulib/lib/tsearch.c nextp = r < 0 ? &root->left : &root->right; left 313 maint/gnulib/lib/tsearch.c q->left = q->right = NULL; left 350 maint/gnulib/lib/tsearch.c rootp = r < 0 ? &root->left : &root->right; left 392 maint/gnulib/lib/tsearch.c ? &(*rootp)->left left 410 maint/gnulib/lib/tsearch.c q = root->left; left 423 maint/gnulib/lib/tsearch.c if ((*up)->left == NULL) left 425 maint/gnulib/lib/tsearch.c up = &(*up)->left; left 432 maint/gnulib/lib/tsearch.c r = unchained->left; left 443 maint/gnulib/lib/tsearch.c q->left = r; left 462 maint/gnulib/lib/tsearch.c if (r == p->left) left 479 maint/gnulib/lib/tsearch.c p->right = q->left; left 480 maint/gnulib/lib/tsearch.c q->left = p; left 484 maint/gnulib/lib/tsearch.c nodestack[sp++] = pp = &q->left; left 489 maint/gnulib/lib/tsearch.c if ((q->left == NULL || !q->left->red) left 520 maint/gnulib/lib/tsearch.c node q2 = q->left; left 522 maint/gnulib/lib/tsearch.c p->right = q2->left; left 523 maint/gnulib/lib/tsearch.c q->left = q2->right; left 525 maint/gnulib/lib/tsearch.c q2->left = p; left 541 maint/gnulib/lib/tsearch.c p->right = q->left; left 542 maint/gnulib/lib/tsearch.c q->left = p; left 554 maint/gnulib/lib/tsearch.c q = p->left; left 559 maint/gnulib/lib/tsearch.c p->left = q->right; left 563 maint/gnulib/lib/tsearch.c q = p->left; left 566 maint/gnulib/lib/tsearch.c && (q->left == NULL || !q->left->red)) left 573 maint/gnulib/lib/tsearch.c if (q->left == NULL || !q->left->red) left 577 maint/gnulib/lib/tsearch.c p->left = q2->right; left 578 maint/gnulib/lib/tsearch.c q->right = q2->left; left 579 maint/gnulib/lib/tsearch.c q2->left = q; left 588 maint/gnulib/lib/tsearch.c q->left->red = 0; left 589 maint/gnulib/lib/tsearch.c p->left = q->right; left 624 maint/gnulib/lib/tsearch.c if (root->left == NULL && root->right == NULL) left 629 maint/gnulib/lib/tsearch.c if (root->left != NULL) left 630 maint/gnulib/lib/tsearch.c trecurse (root->left, action, level + 1); left 667 maint/gnulib/lib/tsearch.c if (root->left != NULL) left 668 maint/gnulib/lib/tsearch.c tdestroy_recurse (root->left, freefct);