jj                273 ompi/mca/common/ompio/common_ompio.h                                                     struct iovec *decoded_iov, int *ii, int *jj, size_t *tbw,
jj                277 ompi/mca/common/ompio/common_ompio_file_view.c         int ii, jj;
jj                283 ompi/mca/common/ompio/common_ompio_file_view.c             for ( jj=0; jj< contg_groups[ii].procs_per_contg_group; jj++ ) {
jj                284 ompi/mca/common/ompio/common_ompio_file_view.c                 printf("%d,", contg_groups[ii].procs_in_contg_group[jj]);
jj                515 ompi/mca/common/ompio/common_ompio_file_write.c                                       struct iovec *decoded_iov, int *ii, int *jj, size_t *tbw, 
jj                529 ompi/mca/common/ompio/common_ompio_file_write.c     int j = *jj;
jj                635 ompi/mca/common/ompio/common_ompio_file_write.c     *jj = j;
jj                625 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c     int ii,jj;
jj                837 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c 	    for (ii=0, jj=0;jj<size;jj+=4, ii++){
jj                838 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c 		printf("%d : write_buf[%d]: %d\n", fh->f_rank, ii,((int *)write_buf[jj]));
jj               1310 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c     int jj, n_buftypes, ret=OMPI_SUCCESS;
jj               1317 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c     jj = 0;
jj               1371 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c 					       requests+jj));
jj               1376 ompi/mca/fcoll/two_phase/fcoll_two_phase_file_write_all.c 		      jj++;
jj               1311 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c     int jj, n_buftypes;
jj               1325 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c     jj = 0;
jj               1377 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c 				myrank+p+100*iter, fd->comm, requests+jj);
jj               1378 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c 			jj++;
jj               1724 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c     int jj, n_buftypes;
jj               1738 ompi/mca/io/romio321/romio/adio/ad_gpfs/ad_gpfs_wrcoll.c     jj = 0;
jj                902 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrcoll.c     int flat_buf_sz, buf_incr, size_in_buf, jj, n_buftypes;
jj                917 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrcoll.c     jj = 0;
jj                966 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrcoll.c 				  requests + jj);
jj                967 ompi/mca/io/romio321/romio/adio/ad_lustre/ad_lustre_wrcoll.c 			jj++;
jj                877 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c     int jj, n_buftypes;
jj                891 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c     jj = 0;
jj                944 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c 				myrank+p+100*iter, fd->comm, requests+jj);
jj                945 ompi/mca/io/romio321/romio/adio/common/ad_write_coll.c 			jj++;
jj                547 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c   int cur_part, i, ii, j, jj, m = n/k, s;
jj                590 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	jj = perm[j];
jj                591 ompi/mca/topo/treematch/treematch/tm_kpartitioning.c 	sub_mat[i][j] = com_mat->comm[ii][jj];
jj                727 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, ii, jj;
jj                738 ompi/mca/topo/treematch/treematch/tm_tree.c 	for( jj = 0 ; jj < arity ; jj++ ){
jj                739 ompi/mca/topo/treematch/treematch/tm_tree.c 	  if(elem1->tab[ii]->id == elem2->tab[jj]->id){
jj               1462 ompi/mca/topo/treematch/treematch/tm_tree.c   int ii, jj;
jj               1464 ompi/mca/topo/treematch/treematch/tm_tree.c     for( jj = 0 ; jj < arity ; jj++ ){
jj               1465 ompi/mca/topo/treematch/treematch/tm_tree.c       if(tab1[ii]->id == tab2[jj]->id){
jj                 48 ompi/patterns/net/netpatterns.h         int jj;                         \
jj                 52 ompi/patterns/net/netpatterns.h         for( jj = 0; jj < level; jj++) {\
jj                210 opal/class/opal_hash_table.c     size_t jj, ii;
jj                235 opal/class/opal_hash_table.c     for (jj = 0; jj < old_capacity; jj += 1) {
jj                238 opal/class/opal_hash_table.c         old_elt =  &old_table[jj];
jj                265 opal/class/opal_hash_table.c     size_t jj, capacity = ht->ht_capacity;
jj                298 opal/class/opal_hash_table.c         for (jj = ht->ht_type_methods->hash_elt(elt)%capacity; ; jj += 1) {
jj                299 opal/class/opal_hash_table.c             if (jj == capacity) { jj = 0; }
jj                300 opal/class/opal_hash_table.c             if (jj == ii) {
jj                303 opal/class/opal_hash_table.c             } else if (! elts[jj].valid) {
jj                305 opal/class/opal_hash_table.c                 elts[jj] = elts[ii];
jj                160 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c     size_t jj, ii;
jj                185 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c     for (jj = 0; jj < old_capacity; jj += 1) {
jj                188 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c         old_elt =  &old_table[jj];
jj                215 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c     size_t jj, capacity = ht->ht_capacity;
jj                248 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c         for (jj = ht->ht_type_methods->hash_elt(elt)%capacity; ; jj += 1) {
jj                249 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c             if (jj == capacity) { jj = 0; }
jj                250 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c             if (jj == ii) {
jj                253 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c             } else if (! elts[jj].valid) {
jj                255 opal/mca/pmix/pmix4x/pmix/src/class/pmix_hash_table.c                 elts[jj] = elts[ii];