step 38 ompi/datatype/ompi_datatype_create_darray.c int blksize, global_size, mysize, i, j, rc, start_loop, step; step 54 ompi/datatype/ompi_datatype_create_darray.c start_loop = ndims - 1 ; step = -1; step 56 ompi/datatype/ompi_datatype_create_darray.c start_loop = 0 ; step = 1; step 64 ompi/datatype/ompi_datatype_create_darray.c for (i = start_loop ; i != dim ; i += step) { step 187 ompi/datatype/ompi_datatype_create_darray.c int i, start_loop, end_loop, step; step 226 ompi/datatype/ompi_datatype_create_darray.c start_loop = ndims - 1 ; step = -1; end_loop = -1; step 228 ompi/datatype/ompi_datatype_create_darray.c start_loop = 0 ; step = 1; end_loop = ndims; step 232 ompi/datatype/ompi_datatype_create_darray.c for (i = start_loop; i != end_loop; i += step) { step 277 ompi/datatype/ompi_datatype_create_darray.c for (i = start_loop + step; i != end_loop; i += step) { step 278 ompi/datatype/ompi_datatype_create_darray.c tmp_size *= gsize_array[i - step]; step 40 ompi/datatype/ompi_datatype_create_subarray.c int32_t i, step, end_loop; step 65 ompi/datatype/ompi_datatype_create_subarray.c step = -1; step 69 ompi/datatype/ompi_datatype_create_subarray.c step = 1; step 77 ompi/datatype/ompi_datatype_create_subarray.c ompi_datatype_create_vector( subsize_array[i+step], subsize_array[i], size_array[i], step 81 ompi/datatype/ompi_datatype_create_subarray.c size = (MPI_Aint)size_array[i] * (MPI_Aint)size_array[i+step]; step 82 ompi/datatype/ompi_datatype_create_subarray.c displ = (MPI_Aint)start_array[i] + (MPI_Aint)start_array[i+step] * (MPI_Aint)size_array[i]; step 83 ompi/datatype/ompi_datatype_create_subarray.c for( i += 2 * step; i != end_loop; i += step ) { step 1032 ompi/mca/coll/base/coll_base_allreduce.c int vrank, step, wsize; step 1119 ompi/mca/coll/base/coll_base_allreduce.c step = 0; step 1138 ompi/mca/coll/base/coll_base_allreduce.c rcount[step] = wsize / 2; step 1139 ompi/mca/coll/base/coll_base_allreduce.c scount[step] = wsize - rcount[step]; step 1140 ompi/mca/coll/base/coll_base_allreduce.c sindex[step] = rindex[step] + rcount[step]; step 1147 ompi/mca/coll/base/coll_base_allreduce.c scount[step] = wsize / 2; step 1148 ompi/mca/coll/base/coll_base_allreduce.c rcount[step] = wsize - scount[step]; step 1149 ompi/mca/coll/base/coll_base_allreduce.c rindex[step] = sindex[step] + scount[step]; step 1153 ompi/mca/coll/base/coll_base_allreduce.c err = ompi_coll_base_sendrecv((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 1154 ompi/mca/coll/base/coll_base_allreduce.c scount[step], dtype, dest, step 1156 ompi/mca/coll/base/coll_base_allreduce.c (char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 1157 ompi/mca/coll/base/coll_base_allreduce.c rcount[step], dtype, dest, step 1163 ompi/mca/coll/base/coll_base_allreduce.c ompi_op_reduce(op, (char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 1164 ompi/mca/coll/base/coll_base_allreduce.c (char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 1165 ompi/mca/coll/base/coll_base_allreduce.c rcount[step], dtype); step 1168 ompi/mca/coll/base/coll_base_allreduce.c if (step + 1 < nsteps) { step 1169 ompi/mca/coll/base/coll_base_allreduce.c rindex[step + 1] = rindex[step]; step 1170 ompi/mca/coll/base/coll_base_allreduce.c sindex[step + 1] = rindex[step]; step 1171 ompi/mca/coll/base/coll_base_allreduce.c wsize = rcount[step]; step 1172 ompi/mca/coll/base/coll_base_allreduce.c step++; step 1188 ompi/mca/coll/base/coll_base_allreduce.c step = nsteps - 1; step 1199 ompi/mca/coll/base/coll_base_allreduce.c err = ompi_coll_base_sendrecv((char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 1200 ompi/mca/coll/base/coll_base_allreduce.c rcount[step], dtype, dest, step 1202 ompi/mca/coll/base/coll_base_allreduce.c (char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 1203 ompi/mca/coll/base/coll_base_allreduce.c scount[step], dtype, dest, step 1207 ompi/mca/coll/base/coll_base_allreduce.c step--; step 139 ompi/mca/coll/base/coll_base_alltoall.c int line = -1, err = 0, rank, size, step, sendto, recvfrom; step 161 ompi/mca/coll/base/coll_base_alltoall.c for (step = 1; step < size + 1; step++) { step 164 ompi/mca/coll/base/coll_base_alltoall.c sendto = (rank + step) % size; step 165 ompi/mca/coll/base/coll_base_alltoall.c recvfrom = (rank + size - step) % size; step 132 ompi/mca/coll/base/coll_base_alltoallv.c int line = -1, err = 0, rank, size, step = 0, sendto, recvfrom; step 151 ompi/mca/coll/base/coll_base_alltoallv.c for (step = 0; step < size; step++) { step 154 ompi/mca/coll/base/coll_base_alltoallv.c sendto = (rank + step) % size; step 155 ompi/mca/coll/base/coll_base_alltoallv.c recvfrom = (rank + size - step) % size; step 175 ompi/mca/coll/base/coll_base_alltoallv.c err, rank, step)); step 864 ompi/mca/coll/base/coll_base_reduce.c int vrank, step, wsize; step 952 ompi/mca/coll/base/coll_base_reduce.c step = 0; step 971 ompi/mca/coll/base/coll_base_reduce.c rcount[step] = wsize / 2; step 972 ompi/mca/coll/base/coll_base_reduce.c scount[step] = wsize - rcount[step]; step 973 ompi/mca/coll/base/coll_base_reduce.c sindex[step] = rindex[step] + rcount[step]; step 980 ompi/mca/coll/base/coll_base_reduce.c scount[step] = wsize / 2; step 981 ompi/mca/coll/base/coll_base_reduce.c rcount[step] = wsize - scount[step]; step 982 ompi/mca/coll/base/coll_base_reduce.c rindex[step] = sindex[step] + scount[step]; step 986 ompi/mca/coll/base/coll_base_reduce.c err = ompi_coll_base_sendrecv((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 987 ompi/mca/coll/base/coll_base_reduce.c scount[step], dtype, dest, step 989 ompi/mca/coll/base/coll_base_reduce.c (char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 990 ompi/mca/coll/base/coll_base_reduce.c rcount[step], dtype, dest, step 996 ompi/mca/coll/base/coll_base_reduce.c ompi_op_reduce(op, (char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 997 ompi/mca/coll/base/coll_base_reduce.c (char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 998 ompi/mca/coll/base/coll_base_reduce.c rcount[step], dtype); step 1001 ompi/mca/coll/base/coll_base_reduce.c if (step + 1 < nsteps) { step 1002 ompi/mca/coll/base/coll_base_reduce.c rindex[step + 1] = rindex[step]; step 1003 ompi/mca/coll/base/coll_base_reduce.c sindex[step + 1] = rindex[step]; step 1004 ompi/mca/coll/base/coll_base_reduce.c wsize = rcount[step]; step 1005 ompi/mca/coll/base/coll_base_reduce.c step++; step 1032 ompi/mca/coll/base/coll_base_reduce.c step = 0, wsize = count; step 1034 ompi/mca/coll/base/coll_base_reduce.c rcount[step] = wsize / 2; step 1035 ompi/mca/coll/base/coll_base_reduce.c scount[step] = wsize - rcount[step]; step 1036 ompi/mca/coll/base/coll_base_reduce.c rindex[step] = 0; step 1037 ompi/mca/coll/base/coll_base_reduce.c sindex[step] = rcount[step]; step 1038 ompi/mca/coll/base/coll_base_reduce.c step++; step 1075 ompi/mca/coll/base/coll_base_reduce.c step = nsteps - 1; /* step = ilog2(p') - 1 */ step 1084 ompi/mca/coll/base/coll_base_reduce.c vdest_tree = vdest >> step; step 1085 ompi/mca/coll/base/coll_base_reduce.c vdest_tree <<= step; step 1086 ompi/mca/coll/base/coll_base_reduce.c vroot_tree = vroot >> step; step 1087 ompi/mca/coll/base/coll_base_reduce.c vroot_tree <<= step; step 1090 ompi/mca/coll/base/coll_base_reduce.c err = MCA_PML_CALL(send((char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 1091 ompi/mca/coll/base/coll_base_reduce.c rcount[step], dtype, dest, step 1098 ompi/mca/coll/base/coll_base_reduce.c err = MCA_PML_CALL(recv((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 1099 ompi/mca/coll/base/coll_base_reduce.c scount[step], dtype, dest, step 1104 ompi/mca/coll/base/coll_base_reduce.c step--; step 847 ompi/mca/coll/libnbc/nbc_iallreduce.c int vrank, step, wsize; step 919 ompi/mca/coll/libnbc/nbc_iallreduce.c step = 0; step 936 ompi/mca/coll/libnbc/nbc_iallreduce.c rcount[step] = wsize / 2; step 937 ompi/mca/coll/libnbc/nbc_iallreduce.c scount[step] = wsize - rcount[step]; step 938 ompi/mca/coll/libnbc/nbc_iallreduce.c sindex[step] = rindex[step] + rcount[step]; step 945 ompi/mca/coll/libnbc/nbc_iallreduce.c scount[step] = wsize / 2; step 946 ompi/mca/coll/libnbc/nbc_iallreduce.c rcount[step] = wsize - scount[step]; step 947 ompi/mca/coll/libnbc/nbc_iallreduce.c rindex[step] = sindex[step] + scount[step]; step 950 ompi/mca/coll/libnbc/nbc_iallreduce.c res = NBC_Sched_send((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 951 ompi/mca/coll/libnbc/nbc_iallreduce.c false, scount[step], datatype, dest, schedule, false); step 953 ompi/mca/coll/libnbc/nbc_iallreduce.c res = NBC_Sched_recv((char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 954 ompi/mca/coll/libnbc/nbc_iallreduce.c false, rcount[step], datatype, dest, schedule, true); step 957 ompi/mca/coll/libnbc/nbc_iallreduce.c res = NBC_Sched_op((char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 958 ompi/mca/coll/libnbc/nbc_iallreduce.c false, (char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 959 ompi/mca/coll/libnbc/nbc_iallreduce.c false, rcount[step], datatype, op, schedule, true); step 962 ompi/mca/coll/libnbc/nbc_iallreduce.c if (step + 1 < nsteps) { step 963 ompi/mca/coll/libnbc/nbc_iallreduce.c rindex[step + 1] = rindex[step]; step 964 ompi/mca/coll/libnbc/nbc_iallreduce.c sindex[step + 1] = rindex[step]; step 965 ompi/mca/coll/libnbc/nbc_iallreduce.c wsize = rcount[step]; step 966 ompi/mca/coll/libnbc/nbc_iallreduce.c step++; step 980 ompi/mca/coll/libnbc/nbc_iallreduce.c step = nsteps - 1; step 989 ompi/mca/coll/libnbc/nbc_iallreduce.c res = NBC_Sched_send((char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 990 ompi/mca/coll/libnbc/nbc_iallreduce.c false, rcount[step], datatype, dest, schedule, false); step 992 ompi/mca/coll/libnbc/nbc_iallreduce.c res = NBC_Sched_recv((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 993 ompi/mca/coll/libnbc/nbc_iallreduce.c false, scount[step], datatype, dest, schedule, true); step 995 ompi/mca/coll/libnbc/nbc_iallreduce.c step--; step 692 ompi/mca/coll/libnbc/nbc_ireduce.c int vrank, step, wsize; step 778 ompi/mca/coll/libnbc/nbc_ireduce.c step = 0; step 797 ompi/mca/coll/libnbc/nbc_ireduce.c rcount[step] = wsize / 2; step 798 ompi/mca/coll/libnbc/nbc_ireduce.c scount[step] = wsize - rcount[step]; step 799 ompi/mca/coll/libnbc/nbc_ireduce.c sindex[step] = rindex[step] + rcount[step]; step 806 ompi/mca/coll/libnbc/nbc_ireduce.c scount[step] = wsize / 2; step 807 ompi/mca/coll/libnbc/nbc_ireduce.c rcount[step] = wsize - scount[step]; step 808 ompi/mca/coll/libnbc/nbc_ireduce.c rindex[step] = sindex[step] + scount[step]; step 812 ompi/mca/coll/libnbc/nbc_ireduce.c res = NBC_Sched_send((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 813 ompi/mca/coll/libnbc/nbc_ireduce.c tmpredbuf, scount[step], datatype, dest, schedule, false); step 815 ompi/mca/coll/libnbc/nbc_ireduce.c res = NBC_Sched_recv((char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 816 ompi/mca/coll/libnbc/nbc_ireduce.c false, rcount[step], datatype, dest, schedule, true); step 820 ompi/mca/coll/libnbc/nbc_ireduce.c res = NBC_Sched_op((char *)tmp_buf + (ptrdiff_t)rindex[step] * extent, step 821 ompi/mca/coll/libnbc/nbc_ireduce.c false, (char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 822 ompi/mca/coll/libnbc/nbc_ireduce.c tmpredbuf, rcount[step], datatype, op, schedule, true); step 826 ompi/mca/coll/libnbc/nbc_ireduce.c if (step + 1 < nsteps) { step 827 ompi/mca/coll/libnbc/nbc_ireduce.c rindex[step + 1] = rindex[step]; step 828 ompi/mca/coll/libnbc/nbc_ireduce.c sindex[step + 1] = rindex[step]; step 829 ompi/mca/coll/libnbc/nbc_ireduce.c wsize = rcount[step]; step 830 ompi/mca/coll/libnbc/nbc_ireduce.c step++; step 857 ompi/mca/coll/libnbc/nbc_ireduce.c step = 0, wsize = count; step 859 ompi/mca/coll/libnbc/nbc_ireduce.c rcount[step] = wsize / 2; step 860 ompi/mca/coll/libnbc/nbc_ireduce.c scount[step] = wsize - rcount[step]; step 861 ompi/mca/coll/libnbc/nbc_ireduce.c rindex[step] = 0; step 862 ompi/mca/coll/libnbc/nbc_ireduce.c sindex[step] = rcount[step]; step 863 ompi/mca/coll/libnbc/nbc_ireduce.c step++; step 898 ompi/mca/coll/libnbc/nbc_ireduce.c step = nsteps - 1; /* step = ilog2(p') - 1 */ step 907 ompi/mca/coll/libnbc/nbc_ireduce.c vdest_tree = vdest >> step; step 908 ompi/mca/coll/libnbc/nbc_ireduce.c vdest_tree <<= step; step 909 ompi/mca/coll/libnbc/nbc_ireduce.c vroot_tree = vroot >> step; step 910 ompi/mca/coll/libnbc/nbc_ireduce.c vroot_tree <<= step; step 914 ompi/mca/coll/libnbc/nbc_ireduce.c res = NBC_Sched_send((char *)rbuf + (ptrdiff_t)rindex[step] * extent, step 915 ompi/mca/coll/libnbc/nbc_ireduce.c tmpredbuf, rcount[step], datatype, dest, schedule, false); step 920 ompi/mca/coll/libnbc/nbc_ireduce.c res = NBC_Sched_recv((char *)rbuf + (ptrdiff_t)sindex[step] * extent, step 921 ompi/mca/coll/libnbc/nbc_ireduce.c tmpredbuf, scount[step], datatype, dest, schedule, true); step 924 ompi/mca/coll/libnbc/nbc_ireduce.c step--; step 185 ompi/patterns/net/netpatterns_knomial_tree.h int step = 0; step 191 ompi/patterns/net/netpatterns_knomial_tree.h ++step; step 195 ompi/patterns/net/netpatterns_knomial_tree.h *logk_level = step; step 65 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned step; step 141 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned step, nb; step 147 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c step = (unsigned) strtol(tmp, &tmp2, 0); step 153 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (!step) { step 170 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c loops[cur_loop].step = step; step 172 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (step < minstep) step 173 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c minstep = step; step 233 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned step, nb; step 244 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c step = total / data->level[mydepth].totalwidth; /* number of objects below us */ step 247 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c loops[cur_loop].step = step; step 250 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c assert(step); step 251 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (step < minstep) step 252 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c minstep = step; step 261 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c loops[nr_loops].step = 1; step 274 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned step = loops[i].step; step 277 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c array[j] += ((j / step) % nb) * mul; step 1096 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c unsigned step = 1; step 1109 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c while (step != total) { step 1111 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (total % step) step 1116 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (level[i]->os_index == step) step 1121 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c if (level[i*j]->os_index != step*j) step 1129 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c loops[nr_loops-1].step = i; step 1131 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c step *= j; step 1139 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c ind += (i / loops[j].step) % loops[j].nb * mul; step 1148 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-synthetic.c res = hwloc_snprintf(tmp, tmplen, "%u*%u%s", loops[j].step, loops[j].nb, step 310 opal/mca/pmix/pmix4x/pmix/test/test_common.c static int parse_token(char *str, int step, int store) step 319 opal/mca/pmix/pmix4x/pmix/test/test_common.c switch (step) { step 149 orte/util/comm/comm.c static bool step=false; step 218 orte/util/comm/comm.c if (step) {