cpghum.c 24 KB

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