184 lines
6.0 KiB
C++
184 lines
6.0 KiB
C++
/***
|
|
Copyright (C) 2022 J Reece Wilson (a/k/a "Reece"). All rights reserved.
|
|
|
|
File: LoopQueue.NT.hpp
|
|
Date: 2022-2-1W2
|
|
Author: Reece
|
|
***/
|
|
#pragma once
|
|
|
|
#include "ILoopSourceEx.hpp"
|
|
|
|
namespace Aurora::Loop
|
|
{
|
|
struct LoopQueue : ILoopQueue
|
|
{
|
|
LoopQueue();
|
|
~LoopQueue();
|
|
|
|
bool SourceAdd(const AuSPtr<ILoopSource> &source) override;
|
|
bool SourceAddWithTimeout(const AuSPtr<ILoopSource> &source, AuUInt32 ms) override;
|
|
bool SourceRemove(const AuSPtr<ILoopSource> &source) override;
|
|
|
|
AuUInt32 GetSourceCount() override;
|
|
|
|
virtual bool AddCallback(const AuSPtr<ILoopSource> &source, const AuSPtr<ILoopSourceSubscriber> &subscriber) override;
|
|
virtual bool AddCallbackEx(const AuSPtr<ILoopSource> &source, const AuSPtr<ILoopSourceSubscriberEx> &subscriber) override;
|
|
virtual bool AddCallback(const AuSPtr<ILoopSourceSubscriber> &subscriber) override;
|
|
|
|
void ChugPathConfigure(AuUInt32 sectionTickTime, AuSInt sectionDequeCount) override;
|
|
void ChugHint(bool value) override;
|
|
|
|
virtual bool Commit() override;
|
|
|
|
bool IsSignaledPeek() override;
|
|
AuUInt32 PumpNonblocking() override;
|
|
AuList<AuSPtr<ILoopSource>> PumpNonblockingEx() override;
|
|
|
|
bool WaitAll(AuUInt32 timeout) override;
|
|
AuUInt32 WaitAny(AuUInt32 timeout) override;
|
|
AuList<AuSPtr<ILoopSource>> WaitAnyEx(AuUInt32 timeout) override;
|
|
|
|
void Sync();
|
|
void Unlock();
|
|
|
|
private:
|
|
|
|
void BuildFromAndArray();
|
|
|
|
void ConsiderEvicitingTimeoutsAll();
|
|
bool CommitLocked();
|
|
|
|
struct SourceCallbacks
|
|
{
|
|
AuList<AuSPtr<ILoopSourceSubscriber>> base;
|
|
AuList<AuSPtr<ILoopSourceSubscriberEx>> extended;
|
|
};
|
|
|
|
struct ExtendedSourceInfo
|
|
{
|
|
ExtendedSourceInfo(const AuSPtr<ILoopSourceEx> &in);
|
|
|
|
AuSPtr<ILoopSourceEx> source;
|
|
AuSPtr<ILoopSource> sourceBase;
|
|
AuThreadPrimitives::SpinLock lock; // im too brain dead to think of a solution to the AddCallback thread safety issue, so i'm going to optimize Wait[...]s subscriber lookup with filtered ccaches in here, protected by this spinlock
|
|
AuUInt64 timeoutAbs;
|
|
SourceCallbacks callbacks;
|
|
|
|
bool ConsiderTimeout(AuUInt64 time) const;
|
|
AuPair<bool, bool> DoWork(LoopQueue* queue, AuUInt handle);
|
|
};
|
|
|
|
bool IsValid();
|
|
bool RemoveSourceNB(const AuSPtr<ILoopSource> &source);
|
|
bool WaitAnyNBSpurious(AuUInt64 internalEndTime, AuUInt32 &chuggerIndex, AuList<AuSPtr<ILoopSource>> *trigger, bool poll);
|
|
bool ChugWaitAny(AuUInt64 internalEndTime, AuUInt32 &chuggerIndex, AuUInt32 &offset);
|
|
|
|
void StartUserAndTakeOwn();
|
|
void StartUserAndTakeOwn_Release();
|
|
|
|
bool TryPumpWin32();
|
|
|
|
//
|
|
SourceCallbacks msgCallbacks_;
|
|
AuList<AuSPtr<ILoopSource>> removedSources_;
|
|
AuThreadPrimitives::SpinLock sourceMutex_;
|
|
AuList<AuTuple<AuSPtr<ILoopSource>, AuUInt32, SourceCallbacks>> addedSources_;
|
|
//
|
|
|
|
AuList<AuSPtr<ILoopSourceSubscriber>> globalSubcribers_;
|
|
|
|
// OS Cache
|
|
AuThreadPrimitives::RWLockUnique_t rwMutex_ = AuThreadPrimitives::RWLockUnique();
|
|
bool bIsWinLoop_ {};
|
|
bool bIsThreadSafe_ {};
|
|
AuList<HANDLE> handleArrayOr_;
|
|
AuList<HANDLE> handleArrayAnd_;
|
|
AuList<AuTuple<int, int, HANDLE>> handleArrayTainted_;
|
|
AuUInt32 slowTickMs_ {1};
|
|
AuUInt32 slowTickRate_ {MAXIMUM_WAIT_OBJECTS};
|
|
bool forceChug_ {};
|
|
bool isCommitableInFuture_ {};
|
|
bool willCommitInFuture_ {};
|
|
|
|
AuSPtr<ILoopSource> msgSource_;
|
|
HANDLE hEvent_ {INVALID_HANDLE_VALUE};
|
|
HANDLE hDummy_ {INVALID_HANDLE_VALUE};
|
|
|
|
AuList<ExtendedSourceInfo> loopSourceExs_;
|
|
bool bLargeCommitQueueDirty {};
|
|
|
|
struct Iterator
|
|
{
|
|
LoopQueue *base;
|
|
|
|
inline Iterator(LoopQueue *base) : base(base)
|
|
{
|
|
}
|
|
|
|
inline auto End()
|
|
{
|
|
return this->base->loopSourceExs_.end();
|
|
}
|
|
|
|
inline void Start()
|
|
{
|
|
this->startingIndexAnd = 0;
|
|
this->startingIndexOr = 1;
|
|
itr = this->base->loopSourceExs_.begin();
|
|
}
|
|
|
|
inline void Next()
|
|
{
|
|
Increment();
|
|
itr++;
|
|
}
|
|
|
|
template<class T>
|
|
inline void Delete(T &&itr)
|
|
{
|
|
this->itr = AuMove(itr);
|
|
}
|
|
|
|
inline void Increment()
|
|
{
|
|
if (itr != End())
|
|
{
|
|
if (itr->source->Singular())
|
|
{
|
|
startingIndexOr++;
|
|
startingIndexAnd++;
|
|
|
|
if ((startingIndexOr % 64) == 0)
|
|
{
|
|
startingIndexOr++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// TODO: this is gross and slow
|
|
for (int i = 0; i < itr->source->GetHandles().size(); i++)
|
|
{
|
|
startingIndexOr += i;
|
|
startingIndexAnd += i;
|
|
|
|
if ((startingIndexOr % 64) == 0)
|
|
{
|
|
startingIndexOr++;
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
AuUInt startingIndexOr {};
|
|
AuUInt startingIndexAnd {};
|
|
|
|
AuToIterator_t<AuList<ExtendedSourceInfo>> itr;
|
|
|
|
};
|
|
|
|
friend struct Iteartor;
|
|
};
|
|
} |