right             103 ompi/mca/coll/base/coll_base_barrier.c     int rank, size, err = 0, line = 0, left, right;
right             113 ompi/mca/coll/base/coll_base_barrier.c     right = ((rank+1)%size);
right             123 ompi/mca/coll/base/coll_base_barrier.c     err = MCA_PML_CALL(send((void*)NULL, 0, MPI_BYTE, right,
right             145 ompi/mca/coll/base/coll_base_barrier.c     err = MCA_PML_CALL(send((void*)NULL, 0, MPI_BYTE, right,
right            1022 ompi/mca/coll/base/coll_base_bcast.c     int right = (rank + 1) % comm_size;
right            1040 ompi/mca/coll/base/coll_base_bcast.c                                       datatype, right, MCA_COLL_BASE_TAG_BCAST,
right              34 ompi/mca/fcoll/base/fcoll_base_sort.c     int right = 0;
right              62 ompi/mca/fcoll/base/fcoll_base_sort.c             right = j*2+2;
right              70 ompi/mca/fcoll/base/fcoll_base_sort.c             if ((right <= heap_size) &&
right              71 ompi/mca/fcoll/base/fcoll_base_sort.c                 (iov[temp_arr[right]].iov_base >
right              73 ompi/mca/fcoll/base/fcoll_base_sort.c                 largest = right;
right              98 ompi/mca/fcoll/base/fcoll_base_sort.c             right = j*2+2;
right             108 ompi/mca/fcoll/base/fcoll_base_sort.c             if ((right <= heap_size) &&
right             109 ompi/mca/fcoll/base/fcoll_base_sort.c                 (iov[temp_arr[right]].iov_base >
right             111 ompi/mca/fcoll/base/fcoll_base_sort.c                 largest = right;
right             986 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c     int right = 0;
right            1010 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c             right = j*2+2;
right            1018 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c             if ((right <= heap_size) &&
right            1019 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1021 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c                 largest = right;
right            1046 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c             right = j*2+2;
right            1056 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c             if ((right <= heap_size) &&
right            1057 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1059 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_read_all.c                 largest = right;
right            1096 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c     int right = 0;
right            1120 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c             right = j*2+2;
right            1128 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c             if ((right <= heap_size) &&
right            1129 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1131 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c                 largest = right;
right            1156 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c             right = j*2+2;
right            1166 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c             if ((right <= heap_size) &&
right            1167 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1169 ompi/mca/fcoll/dynamic/fcoll_dynamic_file_write_all.c                 largest = right;
right             986 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c     int right = 0;
right            1010 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c             right = j*2+2;
right            1018 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c             if ((right <= heap_size) &&
right            1019 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1021 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c                 largest = right;
right            1046 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c             right = j*2+2;
right            1056 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c             if ((right <= heap_size) &&
right            1057 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1059 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_read_all.c                 largest = right;
right            1654 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c     int right = 0;
right            1678 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c             right = j*2+2;
right            1686 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c             if ((right <= heap_size) &&
right            1687 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1689 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c                 largest = right;
right            1714 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c             right = j*2+2;
right            1724 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c             if ((right <= heap_size) &&
right            1725 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1727 ompi/mca/fcoll/dynamic_gen2/fcoll_dynamic_gen2_file_write_all.c                 largest = right;
right             986 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c     int right = 0;
right            1010 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c             right = j*2+2;
right            1018 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c             if ((right <= heap_size) &&
right            1019 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1021 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c                 largest = right;
right            1046 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c             right = j*2+2;
right            1056 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c             if ((right <= heap_size) &&
right            1057 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c                 (io_array[temp_arr[right]].offset >
right            1059 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_read_all.c                 largest = right;
right            1711 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c     int right = 0;
right            1735 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c             right = j*2+2;
right            1743 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c             if ((right <= heap_size) &&
right            1744 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1746 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c                 largest = right;
right            1771 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c             right = j*2+2;
right            1781 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c             if ((right <= heap_size) &&
right            1782 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c                 (io_array[temp_arr[right]].offset >
right            1784 ompi/mca/fcoll/vulcan/fcoll_vulcan_file_write_all.c                 largest = right;
right             425 ompi/mca/io/ompio/io_ompio.c     int right = 0;
right             449 ompi/mca/io/ompio/io_ompio.c             right = j*2+2;
right             457 ompi/mca/io/ompio/io_ompio.c             if ((right <= heap_size) &&
right             458 ompi/mca/io/ompio/io_ompio.c                 (io_array[temp_arr[right]].offset >
right             460 ompi/mca/io/ompio/io_ompio.c                 largest = right;
right             485 ompi/mca/io/ompio/io_ompio.c             right = j*2+2;
right             495 ompi/mca/io/ompio/io_ompio.c             if ((right <= heap_size) &&
right             496 ompi/mca/io/ompio/io_ompio.c                 (io_array[temp_arr[right]].offset >
right             498 ompi/mca/io/ompio/io_ompio.c                 largest = right;
right              63 ompi/mca/io/romio321/romio/adio/common/heap-sort.c     r = right(i);
right              42 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! This is a bit of a hack: the "mpi" module will provide the right
right              44 ompi/mpi/fortran/use-mpi-f08/bindings/mpi-f-interfaces-bind.h ! the right types (e.g., convert MPI handles from comm to
right             249 opal/class/opal_bitmap.c int opal_bitmap_bitwise_and_inplace(opal_bitmap_t *dest, opal_bitmap_t *right)
right             256 opal/class/opal_bitmap.c     if( NULL == dest || NULL == right ) {
right             259 opal/class/opal_bitmap.c     if( dest->array_size != right->array_size ) {
right             267 opal/class/opal_bitmap.c         dest->bitmap[i] &= right->bitmap[i];
right             273 opal/class/opal_bitmap.c int opal_bitmap_bitwise_or_inplace(opal_bitmap_t *dest, opal_bitmap_t *right)
right             280 opal/class/opal_bitmap.c     if( NULL == dest || NULL == right ) {
right             283 opal/class/opal_bitmap.c     if( dest->array_size != right->array_size ) {
right             291 opal/class/opal_bitmap.c         dest->bitmap[i] |= right->bitmap[i];
right             297 opal/class/opal_bitmap.c int opal_bitmap_bitwise_xor_inplace(opal_bitmap_t *dest, opal_bitmap_t *right)
right             304 opal/class/opal_bitmap.c     if( NULL == dest || NULL == right ) {
right             307 opal/class/opal_bitmap.c     if( dest->array_size != right->array_size ) {
right             315 opal/class/opal_bitmap.c         dest->bitmap[i] ^= right->bitmap[i];
right             321 opal/class/opal_bitmap.c bool opal_bitmap_are_different(opal_bitmap_t *left, opal_bitmap_t *right)
right             328 opal/class/opal_bitmap.c     if( NULL == left || NULL == right ) {
right             332 opal/class/opal_bitmap.c     if( opal_bitmap_size(left) != opal_bitmap_size(right) ) {
right             340 opal/class/opal_bitmap.c         if( left->bitmap[i] != right->bitmap[i] ) {
right             195 opal/class/opal_bitmap.h OPAL_DECLSPEC int opal_bitmap_bitwise_and_inplace(opal_bitmap_t *dest, opal_bitmap_t *right);
right             204 opal/class/opal_bitmap.h OPAL_DECLSPEC int opal_bitmap_bitwise_or_inplace(opal_bitmap_t *dest, opal_bitmap_t *right);
right             213 opal/class/opal_bitmap.h OPAL_DECLSPEC int opal_bitmap_bitwise_xor_inplace(opal_bitmap_t *dest, opal_bitmap_t *right);
right             222 opal/class/opal_bitmap.h OPAL_DECLSPEC bool opal_bitmap_are_different(opal_bitmap_t *left, opal_bitmap_t *right);
right              67 opal/class/opal_interval_tree.c     tree->nill.left = tree->nill.right = tree->nill.parent = &tree->nill;
right              73 opal/class/opal_interval_tree.c     tree->root.left = tree->root.right = tree->root.parent = &tree->nill;
right             178 opal/class/opal_interval_tree.c         y = parent->parent->right;
right             193 opal/class/opal_interval_tree.c         if (node == parent->right) {
right             240 opal/class/opal_interval_tree.c     w = left ? parent->right : parent->left;
right             246 opal/class/opal_interval_tree.c             w = parent->right;
right             253 opal/class/opal_interval_tree.c     if ((w->left->color == OPAL_INTERVAL_TREE_COLOR_BLACK) && (w->right->color == OPAL_INTERVAL_TREE_COLOR_BLACK)) {
right             259 opal/class/opal_interval_tree.c         if (w->right->color == OPAL_INTERVAL_TREE_COLOR_BLACK) {
right             263 opal/class/opal_interval_tree.c             w = parent->right;
right             267 opal/class/opal_interval_tree.c         w->right->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
right             271 opal/class/opal_interval_tree.c             w->right->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
right             374 opal/class/opal_interval_tree.c     return opal_interval_tree_find_interval (tree, node->right, low, high, exact, data);
right             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));
right             469 opal/class/opal_interval_tree.c     assert (node->left == nill || node->right == nill);
right             471 opal/class/opal_interval_tree.c     parent_ptr = (parent->right == node) ? &parent->right : &parent->left;
right             473 opal/class/opal_interval_tree.c     next = (node->right == nill) ? node->left : node->right;
right             494 opal/class/opal_interval_tree.c     parent_ptr = (parent->right == node) ? &parent->right : &parent->left;
right             498 opal/class/opal_interval_tree.c     if (next != node->right) {
right             504 opal/class/opal_interval_tree.c         next_copy->right = node->right;
right             505 opal/class/opal_interval_tree.c         next_copy->right->parent = next_copy;
right             524 opal/class/opal_interval_tree.c 	    if (OPAL_INTERVAL_TREE_COLOR_RED == next->right->color) {
right             525 opal/class/opal_interval_tree.c 		next->right->color = OPAL_INTERVAL_TREE_COLOR_BLACK;
right             527 opal/class/opal_interval_tree.c 		opal_interval_tree_delete_fixup (tree, next->right, next);
right             555 opal/class/opal_interval_tree.c     if ((node->left == &tree->nill) || (node->right == &tree->nill)) {
right             582 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *p = node->right;
right             586 opal/class/opal_interval_tree.c         while (node == p->right) {
right             618 opal/class/opal_interval_tree.c     node->right = nill;
right             627 opal/class/opal_interval_tree.c         n = ((node->low < n->low) ? n->left : n->right);
right             635 opal/class/opal_interval_tree.c         parent->right = node;
right             670 opal/class/opal_interval_tree.c     return inorder_traversal(tree, low, high, partial_ok, action, node->right, ctx);
right             682 opal/class/opal_interval_tree.c     inorder_destroy(tree, node->right);
right             688 opal/class/opal_interval_tree.c     if (node->right != &tree->nill) {
right             689 opal/class/opal_interval_tree.c         opal_free_list_return_st (&tree->free_list, &node->right->super);
right             717 opal/class/opal_interval_tree.c     opal_interval_tree_node_t *y = x->right;
right             727 opal/class/opal_interval_tree.c     x_copy->right = y->left;
right             737 opal/class/opal_interval_tree.c         rp_publish (&parent->right, y);
right             757 opal/class/opal_interval_tree.c     if (y->right != &tree->nill) {
right             758 opal/class/opal_interval_tree.c         y->right->parent = x_copy;
right             761 opal/class/opal_interval_tree.c     x_copy->left = y->right;
right             764 opal/class/opal_interval_tree.c     rp_publish (&y->right, x_copy);
right             774 opal/class/opal_interval_tree.c         rp_publish (&parent->right, y);
right             795 opal/class/opal_interval_tree.c          OPAL_INTERVAL_TREE_COLOR_BLACK != node->right->color)) {
right             804 opal/class/opal_interval_tree.c     if (node->left == &tree->nill && node->right == &tree->nill) {
right             814 opal/class/opal_interval_tree.c         opal_interval_tree_verify_node (tree, node->right, black_depth, current_black_depth);
right             853 opal/class/opal_interval_tree.c     uintptr_t left = (uintptr_t) node->left, right = (uintptr_t) node->right;
right             872 opal/class/opal_interval_tree.c     if ((uintptr_t) nill == right) {
right             873 opal/class/opal_interval_tree.c         right = (uintptr_t) node | 0x2;
right             874 opal/class/opal_interval_tree.c         fprintf (fh, "  Node%lx [color=black,label=nill];\n\n", right);
right             876 opal/class/opal_interval_tree.c         right = (uintptr_t) node->right;
right             884 opal/class/opal_interval_tree.c     fprintf (fh, "  Node%lx -> Node%lx;\n\n", (uintptr_t) node, right);
right             889 opal/class/opal_interval_tree.c     opal_interval_tree_dump_node (tree, node->right, black_rank, fh);
right              56 opal/class/opal_interval_tree.h     struct opal_interval_tree_node_t *right; /**< the right child - can be nill */
right             101 opal/class/opal_rb_tree.c     tree->nill->right = tree->nill;
right             106 opal/class/opal_rb_tree.c     tree->root_ptr->right = tree->nill;
right             144 opal/class/opal_rb_tree.c             y = node->parent->parent->right;
right             151 opal/class/opal_rb_tree.c                 if (node == node->parent->right) {
right             197 opal/class/opal_rb_tree.c         node = ((compvalue < 0) ? node->left : node->right);
right             219 opal/class/opal_rb_tree.c         node = ((compvalue < 0) ? node->left : node->right);
right             237 opal/class/opal_rb_tree.c     if ((p->left == tree->nill) || (p->right == tree->nill)) {
right             244 opal/class/opal_rb_tree.c         y = todelete->right;
right             257 opal/class/opal_rb_tree.c             todelete->parent->right = y;
right             301 opal/class/opal_rb_tree.c     if (node->right == tree->nill) {
right             303 opal/class/opal_rb_tree.c         while (node == p->right) {
right             313 opal/class/opal_rb_tree.c     p = node->right;
right             333 opal/class/opal_rb_tree.c     node->right = tree->nill;
right             338 opal/class/opal_rb_tree.c         n = ((tree->comp(node->key, n->key) <= 0) ? n->left : n->right);
right             345 opal/class/opal_rb_tree.c         parent->right = node;
right             351 opal/class/opal_rb_tree.c     node->right = tree->nill;
right             363 opal/class/opal_rb_tree.c             w = x->parent->right;
right             368 opal/class/opal_rb_tree.c                 w = x->parent->right;
right             370 opal/class/opal_rb_tree.c             if ((w->left->color == BLACK) && (w->right->color == BLACK)) {
right             374 opal/class/opal_rb_tree.c                 if (w->right->color == BLACK) {
right             378 opal/class/opal_rb_tree.c                     w = x->parent->right;
right             382 opal/class/opal_rb_tree.c                 w->right->color = BLACK;
right             395 opal/class/opal_rb_tree.c             if ((w->right->color == BLACK) && (w->left->color == BLACK)) {
right             400 opal/class/opal_rb_tree.c                     w->right->color = BLACK;
right             438 opal/class/opal_rb_tree.c     inorder_destroy(tree, node->right);
right             439 opal/class/opal_rb_tree.c     if (node->right != tree->nill) {
right             440 opal/class/opal_rb_tree.c         item = (opal_free_list_item_t *) node->right;
right             477 opal/class/opal_rb_tree.c     inorder_traversal(tree, cond, action, node->right);
right             487 opal/class/opal_rb_tree.c     y = x->right;
right             498 opal/class/opal_rb_tree.c         x->parent->right = y;
right             504 opal/class/opal_rb_tree.c     x->right = y->left;
right             520 opal/class/opal_rb_tree.c     if(y->right != tree->nill) {
right             521 opal/class/opal_rb_tree.c         y->right->parent = x;
right             527 opal/class/opal_rb_tree.c         x->parent->right = y;
right             532 opal/class/opal_rb_tree.c     x->left = y->right;
right             533 opal/class/opal_rb_tree.c     y->right = x;
right             563 opal/class/opal_rb_tree.c     inorder(tree, node->right);
right              56 opal/class/opal_rb_tree.h     struct opal_rb_tree_node_t * right; /**< the right child - can be nill */
right             603 opal/class/opal_tree.c                                       opal_tree_item_t *left, opal_tree_item_t *right)
right             609 opal/class/opal_tree.c     if( NULL == left && NULL == right ) {
right             614 opal/class/opal_tree.c     if( NULL == left && NULL != right ) {
right             617 opal/class/opal_tree.c     else if( NULL != left && NULL == right ) {
right             622 opal/class/opal_tree.c     if( 0 != tree_left->comp(right, opal_tree_get_key(tree_left, left)) ) {
right             627 opal/class/opal_tree.c     if( opal_tree_num_children(left) != opal_tree_num_children(right) ) {
right             632 opal/class/opal_tree.c     for(left_child  = opal_tree_get_first_child(left),        right_child  = opal_tree_get_first_child(right);
right             644 opal/class/opal_tree.c int opal_tree_compare(opal_tree_t *left, opal_tree_t *right)
right             646 opal/class/opal_tree.c     return opal_tree_compare_subtrees(left, right, opal_tree_get_root(left), opal_tree_get_root(right));
right             505 opal/class/opal_tree.h OPAL_DECLSPEC int opal_tree_compare(opal_tree_t *left, opal_tree_t *right);
right             381 opal/mca/btl/usnic/btl_usnic_proc.c     int left, right;
right             390 opal/mca/btl/usnic/btl_usnic_proc.c         right = me[2*i+1];
right             394 opal/mca/btl/usnic/btl_usnic_proc.c             module_idx = MODULE_INDEX(right);
right             397 opal/mca/btl/usnic/btl_usnic_proc.c             proc_idx = PROC_INDEX(right);
right             105 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do {		\
right             107 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h 	SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
right             782 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h #define SPLAY_ASSEMBLE(head, node, left, right, field) do {		\
right             784 opal/mca/event/libevent2022/libevent/WIN32-Code/tree.h 	SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
right             249 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c int pmix_bitmap_bitwise_and_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right)
right             256 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( NULL == dest || NULL == right ) {
right             259 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( dest->array_size != right->array_size ) {
right             267 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c         dest->bitmap[i] &= right->bitmap[i];
right             273 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c int pmix_bitmap_bitwise_or_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right)
right             280 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( NULL == dest || NULL == right ) {
right             283 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( dest->array_size != right->array_size ) {
right             291 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c         dest->bitmap[i] |= right->bitmap[i];
right             297 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c int pmix_bitmap_bitwise_xor_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right)
right             304 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( NULL == dest || NULL == right ) {
right             307 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( dest->array_size != right->array_size ) {
right             315 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c         dest->bitmap[i] ^= right->bitmap[i];
right             321 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c bool pmix_bitmap_are_different(pmix_bitmap_t *left, pmix_bitmap_t *right)
right             328 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( NULL == left || NULL == right ) {
right             332 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c     if( pmix_bitmap_size(left) != pmix_bitmap_size(right) ) {
right             340 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.c         if( left->bitmap[i] != right->bitmap[i] ) {
right             196 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.h PMIX_EXPORT int pmix_bitmap_bitwise_and_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right);
right             205 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.h PMIX_EXPORT int pmix_bitmap_bitwise_or_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right);
right             214 opal/mca/pmix/pmix4x/pmix/src/class/pmix_bitmap.h PMIX_EXPORT int pmix_bitmap_bitwise_xor_inplace(pmix_bitmap_t *dest, pmix_bitmap_t *right);
right             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);