pivot_tree        116 ompi/mca/topo/treematch/treematch/tm_bucket.c   double *pivot_tree = NULL,val;
pivot_tree        119 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot_tree = bucket_list->pivot_tree;
pivot_tree        125 ompi/mca/topo/treematch/treematch/tm_bucket.c     if( val > pivot_tree[p] )
pivot_tree        131 ompi/mca/topo/treematch/treematch/tm_bucket.c   return (int)pivot_tree[p];
pivot_tree        225 ompi/mca/topo/treematch/treematch/tm_bucket.c void dfs(int i,int inf,int sup,double *pivot,double *pivot_tree,int depth,int max_depth)
pivot_tree        232 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot_tree[i] = pivot[p-1];
pivot_tree        234 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i,inf,p-1,pivot,pivot_tree,depth+1,max_depth);
pivot_tree        235 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i+1,p+1,sup,pivot,pivot_tree,depth+1,max_depth);
pivot_tree        240 ompi/mca/topo/treematch/treematch/tm_bucket.c   double *pivot_tree = NULL,*pivot = NULL;
pivot_tree        245 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot_tree = (double*)MALLOC(sizeof(double)*2*n);
pivot_tree        248 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(1,1,n-1,pivot,pivot_tree,0,bucket_list->max_depth);
pivot_tree        251 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot_tree[0] = -1;
pivot_tree        253 ompi/mca/topo/treematch/treematch/tm_bucket.c     pivot_tree[i] = k++;
pivot_tree        255 ompi/mca/topo/treematch/treematch/tm_bucket.c   bucket_list->pivot_tree = pivot_tree;
pivot_tree        259 ompi/mca/topo/treematch/treematch/tm_bucket.c       printf("%d:%f\t",i,pivot_tree[i]);
pivot_tree        514 ompi/mca/topo/treematch/treematch/tm_bucket.c   FREE(bucket_list->pivot_tree);
pivot_tree         25 ompi/mca/topo/treematch/treematch/tm_bucket.h   double *pivot_tree;