Lines Matching defs:in2

65   Node *in2 = add->in(2);
78 if (in2->is_Load()) {
94 if( in2->is_Phi() && (phi = in2->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add){
100 if( in1->_idx > in2->_idx ) {
241 Node* in2 = in(2);
243 int op2 = in2->Opcode();
247 in1 = in2;
248 in2 = in(1);
250 op2 = in2->Opcode();
254 const Type *t_2 = phase->type( in2 );
261 assert( in1->in(2) != this && in2->in(2) != this,
264 sub->init_req(1, phase->transform(new (phase->C) AddINode(in1->in(1), in2->in(1) ) ));
265 sub->init_req(2, phase->transform(new (phase->C) AddINode(in1->in(2), in2->in(2) ) ));
269 if( op2 == Op_AddI && in1->in(2) == in2->in(1) ) {
270 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal");
271 return new (phase->C) AddINode(in1->in(1), in2->in(2));
274 if( op2 == Op_AddI && in1->in(2) == in2->in(2) ) {
275 assert(in1->in(1) != this && in2->in(1) != this,"dead loop in AddINode::Ideal");
276 return new (phase->C) AddINode(in1->in(1), in2->in(1));
279 if( op2 == Op_SubI && in1->in(2) == in2->in(1) ) {
280 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal");
281 return new (phase->C) SubINode(in1->in(1), in2->in(2));
284 if( op2 == Op_SubI && in1->in(1) == in2->in(2) ) {
285 assert(in1->in(2) != this && in2->in(1) != this,"dead loop in AddINode::Ideal");
286 return new (phase->C) SubINode(in2->in(1), in1->in(2));
291 if( op2 == Op_SubI && phase->type(in2->in(1)) == TypeInt::ZERO )
292 return new (phase->C) SubINode(in1, in2->in(2) );
296 return new (phase->C) SubINode( in2, in1->in(2) );
312 jint y = phase->type( in2 )->is_int()->get_con();
373 Node* in2 = in(2);
375 int op2 = in2->Opcode();
379 in1 = in2;
380 in2 = in(1);
382 op2 = in2->Opcode();
387 const Type *t_2 = phase->type( in2 );
394 assert( in1->in(2) != this && in2->in(2) != this,
397 sub->init_req(1, phase->transform(new (phase->C) AddLNode(in1->in(1), in2->in(1) ) ));
398 sub->init_req(2, phase->transform(new (phase->C) AddLNode(in1->in(2), in2->in(2) ) ));
402 if( op2 == Op_AddL && in1->in(2) == in2->in(1) ) {
403 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddLNode::Ideal");
404 return new (phase->C) AddLNode(in1->in(1), in2->in(2));
407 if( op2 == Op_AddL && in1->in(2) == in2->in(2) ) {
408 assert(in1->in(1) != this && in2->in(1) != this,"dead loop in AddLNode::Ideal");
409 return new (phase->C) AddLNode(in1->in(1), in2->in(1));
412 if( op2 == Op_SubL && in1->in(2) == in2->in(1) ) {
413 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddLNode::Ideal");
414 return new (phase->C) SubLNode(in1->in(1), in2->in(2));
418 assert(in1->in(2) != this && in2->in(1) != this,"dead loop in AddLNode::Ideal");
419 return new (phase->C) SubLNode(in2->in(1), in1->in(2));
424 if( op2 == Op_SubL && phase->type(in2->in(1)) == TypeLong::ZERO )
425 return new (phase->C) SubLNode( in1, in2->in(2) );
429 return new (phase->C) SubLNode( in2, in1->in(2) );
434 in2->in(1) == in1 &&
438 return new (phase->C) AddLNode(shift,in2->in(2));