Lines Matching defs:in2

85   const Node* in2 = in(2);
89 const Type* t2 = (in2 == this) ? Type::TOP : phase->type(in2);
94 if (in1->eqv_uncast(in2)) return add_id();
133 Node *in2 = in(2);
135 uint op2 = in2->Opcode();
139 if( phase->eqv( in1, this ) || phase->eqv( in2, this ) ||
146 const Type *t2 = phase->type( in2 );
158 if( op1 == Op_AddI && ok_to_convert(in1, in2) ) {
161 Node *sub2 = phase->transform( new (phase->C) SubINode( in1->in(1), in2 ));
169 if (op2 == Op_AddI && ok_to_convert(in2, in1)) {
170 Node* in21 = in2->in(1);
171 Node* in22 = in2->in(2);
186 ( phase->eqv( in2->in(1), this ) || phase->eqv( in2->in(2), this ) ||
187 phase->eqv( in2->in(1), in2 ) || phase->eqv( in2->in(2), in2 ) ) )
193 phase->eqv( in1, in2->in(1) ) )
194 return new (phase->C) SubINode( phase->intcon(0),in2->in(2));
197 phase->eqv( in1->in(1), in2 ) )
201 phase->eqv( in1, in2->in(2) ) )
202 return new (phase->C) SubINode( phase->intcon(0),in2->in(1));
206 return new (phase->C) SubINode( in2->in(2), in2->in(1) );
211 (con = in2->in(2)->find_int_con(0)) != 0 )
212 return new (phase->C) SubINode( phase->intcon(-con), in2->in(1) );
215 if( op1 == Op_AddI && op2 == Op_AddI && in1->in(1) == in2->in(1) )
216 return new (phase->C) SubINode( in1->in(2), in2->in(2) );
219 if( op1 == Op_AddI && op2 == Op_AddI && in1->in(2) == in2->in(2) )
220 return new (phase->C) SubINode( in1->in(1), in2->in(1) );
223 if( op1 == Op_AddI && op2 == Op_AddI && in1->in(2) == in2->in(1) )
224 return new (phase->C) SubINode( in1->in(1), in2->in(2) );
227 if( op1 == Op_AddI && op2 == Op_AddI && in1->in(1) == in2->in(2) )
228 return new (phase->C) SubINode( in1->in(2), in2->in(1) );
232 if( op2 == Op_SubI && in2->outcnt() == 1) {
233 Node *add1 = phase->transform( new (phase->C) AddINode( in1, in2->in(2) ) );
234 return new (phase->C) SubINode( add1, in2->in(1) );
263 Node *in2 = in(2);
265 uint op2 = in2->Opcode();
269 if( phase->eqv( in1, this ) || phase->eqv( in2, this ) ||
276 if( phase->type( in2 ) == Type::TOP ) return NULL;
277 const TypeLong *i = phase->type( in2 )->isa_long();
286 if( op1 == Op_AddL && ok_to_convert(in1, in2) ) {
290 Node *sub2 = phase->transform( new (phase->C) SubLNode( in11, in2 ));
297 if (op2 == Op_AddL && ok_to_convert(in2, in1)) {
298 Node* in21 = in2->in(1);
299 Node* in22 = in2->in(2);
314 ( phase->eqv( in2->in(1), this ) || phase->eqv( in2->in(2), this ) ||
315 phase->eqv( in2->in(1), in2 ) || phase->eqv( in2->in(2), in2 ) ) )
321 phase->eqv( in1, in2->in(1) ) )
322 return new (phase->C) SubLNode( phase->makecon(TypeLong::ZERO), in2->in(2));
325 phase->eqv( in1, in2->in(2) ) )
326 return new (phase->C) SubLNode( phase->makecon(TypeLong::ZERO),in2->in(1));
330 return new (phase->C) SubLNode( in2->in(2), in2->in(1) );
333 if( op1 == Op_AddL && op2 == Op_AddL && in1->in(1) == in2->in(1) )
334 return new (phase->C) SubLNode( in1->in(2), in2->in(2) );
337 if( op1 == Op_AddL && op2 == Op_AddL && in1->in(2) == in2->in(2) )
338 return new (phase->C) SubLNode( in1->in(1), in2->in(1) );
341 if( op2 == Op_SubL && in2->outcnt() == 1) {
342 Node *add1 = phase->transform( new (phase->C) AddLNode( in1, in2->in(2) ) );
343 return new (phase->C) SubLNode( add1, in2->in(1) );
373 const Node* in2 = in(2);
377 const Type* t2 = (in2 == this) ? Type::TOP : phase->type(in2);
383 if( phase->eqv(in1, in2) ) return add_id();
644 Node* in2 = in(2)->uncast();
646 AllocateNode* alloc2 = AllocateNode::Ideal_allocation(in2, NULL);
647 if (MemNode::detect_ptr_independence(in1, alloc1, in2, alloc2, NULL)) {
946 const Node* in2 = in(2);
950 const Type* t2 = (in2 == this) ? Type::TOP : phase->type(in2);
976 const Node* in2 = in(2);
980 const Type* t2 = (in2 == this) ? Type::TOP : phase->type(in2);