Lines Matching refs:in1

64   Node *in1 = add->in(1);
79 if (!in1->is_Load()) {
84 } else if( in1->is_Load() ) {
92 if( in1->is_Phi() && (phi = in1->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add)
100 if( in1->_idx > in2->_idx ) {
240 Node* in1 = in(1);
242 int op1 = in1->Opcode();
247 in1 = in2;
253 const Type *t_sub1 = phase->type( in1->in(1) );
257 in1->in(2) );
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));
292 return new (phase->C) SubINode(in1, in2->in(2) );
295 if( op1 == Op_SubI && phase->type(in1->in(1)) == TypeInt::ZERO )
296 return new (phase->C) SubINode( in2, in1->in(2) );
310 in1->in(2)->Opcode() == Op_ConI ) {
311 jint z = phase->type( in1->in(2) )->is_int()->get_con() & 0x1f; // only least significant 5 bits matter
315 const Type *t_in11 = phase->type(in1->in(1));
317 Node *a = phase->transform( new (phase->C) AddINode( in1->in(1), phase->intcon(y<<z) ) );
318 return new (phase->C) URShiftINode( a, in1->in(2) );
372 Node* in1 = in(1);
374 int op1 = in1->Opcode();
379 in1 = in2;
386 const Type *t_sub1 = phase->type( in1->in(1) );
390 in1->in(2) );
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));
417 if( op2 == Op_SubL && in1->in(1) == in1->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));
425 return new (phase->C) SubLNode( in1, in2->in(2) );
428 if( op1 == Op_SubL && phase->type(in1->in(1)) == TypeInt::ZERO )
429 return new (phase->C) SubLNode( in2, in1->in(2) );
434 in2->in(1) == in1 &&
437 Node *shift = phase->transform(new (phase->C) LShiftLNode(in1,phase->intcon(1)));