1.7.6.1Copyright © 2003-2014 University of Illinois at Urbana-Champaign. All Rights Reserved.
LLVM API Documentation
#include <SSAUpdaterImpl.h>
Classes | |
| class | BBInfo |
Public Member Functions | |
| SSAUpdaterImpl (UpdaterT *U, AvailableValsTy *A, SmallVectorImpl< PhiT * > *Ins) | |
| ValT | GetValue (BlkT *BB) |
| BBInfo * | BuildBlockList (BlkT *BB, BlockListTy *BlockList) |
| BBInfo * | IntersectDominators (BBInfo *Blk1, BBInfo *Blk2) |
| void | FindDominators (BlockListTy *BlockList, BBInfo *PseudoEntry) |
| bool | IsDefInDomFrontier (const BBInfo *Pred, const BBInfo *IDom) |
| void | FindPHIPlacement (BlockListTy *BlockList) |
| void | FindAvailableVals (BlockListTy *BlockList) |
| void | FindExistingPHI (BlkT *BB, BlockListTy *BlockList) |
| bool | CheckIfPHIMatches (PhiT *PHI) |
| void | RecordMatchingPHIs (BlockListTy *BlockList) |
Definition at line 33 of file SSAUpdaterImpl.h.
| llvm::SSAUpdaterImpl< UpdaterT >::SSAUpdaterImpl | ( | UpdaterT * | U, |
| AvailableValsTy * | A, | ||
| SmallVectorImpl< PhiT * > * | Ins | ||
| ) | [inline, explicit] |
Definition at line 72 of file SSAUpdaterImpl.h.
| BBInfo* llvm::SSAUpdaterImpl< UpdaterT >::BuildBlockList | ( | BlkT * | BB, |
| BlockListTy * | BlockList | ||
| ) | [inline] |
BuildBlockList - Starting from the specified basic block, traverse back through its predecessors until reaching blocks with known values. Create BBInfo structures for the blocks and append them to the block list.
Definition at line 102 of file SSAUpdaterImpl.h.
References llvm::BumpPtrAllocatorImpl< AllocatorT, SlabSize, SizeThreshold >::Allocate(), llvm::SmallVectorTemplateCommon< T >::back(), llvm::SmallVectorImpl< T >::clear(), llvm::SmallVectorBase::empty(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::FindAndConstruct(), llvm::DenseMapBase< DerivedT, KeyT, ValueT, KeyInfoT >::lookup(), llvm::SmallVectorTemplateBase< T, isPodLike< T >::value >::pop_back(), llvm::SmallVectorImpl< T >::pop_back_val(), llvm::SmallVectorTemplateBase< T, isPodLike< T >::value >::push_back(), llvm::SmallVectorTemplateBase< T, isPodLike >::push_back(), and llvm::SmallVectorTemplateCommon< T >::size().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::GetValue().
| bool llvm::SSAUpdaterImpl< UpdaterT >::CheckIfPHIMatches | ( | PhiT * | PHI | ) | [inline] |
CheckIfPHIMatches - Check if a PHI node matches the placement and values in the BBMap.
Definition at line 397 of file SSAUpdaterImpl.h.
References llvm::SmallVectorBase::empty(), I, llvm::TargetOpcode::PHI, llvm::SmallVectorImpl< T >::pop_back_val(), and llvm::SmallVectorTemplateBase< T, isPodLike< T >::value >::push_back().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::FindExistingPHI().
| void llvm::SSAUpdaterImpl< UpdaterT >::FindAvailableVals | ( | BlockListTy * | BlockList | ) | [inline] |
FindAvailableVal - If this block requires a PHI, first check if an existing PHI matches the PHI placement and reaching definitions computed earlier, and if not, create a new PHI. Visit all the block's predecessors to calculate the available value for each one and fill in the incoming values for a new PHI.
Definition at line 319 of file SSAUpdaterImpl.h.
References llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::dbgs(), DEBUG, llvm::SmallVectorTemplateCommon< T, typename >::end(), llvm::SSAUpdaterImpl< UpdaterT >::FindExistingPHI(), I, llvm::TargetOpcode::PHI, llvm::SmallVectorTemplateBase< T, isPodLike >::push_back(), llvm::SmallVectorTemplateCommon< T, typename >::rbegin(), and llvm::SmallVectorTemplateCommon< T, typename >::rend().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::GetValue().
| void llvm::SSAUpdaterImpl< UpdaterT >::FindDominators | ( | BlockListTy * | BlockList, |
| BBInfo * | PseudoEntry | ||
| ) | [inline] |
FindDominators - Calculate the dominator tree for the subset of the CFG corresponding to the basic blocks on the BlockList. This uses the algorithm from: "A Simple, Fast Dominance Algorithm" by Cooper, Harvey and Kennedy, published in Software--Practice and Experience, 2001, 4:1-10. Because the CFG subset does not include any edges leading into blocks that define the value, the results are not the usual dominator tree. The CFG subset has a single pseudo-entry node with edges to a set of root nodes for blocks that define the value. The dominators for this subset CFG are not the standard dominators but they are adequate for placing PHIs within the subset CFG.
Definition at line 228 of file SSAUpdaterImpl.h.
References I, llvm::SSAUpdaterImpl< UpdaterT >::IntersectDominators(), llvm::SmallVectorTemplateCommon< T, typename >::rbegin(), and llvm::SmallVectorTemplateCommon< T, typename >::rend().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::GetValue().
| void llvm::SSAUpdaterImpl< UpdaterT >::FindExistingPHI | ( | BlkT * | BB, |
| BlockListTy * | BlockList | ||
| ) | [inline] |
FindExistingPHI - Look through the PHI nodes in a block to see if any of them match what is needed.
Definition at line 378 of file SSAUpdaterImpl.h.
References llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::SSAUpdaterImpl< UpdaterT >::CheckIfPHIMatches(), llvm::SmallVectorTemplateCommon< T, typename >::end(), I, and llvm::SSAUpdaterImpl< UpdaterT >::RecordMatchingPHIs().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::FindAvailableVals().
| void llvm::SSAUpdaterImpl< UpdaterT >::FindPHIPlacement | ( | BlockListTy * | BlockList | ) | [inline] |
FindPHIPlacement - PHIs are needed in the iterated dominance frontiers of the known definitions. Iteratively add PHIs in the dom frontiers until nothing changes. Along the way, keep track of the nearest dominating definitions for non-PHI blocks.
Definition at line 282 of file SSAUpdaterImpl.h.
References I, llvm::SSAUpdaterImpl< UpdaterT >::IsDefInDomFrontier(), llvm::SmallVectorTemplateCommon< T, typename >::rbegin(), and llvm::SmallVectorTemplateCommon< T, typename >::rend().
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::GetValue().
| ValT llvm::SSAUpdaterImpl< UpdaterT >::GetValue | ( | BlkT * | BB | ) | [inline] |
GetValue - Check to see if AvailableVals has an entry for the specified BB and if so, return it. If not, construct SSA form by first calculating the required placement of PHIs and then inserting new PHIs where needed.
Definition at line 80 of file SSAUpdaterImpl.h.
References llvm::SSAUpdaterImpl< UpdaterT >::BuildBlockList(), llvm::SSAUpdaterImpl< UpdaterT >::FindAvailableVals(), llvm::SSAUpdaterImpl< UpdaterT >::FindDominators(), llvm::SSAUpdaterImpl< UpdaterT >::FindPHIPlacement(), and llvm::SmallVectorTemplateCommon< T >::size().
| BBInfo* llvm::SSAUpdaterImpl< UpdaterT >::IntersectDominators | ( | BBInfo * | Blk1, |
| BBInfo * | Blk2 | ||
| ) | [inline] |
IntersectDominators - This is the dataflow lattice "meet" operation for finding dominators. Given two basic blocks, it walks up the dominator tree until it finds a common dominator of both. It uses the postorder number of the blocks to determine how to do that.
Definition at line 202 of file SSAUpdaterImpl.h.
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::FindDominators().
| bool llvm::SSAUpdaterImpl< UpdaterT >::IsDefInDomFrontier | ( | const BBInfo * | Pred, |
| const BBInfo * | IDom | ||
| ) | [inline] |
IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for any blocks containing definitions of the value. If one is found, then the successor of Pred is in the dominance frontier for the definition, and this function returns true.
Definition at line 270 of file SSAUpdaterImpl.h.
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::FindPHIPlacement().
| void llvm::SSAUpdaterImpl< UpdaterT >::RecordMatchingPHIs | ( | BlockListTy * | BlockList | ) | [inline] |
RecordMatchingPHIs - For each PHI node that matches, record it in both the BBMap and the AvailableVals mapping.
Definition at line 444 of file SSAUpdaterImpl.h.
References llvm::SmallVectorTemplateCommon< T, typename >::begin(), llvm::SmallVectorTemplateCommon< T, typename >::end(), I, and llvm::TargetOpcode::PHI.
Referenced by llvm::SSAUpdaterImpl< UpdaterT >::FindExistingPHI().
Generated on Thu Sep 18 2014 04:11:46 for LLVM by
1.7.6.1
Copyright © 2003-2014 University of Illinois at Urbana-Champaign.
All Rights Reserved.