/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/ |
H A D | cmssamp.c | 377 cmsFloat64Number lo, hi, NonMonoMin; local 522 hi = 0.5; 528 hi = 0.25; 545 if (ff >= lo && ff < hi) {
|
/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | interp_masm_x86_32.hpp | 97 void pop_l(Register lo = rax, Register hi = rdx); 103 void push_l(Register lo = rax, Register hi = rdx);
|
/openjdk7/hotspot/src/share/vm/utilities/ |
H A D | taskqueue.cpp | 130 int hi = seed / q; local 132 int test = a * lo - r * hi;
|
/openjdk7/jdk/test/java/nio/file/Files/ |
H A D | BytesAndLines.java | 145 byte[] hi = { (byte)'h', (byte)'i' }; 146 write(tmpfile, hi); 149 assertTrue(lines.get(0).equals("hi"), "'Hi' expected"); 152 List<String> expected = Arrays.asList("hi", "there"); 198 List<String> lines = Arrays.asList("hi", "there");
|
/openjdk7/jdk/src/share/native/sun/java2d/pipe/ |
H A D | ShapeSpanIterator.c | 1247 int lo, cur, new, hi; local 1265 hi = pd->hiSegment; 1271 if (cur < hi) { 1275 cur = hi; 1284 if (cur <= hi) { 1294 if (cur >= hi) { 1322 lo = cur = hi = num; 1327 cur = new = hi; 1336 if (lo == hi && lo < num) { 1349 while (hi < nu [all...] |
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | sharedRuntimeTrans.cpp | 314 * Here r will be represented as r = hi-lo for better 385 double y,hi=0,lo=0,c,t; local 407 hi = x-ln2HI[xsb]; lo=ln2LO[xsb]; k = 1-xsb-xsb; 411 hi = x - t*ln2HI[0]; /* t*ln2HI is exact here */ 414 x = hi - lo; 425 else y = one-((lo-(x*c)/(2.0-c))-hi);
|
H A D | relocator.cpp | 230 int hi = int_at(bci + 1 + pad + 4 * 2); local 231 int n = hi - lo + 1; 359 int hi = int_at(bci + 1 + oldPad + 4 * 2); local 360 int n = hi - lo + 1; 738 len = high-low+1 + 3; // 3 for default, hi, lo.
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | divnode.cpp | 516 jint lo, hi; local 519 hi = i1->_hi/d; 524 // do not support holes, 'hi' must go to either min_jint or max_jint: 526 hi = i1->_hi == min_jint ? min_jint : max_jint; 529 hi = i1->_lo/d; 532 return TypeInt::make(lo, hi, widen); 615 jlong lo, hi; local 618 hi = i1->_hi/d; 623 // do not support holes, 'hi' must go to either min_jlong or max_jlong: 625 hi [all...] |
H A D | ifnode.cpp | 618 jint hi = cmp2_t->_hi; local 628 if (hi - 1 < hi) { 629 hi = hi - 1; 639 hi = TypeInt::INT->_hi; 643 hi = TypeInt::INT->_hi; 646 const TypeInt* rtn_t = TypeInt::make(lo, hi, cmp2_t->_widen); 684 int hi = this_cmp->in(2)->get_int(); local 728 // Merge the two compares into a single unsigned compare by building (CmpU (n - lo) hi) [all...] |
H A D | type.cpp | 1094 TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) { argument 1102 static int normalize_int_widen( jint lo, jint hi, int w ) { argument 1105 if (lo <= hi) { 1106 if ((juint)(hi - lo) <= SMALLINT) w = Type::WidenMin; 1107 if ((juint)(hi - lo) >= max_juint) w = Type::WidenMax; // TypeInt::INT 1109 if ((juint)(lo - hi) <= SMALLINT) w = Type::WidenMin; 1110 if ((juint)(lo - hi) >= max_juint) w = Type::WidenMin; // dual TypeInt::INT 1115 const TypeInt *TypeInt::make( jint lo, jint hi, int w ) { argument 1116 w = normalize_int_widen(lo, hi, 1349 TypeLong( jlong lo, jlong hi, int w ) argument 1357 normalize_long_widen( jlong lo, jlong hi, int w ) argument 1370 make( jlong lo, jlong hi, int w ) argument 3408 jint hi = size->_hi; local [all...] |
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; 379 PackNode* n2 = binary_tree_pack(C, mid, hi );
|
H A D | parse.hpp | 551 void jump_switch_ranges(Node* a, SwitchRange* lo, SwitchRange* hi, int depth = 0); 552 bool create_jump_tables(Node* a, SwitchRange* lo, SwitchRange* hi);
|
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/ |
H A D | Coding.java | 685 int hi; 686 hi = (lo >>> 16); 687 if (hi != 0) { 688 lo = hi; 691 hi = (lo >>> 8); 692 if (hi != 0) { 693 lo = hi;
|
/openjdk7/hotspot/src/share/vm/interpreter/ |
H A D | bytecodeTracer.cpp | 487 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/src/share/classes/sun/nio/cs/ext/ |
H A D | EUC_TW.java | 325 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 D | SJIS_0213.java | 226 protected int encodeSurrogate(char hi, char lo) { argument 227 return mapping.encodeSurrogate(hi, lo);
|
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciStreams.cpp | 121 int hi = Bytes::get_Java_u4((address)&_table_base[2]);// High bound local 122 int len = hi - lo + 1; // Dense table size
|
/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);
|
/openjdk7/hotspot/agent/src/os/bsd/ |
H A D | ps_core.c | 152 int mid, lo = 0, hi = ph->core->num_maps - 1; local 155 while (hi - lo > 1) { 156 mid = (lo + hi) / 2; 160 hi = mid; 163 if (addr < ph->core->map_array[hi]->vaddr) 166 mp = ph->core->map_array[hi];
|
/openjdk7/hotspot/agent/src/os/linux/ |
H A D | ps_core.c | 151 int mid, lo = 0, hi = ph->core->num_maps - 1; local 154 while (hi - lo > 1) { 155 mid = (lo + hi) / 2; 159 hi = mid; 162 if (addr < ph->core->map_array[hi]->vaddr) 165 mp = ph->core->map_array[hi];
|
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 2484 private final K hi; field in class:ConcurrentSkipListMap.SubMap 2487 /** inclusion flag for hi */ 2509 this.hi = toKey; 2527 if (hi != null) { 2528 int c = m.compare(key, hi); 2552 if (hi == null) 2557 int c = m.compare(k, hi); 2581 if (hi == null) 2584 return m.findNear(hi, m.LT|m.EQ); 2586 return m.findNear(hi, [all...] |
/openjdk7/hotspot/src/share/vm/code/ |
H A D | relocInfo.cpp | 636 int32_t hi = high(t); local 637 p = pack_2_ints_to(p, lo, hi); 638 DEBUG_ONLY(jlong t1 = jlong_from(hi, lo)); 650 int32_t lo, hi; 651 unpack_2_ints(lo, hi); 652 jlong t = jlong_from(hi, lo);;
|
/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 448 yranges[cur+1] = hi;
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | bands.h | 111 static jlong makeLong(uint hi, uint lo) { argument 112 return ((julong)hi << 32) + (((julong)lo << 32) >> 32);
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/jvm/ |
H A D | Gen.java | 1136 int hi = Integer.MIN_VALUE; // maximum label. 1148 if (hi < val) hi = val; 1159 long table_space_cost = 4 + ((long) hi - lo + 1); // words 1178 code.emit4(hi); // maximum label 1179 for (long i = lo; i <= hi; i++) { // leave space for jump table 1228 for (long i = lo; i <= hi; i++) { 1254 static void qsort2(int[] keys, int[] values, int lo, int hi) { argument 1256 int j = hi; 1273 if (i < hi) qsort [all...] |