forked from OSchip/llvm-project
86 lines
2.9 KiB
C++
86 lines
2.9 KiB
C++
|
//===- MachineLoopRanges.cpp - Ranges of machine loops --------------------===//
|
||
|
|
//
|
||
|
|
// The LLVM Compiler Infrastructure
|
||
|
|
//
|
||
|
|
// This file is distributed under the University of Illinois Open Source
|
||
|
|
// License. See LICENSE.TXT for details.
|
||
|
|
//
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
//
|
||
|
|
// This file provides the implementation of the MachineLoopRanges analysis.
|
||
|
|
//
|
||
|
|
//===----------------------------------------------------------------------===//
|
||
|
|
|
||
|
|
#include "llvm/CodeGen/MachineLoopRanges.h"
|
||
|
|
#include "llvm/CodeGen/MachineLoopInfo.h"
|
||
|
|
#include "llvm/CodeGen/Passes.h"
|
||
|
|
|
||
|
|
using namespace llvm;
|
||
|
|
|
||
|
|
char MachineLoopRanges::ID = 0;
|
||
|
|
INITIALIZE_PASS_BEGIN(MachineLoopRanges, "machine-loop-ranges",
|
||
|
|
"Machine Loop Ranges", true, true)
|
||
|
|
INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
|
||
|
|
INITIALIZE_PASS_DEPENDENCY(MachineLoopInfo)
|
||
|
|
INITIALIZE_PASS_END(MachineLoopRanges, "machine-loop-ranges",
|
||
|
|
"Machine Loop Ranges", true, true)
|
||
|
|
|
||
|
|
char &llvm::MachineLoopRangesID = MachineLoopRanges::ID;
|
||
|
|
|
||
|
|
void MachineLoopRanges::getAnalysisUsage(AnalysisUsage &AU) const {
|
||
|
|
AU.setPreservesAll();
|
||
|
|
AU.addRequiredTransitive<SlotIndexes>();
|
||
|
|
AU.addRequiredTransitive<MachineLoopInfo>();
|
||
|
|
MachineFunctionPass::getAnalysisUsage(AU);
|
||
|
|
}
|
||
|
|
|
||
|
|
/// runOnMachineFunction - Don't do much, loop ranges are computed on demand.
|
||
|
|
bool MachineLoopRanges::runOnMachineFunction(MachineFunction &) {
|
||
|
|
releaseMemory();
|
||
|
|
Indexes = &getAnalysis<SlotIndexes>();
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
void MachineLoopRanges::releaseMemory() {
|
||
|
|
DeleteContainerSeconds(Cache);
|
||
|
|
Cache.clear();
|
||
|
|
}
|
||
|
|
|
||
|
|
MachineLoopRange *MachineLoopRanges::getLoopRange(const MachineLoop *Loop) {
|
||
|
|
MachineLoopRange *&Range = Cache[Loop];
|
||
|
|
if (!Range)
|
||
|
|
Range = new MachineLoopRange(Loop, Allocator, *Indexes);
|
||
|
|
return Range;
|
||
|
|
}
|
||
|
|
|
||
|
|
/// Create a MachineLoopRange, only accessible to MachineLoopRanges.
|
||
|
|
MachineLoopRange::MachineLoopRange(const MachineLoop *loop,
|
||
|
|
MachineLoopRange::Allocator &alloc,
|
||
|
|
SlotIndexes &Indexes)
|
||
|
|
: Loop(loop), Intervals(alloc) {
|
||
|
|
// Compute loop coverage.
|
||
|
|
for (MachineLoop::block_iterator I = Loop->block_begin(),
|
||
|
|
E = Loop->block_end(); I != E; ++I) {
|
||
|
|
const std::pair<SlotIndex, SlotIndex> &Range = Indexes.getMBBRange(*I);
|
||
|
|
Intervals.insert(Range.first, Range.second, 1u);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/// overlaps - Return true if this loop overlaps the given range of machine
|
||
|
|
/// instructions.
|
||
|
|
bool MachineLoopRange::overlaps(SlotIndex Start, SlotIndex Stop) {
|
||
|
|
RangeMap::const_iterator I = Intervals.find(Start);
|
||
|
|
return I.valid() && Stop > I.start();
|
||
|
|
}
|
||
|
|
|
||
|
|
void MachineLoopRange::print(raw_ostream &OS) const {
|
||
|
|
OS << "Loop#" << Loop->getHeader()->getNumber() << " =";
|
||
|
|
for (RangeMap::const_iterator I = Intervals.begin(); I.valid(); ++I)
|
||
|
|
OS << " [" << I.start() << ';' << I.stop() << ')';
|
||
|
|
}
|
||
|
|
|
||
|
|
raw_ostream &llvm::operator<<(raw_ostream &OS, const MachineLoopRange &MLR) {
|
||
|
|
MLR.print(OS);
|
||
|
|
return OS;
|
||
|
|
}
|