| 1 | /*
|
|---|
| 2 | Unix SMB/CIFS implementation.
|
|---|
| 3 | Copyright (C) Andrew Tridgell 2000
|
|---|
| 4 |
|
|---|
| 5 | This program is free software; you can redistribute it and/or modify
|
|---|
| 6 | it under the terms of the GNU General Public License as published by
|
|---|
| 7 | the Free Software Foundation; either version 2 of the License, or
|
|---|
| 8 | (at your option) any later version.
|
|---|
| 9 |
|
|---|
| 10 | This program is distributed in the hope that it will be useful,
|
|---|
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|---|
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|---|
| 13 | GNU General Public License for more details.
|
|---|
| 14 |
|
|---|
| 15 | You should have received a copy of the GNU General Public License
|
|---|
| 16 | along with this program; if not, write to the Free Software
|
|---|
| 17 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|---|
| 18 | */
|
|---|
| 19 |
|
|---|
| 20 | /*
|
|---|
| 21 | test code for internal messaging
|
|---|
| 22 | */
|
|---|
| 23 |
|
|---|
| 24 | #include "includes.h"
|
|---|
| 25 |
|
|---|
| 26 | static int pong_count;
|
|---|
| 27 |
|
|---|
| 28 |
|
|---|
| 29 | /****************************************************************************
|
|---|
| 30 | a useful function for testing the message system
|
|---|
| 31 | ****************************************************************************/
|
|---|
| 32 | static void pong_message(int msg_type, struct process_id src,
|
|---|
| 33 | void *buf, size_t len, void *private_data)
|
|---|
| 34 | {
|
|---|
| 35 | pong_count++;
|
|---|
| 36 | }
|
|---|
| 37 |
|
|---|
| 38 | int main(int argc, char *argv[])
|
|---|
| 39 | {
|
|---|
| 40 | pid_t pid;
|
|---|
| 41 | int i, n;
|
|---|
| 42 | char buf[12];
|
|---|
| 43 |
|
|---|
| 44 | load_case_tables();
|
|---|
| 45 |
|
|---|
| 46 | setup_logging(argv[0],True);
|
|---|
| 47 |
|
|---|
| 48 | lp_load(dyn_CONFIGFILE,False,False,False,True);
|
|---|
| 49 |
|
|---|
| 50 | message_init();
|
|---|
| 51 |
|
|---|
| 52 | if (argc != 3) {
|
|---|
| 53 | fprintf(stderr, "%s: Usage - %s pid count\n", argv[0],
|
|---|
| 54 | argv[0]);
|
|---|
| 55 | exit(1);
|
|---|
| 56 | }
|
|---|
| 57 |
|
|---|
| 58 | pid = atoi(argv[1]);
|
|---|
| 59 | n = atoi(argv[2]);
|
|---|
| 60 |
|
|---|
| 61 | message_register(MSG_PONG, pong_message, NULL);
|
|---|
| 62 |
|
|---|
| 63 | for (i=0;i<n;i++) {
|
|---|
| 64 | message_send_pid(pid_to_procid(pid), MSG_PING, NULL, 0, True);
|
|---|
| 65 | }
|
|---|
| 66 |
|
|---|
| 67 | while (pong_count < i) {
|
|---|
| 68 | message_dispatch();
|
|---|
| 69 | smb_msleep(1);
|
|---|
| 70 | }
|
|---|
| 71 |
|
|---|
| 72 | /* Now test that the duplicate filtering code works. */
|
|---|
| 73 | pong_count = 0;
|
|---|
| 74 |
|
|---|
| 75 | safe_strcpy(buf, "1234567890", sizeof(buf)-1);
|
|---|
| 76 |
|
|---|
| 77 | for (i=0;i<n;i++) {
|
|---|
| 78 | message_send_pid(pid_to_procid(getpid()), MSG_PING,
|
|---|
| 79 | NULL, 0, False);
|
|---|
| 80 | message_send_pid(pid_to_procid(getpid()), MSG_PING,
|
|---|
| 81 | buf, 11, False);
|
|---|
| 82 | }
|
|---|
| 83 |
|
|---|
| 84 | for (i=0;i<n;i++) {
|
|---|
| 85 | message_dispatch();
|
|---|
| 86 | smb_msleep(1);
|
|---|
| 87 | }
|
|---|
| 88 |
|
|---|
| 89 | if (pong_count != 2) {
|
|---|
| 90 | fprintf(stderr, "Duplicate filter failed (%d).\n", pong_count);
|
|---|
| 91 | }
|
|---|
| 92 |
|
|---|
| 93 | /* Speed testing */
|
|---|
| 94 |
|
|---|
| 95 | pong_count = 0;
|
|---|
| 96 |
|
|---|
| 97 | {
|
|---|
| 98 | struct timeval tv = timeval_current();
|
|---|
| 99 | size_t timelimit = n;
|
|---|
| 100 | size_t ping_count = 0;
|
|---|
| 101 |
|
|---|
| 102 | printf("Sending pings for %d seconds\n", (int)timelimit);
|
|---|
| 103 | while (timeval_elapsed(&tv) < timelimit) {
|
|---|
| 104 | if(NT_STATUS_IS_OK(message_send_pid(pid_to_procid(pid),
|
|---|
| 105 | MSG_PING,
|
|---|
| 106 | buf, 11, False)))
|
|---|
| 107 | ping_count++;
|
|---|
| 108 | if(NT_STATUS_IS_OK(message_send_pid(pid_to_procid(pid),
|
|---|
| 109 | MSG_PING,
|
|---|
| 110 | NULL, 0, False)))
|
|---|
| 111 | ping_count++;
|
|---|
| 112 |
|
|---|
| 113 | while (ping_count > pong_count + 20) {
|
|---|
| 114 | message_dispatch();
|
|---|
| 115 | }
|
|---|
| 116 | }
|
|---|
| 117 |
|
|---|
| 118 | printf("waiting for %d remaining replies (done %d)\n",
|
|---|
| 119 | (int)(ping_count - pong_count), pong_count);
|
|---|
| 120 | while (timeval_elapsed(&tv) < 30 && pong_count < ping_count) {
|
|---|
| 121 | message_dispatch();
|
|---|
| 122 | }
|
|---|
| 123 |
|
|---|
| 124 | if (ping_count != pong_count) {
|
|---|
| 125 | fprintf(stderr, "ping test failed! received %d, sent "
|
|---|
| 126 | "%d\n", pong_count, (int)ping_count);
|
|---|
| 127 | }
|
|---|
| 128 |
|
|---|
| 129 | printf("ping rate of %.0f messages/sec\n",
|
|---|
| 130 | (ping_count+pong_count)/timeval_elapsed(&tv));
|
|---|
| 131 | }
|
|---|
| 132 |
|
|---|
| 133 | return (0);
|
|---|
| 134 | }
|
|---|
| 135 |
|
|---|