2022-06-07 01:19:57 +00:00
|
|
|
//
|
|
|
|
// 68000ArithmeticTests.m
|
|
|
|
// Clock SignalTests
|
|
|
|
//
|
|
|
|
// Created by Thomas Harte on 28/06/2019.
|
|
|
|
//
|
|
|
|
// Largely ported from the tests of the Portable 68k Emulator.
|
|
|
|
//
|
|
|
|
|
|
|
|
#import <XCTest/XCTest.h>
|
|
|
|
|
|
|
|
#include "68000.hpp"
|
|
|
|
#include "68000Mk2.hpp"
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
#include <array>
|
2022-06-08 18:43:51 +00:00
|
|
|
#include <unordered_map>
|
2022-06-07 20:56:05 +00:00
|
|
|
|
2022-06-07 01:19:57 +00:00
|
|
|
namespace {
|
|
|
|
|
2022-06-08 18:43:51 +00:00
|
|
|
struct RandomStore {
|
|
|
|
using CollectionT = std::unordered_map<uint32_t, std::pair<uint8_t, uint8_t>>;
|
|
|
|
CollectionT values;
|
|
|
|
|
|
|
|
void flag(uint32_t address, uint8_t participant) {
|
|
|
|
values[address].first |= participant;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool has(uint32_t address, uint8_t participant) {
|
|
|
|
auto entry = values.find(address);
|
|
|
|
if(entry == values.end()) return false;
|
|
|
|
return entry->second.first & participant;
|
|
|
|
}
|
|
|
|
|
|
|
|
uint8_t value(uint32_t address, uint8_t participant) {
|
|
|
|
auto entry = values.find(address);
|
|
|
|
if(entry != values.end()) {
|
|
|
|
entry->second.first |= participant;
|
|
|
|
return entry->second.second;
|
|
|
|
}
|
|
|
|
|
|
|
|
const uint8_t value = uint8_t(rand() >> 8);
|
|
|
|
values[address] = std::make_pair(participant, value);
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear() {
|
|
|
|
values.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
struct Transaction {
|
2022-06-08 13:49:27 +00:00
|
|
|
HalfCycles timestamp;
|
2022-06-07 20:56:05 +00:00
|
|
|
uint8_t function_code = 0;
|
|
|
|
uint32_t address = 0;
|
|
|
|
uint16_t value = 0;
|
|
|
|
bool address_strobe = false;
|
|
|
|
bool data_strobe = false;
|
2022-06-08 18:53:04 +00:00
|
|
|
bool read = false;
|
2022-06-07 20:56:05 +00:00
|
|
|
|
2022-06-08 13:49:27 +00:00
|
|
|
bool operator !=(const Transaction &rhs) const {
|
2022-06-08 18:43:51 +00:00
|
|
|
// if(timestamp != rhs.timestamp) return true;
|
|
|
|
// if(function_code != rhs.function_code) return true;
|
2022-06-08 14:51:05 +00:00
|
|
|
if(address != rhs.address) return true;
|
|
|
|
if(value != rhs.value) return true;
|
|
|
|
if(address_strobe != rhs.address_strobe) return true;
|
|
|
|
if(data_strobe != rhs.data_strobe) return true;
|
2022-06-07 20:56:05 +00:00
|
|
|
return false;
|
|
|
|
}
|
2022-06-08 14:51:05 +00:00
|
|
|
|
|
|
|
void print() const {
|
2022-06-08 18:53:04 +00:00
|
|
|
printf("%d: %d%d%d %c %c @ %06x %s %04x\n",
|
2022-06-08 14:51:05 +00:00
|
|
|
timestamp.as<int>(),
|
|
|
|
(function_code >> 2) & 1,
|
|
|
|
(function_code >> 1) & 1,
|
|
|
|
(function_code >> 0) & 1,
|
|
|
|
address_strobe ? 'a' : '-',
|
|
|
|
data_strobe ? 'd' : '-',
|
|
|
|
address,
|
2022-06-08 18:53:04 +00:00
|
|
|
read ? "->" : "<-",
|
2022-06-08 14:51:05 +00:00
|
|
|
value);
|
|
|
|
}
|
2022-06-07 20:56:05 +00:00
|
|
|
};
|
|
|
|
|
2022-06-08 18:53:04 +00:00
|
|
|
struct HarmlessStopException {};
|
|
|
|
|
2022-06-07 01:19:57 +00:00
|
|
|
struct BusHandler {
|
2022-06-08 18:43:51 +00:00
|
|
|
BusHandler(RandomStore &_store, uint8_t _participant) : store(_store), participant(_participant) {}
|
|
|
|
|
2022-06-08 18:53:04 +00:00
|
|
|
void will_perform(uint32_t, uint16_t) {
|
|
|
|
--instructions;
|
|
|
|
if(instructions < 0) {
|
|
|
|
throw HarmlessStopException{};
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-06-07 01:47:10 +00:00
|
|
|
template <typename Microcycle> HalfCycles perform_bus_operation(const Microcycle &cycle, bool is_supervisor) {
|
2022-06-07 20:56:05 +00:00
|
|
|
Transaction transaction;
|
|
|
|
|
|
|
|
// Fill all of the transaction record except the data field; will do that after
|
|
|
|
// any potential read.
|
|
|
|
if(cycle.operation & Microcycle::InterruptAcknowledge) {
|
|
|
|
transaction.function_code = 0b111;
|
|
|
|
} else {
|
|
|
|
transaction.function_code = is_supervisor ? 0x4 : 0x0;
|
|
|
|
transaction.function_code |= (cycle.operation & Microcycle::IsData) ? 0x1 : 0x2;
|
|
|
|
}
|
|
|
|
transaction.address_strobe = cycle.operation & (Microcycle::NewAddress | Microcycle::SameAddress);
|
|
|
|
transaction.data_strobe = cycle.operation & (Microcycle::SelectByte | Microcycle::SelectWord);
|
|
|
|
if(cycle.address) transaction.address = *cycle.address & 0xffff'ff;
|
2022-06-08 13:49:27 +00:00
|
|
|
transaction.timestamp = time;
|
2022-06-08 18:53:04 +00:00
|
|
|
transaction.read = cycle.operation & Microcycle::Read;
|
2022-06-08 13:49:27 +00:00
|
|
|
|
|
|
|
time += cycle.length;
|
2022-06-07 20:56:05 +00:00
|
|
|
|
|
|
|
// Do the operation...
|
|
|
|
const uint32_t address = cycle.address ? (*cycle.address & 0xffff'ff) : 0;
|
|
|
|
switch(cycle.operation & (Microcycle::SelectWord | Microcycle::SelectByte | Microcycle::Read)) {
|
|
|
|
default: break;
|
|
|
|
|
|
|
|
case Microcycle::SelectWord | Microcycle::Read:
|
2022-06-08 18:43:51 +00:00
|
|
|
if(!store.has(address, participant)) {
|
|
|
|
ram[address] = store.value(address, participant);
|
|
|
|
}
|
|
|
|
if(!store.has(address+1, participant)) {
|
|
|
|
ram[address+1] = store.value(address+1, participant);
|
|
|
|
}
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
cycle.set_value16((ram[address] << 8) | ram[address + 1]);
|
|
|
|
break;
|
|
|
|
case Microcycle::SelectByte | Microcycle::Read:
|
2022-06-08 18:43:51 +00:00
|
|
|
if(!store.has(address, participant)) {
|
|
|
|
ram[address] = store.value(address, participant);
|
|
|
|
}
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
if(address & 1) {
|
|
|
|
cycle.set_value8_low(ram[address]);
|
|
|
|
} else {
|
|
|
|
cycle.set_value8_high(ram[address]);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Microcycle::SelectWord:
|
|
|
|
ram[address] = cycle.value8_high();
|
|
|
|
ram[address+1] = cycle.value8_low();
|
2022-06-08 18:43:51 +00:00
|
|
|
store.flag(address, participant);
|
|
|
|
store.flag(address+1, participant);
|
2022-06-07 20:56:05 +00:00
|
|
|
break;
|
|
|
|
case Microcycle::SelectByte:
|
|
|
|
ram[address] = (address & 1) ? cycle.value8_low() : cycle.value8_high();
|
2022-06-08 18:43:51 +00:00
|
|
|
store.flag(address, participant);
|
2022-06-07 20:56:05 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Add the data value if relevant.
|
|
|
|
if(transaction.data_strobe) {
|
|
|
|
transaction.value = cycle.value16();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Push back only if interesting.
|
|
|
|
if(transaction.address_strobe || transaction.data_strobe || transaction.function_code == 7) {
|
2022-06-08 13:49:27 +00:00
|
|
|
if(transaction_delay) {
|
|
|
|
--transaction_delay;
|
2022-06-08 14:56:54 +00:00
|
|
|
|
|
|
|
// Start counting time only from the first recorded transaction.
|
|
|
|
if(!transaction_delay) {
|
|
|
|
time = HalfCycles(0);
|
|
|
|
}
|
2022-06-08 13:49:27 +00:00
|
|
|
} else {
|
2022-06-08 18:53:04 +00:00
|
|
|
transactions.push_back(transaction);
|
2022-06-08 13:49:27 +00:00
|
|
|
}
|
2022-06-07 20:56:05 +00:00
|
|
|
}
|
|
|
|
|
2022-06-07 01:47:10 +00:00
|
|
|
return HalfCycles(0);
|
|
|
|
}
|
2022-06-07 01:19:57 +00:00
|
|
|
|
2022-06-07 01:47:10 +00:00
|
|
|
void flush() {}
|
2022-06-07 20:56:05 +00:00
|
|
|
|
2022-06-08 13:49:27 +00:00
|
|
|
int transaction_delay;
|
2022-06-08 18:53:04 +00:00
|
|
|
int instructions;
|
2022-06-08 13:49:27 +00:00
|
|
|
|
|
|
|
HalfCycles time;
|
2022-06-07 20:56:05 +00:00
|
|
|
std::vector<Transaction> transactions;
|
|
|
|
std::array<uint8_t, 16*1024*1024> ram;
|
|
|
|
|
|
|
|
void set_default_vectors() {
|
|
|
|
// Establish that all exception vectors point to 1024-byte blocks of memory.
|
|
|
|
for(int c = 0; c < 256; c++) {
|
2022-06-08 18:43:51 +00:00
|
|
|
const uint32_t target = (c + 2) << 10;
|
|
|
|
const uint32_t address = c << 2;
|
|
|
|
ram[address + 0] = uint8_t(target >> 24);
|
|
|
|
ram[address + 1] = uint8_t(target >> 16);
|
|
|
|
ram[address + 2] = uint8_t(target >> 8);
|
|
|
|
ram[address + 3] = uint8_t(target >> 0);
|
|
|
|
|
|
|
|
store.flag(address+0, participant);
|
|
|
|
store.flag(address+1, participant);
|
|
|
|
store.flag(address+2, participant);
|
|
|
|
store.flag(address+3, participant);
|
2022-06-07 20:56:05 +00:00
|
|
|
}
|
|
|
|
}
|
2022-06-08 18:43:51 +00:00
|
|
|
|
|
|
|
RandomStore &store;
|
|
|
|
const uint8_t participant;
|
2022-06-07 01:19:57 +00:00
|
|
|
};
|
|
|
|
|
2022-06-08 18:53:04 +00:00
|
|
|
using OldProcessor = CPU::MC68000::Processor<BusHandler, true, true>;
|
|
|
|
using NewProcessor = CPU::MC68000Mk2::Processor<BusHandler, true, true, true>;
|
2022-06-07 01:19:57 +00:00
|
|
|
|
|
|
|
template <typename M68000> struct Tester {
|
2022-06-08 18:43:51 +00:00
|
|
|
Tester(RandomStore &store, uint8_t participant) : bus_handler(store, participant), processor(bus_handler) {}
|
2022-06-07 01:47:10 +00:00
|
|
|
|
2022-06-08 18:53:04 +00:00
|
|
|
void run_instructions(int instructions) {
|
|
|
|
bus_handler.instructions = instructions;
|
|
|
|
|
|
|
|
try {
|
|
|
|
processor.run_for(HalfCycles::max());
|
|
|
|
} catch (const HarmlessStopException &) {}
|
2022-06-07 20:56:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void reset_with_opcode(uint16_t opcode) {
|
|
|
|
bus_handler.transactions.clear();
|
|
|
|
bus_handler.set_default_vectors();
|
|
|
|
|
2022-06-08 18:43:51 +00:00
|
|
|
const uint32_t address = 3 << 10;
|
|
|
|
bus_handler.ram[address + 0] = uint8_t(opcode >> 8);
|
|
|
|
bus_handler.ram[address + 1] = uint8_t(opcode >> 0);
|
|
|
|
bus_handler.store.flag(address, bus_handler.participant);
|
|
|
|
bus_handler.store.flag(address+1, bus_handler.participant);
|
2022-06-07 20:56:05 +00:00
|
|
|
|
2022-06-08 18:43:51 +00:00
|
|
|
bus_handler.transaction_delay = 8; // i.e. ignore the first eight transactions,
|
|
|
|
// which will just be the vector fetch part of
|
|
|
|
// the reset procedure. Instead assume logging
|
|
|
|
// at the initial prefetch fill.
|
2022-06-08 13:49:27 +00:00
|
|
|
bus_handler.time = HalfCycles(0);
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
processor.reset();
|
2022-06-07 01:47:10 +00:00
|
|
|
}
|
2022-06-07 01:19:57 +00:00
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
BusHandler bus_handler;
|
|
|
|
M68000 processor;
|
2022-06-07 01:19:57 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
@interface M68000OldVsNewTests : XCTestCase
|
|
|
|
@end
|
|
|
|
|
2022-06-08 18:43:51 +00:00
|
|
|
@implementation M68000OldVsNewTests
|
2022-06-07 01:19:57 +00:00
|
|
|
|
|
|
|
- (void)testOldVsNew {
|
2022-06-08 18:43:51 +00:00
|
|
|
RandomStore random_store;
|
|
|
|
auto oldTester = std::make_unique<Tester<OldProcessor>>(random_store, 0x01);
|
|
|
|
auto newTester = std::make_unique<Tester<NewProcessor>>(random_store, 0x02);
|
2022-06-07 20:56:05 +00:00
|
|
|
InstructionSet::M68k::Predecoder<InstructionSet::M68k::Model::M68000> decoder;
|
|
|
|
|
2022-06-08 18:43:51 +00:00
|
|
|
// Use a fixed seed to guarantee continuity across repeated runs.
|
|
|
|
srand(68000);
|
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
for(int c = 0; c < 65536; c++) {
|
|
|
|
// Test only defined opcodes.
|
|
|
|
const auto instruction = decoder.decode(uint16_t(c));
|
|
|
|
if(instruction.operation == InstructionSet::M68k::Operation::Undefined) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test each 1000 times.
|
|
|
|
for(int test = 0; test < 1000; test++) {
|
2022-06-08 18:43:51 +00:00
|
|
|
random_store.clear();
|
2022-06-07 20:56:05 +00:00
|
|
|
newTester->reset_with_opcode(c);
|
2022-06-08 15:42:42 +00:00
|
|
|
oldTester->reset_with_opcode(c);
|
2022-06-07 20:56:05 +00:00
|
|
|
|
2022-06-08 18:53:04 +00:00
|
|
|
// Run a single instruction.
|
|
|
|
newTester->run_instructions(1);
|
|
|
|
oldTester->run_instructions(1);
|
2022-06-07 20:56:05 +00:00
|
|
|
|
|
|
|
// Compare bus activity.
|
|
|
|
const auto &oldTransactions = oldTester->bus_handler.transactions;
|
|
|
|
const auto &newTransactions = newTester->bus_handler.transactions;
|
|
|
|
|
|
|
|
auto newIt = newTransactions.begin();
|
|
|
|
auto oldIt = oldTransactions.begin();
|
2022-06-08 13:49:27 +00:00
|
|
|
while(newIt != newTransactions.end() && oldIt != oldTransactions.end()) {
|
|
|
|
if(*newIt != *oldIt) {
|
2022-06-08 14:56:54 +00:00
|
|
|
printf("Mismatch in %s, test %d:\n", instruction.to_string().c_str(), test);
|
2022-06-08 14:51:05 +00:00
|
|
|
|
|
|
|
auto repeatIt = newTransactions.begin();
|
|
|
|
while(repeatIt != newIt) {
|
|
|
|
repeatIt->print();
|
|
|
|
++repeatIt;
|
|
|
|
}
|
|
|
|
printf("---\n");
|
2022-06-08 18:43:51 +00:00
|
|
|
printf("o: "); oldIt->print();
|
|
|
|
printf("n: "); newIt->print();
|
|
|
|
printf("\n");
|
2022-06-08 14:51:05 +00:00
|
|
|
|
|
|
|
break;
|
2022-06-08 13:49:27 +00:00
|
|
|
}
|
2022-06-07 01:47:10 +00:00
|
|
|
|
2022-06-07 20:56:05 +00:00
|
|
|
++newIt;
|
|
|
|
++oldIt;
|
|
|
|
}
|
|
|
|
}
|
2022-06-07 01:47:10 +00:00
|
|
|
}
|
2022-06-07 01:19:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
@end
|