Mercurial
comparison third_party/libuv/test/benchmark-million-timers.c @ 160:948de3f54cea
[ThirdParty] Added libuv
| author | June Park <parkjune1995@gmail.com> |
|---|---|
| date | Wed, 14 Jan 2026 19:39:52 -0800 |
| parents | |
| children |
comparison
equal
deleted
inserted
replaced
| 159:05cf9467a1c3 | 160:948de3f54cea |
|---|---|
| 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 | |
| 22 #include "task.h" | |
| 23 #include "uv.h" | |
| 24 | |
| 25 #define NUM_TIMERS (10 * 1000 * 1000) | |
| 26 | |
| 27 static int timer_cb_called; | |
| 28 static int close_cb_called; | |
| 29 | |
| 30 | |
| 31 static void timer_cb(uv_timer_t* handle) { | |
| 32 timer_cb_called++; | |
| 33 } | |
| 34 | |
| 35 | |
| 36 static void close_cb(uv_handle_t* handle) { | |
| 37 close_cb_called++; | |
| 38 } | |
| 39 | |
| 40 | |
| 41 BENCHMARK_IMPL(million_timers) { | |
| 42 uv_timer_t* timers; | |
| 43 uv_loop_t* loop; | |
| 44 uint64_t before_all; | |
| 45 uint64_t before_run; | |
| 46 uint64_t after_run; | |
| 47 uint64_t after_all; | |
| 48 int timeout; | |
| 49 int i; | |
| 50 | |
| 51 timers = malloc(NUM_TIMERS * sizeof(timers[0])); | |
| 52 ASSERT_NOT_NULL(timers); | |
| 53 | |
| 54 loop = uv_default_loop(); | |
| 55 timeout = 0; | |
| 56 | |
| 57 before_all = uv_hrtime(); | |
| 58 for (i = 0; i < NUM_TIMERS; i++) { | |
| 59 if (i % 1000 == 0) timeout++; | |
| 60 ASSERT_OK(uv_timer_init(loop, timers + i)); | |
| 61 ASSERT_OK(uv_timer_start(timers + i, timer_cb, timeout, 0)); | |
| 62 } | |
| 63 | |
| 64 before_run = uv_hrtime(); | |
| 65 ASSERT_OK(uv_run(loop, UV_RUN_DEFAULT)); | |
| 66 after_run = uv_hrtime(); | |
| 67 | |
| 68 for (i = 0; i < NUM_TIMERS; i++) | |
| 69 uv_close((uv_handle_t*) (timers + i), close_cb); | |
| 70 | |
| 71 ASSERT_OK(uv_run(loop, UV_RUN_DEFAULT)); | |
| 72 after_all = uv_hrtime(); | |
| 73 | |
| 74 ASSERT_EQ(timer_cb_called, NUM_TIMERS); | |
| 75 ASSERT_EQ(close_cb_called, NUM_TIMERS); | |
| 76 free(timers); | |
| 77 | |
| 78 fprintf(stderr, "%.2f seconds total\n", (after_all - before_all) / 1e9); | |
| 79 fprintf(stderr, "%.2f seconds init\n", (before_run - before_all) / 1e9); | |
| 80 fprintf(stderr, "%.2f seconds dispatch\n", (after_run - before_run) / 1e9); | |
| 81 fprintf(stderr, "%.2f seconds cleanup\n", (after_all - after_run) / 1e9); | |
| 82 fflush(stderr); | |
| 83 | |
| 84 MAKE_VALGRIND_HAPPY(loop); | |
| 85 return 0; | |
| 86 } |