qnetd-algo-ffsplit.c 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298
  1. /*
  2. * Copyright (c) 2015-2016 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 <string.h>
  36. #include "qnetd-algo-ffsplit.h"
  37. #include "qnetd-log.h"
  38. #include "qnetd-cluster-list.h"
  39. #include "qnetd-cluster.h"
  40. struct ffsplit_cluster_data {
  41. uint8_t leader_set;
  42. uint32_t leader_id;
  43. };
  44. enum tlv_reply_error_code
  45. qnetd_algo_ffsplit_client_init(struct qnetd_client *client)
  46. {
  47. struct ffsplit_cluster_data *cluster_data;
  48. if (qnetd_cluster_size(client->cluster) == 1) {
  49. cluster_data = malloc(sizeof(struct ffsplit_cluster_data));
  50. if (cluster_data == NULL) {
  51. qnetd_log(LOG_ERR, "ffsplit: Can't initialize cluster data for client %s",
  52. client->addr_str);
  53. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  54. }
  55. memset(cluster_data, 0, sizeof(*cluster_data));
  56. client->cluster->algorithm_data = cluster_data;
  57. }
  58. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  59. }
  60. static int
  61. qnetd_algo_ffsplit_is_prefered_partition(struct qnetd_client *client,
  62. const struct node_list *config_node_list, const struct node_list *membership_node_list)
  63. {
  64. uint32_t prefered_node_id;
  65. struct node_list_entry *node_entry;
  66. switch (client->tie_breaker.mode) {
  67. case TLV_TIE_BREAKER_MODE_LOWEST:
  68. node_entry = TAILQ_FIRST(config_node_list);
  69. prefered_node_id = node_entry->node_id;
  70. TAILQ_FOREACH(node_entry, config_node_list, entries) {
  71. if (node_entry->node_id < prefered_node_id) {
  72. prefered_node_id = node_entry->node_id;
  73. }
  74. }
  75. break;
  76. case TLV_TIE_BREAKER_MODE_HIGHEST:
  77. node_entry = TAILQ_FIRST(config_node_list);
  78. prefered_node_id = node_entry->node_id;
  79. TAILQ_FOREACH(node_entry, config_node_list, entries) {
  80. if (node_entry->node_id > prefered_node_id) {
  81. prefered_node_id = node_entry->node_id;
  82. }
  83. }
  84. break;
  85. case TLV_TIE_BREAKER_MODE_NODE_ID:
  86. prefered_node_id = client->tie_breaker.node_id;
  87. break;
  88. }
  89. return (node_list_find_node_id(membership_node_list, prefered_node_id) != NULL);
  90. }
  91. static enum tlv_vote
  92. qnetd_algo_ffsplit_do(struct qnetd_client *client, const struct node_list *config_node_list,
  93. const struct node_list *membership_node_list)
  94. {
  95. struct ffplist_cluster_data *cluster_data;
  96. cluster_data = (struct ffplist_cluster_data *)client->cluster->algorithm_data;
  97. if (node_list_size(config_node_list) % 2 != 0) {
  98. /*
  99. * Odd clusters never split into 50:50.
  100. */
  101. if (node_list_size(membership_node_list) > node_list_size(config_node_list) / 2) {
  102. return (TLV_VOTE_ACK);
  103. } else {
  104. return (TLV_VOTE_NACK);
  105. }
  106. } else {
  107. if (node_list_size(membership_node_list) > node_list_size(config_node_list) / 2) {
  108. return (TLV_VOTE_ACK);
  109. } else if (node_list_size(membership_node_list) < node_list_size(config_node_list) / 2) {
  110. return (TLV_VOTE_NACK);
  111. } else {
  112. /*
  113. * 50:50 split
  114. */
  115. if (qnetd_algo_ffsplit_is_prefered_partition(client, config_node_list,
  116. membership_node_list)) {
  117. return (TLV_VOTE_ACK);
  118. } else {
  119. return (TLV_VOTE_NACK);
  120. }
  121. }
  122. }
  123. }
  124. enum tlv_reply_error_code
  125. qnetd_algo_ffsplit_config_node_list_received(struct qnetd_client *client,
  126. uint32_t msg_seq_num, int config_version_set, uint64_t config_version,
  127. const struct node_list *nodes, int initial, enum tlv_vote *result_vote)
  128. {
  129. if (node_list_size(nodes) == 0) {
  130. /*
  131. * Empty node list shouldn't happen
  132. */
  133. qnetd_log(LOG_ERR, "ffsplit: Received empty config node list for client %s",
  134. client->addr_str);
  135. return (TLV_REPLY_ERROR_CODE_INVALID_CONFIG_NODE_LIST);
  136. }
  137. if (node_list_find_node_id(nodes, client->node_id) == NULL) {
  138. /*
  139. * Current node is not in node list
  140. */
  141. qnetd_log(LOG_ERR, "ffsplit: Received config node list without client %s",
  142. client->addr_str);
  143. return (TLV_REPLY_ERROR_CODE_INVALID_CONFIG_NODE_LIST);
  144. }
  145. if (initial || node_list_size(&client->last_membership_node_list) == 0) {
  146. /*
  147. * Initial node list -> membership is going to be send by client
  148. */
  149. *result_vote = TLV_VOTE_ASK_LATER;
  150. } else {
  151. *result_vote = qnetd_algo_ffsplit_do(client, nodes, &client->last_membership_node_list);
  152. }
  153. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  154. }
  155. /*
  156. * Called after client sent membership node list.
  157. * All client fields are already set. Nodes is actual node list.
  158. * msg_seq_num is 32-bit number set by client. If client sent config file version,
  159. * config_version_set is set to 1 and config_version contains valid config file version.
  160. * ring_id and quorate are copied from client votequorum callback.
  161. *
  162. * Function has to return result_vote. This can be one of ack/nack, ask_later (client
  163. * should ask later for a vote) or wait_for_reply (client should wait for reply).
  164. *
  165. * Return TLV_REPLY_ERROR_CODE_NO_ERROR on success, different TLV_REPLY_ERROR_CODE_*
  166. * on failure (error is send back to client)
  167. */
  168. enum tlv_reply_error_code
  169. qnetd_algo_ffsplit_membership_node_list_received(struct qnetd_client *client,
  170. uint32_t msg_seq_num, const struct tlv_ring_id *ring_id,
  171. const struct node_list *nodes, enum tlv_vote *result_vote)
  172. {
  173. if (node_list_size(nodes) == 0) {
  174. /*
  175. * Empty node list shouldn't happen
  176. */
  177. qnetd_log(LOG_ERR, "ffsplit: Received empty membership node list for client %s",
  178. client->addr_str);
  179. return (TLV_REPLY_ERROR_CODE_INVALID_MEMBERSHIP_NODE_LIST);
  180. }
  181. if (node_list_find_node_id(nodes, client->node_id) == NULL) {
  182. /*
  183. * Current node is not in node list
  184. */
  185. qnetd_log(LOG_ERR, "ffsplit: Received membership node list without client %s",
  186. client->addr_str);
  187. return (TLV_REPLY_ERROR_CODE_INVALID_MEMBERSHIP_NODE_LIST);
  188. }
  189. if (node_list_size(&client->configuration_node_list) == 0) {
  190. /*
  191. * Config node list not received -> it's going to be sent later
  192. */
  193. *result_vote = TLV_VOTE_ASK_LATER;
  194. } else {
  195. *result_vote = qnetd_algo_ffsplit_do(client, &client->configuration_node_list, nodes);
  196. }
  197. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  198. }
  199. enum tlv_reply_error_code
  200. qnetd_algo_ffsplit_quorum_node_list_received(struct qnetd_client *client,
  201. uint32_t msg_seq_num, enum tlv_quorate quorate, const struct node_list *nodes,
  202. enum tlv_vote *result_vote)
  203. {
  204. /*
  205. * Quorum node list is informative -> no change
  206. */
  207. *result_vote = TLV_VOTE_NO_CHANGE;
  208. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  209. }
  210. void
  211. qnetd_algo_ffsplit_client_disconnect(struct qnetd_client *client, int server_going_down)
  212. {
  213. if (qnetd_cluster_size(client->cluster) == 1) {
  214. /*
  215. * Last client in the cluster
  216. */
  217. free(client->cluster->algorithm_data);
  218. }
  219. }
  220. enum tlv_reply_error_code
  221. qnetd_algo_ffsplit_ask_for_vote_received(struct qnetd_client *client, uint32_t msg_seq_num,
  222. enum tlv_vote *result_vote)
  223. {
  224. return (TLV_REPLY_ERROR_CODE_UNSUPPORTED_DECISION_ALGORITHM_MESSAGE);
  225. }
  226. enum tlv_reply_error_code
  227. qnetd_algo_ffsplit_vote_info_reply_received(struct qnetd_client *client, uint32_t msg_seq_num)
  228. {
  229. return (TLV_REPLY_ERROR_CODE_UNSUPPORTED_DECISION_ALGORITHM_MESSAGE);
  230. }
  231. enum tlv_reply_error_code
  232. qnetd_algo_ffsplit_timer_callback(struct qnetd_client *client, int *reschedule_timer,
  233. int *send_vote, enum tlv_vote *result_vote)
  234. {
  235. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  236. }
  237. static struct qnetd_algorithm qnetd_algo_ffsplit = {
  238. .init = qnetd_algo_ffsplit_client_init,
  239. .config_node_list_received = qnetd_algo_ffsplit_config_node_list_received,
  240. .membership_node_list_received = qnetd_algo_ffsplit_membership_node_list_received,
  241. .quorum_node_list_received = qnetd_algo_ffsplit_quorum_node_list_received,
  242. .client_disconnect = qnetd_algo_ffsplit_client_disconnect,
  243. .ask_for_vote_received = qnetd_algo_ffsplit_ask_for_vote_received,
  244. .vote_info_reply_received = qnetd_algo_ffsplit_vote_info_reply_received,
  245. .timer_callback = qnetd_algo_ffsplit_timer_callback,
  246. };
  247. enum tlv_reply_error_code qnetd_algo_ffsplit_register()
  248. {
  249. return (qnetd_algorithm_register(TLV_DECISION_ALGORITHM_TYPE_FFSPLIT, &qnetd_algo_ffsplit));
  250. }