bm_pollset.cc 7.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259
  1. /*
  2. *
  3. * Copyright 2017 gRPC authors.
  4. *
  5. * Licensed under the Apache License, Version 2.0 (the "License");
  6. * you may not use this file except in compliance with the License.
  7. * You may obtain a copy of the License at
  8. *
  9. * http://www.apache.org/licenses/LICENSE-2.0
  10. *
  11. * Unless required by applicable law or agreed to in writing, software
  12. * distributed under the License is distributed on an "AS IS" BASIS,
  13. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  14. * See the License for the specific language governing permissions and
  15. * limitations under the License.
  16. *
  17. */
  18. /* Test out pollset latencies */
  19. #include <grpc/grpc.h>
  20. #include <grpc/support/alloc.h>
  21. #include <grpc/support/log.h>
  22. #include <grpc/support/useful.h>
  23. #include "src/core/lib/iomgr/ev_posix.h"
  24. #include "src/core/lib/iomgr/pollset.h"
  25. #include "src/core/lib/iomgr/port.h"
  26. #include "src/core/lib/iomgr/wakeup_fd_posix.h"
  27. #include "test/cpp/microbenchmarks/helpers.h"
  28. #include "third_party/benchmark/include/benchmark/benchmark.h"
  29. #include <string.h>
  30. #ifdef GRPC_LINUX_MULTIPOLL_WITH_EPOLL
  31. #include <sys/epoll.h>
  32. #include <sys/eventfd.h>
  33. #include <unistd.h>
  34. #endif
  35. auto& force_library_initialization = Library::get();
  36. static void shutdown_ps(void* ps, grpc_error* error) {
  37. grpc_pollset_destroy(static_cast<grpc_pollset*>(ps));
  38. }
  39. static void BM_CreateDestroyPollset(benchmark::State& state) {
  40. TrackCounters track_counters;
  41. size_t ps_sz = grpc_pollset_size();
  42. grpc_pollset* ps = static_cast<grpc_pollset*>(gpr_malloc(ps_sz));
  43. gpr_mu* mu;
  44. grpc_core::ExecCtx _local_exec_ctx;
  45. grpc_closure shutdown_ps_closure;
  46. GRPC_CLOSURE_INIT(&shutdown_ps_closure, shutdown_ps, ps,
  47. grpc_schedule_on_exec_ctx);
  48. while (state.KeepRunning()) {
  49. memset(ps, 0, ps_sz);
  50. grpc_pollset_init(ps, &mu);
  51. gpr_mu_lock(mu);
  52. grpc_pollset_shutdown(ps, &shutdown_ps_closure);
  53. gpr_mu_unlock(mu);
  54. grpc_core::ExecCtx::Get()->Flush();
  55. }
  56. gpr_free(ps);
  57. track_counters.Finish(state);
  58. }
  59. BENCHMARK(BM_CreateDestroyPollset);
  60. #ifdef GRPC_LINUX_MULTIPOLL_WITH_EPOLL
  61. static void BM_PollEmptyPollset_SpeedOfLight(benchmark::State& state) {
  62. // equivalent to BM_PollEmptyPollset, but just use the OS primitives to guage
  63. // what the speed of light would be if we abstracted perfectly
  64. TrackCounters track_counters;
  65. int epfd = epoll_create1(0);
  66. GPR_ASSERT(epfd != -1);
  67. size_t nev = state.range(0);
  68. size_t nfd = state.range(1);
  69. epoll_event* ev = new epoll_event[nev];
  70. std::vector<int> fds;
  71. for (size_t i = 0; i < nfd; i++) {
  72. fds.push_back(eventfd(0, 0));
  73. epoll_event ev;
  74. ev.events = EPOLLIN;
  75. epoll_ctl(epfd, EPOLL_CTL_ADD, fds.back(), &ev);
  76. }
  77. while (state.KeepRunning()) {
  78. epoll_wait(epfd, ev, nev, 0);
  79. }
  80. for (auto fd : fds) {
  81. close(fd);
  82. }
  83. close(epfd);
  84. delete[] ev;
  85. track_counters.Finish(state);
  86. }
  87. BENCHMARK(BM_PollEmptyPollset_SpeedOfLight)
  88. ->Args({1, 0})
  89. ->Args({1, 1})
  90. ->Args({1, 10})
  91. ->Args({1, 100})
  92. ->Args({1, 1000})
  93. ->Args({1, 10000})
  94. ->Args({1, 100000})
  95. ->Args({10, 1})
  96. ->Args({100, 1})
  97. ->Args({1000, 1});
  98. #endif
  99. static void BM_PollEmptyPollset(benchmark::State& state) {
  100. TrackCounters track_counters;
  101. size_t ps_sz = grpc_pollset_size();
  102. grpc_pollset* ps = static_cast<grpc_pollset*>(gpr_zalloc(ps_sz));
  103. gpr_mu* mu;
  104. grpc_pollset_init(ps, &mu);
  105. grpc_core::ExecCtx _local_exec_ctx;
  106. gpr_mu_lock(mu);
  107. while (state.KeepRunning()) {
  108. GRPC_ERROR_UNREF(grpc_pollset_work(ps, nullptr, 0));
  109. }
  110. grpc_closure shutdown_ps_closure;
  111. GRPC_CLOSURE_INIT(&shutdown_ps_closure, shutdown_ps, ps,
  112. grpc_schedule_on_exec_ctx);
  113. grpc_pollset_shutdown(ps, &shutdown_ps_closure);
  114. gpr_mu_unlock(mu);
  115. gpr_free(ps);
  116. track_counters.Finish(state);
  117. }
  118. BENCHMARK(BM_PollEmptyPollset);
  119. static void BM_PollAddFd(benchmark::State& state) {
  120. TrackCounters track_counters;
  121. size_t ps_sz = grpc_pollset_size();
  122. grpc_pollset* ps = static_cast<grpc_pollset*>(gpr_zalloc(ps_sz));
  123. gpr_mu* mu;
  124. grpc_pollset_init(ps, &mu);
  125. grpc_core::ExecCtx _local_exec_ctx;
  126. grpc_wakeup_fd wakeup_fd;
  127. GPR_ASSERT(
  128. GRPC_LOG_IF_ERROR("wakeup_fd_init", grpc_wakeup_fd_init(&wakeup_fd)));
  129. grpc_fd* fd = grpc_fd_create(wakeup_fd.read_fd, "xxx");
  130. while (state.KeepRunning()) {
  131. grpc_pollset_add_fd(ps, fd);
  132. grpc_core::ExecCtx::Get()->Flush();
  133. }
  134. grpc_fd_orphan(fd, nullptr, nullptr, false /* already_closed */, "xxx");
  135. grpc_closure shutdown_ps_closure;
  136. GRPC_CLOSURE_INIT(&shutdown_ps_closure, shutdown_ps, ps,
  137. grpc_schedule_on_exec_ctx);
  138. gpr_mu_lock(mu);
  139. grpc_pollset_shutdown(ps, &shutdown_ps_closure);
  140. gpr_mu_unlock(mu);
  141. gpr_free(ps);
  142. track_counters.Finish(state);
  143. }
  144. BENCHMARK(BM_PollAddFd);
  145. class Closure : public grpc_closure {
  146. public:
  147. virtual ~Closure() {}
  148. };
  149. template <class F>
  150. Closure* MakeClosure(F f, grpc_closure_scheduler* scheduler) {
  151. struct C : public Closure {
  152. C(F f, grpc_closure_scheduler* scheduler) : f_(f) {
  153. GRPC_CLOSURE_INIT(this, C::cbfn, this, scheduler);
  154. }
  155. static void cbfn(void* arg, grpc_error* error) {
  156. C* p = static_cast<C*>(arg);
  157. p->f_();
  158. }
  159. F f_;
  160. };
  161. return new C(f, scheduler);
  162. }
  163. #ifdef GRPC_LINUX_MULTIPOLL_WITH_EPOLL
  164. static void BM_SingleThreadPollOneFd_SpeedOfLight(benchmark::State& state) {
  165. // equivalent to BM_PollEmptyPollset, but just use the OS primitives to guage
  166. // what the speed of light would be if we abstracted perfectly
  167. TrackCounters track_counters;
  168. int epfd = epoll_create1(0);
  169. GPR_ASSERT(epfd != -1);
  170. epoll_event ev[100];
  171. int fd = eventfd(0, EFD_NONBLOCK);
  172. ev[0].events = EPOLLIN;
  173. epoll_ctl(epfd, EPOLL_CTL_ADD, fd, &ev[0]);
  174. while (state.KeepRunning()) {
  175. int err;
  176. do {
  177. err = eventfd_write(fd, 1);
  178. } while (err < 0 && errno == EINTR);
  179. GPR_ASSERT(err == 0);
  180. do {
  181. err = epoll_wait(epfd, ev, GPR_ARRAY_SIZE(ev), 0);
  182. } while (err < 0 && errno == EINTR);
  183. GPR_ASSERT(err == 1);
  184. eventfd_t value;
  185. do {
  186. err = eventfd_read(fd, &value);
  187. } while (err < 0 && errno == EINTR);
  188. GPR_ASSERT(err == 0);
  189. }
  190. close(fd);
  191. close(epfd);
  192. track_counters.Finish(state);
  193. }
  194. BENCHMARK(BM_SingleThreadPollOneFd_SpeedOfLight);
  195. #endif
  196. static void BM_SingleThreadPollOneFd(benchmark::State& state) {
  197. TrackCounters track_counters;
  198. size_t ps_sz = grpc_pollset_size();
  199. grpc_pollset* ps = static_cast<grpc_pollset*>(gpr_zalloc(ps_sz));
  200. gpr_mu* mu;
  201. grpc_pollset_init(ps, &mu);
  202. grpc_core::ExecCtx _local_exec_ctx;
  203. grpc_wakeup_fd wakeup_fd;
  204. GRPC_ERROR_UNREF(grpc_wakeup_fd_init(&wakeup_fd));
  205. grpc_fd* wakeup = grpc_fd_create(wakeup_fd.read_fd, "wakeup_read");
  206. grpc_pollset_add_fd(ps, wakeup);
  207. bool done = false;
  208. Closure* continue_closure = MakeClosure(
  209. [&]() {
  210. GRPC_ERROR_UNREF(grpc_wakeup_fd_consume_wakeup(&wakeup_fd));
  211. if (!state.KeepRunning()) {
  212. done = true;
  213. return;
  214. }
  215. GRPC_ERROR_UNREF(grpc_wakeup_fd_wakeup(&wakeup_fd));
  216. grpc_fd_notify_on_read(wakeup, continue_closure);
  217. },
  218. grpc_schedule_on_exec_ctx);
  219. GRPC_ERROR_UNREF(grpc_wakeup_fd_wakeup(&wakeup_fd));
  220. grpc_fd_notify_on_read(wakeup, continue_closure);
  221. gpr_mu_lock(mu);
  222. while (!done) {
  223. GRPC_ERROR_UNREF(grpc_pollset_work(ps, nullptr, GRPC_MILLIS_INF_FUTURE));
  224. }
  225. grpc_fd_orphan(wakeup, nullptr, nullptr, false /* already_closed */, "done");
  226. wakeup_fd.read_fd = 0;
  227. grpc_closure shutdown_ps_closure;
  228. GRPC_CLOSURE_INIT(&shutdown_ps_closure, shutdown_ps, ps,
  229. grpc_schedule_on_exec_ctx);
  230. grpc_pollset_shutdown(ps, &shutdown_ps_closure);
  231. gpr_mu_unlock(mu);
  232. grpc_wakeup_fd_destroy(&wakeup_fd);
  233. gpr_free(ps);
  234. track_counters.Finish(state);
  235. delete continue_closure;
  236. }
  237. BENCHMARK(BM_SingleThreadPollOneFd);
  238. BENCHMARK_MAIN();