2012-11-01 15:19:01 +00:00
|
|
|
// Copyright (c) 2012- PPSSPP Project / Dolphin Project.
|
|
|
|
|
|
|
|
// This program is free software: you can redistribute it and/or modify
|
|
|
|
// it under the terms of the GNU General Public License as published by
|
2012-11-04 22:01:49 +00:00
|
|
|
// the Free Software Foundation, version 2.0 or later versions.
|
2012-11-01 15:19:01 +00:00
|
|
|
|
|
|
|
// This program is distributed in the hope that it will be useful,
|
|
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
// GNU General Public License 2.0 for more details.
|
|
|
|
|
|
|
|
// A copy of the GPL 2.0 should have been included with the program.
|
|
|
|
// If not, see http://www.gnu.org/licenses/
|
|
|
|
|
|
|
|
// Official git repository and contact information can be found at
|
|
|
|
// https://github.com/hrydgard/ppsspp and http://www.ppsspp.org/.
|
|
|
|
|
2020-05-17 10:48:06 +00:00
|
|
|
#include <atomic>
|
2012-11-01 15:19:01 +00:00
|
|
|
#include <vector>
|
2012-11-03 02:33:24 +00:00
|
|
|
#include <cstdio>
|
2017-02-27 20:57:46 +00:00
|
|
|
#include <mutex>
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2015-03-15 22:38:21 +00:00
|
|
|
#include "base/logging.h"
|
2015-07-03 19:05:08 +00:00
|
|
|
#include "profiler/profiler.h"
|
2015-03-15 22:38:21 +00:00
|
|
|
|
2020-08-10 04:20:42 +00:00
|
|
|
#include "Common/ChunkFile.h"
|
|
|
|
#include "Common/ChunkFileDo.h"
|
2014-03-15 18:44:02 +00:00
|
|
|
#include "Common/MsgHandler.h"
|
|
|
|
#include "Core/CoreTiming.h"
|
|
|
|
#include "Core/Core.h"
|
|
|
|
#include "Core/Config.h"
|
|
|
|
#include "Core/HLE/sceKernelThread.h"
|
|
|
|
#include "Core/HLE/sceDisplay.h"
|
|
|
|
#include "Core/MIPS/MIPS.h"
|
2014-06-29 21:05:45 +00:00
|
|
|
#include "Core/Reporting.h"
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2018-06-23 04:26:45 +00:00
|
|
|
static const int initialHz = 222000000;
|
2012-11-01 15:19:01 +00:00
|
|
|
int CPU_HZ = 222000000;
|
|
|
|
|
|
|
|
// is this really necessary?
|
|
|
|
#define INITIAL_SLICE_LENGTH 20000
|
|
|
|
#define MAX_SLICE_LENGTH 100000000
|
|
|
|
|
|
|
|
namespace CoreTiming
|
|
|
|
{
|
|
|
|
|
|
|
|
struct EventType
|
|
|
|
{
|
2012-12-27 19:58:15 +00:00
|
|
|
EventType() {}
|
|
|
|
|
|
|
|
EventType(TimedCallback cb, const char *n)
|
|
|
|
: callback(cb), name(n) {}
|
|
|
|
|
2012-11-01 15:19:01 +00:00
|
|
|
TimedCallback callback;
|
|
|
|
const char *name;
|
|
|
|
};
|
|
|
|
|
|
|
|
std::vector<EventType> event_types;
|
|
|
|
|
|
|
|
struct BaseEvent
|
|
|
|
{
|
|
|
|
s64 time;
|
|
|
|
u64 userdata;
|
|
|
|
int type;
|
|
|
|
// Event *next;
|
|
|
|
};
|
|
|
|
|
|
|
|
typedef LinkedListItem<BaseEvent> Event;
|
|
|
|
|
|
|
|
Event *first;
|
|
|
|
Event *tsFirst;
|
|
|
|
Event *tsLast;
|
|
|
|
|
|
|
|
// event pools
|
|
|
|
Event *eventPool = 0;
|
|
|
|
Event *eventTsPool = 0;
|
|
|
|
int allocatedTsEvents = 0;
|
2013-02-11 05:21:50 +00:00
|
|
|
// Optimization to skip MoveEvents when possible.
|
2020-05-17 10:48:06 +00:00
|
|
|
std::atomic<u32> hasTsEvents;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2013-01-11 23:44:18 +00:00
|
|
|
// Downcount has been moved to currentMIPS, to save a couple of clocks in every ARM JIT block
|
|
|
|
// as we can already reach that structure through a register.
|
|
|
|
int slicelength;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2017-08-30 23:14:51 +00:00
|
|
|
alignas(16) s64 globalTimer;
|
2012-11-01 15:19:01 +00:00
|
|
|
s64 idledCycles;
|
2013-10-24 07:59:48 +00:00
|
|
|
s64 lastGlobalTimeTicks;
|
|
|
|
s64 lastGlobalTimeUs;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2017-02-27 20:57:46 +00:00
|
|
|
static std::mutex externalEventLock;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2014-07-02 06:01:30 +00:00
|
|
|
std::vector<MHzChangeCallback> mhzChangeCallbacks;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2014-07-02 15:19:49 +00:00
|
|
|
void FireMhzChange() {
|
2019-04-14 21:51:35 +00:00
|
|
|
for (MHzChangeCallback cb : mhzChangeCallbacks) {
|
2014-07-02 15:19:49 +00:00
|
|
|
cb();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-04-14 21:51:35 +00:00
|
|
|
void SetClockFrequencyHz(int cpuHz) {
|
2020-07-13 07:17:42 +00:00
|
|
|
if (cpuHz <= 0) {
|
|
|
|
// Paranoid check, protecting against division by zero and similar nonsense.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2013-10-24 07:59:48 +00:00
|
|
|
// When the mhz changes, we keep track of what "time" it was before hand.
|
|
|
|
// This way, time always moves forward, even if mhz is changed.
|
|
|
|
lastGlobalTimeUs = GetGlobalTimeUs();
|
|
|
|
lastGlobalTimeTicks = GetTicks();
|
|
|
|
|
2019-04-14 21:51:35 +00:00
|
|
|
CPU_HZ = cpuHz;
|
2012-12-21 09:18:52 +00:00
|
|
|
// TODO: Rescale times of scheduled events?
|
2014-07-02 06:01:30 +00:00
|
|
|
|
2014-07-02 15:19:49 +00:00
|
|
|
FireMhzChange();
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
2019-04-14 21:51:35 +00:00
|
|
|
int GetClockFrequencyHz() {
|
|
|
|
return CPU_HZ;
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
2019-04-14 21:51:35 +00:00
|
|
|
u64 GetGlobalTimeUsScaled() {
|
|
|
|
return GetGlobalTimeUs();
|
2013-11-20 02:55:56 +00:00
|
|
|
}
|
|
|
|
|
2019-04-14 21:51:35 +00:00
|
|
|
u64 GetGlobalTimeUs() {
|
2013-11-20 02:55:56 +00:00
|
|
|
s64 ticksSinceLast = GetTicks() - lastGlobalTimeTicks;
|
2019-04-14 21:51:35 +00:00
|
|
|
int freq = GetClockFrequencyHz();
|
|
|
|
s64 usSinceLast = ticksSinceLast * 1000000 / freq;
|
|
|
|
if (ticksSinceLast > UINT_MAX) {
|
|
|
|
// Adjust the calculated value to avoid overflow errors.
|
|
|
|
lastGlobalTimeUs += usSinceLast;
|
|
|
|
lastGlobalTimeTicks = GetTicks();
|
2019-04-28 01:42:38 +00:00
|
|
|
usSinceLast = 0;
|
2019-04-14 21:51:35 +00:00
|
|
|
}
|
2013-11-20 02:55:56 +00:00
|
|
|
return lastGlobalTimeUs + usSinceLast;
|
2013-10-24 07:59:48 +00:00
|
|
|
}
|
|
|
|
|
2012-11-01 15:19:01 +00:00
|
|
|
Event* GetNewEvent()
|
|
|
|
{
|
|
|
|
if(!eventPool)
|
|
|
|
return new Event;
|
|
|
|
|
|
|
|
Event* ev = eventPool;
|
|
|
|
eventPool = ev->next;
|
|
|
|
return ev;
|
|
|
|
}
|
|
|
|
|
|
|
|
Event* GetNewTsEvent()
|
|
|
|
{
|
|
|
|
allocatedTsEvents++;
|
|
|
|
|
|
|
|
if(!eventTsPool)
|
|
|
|
return new Event;
|
|
|
|
|
|
|
|
Event* ev = eventTsPool;
|
|
|
|
eventTsPool = ev->next;
|
|
|
|
return ev;
|
|
|
|
}
|
|
|
|
|
|
|
|
void FreeEvent(Event* ev)
|
|
|
|
{
|
|
|
|
ev->next = eventPool;
|
|
|
|
eventPool = ev;
|
|
|
|
}
|
|
|
|
|
|
|
|
void FreeTsEvent(Event* ev)
|
|
|
|
{
|
|
|
|
ev->next = eventTsPool;
|
|
|
|
eventTsPool = ev;
|
|
|
|
allocatedTsEvents--;
|
|
|
|
}
|
|
|
|
|
|
|
|
int RegisterEvent(const char *name, TimedCallback callback)
|
|
|
|
{
|
2012-12-27 19:58:15 +00:00
|
|
|
event_types.push_back(EventType(callback, name));
|
2012-11-01 15:19:01 +00:00
|
|
|
return (int)event_types.size() - 1;
|
|
|
|
}
|
|
|
|
|
2012-12-27 19:58:15 +00:00
|
|
|
void AntiCrashCallback(u64 userdata, int cyclesLate)
|
|
|
|
{
|
2017-03-06 12:50:22 +00:00
|
|
|
ERROR_LOG(SAVESTATE, "Savestate broken: an unregistered event was called.");
|
2018-05-02 14:14:46 +00:00
|
|
|
Core_EnableStepping(true);
|
2012-12-27 19:58:15 +00:00
|
|
|
}
|
|
|
|
|
2012-12-27 21:08:58 +00:00
|
|
|
void RestoreRegisterEvent(int event_type, const char *name, TimedCallback callback)
|
2012-12-27 19:58:15 +00:00
|
|
|
{
|
2020-07-19 15:47:02 +00:00
|
|
|
_assert_msg_(event_type >= 0, "Invalid event type %d", event_type)
|
2012-12-27 21:08:58 +00:00
|
|
|
if (event_type >= (int) event_types.size())
|
2012-12-27 19:58:15 +00:00
|
|
|
event_types.resize(event_type + 1, EventType(AntiCrashCallback, "INVALID EVENT"));
|
|
|
|
|
|
|
|
event_types[event_type] = EventType(callback, name);
|
|
|
|
}
|
|
|
|
|
2012-11-01 15:19:01 +00:00
|
|
|
void UnregisterAllEvents()
|
|
|
|
{
|
2020-07-19 18:32:15 +00:00
|
|
|
_dbg_assert_msg_(first == nullptr, "Unregistering events with events pending - this isn't good.");
|
2012-11-01 15:19:01 +00:00
|
|
|
event_types.clear();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Init()
|
|
|
|
{
|
2013-01-11 23:44:18 +00:00
|
|
|
currentMIPS->downcount = INITIAL_SLICE_LENGTH;
|
2012-11-01 15:19:01 +00:00
|
|
|
slicelength = INITIAL_SLICE_LENGTH;
|
|
|
|
globalTimer = 0;
|
|
|
|
idledCycles = 0;
|
2013-10-24 07:59:48 +00:00
|
|
|
lastGlobalTimeTicks = 0;
|
|
|
|
lastGlobalTimeUs = 0;
|
2013-02-11 05:21:50 +00:00
|
|
|
hasTsEvents = 0;
|
2014-07-02 06:01:30 +00:00
|
|
|
mhzChangeCallbacks.clear();
|
2018-06-23 04:26:45 +00:00
|
|
|
CPU_HZ = initialHz;
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Shutdown()
|
|
|
|
{
|
|
|
|
MoveEvents();
|
|
|
|
ClearPendingEvents();
|
|
|
|
UnregisterAllEvents();
|
|
|
|
|
|
|
|
while(eventPool)
|
|
|
|
{
|
|
|
|
Event *ev = eventPool;
|
|
|
|
eventPool = ev->next;
|
|
|
|
delete ev;
|
|
|
|
}
|
|
|
|
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2012-11-01 15:19:01 +00:00
|
|
|
while(eventTsPool)
|
|
|
|
{
|
|
|
|
Event *ev = eventTsPool;
|
|
|
|
eventTsPool = ev->next;
|
|
|
|
delete ev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
u64 GetTicks()
|
|
|
|
{
|
2013-01-11 23:44:18 +00:00
|
|
|
return (u64)globalTimer + slicelength - currentMIPS->downcount;
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
u64 GetIdleTicks()
|
|
|
|
{
|
|
|
|
return (u64)idledCycles;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// This is to be called when outside threads, such as the graphics thread, wants to
|
|
|
|
// schedule things to be executed on the main thread.
|
2013-01-05 21:44:30 +00:00
|
|
|
void ScheduleEvent_Threadsafe(s64 cyclesIntoFuture, int event_type, u64 userdata)
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2012-11-01 15:19:01 +00:00
|
|
|
Event *ne = GetNewTsEvent();
|
2013-08-06 05:55:44 +00:00
|
|
|
ne->time = GetTicks() + cyclesIntoFuture;
|
2012-11-01 15:19:01 +00:00
|
|
|
ne->type = event_type;
|
|
|
|
ne->next = 0;
|
|
|
|
ne->userdata = userdata;
|
|
|
|
if(!tsFirst)
|
|
|
|
tsFirst = ne;
|
|
|
|
if(tsLast)
|
|
|
|
tsLast->next = ne;
|
|
|
|
tsLast = ne;
|
2013-02-11 05:21:50 +00:00
|
|
|
|
2020-05-17 10:48:06 +00:00
|
|
|
hasTsEvents.store(1, std::memory_order::memory_order_release);
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Same as ScheduleEvent_Threadsafe(0, ...) EXCEPT if we are already on the CPU thread
|
|
|
|
// in which case the event will get handled immediately, before returning.
|
|
|
|
void ScheduleEvent_Threadsafe_Immediate(int event_type, u64 userdata)
|
|
|
|
{
|
|
|
|
if(false) //Core::IsCPUThread())
|
|
|
|
{
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2012-11-01 15:19:01 +00:00
|
|
|
event_types[event_type].callback(userdata, 0);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
ScheduleEvent_Threadsafe(0, event_type, userdata);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ClearPendingEvents()
|
|
|
|
{
|
|
|
|
while (first)
|
|
|
|
{
|
|
|
|
Event *e = first->next;
|
|
|
|
FreeEvent(first);
|
|
|
|
first = e;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void AddEventToQueue(Event* ne)
|
|
|
|
{
|
|
|
|
Event* prev = NULL;
|
|
|
|
Event** pNext = &first;
|
|
|
|
for(;;)
|
|
|
|
{
|
|
|
|
Event*& next = *pNext;
|
|
|
|
if(!next || ne->time < next->time)
|
|
|
|
{
|
|
|
|
ne->next = next;
|
|
|
|
next = ne;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
prev = next;
|
|
|
|
pNext = &prev->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// This must be run ONLY from within the cpu thread
|
|
|
|
// cyclesIntoFuture may be VERY inaccurate if called from anything else
|
2016-08-27 18:38:05 +00:00
|
|
|
// than Advance
|
2013-01-05 21:44:30 +00:00
|
|
|
void ScheduleEvent(s64 cyclesIntoFuture, int event_type, u64 userdata)
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
|
|
|
Event *ne = GetNewEvent();
|
|
|
|
ne->userdata = userdata;
|
|
|
|
ne->type = event_type;
|
2012-12-21 06:48:59 +00:00
|
|
|
ne->time = GetTicks() + cyclesIntoFuture;
|
2012-11-01 15:19:01 +00:00
|
|
|
AddEventToQueue(ne);
|
|
|
|
}
|
|
|
|
|
2012-11-19 03:13:39 +00:00
|
|
|
// Returns cycles left in timer.
|
2013-04-06 03:42:20 +00:00
|
|
|
s64 UnscheduleEvent(int event_type, u64 userdata)
|
2012-11-19 01:54:55 +00:00
|
|
|
{
|
2013-04-06 03:42:20 +00:00
|
|
|
s64 result = 0;
|
2012-11-19 01:54:55 +00:00
|
|
|
if (!first)
|
2012-11-19 03:13:39 +00:00
|
|
|
return result;
|
2012-11-19 01:54:55 +00:00
|
|
|
while(first)
|
|
|
|
{
|
|
|
|
if (first->type == event_type && first->userdata == userdata)
|
|
|
|
{
|
2014-09-01 18:05:50 +00:00
|
|
|
result = first->time - GetTicks();
|
2012-11-19 03:13:39 +00:00
|
|
|
|
2012-11-19 01:54:55 +00:00
|
|
|
Event *next = first->next;
|
|
|
|
FreeEvent(first);
|
|
|
|
first = next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!first)
|
2012-11-19 03:13:39 +00:00
|
|
|
return result;
|
2012-11-19 01:54:55 +00:00
|
|
|
Event *prev = first;
|
|
|
|
Event *ptr = prev->next;
|
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
if (ptr->type == event_type && ptr->userdata == userdata)
|
|
|
|
{
|
2014-09-01 18:05:50 +00:00
|
|
|
result = ptr->time - GetTicks();
|
2012-11-19 03:13:39 +00:00
|
|
|
|
2012-11-19 01:54:55 +00:00
|
|
|
prev->next = ptr->next;
|
|
|
|
FreeEvent(ptr);
|
|
|
|
ptr = prev->next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
prev = ptr;
|
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
}
|
2012-11-19 03:13:39 +00:00
|
|
|
|
|
|
|
return result;
|
2012-11-19 01:54:55 +00:00
|
|
|
}
|
|
|
|
|
2013-04-08 00:37:24 +00:00
|
|
|
s64 UnscheduleThreadsafeEvent(int event_type, u64 userdata)
|
|
|
|
{
|
|
|
|
s64 result = 0;
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2013-04-08 00:37:24 +00:00
|
|
|
if (!tsFirst)
|
|
|
|
return result;
|
|
|
|
while(tsFirst)
|
|
|
|
{
|
|
|
|
if (tsFirst->type == event_type && tsFirst->userdata == userdata)
|
|
|
|
{
|
2014-09-01 18:05:50 +00:00
|
|
|
result = tsFirst->time - GetTicks();
|
2013-04-08 00:37:24 +00:00
|
|
|
|
|
|
|
Event *next = tsFirst->next;
|
|
|
|
FreeTsEvent(tsFirst);
|
|
|
|
tsFirst = next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!tsFirst)
|
2013-08-05 07:22:47 +00:00
|
|
|
{
|
|
|
|
tsLast = NULL;
|
2013-04-08 00:37:24 +00:00
|
|
|
return result;
|
2013-08-05 07:22:47 +00:00
|
|
|
}
|
2013-04-08 00:37:24 +00:00
|
|
|
|
|
|
|
Event *prev = tsFirst;
|
|
|
|
Event *ptr = prev->next;
|
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
if (ptr->type == event_type && ptr->userdata == userdata)
|
|
|
|
{
|
2014-09-01 18:05:50 +00:00
|
|
|
result = ptr->time - GetTicks();
|
2013-04-08 00:37:24 +00:00
|
|
|
|
|
|
|
prev->next = ptr->next;
|
2013-08-05 07:22:47 +00:00
|
|
|
if (ptr == tsLast)
|
|
|
|
tsLast = prev;
|
2013-04-08 00:37:24 +00:00
|
|
|
FreeTsEvent(ptr);
|
|
|
|
ptr = prev->next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
prev = ptr;
|
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2014-07-02 06:01:30 +00:00
|
|
|
void RegisterMHzChangeCallback(MHzChangeCallback callback) {
|
|
|
|
mhzChangeCallbacks.push_back(callback);
|
|
|
|
}
|
|
|
|
|
2016-08-27 18:38:05 +00:00
|
|
|
bool IsScheduled(int event_type)
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
|
|
|
if (!first)
|
|
|
|
return false;
|
|
|
|
Event *e = first;
|
|
|
|
while (e) {
|
|
|
|
if (e->type == event_type)
|
|
|
|
return true;
|
|
|
|
e = e->next;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
void RemoveEvent(int event_type)
|
|
|
|
{
|
|
|
|
if (!first)
|
|
|
|
return;
|
|
|
|
while(first)
|
|
|
|
{
|
|
|
|
if (first->type == event_type)
|
|
|
|
{
|
|
|
|
Event *next = first->next;
|
|
|
|
FreeEvent(first);
|
|
|
|
first = next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!first)
|
|
|
|
return;
|
|
|
|
Event *prev = first;
|
|
|
|
Event *ptr = prev->next;
|
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
if (ptr->type == event_type)
|
|
|
|
{
|
|
|
|
prev->next = ptr->next;
|
|
|
|
FreeEvent(ptr);
|
|
|
|
ptr = prev->next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
prev = ptr;
|
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void RemoveThreadsafeEvent(int event_type)
|
|
|
|
{
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2012-11-01 15:19:01 +00:00
|
|
|
if (!tsFirst)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
while(tsFirst)
|
|
|
|
{
|
|
|
|
if (tsFirst->type == event_type)
|
|
|
|
{
|
|
|
|
Event *next = tsFirst->next;
|
|
|
|
FreeTsEvent(tsFirst);
|
|
|
|
tsFirst = next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!tsFirst)
|
|
|
|
{
|
2013-08-05 07:22:47 +00:00
|
|
|
tsLast = NULL;
|
2012-11-01 15:19:01 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
Event *prev = tsFirst;
|
|
|
|
Event *ptr = prev->next;
|
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
if (ptr->type == event_type)
|
2016-08-27 18:38:05 +00:00
|
|
|
{
|
2012-11-01 15:19:01 +00:00
|
|
|
prev->next = ptr->next;
|
2013-08-05 07:22:47 +00:00
|
|
|
if (ptr == tsLast)
|
|
|
|
tsLast = prev;
|
2012-11-01 15:19:01 +00:00
|
|
|
FreeTsEvent(ptr);
|
|
|
|
ptr = prev->next;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
prev = ptr;
|
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void RemoveAllEvents(int event_type)
|
2013-08-05 07:22:47 +00:00
|
|
|
{
|
2012-11-01 15:19:01 +00:00
|
|
|
RemoveThreadsafeEvent(event_type);
|
|
|
|
RemoveEvent(event_type);
|
|
|
|
}
|
|
|
|
|
|
|
|
//This raise only the events required while the fifo is processing data
|
|
|
|
void ProcessFifoWaitEvents()
|
|
|
|
{
|
|
|
|
while (first)
|
|
|
|
{
|
2014-07-01 07:03:22 +00:00
|
|
|
if (first->time <= (s64)GetTicks())
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
2017-03-06 12:50:22 +00:00
|
|
|
// LOG(CPU, "[Scheduler] %s (%lld, %lld) ",
|
2014-07-01 07:03:22 +00:00
|
|
|
// first->name ? first->name : "?", (u64)GetTicks(), (u64)first->time);
|
2012-11-01 15:19:01 +00:00
|
|
|
Event* evt = first;
|
|
|
|
first = first->next;
|
2014-07-01 07:03:22 +00:00
|
|
|
event_types[evt->type].callback(evt->userdata, (int)(GetTicks() - evt->time));
|
2012-11-01 15:19:01 +00:00
|
|
|
FreeEvent(evt);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
2012-12-25 08:01:17 +00:00
|
|
|
}
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void MoveEvents()
|
|
|
|
{
|
2020-05-17 10:48:06 +00:00
|
|
|
hasTsEvents.store(0, std::memory_order::memory_order_release);
|
2013-02-11 05:21:50 +00:00
|
|
|
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2013-08-05 07:22:47 +00:00
|
|
|
// Move events from async queue into main queue
|
2012-11-01 15:19:01 +00:00
|
|
|
while (tsFirst)
|
|
|
|
{
|
|
|
|
Event *next = tsFirst->next;
|
|
|
|
AddEventToQueue(tsFirst);
|
|
|
|
tsFirst = next;
|
|
|
|
}
|
|
|
|
tsLast = NULL;
|
|
|
|
|
|
|
|
// Move free events to threadsafe pool
|
|
|
|
while(allocatedTsEvents > 0 && eventPool)
|
2012-12-25 08:01:17 +00:00
|
|
|
{
|
2012-11-01 15:19:01 +00:00
|
|
|
Event *ev = eventPool;
|
|
|
|
eventPool = ev->next;
|
|
|
|
ev->next = eventTsPool;
|
|
|
|
eventTsPool = ev;
|
|
|
|
allocatedTsEvents--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-09-21 21:42:38 +00:00
|
|
|
void ForceCheck()
|
|
|
|
{
|
2016-05-13 19:02:23 +00:00
|
|
|
int cyclesExecuted = slicelength - currentMIPS->downcount;
|
2013-09-21 21:42:38 +00:00
|
|
|
globalTimer += cyclesExecuted;
|
|
|
|
// This will cause us to check for new events immediately.
|
2016-05-13 18:21:19 +00:00
|
|
|
currentMIPS->downcount = -1;
|
2013-09-22 00:04:05 +00:00
|
|
|
// But let's not eat a bunch more time in Advance() because of this.
|
2016-05-15 08:32:37 +00:00
|
|
|
slicelength = -1;
|
2017-06-05 03:08:17 +00:00
|
|
|
|
|
|
|
#ifdef _DEBUG
|
2020-07-19 15:47:02 +00:00
|
|
|
_dbg_assert_msg_( cyclesExecuted >= 0, "Shouldn't have a negative cyclesExecuted");
|
2017-06-05 03:08:17 +00:00
|
|
|
#endif
|
2013-09-21 21:42:38 +00:00
|
|
|
}
|
|
|
|
|
2013-08-07 06:02:30 +00:00
|
|
|
void Advance()
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
2015-07-03 19:05:08 +00:00
|
|
|
PROFILE_THIS_SCOPE("advance");
|
2013-01-11 23:44:18 +00:00
|
|
|
int cyclesExecuted = slicelength - currentMIPS->downcount;
|
2012-11-01 15:19:01 +00:00
|
|
|
globalTimer += cyclesExecuted;
|
2013-01-11 23:44:18 +00:00
|
|
|
currentMIPS->downcount = slicelength;
|
2012-11-01 15:19:01 +00:00
|
|
|
|
2020-05-17 10:48:06 +00:00
|
|
|
if (hasTsEvents.load(std::memory_order_acquire))
|
2013-08-07 06:02:30 +00:00
|
|
|
MoveEvents();
|
2013-02-24 18:23:31 +00:00
|
|
|
ProcessFifoWaitEvents();
|
|
|
|
|
2012-12-25 08:01:17 +00:00
|
|
|
if (!first)
|
2012-11-01 15:19:01 +00:00
|
|
|
{
|
2014-06-29 21:05:45 +00:00
|
|
|
// This should never happen in PPSSPP.
|
|
|
|
// WARN_LOG_REPORT(TIME, "WARNING - no events in queue. Setting currentMIPS->downcount to 10000");
|
|
|
|
if (slicelength < 10000) {
|
|
|
|
slicelength += 10000;
|
|
|
|
currentMIPS->downcount += slicelength;
|
|
|
|
}
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2014-06-29 21:05:45 +00:00
|
|
|
// Note that events can eat cycles as well.
|
|
|
|
int target = (int)(first->time - globalTimer);
|
|
|
|
if (target > MAX_SLICE_LENGTH)
|
|
|
|
target = MAX_SLICE_LENGTH;
|
|
|
|
|
|
|
|
const int diff = target - slicelength;
|
|
|
|
slicelength += diff;
|
|
|
|
currentMIPS->downcount += diff;
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void LogPendingEvents()
|
|
|
|
{
|
|
|
|
Event *ptr = first;
|
|
|
|
while (ptr)
|
|
|
|
{
|
2017-06-05 03:08:17 +00:00
|
|
|
//INFO_LOG(CPU, "PENDING: Now: %lld Pending: %lld Type: %d", globalTimer, ptr->time, ptr->type);
|
2012-11-01 15:19:01 +00:00
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Idle(int maxIdle)
|
|
|
|
{
|
2013-01-11 23:44:18 +00:00
|
|
|
int cyclesDown = currentMIPS->downcount;
|
2012-11-01 15:19:01 +00:00
|
|
|
if (maxIdle != 0 && cyclesDown > maxIdle)
|
|
|
|
cyclesDown = maxIdle;
|
|
|
|
|
2012-12-17 17:05:10 +00:00
|
|
|
if (first && cyclesDown > 0)
|
|
|
|
{
|
2013-01-11 23:44:18 +00:00
|
|
|
int cyclesExecuted = slicelength - currentMIPS->downcount;
|
2012-12-17 17:05:10 +00:00
|
|
|
int cyclesNextEvent = (int) (first->time - globalTimer);
|
|
|
|
|
|
|
|
if (cyclesNextEvent < cyclesExecuted + cyclesDown)
|
|
|
|
{
|
|
|
|
cyclesDown = cyclesNextEvent - cyclesExecuted;
|
|
|
|
// Now, now... no time machines, please.
|
|
|
|
if (cyclesDown < 0)
|
|
|
|
cyclesDown = 0;
|
|
|
|
}
|
|
|
|
}
|
2012-12-01 07:06:27 +00:00
|
|
|
|
2017-03-06 12:50:22 +00:00
|
|
|
// VERBOSE_LOG(CPU, "Idle for %i cycles! (%f ms)", cyclesDown, cyclesDown / (float)(CPU_HZ * 0.001f));
|
2012-11-01 15:19:01 +00:00
|
|
|
|
|
|
|
idledCycles += cyclesDown;
|
2013-01-11 23:44:18 +00:00
|
|
|
currentMIPS->downcount -= cyclesDown;
|
|
|
|
if (currentMIPS->downcount == 0)
|
|
|
|
currentMIPS->downcount = -1;
|
2012-11-01 15:19:01 +00:00
|
|
|
}
|
|
|
|
|
2020-07-19 18:32:15 +00:00
|
|
|
std::string GetScheduledEventsSummary() {
|
2012-11-01 15:19:01 +00:00
|
|
|
Event *ptr = first;
|
|
|
|
std::string text = "Scheduled events\n";
|
|
|
|
text.reserve(1000);
|
2020-07-19 18:32:15 +00:00
|
|
|
while (ptr) {
|
2012-11-01 15:19:01 +00:00
|
|
|
unsigned int t = ptr->type;
|
2020-07-19 18:32:15 +00:00
|
|
|
if (t >= event_types.size()) {
|
|
|
|
_dbg_assert_msg_(false, "Invalid event type %d", t);
|
|
|
|
ptr = ptr->next;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
const char *name = event_types[t].name;
|
2012-11-01 15:19:01 +00:00
|
|
|
if (!name)
|
|
|
|
name = "[unknown]";
|
|
|
|
char temp[512];
|
2012-12-01 07:06:27 +00:00
|
|
|
sprintf(temp, "%s : %i %08x%08x\n", name, (int)ptr->time, (u32)(ptr->userdata >> 32), (u32)(ptr->userdata));
|
2012-11-01 15:19:01 +00:00
|
|
|
text += temp;
|
|
|
|
ptr = ptr->next;
|
|
|
|
}
|
|
|
|
return text;
|
|
|
|
}
|
|
|
|
|
2012-12-27 21:08:58 +00:00
|
|
|
void Event_DoState(PointerWrap &p, BaseEvent *ev)
|
2014-12-09 05:18:56 +00:00
|
|
|
{
|
|
|
|
// There may be padding, so do each one individually.
|
2020-08-10 04:20:42 +00:00
|
|
|
Do(p, ev->time);
|
|
|
|
Do(p, ev->userdata);
|
|
|
|
Do(p, ev->type);
|
2014-12-09 05:18:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Event_DoStateOld(PointerWrap &p, BaseEvent *ev)
|
2012-12-27 21:08:58 +00:00
|
|
|
{
|
2020-08-10 04:20:42 +00:00
|
|
|
Do(p, *ev);
|
2012-12-27 21:08:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void DoState(PointerWrap &p)
|
|
|
|
{
|
2017-02-27 20:57:46 +00:00
|
|
|
std::lock_guard<std::mutex> lk(externalEventLock);
|
2012-12-28 08:05:54 +00:00
|
|
|
|
2014-12-09 05:18:56 +00:00
|
|
|
auto s = p.Section("CoreTiming", 1, 3);
|
2013-09-15 03:23:03 +00:00
|
|
|
if (!s)
|
|
|
|
return;
|
|
|
|
|
2012-12-28 06:14:31 +00:00
|
|
|
int n = (int) event_types.size();
|
2020-08-10 04:20:42 +00:00
|
|
|
Do(p, n);
|
2012-12-27 21:08:58 +00:00
|
|
|
// These (should) be filled in later by the modules.
|
|
|
|
event_types.resize(n, EventType(AntiCrashCallback, "INVALID EVENT"));
|
|
|
|
|
2014-12-09 05:18:56 +00:00
|
|
|
if (s >= 3) {
|
2020-08-10 04:20:42 +00:00
|
|
|
DoLinkedList<BaseEvent, GetNewEvent, FreeEvent, Event_DoState>(p, first, (Event **) NULL);
|
|
|
|
DoLinkedList<BaseEvent, GetNewTsEvent, FreeTsEvent, Event_DoState>(p, tsFirst, &tsLast);
|
2014-12-09 05:18:56 +00:00
|
|
|
} else {
|
2020-08-10 04:20:42 +00:00
|
|
|
DoLinkedList<BaseEvent, GetNewEvent, FreeEvent, Event_DoStateOld>(p, first, (Event **) NULL);
|
|
|
|
DoLinkedList<BaseEvent, GetNewTsEvent, FreeTsEvent, Event_DoStateOld>(p, tsFirst, &tsLast);
|
2014-12-09 05:18:56 +00:00
|
|
|
}
|
2012-12-27 21:08:58 +00:00
|
|
|
|
2020-08-10 04:20:42 +00:00
|
|
|
Do(p, CPU_HZ);
|
|
|
|
Do(p, slicelength);
|
|
|
|
Do(p, globalTimer);
|
|
|
|
Do(p, idledCycles);
|
2013-10-24 07:59:48 +00:00
|
|
|
|
|
|
|
if (s >= 2) {
|
2020-08-10 04:20:42 +00:00
|
|
|
Do(p, lastGlobalTimeTicks);
|
|
|
|
Do(p, lastGlobalTimeUs);
|
2013-10-24 07:59:48 +00:00
|
|
|
} else {
|
|
|
|
lastGlobalTimeTicks = 0;
|
|
|
|
lastGlobalTimeUs = 0;
|
|
|
|
}
|
2014-07-02 15:19:49 +00:00
|
|
|
|
|
|
|
FireMhzChange();
|
2012-12-27 21:08:58 +00:00
|
|
|
}
|
|
|
|
|
2012-11-01 15:19:01 +00:00
|
|
|
} // namespace
|