block_size        717 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c     size_t dsize, block_size;
block_size        728 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c         block_size = dsize * (ptrdiff_t)rcount;
block_size        731 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c         block_size = dsize * (ptrdiff_t)scount;
block_size        734 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c     if (block_size > large_block_size) {
block_size        740 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c     } else if (block_size > intermediate_block_size) {
block_size        748 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c                 (block_size < small_block_size))) {
block_size        778 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c     size_t dsize, block_size;
block_size        788 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c         block_size = dsize * (ptrdiff_t)scount;
block_size        791 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c         block_size = dsize * (ptrdiff_t)rcount;
block_size        795 ompi/mca/coll/tuned/coll_tuned_decision_fixed.c         (block_size < small_block_size)) {
block_size        190 ompi/mca/io/romio321/romio/adio/ad_gridftp/ad_gridftp_open.c 					    layout.round_robin.block_size = striping_factor;
block_size        462 ompi/mca/topo/treematch/treematch/tm_mapping.c   int i,j,N,M,block_size;
block_size        482 ompi/mca/topo/treematch/treematch/tm_mapping.c   block_size = M/N;
block_size        486 ompi/mca/topo/treematch/treematch/tm_mapping.c       printf("M=%d, N=%d, BS=%d\n",M,N,block_size);
block_size        495 ompi/mca/topo/treematch/treematch/tm_mapping.c 	  printf ("%d->%d\n",proc_list[i],nodes_id[i/block_size]);
block_size        498 ompi/mca/topo/treematch/treematch/tm_mapping.c 	  sigma[proc_list[i]] = nodes_id[i/block_size];
block_size        499 ompi/mca/topo/treematch/treematch/tm_mapping.c 	  set_val(k[nodes_id[i/block_size]], proc_list[i], topology->oversub_fact);
block_size        504 ompi/mca/topo/treematch/treematch/tm_mapping.c       printf("M=%d, N=%d, BS=%d\n",M,N,block_size);
block_size        508 ompi/mca/topo/treematch/treematch/tm_mapping.c 	  printf ("%d->%d\n",proc_list[i],nodes_id[i/block_size]);
block_size        510 ompi/mca/topo/treematch/treematch/tm_mapping.c 	  sigma[proc_list[i]] = nodes_id[i/block_size];
block_size         48 opal/class/opal_pointer_array.c     array->block_size = 8;
block_size        180 opal/class/opal_pointer_array.c                             int max_size, int block_size)
block_size        185 opal/class/opal_pointer_array.c     if (NULL == array || max_size < block_size) {
block_size        190 opal/class/opal_pointer_array.c     array->block_size = (0 == block_size ? 8 : block_size);
block_size        193 opal/class/opal_pointer_array.c     num_bytes = (0 < initial_allocation ? initial_allocation : block_size);
block_size        418 opal/class/opal_pointer_array.c     new_size = table->block_size * ((at_least + 1 + table->block_size - 1) / table->block_size);
block_size        451 opal/class/opal_pointer_array.c                 (void*)table, table->size, table->max_size, table->block_size, table->number_free);
block_size         60 opal/class/opal_pointer_array.h     int block_size;
block_size         91 opal/class/opal_pointer_array.h                                            int max_size, int block_size );
block_size         48 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c     array->block_size = 8;
block_size        179 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c                             int max_size, int block_size)
block_size        184 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c     if (NULL == array || max_size < block_size) {
block_size        189 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c     array->block_size = (0 == block_size ? 8 : block_size);
block_size        192 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c     num_bytes = (0 < initial_allocation ? initial_allocation : block_size);
block_size        403 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c     new_size = table->block_size * ((at_least + 1 + table->block_size - 1) / table->block_size);
block_size        436 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.c                 (void*)table, table->size, table->max_size, table->block_size, table->number_free);
block_size         58 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.h     int block_size;
block_size         89 opal/mca/pmix/pmix4x/pmix/src/class/pmix_pointer_array.h                                         int max_size, int block_size);
block_size        230 orte/runtime/data_type_support/orte_dt_copy_fns.c     (*dest)->nodes->block_size = src->nodes->block_size;
block_size         23 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     unsigned                       block_size;
block_size         37 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c                                        unsigned flags, unsigned block_size)
block_size         40 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     elem->block_size = block_size;
block_size         72 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     for (elem = &allocator->elems[0]; elem < end; elem += elem->block_size) {
block_size         73 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         if (sshmem_ucx_shadow_is_free(elem) && (elem->block_size >= count)) {
block_size         75 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c             if (elem->block_size > count) {
block_size         79 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c                                            elem->block_size - count);
block_size         98 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     while ( (next_elem = (elem + elem->block_size)) < end) {
block_size        101 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c             elem->block_size += next_elem->block_size;
block_size        117 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     unsigned old_count                   = elem->block_size;
block_size        136 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c                                    elem->block_size - count);
block_size        137 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         elem->block_size = count;
block_size        150 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         (old_count + next->block_size >= count))
block_size        155 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         assert(next + next->block_size <= end);
block_size        157 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         if (old_count + next->block_size > count) {
block_size        159 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c                                        old_count + next->block_size - count);
block_size        163 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c         elem->block_size = count;
block_size        188 oshmem/mca/sshmem/ucx/sshmem_ucx_shadow.c     return elem->block_size;