i1                178 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c    sortstruct *i1, *i2;
i1                179 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c    i1 = (sortstruct *)p1;
i1                181 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c    return(i1->bridge - i2->bridge);
i1                 78 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c    sortstruct *i1, *i2;
i1                 79 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c    i1 = (sortstruct *)p1;
i1                 81 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c    return(i1->bridgeCoord - i2->bridgeCoord);
i1                 58 ompi/mca/topo/treematch/treematch/tm_bucket.c   int *e1 = NULL,*e2 = NULL,i1,i2,j1,j2;
i1                 69 ompi/mca/topo/treematch/treematch/tm_bucket.c   i1 = e1[0];
i1                 74 ompi/mca/topo/treematch/treematch/tm_bucket.c   if(tab[i1][j1]==tab[i2][j2]){
i1                 75 ompi/mca/topo/treematch/treematch/tm_bucket.c     if(i1==i2){
i1                 78 ompi/mca/topo/treematch/treematch/tm_bucket.c       return (i1 > i2) ? -1 : 1;
i1                 81 ompi/mca/topo/treematch/treematch/tm_bucket.c   return (tab[i1][j1] > tab[i2][j2]) ? -1 : 1;
i1                218 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, i1, id1;
i1                228 ompi/mca/topo/treematch/treematch/tm_tree.c     for( i1 = 0 ; i1 < new_tab_node[i].arity ; i1++ ){
i1                229 ompi/mca/topo/treematch/treematch/tm_tree.c       id1 = new_tab_node[i].child[i1]->id;
i1                247 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, i1, j1;
i1                263 ompi/mca/topo/treematch/treematch/tm_tree.c 	for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){
i1                264 ompi/mca/topo/treematch/treematch/tm_tree.c 	  id1 = tab_node[i].child[i1]->id;
i1                282 ompi/mca/topo/treematch/treematch/tm_tree.c   int i, j, i1, j1, id1, id2;
i1                345 ompi/mca/topo/treematch/treematch/tm_tree.c 	for( i1 = 0 ; i1 < tab_node[i].arity ; i1++ ){
i1                346 ompi/mca/topo/treematch/treematch/tm_tree.c 	  id1 = tab_node[i].child[i1]->id;
i1                184 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h   int i1 = hwloc_distances_obj_index(distances, obj1);
i1                186 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h   if (i1 < 0 || i2 < 0)
i1                188 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h   *value1to2 = distances->values[i1 * distances->nbobjs + i2];
i1                189 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h   *value2to1 = distances->values[i2 * distances->nbobjs + i1];
i1                 61 opal/mca/patcher/overwrite/patcher_overwrite_module.c                               unsigned long i1,
i1                 75 opal/mca/patcher/overwrite/patcher_overwrite_module.c     copy_instr_slot(&dst, &dst_bitpos, i1);
i1                373 test/datatype/ddt_lib.c     int i1;
i1                396 test/datatype/ddt_lib.c     dispi[0] = (int)((char*)&(v[0].i1) - (char*)&(v[0]));  /* 0 */
i1                188 test/datatype/opal_ddt_lib.c     int i1;