new_arity         618 ompi/mca/topo/treematch/treematch/tm_topology.c   int *new_arity = NULL;
new_arity         638 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity = (int*)MALLOC(sizeof(int)*(*nb_levels));
new_arity         642 ompi/mca/topo/treematch/treematch/tm_topology.c       new_arity[i] = (*arity)[i];
new_arity         646 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity[n] = 3;
new_arity         651 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity[n+1] = a/3;
new_arity         656 ompi/mca/topo/treematch/treematch/tm_topology.c       new_arity[i] = (*arity)[i-1];
new_arity         662 ompi/mca/topo/treematch/treematch/tm_topology.c     if(new_arity[n+1] == 3)
new_arity         663 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity,&new_cost,nb_levels,n);
new_arity         665 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity,&new_cost,nb_levels,n+1);
new_arity         666 ompi/mca/topo/treematch/treematch/tm_topology.c     *arity=new_arity;
new_arity         670 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity = (int*)MALLOC(sizeof(int)*(*nb_levels));
new_arity         673 ompi/mca/topo/treematch/treematch/tm_topology.c       new_arity[i] = (*arity)[i];
new_arity         676 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity[n] = 2;
new_arity         679 ompi/mca/topo/treematch/treematch/tm_topology.c     new_arity[n+1] = a/2;
new_arity         682 ompi/mca/topo/treematch/treematch/tm_topology.c       new_arity[i] = (*arity)[i-1];
new_arity         687 ompi/mca/topo/treematch/treematch/tm_topology.c     if(new_arity[n+1] == 2)
new_arity         688 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity, &new_cost, nb_levels, n);
new_arity         690 ompi/mca/topo/treematch/treematch/tm_topology.c       optimize_arity(&new_arity, &new_cost, nb_levels, n+1);
new_arity         691 ompi/mca/topo/treematch/treematch/tm_topology.c     *arity = new_arity;