4
0

cpgverify.c 5.1 KB

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