testcpg.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  1. /*
  2. * Copyright (c) 2006-2009 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 <config.h>
  35. #include <inttypes.h>
  36. #include <stdio.h>
  37. #include <stdlib.h>
  38. #include <errno.h>
  39. #include <unistd.h>
  40. #include <string.h>
  41. #include <sys/types.h>
  42. #include <sys/socket.h>
  43. #include <sys/select.h>
  44. #include <sys/un.h>
  45. #include <netinet/in.h>
  46. #include <arpa/inet.h>
  47. #include <time.h>
  48. #include <sys/time.h>
  49. #include <assert.h>
  50. #include <limits.h>
  51. #include <corosync/corotypes.h>
  52. #include <corosync/cpg.h>
  53. #include <corosync/swab.h>
  54. #ifdef QBLOG
  55. #include <qb/qblog.h>
  56. #endif
  57. static int quit = 0;
  58. static int show_ip = 0;
  59. static int restart = 0;
  60. static uint32_t nodeidStart = 0;
  61. static void print_localnodeid(cpg_handle_t handle);
  62. static void print_cpgname (const struct cpg_name *name)
  63. {
  64. unsigned int i;
  65. for (i = 0; i < name->length; i++) {
  66. printf ("%c", name->value[i]);
  67. }
  68. }
  69. static char * node_pid_format(unsigned int nodeid, unsigned int pid) {
  70. static char buffer[100];
  71. if (show_ip) {
  72. struct in_addr saddr;
  73. #if __BYTE_ORDER == __BIG_ENDIAN
  74. saddr.s_addr = swab32(nodeid);
  75. #else
  76. saddr.s_addr = nodeid;
  77. #endif
  78. sprintf(buffer, "node/pid %s/%d", inet_ntoa(saddr),pid);
  79. }
  80. else {
  81. sprintf(buffer, "node/pid %d/%d", nodeid, pid);
  82. }
  83. return buffer;
  84. }
  85. static void
  86. print_time(void)
  87. {
  88. #define MAXLEN (256)
  89. char buf[MAXLEN];
  90. char hostname[HOST_NAME_MAX];
  91. struct timeval tnow;
  92. time_t t;
  93. size_t len;
  94. char *s = buf;
  95. len = sizeof(hostname);
  96. if(gethostname(hostname, len) == 0) {
  97. hostname[len-1] = '\0';
  98. char *longName = hostname;
  99. if( (longName = strstr( hostname, "." )) != NULL )
  100. *longName = '\0';
  101. }
  102. strcpy(s, hostname);
  103. s += strlen(hostname);
  104. s += snprintf(s, sizeof(buf)-(s-buf), ":%d", getpid());
  105. t = time(0);
  106. gettimeofday( &tnow, 0 );
  107. s += strftime(s, sizeof(buf)-(s-buf) , " %Y-%m-%d %T", localtime(&t));
  108. s += snprintf(s, sizeof(buf)-(s-buf), ".%03ld", tnow.tv_usec/1000);
  109. assert(s-buf < (int)sizeof(buf));
  110. printf("%s\n", buf);
  111. }
  112. static void DeliverCallback (
  113. cpg_handle_t handle,
  114. const struct cpg_name *groupName,
  115. uint32_t nodeid,
  116. uint32_t pid,
  117. void *msg,
  118. size_t msg_len)
  119. {
  120. print_time();
  121. printf("DeliverCallback: message (len=%lu)from %s: '%s'\n",
  122. (unsigned long int) msg_len, node_pid_format(nodeid, pid),
  123. (const char *)msg);
  124. }
  125. static void ConfchgCallback (
  126. cpg_handle_t handle,
  127. const struct cpg_name *groupName,
  128. const struct cpg_address *member_list, size_t member_list_entries,
  129. const struct cpg_address *left_list, size_t left_list_entries,
  130. const struct cpg_address *joined_list, size_t joined_list_entries)
  131. {
  132. unsigned int i;
  133. int result;
  134. uint32_t nodeid;
  135. print_time();
  136. printf("ConfchgCallback: group '");
  137. print_cpgname(groupName);
  138. printf("'\n");
  139. print_localnodeid(handle);
  140. for (i=0; i<joined_list_entries; i++) {
  141. printf("joined %s reason: %d\n",
  142. node_pid_format(joined_list[i].nodeid, joined_list[i].pid),
  143. joined_list[i].reason);
  144. }
  145. for (i=0; i<left_list_entries; i++) {
  146. printf("left %s reason: %d\n",
  147. node_pid_format(left_list[i].nodeid, left_list[i].pid),
  148. left_list[i].reason);
  149. }
  150. printf("nodes in group now %lu\n",
  151. (unsigned long int) member_list_entries);
  152. for (i=0; i<member_list_entries; i++) {
  153. printf("%s\n",
  154. node_pid_format(member_list[i].nodeid, member_list[i].pid));
  155. }
  156. result = cpg_local_get(handle, &nodeid);
  157. if(result != CS_OK) {
  158. printf("failed to get local nodeid %d\n", result);
  159. nodeid = 0;
  160. }
  161. /* Is it us??
  162. NOTE: in reality we should also check the nodeid */
  163. if (left_list_entries && (pid_t)left_list[0].pid == getpid()) {
  164. printf("We might have left the building pid %d\n", left_list[0].pid);
  165. /* can only use nodeidStart as a reliable check (version <= 1.4.2) */
  166. if(nodeidStart) {
  167. /* report dynamic nature of nodeid returned from local_get */
  168. /* local get of nodeid might change identity from original! */
  169. if(htonl((uint32_t)nodeid) == INADDR_LOOPBACK) {
  170. printf("We probably left the building switched identity? start nodeid %d nodeid %d current nodeid %d pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
  171. } else if(htonl((uint32_t)left_list[0].nodeid) == INADDR_LOOPBACK) {
  172. printf("We probably left the building started alone? start nodeid %d nodeid %d current nodeid %d pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
  173. }
  174. /* a possibly reliable way to check is based on original address */
  175. if(left_list[0].nodeid == nodeidStart) {
  176. printf("We have left the building direct match start nodeid %d nodeid %d local get current nodeid %d pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
  177. // quit = 1;
  178. restart = 1;
  179. } else {
  180. printf("Probably another node with matching pid start nodeid %d nodeid %d current nodeid %d pid %d\n", nodeidStart, left_list[0].nodeid, nodeid, left_list[0].pid);
  181. }
  182. }
  183. }
  184. }
  185. static void TotemConfchgCallback (
  186. cpg_handle_t handle,
  187. struct cpg_ring_id ring_id,
  188. uint32_t member_list_entries,
  189. const uint32_t *member_list)
  190. {
  191. unsigned int i;
  192. printf("\n");
  193. print_time();
  194. printf ("TotemConfchgCallback: ringid (%u.%"PRIu64")\n",
  195. ring_id.nodeid, ring_id.seq);
  196. printf("active processors %lu: ",
  197. (unsigned long int) member_list_entries);
  198. for (i=0; i<member_list_entries; i++) {
  199. printf("%d ", member_list[i]);
  200. }
  201. printf ("\n");
  202. }
  203. static cpg_model_v1_data_t model_data = {
  204. .cpg_deliver_fn = DeliverCallback,
  205. .cpg_confchg_fn = ConfchgCallback,
  206. .cpg_totem_confchg_fn = TotemConfchgCallback,
  207. .flags = CPG_MODEL_V1_DELIVER_INITIAL_TOTEM_CONF,
  208. };
  209. static void sigintr_handler (int signum) __attribute__((noreturn));
  210. static void sigintr_handler (int signum) {
  211. exit (0);
  212. }
  213. static struct cpg_name group_name;
  214. #define retrybackoff(counter) { \
  215. counter++; \
  216. printf("Restart operation after %ds\n", counter); \
  217. sleep((unsigned int)counter); \
  218. restart = 1; \
  219. continue; \
  220. }
  221. #define cs_repeat_init(counter, max, code) do { \
  222. code; \
  223. if (result == CS_ERR_TRY_AGAIN || result == CS_ERR_QUEUE_FULL || result == CS_ERR_LIBRARY) { \
  224. counter++; \
  225. printf("Retrying operation after %ds\n", counter); \
  226. sleep((unsigned int)counter); \
  227. } else { \
  228. break; \
  229. } \
  230. } while (counter < max)
  231. #define cs_repeat(counter, max, code) do { \
  232. code; \
  233. if (result == CS_ERR_TRY_AGAIN || result == CS_ERR_QUEUE_FULL) { \
  234. counter++; \
  235. printf("Retrying operation after %ds\n", counter); \
  236. sleep((unsigned int)counter); \
  237. } else { \
  238. break; \
  239. } \
  240. } while (counter < max)
  241. static void print_localnodeid(cpg_handle_t handle)
  242. {
  243. char addrStr[128];
  244. unsigned int retries;
  245. unsigned int nodeid;
  246. struct sockaddr_storage addr;
  247. struct sockaddr_in *v4addr = (struct sockaddr_in *)&addr;
  248. int result;
  249. retries = 0;
  250. cs_repeat(retries, 30, result = cpg_local_get(handle, &nodeid));
  251. if (result != CS_OK) {
  252. printf ("Could not get local node id\n");
  253. } else {
  254. v4addr->sin_addr.s_addr = nodeid;
  255. if(inet_ntop(AF_INET, (const void *)&v4addr->sin_addr.s_addr,
  256. addrStr, (socklen_t)sizeof(addrStr)) == NULL) {
  257. addrStr[0] = 0;
  258. }
  259. printf ("Local node id is %s/%x result %d\n", addrStr, nodeid, result);
  260. }
  261. }
  262. int main (int argc, char *argv[]) {
  263. cpg_handle_t handle;
  264. fd_set read_fds;
  265. int select_fd;
  266. int result;
  267. int retries;
  268. const char *options = "i";
  269. int opt;
  270. unsigned int nodeid;
  271. char *fgets_res;
  272. struct cpg_address member_list[64];
  273. int member_list_entries;
  274. int i;
  275. int recnt;
  276. int doexit;
  277. const char *exitStr = "EXIT";
  278. doexit = 0;
  279. #ifdef QBLOG
  280. qb_log_init("testcpg", LOG_USER, LOG_ERR);
  281. qb_log_ctl(QB_LOG_SYSLOG, QB_LOG_CONF_ENABLED, QB_FALSE);
  282. qb_log_filter_ctl(QB_LOG_STDERR, QB_LOG_FILTER_ADD,
  283. QB_LOG_FILTER_FILE, "*", LOG_TRACE);
  284. qb_log_ctl(QB_LOG_STDERR, QB_LOG_CONF_ENABLED, QB_TRUE);
  285. qb_log_format_set(QB_LOG_STDERR, "[%p] %f %b");
  286. #endif
  287. while ( (opt = getopt(argc, argv, options)) != -1 ) {
  288. switch (opt) {
  289. case 'i':
  290. show_ip = 1;
  291. break;
  292. }
  293. }
  294. if (argc > optind) {
  295. strcpy(group_name.value, argv[optind]);
  296. group_name.length = strlen(argv[optind]);
  297. }
  298. else {
  299. strcpy(group_name.value, "GROUP");
  300. group_name.length = 6;
  301. }
  302. recnt = 0;
  303. printf ("Type %s to finish\n", exitStr);
  304. restart = 1;
  305. do {
  306. if(restart) {
  307. restart = 0;
  308. retries = 0;
  309. cs_repeat_init(retries, 30, result = cpg_model_initialize (&handle, CPG_MODEL_V1, (cpg_model_data_t *)&model_data, NULL));
  310. if (result != CS_OK) {
  311. printf ("Could not initialize Cluster Process Group API instance error %d\n", result);
  312. retrybackoff(recnt);
  313. }
  314. retries = 0;
  315. cs_repeat(retries, 30, result = cpg_local_get(handle, &nodeid));
  316. if (result != CS_OK) {
  317. printf ("Could not get local node id\n");
  318. retrybackoff(recnt);
  319. }
  320. printf ("Local node id is %x\n", nodeid);
  321. nodeidStart = nodeid;
  322. retries = 0;
  323. cs_repeat(retries, 30, result = cpg_join(handle, &group_name));
  324. if (result != CS_OK) {
  325. printf ("Could not join process group, error %d\n", result);
  326. retrybackoff(recnt);
  327. }
  328. retries = 0;
  329. cs_repeat(retries, 30, result = cpg_membership_get (handle, &group_name,
  330. (struct cpg_address *)&member_list, &member_list_entries));
  331. if (result != CS_OK) {
  332. printf ("Could not get current membership list %d\n", result);
  333. retrybackoff(recnt);
  334. }
  335. recnt = 0;
  336. printf ("membership list\n");
  337. for (i = 0; i < member_list_entries; i++) {
  338. printf ("node id %d pid %d\n", member_list[i].nodeid,
  339. member_list[i].pid);
  340. }
  341. FD_ZERO (&read_fds);
  342. cpg_fd_get(handle, &select_fd);
  343. }
  344. FD_SET (select_fd, &read_fds);
  345. FD_SET (STDIN_FILENO, &read_fds);
  346. result = select (select_fd + 1, &read_fds, 0, 0, 0);
  347. if (result == -1) {
  348. perror ("select\n");
  349. }
  350. if (FD_ISSET (STDIN_FILENO, &read_fds)) {
  351. char inbuf[132];
  352. struct iovec iov;
  353. fgets_res = fgets(inbuf, (int)sizeof(inbuf), stdin);
  354. if (fgets_res == NULL) {
  355. doexit = 1;
  356. cpg_leave(handle, &group_name);
  357. }
  358. if (strncmp(inbuf, exitStr, strlen(exitStr)) == 0) {
  359. doexit = 1;
  360. cpg_leave(handle, &group_name);
  361. }
  362. else {
  363. iov.iov_base = inbuf;
  364. iov.iov_len = strlen(inbuf)+1;
  365. cpg_mcast_joined(handle, CPG_TYPE_AGREED, &iov, 1);
  366. }
  367. }
  368. if (FD_ISSET (select_fd, &read_fds)) {
  369. if (cpg_dispatch (handle, CS_DISPATCH_ALL) != CS_OK) {
  370. if(doexit) {
  371. exit(1);
  372. }
  373. restart = 1;
  374. }
  375. }
  376. if(restart) {
  377. if(!doexit) {
  378. result = cpg_finalize (handle);
  379. printf ("Finalize+restart result is %d (should be 1)\n", result);
  380. continue;
  381. }
  382. }
  383. } while (result && !quit && !doexit);
  384. result = cpg_finalize (handle);
  385. printf ("Finalize result is %d (should be 1)\n", result);
  386. return (0);
  387. }