testcpg.c 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  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 <corosync/corotypes.h>
  48. #include <corosync/cpg.h>
  49. #include <corosync/swab.h>
  50. static int quit = 0;
  51. static int show_ip = 0;
  52. static void print_cpgname (const struct cpg_name *name)
  53. {
  54. int i;
  55. for (i = 0; i < name->length; i++) {
  56. printf ("%c", name->value[i]);
  57. }
  58. }
  59. static char * node_pid_format(unsigned int nodeid,int pid) {
  60. static char buffer[100];
  61. if (show_ip) {
  62. struct in_addr saddr;
  63. #if __BYTE_ORDER == __BIG_ENDIAN
  64. saddr.s_addr = swab32(nodeid);
  65. #else
  66. saddr.s_addr = nodeid;
  67. #endif
  68. sprintf(buffer, "node/pid %s/%d", inet_ntoa(saddr),pid);
  69. }
  70. else {
  71. sprintf(buffer, "node/pid %d/%d", nodeid, pid);
  72. }
  73. return buffer;
  74. }
  75. static void DeliverCallback (
  76. cpg_handle_t handle,
  77. const struct cpg_name *groupName,
  78. uint32_t nodeid,
  79. uint32_t pid,
  80. void *msg,
  81. size_t msg_len)
  82. {
  83. printf("DeliverCallback: message (len=%lu)from %s: '%s'\n",
  84. (unsigned long int) msg_len, node_pid_format(nodeid, pid),
  85. (const char *)msg);
  86. }
  87. static void ConfchgCallback (
  88. cpg_handle_t handle,
  89. const struct cpg_name *groupName,
  90. const struct cpg_address *member_list, size_t member_list_entries,
  91. const struct cpg_address *left_list, size_t left_list_entries,
  92. const struct cpg_address *joined_list, size_t joined_list_entries)
  93. {
  94. int i;
  95. printf("\nConfchgCallback: group '");
  96. print_cpgname(groupName);
  97. printf("'\n");
  98. for (i=0; i<joined_list_entries; i++) {
  99. printf("joined %s reason: %d\n",
  100. node_pid_format(joined_list[i].nodeid, joined_list[i].pid),
  101. joined_list[i].reason);
  102. }
  103. for (i=0; i<left_list_entries; i++) {
  104. printf("left %s reason: %d\n",
  105. node_pid_format(left_list[i].nodeid, left_list[i].pid),
  106. left_list[i].reason);
  107. }
  108. printf("nodes in group now %lu\n",
  109. (unsigned long int) member_list_entries);
  110. for (i=0; i<member_list_entries; i++) {
  111. printf("%s\n",
  112. node_pid_format(member_list[i].nodeid, member_list[i].pid));
  113. }
  114. /* Is it us??
  115. NOTE: in reality we should also check the nodeid */
  116. if (left_list_entries && left_list[0].pid == getpid()) {
  117. printf("We have left the building\n");
  118. quit = 1;
  119. }
  120. }
  121. static void TotemConfchgCallback (
  122. cpg_handle_t handle,
  123. struct cpg_ring_id ring_id,
  124. uint32_t member_list_entries,
  125. const uint32_t *member_list)
  126. {
  127. int i;
  128. printf("\nTotemConfchgCallback: ringid (%u.%"PRIu64")\n", ring_id.nodeid, ring_id.seq);
  129. printf("active processors %lu: ",
  130. (unsigned long int) member_list_entries);
  131. for (i=0; i<member_list_entries; i++) {
  132. printf("%d ", member_list[i]);
  133. }
  134. printf ("\n");
  135. }
  136. static cpg_model_v1_data_t model_data = {
  137. .cpg_deliver_fn = DeliverCallback,
  138. .cpg_confchg_fn = ConfchgCallback,
  139. .cpg_totem_confchg_fn = TotemConfchgCallback,
  140. .flags = CPG_MODEL_V1_DELIVER_INITIAL_TOTEM_CONF,
  141. };
  142. static void sigintr_handler (int signum) __attribute__((noreturn));
  143. static void sigintr_handler (int signum) {
  144. exit (0);
  145. }
  146. static struct cpg_name group_name;
  147. int main (int argc, char *argv[]) {
  148. cpg_handle_t handle;
  149. fd_set read_fds;
  150. int select_fd;
  151. int result;
  152. const char *options = "i";
  153. int opt;
  154. unsigned int nodeid;
  155. char *fgets_res;
  156. struct cpg_address member_list[64];
  157. int member_list_entries;
  158. int i;
  159. while ( (opt = getopt(argc, argv, options)) != -1 ) {
  160. switch (opt) {
  161. case 'i':
  162. show_ip = 1;
  163. break;
  164. }
  165. }
  166. if (argc > optind) {
  167. strcpy(group_name.value, argv[optind]);
  168. group_name.length = strlen(argv[optind]);
  169. }
  170. else {
  171. strcpy(group_name.value, "GROUP");
  172. group_name.length = 6;
  173. }
  174. result = cpg_model_initialize (&handle, CPG_MODEL_V1, (cpg_model_data_t *)&model_data, NULL);
  175. if (result != CS_OK) {
  176. printf ("Could not initialize Cluster Process Group API instance error %d\n", result);
  177. exit (1);
  178. }
  179. result = cpg_local_get (handle, &nodeid);
  180. if (result != CS_OK) {
  181. printf ("Could not get local node id\n");
  182. exit (1);
  183. }
  184. printf ("Local node id is %x\n", nodeid);
  185. result = cpg_join(handle, &group_name);
  186. if (result != CS_OK) {
  187. printf ("Could not join process group, error %d\n", result);
  188. exit (1);
  189. }
  190. sleep (1);
  191. result = cpg_membership_get (handle, &group_name,
  192. (struct cpg_address *)&member_list, &member_list_entries);
  193. if (result != CS_OK) {
  194. printf ("Could not get current membership list %d\n", result);
  195. exit (1);
  196. }
  197. printf ("membership list\n");
  198. for (i = 0; i < member_list_entries; i++) {
  199. printf ("node id %d pid %d\n", member_list[i].nodeid,
  200. member_list[i].pid);
  201. }
  202. FD_ZERO (&read_fds);
  203. cpg_fd_get(handle, &select_fd);
  204. printf ("Type EXIT to finish\n");
  205. do {
  206. FD_SET (select_fd, &read_fds);
  207. FD_SET (STDIN_FILENO, &read_fds);
  208. result = select (select_fd + 1, &read_fds, 0, 0, 0);
  209. if (result == -1) {
  210. perror ("select\n");
  211. }
  212. if (FD_ISSET (STDIN_FILENO, &read_fds)) {
  213. char inbuf[132];
  214. struct iovec iov;
  215. fgets_res = fgets(inbuf, sizeof(inbuf), stdin);
  216. if (fgets_res == NULL) {
  217. cpg_leave(handle, &group_name);
  218. }
  219. if (strncmp(inbuf, "EXIT", 4) == 0) {
  220. cpg_leave(handle, &group_name);
  221. }
  222. else {
  223. iov.iov_base = inbuf;
  224. iov.iov_len = strlen(inbuf)+1;
  225. cpg_mcast_joined(handle, CPG_TYPE_AGREED, &iov, 1);
  226. }
  227. }
  228. if (FD_ISSET (select_fd, &read_fds)) {
  229. if (cpg_dispatch (handle, CS_DISPATCH_ALL) != CS_OK)
  230. exit(1);
  231. }
  232. } while (result && !quit);
  233. result = cpg_finalize (handle);
  234. printf ("Finalize result is %d (should be 1)\n", result);
  235. return (0);
  236. }