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[20000];
37 		for (uint32 i = 0; i < MT_ARRAY_SIZE(stackData); i++)
38 		{
39 			stackData[i] = 0x0D;
40 		}
41 	}
42 };
43 
44 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
45 struct ExtendedStackSizeTask
46 {
47 	MT_DECLARE_TASK(ExtendedStackSizeTask, MT::StackRequirements::EXTENDED, MT::Color::Red);
48 
49 	void Do(MT::FiberContext&)
50 	{
51 		byte stackData[262144];
52 		for (uint32 i = 0; i < MT_ARRAY_SIZE(stackData); i++)
53 		{
54 			stackData[i] = 0x0D;
55 		}
56 	}
57 
58 };
59 
60 
61 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
62 TEST(RunStandartTasks)
63 {
64 	MT::TaskScheduler scheduler;
65 
66 	StandartStackSizeTask tasks[100];
67 	scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
68 	CHECK(scheduler.WaitAll(1000));
69 }
70 
71 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
72 TEST(RunExtendedTasks)
73 {
74 	MT::TaskScheduler scheduler;
75 
76 	ExtendedStackSizeTask tasks[100];
77 	scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
78 	CHECK(scheduler.WaitAll(1000));
79 }
80 
81 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
82 TEST(RunMixedTasks)
83 {
84 	MT::TaskScheduler scheduler;
85 
86 	MT::TaskPool<ExtendedStackSizeTask, 64> extendedTaskPool;
87 	MT::TaskPool<StandartStackSizeTask, 64> standardTaskPool;
88 
89 	MT::TaskHandle taskHandles[100];
90 	for (size_t i = 0; i < MT_ARRAY_SIZE(taskHandles); ++i)
91 	{
92 		MT::TaskHandle handle;
93 
94 		if (i & 1)
95 		{
96 			handle = extendedTaskPool.Alloc(ExtendedStackSizeTask());
97 		} else
98 		{
99 			handle = standardTaskPool.Alloc(StandartStackSizeTask());
100 		}
101 		taskHandles[i] = handle;
102 	}
103 
104 	scheduler.RunAsync(MT::TaskGroup::Default(), &taskHandles[0], MT_ARRAY_SIZE(taskHandles));
105 	CHECK(scheduler.WaitAll(1000));
106 }
107 
108 
109 
110 }
111