new_cost          619 ompi/mca/topo/treematch/treematch/tm_topology.c   double *new_cost = NULL;
new_cost          639 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost  = (double*)MALLOC(sizeof(double)*(*nb_levels));
new_cost          643 ompi/mca/topo/treematch/treematch/tm_topology.c       new_cost[i] = (*cost)[i];
new_cost          648 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost[n] = (*cost)[n];;
new_cost          653 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost[n+1] = (*cost)[n];
new_cost          657 ompi/mca/topo/treematch/treematch/tm_topology.c       new_cost[i] = (*cost)[i-1];
new_cost          663 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity,&new_cost,nb_levels,n);
new_cost          665 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity,&new_cost,nb_levels,n+1);
new_cost          667 ompi/mca/topo/treematch/treematch/tm_topology.c     *cost=new_cost;
new_cost          671 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost  = (double*)MALLOC(sizeof(double)*(*nb_levels));
new_cost          674 ompi/mca/topo/treematch/treematch/tm_topology.c       new_cost[i] = (*cost)[i];
new_cost          677 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost[n] = (*cost)[n];;
new_cost          680 ompi/mca/topo/treematch/treematch/tm_topology.c     new_cost[n+1] = (*cost)[n];
new_cost          683 ompi/mca/topo/treematch/treematch/tm_topology.c       new_cost[i] = (*cost)[i-1];
new_cost          688 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity, &new_cost, nb_levels, n);
new_cost          690 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity, &new_cost, nb_levels, n+1);
new_cost          692 ompi/mca/topo/treematch/treematch/tm_topology.c     *cost= new_cost;