4
0

testzcgc.c 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175
  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 <stdio.h>
  36. #include <stdlib.h>
  37. #include <errno.h>
  38. #include <unistd.h>
  39. #include <string.h>
  40. #include <inttypes.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. static int quit = 0;
  50. static int show_ip = 0;
  51. static void print_cpgname (const struct cpg_name *name)
  52. {
  53. int i;
  54. for (i = 0; i < name->length; i++) {
  55. printf ("%c", name->value[i]);
  56. }
  57. }
  58. static void DeliverCallback (
  59. cpg_handle_t handle,
  60. const struct cpg_name *groupName,
  61. uint32_t nodeid,
  62. uint32_t pid,
  63. void *msg,
  64. size_t msg_len)
  65. {
  66. if (show_ip) {
  67. struct in_addr saddr;
  68. saddr.s_addr = nodeid;
  69. printf("DeliverCallback: message (len=%lu)from node/pid %s/%d: '%s'\n",
  70. (unsigned long int) msg_len,
  71. inet_ntoa(saddr), pid, (const char *)msg);
  72. }
  73. else {
  74. printf("DeliverCallback: message (len=%lu)from node/pid " CS_PRI_NODE_ID "/%d: '%s'\n",
  75. (unsigned long int) msg_len, nodeid, pid,
  76. (const char *)msg);
  77. }
  78. }
  79. static void ConfchgCallback (
  80. cpg_handle_t handle,
  81. const struct cpg_name *groupName,
  82. const struct cpg_address *member_list, size_t member_list_entries,
  83. const struct cpg_address *left_list, size_t left_list_entries,
  84. const struct cpg_address *joined_list, size_t joined_list_entries)
  85. {
  86. int i;
  87. struct in_addr saddr;
  88. printf("\nConfchgCallback: group '");
  89. print_cpgname(groupName);
  90. printf("'\n");
  91. for (i=0; i<joined_list_entries; i++) {
  92. if (show_ip) {
  93. saddr.s_addr = joined_list[i].nodeid;
  94. printf("joined node/pid: %s/%d reason: %d\n",
  95. inet_ntoa (saddr), joined_list[i].pid,
  96. joined_list[i].reason);
  97. }
  98. else {
  99. printf("joined node/pid: " CS_PRI_NODE_ID "/%d reason: %d\n",
  100. joined_list[i].nodeid, joined_list[i].pid,
  101. joined_list[i].reason);
  102. }
  103. }
  104. for (i=0; i<left_list_entries; i++) {
  105. if (show_ip) {
  106. saddr.s_addr = left_list[i].nodeid;
  107. printf("left node/pid: %s/%d reason: %d\n",
  108. inet_ntoa (saddr), left_list[i].pid,
  109. left_list[i].reason);
  110. }
  111. else {
  112. printf("left node/pid: " CS_PRI_NODE_ID "/%d reason: %d\n",
  113. left_list[i].nodeid, left_list[i].pid,
  114. left_list[i].reason);
  115. }
  116. }
  117. printf("nodes in group now %lu\n",
  118. (unsigned long int) member_list_entries);
  119. for (i=0; i<member_list_entries; i++) {
  120. if (show_ip) {
  121. saddr.s_addr = member_list[i].nodeid;
  122. printf("node/pid: %s/%d\n",
  123. inet_ntoa (saddr), member_list[i].pid);
  124. }
  125. else {
  126. printf("node/pid: " CS_PRI_NODE_ID "/%d\n",
  127. member_list[i].nodeid, member_list[i].pid);
  128. }
  129. }
  130. /* Is it us??
  131. NOTE: in reality we should also check the nodeid */
  132. if (left_list_entries && left_list[0].pid == getpid()) {
  133. printf("We have left the building\n");
  134. quit = 1;
  135. }
  136. }
  137. static cpg_callbacks_t callbacks = {
  138. .cpg_deliver_fn = DeliverCallback,
  139. .cpg_confchg_fn = ConfchgCallback,
  140. };
  141. static struct cpg_name group_name;
  142. int main (int argc, char *argv[]) {
  143. cpg_handle_t handle;
  144. int result;
  145. void *buffer;
  146. unsigned int i;
  147. strcpy(group_name.value, "GROUP");
  148. group_name.length = 6;
  149. result = cpg_initialize (&handle, &callbacks);
  150. if (result != CS_OK) {
  151. printf ("Could not initialize Cluster Process Group API instance error %d\n", result);
  152. exit (1);
  153. }
  154. for (i = 0; i < 100; i++) {
  155. cpg_zcb_alloc (handle, 1024*1024, &buffer);
  156. }
  157. return (0);
  158. }