Searched refs:idx2 (Results 1 - 5 of 5) sorted by relevance
/openjdk7/jdk/src/share/classes/sun/reflect/ |
H A D | Reflection.java | 221 int idx2 = 0; 233 if (name2.charAt(idx2) == '[') { 235 idx2++; 236 } while (name2.charAt(idx2) == '['); 237 if (name2.charAt(idx2) != 'L') { 245 int length2 = lastDot2 - idx2; 250 return name1.regionMatches(false, idx1, name2, idx2, length1);
|
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | constantPoolOop.cpp | 1368 u2 idx1, idx2; local 1437 idx2 = Bytes::get_Java_u2(bytes+2); 1438 printf("Field #%03d, #%03d", (int) idx1, (int) idx2); 1444 idx2 = Bytes::get_Java_u2(bytes+2); 1445 printf("Method #%03d, #%03d", idx1, idx2); 1451 idx2 = Bytes::get_Java_u2(bytes+2); 1452 printf("InterfMethod #%03d, #%03d", idx1, idx2); 1458 idx2 = Bytes::get_Java_u2(bytes+2); 1459 printf("NameAndType #%03d, #%03d", idx1, idx2); 1583 u2 idx1, idx2; local [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | postaloc.cpp | 194 int idx2 = old2->is_Copy(); local 195 if( !idx2 ) return 0; // Not a chain of 2 copies 196 if( def != old2->in(idx2) ) return 0; // Chain of exactly 2 copies
|
H A D | block.hpp | 505 void Union( uint idx1, uint idx2 );
|
H A D | block.cpp | 1019 void UnionFind::Union( uint idx1, uint idx2 ) { 1021 uint dst = Find(idx2);
|
Completed in 48 milliseconds