4
0

qnetd-algorithm.c 8.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232
  1. /*
  2. * Copyright (c) 2015-2017 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Jan Friesse (jfriesse@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 Red Hat, 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 <sys/types.h>
  35. #include "qnet-config.h"
  36. #include "qnetd-algorithm.h"
  37. #include "qnetd-algo-test.h"
  38. #include "qnetd-algo-ffsplit.h"
  39. #include "qnetd-algo-2nodelms.h"
  40. #include "qnetd-algo-lms.h"
  41. #include "qnetd-log.h"
  42. static struct qnetd_algorithm *qnetd_algorithm_array[QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE];
  43. enum tlv_reply_error_code
  44. qnetd_algorithm_client_init(struct qnetd_client *client)
  45. {
  46. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  47. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  48. qnetd_log(LOG_CRIT, "qnetd_algorithm_client_init unhandled decision algorithm");
  49. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  50. }
  51. return (qnetd_algorithm_array[client->decision_algorithm]->init(client));
  52. }
  53. enum tlv_reply_error_code
  54. qnetd_algorithm_config_node_list_received(struct qnetd_client *client,
  55. uint32_t msg_seq_num, int config_version_set, uint64_t config_version,
  56. const struct node_list *nodes, int initial, enum tlv_vote *result_vote)
  57. {
  58. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  59. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  60. qnetd_log(LOG_CRIT, "qnetd_algorithm_config_node_list_received unhandled "
  61. "decision algorithm");
  62. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  63. }
  64. return (qnetd_algorithm_array[client->decision_algorithm]->config_node_list_received(
  65. client, msg_seq_num,
  66. config_version_set, config_version, nodes, initial, result_vote));
  67. }
  68. enum tlv_reply_error_code
  69. qnetd_algorithm_membership_node_list_received(struct qnetd_client *client,
  70. uint32_t msg_seq_num, const struct tlv_ring_id *ring_id,
  71. const struct node_list *nodes, enum tlv_heuristics heuristics, enum tlv_vote *result_vote)
  72. {
  73. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  74. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  75. qnetd_log(LOG_CRIT, "qnetd_algorithm_membership_node_list_received unhandled "
  76. "decision algorithm");
  77. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  78. }
  79. return (qnetd_algorithm_array[client->decision_algorithm]->membership_node_list_received(
  80. client, msg_seq_num,
  81. ring_id, nodes, heuristics, result_vote));
  82. }
  83. enum tlv_reply_error_code
  84. qnetd_algorithm_quorum_node_list_received(struct qnetd_client *client,
  85. uint32_t msg_seq_num, enum tlv_quorate quorate,
  86. const struct node_list *nodes, enum tlv_vote *result_vote)
  87. {
  88. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  89. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  90. qnetd_log(LOG_CRIT, "algorithm_quorum_node_list_received unhandled "
  91. "decision algorithm");
  92. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  93. }
  94. return (qnetd_algorithm_array[client->decision_algorithm]->quorum_node_list_received(
  95. client, msg_seq_num, quorate, nodes, result_vote));
  96. }
  97. void
  98. qnetd_algorithm_client_disconnect(struct qnetd_client *client, int server_going_down)
  99. {
  100. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  101. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  102. qnetd_log(LOG_CRIT, "qnetd_algorithm_client_disconnect unhandled decision "
  103. "algorithm");
  104. return;
  105. }
  106. qnetd_algorithm_array[client->decision_algorithm]->client_disconnect(client, server_going_down);
  107. }
  108. enum tlv_reply_error_code
  109. qnetd_algorithm_ask_for_vote_received(struct qnetd_client *client, uint32_t msg_seq_num,
  110. enum tlv_vote *result_vote)
  111. {
  112. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  113. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  114. qnetd_log(LOG_CRIT, "qnetd_algorithm_ask_for_vote_received unhandled "
  115. "decision algorithm");
  116. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  117. }
  118. return (qnetd_algorithm_array[client->decision_algorithm]->ask_for_vote_received(
  119. client, msg_seq_num, result_vote));
  120. }
  121. enum tlv_reply_error_code
  122. qnetd_algorithm_vote_info_reply_received(struct qnetd_client *client, uint32_t msg_seq_num)
  123. {
  124. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  125. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  126. qnetd_log(LOG_CRIT, "qnetd_algorithm_vote_info_reply_received unhandled decision algorithm");
  127. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  128. }
  129. return (qnetd_algorithm_array[client->decision_algorithm]->vote_info_reply_received(
  130. client, msg_seq_num));
  131. }
  132. enum tlv_reply_error_code
  133. qnetd_algorithm_heuristics_change_received(struct qnetd_client *client, uint32_t msg_seq_num,
  134. enum tlv_heuristics heuristics, enum tlv_vote *result_vote)
  135. {
  136. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  137. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  138. qnetd_log(LOG_CRIT, "qnetd_algorithm_ask_for_vote_received unhandled "
  139. "decision algorithm");
  140. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  141. }
  142. return (qnetd_algorithm_array[client->decision_algorithm]->heuristics_change_received(
  143. client, msg_seq_num, heuristics, result_vote));
  144. }
  145. enum tlv_reply_error_code
  146. qnetd_algorithm_timer_callback(struct qnetd_client *client, int *reschedule_timer,
  147. int *send_vote, enum tlv_vote *result_vote)
  148. {
  149. if (client->decision_algorithm >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE ||
  150. qnetd_algorithm_array[client->decision_algorithm] == NULL) {
  151. qnetd_log(LOG_CRIT, "qnetd_algorithm_timer_callback unhandled decision algorithm");
  152. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  153. }
  154. return (qnetd_algorithm_array[client->decision_algorithm]->timer_callback(
  155. client, reschedule_timer, send_vote, result_vote));
  156. }
  157. int
  158. qnetd_algorithm_register(enum tlv_decision_algorithm_type algorithm_number,
  159. struct qnetd_algorithm *algorithm)
  160. {
  161. if (algorithm_number >= QNETD_STATIC_SUPPORTED_DECISION_ALGORITHMS_SIZE) {
  162. qnetd_log(LOG_CRIT, "Failed to register unsupported decision algorithm %u",
  163. algorithm_number);
  164. return (-1);
  165. }
  166. if (qnetd_algorithm_array[algorithm_number] != NULL) {
  167. qnetd_log(LOG_CRIT, "Failed to register decision algorithm %u, "
  168. "it's already registered.", algorithm_number);
  169. return (-1);
  170. }
  171. qnetd_algorithm_array[algorithm_number] = algorithm;
  172. return (0);
  173. }
  174. int
  175. qnetd_algorithm_register_all(void)
  176. {
  177. if (qnetd_algo_test_register() != 0) {
  178. qnetd_log(LOG_CRIT, "Failed to register decision algorithm 'test'");
  179. return (-1);
  180. }
  181. if (qnetd_algo_ffsplit_register() != 0) {
  182. qnetd_log(LOG_CRIT, "Failed to register decision algorithm 'ffsplit'");
  183. return (-1);
  184. }
  185. if (qnetd_algo_2nodelms_register() != 0) {
  186. qnetd_log(LOG_CRIT, "Failed to register decision algorithm '2nodelms'");
  187. return (-1);
  188. }
  189. if (qnetd_algo_lms_register() != 0) {
  190. qnetd_log(LOG_CRIT, "Failed to register decision algorithm 'lms'");
  191. return (-1);
  192. }
  193. return (0);
  194. }