pivot              87 ompi/mca/topo/treematch/treematch/tm_bucket.c   double *pivot = NULL,val;
pivot              90 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot = bucket_list->pivot;
pivot             100 ompi/mca/topo/treematch/treematch/tm_bucket.c     if( val < pivot[p] ){
pivot             159 ompi/mca/topo/treematch/treematch/tm_bucket.c     printf("pivot[%d]=%f\n",i,bucket_list->pivot[i]);
pivot             171 ompi/mca/topo/treematch/treematch/tm_bucket.c     inf = bucket_list->pivot[i];
pivot             172 ompi/mca/topo/treematch/treematch/tm_bucket.c     sup = bucket_list->pivot[i-1];
pivot             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             232 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot_tree[i] = pivot[p-1];
pivot             234 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i,inf,p-1,pivot,pivot_tree,depth+1,max_depth);
pivot             235 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i+1,p+1,sup,pivot,pivot_tree,depth+1,max_depth);
pivot             240 ompi/mca/topo/treematch/treematch/tm_bucket.c   double *pivot_tree = NULL,*pivot = NULL;
pivot             243 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot = bucket_list->pivot;
pivot             248 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(1,1,n-1,pivot,pivot_tree,0,bucket_list->max_depth);
pivot             291 ompi/mca/topo/treematch/treematch/tm_bucket.c   double *pivot = NULL;
pivot             355 ompi/mca/topo/treematch/treematch/tm_bucket.c   pivot = (double*)MALLOC(sizeof(double)*nb_buckets-1);
pivot             365 ompi/mca/topo/treematch/treematch/tm_bucket.c     pivot[k-1] = tab[i][j];
pivot             369 ompi/mca/topo/treematch/treematch/tm_bucket.c   bucket_list->pivot = pivot;
pivot             513 ompi/mca/topo/treematch/treematch/tm_bucket.c   FREE(bucket_list->pivot);
pivot              24 ompi/mca/topo/treematch/treematch/tm_bucket.h   double *pivot;