AsyncLoader.cpp 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274
  1. // Copyright (C) 2009-2022, Panagiotis Christopoulos Charitos and contributors.
  2. // All rights reserved.
  3. // Code licensed under the BSD License.
  4. // http://www.anki3d.org/LICENSE
  5. #include <Tests/Framework/Framework.h>
  6. #include <AnKi/Resource/AsyncLoader.h>
  7. #include <AnKi/Util/HighRezTimer.h>
  8. #include <AnKi/Util/Atomic.h>
  9. #include <AnKi/Util/Functions.h>
  10. using namespace anki;
  11. namespace {
  12. class Task : public AsyncLoaderTask
  13. {
  14. public:
  15. F32 m_sleepTime = 0.0;
  16. Barrier* m_barrier = nullptr;
  17. Atomic<U32>* m_count = nullptr;
  18. I32 m_id = -1;
  19. Bool m_pause;
  20. Bool m_resubmit;
  21. Task(F32 time, Barrier* barrier, Atomic<U32>* count, I32 id = -1, Bool pause = false, Bool resubmit = false)
  22. : m_sleepTime(time)
  23. , m_barrier(barrier)
  24. , m_count(count)
  25. , m_id(id)
  26. , m_pause(pause)
  27. , m_resubmit(resubmit)
  28. {
  29. }
  30. Error operator()(AsyncLoaderTaskContext& ctx)
  31. {
  32. if(m_count)
  33. {
  34. auto x = m_count->fetchAdd(1);
  35. if(m_id >= 0)
  36. {
  37. if(m_id != static_cast<I32>(x))
  38. {
  39. ANKI_LOGE("Wrong excecution order");
  40. return Error::kFunctionFailed;
  41. }
  42. }
  43. }
  44. if(m_sleepTime != 0.0)
  45. {
  46. HighRezTimer::sleep(m_sleepTime);
  47. }
  48. if(m_barrier)
  49. {
  50. m_barrier->wait();
  51. }
  52. ctx.m_pause = m_pause;
  53. ctx.m_resubmitTask = m_resubmit;
  54. m_resubmit = false;
  55. return Error::kNone;
  56. }
  57. };
  58. class MemTask : public AsyncLoaderTask
  59. {
  60. public:
  61. HeapMemoryPool* m_pool;
  62. Barrier* m_barrier = nullptr;
  63. MemTask(HeapMemoryPool* pool, Barrier* barrier)
  64. : m_pool(pool)
  65. , m_barrier(barrier)
  66. {
  67. }
  68. Error operator()([[maybe_unused]] AsyncLoaderTaskContext& ctx)
  69. {
  70. void* mem = m_pool->allocate(10, 16);
  71. if(!mem)
  72. return Error::kFunctionFailed;
  73. HighRezTimer::sleep(0.1);
  74. m_pool->free(mem);
  75. if(m_barrier)
  76. {
  77. m_barrier->wait();
  78. }
  79. return Error::kNone;
  80. }
  81. };
  82. } // namespace
  83. ANKI_TEST(Resource, AsyncLoader)
  84. {
  85. HeapMemoryPool pool(allocAligned, nullptr);
  86. // Simple create destroy
  87. {
  88. AsyncLoader a;
  89. a.init(&pool);
  90. }
  91. // Simple task that will finish
  92. {
  93. AsyncLoader a;
  94. a.init(&pool);
  95. Barrier barrier(2);
  96. a.submitNewTask<Task>(0.0f, &barrier, nullptr);
  97. barrier.wait();
  98. }
  99. // Many tasks that will finish
  100. {
  101. AsyncLoader a;
  102. a.init(&pool);
  103. Barrier barrier(2);
  104. Atomic<U32> counter = {0};
  105. const U COUNT = 100;
  106. for(U i = 0; i < COUNT; i++)
  107. {
  108. Barrier* pbarrier = nullptr;
  109. if(i == COUNT - 1)
  110. {
  111. pbarrier = &barrier;
  112. }
  113. a.submitNewTask<Task>(0.01f, pbarrier, &counter);
  114. }
  115. barrier.wait();
  116. ANKI_TEST_EXPECT_EQ(counter.load(), COUNT);
  117. }
  118. // Many tasks that will _not_ finish
  119. {
  120. AsyncLoader a;
  121. a.init(&pool);
  122. for(U i = 0; i < 100; i++)
  123. {
  124. a.submitNewTask<Task>(0.0f, nullptr, nullptr);
  125. }
  126. }
  127. // Tasks that allocate
  128. {
  129. AsyncLoader a;
  130. a.init(&pool);
  131. Barrier barrier(2);
  132. for(U i = 0; i < 10; i++)
  133. {
  134. Barrier* pbarrier = nullptr;
  135. if(i == 9)
  136. {
  137. pbarrier = &barrier;
  138. }
  139. a.submitNewTask<MemTask>(&pool, pbarrier);
  140. }
  141. barrier.wait();
  142. }
  143. // Tasks that allocate and never finished
  144. {
  145. AsyncLoader a;
  146. a.init(&pool);
  147. for(U i = 0; i < 10; i++)
  148. {
  149. a.submitNewTask<MemTask>(&pool, nullptr);
  150. }
  151. }
  152. // Pause/resume
  153. {
  154. AsyncLoader a;
  155. a.init(&pool);
  156. Atomic<U32> counter(0);
  157. Barrier barrier(2);
  158. // Check if the pause will sync
  159. a.submitNewTask<Task>(0.5f, nullptr, &counter, 0);
  160. HighRezTimer::sleep(0.25); // Wait for the thread to pick the task...
  161. a.pause(); /// ...and then sync
  162. ANKI_TEST_EXPECT_EQ(counter.load(), 1);
  163. // Test resume
  164. a.submitNewTask<Task>(0.1f, nullptr, &counter, 1);
  165. HighRezTimer::sleep(1.0);
  166. ANKI_TEST_EXPECT_EQ(counter.load(), 1);
  167. a.resume();
  168. // Sync
  169. a.submitNewTask<Task>(0.1f, &barrier, &counter, 2);
  170. barrier.wait();
  171. ANKI_TEST_EXPECT_EQ(counter.load(), 3);
  172. }
  173. // Pause/resume
  174. {
  175. AsyncLoader a;
  176. a.init(&pool);
  177. Atomic<U32> counter(0);
  178. Barrier barrier(2);
  179. // Check task resubmit
  180. a.submitNewTask<Task>(0.0f, &barrier, &counter, -1, false, true);
  181. barrier.wait();
  182. barrier.wait();
  183. ANKI_TEST_EXPECT_EQ(counter.load(), 2);
  184. // Check task pause
  185. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, true, false);
  186. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, false, false);
  187. HighRezTimer::sleep(1.0);
  188. ANKI_TEST_EXPECT_EQ(counter.load(), 3);
  189. a.resume();
  190. HighRezTimer::sleep(1.0);
  191. ANKI_TEST_EXPECT_EQ(counter.load(), 4);
  192. // Check both
  193. counter.setNonAtomically(0);
  194. a.submitNewTask<Task>(0.0f, nullptr, &counter, 0, false, false);
  195. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, true, true);
  196. a.submitNewTask<Task>(0.0f, nullptr, &counter, 2, false, false);
  197. HighRezTimer::sleep(1.0);
  198. ANKI_TEST_EXPECT_EQ(counter.load(), 2);
  199. a.resume();
  200. HighRezTimer::sleep(1.0);
  201. ANKI_TEST_EXPECT_EQ(counter.load(), 4);
  202. }
  203. // Fuzzy test
  204. {
  205. AsyncLoader a;
  206. a.init(&pool);
  207. Barrier barrier(2);
  208. Atomic<U32> counter = {0};
  209. for(U32 i = 0; i < 10; i++)
  210. {
  211. Barrier* pbarrier = nullptr;
  212. if(i == 9)
  213. {
  214. pbarrier = &barrier;
  215. }
  216. a.submitNewTask<Task>(getRandomRange(0.0f, 0.5f), pbarrier, &counter, i);
  217. }
  218. barrier.wait();
  219. ANKI_TEST_EXPECT_EQ(counter.load(), 10);
  220. }
  221. }