1f25ce65dSSergey Makeev // The MIT License (MIT) 2f25ce65dSSergey Makeev // 3f25ce65dSSergey Makeev // Copyright (c) 2015 Sergey Makeev, Vadim Slyusarev 4f25ce65dSSergey Makeev // 5f25ce65dSSergey Makeev // Permission is hereby granted, free of charge, to any person obtaining a copy 6f25ce65dSSergey Makeev // of this software and associated documentation files (the "Software"), to deal 7f25ce65dSSergey Makeev // in the Software without restriction, including without limitation the rights 8f25ce65dSSergey Makeev // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9f25ce65dSSergey Makeev // copies of the Software, and to permit persons to whom the Software is 10f25ce65dSSergey Makeev // furnished to do so, subject to the following conditions: 11f25ce65dSSergey Makeev // 12f25ce65dSSergey Makeev // The above copyright notice and this permission notice shall be included in 13f25ce65dSSergey Makeev // all copies or substantial portions of the Software. 14f25ce65dSSergey Makeev // 15f25ce65dSSergey Makeev // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16f25ce65dSSergey Makeev // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17f25ce65dSSergey Makeev // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18f25ce65dSSergey Makeev // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19f25ce65dSSergey Makeev // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20f25ce65dSSergey Makeev // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 21f25ce65dSSergey Makeev // THE SOFTWARE. 22f25ce65dSSergey Makeev 2358964d0bSSergey Makeev #pragma once 2458964d0bSSergey Makeev 2558964d0bSSergey Makeev #include <MTTools.h> 2658964d0bSSergey Makeev #include <MTPlatform.h> 2758964d0bSSergey Makeev #include <MTConcurrentQueueLIFO.h> 2858964d0bSSergey Makeev #include <MTGroupedTask.h> 2958964d0bSSergey Makeev 3058964d0bSSergey Makeev namespace MT 3158964d0bSSergey Makeev { 3258964d0bSSergey Makeev class FiberContext; 3358964d0bSSergey Makeev class TaskScheduler; 3458964d0bSSergey Makeev 3558964d0bSSergey Makeev namespace internal 3658964d0bSSergey Makeev { 3758964d0bSSergey Makeev 3858964d0bSSergey Makeev namespace ThreadState 3958964d0bSSergey Makeev { 4058964d0bSSergey Makeev const uint32 ALIVE = 0; 4158964d0bSSergey Makeev const uint32 EXIT = 1; 4258964d0bSSergey Makeev }; 4358964d0bSSergey Makeev 4458964d0bSSergey Makeev //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 4558964d0bSSergey Makeev // Thread (Scheduler fiber) context 4658964d0bSSergey Makeev //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 4758964d0bSSergey Makeev struct ThreadContext 4858964d0bSSergey Makeev { 4958964d0bSSergey Makeev FiberContext* lastActiveFiberContext; 5058964d0bSSergey Makeev 5158964d0bSSergey Makeev // pointer to task manager 5258964d0bSSergey Makeev TaskScheduler* taskScheduler; 5358964d0bSSergey Makeev 5458964d0bSSergey Makeev // thread 5558964d0bSSergey Makeev Thread thread; 5658964d0bSSergey Makeev 5758964d0bSSergey Makeev // scheduler fiber 5858964d0bSSergey Makeev Fiber schedulerFiber; 5958964d0bSSergey Makeev 6058964d0bSSergey Makeev // task queue awaiting execution 6158964d0bSSergey Makeev ConcurrentQueueLIFO<internal::GroupedTask> queue; 6258964d0bSSergey Makeev 6358964d0bSSergey Makeev // new task was arrived to queue event 6458964d0bSSergey Makeev Event hasNewTasksEvent; 6558964d0bSSergey Makeev 6658964d0bSSergey Makeev // whether thread is alive 6758964d0bSSergey Makeev AtomicInt state; 6858964d0bSSergey Makeev 6958964d0bSSergey Makeev // Temporary buffer 7058964d0bSSergey Makeev std::vector<internal::GroupedTask> descBuffer; 7158964d0bSSergey Makeev 72*2b4df162SSergey Makeev // Thread index 73*2b4df162SSergey Makeev uint32 workerIndex; 74*2b4df162SSergey Makeev 75*2b4df162SSergey Makeev // Thread random number generator 76*2b4df162SSergey Makeev LcgRandom random; 77*2b4df162SSergey Makeev 7858964d0bSSergey Makeev // prevent false sharing between threads 7958964d0bSSergey Makeev uint8 cacheline[64]; 8058964d0bSSergey Makeev 8158964d0bSSergey Makeev ThreadContext(); 8258964d0bSSergey Makeev ~ThreadContext(); 8358964d0bSSergey Makeev 8458964d0bSSergey Makeev void RestoreAwaitingTasks(TaskGroup::Type taskGroup); 85*2b4df162SSergey Makeev 86*2b4df162SSergey Makeev void SetThreadIndex(uint32 threadIndex); 8758964d0bSSergey Makeev }; 8858964d0bSSergey Makeev 8958964d0bSSergey Makeev } 9058964d0bSSergey Makeev 9158964d0bSSergey Makeev } 92