2019-04-15 02:15:09 +00:00
|
|
|
//
|
|
|
|
// EmuTOSTests.m
|
|
|
|
// Clock SignalTests
|
|
|
|
//
|
|
|
|
// Created by Thomas Harte on 10/03/2019.
|
|
|
|
// Copyright © 2019 Thomas Harte. All rights reserved.
|
|
|
|
//
|
|
|
|
|
|
|
|
#import <XCTest/XCTest.h>
|
|
|
|
|
|
|
|
#include <array>
|
|
|
|
#include <cassert>
|
|
|
|
|
2019-04-22 19:41:09 +00:00
|
|
|
#include <iostream>
|
|
|
|
#include <fstream>
|
|
|
|
|
2019-04-25 19:42:41 +00:00
|
|
|
#include <zlib.h>
|
|
|
|
|
2019-04-15 02:15:09 +00:00
|
|
|
#include "68000.hpp"
|
2019-04-29 20:11:01 +00:00
|
|
|
#include "Comparative68000.hpp"
|
2019-04-15 02:15:09 +00:00
|
|
|
#include "CSROMFetcher.hpp"
|
|
|
|
|
2019-04-29 20:11:01 +00:00
|
|
|
class QL: public ComparativeBusHandler {
|
2019-04-15 02:15:09 +00:00
|
|
|
public:
|
2019-04-29 20:11:01 +00:00
|
|
|
QL(const std::vector<uint8_t> &rom, const char *trace_name) : ComparativeBusHandler(trace_name), m68000_(*this) {
|
2019-04-15 02:15:09 +00:00
|
|
|
assert(!(rom.size() & 1));
|
|
|
|
rom_.resize(rom.size() / 2);
|
|
|
|
|
|
|
|
for(size_t c = 0; c < rom_.size(); ++c) {
|
|
|
|
rom_[c] = (rom[c << 1] << 8) | rom[(c << 1) + 1];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void run_for(HalfCycles cycles) {
|
|
|
|
m68000_.run_for(cycles);
|
|
|
|
}
|
|
|
|
|
2022-05-25 15:32:00 +00:00
|
|
|
CPU::MC68000Mk2::State get_state() final {
|
2019-04-29 20:11:01 +00:00
|
|
|
return m68000_.get_state();
|
2019-04-25 19:42:41 +00:00
|
|
|
}
|
|
|
|
|
2022-05-25 15:32:00 +00:00
|
|
|
HalfCycles perform_bus_operation(const CPU::MC68000Mk2::Microcycle &cycle, int) {
|
2019-04-15 02:15:09 +00:00
|
|
|
const uint32_t address = cycle.word_address();
|
|
|
|
uint32_t word_address = address;
|
|
|
|
|
2019-04-15 17:03:32 +00:00
|
|
|
// QL memory map: ROM is in the lowest area; RAM is from 0x20000.
|
2019-04-15 16:36:08 +00:00
|
|
|
const bool is_rom = word_address < rom_.size();
|
2019-04-15 17:03:32 +00:00
|
|
|
const bool is_ram = word_address >= 0x10000 && word_address < 0x10000+ram_.size();
|
|
|
|
const bool is_peripheral = !is_ram && !is_rom;
|
|
|
|
|
2019-04-15 02:15:09 +00:00
|
|
|
uint16_t *const base = is_rom ? rom_.data() : ram_.data();
|
2019-04-15 17:03:32 +00:00
|
|
|
if(is_rom) {
|
|
|
|
word_address %= rom_.size();
|
|
|
|
}
|
|
|
|
if(is_ram) {
|
2019-04-15 16:36:08 +00:00
|
|
|
word_address %= ram_.size();
|
2019-04-15 02:15:09 +00:00
|
|
|
}
|
|
|
|
|
2022-05-25 15:32:00 +00:00
|
|
|
using Microcycle = CPU::MC68000Mk2::Microcycle;
|
2019-04-15 02:15:09 +00:00
|
|
|
if(cycle.data_select_active()) {
|
|
|
|
uint16_t peripheral_result = 0xffff;
|
|
|
|
|
|
|
|
switch(cycle.operation & (Microcycle::SelectWord | Microcycle::SelectByte | Microcycle::Read)) {
|
|
|
|
default: break;
|
|
|
|
|
|
|
|
case Microcycle::SelectWord | Microcycle::Read:
|
2022-05-25 15:32:00 +00:00
|
|
|
cycle.value->w = is_peripheral ? peripheral_result : base[word_address];
|
2019-04-15 02:15:09 +00:00
|
|
|
break;
|
|
|
|
case Microcycle::SelectByte | Microcycle::Read:
|
2022-05-25 15:32:00 +00:00
|
|
|
cycle.value->b = (is_peripheral ? peripheral_result : base[word_address]) >> cycle.byte_shift();
|
2019-04-15 02:15:09 +00:00
|
|
|
break;
|
|
|
|
case Microcycle::SelectWord:
|
|
|
|
assert(!(is_rom && !is_peripheral));
|
2022-05-25 15:32:00 +00:00
|
|
|
if(!is_peripheral) base[word_address] = cycle.value->w;
|
2019-04-15 02:15:09 +00:00
|
|
|
break;
|
|
|
|
case Microcycle::SelectByte:
|
|
|
|
assert(!(is_rom && !is_peripheral));
|
2022-05-25 15:32:00 +00:00
|
|
|
if(!is_peripheral) base[word_address] = (cycle.value->b << cycle.byte_shift()) | (base[word_address] & (0xffff ^ cycle.byte_mask()));
|
2019-04-15 02:15:09 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return HalfCycles(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2022-05-25 15:32:00 +00:00
|
|
|
CPU::MC68000Mk2::Processor<QL, true, false, true> m68000_;
|
2019-04-15 02:15:09 +00:00
|
|
|
|
|
|
|
std::vector<uint16_t> rom_;
|
2019-04-15 16:36:08 +00:00
|
|
|
std::array<uint16_t, 64*1024> ram_;
|
2019-04-15 02:15:09 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
@interface QLTests : XCTestCase
|
|
|
|
@end
|
|
|
|
|
|
|
|
@implementation QLTests {
|
|
|
|
std::unique_ptr<QL> _machine;
|
|
|
|
}
|
|
|
|
|
2019-04-25 19:42:41 +00:00
|
|
|
/*!
|
|
|
|
Tests the progression of Clock Signal's 68000 through the Sinclair QL's ROM against a known-good trace.
|
|
|
|
*/
|
2019-04-15 02:15:09 +00:00
|
|
|
- (void)testStartup {
|
2021-06-07 00:34:55 +00:00
|
|
|
constexpr ROM::Name rom_name = ROM::Name::SinclairQLJS;
|
|
|
|
ROM::Request request(rom_name);
|
|
|
|
const auto roms = CSROMFetcher()(request);
|
2019-04-25 19:42:41 +00:00
|
|
|
NSString *const traceLocation = [[NSBundle bundleForClass:[self class]] pathForResource:@"qltrace" ofType:@".txt.gz"];
|
2021-06-07 00:34:55 +00:00
|
|
|
_machine = std::make_unique<QL>(roms.find(rom_name)->second, traceLocation.UTF8String);
|
2019-04-25 19:42:41 +00:00
|
|
|
|
|
|
|
// This is how many cycles it takes to exhaust the supplied trace file.
|
2019-04-29 19:40:17 +00:00
|
|
|
_machine->run_for(HalfCycles(23923180));
|
2019-04-15 02:15:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
@end
|