cpghum.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848
  1. /*
  2. * Copyright (c) 2015-2017 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Christine Caulfield <ccaulfie@redhat.com>
  7. *
  8. * This software licensed under BSD license, the text of which follows:
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions are met:
  12. *
  13. * - Redistributions of source code must retain the above copyright notice,
  14. * this list of conditions and the following disclaimer.
  15. * - Redistributions in binary form must reproduce the above copyright notice,
  16. * this list of conditions and the following disclaimer in the documentation
  17. * and/or other materials provided with the distribution.
  18. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  19. * contributors may be used to endorse or promote products derived from this
  20. * software without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  23. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  26. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  27. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  28. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  29. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  30. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  31. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  32. * THE POSSIBILITY OF SUCH DAMAGE.
  33. */
  34. #include <stdio.h>
  35. #include <stdlib.h>
  36. #include <string.h>
  37. #include <signal.h>
  38. #include <unistd.h>
  39. #include <assert.h>
  40. #include <errno.h>
  41. #include <time.h>
  42. #include <limits.h>
  43. #include <ctype.h>
  44. #include <syslog.h>
  45. #include <stdarg.h>
  46. #include <inttypes.h>
  47. #include <sys/time.h>
  48. #include <sys/types.h>
  49. #include <sys/socket.h>
  50. #include <sys/select.h>
  51. #include <sys/uio.h>
  52. #include <sys/un.h>
  53. #include <netinet/in.h>
  54. #include <arpa/inet.h>
  55. #include <pthread.h>
  56. #include <zlib.h>
  57. #include <libgen.h>
  58. #include <getopt.h>
  59. #include <corosync/corotypes.h>
  60. #include <corosync/cpg.h>
  61. static cpg_handle_t handle;
  62. static pthread_t thread;
  63. #ifndef timersub
  64. #define timersub(a, b, result) \
  65. do { \
  66. (result)->tv_sec = (a)->tv_sec - (b)->tv_sec; \
  67. (result)->tv_usec = (a)->tv_usec - (b)->tv_usec; \
  68. if ((result)->tv_usec < 0) { \
  69. --(result)->tv_sec; \
  70. (result)->tv_usec += 1000000; \
  71. } \
  72. } while (0)
  73. #endif /* timersub */
  74. static int alarm_notice;
  75. #define MAX_NODEID 65536
  76. #define ONE_MEG 1048576
  77. #define DATASIZE (ONE_MEG*20)
  78. static char data[DATASIZE];
  79. static int send_counter = 0;
  80. static int do_syslog = 0;
  81. static int quiet = 0;
  82. static int report_rtt = 0;
  83. static int abort_on_error = 0;
  84. static int machine_readable = 0;
  85. static char delimiter = ',';
  86. static int to_stderr = 0;
  87. static unsigned int g_our_nodeid;
  88. static volatile int stopped;
  89. static unsigned int flood_start = 64;
  90. static unsigned int flood_multiplier = 5;
  91. static unsigned long flood_max = (ONE_MEG - 100);
  92. // stats
  93. static unsigned int length_errors=0;
  94. static unsigned int crc_errors=0;
  95. static unsigned int sequence_errors=0;
  96. static unsigned int packets_sent=0;
  97. static unsigned int packets_recvd=0;
  98. static unsigned int packets_recvd1=0; /* For flood intermediates */
  99. static unsigned int send_retries=0;
  100. static unsigned int send_fails=0;
  101. static unsigned long avg_rtt=0;
  102. static unsigned long max_rtt=0;
  103. static unsigned long min_rtt=LONG_MAX;
  104. static unsigned long interim_avg_rtt=0;
  105. static unsigned long interim_max_rtt=0;
  106. static unsigned long interim_min_rtt=LONG_MAX;
  107. struct cpghum_header {
  108. unsigned int counter;
  109. unsigned int crc;
  110. unsigned int size;
  111. struct timeval timestamp;
  112. };
  113. static void cpg_bm_confchg_fn (
  114. cpg_handle_t handle_in,
  115. const struct cpg_name *group_name,
  116. const struct cpg_address *member_list, size_t member_list_entries,
  117. const struct cpg_address *left_list, size_t left_list_entries,
  118. const struct cpg_address *joined_list, size_t joined_list_entries)
  119. {
  120. }
  121. static unsigned int g_recv_count;
  122. static unsigned int g_recv_length;
  123. static int g_recv_start[MAX_NODEID+1];
  124. static int g_recv_counter[MAX_NODEID+1];
  125. static int g_recv_size[MAX_NODEID+1];
  126. static int g_log_mask = 0xFFFF;
  127. typedef enum
  128. {
  129. CPGH_LOG_INFO = 1,
  130. CPGH_LOG_PERF = 2,
  131. CPGH_LOG_RTT = 4,
  132. CPGH_LOG_STATS = 8,
  133. CPGH_LOG_ERR = 16
  134. } log_type_t;
  135. static void cpgh_print_message(int syslog_level, const char *facility_name, const char *format, va_list ap)
  136. __attribute__((format(printf, 3, 0)));
  137. static void cpgh_log_printf(log_type_t type, const char *format, ...)
  138. __attribute__((format(printf, 2, 3)));
  139. static void cpgh_print_message(int syslog_level, const char *facility_name, const char *format, va_list ap)
  140. {
  141. char msg[1024];
  142. int start = 0;
  143. if (machine_readable) {
  144. snprintf(msg, sizeof(msg), "%s%c", facility_name, delimiter);
  145. start = strlen(msg);
  146. }
  147. assert(vsnprintf(msg+start, sizeof(msg)-start, format, ap) < sizeof(msg)-start);
  148. if (to_stderr || (syslog_level <= LOG_ERR)) {
  149. fprintf(stderr, "%s", msg);
  150. }
  151. else {
  152. printf("%s", msg);
  153. }
  154. if (do_syslog) {
  155. syslog(syslog_level, "%s", msg);
  156. }
  157. }
  158. static void cpgh_log_printf(log_type_t type, const char *format, ...)
  159. {
  160. va_list ap;
  161. if (!(type & g_log_mask)) {
  162. return;
  163. }
  164. va_start(ap, format);
  165. switch (type) {
  166. case CPGH_LOG_INFO:
  167. cpgh_print_message(LOG_INFO, "[Info]", format, ap);
  168. break;
  169. case CPGH_LOG_PERF:
  170. cpgh_print_message(LOG_INFO, "[Perf]", format, ap);
  171. break;
  172. case CPGH_LOG_RTT:
  173. cpgh_print_message(LOG_INFO, "[RTT]", format, ap);
  174. break;
  175. case CPGH_LOG_STATS:
  176. cpgh_print_message(LOG_INFO, "[Stats]", format, ap);
  177. break;
  178. case CPGH_LOG_ERR:
  179. cpgh_print_message(LOG_ERR, "[Err]", format, ap);
  180. break;
  181. default:
  182. break;
  183. }
  184. va_end(ap);
  185. }
  186. static unsigned long update_rtt(struct timeval *header_timestamp, int packet_count,
  187. unsigned long *rtt_min, unsigned long *rtt_avg, unsigned long *rtt_max)
  188. {
  189. struct timeval tv1;
  190. struct timeval rtt;
  191. unsigned long rtt_usecs;
  192. gettimeofday (&tv1, NULL);
  193. timersub(&tv1, header_timestamp, &rtt);
  194. rtt_usecs = rtt.tv_usec + rtt.tv_sec*1000000;
  195. if (rtt_usecs > *rtt_max) {
  196. *rtt_max = rtt_usecs;
  197. }
  198. if (rtt_usecs < *rtt_min) {
  199. *rtt_min = rtt_usecs;
  200. }
  201. /* Don't start the average with 0 */
  202. if (*rtt_avg == 0) {
  203. *rtt_avg = rtt_usecs;
  204. }
  205. else {
  206. *rtt_avg = ((*rtt_avg * packet_count) + rtt_usecs) / (packet_count+1);
  207. }
  208. return rtt_usecs;
  209. }
  210. static void cpg_bm_deliver_fn (
  211. cpg_handle_t handle_in,
  212. const struct cpg_name *group_name,
  213. uint32_t nodeid,
  214. uint32_t pid,
  215. void *msg,
  216. size_t msg_len)
  217. {
  218. uLong crc=0;
  219. struct cpghum_header *header = (struct cpghum_header *)msg;
  220. uLong recv_crc = header->crc & 0xFFFFFFFF;
  221. unsigned int *dataint = (unsigned int *)((char*)msg + sizeof(struct cpghum_header));
  222. unsigned int datalen;
  223. if (nodeid > MAX_NODEID) {
  224. cpgh_log_printf(CPGH_LOG_ERR, "Got message from invalid nodeid " CS_PRI_NODE_ID " (too high for us). Quitting\n", nodeid);
  225. exit(1);
  226. }
  227. packets_recvd++;
  228. packets_recvd1++;
  229. g_recv_length = msg_len;
  230. datalen = header->size - sizeof(struct cpghum_header);
  231. // Report RTT first in case abort_on_error is set
  232. if (nodeid == g_our_nodeid) {
  233. unsigned long rtt_usecs;
  234. // For flood
  235. update_rtt(&header->timestamp, packets_recvd1, &interim_min_rtt, &interim_avg_rtt, &interim_max_rtt);
  236. rtt_usecs = update_rtt(&header->timestamp, g_recv_counter[nodeid], &min_rtt, &avg_rtt, &max_rtt);
  237. if (report_rtt) {
  238. if (machine_readable) {
  239. cpgh_log_printf(CPGH_LOG_RTT, "%ld%c%ld%c%ld%c%ld\n", rtt_usecs, delimiter, min_rtt, delimiter, avg_rtt, delimiter, max_rtt);
  240. }
  241. else {
  242. cpgh_log_printf(CPGH_LOG_RTT, "%s: RTT %ld uS (min/avg/max): %ld/%ld/%ld\n", group_name->value, rtt_usecs, min_rtt, avg_rtt, max_rtt);
  243. }
  244. }
  245. }
  246. // Basic check, packets should all be the right size
  247. if (msg_len != header->size) {
  248. length_errors++;
  249. cpgh_log_printf(CPGH_LOG_ERR, "%s: message sizes don't match. got %zu, expected %u from node " CS_PRI_NODE_ID "\n", group_name->value, msg_len, header->size, nodeid);
  250. if (abort_on_error) {
  251. exit(2);
  252. }
  253. }
  254. g_recv_size[nodeid] = msg_len;
  255. // Sequence counters are incrementing in step?
  256. if (header->counter != g_recv_counter[nodeid]) {
  257. /* Don't report the first mismatch or a newly restarted sender, we're just catching up */
  258. if (g_recv_counter[nodeid] && header->counter) {
  259. sequence_errors++;
  260. cpgh_log_printf(CPGH_LOG_ERR, "%s: counters don't match. got %d, expected %d from node " CS_PRI_NODE_ID "\n", group_name->value, header->counter, g_recv_counter[nodeid], nodeid);
  261. if (abort_on_error) {
  262. exit(2);
  263. }
  264. }
  265. else {
  266. g_recv_start[nodeid] = header->counter;
  267. }
  268. /* Catch up or we'll be printing errors for ever */
  269. g_recv_counter[nodeid] = header->counter+1;
  270. }
  271. else {
  272. g_recv_counter[nodeid]++;
  273. }
  274. /* Check crc */
  275. crc = crc32(0, NULL, 0);
  276. crc = crc32(crc, (Bytef *)dataint, datalen) & 0xFFFFFFFF;
  277. if (crc != recv_crc) {
  278. crc_errors++;
  279. cpgh_log_printf(CPGH_LOG_ERR, "%s: CRCs don't match. got %lx, expected %lx from nodeid " CS_PRI_NODE_ID "\n", group_name->value, recv_crc, crc, nodeid);
  280. if (abort_on_error) {
  281. exit(2);
  282. }
  283. }
  284. g_recv_count++;
  285. }
  286. static cpg_model_v1_data_t model1_data = {
  287. .cpg_deliver_fn = cpg_bm_deliver_fn,
  288. .cpg_confchg_fn = cpg_bm_confchg_fn,
  289. };
  290. static cpg_callbacks_t callbacks = {
  291. .cpg_deliver_fn = cpg_bm_deliver_fn,
  292. .cpg_confchg_fn = cpg_bm_confchg_fn
  293. };
  294. static struct cpg_name group_name = {
  295. .value = "cpghum",
  296. .length = 7
  297. };
  298. static void set_packet(int write_size, int counter)
  299. {
  300. struct cpghum_header *header = (struct cpghum_header *)data;
  301. int i;
  302. unsigned int *dataint = (unsigned int *)(data + sizeof(struct cpghum_header));
  303. unsigned int datalen = write_size - sizeof(struct cpghum_header);
  304. struct timeval tv1;
  305. uLong crc;
  306. header->counter = counter;
  307. for (i=0; i<(datalen/4); i++) {
  308. dataint[i] = rand();
  309. }
  310. crc = crc32(0, NULL, 0);
  311. header->crc = crc32(crc, (Bytef*)&dataint[0], datalen);
  312. header->size = write_size;
  313. gettimeofday (&tv1, NULL);
  314. memcpy(&header->timestamp, &tv1, sizeof(struct timeval));
  315. }
  316. /* Basically this is cpgbench.c */
  317. static void cpg_flood (
  318. cpg_handle_t handle_in,
  319. int write_size)
  320. {
  321. struct timeval tv1, tv2, tv_elapsed;
  322. struct iovec iov;
  323. unsigned int res = CS_OK;
  324. alarm_notice = 0;
  325. iov.iov_base = data;
  326. iov.iov_len = write_size;
  327. alarm (10);
  328. packets_recvd1 = 0;
  329. interim_avg_rtt = 0;
  330. interim_max_rtt = 0;
  331. interim_min_rtt = LONG_MAX;
  332. gettimeofday (&tv1, NULL);
  333. do {
  334. if (res == CS_OK) {
  335. set_packet(write_size, send_counter);
  336. }
  337. res = cpg_mcast_joined (handle_in, CPG_TYPE_AGREED, &iov, 1);
  338. if (res == CS_OK) {
  339. /* Only increment the packet counter if it was sucessfully sent */
  340. packets_sent++;
  341. send_counter++;
  342. }
  343. else {
  344. if (res == CS_ERR_TRY_AGAIN) {
  345. send_retries++;
  346. }
  347. else {
  348. send_fails++;
  349. }
  350. }
  351. } while (!stopped && alarm_notice == 0 && (res == CS_OK || res == CS_ERR_TRY_AGAIN));
  352. gettimeofday (&tv2, NULL);
  353. timersub (&tv2, &tv1, &tv_elapsed);
  354. if (!quiet) {
  355. if (machine_readable) {
  356. cpgh_log_printf (CPGH_LOG_PERF, "%d%c%d%c%f%c%f%c%f%c%ld%c%ld%c%ld\n", packets_recvd1, delimiter, write_size, delimiter,
  357. (tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)), delimiter,
  358. ((float)packets_recvd1) / (tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)), delimiter,
  359. ((float)packets_recvd1) * ((float)write_size) / ((tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)) * 1000000.0), delimiter,
  360. interim_min_rtt, delimiter, interim_avg_rtt, delimiter, interim_max_rtt);
  361. }
  362. else {
  363. cpgh_log_printf (CPGH_LOG_PERF, "%5d messages received ", packets_recvd1);
  364. cpgh_log_printf (CPGH_LOG_PERF, "%5d bytes per write ", write_size);
  365. cpgh_log_printf (CPGH_LOG_PERF, "%7.3f Seconds runtime ",
  366. (tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)));
  367. cpgh_log_printf (CPGH_LOG_PERF, "%9.3f TP/s ",
  368. ((float)packets_recvd1) / (tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)));
  369. cpgh_log_printf (CPGH_LOG_PERF, "%7.3f MB/s ",
  370. ((float)packets_recvd1) * ((float)write_size) / ((tv_elapsed.tv_sec + (tv_elapsed.tv_usec / 1000000.0)) * 1000000.0));
  371. cpgh_log_printf (CPGH_LOG_PERF, "RTT for this size (min/avg/max) %ld/%ld/%ld\n",
  372. interim_min_rtt, interim_avg_rtt, interim_max_rtt);
  373. }
  374. }
  375. }
  376. static void cpg_test (
  377. cpg_handle_t handle_in,
  378. int write_size,
  379. int delay_time,
  380. int print_time)
  381. {
  382. struct iovec iov;
  383. unsigned int res;
  384. alarm_notice = 0;
  385. iov.iov_base = data;
  386. iov.iov_len = write_size;
  387. g_recv_count = 0;
  388. alarm (print_time);
  389. do {
  390. send_counter++;
  391. resend:
  392. set_packet(write_size, send_counter);
  393. res = cpg_mcast_joined (handle_in, CPG_TYPE_AGREED, &iov, 1);
  394. if (res == CS_ERR_TRY_AGAIN) {
  395. usleep(10000);
  396. send_retries++;
  397. goto resend;
  398. }
  399. if (res != CS_OK) {
  400. cpgh_log_printf(CPGH_LOG_ERR, "send failed: %d\n", res);
  401. send_fails++;
  402. }
  403. else {
  404. packets_sent++;
  405. }
  406. usleep(delay_time*1000);
  407. } while (alarm_notice == 0 && (res == CS_OK || res == CS_ERR_TRY_AGAIN) && stopped == 0);
  408. if (!quiet) {
  409. if (machine_readable) {
  410. cpgh_log_printf(CPGH_LOG_RTT, "%d%c%ld%c%ld%c%ld\n", 0, delimiter, min_rtt, delimiter, avg_rtt, delimiter, max_rtt);
  411. }
  412. else {
  413. cpgh_log_printf(CPGH_LOG_PERF, "%s: %5d message%s received, ", group_name.value, g_recv_count, g_recv_count==1?"":"s");
  414. cpgh_log_printf(CPGH_LOG_PERF, "%5d bytes per write. ", write_size);
  415. cpgh_log_printf(CPGH_LOG_RTT, "RTT min/avg/max: %ld/%ld/%ld\n", min_rtt, avg_rtt, max_rtt);
  416. }
  417. }
  418. }
  419. static void sigalrm_handler (int num)
  420. {
  421. alarm_notice = 1;
  422. }
  423. static void sigint_handler (int num)
  424. {
  425. stopped = 1;
  426. }
  427. static void* dispatch_thread (void *arg)
  428. {
  429. cpg_dispatch (handle, CS_DISPATCH_BLOCKING);
  430. return NULL;
  431. }
  432. static void usage(char *cmd)
  433. {
  434. fprintf(stderr, "%s [OPTIONS]\n", cmd);
  435. fprintf(stderr, "\n");
  436. fprintf(stderr, "%s sends CPG messages to all registered users of the CPG.\n", cmd);
  437. fprintf(stderr, "The messages have a sequence number and a CRC so that missing or\n");
  438. fprintf(stderr, "corrupted messages will be detected and reported.\n");
  439. fprintf(stderr, "\n");
  440. fprintf(stderr, "%s can also be asked to simply listen for (and check) packets\n", cmd);
  441. fprintf(stderr, "so that there is another node in the cluster connected to the CPG.\n");
  442. fprintf(stderr, "\n");
  443. fprintf(stderr, "Multiple copies, in different CPGs, can also be run on the same or\n");
  444. fprintf(stderr, "different nodes by using the -n option.\n");
  445. fprintf(stderr, "\n");
  446. fprintf(stderr, "%s can handle more than 1 sender in the same CPG provided they are on\n", cmd);
  447. fprintf(stderr, "different nodes.\n");
  448. fprintf(stderr, "\n");
  449. fprintf(stderr, " -w<num>, --size-bytes Write size in Kbytes, default 4\n");
  450. fprintf(stderr, " -W<num>, --size-kb Write size in bytes, default 4096\n");
  451. fprintf(stderr, " -n<name>, --name CPG name to use, default 'cpghum'\n");
  452. fprintf(stderr, " -M Write machine-readable results\n");
  453. fprintf(stderr, " -D<char> Delimiter for machine-readable results (default ',')\n");
  454. fprintf(stderr, " -E Send normal output to stderr instead of stdout\n");
  455. fprintf(stderr, " -d<num>, --delay Delay between sending packets (mS), default 1000\n");
  456. fprintf(stderr, " -r<num> Number of repetitions, default 100\n");
  457. fprintf(stderr, " -p<num> Delay between printing output (seconds), default 10s\n");
  458. fprintf(stderr, " -l, --listen Listen and check CRCs only, don't send (^C to quit)\n");
  459. fprintf(stderr, " -t, --rtt Report Round Trip Times for each packet.\n");
  460. fprintf(stderr, " -m<num> cpg_initialise() model. Default 1.\n");
  461. fprintf(stderr, " -s Also send errors to syslog.\n");
  462. fprintf(stderr, " -f, --flood Flood test CPG (cpgbench). see --flood-* long options\n");
  463. fprintf(stderr, " -a Abort on crc/length/sequence error\n");
  464. fprintf(stderr, " -q, --quiet Quiet. Don't print messages every 10s (see also -p)\n");
  465. fprintf(stderr, " -qq Very quiet. Don't print stats at the end\n");
  466. fprintf(stderr, " --flood-start=bytes Start value for --flood\n");
  467. fprintf(stderr, " --flood-mult=value Packet size multiplier value for --flood\n");
  468. fprintf(stderr, " --flood-max=bytes Maximum packet size for --flood\n");
  469. fprintf(stderr, "\n");
  470. fprintf(stderr, " values for --flood* and -W can have K or M suffixes to indicate\n");
  471. fprintf(stderr, " Kilobytes or Megabytes\n");
  472. fprintf(stderr, "\n");
  473. fprintf(stderr, "%s exit code is 0 if no error happened, 1 on generic error and 2 on\n", cmd);
  474. fprintf(stderr, "send/crc/length/sequence error");
  475. fprintf(stderr, "\n");
  476. }
  477. /* Parse a size, optionally ending in 'K', 'M' */
  478. static long parse_bytes(const char *valstring)
  479. {
  480. unsigned int value;
  481. int multiplier = 1;
  482. char suffix = '\0';
  483. int have_suffix = 0;
  484. /* Suffix is optional */
  485. if (sscanf(valstring, "%u%c", &value, &suffix) == 0) {
  486. return 0;
  487. }
  488. if (toupper(suffix) == 'M') {
  489. multiplier = 1024*1024;
  490. have_suffix = 1;
  491. }
  492. if (toupper(suffix) == 'K') {
  493. multiplier = 1024;
  494. have_suffix = 1;
  495. }
  496. if (!have_suffix && suffix != '\0') {
  497. fprintf(stderr, "Invalid suffix '%c', only K or M supported\n", suffix);
  498. return 0;
  499. }
  500. return value * multiplier;
  501. }
  502. int main (int argc, char *argv[]) {
  503. int i;
  504. unsigned int res;
  505. uint32_t maxsize;
  506. int opt;
  507. int bs;
  508. int write_size = 4096;
  509. int delay_time = 1000;
  510. int repetitions = 100;
  511. int print_time = 10;
  512. int have_size = 0;
  513. int listen_only = 0;
  514. int flood = 0;
  515. int model = 1;
  516. int option_index = 0;
  517. struct option long_options[] = {
  518. {"flood-start", required_argument, 0, 0 },
  519. {"flood-mult", required_argument, 0, 0 },
  520. {"flood-max", required_argument, 0, 0 },
  521. {"size-kb", required_argument, 0, 'w' },
  522. {"size-bytes", required_argument, 0, 'W' },
  523. {"name", required_argument, 0, 'n' },
  524. {"rtt", no_argument, 0, 't' },
  525. {"flood", no_argument, 0, 'f' },
  526. {"quiet", no_argument, 0, 'q' },
  527. {"listen", no_argument, 0, 'l' },
  528. {"help", no_argument, 0, '?' },
  529. {0, 0, 0, 0 }
  530. };
  531. while ( (opt = getopt_long(argc, argv, "qlstafMEn:d:r:p:m:w:W:D:",
  532. long_options, &option_index)) != -1 ) {
  533. switch (opt) {
  534. case 0: // Long-only options
  535. if (strcmp(long_options[option_index].name, "flood-start") == 0) {
  536. flood_start = parse_bytes(optarg);
  537. if (flood_start == 0) {
  538. fprintf(stderr, "flood-start value invalid\n");
  539. exit(1);
  540. }
  541. }
  542. if (strcmp(long_options[option_index].name, "flood-mult") == 0) {
  543. flood_multiplier = parse_bytes(optarg);
  544. if (flood_multiplier == 0) {
  545. fprintf(stderr, "flood-mult value invalid\n");
  546. exit(1);
  547. }
  548. }
  549. if (strcmp(long_options[option_index].name, "flood-max") == 0) {
  550. flood_max = parse_bytes(optarg);
  551. if (flood_max == 0) {
  552. fprintf(stderr, "flood-max value invalid\n");
  553. exit(1);
  554. }
  555. }
  556. break;
  557. case 'w': // Write size in K
  558. bs = atoi(optarg);
  559. if (bs > 0) {
  560. write_size = bs*1024;
  561. have_size = 1;
  562. }
  563. break;
  564. case 'W': // Write size in bytes (or with a suffix)
  565. bs = parse_bytes(optarg);
  566. if (bs > 0) {
  567. write_size = bs;
  568. have_size = 1;
  569. }
  570. break;
  571. case 'n':
  572. if (strlen(optarg) >= CPG_MAX_NAME_LENGTH) {
  573. fprintf(stderr, "CPG name too long\n");
  574. exit(1);
  575. }
  576. strcpy(group_name.value, optarg);
  577. group_name.length = strlen(group_name.value);
  578. break;
  579. case 't':
  580. report_rtt = 1;
  581. break;
  582. case 'E':
  583. to_stderr = 1;
  584. break;
  585. case 'M':
  586. machine_readable = 1;
  587. break;
  588. case 'f':
  589. flood = 1;
  590. break;
  591. case 'a':
  592. abort_on_error = 1;
  593. break;
  594. case 'd':
  595. delay_time = atoi(optarg);
  596. break;
  597. case 'D':
  598. delimiter = optarg[0];
  599. break;
  600. case 'r':
  601. repetitions = atoi(optarg);
  602. break;
  603. case 'p':
  604. print_time = atoi(optarg);
  605. break;
  606. case 'l':
  607. listen_only = 1;
  608. break;
  609. case 's':
  610. do_syslog = 1;
  611. break;
  612. case 'q':
  613. quiet++;
  614. break;
  615. case 'm':
  616. model = atoi(optarg);
  617. if (model < 0 || model > 1) {
  618. fprintf(stderr, "%s: Model must be 0-1\n", argv[0]);
  619. exit(1);
  620. }
  621. break;
  622. case '?':
  623. usage(basename(argv[0]));
  624. exit(1);
  625. }
  626. }
  627. if (!have_size && flood) {
  628. write_size = flood_start;
  629. }
  630. signal (SIGALRM, sigalrm_handler);
  631. signal (SIGINT, sigint_handler);
  632. switch (model) {
  633. case 0:
  634. res = cpg_initialize (&handle, &callbacks);
  635. break;
  636. case 1:
  637. res = cpg_model_initialize (&handle, CPG_MODEL_V1, (cpg_model_data_t *)&model1_data, NULL);
  638. break;
  639. default:
  640. res=999; // can't get here but it keeps the compiler happy
  641. break;
  642. }
  643. if (res != CS_OK) {
  644. cpgh_log_printf(CPGH_LOG_ERR, "cpg_initialize failed with result %d\n", res);
  645. exit (1);
  646. }
  647. res = cpg_local_get(handle, &g_our_nodeid);
  648. if (res != CS_OK) {
  649. cpgh_log_printf(CPGH_LOG_ERR, "cpg_local_get failed with result %d\n", res);
  650. exit (1);
  651. }
  652. pthread_create (&thread, NULL, dispatch_thread, NULL);
  653. res = cpg_join (handle, &group_name);
  654. if (res != CS_OK) {
  655. cpgh_log_printf(CPGH_LOG_ERR, "cpg_join failed with result %d\n", res);
  656. exit (1);
  657. }
  658. if (listen_only) {
  659. int secs = 0;
  660. while (!stopped) {
  661. sleep(1);
  662. if (++secs > print_time && !quiet) {
  663. int nodes_printed = 0;
  664. if (!machine_readable) {
  665. for (i=1; i<MAX_NODEID; i++) {
  666. if (g_recv_counter[i]) {
  667. cpgh_log_printf(CPGH_LOG_INFO, "%s: %5d message%s of %d bytes received from node " CS_PRI_NODE_ID "\n",
  668. group_name.value, g_recv_counter[i] - g_recv_start[i],
  669. g_recv_counter[i]==1?"":"s",
  670. g_recv_size[i], i);
  671. nodes_printed++;
  672. }
  673. }
  674. }
  675. /* Separate list of nodes if more than one */
  676. if (nodes_printed > 1) {
  677. cpgh_log_printf(CPGH_LOG_INFO, "\n");
  678. }
  679. secs = 0;
  680. }
  681. }
  682. }
  683. else {
  684. cpg_max_atomic_msgsize_get (handle, &maxsize);
  685. if (write_size > maxsize) {
  686. fprintf(stderr, "INFO: packet size (%d) is larger than the maximum atomic size (%d), libcpg will fragment\n",
  687. write_size, maxsize);
  688. }
  689. /* The main job starts here */
  690. if (flood) {
  691. for (i = 0; i < 10; i++) { /* number of repetitions - up to 50k */
  692. cpg_flood (handle, write_size);
  693. signal (SIGALRM, sigalrm_handler);
  694. write_size *= flood_multiplier;
  695. if (write_size > flood_max) {
  696. break;
  697. }
  698. }
  699. }
  700. else {
  701. send_counter = -1; /* So we start from zero to allow listeners to sync */
  702. for (i = 0; i < repetitions && !stopped; i++) {
  703. cpg_test (handle, write_size, delay_time, print_time);
  704. signal (SIGALRM, sigalrm_handler);
  705. }
  706. }
  707. }
  708. res = cpg_finalize (handle);
  709. if (res != CS_OK) {
  710. cpgh_log_printf(CPGH_LOG_ERR, "cpg_finalize failed with result %d\n", res);
  711. exit (1);
  712. }
  713. if (quiet < 2) {
  714. /* Don't print LONG_MAX for min_rtt if we don't have a value */
  715. if (min_rtt == LONG_MAX) {
  716. min_rtt = 0L;
  717. }
  718. if (machine_readable) {
  719. cpgh_log_printf(CPGH_LOG_STATS, "%d%c%d%c%d%c%d%c%d%c%d%c%d%c%ld%c%ld%c%ld\n",
  720. packets_sent, delimiter,
  721. send_fails, delimiter,
  722. send_retries, delimiter,
  723. length_errors, delimiter,
  724. packets_recvd, delimiter,
  725. sequence_errors, delimiter,
  726. crc_errors, delimiter,
  727. min_rtt, delimiter,
  728. avg_rtt, delimiter,
  729. max_rtt);
  730. }
  731. else {
  732. cpgh_log_printf(CPGH_LOG_STATS, "\n");
  733. cpgh_log_printf(CPGH_LOG_STATS, "Stats:\n");
  734. if (!listen_only) {
  735. cpgh_log_printf(CPGH_LOG_STATS, " packets sent: %d\n", packets_sent);
  736. cpgh_log_printf(CPGH_LOG_STATS, " send failures: %d\n", send_fails);
  737. cpgh_log_printf(CPGH_LOG_STATS, " send retries: %d\n", send_retries);
  738. }
  739. cpgh_log_printf(CPGH_LOG_STATS, " length errors: %d\n", length_errors);
  740. cpgh_log_printf(CPGH_LOG_STATS, " packets recvd: %d\n", packets_recvd);
  741. cpgh_log_printf(CPGH_LOG_STATS, " sequence errors: %d\n", sequence_errors);
  742. cpgh_log_printf(CPGH_LOG_STATS, " crc errors: %d\n", crc_errors);
  743. if (!listen_only) {
  744. cpgh_log_printf(CPGH_LOG_STATS, " min RTT: %ld\n", min_rtt);
  745. cpgh_log_printf(CPGH_LOG_STATS, " max RTT: %ld\n", max_rtt);
  746. cpgh_log_printf(CPGH_LOG_STATS, " avg RTT: %ld\n", avg_rtt);
  747. }
  748. cpgh_log_printf(CPGH_LOG_STATS, "\n");
  749. }
  750. }
  751. res = 0;
  752. if (send_fails > 0 || (have_size && length_errors > 0) || sequence_errors > 0 || crc_errors > 0) {
  753. res = 2;
  754. }
  755. return (res);
  756. }