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(SimpleTests)
28 {
29 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
30 struct SimpleTask
31 {
32 	MT_DECLARE_TASK(SimpleTask, MT::StackRequirements::STANDARD, MT::TaskPriority::NORMAL, MT::Color::Blue);
33 
34 	static const int sourceData = 0xFF33FF;
35 	int resultData;
36 
37 	SimpleTask() : resultData(0) {}
38 
39 	void Do(MT::FiberContext&)
40 	{
41 		resultData = sourceData;
42 	}
43 
44 	int GetSourceData()
45 	{
46 		return sourceData;
47 	}
48 };
49 
50 // Checks one simple task
51 TEST(RunOneSimpleTask)
52 {
53 	MT::TaskScheduler scheduler;
54 
55 	SimpleTask task;
56 	scheduler.RunAsync(MT::TaskGroup::Default(), &task, 1);
57 
58 	CHECK(scheduler.WaitAll(1000));
59 	CHECK_EQUAL(task.GetSourceData(), task.resultData);
60 }
61 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
62 
63 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
64 struct ALotOfTasks
65 {
66 	MT_DECLARE_TASK(ALotOfTasks, MT::StackRequirements::STANDARD, MT::TaskPriority::NORMAL, MT::Color::Blue);
67 
68 	MT::Atomic32<int32>* counter;
69 
70 	void Do(MT::FiberContext&)
71 	{
72 		counter->IncFetch();
73 		MT::Thread::SpinSleepMilliSeconds(1);
74 	}
75 };
76 
77 // Checks one simple task
78 TEST(ALotOfTasks)
79 {
80 
81 	MT::TaskScheduler scheduler;
82 
83 	MT::Atomic32<int32> counter;
84 
85 	static const int TASK_COUNT = 1000;
86 
87 	ALotOfTasks tasks[TASK_COUNT];
88 
89 	for (size_t i = 0; i < MT_ARRAY_SIZE(tasks); ++i)
90 		tasks[i].counter = &counter;
91 
92 	scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
93 
94 	int timeout = (TASK_COUNT / scheduler.GetWorkersCount()) * 2000;
95 
96 	CHECK(scheduler.WaitGroup(MT::TaskGroup::Default(), timeout));
97 	CHECK_EQUAL(TASK_COUNT, counter.Load());
98 }
99 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
100 }
101