Christian Franke | ba32db1 | 2013-11-19 14:11:40 +0000 | [diff] [blame] | 1 | /* |
| 2 | * Test program which measures the time it takes to schedule and |
| 3 | * remove timers. |
| 4 | * |
| 5 | * Copyright (C) 2013 by Open Source Routing. |
| 6 | * Copyright (C) 2013 by Internet Systems Consortium, Inc. ("ISC") |
| 7 | * |
| 8 | * This file is part of Quagga |
| 9 | * |
| 10 | * Quagga is free software; you can redistribute it and/or modify it |
| 11 | * under the terms of the GNU General Public License as published by the |
| 12 | * Free Software Foundation; either version 2, or (at your option) any |
| 13 | * later version. |
| 14 | * |
| 15 | * Quagga is distributed in the hope that it will be useful, but |
| 16 | * WITHOUT ANY WARRANTY; without even the implied warranty of |
| 17 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 18 | * General Public License for more details. |
| 19 | * |
| 20 | * You should have received a copy of the GNU General Public License |
| 21 | * along with Quagga; see the file COPYING. If not, write to the Free |
| 22 | * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA |
| 23 | * 02111-1307, USA. |
| 24 | */ |
Christian Franke | ba32db1 | 2013-11-19 14:11:40 +0000 | [diff] [blame] | 25 | |
| 26 | #include <zebra.h> |
| 27 | |
David Lamparter | 821df2c | 2015-09-15 01:53:09 -0700 | [diff] [blame] | 28 | #include <stdio.h> |
| 29 | #include <unistd.h> |
| 30 | |
Christian Franke | ba32db1 | 2013-11-19 14:11:40 +0000 | [diff] [blame] | 31 | #include "thread.h" |
| 32 | #include "pqueue.h" |
| 33 | #include "prng.h" |
| 34 | |
| 35 | #define SCHEDULE_TIMERS 1000000 |
| 36 | #define REMOVE_TIMERS 500000 |
| 37 | |
| 38 | struct thread_master *master; |
| 39 | |
| 40 | static int dummy_func(struct thread *thread) |
| 41 | { |
| 42 | return 0; |
| 43 | } |
| 44 | |
| 45 | int main(int argc, char **argv) |
| 46 | { |
| 47 | struct prng *prng; |
| 48 | int i; |
| 49 | struct thread **timers; |
| 50 | struct timeval tv_start, tv_lap, tv_stop; |
| 51 | unsigned long t_schedule, t_remove; |
| 52 | |
| 53 | master = thread_master_create(); |
| 54 | prng = prng_new(0); |
| 55 | timers = calloc(SCHEDULE_TIMERS, sizeof(*timers)); |
| 56 | |
| 57 | /* create thread structures so they won't be allocated during the |
| 58 | * time measurement */ |
| 59 | for (i = 0; i < SCHEDULE_TIMERS; i++) |
| 60 | timers[i] = thread_add_timer_msec(master, dummy_func, NULL, 0); |
| 61 | for (i = 0; i < SCHEDULE_TIMERS; i++) |
| 62 | thread_cancel(timers[i]); |
| 63 | |
| 64 | quagga_gettime(QUAGGA_CLK_MONOTONIC, &tv_start); |
| 65 | |
| 66 | for (i = 0; i < SCHEDULE_TIMERS; i++) |
| 67 | { |
| 68 | long interval_msec; |
| 69 | |
| 70 | interval_msec = prng_rand(prng) % (100 * SCHEDULE_TIMERS); |
| 71 | timers[i] = thread_add_timer_msec(master, dummy_func, |
| 72 | NULL, interval_msec); |
| 73 | } |
| 74 | |
| 75 | quagga_gettime(QUAGGA_CLK_MONOTONIC, &tv_lap); |
| 76 | |
| 77 | for (i = 0; i < REMOVE_TIMERS; i++) |
| 78 | { |
| 79 | int index; |
| 80 | |
| 81 | index = prng_rand(prng) % SCHEDULE_TIMERS; |
| 82 | if (timers[index]) |
| 83 | thread_cancel(timers[index]); |
| 84 | timers[index] = NULL; |
| 85 | } |
| 86 | |
| 87 | quagga_gettime(QUAGGA_CLK_MONOTONIC, &tv_stop); |
| 88 | |
| 89 | t_schedule = 1000 * (tv_lap.tv_sec - tv_start.tv_sec); |
| 90 | t_schedule += (tv_lap.tv_usec - tv_start.tv_usec) / 1000; |
| 91 | |
| 92 | t_remove = 1000 * (tv_stop.tv_sec - tv_lap.tv_sec); |
| 93 | t_remove += (tv_stop.tv_usec - tv_lap.tv_usec) / 1000; |
| 94 | |
| 95 | printf("Scheduling %d random timers took %ld.%03ld seconds.\n", |
| 96 | SCHEDULE_TIMERS, t_schedule/1000, t_schedule%1000); |
| 97 | printf("Removing %d random timers took %ld.%03ld seconds.\n", |
| 98 | REMOVE_TIMERS, t_remove/1000, t_remove%1000); |
| 99 | fflush(stdout); |
| 100 | |
| 101 | free(timers); |
| 102 | thread_master_free(master); |
| 103 | prng_free(prng); |
| 104 | return 0; |
| 105 | } |