tree_next          90 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i],
tree_next         145 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i],
tree_next         168 ompi/mca/coll/base/coll_base_bcast.c                                      tree->tree_next[i],
tree_next         459 ompi/mca/coll/base/coll_base_bcast.c                                   tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree_next         501 ompi/mca/coll/base/coll_base_bcast.c                                          tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree_next         516 ompi/mca/coll/base/coll_base_bcast.c                                     tree->tree_next[i], MCA_COLL_BASE_TAG_BCAST,
tree_next         138 ompi/mca/coll/base/coll_base_gather.c             vkid = (bmtree->tree_next[i] - root + size) % size;
tree_next         146 ompi/mca/coll/base/coll_base_gather.c                          rank, bmtree->tree_next[i], mycount));
tree_next         149 ompi/mca/coll/base/coll_base_gather.c                                     bmtree->tree_next[i], MCA_COLL_BASE_TAG_GATHER,
tree_next         177 ompi/mca/coll/base/coll_base_reduce.c                                              tree->tree_next[i],
tree_next         163 ompi/mca/coll/base/coll_base_scatter.c             int vchild = (bmtree->tree_next[i] - root + size) % size;
tree_next         169 ompi/mca/coll/base/coll_base_scatter.c                                     send_count, sdtype, bmtree->tree_next[i],
tree_next         128 ompi/mca/coll/base/coll_base_topo.c         tree->tree_next[i] = -1;
tree_next         155 ompi/mca/coll/base/coll_base_topo.c             tree->tree_next[i] = (schild+root)%size;
tree_next         221 ompi/mca/coll/base/coll_base_topo.c     tree->tree_next[0]  = -1;
tree_next         222 ompi/mca/coll/base/coll_base_topo.c     tree->tree_next[1]  = -1;
tree_next         258 ompi/mca/coll/base/coll_base_topo.c             if (lchild >= 0) tree->tree_next[0] = lchild + delta;
tree_next         259 ompi/mca/coll/base/coll_base_topo.c             if (rchild >= 0) tree->tree_next[1] = rchild + delta;
tree_next         291 ompi/mca/coll/base/coll_base_topo.c     if (tree->tree_next[0] >= 0) { tree->tree_nextsize = 1; }
tree_next         292 ompi/mca/coll/base/coll_base_topo.c     if (tree->tree_next[1] >= 0) { tree->tree_nextsize += 1; }
tree_next         353 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[i] = -1;
tree_next         379 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[childs] = remote;
tree_next         429 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[i] = -1;
tree_next         442 ompi/mca/coll/base/coll_base_topo.c             bmtree->tree_next[childs] = (remote + root) % size;
tree_next         520 ompi/mca/coll/base/coll_base_topo.c                 kmtree->tree_next[nchilds] = child;
tree_next         566 ompi/mca/coll/base/coll_base_topo.c     for(i=0;i<fanout;i++) chain->tree_next[i] = -1;
tree_next         593 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[0] = -1;
tree_next         596 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[0] = (srank+1+root)%size;
tree_next         604 ompi/mca/coll/base/coll_base_topo.c         chain->tree_next[0] = -1;
tree_next         641 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[0] = -1;
tree_next         645 ompi/mca/coll/base/coll_base_topo.c                 chain->tree_next[0] = srank+1;
tree_next         648 ompi/mca/coll/base/coll_base_topo.c                 chain->tree_next[0] = -1;
tree_next         653 ompi/mca/coll/base/coll_base_topo.c         if( chain->tree_next[0] != -1 ) {
tree_next         654 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[0] = (chain->tree_next[0]+root)%size;
tree_next         661 ompi/mca/coll/base/coll_base_topo.c         chain->tree_next[0] = (root+1)%size;
tree_next         663 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[i] = chain->tree_next[i-1] + maxchainlen;
tree_next         665 ompi/mca/coll/base/coll_base_topo.c                 chain->tree_next[i]--;
tree_next         667 ompi/mca/coll/base/coll_base_topo.c             chain->tree_next[i] %= size;
tree_next         685 ompi/mca/coll/base/coll_base_topo.c             OPAL_OUTPUT((ompi_coll_base_framework.framework_output,"[%1d] %d", i, tree->tree_next[i]));
tree_next          29 ompi/mca/coll/base/coll_base_topo.h         (offsetof(ompi_coll_tree_t, tree_next) + (fanout) * MEMBSIZE(ompi_coll_tree_t, tree_next))
tree_next          39 ompi/mca/coll/base/coll_base_topo.h     int32_t tree_next[];
tree_next          87 ompi/mca/coll/portals4/coll_portals4.h     int32_t tree_next[MAXTREEFANOUT];
tree_next         101 ompi/mca/coll/portals4/coll_portals4_gather.c         bmtree->tree_next[i] = -1;
tree_next         114 ompi/mca/coll/portals4/coll_portals4_gather.c             bmtree->tree_next[childs] = (remote + root) % size;
tree_next         610 ompi/mca/coll/portals4/coll_portals4_gather.c         int child_vrank = VRANK(bmtree->tree_next[i], request->u.gather.root_rank, request->u.gather.size);
tree_next         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));
tree_next         692 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];
tree_next         734 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];
tree_next         754 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];