297 lines
12 KiB
Plaintext
297 lines
12 KiB
Plaintext
/*******************************************************************************
|
|
* Copyright (C) 2017, 2023 MINRES Technologies GmbH
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
*
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
*
|
|
* 3. Neither the name of the copyright holder nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*
|
|
*******************************************************************************/
|
|
// clang-format off
|
|
#include <iss/arch/${coreDef.name.toLowerCase()}.h>
|
|
#include <iss/debugger/gdb_session.h>
|
|
#include <iss/debugger/server.h>
|
|
#include <iss/iss.h>
|
|
#include <iss/asmjit/vm_base.h>
|
|
#include <asmjit/asmjit.h>
|
|
#include <util/logging.h>
|
|
|
|
#ifndef FMT_HEADER_ONLY
|
|
#define FMT_HEADER_ONLY
|
|
#endif
|
|
#include <fmt/format.h>
|
|
|
|
#include <array>
|
|
#include <iss/debugger/riscv_target_adapter.h>
|
|
|
|
namespace iss {
|
|
namespace asmjit {
|
|
|
|
|
|
namespace ${coreDef.name.toLowerCase()} {
|
|
using namespace ::asmjit;
|
|
using namespace iss::arch;
|
|
using namespace iss::debugger;
|
|
|
|
template <typename ARCH> class vm_impl : public iss::asmjit::vm_base<ARCH> {
|
|
public:
|
|
using traits = arch::traits<ARCH>;
|
|
using super = typename iss::asmjit::vm_base<ARCH>;
|
|
using virt_addr_t = typename super::virt_addr_t;
|
|
using phys_addr_t = typename super::phys_addr_t;
|
|
using code_word_t = typename super::code_word_t;
|
|
using mem_type_e = typename super::mem_type_e;
|
|
using addr_t = typename super::addr_t;
|
|
|
|
vm_impl();
|
|
|
|
vm_impl(ARCH &core, unsigned core_id = 0, unsigned cluster_id = 0);
|
|
|
|
void enableDebug(bool enable) { super::sync_exec = super::ALL_SYNC; }
|
|
|
|
target_adapter_if *accquire_target_adapter(server_if *srv) override {
|
|
debugger_if::dbg_enabled = true;
|
|
if (vm_base<ARCH>::tgt_adapter == nullptr)
|
|
vm_base<ARCH>::tgt_adapter = new riscv_target_adapter<ARCH>(srv, this->get_arch());
|
|
return vm_base<ARCH>::tgt_adapter;
|
|
}
|
|
|
|
protected:
|
|
using vm_base<ARCH>::get_reg_ptr;
|
|
using this_class = vm_impl<ARCH>;
|
|
using compile_func = continuation_e (this_class::*)(virt_addr_t&, code_word_t, jit_holder&);
|
|
|
|
continuation_e gen_single_inst_behavior(virt_addr_t&, unsigned int &, jit_holder&) override;
|
|
inline const char *name(size_t index){return traits::reg_aliases.at(index);}
|
|
|
|
template<unsigned W, typename U, typename S = typename std::make_signed<U>::type>
|
|
inline S sext(U from) {
|
|
auto mask = (1ULL<<W) - 1;
|
|
auto sign_mask = 1ULL<<(W-1);
|
|
return (from & mask) | ((from & sign_mask) ? ~mask : 0);
|
|
}
|
|
#include <vm/asmjit/helper_func.h>
|
|
|
|
private:
|
|
/****************************************************************************
|
|
* start opcode definitions
|
|
****************************************************************************/
|
|
struct instruction_descriptor {
|
|
size_t length;
|
|
uint32_t value;
|
|
uint32_t mask;
|
|
compile_func op;
|
|
};
|
|
struct decoding_tree_node{
|
|
std::vector<instruction_descriptor> instrs;
|
|
std::vector<decoding_tree_node*> children;
|
|
uint32_t submask = std::numeric_limits<uint32_t>::max();
|
|
uint32_t value;
|
|
decoding_tree_node(uint32_t value) : value(value){}
|
|
};
|
|
|
|
decoding_tree_node* root {nullptr};
|
|
|
|
const std::array<instruction_descriptor, ${instructions.size}> instr_descr = {{
|
|
/* entries are: size, valid value, valid mask, function ptr */<%instructions.each{instr -> %>
|
|
/* instruction ${instr.instruction.name}, encoding '${instr.encoding}' */
|
|
{${instr.length}, ${instr.encoding}, ${instr.mask}, &this_class::__${generator.functionName(instr.name)}},<%}%>
|
|
}};
|
|
|
|
/* instruction definitions */<%instructions.eachWithIndex{instr, idx -> %>
|
|
/* instruction ${idx}: ${instr.name} */
|
|
continuation_e __${generator.functionName(instr.name)}(virt_addr_t& pc, code_word_t instr, jit_holder& jh){
|
|
uint64_t PC = pc.val;
|
|
<%instr.fields.eachLine{%>${it}
|
|
<%}%>if(this->disass_enabled){
|
|
/* generate disass */
|
|
<%instr.disass.eachLine{%>
|
|
${it}<%}%>
|
|
InvokeNode* call_print_disass;
|
|
char* mnemonic_ptr = strdup(mnemonic.c_str());
|
|
jh.disass_collection.push_back(mnemonic_ptr);
|
|
jh.cc.invoke(&call_print_disass, &print_disass, FuncSignatureT<void, void *, uint64_t, char *>());
|
|
call_print_disass->setArg(0, jh.arch_if_ptr);
|
|
call_print_disass->setArg(1, pc.val);
|
|
call_print_disass->setArg(2, mnemonic_ptr);
|
|
|
|
}
|
|
x86::Compiler& cc = jh.cc;
|
|
cc.comment(fmt::format("\\n${instr.name}_{:#x}:",pc.val).c_str());
|
|
this->gen_sync(jh, PRE_SYNC, ${idx});
|
|
pc=pc+ ${instr.length/8};
|
|
|
|
gen_instr_prologue(jh, pc.val);
|
|
cc.comment("\\n//behavior:");
|
|
/*generate behavior*/
|
|
<%instr.behavior.eachLine{%>${it}
|
|
<%}%>
|
|
gen_instr_epilogue(jh);
|
|
this->gen_sync(jh, POST_SYNC, ${idx});
|
|
return returnValue;
|
|
}
|
|
<%}%>
|
|
/****************************************************************************
|
|
* end opcode definitions
|
|
****************************************************************************/
|
|
continuation_e illegal_intruction(virt_addr_t &pc, code_word_t instr, jit_holder& jh ) {
|
|
|
|
return BRANCH;
|
|
}
|
|
//decoding functionality
|
|
|
|
void populate_decoding_tree(decoding_tree_node* root){
|
|
//create submask
|
|
for(auto instr: root->instrs){
|
|
root->submask &= instr.mask;
|
|
}
|
|
//put each instr according to submask&encoding into children
|
|
for(auto instr: root->instrs){
|
|
bool foundMatch = false;
|
|
for(auto child: root->children){
|
|
//use value as identifying trait
|
|
if(child->value == (instr.value&root->submask)){
|
|
child->instrs.push_back(instr);
|
|
foundMatch = true;
|
|
}
|
|
}
|
|
if(!foundMatch){
|
|
decoding_tree_node* child = new decoding_tree_node(instr.value&root->submask);
|
|
child->instrs.push_back(instr);
|
|
root->children.push_back(child);
|
|
}
|
|
}
|
|
root->instrs.clear();
|
|
//call populate_decoding_tree for all children
|
|
if(root->children.size() >1)
|
|
for(auto child: root->children){
|
|
populate_decoding_tree(child);
|
|
}
|
|
else{
|
|
//sort instrs by value of the mask, this works bc we want to have the least restrictive one last
|
|
std::sort(root->children[0]->instrs.begin(), root->children[0]->instrs.end(), [](const instruction_descriptor& instr1, const instruction_descriptor& instr2) {
|
|
return instr1.mask > instr2.mask;
|
|
});
|
|
}
|
|
}
|
|
compile_func decode_instr(decoding_tree_node* node, code_word_t word){
|
|
if(!node->children.size()){
|
|
if(node->instrs.size() == 1) return node->instrs[0].op;
|
|
for(auto instr : node->instrs){
|
|
if((instr.mask&word) == instr.value) return instr.op;
|
|
}
|
|
}
|
|
else{
|
|
for(auto child : node->children){
|
|
if (child->value == (node->submask&word)){
|
|
return decode_instr(child, word);
|
|
}
|
|
}
|
|
}
|
|
return nullptr;
|
|
}
|
|
};
|
|
|
|
template <typename CODE_WORD> void debug_fn(CODE_WORD instr) {
|
|
volatile CODE_WORD x = instr;
|
|
instr = 2 * x;
|
|
}
|
|
|
|
template <typename ARCH> vm_impl<ARCH>::vm_impl() { this(new ARCH()); }
|
|
|
|
template <typename ARCH>
|
|
vm_impl<ARCH>::vm_impl(ARCH &core, unsigned core_id, unsigned cluster_id)
|
|
: vm_base<ARCH>(core, core_id, cluster_id) {
|
|
root = new decoding_tree_node(std::numeric_limits<uint32_t>::max());
|
|
for(auto instr: instr_descr){
|
|
root->instrs.push_back(instr);
|
|
}
|
|
populate_decoding_tree(root);
|
|
}
|
|
|
|
template <typename ARCH>
|
|
continuation_e
|
|
vm_impl<ARCH>::gen_single_inst_behavior(virt_addr_t &pc, unsigned int &inst_cnt, jit_holder& jh) {
|
|
enum {TRAP_ID=1<<16};
|
|
code_word_t instr = 0;
|
|
phys_addr_t paddr(pc);
|
|
auto *const data = (uint8_t *)&instr;
|
|
if(this->core.has_mmu())
|
|
paddr = this->core.virt2phys(pc);
|
|
auto res = this->core.read(paddr, 4, data);
|
|
if (res != iss::Ok)
|
|
throw trap_access(TRAP_ID, pc.val);
|
|
if (instr == 0x0000006f || (instr&0xffff)==0xa001)
|
|
throw simulation_stopped(0); // 'J 0' or 'C.J 0'
|
|
++inst_cnt;
|
|
auto f = decode_instr(root, instr);
|
|
if (f == nullptr)
|
|
f = &this_class::illegal_intruction;
|
|
return (this->*f)(pc, instr, jh);
|
|
}
|
|
|
|
|
|
|
|
} // namespace ${coreDef.name.toLowerCase()}
|
|
|
|
template <>
|
|
std::unique_ptr<vm_if> create<arch::${coreDef.name.toLowerCase()}>(arch::${coreDef.name.toLowerCase()} *core, unsigned short port, bool dump) {
|
|
auto ret = new ${coreDef.name.toLowerCase()}::vm_impl<arch::${coreDef.name.toLowerCase()}>(*core, dump);
|
|
if (port != 0) debugger::server<debugger::gdb_session>::run_server(ret, port);
|
|
return std::unique_ptr<vm_if>(ret);
|
|
}
|
|
} // namespace asmjit
|
|
} // namespace iss
|
|
|
|
#include <iss/factory.h>
|
|
#include <iss/arch/riscv_hart_m_p.h>
|
|
#include <iss/arch/riscv_hart_mu_p.h>
|
|
namespace iss {
|
|
namespace {
|
|
volatile std::array<bool, 2> dummy = {
|
|
core_factory::instance().register_creator("${coreDef.name.toLowerCase()}|m_p|asmjit", [](unsigned port, void* init_data) -> std::tuple<cpu_ptr, vm_ptr>{
|
|
auto* cpu = new iss::arch::riscv_hart_m_p<iss::arch::${coreDef.name.toLowerCase()}>();
|
|
auto vm = new asmjit::${coreDef.name.toLowerCase()}::vm_impl<arch::${coreDef.name.toLowerCase()}>(*cpu, false);
|
|
if (port != 0) debugger::server<debugger::gdb_session>::run_server(vm, port);
|
|
if(init_data){
|
|
auto* cb = reinterpret_cast<std::function<void(arch_if*, arch::traits<arch::${coreDef.name.toLowerCase()}>::reg_t, arch::traits<arch::${coreDef.name.toLowerCase()}>::reg_t)>*>(init_data);
|
|
cpu->set_semihosting_callback(*cb);
|
|
}
|
|
return {cpu_ptr{cpu}, vm_ptr{vm}};
|
|
}),
|
|
core_factory::instance().register_creator("${coreDef.name.toLowerCase()}|mu_p|asmjit", [](unsigned port, void* init_data) -> std::tuple<cpu_ptr, vm_ptr>{
|
|
auto* cpu = new iss::arch::riscv_hart_mu_p<iss::arch::${coreDef.name.toLowerCase()}>();
|
|
auto vm = new asmjit::${coreDef.name.toLowerCase()}::vm_impl<arch::${coreDef.name.toLowerCase()}>(*cpu, false);
|
|
if (port != 0) debugger::server<debugger::gdb_session>::run_server(vm, port);
|
|
if(init_data){
|
|
auto* cb = reinterpret_cast<std::function<void(arch_if*, arch::traits<arch::${coreDef.name.toLowerCase()}>::reg_t, arch::traits<arch::${coreDef.name.toLowerCase()}>::reg_t)>*>(init_data);
|
|
cpu->set_semihosting_callback(*cb);
|
|
}
|
|
return {cpu_ptr{cpu}, vm_ptr{vm}};
|
|
})
|
|
};
|
|
}
|
|
}
|
|
// clang-format on |