segindex 47 ompi/mca/coll/base/coll_base_bcast.c int err = 0, line, i, rank, segindex, req_index; segindex 84 ompi/mca/coll/base/coll_base_bcast.c for( segindex = 0; segindex < num_segments; segindex++ ) { segindex 85 ompi/mca/coll/base/coll_base_bcast.c if( segindex == (num_segments - 1) ) { segindex 86 ompi/mca/coll/base/coll_base_bcast.c sendcount = original_count - segindex * count_by_segment; segindex 127 ompi/mca/coll/base/coll_base_bcast.c for( segindex = 1; segindex < num_segments; segindex++ ) { segindex 196 ompi/mca/coll/base/coll_base_bcast.c for( segindex = 1; segindex < num_segments; segindex++ ) { segindex 365 ompi/mca/coll/base/coll_base_bcast.c int err=0, line, rank, size, segindex, i, lr, pair; segindex 448 ompi/mca/coll/base/coll_base_bcast.c for (segindex = 0; segindex < num_segments[0]; segindex++) { segindex 451 ompi/mca/coll/base/coll_base_bcast.c if (segindex >= num_segments[i]) { /* no more segments */ segindex 455 ompi/mca/coll/base/coll_base_bcast.c if(segindex == (num_segments[i] - 1)) segindex 456 ompi/mca/coll/base/coll_base_bcast.c sendcount[i] = counts[i] - segindex*segcount[i]; segindex 487 ompi/mca/coll/base/coll_base_bcast.c for( segindex = 1; segindex < num_segments[lr]; segindex++ ) { segindex 489 ompi/mca/coll/base/coll_base_bcast.c if( segindex == (num_segments[lr] - 1)) segindex 490 ompi/mca/coll/base/coll_base_bcast.c sendcount[lr] = counts[lr] - (ptrdiff_t)segindex * (ptrdiff_t)segcount[lr]; segindex 526 ompi/mca/coll/base/coll_base_bcast.c for (segindex = 0; segindex < num_segments[lr]; segindex++) { segindex 528 ompi/mca/coll/base/coll_base_bcast.c if (segindex == (num_segments[lr] - 1)) segindex 529 ompi/mca/coll/base/coll_base_bcast.c sendcount[lr] = counts[lr] - (ptrdiff_t)segindex * (ptrdiff_t)segcount[lr]; segindex 74 ompi/mca/coll/base/coll_base_reduce.c int num_segments, line, ret, segindex, i, rank; segindex 143 ompi/mca/coll/base/coll_base_reduce.c for( segindex = 0; segindex <= num_segments; segindex++ ) { segindex 147 ompi/mca/coll/base/coll_base_reduce.c if( segindex == (num_segments-1) ) segindex 148 ompi/mca/coll/base/coll_base_reduce.c recvcount = original_count - (ptrdiff_t)count_by_segment * (ptrdiff_t)segindex; segindex 157 ompi/mca/coll/base/coll_base_reduce.c if( segindex < num_segments ) { segindex 172 ompi/mca/coll/base/coll_base_reduce.c local_recvbuf = accumbuf + (ptrdiff_t)segindex * (ptrdiff_t)segment_increment; segindex 199 ompi/mca/coll/base/coll_base_reduce.c local_op_buffer = sendtmpbuf + (ptrdiff_t)segindex * (ptrdiff_t)segment_increment; segindex 204 ompi/mca/coll/base/coll_base_reduce.c accumbuf + (ptrdiff_t)segindex * (ptrdiff_t)segment_increment, segindex 206 ompi/mca/coll/base/coll_base_reduce.c } else if ( segindex > 0 ) { segindex 207 ompi/mca/coll/base/coll_base_reduce.c void* accumulator = accumbuf + (ptrdiff_t)(segindex-1) * (ptrdiff_t)segment_increment; segindex 211 ompi/mca/coll/base/coll_base_reduce.c local_op_buffer = sendtmpbuf + (ptrdiff_t)(segindex-1) * (ptrdiff_t)segment_increment; segindex 234 ompi/mca/coll/base/coll_base_reduce.c if (segindex == num_segments) break; segindex 266 ompi/mca/coll/base/coll_base_reduce.c segindex = 0; segindex 272 ompi/mca/coll/base/coll_base_reduce.c (ptrdiff_t)segindex * (ptrdiff_t)segment_increment, segindex 279 ompi/mca/coll/base/coll_base_reduce.c segindex++; segindex 298 ompi/mca/coll/base/coll_base_reduce.c for (segindex = 0; segindex < max_outstanding_reqs; segindex++) { segindex 300 ompi/mca/coll/base/coll_base_reduce.c (ptrdiff_t)segindex * (ptrdiff_t)segment_increment, segindex 305 ompi/mca/coll/base/coll_base_reduce.c &sreq[segindex]) ); segindex 320 ompi/mca/coll/base/coll_base_reduce.c (ptrdiff_t)segindex * (ptrdiff_t)segment_increment, segindex 328 ompi/mca/coll/base/coll_base_reduce.c segindex++;