AsyncLoader.cpp 4.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265
  1. // Copyright (C) 2009-2023, 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. }
  90. // Simple task that will finish
  91. {
  92. AsyncLoader a;
  93. Barrier barrier(2);
  94. a.submitNewTask<Task>(0.0f, &barrier, nullptr);
  95. barrier.wait();
  96. }
  97. // Many tasks that will finish
  98. {
  99. AsyncLoader a;
  100. Barrier barrier(2);
  101. Atomic<U32> counter = {0};
  102. const U COUNT = 100;
  103. for(U i = 0; i < COUNT; i++)
  104. {
  105. Barrier* pbarrier = nullptr;
  106. if(i == COUNT - 1)
  107. {
  108. pbarrier = &barrier;
  109. }
  110. a.submitNewTask<Task>(0.01f, pbarrier, &counter);
  111. }
  112. barrier.wait();
  113. ANKI_TEST_EXPECT_EQ(counter.load(), COUNT);
  114. }
  115. // Many tasks that will _not_ finish
  116. {
  117. AsyncLoader a;
  118. for(U i = 0; i < 100; i++)
  119. {
  120. a.submitNewTask<Task>(0.0f, nullptr, nullptr);
  121. }
  122. }
  123. // Tasks that allocate
  124. {
  125. AsyncLoader a;
  126. Barrier barrier(2);
  127. for(U i = 0; i < 10; i++)
  128. {
  129. Barrier* pbarrier = nullptr;
  130. if(i == 9)
  131. {
  132. pbarrier = &barrier;
  133. }
  134. a.submitNewTask<MemTask>(&pool, pbarrier);
  135. }
  136. barrier.wait();
  137. }
  138. // Tasks that allocate and never finished
  139. {
  140. AsyncLoader a;
  141. for(U i = 0; i < 10; i++)
  142. {
  143. a.submitNewTask<MemTask>(&pool, nullptr);
  144. }
  145. }
  146. // Pause/resume
  147. {
  148. AsyncLoader a;
  149. Atomic<U32> counter(0);
  150. Barrier barrier(2);
  151. // Check if the pause will sync
  152. a.submitNewTask<Task>(0.5f, nullptr, &counter, 0);
  153. HighRezTimer::sleep(0.25); // Wait for the thread to pick the task...
  154. a.pause(); /// ...and then sync
  155. ANKI_TEST_EXPECT_EQ(counter.load(), 1);
  156. // Test resume
  157. a.submitNewTask<Task>(0.1f, nullptr, &counter, 1);
  158. HighRezTimer::sleep(1.0);
  159. ANKI_TEST_EXPECT_EQ(counter.load(), 1);
  160. a.resume();
  161. // Sync
  162. a.submitNewTask<Task>(0.1f, &barrier, &counter, 2);
  163. barrier.wait();
  164. ANKI_TEST_EXPECT_EQ(counter.load(), 3);
  165. }
  166. // Pause/resume
  167. {
  168. AsyncLoader a;
  169. Atomic<U32> counter(0);
  170. Barrier barrier(2);
  171. // Check task resubmit
  172. a.submitNewTask<Task>(0.0f, &barrier, &counter, -1, false, true);
  173. barrier.wait();
  174. barrier.wait();
  175. ANKI_TEST_EXPECT_EQ(counter.load(), 2);
  176. // Check task pause
  177. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, true, false);
  178. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, false, false);
  179. HighRezTimer::sleep(1.0);
  180. ANKI_TEST_EXPECT_EQ(counter.load(), 3);
  181. a.resume();
  182. HighRezTimer::sleep(1.0);
  183. ANKI_TEST_EXPECT_EQ(counter.load(), 4);
  184. // Check both
  185. counter.setNonAtomically(0);
  186. a.submitNewTask<Task>(0.0f, nullptr, &counter, 0, false, false);
  187. a.submitNewTask<Task>(0.0f, nullptr, &counter, -1, true, true);
  188. a.submitNewTask<Task>(0.0f, nullptr, &counter, 2, false, false);
  189. HighRezTimer::sleep(1.0);
  190. ANKI_TEST_EXPECT_EQ(counter.load(), 2);
  191. a.resume();
  192. HighRezTimer::sleep(1.0);
  193. ANKI_TEST_EXPECT_EQ(counter.load(), 4);
  194. }
  195. // Fuzzy test
  196. {
  197. AsyncLoader a;
  198. Barrier barrier(2);
  199. Atomic<U32> counter = {0};
  200. for(U32 i = 0; i < 10; i++)
  201. {
  202. Barrier* pbarrier = nullptr;
  203. if(i == 9)
  204. {
  205. pbarrier = &barrier;
  206. }
  207. a.submitNewTask<Task>(getRandomRange(0.0f, 0.5f), pbarrier, &counter, i);
  208. }
  209. barrier.wait();
  210. ANKI_TEST_EXPECT_EQ(counter.load(), 10);
  211. }
  212. }