diff --git a/ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c b/ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c index 6c31d1fa980..edd2fd8badd 100644 --- a/ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c +++ b/ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c @@ -386,7 +386,9 @@ int mca_topo_treematch_dist_graph_create(mca_topo_base_module_t* topo_module, */ if(0 == rank) { +#ifdef __DEBUG__ fprintf(stderr,"========== Centralized Reordering ========= \n"); +#endif local_pattern = (double *)calloc(size*size,sizeof(double)); if( true == topo->weighted ) { diff --git a/ompi/mca/topo/treematch/treematch/tm_kpartitioning.c b/ompi/mca/topo/treematch/treematch/tm_kpartitioning.c index 3aaed6a9fcc..017f3edcf0a 100644 --- a/ompi/mca/topo/treematch/treematch/tm_kpartitioning.c +++ b/ompi/mca/topo/treematch/treematch/tm_kpartitioning.c @@ -426,8 +426,7 @@ tree_t *kpartition_build_tree_from_topology(tm_topology_t *topology,double **com verbose_level = get_verbose_level(); if(verbose_level>=INFO) - printf("Number of constraints: %d\n", nb_constraints); - printf("Number of constraints: %d, N=%d\n", nb_constraints, N); + printf("Number of constraints: %d, N=%d\n", nb_constraints, N); nb_cores=nb_processing_units(topology); diff --git a/ompi/mca/topo/treematch/treematch/tm_tree.c b/ompi/mca/topo/treematch/treematch/tm_tree.c index 0f41958664f..54d32c7740e 100644 --- a/ompi/mca/topo/treematch/treematch/tm_tree.c +++ b/ompi/mca/topo/treematch/treematch/tm_tree.c @@ -1611,7 +1611,8 @@ tree_t * build_tree_from_topology(tm_topology_t *topology, double **com_mat, int nb_constraints = check_constraints (topology, &constraints); - printf("nb_constraints = %d, N= %d; nb_processing units = %d\n",nb_constraints, N, nb_processing_units(topology)); + if(verbose_level>=INFO) + printf("nb_constraints = %d, N= %d; nb_processing units = %d\n",nb_constraints, N, nb_processing_units(topology)); if(N>nb_constraints){ if(verbose_level >= CRITICAL){