distance 92 ompi/mca/coll/base/coll_base_allgather.c int line = -1, rank, size, sendto, recvfrom, distance, blockcount, err = 0; distance 134 ompi/mca/coll/base/coll_base_allgather.c for (distance = 1; distance < size; distance<<=1) { distance 136 ompi/mca/coll/base/coll_base_allgather.c recvfrom = (rank + distance) % size; distance 137 ompi/mca/coll/base/coll_base_allgather.c sendto = (rank - distance + size) % size; distance 139 ompi/mca/coll/base/coll_base_allgather.c tmprecv = tmpsend + (ptrdiff_t)distance * (ptrdiff_t)rcount * rext; distance 141 ompi/mca/coll/base/coll_base_allgather.c if (distance <= (size >> 1)) { distance 142 ompi/mca/coll/base/coll_base_allgather.c blockcount = distance; distance 144 ompi/mca/coll/base/coll_base_allgather.c blockcount = size - distance; distance 261 ompi/mca/coll/base/coll_base_allgather.c int remote, distance, sendblocklocation; distance 310 ompi/mca/coll/base/coll_base_allgather.c for (distance = 0x1; distance < size; distance<<=1) { distance 311 ompi/mca/coll/base/coll_base_allgather.c remote = rank ^ distance; distance 315 ompi/mca/coll/base/coll_base_allgather.c tmprecv = (char*)rbuf + (ptrdiff_t)(sendblocklocation + distance) * (ptrdiff_t)rcount * rext; distance 318 ompi/mca/coll/base/coll_base_allgather.c tmprecv = (char*)rbuf + (ptrdiff_t)(sendblocklocation - distance) * (ptrdiff_t)rcount * rext; distance 319 ompi/mca/coll/base/coll_base_allgather.c sendblocklocation -= distance; distance 323 ompi/mca/coll/base/coll_base_allgather.c err = ompi_coll_base_sendrecv(tmpsend, (ptrdiff_t)distance * (ptrdiff_t)rcount, rdtype, distance 325 ompi/mca/coll/base/coll_base_allgather.c tmprecv, (ptrdiff_t)distance * (ptrdiff_t)rcount, rdtype, distance 101 ompi/mca/coll/base/coll_base_allgatherv.c int line = -1, err = 0, rank, size, sendto, recvfrom, distance, blockcount, i; distance 149 ompi/mca/coll/base/coll_base_allgatherv.c for (distance = 1; distance < size; distance<<=1) { distance 151 ompi/mca/coll/base/coll_base_allgatherv.c recvfrom = (rank + distance) % size; distance 152 ompi/mca/coll/base/coll_base_allgatherv.c sendto = (rank - distance + size) % size; distance 154 ompi/mca/coll/base/coll_base_allgatherv.c if (distance <= (size >> 1)) { distance 155 ompi/mca/coll/base/coll_base_allgatherv.c blockcount = distance; distance 157 ompi/mca/coll/base/coll_base_allgatherv.c blockcount = size - distance; distance 137 ompi/mca/coll/base/coll_base_allreduce.c int ret, line, rank, size, adjsize, remote, distance; distance 211 ompi/mca/coll/base/coll_base_allreduce.c for (distance = 0x1; distance < adjsize; distance <<=1) { distance 214 ompi/mca/coll/base/coll_base_allreduce.c newremote = newrank ^ distance; distance 199 ompi/mca/coll/base/coll_base_alltoall.c int sendto, recvfrom, distance, *displs = NULL, *blen = NULL; distance 252 ompi/mca/coll/base/coll_base_alltoall.c for (distance = 1; distance < size; distance<<=1) { distance 254 ompi/mca/coll/base/coll_base_alltoall.c sendto = (rank + distance) % size; distance 255 ompi/mca/coll/base/coll_base_alltoall.c recvfrom = (rank - distance + size) % size; distance 260 ompi/mca/coll/base/coll_base_alltoall.c if (( i & distance) == distance) { distance 256 ompi/mca/coll/base/coll_base_barrier.c int rank, size, distance, to, from, err, line = 0; distance 266 ompi/mca/coll/base/coll_base_barrier.c for (distance = 1; distance < size; distance <<= 1) { distance 267 ompi/mca/coll/base/coll_base_barrier.c from = (rank + size - distance) % size; distance 268 ompi/mca/coll/base/coll_base_barrier.c to = (rank + distance) % size; distance 368 ompi/mca/coll/libnbc/nbc_iallgather.c for (int distance = 1; distance < comm_size; distance <<= 1) { distance 369 ompi/mca/coll/libnbc/nbc_iallgather.c int remote = rank ^ distance; distance 373 ompi/mca/coll/libnbc/nbc_iallgather.c tmprecv = (char *)rbuf + (ptrdiff_t)(sendblocklocation + distance) * (ptrdiff_t)rcount * rext; distance 375 ompi/mca/coll/libnbc/nbc_iallgather.c tmprecv = (char *)rbuf + (ptrdiff_t)(sendblocklocation - distance) * (ptrdiff_t)rcount * rext; distance 376 ompi/mca/coll/libnbc/nbc_iallgather.c sendblocklocation -= distance; distance 379 ompi/mca/coll/libnbc/nbc_iallgather.c res = NBC_Sched_send(tmpsend, false, (ptrdiff_t)distance * (ptrdiff_t)rcount, distance 383 ompi/mca/coll/libnbc/nbc_iallgather.c res = NBC_Sched_recv(tmprecv, false, (ptrdiff_t)distance * (ptrdiff_t)rcount, distance 312 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c int distance, numAggs; distance 378 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c distance = psetSize/numAggs; distance 379 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c TRACE_ERR("nextBridge %u is bridge %u, distance %u, size %u\n",nextBridge, aggList[nextBridge],distance,psetSize); distance 385 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c aggList[nextAggr] = bridgelist[procIndex+j*distance+1].rank; distance 386 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c TRACE_ERR("agglist[%d] -> bridgelist[%d] = %d\n", nextAggr, procIndex+j*distance+1,aggList[nextAggr]); distance 15 ompi/mca/topo/treematch/treematch/tm_solution.c int distance(tm_topology_t *topology,int i, int j); distance 106 ompi/mca/topo/treematch/treematch/tm_solution.c a = cost[depth-distance(topology,sigma[i],sigma[j])]; distance 142 ompi/mca/topo/treematch/treematch/tm_solution.c a = cost[depth-distance(topology,sigma[i],sigma[j])]; distance 171 ompi/mca/topo/treematch/treematch/tm_solution.c nb_hops = 2*distance(topology,sigma[i],sigma[j]); distance 7 ompi/mca/topo/treematch/treematch/tm_solution.h int distance(tm_topology_t *topology,int i, int j); distance 153 ompi/patterns/net/netpatterns_knomial_tree.h int distance, distance 158 ompi/patterns/net/netpatterns_knomial_tree.h distance = src_rank - my_rank; distance 161 ompi/patterns/net/netpatterns_knomial_tree.h if (0 > distance) { distance 162 ompi/patterns/net/netpatterns_knomial_tree.h distance += size; distance 166 ompi/patterns/net/netpatterns_knomial_tree.h while(distance / (pow_k * radix)) { distance 2491 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c unsigned distance = strtoul(tmp, &next, 0); /* stored as a %d */ distance 2494 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-linux.c *curdist = (uint64_t) distance; distance 89 orte/mca/grpcomm/base/base.h ORTE_DECLSPEC void orte_grpcomm_base_mark_distance_recv(orte_grpcomm_coll_t *coll, uint32_t distance); distance 90 orte/mca/grpcomm/base/base.h ORTE_DECLSPEC unsigned int orte_grpcomm_base_check_distance_recv(orte_grpcomm_coll_t *coll, uint32_t distance); distance 553 orte/mca/grpcomm/base/grpcomm_base_stubs.c uint32_t distance) { distance 554 orte/mca/grpcomm/base/grpcomm_base_stubs.c opal_bitmap_set_bit (&coll->distance_mask_recv, distance); distance 558 orte/mca/grpcomm/base/grpcomm_base_stubs.c uint32_t distance) { distance 559 orte/mca/grpcomm/base/grpcomm_base_stubs.c return opal_bitmap_is_set_bit (&coll->distance_mask_recv, distance); distance 37 test/carto/carto_test.c int rank, size, distance, distance_array_size, i; distance 69 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); distance 70 test/carto/carto_test.c opal_output(0,"\nThe distance between slot0 and slot3 is %d\n",distance); distance 100 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); distance 101 test/carto/carto_test.c opal_output(0,"\nThe distance between slot0 and mthca1 is %d\n",distance); distance 131 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); distance 132 test/carto/carto_test.c opal_output(0,"\nThe distance between slot0 and eth1 is %d\n",distance); distance 162 test/carto/carto_test.c distance = opal_carto_base_spf(graph, slot0, end_node); distance 163 test/carto/carto_test.c opal_output(0,"\nThe distance between slot0 and mem3 is %d\n",distance);