i2 178 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c sortstruct *i1, *i2; i2 180 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c i2 = (sortstruct *)p2; i2 181 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_aggrs.c return(i1->bridge - i2->bridge); i2 78 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c sortstruct *i1, *i2; i2 80 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c i2 = (sortstruct *)p2; i2 81 ompi/mca/io/romio321/romio/adio/ad_gpfs/bg/ad_bg_pset.c return(i1->bridgeCoord - i2->bridgeCoord); i2 58 ompi/mca/topo/treematch/treematch/tm_bucket.c int *e1 = NULL,*e2 = NULL,i1,i2,j1,j2; i2 71 ompi/mca/topo/treematch/treematch/tm_bucket.c i2 = e2[0]; i2 74 ompi/mca/topo/treematch/treematch/tm_bucket.c if(tab[i1][j1]==tab[i2][j2]){ i2 75 ompi/mca/topo/treematch/treematch/tm_bucket.c if(i1==i2){ i2 78 ompi/mca/topo/treematch/treematch/tm_bucket.c return (i1 > i2) ? -1 : 1; i2 81 ompi/mca/topo/treematch/treematch/tm_bucket.c return (tab[i1][j1] > tab[i2][j2]) ? -1 : 1; i2 185 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h int i2 = hwloc_distances_obj_index(distances, obj2); i2 186 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h if (i1 < 0 || i2 < 0) i2 188 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h *value1to2 = distances->values[i1 * distances->nbobjs + i2]; i2 189 opal/mca/hwloc/hwloc201/hwloc/include/hwloc/distances.h *value2to1 = distances->values[i2 * distances->nbobjs + i1]; i2 60 opal/mca/patcher/overwrite/patcher_overwrite_module.c unsigned long i2, i2 74 opal/mca/patcher/overwrite/patcher_overwrite_module.c copy_instr_slot(&dst, &dst_bitpos, i2); i2 375 test/datatype/ddt_lib.c int i2; i2 397 test/datatype/ddt_lib.c dispi[1] = (int)(((char*)(&(v[0].i2)) - (char*)&(v[0])) / sizeof(int)); /* 2 */ i2 190 test/datatype/opal_ddt_lib.c int i2;