mirror of
https://github.com/TomHarte/CLK.git
synced 2024-07-18 04:28:57 +00:00
73 lines
2.3 KiB
C++
73 lines
2.3 KiB
C++
//
|
|
// Kernel.hpp
|
|
// Clock Signal
|
|
//
|
|
// Created by Thomas Harte on 31/12/2017.
|
|
// Copyright 2017 Thomas Harte. All rights reserved.
|
|
//
|
|
|
|
#ifndef Kernel_hpp
|
|
#define Kernel_hpp
|
|
|
|
namespace Analyser::Static::Disassembly {
|
|
|
|
template <typename D, typename S> struct PartialDisassembly {
|
|
D disassembly;
|
|
std::vector<S> remaining_entry_points;
|
|
std::map<S, S> touched; // Maps from start of range to end.
|
|
};
|
|
|
|
template <typename D, typename S, typename Disassembler> D Disassemble(
|
|
const std::vector<uint8_t> &memory,
|
|
const std::function<std::size_t(S)> &address_mapper,
|
|
std::vector<S> entry_points,
|
|
bool exhaustive)
|
|
{
|
|
PartialDisassembly<D, S> partial_disassembly;
|
|
partial_disassembly.remaining_entry_points = entry_points;
|
|
|
|
while(!partial_disassembly.remaining_entry_points.empty()) {
|
|
// Do a recursive-style disassembly for all current entry points.
|
|
while(!partial_disassembly.remaining_entry_points.empty()) {
|
|
// Pull the next entry point from the back of the vector.
|
|
const S next_entry_point = partial_disassembly.remaining_entry_points.back();
|
|
partial_disassembly.remaining_entry_points.pop_back();
|
|
|
|
// If that address has already been visited, forget about it.
|
|
if( partial_disassembly.disassembly.instructions_by_address.find(next_entry_point)
|
|
!= partial_disassembly.disassembly.instructions_by_address.end()) continue;
|
|
|
|
// If it's outgoing, log it as such and forget about it; otherwise disassemble.
|
|
std::size_t mapped_entry_point = address_mapper(next_entry_point);
|
|
if(mapped_entry_point >= memory.size())
|
|
partial_disassembly.disassembly.outward_calls.insert(next_entry_point);
|
|
else
|
|
Disassembler::AddToDisassembly(partial_disassembly, memory, address_mapper, next_entry_point);
|
|
}
|
|
|
|
// If this is not an exhaustive disassembly, that's your lot.
|
|
if(!exhaustive) {
|
|
break;
|
|
}
|
|
|
|
// Otherwise, find the first area between or just beyond a disassembled range
|
|
// that isn't yet disassembled and chuck it onto the list.
|
|
for(const auto &pair: partial_disassembly.touched) {
|
|
const auto end = pair.second;
|
|
if(partial_disassembly.touched.find(end) == partial_disassembly.touched.end()) {
|
|
if(address_mapper(end) < memory.size()) {
|
|
partial_disassembly.remaining_entry_points.push_back(end);
|
|
}
|
|
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
return partial_disassembly.disassembly;
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* Kernel_hpp */
|