Lines Matching defs:t1

87   const Type* t1 = (in1 == this) ? Type::TOP : phase->type(in1);
88 if( t1 == Type::TOP ) return Type::TOP;
97 if( t1 == Type::BOTTOM || t2 == Type::BOTTOM )
100 return sub(t1,t2); // Local flavor of type subtraction
180 const Type *t1 = phase->type( in1 );
181 if( t1 == Type::TOP ) return NULL;
205 if( t1 == TypeInt::ZERO && op2 == Op_SubI )
210 if( t1 == TypeInt::ZERO && op2 == Op_AddI &&
242 const Type *SubINode::sub( const Type *t1, const Type *t2 ) const {
243 const TypeInt *r0 = t1->is_int(); // Handy access
308 const Type *t1 = phase->type( in1 );
309 if( t1 == Type::TOP ) return NULL;
351 const Type *SubLNode::sub( const Type *t1, const Type *t2 ) const {
352 const TypeLong *r0 = t1->is_long(); // Handy access
375 const Type* t1 = (in1 == this) ? Type::TOP : phase->type(in1);
376 if( t1 == Type::TOP ) return Type::TOP;
382 if( (t1->is_finite() && t2->is_finite()) ) {
388 if( (t1 == bot) || (t2 == bot) ||
389 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) )
392 return sub(t1,t2); // Local flavor of type subtraction
423 const Type *SubFNode::sub( const Type *t1, const Type *t2 ) const {
425 if( g_isfinite(t1->getf()) && g_isfinite(t2->getf()) ) {
426 return TypeF::make( t1->getf() - t2->getf() );
428 else if( g_isnan(t1->getf()) ) {
429 return t1;
466 const Type *SubDNode::sub( const Type *t1, const Type *t2 ) const {
468 if( g_isfinite(t1->getd()) && g_isfinite(t2->getd()) ) {
469 return TypeD::make( t1->getd() - t2->getd() );
471 else if( g_isnan(t1->getd()) ) {
472 return t1;
495 const Type *CmpINode::sub( const Type *t1, const Type *t2 ) const {
496 const TypeInt *r0 = t1->is_int(); // Handy access
516 const Type *CmpUNode::sub( const Type *t1, const Type *t2 ) const {
517 assert(!t1->isa_ptr(), "obsolete usage of CmpU");
520 const TypeInt *r0 = t1->is_int(); // Handy access
602 const Type *CmpLNode::sub( const Type *t1, const Type *t2 ) const {
603 const TypeLong *r0 = t1->is_long(); // Handy access
625 const Type *CmpPNode::sub( const Type *t1, const Type *t2 ) const {
626 const TypePtr *r0 = t1->is_ptr(); // Handy access
863 const Type *CmpNNode::sub( const Type *t1, const Type *t2 ) const {
864 const TypePtr *r0 = t1->make_ptr(); // Handy access
948 const Type* t1 = (in1 == this) ? Type::TOP : phase->type(in1);
949 if( t1 == Type::TOP ) return Type::TOP;
955 const TypeF *tf1 = t1->isa_float_constant();
978 const Type* t1 = (in1 == this) ? Type::TOP : phase->type(in1);
979 if( t1 == Type::TOP ) return Type::TOP;
985 const TypeD *td1 = t1->isa_double_constant();
1305 const Type *t1 = phase->type( in(1) );
1306 if( t1 == Type::TOP ) return Type::TOP;
1307 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1308 double d = t1->getd();
1317 const Type *t1 = phase->type( in(1) );
1318 if( t1 == Type::TOP ) return Type::TOP;
1319 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1320 double d = t1->getd();
1328 const Type *t1 = phase->type( in(1) );
1329 if( t1 == Type::TOP ) return Type::TOP;
1330 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1331 double d = t1->getd();
1339 const Type *t1 = phase->type( in(1) );
1340 if( t1 == Type::TOP ) return Type::TOP;
1341 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1342 double d = t1->getd();
1350 const Type *t1 = phase->type( in(1) );
1351 if( t1 == Type::TOP ) return Type::TOP;
1352 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1353 double d = t1->getd();
1361 const Type *t1 = phase->type( in(1) );
1362 if( t1 == Type::TOP ) return Type::TOP;
1363 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1364 double d = t1->getd();
1372 const Type *t1 = phase->type( in(1) );
1373 if( t1 == Type::TOP ) return Type::TOP;
1374 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1375 double d = t1->getd();
1384 const Type *t1 = phase->type( in(1) );
1385 if( t1 == Type::TOP ) return Type::TOP;
1386 if( t1->base() != Type::DoubleCon ) return Type::DOUBLE;
1390 double d1 = t1->getd();