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 28 SUITE(CleanupTests) 29 { 30 31 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 32 struct NotFinishedTaskDestroy 33 { 34 MT_DECLARE_TASK(NotFinishedTaskDestroy, MT::StackRequirements::STANDARD, MT::Color::Blue); 35 36 static const int timeLimitMS = 100; 37 void Do(MT::FiberContext&) 38 { 39 MT::Thread::SpinSleepMilliSeconds(timeLimitMS * 20); 40 } 41 }; 42 43 // Checks one simple task 44 TEST(NotFinishedTaskDestroy) 45 { 46 MT::TaskScheduler scheduler; 47 48 NotFinishedTaskDestroy task; 49 50 scheduler.RunAsync(MT::TaskGroup::Default(), &task, 1); 51 52 CHECK(!scheduler.WaitAll(NotFinishedTaskDestroy::timeLimitMS)); 53 } 54 //////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// 55 } 56