completion_tc.c 5.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  1. /*
  2. * Copyright (c) 2006-2024, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2024-04-30 Shell init ver.
  9. */
  10. /**
  11. * Test Case for rt_completion API
  12. *
  13. * The test simulates a producer-consumer interaction where a producer thread
  14. * generates data, and a consumer thread consumes the data after waiting for its
  15. * availability using rt_completion synchronization primitives.
  16. *
  17. * Test Criteria:
  18. * - The producer should correctly increment the test data and signal
  19. * completion.
  20. * - The consumer should correctly wait for data update, consume it, and signal
  21. * completion.
  22. * - Data integrity should be maintained between producer and consumer.
  23. * - Synchronization is properly done so both can see consistent data.
  24. * - Random latency is introduced to simulate racing scenarios.
  25. */
  26. #define TEST_LATENCY_TICK (1)
  27. #define TEST_LOOP_TIMES (60 * RT_TICK_PER_SECOND)
  28. #define TEST_PROGRESS_ON (RT_TICK_PER_SECOND)
  29. #include "utest.h"
  30. #include <ipc/completion.h>
  31. #include <rtthread.h>
  32. #include <stdlib.h>
  33. static struct rt_completion _prod_completion;
  34. static struct rt_completion _cons_completion;
  35. static int _test_data = 0;
  36. static rt_atomic_t _progress_counter;
  37. static struct rt_semaphore _thr_exit_sem;
  38. static void done_safely(struct rt_completion *completion)
  39. {
  40. rt_err_t error;
  41. /* Signal completion */
  42. error = rt_completion_wakeup(completion);
  43. /* try again if failed to produce */
  44. if (error == -RT_EEMPTY)
  45. {
  46. rt_thread_yield();
  47. }
  48. else if (error)
  49. {
  50. uassert_false(0);
  51. rt_thread_delete(rt_thread_self());
  52. }
  53. }
  54. static void wait_safely(struct rt_completion *completion)
  55. {
  56. rt_err_t error;
  57. do
  58. {
  59. error = rt_completion_wait_flags(completion, RT_WAITING_FOREVER,
  60. RT_INTERRUPTIBLE);
  61. if (error)
  62. {
  63. uassert_true(error == -RT_EINTR);
  64. rt_thread_yield();
  65. }
  66. else
  67. {
  68. break;
  69. }
  70. } while (1);
  71. }
  72. static void producer_thread_entry(void *parameter)
  73. {
  74. for (size_t i = 0; i < TEST_LOOP_TIMES; i++)
  75. {
  76. /* Produce data */
  77. _test_data++;
  78. /* notify consumer */
  79. done_safely(&_prod_completion);
  80. /* Delay before producing next data */
  81. rt_thread_delay(TEST_LATENCY_TICK);
  82. /* sync with consumer */
  83. wait_safely(&_cons_completion);
  84. }
  85. rt_sem_release(&_thr_exit_sem);
  86. }
  87. static void _wait_until_edge(void)
  88. {
  89. rt_tick_t entry_level, current;
  90. rt_base_t random_latency;
  91. entry_level = rt_tick_get();
  92. do
  93. {
  94. current = rt_tick_get();
  95. } while (current == entry_level);
  96. /* give a random latency for test */
  97. random_latency = rand();
  98. entry_level = current;
  99. for (size_t i = 0; i < random_latency; i++)
  100. {
  101. current = rt_tick_get();
  102. if (current != entry_level) break;
  103. }
  104. }
  105. static void consumer_thread_entry(void *parameter)
  106. {
  107. int local_test_data = 0;
  108. rt_thread_startup(parameter);
  109. for (size_t i = 0; i < TEST_LOOP_TIMES; i++)
  110. {
  111. /* add more random case for test */
  112. _wait_until_edge();
  113. /* Wait for data update */
  114. wait_safely(&_prod_completion);
  115. /* Consume data */
  116. if (local_test_data + 1 != _test_data)
  117. {
  118. LOG_I("local test data is %d, shared test data is %d",
  119. local_test_data, _test_data);
  120. uassert_true(0);
  121. }
  122. else if (rt_atomic_add(&_progress_counter, 1) % TEST_PROGRESS_ON == 0)
  123. {
  124. uassert_true(1);
  125. }
  126. local_test_data = _test_data;
  127. done_safely(&_cons_completion);
  128. }
  129. rt_sem_release(&_thr_exit_sem);
  130. }
  131. static void testcase(void)
  132. {
  133. /* Initialize completion object */
  134. rt_completion_init(&_prod_completion);
  135. rt_completion_init(&_cons_completion);
  136. /* Create producer and consumer threads */
  137. rt_thread_t producer_thread =
  138. rt_thread_create("producer", producer_thread_entry, RT_NULL,
  139. UTEST_THR_STACK_SIZE, UTEST_THR_PRIORITY, 100);
  140. rt_thread_t consumer_thread =
  141. rt_thread_create("consumer", consumer_thread_entry, producer_thread,
  142. UTEST_THR_STACK_SIZE, UTEST_THR_PRIORITY, 100);
  143. uassert_true(producer_thread != RT_NULL);
  144. uassert_true(consumer_thread != RT_NULL);
  145. LOG_I("Summary:\n"
  146. "\tTest times: %ds(%d)",
  147. TEST_LOOP_TIMES / RT_TICK_PER_SECOND, TEST_LOOP_TIMES);
  148. rt_thread_startup(consumer_thread);
  149. for (size_t i = 0; i < 2; i++)
  150. {
  151. rt_sem_take(&_thr_exit_sem, RT_WAITING_FOREVER);
  152. }
  153. }
  154. static rt_err_t utest_tc_init(void)
  155. {
  156. _test_data = 0;
  157. _progress_counter = 0;
  158. rt_sem_init(&_thr_exit_sem, "test", 0, RT_IPC_FLAG_PRIO);
  159. return RT_EOK;
  160. }
  161. static rt_err_t utest_tc_cleanup(void)
  162. {
  163. rt_sem_detach(&_thr_exit_sem);
  164. return RT_EOK;
  165. }
  166. UTEST_TC_EXPORT(testcase, "testcases.drivers.ipc.rt_completion.basic",
  167. utest_tc_init, utest_tc_cleanup, 10);