1 // The MIT License (MIT)
2 //
3 // 	Copyright (c) 2015 Sergey Makeev, Vadim Slyusarev
4 //
5 // 	Permission is hereby granted, free of charge, to any person obtaining a copy
6 // 	of this software and associated documentation files (the "Software"), to deal
7 // 	in the Software without restriction, including without limitation the rights
8 // 	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9 // 	copies of the Software, and to permit persons to whom the Software is
10 // 	furnished to do so, subject to the following conditions:
11 //
12 //  The above copyright notice and this permission notice shall be included in
13 // 	all copies or substantial portions of the Software.
14 //
15 // 	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 // 	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 // 	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18 // 	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 // 	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20 // 	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
21 // 	THE SOFTWARE.
22 
23 #include "Tests.h"
24 #include <UnitTest++.h>
25 #include <MTScheduler.h>
26 
27 SUITE(StackSizeTests)
28 {
29 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
30 struct StandartStackSizeTask
31 {
32 	MT_DECLARE_TASK(StandartStackSizeTask, MT::StackRequirements::STANDARD, MT::Color::Blue);
33 
34 	void Do(MT::FiberContext&)
35 	{
36 		byte stackData[28000];
37 		memset(stackData, 0x0D, MT_ARRAY_SIZE(stackData));
38 	}
39 };
40 
41 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
42 struct ExtendedStackSizeTask
43 {
44 	MT_DECLARE_TASK(ExtendedStackSizeTask, MT::StackRequirements::EXTENDED, MT::Color::Red);
45 
46 	void Do(MT::FiberContext&)
47 	{
48 		byte stackData[262144];
49 		memset(stackData, 0x0D, MT_ARRAY_SIZE(stackData));
50 	}
51 
52 };
53 
54 
55 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
56 TEST(RunStandartTasks)
57 {
58 	MT::TaskScheduler scheduler;
59 
60 	StandartStackSizeTask tasks[100];
61 	scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
62 	CHECK(scheduler.WaitAll(1000));
63 }
64 
65 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
66 TEST(RunExtendedTasks)
67 {
68 	MT::TaskScheduler scheduler;
69 
70 	ExtendedStackSizeTask tasks[100];
71 	scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
72 	CHECK(scheduler.WaitAll(1000));
73 }
74 
75 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
76 TEST(RunMixedTasks)
77 {
78 	MT::TaskScheduler scheduler;
79 
80 	MT::TaskPool<ExtendedStackSizeTask, 64> extendedTaskPool;
81 	MT::TaskPool<StandartStackSizeTask, 64> standardTaskPool;
82 
83 	MT::TaskHandle taskHandles[100];
84 	for (size_t i = 0; i < MT_ARRAY_SIZE(taskHandles); ++i)
85 	{
86 		MT::TaskHandle handle;
87 
88 		if (i & 1)
89 		{
90 			handle = extendedTaskPool.Alloc(ExtendedStackSizeTask());
91 		} else
92 		{
93 			handle = standardTaskPool.Alloc(StandartStackSizeTask());
94 		}
95 		taskHandles[i] = handle;
96 	}
97 
98 	scheduler.RunAsync(MT::TaskGroup::Default(), &taskHandles[0], MT_ARRAY_SIZE(taskHandles));
99 	CHECK(scheduler.WaitAll(1000));
100 }
101 
102 
103 
104 }
105