2022-05-16 15:44:16 +00:00
|
|
|
//
|
2023-05-10 22:13:01 +00:00
|
|
|
// 68000.hpp
|
2022-05-16 15:44:16 +00:00
|
|
|
// Clock Signal
|
|
|
|
//
|
|
|
|
// Created by Thomas Harte on 16/05/2022.
|
|
|
|
// Copyright © 2022 Thomas Harte. All rights reserved.
|
|
|
|
//
|
|
|
|
|
2024-01-17 04:34:46 +00:00
|
|
|
#pragma once
|
2022-05-16 15:44:16 +00:00
|
|
|
|
|
|
|
#include "../../ClockReceiver/ClockReceiver.hpp"
|
|
|
|
#include "../../Numeric/RegisterSizes.hpp"
|
2022-05-17 00:04:13 +00:00
|
|
|
#include "../../InstructionSets/M68k/RegisterSet.hpp"
|
2022-05-16 15:44:16 +00:00
|
|
|
|
2023-12-22 04:08:18 +00:00
|
|
|
#include <cassert>
|
|
|
|
|
2023-05-10 22:13:01 +00:00
|
|
|
namespace CPU::MC68000 {
|
2022-05-16 15:44:16 +00:00
|
|
|
|
2023-12-21 21:03:53 +00:00
|
|
|
using OperationT = unsigned int;
|
|
|
|
|
|
|
|
namespace Operation {
|
|
|
|
|
|
|
|
/// Indicates that the address strobe and exactly one of the data strobes are active; you can determine
|
|
|
|
/// which by inspecting the low bit of the provided address. The RW line indicates a read.
|
|
|
|
static constexpr OperationT SelectByte = 1 << 0;
|
|
|
|
// Maintenance note: this is bit 0 to reduce the cost of getting a host-endian
|
|
|
|
// bytewise address. The assumption that it is bit 0 is also used for branchless
|
|
|
|
// selection in a few places. See implementation of host_endian_byte_address(),
|
|
|
|
// value8_high(), value8_low() and value16().
|
|
|
|
|
|
|
|
/// Indicates that the address and both data select strobes are active.
|
|
|
|
static constexpr OperationT SelectWord = 1 << 1;
|
|
|
|
|
|
|
|
/// If set, indicates a read. Otherwise, a write.
|
|
|
|
static constexpr OperationT Read = 1 << 2;
|
|
|
|
|
2023-12-22 15:46:10 +00:00
|
|
|
// Two-bit gap deliberately left here for PermitRead/Write below; these are not
|
|
|
|
// real 68000 signals, they're to do with internal manipulation only.
|
2023-12-21 21:03:53 +00:00
|
|
|
|
|
|
|
/// A NewAddress cycle is one in which the address strobe is initially low but becomes high;
|
|
|
|
/// this correlates to states 0 to 5 of a standard read/write cycle.
|
|
|
|
static constexpr OperationT NewAddress = 1 << 5;
|
|
|
|
|
|
|
|
/// A SameAddress cycle is one in which the address strobe is continuously asserted, but neither
|
|
|
|
/// of the data strobes are.
|
|
|
|
static constexpr OperationT SameAddress = 1 << 6;
|
|
|
|
|
|
|
|
/// A Reset cycle is one in which the RESET output is asserted.
|
|
|
|
static constexpr OperationT Reset = 1 << 7;
|
|
|
|
|
|
|
|
/// Contains the value of line FC0 if it is not implicit via InterruptAcknowledge.
|
|
|
|
static constexpr OperationT IsData = 1 << 8;
|
|
|
|
|
|
|
|
/// Contains the value of line FC1 if it is not implicit via InterruptAcknowledge.
|
|
|
|
static constexpr OperationT IsProgram = 1 << 9;
|
|
|
|
|
|
|
|
/// The interrupt acknowledge cycle is that during which the 68000 seeks to obtain the vector for
|
|
|
|
/// an interrupt it plans to observe. Noted on a real 68000 by all FCs being set to 1.
|
|
|
|
static constexpr OperationT InterruptAcknowledge = 1 << 10;
|
|
|
|
|
|
|
|
/// Represents the state of the 68000's valid memory address line — indicating whether this microcycle
|
|
|
|
/// is synchronised with the E clock to satisfy a valid peripheral address request.
|
|
|
|
static constexpr OperationT IsPeripheral = 1 << 11;
|
|
|
|
|
|
|
|
/// Provides the 68000's bus grant line — indicating whether a bus request has been acknowledged.
|
|
|
|
static constexpr OperationT BusGrant = 1 << 12;
|
|
|
|
|
2023-12-22 15:46:10 +00:00
|
|
|
/// An otherwise invalid combination; used as an implementation detail elsewhere. Shouldn't be exposed.
|
2023-12-21 21:03:53 +00:00
|
|
|
static constexpr OperationT DecodeDynamically = NewAddress | SameAddress;
|
|
|
|
|
2023-12-22 04:08:18 +00:00
|
|
|
// PermitRead and PermitWrite are used as part of the read/write mask
|
|
|
|
// supplied to @c Microcycle::apply; they are picked to be small enough values that
|
|
|
|
// a byte can be used for storage.
|
|
|
|
static constexpr OperationT PermitRead = 1 << 3;
|
|
|
|
static constexpr OperationT PermitWrite = 1 << 4;
|
|
|
|
|
|
|
|
};
|
2023-12-21 21:03:53 +00:00
|
|
|
|
2023-12-22 04:08:18 +00:00
|
|
|
template <OperationT op>
|
|
|
|
struct MicrocycleOperationStorage {
|
|
|
|
static constexpr auto operation = op;
|
|
|
|
};
|
|
|
|
template <>
|
|
|
|
struct MicrocycleOperationStorage<Operation::DecodeDynamically> {
|
|
|
|
OperationT operation = 0;
|
2023-12-21 21:03:53 +00:00
|
|
|
};
|
|
|
|
|
2022-05-16 15:44:16 +00:00
|
|
|
/*!
|
|
|
|
A microcycle is an atomic unit of 68000 bus activity — it is a single item large enough
|
|
|
|
fully to specify a sequence of bus events that occur without any possible interruption.
|
|
|
|
|
|
|
|
Concretely, a standard read cycle breaks down into at least two microcycles:
|
|
|
|
|
|
|
|
1) a 4 half-cycle length microcycle in which the address strobe is signalled; and
|
|
|
|
2) a 4 half-cycle length microcycle in which at least one of the data strobes is
|
|
|
|
signalled, and the data bus is sampled.
|
|
|
|
|
|
|
|
That is, assuming DTack were signalled when microcycle (1) ended. If not then additional
|
|
|
|
wait state microcycles would fall between those two parts.
|
|
|
|
|
|
|
|
The 68000 data sheet defines when the address becomes valid during microcycle (1), and
|
|
|
|
when the address strobe is actually asserted. But those timings are fixed. So simply
|
|
|
|
telling you that this was a microcycle during which the address trobe was signalled is
|
|
|
|
sufficient fully to describe the bus activity.
|
|
|
|
|
|
|
|
(Aside: see the 68000 template's definition for options re: implicit DTack; if your
|
|
|
|
68000 owner can always predict exactly how long it will hold DTack following observation
|
|
|
|
of an address-strobing microcycle, it can just supply those periods for accounting and
|
|
|
|
avoid the runtime cost of actual DTack emulation. But such as the bus allows.)
|
|
|
|
*/
|
2023-12-22 04:08:18 +00:00
|
|
|
template <OperationT op = Operation::DecodeDynamically>
|
|
|
|
struct Microcycle: public MicrocycleOperationStorage<op> {
|
2023-12-22 15:48:35 +00:00
|
|
|
// One of the following is also exposed here via inheritance:
|
|
|
|
//
|
|
|
|
// static constexpr OperationT operation; or
|
|
|
|
// OperationT operation;
|
2023-11-27 16:48:34 +00:00
|
|
|
|
2022-05-16 15:44:16 +00:00
|
|
|
/// Describes the duration of this Microcycle.
|
|
|
|
HalfCycles length = HalfCycles(4);
|
|
|
|
|
|
|
|
/*!
|
|
|
|
For expediency, this provides a full 32-bit byte-resolution address — e.g.
|
|
|
|
if reading indirectly via an address register, this will indicate the full
|
|
|
|
value of the address register.
|
|
|
|
|
|
|
|
The receiver should ignore bits 0 and 24+. Use word_address() automatically
|
|
|
|
to obtain the only the 68000's real address lines, giving a 23-bit address
|
|
|
|
at word resolution.
|
|
|
|
*/
|
|
|
|
const uint32_t *address = nullptr;
|
|
|
|
|
|
|
|
/*!
|
|
|
|
If this is a write cycle, dereference value to get the value loaded onto
|
|
|
|
the data bus.
|
|
|
|
|
|
|
|
If this is a read cycle, write the value on the data bus to it.
|
|
|
|
|
|
|
|
Otherwise, this value is undefined.
|
|
|
|
|
|
|
|
If this bus cycle provides a byte then its value is provided via
|
|
|
|
@c value->b and @c value->w is undefined. This is true regardless of
|
|
|
|
whether the upper or lower byte of a word is being accessed.
|
|
|
|
|
|
|
|
Word values occupy the entirety of @c value->w.
|
|
|
|
*/
|
|
|
|
SlicedInt16 *value = nullptr;
|
|
|
|
|
2024-02-17 20:42:31 +00:00
|
|
|
constexpr Microcycle() noexcept = default;
|
2023-12-22 04:08:18 +00:00
|
|
|
constexpr Microcycle(OperationT dynamic_operation) noexcept {
|
|
|
|
if constexpr (op == Operation::DecodeDynamically) {
|
|
|
|
MicrocycleOperationStorage<op>::operation = dynamic_operation;
|
|
|
|
} else {
|
|
|
|
assert(MicrocycleOperationStorage<op>::operation == dynamic_operation);
|
|
|
|
}
|
|
|
|
}
|
2023-12-22 17:29:27 +00:00
|
|
|
constexpr Microcycle(OperationT dynamic_operation, HalfCycles length) noexcept : Microcycle(dynamic_operation) {
|
|
|
|
this->length = length;
|
|
|
|
}
|
2023-12-22 04:08:18 +00:00
|
|
|
constexpr Microcycle(HalfCycles length) noexcept {
|
|
|
|
static_assert(op != Operation::DecodeDynamically);
|
|
|
|
this->length = length;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename MicrocycleRHS>
|
|
|
|
Microcycle &operator =(const MicrocycleRHS &rhs) {
|
|
|
|
static_assert(op == Operation::DecodeDynamically);
|
|
|
|
this->operation = rhs.operation;
|
2023-12-22 04:09:42 +00:00
|
|
|
this->value = rhs.value;
|
|
|
|
this->address = rhs.address;
|
|
|
|
this->length = rhs.length;
|
2023-12-22 04:08:18 +00:00
|
|
|
|
|
|
|
return *this;
|
|
|
|
}
|
2022-05-16 20:57:40 +00:00
|
|
|
|
2022-05-16 15:44:16 +00:00
|
|
|
/// @returns @c true if two Microcycles are equal; @c false otherwise.
|
2023-12-22 04:09:42 +00:00
|
|
|
template <typename MicrocycleRHS>
|
|
|
|
bool operator ==(const MicrocycleRHS &rhs) const {
|
2022-05-16 15:44:16 +00:00
|
|
|
if(value != rhs.value) return false;
|
|
|
|
if(address != rhs.address) return false;
|
|
|
|
if(length != rhs.length) return false;
|
2023-12-22 04:08:18 +00:00
|
|
|
if(this->operation != rhs.operation) return false;
|
2022-05-16 15:44:16 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Various inspectors.
|
|
|
|
|
2023-12-22 04:08:18 +00:00
|
|
|
/*! @returns true if any data select line is active; @c false otherwise. */
|
|
|
|
bool data_select_active() const {
|
|
|
|
return bool(this->operation & (Operation::SelectWord | Operation::SelectByte | Operation::InterruptAcknowledge));
|
|
|
|
}
|
|
|
|
|
2022-05-16 15:44:16 +00:00
|
|
|
/*!
|
2022-06-17 15:55:38 +00:00
|
|
|
@returns 0 if this byte access wants the low part of a 16-bit word; 8 if it wants the high part,
|
|
|
|
i.e. take a word quantity and shift it right by this amount to get the quantity being
|
|
|
|
accessed into the lowest value byte.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline unsigned int byte_shift() const {
|
2022-06-17 15:55:38 +00:00
|
|
|
return ~(*address << 3) & 8;
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Obtains the mask to apply to a word that will leave only the byte this microcycle is selecting.
|
|
|
|
|
|
|
|
@returns 0x00ff if this byte access wants the low part of a 16-bit word; 0xff00 if it wants the high part.
|
|
|
|
*/
|
|
|
|
forceinline uint16_t byte_mask() const {
|
2022-06-17 15:55:38 +00:00
|
|
|
return uint16_t(0xff00 >> ((*address << 3) & 8));
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Obtains the mask to apply to a word that will leave only the byte this microcycle **isn't** selecting.
|
|
|
|
i.e. this is the part of a word that should be untouched by this microcycle.
|
|
|
|
|
|
|
|
@returns 0xff00 if this byte access wants the low part of a 16-bit word; 0x00ff if it wants the high part.
|
|
|
|
*/
|
|
|
|
forceinline uint16_t untouched_byte_mask() const {
|
2022-06-17 15:55:38 +00:00
|
|
|
return uint16_t(0x00ff << ((*address << 3) & 8));
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Assuming this cycle is a byte write, mutates @c destination by writing the byte to the proper upper or
|
|
|
|
lower part, retaining the other half.
|
|
|
|
*/
|
|
|
|
forceinline uint16_t write_byte(uint16_t destination) const {
|
|
|
|
return uint16_t((destination & untouched_byte_mask()) | (value->b << byte_shift()));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
2022-06-16 01:11:31 +00:00
|
|
|
@returns non-zero if the 68000 LDS is asserted; zero otherwise.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline int lower_data_select() const {
|
2023-12-22 04:08:18 +00:00
|
|
|
return (this->operation & Operation::SelectByte & *address) | (this->operation & Operation::SelectWord);
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
2022-06-16 01:11:31 +00:00
|
|
|
@returns non-zero if the 68000 UDS is asserted; zero otherwise.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline int upper_data_select() const {
|
2023-12-22 04:08:18 +00:00
|
|
|
return (this->operation & Operation::SelectByte & ~*address) | (this->operation & Operation::SelectWord);
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
@returns the address being accessed at the precision a 68000 supplies it —
|
|
|
|
only 24 address bit precision, with the low bit shifted out. So it's the
|
|
|
|
68000 address at word precision: address 0 is the first word in the address
|
|
|
|
space, address 1 is the second word (i.e. the third and fourth bytes) in
|
|
|
|
the address space, etc.
|
|
|
|
*/
|
|
|
|
forceinline uint32_t word_address() const {
|
2022-06-17 15:55:38 +00:00
|
|
|
return (address ? *address & 0x00fffffe : 0) >> 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
@returns the same value as word_address() for any Microcycle with the NewAddress or
|
|
|
|
SameAddress flags set; undefined behaviour otherwise.
|
|
|
|
*/
|
|
|
|
forceinline uint32_t active_operation_word_address() const {
|
|
|
|
return (*address & 0x00fffffe) >> 1;
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
@returns the address of the word or byte being accessed at byte precision,
|
|
|
|
in the endianness of the host platform.
|
|
|
|
|
|
|
|
So: if this is a word access, and the 68000 wants to select the word at address
|
|
|
|
@c n, this will evaluate to @c n regardless of the host machine's endianness..
|
|
|
|
|
|
|
|
If this is a byte access and the host machine is big endian it will evalue to @c n.
|
|
|
|
|
|
|
|
If the host machine is little endian then it will evaluate to @c n^1.
|
|
|
|
*/
|
|
|
|
forceinline uint32_t host_endian_byte_address() const {
|
|
|
|
#if TARGET_RT_BIG_ENDIAN
|
2023-12-22 04:08:18 +00:00
|
|
|
return *address & 0xff'ffff;
|
2022-05-16 15:44:16 +00:00
|
|
|
#else
|
2023-12-22 04:08:18 +00:00
|
|
|
return (*address ^ (this->operation & Operation::SelectByte)) & 0xff'ffff;
|
2022-05-16 15:44:16 +00:00
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
@returns the value on the data bus — all 16 bits, with any inactive lines
|
|
|
|
(as er the upper and lower data selects) being represented by 1s. Assumes
|
|
|
|
this is a write cycle.
|
|
|
|
*/
|
|
|
|
forceinline uint16_t value16() const {
|
|
|
|
const uint16_t values[] = { value->w, uint16_t((value->b << 8) | value->b) };
|
2023-12-22 04:08:18 +00:00
|
|
|
return values[this->operation & Operation::SelectByte];
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
2022-06-16 01:11:31 +00:00
|
|
|
@returns the value currently on the high 8 lines of the data bus.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline uint8_t value8_high() const {
|
2022-06-15 21:06:40 +00:00
|
|
|
const uint8_t values[] = { uint8_t(value->w >> 8), value->b};
|
2023-12-22 04:08:18 +00:00
|
|
|
return values[this->operation & Operation::SelectByte];
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
2022-06-16 01:11:31 +00:00
|
|
|
@returns the value currently on the low 8 lines of the data bus.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline uint8_t value8_low() const {
|
2022-06-16 01:11:31 +00:00
|
|
|
return value->b;
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Sets to @c value the 8- or 16-bit portion of the supplied value that is
|
|
|
|
currently being read. Assumes this is a read cycle.
|
|
|
|
*/
|
|
|
|
forceinline void set_value16(uint16_t v) const {
|
2023-12-22 04:08:18 +00:00
|
|
|
assert(this->operation & Operation::Read);
|
|
|
|
if(this->operation & Operation::SelectWord) {
|
2022-05-16 15:44:16 +00:00
|
|
|
value->w = v;
|
|
|
|
} else {
|
|
|
|
value->b = uint8_t(v >> byte_shift());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Equivalent to set_value16((v << 8) | 0x00ff).
|
|
|
|
*/
|
|
|
|
forceinline void set_value8_high(uint8_t v) const {
|
2023-12-22 04:08:18 +00:00
|
|
|
assert(this->operation & Operation::Read);
|
|
|
|
if(this->operation & Operation::SelectWord) {
|
2022-05-16 15:44:16 +00:00
|
|
|
value->w = uint16_t(0x00ff | (v << 8));
|
|
|
|
} else {
|
2022-06-17 01:33:03 +00:00
|
|
|
value->b = uint8_t(v | byte_mask());
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
2022-06-17 15:55:38 +00:00
|
|
|
Equivalent to set_value16(v | 0xff00).
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
|
|
|
forceinline void set_value8_low(uint8_t v) const {
|
2023-12-22 04:08:18 +00:00
|
|
|
assert(this->operation & Operation::Read);
|
|
|
|
if(this->operation & Operation::SelectWord) {
|
2022-05-16 15:44:16 +00:00
|
|
|
value->w = 0xff00 | v;
|
|
|
|
} else {
|
2022-06-17 01:33:03 +00:00
|
|
|
value->b = uint8_t(v | untouched_byte_mask());
|
2022-05-16 15:44:16 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Assuming this to be a cycle with a data select active, applies it to @c target
|
2023-12-22 15:46:10 +00:00
|
|
|
subject to the @c read_write_mask, where 'applies' means:
|
2022-05-16 15:44:16 +00:00
|
|
|
|
|
|
|
* if this is a byte read, reads a single byte from @c target;
|
|
|
|
* if this is a word read, reads a word (in the host platform's endianness) from @c target; and
|
|
|
|
* if this is a write, does the converse of a read.
|
|
|
|
*/
|
2023-12-22 04:08:18 +00:00
|
|
|
forceinline void apply(uint8_t *target, OperationT read_write_mask = Operation::PermitRead | Operation::PermitWrite) const {
|
|
|
|
assert( (this->operation & (Operation::SelectWord | Operation::SelectByte)) != (Operation::SelectWord | Operation::SelectByte));
|
2022-05-16 15:44:16 +00:00
|
|
|
|
2023-12-22 15:46:10 +00:00
|
|
|
switch(
|
|
|
|
(this->operation | read_write_mask) &
|
|
|
|
(Operation::SelectWord | Operation::SelectByte | Operation::Read | Operation::PermitRead | Operation::PermitWrite)
|
|
|
|
) {
|
2022-05-16 15:44:16 +00:00
|
|
|
default:
|
|
|
|
break;
|
|
|
|
|
2023-12-22 04:08:18 +00:00
|
|
|
case Operation::SelectWord | Operation::Read | Operation::PermitRead:
|
|
|
|
case Operation::SelectWord | Operation::Read | Operation::PermitRead | Operation::PermitWrite:
|
2022-05-16 15:44:16 +00:00
|
|
|
value->w = *reinterpret_cast<uint16_t *>(target);
|
|
|
|
break;
|
2023-12-22 04:08:18 +00:00
|
|
|
case Operation::SelectByte | Operation::Read | Operation::PermitRead:
|
|
|
|
case Operation::SelectByte | Operation::Read | Operation::PermitRead | Operation::PermitWrite:
|
2022-05-16 15:44:16 +00:00
|
|
|
value->b = *target;
|
|
|
|
break;
|
2023-12-22 04:08:18 +00:00
|
|
|
case Operation::SelectWord | Operation::PermitWrite:
|
|
|
|
case Operation::SelectWord | Operation::PermitWrite | Operation::PermitRead:
|
2022-05-16 15:44:16 +00:00
|
|
|
*reinterpret_cast<uint16_t *>(target) = value->w;
|
|
|
|
break;
|
2023-12-22 04:08:18 +00:00
|
|
|
case Operation::SelectByte | Operation::PermitWrite:
|
|
|
|
case Operation::SelectByte | Operation::PermitWrite | Operation::PermitRead:
|
2022-05-16 15:44:16 +00:00
|
|
|
*target = value->b;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/*!
|
|
|
|
This is the prototype for a 68000 bus handler; real bus handlers can descend from this
|
|
|
|
in order to get default implementations of any changes that may occur in the expected interface.
|
|
|
|
*/
|
|
|
|
class BusHandler {
|
|
|
|
public:
|
|
|
|
/*!
|
|
|
|
Provides the bus handler with a single Microcycle to 'perform'.
|
|
|
|
|
|
|
|
FC0 and FC1 are provided inside the microcycle as the IsData and IsProgram
|
2023-12-22 15:46:10 +00:00
|
|
|
flags; FC2 is provided here as @c is_supervisor — it'll be either 0 or 1.
|
2023-11-28 02:49:57 +00:00
|
|
|
|
2023-12-22 15:46:10 +00:00
|
|
|
The @c Microcycle might be any instantiation of @c Microcycle above;
|
|
|
|
whether with a static constexpr operation or with a runtime-selected one.
|
2022-05-16 15:44:16 +00:00
|
|
|
*/
|
2023-12-22 04:08:18 +00:00
|
|
|
template <typename Microcycle>
|
|
|
|
HalfCycles perform_bus_operation(const Microcycle &, [[maybe_unused]] int is_supervisor) {
|
2022-05-16 15:44:16 +00:00
|
|
|
return HalfCycles(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*!
|
|
|
|
Provides information about the path of execution if enabled via the template.
|
|
|
|
*/
|
|
|
|
void will_perform([[maybe_unused]] uint32_t address, [[maybe_unused]] uint16_t opcode) {}
|
|
|
|
};
|
|
|
|
|
2022-05-17 00:04:13 +00:00
|
|
|
struct State {
|
2022-09-06 02:00:04 +00:00
|
|
|
uint16_t prefetch[2];
|
2022-05-17 00:04:13 +00:00
|
|
|
InstructionSet::M68k::RegisterSet registers;
|
|
|
|
};
|
|
|
|
|
2022-05-17 20:10:20 +00:00
|
|
|
}
|
|
|
|
|
2023-05-10 22:13:01 +00:00
|
|
|
#include "Implementation/68000Storage.hpp"
|
2022-05-17 20:10:20 +00:00
|
|
|
|
2023-05-10 22:13:01 +00:00
|
|
|
namespace CPU::MC68000 {
|
2022-05-17 20:10:20 +00:00
|
|
|
|
2022-05-17 19:05:11 +00:00
|
|
|
/*!
|
|
|
|
Provides an emulation of the 68000 with accurate bus logic via the @c BusHandler, subject to the following template parameters:
|
|
|
|
|
|
|
|
@c dtack_is_implicit means that the 68000 won't wait around for DTACK during any data access. BERR or VPA may still be
|
|
|
|
signalled at the appropriate moment and will override the implicit DTACK, but the processor won't spin if nothing is explicitly
|
|
|
|
signalled. Enabling this simplifies the internal state machine and therefore improves performance; bus handlers can still indicate
|
|
|
|
that time was spent waiting for DTACK by returning an appropriate value from @c perform_bus_operation.
|
|
|
|
|
|
|
|
@c permit_overrun allows the 68000 to be relaxed in how it interprets the constraint specified by the @c duration parameter to
|
|
|
|
@c run_for. If this is @c false, @c run_for will always return as soon as it has called @c perform_bus_operation with whichever
|
|
|
|
operation is ongoing at the requested stopping time. If it is @c true then the 68000 is granted leeway to overrun the requested stop
|
|
|
|
time by 'a small amount' as and when it is a benefit to do so. Any overrun will be subtracted from the next @c run_for.
|
|
|
|
|
|
|
|
In practice this allows the implementation to avoid a bunch of conditional checks by considering whether it needs to exit less frequently.
|
|
|
|
|
|
|
|
Teleologically, it's expected that most — if not all — single-processor machines can permit overruns for a performance boost with
|
|
|
|
no user-visible difference.
|
|
|
|
|
|
|
|
@c signal_will_perform indicates whether the 68000 will call the bus handler's @c will_perform. Unlike the popular 8-bit CPUs,
|
|
|
|
the 68000 doesn't offer an indication of when instruction dispatch will occur so this is provided *for testing purposes*. It allows test cases
|
|
|
|
to track execution and inspect internal state in a wholly unrealistic fashion.
|
|
|
|
*/
|
|
|
|
template <class BusHandler, bool dtack_is_implicit = true, bool permit_overrun = true, bool signal_will_perform = false>
|
|
|
|
class Processor: private ProcessorBase {
|
2024-12-05 03:29:08 +00:00
|
|
|
public:
|
|
|
|
Processor(BusHandler &bus_handler) : ProcessorBase(), bus_handler_(bus_handler) {}
|
|
|
|
Processor(const Processor& rhs) = delete;
|
|
|
|
Processor& operator=(const Processor& rhs) = delete;
|
2022-05-16 15:44:16 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
void run_for(HalfCycles duration);
|
2022-05-16 15:44:16 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// @returns The current processor state.
|
|
|
|
CPU::MC68000::State get_state();
|
2022-05-26 00:22:05 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets the current processor state.
|
|
|
|
void set_state(const CPU::MC68000::State &);
|
2022-05-17 00:04:13 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets all registers to the values provided, fills the prefetch queue and ensures the
|
|
|
|
/// next action the processor will take is to decode whatever is in the queue.
|
|
|
|
///
|
|
|
|
/// The queue is filled synchronously, during this call, causing calls to the bus handler.
|
|
|
|
void decode_from_state(const InstructionSet::M68k::RegisterSet &);
|
2022-05-26 00:22:05 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
// TODO: bus ack/grant, halt,
|
2022-05-24 13:08:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets the DTack line — @c true for active, @c false for inactive.
|
|
|
|
inline void set_dtack(bool dtack) {
|
|
|
|
dtack_ = dtack;
|
|
|
|
}
|
2022-05-24 13:08:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets the VPA (valid peripheral address) line — @c true for active, @c false for inactive.
|
|
|
|
inline void set_is_peripheral_address(bool is_peripheral_address) {
|
|
|
|
vpa_ = is_peripheral_address;
|
|
|
|
}
|
2022-05-24 13:08:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets the bus error line — @c true for active, @c false for inactive.
|
|
|
|
inline void set_bus_error(bool bus_error) {
|
|
|
|
berr_ = bus_error;
|
|
|
|
}
|
2022-05-24 13:08:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// Sets the interrupt lines, IPL0, IPL1 and IPL2.
|
|
|
|
inline void set_interrupt_level(int interrupt_level) {
|
|
|
|
bus_interrupt_level_ = interrupt_level;
|
|
|
|
}
|
2022-05-24 13:08:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
/// @returns The current phase of the E clock; this will be a number of
|
|
|
|
/// half-cycles between 0 and 19 inclusive, indicating how far the 68000
|
|
|
|
/// is into the current E cycle.
|
|
|
|
///
|
|
|
|
/// This is guaranteed to be 0 at initial 68000 construction. It is not guaranteed
|
|
|
|
/// to return the correct result if called during a bus transaction.
|
|
|
|
HalfCycles get_e_clock_phase() {
|
|
|
|
return e_clock_phase_;
|
|
|
|
}
|
2022-05-23 15:02:31 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
void reset();
|
2022-06-07 20:55:39 +00:00
|
|
|
|
2024-12-05 03:29:08 +00:00
|
|
|
private:
|
|
|
|
BusHandler &bus_handler_;
|
2022-05-16 15:44:16 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2023-05-10 22:13:01 +00:00
|
|
|
#include "Implementation/68000Implementation.hpp"
|