diff options
author | Dan Gohman <gohman@apple.com> | 2009-05-02 18:29:22 +0000 |
---|---|---|
committer | Dan Gohman <gohman@apple.com> | 2009-05-02 18:29:22 +0000 |
commit | afc36a9520971832dfbebc0333593bf5d3098296 (patch) | |
tree | 9f9a8cd11e9dfce8900d1a030300eed0ffca00a0 /include | |
parent | fb7d35f22a958747dd3ae8861ae3ce018146131c (diff) | |
download | external_llvm-afc36a9520971832dfbebc0333593bf5d3098296.zip external_llvm-afc36a9520971832dfbebc0333593bf5d3098296.tar.gz external_llvm-afc36a9520971832dfbebc0333593bf5d3098296.tar.bz2 |
Previously, RecursivelyDeleteDeadInstructions provided an option
of returning a list of pointers to Values that are deleted. This was
unsafe, because the pointers in the list are, by nature of what
RecursivelyDeleteDeadInstructions does, always dangling. Replace this
with a simple callback mechanism. This may eventually be removed if
all clients can reasonably be expected to use CallbackVH.
Use this to factor out the dead-phi-cycle-elimination code from LSR
utility function, and generalize it to use the
RecursivelyDeleteTriviallyDeadInstructions utility function.
This makes LSR more aggressive about eliminating dead PHI cycles;
adjust tests to either be less trivial or to simply expect fewer
instructions.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@70636 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include')
-rw-r--r-- | include/llvm/Transforms/Utils/BasicBlockUtils.h | 11 | ||||
-rw-r--r-- | include/llvm/Transforms/Utils/Local.h | 35 |
2 files changed, 39 insertions, 7 deletions
diff --git a/include/llvm/Transforms/Utils/BasicBlockUtils.h b/include/llvm/Transforms/Utils/BasicBlockUtils.h index a629b11..6105416 100644 --- a/include/llvm/Transforms/Utils/BasicBlockUtils.h +++ b/include/llvm/Transforms/Utils/BasicBlockUtils.h @@ -25,6 +25,7 @@ namespace llvm { class Instruction; class Pass; class AliasAnalysis; +class ValueDeletionListener; /// DeleteDeadBlock - Delete the specified block, which must have no /// predecessors. @@ -36,8 +37,14 @@ void DeleteDeadBlock(BasicBlock *BB); /// when all entries to the PHI nodes in a block are guaranteed equal, such as /// when the block has exactly one predecessor. void FoldSingleEntryPHINodes(BasicBlock *BB); - - + +/// DeleteDeadPHIs - Examine each PHI in the given block and delete it if it +/// is dead. Also recursively delete any operands that become dead as +/// a result. This includes tracing the def-use list from the PHI to see if +/// it is ultimately unused or if it reaches an unused cycle. If a +/// ValueDeletionListener is specified, it is notified of the deletions. +void DeleteDeadPHIs(BasicBlock *BB, ValueDeletionListener *VDL = 0); + /// MergeBlockIntoPredecessor - Attempts to merge a block into its predecessor, /// if possible. The return value indicates success or failure. bool MergeBlockIntoPredecessor(BasicBlock* BB, Pass* P = 0); diff --git a/include/llvm/Transforms/Utils/Local.h b/include/llvm/Transforms/Utils/Local.h index c3088a2..4cb46b0 100644 --- a/include/llvm/Transforms/Utils/Local.h +++ b/include/llvm/Transforms/Utils/Local.h @@ -50,16 +50,41 @@ bool ConstantFoldTerminator(BasicBlock *BB); /// bool isInstructionTriviallyDead(Instruction *I); - +/// ValueDeletionListener - A simple abstract interface for delivering +/// notifications when Values are deleted. +/// +/// @todo Consider whether ValueDeletionListener can be made obsolete by +/// requiring clients to use CallbackVH instead. +class ValueDeletionListener { +public: + /// ValueWillBeDeleted - This method is called shortly before the specified + /// value will be deleted. + virtual void ValueWillBeDeleted(Value *V) = 0; + +protected: + virtual ~ValueDeletionListener(); +}; + /// RecursivelyDeleteTriviallyDeadInstructions - If the specified value is a /// trivially dead instruction, delete it. If that makes any of its operands /// trivially dead, delete them too, recursively. /// -/// If DeadInst is specified, the vector is filled with the instructions that -/// are actually deleted. +/// If a ValueDeletionListener is specified, it is notified of instructions that +/// are actually deleted (before they are actually deleted). void RecursivelyDeleteTriviallyDeadInstructions(Value *V, - SmallVectorImpl<Instruction*> *DeadInst = 0); - + ValueDeletionListener *VDL = 0); + +/// RecursivelyDeleteDeadPHINode - If the specified value is an effectively +/// dead PHI node, due to being a def-use chain of single-use nodes that +/// either forms a cycle or is terminated by a trivially dead instruction, +/// delete it. If that makes any of its operands trivially dead, delete them +/// too, recursively. +/// +/// If a ValueDeletionListener is specified, it is notified of instructions that +/// are actually deleted (before they are actually deleted). +void RecursivelyDeleteDeadPHINode(PHINode *PN, + ValueDeletionListener *VDL = 0); + //===----------------------------------------------------------------------===// // Control Flow Graph Restructuring. // |