Searched refs:base1 (Results 1 - 8 of 8) sorted by relevance

/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/cdbg/
H A DLoadObjectComparator.java36 Address base1 = lo1.getBase();
38 long diff = base1.minus(base2);
/openjdk7/hotspot/src/share/vm/utilities/
H A Dutf8.hpp55 static bool equal(const jbyte* base1, int length1, const jbyte* base2,int length2);
H A Dutf8.cpp175 bool UTF8::equal(const jbyte* base1, int length1, const jbyte* base2, int length2) { argument
179 if (base1[i] != base2[i]) return false;
/openjdk7/jdk/src/share/classes/java/util/
H A DComparableTimSort.java409 int base1 = runBase[i];
414 assert base1 + len1 == base2;
432 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
434 base1 += k;
443 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
451 mergeLo(base1, len1, base2, len2);
453 mergeHi(base1, len1, base2, len2);
604 * second run (a[base1] > a[base2]), and the last element of the first run
605 * (a[base1 + len1-1]) must be greater than all elements of the second run.
611 * @param base1 inde
618 mergeLo(int base1, int len1, int base2, int len2) argument
735 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
H A DTimSort.java442 int base1 = runBase[i];
447 assert base1 + len1 == base2;
465 int k = gallopRight(a[base2], a, base1, len1, 0, c);
467 base1 += k;
476 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
483 mergeLo(base1, len1, base2, len2);
485 mergeHi(base1, len1, base2, len2);
637 * second run (a[base1] > a[base2]), and the last element of the first run
638 * (a[base1 + len1-1]) must be greater than all elements of the second run.
644 * @param base1 inde
650 mergeLo(int base1, int len1, int base2, int len2) argument
767 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dunpack.h40 entry* base1; // base of primary index member in struct:cpindex
49 base1 = base1_;
55 base1 = null;
H A Dunpack.cpp220 else if (base1 != null)
222 return &base1[i];
1361 assert(ix->base1 == cpMap);
/openjdk7/hotspot/src/cpu/sparc/vm/
H A Dc1_LIRAssembler_sparc.cpp313 Register base1 = L1; local
318 // Shift base0 and base1 to the end of the arrays, negate limit
320 __ add(base1, limit, base1);
325 __ lduh(base1, limit, chr1);

Completed in 60 milliseconds