| Geant4 Cross Reference |
1 // 1 //
2 // MIT License 2 // MIT License
3 // Copyright (c) 2020 Jonathan R. Madsen 3 // Copyright (c) 2020 Jonathan R. Madsen
4 // Permission is hereby granted, free of charg 4 // Permission is hereby granted, free of charge, to any person obtaining a copy
5 // of this software and associated documentati 5 // of this software and associated documentation files (the "Software"), to deal
6 // in the Software without restriction, includ 6 // in the Software without restriction, including without limitation the rights
7 // to use, copy, modify, merge, publish, distr 7 // to use, copy, modify, merge, publish, distribute, sublicense, and
8 // copies of the Software, and to permit perso 8 // copies of the Software, and to permit persons to whom the Software is
9 // furnished to do so, subject to the followin 9 // furnished to do so, subject to the following conditions:
10 // The above copyright notice and this permiss 10 // The above copyright notice and this permission notice shall be included in
11 // all copies or substantial portions of the S 11 // all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED
12 // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPR 12 // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
13 // LIMITED TO THE WARRANTIES OF MERCHANTABILIT 13 // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
14 // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SH 14 // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
15 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR 15 // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
16 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARIS 16 // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
17 // WITH THE SOFTWARE OR THE USE OR OTHER DEALI 17 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
18 // 18 //
19 // ------------------------------------------- 19 // ---------------------------------------------------------------
20 // Tasking class implementation 20 // Tasking class implementation
21 // 21 //
22 22
23 #include "PTL/ThreadData.hh" 23 #include "PTL/ThreadData.hh"
24 #include "PTL/ThreadPool.hh" 24 #include "PTL/ThreadPool.hh"
>> 25 #include "PTL/Threading.hh"
>> 26 #include "PTL/VUserTaskQueue.hh"
>> 27
>> 28 #include <iostream>
>> 29
>> 30 using namespace PTL;
25 31
26 namespace PTL <<
27 { <<
28 //============================================ 32 //======================================================================================//
29 33
30 ThreadData*& 34 ThreadData*&
31 ThreadData::GetInstance() 35 ThreadData::GetInstance()
32 { 36 {
33 static thread_local ThreadData* _instance 37 static thread_local ThreadData* _instance = nullptr;
34 return _instance; 38 return _instance;
35 } 39 }
36 40
37 //============================================ 41 //======================================================================================//
38 42
39 ThreadData::ThreadData(ThreadPool* tp) 43 ThreadData::ThreadData(ThreadPool* tp)
40 : is_main((tp) ? tp->is_main() : false) << 44 : is_master(tp->is_master())
>> 45 , within_task(false)
>> 46 , task_depth(0)
41 , thread_pool(tp) 47 , thread_pool(tp)
42 , current_queue((tp) ? tp->get_queue() : nullp << 48 , current_queue(tp->get_queue())
43 , queue_stack({ current_queue }) 49 , queue_stack({ current_queue })
44 {} 50 {}
45 51
46 //============================================ 52 //======================================================================================//
47 53
48 void 54 void
49 ThreadData::update() 55 ThreadData::update()
50 { 56 {
51 if(!thread_pool) <<
52 return; <<
53 current_queue = thread_pool->get_queue(); 57 current_queue = thread_pool->get_queue();
54 queue_stack.push_back(current_queue); 58 queue_stack.push_back(current_queue);
55 } 59 }
56 60
57 //============================================ 61 //======================================================================================//
58 62
59 } // namespace PTL << 63 ThreadData::~ThreadData() {}
>> 64
>> 65 //======================================================================================//
60 66