Searched defs:hi (Results 26 - 50 of 62) sorted by relevance

123

/openjdk7/jdk/src/share/classes/sun/nio/cs/
H A DCharsetMapping.java111 public int encodeSurrogate(char hi, char lo) { argument
112 int cp = Character.toCodePoint(hi, lo);
/openjdk7/jdk/src/share/classes/sun/font/
H A DLayoutPathImpl.java694 * lo <= x < hi. If we do, also return the pinned portion of ourselves in
697 boolean pin(double lo, double hi, LineInfo result) { argument
700 if (sx < hi && lx >= lo) {
705 if (lx > hi) {
706 if (m != 0) result.ly = ly + m * (hi - lx);
707 result.lx = hi;
712 if (lx < hi && sx >= lo) {
717 if (sx > hi) {
718 if (m != 0) result.sy = sy + m * (hi - sx);
719 result.sx = hi;
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dconnode.cpp1070 jint hi = max_jint; local
1072 return (tl->_lo >= lo) && (tl->_hi <= hi);
H A Ddivnode.cpp516 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 Dmulnode.cpp734 jint lo = r1->_lo, hi = r1->_hi; local
736 ((hi << shift) >> shift) == hi) {
739 (jint)hi << (jint)shift,
843 jlong lo = r1->_lo, hi = r1->_hi; local
845 ((hi << shift) >> shift) == hi) {
848 (jlong)hi << (jint)shift,
874 int hi = ~lo; // 00007FFF local
878 if( lo <= t11->_lo && t11->_hi <= hi )
990 jint hi = (jint)r1->_hi >> (jint)shift; local
1052 jlong hi = (jlong)r1->_hi >> (jlong)shift; local
1196 jint hi = (juint)r1->_hi >> (juint)shift; local
1325 jlong hi = (julong)r1->_hi >> (juint)shift; local
[all...]
H A Dsubnode.cpp246 int32 hi = r0->_hi - r1->_lo; local
252 (((r0->_hi ^ r1->_lo) >= 0) || // hi ends have same signs OR
253 ((r0->_hi ^ hi) >= 0)) ) // hi results have same signs
254 return TypeInt::make(lo,hi,MAX2(r0->_widen,r1->_widen));
355 jlong hi = r0->_hi - r1->_lo; local
361 (((r0->_hi ^ r1->_lo) >= 0) || // hi ends have same signs OR
362 ((r0->_hi ^ hi) >= 0)) ) // hi results have same signs
363 return TypeLong::make(lo,hi,MAX
[all...]
H A Difnode.cpp618 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 Dcfgnode.cpp902 const TypeInt *hi = limit->bottom_type()->isa_int(); local
903 if( lo && hi ) { // Dying loops might have TOP here
906 const TypeInt *tmp = lo; lo = hi; hi = tmp;
909 if( lo->_hi < hi->_lo ) // Reversed endpoints are well defined :-(
910 return TypeInt::make(lo->_lo,hi->_hi,3);
H A Dchaitin.cpp495 OptoReg::Name hi = lrg.reg(); // Get hi register local
496 OptoReg::Name lo = OptoReg::add(hi, (1-lrg.num_regs())); // Find lo
506 OptoReg::Name hi = lrg.reg(); // Get hi register local
507 lrg.Remove(hi); // Yank from mask
509 set_pair(i, hi, lo);
890 // hi-degree live range will not interfere with the color choices
891 // of said hi-degree live range. The Simplify reverse-stack-coloring
1050 // Pull from hi
[all...]
H A Dparse2.cpp246 jint hi() const { return _hi; } function in class:SwitchRange
251 void setRange(jint lo, jint hi, int dest, int table_index) { argument
252 assert(lo <= hi, "must be a non-empty range");
253 _lo = lo, _hi = hi; _dest = dest; _table_index = table_index;
255 bool adjoinRange(jint lo, jint hi, int dest, int table_index) { argument
256 assert(lo <= hi, "must be a non-empty range");
258 _hi = hi;
275 tty->print(" {..%d}=>%d", hi(), dest());
276 else if (hi() == max_jint)
279 tty->print(" {%d..%d}=>%d", lo(), hi(), des
489 jump_switch_ranges(Node* key_val, SwitchRange *lo, SwitchRange *hi, int switch_depth) argument
[all...]
/openjdk7/hotspot/src/share/vm/runtime/
H A Drelocator.cpp230 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.
H A DsharedRuntimeTrans.cpp314 * 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 Dos.cpp703 unsigned long hi = a * (long)((unsigned long)_rand_seed >> 16); local
704 lo += (hi & 0x7FFF) << 16;
711 lo += hi >> 15;
/openjdk7/hotspot/agent/src/os/bsd/
H A Dps_core.c152 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 Dps_core.c151 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/hotspot/src/share/vm/code/
H A DrelocInfo.cpp636 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/hotspot/src/cpu/sparc/vm/
H A DtemplateInterpreter_sparc.cpp1757 intptr_t* hi = interpreter_frame->fp() - rounded_vm_local_words; local
1758 assert(lo < monitors && montop <= hi, "monitors in bounds");
H A DnativeInst_sparc.hpp247 intptr_t hi = (intptr_t)gethi( (unsigned int *)pc ); local
250 return hi | lo;
262 int hi = Assembler::inv_hi22(sethi_insn); local
265 return hi | lo;
629 // sethi %hi(imm), reg; add reg, %lo(imm), reg; ld* [reg1 + reg], reg2
630 // sethi %hi(imm), reg; add reg, %lo(imm), reg; st* reg2, [reg1 + reg]
718 // sethi %hi(imm), reg; nop; add reg, %lo(imm), reg; ld* [reg1 + reg], reg2
719 // sethi %hi(imm), reg; nop; add reg, %lo(imm), reg; st* reg2, [reg1 + reg]
/openjdk7/jdk/src/share/classes/java/util/
H A DTreeMap.java1246 * loInclusive) and (toEnd, hi, hiInclusive). If fromStart is
1252 final K lo, hi; field in class:TreeMap.NavigableSubMap
1258 boolean toEnd, K hi, boolean hiInclusive) {
1260 if (m.compare(lo, hi) > 0)
1266 m.compare(hi, hi);
1274 this.hi = hi;
1291 int c = m.compare(key, hi);
1304 && (toEnd || m.compare(hi, ke
1256 NavigableSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1696 AscendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1774 DescendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
2362 buildFromSorted(int level, int lo, int hi, int redLevel, Iterator it, java.io.ObjectInputStream str, V defaultVal) argument
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentSkipListMap.java2484 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/oops/
H A DgenerateOopMap.cpp598 int lo = 0, hi = _bb_count - 1; local
600 while (lo <= hi) {
601 int m = (lo + hi) / 2;
618 hi = m - 1;
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dinterp_masm_x86_32.cpp323 void InterpreterMacroAssembler::pop_l(Register lo, Register hi) { argument
325 pop(hi);
363 void InterpreterMacroAssembler::push_l(Register lo, Register hi) { argument
364 push(hi);
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/jvm/
H A DGen.java1136 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...]
/openjdk7/jdk/src/share/native/sun/awt/libpng/
H A Dpng.c1785 long lo, hi, x, y; local
1797 hi = (y >> 16) & 0xffff;
1799 hi += a * c; /* AC */
1801 *hi_product = (unsigned long)hi;
/openjdk7/jdk/src/share/native/sun/java2d/pipe/
H A DShapeSpanIterator.c1247 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...]

Completed in 155 milliseconds

123