4
0

cpgverify.c 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190
  1. /*
  2. * Copyright (c) 2009 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Steven Dake (sdake@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 <unistd.h>
  36. #include <stdio.h>
  37. #include <stdlib.h>
  38. #include <sys/socket.h>
  39. #include <netinet/in.h>
  40. #include <arpa/inet.h>
  41. #include <errno.h>
  42. #include <string.h>
  43. #include <corosync/corotypes.h>
  44. #include <corosync/cpg.h>
  45. #include <nss.h>
  46. #include <pk11pub.h>
  47. struct my_msg {
  48. unsigned int msg_size;
  49. unsigned char sha1[20];
  50. unsigned char buffer[0];
  51. };
  52. static int deliveries = 0;
  53. PK11Context* sha1_context;
  54. static void cpg_deliver_fn (
  55. cpg_handle_t handle,
  56. const struct cpg_name *group_name,
  57. uint32_t nodeid,
  58. uint32_t pid,
  59. void *m,
  60. size_t msg_len)
  61. {
  62. const struct my_msg *msg2 = m;
  63. unsigned char sha1_compare[20];
  64. unsigned int i;
  65. unsigned int sha1_len;
  66. printf ("msg '%s'\n", msg2->buffer);
  67. PK11_DigestBegin(sha1_context);
  68. PK11_DigestOp(sha1_context, msg2->buffer, msg2->msg_size);
  69. PK11_DigestFinal(sha1_context, sha1_compare, &sha1_len, sizeof(sha1_compare));
  70. printf ("SIZE %d HASH: ", msg2->msg_size);
  71. for (i = 0; i < 20; i++) {
  72. printf ("%x", sha1_compare[i]);
  73. }
  74. printf ("\n");
  75. if (memcmp (sha1_compare, msg2->sha1, 20) != 0) {
  76. printf ("incorrect hash\n");
  77. exit (1);
  78. }
  79. deliveries++;
  80. }
  81. static void cpg_confchg_fn (
  82. cpg_handle_t handle,
  83. const struct cpg_name *group_name,
  84. const struct cpg_address *member_list, size_t member_list_entries,
  85. const struct cpg_address *left_list, size_t left_list_entries,
  86. const struct cpg_address *joined_list, size_t joined_list_entries)
  87. {
  88. }
  89. static cpg_callbacks_t callbacks = {
  90. cpg_deliver_fn,
  91. cpg_confchg_fn
  92. };
  93. static struct cpg_name group_name = {
  94. .value = "cpg_bm",
  95. .length = 6
  96. };
  97. static unsigned char buffer[200000];
  98. int main (int argc, char *argv[])
  99. {
  100. cpg_handle_t handle;
  101. cs_error_t result;
  102. int i = 0;
  103. int j;
  104. struct my_msg msg;
  105. struct iovec iov[2];
  106. const char *options = "i:";
  107. int iter = 1000;
  108. int opt;
  109. int run_forever = 1;
  110. unsigned int sha1_len;
  111. while ((opt = getopt(argc, argv, options)) != -1) {
  112. switch (opt) {
  113. case 'i':
  114. run_forever = 0;
  115. iter = atoi(optarg);
  116. break;
  117. }
  118. }
  119. result = cpg_initialize (&handle, &callbacks);
  120. if (result != CS_OK) {
  121. printf ("Couldn't initialize CPG service %d\n", result);
  122. exit (0);
  123. }
  124. if (NSS_NoDB_Init(".") != SECSuccess) {
  125. printf ("Couldn't initialize nss\n");
  126. exit (0);
  127. }
  128. if ((sha1_context = PK11_CreateDigestContext(SEC_OID_SHA1)) == NULL) {
  129. printf ("Couldn't initialize nss\n");
  130. exit (0);
  131. }
  132. result = cpg_join (handle, &group_name);
  133. if (result != CS_OK) {
  134. printf ("cpg_join failed with result %d\n", result);
  135. exit (1);
  136. }
  137. iov[0].iov_base = (void *)&msg;
  138. iov[0].iov_len = sizeof (struct my_msg);
  139. iov[1].iov_base = (void *)buffer;
  140. /*
  141. * Demonstrate cpg_mcast_joined
  142. */
  143. i = 0;
  144. do {
  145. msg.msg_size = 100 + rand() % 100000;
  146. iov[1].iov_len = msg.msg_size;
  147. for (j = 0; j < msg.msg_size; j++) {
  148. buffer[j] = j;
  149. }
  150. sprintf ((char *)buffer,
  151. "cpg_mcast_joined: This is message %12d", i);
  152. PK11_DigestBegin(sha1_context);
  153. PK11_DigestOp(sha1_context, buffer, msg.msg_size);
  154. PK11_DigestFinal(sha1_context, msg.sha1, &sha1_len, sizeof(msg.sha1));
  155. try_again_one:
  156. result = cpg_mcast_joined (handle, CPG_TYPE_AGREED,
  157. iov, 2);
  158. if (result == CS_ERR_TRY_AGAIN) {
  159. goto try_again_one;
  160. }
  161. result = cpg_dispatch (handle, CS_DISPATCH_ALL);
  162. i++;
  163. } while (run_forever || i < iter);
  164. PK11_DestroyContext(sha1_context, PR_TRUE);
  165. cpg_finalize (handle);
  166. return (0);
  167. }