基于C++ Coroutines提案 ‘Stackless Resumable Functions’编写的协程库
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

test_async_event.cpp 3.1KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. #include <chrono>
  2. #include <iostream>
  3. #include <string>
  4. #include <thread>
  5. #include "librf.h"
  6. using namespace resumef;
  7. //非协程的逻辑线程,或异步代码,可以通过event_t通知到协程,并且不会阻塞协程所在的线程。
  8. static std::thread async_set_event(const event_t & e, std::chrono::milliseconds dt)
  9. {
  10. return std::thread([=]
  11. {
  12. std::this_thread::sleep_for(dt);
  13. e.signal();
  14. });
  15. }
  16. static future_t<> resumable_wait_event(const event_t & e)
  17. {
  18. using namespace std::chrono;
  19. if (co_await e.wait() == false)
  20. std::cout << "time out!" << std::endl;
  21. else
  22. std::cout << "event signal!" << std::endl;
  23. }
  24. static void test_wait_one()
  25. {
  26. using namespace std::chrono;
  27. {
  28. event_t evt;
  29. go resumable_wait_event(evt);
  30. auto tt = async_set_event(evt, 1000ms);
  31. this_scheduler()->run_until_notask();
  32. tt.join();
  33. }
  34. {
  35. event_t evt2(1);
  36. go[&]() -> future_t<>
  37. {
  38. (void)co_await evt2.wait();
  39. std::cout << "event signal on 1!" << std::endl;
  40. };
  41. go[&]() -> future_t<>
  42. {
  43. (void)co_await evt2.wait();
  44. std::cout << "event signal on 2!" << std::endl;
  45. };
  46. std::cout << std::this_thread::get_id() << std::endl;
  47. auto tt = async_set_event(evt2, 1000ms);
  48. this_scheduler()->run_until_notask();
  49. tt.join();
  50. }
  51. }
  52. static void test_wait_any()
  53. {
  54. using namespace std::chrono;
  55. event_t evts[8];
  56. go[&]() -> future_t<>
  57. {
  58. for (size_t i = 0; i < _countof(evts); ++i)
  59. {
  60. intptr_t idx = co_await event_t::wait_any(evts);
  61. std::cout << "event " << idx << " signal!" << std::endl;
  62. }
  63. };
  64. std::vector<std::thread> vtt;
  65. srand((int)time(nullptr));
  66. for (auto & e : evts)
  67. {
  68. vtt.emplace_back(async_set_event(e, 1ms * (500 + rand() % 1000)));
  69. }
  70. this_scheduler()->run_until_notask();
  71. for (auto & tt : vtt)
  72. tt.join();
  73. }
  74. static void test_wait_all()
  75. {
  76. using namespace std::chrono;
  77. event_t evts[8];
  78. go[&]() -> future_t<>
  79. {
  80. if (co_await event_t::wait_all(evts))
  81. std::cout << "all event signal!" << std::endl;
  82. else
  83. std::cout << "time out!" << std::endl;
  84. };
  85. std::vector<std::thread> vtt;
  86. srand((int)time(nullptr));
  87. for (auto & e : evts)
  88. {
  89. vtt.emplace_back(async_set_event(e, 1ms * (500 + rand() % 1000)));
  90. }
  91. this_scheduler()->run_until_notask();
  92. for (auto & tt : vtt)
  93. tt.join();
  94. }
  95. static void test_wait_all_timeout()
  96. {
  97. using namespace std::chrono;
  98. event_t evts[8];
  99. go[&]() -> future_t<>
  100. {
  101. if (co_await event_t::wait_all_for(1000ms, evts))
  102. std::cout << "all event signal!" << std::endl;
  103. else
  104. std::cout << "time out!" << std::endl;
  105. };
  106. std::vector<std::thread> vtt;
  107. srand((int)time(nullptr));
  108. for (auto & e : evts)
  109. {
  110. vtt.emplace_back(async_set_event(e, 1ms * (500 + rand() % 1000)));
  111. }
  112. this_scheduler()->run_until_notask();
  113. for (auto & tt : vtt)
  114. tt.join();
  115. }
  116. void resumable_main_event()
  117. {
  118. test_wait_one();
  119. std::cout << std::endl;
  120. test_wait_any();
  121. std::cout << std::endl;
  122. test_wait_all();
  123. std::cout << std::endl;
  124. test_wait_all_timeout();
  125. std::cout << std::endl;
  126. }