Searched refs:_lo (Results 1 - 19 of 19) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dtype.cpp265 assert( (juint)(TypeInt::CC->_hi - TypeInt::CC->_lo) <= SMALLINT, "CC is truly small");
1094 TypeInt::TypeInt( jint lo, jint hi, int w ) : Type(Int), _lo(lo), _hi(hi), _widen(w) {
1156 return make( MIN2(_lo,r->_lo), MAX2(_hi,r->_hi), MAX2(_widen,r->_widen) );
1162 int w = normalize_int_widen(_hi,_lo, WidenMax-_widen);
1163 return new TypeInt(_hi,_lo,w);
1174 if( _lo == ot->_lo && _hi == ot->_hi )
1178 if( _lo <= ot->_lo
[all...]
H A Daddnode.cpp316 if( t_in11 != Type::TOP && (t_in11->is_int()->_lo >= -(y << z)) ) {
347 int lo = r0->_lo + r1->_lo;
351 if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) {
465 jlong lo = r0->_lo + r1->_lo;
469 if( (r0->_lo & r1->_lo) < 0 && lo >= 0 ) {
844 return TypeInt::make( MAX2(r0->_lo,r
[all...]
H A Ddivnode.cpp116 if (dti && dti->_lo >= 0) {
369 if (dtl && dtl->_lo > 0) {
518 lo = i1->_lo/d;
521 if( d == -1 && i1->_lo == min_jint ) {
529 hi = i1->_lo/d;
617 lo = i1->_lo/d;
620 if( d == CONST64(-1) && i1->_lo == min_jlong ) {
628 hi = i1->_lo/d;
850 if( in(0) && (ti->_hi < 0 || ti->_lo > 0) ) {
931 if( dti && dti->_lo >
[all...]
H A Dmulnode.cpp237 int32 lo0 = r0->_lo;
241 int32 lo1 = r1->_lo;
333 jlong lo0 = r0->_lo;
337 jlong lo1 = r1->_lo;
446 if (t1 != NULL && t1->_lo >= 0) {
573 if (t1 != NULL && t1->_lo >= 0) {
734 jint lo = r1->_lo, hi = r1->_hi;
843 jlong lo = r1->_lo, hi = r1->_hi;
878 if( lo <= t11->_lo && t11->_hi <= hi )
989 jint lo = (jint)r1->_lo >> (jin
[all...]
H A Dsubnode.cpp245 int32 lo = r0->_lo - r1->_hi;
246 int32 hi = r0->_hi - r1->_lo;
250 if( (((r0->_lo ^ r1->_hi) >= 0) || // lo ends have same signs OR
251 ((r0->_lo ^ lo) >= 0)) && // lo results have same signs AND
252 (((r0->_hi ^ r1->_lo) >= 0) || // hi ends have same signs OR
354 jlong lo = r0->_lo - r1->_hi;
355 jlong hi = r0->_hi - r1->_lo;
359 if( (((r0->_lo ^ r1->_hi) >= 0) || // lo ends have same signs OR
360 ((r0->_lo ^ lo) >= 0)) && // lo results have same signs AND
361 (((r0->_hi ^ r1->_lo) >
[all...]
H A Dtype.hpp418 const jint _lo, _hi; // Lower bound, upper bound member in class:TypeInt
426 int is_con() const { return _lo==_hi; }
427 bool is_con(int i) const { return is_con() && _lo == i; }
428 jint get_con() const { assert( is_con(), "" ); return _lo; }
474 const jlong _lo, _hi; // Lower bound, upper bound member in class:TypeLong
482 int is_con() const { return _lo==_hi; }
483 bool is_con(int i) const { return is_con() && _lo == i; }
484 jlong get_con() const { assert( is_con(), "" ); return _lo; }
H A Dconnode.cpp644 if( ti->_hi < 0 || ti->_lo > 0 ) return TypeInt::ONE;
818 const Type* tl = TypeLong::make(ti->_lo, ti->_hi, ti->_widen);
844 (in_type->_lo != this_type->_lo ||
852 jlong lo1 = this_type->_lo;
869 const TypeLong* wtype = TypeLong::make(MAX2((jlong)in_type->_lo, lo1),
914 jlong xlo = tx->_lo;
916 jlong ylo = ty->_lo;
918 jlong zlo = tz->_lo;
1072 return (tl->_lo >
[all...]
H A Difnode.cpp617 jint lo = cmp2_t->_lo;
627 lo = TypeInt::INT->_lo;
633 lo = TypeInt::INT->_lo;
726 int bound = failtype->_hi - failtype->_lo + 1;
727 if (failtype->_hi != max_jint && failtype->_lo != min_jint && bound > 1) {
730 Node* adjusted = phase->transform(new (phase->C) SubINode(n, phase->intcon(failtype->_lo)));
738 if (failtype->_lo > failtype->_hi) {
H A DloopTransform.cpp685 if (iv_type->_lo + next_stride <= iv_type->_lo || // overflow
686 iv_type->_lo + next_stride > iv_type->_hi) {
691 iv_type->_hi + next_stride < iv_type->_lo) {
702 stride_con < 0 && ((limit_type->_lo - stride_con) <= limit_type->_lo))
1242 stride_con < 0 && ((limit_type->_lo - stride_con) > limit_type->_lo), "sanity");
1263 if (stride_con > 0 && ((limit_type->_lo - stride_con) < limit_type->_lo) ||
[all...]
H A Dloopnode.cpp394 // <= 32767 - 10 and (phi_ft->_lo) must be >= -32768 to
399 iv_trunc_t->_lo > phi_ft->_lo) {
403 if (iv_trunc_t->_lo - phi_ft->_lo > stride_con ||
430 jlong init_p = (jlong)init_t->_lo + stride_con;
435 if (init_p < (jlong)min_jint || init_p < (jlong)limit_t->_lo)
484 (stride_con < 0 && limit_t->_lo >= (min_jint - stride_m))) {
556 if (stride_con > 0 && init_t->_hi < limit_t->_lo)
559 if (stride_con < 0 && init_t->_lo > limit_
[all...]
H A Dparse2.cpp102 if (idxtype->_hi < sizetype->_lo && idxtype->_lo >= 0) {
239 jint _lo; // inclusive lower limit member in class:SwitchRange
245 jint lo() const { return _lo; }
249 bool is_singleton() const { return _lo == _hi; }
253 _lo = lo, _hi = hi; _dest = dest; _table_index = table_index;
521 min_val = ti->_lo;
H A Dcfgnode.cpp909 if( lo->_hi < hi->_lo ) // Reversed endpoints are well defined :-(
910 return TypeInt::make(lo->_lo,hi->_hi,3);
1027 jt->is_int()->_lo == ft->is_int()->_lo &&
1031 jt->is_long()->_lo == ft->is_long()->_lo &&
H A Dcallnode.cpp1234 narrow_length_type->_lo >= length_type->_lo),
H A DloopPredicate.cpp607 if (tint == NULL || tint->empty() || tint->_lo < 0) {
H A Dlibrary_call.cpp2019 lo = MAX2(txvalue->_lo, tyvalue->_lo);
2023 lo = MIN2(txvalue->_lo, tyvalue->_lo);
2075 offset_type->_lo >= 0 &&
H A Dmatcher.cpp2087 conv->as_Type()->type()->is_long()->_lo >= 0 &&
H A Dsuperword.cpp1451 if (t == NULL || t->_lo < 0 || t->_hi > (int)mask) {
H A Dcompile.cpp2885 if (t == NULL || t->_lo < 0 || t->_hi > (int)mask) {
H A DgraphKit.cpp3250 if (tllen != NULL && tllen->_lo < 0) {

Completed in 166 milliseconds