cached_bintree    269 ompi/mca/coll/base/coll_base_bcast.c                                                 segcount, data->cached_bintree );
cached_bintree    387 ompi/mca/coll/base/coll_base_bcast.c     tree = module->base_data->cached_bintree;
cached_bintree     90 ompi/mca/coll/base/coll_base_frame.c     if (data->cached_bintree) { /* destroy bintree if defined */
cached_bintree     91 ompi/mca/coll/base/coll_base_frame.c         ompi_coll_base_topo_destroy_tree (&data->cached_bintree);
cached_bintree    307 ompi/mca/coll/base/coll_base_functions.h     if( !( (coll_comm->cached_bintree)                                                     \
cached_bintree    309 ompi/mca/coll/base/coll_base_functions.h         if( coll_comm->cached_bintree ) { /* destroy previous binomial if defined */       \
cached_bintree    310 ompi/mca/coll/base/coll_base_functions.h             ompi_coll_base_topo_destroy_tree( &(coll_comm->cached_bintree) );             \
cached_bintree    312 ompi/mca/coll/base/coll_base_functions.h         coll_comm->cached_bintree = ompi_coll_base_topo_build_tree(2,(OMPI_COMM),(ROOT)); \
cached_bintree    466 ompi/mca/coll/base/coll_base_functions.h     ompi_coll_tree_t *cached_bintree;
cached_bintree    467 ompi/mca/coll/base/coll_base_reduce.c                                            data->cached_bintree,
cached_bintree    257 ompi/mca/coll/tuned/coll_tuned_module.c     data->cached_bintree = NULL;