left 103 ompi/mca/coll/base/coll_base_barrier.c int rank, size, err = 0, line = 0, left, right; left 112 ompi/mca/coll/base/coll_base_barrier.c left = ((rank-1)%size); left 116 ompi/mca/coll/base/coll_base_barrier.c err = MCA_PML_CALL(recv((void*)NULL, 0, MPI_BYTE, left, left 130 ompi/mca/coll/base/coll_base_barrier.c err = MCA_PML_CALL(recv((void*)NULL, 0, MPI_BYTE, left, left 138 ompi/mca/coll/base/coll_base_barrier.c err = MCA_PML_CALL(recv((void*)NULL, 0, MPI_BYTE, left, left 152 ompi/mca/coll/base/coll_base_barrier.c err = MCA_PML_CALL(recv((void*)NULL, 0, MPI_BYTE, left, left 1021 ompi/mca/coll/base/coll_base_bcast.c int left = (rank - 1 + comm_size) % comm_size; left 1042 ompi/mca/coll/base/coll_base_bcast.c datatype, left, MCA_COLL_BASE_TAG_BCAST, left 311 ompi/mca/coll/libnbc/libdict/hb_tree.c int rv, left; left 347 ompi/mca/coll/libnbc/libdict/hb_tree.c left = parent->llink == node; left 348 ompi/mca/coll/libnbc/libdict/hb_tree.c if (left) left 354 ompi/mca/coll/libnbc/libdict/hb_tree.c if (left) { left 399 ompi/mca/coll/libnbc/libdict/hb_tree.c left = parent->llink == node; left 33 ompi/mca/fcoll/base/fcoll_base_sort.c int left = 0; left 61 ompi/mca/fcoll/base/fcoll_base_sort.c left = j*2+1; left 63 ompi/mca/fcoll/base/fcoll_base_sort.c if ((left <= heap_size) && left 64 ompi/mca/fcoll/base/fcoll_base_sort.c (iov[temp_arr[left]].iov_base > iov[temp_arr[j]].iov_base)) { left 65 ompi/mca/fcoll/base/fcoll_base_sort.c largest = left; left 97 ompi/mca/fcoll/base/fcoll_base_sort.c left = j*2+1; left 100 ompi/mca/fcoll/base/fcoll_base_sort.c if ((left <= heap_size) && left 101 ompi/mca/fcoll/base/fcoll_base_sort.c (iov[temp_arr[left]].iov_base > left 103 ompi/mca/fcoll/base/fcoll_base_sort.c largest = left; left 985 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c int left = 0; left 1009 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c left = j*2+1; left 1011 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c if ((left <= heap_size) && left 1012 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1013 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c largest = left; left 1045 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c left = j*2+1; left 1048 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c if ((left <= heap_size) && left 1049 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c (io_array[temp_arr[left]].offset > left 1051 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c largest = left; left 1095 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c int left = 0; left 1119 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c left = j*2+1; left 1121 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c if ((left <= heap_size) && left 1122 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1123 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c largest = left; left 1155 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c left = j*2+1; left 1158 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c if ((left <= heap_size) && left 1159 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c (io_array[temp_arr[left]].offset > left 1161 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c largest = left; left 985 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c int left = 0; left 1009 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c left = j*2+1; left 1011 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c if ((left <= heap_size) && left 1012 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1013 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c largest = left; left 1045 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c left = j*2+1; left 1048 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c if ((left <= heap_size) && left 1049 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c (io_array[temp_arr[left]].offset > left 1051 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c largest = left; left 1653 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c int left = 0; left 1677 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c left = j*2+1; left 1679 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c if ((left <= heap_size) && left 1680 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1681 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c largest = left; left 1713 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c left = j*2+1; left 1716 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c if ((left <= heap_size) && left 1717 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c (io_array[temp_arr[left]].offset > left 1719 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c largest = left; left 985 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c int left = 0; left 1009 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c left = j*2+1; left 1011 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c if ((left <= heap_size) && left 1012 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1013 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c largest = left; left 1045 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c left = j*2+1; left 1048 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c if ((left <= heap_size) && left 1049 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c (io_array[temp_arr[left]].offset > left 1051 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c largest = left; left 1710 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c int left = 0; left 1734 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c left = j*2+1; left 1736 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c if ((left <= heap_size) && left 1737 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 1738 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c largest = left; left 1770 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c left = j*2+1; left 1773 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c if ((left <= heap_size) && left 1774 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c (io_array[temp_arr[left]].offset > left 1776 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c largest = left; left 424 ompi/mca/io/ompio/io_ompio.c int left = 0; left 448 ompi/mca/io/ompio/io_ompio.c left = j*2+1; left 450 ompi/mca/io/ompio/io_ompio.c if ((left <= heap_size) && left 451 ompi/mca/io/ompio/io_ompio.c (io_array[temp_arr[left]].offset > io_array[temp_arr[j]].offset)) { left 452 ompi/mca/io/ompio/io_ompio.c largest = left; left 484 ompi/mca/io/ompio/io_ompio.c left = j*2+1; left 487 ompi/mca/io/ompio/io_ompio.c if ((left <= heap_size) && left 488 ompi/mca/io/ompio/io_ompio.c (io_array[temp_arr[left]].offset > left 490 ompi/mca/io/ompio/io_ompio.c largest = left; left 62 ompi/mca/io/romio321/romio/adio/common/heap-sort.c l = left(i); left 321 opal/class/opal_bitmap.c bool opal_bitmap_are_different(opal_bitmap_t *left, opal_bitmap_t *right) left 328 opal/class/opal_bitmap.c if( NULL == left || NULL == right ) { left 332 opal/class/opal_bitmap.c if( opal_bitmap_size(left) != opal_bitmap_size(right) ) { left 339 opal/class/opal_bitmap.c for(i = 0; i < left->array_size; ++i) { left 340 opal/class/opal_bitmap.c if( left->bitmap[i] != right->bitmap[i] ) { left 222 opal/class/opal_bitmap.h OPAL_DECLSPEC bool opal_bitmap_are_different(opal_bitmap_t *left, opal_bitmap_t *right); left 67 opal/class/opal_interval_tree.c tree->nill.left = tree->nill.right = tree->nill.parent = &tree->nill; left 73 opal/class/opal_interval_tree.c tree->root.left = tree->root.right = tree->root.parent = &tree->nill; left 177 opal/class/opal_interval_tree.c if (parent == parent->parent->left) { left 181 opal/class/opal_interval_tree.c y = parent->parent->left; left 202 opal/class/opal_interval_tree.c if (node == parent->left) { left 221 opal/class/opal_interval_tree.c tree->root.left->color = OPAL_INTERVAL_TREE_COLOR_BLACK; left 235 opal/class/opal_interval_tree.c opal_interval_tree_node_t *parent, const bool left) left 240 opal/class/opal_interval_tree.c w = left ? parent->right : parent->left; left 244 opal/class/opal_interval_tree.c if (left) { left 249 opal/class/opal_interval_tree.c w = parent->left; left 253 opal/class/opal_interval_tree.c if ((w->left->color == OPAL_INTERVAL_TREE_COLOR_BLACK) && (w->right->color == OPAL_INTERVAL_TREE_COLOR_BLACK)) { left 258 opal/class/opal_interval_tree.c if (left) { left 260 opal/class/opal_interval_tree.c w->left->color = OPAL_INTERVAL_TREE_COLOR_BLACK; left 270 opal/class/opal_interval_tree.c if (w->left->color == OPAL_INTERVAL_TREE_COLOR_BLACK) { left 274 opal/class/opal_interval_tree.c w = parent->left; left 278 opal/class/opal_interval_tree.c w->left->color = OPAL_INTERVAL_TREE_COLOR_BLACK; left 283 opal/class/opal_interval_tree.c return tree->root.left; left 290 opal/class/opal_interval_tree.c while ((node != tree->root.left) && (node->color == OPAL_INTERVAL_TREE_COLOR_BLACK)) { left 291 opal/class/opal_interval_tree.c node = opal_interval_tree_delete_fixup_helper (tree, node, parent, node == parent->left); left 371 opal/class/opal_interval_tree.c return opal_interval_tree_find_interval (tree, node->left, low, high, exact, data); left 382 opal/class/opal_interval_tree.c return opal_interval_tree_find_interval (tree, tree->root.left, low, high, exact, data); left 403 opal/class/opal_interval_tree.c return 1 + max (opal_interval_tree_depth_node (tree, node->right), opal_interval_tree_depth_node (tree, node->left)); left 469 opal/class/opal_interval_tree.c assert (node->left == nill || node->right == nill); left 471 opal/class/opal_interval_tree.c parent_ptr = (parent->right == node) ? &parent->right : &parent->left; left 473 opal/class/opal_interval_tree.c next = (node->right == nill) ? node->left : node->right; left 494 opal/class/opal_interval_tree.c parent_ptr = (parent->right == node) ? &parent->right : &parent->left; left 502 opal/class/opal_interval_tree.c next_copy->left = node->left; left 503 opal/class/opal_interval_tree.c next_copy->left->parent = next_copy; left 515 opal/class/opal_interval_tree.c next->left = node->left; left 516 opal/class/opal_interval_tree.c next->left->parent = next; left 555 opal/class/opal_interval_tree.c if ((node->left == &tree->nill) || (node->right == &tree->nill)) { left 598 opal/class/opal_interval_tree.c while (p->left != &tree->nill) { left 599 opal/class/opal_interval_tree.c p = p->left; left 611 opal/class/opal_interval_tree.c opal_interval_tree_node_t *n = parent->left; /* the real root of the tree */ left 617 opal/class/opal_interval_tree.c node->left = nill; left 627 opal/class/opal_interval_tree.c n = ((node->low < n->low) ? n->left : n->right); left 633 opal/class/opal_interval_tree.c parent->left = node; left 654 opal/class/opal_interval_tree.c rc = inorder_traversal(tree, low, high, partial_ok, action, node->left, ctx); left 681 opal/class/opal_interval_tree.c inorder_destroy(tree, node->left); left 684 opal/class/opal_interval_tree.c if (node->left != &tree->nill) { left 685 opal/class/opal_interval_tree.c opal_free_list_return_st (&tree->free_list, &node->left->super); left 706 opal/class/opal_interval_tree.c rc = inorder_traversal (tree, low, high, partial_ok, action, tree->root.left, ctx); left 721 opal/class/opal_interval_tree.c if (y->left != &tree->nill) { left 722 opal/class/opal_interval_tree.c y->left->parent = x_copy; left 727 opal/class/opal_interval_tree.c x_copy->right = y->left; left 728 opal/class/opal_interval_tree.c x_copy->max = max (x_copy->high, max (x_copy->left->max, x_copy->left->max)); left 730 opal/class/opal_interval_tree.c rp_publish (&y->left, x_copy); left 734 opal/class/opal_interval_tree.c if (x == parent->left) { left 735 opal/class/opal_interval_tree.c rp_publish (&parent->left, y); left 753 opal/class/opal_interval_tree.c opal_interval_tree_node_t *y = x->left; left 761 opal/class/opal_interval_tree.c x_copy->left = y->right; left 771 opal/class/opal_interval_tree.c if (parent->left == x) { left 772 opal/class/opal_interval_tree.c rp_publish (&parent->left, y); left 794 opal/class/opal_interval_tree.c (OPAL_INTERVAL_TREE_COLOR_BLACK != node->left->color || left 804 opal/class/opal_interval_tree.c if (node->left == &tree->nill && node->right == &tree->nill) { left 813 opal/class/opal_interval_tree.c return opal_interval_tree_verify_node (tree, node->left, black_depth, current_black_depth) || left 828 opal/class/opal_interval_tree.c return opal_interval_tree_black_depth (tree, node->left, depth); left 835 opal/class/opal_interval_tree.c if (OPAL_INTERVAL_TREE_COLOR_BLACK != tree->root.left->color) { left 845 opal/class/opal_interval_tree.c black_depth = opal_interval_tree_black_depth (tree, tree->root.left, 0); left 847 opal/class/opal_interval_tree.c return opal_interval_tree_verify_node (tree, tree->root.left, black_depth, 0); left 853 opal/class/opal_interval_tree.c uintptr_t left = (uintptr_t) node->left, right = (uintptr_t) node->right; left 865 opal/class/opal_interval_tree.c if ((uintptr_t) nill == left) { left 866 opal/class/opal_interval_tree.c left = (uintptr_t) node | 0x1; left 867 opal/class/opal_interval_tree.c fprintf (fh, " Node%lx [color=black,label=nill];\n\n", left); left 869 opal/class/opal_interval_tree.c left = (uintptr_t) node->left; left 883 opal/class/opal_interval_tree.c fprintf (fh, " Node%lx -> Node%lx;\n", (uintptr_t) node, left); left 885 opal/class/opal_interval_tree.c if (node != tree->root.left) { left 888 opal/class/opal_interval_tree.c opal_interval_tree_dump_node (tree, node->left, black_rank, fh); left 903 opal/class/opal_interval_tree.c opal_interval_tree_dump_node (tree, tree->root.left, 0, fh); left 55 opal/class/opal_interval_tree.h struct opal_interval_tree_node_t *left; /**< the left child - can be nill */ left 100 opal/class/opal_rb_tree.c tree->nill->left = tree->nill; left 105 opal/class/opal_rb_tree.c tree->root_ptr->left = tree->nill; left 143 opal/class/opal_rb_tree.c if (node->parent == node->parent->parent->left) { left 160 opal/class/opal_rb_tree.c y = node->parent->parent->left; left 167 opal/class/opal_rb_tree.c if (node == node->parent->left) { left 178 opal/class/opal_rb_tree.c tree->root_ptr->left->color = BLACK; left 189 opal/class/opal_rb_tree.c node = tree->root_ptr->left; left 197 opal/class/opal_rb_tree.c node = ((compvalue < 0) ? node->left : node->right); left 211 opal/class/opal_rb_tree.c node = tree->root_ptr->left; left 219 opal/class/opal_rb_tree.c node = ((compvalue < 0) ? node->left : node->right); left 237 opal/class/opal_rb_tree.c if ((p->left == tree->nill) || (p->right == tree->nill)) { left 243 opal/class/opal_rb_tree.c if (todelete->left == tree->nill) { left 246 opal/class/opal_rb_tree.c y = todelete->left; left 252 opal/class/opal_rb_tree.c tree->root_ptr->left = y; left 254 opal/class/opal_rb_tree.c if (todelete == todelete->parent->left) { left 255 opal/class/opal_rb_tree.c todelete->parent->left = y; left 314 opal/class/opal_rb_tree.c while(p->left != tree->nill) { left 315 opal/class/opal_rb_tree.c p = p->left; left 327 opal/class/opal_rb_tree.c opal_rb_tree_node_t * n = parent->left; /* the real root of the tree */ left 332 opal/class/opal_rb_tree.c node->left = tree->nill; left 338 opal/class/opal_rb_tree.c n = ((tree->comp(node->key, n->key) <= 0) ? n->left : n->right); left 343 opal/class/opal_rb_tree.c parent->left = node; left 350 opal/class/opal_rb_tree.c node->left = tree->nill; left 360 opal/class/opal_rb_tree.c opal_rb_tree_node_t * root = tree->root_ptr->left; left 362 opal/class/opal_rb_tree.c if (x == x->parent->left) { left 370 opal/class/opal_rb_tree.c if ((w->left->color == BLACK) && (w->right->color == BLACK)) { left 375 opal/class/opal_rb_tree.c w->left->color = BLACK; left 388 opal/class/opal_rb_tree.c w = x->parent->left; left 393 opal/class/opal_rb_tree.c w = x->parent->left; left 395 opal/class/opal_rb_tree.c if ((w->right->color == BLACK) && (w->left->color == BLACK)) { left 399 opal/class/opal_rb_tree.c if (w->left->color == BLACK) { left 403 opal/class/opal_rb_tree.c w = x->parent->left; left 407 opal/class/opal_rb_tree.c w->left->color = BLACK; left 430 opal/class/opal_rb_tree.c inorder_destroy(tree, node->left); left 432 opal/class/opal_rb_tree.c if (node->left != tree->nill) { left 433 opal/class/opal_rb_tree.c item = (opal_free_list_item_t *) node->left; left 456 opal/class/opal_rb_tree.c inorder_traversal(tree, cond, action, tree->root_ptr->left); left 471 opal/class/opal_rb_tree.c inorder_traversal(tree, cond, action, node->left); left 489 opal/class/opal_rb_tree.c if (y->left != tree->nill) { left 490 opal/class/opal_rb_tree.c y->left->parent=x; left 495 opal/class/opal_rb_tree.c if (x == x->parent->left) { left 496 opal/class/opal_rb_tree.c x->parent->left = y; left 504 opal/class/opal_rb_tree.c x->right = y->left; left 505 opal/class/opal_rb_tree.c y->left = x; left 518 opal/class/opal_rb_tree.c y = x->left; left 524 opal/class/opal_rb_tree.c if (x == x->parent->left) { left 525 opal/class/opal_rb_tree.c x->parent->left = y; left 532 opal/class/opal_rb_tree.c x->left = y->right; left 559 opal/class/opal_rb_tree.c inorder(tree, node->left); left 570 opal/class/opal_rb_tree.c inorder(tree, tree->root_ptr->left); left 55 opal/class/opal_rb_tree.h struct opal_rb_tree_node_t * left; /**< the left child - can be nill */ left 603 opal/class/opal_tree.c opal_tree_item_t *left, opal_tree_item_t *right) left 609 opal/class/opal_tree.c if( NULL == left && NULL == right ) { left 614 opal/class/opal_tree.c if( NULL == left && NULL != right ) { left 617 opal/class/opal_tree.c else if( NULL != left && NULL == right ) { left 622 opal/class/opal_tree.c if( 0 != tree_left->comp(right, opal_tree_get_key(tree_left, left)) ) { left 627 opal/class/opal_tree.c if( opal_tree_num_children(left) != opal_tree_num_children(right) ) { left 632 opal/class/opal_tree.c for(left_child = opal_tree_get_first_child(left), right_child = opal_tree_get_first_child(right); left 644 opal/class/opal_tree.c int opal_tree_compare(opal_tree_t *left, opal_tree_t *right) left 646 opal/class/opal_tree.c return opal_tree_compare_subtrees(left, right, opal_tree_get_root(left), opal_tree_get_root(right)); left 505 opal/class/opal_tree.h OPAL_DECLSPEC int opal_tree_compare(opal_tree_t *left, opal_tree_t *right); left 381 opal/mca/btl/usnic/btl_usnic_proc.c int left, right; left 389 opal/mca/btl/usnic/btl_usnic_proc.c left = me[2*i+0]; left 393 opal/mca/btl/usnic/btl_usnic_proc.c proc_idx = PROC_INDEX(left); left 396 opal/mca/btl/usnic/btl_usnic_proc.c module_idx = MODULE_INDEX(left); left 105 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ left 106 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \ left 520 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *left; \ left 522 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h while ((left = RB_LEFT(elm, field))) \ left 523 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = left; \ left 552 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h left = parent; \ left 554 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_AUGMENT(left); \ left 555 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h } while ((left = RB_PARENT(left, field))); \ left 782 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \ left 783 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \ left 1197 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h struct type *left; \ left 1199 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h while ((left = RB_LEFT(elm, field))) \ left 1200 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h elm = left; \ left 1229 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h left = parent; \ left 1231 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h RB_AUGMENT(left); \ left 1232 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h } while ((left = RB_PARENT(left, field))); \ left 2453 opal/mca/event/libevent2022/libevent/buffer.c size_t left = position; left 2477 opal/mca/event/libevent2022/libevent/buffer.c EVUTIL_ASSERT(EV_SIZE_MAX - left >= position); left 2478 opal/mca/event/libevent2022/libevent/buffer.c while (chain && position + left >= chain->off) { left 2479 opal/mca/event/libevent2022/libevent/buffer.c left -= chain->off - position; left 2485 opal/mca/event/libevent2022/libevent/buffer.c pos->_internal.pos_in_chain = position + left; left 321 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c bool pmix_bitmap_are_different(pmix_bitmap_t *left, pmix_bitmap_t *right) left 328 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c if( NULL == left || NULL == right ) { left 332 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c if( pmix_bitmap_size(left) != pmix_bitmap_size(right) ) { left 339 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c for(i = 0; i < left->array_size; ++i) { left 340 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c if( left->bitmap[i] != right->bitmap[i] ) { left 223 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.h PMIX_EXPORT bool pmix_bitmap_are_different(pmix_bitmap_t *left, pmix_bitmap_t *right); left 1040 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c size_t n, m, left; left 1063 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c left = PMIX_PRINT_NAME_COLUMN_WIDTH/2 - 1; left 1064 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c memcpy(&line[left], "NAME", 4); left 1066 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c left = 3 + PMIX_PRINT_NAME_COLUMN_WIDTH + (PMIX_PRINT_STRING_COLUMN_WIDTH/2) - 2; left 1067 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c memcpy(&line[left], "STRING", 6); left 1069 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c left = 3 + PMIX_PRINT_NAME_COLUMN_WIDTH + PMIX_PRINT_STRING_COLUMN_WIDTH + (PMIX_PRINT_TYPE_COLUMN_WIDTH/2) - 2; left 1070 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c memcpy(&line[left], "TYPE", 4); left 1072 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c left = PMIX_PRINT_NAME_COLUMN_WIDTH + PMIX_PRINT_STRING_COLUMN_WIDTH + PMIX_PRINT_TYPE_COLUMN_WIDTH + left 1074 opal/mca/pmix/pmix4x/pmix/src/common/pmix_attributes.c memcpy(&line[left], "DESCRIPTION", strlen("DESCRIPTION"));