vsf_ykd.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555
  1. /*
  2. * Copyright (c) 2005 MontaVista Software, Inc.
  3. * Copyright (c) 2006-2009 Red Hat, Inc.
  4. *
  5. * All rights reserved.
  6. *
  7. * Author: Steven Dake (sdake@redhat.com)
  8. *
  9. * This software licensed under BSD license, the text of which follows:
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above copyright notice,
  15. * this list of conditions and the following disclaimer.
  16. * - Redistributions in binary form must reproduce the above copyright notice,
  17. * this list of conditions and the following disclaimer in the documentation
  18. * and/or other materials provided with the distribution.
  19. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  20. * contributors may be used to endorse or promote products derived from this
  21. * software without specific prior written permission.
  22. *
  23. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  24. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  27. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  28. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  29. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  30. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  31. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  32. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  33. * THE POSSIBILITY OF SUCH DAMAGE.
  34. */
  35. #include <config.h>
  36. #include <assert.h>
  37. #include <pwd.h>
  38. #include <grp.h>
  39. #include <sys/types.h>
  40. #include <sys/poll.h>
  41. #include <sys/uio.h>
  42. #include <sys/mman.h>
  43. #include <sys/socket.h>
  44. #include <sys/un.h>
  45. #include <sys/time.h>
  46. #include <sys/resource.h>
  47. #include <netinet/in.h>
  48. #include <arpa/inet.h>
  49. #include <unistd.h>
  50. #include <fcntl.h>
  51. #include <stdlib.h>
  52. #include <stdio.h>
  53. #include <errno.h>
  54. #include <signal.h>
  55. #include <sched.h>
  56. #include <time.h>
  57. #include <corosync/engine/logsys.h>
  58. #include <corosync/ipc_gen.h>
  59. #include <corosync/engine/coroapi.h>
  60. #include <corosync/engine/quorum.h>
  61. #include <corosync/swab.h>
  62. #include <corosync/lcr/lcr_comp.h>
  63. LOGSYS_DECLARE_SUBSYS ("YKD", LOG_INFO);
  64. #define YKD_PROCESSOR_COUNT_MAX 32
  65. enum ykd_header_values {
  66. YKD_HEADER_SENDSTATE = 0,
  67. YKD_HEADER_ATTEMPT = 1
  68. };
  69. enum ykd_mode {
  70. YKD_MODE_SENDSTATE = 0,
  71. YKD_MODE_ATTEMPT = 1
  72. };
  73. struct ykd_header {
  74. int id;
  75. };
  76. struct ykd_session {
  77. unsigned int member_list[YKD_PROCESSOR_COUNT_MAX];
  78. int member_list_entries;
  79. int session_id;
  80. };
  81. struct ykd_state {
  82. struct ykd_session last_primary;
  83. struct ykd_session last_formed[YKD_PROCESSOR_COUNT_MAX];
  84. int last_formed_entries;
  85. struct ykd_session ambiguous_sessions[YKD_PROCESSOR_COUNT_MAX];
  86. int ambiguous_sessions_entries;
  87. int session_id;
  88. };
  89. struct state_received {
  90. unsigned int nodeid;
  91. int received;
  92. struct ykd_state ykd_state;
  93. };
  94. struct ykd_state ykd_state;
  95. static hdb_handle_t ykd_group_handle;
  96. static struct state_received state_received_confchg[YKD_PROCESSOR_COUNT_MAX];
  97. static int state_received_confchg_entries;
  98. static struct state_received state_received_process[YKD_PROCESSOR_COUNT_MAX];
  99. static int state_received_process_entries;
  100. static enum ykd_mode ykd_mode;
  101. static unsigned int view_list[YKD_PROCESSOR_COUNT_MAX];
  102. static int view_list_entries;
  103. static int session_id_max;
  104. static struct ykd_session *last_primary_max;
  105. static struct ykd_session ambiguous_sessions_max[YKD_PROCESSOR_COUNT_MAX];
  106. static int ambiguous_sessions_max_entries;
  107. static int primary_designated = 0;
  108. static struct memb_ring_id ykd_ring_id;
  109. static void *ykd_attempt_send_callback_token_handle = 0;
  110. static void *ykd_state_send_callback_token_handle = 0;
  111. static struct corosync_api_v1 *api;
  112. static void (*ykd_primary_callback_fn) (
  113. const unsigned int *view_list,
  114. size_t view_list_entries,
  115. int primary_designated,
  116. struct memb_ring_id *ring_id) = NULL;
  117. static void ykd_state_init (void)
  118. {
  119. ykd_state.session_id = 0;
  120. ykd_state.last_formed_entries = 0;
  121. ykd_state.ambiguous_sessions_entries = 0;
  122. ykd_state.last_primary.session_id = 0;
  123. ykd_state.last_primary.member_list_entries = 0;
  124. }
  125. static int ykd_state_send_msg (enum totem_callback_token_type type,
  126. const void *context)
  127. {
  128. struct iovec iovec[2];
  129. struct ykd_header header;
  130. int res;
  131. header.id = YKD_HEADER_SENDSTATE;
  132. iovec[0].iov_base = (char *)&header;
  133. iovec[0].iov_len = sizeof (struct ykd_header);
  134. iovec[1].iov_base = (char *)&ykd_state;
  135. iovec[1].iov_len = sizeof (struct ykd_state);
  136. res = api->tpg_joined_mcast (ykd_group_handle, iovec, 2,
  137. TOTEM_AGREED);
  138. return (res);
  139. }
  140. static void ykd_state_send (void)
  141. {
  142. api->totem_callback_token_create (
  143. &ykd_state_send_callback_token_handle,
  144. TOTEM_CALLBACK_TOKEN_SENT,
  145. 1, /* delete after callback */
  146. ykd_state_send_msg,
  147. NULL);
  148. }
  149. static int ykd_attempt_send_msg (enum totem_callback_token_type type,
  150. const void *context)
  151. {
  152. struct iovec iovec;
  153. struct ykd_header header;
  154. int res;
  155. header.id = YKD_HEADER_SENDSTATE;
  156. iovec.iov_base = (char *)&header;
  157. iovec.iov_len = sizeof (struct ykd_header);
  158. res = api->tpg_joined_mcast (ykd_group_handle, &iovec, 1,
  159. TOTEM_AGREED);
  160. return (res);
  161. }
  162. static void ykd_attempt_send (void)
  163. {
  164. api->totem_callback_token_create (
  165. &ykd_attempt_send_callback_token_handle,
  166. TOTEM_CALLBACK_TOKEN_SENT,
  167. 1, /* delete after callback */
  168. ykd_attempt_send_msg,
  169. NULL);
  170. }
  171. static void compute (void)
  172. {
  173. int i;
  174. int j;
  175. session_id_max = 0;
  176. last_primary_max = &state_received_process[0].ykd_state.last_primary;
  177. ambiguous_sessions_max_entries = 0;
  178. for (i = 0; i < state_received_process_entries; i++) {
  179. /*
  180. * Calculate maximum session id
  181. */
  182. if (state_received_process[i].ykd_state.session_id > session_id_max) {
  183. session_id_max = state_received_process[i].ykd_state.session_id;
  184. }
  185. /*
  186. * Calculate maximum primary id
  187. */
  188. if (state_received_process[i].ykd_state.last_primary.session_id > last_primary_max->session_id) {
  189. last_primary_max = &state_received_process[i].ykd_state.last_primary;
  190. }
  191. /*
  192. * generate the maximum ambiguous sessions list
  193. */
  194. for (j = 0; j < state_received_process[i].ykd_state.ambiguous_sessions_entries; j++) {
  195. if (state_received_process[i].ykd_state.ambiguous_sessions[j].session_id > last_primary_max->session_id) {
  196. memcpy (&ambiguous_sessions_max[ambiguous_sessions_max_entries],
  197. &state_received_process[i].ykd_state.ambiguous_sessions[j],
  198. sizeof (struct ykd_session));
  199. ambiguous_sessions_max_entries += 1;
  200. }
  201. }
  202. }
  203. }
  204. static int subquorum (
  205. unsigned int *member_list,
  206. int member_list_entries,
  207. struct ykd_session *session)
  208. {
  209. int intersections = 0;
  210. int i;
  211. int j;
  212. for (i = 0; i < member_list_entries; i++) {
  213. for (j = 0; j < session->member_list_entries; j++) {
  214. if (member_list[i] == session->member_list[j]) {
  215. intersections += 1;
  216. }
  217. }
  218. }
  219. /*
  220. * even split
  221. */
  222. if (intersections == (session->member_list_entries - intersections)) {
  223. return (1);
  224. } else
  225. /*
  226. * majority split
  227. */
  228. if (intersections > (session->member_list_entries - intersections)) {
  229. return (1);
  230. }
  231. return (0);
  232. }
  233. static int decide (void)
  234. {
  235. int i;
  236. /*
  237. * Determine if there is a subquorum
  238. */
  239. if (subquorum (view_list, view_list_entries, last_primary_max) == 0) {
  240. return (0);
  241. }
  242. for (i = 0; i < ambiguous_sessions_max_entries; i++) {
  243. if (subquorum (view_list, view_list_entries, &ambiguous_sessions_max[i]) == 0) {
  244. return (0);
  245. }
  246. }
  247. return (1);
  248. }
  249. static void ykd_session_endian_convert (struct ykd_session *ykd_session)
  250. {
  251. int i;
  252. ykd_session->member_list_entries =
  253. swab32 (ykd_session->member_list_entries);
  254. ykd_session->session_id = swab32 (ykd_session->session_id);
  255. for (i = 0; i < ykd_session->member_list_entries; i++) {
  256. ykd_session->member_list[i] =
  257. swab32 (ykd_session->member_list[i]);
  258. }
  259. }
  260. static void ykd_state_endian_convert (struct ykd_state *ykd_state)
  261. {
  262. int i;
  263. ykd_session_endian_convert (&ykd_state->last_primary);
  264. ykd_state->last_formed_entries = swab32 (ykd_state->last_formed_entries);
  265. ykd_state->ambiguous_sessions_entries = swab32 (ykd_state->ambiguous_sessions_entries);
  266. ykd_state->session_id = swab32 (ykd_state->session_id);
  267. for (i = 0; i < ykd_state->last_formed_entries; i++) {
  268. ykd_session_endian_convert (&ykd_state->last_formed[i]);
  269. }
  270. for (i = 0; i < ykd_state->ambiguous_sessions_entries; i++) {
  271. ykd_session_endian_convert (&ykd_state->ambiguous_sessions[i]);
  272. }
  273. }
  274. static void ykd_deliver_fn (
  275. unsigned int nodeid,
  276. const struct iovec *iovec,
  277. unsigned int iov_len,
  278. int endian_conversion_required)
  279. {
  280. int all_received = 1;
  281. int state_position = 0;
  282. int i;
  283. char *msg_state = (char *)(iovec->iov_base) + sizeof (struct ykd_header);
  284. /*
  285. * If this is a localhost address, this node is always primary
  286. */
  287. #ifdef TODO
  288. if (totemip_localhost_check (source_addr)) {
  289. log_printf (LOG_LEVEL_NOTICE,
  290. "This processor is within the primary component.\n");
  291. primary_designated = 1;
  292. ykd_primary_callback_fn (
  293. view_list,
  294. view_list_entries,
  295. primary_designated,
  296. &ykd_ring_id);
  297. return;
  298. }
  299. #endif
  300. if (endian_conversion_required &&
  301. (iovec->iov_len > sizeof (struct ykd_header))) {
  302. ykd_state_endian_convert ((struct ykd_state *)msg_state);
  303. }
  304. /*
  305. * Set completion for source_addr's address
  306. */
  307. for (state_position = 0; state_position < state_received_confchg_entries; state_position++) {
  308. if (nodeid == state_received_process[state_position].nodeid) {
  309. /*
  310. * State position contains the address of the state to modify
  311. * This may be used later by the other algorithms
  312. */
  313. state_received_process[state_position].received = 1;
  314. break;
  315. }
  316. }
  317. /*
  318. * Test if all nodes have submitted their state data
  319. */
  320. for (i = 0; i < state_received_confchg_entries; i++) {
  321. if (state_received_process[i].received == 0) {
  322. all_received = 0;
  323. }
  324. }
  325. switch (ykd_mode) {
  326. case YKD_MODE_SENDSTATE:
  327. assert (iovec->iov_len > sizeof (struct ykd_header));
  328. /*
  329. * Copy state information for the sending processor
  330. */
  331. memcpy (&state_received_process[state_position].ykd_state,
  332. msg_state, sizeof (struct ykd_state));
  333. /*
  334. * Try to form a component
  335. */
  336. if (all_received) {
  337. for (i = 0; i < state_received_confchg_entries; i++) {
  338. state_received_process[i].received = 0;
  339. }
  340. ykd_mode = YKD_MODE_ATTEMPT;
  341. // TODO resolve optimizes for failure conditions during ykd calculation
  342. // resolve();
  343. compute();
  344. if (decide ()) {
  345. ykd_state.session_id = session_id_max + 1;
  346. memcpy (ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list,
  347. view_list, sizeof (unsigned int) * view_list_entries);
  348. ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list_entries = view_list_entries;
  349. ykd_state.ambiguous_sessions_entries += 1;
  350. ykd_attempt_send();
  351. }
  352. }
  353. break;
  354. case YKD_MODE_ATTEMPT:
  355. if (all_received) {
  356. log_printf (LOG_LEVEL_NOTICE,
  357. "This processor is within the primary component.\n");
  358. primary_designated = 1;
  359. ykd_primary_callback_fn (
  360. view_list,
  361. view_list_entries,
  362. primary_designated,
  363. &ykd_ring_id);
  364. memcpy (ykd_state.last_primary.member_list, view_list, sizeof (view_list));
  365. ykd_state.last_primary.member_list_entries = view_list_entries;
  366. ykd_state.last_primary.session_id = ykd_state.session_id;
  367. ykd_state.ambiguous_sessions_entries = 0;
  368. }
  369. break;
  370. }
  371. }
  372. int first_run = 1;
  373. static void ykd_confchg_fn (
  374. enum totem_configuration_type configuration_type,
  375. const unsigned int *member_list, size_t member_list_entries,
  376. const unsigned int *left_list, size_t left_list_entries,
  377. const unsigned int *joined_list, size_t joined_list_entries,
  378. const struct memb_ring_id *ring_id)
  379. {
  380. int i;
  381. if (configuration_type != TOTEM_CONFIGURATION_REGULAR) {
  382. return;
  383. }
  384. memcpy (&ykd_ring_id, ring_id, sizeof (struct memb_ring_id));
  385. if (first_run) {
  386. ykd_state.last_primary.member_list[0] = api->totem_nodeid_get();
  387. ykd_state.last_primary.member_list_entries = 1;
  388. ykd_state.last_primary.session_id = 0;
  389. first_run = 0;
  390. }
  391. memcpy (view_list, member_list,
  392. member_list_entries * sizeof (unsigned int));
  393. view_list_entries = member_list_entries;
  394. ykd_mode = YKD_MODE_SENDSTATE;
  395. primary_designated = 0;
  396. ykd_primary_callback_fn (
  397. view_list,
  398. view_list_entries,
  399. primary_designated,
  400. &ykd_ring_id);
  401. memset (&state_received_confchg, 0, sizeof (state_received_confchg));
  402. for (i = 0; i < member_list_entries; i++) {
  403. state_received_confchg[i].nodeid = member_list[i];
  404. state_received_confchg[i].received = 0;
  405. }
  406. memcpy (state_received_process, state_received_confchg,
  407. sizeof (state_received_confchg));
  408. state_received_confchg_entries = member_list_entries;
  409. state_received_process_entries = member_list_entries;
  410. ykd_state_send ();
  411. }
  412. struct corosync_tpg_group ykd_group = {
  413. .group = "ykd",
  414. .group_len = 3
  415. };
  416. static void ykd_init (
  417. struct corosync_api_v1 *corosync_api,
  418. quorum_set_quorate_fn_t set_primary)
  419. {
  420. ykd_primary_callback_fn = set_primary;
  421. api = corosync_api;
  422. api->tpg_init (
  423. &ykd_group_handle,
  424. ykd_deliver_fn,
  425. ykd_confchg_fn);
  426. api->tpg_join (
  427. ykd_group_handle,
  428. &ykd_group,
  429. 1);
  430. ykd_state_init ();
  431. }
  432. /*
  433. * lcrso object definition
  434. */
  435. static struct quorum_services_api_ver1 vsf_ykd_iface_ver0 = {
  436. .init = ykd_init,
  437. };
  438. static struct lcr_iface corosync_vsf_ykd_ver0[1] = {
  439. {
  440. .name = "corosync_quorum_ykd",
  441. .version = 0,
  442. .versions_replace = 0,
  443. .versions_replace_count = 0,
  444. .dependencies = 0,
  445. .dependency_count = 0,
  446. .constructor = NULL,
  447. .destructor = NULL,
  448. .interfaces = (void **)(void *)&vsf_ykd_iface_ver0,
  449. }
  450. };
  451. static struct lcr_comp vsf_ykd_comp_ver0 = {
  452. .iface_count = 1,
  453. .ifaces = corosync_vsf_ykd_ver0
  454. };
  455. __attribute__ ((constructor)) static void vsf_ykd_comp_register (void) {
  456. lcr_component_register (&vsf_ykd_comp_ver0);
  457. }