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(WaitTests)
28 {
29 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
30 namespace SimpleWaitFromSubtask
31 {
32 	MT::Atomic32<int32> subTaskCount;
33 	MT::Atomic32<int32> taskCount;
34 
35 	MT::TaskGroup testGroup;
36 
37 	struct Subtask
38 	{
39 		MT_DECLARE_TASK(Subtask, MT::StackRequirements::STANDARD, MT::Color::Blue);
40 
41 		void Do(MT::FiberContext&)
42 		{
43 			MT::Thread::SpinSleepMilliSeconds(2);
44 			subTaskCount.IncFetch();
45 		}
46 	};
47 
48 
49 	struct Task
50 	{
51 		MT_DECLARE_TASK(Task, MT::StackRequirements::STANDARD, MT::Color::Blue);
52 
53 		void Do(MT::FiberContext& ctx)
54 		{
55 			Subtask tasks[2];
56 			ctx.RunSubtasksAndYield(testGroup, &tasks[0], MT_ARRAY_SIZE(tasks));
57 
58 			taskCount.IncFetch();
59 
60 		}
61 	};
62 
63 
64 	// Checks one simple task
65 	TEST(RunOneSimpleWaitTask)
66 	{
67 		taskCount.Store(0);
68 		subTaskCount.Store(0);
69 
70 		MT::TaskScheduler scheduler;
71 
72 		testGroup = scheduler.CreateGroup();
73 
74 		Task tasks[16];
75 		scheduler.RunAsync(MT::TaskGroup::Default(), &tasks[0], MT_ARRAY_SIZE(tasks));
76 
77 		CHECK(scheduler.WaitAll(2000));
78 
79 		int subTaskCountFinisehd = subTaskCount.Load();
80 		CHECK(subTaskCountFinisehd == MT_ARRAY_SIZE(tasks) * 2);
81 
82 		int taskCountFinished = taskCount.Load();
83 		CHECK(taskCountFinished == MT_ARRAY_SIZE(tasks));
84 	}
85 }
86 ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
87 }
88 
89