/openjdk7/hotspot/src/share/vm/opto/ |
H A D | mulnode.hpp | 104 const Type *mul_id() const { return TypeLong::ONE; } 105 const Type *add_id() const { return TypeLong::ZERO; } 108 const Type *bottom_type() const { return TypeLong::LONG; } 150 const Type *bottom_type() const { return TypeLong::LONG; } 181 const Type *mul_id() const { return TypeLong::MINUS_1; } 182 const Type *add_id() const { return TypeLong::ZERO; } 210 const Type *bottom_type() const { return TypeLong::LONG; } 235 const Type *bottom_type() const { return TypeLong::LONG; } 262 const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | mulnode.cpp | 329 const TypeLong *r0 = t0->is_long(); // Handy access 330 const TypeLong *r1 = t1->is_long(); 344 if( (double)A != a*c ) return TypeLong::LONG; // Overflow? 346 if( (double)B != a*d ) return TypeLong::LONG; // Overflow? 348 if( (double)C != b*c ) return TypeLong::LONG; // Overflow? 350 if( (double)D != b*d ) return TypeLong::LONG; // Overflow? 361 return TypeLong::make(lo0, hi0, MAX2(r0->_widen,r1->_widen)); 397 return TypeLong::LONG; 539 const TypeLong *r0 = t0->is_long(); // Handy access 540 const TypeLong *r [all...] |
H A D | addnode.hpp | 94 virtual const Type *add_id() const { return TypeLong::ZERO; } 95 virtual const Type *bottom_type() const { return TypeLong::LONG; } 185 virtual const Type *add_id() const { return TypeLong::ZERO; } 186 virtual const Type *bottom_type() const { return TypeLong::LONG; } 210 virtual const Type *add_id() const { return TypeLong::ZERO; } 211 virtual const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | divnode.cpp | 367 const TypeLong *dtl = dt->isa_long(); 375 const TypeLong *andconl_t = phase->type( dividend->in(2) )->isa_long(); 558 return (phase->type( in(2) )->higher_equal(TypeLong::ONE)) ? in(1) : this; 569 if( t == TypeLong::ONE ) // Identity? 572 const TypeLong *tl = t->isa_long(); 599 return TypeLong::ONE; 609 const TypeLong *i1 = t1->is_long(); 610 const TypeLong *i2 = t2->is_long(); 631 return TypeLong::make(lo, hi, widen); 640 return TypeLong [all...] |
H A D | type.cpp | 267 TypeLong::MINUS_1 = TypeLong::make(-1); // -1 268 TypeLong::ZERO = TypeLong::make( 0); // 0 269 TypeLong::ONE = TypeLong::make( 1); // 1 270 TypeLong::POS = TypeLong::make(0,max_jlong, WidenMin); // Non-neg values 271 TypeLong::LONG = TypeLong 1349 TypeLong::TypeLong( jlong lo, jlong hi, int w ) : Type(Long), _lo(lo), _hi(hi), _widen(w) { function in class:TypeLong [all...] |
H A D | type.hpp | 50 class TypeLong; 226 const TypeLong *is_long() const; 227 const TypeLong *isa_long() const; // Returns NULL if not a Long 463 //------------------------------TypeLong--------------------------------------- 466 class TypeLong : public Type { class in inherits:Type 467 TypeLong( jlong lo, jlong hi, int w ); 477 static const TypeLong *make(jlong lo); 479 static const TypeLong *make(jlong lo, jlong hi, int w); 495 static const TypeLong *MINUS_1; 496 static const TypeLong *ZER [all...] |
H A D | connode.hpp | 96 ConLNode( const TypeLong *t ) : ConNode(t) {} 101 return new (C) ConLNode( TypeLong::make(con) ); 199 CMoveLNode(Node *bol, Node *left, Node *right, const TypeLong *tl ) : CMoveNode(bol,left,right,tl){} 355 virtual const Type *bottom_type() const { return TypeLong::LONG; } 392 virtual const Type *bottom_type() const { return TypeLong::LONG; } 426 ConvI2LNode(Node *in1, const TypeLong* t = TypeLong::INT) argument 633 virtual const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | addnode.cpp | 424 if( op2 == Op_SubL && phase->type(in2->in(1)) == TypeLong::ZERO ) 463 const TypeLong *r0 = t0->is_long(); // Handy access 464 const TypeLong *r1 = t1->is_long(); 483 return TypeLong::make( lo, hi, MAX2(r0->_widen,r1->_widen) ); 789 const TypeLong *r0 = t0->is_long(); // Handy access 790 const TypeLong *r1 = t1->is_long(); 794 return TypeLong::LONG; // Any integer, but still no symbols. 797 return TypeLong::make( r0->get_con() | r1->get_con() ); 825 const TypeLong *r0 = t0->is_long(); // Handy access 826 const TypeLong *r [all...] |
H A D | connode.cpp | 697 if( t == Type::DOUBLE ) return TypeLong::LONG; 699 return TypeLong::make( SharedRuntime::d2l( td->getd() ) ); 761 if( t == Type::FLOAT ) return TypeLong::LONG; 763 return TypeLong::make( SharedRuntime::f2l( tf->getf() ) ); 818 const Type* tl = TypeLong::make(ti->_lo, ti->_hi, ti->_widen); 834 const TypeLong* this_type = this->type()->is_long(); 869 const TypeLong* wtype = TypeLong::make(MAX2((jlong)in_type->_lo, lo1), 913 const TypeLong* tz = this_type; 963 Node* cx = phase->transform( new (phase->C) ConvI2LNode(x, TypeLong [all...] |
H A D | divnode.hpp | 63 virtual const Type *bottom_type() const { return TypeLong::LONG; } 113 virtual const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | subnode.cpp | 277 const TypeLong *i = phase->type( in2 )->isa_long(); 300 const TypeLong* tcon = phase->type(in22)->isa_long(); 322 return new (phase->C) SubLNode( phase->makecon(TypeLong::ZERO), in2->in(2)); 326 return new (phase->C) SubLNode( phase->makecon(TypeLong::ZERO),in2->in(1)); 329 if( phase->type( in1 ) == TypeLong::ZERO && op2 == Op_SubL ) 352 const TypeLong *r0 = t1->is_long(); // Handy access 353 const TypeLong *r1 = t2->is_long(); 363 return TypeLong::make(lo,hi,MAX2(r0->_widen,r1->_widen)); 365 return TypeLong::LONG; 603 const TypeLong *r [all...] |
H A D | subnode.hpp | 88 const Type *add_id() const { return TypeLong::ZERO; } 89 const Type *bottom_type() const { return TypeLong::LONG; } 539 const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | phaseX.hpp | 229 const TypeLong* find_long_type(Node* n); 235 const TypeLong* t = find_long_type(n); 245 // Fast int or long constant. Same as TypeInt::make(i) or TypeLong::make(l). 535 // giving up with TypeInt::INT or TypeLong::LONG.
|
H A D | split_if.cpp | 191 // to TypeLong::INT when pushing it up. 193 if (n->Opcode() == Op_ConvI2L && n->bottom_type() != TypeLong::INT) { 194 rtype = TypeLong::INT;
|
H A D | memnode.hpp | 302 const TypeLong *tl = TypeLong::LONG, 746 GetAndAddLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } 761 GetAndSetLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } 301 LoadLNode( Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeLong *tl = TypeLong::LONG, bool require_atomic_access = false ) argument
|
H A D | node.hpp | 945 const TypeLong* t = find_long_type(); 950 const TypeLong* t = find_long_type(); 953 const TypeLong* find_long_type() const;
|
H A D | idealGraphPrinter.cpp | 544 const TypeLong *typeLong = t->is_long();
|
H A D | vectornode.hpp | 614 virtual const Type *bottom_type() const { return TypeLong::LONG; }
|
H A D | runtime.cpp | 651 fields[TypeFunc::Parms+0] = TypeLong::LONG; 721 fields[TypeFunc::Parms+0] = TypeLong::LONG;
|
H A D | graphKit.cpp | 1618 const TypeLong* lidxtype = TypeLong::make(CONST64(0), index_max, Type::WidenMax); 3249 { const TypeLong* tllen = _gvn.find_long_type(lengthx); 3254 const TypeLong* tlcon = TypeLong::make(CONST64(0), size_max, Type::WidenMin);
|
H A D | parse2.cpp | 460 const TypeLong* lkeytype = TypeLong::make(CONST64(0), num_cases-1, Type::WidenMin); 1673 push_pair(make_load(control(), a, TypeLong::LONG, T_LONG, TypeAryPtr::LONGS));
|
H A D | phaseX.cpp | 490 const TypeLong* PhaseTransform::find_long_type(Node* n) { 643 ConLNode* lcon = (ConLNode*) uncached_makecon(TypeLong::make(l));
|
H A D | superword.cpp | 2349 const TypeLong* t = n->find_long_type(); 2350 if (t->higher_equal(TypeLong::INT)) {
|
H A D | library_call.cpp | 1740 correctedsign = _gvn.transform( CMoveNode::make(C, NULL, bolyplus1, signnode, longcon(0), TypeLong::LONG)); 1744 Node *phi = new (C) PhiNode(r, TypeLong::LONG); 2886 Node* tvalue = make_load(NULL, insp, TypeLong::LONG, T_LONG); 2908 threadid = ConvL2I(make_load(control(), p, TypeLong::LONG, T_LONG)); 3996 Node *phi = new (C) PhiNode(r, TypeLong::LONG);
|
H A D | node.cpp | 1376 const TypeLong* Node::find_long_type() const {
|