6502/CLK
1
0
Fork 0
mirror of https://github.com/TomHarte/CLK.git synced 2025-08-08 14:25:05 +00:00
Code Issues Projects Releases Wiki Activity

Merge pull request #683 from TomHarte/MFPPerformance

Browse Source 
Switch to faster timer implementation; it seems to work.
This commit is contained in:
Thomas Harte
2019-12-09 19:52:16 -05:00
committed by GitHub
parent e1c7a140d0 c2646a415f
commit 7cc5d0b209
1 changed files with 7 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
Components/68901/MFP68901.cpp
View File

@@ -178,28 +178,15 @@ void MFP68901::write(int address, uint8_t value) {
void MFP68901::run_for(HalfCycles time) { void MFP68901::run_for(HalfCycles time) {
cycles_left_ += time; cycles_left_ += time;
// TODO: this is the stupidest possible implementation. Improve. const int cycles = int(cycles_left_.flush<Cycles>().as_integral());
int cycles = int(cycles_left_.flush<Cycles>().as_integral()); for(int c = 0; c < 4; ++c) {
while(cycles--) { if(timers_[c].mode >= TimerMode::Delay) {
for(int c = 0; c < 4; ++c) { const int dividend = (cycles + timers_[c].prescale - timers_[c].divisor);
if(timers_[c].mode >= TimerMode::Delay) { const int decrements = dividend / timers_[c].prescale;
--timers_[c].divisor; timers_[c].divisor = timers_[c].prescale - (dividend % timers_[c].prescale);
if(!timers_[c].divisor) { if(decrements) decrement_timer(c, decrements);
timers_[c].divisor = timers_[c].prescale;
decrement_timer(c, 1);
}
}
} }
} }
// const int cycles = int(cycles_left_.flush<Cycles>().as_integral());
// for(int c = 0; c < 4; ++c) {
// if(timers_[c].mode >= TimerMode::Delay) {
// const int dividend = (cycles + timers_[c].prescale - timers_[c].divisor);
// const int decrements = dividend / timers_[c].prescale;
// timers_[c].divisor = timers_[c].prescale - (dividend % timers_[c].prescale);
// if(decrements) decrement_timer(c, decrements);
// }
// }
} }
HalfCycles MFP68901::get_next_sequence_point() { HalfCycles MFP68901::get_next_sequence_point() {