qnetd-algo-ffsplit.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813
  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-log-debug.h"
  39. #include "qnetd-cluster-list.h"
  40. #include "qnetd-cluster.h"
  41. #include "qnetd-client-send.h"
  42. enum qnetd_algo_ffsplit_cluster_state {
  43. QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_CHANGE,
  44. QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_STABLE_MEMBERSHIP,
  45. QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_NACKS,
  46. QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_ACKS,
  47. };
  48. struct qnetd_algo_ffsplit_cluster_data {
  49. enum qnetd_algo_ffsplit_cluster_state cluster_state;
  50. const struct node_list *quorate_partition_node_list;
  51. };
  52. enum qnetd_algo_ffsplit_client_state {
  53. QNETD_ALGO_FFSPLIT_CLIENT_STATE_WAITING_FOR_CHANGE,
  54. QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK,
  55. QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK,
  56. };
  57. struct qnetd_algo_ffsplit_client_data {
  58. enum qnetd_algo_ffsplit_client_state client_state;
  59. uint32_t vote_info_expected_seq_num;
  60. };
  61. enum tlv_reply_error_code
  62. qnetd_algo_ffsplit_client_init(struct qnetd_client *client)
  63. {
  64. struct qnetd_algo_ffsplit_cluster_data *cluster_data;
  65. struct qnetd_algo_ffsplit_client_data *client_data;
  66. if (qnetd_cluster_size(client->cluster) == 1) {
  67. cluster_data = malloc(sizeof(*cluster_data));
  68. if (cluster_data == NULL) {
  69. qnetd_log(LOG_ERR, "ffsplit: Can't initialize cluster data for client %s",
  70. client->addr_str);
  71. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  72. }
  73. memset(cluster_data, 0, sizeof(*cluster_data));
  74. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_CHANGE;
  75. cluster_data->quorate_partition_node_list = NULL;
  76. client->cluster->algorithm_data = cluster_data;
  77. }
  78. client_data = malloc(sizeof(*client_data));
  79. if (client_data == NULL) {
  80. qnetd_log(LOG_ERR, "ffsplit: Can't initialize node data for client %s",
  81. client->addr_str);
  82. return (TLV_REPLY_ERROR_CODE_INTERNAL_ERROR);
  83. }
  84. memset(client_data, 0, sizeof(*client_data));
  85. client_data->client_state = QNETD_ALGO_FFSPLIT_CLIENT_STATE_WAITING_FOR_CHANGE;
  86. client->algorithm_data = client_data;
  87. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  88. }
  89. static int
  90. qnetd_algo_ffsplit_is_prefered_partition(const struct qnetd_client *client,
  91. const struct node_list *config_node_list, const struct node_list *membership_node_list)
  92. {
  93. uint32_t prefered_node_id;
  94. struct node_list_entry *node_entry;
  95. int case_processed;
  96. prefered_node_id = 0;
  97. case_processed = 0;
  98. switch (client->tie_breaker.mode) {
  99. case TLV_TIE_BREAKER_MODE_LOWEST:
  100. node_entry = TAILQ_FIRST(config_node_list);
  101. prefered_node_id = node_entry->node_id;
  102. TAILQ_FOREACH(node_entry, config_node_list, entries) {
  103. if (node_entry->node_id < prefered_node_id) {
  104. prefered_node_id = node_entry->node_id;
  105. }
  106. }
  107. case_processed = 1;
  108. break;
  109. case TLV_TIE_BREAKER_MODE_HIGHEST:
  110. node_entry = TAILQ_FIRST(config_node_list);
  111. prefered_node_id = node_entry->node_id;
  112. TAILQ_FOREACH(node_entry, config_node_list, entries) {
  113. if (node_entry->node_id > prefered_node_id) {
  114. prefered_node_id = node_entry->node_id;
  115. }
  116. }
  117. case_processed = 1;
  118. break;
  119. case TLV_TIE_BREAKER_MODE_NODE_ID:
  120. prefered_node_id = client->tie_breaker.node_id;
  121. case_processed = 1;
  122. break;
  123. }
  124. if (!case_processed) {
  125. qnetd_log(LOG_CRIT, "qnetd_algo_ffsplit_is_prefered_partition unprocessed "
  126. "tie_breaker.mode");
  127. exit(1);
  128. }
  129. return (node_list_find_node_id(membership_node_list, prefered_node_id) != NULL);
  130. }
  131. static int
  132. qnetd_algo_ffsplit_is_membership_stable(const struct qnetd_client *client, int client_leaving,
  133. const struct tlv_ring_id *ring_id, const struct node_list *config_node_list,
  134. const struct node_list *membership_node_list)
  135. {
  136. const struct qnetd_client *iter_client1, *iter_client2;
  137. const struct node_list *config_node_list1, *config_node_list2;
  138. const struct node_list *membership_node_list1, *membership_node_list2;
  139. const struct node_list_entry *iter_node1, *iter_node2;
  140. const struct node_list_entry *iter_node3, *iter_node4;
  141. const struct tlv_ring_id *ring_id1, *ring_id2;
  142. /*
  143. * Test if all active clients share same config list.
  144. */
  145. TAILQ_FOREACH(iter_client1, &client->cluster->client_list, cluster_entries) {
  146. TAILQ_FOREACH(iter_client2, &client->cluster->client_list, cluster_entries) {
  147. if (iter_client1 == iter_client2) {
  148. continue;
  149. }
  150. if (iter_client1->node_id == client->node_id) {
  151. if (client_leaving) {
  152. continue;
  153. }
  154. config_node_list1 = config_node_list;
  155. } else {
  156. config_node_list1 = &iter_client1->configuration_node_list;
  157. }
  158. if (iter_client2->node_id == client->node_id) {
  159. if (client_leaving) {
  160. continue;
  161. }
  162. config_node_list2 = config_node_list;
  163. } else {
  164. config_node_list2 = &iter_client2->configuration_node_list;
  165. }
  166. /*
  167. * Walk thru all node ids in given config node list...
  168. */
  169. TAILQ_FOREACH(iter_node1, config_node_list1, entries) {
  170. /*
  171. * ... and try to find given node id in other list
  172. */
  173. iter_node2 = node_list_find_node_id(config_node_list2, iter_node1->node_id);
  174. if (iter_node2 == NULL) {
  175. /*
  176. * Node with iter_node1->node_id was not found in
  177. * config_node_list2 -> lists doesn't match
  178. */
  179. return (0);
  180. }
  181. }
  182. }
  183. }
  184. /*
  185. * Test if same partitions share same ring ids and membership node list
  186. */
  187. TAILQ_FOREACH(iter_client1, &client->cluster->client_list, cluster_entries) {
  188. if (iter_client1->node_id == client->node_id) {
  189. if (client_leaving) {
  190. continue;
  191. }
  192. membership_node_list1 = membership_node_list;
  193. ring_id1 = ring_id;
  194. } else {
  195. membership_node_list1 = &iter_client1->last_membership_node_list;
  196. ring_id1 = &iter_client1->last_ring_id;
  197. }
  198. /*
  199. * Walk thru all memberships nodes
  200. */
  201. TAILQ_FOREACH(iter_node1, membership_node_list1, entries) {
  202. /*
  203. * try to find client with given node id
  204. */
  205. iter_client2 = qnetd_cluster_find_client_by_node_id(client->cluster,
  206. iter_node1->node_id);
  207. if (iter_client2 == NULL) {
  208. /*
  209. * Client with given id is not connected
  210. */
  211. continue;
  212. }
  213. if (iter_client2->node_id == client->node_id) {
  214. if (client_leaving) {
  215. continue;
  216. }
  217. membership_node_list2 = membership_node_list;
  218. ring_id2 = ring_id;
  219. } else {
  220. membership_node_list2 = &iter_client2->last_membership_node_list;
  221. ring_id2 = &iter_client2->last_ring_id;
  222. }
  223. /*
  224. * Compare ring ids
  225. */
  226. if (!tlv_ring_id_eq(ring_id1, ring_id2)) {
  227. return (0);
  228. }
  229. /*
  230. * Now compare that membership node list equals, so walk thru all
  231. * members ...
  232. */
  233. TAILQ_FOREACH(iter_node3, membership_node_list1, entries) {
  234. /*
  235. * ... and try to find given node id in other membership node list
  236. */
  237. iter_node4 = node_list_find_node_id(membership_node_list2, iter_node3->node_id);
  238. if (iter_node4 == NULL) {
  239. /*
  240. * Node with iter_node3->node_id was not found in
  241. * membership_node_list2 -> lists doesn't match
  242. */
  243. return (0);
  244. }
  245. }
  246. }
  247. }
  248. return (1);
  249. }
  250. static size_t
  251. qnetd_algo_ffsplit_no_active_clients_in_partition(const struct qnetd_client *client,
  252. const struct node_list *membership_node_list)
  253. {
  254. const struct node_list_entry *iter_node;
  255. const struct qnetd_client *iter_client;
  256. size_t res;
  257. res = 0;
  258. if (client == NULL || membership_node_list == NULL) {
  259. return (0);
  260. }
  261. TAILQ_FOREACH(iter_node, membership_node_list, entries) {
  262. iter_client = qnetd_cluster_find_client_by_node_id(client->cluster,
  263. iter_node->node_id);
  264. if (iter_client != NULL) {
  265. res++;
  266. }
  267. }
  268. return (res);
  269. }
  270. /*
  271. * Compares two partitions. Return 1 if client1, config_node_list1, membership_node_list1 is
  272. * "better" than client2, config_node_list2, membership_node_list2
  273. */
  274. static int
  275. qnetd_algo_ffsplit_partition_cmp(const struct qnetd_client *client1,
  276. const struct node_list *config_node_list1, const struct node_list *membership_node_list1,
  277. const struct qnetd_client *client2,
  278. const struct node_list *config_node_list2, const struct node_list *membership_node_list2)
  279. {
  280. size_t part1_active_clients, part2_active_clients;
  281. int res;
  282. res = -1;
  283. if (node_list_size(config_node_list1) % 2 != 0) {
  284. /*
  285. * Odd clusters never split into 50:50.
  286. */
  287. if (node_list_size(membership_node_list1) > node_list_size(config_node_list1) / 2) {
  288. res = 1; goto exit_res;
  289. } else {
  290. res = 0; goto exit_res;
  291. }
  292. } else {
  293. if (node_list_size(membership_node_list1) > node_list_size(config_node_list1) / 2) {
  294. res = 1; goto exit_res;
  295. } else if (node_list_size(membership_node_list1) < node_list_size(config_node_list1) / 2) {
  296. res = 0; goto exit_res;
  297. }
  298. /*
  299. * 50:50 split
  300. */
  301. /*
  302. * Check how many active clients are in partitions
  303. */
  304. part1_active_clients = qnetd_algo_ffsplit_no_active_clients_in_partition(
  305. client1, membership_node_list1);
  306. part2_active_clients = qnetd_algo_ffsplit_no_active_clients_in_partition(
  307. client2, membership_node_list2);
  308. if (part1_active_clients > part2_active_clients) {
  309. res = 1; goto exit_res;
  310. } else if (part1_active_clients < part2_active_clients) {
  311. res = 0; goto exit_res;
  312. }
  313. /*
  314. * Number of active clients in both partitions equals. Use tie-breaker.
  315. */
  316. if (qnetd_algo_ffsplit_is_prefered_partition(client1, config_node_list1,
  317. membership_node_list1)) {
  318. res = 1; goto exit_res;
  319. } else {
  320. res = 0; goto exit_res;
  321. }
  322. }
  323. exit_res:
  324. if (res == -1) {
  325. qnetd_log(LOG_CRIT, "qnetd_algo_ffsplit_partition_cmp unhandled case");
  326. exit(1);
  327. /* NOTREACHED */
  328. }
  329. return (res);
  330. }
  331. /*
  332. * Select best partition for given client->cluster.
  333. * If there is no partition which could become quorate, NULL is returned
  334. */
  335. static const struct node_list *
  336. qnetd_algo_ffsplit_select_partition(const struct qnetd_client *client, int client_leaving,
  337. const struct node_list *config_node_list, const struct node_list *membership_node_list)
  338. {
  339. const struct qnetd_client *iter_client;
  340. const struct qnetd_client *best_client;
  341. const struct node_list *best_config_node_list, *best_membership_node_list;
  342. const struct node_list *iter_config_node_list, *iter_membership_node_list;
  343. best_client = NULL;
  344. best_config_node_list = best_membership_node_list = NULL;
  345. /*
  346. * Get highest score
  347. */
  348. TAILQ_FOREACH(iter_client, &client->cluster->client_list, cluster_entries) {
  349. if (iter_client->node_id == client->node_id) {
  350. if (client_leaving) {
  351. continue;
  352. }
  353. iter_config_node_list = config_node_list;
  354. iter_membership_node_list = membership_node_list;
  355. } else {
  356. iter_config_node_list = &iter_client->configuration_node_list;
  357. iter_membership_node_list = &iter_client->last_membership_node_list;
  358. }
  359. if (qnetd_algo_ffsplit_partition_cmp(iter_client, iter_config_node_list,
  360. iter_membership_node_list, best_client, best_config_node_list,
  361. best_membership_node_list) > 0) {
  362. best_client = iter_client;
  363. best_config_node_list = iter_config_node_list;
  364. best_membership_node_list = iter_membership_node_list;
  365. }
  366. }
  367. return (best_membership_node_list);
  368. }
  369. /*
  370. * Update state of all nodes to match quorate_partition_node_list
  371. */
  372. static void
  373. qnetd_algo_ffsplit_update_nodes_state(struct qnetd_client *client, int client_leaving,
  374. const struct node_list *quorate_partition_node_list)
  375. {
  376. const struct qnetd_client *iter_client;
  377. struct qnetd_algo_ffsplit_client_data *iter_client_data;
  378. TAILQ_FOREACH(iter_client, &client->cluster->client_list, cluster_entries) {
  379. iter_client_data = (struct qnetd_algo_ffsplit_client_data *)iter_client->algorithm_data;
  380. if (iter_client->node_id == client->node_id && client_leaving) {
  381. iter_client_data->client_state = QNETD_ALGO_FFSPLIT_CLIENT_STATE_WAITING_FOR_CHANGE;
  382. continue;
  383. }
  384. if (quorate_partition_node_list == NULL ||
  385. node_list_find_node_id(quorate_partition_node_list, iter_client->node_id) == NULL) {
  386. iter_client_data->client_state = QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK;
  387. } else {
  388. iter_client_data->client_state = QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK;
  389. }
  390. }
  391. }
  392. /*
  393. * Send vote info. If client_leaving is set, client is ignored. if send_acks
  394. * is set, only ACK votes are sent (nodes in QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK state),
  395. * otherwise only NACK votes are sent (nodes in QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK state)
  396. *
  397. * Returns number of send votes
  398. */
  399. static size_t
  400. qnetd_algo_ffsplit_send_votes(struct qnetd_client *client, int client_leaving,
  401. const struct tlv_ring_id *ring_id, int send_acks)
  402. {
  403. size_t sent_votes;
  404. struct qnetd_client *iter_client;
  405. struct qnetd_algo_ffsplit_client_data *iter_client_data;
  406. const struct tlv_ring_id *ring_id_to_send;
  407. enum tlv_vote vote_to_send;
  408. sent_votes = 0;
  409. TAILQ_FOREACH(iter_client, &client->cluster->client_list, cluster_entries) {
  410. if (iter_client->node_id == client->node_id) {
  411. if (client_leaving) {
  412. continue;
  413. }
  414. ring_id_to_send = ring_id;
  415. } else {
  416. ring_id_to_send = &iter_client->last_ring_id;
  417. }
  418. iter_client_data = (struct qnetd_algo_ffsplit_client_data *)iter_client->algorithm_data;
  419. vote_to_send = TLV_VOTE_UNDEFINED;
  420. if (send_acks) {
  421. if (iter_client_data->client_state == QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK) {
  422. vote_to_send = TLV_VOTE_ACK;
  423. }
  424. } else {
  425. if (iter_client_data->client_state == QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK) {
  426. vote_to_send = TLV_VOTE_NACK;
  427. }
  428. }
  429. if (vote_to_send != TLV_VOTE_UNDEFINED) {
  430. iter_client_data->vote_info_expected_seq_num++;
  431. sent_votes++;
  432. if (qnetd_client_send_vote_info(iter_client,
  433. iter_client_data->vote_info_expected_seq_num, ring_id_to_send,
  434. vote_to_send) == -1) {
  435. client->schedule_disconnect = 1;
  436. }
  437. }
  438. }
  439. return (sent_votes);
  440. }
  441. /*
  442. * Return number of clients in QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK state if sending_acks is
  443. * set or number of nodes in QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK state if sending_acks is
  444. * not set
  445. */
  446. static size_t
  447. qnetd_algo_ffsplit_no_clients_in_sending_state(struct qnetd_client *client, int sending_acks)
  448. {
  449. size_t no_clients;
  450. struct qnetd_client *iter_client;
  451. struct qnetd_algo_ffsplit_client_data *iter_client_data;
  452. no_clients = 0;
  453. TAILQ_FOREACH(iter_client, &client->cluster->client_list, cluster_entries) {
  454. iter_client_data = (struct qnetd_algo_ffsplit_client_data *)iter_client->algorithm_data;
  455. if (sending_acks &&
  456. iter_client_data->client_state == QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_ACK) {
  457. no_clients++;
  458. }
  459. if (!sending_acks &&
  460. iter_client_data->client_state == QNETD_ALGO_FFSPLIT_CLIENT_STATE_SENDING_NACK) {
  461. no_clients++;
  462. }
  463. }
  464. return (no_clients);
  465. }
  466. static enum tlv_vote
  467. qnetd_algo_ffsplit_do(struct qnetd_client *client, int client_leaving,
  468. const struct tlv_ring_id *ring_id, const struct node_list *config_node_list,
  469. const struct node_list *membership_node_list)
  470. {
  471. struct qnetd_algo_ffsplit_cluster_data *cluster_data;
  472. const struct node_list *quorate_partition_node_list;
  473. cluster_data = (struct qnetd_algo_ffsplit_cluster_data *)client->cluster->algorithm_data;
  474. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_STABLE_MEMBERSHIP;
  475. if (!qnetd_algo_ffsplit_is_membership_stable(client, client_leaving,
  476. ring_id, config_node_list, membership_node_list)) {
  477. /*
  478. * Wait until membership is stable
  479. */
  480. qnetd_log(LOG_DEBUG, "ffsplit: Membership for cluster %s is not yet stable", client->cluster_name);
  481. return (TLV_VOTE_WAIT_FOR_REPLY);
  482. }
  483. qnetd_log(LOG_DEBUG, "ffsplit: Membership for cluster %s is now stable", client->cluster_name);
  484. quorate_partition_node_list = qnetd_algo_ffsplit_select_partition(client, client_leaving,
  485. config_node_list, membership_node_list);
  486. cluster_data->quorate_partition_node_list = quorate_partition_node_list;
  487. if (quorate_partition_node_list == NULL) {
  488. qnetd_log(LOG_DEBUG, "ffsplit: No quorate partition was selected");
  489. } else {
  490. qnetd_log(LOG_DEBUG, "ffsplit: Quorate partition selected");
  491. qnetd_log_debug_dump_node_list(client, quorate_partition_node_list);
  492. }
  493. qnetd_algo_ffsplit_update_nodes_state(client, client_leaving, quorate_partition_node_list);
  494. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_NACKS;
  495. if (qnetd_algo_ffsplit_send_votes(client, client_leaving, ring_id, 0) == 0) {
  496. qnetd_log(LOG_DEBUG, "ffsplit: No client gets NACK");
  497. /*
  498. * No one gets nack -> send acks
  499. */
  500. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_ACKS;
  501. if (qnetd_algo_ffsplit_send_votes(client, client_leaving, ring_id, 1) == 0) {
  502. qnetd_log(LOG_DEBUG, "ffsplit: No client gets ACK");
  503. /*
  504. * No one gets acks -> finished
  505. */
  506. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_CHANGE;
  507. }
  508. }
  509. return (TLV_VOTE_NO_CHANGE);
  510. }
  511. enum tlv_reply_error_code
  512. qnetd_algo_ffsplit_config_node_list_received(struct qnetd_client *client,
  513. uint32_t msg_seq_num, int config_version_set, uint64_t config_version,
  514. const struct node_list *nodes, int initial, enum tlv_vote *result_vote)
  515. {
  516. if (node_list_size(nodes) == 0) {
  517. /*
  518. * Empty node list shouldn't happen
  519. */
  520. qnetd_log(LOG_ERR, "ffsplit: Received empty config node list for client %s",
  521. client->addr_str);
  522. return (TLV_REPLY_ERROR_CODE_INVALID_CONFIG_NODE_LIST);
  523. }
  524. if (node_list_find_node_id(nodes, client->node_id) == NULL) {
  525. /*
  526. * Current node is not in node list
  527. */
  528. qnetd_log(LOG_ERR, "ffsplit: Received config node list without client %s",
  529. client->addr_str);
  530. return (TLV_REPLY_ERROR_CODE_INVALID_CONFIG_NODE_LIST);
  531. }
  532. if (initial || node_list_size(&client->last_membership_node_list) == 0) {
  533. /*
  534. * Initial node list -> membership is going to be send by client
  535. */
  536. *result_vote = TLV_VOTE_ASK_LATER;
  537. } else {
  538. *result_vote = qnetd_algo_ffsplit_do(client, 0, &client->last_ring_id,
  539. nodes, &client->last_membership_node_list);
  540. }
  541. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  542. }
  543. /*
  544. * Called after client sent membership node list.
  545. * All client fields are already set. Nodes is actual node list.
  546. * msg_seq_num is 32-bit number set by client. If client sent config file version,
  547. * config_version_set is set to 1 and config_version contains valid config file version.
  548. * ring_id and quorate are copied from client votequorum callback.
  549. *
  550. * Function has to return result_vote. This can be one of ack/nack, ask_later (client
  551. * should ask later for a vote) or wait_for_reply (client should wait for reply).
  552. *
  553. * Return TLV_REPLY_ERROR_CODE_NO_ERROR on success, different TLV_REPLY_ERROR_CODE_*
  554. * on failure (error is send back to client)
  555. */
  556. enum tlv_reply_error_code
  557. qnetd_algo_ffsplit_membership_node_list_received(struct qnetd_client *client,
  558. uint32_t msg_seq_num, const struct tlv_ring_id *ring_id,
  559. const struct node_list *nodes, enum tlv_vote *result_vote)
  560. {
  561. if (node_list_size(nodes) == 0) {
  562. /*
  563. * Empty node list shouldn't happen
  564. */
  565. qnetd_log(LOG_ERR, "ffsplit: Received empty membership node list for client %s",
  566. client->addr_str);
  567. return (TLV_REPLY_ERROR_CODE_INVALID_MEMBERSHIP_NODE_LIST);
  568. }
  569. if (node_list_find_node_id(nodes, client->node_id) == NULL) {
  570. /*
  571. * Current node is not in node list
  572. */
  573. qnetd_log(LOG_ERR, "ffsplit: Received membership node list without client %s",
  574. client->addr_str);
  575. return (TLV_REPLY_ERROR_CODE_INVALID_MEMBERSHIP_NODE_LIST);
  576. }
  577. if (node_list_size(&client->configuration_node_list) == 0) {
  578. /*
  579. * Config node list not received -> it's going to be sent later
  580. */
  581. *result_vote = TLV_VOTE_ASK_LATER;
  582. } else {
  583. *result_vote = qnetd_algo_ffsplit_do(client, 0, ring_id,
  584. &client->configuration_node_list, nodes);
  585. }
  586. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  587. }
  588. enum tlv_reply_error_code
  589. qnetd_algo_ffsplit_quorum_node_list_received(struct qnetd_client *client,
  590. uint32_t msg_seq_num, enum tlv_quorate quorate, const struct node_list *nodes,
  591. enum tlv_vote *result_vote)
  592. {
  593. /*
  594. * Quorum node list is informative -> no change
  595. */
  596. *result_vote = TLV_VOTE_NO_CHANGE;
  597. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  598. }
  599. void
  600. qnetd_algo_ffsplit_client_disconnect(struct qnetd_client *client, int server_going_down)
  601. {
  602. (void)qnetd_algo_ffsplit_do(client, 1, &client->last_ring_id,
  603. &client->configuration_node_list, &client->last_membership_node_list);
  604. free(client->algorithm_data);
  605. if (qnetd_cluster_size(client->cluster) == 1) {
  606. /*
  607. * Last client in the cluster
  608. */
  609. free(client->cluster->algorithm_data);
  610. }
  611. }
  612. enum tlv_reply_error_code
  613. qnetd_algo_ffsplit_ask_for_vote_received(struct qnetd_client *client, uint32_t msg_seq_num,
  614. enum tlv_vote *result_vote)
  615. {
  616. /*
  617. * Ask for vote is not supported in current algorithm
  618. */
  619. return (TLV_REPLY_ERROR_CODE_UNSUPPORTED_DECISION_ALGORITHM_MESSAGE);
  620. }
  621. enum tlv_reply_error_code
  622. qnetd_algo_ffsplit_vote_info_reply_received(struct qnetd_client *client, uint32_t msg_seq_num)
  623. {
  624. struct qnetd_algo_ffsplit_cluster_data *cluster_data;
  625. struct qnetd_algo_ffsplit_client_data *client_data;
  626. cluster_data = (struct qnetd_algo_ffsplit_cluster_data *)client->cluster->algorithm_data;
  627. client_data = (struct qnetd_algo_ffsplit_client_data *)client->algorithm_data;
  628. if (client_data->vote_info_expected_seq_num != msg_seq_num) {
  629. qnetd_log(LOG_DEBUG, "ffsplit: Received old vote info reply from client %s",
  630. client->addr_str);
  631. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  632. }
  633. client_data->client_state = QNETD_ALGO_FFSPLIT_CLIENT_STATE_WAITING_FOR_CHANGE;
  634. if (cluster_data->cluster_state != QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_NACKS &&
  635. cluster_data->cluster_state != QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_ACKS) {
  636. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  637. }
  638. if (cluster_data->cluster_state == QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_NACKS) {
  639. if (qnetd_algo_ffsplit_no_clients_in_sending_state(client, 0) == 0) {
  640. qnetd_log(LOG_DEBUG, "ffsplit: All NACK votes sent for cluster %s",
  641. client->cluster_name);
  642. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_SENDING_ACKS;
  643. if (qnetd_algo_ffsplit_send_votes(client, 0, &client->last_ring_id, 1) == 0) {
  644. qnetd_log(LOG_DEBUG, "ffsplit: No client gets ACK");
  645. /*
  646. * No one gets acks -> finished
  647. */
  648. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_CHANGE;
  649. }
  650. }
  651. } else {
  652. if (qnetd_algo_ffsplit_no_clients_in_sending_state(client, 1) == 0) {
  653. qnetd_log(LOG_DEBUG, "ffsplit: All ACK votes sent for cluster %s",
  654. client->cluster_name);
  655. cluster_data->cluster_state = QNETD_ALGO_FFSPLIT_CLUSTER_STATE_WAITING_FOR_CHANGE;
  656. }
  657. }
  658. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  659. }
  660. enum tlv_reply_error_code
  661. qnetd_algo_ffsplit_timer_callback(struct qnetd_client *client, int *reschedule_timer,
  662. int *send_vote, enum tlv_vote *result_vote)
  663. {
  664. return (TLV_REPLY_ERROR_CODE_NO_ERROR);
  665. }
  666. static struct qnetd_algorithm qnetd_algo_ffsplit = {
  667. .init = qnetd_algo_ffsplit_client_init,
  668. .config_node_list_received = qnetd_algo_ffsplit_config_node_list_received,
  669. .membership_node_list_received = qnetd_algo_ffsplit_membership_node_list_received,
  670. .quorum_node_list_received = qnetd_algo_ffsplit_quorum_node_list_received,
  671. .client_disconnect = qnetd_algo_ffsplit_client_disconnect,
  672. .ask_for_vote_received = qnetd_algo_ffsplit_ask_for_vote_received,
  673. .vote_info_reply_received = qnetd_algo_ffsplit_vote_info_reply_received,
  674. .timer_callback = qnetd_algo_ffsplit_timer_callback,
  675. };
  676. enum tlv_reply_error_code qnetd_algo_ffsplit_register()
  677. {
  678. return (qnetd_algorithm_register(TLV_DECISION_ALGORITHM_TYPE_FFSPLIT, &qnetd_algo_ffsplit));
  679. }