j1                 58 ompi/mca/topo/treematch/treematch/tm_bucket.c   int *e1 = NULL,*e2 = NULL,i1,i2,j1,j2;
j1                 70 ompi/mca/topo/treematch/treematch/tm_bucket.c   j1 = e1[1];
j1                 74 ompi/mca/topo/treematch/treematch/tm_bucket.c   if(tab[i1][j1]==tab[i2][j2]){
j1                 76 ompi/mca/topo/treematch/treematch/tm_bucket.c       return (j1 > j2) ? -1 : 1;
j1                 81 ompi/mca/topo/treematch/treematch/tm_bucket.c   return (tab[i1][j1] > tab[i2][j2]) ? -1 : 1;
j1                247 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, i1, j1;
j1                265 ompi/mca/topo/treematch/treematch/tm_tree.c 	  for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){
j1                266 ompi/mca/topo/treematch/treematch/tm_tree.c 	    id2 = tab_node[j].child[j1]->id;
j1                282 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, i1, j1, id1, id2;
j1                347 ompi/mca/topo/treematch/treematch/tm_tree.c 	  for( j1 = 0 ; j1 < tab_node[j].arity ; j1++ ){
j1                348 ompi/mca/topo/treematch/treematch/tm_tree.c 	    id2 = tab_node[j].child[j1]->id;