Lines Matching defs:p1
458 bool MemNode::detect_ptr_independence(Node* p1, AllocateNode* a1,
466 return (p1 != p2) && p1->is_Con() && p2->is_Con();
473 return all_controls_dominate(p1, a2);
1560 // Yes, it is possible to encounter an expression like (LoadKlass p1:(AddP x x 8))
1562 // copy p0 of (AddP x x 8) has been proven equal to p1, and the p0 has been
1563 // subsumed by p1. If p1 is on the worklist but has not yet been re-transformed,
1564 // it is possible that p1 will have a type like Foo*[int+]:NotNull*+any.
1565 // In fact, that could have been the original type of p1, and p1 could have
1566 // had an original form like p1:(AddP x x (LShiftL quux 3)), where the