;;; stack top, then the receiver hasn't yet been reached on any walk
;;; to this use. In this case, we ignore the push for now, counting on
;;; Annotate-Dead-Values to clean it up if we discover that it isn't
;;; reachable at all.
;;;
;;; If our final stack isn't empty, then we walk all the predecessor
;;; stack top, then the receiver hasn't yet been reached on any walk
;;; to this use. In this case, we ignore the push for now, counting on
;;; Annotate-Dead-Values to clean it up if we discover that it isn't
;;; reachable at all.
;;;
;;; If our final stack isn't empty, then we walk all the predecessor