sup                88 ompi/mca/topo/treematch/treematch/tm_bucket.c   int n,sup,inf,p;
sup                95 ompi/mca/topo/treematch/treematch/tm_bucket.c   sup = n;
sup                97 ompi/mca/topo/treematch/treematch/tm_bucket.c   while( (sup - inf) > 1){
sup                98 ompi/mca/topo/treematch/treematch/tm_bucket.c     p = (sup + inf)/2;
sup               102 ompi/mca/topo/treematch/treematch/tm_bucket.c       if( inf == sup )
sup               105 ompi/mca/topo/treematch/treematch/tm_bucket.c       sup = p;
sup               106 ompi/mca/topo/treematch/treematch/tm_bucket.c       if( sup == inf )
sup               107 ompi/mca/topo/treematch/treematch/tm_bucket.c 	sup++;
sup               111 ompi/mca/topo/treematch/treematch/tm_bucket.c   return sup;
sup               141 ompi/mca/topo/treematch/treematch/tm_bucket.c void check_bucket(bucket_t *b,double **tab,double inf, double sup)
sup               147 ompi/mca/topo/treematch/treematch/tm_bucket.c     if((tab[i][j] < inf) || (tab[i][j] > sup)){
sup               149 ompi/mca/topo/treematch/treematch/tm_bucket.c 	fprintf(stderr,"[%d] (%d,%d):%f not in [%f,%f]\n",k,i,j,tab[i][j],inf,sup);
sup               166 ompi/mca/topo/treematch/treematch/tm_bucket.c   double inf,sup;
sup               172 ompi/mca/topo/treematch/treematch/tm_bucket.c     sup = bucket_list->pivot[i-1];
sup               174 ompi/mca/topo/treematch/treematch/tm_bucket.c       sup=DBL_MAX;
sup               182 ompi/mca/topo/treematch/treematch/tm_bucket.c     check_bucket(bucket_list->bucket_tab[i],bucket_list->tab,inf,sup);
sup               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)
sup               231 ompi/mca/topo/treematch/treematch/tm_bucket.c   p = (inf + sup)/2;
sup               235 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i+1,p+1,sup,pivot,pivot_tree,depth+1,max_depth);
sup               520 ompi/mca/topo/treematch/treematch/tm_bucket.c   int sup = *(int*)args[1];
sup               532 ompi/mca/topo/treematch/treematch/tm_bucket.c   for( l = inf ; l < sup ; l++ ){
sup               621 ompi/mca/topo/treematch/treematch/tm_bucket.c     int *sup;
sup               627 ompi/mca/topo/treematch/treematch/tm_bucket.c     sup = (int*)MALLOC(sizeof(int)*nb_threads);
sup               632 ompi/mca/topo/treematch/treematch/tm_bucket.c       sup[id]=(id+1)*M/nb_threads;
sup               633 ompi/mca/topo/treematch/treematch/tm_bucket.c       if(id == nb_threads-1) sup[id]=M;
sup               635 ompi/mca/topo/treematch/treematch/tm_bucket.c       args[1]=(void*)(sup+id);
sup               656 ompi/mca/topo/treematch/treematch/tm_bucket.c     FREE(sup);
sup               240 ompi/mca/topo/treematch/treematch/tm_tree.c   int sup = *(int*)args[1];
sup               258 ompi/mca/topo/treematch/treematch/tm_tree.c     printf("Aggregate in parallel (%d-%d)\n", inf, sup-1);
sup               260 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i = inf ; i < sup ; i++ )
sup               298 ompi/mca/topo/treematch/treematch/tm_tree.c     int *sup;
sup               304 ompi/mca/topo/treematch/treematch/tm_tree.c     sup = (int*)MALLOC(sizeof(int)*nb_threads);
sup               309 ompi/mca/topo/treematch/treematch/tm_tree.c       sup[id]=(id+1)*M/nb_threads;
sup               310 ompi/mca/topo/treematch/treematch/tm_tree.c       if(id == nb_threads-1) sup[id]=M;
sup               313 ompi/mca/topo/treematch/treematch/tm_tree.c       args[1]=(void*)(sup+id);
sup               336 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(sup);