6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-07-30 02:25:19 +00:00
Code Issues Projects Releases Wiki Activity

LICM shouldn't sink/delete debug information. Fix this and add a testcase.

Browse Source 
For now the metadata of sinked/hoisted instructions is still wrong, but that'll
be fixed when instructions will have debug metadata directly attached.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@83786 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Torok Edwin
2009-10-11 19:15:54 +00:00
parent 95eb470ce1
commit 9289ae85b4
2 changed files with 94 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
lib/Transforms/Scalar/LICM.cpp
View File

@@ -35,6 +35,7 @@
#include "llvm/Transforms/Scalar.h"
#include "llvm/Constants.h"
#include "llvm/DerivedTypes.h"
#include "llvm/IntrinsicInst.h"
#include "llvm/Instructions.h"
#include "llvm/Target/TargetData.h"
#include "llvm/Analysis/LoopInfo.h"
@@ -140,6 +141,10 @@ namespace {
///
void HoistRegion(DomTreeNode *N);
// Cleanup debug information (remove stoppoints with no coressponding
// instructions).
void CleanupDbgInfoRegion(DomTreeNode *N);
/// inSubLoop - Little predicate that returns true if the specified basic
/// block is in a subloop of the current one, not the current one itself.
///
@@ -287,6 +292,7 @@ bool LICM::runOnLoop(Loop *L, LPPassManager &LPM) {
//
SinkRegion(DT->getNode(L->getHeader()));
HoistRegion(DT->getNode(L->getHeader()));
CleanupDbgInfoRegion(DT->getNode(L->getHeader()));
// Now that all loop invariants have been removed from the loop, promote any
// memory references to scalars that we can...
@@ -338,6 +344,35 @@ void LICM::SinkRegion(DomTreeNode *N) {
}
}
void LICM::CleanupDbgInfoRegion(DomTreeNode *N) {
BasicBlock *BB = N->getBlock();
// If this subregion is not in the top level loop at all, exit.
if (!CurLoop->contains(BB)) return;
// We are processing blocks in reverse dfo, so process children first...
const std::vector<DomTreeNode*> &Children = N->getChildren();
for (unsigned i = 0, e = Children.size(); i != e; ++i)
CleanupDbgInfoRegion(Children[i]);
// Only need to process the contents of this block if it is not part of a
// subloop (which would already have been processed).
if (inSubLoop(BB)) return;
// We modify the basicblock, so don't cache end()
for (BasicBlock::iterator I=BB->begin(); I != BB->end();) {
Instruction *Last = 0;
// Remove consecutive dbgstoppoints, leave only last
do {
if (Last) {
Last->eraseFromParent();
Changed = true;
}
Last = I;
++I;
} while (isa<DbgStopPointInst>(Last) && isa<DbgStopPointInst>(I));
}
}
/// HoistRegion - Walk the specified region of the CFG (defined by all blocks
/// dominated by the specified block, and that are in the current loop) in depth
@@ -392,6 +427,10 @@ bool LICM::canSinkOrHoistInst(Instruction &I) {
Size = AA->getTypeStoreSize(LI->getType());
return !pointerInvalidatedByLoop(LI->getOperand(0), Size);
} else if (CallInst *CI = dyn_cast<CallInst>(&I)) {
if (isa<DbgStopPointInst>(CI)) {
// Don't hoist/sink dbgstoppoints, we handle them separately
return false;
}
// Handle obvious cases efficiently.
AliasAnalysis::ModRefBehavior Behavior = AA->getModRefBehavior(CI);
if (Behavior == AliasAnalysis::DoesNotAccessMemory)
@@ -489,7 +528,6 @@ void LICM::sink(Instruction &I) {
// Move the instruction to the start of the exit block, after any PHI
// nodes in it.
I.removeFromParent();
BasicBlock::iterator InsertPt = ExitBlocks[0]->getFirstNonPHI();
ExitBlocks[0]->getInstList().insert(InsertPt, &I);
}