mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-28 07:05:03 +00:00
cca08872b0
The new library is 150KB on a Release+Asserts build, so it is quiet a bit of code that regular users of MC don't need to link with now. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@212209 91177308-0d34-0410-b5e6-96231b3b80d8
77 lines
2.3 KiB
C++
77 lines
2.3 KiB
C++
//===-- lib/MC/MCFunction.cpp -----------------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/MC/MCAnalysis/MCFunction.h"
|
|
#include "llvm/MC/MCAnalysis/MCAtom.h"
|
|
#include "llvm/MC/MCAnalysis/MCModule.h"
|
|
#include <algorithm>
|
|
|
|
using namespace llvm;
|
|
|
|
// MCFunction
|
|
|
|
MCFunction::MCFunction(StringRef Name, MCModule *Parent)
|
|
: Name(Name), ParentModule(Parent)
|
|
{}
|
|
|
|
MCBasicBlock &MCFunction::createBlock(const MCTextAtom &TA) {
|
|
std::unique_ptr<MCBasicBlock> MCBB(new MCBasicBlock(TA, this));
|
|
Blocks.push_back(std::move(MCBB));
|
|
return *Blocks.back();
|
|
}
|
|
|
|
MCBasicBlock *MCFunction::find(uint64_t StartAddr) {
|
|
for (const_iterator I = begin(), E = end(); I != E; ++I)
|
|
if ((*I)->getInsts()->getBeginAddr() == StartAddr)
|
|
return I->get();
|
|
return nullptr;
|
|
}
|
|
|
|
const MCBasicBlock *MCFunction::find(uint64_t StartAddr) const {
|
|
return const_cast<MCFunction *>(this)->find(StartAddr);
|
|
}
|
|
|
|
// MCBasicBlock
|
|
|
|
MCBasicBlock::MCBasicBlock(const MCTextAtom &Insts, MCFunction *Parent)
|
|
: Insts(&Insts), Parent(Parent) {
|
|
getParent()->getParent()->trackBBForAtom(&Insts, this);
|
|
}
|
|
|
|
void MCBasicBlock::addSuccessor(const MCBasicBlock *MCBB) {
|
|
if (!isSuccessor(MCBB))
|
|
Successors.push_back(MCBB);
|
|
}
|
|
|
|
bool MCBasicBlock::isSuccessor(const MCBasicBlock *MCBB) const {
|
|
return std::find(Successors.begin(), Successors.end(),
|
|
MCBB) != Successors.end();
|
|
}
|
|
|
|
void MCBasicBlock::addPredecessor(const MCBasicBlock *MCBB) {
|
|
if (!isPredecessor(MCBB))
|
|
Predecessors.push_back(MCBB);
|
|
}
|
|
|
|
bool MCBasicBlock::isPredecessor(const MCBasicBlock *MCBB) const {
|
|
return std::find(Predecessors.begin(), Predecessors.end(),
|
|
MCBB) != Predecessors.end();
|
|
}
|
|
|
|
void MCBasicBlock::splitBasicBlock(MCBasicBlock *SplitBB) {
|
|
assert(Insts->getEndAddr() + 1 == SplitBB->Insts->getBeginAddr() &&
|
|
"Splitting unrelated basic blocks!");
|
|
SplitBB->addPredecessor(this);
|
|
assert(SplitBB->Successors.empty() &&
|
|
"Split basic block shouldn't already have successors!");
|
|
SplitBB->Successors = Successors;
|
|
Successors.clear();
|
|
addSuccessor(SplitBB);
|
|
}
|