1
0
mirror of https://github.com/TomHarte/CLK.git synced 2024-11-03 08:05:40 +00:00
CLK/Storage/Disk/DiskImage/Formats/NIB.cpp

163 lines
4.6 KiB
C++
Raw Normal View History

//
// NIB.cpp
// Clock Signal
//
// Created by Thomas Harte on 21/04/2018.
// Copyright 2018 Thomas Harte. All rights reserved.
//
#include "NIB.hpp"
2018-04-27 02:49:07 +00:00
#include "../../Track/PCMTrack.hpp"
2018-05-25 22:30:55 +00:00
#include "../../Track/TrackSerialiser.hpp"
#include "../../Encodings/AppleGCR/Encoder.hpp"
2018-04-27 02:49:07 +00:00
#include <vector>
using namespace Storage::Disk;
namespace {
2018-04-27 02:49:07 +00:00
const long track_length = 6656;
const std::size_t number_of_tracks = 35;
}
NIB::NIB(const std::string &file_name) :
file_(file_name) {
// A NIB should be 35 tracks, each 6656 bytes long.
if(file_.stats().st_size != track_length*number_of_tracks) {
throw Error::InvalidFormat;
}
// A real NIB should have every single top bit set. Yes, 1/8th of the
// file size is a complete waste. But it provides a hook for validation.
while(true) {
uint8_t next = file_.get8();
if(file_.eof()) break;
if(!(next & 0x80)) throw Error::InvalidFormat;
}
}
HeadPosition NIB::get_maximum_head_position() {
return HeadPosition(number_of_tracks);
}
2018-05-25 22:30:55 +00:00
bool NIB::get_is_read_only() {
return file_.get_is_known_read_only();
}
long NIB::file_offset(Track::Address address) {
return static_cast<long>(address.position.as_int()) * track_length;
}
std::shared_ptr<::Storage::Disk::Track> NIB::get_track_at_position(::Storage::Disk::Track::Address address) {
// NIBs contain data for even-numbered tracks underneath a single head only.
2018-04-27 02:49:07 +00:00
if(address.head) return nullptr;
2018-05-25 22:30:55 +00:00
long offset = file_offset(address);
std::vector<uint8_t> track_data;
{
std::lock_guard<std::mutex> lock_guard(file_.get_file_access_mutex());
file_.seek(offset, SEEK_SET);
track_data = file_.read(track_length);
}
2018-04-27 02:49:07 +00:00
// NIB files leave sync bytes implicit and make no guarantees
// about overall track positioning. So the approach taken here
// is to look for the epilogue sequence (which concludes all Apple
// tracks and headers), then treat all following FFs as a sync
// region, then switch back to ordinary behaviour as soon as a
// non-FF appears.
PCMSegment segment;
2018-04-27 02:49:07 +00:00
std::size_t start_index = 0;
std::set<size_t> sync_starts;
// Establish where syncs start by finding instances of 0xd5 0xaa and then regressing
// from each along all preceding FFs.
for(size_t index = 0; index < track_data.size(); ++index) {
if(track_data[index] == 0xd5 && track_data[(index+1)%track_data.size()] == 0xaa) {
size_t start = index - 1;
size_t length = 0;
while(track_data[start] == 0xff && length < 5) {
2018-04-27 02:49:07 +00:00
start = (start + track_data.size() - 1) % track_data.size();
++length;
}
if(length == 5) {
sync_starts.insert((start + 1) % track_data.size());
if(start > index)
start_index = start;
}
2018-04-27 02:49:07 +00:00
}
}
if(start_index) {
segment += Encodings::AppleGCR::six_and_two_sync(static_cast<int>(start_index));
}
2018-04-27 02:49:07 +00:00
std::size_t index = start_index;
for(const auto &location: sync_starts) {
// Write from index to sync_start.
PCMSegment data_segment;
data_segment.data.insert(
data_segment.data.end(),
track_data.begin() + static_cast<off_t>(index),
track_data.begin() + static_cast<off_t>(location));
data_segment.number_of_bits = static_cast<unsigned int>(data_segment.data.size() * 8);
segment += data_segment;
2018-04-27 02:49:07 +00:00
// Add a sync from sync_start to end of 0xffs.
if(location == track_length-1) break;
index = location;
while(index < track_length && track_data[index] == 0xff)
++index;
segment += Encodings::AppleGCR::six_and_two_sync(static_cast<int>(index - location));
2018-04-27 02:49:07 +00:00
}
return std::make_shared<PCMTrack>(segment);
}
2018-05-25 22:30:55 +00:00
void NIB::set_tracks(const std::map<Track::Address, std::shared_ptr<Track>> &tracks) {
std::map<Track::Address, std::vector<uint8_t>> tracks_by_address;
// Convert to a map from address to a vector of data that contains the NIB representation
// of the track.
for(const auto &pair: tracks) {
// Grab the track bit stream.
auto segment = Storage::Disk::track_serialisation(*pair.second, Storage::Time(1, 50000));
// Process to eliminate all sync bits.
std::vector<uint8_t> track;
track.reserve(track_length);
uint8_t shifter = 0;
for(unsigned int bit = 0; bit < segment.number_of_bits; ++bit) {
shifter = static_cast<uint8_t>((shifter << 1) | segment.bit(bit));
if(shifter & 0x80) {
track.push_back(shifter);
shifter = 0;
}
}
// Pad out to track_length.
if(track.size() > track_length) {
track.resize(track_length);
} else {
while(track.size() < track_length) {
track.push_back(0xff);
}
}
tracks_by_address[pair.first] = std::move(track);
}
// Lock the file and spool out.
std::lock_guard<std::mutex> lock_guard(file_.get_file_access_mutex());
for(const auto &track: tracks_by_address) {
file_.seek(file_offset(track.first), SEEK_SET);
file_.write(track.second);
}
}