cached_bmtree     353 ompi/mca/coll/base/coll_base_bcast.c                                                 segcount, data->cached_bmtree );
cached_bmtree      93 ompi/mca/coll/base/coll_base_frame.c     if (data->cached_bmtree) { /* destroy bmtree if defined */
cached_bmtree      94 ompi/mca/coll/base/coll_base_frame.c         ompi_coll_base_topo_destroy_tree (&data->cached_bmtree);
cached_bmtree     320 ompi/mca/coll/base/coll_base_functions.h     if( !( (coll_comm->cached_bmtree)                                                        \
cached_bmtree     322 ompi/mca/coll/base/coll_base_functions.h         if( coll_comm->cached_bmtree ) { /* destroy previous binomial if defined */          \
cached_bmtree     323 ompi/mca/coll/base/coll_base_functions.h             ompi_coll_base_topo_destroy_tree( &(coll_comm->cached_bmtree) );                \
cached_bmtree     325 ompi/mca/coll/base/coll_base_functions.h         coll_comm->cached_bmtree = ompi_coll_base_topo_build_bmtree( (OMPI_COMM), (ROOT) ); \
cached_bmtree     470 ompi/mca/coll/base/coll_base_functions.h     ompi_coll_tree_t *cached_bmtree;
cached_bmtree     259 ompi/mca/coll/tuned/coll_tuned_module.c     data->cached_bmtree = NULL;