testcpg.c 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222
  1. /*
  2. * Copyright (c) 2006 Red Hat Inc
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Patrick Caulfield <pcaulfie@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 <errno.h>
  37. #include <signal.h>
  38. #include <unistd.h>
  39. #include <string.h>
  40. #include <sys/types.h>
  41. #include <sys/socket.h>
  42. #include <sys/select.h>
  43. #include <sys/un.h>
  44. #include <netinet/in.h>
  45. #include <arpa/inet.h>
  46. #include "saAis.h"
  47. #include "cpg.h"
  48. static int quit = 0;
  49. static int show_ip = 0;
  50. void print_cpgname (struct cpg_name *name)
  51. {
  52. int i;
  53. for (i = 0; i < name->length; i++) {
  54. printf ("%c", name->value[i]);
  55. }
  56. }
  57. void DeliverCallback (
  58. cpg_handle_t handle,
  59. struct cpg_name *groupName,
  60. uint32_t nodeid,
  61. uint32_t pid,
  62. void *msg,
  63. int msg_len)
  64. {
  65. if (show_ip) {
  66. struct in_addr saddr;
  67. saddr.s_addr = nodeid;
  68. printf("DeliverCallback: message (len=%d)from node/pid %s/%d: '%s'\n",
  69. msg_len, inet_ntoa(saddr), pid, (char *)msg);
  70. }
  71. else {
  72. printf("DeliverCallback: message (len=%d)from node/pid %d/%d: '%s'\n", msg_len, nodeid, pid, (char *)msg);
  73. }
  74. }
  75. void ConfchgCallback (
  76. cpg_handle_t handle,
  77. struct cpg_name *groupName,
  78. struct cpg_address *member_list, int member_list_entries,
  79. struct cpg_address *left_list, int left_list_entries,
  80. struct cpg_address *joined_list, int joined_list_entries)
  81. {
  82. int i;
  83. struct in_addr saddr;
  84. printf("\nConfchgCallback: group '"); print_cpgname(groupName); printf("'\n");
  85. for (i=0; i<joined_list_entries; i++) {
  86. if (show_ip) {
  87. saddr.s_addr = joined_list[i].nodeid;
  88. printf("joined node/pid: %s/%d reason: %d\n",
  89. inet_ntoa (saddr), joined_list[i].pid,
  90. joined_list[i].reason);
  91. }
  92. else {
  93. printf("joined node/pid: %d/%d reason: %d\n",
  94. joined_list[i].nodeid, joined_list[i].pid,
  95. joined_list[i].reason);
  96. }
  97. }
  98. for (i=0; i<left_list_entries; i++) {
  99. if (show_ip) {
  100. saddr.s_addr = left_list[i].nodeid;
  101. printf("left node/pid: %s/%d reason: %d\n",
  102. inet_ntoa (saddr), left_list[i].pid,
  103. left_list[i].reason);
  104. }
  105. else {
  106. printf("left node/pid: %d/%d reason: %d\n",
  107. left_list[i].nodeid, left_list[i].pid,
  108. left_list[i].reason);
  109. }
  110. }
  111. printf("nodes in group now %d\n", member_list_entries);
  112. for (i=0; i<member_list_entries; i++) {
  113. if (show_ip) {
  114. saddr.s_addr = member_list[i].nodeid;
  115. printf("node/pid: %s/%d\n",
  116. inet_ntoa (saddr), member_list[i].pid);
  117. }
  118. else {
  119. printf("node/pid: %d/%d\n",
  120. member_list[i].nodeid, member_list[i].pid);
  121. }
  122. }
  123. /* Is it us??
  124. NOTE: in reality we should also check the nodeid */
  125. if (left_list_entries && left_list[0].pid == getpid()) {
  126. printf("We have left the building\n");
  127. quit = 1;
  128. }
  129. }
  130. cpg_callbacks_t callbacks = {
  131. .cpg_deliver_fn = DeliverCallback,
  132. .cpg_confchg_fn = ConfchgCallback,
  133. };
  134. void sigintr_handler (int signum) {
  135. exit (0);
  136. }
  137. static struct cpg_name group_name;
  138. int main (int argc, char *argv[]) {
  139. cpg_handle_t handle;
  140. fd_set read_fds;
  141. int select_fd;
  142. int result;
  143. const char *options = "i";
  144. int opt;
  145. while ( (opt = getopt(argc, argv, options)) != -1 ) {
  146. switch (opt) {
  147. case 'i':
  148. show_ip = 1;
  149. break;
  150. }
  151. }
  152. if (argc > optind) {
  153. strcpy(group_name.value, argv[optind]);
  154. group_name.length = strlen(argv[optind])+1;
  155. }
  156. else {
  157. strcpy(group_name.value, "GROUP");
  158. group_name.length = 6;
  159. }
  160. result = cpg_initialize (&handle, &callbacks);
  161. if (result != SA_AIS_OK) {
  162. printf ("Could not initialize Cluster Process Group API instance error %d\n", result);
  163. exit (1);
  164. }
  165. result = cpg_join(handle, &group_name);
  166. if (result != SA_AIS_OK) {
  167. printf ("Could not join process group, error %d\n", result);
  168. exit (1);
  169. }
  170. FD_ZERO (&read_fds);
  171. cpg_fd_get(handle, &select_fd);
  172. printf ("Type EXIT to finish\n");
  173. do {
  174. FD_SET (select_fd, &read_fds);
  175. FD_SET (STDIN_FILENO, &read_fds);
  176. result = select (select_fd + 1, &read_fds, 0, 0, 0);
  177. if (result == -1) {
  178. perror ("select\n");
  179. }
  180. if (FD_ISSET (STDIN_FILENO, &read_fds)) {
  181. char inbuf[132];
  182. struct iovec iov;
  183. fgets(inbuf, sizeof(inbuf), stdin);
  184. if (strncmp(inbuf, "EXIT", 4) == 0) {
  185. cpg_leave(handle, &group_name);
  186. }
  187. else {
  188. iov.iov_base = inbuf;
  189. iov.iov_len = strlen(inbuf)+1;
  190. cpg_mcast_joined(handle, CPG_TYPE_AGREED, &iov, 1);
  191. }
  192. }
  193. if (FD_ISSET (select_fd, &read_fds)) {
  194. if (cpg_dispatch (handle, CPG_DISPATCH_ALL) != SA_AIS_OK)
  195. exit(1);
  196. }
  197. } while (result && !quit);
  198. result = cpg_finalize (handle);
  199. printf ("Finalize result is %d (should be 1)\n", result);
  200. return (0);
  201. }