6502/CLK
1
0
Fork 0
mirror of https://github.com/TomHarte/CLK.git synced 2024-07-04 18:29:40 +00:00
Code Issues Projects Releases Wiki Activity

Adjusted to avoid calls to ::greatest_common_divisor(numerator % denominator, denominator) unless necessary.

Browse Source
This commit is contained in:
Thomas Harte 2017-08-11 19:05:46 -04:00
parent bfe297052d
commit 82ca49c840
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
Storage/TimedEventLoop.cpp
View File

@ -43,10 +43,12 @@ void TimedEventLoop::set_next_event_time_interval(Time interval) {
(int64_t)subcycles_until_event_.clock_rate * (int64_t)input_clock_rate_ * (int64_t)interval.length +
(int64_t)interval.clock_rate * (int64_t)subcycles_until_event_.length;
// Simplify now, to prepare for stuffing into possibly 32-bit quantities
int64_t common_divisor = NumberTheory::greatest_common_divisor(numerator % denominator, denominator);
denominator /= common_divisor;
numerator /= common_divisor;
// Simplify if necessary.
if(denominator > std::numeric_limits<unsigned int>::max()) {
int64_t common_divisor = NumberTheory::greatest_common_divisor(numerator % denominator, denominator);
denominator /= common_divisor;
numerator /= common_divisor;
}
// So this event will fire in the integral number of cycles from now, putting us at the remainder
// number of subcycles