mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
e577f74bfa
`revamb-dump` is a tool to extract various information from the LLVM IR generated by `revamb` and output them in a more human-friendly format, typically CSV. The main source of information are the various metadata. Currently `revamb-dump` can collect the CFG, function boundaries and `noreturn` functions.
81 lines
1.9 KiB
C++
81 lines
1.9 KiB
C++
/// \file collectcfg.cpp
|
|
/// \brief Implementation of the pass to collect the CFG in a readable format.
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
// LLVM includes
|
|
#include "llvm/IR/Function.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
// Local includes
|
|
#include "datastructures.h"
|
|
#include "collectcfg.h"
|
|
#include "ir-helpers.h"
|
|
|
|
using namespace llvm;
|
|
|
|
char CollectCFG::ID = 0;
|
|
static RegisterPass<CollectCFG> X("ccfg", "Collect CFG Pass", true, true);
|
|
|
|
void CollectCFG::serialize(std::ostream &Output) {
|
|
Output << "source,destination\n";
|
|
for (auto &P : Result) {
|
|
BasicBlock *Source = P.first;
|
|
std::sort(P.second.begin(), P.second.end(), CompareByName<BasicBlock>());
|
|
for (BasicBlock *Destination : P.second)
|
|
Output << Source->getName().data() << ","
|
|
<< Destination->getName().data() << "\n";
|
|
}
|
|
}
|
|
|
|
bool CollectCFG::isNewInstruction(BasicBlock *BB) {
|
|
if (BB->empty())
|
|
return false;
|
|
|
|
auto *Call = dyn_cast<CallInst>(&*BB->begin());
|
|
if (Call == nullptr
|
|
|| Call->getCalledFunction() == nullptr
|
|
|| Call->getCalledFunction()->getName() != "newpc")
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
bool CollectCFG::runOnFunction(Function &F) {
|
|
Result.clear();
|
|
|
|
for (BasicBlock &BB : F) {
|
|
if (!isNewInstruction(&BB))
|
|
BlackList.insert(&BB);
|
|
else
|
|
break;
|
|
}
|
|
|
|
// For each basic block
|
|
for (BasicBlock &BB : F) {
|
|
if (!isNewInstruction(&BB))
|
|
continue;
|
|
|
|
OnceQueue<BasicBlock *> Queue;
|
|
Queue.insert(&BB);
|
|
while (!Queue.empty()) {
|
|
BasicBlock *ToExplore = Queue.pop();
|
|
for (BasicBlock *Successor : successors(ToExplore)) {
|
|
|
|
// If it's a new instruction register it, otherwise enqueue the basic
|
|
// block for further processing
|
|
if (isNewInstruction(Successor)) {
|
|
Result[&BB].push_back(Successor);
|
|
} else if (BlackList.count(Successor) == 0) {
|
|
Queue.insert(Successor);
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|