nb_elem           138 ompi/mca/topo/treematch/treematch/tm_bucket.c   printf("\tb.nb_elem=%d\n",(int)b->nb_elem);
nb_elem           144 ompi/mca/topo/treematch/treematch/tm_bucket.c   for( k = 0 ; k < b->nb_elem ; k++ ){
nb_elem           195 ompi/mca/topo/treematch/treematch/tm_bucket.c   if( bucket->bucket_len == bucket->nb_elem ){
nb_elem           202 ompi/mca/topo/treematch/treematch/tm_bucket.c 	     id,(void*)bucket->bucket, bucket->nb_elem, bucket->nb_elem+size);
nb_elem           217 ompi/mca/topo/treematch/treematch/tm_bucket.c  bucket->bucket[bucket->nb_elem].i=i;
nb_elem           218 ompi/mca/topo/treematch/treematch/tm_bucket.c  bucket->bucket[bucket->nb_elem].j=j;
nb_elem           219 ompi/mca/topo/treematch/treematch/tm_bucket.c  bucket->nb_elem++;
nb_elem           396 ompi/mca/topo/treematch/treematch/tm_bucket.c   while( bucket->nb_elem <= bucket_list->bucket_indice ){
nb_elem           402 ompi/mca/topo/treematch/treematch/tm_bucket.c       printf("nb_elem: %d, indice: %d, bucket_id: %d\n",(int)bucket->nb_elem,bucket_list->bucket_indice,bucket_list->cur_bucket);
nb_elem           408 ompi/mca/topo/treematch/treematch/tm_bucket.c     qsort(bucket->bucket,bucket->nb_elem,2*sizeof(int),tab_cmp);
nb_elem            12 ompi/mca/topo/treematch/treematch/tm_bucket.h   int nb_elem;    /* number of usefull elements (nb_elem should be lower than bucket_len) */