/openjdk7/jdk/test/java/rmi/server/RMISocketFactory/useSocketFactory/activatable/ |
H A D | CompressInputStream.java | 53 int high = readCode(); 55 return (high << 4) | low;
|
/openjdk7/jdk/test/java/rmi/server/RMISocketFactory/useSocketFactory/unicast/ |
H A D | CompressInputStream.java | 53 int high = readCode(); 55 return (high << 4) | low;
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | LEFontInstance.cpp | 85 LEUnicode16 high = chars[i]; local 86 LEUnicode32 code = high; 88 if (i < offset + count - 1 && high >= 0xD800 && high <= 0xDBFF) { 92 code = (high - 0xD800) * 0x400 + low - 0xDC00 + 0x10000;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Arrays.java | 559 * high is the end index in dest to end sorting 560 * off is the offset to generate corresponding low, high in src 566 int high, 568 int length = high - low; 572 for (int i=low; i<high; i++) 581 int destHigh = high; 583 high += off; 584 int mid = (low + high) >>> 1; 586 mergeSort(dest, src, mid, high, -off); 597 if (q >= high || 563 mergeSort(Object[] src, Object[] dest, int low, int high, int off) argument 749 mergeSort(Object[] src, Object[] dest, int low, int high, int off, Comparator c) argument [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/linux/ |
H A D | LinuxCDebugger.java | 63 int high = arr.length - 1; 65 while (low <= high) { 66 mid = (low + high) >> 1; 70 high = mid - 1;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | adjoiningVirtualSpaces.hpp | 47 // --------- <--- high for L 63 // space at the high end and the low end, respectively 73 // Same for the high space 80 // high and low ends. Does no initialization. 87 PSVirtualSpace* high() { return _high; } function in class:AdjoiningVirtualSpaces 99 // Maximum byte size for the high space.
|
/openjdk7/hotspot/src/os_cpu/windows_x86/vm/ |
H A D | os_windows_x86.hpp | 63 static bool register_code_area(char *low, char *high);
|
/openjdk7/jdk/test/com/sun/crypto/provider/KeyFactory/ |
H A D | PBKDF2HmacSHA1FactoryTest.java | 117 int high = ((bytes[i] >> 4) & 0x0f); 119 res[0] = mapping.charAt(high); 130 String high = value.substring(2*i, 2*i+1); 132 bytes[i] = (byte) ((mapping.indexOf(high) << 4) +
|
/openjdk7/jdk/test/java/awt/image/ImagingOpsNoExceptionsTest/ |
H A D | ImagingOpsNoExceptionsTest.java | 42 private static int low = 100, high = 200; field in class:ImagingOpsNoExceptionsTest 95 public static void thresholdOp(int low, int high) { argument 98 if (j > high) { 112 thresholdOp(low, high);
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | Position.java | 200 int high = startPosition.length-1; 201 while (low <= high) { 202 int mid = (low + high) >> 1; 208 high = mid - 1;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1BlockOffsetTable.hpp | 166 void set_offset_array(size_t index, HeapWord* high, HeapWord* low) { 168 assert(high >= low, "addresses out of order"); 169 check_offset(pointer_delta(high, low), "offset too large"); 170 _offset_array[index] = (u_char) pointer_delta(high, low); 203 void check_offset_array(size_t index, HeapWord* high, HeapWord* low) const { 205 assert(high >= low, "addresses out of order"); 206 check_offset(pointer_delta(high, low), "offset too large"); 207 assert(_offset_array[index] == pointer_delta(high, low), "Wrong offset");
|
/openjdk7/langtools/src/share/classes/com/sun/tools/classfile/ |
H A D | Instruction.java | 111 R visitTableSwitch(Instruction instr, int default_, int low, int high, int[] offsets, P p); argument 223 int high = getInt(pad + 8); 224 return pad + 12 + 4 * (high - low + 1); 280 int high = getInt(pad + 8); 281 int[] values = new int[high - low + 1]; 285 this, default_, low, high, values, p);
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parNew/ |
H A D | asParNewGeneration.cpp | 98 assert(((HeapWord*)virtual_space()->high()) >= space_shrinking->end(), 99 "Survivor space beyond high end"); 100 size_t unused_committed = pointer_delta(virtual_space()->high(), 204 (HeapWord*)virtual_space()->high()); 224 HeapWord* new_end = (HeapWord*)virtual_space()->high(); 344 to_end = (char*)virtual_space()->high(); 377 // else leave to_end pointing to the high end of the virtual space. 467 if (from_end > virtual_space()->high()) { 468 from_end = virtual_space()->high(); 520 HeapWord* limit = (HeapWord*) virtual_space()->high(); [all...] |
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | blockOffsetTable.hpp | 147 void set_offset_array(size_t index, HeapWord* high, HeapWord* low, bool reducing = false) { 150 assert(high >= low, "addresses out of order"); 151 assert(pointer_delta(high, low) <= N_words, "offset too large"); 152 assert(!reducing || _offset_array[index] >= (u_char)pointer_delta(high, low), 154 _offset_array[index] = (u_char)pointer_delta(high, low); 202 void check_offset_array(size_t index, HeapWord* high, HeapWord* low) const { 204 assert(high >= low, "addresses out of order"); 205 assert(pointer_delta(high, low) <= N_words, "offset too large"); 206 assert(_offset_array[index] == pointer_delta(high, low),
|
H A D | heap.hpp | 140 void* end() const { return _memory.high(); } 147 // Returns reserved area high and low addresses 149 char *high() const { return _memory.high(); } function in class:CodeHeap
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/parser/ |
H A D | Scanner.java | 503 char high; 545 high = scanSurrogates(); 546 if (high != 0) { 548 putChar(high); 550 sbuf[sp++] = high; 553 Character.toCodePoint(high, ch)); 579 /** Scan surrogate pairs. If 'ch' is a high surrogate and 581 * surrogate in 'ch', and return the high surrogate. 586 char high = ch; 591 return high; [all...] |
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | instanceMirrorKlass.cpp | 97 T, start_p, count, low, high, \ 101 T* const h = (T*)(high); \ 134 #define InstanceMirrorKlass_BOUNDED_OOP_ITERATE(start_p, count, low, high, \ 140 low, high, \ 145 low, high, \
|
/openjdk7/jdk/src/share/classes/com/sun/media/sound/ |
H A D | MidiUtils.java | 244 int high = track.size() - 1; 245 while (low < high) { 247 ret = (low + high) >> 1; 254 if (low == high - 1) { 261 // estimate too high 262 high = ret;
|
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | FormattedFloatingDecimal.java | 99 * count number of bits from high-order 1 bit to low-order 1 bit, 233 * We now know where the high-order 1 bit is, 507 // Insert assumed high-order bit for normalized numbers. 574 // Insert assumed high-order bit for normalized numbers. 757 boolean low, high; 767 * as it makes our fist guess (quotient of high-order words) 787 * was too high, our first quotient will be zero. In this 795 high = (b+m > tens ); 797 if ( (q == 0) && ! high ){ 810 high [all...] |
/openjdk7/jdk/src/solaris/classes/sun/net/sdp/ |
H A D | SdpProvider.java | 175 String high = s.substring(pos+1); 176 if (high.length() == 0) high = "*"; 178 result[1] = high.equals("*") ? MAX_PORT : Integer.parseInt(high);
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | PopulationCoding.java | 136 int high = nmax+1; 137 if (high == low) continue; 138 assert(high > low) 139 : high+"!>"+low; 143 assert(tc.getLength(high-1) == n) 144 : n+" != len("+(high-1)+") == "+ 145 tc.getLength(high-1); 146 int midTarget = low + (high-low)/2; 151 for (int i = low; i < high; i++) { 170 Arrays.sort(fValues, prevLimit, high); [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/codemodel/internal/util/ |
H A D | Surrogate.java | 58 * Tells whether or not the given UTF-16 value is a high surrogate. 87 * Returns the high UTF-16 surrogate for the given UCS-4 character. 89 public static char high(int uc) { method in class:Surrogate 164 * will be consumed if c is a high surrogate 203 * will be consumed if c is a high surrogate 296 dst.put(high(uc)); 344 da[dp] = high(uc);
|
/openjdk7/hotspot/src/share/vm/services/ |
H A D | lowMemoryDetector.hpp | 157 // around the high or low threshold value. 160 // (1) the usage is crossing above the high threshold and 163 // (2) the usage is crossing above the high threshold and 167 // Subsequent crossings of the high threshold value do not cause 180 // to the high threshold. 182 // If the current level is between high and low threhsold, no change. 192 // - the usage is crossing above the high threshold regardless 267 // current used exceeds the high threshold 270 size_t high = pool->usage_threshold()->high_threshold(); local 271 if (used > high) { [all...] |
/openjdk7/jdk/test/com/sun/crypto/provider/Cipher/Blowfish/ |
H A D | BlowfishTestVector.java | 124 int high = ((b & 0xf0) >> 4); 126 buf.append(hexChars[high]);
|
/openjdk7/jdk/test/sun/security/x509/X500Name/ |
H A D | DerValueConstructor.java | 110 int high = ((b & 0xf0) >> 4); 112 buf.append(hexChars[high]);
|