| /TaskScheduler/Scheduler/Include/Platform/Windows/ |
| H A D | MTAtomic.h | 78 T _value; 81 T AddFetch(T sum) in AddFetch() 91 T IncFetch() in IncFetch() 101 T DecFetch() in DecFetch() 110 T Load() const in Load() 126 T Exchange(T val) in Exchange() 136 T CompareAndSwap(T compareValue, T newValue) in CompareAndSwap() 174 T* _value; 176 T* Load() const in Load() 192 T* Exchange(const T* val) in Exchange() [all …]
|
| /TaskScheduler/Scheduler/Include/Platform/Posix/ |
| H A D | MTAtomic.h | 83 T _value; 86 T AddFetch(T sum) in AddFetch() 96 T IncFetch() in IncFetch() 106 T DecFetch() in DecFetch() 115 T Load() const in Load() 131 T Exchange(T val) in Exchange() 141 T CompareAndSwap(T compareValue, T newValue) in CompareAndSwap() 179 T* _value; 181 T* Load() const in Load() 197 T* Exchange(const T* val) in Exchange() [all …]
|
| /TaskScheduler/Scheduler/Include/Platform/Common/ |
| H A D | MTAtomic.h | 48 template<typename T> 56 static_assert(sizeof(Atomic32<T>) == sizeof(T), "Invalid atomic type size"); in Atomic32() 59 Atomic32Base<T>::Store(0); in Atomic32() 62 explicit Atomic32(T v) in Atomic32() 64 static_assert(sizeof(Atomic32<T>) == sizeof(T), "Invalid atomic type size"); in Atomic32() 67 Atomic32Base<T>::Store(v); in Atomic32() 76 template<typename T> 82 static_assert(sizeof(AtomicPtr<T>) == sizeof(T*), "Invalid atomic type size"); in AtomicPtr() 88 explicit AtomicPtr(T* v) in AtomicPtr() 90 static_assert(sizeof(AtomicPtr<T>) == sizeof(T*), "Invalid atomic type size"); in AtomicPtr() [all …]
|
| /TaskScheduler/Scheduler/Include/ |
| H A D | MTStaticVector.h | 31 template<class T, size_t CAPACITY> 44 T* pObjectMemory = (T*)(alignedMemory + index * sizeof(T)); in IndexToObject() 48 inline void CopyCtor(T* element, const T & val) in CopyCtor() 50 new(element) T(val); in CopyCtor() 53 inline void MoveCtor(T* element, T && val) in MoveCtor() 55 new(element) T(std::move(val)); in MoveCtor() 58 inline void Dtor(T* element) in Dtor() 61 element->~T(); in Dtor() 73 inline StaticVector(uint32 _count, const T & defaultElement = T()) 103 inline void PushBack(T && val) in PushBack() [all …]
|
| H A D | MTTools.h | 29 template<class T> 30 T Min(T a, T b) in Min() 35 template<class T> 36 T Max(T a, T b) in Max() 41 template<class T> 42 T Clamp(T val, T min, T max) in Clamp()
|
| H A D | MTTaskQueue.h | 73 inline T* Buffer() in Buffer() 75 return (T*)(data); in Buffer() 78 inline void CopyCtor(T* element, const T & val) in CopyCtor() 80 new(element) T(val); in CopyCtor() 83 inline void MoveCtor(T* element, T && val) in MoveCtor() 88 inline void Dtor(T* element) in Dtor() 91 element->~T(); in Dtor() 154 inline bool Add(const T& item) in Add() 255 const T& item = itemArray[i]; in Add() 270 bool TryPopOldest(T & item) in TryPopOldest() [all …]
|
| H A D | MTArrayView.h | 32 template<class T> 35 T* data; 47 : data((T*)memoryChunk) in ArrayView() 59 const T &operator[]( size_t i ) const 65 T &operator[]( size_t i ) 81 T* GetRawData() in GetRawData() 86 const T* GetRawData() const in GetRawData()
|
| H A D | MTConcurrentRingBuffer.h | 40 template<typename T, size_t numElements> 53 inline T* Buffer() in Buffer() 55 return (T*)(data); in Buffer() 58 inline void MoveCtor(T* element, T && val) in MoveCtor() 60 new(element) T(std::move(val)); in MoveCtor() 63 inline void Dtor(T* element) in Dtor() 66 element->~T(); in Dtor() 85 data = Memory::Alloc(sizeof(T) * numElements, ALIGNMENT); in ConcurrentRingBuffer() 96 void Push(T && item) in Push() 114 size_t PopAll(T * dstBuffer, size_t dstBufferSize) in PopAll()
|
| H A D | MTTaskPool.h | 66 template<typename T> 72 T task; 74 PoolElement(int _id, T && _task) in PoolElement() 89 desc.taskFunc = T::TaskEntryPoint; in PoolElement() 91 desc.priority = T::GetTaskPriority(); in PoolElement() 95 desc.debugID = T::GetDebugID(); in PoolElement() 232 template<typename T, size_t N> 237 typedef PoolElement<T> PoolItem; 288 pElement->task.~T(); in ~TaskPool() 297 TaskHandle TryAlloc(T && task) in TryAlloc() [all …]
|
| H A D | MTQueueMPMC.h | 36 template<typename T, uint32 CAPACITY> 46 T data; 67 inline void MoveCtor(T* element, T && val) in MoveCtor() 69 new(element) T(std::move(val)); in MoveCtor() 91 bool TryPush(T && data) in TryPush() 132 bool TryPop(T& data) in TryPop()
|
| H A D | MTScheduler.inl | 29 template<class T> 30 inline internal::GroupedTask GetGroupedTask(TaskGroup group, const T * src) 32 … internal::TaskDesc desc(T::TaskEntryPoint, src, T::GetStackRequirements(), T::GetTaskPriority() ); 34 desc.debugID = T::GetDebugID(); 35 desc.debugColor = T::GetDebugColor();
|
| H A D | MTScheduler.h | 56 template <typename T> 57 static T QueryThisType(T thisPtr) in QueryThisType() 60 return (T)nullptr; in QueryThisType() 65 template <typename T> 66 inline void CallDtor(T* p) in CallDtor() 69 p->~T(); in CallDtor()
|
| /TaskScheduler/Scheduler/Include/Scopes/ |
| H A D | MTScopes.h | 141 T* pObjectMemory = (T*)(alignedMemory + index * sizeof(T)); in IndexToObject() 173 pObject->~T(); in ~PersistentScopeDescriptorStorage() 229 T* Get(int32 id) in Get() 262 T* pObjectMemory = (T*)(alignedMemory + index * sizeof(T)); in IndexToObject() 267 T* AllocObject() in AllocObject() 290 pObject->~T(); in ~WeakScopeStack() 296 T* Get(int32 id) in Get() 316 pObject->~T(); in Pop() 319 T* Push() in Push() 388 T* pObjectMemory = (T*)(alignedMemory + index * sizeof(T)); in IndexToObject() [all …]
|
| /TaskScheduler/ThirdParty/UnitTest++/UnitTest++/ |
| H A D | HelperMacros.h | 28 #define UNITTEST_STDVECTOR_LINKAGE(T) \ argument 31 UNITTEST_IMPEXP_TEMPLATE template class UNITTEST_LINKAGE std::allocator< T >; \ 32 UNITTEST_IMPEXP_TEMPLATE template class UNITTEST_LINKAGE std::vector< T >; \ 39 #define UNITTEST_STDVECTOR_LINKAGE(T) argument
|
| H A D | ExecuteTest.h | 24 template< typename T > 25 void ExecuteTest(T& testObject, TestDetails const& details, bool isMockTest) in ExecuteTest()
|
| /TaskScheduler/Scheduler/Doxygen/ |
| H A D | Doxyfile | 2163 # http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent 2411 # files in one run (i.e. multiple -o and -T options on the command line). This
|