k 207 contrib/build-mca-comps-outside-of-tree/btl_tcp2_proc.c static void visit(int k, int level, int siz, int *a) k 209 contrib/build-mca-comps-outside-of-tree/btl_tcp2_proc.c level = level+1; a[k] = level; k 220 contrib/build-mca-comps-outside-of-tree/btl_tcp2_proc.c level = level-1; a[k] = 0; k 97 ompi/dpm/dpm.c int k, size, rsize, rank, rc, rportlen=0; k 292 ompi/dpm/dpm.c for (k=0; k < size; k++) { k 295 ompi/dpm/dpm.c nm->name.vpid = k; k 363 ompi/dpm/dpm.c for (k=0; k < rsize; k++) { k 366 ompi/dpm/dpm.c nm->name.vpid = k; k 230 ompi/group/group.c int i, j, k, result; k 234 ompi/group/group.c k = 0; k 245 ompi/group/group.c ranks_included[k] = i; k 246 ompi/group/group.c k++; k 251 ompi/group/group.c result = ompi_group_incl(group, k, ranks_included, new_group); k 263 ompi/group/group.c int j,k; k 270 ompi/group/group.c k = 0; k 282 ompi/group/group.c k++; k 291 ompi/group/group.c k++; k 298 ompi/group/group.c k++; k 305 ompi/group/group.c k = 0; k 316 ompi/group/group.c ranks_included[k] = index; k 317 ompi/group/group.c k++; k 325 ompi/group/group.c ranks_included[k] = index; k 326 ompi/group/group.c k++; k 332 ompi/group/group.c ranks_included[k] = index; k 333 ompi/group/group.c k++; k 337 ompi/group/group.c result = ompi_group_incl(group, k, ranks_included, new_group); k 349 ompi/group/group.c int j,k,i; k 356 ompi/group/group.c k = 0; k 387 ompi/group/group.c k = 0; k 426 ompi/group/group.c ranks_included[k] = j; k 427 ompi/group/group.c k++; k 434 ompi/group/group.c result = ompi_group_incl(group, k, ranks_included, new_group); k 446 ompi/group/group.c int proc1,proc2,k, result; k 454 ompi/group/group.c k = 0; k 463 ompi/group/group.c k = 0; k 473 ompi/group/group.c ranks_included[k] = proc1; k 474 ompi/group/group.c k++; k 480 ompi/group/group.c result = ompi_group_incl(group1, k, ranks_included, new_group); k 46 ompi/group/group_bitmap.c int i,count,j,k,m; k 66 ompi/group/group_bitmap.c for (k=0 ; k<BSIZE ; k++) { k 67 ompi/group/group_bitmap.c tmp1 = ( 1 << k); k 69 ompi/group/group_bitmap.c & (1 << k) ) ) { k 72 ompi/group/group_bitmap.c if( i==(int)(m/BSIZE) && k==m % BSIZE ) { k 90 ompi/group/group_bitmap.c int i,j,count,m,k; k 104 ompi/group/group_bitmap.c for (k=0 ; k<BSIZE ; k++) { k 105 ompi/group/group_bitmap.c tmp = ( 1 << k); k 107 ompi/group/group_bitmap.c & (1 << k) ) ) { k 111 ompi/group/group_bitmap.c ranks2[j] = i*BSIZE + k; k 347 ompi/mca/coll/base/coll_base_allreduce.c int ret, line, rank, size, k, recv_from, send_to, block_count, inbi; k 449 ompi/mca/coll/base/coll_base_allreduce.c for (k = 2; k < size; k++) { k 450 ompi/mca/coll/base/coll_base_allreduce.c const int prevblock = (rank + size - k + 1) % size; k 497 ompi/mca/coll/base/coll_base_allreduce.c for (k = 0; k < size - 1; k++) { k 498 ompi/mca/coll/base/coll_base_allreduce.c const int recv_data_from = (rank + size - k) % size; k 499 ompi/mca/coll/base/coll_base_allreduce.c const int send_data_from = (rank + 1 + size - k) % size; k 625 ompi/mca/coll/base/coll_base_allreduce.c int ret, line, rank, size, k, recv_from, send_to; k 681 ompi/mca/coll/base/coll_base_allreduce.c max_segcount, k); k 751 ompi/mca/coll/base/coll_base_allreduce.c for (k = 2; k < size; k++) { k 752 ompi/mca/coll/base/coll_base_allreduce.c const int prevblock = (rank + size - k + 1) % size; k 817 ompi/mca/coll/base/coll_base_allreduce.c for (k = 0; k < size - 1; k++) { k 818 ompi/mca/coll/base/coll_base_allreduce.c const int recv_data_from = (rank + size - k) % size; k 819 ompi/mca/coll/base/coll_base_allreduce.c const int send_data_from = (rank + 1 + size - k) % size; k 198 ompi/mca/coll/base/coll_base_alltoall.c int i, k, line = -1, rank, size, err = 0; k 256 ompi/mca/coll/base/coll_base_alltoall.c k = 0; k 261 ompi/mca/coll/base/coll_base_alltoall.c displs[k] = (ptrdiff_t)i * (ptrdiff_t)scount; k 262 ompi/mca/coll/base/coll_base_alltoall.c blen[k] = scount; k 263 ompi/mca/coll/base/coll_base_alltoall.c k++; k 267 ompi/mca/coll/base/coll_base_alltoall.c err = ompi_datatype_create_indexed(k, blen, displs, sdtype, &new_ddt); k 462 ompi/mca/coll/base/coll_base_reduce_scatter.c int ret, line, rank, size, i, k, recv_from, send_to, total_count, max_block_count; k 566 ompi/mca/coll/base/coll_base_reduce_scatter.c for (k = 2; k < size; k++) { k 567 ompi/mca/coll/base/coll_base_reduce_scatter.c const int prevblock = (rank + size - k) % size; k 62 ompi/mca/coll/libnbc/libdict/dict.h int (*_insert) __P((void *obj, void *k, void *d, int ow)); k 64 ompi/mca/coll/libnbc/libdict/dict.h void *(*_search) __P((void *obj, const void *k)); k 74 ompi/mca/coll/libnbc/libdict/dict.h #define dict_insert(dct,k,d,o) (dct)->_insert((dct)->_object, (k), (d), (o)) k 75 ompi/mca/coll/libnbc/libdict/dict.h #define dict_probe(dct,k,d) (dct)->_probe((dct)->_object, (k), (d)) k 76 ompi/mca/coll/libnbc/libdict/dict.h #define dict_search(dct,k) (dct)->_search((dct)->_object, (k)) k 77 ompi/mca/coll/libnbc/libdict/dict.h #define dict_remove(dct,k,del) (dct)->_remove((dct)->_object, (k), (del)) k 113 ompi/mca/coll/libnbc/libdict/dict.h #define dict_itor_search(i,k) (i)->_search((i)->_itor, (k)) k 15 ompi/mca/coll/libnbc/libdict/dict_private.h typedef int (*insert_func) __P((void *, void *k, void *d, int o)); k 16 ompi/mca/coll/libnbc/libdict/dict_private.h typedef int (*probe_func) __P((void *, void *k, void **d)); k 17 ompi/mca/coll/libnbc/libdict/dict_private.h typedef void *(*search_func) __P((void *, const void *k)); k 18 ompi/mca/coll/libnbc/libdict/dict_private.h typedef int (*remove_func) __P((void *, const void *k, int d)); k 34 ompi/mca/coll/libnbc/libdict/dict_private.h typedef int (*isearch_func) __P((void *, const void *k)); k 755 ompi/mca/coll/libnbc/nbc.c void NBC_SchedCache_args_delete_key_dummy(void *k) { k 260 ompi/mca/coll/libnbc/nbc_internal.h void NBC_SchedCache_args_delete_key_dummy(void *k); k 196 ompi/mca/common/ompio/common_ompio_aggregators.c int k=0, p=0, g=0; k 199 ompi/mca/common/ompio/common_ompio_aggregators.c for ( k=0, p=0; p<num_groups; p++ ) { k 212 ompi/mca/common/ompio/common_ompio_aggregators.c k = g*num_groups+p; k 213 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = k; k 218 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = k; k 219 ompi/mca/common/ompio/common_ompio_aggregators.c k++; k 232 ompi/mca/common/ompio/common_ompio_aggregators.c int k = 0; k 279 ompi/mca/common/ompio/common_ompio_aggregators.c for( k = 0 ; k < fh->f_size; k++){ k 280 ompi/mca/common/ompio/common_ompio_aggregators.c end_offsets[k] = start_offsets_lens[3*k] + start_offsets_lens[3*k+1]; k 281 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[k].contg_chunk_size = 0; k 283 ompi/mca/common/ompio/common_ompio_aggregators.c k = 0; k 284 ompi/mca/common/ompio/common_ompio_aggregators.c while( k < fh->f_size){ k 285 ompi/mca/common/ompio/common_ompio_aggregators.c if( k == 0){ k 286 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].contg_chunk_size += start_offsets_lens[3*k+1]; k 287 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; k 290 ompi/mca/common/ompio/common_ompio_aggregators.c k++; k 292 ompi/mca/common/ompio/common_ompio_aggregators.c else if( start_offsets_lens[3*k] == end_offsets[k - 1] ){ k 293 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].contg_chunk_size += start_offsets_lens[3*k+1]; k 294 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; k 297 ompi/mca/common/ompio/common_ompio_aggregators.c k++; k 302 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].contg_chunk_size += start_offsets_lens[3*k+1]; k 303 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[p].procs_in_contg_group[g] = start_offsets_lens[3*k + 2]; k 306 ompi/mca/common/ompio/common_ompio_aggregators.c k++; k 328 ompi/mca/common/ompio/common_ompio_aggregators.c int k = 0; k 385 ompi/mca/common/ompio/common_ompio_aggregators.c for(k = 0; k < cart_topo.dims[0]; k++){ k 390 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[k].procs_per_contg_group = (ompio_fh->f_size / cart_topo.dims[0]); k 391 ompi/mca/common/ompio/common_ompio_aggregators.c coords_tmp[0] = k; k 398 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[k].procs_in_contg_group[0] = tmp_rank; k 400 ompi/mca/common/ompio/common_ompio_aggregators.c for ( g=1; g< contg_groups[k].procs_per_contg_group; g++ ) { k 423 ompi/mca/common/ompio/common_ompio_aggregators.c contg_groups[k].procs_in_contg_group[g] = tmp_rank; k 1150 ompi/mca/common/ompio/common_ompio_aggregators.c int k = 0; k 1174 ompi/mca/common/ompio/common_ompio_aggregators.c for( k = 0; k < size-1; k++){ k 1175 ompi/mca/common/ompio/common_ompio_aggregators.c if( end_offsets[size_new_group* i + k] == start_offsets_lens[3*size_new_group*i + 3*(k+1)] ){ k 1176 ompi/mca/common/ompio/common_ompio_aggregators.c cci[i] += start_offsets_lens[3*size_new_group*i + 3*(k + 1) + 1]; k 1205 ompi/mca/common/ompio/common_ompio_aggregators.c int k = 0; k 1238 ompi/mca/common/ompio/common_ompio_aggregators.c for( k = 0; k < fh->f_procs_per_group ; k++){ k 1239 ompi/mca/common/ompio/common_ompio_aggregators.c fh->f_procs_in_group[k] = fh->f_init_procs_in_group[j+k]; k 1270 ompi/mca/common/ompio/common_ompio_aggregators.c int k = 0; k 1312 ompi/mca/common/ompio/common_ompio_aggregators.c for( k = 0 ; k < fh->f_init_procs_per_group; k++){ k 1313 ompi/mca/common/ompio/common_ompio_aggregators.c end_offsets_tmp[k] = start_offsets_lens_tmp[3*k] + start_offsets_lens_tmp[3*k+1]; k 537 ompi/mca/common/ompio/common_ompio_file_read.c int k = 0; k 557 ompi/mca/common/ompio/common_ompio_file_read.c k = fh->f_decoded_iov[fh->f_index_in_file_view].iov_len; k 558 ompi/mca/common/ompio/common_ompio_file_read.c while (i >= k) { k 559 ompi/mca/common/ompio/common_ompio_file_read.c fh->f_position_in_file_view = k; k 561 ompi/mca/common/ompio/common_ompio_file_read.c k += fh->f_decoded_iov[fh->f_index_in_file_view].iov_len; k 527 ompi/mca/common/ompio/common_ompio_file_write.c int k = 0; /* index into the io_array */ k 551 ompi/mca/common/ompio/common_ompio_file_write.c if (OMPIO_IOVEC_INITIAL_SIZE*block <= k) { k 570 ompi/mca/common/ompio/common_ompio_file_write.c f_io_array[k].memory_address = (IOVBASE_TYPE *)disp; k 575 ompi/mca/common/ompio/common_ompio_file_write.c f_io_array[k].length = bytes_to_write_in_cycle; k 578 ompi/mca/common/ompio/common_ompio_file_write.c f_io_array[k].length = decoded_iov[i].iov_len - k 600 ompi/mca/common/ompio/common_ompio_file_write.c f_io_array[k].offset = (IOVBASE_TYPE *)(intptr_t)(disp + fh->f_offset); k 605 ompi/mca/common/ompio/common_ompio_file_write.c < f_io_array[k].length) { k 606 ompi/mca/common/ompio/common_ompio_file_write.c f_io_array[k].length = fh->f_decoded_iov[j].iov_len - k 611 ompi/mca/common/ompio/common_ompio_file_write.c total_bytes_written += f_io_array[k].length; k 612 ompi/mca/common/ompio/common_ompio_file_write.c fh->f_total_bytes += f_io_array[k].length; k 613 ompi/mca/common/ompio/common_ompio_file_write.c bytes_to_write_in_cycle -= f_io_array[k].length; k 614 ompi/mca/common/ompio/common_ompio_file_write.c k = k + 1; k 618 ompi/mca/common/ompio/common_ompio_file_write.c f_num_io_entries = k; k 39 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_preadv.c size_t k; k 101 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_preadv.c k = 0; k 104 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_preadv.c merge_buf + k, k 106 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_preadv.c k += fh->f_io_array[i-merge].length; k 41 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_pwritev.c size_t k; k 82 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_pwritev.c k = 0; k 84 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_pwritev.c memcpy (merge_buf + k, k 87 ompi/mca/fbtl/pvfs2/fbtl_pvfs2_pwritev.c k += fh->f_io_array[i-merge].length; k 843 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c int i=0, j=0, k=0, tmp=0, nprocs_recv=0, nprocs_send=0; k 941 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c k = start_pos[i] + count[i] - 1; k 942 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c tmp = others_req[i].lens[k]; k 943 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c others_req[i].lens[k] = partial_send[i]; k 964 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_read_all.c if (partial_send[i]) others_req[i].lens[k] = tmp; k 950 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c int *tmp_len=NULL, sum, *srt_len=NULL, nprocs_recv, nprocs_send, k,i,j; k 1000 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = start_pos[i] + count[i] - 1; k 1001 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp_len[i] = others_req[i].lens[k]; k 1002 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c others_req[i].lens[k] = partial_recv[i]; k 1037 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = start_pos[i] + count[i] - 1; k 1038 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c others_req[i].lens[k] = tmp_len[i]; k 1427 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c int i, j, heapsize, l, r, k, smallest; k 1443 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = i; k 1445 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c l = 2*(k+1) - 1; k 1446 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c r = 2*(k+1); k 1448 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c (*(a[l].off_list) < *(a[k].off_list))) k 1450 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c else smallest = k; k 1456 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c if (smallest != k) { k 1457 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.off_list = a[k].off_list; k 1458 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.len_list = a[k].len_list; k 1459 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.nelem = a[k].nelem; k 1461 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].off_list = a[smallest].off_list; k 1462 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].len_list = a[smallest].len_list; k 1463 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].nelem = a[smallest].nelem; k 1469 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = smallest; k 1494 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = 0; k 1496 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c l = 2*(k+1) - 1; k 1497 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c r = 2*(k+1); k 1500 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c (*(a[l].off_list) < *(a[k].off_list))) k 1502 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c else smallest = k; k 1508 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c if (smallest != k) { k 1509 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.off_list = a[k].off_list; k 1510 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.len_list = a[k].len_list; k 1511 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c tmp.nelem = a[k].nelem; k 1513 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].off_list = a[smallest].off_list; k 1514 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].len_list = a[smallest].len_list; k 1515 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c a[k].nelem = a[smallest].nelem; k 1521 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c k = smallest; k 53 ompi/mca/io/ompio/io_ompio.c int j, k; k 67 ompi/mca/io/ompio/io_ompio.c k = 0; k 72 ompi/mca/io/ompio/io_ompio.c if (OMPIO_IOVEC_INITIAL_SIZE*block <= k) { k 98 ompi/mca/io/ompio/io_ompio.c iov[k].iov_base = (IOVBASE_TYPE *)(intptr_t)(disp + fh->f_offset); k 103 ompi/mca/io/ompio/io_ompio.c iov[k].iov_len = bytes_to_write; k 106 ompi/mca/io/ompio/io_ompio.c iov[k].iov_len = fh->f_decoded_iov[j].iov_len - k 110 ompi/mca/io/ompio/io_ompio.c fh->f_total_bytes += iov[k].iov_len; k 111 ompi/mca/io/ompio/io_ompio.c bytes_to_write -= iov[k].iov_len; k 112 ompi/mca/io/ompio/io_ompio.c k = k + 1; k 116 ompi/mca/io/ompio/io_ompio.c *iov_count = k; k 145 ompi/mca/io/ompio/io_ompio.c fh->f_comm->c_coll->coll_gather (&k, k 156 ompi/mca/io/ompio/io_ompio.c malloc (k * sizeof(mca_io_ompio_offlen_array_t)); k 163 ompi/mca/io/ompio/io_ompio.c for (i=0;i<k;i++){ k 252 ompi/mca/io/ompio/io_ompio.c k, k 462 ompi/mca/io/ompio/io_ompio_file_open.c int i, k, index; k 477 ompi/mca/io/ompio/io_ompio_file_open.c k = 0; k 480 ompi/mca/io/ompio/io_ompio_file_open.c k = data->ompio_fh.f_decoded_iov[index].iov_len; k 481 ompi/mca/io/ompio/io_ompio_file_open.c if (i >= k) { k 482 ompi/mca/io/ompio/io_ompio_file_open.c i -= k; k 485 ompi/mca/io/ompio/io_ompio_file_open.c k=0; k 490 ompi/mca/io/ompio/io_ompio_file_open.c k=i; k 496 ompi/mca/io/ompio/io_ompio_file_open.c (OMPI_MPI_OFFSET_TYPE)(intptr_t)data->ompio_fh.f_decoded_iov[index].iov_base + k; k 317 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_aggrs.c int k, bridgerankoffset = 0; k 318 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_aggrs.c for (k=0;k<j;k++) { k 319 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_aggrs.c bridgerankoffset += fd->hints->fs_hints.bg.bridgelistnum[k]; k 848 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c int i, j, k=0, tmp=0, nprocs_recv, nprocs_send; k 913 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c k = start_pos[i] + count[i] - 1; k 914 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c tmp = others_req[i].lens[k]; k 915 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c others_req[i].lens[k] = partial_send[i]; k 926 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c if (partial_send[i]) others_req[i].lens[k] = tmp; k 1142 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c int i, j, k=0, tmp=0, nprocs_recv, nprocs_send; k 1183 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c k = start_pos[i] + count[i] - 1; k 1184 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c tmp = others_req[i].lens[k]; k 1185 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c others_req[i].lens[k] = partial_send[i]; k 1195 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_rdcoll.c if (partial_send[i]) others_req[i].lens[k] = tmp; k 1020 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c int i, j, k, *tmp_len, nprocs_recv, nprocs_send, err; k 1049 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = start_pos[i] + count[i] - 1; k 1050 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp_len[i] = others_req[i].lens[k]; k 1051 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c others_req[i].lens[k] = partial_recv[i]; k 1079 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = start_pos[i] + count[i] - 1; k 1080 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c others_req[i].lens[k] = tmp_len[i]; k 1413 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c int i, j, heapsize, l, r, k, smallest; k 1435 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = i; k 1437 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c l = 2*(k+1) - 1; k 1438 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c r = 2*(k+1); k 1441 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c (*(a[l].off_list) < *(a[k].off_list))) k 1443 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c else smallest = k; k 1449 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c if (smallest != k) { k 1450 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.off_list = a[k].off_list; k 1451 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.len_list = a[k].len_list; k 1452 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.nelem = a[k].nelem; k 1454 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].off_list = a[smallest].off_list; k 1455 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].len_list = a[smallest].len_list; k 1456 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].nelem = a[smallest].nelem; k 1462 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = smallest; k 1486 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = 0; k 1488 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c l = 2*(k+1) - 1; k 1489 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c r = 2*(k+1); k 1492 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c (*(a[l].off_list) < *(a[k].off_list))) k 1494 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c else smallest = k; k 1500 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c if (smallest != k) { k 1501 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.off_list = a[k].off_list; k 1502 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.len_list = a[k].len_list; k 1503 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp.nelem = a[k].nelem; k 1505 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].off_list = a[smallest].off_list; k 1506 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].len_list = a[smallest].len_list; k 1507 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c a[k].nelem = a[smallest].nelem; k 1513 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = smallest; k 1543 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c int i, j, k=0, nprocs_recv, nprocs_send, *tmp_len, err; k 1679 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = start_pos[i] + count[i] - 1; k 1680 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c tmp_len[i] = others_req[i].lens[k]; k 1681 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c others_req[i].lens[k] = partial_recv[i]; k 1695 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c k = start_pos[i] + count[i] - 1; k 1696 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c others_req[i].lens[k] = tmp_len[i]; k 604 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c int k; k 605 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c for (k=0;k<naggs;k++) { k 606 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c int aggbridgerank = all_procInfo[tmp_ranklist[k]].bridgeRank; k 608 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c thisBridgeAggList[numAggsForThisBridge] = tmp_ranklist[k]; k 33 ompi/mca/io/romio321/romio/adio/ad_gridftp/ad_gridftp_fcntl.c int combiner, i, j, k, filetype_is_contig, err; k 155 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c int i, j, k, st_index=0; k 438 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c k = num = buf_count = 0; k 483 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c k = (k + 1)%flat_buf->count; k 487 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c flat_buf->indices[k]; k 488 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrstr.c new_bwr_size = flat_buf->blocklens[k]; k 171 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c int i, j, k, err=-1, brd_size, st_index=0; k 466 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c k = num = buf_count = 0; k 510 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c k = (k + 1)%flat_buf->count; k 513 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c flat_buf->indices[k]; k 514 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_read.c new_brd_size = flat_buf->blocklens[k]; k 275 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c int i, j, k, err=-1, bwr_size, st_index=0; k 571 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c k = num = buf_count = 0; k 616 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c k = (k + 1)%flat_buf->count; k 619 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c flat_buf->indices[k]; k 620 ompi/mca/io/romio321/romio/adio/ad_nfs/ad_nfs_write.c new_bwr_size = flat_buf->blocklens[k]; k 73 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c int i, j, k, err=-1, bwr_size, fwr_size=0, st_index=0; k 127 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c k = 0; k 130 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c iov[k].iov_base = ((char *) buf) + j*buftype_extent + k 132 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c iov[k].iov_len = flat_buf->blocklens[i]; k 136 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c k = (k+1)%16; k 138 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c if (!k) { k 144 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c if (k) { k 145 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c err = writev(fd->fd_sys, iov, k); k 261 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c k = num = buf_count = 0; k 299 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c k = (k + 1)%flat_buf->count; k 302 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c flat_buf->indices[k]; k 303 ompi/mca/io/romio321/romio/adio/ad_piofs/ad_piofs_write.c new_bwr_size = flat_buf->blocklens[k]; k 112 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c int i, j, k, l, brd_size, frd_size=0, st_index=0; k 363 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 364 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if (i || k) { k 365 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c file_offsets[k] = disp + n_filetypes*filetype_extent k 367 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c file_lengths[k] = flat_file->blocklens[j]; k 368 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c mem_lengths += file_lengths[k]; k 391 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c for (k=0; k<extra_blks; k++) { k 392 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if(i || k) { k 393 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c file_offsets[k] = disp + n_filetypes*filetype_extent + k 395 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if (k == (extra_blks - 1)) { k 396 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c file_lengths[k] = bufsize - (int32_t) mem_lengths k 399 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c else file_lengths[k] = flat_file->blocklens[j]; k 401 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c mem_lengths += file_lengths[k]; k 424 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c start_k = k = 0; k 434 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 445 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if((new_buffer_read + flat_buf->blocklens[k] + k 448 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c flat_buf->blocklens[k] - (bufsize - size_read); k 452 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c new_buffer_read += flat_buf->blocklens[k]; k 453 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c end_brd_size = flat_buf->blocklens[k]; k 464 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 495 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 502 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if((new_buffer_read + flat_buf->blocklens[k]) > k 506 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k--; k 509 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c new_buffer_read += flat_buf->blocklens[k]; k 510 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c end_brd_size = flat_buf->blocklens[k]; k 521 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 529 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 534 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if (flat_buf->blocklens[k] == end_brd_size) k 535 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c brd_size = flat_buf->blocklens[(k+1)% k 538 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 539 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k--; k 545 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 566 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c start_k = k; k 585 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c start_k = k = 0; k 593 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 604 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if((new_buffer_read + flat_buf->blocklens[k] + k 607 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c flat_buf->blocklens[k] - (bufsize - size_read); k 611 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c new_buffer_read += flat_buf->blocklens[k]; k 612 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c end_brd_size = flat_buf->blocklens[k]; k 623 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 654 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 661 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if((new_buffer_read + flat_buf->blocklens[k]) > k 665 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k--; k 668 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c new_buffer_read += flat_buf->blocklens[k]; k 669 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c end_brd_size = flat_buf->blocklens[k]; k 680 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 688 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = start_k; k 693 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c (int)flat_buf->indices[k]); k 696 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c mem_offsets[0] += flat_buf->blocklens[k] - brd_size; k 701 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c if (flat_buf->blocklens[k] == end_brd_size) k 702 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c brd_size = flat_buf->blocklens[(k+1)% k 705 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 706 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k--; k 711 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c mem_lengths[i] = flat_buf->blocklens[k]; k 715 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c k = (k + 1)%flat_buf->count; k 763 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_read.c start_k = k; k 98 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c int i, j, k, err=-1, bwr_size, fwr_size=0, st_index=0; k 369 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = num = buf_count = 0; k 419 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 422 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c flat_buf->indices[k]; k 423 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c new_bwr_size = flat_buf->blocklens[k]; k 468 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c int i, j, k, err=-1, bwr_size, fwr_size=0, st_index=0; k 752 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 753 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if (i || k) { k 754 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c file_offsets[k] = disp + n_filetypes*filetype_extent k 756 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c file_lengths[k] = flat_file->blocklens[j]; k 757 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c mem_lengths += file_lengths[k]; k 780 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c for (k=0; k<extra_blks; k++) { k 781 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if(i || k) { k 782 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c file_offsets[k] = disp + n_filetypes*filetype_extent + k 784 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if (k == (extra_blks - 1)) { k 785 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c file_lengths[k] = bufsize - (int32_t) mem_lengths k 788 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c else file_lengths[k] = flat_file->blocklens[j]; k 790 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c mem_lengths += file_lengths[k]; k 813 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c start_k = k = 0; k 823 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 834 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if((new_buffer_write + flat_buf->blocklens[k] + k 837 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 841 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c new_buffer_write += flat_buf->blocklens[k]; k 842 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c end_bwr_size = flat_buf->blocklens[k]; k 853 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 884 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 891 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if((new_buffer_write + flat_buf->blocklens[k]) > k 896 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k--; k 899 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c new_buffer_write += flat_buf->blocklens[k]; k 900 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c end_bwr_size = flat_buf->blocklens[k]; k 911 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 919 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 924 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if (flat_buf->blocklens[k] == end_bwr_size) k 925 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c bwr_size = flat_buf->blocklens[(k+1)% k 928 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 929 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k--; k 935 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 956 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c start_k = k; k 975 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c start_k = k = 0; k 983 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 994 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if((new_buffer_write + flat_buf->blocklens[k] + k 997 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 1001 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c new_buffer_write += flat_buf->blocklens[k]; k 1002 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c end_bwr_size = flat_buf->blocklens[k]; k 1013 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 1044 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 1051 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if((new_buffer_write + flat_buf->blocklens[k]) > k 1056 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k--; k 1059 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c new_buffer_write += flat_buf->blocklens[k]; k 1060 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c end_bwr_size = flat_buf->blocklens[k]; k 1071 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 1079 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = start_k; k 1084 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c (int)flat_buf->indices[k]); k 1088 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c mem_offsets[0] += flat_buf->blocklens[k] - bwr_size; k 1093 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c if (flat_buf->blocklens[k] == end_bwr_size) k 1094 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c bwr_size = flat_buf->blocklens[(k+1)% k 1097 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 1098 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k--; k 1103 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c mem_lengths[i] = flat_buf->blocklens[k]; k 1107 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c k = (k + 1)%flat_buf->count; k 1139 ompi/mca/io/romio321/romio/adio/ad_pvfs/ad_pvfs_write.c start_k = k; k 21 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c int i, j, k, brd_size, frd_size=0, st_index=0; k 320 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 321 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if (i || k) { k 322 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c file_offsets[k] = disp + k 325 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c file_lengths[k] = flat_file->blocklens[j]; k 326 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c mem_lengths += file_lengths[k]; k 399 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c for (k=0; k<extra_blks; k++) { k 400 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if(i || k) { k 401 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c file_offsets[k] = disp + k 404 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if (k == (extra_blks - 1)) { k 405 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c file_lengths[k] = bufsize - (int32_t) mem_lengths k 408 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c else file_lengths[k] = flat_file->blocklens[j]; k 410 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c mem_lengths += file_lengths[k]; k 478 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c start_k = k = 0; k 488 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 499 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if((new_buffer_read + flat_buf->blocklens[k] + k 502 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c flat_buf->blocklens[k] - (bufsize - size_read); k 506 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c new_buffer_read += flat_buf->blocklens[k]; k 507 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c end_brd_size = flat_buf->blocklens[k]; k 518 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 549 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 556 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if((new_buffer_read + flat_buf->blocklens[k]) > k 560 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k--; k 563 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c new_buffer_read += flat_buf->blocklens[k]; k 564 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c end_brd_size = flat_buf->blocklens[k]; k 575 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 583 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 588 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if (flat_buf->blocklens[k] == end_brd_size) k 589 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c brd_size = flat_buf->blocklens[(k+1)% k 592 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 593 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k--; k 599 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 620 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c start_k = k; k 666 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c start_k = k = 0; k 674 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 685 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if((new_buffer_read + flat_buf->blocklens[k] + k 688 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c flat_buf->blocklens[k] - (bufsize - size_read); k 692 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c new_buffer_read += flat_buf->blocklens[k]; k 693 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c end_brd_size = flat_buf->blocklens[k]; k 704 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 735 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 742 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if((new_buffer_read + flat_buf->blocklens[k]) > k 746 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k--; k 749 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c new_buffer_read += flat_buf->blocklens[k]; k 750 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c end_brd_size = flat_buf->blocklens[k]; k 761 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 769 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = start_k; k 774 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c (int)flat_buf->indices[k]); k 777 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c mem_offsets[0] += flat_buf->blocklens[k] - brd_size; k 782 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c if (flat_buf->blocklens[k] == end_brd_size) k 783 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c brd_size = flat_buf->blocklens[(k+1)% k 786 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 787 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k--; k 792 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c mem_lengths[i] = flat_buf->blocklens[k]; k 796 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c k = (k + 1)%flat_buf->count; k 871 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_read_list_classic.c start_k = k; k 26 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c int i, j, k, bwr_size, fwr_size=0, st_index=0; k 362 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 363 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if (i || k) { k 364 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c file_offsets[k] = disp + k 367 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c file_lengths[k] = flat_file->blocklens[j]; k 368 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c mem_length += file_lengths[k]; k 442 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c for (k=0; k<extra_blks; k++) { k 443 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if(i || k) { k 444 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c file_offsets[k] = disp + k 447 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if (k == (extra_blks - 1)) { k 448 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c file_lengths[k] = bufsize - (int32_t) mem_lengths k 451 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c else file_lengths[k] = flat_file->blocklens[j]; k 453 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c mem_lengths += file_lengths[k]; k 524 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c start_k = k = 0; k 534 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 545 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if((new_buffer_write + flat_buf->blocklens[k] + k 548 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 552 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c new_buffer_write += flat_buf->blocklens[k]; k 553 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c end_bwr_size = flat_buf->blocklens[k]; k 564 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 595 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 602 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if((new_buffer_write + flat_buf->blocklens[k]) > k 607 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k--; k 610 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c new_buffer_write += flat_buf->blocklens[k]; k 611 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c end_bwr_size = flat_buf->blocklens[k]; k 622 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 630 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 635 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if (flat_buf->blocklens[k] == end_bwr_size) k 636 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c bwr_size = flat_buf->blocklens[(k+1)% k 639 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 640 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k--; k 646 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 667 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c start_k = k; k 713 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c start_k = k = 0; k 721 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 732 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if((new_buffer_write + flat_buf->blocklens[k] + k 735 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 739 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c new_buffer_write += flat_buf->blocklens[k]; k 740 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c end_bwr_size = flat_buf->blocklens[k]; k 751 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 782 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 789 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if((new_buffer_write + flat_buf->blocklens[k]) > k 794 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k--; k 797 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c new_buffer_write += flat_buf->blocklens[k]; k 798 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c end_bwr_size = flat_buf->blocklens[k]; k 809 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 817 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = start_k; k 824 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c (int)flat_buf->indices[k]); k 828 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c mem_offsets[0] += flat_buf->blocklens[k] - bwr_size; k 833 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c if (flat_buf->blocklens[k] == end_bwr_size) k 834 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c bwr_size = flat_buf->blocklens[(k+1)% k 837 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 838 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k--; k 843 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c mem_lengths[i] = flat_buf->blocklens[k]; k 847 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c k = (k + 1)%flat_buf->count; k 927 ompi/mca/io/romio321/romio/adio/ad_pvfs2/ad_pvfs2_write_list_classic.c start_k = k; k 23 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c int i, j, k, brd_size, frd_size=0, st_index=0; k 316 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 317 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if (i || k) { k 318 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c file_offsets[k] = disp + k 321 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c file_lengths[k] = flat_file->blocklens[j]; k 322 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c mem_lengths += file_lengths[k]; k 365 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c for (k=0; k<extra_blks; k++) { k 366 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if(i || k) { k 367 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c file_offsets[k] = disp + k 370 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if (k == (extra_blks - 1)) { k 371 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c file_lengths[k] = bufsize - mem_lengths k 374 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c else file_lengths[k] = flat_file->blocklens[j]; k 376 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c mem_lengths += file_lengths[k]; k 419 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c start_k = k = 0; k 429 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 440 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if((new_buffer_read + flat_buf->blocklens[k] + k 443 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c flat_buf->blocklens[k] - (bufsize - size_read); k 447 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c new_buffer_read += flat_buf->blocklens[k]; k 448 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c end_brd_size = flat_buf->blocklens[k]; k 459 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 490 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 497 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if((new_buffer_read + flat_buf->blocklens[k]) > k 501 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k--; k 504 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c new_buffer_read += flat_buf->blocklens[k]; k 505 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c end_brd_size = flat_buf->blocklens[k]; k 516 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 524 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 529 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if (flat_buf->blocklens[k] == end_brd_size) k 530 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c brd_size = flat_buf->blocklens[(k+1)% k 533 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 534 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k--; k 540 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 561 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c start_k = k; k 607 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c start_k = k = 0; k 615 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 626 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if((new_buffer_read + flat_buf->blocklens[k] + k 629 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c flat_buf->blocklens[k] - (bufsize - size_read); k 633 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c new_buffer_read += flat_buf->blocklens[k]; k 634 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c end_brd_size = flat_buf->blocklens[k]; k 645 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 676 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 683 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if((new_buffer_read + flat_buf->blocklens[k]) > k 687 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k--; k 690 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c new_buffer_read += flat_buf->blocklens[k]; k 691 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c end_brd_size = flat_buf->blocklens[k]; k 702 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 710 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = start_k; k 715 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c flat_buf->indices[k]; k 718 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c mem_offsets[0] += flat_buf->blocklens[k] - brd_size; k 723 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c if (flat_buf->blocklens[k] == end_brd_size) k 724 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c brd_size = flat_buf->blocklens[(k+1)% k 727 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c brd_size = flat_buf->blocklens[k] - end_brd_size; k 728 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k--; k 733 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c mem_lengths[i] = flat_buf->blocklens[k]; k 737 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c k = (k + 1)%flat_buf->count; k 788 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_read_list.c start_k = k; k 28 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c int i, j, k, bwr_size, fwr_size=0, st_index=0; k 343 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c for (k=0; k<MAX_ARRAY_SIZE; k++) { k 344 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if (i || k) { k 345 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c file_offsets[k] = disp + k 348 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c file_lengths[k] = flat_file->blocklens[j]; k 349 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c mem_lengths += file_lengths[k]; k 393 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c for (k=0; k<extra_blks; k++) { k 394 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if(i || k) { k 395 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c file_offsets[k] = disp + k 399 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if (k == (extra_blks - 1)) { k 400 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c file_lengths[k] = bufsize k 403 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c else file_lengths[k] = flat_file->blocklens[j]; k 405 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c mem_lengths += file_lengths[k]; k 450 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c start_k = k = 0; k 460 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 471 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if((new_buffer_write + flat_buf->blocklens[k] + k 474 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 478 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c new_buffer_write += flat_buf->blocklens[k]; k 479 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c end_bwr_size = flat_buf->blocklens[k]; k 490 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 521 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 528 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if((new_buffer_write + flat_buf->blocklens[k]) > k 533 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k--; k 536 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c new_buffer_write += flat_buf->blocklens[k]; k 537 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c end_bwr_size = flat_buf->blocklens[k]; k 548 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 556 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 561 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if (flat_buf->blocklens[k] == end_bwr_size) k 562 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c bwr_size = flat_buf->blocklens[(k+1)% k 565 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 566 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k--; k 572 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 593 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c start_k = k; k 639 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c start_k = k = 0; k 647 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 658 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if((new_buffer_write + flat_buf->blocklens[k] + k 661 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c flat_buf->blocklens[k] - (bufsize - size_wrote); k 665 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c new_buffer_write += flat_buf->blocklens[k]; k 666 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c end_bwr_size = flat_buf->blocklens[k]; k 677 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 708 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 715 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if((new_buffer_write + flat_buf->blocklens[k]) > k 720 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k--; k 723 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c new_buffer_write += flat_buf->blocklens[k]; k 724 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c end_bwr_size = flat_buf->blocklens[k]; k 735 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 743 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = start_k; k 748 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c flat_buf->indices[k]; k 752 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c mem_offsets[0] += flat_buf->blocklens[k] - bwr_size; k 757 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c if (flat_buf->blocklens[k] == end_bwr_size) k 758 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c bwr_size = flat_buf->blocklens[(k+1)% k 761 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c bwr_size = flat_buf->blocklens[k] - end_bwr_size; k 762 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k--; k 767 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c mem_lengths[i] = flat_buf->blocklens[k]; k 771 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c k = (k + 1)%flat_buf->count; k 823 ompi/mca/io/romio321/romio/adio/ad_zoidfs/ad_zoidfs_write_list.c start_k = k; k 16 ompi/mca/io/romio321/romio/adio/common/ad_close.c int i, j, k, combiner, myrank, err, is_contig; k 103 ompi/mca/io/romio321/romio/adio/common/ad_close.c MPI_Type_get_envelope(fd->etype, &i, &j, &k, &combiner); k 109 ompi/mca/io/romio321/romio/adio/common/ad_close.c MPI_Type_get_envelope(fd->filetype, &i, &j, &k, &combiner); k 1029 ompi/mca/io/romio321/romio/adio/common/ad_iread_coll.c int i, j, k = 0, tmp = 0, nprocs_recv, nprocs_send; k 1091 ompi/mca/io/romio321/romio/adio/common/ad_iread_coll.c k = start_pos[i] + count[i] - 1; k 1092 ompi/mca/io/romio321/romio/adio/common/ad_iread_coll.c tmp = others_req[i].lens[k]; k 1093 ompi/mca/io/romio321/romio/adio/common/ad_iread_coll.c others_req[i].lens[k] = partial_send[i]; k 1104 ompi/mca/io/romio321/romio/adio/common/ad_iread_coll.c if (partial_send[i]) others_req[i].lens[k] = tmp; k 1085 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c int i, j, k, *tmp_len, nprocs_recv; k 1107 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c k = start_pos[i] + count[i] - 1; k 1108 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c tmp_len[i] = others_req[i].lens[k]; k 1109 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c others_req[i].lens[k] = partial_recv[i]; k 1140 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c k = start_pos[i] + count[i] - 1; k 1141 ompi/mca/io/romio321/romio/adio/common/ad_iwrite_coll.c others_req[i].lens[k] = tmp_len[i]; k 286 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c int i, j, k; k 446 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c i_offset = k = 0; k 452 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c offset_list[k] = off; k 453 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c len_list[k] = frd_size; k 454 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c k++; k 784 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c int i, j, k=0, tmp=0, nprocs_recv, nprocs_send; k 849 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c k = start_pos[i] + count[i] - 1; k 850 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c tmp = others_req[i].lens[k]; k 851 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c others_req[i].lens[k] = partial_send[i]; k 862 ompi/mca/io/romio321/romio/adio/common/ad_read_coll.c if (partial_send[i]) others_req[i].lens[k] = tmp; k 53 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c int i, j, k, st_index=0; k 324 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c k = num = buf_count = 0; k 368 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c k = (k + 1)%flat_buf->count; k 371 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c flat_buf->indices[k]); k 372 ompi/mca/io/romio321/romio/adio/common/ad_read_str.c new_brd_size = flat_buf->blocklens[k]; k 18 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c int combiner, i, j, k, err, filetype_is_contig; k 24 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c MPI_Type_get_envelope(fd->etype, &i, &j, &k, &combiner); k 30 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c MPI_Type_get_envelope(fd->filetype, &i, &j, &k, &combiner); k 38 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c ADIOI_Type_get_envelope(etype, &i, &j, &k, &combiner); k 45 ompi/mca/io/romio321/romio/adio/common/ad_set_view.c ADIOI_Type_get_envelope(filetype, &i, &j, &k, &combiner); k 579 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c int i, j, k, *tmp_len, nprocs_recv, nprocs_send, err; k 608 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = start_pos[i] + count[i] - 1; k 609 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp_len[i] = others_req[i].lens[k]; k 610 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c others_req[i].lens[k] = partial_recv[i]; k 641 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = start_pos[i] + count[i] - 1; k 642 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c others_req[i].lens[k] = tmp_len[i]; k 980 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c int i, j, heapsize, l, r, k, smallest; k 1002 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = i; k 1004 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c l = 2*(k+1) - 1; k 1005 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c r = 2*(k+1); k 1008 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c (*(a[l].off_list) < *(a[k].off_list))) k 1010 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c else smallest = k; k 1016 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c if (smallest != k) { k 1017 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.off_list = a[k].off_list; k 1018 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.len_list = a[k].len_list; k 1019 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.nelem = a[k].nelem; k 1021 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].off_list = a[smallest].off_list; k 1022 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].len_list = a[smallest].len_list; k 1023 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].nelem = a[smallest].nelem; k 1029 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = smallest; k 1053 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = 0; k 1055 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c l = 2*(k+1) - 1; k 1056 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c r = 2*(k+1); k 1059 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c (*(a[l].off_list) < *(a[k].off_list))) k 1061 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c else smallest = k; k 1067 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c if (smallest != k) { k 1068 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.off_list = a[k].off_list; k 1069 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.len_list = a[k].len_list; k 1070 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c tmp.nelem = a[k].nelem; k 1072 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].off_list = a[smallest].off_list; k 1073 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].len_list = a[smallest].len_list; k 1074 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c a[k].nelem = a[smallest].nelem; k 1080 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c k = smallest; k 30 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c int j, k, st_index=0; k 314 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c k = num = buf_count = 0; k 371 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c k = (k + 1)%flat_buf->count; k 374 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c flat_buf->indices[k]; k 375 ompi/mca/io/romio321/romio/adio/common/ad_write_nolock.c new_bwr_size = flat_buf->blocklens[k]; k 121 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c int i, j, k, st_index=0; k 398 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c k = num = buf_count = 0; k 443 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c k = (k + 1)%flat_buf->count; k 446 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c flat_buf->indices[k]; k 447 ompi/mca/io/romio321/romio/adio/common/ad_write_str.c new_bwr_size = flat_buf->blocklens[k]; k 194 ompi/mca/io/romio321/romio/adio/common/flatten.c int k, m, n, is_hindexed_block=0; k 559 ompi/mca/io/romio321/romio/adio/common/flatten.c for (k=0, nonzeroth=j; k<basic_num; k++) { k 745 ompi/mca/io/romio321/romio/adio/common/flatten.c for (k=0,nonzeroth=j; k<basic_num; k++) { k 932 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c int k; k 933 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c for (k=targetAggsForMyDataFirstOffLenIndex[roundIter][aggIter];k<=targetAggsForMyDataLastOffLenIndex[roundIter][aggIter];k++) k 934 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c amountOfDataWrittenThisRoundAgg += len_list[k]; k 2018 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c int k; k 2019 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c for (k=sourceAggsForMyDataFirstOffLenIndex[roundIter][aggIter];k<=sourceAggsForMyDataLastOffLenIndex[roundIter][aggIter];k++) k 2020 ompi/mca/io/romio321/romio/adio/common/onesided_aggregation.c amountOfDataReadThisRoundAgg += len_list[k]; k 52 ompi/mca/io/romio321/romio/mpi-io/get_view.c int i, j, k, combiner; k 76 ompi/mca/io/romio321/romio/mpi-io/get_view.c MPI_Type_get_envelope(adio_fh->etype, &i, &j, &k, &combiner); k 89 ompi/mca/io/romio321/romio/mpi-io/get_view.c MPI_Type_get_envelope(adio_fh->filetype, &i, &j, &k, &combiner); k 260 ompi/mca/io/romio321/romio/test-internal/heap_test.c int i, j, k, err_flag = 0; k 274 ompi/mca/io/romio321/romio/test-internal/heap_test.c for (k=0; k < test->heap_size; k++) { k 275 ompi/mca/io/romio321/romio/test-internal/heap_test.c myheap.nodes[k].offset = test->offsets[k]; k 276 ompi/mca/io/romio321/romio/test-internal/heap_test.c myheap.nodes[k].proc = k; k 61 ompi/mca/io/romio321/romio/test/hindexed.c int k; k 188 ompi/mca/io/romio321/romio/test/hindexed.c for (k=0; k<num_io; k++) { k 190 ompi/mca/io/romio321/romio/test/hindexed.c printf("[%2d]",k*2*YLEN+i); k 85 ompi/mca/op/base/op_base_functions.c type2 k; \ k 99 ompi/mca/op/base/op_base_functions.c b->k = a->k; \ k 101 ompi/mca/op/base/op_base_functions.c b->k = (b->k < a->k ? b->k : a->k); \ k 722 ompi/mca/op/base/op_base_functions.c b->k = a1->k; \ k 725 ompi/mca/op/base/op_base_functions.c b->k = (a2->k < a1->k ? a2->k : a1->k); \ k 728 ompi/mca/op/base/op_base_functions.c b->k = a2->k; \ k 136 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int *nodes_roots = NULL, *k = NULL; k 381 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c int *k = NULL; k 663 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k = (int *)calloc(sol->k_length, sizeof(int)); k 665 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k[idx] = sol->k[idx][0]; k 670 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "Rank permutation sigma/k : ", "", k, num_objs_total); k 688 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != (err = comm_old->c_coll->coll_scatter(k, 1, MPI_INT, k 692 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (NULL != k) free(k); k 697 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c free(k); k 874 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k = (int *)calloc(sol->k_length, sizeof(int)); k 876 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c k[idx] = sol->k[idx][0]; k 882 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c "Rank permutation sigma/k : ", "", k, num_procs_in_node); k 898 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (OMPI_SUCCESS != (err = localcomm->c_coll->coll_scatter(k, 1, MPI_INT, k 902 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c if (NULL != k) free(k); k 932 ompi/mca/topo/treematch/topo_treematch_dist_graph_create.c free(k); k 7 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k); k 8 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus); k 12 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k); k 16 ompi/mca/topo/treematch/treematch/k-partitioning.c int *kpartition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints); k 17 ompi/mca/topo/treematch/treematch/k-partitioning.c int* build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints); k 19 ompi/mca/topo/treematch/treematch/k-partitioning.c int* kPartitioning(double ** comm, int n, int k, int * constraints, int nb_constraints, int greedy_trials) k 28 ompi/mca/topo/treematch/treematch/k-partitioning.c part = build_p_vector(comm, n, k, greedy_trials, constraints, nb_constraints); k 30 ompi/mca/topo/treematch/treematch/k-partitioning.c memory_allocation(&Q, &Qinst, &D, real_n, k); k 34 ompi/mca/topo/treematch/treematch/k-partitioning.c initialization(part, comm, &Qpart, Q, Qinst, D, real_n, k, &deficit, &surplus); k 46 ompi/mca/topo/treematch/treematch/k-partitioning.c destruction(&Qpart, Q, Qinst, D, real_n, k); k 51 ompi/mca/topo/treematch/treematch/k-partitioning.c void memory_allocation(PriorityQueue ** Q, PriorityQueue ** Qinst, double *** D, int n, int k) k 54 ompi/mca/topo/treematch/treematch/k-partitioning.c *Q = calloc(k, sizeof(PriorityQueue)); /*one Q for each partition*/ k 58 ompi/mca/topo/treematch/treematch/k-partitioning.c (*D)[i] = calloc(k, sizeof(double)); k 61 ompi/mca/topo/treematch/treematch/k-partitioning.c void initialization(int * const part, double ** const matrice, PriorityQueue * const Qpart, PriorityQueue * const Q, PriorityQueue * const Qinst, double ** const D, int n, int k, int * const deficit, int * const surplus) k 67 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_init(Qpart, k); k 71 ompi/mca/topo/treematch/treematch/k-partitioning.c for(i=0; i<k; ++i) k 76 ompi/mca/topo/treematch/treematch/k-partitioning.c PQ_init(&Qinst[i], k); k 90 ompi/mca/topo/treematch/treematch/k-partitioning.c for(j=0; j < k; ++j) /*and for each subset j*/ k 98 ompi/mca/topo/treematch/treematch/k-partitioning.c for(i=0; i < k; ++i) /*for each subset i*/ k 179 ompi/mca/topo/treematch/treematch/k-partitioning.c void destruction(PriorityQueue * Qpart, PriorityQueue * Q, PriorityQueue * Qinst, double ** D, int n, int k) k 183 ompi/mca/topo/treematch/treematch/k-partitioning.c for(i=0; i<k; ++i) k 198 ompi/mca/topo/treematch/treematch/k-partitioning.c int *kpartition_greedy2(int k, double **comm, int n, int nb_try_max, int *constraints, int nb_constraints) k 210 ompi/mca/topo/treematch/treematch/k-partitioning.c size = (int *)calloc(k,sizeof(int)); k 211 ompi/mca/topo/treematch/treematch/k-partitioning.c max_size = n/k; k 225 ompi/mca/topo/treematch/treematch/k-partitioning.c for ( i = 0 ; i < k ; ++i ){ k 301 ompi/mca/topo/treematch/treematch/k-partitioning.c int* build_p_vector(double **comm, int n, int k, int greedy_trials, int * constraints, int nb_constraints) k 306 ompi/mca/topo/treematch/treematch/k-partitioning.c part = kpartition_greedy2(k, comm, n, greedy_trials, constraints, nb_constraints); k 310 ompi/mca/topo/treematch/treematch/k-partitioning.c int * size = calloc(k, sizeof(int)); k 312 ompi/mca/topo/treematch/treematch/k-partitioning.c int nodes_per_part = n/k; k 334 ompi/mca/topo/treematch/treematch/k-partitioning.c j = (j+1)%k; /*and we change j to the next partition*/ k 18 ompi/mca/topo/treematch/treematch/k-partitioning.h int* kPartitioning(double ** comm, int n, int k, int * const constraints, int nb_constraints, int greedy_trials); k 117 ompi/mca/topo/treematch/treematch/tm_bucket.c int p,k; k 124 ompi/mca/topo/treematch/treematch/tm_bucket.c for( k = 0 ; k < bucket_list->max_depth ; k++){ k 143 ompi/mca/topo/treematch/treematch/tm_bucket.c int i,j,k; k 144 ompi/mca/topo/treematch/treematch/tm_bucket.c for( k = 0 ; k < b->nb_elem ; k++ ){ k 145 ompi/mca/topo/treematch/treematch/tm_bucket.c i = b->bucket[k].i; k 146 ompi/mca/topo/treematch/treematch/tm_bucket.c j = b->bucket[k].j; k 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); k 241 ompi/mca/topo/treematch/treematch/tm_bucket.c int n,i,k; k 250 ompi/mca/topo/treematch/treematch/tm_bucket.c k = 0; k 253 ompi/mca/topo/treematch/treematch/tm_bucket.c pivot_tree[i] = k++; k 293 ompi/mca/topo/treematch/treematch/tm_bucket.c int i,j,k,n,id; k 327 ompi/mca/topo/treematch/treematch/tm_bucket.c for( k = 0 ; k < n ; k++ ){ k 339 ompi/mca/topo/treematch/treematch/tm_bucket.c sample[2*k] = i; k 340 ompi/mca/topo/treematch/treematch/tm_bucket.c sample[2*k+1] = j; k 348 ompi/mca/topo/treematch/treematch/tm_bucket.c for(k=0;k<n;k++){ k 349 ompi/mca/topo/treematch/treematch/tm_bucket.c i=sample[2*k]; k 350 ompi/mca/topo/treematch/treematch/tm_bucket.c j=sample[2*k+1]; k 357 ompi/mca/topo/treematch/treematch/tm_bucket.c for( k = 1 ; k < nb_buckets ; k++ ){ k 365 ompi/mca/topo/treematch/treematch/tm_bucket.c pivot[k-1] = tab[i][j]; k 126 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int check_partition(SCOTCH_Num *parttab, int k, int n){ k 127 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *count = CALLOC(sizeof(int), k); k 133 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int target= n/k; k 135 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for(i = 0; i<k ; i++){ k 151 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition_scotch(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints){ k 152 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c SCOTCH_Num partnbr = (SCOTCH_Num) k; k 159 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *nb_dumb = (int *)MALLOC(sizeof(int) * k); /*number of dumb vertices per partition */ k 176 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < k ; i ++){ k 177 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int max_val = (i+1)* (n/k); k 188 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c nb_dumb[i] = n/k - (end-start); k 217 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for(i = 0 ; i < k ; i++){ k 224 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for(i = 0 ; i < k ; i++){ k 239 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(k>4) k 272 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); k 340 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition_greedy(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints) k 358 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c max_size = n/k; k 361 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("max_size = %d (n=%d,k=%d)\ncom_mat->n-1=%d\n",max_size,n,k,com_mat->n-1); k 378 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c size = (int *)CALLOC(k,sizeof(int)); k 387 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < k ; i ++){ k 388 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c max_val = (i+1)* (n/k); k 399 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c nb_dumb = n/k - (end-start); k 420 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for ( i = 0 ; i < k ; i ++ ){ k 463 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int *kpartition(int k, com_mat_t *com_mat, int n, int *constraints, int nb_constraints) k 467 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if( n%k != 0){ k 469 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr,"Error: Cannot partition %d elements in %d parts\n",n,k); k 482 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_scotch(k, com_mat, n, constraints, nb_constraints); k 486 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); k 491 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = kpartition_greedy(k, com_mat, n, constraints, nb_constraints); k 496 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c constraint_t *split_constraints (int *constraints, int nb_constraints, int k, tm_topology_t *topology, int depth, int N) k 503 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = (constraint_t *)CALLOC(k,sizeof(constraint_t)); k 515 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0; i < k; i++ ){ k 526 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c if(end-start > N/k){ k 528 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr, "Error in spliting constraint at step %d. N=%d k= %d, length = %d\n", i, N, k, end-start); k 542 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c com_mat_t **split_com_mat(com_mat_t *com_mat, int n, int k, int *partition) k 547 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int cur_part, i, ii, j, jj, m = n/k, s; k 549 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = (com_mat_t**)MALLOC(k*sizeof(com_mat_t *)); k 555 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("m=%d,n=%d,k=%d\n",m,n,k); k 560 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( cur_part = 0 ; cur_part < k ; cur_part ++ ){ k 576 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c fprintf(stderr,"too many elements of the partition for the permuation (s=%d>%d=m). n=%d, k=%d, cur_part= %d\n",s,m,n,k, cur_part); k 612 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int **split_vertices( int *vertices, int n, int k, int *partition) k 615 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int m = n/k; k 619 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c res = (int**) MALLOC(sizeof(int*) * k); k 628 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( cur_part = 0; cur_part < k ; cur_part ++){ k 643 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_com_mat(com_mat_t **mat,int k) k 649 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for ( i = 0 ; i < k ; i ++){ k 659 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_tab_local_vertices(int **mat, int k) k 665 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for ( i = 0 ; i < k ; i ++){ k 672 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c void free_const_tab(constraint_t *const_tab, int k) k 679 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for(i = 0; i < k; i++){ k 705 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c static void display_partition(int *partition, int *local_vertices, int n, int depth, int k){ k 708 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( cur_part = 0; cur_part < k ; cur_part ++){ k 726 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c int k = topology->arity[depth]; k 745 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c printf("Partitionning Matrix of size %d (problem size= %d) in %d partitions\n", com_mat->n, N, k); k 751 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c partition = kpartition(k, com_mat, N, constraints, nb_constraints); k 754 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c display_partition(partition, local_vertices, N, depth, k); k 758 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tab_com_mat = split_com_mat( com_mat, N, k, partition); k 761 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tab_local_vertices = split_vertices( local_vertices, N, k, partition); k 764 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c const_tab = split_constraints (constraints, nb_constraints, k, topology, depth, N); k 767 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c tab_child = (tm_tree_t **) CALLOC (k,sizeof(tm_tree_t*)); k 768 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < k ; i++){ k 773 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c for( i = 0 ; i < k ; i++){ k 775 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c kpartition_build_level_topology ( tab_child[i], tab_com_mat[i], N/k, depth + 1, k 783 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c set_node( cur_node, tab_child, k, NULL, cur_node->id, 0, NULL, depth); k 787 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c free_tab_com_mat(tab_com_mat,k); k 788 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c free_tab_local_vertices(tab_local_vertices,k); k 789 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c free_const_tab(const_tab,k); k 56 ompi/mca/topo/treematch/treematch/tm_mapping.c int *sigma, int nb_processes, int **k, int nb_compute_units); k 458 ompi/mca/topo/treematch/treematch/tm_mapping.c int *sigma, int nb_processes, int **k, int nb_compute_units) k 484 ompi/mca/topo/treematch/treematch/tm_mapping.c if(k){/*if we need the k vector*/ k 489 ompi/mca/topo/treematch/treematch/tm_mapping.c k[i][j] = -1; k 499 ompi/mca/topo/treematch/treematch/tm_mapping.c set_val(k[nodes_id[i/block_size]], proc_list[i], topology->oversub_fact); k 514 ompi/mca/topo/treematch/treematch/tm_mapping.c if((vl >= DEBUG) && (k)){ k 519 ompi/mca/topo/treematch/treematch/tm_mapping.c if( k[i][j] == -1) k 521 ompi/mca/topo/treematch/treematch/tm_mapping.c printf("%d ",k[i][j]); k 534 ompi/mca/topo/treematch/treematch/tm_mapping.c int *sigma, **k; k 540 ompi/mca/topo/treematch/treematch/tm_mapping.c k = (int**) MALLOC(sizeof(int*) * k_length); k 542 ompi/mca/topo/treematch/treematch/tm_mapping.c k[i] = (int*) MALLOC(sizeof(int) * topology->oversub_fact); k 545 ompi/mca/topo/treematch/treematch/tm_mapping.c map_topology(topology, comm_tree, topology->nb_levels-1, sigma, sigma_length ,k, k_length); k 549 ompi/mca/topo/treematch/treematch/tm_mapping.c solution->k = k; k 16 ompi/mca/topo/treematch/treematch/tm_mapping.h int *sigma, int nb_processes, int **k, int nb_compute_units); k 100 ompi/mca/topo/treematch/treematch/tm_mt.c int i, j, k; k 105 ompi/mca/topo/treematch/treematch/tm_mt.c for (k = (N > key_length ? N : key_length); k; --k) { k 117 ompi/mca/topo/treematch/treematch/tm_mt.c for (k = N - 1; k; --k) { k 39 ompi/mca/topo/treematch/treematch/tm_solution.c if(sol->k) k 41 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol->k[i]); k 43 ompi/mca/topo/treematch/treematch/tm_solution.c FREE(sol->k); k 210 ompi/mca/topo/treematch/treematch/tm_solution.c int **k = sol->k; k 216 ompi/mca/topo/treematch/treematch/tm_solution.c if(k[i][0] != -1){ k 219 ompi/mca/topo/treematch/treematch/tm_solution.c if( k[i][j] == -1) k 221 ompi/mca/topo/treematch/treematch/tm_solution.c printf("%d ",k[i][j]); k 90 ompi/mca/topo/treematch/treematch/tm_tree.c double choose (long n, long k) k 96 ompi/mca/topo/treematch/treematch/tm_tree.c for( i = 0 ; i < k ; i++ ){ k 97 ompi/mca/topo/treematch/treematch/tm_tree.c res *= ((double)(n-i)/(double)(k-i)); k 513 ompi/mca/topo/treematch/treematch/tm_tree.c int i, j, k; k 520 ompi/mca/topo/treematch/treematch/tm_tree.c for( k = 0 ; k < arity ; k++ ) k 521 ompi/mca/topo/treematch/treematch/tm_tree.c if(elem->tab[i]->id == selection[j]->tab[k]->id) k 1590 ompi/mca/topo/treematch/treematch/tm_tree.c int i,j,k; k 1605 ompi/mca/topo/treematch/treematch/tm_tree.c for( k = 0 ; k < n ; k++){ k 1606 ompi/mca/topo/treematch/treematch/tm_tree.c i = partition[k]; k 1609 ompi/mca/topo/treematch/treematch/tm_tree.c new_tab_node[i].child[j] = &tab_node[k]; k 100 ompi/mca/topo/treematch/treematch/treematch.h int **k; k 45 ompi/patterns/net/netpatterns.h #define FIND_BASE(base,myid,level,k) \ k 53 ompi/patterns/net/netpatterns.h temp *= k; \ k 102 ompi/runtime/ompi_cr.c int k; \ k 106 ompi/runtime/ompi_cr.c for (k = 0 ; k < highest_module ; ++k) { \ k 107 ompi/runtime/ompi_cr.c if (my_module == modules[k]) found = true; \ k 265 opal/mca/btl/tcp/btl_tcp_proc.c static void visit(mca_btl_tcp_proc_data_t *proc_data, int k, int level, int siz, int *a) k 267 opal/mca/btl/tcp/btl_tcp_proc.c level = level+1; a[k] = level; k 278 opal/mca/btl/tcp/btl_tcp_proc.c level = level-1; a[k] = 0; k 1000 opal/mca/event/libevent2022/libevent/evdns.c int j = 0, k = 0; /* index into packet */ k 1048 opal/mca/event/libevent2022/libevent/evdns.c k = j; \ k 1052 opal/mca/event/libevent2022/libevent/evdns.c if (name_parse(req->request, req->request_len, &k, \ k 3752 opal/mca/event/libevent2022/libevent/evdns.c #define TRY(k, name) \ k 3753 opal/mca/event/libevent2022/libevent/evdns.c if (!found && config_nameserver_from_reg_key(base,k,TEXT(name)) == 0) { \ k 3754 opal/mca/event/libevent2022/libevent/evdns.c log(EVDNS_LOG_DEBUG,"Found nameservers in %s/%s",#k,name); \ k 3758 opal/mca/event/libevent2022/libevent/evdns.c #k,#name); \ k 898 opal/mca/event/libevent2022/libevent/event.c int i = 0, k; k 911 opal/mca/event/libevent2022/libevent/event.c for (k = 0, i = 0; ompi_eventops[k] != NULL; ++k) { k 912 opal/mca/event/libevent2022/libevent/event.c tmp[i++] = ompi_eventops[k]->name; k 1980 opal/mca/event/libevent2022/libevent/test/regress.c static void setenv(const char *k, const char *v, int _o) k 1983 opal/mca/event/libevent2022/libevent/test/regress.c evutil_snprintf(b, sizeof(b), "%s=%s",k,v); k 1992 opal/mca/event/libevent2022/libevent/test/regress.c static void unsetenv(const char *k) k 1995 opal/mca/event/libevent2022/libevent/test/regress.c evutil_snprintf(b, sizeof(b), "%s=",k); k 829 opal/mca/event/libevent2022/libevent/test/regress_util.c int i, j, k, n=0; k 834 opal/mca/event/libevent2022/libevent/test/regress_util.c for (k=0;k<32;++k) { k 492 opal/mca/hwloc/base/hwloc_base_util.c unsigned k; k 502 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < obj->arity; k++) { k 503 opal/mca/hwloc/base/hwloc_base_util.c free_object(obj->children[k]); k 511 opal/mca/hwloc/base/hwloc_base_util.c unsigned k; k 524 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < obj->arity; k++) { k 525 opal/mca/hwloc/base/hwloc_base_util.c free_object(obj->children[k]); k 913 opal/mca/hwloc/base/hwloc_base_util.c unsigned k; k 922 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < start->arity; k++) { k 923 opal/mca/hwloc/base/hwloc_base_util.c df_clear(topo, start->children[k]); k 930 opal/mca/hwloc/base/hwloc_base_util.c unsigned k; k 943 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; k < root->arity; k++) { k 944 opal/mca/hwloc/base/hwloc_base_util.c df_clear(topo, root->children[k]); k 1111 opal/mca/hwloc/base/hwloc_base_util.c int rc, i, j, k; k 1188 opal/mca/hwloc/base/hwloc_base_util.c for (k=0; NULL != rngs[k]; k++) { k 1190 opal/mca/hwloc/base/hwloc_base_util.c range = opal_argv_split(rngs[k], '-'); k 710 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c unsigned i,j,k; k 749 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c for(k=0; k<nbobjs; k++) k 750 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c if (!groupids[k] && !hwloc_compare_values(VALUE(j, k), min_distance, accuracy)) { k 751 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c groupids[k] = groupid; k 754 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c newfirstfound = k; k 756 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c hwloc_debug(" object %u is minimally connected to %u\n", k, i); k 758 opal/mca/hwloc/hwloc201/hwloc/hwloc/distances.c hwloc_debug(" object %u is minimally connected to %u through %u\n", k, i, j); k 860 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c unsigned j,k; k 869 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c for(k=0; k<Pproc_max; k++) k 870 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c if (Pproc[k].Lpkg == j) k 871 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c hwloc_bitmap_set(obj->cpuset, k); k 883 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c unsigned k; k 885 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c for(k=0; k<Pproc_max; k++) k 886 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c if (Pproc[k].Lcore == j) k 887 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c hwloc_bitmap_set(cpuset, k); k 928 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c unsigned j,k; k 933 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c for(k=0; k<Pproc_max; k++) k 934 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c if (Pproc[k].Lproc == j) k 935 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-solaris.c hwloc_bitmap_set(obj->cpuset, k); k 2168 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c unsigned k = logical_to_v2array[i]*nbobjs+logical_to_v2array[j]; k 2171 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology-xml.c sprintf(tmp, "%f", (float) dist->values[k]); k 2260 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c unsigned k; k 2270 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c for(k=0; k<parent->arity; k++) k 2271 opal/mca/hwloc/hwloc201/hwloc/hwloc/topology.c parent->children[k]->parent = parent; k 556 opal/mca/pmix/ext1x/pmix1x_server_north.c size_t k, n; k 579 opal/mca/pmix/ext1x/pmix1x_server_north.c for (k=0; k < ninfo; k++) { k 582 opal/mca/pmix/ext1x/pmix1x_server_north.c oinfo->key = strdup(job_info[k].key); k 583 opal/mca/pmix/ext1x/pmix1x_server_north.c if (OPAL_SUCCESS != (rc = pmix1_value_unload(oinfo, &job_info[k].value))) { k 603 opal/mca/pmix/ext1x/pmix1x_server_north.c for (k=0; k < apps[n].ninfo; k++) { k 606 opal/mca/pmix/ext1x/pmix1x_server_north.c oinfo->key = strdup(apps[n].info[k].key); k 607 opal/mca/pmix/ext1x/pmix1x_server_north.c if (OPAL_SUCCESS != (rc = pmix1_value_unload(oinfo, &apps[n].info[k].value))) { k 632 opal/mca/pmix/ext2x/ext2x_server_north.c size_t k, n; k 651 opal/mca/pmix/ext2x/ext2x_server_north.c for (k=0; k < ninfo; k++) { k 654 opal/mca/pmix/ext2x/ext2x_server_north.c oinfo->key = strdup(job_info[k].key); k 655 opal/mca/pmix/ext2x/ext2x_server_north.c if (OPAL_SUCCESS != (rc = ext2x_value_unload(oinfo, &job_info[k].value))) { k 678 opal/mca/pmix/ext2x/ext2x_server_north.c for (k=0; k < apps[n].ninfo; k++) { k 681 opal/mca/pmix/ext2x/ext2x_server_north.c oinfo->key = strdup(apps[n].info[k].key); k 682 opal/mca/pmix/ext2x/ext2x_server_north.c if (OPAL_SUCCESS != (rc = ext2x_value_unload(oinfo, &apps[n].info[k].value))) { k 647 opal/mca/pmix/ext3x/ext3x_server_north.c size_t k, n; k 666 opal/mca/pmix/ext3x/ext3x_server_north.c for (k=0; k < ninfo; k++) { k 669 opal/mca/pmix/ext3x/ext3x_server_north.c oinfo->key = strdup(job_info[k].key); k 670 opal/mca/pmix/ext3x/ext3x_server_north.c if (OPAL_SUCCESS != (rc = ext3x_value_unload(oinfo, &job_info[k].value))) { k 693 opal/mca/pmix/ext3x/ext3x_server_north.c for (k=0; k < apps[n].ninfo; k++) { k 696 opal/mca/pmix/ext3x/ext3x_server_north.c oinfo->key = strdup(apps[n].info[k].key); k 697 opal/mca/pmix/ext3x/ext3x_server_north.c if (OPAL_SUCCESS != (rc = ext3x_value_unload(oinfo, &apps[n].info[k].value))) { k 99 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi_intra_perf.c int i, k; k 100 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi_intra_perf.c for(i = 0, k = 0; i < size && k < (size - local_cnt); i++ ){ k 109 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi_intra_perf.c remote_ranks[k] = i; k 110 opal/mca/pmix/pmix4x/pmix/contrib/perf_tools/pmi_intra_perf.c k++; k 83 opal/mca/pmix/pmix4x/pmix/examples/client2.c uint32_t nprocs, n, k; k 201 opal/mca/pmix/pmix4x/pmix/examples/client2.c for (k=0; k < 32; k++) { k 202 opal/mca/pmix/pmix4x/pmix/examples/client2.c if (PMIX_UINT64 != vptr[k].type) { k 204 opal/mca/pmix/pmix4x/pmix/examples/client2.c myproc.nspace, myproc.rank, proc.rank, vptr[k].type); k 208 opal/mca/pmix/pmix4x/pmix/examples/client2.c if (2*k != vptr[k].data.uint64) { k 210 opal/mca/pmix/pmix4x/pmix/examples/client2.c myproc.nspace, myproc.rank, proc.rank, (unsigned long)vptr[k].data.uint64); k 215 opal/mca/pmix/pmix4x/pmix/examples/server.c int rc, nprocs=1, n, k; k 281 opal/mca/pmix/pmix4x/pmix/examples/server.c for (k=n+2; NULL != argv[k]; k++) { k 282 opal/mca/pmix/pmix4x/pmix/examples/server.c pmix_argv_append_nosize(&client_argv, argv[k]); k 284 opal/mca/pmix/pmix4x/pmix/examples/server.c n += k; k 718 opal/mca/pmix/pmix4x/pmix/src/client/pmi1.c int i, k; k 749 opal/mca/pmix/pmix4x/pmix/src/client/pmi1.c for (k = 0; k < preput_keyval_size; k++) { k 750 opal/mca/pmix/pmix4x/pmix/src/client/pmi1.c if (0 > asprintf(&evar, "%s=%s", preput_keyval_vector[k].key, preput_keyval_vector[k].val)) { k 204 opal/mca/pmix/pmix4x/pmix/src/client/pmi2.c int i, k; k 233 opal/mca/pmix/pmix4x/pmix/src/client/pmi2.c for (k=0; k < preput_keyval_size; k++) { k 445 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c int j, k, starttaglen, endtaglen, num_buffered; k 565 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0, k=0; j < starttaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 566 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = starttag[j]; k 571 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (i=0; i < bo->size && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; i++) { k 574 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (k+5 >= PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 579 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < (int)strlen(qprint) && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 580 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = qprint[j]; k 583 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (k+4 >= PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 588 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < (int)strlen(qprint) && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 589 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = qprint[j]; k 592 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (k+4 >= PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 597 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < (int)strlen(qprint) && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 598 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = qprint[j]; k 602 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (k+7 >= PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 607 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < (int)strlen(qprint) && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 608 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = qprint[j]; k 611 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if ('\n' == bo->bytes[i] && (k+endtaglen+1) < PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 613 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < endtaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 614 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = endtag[j]; k 617 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = '\n'; k 619 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (i < bo->size-1 && (k+starttaglen) < PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 620 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < starttaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 621 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = starttag[j]; k 629 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = bo->bytes[i]; k 634 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < endtaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 635 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = endtag[j]; k 638 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = '\n'; k 641 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < starttaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX; j++) { k 642 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = starttag[j]; k 649 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = bo->bytes[i]; k 653 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c if (!endtagged && k < PMIX_IOF_BASE_TAGGED_OUT_MAX) { k 655 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c for (j=0; j < endtaglen && k < PMIX_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 656 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k++] = endtag[j]; k 658 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->data[k] = '\n'; k 660 opal/mca/pmix/pmix4x/pmix/src/common/pmix_iof.c output->numbytes = k; k 173 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c static void kvcon(pmix_kval_t *k) k 175 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c k->key = NULL; k 176 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c k->value = NULL; k 178 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c static void kvdes(pmix_kval_t *k) k 180 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c if (NULL != k->key) { k 181 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c free(k->key); k 183 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c if (NULL != k->value) { k 184 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_frame.c PMIX_VALUE_RELEASE(k->value); k 827 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_unpack.c int32_t i, k, n, m; k 854 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_unpack.c for (k=0; k < nval; k++) { k 873 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/base/bfrop_base_unpack.c for (k=0; k < nval; k++) { k 451 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/bfrops.h #define PMIX_BFROPS_VALUE_UNLOAD(r, p, k, d, s) \ k 452 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/bfrops.h (r) = (p)->nptr->compat.bfrops->value_unload(k,, d, s) k 907 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v12/unpack.c int32_t i, k, n, m; k 933 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v12/unpack.c for (k=0; k < argc; k++) { k 950 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v12/unpack.c for (k=0; k < nval; k++) { k 977 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v20/unpack.c int32_t i, k, n, m; k 1002 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v20/unpack.c for (k=0; k < nval; k++) { k 1019 opal/mca/pmix/pmix4x/pmix/src/mca/bfrops/v20/unpack.c for (k=0; k < nval; k++) { k 85 opal/mca/pmix/pmix4x/pmix/src/mca/gds/gds.h #define PMIX_GDS_ASSEMB_KVS_REQ(s, p, r, k, b, c) \ k 93 opal/mca/pmix/pmix4x/pmix/src/mca/gds/gds.h (s) = _g->assemb_kvs_req(r, k, b, (void*)c); \ k 218 opal/mca/pmix/pmix4x/pmix/src/mca/gds/gds.h #define PMIX_GDS_STORE_KV(s, p, pc, sc, k) \ k 224 opal/mca/pmix/pmix4x/pmix/src/mca/gds/gds.h (s) = _g->store(pc, sc, k); \ k 76 opal/mca/pmix/pmix4x/pmix/src/mca/plog/base/plog_base_stubs.c size_t n, k; k 141 opal/mca/pmix/pmix4x/pmix/src/mca/plog/base/plog_base_stubs.c for (k=0; NULL != active->module->channels[k]; k++) { k 142 opal/mca/pmix/pmix4x/pmix/src/mca/plog/base/plog_base_stubs.c if (NULL != strstr(data[n].key, active->module->channels[k])) { k 677 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c int i, j, k, len; k 762 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c for (k=j+1; k < len && base[k] != ','; k++); k 763 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c if (k < len) { k 764 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c base[k] = '\0'; k 767 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c if (k < len) { k 768 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c base[k] = ','; k 770 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c j = k-1; k 876 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c size_t i, k, start, end; k 952 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c for (k=0; k < (size_t)num_digits; k++) { k 953 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c str[k+base_len] = '0'; k 957 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c for (k=0; k < strlen(tmp); k++) { k 958 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c str[base_len + num_digits - k - 1] = tmp[strlen(tmp)-k-1]; k 980 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c int i, j, k, start, end; k 999 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c for (k=start; k <= end; k++) { k 1000 opal/mca/pmix/pmix4x/pmix/src/mca/preg/native/preg_native.c if (0 > asprintf(&t, "%d", k)) { k 1846 opal/mca/pmix/pmix4x/pmix/src/server/pmix_server_ops.c size_t k, n; k 1867 opal/mca/pmix/pmix4x/pmix/src/server/pmix_server_ops.c for (k=0; k < scd->ncodes; k++) { k 1868 opal/mca/pmix/pmix4x/pmix/src/server/pmix_server_ops.c if (scd->codes[k] == cd->status) { k 553 opal/mca/pmix/pmix4x/pmix/src/tools/pmix_info/support.c int i, j, k, len, ret; k 576 opal/mca/pmix/pmix4x/pmix/src/tools/pmix_info/support.c for (k = 0; k < count; ++k) { k 577 opal/mca/pmix/pmix4x/pmix/src/tools/pmix_info/support.c type = pmix_cmd_line_get_param(pmix_info_cmd_line, p, k, 0); k 335 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c int rc, nprocs=1, n, k; k 374 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c for (k=n+2; NULL != argv[k]; k++) { k 375 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c pmix_argv_append_nosize(&client_argv, argv[k]); k 377 opal/mca/pmix/pmix4x/pmix/test/simple/simptest.c n += k; k 216 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c int rc, nprocs=1, n, k; k 250 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c for (k=n+2; NULL != argv[k]; k++) { k 251 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c pmix_argv_append_nosize(&client_argv, argv[k]); k 253 opal/mca/pmix/pmix4x/pmix/test/simple/stability.c n += k; k 378 opal/mca/pmix/pmix4x/pmix/test/test_fence.c pmix_rank_t k; k 379 opal/mca/pmix/pmix4x/pmix/test/test_fence.c for(k=0; k<npeers; k++){ k 380 opal/mca/pmix/pmix4x/pmix/test/test_fence.c if( peers[k] == i+params.base_rank){ k 646 opal/mca/pmix/pmix4x/pmix4x_server_north.c size_t k, n; k 665 opal/mca/pmix/pmix4x/pmix4x_server_north.c for (k=0; k < ninfo; k++) { k 668 opal/mca/pmix/pmix4x/pmix4x_server_north.c oinfo->key = strdup(job_info[k].key); k 669 opal/mca/pmix/pmix4x/pmix4x_server_north.c if (OPAL_SUCCESS != (rc = pmix4x_value_unload(oinfo, &job_info[k].value))) { k 692 opal/mca/pmix/pmix4x/pmix4x_server_north.c for (k=0; k < apps[n].ninfo; k++) { k 695 opal/mca/pmix/pmix4x/pmix4x_server_north.c oinfo->key = strdup(apps[n].info[k].key); k 696 opal/mca/pmix/pmix4x/pmix4x_server_north.c if (OPAL_SUCCESS != (rc = pmix4x_value_unload(oinfo, &apps[n].info[k].value))) { k 568 opal/runtime/opal_info_support.c int i, j, k, len, ret; k 591 opal/runtime/opal_info_support.c for (k = 0; k < count; ++k) { k 592 opal/runtime/opal_info_support.c type = opal_cmd_line_get_param(opal_info_cmd_line, p, k, 0); k 51 opal/util/uri.c size_t i, j, k, n; k 81 opal/util/uri.c for (k=0; k < strlen(filename)-1; k++) { k 83 opal/util/uri.c if (filename[k] == uri_reserved_path_chars[j]) { k 89 opal/util/uri.c fn[i] = filename[k]; k 55 orte/mca/iof/base/iof_base_output.c int i, j, k, starttaglen, endtaglen, num_buffered; k 157 orte/mca/iof/base/iof_base_output.c for (j=0, k=0; j < starttaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 158 orte/mca/iof/base/iof_base_output.c output->data[k++] = starttag[j]; k 163 orte/mca/iof/base/iof_base_output.c for (i=0; i < numbytes && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; i++) { k 166 orte/mca/iof/base/iof_base_output.c if (k+5 >= ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 171 orte/mca/iof/base/iof_base_output.c for (j=0; j < (int)strlen(qprint) && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 172 orte/mca/iof/base/iof_base_output.c output->data[k++] = qprint[j]; k 175 orte/mca/iof/base/iof_base_output.c if (k+4 >= ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 180 orte/mca/iof/base/iof_base_output.c for (j=0; j < (int)strlen(qprint) && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 181 orte/mca/iof/base/iof_base_output.c output->data[k++] = qprint[j]; k 184 orte/mca/iof/base/iof_base_output.c if (k+4 >= ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 189 orte/mca/iof/base/iof_base_output.c for (j=0; j < (int)strlen(qprint) && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 190 orte/mca/iof/base/iof_base_output.c output->data[k++] = qprint[j]; k 194 orte/mca/iof/base/iof_base_output.c if (k+7 >= ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 199 orte/mca/iof/base/iof_base_output.c for (j=0; j < (int)strlen(qprint) && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 200 orte/mca/iof/base/iof_base_output.c output->data[k++] = qprint[j]; k 203 orte/mca/iof/base/iof_base_output.c if ('\n' == data[i] && (k+endtaglen+1) < ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 205 orte/mca/iof/base/iof_base_output.c for (j=0; j < endtaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 206 orte/mca/iof/base/iof_base_output.c output->data[k++] = endtag[j]; k 209 orte/mca/iof/base/iof_base_output.c output->data[k++] = '\n'; k 211 orte/mca/iof/base/iof_base_output.c if (i < numbytes-1 && (k+starttaglen) < ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 212 orte/mca/iof/base/iof_base_output.c for (j=0; j < starttaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 213 orte/mca/iof/base/iof_base_output.c output->data[k++] = starttag[j]; k 221 orte/mca/iof/base/iof_base_output.c output->data[k++] = data[i]; k 226 orte/mca/iof/base/iof_base_output.c for (j=0; j < endtaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 227 orte/mca/iof/base/iof_base_output.c output->data[k++] = endtag[j]; k 230 orte/mca/iof/base/iof_base_output.c output->data[k++] = '\n'; k 233 orte/mca/iof/base/iof_base_output.c for (j=0; j < starttaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX; j++) { k 234 orte/mca/iof/base/iof_base_output.c output->data[k++] = starttag[j]; k 241 orte/mca/iof/base/iof_base_output.c output->data[k++] = data[i]; k 245 orte/mca/iof/base/iof_base_output.c if (!endtagged && k < ORTE_IOF_BASE_TAGGED_OUT_MAX) { k 247 orte/mca/iof/base/iof_base_output.c for (j=0; j < endtaglen && k < ORTE_IOF_BASE_TAGGED_OUT_MAX-1; j++) { k 248 orte/mca/iof/base/iof_base_output.c output->data[k++] = endtag[j]; k 250 orte/mca/iof/base/iof_base_output.c output->data[k] = '\n'; k 252 orte/mca/iof/base/iof_base_output.c output->numbytes = k; k 57 orte/mca/ras/simulator/ras_sim_module.c unsigned j, k; k 159 orte/mca/ras/simulator/ras_sim_module.c for (k=0; k < obj->infos_count; k++) { k 160 orte/mca/ras/simulator/ras_sim_module.c if (NULL == obj->infos[k].name || k 161 orte/mca/ras/simulator/ras_sim_module.c NULL == obj->infos[k].value) { k 164 orte/mca/ras/simulator/ras_sim_module.c if (0 == strncmp(obj->infos[k].name, "HostName", strlen("HostName"))) { k 165 orte/mca/ras/simulator/ras_sim_module.c free(obj->infos[k].name); k 166 orte/mca/ras/simulator/ras_sim_module.c free(obj->infos[k].value); k 168 orte/mca/ras/simulator/ras_sim_module.c for (j=k; j < obj->infos_count-1; j++) { k 219 orte/mca/ras/simulator/ras_sim_module.c for (k=0; k < obj->infos_count; k++) { k 220 orte/mca/ras/simulator/ras_sim_module.c if (NULL == obj->infos[k].name || k 221 orte/mca/ras/simulator/ras_sim_module.c NULL == obj->infos[k].value) { k 224 orte/mca/ras/simulator/ras_sim_module.c if (0 == strncmp(obj->infos[k].name, "HostName", strlen("HostName"))) { k 225 orte/mca/ras/simulator/ras_sim_module.c free(obj->infos[k].name); k 226 orte/mca/ras/simulator/ras_sim_module.c free(obj->infos[k].value); k 228 orte/mca/ras/simulator/ras_sim_module.c for (j=k; j < obj->infos_count-1; j++) { k 739 orte/mca/rmaps/base/rmaps_base_ranking.c int j, k; k 770 orte/mca/rmaps/base/rmaps_base_ranking.c for (k=0; k < node->procs->size; k++) { k 772 orte/mca/rmaps/base/rmaps_base_ranking.c if (NULL == opal_pointer_array_get_item(node->procs, k)) { k 821 orte/mca/rmaps/base/rmaps_base_ranking.c k=0; k 830 orte/mca/rmaps/base/rmaps_base_ranking.c proc->app_rank = k++; k 846 orte/mca/rmaps/base/rmaps_base_ranking.c int k; k 867 orte/mca/rmaps/base/rmaps_base_ranking.c for (k=0; k < newnode->procs->size; k++) { k 869 orte/mca/rmaps/base/rmaps_base_ranking.c if (NULL == (proc = (orte_proc_t *) opal_pointer_array_get_item(newnode->procs, k))) { k 881 orte/mca/rmaps/base/rmaps_base_ranking.c for (k=0; k < newnode->procs->size; k++) { k 883 orte/mca/rmaps/base/rmaps_base_ranking.c if (NULL == (proc = (orte_proc_t *) opal_pointer_array_get_item(newnode->procs, k))) { k 62 orte/mca/rmaps/mindist/rmaps_mindist_module.c unsigned int k; k 367 orte/mca/rmaps/mindist/rmaps_mindist_module.c for (k = 0; (k < required) && (nprocs_mapped < app->num_procs); k++) { k 445 orte/mca/rmaps/mindist/rmaps_mindist_module.c int j, k, m, n, npus; k 515 orte/mca/rmaps/mindist/rmaps_mindist_module.c for (k = j; k < node->procs->size && 0 < npus; k++) { k 516 orte/mca/rmaps/mindist/rmaps_mindist_module.c if (NULL == (proc = (orte_proc_t*)opal_pointer_array_get_item(node->procs, k))) { k 524 orte/mca/rmaps/mindist/rmaps_mindist_module.c "mca:rmaps:mindist: assigning proc %d to numa %d", k, numa->index); k 417 orte/mca/rmaps/ppr/rmaps_ppr.c unsigned k; k 423 orte/mca/rmaps/ppr/rmaps_ppr.c for (k=0; k < obj->arity; k++) { k 424 orte/mca/rmaps/ppr/rmaps_ppr.c nxt = find_split(topo, obj->children[k]); k 444 orte/mca/rmaps/ppr/rmaps_ppr.c unsigned cache_level = 0, k; k 552 orte/mca/rmaps/ppr/rmaps_ppr.c for (k=0; k < top->arity && limit < nprocs; k++) { k 569 orte/mca/rmaps/ppr/rmaps_ppr.c if (hwloc_bitmap_intersects(top->children[k]->cpuset, locale->cpuset)) { k 581 orte/mca/rmaps/ppr/rmaps_ppr.c k, nunder, nmax); k 79 orte/mca/rmaps/rank_file/rmaps_rank_file.c orte_std_cntr_t i, k; k 208 orte/mca/rmaps/rank_file/rmaps_rank_file.c for (k=0; k < app->num_procs; k++) { k 209 orte/mca/rmaps/rank_file/rmaps_rank_file.c rank = vpid_start + k; k 229 orte/mca/rmaps/rank_file/rmaps_rank_file.c k = UINT32_MAX; k 231 orte/mca/rmaps/rank_file/rmaps_rank_file.c if (nd->num_procs < (orte_vpid_t)k) { k 232 orte/mca/rmaps/rank_file/rmaps_rank_file.c k = nd->num_procs; k 323 orte/mca/rmaps/resilient/rmaps_resilient.c int i, k; k 351 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < opal_argv_count(nodes); k++) { k 357 orte/mca/rmaps/resilient/rmaps_resilient.c if (0 == strcmp(node->name, nodes[k])) { k 385 orte/mca/rmaps/resilient/rmaps_resilient.c int k, totnodes; k 407 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < ftgrp->nodes.size; k++) { k 408 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (node = (orte_node_t*)opal_pointer_array_get_item(&ftgrp->nodes, k))) { k 428 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < ftgrp->nodes.size; k++) { k 429 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (node = (orte_node_t*)opal_pointer_array_get_item(&ftgrp->nodes, k))) { k 457 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < target->nodes.size; k++) { k 458 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (node = (orte_node_t*)opal_pointer_array_get_item(&target->nodes, k))) { k 668 orte/mca/rmaps/resilient/rmaps_resilient.c int k; k 684 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < ftgrp->nodes.size; k++) { k 685 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (nd = (orte_node_t*)opal_pointer_array_get_item(&ftgrp->nodes, k))) { k 701 orte/mca/rmaps/resilient/rmaps_resilient.c int i, j, k, totnodes; k 794 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < ftgrp->nodes.size; k++) { k 795 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (node = (orte_node_t*)opal_pointer_array_get_item(&ftgrp->nodes, k))) { k 828 orte/mca/rmaps/resilient/rmaps_resilient.c for (k=0; k < target->nodes.size; k++) { k 829 orte/mca/rmaps/resilient/rmaps_resilient.c if (NULL == (node = (orte_node_t*)opal_pointer_array_get_item(&target->nodes, k))) { k 560 orte/mca/schizo/ompi/schizo_ompi.c int i, j, k; k 631 orte/mca/schizo/ompi/schizo_ompi.c for (k=0; NULL != no_dups[k]; k++) { k 632 orte/mca/schizo/ompi/schizo_ompi.c if (0 == strcmp(no_dups[k], argv[i+1])) { k 971 orte/orted/orted_main.c int j, k; k 987 orte/orted/orted_main.c for (k=0; NULL != no_keep[k]; k++) { k 988 orte/orted/orted_main.c if (0 == strcmp(no_keep[k], argv[i+1])) { k 492 orte/orted/pmix/pmix_server_gen.c int rc = ORTE_SUCCESS, i, k, num_replies; k 737 orte/orted/pmix/pmix_server_gen.c for (k=0; k < jdata->procs->size; k++) { k 738 orte/orted/pmix/pmix_server_gen.c if (NULL == (proct = (orte_proc_t*)opal_pointer_array_get_item(jdata->procs, k))) { k 786 orte/orted/pmix/pmix_server_gen.c for (k=0; k < jdata->procs->size; k++) { k 787 orte/orted/pmix/pmix_server_gen.c if (NULL == (proct = (orte_proc_t*)opal_pointer_array_get_item(jdata->procs, k))) { k 61 orte/orted/pmix/pmix_server_register_fns.c int i, k, n; k 135 orte/orted/pmix/pmix_server_register_fns.c for (k=0; k < node->procs->size; k++) { k 136 orte/orted/pmix/pmix_server_register_fns.c if (NULL != (pptr = (orte_proc_t*)opal_pointer_array_get_item(node->procs, k))) { k 64 orte/runtime/data_type_support/orte_dt_unpacking_fns.c int32_t i, k, n, count, bookmark; k 105 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 125 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 142 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 271 orte/runtime/data_type_support/orte_dt_unpacking_fns.c int32_t i, n, k, count; k 335 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 356 orte/runtime/data_type_support/orte_dt_unpacking_fns.c int32_t i, n, count, k; k 434 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 456 orte/runtime/data_type_support/orte_dt_unpacking_fns.c int32_t i, max_n=1, count, k; k 565 orte/runtime/data_type_support/orte_dt_unpacking_fns.c for (k=0; k < count; k++) { k 187 orte/runtime/orte_data_server.c int rc, ret, k; k 450 orte/runtime/orte_data_server.c for (k=0; k < orte_data_server_store.size; k++) { k 452 orte/runtime/orte_data_server.c data = (orte_data_object_t*)opal_pointer_array_get_item(&orte_data_server_store, k); k 619 orte/runtime/orte_data_server.c for (k=0; k < orte_data_server_store.size; k++) { k 620 orte/runtime/orte_data_server.c data = (orte_data_object_t*)opal_pointer_array_get_item(&orte_data_server_store, k); k 646 orte/runtime/orte_data_server.c opal_pointer_array_set_item(&orte_data_server_store, k, NULL); k 677 orte/runtime/orte_data_server.c for (k=0; k < orte_data_server_store.size; k++) { k 678 orte/runtime/orte_data_server.c data = (orte_data_object_t*)opal_pointer_array_get_item(&orte_data_server_store, k); k 694 orte/runtime/orte_data_server.c opal_pointer_array_set_item(&orte_data_server_store, k, NULL); k 36 orte/test/mpi/crisscross.c int i,j,k,m,count,mismatch; k 134 orte/test/mpi/crisscross.c for ( k=0; k<n_bytes; k++ ) k 136 orte/test/mpi/crisscross.c recv_buff[k] = 0x80; k 150 orte/test/mpi/crisscross.c for ( k=0; k<n_loops+warmup; k++ ) k 154 orte/test/mpi/crisscross.c if (k == warmup) et1 = MPI_Wtime(); k 172 orte/test/mpi/crisscross.c if (k == n_loops+warmup-1) et2 = MPI_Wtime(); k 210 orte/test/mpi/crisscross.c for ( k=0; k<n_bytes; k++ ) k 212 orte/test/mpi/crisscross.c if ( recv_buff[k] != k%128 ) mismatch++; k 11 orte/test/mpi/reduce-hang.c int k; k 22 orte/test/mpi/reduce-hang.c for (k=0; k < (7-self)*1000; k++) { k 51 orte/test/system/opal_hwloc.c unsigned j, k; k 90 orte/test/system/opal_hwloc.c for (k=0; k < obj->infos_count; k++) { k 91 orte/test/system/opal_hwloc.c if (NULL == obj->infos[k].name || k 92 orte/test/system/opal_hwloc.c NULL == obj->infos[k].value) { k 95 orte/test/system/opal_hwloc.c if (0 == strncmp(obj->infos[k].name, "HostName", strlen("HostName"))) { k 96 orte/test/system/opal_hwloc.c free(obj->infos[k].name); k 97 orte/test/system/opal_hwloc.c free(obj->infos[k].value); k 99 orte/test/system/opal_hwloc.c for (j=k; j < obj->infos_count-1; j++) { k 109 orte/test/system/orte_dfs.c int i, k, cnt; k 222 orte/test/system/orte_dfs.c for (k=0; k < nvpids; k++) { k 84 orte/util/dash_host/dash_host.c orte_std_cntr_t i, j, k; k 109 orte/util/dash_host/dash_host.c for (k = 0; NULL != mini_map[k]; ++k) { k 111 orte/util/dash_host/dash_host.c mini_map[k]); k 151 orte/util/dash_host/dash_host.c for (k=0; 0 < j && k < orte_node_pool->size; k++) { k 152 orte/util/dash_host/dash_host.c if (NULL != (node = (orte_node_t*)opal_pointer_array_get_item(orte_node_pool, k))) { k 357 orte/util/dash_host/dash_host.c orte_std_cntr_t j, k; k 370 orte/util/dash_host/dash_host.c for (k = 0; NULL != mini_map[k]; ++k) { k 371 orte/util/dash_host/dash_host.c if ('+' == mini_map[k][0]) { k 373 orte/util/dash_host/dash_host.c if ('e' == mini_map[k][1] || k 374 orte/util/dash_host/dash_host.c 'E' == mini_map[k][1]) { k 378 orte/util/dash_host/dash_host.c if (NULL != (cptr = strchr(mini_map[k], ':'))) { k 386 orte/util/dash_host/dash_host.c } else if ('n' == mini_map[k][1] || k 387 orte/util/dash_host/dash_host.c 'N' == mini_map[k][1]) { k 391 orte/util/dash_host/dash_host.c nodeidx = strtol(&mini_map[k][2], NULL, 10); k 396 orte/util/dash_host/dash_host.c true, nodeidx, mini_map[k]); k 412 orte/util/dash_host/dash_host.c true, nodeidx, mini_map[k]); k 421 orte/util/dash_host/dash_host.c true, mini_map[k]); k 427 orte/util/dash_host/dash_host.c if (NULL != (cptr = strchr(mini_map[k], ':'))) { k 431 orte/util/dash_host/dash_host.c if (orte_ifislocal(mini_map[k])) { k 434 orte/util/dash_host/dash_host.c opal_argv_append_nosize(mapped_nodes, mini_map[k]); k 1044 orte/util/nidmap.c int j, k; k 1064 orte/util/nidmap.c for (k=0; k < nptr->procs->size; k++) { k 1065 orte/util/nidmap.c if (NULL != (proc = (orte_proc_t*)opal_pointer_array_get_item(nptr->procs, k))) { k 1131 orte/util/nidmap.c uint16_t ppn, k; k 1217 orte/util/nidmap.c for (k=0; k < ppn; k++) { k 138 orte/util/show_help.c int i, j, k, len, outlen; k 158 orte/util/show_help.c k=0; k 161 orte/util/show_help.c for (j=0; j < starttaglen && k < outlen; j++) { k 162 orte/util/show_help.c output[k++] = starttag[j]; k 167 orte/util/show_help.c if (k+5 >= outlen) { k 172 orte/util/show_help.c for (j=0; j < (int)strlen(qprint) && k < outlen; j++) { k 173 orte/util/show_help.c output[k++] = qprint[j]; k 176 orte/util/show_help.c if (k+4 >= outlen) { k 181 orte/util/show_help.c for (j=0; j < (int)strlen(qprint) && k < outlen; j++) { k 182 orte/util/show_help.c output[k++] = qprint[j]; k 185 orte/util/show_help.c if (k+4 >= outlen) { k 190 orte/util/show_help.c for (j=0; j < (int)strlen(qprint) && k < outlen; j++) { k 191 orte/util/show_help.c output[k++] = qprint[j]; k 195 orte/util/show_help.c if (k+7 >= outlen) { k 200 orte/util/show_help.c for (j=0; j < (int)strlen(qprint) && k < outlen; j++) { k 201 orte/util/show_help.c output[k++] = qprint[j]; k 204 orte/util/show_help.c if ('\n' == input[i] && (k+endtaglen+1) < outlen) { k 206 orte/util/show_help.c for (j=0; j < endtaglen && k < outlen-1; j++) { k 207 orte/util/show_help.c output[k++] = endtag[j]; k 210 orte/util/show_help.c output[k++] = '\n'; k 212 orte/util/show_help.c if (i < len-1 && (k+starttaglen) < outlen) { k 213 orte/util/show_help.c for (j=0; j < starttaglen && k < outlen; j++) { k 214 orte/util/show_help.c output[k++] = starttag[j]; k 222 orte/util/show_help.c output[k++] = input[i]; k 228 orte/util/show_help.c for (j=0; j < endtaglen && k < outlen-1; j++) { k 229 orte/util/show_help.c output[k++] = endtag[j]; k 231 orte/util/show_help.c output[k++] = '\n'; k 153 oshmem/mca/memheap/base/base.h extern int mca_memheap_seg_cmp(const void *k, const void *v); k 74 oshmem/mca/memheap/base/memheap_base_mkey.c int mca_memheap_seg_cmp(const void *k, const void *v) k 76 oshmem/mca/memheap/base/memheap_base_mkey.c uintptr_t va = (uintptr_t) k;