/openjdk7/jdk/src/share/demo/applets/SortDemo/ |
H A D | QSortAlgorithm.java | 55 private boolean pauseTrue(int lo, int hi) throws Exception { argument 56 super.pause(lo, hi); 75 int lo = lo0; 87 while (lo <= hi) { 91 while ((lo < hi0) && pauseTrue(lo0, hi0) && (a[lo] < mid)) { 92 ++lo; 103 if (lo <= hi) { 104 swap(a, lo, hi); 105 ++lo; [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/bugspot/ |
H A D | PCFinder.java | 61 public static Info findPC(Address pc, LoadObject lo, CDebugger dbg) { argument 62 if (lo == null) { 67 BlockSym sym = lo.debugInfoForPC(pc); 86 ClosestSymbol cs = lo.closestSymbolToPC(pc); 93 return new Info(dbg.getNameOfFile(lo.getName()).toUpperCase() +
|
/openjdk7/hotspot/src/share/vm/libadt/ |
H A D | set.cpp | 81 uint hi = (uint)-2, lo = (uint)-2; local 92 if( lo != (uint)-2 ) { // Startup? No! Then print previous range. 93 if( lo != hi ) sprintf(s,"%d-%d,",lo,hi); 94 else sprintf(s,"%d,",lo); 97 hi = lo = i.elem; 100 if( lo != (uint)-2 ) { 107 if( lo != hi ) sprintf(s,"%d-%d}",lo,hi); 108 else sprintf(s,"%d}",lo); [all...] |
/openjdk7/hotspot/src/cpu/zero/vm/ |
H A D | bytes_zero.hpp | 96 u4 hi, lo; local 101 lo = (u4(p[4]) << 24) | 105 return u8(lo) | (u8(hi) << 32); 119 u4 hi, lo; local 120 lo = x; 126 p[4] = lo >> 24; 127 p[5] = lo >> 16; 128 p[6] = lo >> 8; 129 p[7] = lo;
|
/openjdk7/jdk/test/com/sun/jdi/ |
H A D | Vars.java | 46 String test3(short sh, long lo) { argument 196 test2(method, VARIABLES, "normal/variables", "sh,lo,st", "st,sh,lo"); 198 test(method, ARGUMENTS, "normal/arguments", "sh,lo");
|
/openjdk7/jdk/src/share/native/java/lang/fdlibm/src/ |
H A D | e_exp.c | 37 * 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; 149 lo = t*ln2LO[0]; 151 x = hi - lo; 162 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
H A D | s_expm1.c | 150 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;} 186 lo = t*ln2_lo; 188 x = hi - lo; 189 c = (hi-x)-lo;
|
/openjdk7/hotspot/src/share/vm/interpreter/ |
H A D | bytecode.cpp | 254 { int lo = low_key(); local 256 assert (hi >= lo, "incorrect hi/lo values in tableswitch"); 257 int i = hi - lo - 1 ;
|
H A D | bytecodes.cpp | 114 jlong lo = (jint)Bytes::get_Java_u4(aligned_bcp + 1*jintSize); local 116 jlong len = (aligned_bcp - bcp) + (3 + hi - lo + 1)*jintSize;
|
H A D | bytecodeTracer.cpp | 486 int lo = get_int(); local 488 int len = hi - lo + 1; 494 default_dest, lo, hi); 496 for (int ll = lo; ll <= hi; ll++, first = false) { 497 int idx = ll - lo;
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | live.cpp | 237 void PhaseLive::add_liveout( Block *p, IndexSet *lo, VectorSet &first_pass ) { argument 243 IndexSetIterator elements(lo);
|
H A D | vectornode.cpp | 367 // 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; 372 PackNode* pk = PackNode::make(C, in(lo), 2, vect_type()->element_basic_type()); 373 pk->add_opd(in(lo+1)); 377 int mid = lo + ct/2; 378 PackNode* n1 = binary_tree_pack(C, lo, mid);
|
H A D | addnode.cpp | 347 int lo = r0->_lo + r1->_lo; local 351 if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) { 352 lo = min_jint; hi = max_jint; // Underflow on the low side 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) ); 465 jlong lo = r0->_lo + r1->_lo; local 469 if( (r0->_lo & r1->_lo) < 0 && lo > [all...] |
/openjdk7/jdk/make/tools/src/build/tools/generatebreakiteratordata/ |
H A D | CharSet.java | 367 * @param lo The lowest-numbered character to include in the range 370 public CharSet(int lo, int hi) { argument 372 if (lo <= hi) { 373 chars[0] = lo; 378 chars[1] = lo;
|
/openjdk7/langtools/test/tools/apt/mirror/declaration/ |
H A D | AnnoVal.java | 125 "float lo -1.0f/0.0f", 134 lo = -1.0f/0.0f, 195 float lo(); method in interface:AT3
|
/openjdk7/jdk/src/share/classes/sun/awt/geom/ |
H A D | Crossings.java | 431 public void insert(int cur, double lo, double hi, int dir) { argument 447 yranges[cur+0] = lo;
|
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | ComparableTimSort.java | 149 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); 176 binarySort(a, lo, lo + force, lo 213 binarySort(Object[] a, int lo, int hi, int start) argument 283 countRunAndMakeAscending(Object[] a, int lo, int hi) argument 309 reverseRange(Object[] a, int lo, int hi) argument [all...] |
H A D | TimSort.java | 176 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); 208 binarySort(a, lo, lo 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 D | ciStreams.cpp | 120 int lo = Bytes::get_Java_u4((address)&_table_base[1]);// Low bound local 122 int len = hi - lo + 1; // Dense table size
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | taskqueue.cpp | 131 int lo = seed % q; local 132 int test = a * lo - r * hi;
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | bands.cpp | 210 uint lo = lo_band.getInt(); local 213 return makeLong(0, lo); 216 return makeLong(hi, lo);
|
/openjdk7/jdk/src/share/classes/sun/nio/cs/ext/ |
H A D | SJIS_0213.java | 226 protected int encodeSurrogate(char hi, char lo) { argument 227 return mapping.encodeSurrogate(hi, lo);
|
/openjdk7/jdk/src/solaris/native/sun/awt/medialib/ |
H A D | mlib_v_ImageAffine_BL.c | 221 BL_SUM(lo); variable 239 BL_SUM(lo); variable 259 BL_SUM(lo); variable 303 #define BL_SUM_2CH() BL_SUM(lo) 427 #define BL_SUM_2CH_NA() BL_SUM(lo)
|
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/ |
H A D | cmssamp.c | 377 cmsFloat64Number lo, hi, NonMonoMin; local 521 lo = 0.1; 527 lo = 0.03; 545 if (ff >= lo && ff < hi) {
|
/openjdk7/jdk/src/share/classes/sun/nio/cs/ |
H A D | CharsetMapping.java | 111 public int encodeSurrogate(char hi, char lo) { argument 112 int cp = Character.toCodePoint(hi, lo);
|