id1               218 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, i1, id1;
id1               229 ompi/mca/topo/treematch/treematch/tm_tree.c       id1 = new_tab_node[i].child[i1]->id;
id1               230 ompi/mca/topo/treematch/treematch/tm_tree.c       res[i] += tab[id1];
id1               248 ompi/mca/topo/treematch/treematch/tm_tree.c   int id1, id2;
id1               264 ompi/mca/topo/treematch/treematch/tm_tree.c 	  id1 = tab_node[i].child[i1]->id;
id1               267 ompi/mca/topo/treematch/treematch/tm_tree.c 	    mat[i][j] += old_mat[id1][id2];
id1               282 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, i1, j1, id1, id2;
id1               346 ompi/mca/topo/treematch/treematch/tm_tree.c 	  id1 = tab_node[i].child[i1]->id;
id1               349 ompi/mca/topo/treematch/treematch/tm_tree.c 	    new_mat[i][j] += old_mat[id1][id2];
id1               409 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, id, id1, id2;
id1               421 ompi/mca/topo/treematch/treematch/tm_tree.c     id1 = cur_group[i]->id;
id1               425 ompi/mca/topo/treematch/treematch/tm_tree.c       res -= mat[id1][id2];
id1               941 ompi/mca/topo/treematch/treematch/tm_tree.c   int id=-1, id1, id2;
id1               983 ompi/mca/topo/treematch/treematch/tm_tree.c 	id1 = work->tab_group[i];
id1               986 ompi/mca/topo/treematch/treematch/tm_tree.c 	  if(!indep_mat[id2][id1]){