mirror of
https://github.com/RetroPortingToolKit/psxrecomp
synced 2026-10-27 10:38:46 -04:00
Shokunin
1e6e43639a
No CPU is emulated: recompiled code charges the guest clock a fixed cost per instruction. guest_cycle_scale = N charges 1/N of it (instruction, load, mul/div, GTE latencies, overlay DLL batches) while VBlank, timers, CD, SPU and DMA keep hardware time, so the game never runs out of frame time. A title constant in game.toml (1 = faithful, 1..64), never a player setting; guest_cycle_scale_gated applies it only while the title's mod opens the gate (psx_guest_cycle_scale_gate_open). PSX_GUEST_CYCLE_SCALE overrides for testing. A scale other than 1 is folded into the netplay content fingerprint as a safety net. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
99 lines
2.6 KiB
C
99 lines
2.6 KiB
C
#include "psx_cyc.h"
|
|
|
|
#include <assert.h>
|
|
#include <stdint.h>
|
|
|
|
uint64_t psx_cycle_count = 0;
|
|
uint64_t psx_next_service_cycle = 0;
|
|
uint32_t g_psx_cyc_batch = 0;
|
|
uint32_t g_psx_cyc_batch_limit = 0;
|
|
int g_psx_cyc_bb_defer = 0;
|
|
uint32_t *g_psx_cyc_local_acc = 0;
|
|
int psx_in_device_service = 0;
|
|
int g_event_step_conservative = 0;
|
|
int g_ls_replay_active = 0;
|
|
int g_ls_mode = 0;
|
|
volatile int g_ds_recording = 0;
|
|
uint8_t *g_psx_ram = 0;
|
|
int g_psx_load_delay = 1;
|
|
uint32_t g_psx_gcs_recip_q16 = 65536u;
|
|
uint32_t g_psx_gcs_frac = 0u;
|
|
|
|
static int service_count;
|
|
|
|
void psx_devices_service_to_now(void) {
|
|
service_count++;
|
|
psx_next_service_cycle = psx_cycle_count + 1000u;
|
|
}
|
|
|
|
void psx_advance_cycles_slow(uint32_t cycles) {
|
|
psx_cycle_count += cycles;
|
|
}
|
|
|
|
static void reset_clock(uint64_t deadline) {
|
|
psx_cycle_count = 0;
|
|
psx_next_service_cycle = deadline;
|
|
g_psx_cyc_batch = 0;
|
|
g_psx_cyc_batch_limit = 0;
|
|
g_psx_cyc_bb_defer = 0;
|
|
g_psx_cyc_local_acc = 0;
|
|
service_count = 0;
|
|
}
|
|
|
|
int main(void) {
|
|
reset_clock(5u);
|
|
for (int i = 0; i < 4; i++) psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 0u);
|
|
assert(g_psx_cyc_batch == 4u);
|
|
assert(service_count == 0);
|
|
|
|
psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 5u);
|
|
assert(g_psx_cyc_batch == 0u);
|
|
assert(service_count == 1);
|
|
|
|
reset_clock(1000u);
|
|
for (int i = 0; i < 63; i++) psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 0u);
|
|
assert(g_psx_cyc_batch == 63u);
|
|
psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 64u);
|
|
assert(g_psx_cyc_batch == 0u);
|
|
assert(service_count == 0);
|
|
|
|
reset_clock(5u);
|
|
psx_cyc_bb_defer_begin();
|
|
for (int i = 0; i < 10; i++) psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 0u);
|
|
assert(g_psx_cyc_batch == 10u);
|
|
psx_cyc_bb_defer_flush();
|
|
assert(psx_cycle_count == 10u);
|
|
assert(service_count == 1);
|
|
assert(g_psx_cyc_bb_defer == 1);
|
|
psx_cyc_bb_defer_end();
|
|
assert(g_psx_cyc_bb_defer == 0);
|
|
|
|
reset_clock(0u);
|
|
psx_cyc_charge(1u);
|
|
assert(psx_cycle_count == 1u);
|
|
assert(service_count == 1);
|
|
|
|
/* Emitter-level local accumulator: charges stay off the published clock
|
|
* until local_publish / batch_flush; guest total at the barrier matches. */
|
|
reset_clock(1000u);
|
|
{
|
|
uint32_t acc = 0;
|
|
psx_cyc_local_begin(&acc);
|
|
for (int i = 0; i < 100; i++) psx_cyc_charge(5u);
|
|
assert(psx_cycle_count == 0u);
|
|
assert(g_psx_cyc_batch == 0u);
|
|
assert(acc == 500u);
|
|
psx_cyc_bb_defer_flush();
|
|
assert(psx_cycle_count == 500u);
|
|
assert(acc == 0u);
|
|
psx_cyc_local_end();
|
|
assert(g_psx_cyc_local_acc == 0);
|
|
}
|
|
return 0;
|
|
}
|