LLVM 20.0.0git
|
#include "llvm/Analysis/MemorySSAUpdater.h"
Public Member Functions | |
MemorySSAUpdater (MemorySSA *MSSA) | |
void | insertDef (MemoryDef *Def, bool RenameUses=false) |
Insert a definition into the MemorySSA IR. | |
void | insertUse (MemoryUse *Use, bool RenameUses=false) |
void | removeEdge (BasicBlock *From, BasicBlock *To) |
Update the MemoryPhi in To following an edge deletion between From and To . | |
void | removeDuplicatePhiEdgesBetween (const BasicBlock *From, const BasicBlock *To) |
Update the MemoryPhi in To to have a single incoming edge from From , following a CFG change that replaced multiple edges (switch) with a direct branch. | |
void | updatePhisWhenInsertingUniqueBackedgeBlock (BasicBlock *LoopHeader, BasicBlock *LoopPreheader, BasicBlock *BackedgeBlock) |
Update MemorySSA when inserting a unique backedge block for a loop. | |
void | updateForClonedLoop (const LoopBlocksRPO &LoopBlocks, ArrayRef< BasicBlock * > ExitBlocks, const ValueToValueMapTy &VM, bool IgnoreIncomingWithNoClones=false) |
Update MemorySSA after a loop was cloned, given the blocks in RPO order, the exit blocks and a 1:1 mapping of all blocks and instructions cloned. | |
void | updateForClonedBlockIntoPred (BasicBlock *BB, BasicBlock *P1, const ValueToValueMapTy &VM) |
void | updateExitBlocksForClonedLoop (ArrayRef< BasicBlock * > ExitBlocks, const ValueToValueMapTy &VMap, DominatorTree &DT) |
Update phi nodes in exit block successors following cloning. | |
void | updateExitBlocksForClonedLoop (ArrayRef< BasicBlock * > ExitBlocks, ArrayRef< std::unique_ptr< ValueToValueMapTy > > VMaps, DominatorTree &DT) |
void | applyUpdates (ArrayRef< CFGUpdate > Updates, DominatorTree &DT, bool UpdateDTFirst=false) |
Apply CFG updates, analogous with the DT edge updates. | |
void | applyInsertUpdates (ArrayRef< CFGUpdate > Updates, DominatorTree &DT) |
Apply CFG insert updates, analogous with the DT edge updates. | |
void | moveBefore (MemoryUseOrDef *What, MemoryUseOrDef *Where) |
void | moveAfter (MemoryUseOrDef *What, MemoryUseOrDef *Where) |
void | moveToPlace (MemoryUseOrDef *What, BasicBlock *BB, MemorySSA::InsertionPlace Where) |
void | moveAllAfterSpliceBlocks (BasicBlock *From, BasicBlock *To, Instruction *Start) |
From block was spliced into From and To . | |
void | moveAllAfterMergeBlocks (BasicBlock *From, BasicBlock *To, Instruction *Start) |
From block was merged into To . | |
void | wireOldPredecessorsToNewImmediatePredecessor (BasicBlock *Old, BasicBlock *New, ArrayRef< BasicBlock * > Preds, bool IdenticalEdgesWereMerged=true) |
A new empty BasicBlock (New) now branches directly to Old. | |
MemoryAccess * | createMemoryAccessInBB (Instruction *I, MemoryAccess *Definition, const BasicBlock *BB, MemorySSA::InsertionPlace Point) |
Create a MemoryAccess in MemorySSA at a specified point in a block. | |
MemoryUseOrDef * | createMemoryAccessBefore (Instruction *I, MemoryAccess *Definition, MemoryUseOrDef *InsertPt) |
Create a MemoryAccess in MemorySSA before an existing MemoryAccess. | |
MemoryUseOrDef * | createMemoryAccessAfter (Instruction *I, MemoryAccess *Definition, MemoryAccess *InsertPt) |
Create a MemoryAccess in MemorySSA after an existing MemoryAccess. | |
void | removeMemoryAccess (MemoryAccess *, bool OptimizePhis=false) |
Remove a MemoryAccess from MemorySSA, including updating all definitions and uses. | |
void | removeMemoryAccess (const Instruction *I, bool OptimizePhis=false) |
Remove MemoryAccess for a given instruction, if a MemoryAccess exists. | |
void | removeBlocks (const SmallSetVector< BasicBlock *, 8 > &DeadBlocks) |
Remove all MemoryAcceses in a set of BasicBlocks about to be deleted. | |
void | changeToUnreachable (const Instruction *I) |
Instruction I will be changed to an unreachable. | |
MemorySSA * | getMemorySSA () const |
Get handle on MemorySSA. | |
Definition at line 54 of file MemorySSAUpdater.h.
|
inline |
Definition at line 66 of file MemorySSAUpdater.h.
void MemorySSAUpdater::applyInsertUpdates | ( | ArrayRef< CFGUpdate > | Updates, |
DominatorTree & | DT | ||
) |
Apply CFG insert updates, analogous with the DT edge updates.
Definition at line 835 of file MemorySSAUpdater.cpp.
References applyInsertUpdates().
Referenced by applyInsertUpdates(), applyUpdates(), and unswitchTrivialBranch().
void MemorySSAUpdater::applyUpdates | ( | ArrayRef< CFGUpdate > | Updates, |
DominatorTree & | DT, | ||
bool | UpdateDTFirst = false |
||
) |
Apply CFG updates, analogous with the DT edge updates.
By default, the DT is assumed to be already up to date. If UpdateDTFirst is true, first update the DT with the same updates.
Definition at line 784 of file MemorySSAUpdater.cpp.
References applyInsertUpdates(), llvm::DominatorTreeBase< NodeT, IsPostDom >::applyUpdates(), llvm::DominatorTreeBase< NodeT, IsPostDom >::Delete, llvm::SmallVectorBase< Size_T >::empty(), llvm::Empty, llvm::DominatorTreeBase< NodeT, IsPostDom >::Insert, llvm::SmallVectorTemplateBase< T, bool >::push_back(), and removeEdge().
Referenced by injectPendingInvariantConditions(), llvm::splitBlockBefore(), and unswitchTrivialSwitch().
void MemorySSAUpdater::changeToUnreachable | ( | const Instruction * | I | ) |
Instruction I will be changed to an unreachable.
Remove all accesses in I's block that follow I (inclusive), and update the Phis in the blocks' successors.
Definition at line 1383 of file MemorySSAUpdater.cpp.
References llvm::BasicBlock::end(), llvm::MemorySSA::getMemoryAccess(), I, llvm::SmallVectorTemplateBase< T, bool >::push_back(), removeDuplicatePhiEdgesBetween(), removeMemoryAccess(), llvm::Successor, and llvm::successors().
Referenced by llvm::changeToUnreachable().
MemoryUseOrDef * MemorySSAUpdater::createMemoryAccessAfter | ( | Instruction * | I, |
MemoryAccess * | Definition, | ||
MemoryAccess * | InsertPt | ||
) |
Create a MemoryAccess in MemorySSA after an existing MemoryAccess.
See createMemoryAccessInBB() for usage details.
Definition at line 1422 of file MemorySSAUpdater.cpp.
References assert(), llvm::MemorySSA::createDefinedAccess(), llvm::MemoryAccess::getBlock(), llvm::MemoryAccess::getIterator(), I, and llvm::MemorySSA::insertIntoListsBefore().
MemoryUseOrDef * MemorySSAUpdater::createMemoryAccessBefore | ( | Instruction * | I, |
MemoryAccess * | Definition, | ||
MemoryUseOrDef * | InsertPt | ||
) |
Create a MemoryAccess in MemorySSA before an existing MemoryAccess.
See createMemoryAccessInBB() for usage details.
Definition at line 1412 of file MemorySSAUpdater.cpp.
References assert(), llvm::MemorySSA::createDefinedAccess(), llvm::MemoryAccess::getBlock(), llvm::MemoryAccess::getIterator(), I, and llvm::MemorySSA::insertIntoListsBefore().
MemoryAccess * MemorySSAUpdater::createMemoryAccessInBB | ( | Instruction * | I, |
MemoryAccess * | Definition, | ||
const BasicBlock * | BB, | ||
MemorySSA::InsertionPlace | Point | ||
) |
Create a MemoryAccess in MemorySSA at a specified point in a block.
When used by itself, this method will only insert the new MemoryAccess into the access list, but not make any other changes, such as inserting MemoryPHI nodes, or updating users to point to the new MemoryAccess. You must specify a correct Definition in this case.
Usually, this API is instead combined with insertUse() or insertDef(), which will perform all the necessary MSSA updates. If these APIs are used, then nullptr can be used as Definition, as the correct defining access will be automatically determined.
Note: If a MemoryAccess already exists for I, this function will make it inaccessible and it must have removeMemoryAccess called on it.
Definition at line 1404 of file MemorySSAUpdater.cpp.
References llvm::MemorySSA::createDefinedAccess(), I, and llvm::MemorySSA::insertIntoListsForBlock().
Referenced by buildPartialInvariantUnswitchConditionalBranch(), cloneInstructionInExitBlock(), llvm::promoteLoopAccessesToScalars(), and sinkInstruction().
|
inline |
Get handle on MemorySSA.
Definition at line 239 of file MemorySSAUpdater.h.
Referenced by buildPartialInvariantUnswitchConditionalBranch(), llvm::canSinkOrHoistInst(), cloneInstructionInExitBlock(), collectUnswitchCandidates(), llvm::hoistRegion(), injectPendingInvariantConditions(), llvm::Loop::makeLoopInvariant(), llvm::MergeBlockIntoPredecessor(), mergeBlocksIntoPredecessors(), moveInstructionBefore(), llvm::promoteLoopAccessesToScalars(), simplifyLoopInst(), simplifyOneLoop(), sinkInstruction(), llvm::sinkRegion(), llvm::splitBlockBefore(), turnGuardIntoBranch(), turnSelectIntoBranch(), unswitchAllTrivialConditions(), unswitchNontrivialInvariants(), unswitchTrivialBranch(), and unswitchTrivialSwitch().
Insert a definition into the MemorySSA IR.
RenameUses will rename any use below the new def block (and any inserted phis). RenameUses should be set to true if the definition may cause new aliases for loads below it. This is not the case for hoisting or sinking or other forms of code movement. It is the case for straight code insertion. For example: store a if (foo) { } load a
Moving the store into the if block, and calling insertDef, does not require RenameUses. However, changing it to: store a if (foo) { store b } load a Where a mayalias b, does require RenameUses be set to true.
Definition at line 307 of file MemorySSAUpdater.cpp.
References llvm::SmallVectorImpl< T >::append(), llvm::simple_ilist< T, Options >::begin(), llvm::IDFCalculatorBase< NodeTy, IsPostDom >::calculate(), llvm::SmallVectorImpl< T >::clear(), llvm::SmallVectorBase< Size_T >::empty(), llvm::MemoryAccess::getBlock(), llvm::MemoryUseOrDef::getDefiningAccess(), llvm::MemorySSA::getLiveOnEntryDef(), llvm::MemorySSA::getMemoryAccess(), llvm::MemorySSA::getWritableBlockDefs(), llvm::SmallSet< T, N, C >::insert(), llvm::SmallPtrSetImpl< PtrType >::insert(), llvm::is_contained(), llvm::DominatorTree::isReachableFromEntry(), llvm::predecessors(), llvm::SmallVectorTemplateBase< T, bool >::push_back(), llvm::MemorySSA::renamePass(), llvm::Value::replaceUsesWithIf(), llvm::MemoryUseOrDef::setDefiningAccess(), and llvm::IDFCalculatorBase< NodeTy, IsPostDom >::setDefiningBlocks().
Referenced by cloneInstructionInExitBlock(), and sinkInstruction().
Definition at line 238 of file MemorySSAUpdater.cpp.
References assert(), llvm::MemoryAccess::getBlock(), llvm::MemorySSA::getBlockDefs(), llvm::MemorySSA::getWritableBlockDefs(), llvm::MemorySSA::renamePass(), and llvm::MemoryUseOrDef::setDefiningAccess().
Referenced by cloneInstructionInExitBlock(), llvm::promoteLoopAccessesToScalars(), and sinkInstruction().
void MemorySSAUpdater::moveAfter | ( | MemoryUseOrDef * | What, |
MemoryUseOrDef * | Where | ||
) |
Definition at line 1171 of file MemorySSAUpdater.cpp.
References llvm::MemoryAccess::getBlock(), and llvm::MemoryAccess::getIterator().
void MemorySSAUpdater::moveAllAfterMergeBlocks | ( | BasicBlock * | From, |
BasicBlock * | To, | ||
Instruction * | Start | ||
) |
From
block was merged into To
.
There is a CFG edge from To
to From
.To
still branches to From
, but all instructions were moved and From
is now an empty block; From
is about to be deleted. Move all accesses from From
to To
starting at instruction Start
. To
may have multiple successors, From
has a single predecessor. From
may have successors with MPhi nodes, replace their incoming block with To
. |---—| |---—|
To | To | |
---|---|---|
=> |
\/ | | |---—| | | <- Start | From | | | |---—| |---—|
Definition at line 1233 of file MemorySSAUpdater.cpp.
References assert(), From, llvm::MemorySSA::getMemoryAccess(), and llvm::successors().
Referenced by llvm::MergeBlockIntoPredecessor().
void MemorySSAUpdater::moveAllAfterSpliceBlocks | ( | BasicBlock * | From, |
BasicBlock * | To, | ||
Instruction * | Start | ||
) |
From
block was spliced into From
and To
.
There is a CFG edge from From
to To
. Move all accesses from From
to To
starting at instruction Start
. To
is newly created BB, so empty of MemorySSA::MemoryAccesses. Edges are already updated, so successors of To
with MPhi nodes need to update incoming block. |---—| |---—|
From | From | |
---|---|---|
| | => \/ | | |---—| <- Start | | | To | |---—| |---—|
Definition at line 1222 of file MemorySSAUpdater.cpp.
References assert(), From, llvm::MemorySSA::getBlockAccesses(), llvm::MemorySSA::getMemoryAccess(), and llvm::successors().
Referenced by SplitBlockImpl(), turnGuardIntoBranch(), and turnSelectIntoBranch().
void MemorySSAUpdater::moveBefore | ( | MemoryUseOrDef * | What, |
MemoryUseOrDef * | Where | ||
) |
Definition at line 1166 of file MemorySSAUpdater.cpp.
References llvm::MemoryAccess::getBlock(), and llvm::MemoryAccess::getIterator().
Referenced by moveToPlace().
void MemorySSAUpdater::moveToPlace | ( | MemoryUseOrDef * | What, |
BasicBlock * | BB, | ||
MemorySSA::InsertionPlace | Where | ||
) |
Definition at line 1175 of file MemorySSAUpdater.cpp.
References llvm::MemorySSA::BeforeTerminator, llvm::MemorySSA::End, llvm::MemorySSA::getMemoryAccess(), llvm::BasicBlock::getTerminator(), and moveBefore().
Referenced by llvm::Loop::makeLoopInvariant(), llvm::MergeBlockIntoPredecessor(), moveInstructionBefore(), runMoveAutoInit(), sinkInstruction(), and turnGuardIntoBranch().
void MemorySSAUpdater::removeBlocks | ( | const SmallSetVector< BasicBlock *, 8 > & | DeadBlocks | ) |
Remove all MemoryAcceses in a set of BasicBlocks about to be deleted.
Assumption we make here: all uses of deleted defs and phi must either occur in blocks about to be deleted (thus will be deleted as well), or they occur in phis that will simply lose an incoming value. Deleted blocks still have successor info, but their predecessor edges and Phi nodes may already be updated. Instructions in DeadBlocks should be deleted after this call.
Definition at line 1347 of file MemorySSAUpdater.cpp.
References assert(), llvm::SetVector< T, Vector, Set, N >::count(), llvm::User::dropAllReferences(), llvm::MemorySSA::getMemoryAccess(), llvm::BasicBlock::getTerminator(), llvm::MemorySSA::getWritableBlockAccesses(), llvm::make_early_inc_range(), llvm::MemorySSA::removeFromLists(), llvm::MemorySSA::removeFromLookups(), and llvm::successors().
Referenced by deleteDeadBlocksFromLoop(), deleteDeadClonedBlocks(), llvm::removeUnreachableBlocks(), and simplifyOneLoop().
void MemorySSAUpdater::removeDuplicatePhiEdgesBetween | ( | const BasicBlock * | From, |
const BasicBlock * | To | ||
) |
Update the MemoryPhi in To
to have a single incoming edge from From
, following a CFG change that replaced multiple edges (switch) with a direct branch.
Definition at line 538 of file MemorySSAUpdater.cpp.
References B, From, and llvm::MemorySSA::getMemoryAccess().
Referenced by changeToUnreachable(), and unswitchNontrivialInvariants().
void MemorySSAUpdater::removeEdge | ( | BasicBlock * | From, |
BasicBlock * | To | ||
) |
Update the MemoryPhi in To
following an edge deletion between From
and To
.
If To
becomes unreachable, a call to removeBlocks should be made.
Definition at line 531 of file MemorySSAUpdater.cpp.
References From, and llvm::MemorySSA::getMemoryAccess().
Referenced by applyUpdates(), DoFlattenLoopPair(), unswitchNontrivialInvariants(), and unswitchTrivialBranch().
|
inline |
Remove MemoryAccess for a given instruction, if a MemoryAccess exists.
This should be called when an instruction (load/store) is deleted from the program.
Definition at line 219 of file MemorySSAUpdater.h.
References llvm::MemorySSA::getMemoryAccess(), I, and removeMemoryAccess().
void MemorySSAUpdater::removeMemoryAccess | ( | MemoryAccess * | MA, |
bool | OptimizePhis = false |
||
) |
Remove a MemoryAccess from MemorySSA, including updating all definitions and uses.
This should be called when a memory instruction that has a MemoryAccess associated with it is erased from the program. For example, if a store or load is simply erased (not replaced), removeMemoryAccess should be called on the MemoryAccess for that store/load.
Definition at line 1280 of file MemorySSAUpdater.cpp.
References assert(), llvm::SetVector< T, Vector, Set, N >::begin(), llvm::SetVector< T, Vector, Set, N >::clear(), llvm::SetVector< T, Vector, Set, N >::empty(), llvm::SetVector< T, Vector, Set, N >::end(), llvm::Value::hasValueHandle(), llvm::SetVector< T, Vector, Set, N >::insert(), llvm::MemorySSA::isLiveOnEntryDef(), onlySingleValue(), llvm::MemorySSA::removeFromLists(), llvm::MemorySSA::removeFromLookups(), llvm::Value::use_begin(), llvm::Value::use_empty(), and llvm::ValueHandleBase::ValueIsRAUWd().
Referenced by changeToUnreachable(), eraseInstruction(), llvm::RecursivelyDeleteTriviallyDeadInstructions(), removeMemoryAccess(), and updateForClonedLoop().
void MemorySSAUpdater::updateExitBlocksForClonedLoop | ( | ArrayRef< BasicBlock * > | ExitBlocks, |
ArrayRef< std::unique_ptr< ValueToValueMapTy > > | VMaps, | ||
DominatorTree & | DT | ||
) |
Definition at line 770 of file MemorySSAUpdater.cpp.
References I.
void MemorySSAUpdater::updateExitBlocksForClonedLoop | ( | ArrayRef< BasicBlock * > | ExitBlocks, |
const ValueToValueMapTy & | VMap, | ||
DominatorTree & | DT | ||
) |
Update phi nodes in exit block successors following cloning.
Exit blocks that were not cloned don't have additional predecessors added.
Definition at line 762 of file MemorySSAUpdater.cpp.
Referenced by unswitchNontrivialInvariants().
void MemorySSAUpdater::updateForClonedBlockIntoPred | ( | BasicBlock * | BB, |
BasicBlock * | P1, | ||
const ValueToValueMapTy & | VM | ||
) |
Definition at line 731 of file MemorySSAUpdater.cpp.
References llvm::MemorySSA::getMemoryAccess().
void MemorySSAUpdater::updateForClonedLoop | ( | const LoopBlocksRPO & | LoopBlocks, |
ArrayRef< BasicBlock * > | ExitBlocks, | ||
const ValueToValueMapTy & | VM, | ||
bool | IgnoreIncomingWithNoClones = false |
||
) |
Update MemorySSA after a loop was cloned, given the blocks in RPO order, the exit blocks and a 1:1 mapping of all blocks and instructions cloned.
This involves duplicating all defs and uses in the cloned blocks Updating phi nodes in exit block successors is done separately.
Definition at line 667 of file MemorySSAUpdater.cpp.
References assert(), llvm::SmallPtrSetImpl< PtrType >::count(), llvm::MemorySSA::getMemoryAccess(), getNewDefiningAccessForClone(), llvm::MemorySSA::getWritableBlockAccesses(), llvm::ValueMap< KeyT, ValueT, Config >::lookup(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT, BucketT >::lookup(), onlySingleValue(), llvm::pred_begin(), llvm::pred_end(), ProcessBlock(), and removeMemoryAccess().
Referenced by unswitchNontrivialInvariants().
void MemorySSAUpdater::updatePhisWhenInsertingUniqueBackedgeBlock | ( | BasicBlock * | LoopHeader, |
BasicBlock * | LoopPreheader, | ||
BasicBlock * | BackedgeBlock | ||
) |
Update MemorySSA when inserting a unique backedge block for a loop.
Definition at line 628 of file MemorySSAUpdater.cpp.
References llvm::MemorySSA::getMemoryAccess(), I, and IV.
Referenced by insertUniqueBackedgeBlock().
void MemorySSAUpdater::wireOldPredecessorsToNewImmediatePredecessor | ( | BasicBlock * | Old, |
BasicBlock * | New, | ||
ArrayRef< BasicBlock * > | Preds, | ||
bool | IdenticalEdgesWereMerged = true |
||
) |
A new empty BasicBlock (New) now branches directly to Old.
Some of Old's predecessors (Preds) are now branching to New instead of Old. If New is the only predecessor, move Old's Phi, if present, to New. Otherwise, add a new Phi in New with appropriate incoming values, and update the incoming values in Old's Phi node too, if present.
Definition at line 1243 of file MemorySSAUpdater.cpp.
References assert(), B, llvm::ArrayRef< T >::begin(), llvm::MemorySSA::Beginning, llvm::SmallPtrSetImpl< PtrType >::count(), llvm::ArrayRef< T >::empty(), llvm::ArrayRef< T >::end(), llvm::MemorySSA::getMemoryAccess(), llvm::MemorySSA::getWritableBlockAccesses(), llvm::BasicBlock::hasNPredecessors(), llvm::MemorySSA::moveTo(), llvm::pred_size(), llvm::ArrayRef< T >::size(), and llvm::SmallPtrSetImplBase::size().
Referenced by UpdateAnalysisInformation().