Searched defs:addp (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Daddnode.cpp577 const AddPNode *addp = n->as_AddP(); // Left input is an AddP local
578 assert( !addp->in(Address)->is_AddP() ||
579 addp->in(Address)->as_AddP() != addp,
582 const Type *t = phase->type( addp->in(Offset) );
594 address = addp->in(Address);
598 address = phase->transform(new (phase->C) AddPNode(in(Base),addp->in(Address),in(Offset)));
599 offset = addp->in(Offset);
H A Dcfgnode.cpp1744 Node* addp = in(1); local
1745 const Type* type = addp->in(AddPNode::Base)->bottom_type();
1746 Node* y = addp->in(AddPNode::Offset);
1747 if (y != NULL && addp->in(AddPNode::Base) == addp->in(AddPNode::Address)) {
H A Descape.cpp2090 Node* ConnectionGraph::get_addp_base(Node *addp) { argument
2091 assert(addp->is_AddP(), "must be AddP");
2153 Node *base = addp->in(AddPNode::Base);
2155 base = addp->in(AddPNode::Address);
2171 Node* ConnectionGraph::find_second_addp(Node* addp, Node* n) { argument
2172 assert(addp->is_AddP() && addp->outcnt() > 0, "Don't process dead nodes");
2173 Node* addp2 = addp->raw_out(0);
2174 if (addp->outcnt() == 1 && addp2->is_AddP() &&
2176 addp2->in(AddPNode::Address) == addp) {
2215 split_AddP(Node *addp, Node *base) argument
[all...]
H A Dmacro.cpp221 Node *addp = shift->unique_out(); local
222 for (DUIterator_Last jmin, j = addp->last_outs(jmin); j >= jmin; --j) {
223 Node *mem = addp->last_out(j);
H A Dcompile.cpp2574 Node *addp = n->in(AddPNode::Address); local
2575 assert( !addp->is_AddP() ||
2576 addp->in(AddPNode::Base)->is_top() || // Top OK for allocation
2577 addp->in(AddPNode::Base) == n->in(AddPNode::Base),
2581 addp->Opcode() == Op_ConP &&
2582 addp == n->in(AddPNode::Base) &&
2588 const Type* t = addp->bottom_type();
2609 if (addp->outcnt() == 0) {
2610 addp->disconnect_inputs(NULL, this);

Completed in 69 milliseconds