2024-03-01 20:02:47 +00:00
|
|
|
//
|
|
|
|
// Executor.hpp
|
|
|
|
// Clock Signal
|
|
|
|
//
|
|
|
|
// Created by Thomas Harte on 01/03/2024.
|
|
|
|
// Copyright © 2024 Thomas Harte. All rights reserved.
|
|
|
|
//
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "BarrelShifter.hpp"
|
|
|
|
#include "OperationMapper.hpp"
|
|
|
|
#include "Registers.hpp"
|
|
|
|
#include "../../Numeric/Carry.hpp"
|
|
|
|
|
|
|
|
namespace InstructionSet::ARM {
|
|
|
|
|
2024-03-25 15:07:44 +00:00
|
|
|
/// Maps from a semantic ARM read of type @c SourceT to either the 8- or 32-bit value observed
|
|
|
|
/// by watching the low 8 bits or all 32 bits of the data bus.
|
|
|
|
template <typename DestinationT, typename SourceT>
|
|
|
|
DestinationT read_bus(SourceT value) {
|
|
|
|
if constexpr (std::is_same_v<DestinationT, SourceT>) {
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
if constexpr (std::is_same_v<DestinationT, uint8_t>) {
|
|
|
|
return uint8_t(value);
|
|
|
|
} else {
|
|
|
|
return value | (value << 8) | (value << 16) | (value << 24);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-04-08 02:08:12 +00:00
|
|
|
struct NullStatusHandler {
|
|
|
|
void did_set_status() {}
|
|
|
|
};
|
|
|
|
|
2024-03-01 20:02:47 +00:00
|
|
|
/// A class compatible with the @c OperationMapper definition of a scheduler which applies all actions
|
|
|
|
/// immediately, updating either a set of @c Registers or using the templated @c MemoryT to access
|
|
|
|
/// memory. No hooks are currently provided for applying realistic timing.
|
2024-04-08 02:08:12 +00:00
|
|
|
///
|
|
|
|
/// If a StatusObserverT is specified, it'll receive calls to @c did_set_status() following every direct
|
|
|
|
/// write to the status bits — i.e. any change that can affect mode or interrupt flags.
|
|
|
|
template <Model model, typename MemoryT, typename StatusObserverT = NullStatusHandler>
|
2024-03-01 20:02:47 +00:00
|
|
|
struct Executor {
|
2024-04-08 02:08:12 +00:00
|
|
|
template <typename... Args>
|
|
|
|
Executor(StatusObserverT &observer, Args &&...args) : status_observer_(observer), bus(std::forward<Args>(args)...) {}
|
|
|
|
|
2024-03-12 15:34:31 +00:00
|
|
|
template <typename... Args>
|
2024-03-22 14:01:34 +00:00
|
|
|
Executor(Args &&...args) : bus(std::forward<Args>(args)...) {}
|
2024-03-12 15:34:31 +00:00
|
|
|
|
|
|
|
/// @returns @c true if @c condition implies an appropriate perform call should be made for this instruction,
|
|
|
|
/// @c false otherwise.
|
2024-03-01 20:02:47 +00:00
|
|
|
bool should_schedule(Condition condition) {
|
|
|
|
return registers_.test(condition);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <bool allow_register, bool set_carry, typename FieldsT>
|
|
|
|
uint32_t decode_shift(FieldsT fields, uint32_t &rotate_carry, uint32_t pc_offset) {
|
2024-03-01 23:06:54 +00:00
|
|
|
// "When R15 appears in the Rm position it will give the value of the PC together
|
|
|
|
// with the PSR flags to the barrel shifter. ...
|
|
|
|
//
|
|
|
|
// If the shift amount is specified in the instruction, the PC will be 8 bytes ahead.
|
|
|
|
// If a register is used to specify the shift amount, the PC will be ... 12 bytes ahead
|
|
|
|
// when used as Rn or Rm."
|
|
|
|
uint32_t operand2;
|
|
|
|
if(fields.operand2() == 15) {
|
|
|
|
operand2 = registers_.pc_status(pc_offset);
|
|
|
|
} else {
|
2024-03-04 02:43:30 +00:00
|
|
|
operand2 = registers_[fields.operand2()];
|
2024-03-01 23:06:54 +00:00
|
|
|
}
|
|
|
|
|
2024-04-02 01:24:49 +00:00
|
|
|
// TODO: in C++20, a quick `if constexpr (requires` can eliminate the `allow_register` parameter.
|
2024-03-01 20:02:47 +00:00
|
|
|
if constexpr (allow_register) {
|
|
|
|
if(fields.shift_count_is_register()) {
|
2024-04-02 01:24:49 +00:00
|
|
|
uint32_t shift_amount;
|
|
|
|
|
2024-03-01 20:02:47 +00:00
|
|
|
// "When R15 appears in either of the Rn or Rs positions it will give the value
|
|
|
|
// of the PC alone, with the PSR bits replaced by zeroes. ...
|
|
|
|
//
|
|
|
|
// If a register is used to specify the shift amount, the
|
|
|
|
// PC will be 8 bytes ahead when used as Rs."
|
|
|
|
shift_amount =
|
|
|
|
fields.shift_register() == 15 ?
|
2024-03-03 03:40:12 +00:00
|
|
|
registers_.pc(4) :
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[fields.shift_register()];
|
2024-03-01 23:06:54 +00:00
|
|
|
|
2024-03-11 03:38:31 +00:00
|
|
|
// "The amount by which the register should be shifted may be contained in
|
|
|
|
// ... **the bottom byte** of another register".
|
|
|
|
shift_amount &= 0xff;
|
2024-04-03 01:57:46 +00:00
|
|
|
shift<set_carry, false>(fields.shift_type(), operand2, shift_amount, rotate_carry);
|
2024-04-02 01:24:49 +00:00
|
|
|
return operand2;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-04-03 01:57:46 +00:00
|
|
|
shift<set_carry, true>(fields.shift_type(), operand2, fields.shift_amount(), rotate_carry);
|
2024-03-01 20:02:47 +00:00
|
|
|
return operand2;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <Flags f> void perform(DataProcessing fields) {
|
|
|
|
constexpr DataProcessingFlags flags(f);
|
|
|
|
const bool shift_by_register = !flags.operand2_is_immediate() && fields.shift_count_is_register();
|
|
|
|
|
|
|
|
// Write a raw result into the PC proxy if the target is R15; it'll be stored properly later.
|
|
|
|
uint32_t pc_proxy = 0;
|
2024-03-04 02:43:30 +00:00
|
|
|
auto &destination = fields.destination() == 15 ? pc_proxy : registers_[fields.destination()];
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
// "When R15 appears in either of the Rn or Rs positions it will give the value
|
|
|
|
// of the PC alone, with the PSR bits replaced by zeroes. ...
|
|
|
|
//
|
|
|
|
// If the shift amount is specified in the instruction, the PC will be 8 bytes ahead.
|
|
|
|
// If a register is used to specify the shift amount, the PC will be ... 12 bytes ahead
|
|
|
|
// when used as Rn or Rm."
|
|
|
|
const uint32_t operand1 =
|
|
|
|
(fields.operand1() == 15) ?
|
2024-03-03 03:40:12 +00:00
|
|
|
registers_.pc(shift_by_register ? 8 : 4) :
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[fields.operand1()];
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
uint32_t operand2;
|
|
|
|
uint32_t rotate_carry = registers_.c();
|
|
|
|
|
|
|
|
// Populate carry from the shift only if it'll be used.
|
|
|
|
constexpr bool shift_sets_carry = is_logical(flags.operation()) && flags.set_condition_codes();
|
|
|
|
|
|
|
|
// Get operand 2.
|
|
|
|
if constexpr (flags.operand2_is_immediate()) {
|
|
|
|
operand2 = fields.immediate();
|
2024-04-03 01:57:46 +00:00
|
|
|
shift<ShiftType::RotateRight, shift_sets_carry, false>(operand2, fields.rotate(), rotate_carry);
|
2024-03-01 20:02:47 +00:00
|
|
|
} else {
|
2024-03-03 03:40:12 +00:00
|
|
|
operand2 = decode_shift<true, shift_sets_carry>(fields, rotate_carry, shift_by_register ? 8 : 4);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t conditions = 0;
|
2024-03-11 18:52:48 +00:00
|
|
|
const auto sub = [&](uint32_t lhs, uint32_t rhs) {
|
|
|
|
conditions = lhs - rhs;
|
|
|
|
|
|
|
|
if constexpr (flags.operation() == DataProcessingOperation::SBC || flags.operation() == DataProcessingOperation::RSC) {
|
|
|
|
conditions += registers_.c() - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if constexpr (flags.set_condition_codes()) {
|
|
|
|
// "For a subtraction, including the comparison instruction CMP, C is set to 0 if
|
|
|
|
// the subtraction produced a borrow (that is, an unsigned underflow), and to 1 otherwise."
|
|
|
|
registers_.set_c(!Numeric::carried_out<false, 31>(lhs, rhs, conditions));
|
|
|
|
registers_.set_v(Numeric::overflow<false>(lhs, rhs, conditions));
|
|
|
|
}
|
|
|
|
|
|
|
|
if constexpr (!is_comparison(flags.operation())) {
|
|
|
|
destination = conditions;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// Perform the data processing operation.
|
2024-03-01 20:02:47 +00:00
|
|
|
switch(flags.operation()) {
|
|
|
|
// Logical operations.
|
|
|
|
case DataProcessingOperation::AND: conditions = destination = operand1 & operand2; break;
|
|
|
|
case DataProcessingOperation::EOR: conditions = destination = operand1 ^ operand2; break;
|
|
|
|
case DataProcessingOperation::ORR: conditions = destination = operand1 | operand2; break;
|
|
|
|
case DataProcessingOperation::BIC: conditions = destination = operand1 & ~operand2; break;
|
|
|
|
|
|
|
|
case DataProcessingOperation::MOV: conditions = destination = operand2; break;
|
|
|
|
case DataProcessingOperation::MVN: conditions = destination = ~operand2; break;
|
|
|
|
|
|
|
|
case DataProcessingOperation::TST: conditions = operand1 & operand2; break;
|
|
|
|
case DataProcessingOperation::TEQ: conditions = operand1 ^ operand2; break;
|
|
|
|
|
|
|
|
case DataProcessingOperation::ADD:
|
|
|
|
case DataProcessingOperation::ADC:
|
|
|
|
case DataProcessingOperation::CMN:
|
|
|
|
conditions = operand1 + operand2;
|
|
|
|
|
|
|
|
if constexpr (flags.operation() == DataProcessingOperation::ADC) {
|
|
|
|
conditions += registers_.c();
|
|
|
|
}
|
|
|
|
|
|
|
|
if constexpr (flags.set_condition_codes()) {
|
|
|
|
registers_.set_c(Numeric::carried_out<true, 31>(operand1, operand2, conditions));
|
|
|
|
registers_.set_v(Numeric::overflow<true>(operand1, operand2, conditions));
|
|
|
|
}
|
|
|
|
|
|
|
|
if constexpr (!is_comparison(flags.operation())) {
|
|
|
|
destination = conditions;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case DataProcessingOperation::SUB:
|
|
|
|
case DataProcessingOperation::SBC:
|
|
|
|
case DataProcessingOperation::CMP:
|
2024-03-11 18:52:48 +00:00
|
|
|
sub(operand1, operand2);
|
2024-03-01 20:02:47 +00:00
|
|
|
break;
|
|
|
|
|
|
|
|
case DataProcessingOperation::RSB:
|
|
|
|
case DataProcessingOperation::RSC:
|
2024-03-11 18:52:48 +00:00
|
|
|
sub(operand2, operand1);
|
2024-03-01 20:02:47 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2024-03-12 13:13:05 +00:00
|
|
|
if(!is_comparison(flags.operation()) && fields.destination() == 15) {
|
2024-03-11 18:48:43 +00:00
|
|
|
registers_.set_pc(pc_proxy);
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
if constexpr (flags.set_condition_codes()) {
|
2024-03-12 14:42:09 +00:00
|
|
|
// "When Rd is R15 and the S flag in the instruction is set, the PSR is overwritten by the
|
|
|
|
// corresponding bits in the ALU result... [even] if the instruction is of a type that does not
|
|
|
|
// normally produce a result (CMP, CMN, TST, TEQ) ... the result will be used to update those
|
|
|
|
// PSR flags which are not protected by virtue of the processor mode"
|
|
|
|
if(fields.destination() == 15) {
|
2024-03-12 13:13:05 +00:00
|
|
|
registers_.set_status(conditions);
|
2024-04-08 02:08:12 +00:00
|
|
|
status_observer_.did_set_status();
|
2024-03-01 20:02:47 +00:00
|
|
|
} else {
|
|
|
|
// Set N and Z in a unified way.
|
|
|
|
registers_.set_nz(conditions);
|
|
|
|
|
|
|
|
// Set C from the barrel shifter if applicable.
|
|
|
|
if constexpr (shift_sets_carry) {
|
|
|
|
registers_.set_c(rotate_carry);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template <Flags f> void perform(Multiply fields) {
|
|
|
|
constexpr MultiplyFlags flags(f);
|
|
|
|
|
|
|
|
// R15 rules:
|
|
|
|
//
|
|
|
|
// * Rs: no PSR, 8 bytes ahead;
|
|
|
|
// * Rn: with PSR, 8 bytes ahead;
|
|
|
|
// * Rm: with PSR, 12 bytes ahead.
|
|
|
|
|
2024-03-04 02:43:30 +00:00
|
|
|
const uint32_t multiplicand = fields.multiplicand() == 15 ? registers_.pc(4) : registers_[fields.multiplicand()];
|
|
|
|
const uint32_t multiplier = fields.multiplier() == 15 ? registers_.pc_status(4) : registers_[fields.multiplier()];
|
2024-03-01 20:02:47 +00:00
|
|
|
const uint32_t accumulator =
|
|
|
|
flags.operation() == MultiplyFlags::Operation::MUL ? 0 :
|
2024-03-04 02:43:30 +00:00
|
|
|
(fields.multiplicand() == 15 ? registers_.pc_status(8) : registers_[fields.accumulator()]);
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
const uint32_t result = multiplicand * multiplier + accumulator;
|
|
|
|
|
|
|
|
if constexpr (flags.set_condition_codes()) {
|
|
|
|
registers_.set_nz(result);
|
|
|
|
// V is unaffected; C is undefined.
|
|
|
|
}
|
|
|
|
|
|
|
|
if(fields.destination() != 15) {
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[fields.destination()] = result;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template <Flags f> void perform(Branch branch) {
|
|
|
|
constexpr BranchFlags flags(f);
|
|
|
|
|
|
|
|
if constexpr (flags.operation() == BranchFlags::Operation::BL) {
|
2024-03-12 14:42:09 +00:00
|
|
|
registers_[14] = registers_.pc_status(0);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
2024-03-03 03:40:12 +00:00
|
|
|
registers_.set_pc(registers_.pc(4) + branch.offset());
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template <Flags f> void perform(SingleDataTransfer transfer) {
|
|
|
|
constexpr SingleDataTransferFlags flags(f);
|
|
|
|
|
|
|
|
// Calculate offset.
|
|
|
|
uint32_t offset;
|
2024-03-03 19:34:21 +00:00
|
|
|
if constexpr (flags.offset_is_register()) {
|
2024-03-01 20:02:47 +00:00
|
|
|
// The 8 shift control bits are described in 6.2.3, but
|
|
|
|
// the register specified shift amounts are not available
|
|
|
|
// in this instruction class.
|
|
|
|
uint32_t carry = registers_.c();
|
2024-03-03 03:40:12 +00:00
|
|
|
offset = decode_shift<false, false>(transfer, carry, 4);
|
2024-03-03 19:34:21 +00:00
|
|
|
} else {
|
|
|
|
offset = transfer.immediate();
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Obtain base address.
|
|
|
|
uint32_t address =
|
|
|
|
transfer.base() == 15 ?
|
2024-03-03 03:40:12 +00:00
|
|
|
registers_.pc(4) :
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[transfer.base()];
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
// Determine what the address will be after offsetting.
|
|
|
|
uint32_t offsetted_address = address;
|
|
|
|
if constexpr (flags.add_offset()) {
|
|
|
|
offsetted_address += offset;
|
|
|
|
} else {
|
|
|
|
offsetted_address -= offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If preindexing, apply now.
|
|
|
|
if constexpr (flags.pre_index()) {
|
|
|
|
address = offsetted_address;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check for an address exception.
|
2024-03-11 01:45:56 +00:00
|
|
|
if(is_invalid_address(address)) {
|
2024-03-01 20:02:47 +00:00
|
|
|
registers_.exception<Registers::Exception::Address>();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2024-03-28 14:32:27 +00:00
|
|
|
// Decide whether to write back — when either postindexing or else write back is requested.
|
2024-03-28 14:34:46 +00:00
|
|
|
//
|
|
|
|
// Note to future self on write-back:
|
|
|
|
//
|
|
|
|
// It's currently unclear what to do in the case of e.g. `str r13, [r13, #0x10]!`. Is the value
|
|
|
|
// written r13 as modified or the original r13? If it's as modified, does that imply that
|
|
|
|
// write back has occurred regardless of a data abort?
|
|
|
|
//
|
|
|
|
// TODO: resolve uncertainty.
|
2024-03-28 14:32:27 +00:00
|
|
|
constexpr bool should_write_back = !flags.pre_index() || flags.write_back_address();
|
|
|
|
|
2024-03-25 19:50:59 +00:00
|
|
|
// "... post-indexed data transfers always write back the modified base. The only use of the [write-back address]
|
|
|
|
// bit in a post-indexed data transfer is in non-user mode code, where setting the W bit forces the /TRANS pin
|
|
|
|
// to go LOW for the transfer"
|
|
|
|
const bool trans = (registers_.mode() == Mode::User) || (!flags.pre_index() && flags.write_back_address());
|
2024-03-01 20:02:47 +00:00
|
|
|
if constexpr (flags.operation() == SingleDataTransferFlags::Operation::STR) {
|
|
|
|
const uint32_t source =
|
|
|
|
transfer.source() == 15 ?
|
2024-03-03 03:40:12 +00:00
|
|
|
registers_.pc_status(8) :
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[transfer.source()];
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
bool did_write;
|
|
|
|
if constexpr (flags.transfer_byte()) {
|
2024-03-03 19:11:02 +00:00
|
|
|
did_write = bus.template write<uint8_t>(address, uint8_t(source), registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
} else {
|
|
|
|
// "The data presented to the data bus are not affected if the address is not word aligned".
|
2024-03-03 19:11:02 +00:00
|
|
|
did_write = bus.template write<uint32_t>(address, source, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if(!did_write) {
|
|
|
|
registers_.exception<Registers::Exception::DataAbort>();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
bool did_read;
|
|
|
|
uint32_t value;
|
|
|
|
|
|
|
|
if constexpr (flags.transfer_byte()) {
|
|
|
|
uint8_t target;
|
2024-03-03 19:11:02 +00:00
|
|
|
did_read = bus.template read<uint8_t>(address, target, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
value = target;
|
|
|
|
} else {
|
2024-03-03 19:11:02 +00:00
|
|
|
did_read = bus.template read<uint32_t>(address, value, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
|
2024-03-11 02:40:37 +00:00
|
|
|
if constexpr (model != Model::ARMv2with32bitAddressing) {
|
|
|
|
// "An address offset from a word boundary will cause the data to be rotated into the
|
|
|
|
// register so that the addressed byte occuplies bits 0 to 7."
|
|
|
|
//
|
|
|
|
// (though the test set that inspired 'ARMv2with32bitAddressing' appears not to honour this;
|
|
|
|
// test below assumes it went away by the version of ARM that set supports)
|
|
|
|
switch(address & 3) {
|
|
|
|
case 0: break;
|
|
|
|
case 1: value = (value >> 8) | (value << 24); break;
|
|
|
|
case 2: value = (value >> 16) | (value << 16); break;
|
|
|
|
case 3: value = (value >> 24) | (value << 8); break;
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if(!did_read) {
|
|
|
|
registers_.exception<Registers::Exception::DataAbort>();
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(transfer.destination() == 15) {
|
|
|
|
registers_.set_pc(value);
|
|
|
|
} else {
|
2024-03-04 02:43:30 +00:00
|
|
|
registers_[transfer.destination()] = value;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-03-28 14:32:27 +00:00
|
|
|
if constexpr (should_write_back) {
|
2024-04-03 01:57:46 +00:00
|
|
|
// Empirically: I think order of operations for a load is: (i) write back; (ii) store value from bus.
|
|
|
|
// So if this is a load, don't allow write back to overwrite what was loaded.
|
2024-03-11 02:29:19 +00:00
|
|
|
if(flags.operation() == SingleDataTransferFlags::Operation::STR || transfer.base() != transfer.destination()) {
|
|
|
|
if(transfer.base() == 15) {
|
|
|
|
registers_.set_pc(offsetted_address);
|
|
|
|
} else {
|
|
|
|
registers_[transfer.base()] = offsetted_address;
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
template <Flags f> void perform(BlockDataTransfer transfer) {
|
|
|
|
constexpr BlockDataTransferFlags flags(f);
|
2024-04-05 01:59:18 +00:00
|
|
|
constexpr bool is_ldm = flags.operation() == BlockDataTransferFlags::Operation::LDM;
|
|
|
|
|
|
|
|
// Ensure that *base points to the base register if it can be written back;
|
|
|
|
// also set address to the base.
|
|
|
|
uint32_t *base = nullptr;
|
|
|
|
uint32_t address;
|
|
|
|
if(transfer.base() == 15) {
|
|
|
|
address = registers_.pc_status(4);
|
|
|
|
} else {
|
|
|
|
base = ®isters_[transfer.base()];
|
|
|
|
address = *base;
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// For an LDM pc_proxy will receive any read R15 value;
|
|
|
|
// for an STM it'll hold the value to be written.
|
|
|
|
uint32_t pc_proxy = 0;
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
// Read the base address and take a copy in case a data abort means that
|
2024-04-05 01:59:18 +00:00
|
|
|
// it has to be restored later.
|
|
|
|
uint32_t initial_address = address;
|
|
|
|
|
|
|
|
// Grab the register list and decide whether user registers are being used.
|
|
|
|
const uint16_t list = transfer.register_list();
|
|
|
|
const bool adopt_user_mode = flags.load_psr() && (!is_ldm || !(list & (1 << 15)));
|
|
|
|
|
|
|
|
// Write back will prima facie occur if:
|
|
|
|
// (i) the instruction asks for it; and
|
|
|
|
// (ii) the write-back register isn't R15.
|
|
|
|
bool write_back = base && flags.write_back_address();
|
|
|
|
|
|
|
|
// Collate a transfer list; this is a very long-winded way of implementing STM
|
|
|
|
// and LDM but right now the objective is merely correctness.
|
|
|
|
//
|
|
|
|
// If this is LDM and it turns out that base is also in the transfer list,
|
|
|
|
// disable write back.
|
|
|
|
uint32_t *transfer_sources[16];
|
|
|
|
uint32_t total = 0;
|
|
|
|
for(uint32_t c = 0; c < 15; c++) {
|
|
|
|
if(list & (1 << c)) {
|
|
|
|
uint32_t *const next = ®isters_.reg(adopt_user_mode, c);
|
|
|
|
if(is_ldm && next == base) write_back = false;
|
|
|
|
transfer_sources[total++] = next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the last thing in the list is R15, redirect it to the PC proxy,
|
|
|
|
// possibly populating with a meaningful value.
|
|
|
|
if(list & (1 << 15)) {
|
|
|
|
if(!is_ldm) {
|
|
|
|
pc_proxy = registers_.pc_status(8);
|
|
|
|
}
|
|
|
|
transfer_sources[total++] = &pc_proxy;
|
|
|
|
}
|
|
|
|
|
|
|
|
// If this is STM and the first thing in the list is the same as base,
|
|
|
|
// point it at initial_address instead.
|
|
|
|
if(!is_ldm && total && transfer_sources[0] == base) {
|
|
|
|
transfer_sources[0] = &initial_address;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Calculate final_address, which is what will be written back if required;
|
|
|
|
// update address to point to the low end of the transfer block.
|
2024-03-01 20:02:47 +00:00
|
|
|
//
|
|
|
|
// Writes are always ordered from lowest address to highest; adjust the
|
|
|
|
// start address if this write is supposed to fill memory downward from
|
|
|
|
// the base.
|
|
|
|
uint32_t final_address;
|
|
|
|
if constexpr (!flags.add_offset()) {
|
2024-03-15 01:09:51 +00:00
|
|
|
// Decrementing mode; final_address is the value the base register should
|
|
|
|
// have after this operation if writeback is enabled, so it's below
|
|
|
|
// the original address. But also writes always occur from lowest address
|
|
|
|
// to highest, so push the current address to the bottom.
|
|
|
|
final_address = address - total * 4;
|
2024-03-01 20:02:47 +00:00
|
|
|
address = final_address;
|
|
|
|
} else {
|
|
|
|
final_address = address + total * 4;
|
|
|
|
}
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Write back if enabled.
|
|
|
|
if(write_back) {
|
|
|
|
*base = final_address;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Update address in advance for:
|
|
|
|
// * pre-indexed upward stores; and
|
|
|
|
// * post-indxed downward stores.
|
|
|
|
if constexpr (flags.pre_index() == flags.add_offset()) {
|
|
|
|
address += 4;
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Perform all memory accesses, tracking whether either kind of abort will be
|
|
|
|
// required.
|
|
|
|
const bool trans = registers_.mode() == Mode::User;
|
|
|
|
const bool address_error = is_invalid_address(address);
|
2024-03-01 20:02:47 +00:00
|
|
|
bool accesses_succeeded = true;
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
if constexpr (is_ldm) {
|
|
|
|
// Keep a record of the value replaced by the last load and
|
|
|
|
// where it came from. A data abort cancels both the current load and
|
|
|
|
// the one before it, so this might be used by this implementation to
|
|
|
|
// undo the previous load.
|
|
|
|
struct {
|
|
|
|
uint32_t *target = nullptr;
|
|
|
|
uint32_t value;
|
|
|
|
} last_replacement;
|
|
|
|
|
|
|
|
for(uint32_t c = 0; c < total; c++) {
|
|
|
|
uint32_t &value = *transfer_sources[c];
|
|
|
|
|
2024-03-01 20:02:47 +00:00
|
|
|
// When ARM detects a data abort during a load multiple instruction, it modifies the operation of
|
|
|
|
// the instruction to ensure that recovery is possible.
|
|
|
|
//
|
|
|
|
// * Overwriting of registers stops when the abort happens. The aborting load will not
|
|
|
|
// take place, nor will the preceding one ...
|
|
|
|
// * The base register is restored, to its modified value if write-back was requested.
|
|
|
|
if(accesses_succeeded) {
|
|
|
|
const uint32_t replaced = value;
|
2024-03-25 19:50:59 +00:00
|
|
|
accesses_succeeded &= bus.template read<uint32_t>(address, value, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
|
|
|
|
// Update the last-modified slot if the access succeeded; otherwise
|
|
|
|
// undo the last modification if there was one, and undo the base
|
|
|
|
// address change.
|
|
|
|
if(accesses_succeeded) {
|
|
|
|
last_replacement.value = replaced;
|
2024-04-05 01:59:18 +00:00
|
|
|
last_replacement.target = transfer_sources[c];
|
2024-03-01 20:02:47 +00:00
|
|
|
} else {
|
|
|
|
if(last_replacement.target) {
|
|
|
|
*last_replacement.target = last_replacement.value;
|
|
|
|
}
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Also restore the base register, including to its original value
|
|
|
|
// if write back was disabled.
|
|
|
|
if(base) {
|
|
|
|
if(write_back) {
|
|
|
|
*base = final_address;
|
2024-03-01 20:02:47 +00:00
|
|
|
} else {
|
2024-04-05 01:59:18 +00:00
|
|
|
*base = initial_address;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Implicitly: do the access anyway, but don't store the value. I think.
|
|
|
|
uint32_t throwaway;
|
2024-03-25 19:50:59 +00:00
|
|
|
bus.template read<uint32_t>(address, throwaway, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Advance.
|
2024-03-01 20:02:47 +00:00
|
|
|
address += 4;
|
|
|
|
}
|
2024-04-05 01:59:18 +00:00
|
|
|
} else {
|
|
|
|
for(uint32_t c = 0; c < total; c++) {
|
|
|
|
uint32_t &value = *transfer_sources[c];
|
2024-03-01 20:02:47 +00:00
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
if(!address_error) {
|
|
|
|
// "If the abort occurs during a store multiple instruction, ARM takes little action until
|
|
|
|
// the instruction completes, whereupon it enters the data abort trap. The memory manager is
|
|
|
|
// responsible for preventing erroneous writes to the memory."
|
|
|
|
accesses_succeeded &= bus.template write<uint32_t>(address, value, registers_.mode(), trans);
|
|
|
|
} else {
|
|
|
|
// Do a throwaway read.
|
|
|
|
uint32_t throwaway;
|
|
|
|
bus.template read<uint32_t>(address, throwaway, registers_.mode(), trans);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
2024-04-05 01:59:18 +00:00
|
|
|
// Advance.
|
|
|
|
address += 4;
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Finally throw an exception if necessary.
|
|
|
|
if(address_error) {
|
|
|
|
registers_.exception<Registers::Exception::Address>();
|
|
|
|
} else if(!accesses_succeeded) {
|
|
|
|
registers_.exception<Registers::Exception::DataAbort>();
|
2024-04-05 01:59:18 +00:00
|
|
|
} else {
|
|
|
|
// If this was an LDM to R15 then apply it appropriately.
|
|
|
|
if(is_ldm && list & (1 << 15)) {
|
|
|
|
registers_.set_pc(pc_proxy);
|
|
|
|
if constexpr (flags.load_psr()) {
|
|
|
|
registers_.set_status(pc_proxy);
|
2024-04-08 02:08:12 +00:00
|
|
|
status_observer_.did_set_status();
|
2024-04-05 01:59:18 +00:00
|
|
|
}
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void software_interrupt() {
|
|
|
|
registers_.exception<Registers::Exception::SoftwareInterrupt>();
|
|
|
|
}
|
|
|
|
void unknown() {
|
|
|
|
registers_.exception<Registers::Exception::UndefinedInstruction>();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Act as if no coprocessors present.
|
|
|
|
template <Flags> void perform(CoprocessorRegisterTransfer) {
|
|
|
|
registers_.exception<Registers::Exception::UndefinedInstruction>();
|
|
|
|
}
|
|
|
|
template <Flags> void perform(CoprocessorDataOperation) {
|
|
|
|
registers_.exception<Registers::Exception::UndefinedInstruction>();
|
|
|
|
}
|
|
|
|
template <Flags> void perform(CoprocessorDataTransfer) {
|
|
|
|
registers_.exception<Registers::Exception::UndefinedInstruction>();
|
|
|
|
}
|
|
|
|
|
2024-03-04 02:38:27 +00:00
|
|
|
/// @returns The current registers state.
|
2024-03-04 02:29:53 +00:00
|
|
|
const Registers ®isters() const {
|
|
|
|
return registers_;
|
|
|
|
}
|
|
|
|
|
2024-03-09 20:11:04 +00:00
|
|
|
// Included primarily for testing; my full opinion on this is still
|
|
|
|
// incompletely-formed.
|
|
|
|
Registers ®isters() {
|
|
|
|
return registers_;
|
|
|
|
}
|
|
|
|
|
2024-03-06 20:05:24 +00:00
|
|
|
/// Indicates a prefetch abort exception.
|
|
|
|
void prefetch_abort() {
|
|
|
|
registers_.exception<Registers::Exception::PrefetchAbort>();
|
|
|
|
}
|
|
|
|
|
2024-03-03 19:11:02 +00:00
|
|
|
/// Sets the expected address of the instruction after whichever is about to be executed.
|
|
|
|
/// So it's PC+4 compared to most other systems.
|
2024-03-01 20:02:47 +00:00
|
|
|
void set_pc(uint32_t pc) {
|
|
|
|
registers_.set_pc(pc);
|
|
|
|
}
|
|
|
|
|
2024-03-03 19:11:02 +00:00
|
|
|
/// @returns The address of the instruction that should be fetched next. So as execution of each instruction
|
|
|
|
/// begins, this will be +4 from the instruction being executed; at the end of the instruction it'll either still be +4
|
|
|
|
/// or else be some other address if a branch or exception has occurred.
|
2024-03-03 03:40:12 +00:00
|
|
|
uint32_t pc() const {
|
|
|
|
return registers_.pc(0);
|
|
|
|
}
|
|
|
|
|
2024-03-04 02:38:27 +00:00
|
|
|
MemoryT bus;
|
|
|
|
|
2024-03-01 20:02:47 +00:00
|
|
|
private:
|
2024-04-08 02:08:12 +00:00
|
|
|
using StatusObserverTStorage =
|
|
|
|
typename std::conditional<
|
|
|
|
std::is_same_v<StatusObserverT, NullStatusHandler>,
|
|
|
|
StatusObserverT,
|
|
|
|
StatusObserverT &>::type;
|
|
|
|
StatusObserverTStorage status_observer_;
|
2024-03-01 20:02:47 +00:00
|
|
|
Registers registers_;
|
2024-03-11 01:45:56 +00:00
|
|
|
|
|
|
|
static bool is_invalid_address(uint32_t address) {
|
|
|
|
if constexpr (model == Model::ARMv2with32bitAddressing) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return address >= 1 << 26;
|
|
|
|
}
|
2024-03-01 20:02:47 +00:00
|
|
|
};
|
|
|
|
|
2024-03-04 02:38:27 +00:00
|
|
|
/// Executes the instruction @c instruction which should have been fetched from @c executor.pc(),
|
|
|
|
/// modifying @c executor.
|
2024-04-08 02:08:12 +00:00
|
|
|
template <Model model, typename MemoryT, typename StatusObserverT>
|
|
|
|
void execute(uint32_t instruction, Executor<model, MemoryT, StatusObserverT> &executor) {
|
2024-03-03 19:11:02 +00:00
|
|
|
executor.set_pc(executor.pc() + 4);
|
2024-03-03 02:47:09 +00:00
|
|
|
dispatch<model>(instruction, executor);
|
2024-03-01 20:02:47 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|