While investigating the performance of HashMap.get(k) I noticed that in cases where the static type of k is available C2 isn't taking advantage of the information in making it's inline decisions for get.  The problem is that Phis which are introduced for the join of a diamond aren't being eliminated aggressively during parsing when one of the paths is proved dead.  Additionally unneeded loop phis are hiding the type k in the search loop, impairing the inlining of equals.  Post parse inlining which remove the need for aggressive elimination of phis but for now we need a better strategy for simplification of phis.