mirror of
https://github.com/RPCSX/llvm.git
synced 2024-12-14 15:39:00 +00:00
Use DenseMap for pointer->pointer maps.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33897 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
05c0b9ad79
commit
93235181d6
@ -33,13 +33,13 @@
|
|||||||
#include "llvm/Pass.h"
|
#include "llvm/Pass.h"
|
||||||
#include "llvm/Function.h"
|
#include "llvm/Function.h"
|
||||||
#include "llvm/Instructions.h"
|
#include "llvm/Instructions.h"
|
||||||
|
#include "llvm/ADT/DenseMap.h"
|
||||||
#include "llvm/ADT/SetVector.h"
|
#include "llvm/ADT/SetVector.h"
|
||||||
#include "llvm/ADT/Statistic.h"
|
#include "llvm/ADT/Statistic.h"
|
||||||
#include "llvm/Analysis/Dominators.h"
|
#include "llvm/Analysis/Dominators.h"
|
||||||
#include "llvm/Analysis/LoopInfo.h"
|
#include "llvm/Analysis/LoopInfo.h"
|
||||||
#include "llvm/Support/CFG.h"
|
#include "llvm/Support/CFG.h"
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#include <map>
|
|
||||||
using namespace llvm;
|
using namespace llvm;
|
||||||
|
|
||||||
STATISTIC(NumLCSSA, "Number of live out of a loop variables");
|
STATISTIC(NumLCSSA, "Number of live out of a loop variables");
|
||||||
@ -71,7 +71,7 @@ namespace {
|
|||||||
SetVector<Instruction*> getLoopValuesUsedOutsideLoop(Loop *L);
|
SetVector<Instruction*> getLoopValuesUsedOutsideLoop(Loop *L);
|
||||||
|
|
||||||
Value *GetValueForBlock(DominatorTree::Node *BB, Instruction *OrigInst,
|
Value *GetValueForBlock(DominatorTree::Node *BB, Instruction *OrigInst,
|
||||||
std::map<DominatorTree::Node*, Value*> &Phis);
|
DenseMap<DominatorTree::Node*, Value*> &Phis);
|
||||||
|
|
||||||
/// inLoop - returns true if the given block is within the current loop
|
/// inLoop - returns true if the given block is within the current loop
|
||||||
const bool inLoop(BasicBlock* B) {
|
const bool inLoop(BasicBlock* B) {
|
||||||
@ -139,7 +139,7 @@ void LCSSA::ProcessInstruction(Instruction *Instr,
|
|||||||
++NumLCSSA; // We are applying the transformation
|
++NumLCSSA; // We are applying the transformation
|
||||||
|
|
||||||
// Keep track of the blocks that have the value available already.
|
// Keep track of the blocks that have the value available already.
|
||||||
std::map<DominatorTree::Node*, Value*> Phis;
|
DenseMap<DominatorTree::Node*, Value*> Phis;
|
||||||
|
|
||||||
DominatorTree::Node *InstrNode = DT->getNode(Instr->getParent());
|
DominatorTree::Node *InstrNode = DT->getNode(Instr->getParent());
|
||||||
|
|
||||||
@ -226,7 +226,7 @@ SetVector<Instruction*> LCSSA::getLoopValuesUsedOutsideLoop(Loop *L) {
|
|||||||
/// GetValueForBlock - Get the value to use within the specified basic block.
|
/// GetValueForBlock - Get the value to use within the specified basic block.
|
||||||
/// available values are in Phis.
|
/// available values are in Phis.
|
||||||
Value *LCSSA::GetValueForBlock(DominatorTree::Node *BB, Instruction *OrigInst,
|
Value *LCSSA::GetValueForBlock(DominatorTree::Node *BB, Instruction *OrigInst,
|
||||||
std::map<DominatorTree::Node*, Value*> &Phis) {
|
DenseMap<DominatorTree::Node*, Value*> &Phis) {
|
||||||
// If there is no dominator info for this BB, it is unreachable.
|
// If there is no dominator info for this BB, it is unreachable.
|
||||||
if (BB == 0)
|
if (BB == 0)
|
||||||
return UndefValue::get(OrigInst->getType());
|
return UndefValue::get(OrigInst->getType());
|
||||||
|
Loading…
Reference in New Issue
Block a user