inf                88 ompi/mca/topo/treematch/treematch/tm_bucket.c   int n,sup,inf,p;
inf                94 ompi/mca/topo/treematch/treematch/tm_bucket.c   inf = -1;
inf                97 ompi/mca/topo/treematch/treematch/tm_bucket.c   while( (sup - inf) > 1){
inf                98 ompi/mca/topo/treematch/treematch/tm_bucket.c     p = (sup + inf)/2;
inf               101 ompi/mca/topo/treematch/treematch/tm_bucket.c       inf = p;
inf               102 ompi/mca/topo/treematch/treematch/tm_bucket.c       if( inf == sup )
inf               103 ompi/mca/topo/treematch/treematch/tm_bucket.c 	inf--;
inf               106 ompi/mca/topo/treematch/treematch/tm_bucket.c       if( sup == inf )
inf               141 ompi/mca/topo/treematch/treematch/tm_bucket.c void check_bucket(bucket_t *b,double **tab,double inf, double sup)
inf               147 ompi/mca/topo/treematch/treematch/tm_bucket.c     if((tab[i][j] < inf) || (tab[i][j] > sup)){
inf               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);
inf               166 ompi/mca/topo/treematch/treematch/tm_bucket.c   double inf,sup;
inf               171 ompi/mca/topo/treematch/treematch/tm_bucket.c     inf = bucket_list->pivot[i];
inf               176 ompi/mca/topo/treematch/treematch/tm_bucket.c       inf = 0;
inf               182 ompi/mca/topo/treematch/treematch/tm_bucket.c     check_bucket(bucket_list->bucket_tab[i],bucket_list->tab,inf,sup);
inf               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)
inf               231 ompi/mca/topo/treematch/treematch/tm_bucket.c   p = (inf + sup)/2;
inf               234 ompi/mca/topo/treematch/treematch/tm_bucket.c   dfs(2*i,inf,p-1,pivot,pivot_tree,depth+1,max_depth);
inf               519 ompi/mca/topo/treematch/treematch/tm_bucket.c   int inf = *(int*)args[0];
inf               532 ompi/mca/topo/treematch/treematch/tm_bucket.c   for( l = inf ; l < sup ; l++ ){
inf               620 ompi/mca/topo/treematch/treematch/tm_bucket.c     int *inf;
inf               626 ompi/mca/topo/treematch/treematch/tm_bucket.c     inf = (int*)MALLOC(sizeof(int)*nb_threads);
inf               631 ompi/mca/topo/treematch/treematch/tm_bucket.c       inf[id]=id*M/nb_threads;
inf               634 ompi/mca/topo/treematch/treematch/tm_bucket.c       args[0]=(void*)(inf+id);
inf               655 ompi/mca/topo/treematch/treematch/tm_bucket.c     FREE(inf);
inf               239 ompi/mca/topo/treematch/treematch/tm_tree.c   int inf = *(int*)args[0];
inf               258 ompi/mca/topo/treematch/treematch/tm_tree.c     printf("Aggregate in parallel (%d-%d)\n", inf, sup-1);
inf               260 ompi/mca/topo/treematch/treematch/tm_tree.c   for( i = inf ; i < sup ; i++ )
inf               297 ompi/mca/topo/treematch/treematch/tm_tree.c     int *inf;
inf               303 ompi/mca/topo/treematch/treematch/tm_tree.c     inf = (int*)MALLOC(sizeof(int)*nb_threads);
inf               308 ompi/mca/topo/treematch/treematch/tm_tree.c       inf[id]=id*M/nb_threads;
inf               312 ompi/mca/topo/treematch/treematch/tm_tree.c       args[0]=(void*)(inf+id);
inf               335 ompi/mca/topo/treematch/treematch/tm_tree.c     FREE(inf);