2008-06-04 09:18:41 +00:00
|
|
|
//===-- LiveStackAnalysis.cpp - Live Stack Slot Analysis ------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the live stack slot analysis pass. It is analogous to
|
|
|
|
// live interval analysis except it's analyzing liveness of stack slots rather
|
|
|
|
// than registers.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#define DEBUG_TYPE "livestacks"
|
|
|
|
#include "llvm/CodeGen/LiveStackAnalysis.h"
|
|
|
|
#include "llvm/CodeGen/Passes.h"
|
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
|
|
|
#include "llvm/Support/Debug.h"
|
|
|
|
#include "llvm/ADT/Statistic.h"
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
char LiveStacks::ID = 0;
|
|
|
|
static RegisterPass<LiveStacks> X("livestacks", "Live Stack Slot Analysis");
|
|
|
|
|
|
|
|
void LiveStacks::getAnalysisUsage(AnalysisUsage &AU) const {
|
2008-09-22 22:26:15 +00:00
|
|
|
AU.setPreservesAll();
|
2008-09-22 20:58:04 +00:00
|
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
2008-06-04 09:18:41 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void LiveStacks::releaseMemory() {
|
|
|
|
// Release VNInfo memroy regions after all VNInfo objects are dtor'd.
|
|
|
|
VNInfoAllocator.Reset();
|
|
|
|
s2iMap.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
bool LiveStacks::runOnMachineFunction(MachineFunction &) {
|
|
|
|
// FIXME: No analysis is being done right now. We are relying on the
|
|
|
|
// register allocators to provide the information.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// print - Implement the dump method.
|
|
|
|
void LiveStacks::print(std::ostream &O, const Module* ) const {
|
|
|
|
O << "********** INTERVALS **********\n";
|
|
|
|
for (const_iterator I = begin(), E = end(); I != E; ++I) {
|
|
|
|
I->second.print(O);
|
|
|
|
O << "\n";
|
|
|
|
}
|
|
|
|
}
|