Searched defs:hi (Results 1 - 25 of 62) sorted by relevance

123

/openjdk7/langtools/test/tools/javac/
H A DClosure1.java35 // Specifically, N must have its T.this initialized when S calls hi().
39 void hi() { throw new Error(); } method in class:Closure1.S
40 S() { hi(); }
45 void hi() { method in class:Closure1.T.N
/openjdk7/jdk/src/share/demo/applets/SortDemo/
H A DQSortAlgorithm.java55 private boolean pauseTrue(int lo, int hi) throws Exception { argument
56 super.pause(lo, hi);
76 int hi = hi0;
87 while (lo <= hi) {
98 while ((hi > lo0) && pauseTrue(lo0, hi0) && (a[hi] > mid)) {
99 --hi;
103 if (lo <= hi) {
104 swap(a, lo, hi);
106 --hi;
[all...]
/openjdk7/hotspot/src/share/vm/libadt/
H A Dset.cpp81 uint hi = (uint)-2, lo = (uint)-2; local
83 if( hi+1 == i.elem ) { // Moving sequentially thru range?
84 hi = i.elem; // Yes, just update hi end of range
93 if( lo != hi ) sprintf(s,"%d-%d,",lo,hi);
97 hi = lo = i.elem;
107 if( lo != hi ) sprintf(s,"%d-%d}",lo,hi);
139 uint hi, local
[all...]
/openjdk7/hotspot/src/cpu/zero/vm/
H A Dbytes_zero.hpp96 u4 hi, lo; local
97 hi = (u4(p[0]) << 24) |
105 return u8(lo) | (u8(hi) << 32);
119 u4 hi, lo; local
121 hi = x >> 32;
122 p[0] = hi >> 24;
123 p[1] = hi >> 16;
124 p[2] = hi >> 8;
125 p[3] = hi;
/openjdk7/jdk/test/com/sun/jdi/
H A DFinalLocalsTest.java55 public void hi(){ method in class:FinalLocalsTarg
60 new FinalLocalsTarg().hi();
177 BreakpointEvent bp = resumeTo("FinalLocalsTarg", "hi", "()V");
H A DVars.java60 void hi() { method in class:TestVars
65 new TestVars().hi();
158 BreakpointEvent bp = resumeTo("TestVars", "hi", "()V");
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/
H A De_exp.c37 * Here r will be represented as r = hi-lo for better
122 double y,hi=0,lo=0,c,t; local
144 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb;
148 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */
151 x = hi - lo;
162 else y = one-((lo-(x*c)/(2.0-c))-hi);
H A Ds_expm1.c150 double y,hi,lo,c=0,t,e,hxs,hfx,r1; local
179 {hi = x - ln2_hi; lo = ln2_lo; k = 1;}
181 {hi = x + ln2_hi; lo = -ln2_lo; k = -1;}
185 hi = x - t*ln2_hi; /* t*ln2_hi is exact here */
188 x = hi - lo;
189 c = (hi-x)-lo;
/openjdk7/hotspot/src/share/vm/interpreter/
H A Dbytecode.cpp255 int hi = high_key(); local
256 assert (hi >= lo, "incorrect hi/lo values in tableswitch");
257 int i = hi - lo - 1 ;
H A Dbytecodes.cpp115 jlong hi = (jint)Bytes::get_Java_u4(aligned_bcp + 2*jintSize); local
116 jlong len = (aligned_bcp - bcp) + (3 + hi - lo + 1)*jintSize;
H A DbytecodeTracer.cpp487 int hi = get_int(); local
488 int len = hi - lo + 1;
494 default_dest, lo, hi);
496 for (int ll = lo; ll <= hi; ll++, first = false) {
/openjdk7/jdk/make/tools/src/build/tools/generatebreakiteratordata/
H A DCharSet.java368 * @param hi The highest-numbered character to include in the range
370 public CharSet(int lo, int hi) { argument
372 if (lo <= hi) {
374 chars[1] = hi;
377 chars[0] = hi;
/openjdk7/hotspot/src/share/vm/opto/
H A Dvectornode.cpp367 // Create a binary tree form for Packs. [lo, hi) (half-open) range
368 PackNode* PackNode::binary_tree_pack(Compile* C, int lo, int hi) { argument
369 int ct = hi - lo;
379 PackNode* n2 = binary_tree_pack(C, mid, hi );
H A Daddnode.cpp348 int hi = r0->_hi + r1->_hi; local
352 lo = min_jint; hi = max_jint; // Underflow on the low side
354 if( (~(r0->_hi | r1->_hi)) < 0 && hi < 0 ) {
355 lo = min_jint; hi = max_jint; // Overflow on the high side
357 if( lo > hi ) { // Handle overflow
358 lo = min_jint; hi = max_jint;
361 // both constants, compute precise result using 'lo' and 'hi'
365 return TypeInt::make( lo, hi, MAX2(r0->_widen,r1->_widen) );
466 jlong hi = r0->_hi + r1->_hi; local
470 lo =min_jlong; hi
[all...]
/openjdk7/langtools/test/tools/apt/mirror/declaration/
H A DAnnoVal.java124 "double hi 1.0/0.0",
133 hi = 1.0/0.0,
194 double hi(); method in interface:AT3
/openjdk7/jdk/src/share/classes/sun/awt/geom/
H A DCrossings.java431 public void insert(int cur, double lo, double hi, int dir) { argument
448 yranges[cur+1] = hi;
/openjdk7/jdk/src/share/classes/java/io/
H A DStreamTokenizer.java272 * @param hi the high end of the range.
274 public void wordChars(int low, int hi) { argument
277 if (hi >= ctype.length)
278 hi = ctype.length - 1;
279 while (low <= hi)
293 * @param hi the high end of the range.
295 public void whitespaceChars(int low, int hi) { argument
298 if (hi >= ctype.length)
299 hi = ctype.length - 1;
300 while (low <= hi)
315 ordinaryChars(int low, int hi) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DComparableTimSort.java149 static void sort(Object[] a, int lo, int hi) { argument
150 rangeCheck(a.length, lo, hi);
151 int nRemaining = hi - lo;
157 int initRunLen = countRunAndMakeAscending(a, lo, hi);
158 binarySort(a, lo, hi, lo + initRunLen);
171 int runLen = countRunAndMakeAscending(a, lo, hi);
190 assert lo == hi;
208 * @param hi the index after the last element in the range to be sorted
210 * not already known to be sorted ({@code lo <= start <= hi})
213 private static void binarySort(Object[] a, int lo, int hi, in argument
283 countRunAndMakeAscending(Object[] a, int lo, int hi) argument
309 reverseRange(Object[] a, int lo, int hi) argument
[all...]
H A DTimSort.java176 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { argument
178 Arrays.sort(a, lo, hi);
182 rangeCheck(a.length, lo, hi);
183 int nRemaining = hi - lo;
189 int initRunLen = countRunAndMakeAscending(a, lo, hi, c);
190 binarySort(a, lo, hi, lo + initRunLen, c);
203 int runLen = countRunAndMakeAscending(a, lo, hi, c);
222 assert lo == hi;
240 * @param hi the index after the last element in the range to be sorted
242 * not already known to be sorted ({@code lo <= start <= hi})
246 binarySort(T[] a, int lo, int hi, int start, Comparator<? super T> c) argument
316 countRunAndMakeAscending(T[] a, int lo, int hi, Comparator<? super T> c) argument
343 reverseRange(Object[] a, int lo, int hi) argument
[all...]
/openjdk7/hotspot/src/share/vm/ci/
H A DciStreams.cpp121 int hi = Bytes::get_Java_u4((address)&_table_base[2]);// High bound local
122 int len = hi - lo + 1; // Dense table size
/openjdk7/hotspot/src/share/vm/utilities/
H A Dtaskqueue.cpp130 int hi = seed / q; local
132 int test = a * lo - r * hi;
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/
H A Dbands.cpp215 uint hi = hi_band.getInt(); local
216 return makeLong(hi, lo);
/openjdk7/jdk/src/share/classes/sun/nio/cs/ext/
H A DEUC_TW.java325 public int toEUC(char hi, char low, byte[] bb) { argument
326 return encode(hi, low, bb);
442 static int encode(char hi, char low, byte[] bb) { argument
443 int c = Character.toCodePoint(hi, low);
H A DSJIS_0213.java226 protected int encodeSurrogate(char hi, char lo) { argument
227 return mapping.encodeSurrogate(hi, lo);
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/
H A Dcmssamp.c377 cmsFloat64Number lo, hi, NonMonoMin; local
522 hi = 0.5;
528 hi = 0.25;
545 if (ff >= lo && ff < hi) {

Completed in 109 milliseconds

123