vrank 1032 ompi/mca/coll/base/coll_base_allreduce.c int vrank, step, wsize; vrank 1065 ompi/mca/coll/base/coll_base_allreduce.c vrank = -1; vrank 1091 ompi/mca/coll/base/coll_base_allreduce.c vrank = rank / 2; vrank 1094 ompi/mca/coll/base/coll_base_allreduce.c vrank = rank - nprocs_rem; vrank 1118 ompi/mca/coll/base/coll_base_allreduce.c if (vrank != -1) { vrank 1128 ompi/mca/coll/base/coll_base_allreduce.c int vdest = vrank ^ mask; vrank 1191 ompi/mca/coll/base/coll_base_allreduce.c int vdest = vrank ^ mask; vrank 797 ompi/mca/coll/base/coll_base_bcast.c int vrank = (rank - root + comm_size) % comm_size; vrank 805 ompi/mca/coll/base/coll_base_bcast.c if (vrank & mask) { vrank 808 ompi/mca/coll/base/coll_base_bcast.c recv_count = count - vrank * scatter_count; vrank 813 ompi/mca/coll/base/coll_base_bcast.c err = MCA_PML_CALL(recv((char *)buf + (ptrdiff_t)vrank * scatter_count * extent, vrank 828 ompi/mca/coll/base/coll_base_bcast.c if (vrank + mask < comm_size) { vrank 832 ompi/mca/coll/base/coll_base_bcast.c err = MCA_PML_CALL(send((char *)buf + (ptrdiff_t)scatter_count * (vrank + mask) * extent, vrank 847 ompi/mca/coll/base/coll_base_bcast.c int rem_count = count - vrank * scatter_count; vrank 854 ompi/mca/coll/base/coll_base_bcast.c int vremote = vrank ^ mask; vrank 857 ompi/mca/coll/base/coll_base_bcast.c int vrank_tree_root = ompi_rounddown(vrank, mask); vrank 887 ompi/mca/coll/base/coll_base_bcast.c vremote = vrank ^ rhalving_mask; vrank 889 ompi/mca/coll/base/coll_base_bcast.c int tree_root = ompi_rounddown(vrank, rhalving_mask << 1); vrank 895 ompi/mca/coll/base/coll_base_bcast.c if ((vremote > vrank) && (vrank < tree_root + nprocs_alldata) vrank 903 ompi/mca/coll/base/coll_base_bcast.c } else if ((vremote < vrank) && (vremote < tree_root + nprocs_alldata) vrank 904 ompi/mca/coll/base/coll_base_bcast.c && (vrank >= tree_root + nprocs_alldata)) { vrank 974 ompi/mca/coll/base/coll_base_bcast.c int vrank = (rank - root + comm_size) % comm_size; vrank 982 ompi/mca/coll/base/coll_base_bcast.c if (vrank & mask) { vrank 985 ompi/mca/coll/base/coll_base_bcast.c recv_count = count - vrank * scatter_count; vrank 990 ompi/mca/coll/base/coll_base_bcast.c err = MCA_PML_CALL(recv((char *)buf + (ptrdiff_t)vrank * scatter_count * extent, vrank 1005 ompi/mca/coll/base/coll_base_bcast.c if (vrank + mask < comm_size) { vrank 1009 ompi/mca/coll/base/coll_base_bcast.c err = MCA_PML_CALL(send((char *)buf + (ptrdiff_t)scatter_count * (vrank + mask) * extent, vrank 1023 ompi/mca/coll/base/coll_base_bcast.c int send_block = vrank; vrank 1024 ompi/mca/coll/base/coll_base_bcast.c int recv_block = (vrank - 1 + comm_size) % comm_size; vrank 49 ompi/mca/coll/base/coll_base_gather.c int line = -1, i, rank, vrank, size, total_recv = 0, err; vrank 68 ompi/mca/coll/base/coll_base_gather.c vrank = (rank - root + size) % size; vrank 103 ompi/mca/coll/base/coll_base_gather.c } else if (!(vrank % 2)) { vrank 133 ompi/mca/coll/base/coll_base_gather.c if (!(vrank % 2)) { vrank 139 ompi/mca/coll/base/coll_base_gather.c mycount = vkid - vrank; vrank 184 ompi/mca/coll/base/coll_base_gather.c } else if (!(vrank % 2)) { vrank 864 ompi/mca/coll/base/coll_base_reduce.c int vrank, step, wsize; vrank 897 ompi/mca/coll/base/coll_base_reduce.c vrank = -1; vrank 923 ompi/mca/coll/base/coll_base_reduce.c vrank = rank / 2; vrank 926 ompi/mca/coll/base/coll_base_reduce.c vrank = rank - nprocs_rem; vrank 951 ompi/mca/coll/base/coll_base_reduce.c if (vrank != -1) { vrank 961 ompi/mca/coll/base/coll_base_reduce.c int vdest = vrank ^ mask; vrank 1046 ompi/mca/coll/base/coll_base_reduce.c vrank = 0; vrank 1048 ompi/mca/coll/base/coll_base_reduce.c } else if (vrank == 0) { vrank 1054 ompi/mca/coll/base/coll_base_reduce.c vrank = -1; vrank 1073 ompi/mca/coll/base/coll_base_reduce.c if (vrank != -1) { vrank 1078 ompi/mca/coll/base/coll_base_reduce.c int vdest = vrank ^ mask; vrank 758 ompi/mca/coll/base/coll_base_reduce_scatter.c int vrank = -1; vrank 767 ompi/mca/coll/base/coll_base_reduce_scatter.c vrank = -1; vrank 776 ompi/mca/coll/base/coll_base_reduce_scatter.c vrank = rank / 2; vrank 780 ompi/mca/coll/base/coll_base_reduce_scatter.c vrank = rank - nprocs_rem; vrank 783 ompi/mca/coll/base/coll_base_reduce_scatter.c if (vrank != -1) { vrank 797 ompi/mca/coll/base/coll_base_reduce_scatter.c int vpeer = vrank ^ mask; vrank 801 ompi/mca/coll/base/coll_base_reduce_scatter.c if ((vrank & mask) == 0) { vrank 828 ompi/mca/coll/base/coll_base_reduce_scatter.c if (vrank < vpeer) { vrank 846 ompi/mca/coll/base/coll_base_reduce_scatter.c int vpeer = ompi_mirror_perm(vrank, log2_size); vrank 865 ompi/mca/coll/base/coll_base_reduce_scatter.c if (vpeer != vrank) { vrank 388 ompi/mca/coll/base/coll_base_reduce_scatter_block.c int vrank = -1; vrank 397 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = -1; vrank 406 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = rank / 2; vrank 410 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = rank - nprocs_rem; vrank 413 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if (vrank != -1) { vrank 425 ompi/mca/coll/base/coll_base_reduce_scatter_block.c int vpeer = vrank ^ mask; vrank 435 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if (vrank < vpeer) { vrank 629 ompi/mca/coll/base/coll_base_reduce_scatter_block.c int vrank = -1; vrank 638 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = -1; vrank 647 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = rank / 2; vrank 651 ompi/mca/coll/base/coll_base_reduce_scatter_block.c vrank = rank - nprocs_rem; vrank 654 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if (vrank != -1) { vrank 669 ompi/mca/coll/base/coll_base_reduce_scatter_block.c int vpeer = vrank ^ mask; vrank 673 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if ((vrank & mask) == 0) { vrank 696 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if (vrank < vpeer) { vrank 714 ompi/mca/coll/base/coll_base_reduce_scatter_block.c int vpeer = ompi_mirror_perm(vrank, log2_size); vrank 737 ompi/mca/coll/base/coll_base_reduce_scatter_block.c if (vpeer != vrank) { vrank 68 ompi/mca/coll/base/coll_base_scatter.c int line = -1, rank, vrank, size, err; vrank 88 ompi/mca/coll/base/coll_base_scatter.c vrank = (rank - root + size) % size; vrank 127 ompi/mca/coll/base/coll_base_scatter.c } else if (!(vrank % 2)) { vrank 143 ompi/mca/coll/base/coll_base_scatter.c if (!(vrank % 2)) { vrank 164 ompi/mca/coll/base/coll_base_scatter.c int send_count = vchild - vrank; vrank 406 ompi/mca/coll/base/coll_base_topo.c int childs = 0, rank, vrank, size, mask = 1, remote, i; vrank 417 ompi/mca/coll/base/coll_base_topo.c vrank = (rank - root + size) % size; vrank 437 ompi/mca/coll/base/coll_base_topo.c remote = vrank ^ mask; vrank 438 ompi/mca/coll/base/coll_base_topo.c if (remote < vrank) { vrank 488 ompi/mca/coll/base/coll_base_topo.c int vrank = (rank - root + comm_size) % comm_size; vrank 504 ompi/mca/coll/base/coll_base_topo.c if (vrank % (radix * mask)) { vrank 505 ompi/mca/coll/base/coll_base_topo.c kmtree->tree_prev = vrank / (radix * mask) * (radix * mask); vrank 517 ompi/mca/coll/base/coll_base_topo.c int child = vrank + mask * r; vrank 52 ompi/mca/coll/basic/coll_basic_bcast.c int vrank; vrank 63 ompi/mca/coll/basic/coll_basic_bcast.c vrank = (rank + size - root) % size; vrank 66 ompi/mca/coll/basic/coll_basic_bcast.c hibit = opal_hibit(vrank, dim); vrank 71 ompi/mca/coll/basic/coll_basic_bcast.c if (vrank > 0) { vrank 73 ompi/mca/coll/basic/coll_basic_bcast.c peer = ((vrank & ~(1 << hibit)) + root) % size; vrank 92 ompi/mca/coll/basic/coll_basic_bcast.c peer = vrank | mask; vrank 93 ompi/mca/coll/basic/coll_basic_reduce.c int i, size, rank, vrank; vrank 116 ompi/mca/coll/basic/coll_basic_reduce.c vrank = ompi_op_is_commute(op) ? (rank - root + size) % size : rank; vrank 151 ompi/mca/coll/basic/coll_basic_reduce.c if (rank != root && 0 == (vrank & 1)) { vrank 169 ompi/mca/coll/basic/coll_basic_reduce.c if (vrank & mask) { vrank 170 ompi/mca/coll/basic/coll_basic_reduce.c peer = vrank & ~mask; vrank 189 ompi/mca/coll/basic/coll_basic_reduce.c peer = vrank | mask; vrank 242 ompi/mca/coll/basic/coll_basic_reduce.c if (0 == vrank) { vrank 344 ompi/mca/coll/libnbc/nbc_iallreduce.c #define RANK2VRANK(rank, vrank, root) \ vrank 346 ompi/mca/coll/libnbc/nbc_iallreduce.c vrank = rank; \ vrank 347 ompi/mca/coll/libnbc/nbc_iallreduce.c if (rank == 0) vrank = root; \ vrank 348 ompi/mca/coll/libnbc/nbc_iallreduce.c if (rank == root) vrank = 0; \ vrank 350 ompi/mca/coll/libnbc/nbc_iallreduce.c #define VRANK2RANK(rank, vrank, root) \ vrank 352 ompi/mca/coll/libnbc/nbc_iallreduce.c rank = vrank; \ vrank 353 ompi/mca/coll/libnbc/nbc_iallreduce.c if (vrank == 0) rank = root; \ vrank 354 ompi/mca/coll/libnbc/nbc_iallreduce.c if (vrank == root) rank = 0; \ vrank 358 ompi/mca/coll/libnbc/nbc_iallreduce.c int root, vrank, maxr, vpeer, peer, res; vrank 363 ompi/mca/coll/libnbc/nbc_iallreduce.c RANK2VRANK(rank, vrank, root); vrank 387 ompi/mca/coll/libnbc/nbc_iallreduce.c if ((vrank % (1 << r)) == 0) { vrank 389 ompi/mca/coll/libnbc/nbc_iallreduce.c vpeer = vrank + (1 << (r - 1)); vrank 416 ompi/mca/coll/libnbc/nbc_iallreduce.c vpeer = vrank - (1 << (r - 1)); vrank 437 ompi/mca/coll/libnbc/nbc_iallreduce.c RANK2VRANK(rank, vrank, root); vrank 440 ompi/mca/coll/libnbc/nbc_iallreduce.c if (vrank != 0) { vrank 442 ompi/mca/coll/libnbc/nbc_iallreduce.c if ((vrank >= (1 << r)) && (vrank < (1 << (r + 1)))) { vrank 443 ompi/mca/coll/libnbc/nbc_iallreduce.c VRANK2RANK(peer, vrank - (1 << r), root); vrank 457 ompi/mca/coll/libnbc/nbc_iallreduce.c if (0 == vrank) assert(lbuf == recvbuf); vrank 460 ompi/mca/coll/libnbc/nbc_iallreduce.c if (((vrank + (1 << r) < p) && (vrank < (1 << r))) || (vrank == 0)) { vrank 461 ompi/mca/coll/libnbc/nbc_iallreduce.c VRANK2RANK(peer, vrank + (1 << r), root); vrank 847 ompi/mca/coll/libnbc/nbc_iallreduce.c int vrank, step, wsize; vrank 873 ompi/mca/coll/libnbc/nbc_iallreduce.c vrank = -1; vrank 893 ompi/mca/coll/libnbc/nbc_iallreduce.c vrank = rank / 2; vrank 896 ompi/mca/coll/libnbc/nbc_iallreduce.c vrank = rank - nprocs_rem; vrank 918 ompi/mca/coll/libnbc/nbc_iallreduce.c if (vrank != -1) { vrank 927 ompi/mca/coll/libnbc/nbc_iallreduce.c int vdest = vrank ^ mask; vrank 982 ompi/mca/coll/libnbc/nbc_iallreduce.c int vdest = vrank ^ mask; vrank 226 ompi/mca/coll/libnbc/nbc_ibcast.c #define RANK2VRANK(rank, vrank, root) \ vrank 228 ompi/mca/coll/libnbc/nbc_ibcast.c vrank = rank; \ vrank 229 ompi/mca/coll/libnbc/nbc_ibcast.c if (rank == 0) vrank = root; \ vrank 230 ompi/mca/coll/libnbc/nbc_ibcast.c if (rank == root) vrank = 0; \ vrank 232 ompi/mca/coll/libnbc/nbc_ibcast.c #define VRANK2RANK(rank, vrank, root) \ vrank 234 ompi/mca/coll/libnbc/nbc_ibcast.c rank = vrank; \ vrank 235 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank == 0) rank = root; \ vrank 236 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank == root) rank = 0; \ vrank 239 ompi/mca/coll/libnbc/nbc_ibcast.c int maxr, vrank, peer, res; vrank 243 ompi/mca/coll/libnbc/nbc_ibcast.c RANK2VRANK(rank, vrank, root); vrank 246 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank != 0) { vrank 248 ompi/mca/coll/libnbc/nbc_ibcast.c if ((vrank >= (1 << r)) && (vrank < (1 << (r + 1)))) { vrank 249 ompi/mca/coll/libnbc/nbc_ibcast.c VRANK2RANK(peer, vrank - (1 << r), root); vrank 265 ompi/mca/coll/libnbc/nbc_ibcast.c if (((vrank + (1 << r) < p) && (vrank < (1 << r))) || (vrank == 0)) { vrank 266 ompi/mca/coll/libnbc/nbc_ibcast.c VRANK2RANK(peer, vrank + (1 << r), root); vrank 305 ompi/mca/coll/libnbc/nbc_ibcast.c int res, vrank, rpeer, speer, numfrag, fragcount, thiscount; vrank 309 ompi/mca/coll/libnbc/nbc_ibcast.c RANK2VRANK(rank, vrank, root); vrank 310 ompi/mca/coll/libnbc/nbc_ibcast.c VRANK2RANK(rpeer, vrank-1, root); vrank 311 ompi/mca/coll/libnbc/nbc_ibcast.c VRANK2RANK(speer, vrank+1, root); vrank 338 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank != 0) { vrank 346 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank != p-1) { vrank 353 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank == 0) { vrank 380 ompi/mca/coll/libnbc/nbc_ibcast.c int vrank = (rank - root + comm_size) % comm_size; vrank 383 ompi/mca/coll/libnbc/nbc_ibcast.c if (vrank % (knomial_radix * mask)) { vrank 384 ompi/mca/coll/libnbc/nbc_ibcast.c int parent = vrank / (knomial_radix * mask) * (knomial_radix * mask); vrank 397 ompi/mca/coll/libnbc/nbc_ibcast.c int child = vrank + mask * r; vrank 344 ompi/mca/coll/libnbc/nbc_ireduce.c #define RANK2VRANK(rank, vrank, root) \ vrank 346 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = rank; \ vrank 347 ompi/mca/coll/libnbc/nbc_ireduce.c if (rank == 0) vrank = root; \ vrank 348 ompi/mca/coll/libnbc/nbc_ireduce.c if (rank == root) vrank = 0; \ vrank 350 ompi/mca/coll/libnbc/nbc_ireduce.c #define VRANK2RANK(rank, vrank, root) \ vrank 352 ompi/mca/coll/libnbc/nbc_ireduce.c rank = vrank; \ vrank 353 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank == 0) rank = root; \ vrank 354 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank == root) rank = 0; \ vrank 358 ompi/mca/coll/libnbc/nbc_ireduce.c int vroot, vrank, vpeer, peer, res, maxr; vrank 369 ompi/mca/coll/libnbc/nbc_ireduce.c RANK2VRANK(rank, vrank, vroot); vrank 398 ompi/mca/coll/libnbc/nbc_ireduce.c if ((vrank % (1 << r)) == 0) { vrank 400 ompi/mca/coll/libnbc/nbc_ireduce.c vpeer = vrank + (1 << (r - 1)); vrank 430 ompi/mca/coll/libnbc/nbc_ireduce.c vpeer = vrank - (1 << (r - 1)); vrank 463 ompi/mca/coll/libnbc/nbc_ireduce.c int res, vrank, rpeer, speer, numfrag, fragcount, thiscount; vrank 466 ompi/mca/coll/libnbc/nbc_ireduce.c RANK2VRANK(rank, vrank, root); vrank 467 ompi/mca/coll/libnbc/nbc_ireduce.c VRANK2RANK(rpeer, vrank+1, root); vrank 468 ompi/mca/coll/libnbc/nbc_ireduce.c VRANK2RANK(speer, vrank-1, root); vrank 490 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank != p-1) { vrank 491 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank == 0 && sendbuf != recvbuf) { vrank 501 ompi/mca/coll/libnbc/nbc_ireduce.c if(vrank == 0) { vrank 520 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank != 0) { vrank 523 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank == p-1) { vrank 692 ompi/mca/coll/libnbc/nbc_ireduce.c int vrank, step, wsize; vrank 724 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = -1; vrank 749 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = rank / 2; vrank 752 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = rank - nprocs_rem; vrank 777 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank != -1) { vrank 787 ompi/mca/coll/libnbc/nbc_ireduce.c int vdest = vrank ^ mask; vrank 870 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = 0; vrank 872 ompi/mca/coll/libnbc/nbc_ireduce.c } else if (vrank == 0) { vrank 877 ompi/mca/coll/libnbc/nbc_ireduce.c vrank = -1; vrank 896 ompi/mca/coll/libnbc/nbc_ireduce.c if (vrank != -1) { vrank 901 ompi/mca/coll/libnbc/nbc_ireduce.c int vdest = vrank ^ mask; vrank 61 ompi/mca/coll/portals4/coll_portals4_gather.c int vrank) vrank 66 ompi/mca/coll/portals4/coll_portals4_gather.c if (0 == vrank) { vrank 69 ompi/mca/coll/portals4/coll_portals4_gather.c max = 1 << ffs(vrank - 1); vrank 70 ompi/mca/coll/portals4/coll_portals4_gather.c return ((vrank + max <= size ) ? max : size - vrank) -1; vrank 79 ompi/mca/coll/portals4/coll_portals4_gather.c int childs = 0, rank, vrank, vparent, size, mask = 1, remote, i; vrank 88 ompi/mca/coll/portals4/coll_portals4_gather.c vrank = VRANK(rank, root, size); vrank 109 ompi/mca/coll/portals4/coll_portals4_gather.c remote = vrank ^ mask; vrank 110 ompi/mca/coll/portals4/coll_portals4_gather.c if (remote < vrank) { vrank 132 ompi/mca/coll/portals4/coll_portals4_gather.c int possible_descendants = vrank - vparent - 1; vrank 133 ompi/mca/coll/portals4/coll_portals4_gather.c if ((vrank + possible_descendants) > size) { vrank 134 ompi/mca/coll/portals4/coll_portals4_gather.c bmtree->tree_numdescendants = size - vrank - 1; vrank 145 ompi/mca/coll/portals4/coll_portals4_gather.c size, rank, vrank, bmtree->tree_root, bmtree->tree_prev, vparent, bmtree->tree_nextsize, bmtree->tree_numdescendants); vrank 184 ompi/mca/coll/portals4/coll_portals4_gather.c int vrank = VRANK(request->u.gather.my_rank, request->u.gather.root_rank, request->u.gather.size); vrank 196 ompi/mca/coll/portals4/coll_portals4_gather.c if (vrank == 0) { vrank 217 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, vrank 240 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, vrank 259 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, vrank 521 ompi/mca/coll/portals4/coll_portals4_gather.c int vrank=-1; vrank 582 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, vrank 594 ompi/mca/coll/portals4/coll_portals4_gather.c vrank = VRANK(request->u.gather.my_rank, request->u.gather.root_rank, request->u.gather.size); vrank 616 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, bmtree->tree_next[i], vrank, request->u.gather.root_rank , sub_tree_size, local_number_of_fragment)); vrank 625 ompi/mca/coll/portals4/coll_portals4_gather.c if (vrank != 0) { vrank 643 ompi/mca/coll/portals4/coll_portals4_gather.c if (vrank == 0) { vrank 653 ompi/mca/coll/portals4/coll_portals4_gather.c ptl_size_t remote_offset=(vrank-vparent) * request->u.gather.packed_size; vrank 657 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, vrank 658 ompi/mca/coll/portals4/coll_portals4_gather.c remote_offset, vrank, vparent, request->u.gather.packed_size); vrank 772 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, expected_ops); vrank 782 ompi/mca/coll/portals4/coll_portals4_gather.c __FILE__, __LINE__, vrank, expected_ops); vrank 190 oshmem/mca/scoll/basic/scoll_basic_broadcast.c int vrank; vrank 201 oshmem/mca/scoll/basic/scoll_basic_broadcast.c vrank = (my_id + group->proc_count - root_id) % group->proc_count; vrank 202 oshmem/mca/scoll/basic/scoll_basic_broadcast.c hibit = opal_hibit(vrank, dim); vrank 206 oshmem/mca/scoll/basic/scoll_basic_broadcast.c group->my_pe, dim, vrank, hibit); vrank 212 oshmem/mca/scoll/basic/scoll_basic_broadcast.c if (vrank > 0) { vrank 231 oshmem/mca/scoll/basic/scoll_basic_broadcast.c peer_id = vrank | mask; vrank 661 oshmem/mca/scoll/basic/scoll_basic_reduce.c int i, size, rank, vrank; vrank 681 oshmem/mca/scoll/basic/scoll_basic_reduce.c vrank = (my_id + size - root_id) % size; vrank 701 oshmem/mca/scoll/basic/scoll_basic_reduce.c if (my_id != root_id && 0 == (vrank & 1)) { vrank 719 oshmem/mca/scoll/basic/scoll_basic_reduce.c if (vrank & mask) { vrank 720 oshmem/mca/scoll/basic/scoll_basic_reduce.c peer_id = vrank & ~mask; vrank 736 oshmem/mca/scoll/basic/scoll_basic_reduce.c peer_id = vrank | mask; vrank 782 oshmem/mca/scoll/basic/scoll_basic_reduce.c if (0 == vrank) {