mirror of
https://github.com/TomHarte/CLK.git
synced 2024-07-17 13:29:02 +00:00
46 lines
1.1 KiB
C++
46 lines
1.1 KiB
C++
//
|
|
// NIB.cpp
|
|
// Clock Signal
|
|
//
|
|
// Created by Thomas Harte on 21/04/2018.
|
|
// Copyright © 2018 Thomas Harte. All rights reserved.
|
|
//
|
|
|
|
#include "NIB.hpp"
|
|
|
|
using namespace Storage::Disk;
|
|
|
|
namespace {
|
|
|
|
const std::size_t 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 ErrorNotNIB;
|
|
}
|
|
|
|
// TODO: all other validation.
|
|
}
|
|
|
|
int NIB::get_head_position_count() {
|
|
return number_of_tracks * 4;
|
|
}
|
|
|
|
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.
|
|
if(address.head || (address.position&1)) return nullptr;
|
|
|
|
// const int file_track = address.position >> 1;
|
|
// file_.seek(static_cast<long>(file_track * track_length), SEEK_SET);
|
|
// std::vector<uint8_t> track_data = file_.read(track_length);
|
|
|
|
// TODO: determine which FFs are syncs, and produce track.
|
|
|
|
return nullptr;
|
|
}
|