Searched refs:base2 (Results 1 - 9 of 9) sorted by relevance

/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/cdbg/
H A DLoadObjectComparator.java37 Address base2 = lo2.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.java411 int base2 = runBase[i + 1];
414 assert base1 + len1 == base2;
432 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
444 base2, len2, len2 - 1);
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
613 * @param base2 index of first element in second run to be merged
618 private void mergeLo(int base1, int len1, int base2, int len2) { argument
619 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
735 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
H A DTimSort.java444 int base2 = runBase[i + 1];
447 assert base1 + len1 == base2;
465 int k = gallopRight(a[base2], a, base1, len1, 0, c);
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
646 * @param base2 index of first element in second run to be merged
650 private void mergeLo(int base1, int len1, int base2, int len2) { argument
651 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
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.h41 entry** base2; // base of secondary index member in struct:cpindex
50 base2 = null;
56 base2 = base2_;
H A Dunpack.cpp225 return base2[i];
3226 assert(fix->base2[j] == null);
3237 assert(mix->base2[j] == null);
/openjdk7/hotspot/src/share/vm/opto/
H A Dcfgnode.cpp1736 // (Phi (AddP base base y) (AddP base2 base2 y))
1738 // newbase := (Phi base base2)
1769 Node* base2 = u->in(AddPNode::Base); local
1770 if (base2 != NULL && !base2->is_top()) {
1772 base = base2;
1773 else if (base != base2)
/openjdk7/jdk/src/share/classes/java/math/
H A DBigInteger.java1614 BigInteger base2 = (this.signum < 0 || this.compareTo(m1) >= 0
1619 base2.oddModPow(exponent, m1));

Completed in 64 milliseconds