/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/memory/ |
H A D | CodeHeap.java | 72 return getMemory().low(); 115 return p.minus(getMemory().low()) >> getLog2SegmentSize(); 135 Address b = getSegmentMap().low(); 142 return getMemory().low().addOffsetTo(i << getLog2SegmentSize());
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/utilities/ |
H A D | SystemDictionaryHelper.java | 121 int low = 0; 125 while (low <= high) { 126 mid = (low + high) >> 1; 131 low = mid + 1;
|
/openjdk7/hotspot/src/os_cpu/linux_sparc/vm/ |
H A D | os_linux_sparc.hpp | 47 static bool register_code_area(char *low, char *high) { return true; } argument
|
/openjdk7/hotspot/src/os_cpu/solaris_sparc/vm/ |
H A D | os_solaris_sparc.hpp | 47 static bool register_code_area(char *low, char *high) { return true; } argument
|
/openjdk7/hotspot/src/os_cpu/solaris_x86/vm/ |
H A D | os_solaris_x86.hpp | 55 static bool register_code_area(char *low, char *high) { return true; } argument
|
/openjdk7/jaxp/src/com/sun/org/apache/xml/internal/serializer/ |
H A D | WriterToUTF8Buffered.java | 126 * the 16 low-order bits of the given integer value; the 16 high-order bits 218 // of a Unicode surrogate pair and low char of the pair 229 // Avoid spanning by including the low 234 * and it is the high char of a high/low pair with 235 * no low char provided. 238 * of a high/low surrogate pair, but there is 239 * no corresponding low as the high is the last char 285 * [1101 11yy] [yyxx xxxx] (low surrogate) 290 char high, low; 293 low [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/code/ |
H A D | CompressedReadStream.java | 82 long low = readSignedInt() & 0x00000000FFFFFFFFL; 84 return (high << 32) | low;
|
/openjdk7/jdk/src/share/classes/sun/font/ |
H A D | CompositeGlyphMapper.java | 199 char low = unicodes[i + 1]; 201 if (low >= LO_SURROGATE_START && 202 low <= LO_SURROGATE_END) { 204 0x400 + low - LO_SURROGATE_START + 0x10000; 238 char low = unicodes[i + 1]; 240 if (low >= LO_SURROGATE_START && 241 low <= LO_SURROGATE_END) { 243 0x400 + low - LO_SURROGATE_START + 0x10000;
|
H A D | TrueTypeGlyphMapper.java | 189 char low = unicodes[i + 1]; 191 if (low >= LO_SURROGATE_START && 192 low <= LO_SURROGATE_END) { 194 0x400 + low - LO_SURROGATE_START + 0x10000; 229 char low = unicodes[i + 1]; 231 if (low >= LO_SURROGATE_START && 232 low <= LO_SURROGATE_END) { 234 0x400 + low - LO_SURROGATE_START + 0x10000;
|
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/ |
H A D | adjoiningVirtualSpaces.cpp | 62 size_t actual_change = low()->expand_into(high(), change_in_bytes); 68 size_t actual_change = high()->expand_into(low(), change_in_bytes);
|
H A D | adjoiningVirtualSpaces.hpp | 41 // --------- <--- low for H 63 // space at the high end and the low end, respectively 70 // The minimum byte size for the low space. It will not 80 // high and low ends. Does no initialization. 88 PSVirtualSpace* low() { return _low; } function in class:AdjoiningVirtualSpaces 103 // Maximum byte size for the low space.
|
/openjdk7/jdk/src/share/native/java/util/zip/zlib-1.2.3/ |
H A D | inftrees.c | 75 unsigned low; /* low bits for current root entry */ local 76 unsigned mask; /* mask for low root bits */ 183 of the low root bits of huff. This is saved in low to check for when a 231 low = (unsigned)(-1); /* trigger new sub-table when len > root */ 233 mask = used - 1; /* mask for comparing low */ 256 /* replicate for those indices with low len bits equal to huff */ 284 if (len > root && (huff & mask) != low) { 308 low [all...] |
/openjdk7/jdk/test/java/rmi/server/RMISocketFactory/useSocketFactory/activatable/ |
H A D | CompressInputStream.java | 54 int low = readCode(); 55 return (high << 4) | low;
|
/openjdk7/jdk/test/java/rmi/server/RMISocketFactory/useSocketFactory/unicast/ |
H A D | CompressInputStream.java | 54 int low = readCode(); 55 return (high << 4) | low;
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | Position.java | 199 int low = 0; 201 while (low <= high) { 202 int mid = (low + high) >> 1; 206 low = mid + 1; 214 lastLine = low;
|
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/debugger/linux/ |
H A D | LinuxCDebugger.java | 62 int low = 0; 65 while (low <= high) { 66 mid = (low + high) >> 1; 74 low = mid + 1;
|
/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 | 116 int low = bytes[i] & 0x0f; 120 res[1] = mapping.charAt(low); 131 String low = value.substring(2*i+1, 2*i+2); 133 mapping.indexOf(low));
|
/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 100 } else if (j < low) { 112 thresholdOp(low, high);
|
/openjdk7/jdk/src/share/native/sun/font/layout/ |
H A D | LEFontInstance.cpp | 89 LEUnicode16 low = chars[i + 1]; local 91 if (low >= 0xDC00 && low <= 0xDFFF) { 92 code = (high - 0xD800) * 0x400 + low - 0xDC00 + 0x10000;
|
/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 222 int low = getInt(pad + 4); 224 return pad + 12 + 4 * (high - low + 1); 279 int low = getInt(pad + 4); 281 int[] values = new int[high - low + 1]; 285 this, default_, low, high, values, p);
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | PopulationCoding.java | 135 int low = fillp; 137 if (high == low) continue; 138 assert(high > low) 139 : high+"!>"+low; 140 assert(tc.getLength(low) == n) 141 : n+" != len("+(low)+") == "+ 142 tc.getLength(low); 146 int midTarget = low + (high-low)/2; 147 int mid = low; [all...] |
/openjdk7/jdk/src/share/classes/com/sun/jmx/snmp/agent/ |
H A D | SnmpRequestTree.java | 932 int low= 0; 934 int curr= low + (max-low)/2; 936 while (low <= max) { 951 low = curr + 1; 955 curr = low + (max-low)/2; 969 int low= 0; 971 int curr= low + (max-low)/ [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),
|