benchmark-million-timers.c 2.6 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  1. /* Copyright Joyent, Inc. and other Node contributors. All rights reserved.
  2. *
  3. * Permission is hereby granted, free of charge, to any person obtaining a copy
  4. * of this software and associated documentation files (the "Software"), to
  5. * deal in the Software without restriction, including without limitation the
  6. * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  7. * sell copies of the Software, and to permit persons to whom the Software is
  8. * furnished to do so, subject to the following conditions:
  9. *
  10. * The above copyright notice and this permission notice shall be included in
  11. * all copies or substantial portions of the Software.
  12. *
  13. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  14. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  15. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  16. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  17. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  18. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  19. * IN THE SOFTWARE.
  20. */
  21. #include "task.h"
  22. #include "uv.h"
  23. #define NUM_TIMERS (10 * 1000 * 1000)
  24. static int timer_cb_called;
  25. static int close_cb_called;
  26. static void timer_cb(uv_timer_t* handle, int status) {
  27. timer_cb_called++;
  28. }
  29. static void close_cb(uv_handle_t* handle) {
  30. close_cb_called++;
  31. }
  32. BENCHMARK_IMPL(million_timers) {
  33. uv_timer_t* timers;
  34. uv_loop_t* loop;
  35. uint64_t before_all;
  36. uint64_t before_run;
  37. uint64_t after_run;
  38. uint64_t after_all;
  39. int timeout;
  40. int i;
  41. timers = malloc(NUM_TIMERS * sizeof(timers[0]));
  42. ASSERT(timers != NULL);
  43. loop = uv_default_loop();
  44. timeout = 0;
  45. before_all = uv_hrtime();
  46. for (i = 0; i < NUM_TIMERS; i++) {
  47. if (i % 1000 == 0) timeout++;
  48. ASSERT(0 == uv_timer_init(loop, timers + i));
  49. ASSERT(0 == uv_timer_start(timers + i, timer_cb, timeout, 0));
  50. }
  51. before_run = uv_hrtime();
  52. ASSERT(0 == uv_run(loop, UV_RUN_DEFAULT));
  53. after_run = uv_hrtime();
  54. for (i = 0; i < NUM_TIMERS; i++)
  55. uv_close((uv_handle_t*) (timers + i), close_cb);
  56. ASSERT(0 == uv_run(loop, UV_RUN_DEFAULT));
  57. after_all = uv_hrtime();
  58. ASSERT(timer_cb_called == NUM_TIMERS);
  59. ASSERT(close_cb_called == NUM_TIMERS);
  60. free(timers);
  61. LOGF("%.2f seconds total\n", (after_all - before_all) / 1e9);
  62. LOGF("%.2f seconds init\n", (before_run - before_all) / 1e9);
  63. LOGF("%.2f seconds dispatch\n", (after_run - before_run) / 1e9);
  64. LOGF("%.2f seconds cleanup\n", (after_all - after_run) / 1e9);
  65. MAKE_VALGRIND_HAPPY();
  66. return 0;
  67. }