nb_leaves         499 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int nb_leaves, start, end;
nb_leaves         508 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   nb_leaves = compute_nb_leaves_from_level( depth + 1, topology );
nb_leaves         518 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c     end = fill_tab(&(const_tab[i].constraints), constraints, nb_constraints,start, (i+1) * nb_leaves, i * nb_leaves);
nb_leaves          57 ompi/mca/topo/treematch/treematch/tm_mapping.c int nb_leaves(tm_tree_t *comm_tree);
nb_leaves         421 ompi/mca/topo/treematch/treematch/tm_mapping.c     n += nb_leaves(comm_tree->child[j]);
nb_leaves         465 ompi/mca/topo/treematch/treematch/tm_mapping.c   M = nb_leaves(comm_tree);
nb_leaves          17 ompi/mca/topo/treematch/treematch/tm_mapping.h int nb_leaves(tm_tree_t *comm_tree);