Searched refs:is_int (Results 1 - 25 of 39) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/opto/
H A Daddnode.cpp311 jint z = phase->type( in1->in(2) )->is_int()->get_con() & 0x1f; // only least significant 5 bits matter
312 jint y = phase->type( in2 )->is_int()->get_con();
316 if( t_in11 != Type::TOP && (t_in11->is_int()->_lo >= -(y << z)) ) {
345 const TypeInt *r0 = t0->is_int(); // Handy access
346 const TypeInt *r1 = t1->is_int();
752 const TypeInt *r0 = t0->is_int(); // Handy access
753 const TypeInt *r1 = t1->is_int();
807 const TypeInt *r0 = t0->is_int(); // Handy access
808 const TypeInt *r1 = t1->is_int();
840 const TypeInt *r0 = t0->is_int(); // Hand
[all...]
H A Dmulnode.cpp233 const TypeInt *r0 = t0->is_int(); // Handy access
234 const TypeInt *r1 = t1->is_int();
407 const TypeInt *r0 = t0->is_int(); // Handy access
408 const TypeInt *r1 = t1->is_int();
720 const TypeInt *r1 = t1->is_int(); // Handy access
721 const TypeInt *r2 = t2->is_int(); // Handy access
830 const TypeInt *r2 = t2->is_int(); // Handy access
976 const TypeInt *r1 = t1->is_int(); // Handy access
977 const TypeInt *r2 = t2->is_int(); // Handy access
1039 const TypeInt *r2 = t2->is_int (); // Hand
[all...]
H A Dconnode.cpp48 case T_INT: return new (C) ConINode( t->is_int() );
197 case T_INT: return new (C) CMoveINode( bol, left, right, t->is_int() );
643 const TypeInt *ti = t->is_int();
788 const TypeInt *ti = t->is_int();
798 const TypeInt *ti = t->is_int();
817 const TypeInt *ti = t->is_int();
911 const TypeInt* tx = phase->type(x)->is_int();
912 const TypeInt* ty = phase->type(y)->is_int();
1241 const TypeInt *ti = t->is_int();
H A Dloopnode.cpp426 const TypeInt* init_t = gvn->type(init_trip)->is_int();
427 const TypeInt* limit_t = gvn->type(limit)->is_int();
873 return stride()->bottom_type()->is_int()->get_con();
887 int stride_con = stride_t->is_int()->get_con();
891 if (init_t->is_int()->is_con() && limit_t->is_int()->is_con()) {
893 jlong init_con = init_t->is_int()->get_con();
894 jlong limit_con = limit_t->is_int()->get_con();
916 int stride_con = phase->type(in(Stride))->is_int()->get_con();
928 const TypeInt* init_t = phase->type(in(Init) )->is_int();
[all...]
H A Dsubnode.cpp150 const TypeInt *i = t2->is_int();
243 const TypeInt *r0 = t1->is_int(); // Handy access
244 const TypeInt *r1 = t2->is_int();
496 const TypeInt *r0 = t1->is_int(); // Handy access
497 const TypeInt *r1 = t2->is_int();
520 const TypeInt *r0 = t1->is_int(); // Handy access
521 const TypeInt *r1 = t2->is_int();
1047 const TypeInt *ti = CC->is_int();
H A Ddivnode.cpp510 const TypeInt *i1 = t1->is_int();
511 const TypeInt *i2 = t2->is_int();
846 const TypeInt *ti = t->is_int();
986 const TypeInt *i1 = t1->is_int();
987 const TypeInt *i2 = t2->is_int();
H A DidealGraphPrinter.cpp529 if (t->base() == Type::Int && t->is_int()->is_con()) {
530 const TypeInt *typeInt = t->is_int();
H A Dtype.hpp224 const TypeInt *is_int() const;
1146 inline const TypeInt *Type::is_int() const {
1355 #define is_intptr_t is_int
H A Dlcm.cpp101 if (trtype->isa_int() && trtype->is_int()->is_con()) {
102 jint tr_con = trtype->is_int()->get_con();
H A DloopTransform.cpp682 const TypeInt* iv_type = phase->_igvn.type(phi)->is_int();
700 const TypeInt* limit_type = phase->_igvn.type(limit_n)->is_int();
1240 const TypeInt* limit_type = _igvn.type(limit)->is_int();
2113 const TypeInt* init_t = phase->_igvn.type(cl->init_trip())->is_int();
2114 const TypeInt* limit_t = phase->_igvn.type(cl->limit())->is_int();
H A Dtype.cpp1155 const TypeInt *r = t->is_int();
1171 const TypeInt *ot = old->is_int();
1190 max = limit->is_int()->_hi;
1191 min = limit->is_int()->_lo;
1268 const TypeInt *r = t->is_int(); // Handy access
1857 _size->xmeet(a->_size)->is_int());
1868 const TypeInt* size_dual = _size->dual()->is_int();
H A Dcallnode.cpp342 st->print(" %s%d]=#"INT32_FORMAT,msg,i,t->is_int()->get_con());
847 return call->in(TypeFunc::Parms)->bottom_type()->is_int()->get_con();
1175 if (type->isa_int() && type->is_int()->_hi < 0) {
H A Dcfgnode.cpp1027 jt->is_int()->_lo == ft->is_int()->_lo &&
1028 jt->is_int()->_hi == ft->is_int()->_hi)
H A Dmemnode.cpp909 case T_BOOLEAN: return new (C) LoadUBNode(ctl, mem, adr, adr_type, rt->is_int() );
910 case T_BYTE: return new (C) LoadBNode (ctl, mem, adr, adr_type, rt->is_int() );
911 case T_INT: return new (C) LoadINode (ctl, mem, adr, adr_type, rt->is_int() );
912 case T_CHAR: return new (C) LoadUSNode(ctl, mem, adr, adr_type, rt->is_int() );
913 case T_SHORT: return new (C) LoadSNode (ctl, mem, adr, adr_type, rt->is_int() );
3499 case T_INT: con = val->is_int()->get_con(); break;
3536 assert(con == tcon->is_int()->get_con(), "must be");
H A DloopPredicate.cpp832 assert(rng->Opcode() == Op_LoadRange || _igvn.type(rng)->is_int() >= 0, "must be");
H A Dparse2.cpp98 const TypeInt* idxtype = _gvn.type(idx)->is_int();
694 const TypeInt *ti = t->is_int();
/openjdk7/hotspot/src/share/vm/utilities/
H A DconstantTag.hpp59 bool is_int() const { return _tag == JVM_CONSTANT_Integer; } function in class:VALUE_OBJ_CLASS_SPEC
/openjdk7/hotspot/src/share/vm/runtime/
H A DfieldDescriptor.cpp113 if (t.is_int()) {
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp276 bool is_int(ciType* type) const {
299 assert(is_int(type_at_tos()), "must be integer");
303 assert(is_int(type_at(c)), "must be integer");
439 assert(is_int(type), "must be int type");
444 assert(is_int(type), "must be int type");
H A DciEnv.cpp592 if (tag.is_int()) {
/openjdk7/hotspot/src/share/vm/prims/
H A DmethodComparator.cpp386 if (tag_old.is_int() || tag_old.is_float()) {
389 if (tag_old.is_int()) {
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_ValueType.hpp118 bool is_int() { return tag() == intTag; } function in class:ValueType
/openjdk7/hotspot/src/share/vm/oops/
H A DcpCacheOop.hpp328 bool is_int() const { return flag_state() == itos; } function in class:VALUE_OBJ_CLASS_SPEC
H A DconstantPoolOop.hpp390 assert(tag_at(which).is_int(), "Corrupted constant pool");
/openjdk7/hotspot/src/share/vm/interpreter/
H A DbytecodeTracer.cpp297 if (tag.is_int()) {

Completed in 661 milliseconds

12