bmtree             51 ompi/mca/coll/base/coll_base_gather.c     ompi_coll_tree_t* bmtree;
bmtree             66 ompi/mca/coll/base/coll_base_gather.c     bmtree = data->cached_in_order_bmtree;
bmtree            135 ompi/mca/coll/base/coll_base_gather.c         for (i = 0; i < bmtree->tree_nextsize; i++) {
bmtree            138 ompi/mca/coll/base/coll_base_gather.c             vkid = (bmtree->tree_next[i] - root + size) % size;
bmtree            146 ompi/mca/coll/base/coll_base_gather.c                          rank, bmtree->tree_next[i], mycount));
bmtree            149 ompi/mca/coll/base/coll_base_gather.c                                     bmtree->tree_next[i], MCA_COLL_BASE_TAG_GATHER,
bmtree            161 ompi/mca/coll/base/coll_base_gather.c                      rank, bmtree->tree_prev, total_recv));
bmtree            164 ompi/mca/coll/base/coll_base_gather.c                                 bmtree->tree_prev,
bmtree             86 ompi/mca/coll/base/coll_base_scatter.c     ompi_coll_tree_t *bmtree = data->cached_in_order_bmtree;
bmtree            146 ompi/mca/coll/base/coll_base_scatter.c             err = MCA_PML_CALL(recv(ptmp, (ptrdiff_t)rcount * (ptrdiff_t)size, rdtype, bmtree->tree_prev,
bmtree            161 ompi/mca/coll/base/coll_base_scatter.c         for (int i = bmtree->tree_nextsize - 1; i >= 0; i--) {
bmtree            163 ompi/mca/coll/base/coll_base_scatter.c             int vchild = (bmtree->tree_next[i] - root + size) % size;
bmtree            169 ompi/mca/coll/base/coll_base_scatter.c                                     send_count, sdtype, bmtree->tree_next[i],
bmtree            179 ompi/mca/coll/base/coll_base_scatter.c         err = MCA_PML_CALL(recv(ptmp, rcount, rdtype, bmtree->tree_prev,
bmtree            330 ompi/mca/coll/base/coll_base_topo.c     ompi_coll_tree_t *bmtree;
bmtree            342 ompi/mca/coll/base/coll_base_topo.c     bmtree = (ompi_coll_tree_t*)malloc(COLL_TREE_SIZE(MAXTREEFANOUT));
bmtree            343 ompi/mca/coll/base/coll_base_topo.c     if (!bmtree) {
bmtree            348 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_bmtree   = 1;
bmtree            350 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_root     = MPI_UNDEFINED;
bmtree            351 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_nextsize = MPI_UNDEFINED;
bmtree            353 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[i] = -1;
bmtree            362 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_prev = root;
bmtree            366 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_prev = remote;
bmtree            376 ompi/mca/coll/base/coll_base_topo.c             free(bmtree);
bmtree            379 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[childs] = remote;
bmtree            383 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_nextsize = childs;
bmtree            384 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_root     = root;
bmtree            385 ompi/mca/coll/base/coll_base_topo.c     return bmtree;
bmtree            407 ompi/mca/coll/base/coll_base_topo.c     ompi_coll_tree_t *bmtree;
bmtree            419 ompi/mca/coll/base/coll_base_topo.c     bmtree = (ompi_coll_tree_t*)malloc(COLL_TREE_SIZE(MAXTREEFANOUT));
bmtree            420 ompi/mca/coll/base/coll_base_topo.c     if (!bmtree) {
bmtree            425 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_bmtree   = 1;
bmtree            426 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_root     = MPI_UNDEFINED;
bmtree            427 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_nextsize = MPI_UNDEFINED;
bmtree            429 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_next[i] = -1;
bmtree            433 ompi/mca/coll/base/coll_base_topo.c         bmtree->tree_prev = root;
bmtree            439 ompi/mca/coll/base/coll_base_topo.c             bmtree->tree_prev = (remote + root) % size;
bmtree            442 ompi/mca/coll/base/coll_base_topo.c             bmtree->tree_next[childs] = (remote + root) % size;
bmtree            448 ompi/mca/coll/base/coll_base_topo.c                 free(bmtree);
bmtree            454 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_nextsize = childs;
bmtree            455 ompi/mca/coll/base/coll_base_topo.c     bmtree->tree_root     = root;
bmtree            457 ompi/mca/coll/base/coll_base_topo.c     return bmtree;
bmtree             80 ompi/mca/coll/portals4/coll_portals4_gather.c     ompi_coll_portals4_tree_t *bmtree;
bmtree             90 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree = (ompi_coll_portals4_tree_t*)malloc(sizeof(ompi_coll_portals4_tree_t));
bmtree             91 ompi/mca/coll/portals4/coll_portals4_gather.c     if (!bmtree) {
bmtree             97 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree->tree_bmtree   = 1;
bmtree             98 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree->tree_root     = MPI_UNDEFINED;
bmtree             99 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree->tree_nextsize = MPI_UNDEFINED;
bmtree            101 ompi/mca/coll/portals4/coll_portals4_gather.c         bmtree->tree_next[i] = -1;
bmtree            105 ompi/mca/coll/portals4/coll_portals4_gather.c         bmtree->tree_prev = root;
bmtree            111 ompi/mca/coll/portals4/coll_portals4_gather.c             bmtree->tree_prev = (remote + root) % size;
bmtree            114 ompi/mca/coll/portals4/coll_portals4_gather.c             bmtree->tree_next[childs] = (remote + root) % size;
bmtree            125 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree->tree_nextsize = childs;
bmtree            126 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree->tree_root     = root;
bmtree            128 ompi/mca/coll/portals4/coll_portals4_gather.c     vparent = VRANK(bmtree->tree_prev, root, size);
bmtree            130 ompi/mca/coll/portals4/coll_portals4_gather.c         bmtree->tree_numdescendants = size - 1;
bmtree            131 ompi/mca/coll/portals4/coll_portals4_gather.c     } else if (bmtree->tree_nextsize > 0) {
bmtree            134 ompi/mca/coll/portals4/coll_portals4_gather.c             bmtree->tree_numdescendants = size - vrank - 1;
bmtree            136 ompi/mca/coll/portals4/coll_portals4_gather.c             bmtree->tree_numdescendants = possible_descendants;
bmtree            139 ompi/mca/coll/portals4/coll_portals4_gather.c         bmtree->tree_numdescendants = 0;
bmtree            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);
bmtree            147 ompi/mca/coll/portals4/coll_portals4_gather.c     return bmtree;
bmtree            182 ompi/mca/coll/portals4/coll_portals4_gather.c     ompi_coll_portals4_tree_t* bmtree = portals4_module->cached_in_order_bmtree;
bmtree            220 ompi/mca/coll/portals4/coll_portals4_gather.c     } else if (bmtree->tree_nextsize) {
bmtree            226 ompi/mca/coll/portals4/coll_portals4_gather.c         request->u.gather.gather_bytes=request->u.gather.packed_size * ((ptrdiff_t)bmtree->tree_numdescendants + 1);
bmtree            242 ompi/mca/coll/portals4/coll_portals4_gather.c                             request->u.gather.packed_size, bmtree->tree_numdescendants);
bmtree            525 ompi/mca/coll/portals4/coll_portals4_gather.c     ompi_coll_portals4_tree_t* bmtree;
bmtree            592 ompi/mca/coll/portals4/coll_portals4_gather.c     bmtree = portals4_module->cached_in_order_bmtree;
bmtree            609 ompi/mca/coll/portals4/coll_portals4_gather.c     for (int i =0; i < bmtree->tree_nextsize; i++) {
bmtree            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);
bmtree            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));
bmtree            650 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t parent = bmtree->tree_prev;
bmtree            691 ompi/mca/coll/portals4/coll_portals4_gather.c     for (i=0;i<bmtree->tree_nextsize;i++) {
bmtree            692 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];
bmtree            733 ompi/mca/coll/portals4/coll_portals4_gather.c     for (i=0;i<bmtree->tree_nextsize;i++) {
bmtree            734 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];
bmtree            753 ompi/mca/coll/portals4/coll_portals4_gather.c     for (i=0;i<bmtree->tree_nextsize;i++) {
bmtree            754 ompi/mca/coll/portals4/coll_portals4_gather.c         int32_t child=bmtree->tree_next[i];