4
0

testcpg.c 12 KB

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