vsf_ykd.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  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 <sched.h>
  55. #include <time.h>
  56. #include <corosync/engine/logsys.h>
  57. #include <corosync/corotypes.h>
  58. #include <corosync/coroipc_types.h>
  59. #include <corosync/mar_gen.h>
  60. #include <corosync/engine/coroapi.h>
  61. #include <corosync/engine/quorum.h>
  62. #include <corosync/swab.h>
  63. #include <corosync/lcr/lcr_comp.h>
  64. LOGSYS_DECLARE_SUBSYS ("YKD");
  65. #define YKD_PROCESSOR_COUNT_MAX 32
  66. enum ykd_header_values {
  67. YKD_HEADER_SENDSTATE = 0,
  68. YKD_HEADER_ATTEMPT = 1
  69. };
  70. enum ykd_mode {
  71. YKD_MODE_SENDSTATE = 0,
  72. YKD_MODE_ATTEMPT = 1
  73. };
  74. struct ykd_header {
  75. int id;
  76. };
  77. struct ykd_session {
  78. unsigned int member_list[YKD_PROCESSOR_COUNT_MAX];
  79. int member_list_entries;
  80. int session_id;
  81. };
  82. struct ykd_state {
  83. struct ykd_session last_primary;
  84. struct ykd_session last_formed[YKD_PROCESSOR_COUNT_MAX];
  85. int last_formed_entries;
  86. struct ykd_session ambiguous_sessions[YKD_PROCESSOR_COUNT_MAX];
  87. int ambiguous_sessions_entries;
  88. int session_id;
  89. };
  90. struct state_received {
  91. unsigned int nodeid;
  92. int received;
  93. struct ykd_state ykd_state;
  94. };
  95. struct ykd_state ykd_state;
  96. static hdb_handle_t ykd_group_handle;
  97. static struct state_received state_received_confchg[YKD_PROCESSOR_COUNT_MAX];
  98. static int state_received_confchg_entries;
  99. static struct state_received state_received_process[YKD_PROCESSOR_COUNT_MAX];
  100. static int state_received_process_entries;
  101. static enum ykd_mode ykd_mode;
  102. static unsigned int view_list[YKD_PROCESSOR_COUNT_MAX];
  103. static int view_list_entries;
  104. static int session_id_max;
  105. static struct ykd_session *last_primary_max;
  106. static struct ykd_session ambiguous_sessions_max[YKD_PROCESSOR_COUNT_MAX];
  107. static int ambiguous_sessions_max_entries;
  108. static int primary_designated = 0;
  109. static struct memb_ring_id ykd_ring_id;
  110. hdb_handle_t schedwrk_attempt_send_callback_handle;
  111. hdb_handle_t schedwrk_state_send_callback_handle;
  112. static struct corosync_api_v1 *api;
  113. static void (*ykd_primary_callback_fn) (
  114. const unsigned int *view_list,
  115. size_t view_list_entries,
  116. int primary_designated,
  117. struct memb_ring_id *ring_id) = NULL;
  118. static void ykd_state_init (void)
  119. {
  120. ykd_state.session_id = 0;
  121. ykd_state.last_formed_entries = 0;
  122. ykd_state.ambiguous_sessions_entries = 0;
  123. ykd_state.last_primary.session_id = 0;
  124. ykd_state.last_primary.member_list_entries = 0;
  125. }
  126. static int ykd_state_send_msg (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->schedwrk_create (
  143. &schedwrk_state_send_callback_handle,
  144. ykd_state_send_msg,
  145. NULL);
  146. }
  147. static int ykd_attempt_send_msg (const void *context)
  148. {
  149. struct iovec iovec;
  150. struct ykd_header header;
  151. int res;
  152. header.id = YKD_HEADER_SENDSTATE;
  153. iovec.iov_base = (char *)&header;
  154. iovec.iov_len = sizeof (struct ykd_header);
  155. res = api->tpg_joined_mcast (ykd_group_handle, &iovec, 1,
  156. TOTEM_AGREED);
  157. return (res);
  158. }
  159. static void ykd_attempt_send (void)
  160. {
  161. api->schedwrk_create (
  162. &schedwrk_attempt_send_callback_handle,
  163. ykd_attempt_send_msg,
  164. NULL);
  165. }
  166. static void compute (void)
  167. {
  168. int i;
  169. int j;
  170. session_id_max = 0;
  171. last_primary_max = &state_received_process[0].ykd_state.last_primary;
  172. ambiguous_sessions_max_entries = 0;
  173. for (i = 0; i < state_received_process_entries; i++) {
  174. /*
  175. * Calculate maximum session id
  176. */
  177. if (state_received_process[i].ykd_state.session_id > session_id_max) {
  178. session_id_max = state_received_process[i].ykd_state.session_id;
  179. }
  180. /*
  181. * Calculate maximum primary id
  182. */
  183. if (state_received_process[i].ykd_state.last_primary.session_id > last_primary_max->session_id) {
  184. last_primary_max = &state_received_process[i].ykd_state.last_primary;
  185. }
  186. /*
  187. * generate the maximum ambiguous sessions list
  188. */
  189. for (j = 0; j < state_received_process[i].ykd_state.ambiguous_sessions_entries; j++) {
  190. if (state_received_process[i].ykd_state.ambiguous_sessions[j].session_id > last_primary_max->session_id) {
  191. memcpy (&ambiguous_sessions_max[ambiguous_sessions_max_entries],
  192. &state_received_process[i].ykd_state.ambiguous_sessions[j],
  193. sizeof (struct ykd_session));
  194. ambiguous_sessions_max_entries += 1;
  195. }
  196. }
  197. }
  198. }
  199. static int subquorum (
  200. unsigned int *member_list,
  201. int member_list_entries,
  202. struct ykd_session *session)
  203. {
  204. int intersections = 0;
  205. int i;
  206. int j;
  207. for (i = 0; i < member_list_entries; i++) {
  208. for (j = 0; j < session->member_list_entries; j++) {
  209. if (member_list[i] == session->member_list[j]) {
  210. intersections += 1;
  211. }
  212. }
  213. }
  214. /*
  215. * even split
  216. */
  217. if (intersections == (session->member_list_entries - intersections)) {
  218. return (1);
  219. } else
  220. /*
  221. * majority split
  222. */
  223. if (intersections > (session->member_list_entries - intersections)) {
  224. return (1);
  225. }
  226. return (0);
  227. }
  228. static int decide (void)
  229. {
  230. int i;
  231. /*
  232. * Determine if there is a subquorum
  233. */
  234. if (subquorum (view_list, view_list_entries, last_primary_max) == 0) {
  235. return (0);
  236. }
  237. for (i = 0; i < ambiguous_sessions_max_entries; i++) {
  238. if (subquorum (view_list, view_list_entries, &ambiguous_sessions_max[i]) == 0) {
  239. return (0);
  240. }
  241. }
  242. return (1);
  243. }
  244. static void ykd_session_endian_convert (struct ykd_session *ykd_session)
  245. {
  246. int i;
  247. ykd_session->member_list_entries =
  248. swab32 (ykd_session->member_list_entries);
  249. ykd_session->session_id = swab32 (ykd_session->session_id);
  250. for (i = 0; i < ykd_session->member_list_entries; i++) {
  251. ykd_session->member_list[i] =
  252. swab32 (ykd_session->member_list[i]);
  253. }
  254. }
  255. static void ykd_state_endian_convert (struct ykd_state *state)
  256. {
  257. int i;
  258. ykd_session_endian_convert (&state->last_primary);
  259. state->last_formed_entries = swab32 (state->last_formed_entries);
  260. state->ambiguous_sessions_entries = swab32 (state->ambiguous_sessions_entries);
  261. state->session_id = swab32 (state->session_id);
  262. for (i = 0; i < state->last_formed_entries; i++) {
  263. ykd_session_endian_convert (&state->last_formed[i]);
  264. }
  265. for (i = 0; i < state->ambiguous_sessions_entries; i++) {
  266. ykd_session_endian_convert (&state->ambiguous_sessions[i]);
  267. }
  268. }
  269. static void ykd_deliver_fn (
  270. unsigned int nodeid,
  271. const void *msg,
  272. unsigned int msg_len,
  273. int endian_conversion_required)
  274. {
  275. int all_received = 1;
  276. int state_position = 0;
  277. int i;
  278. char *msg_state = (char *)msg + sizeof (struct ykd_header);
  279. /*
  280. * If this is a localhost address, this node is always primary
  281. */
  282. #ifdef TODO
  283. if (totemip_localhost_check (source_addr)) {
  284. log_printf (LOGSYS_LEVEL_NOTICE,
  285. "This processor is within the primary component.\n");
  286. primary_designated = 1;
  287. ykd_primary_callback_fn (
  288. view_list,
  289. view_list_entries,
  290. primary_designated,
  291. &ykd_ring_id);
  292. return;
  293. }
  294. #endif
  295. if (endian_conversion_required &&
  296. (msg_len > sizeof (struct ykd_header))) {
  297. ykd_state_endian_convert ((struct ykd_state *)msg_state);
  298. }
  299. /*
  300. * Set completion for source_addr's address
  301. */
  302. for (state_position = 0; state_position < state_received_confchg_entries; state_position++) {
  303. if (nodeid == state_received_process[state_position].nodeid) {
  304. /*
  305. * State position contains the address of the state to modify
  306. * This may be used later by the other algorithms
  307. */
  308. state_received_process[state_position].received = 1;
  309. break;
  310. }
  311. }
  312. /*
  313. * Test if all nodes have submitted their state data
  314. */
  315. for (i = 0; i < state_received_confchg_entries; i++) {
  316. if (state_received_process[i].received == 0) {
  317. all_received = 0;
  318. }
  319. }
  320. switch (ykd_mode) {
  321. case YKD_MODE_SENDSTATE:
  322. assert (msg_len > sizeof (struct ykd_header));
  323. /*
  324. * Copy state information for the sending processor
  325. */
  326. memcpy (&state_received_process[state_position].ykd_state,
  327. msg_state, sizeof (struct ykd_state));
  328. /*
  329. * Try to form a component
  330. */
  331. if (all_received) {
  332. for (i = 0; i < state_received_confchg_entries; i++) {
  333. state_received_process[i].received = 0;
  334. }
  335. ykd_mode = YKD_MODE_ATTEMPT;
  336. // TODO resolve optimizes for failure conditions during ykd calculation
  337. // resolve();
  338. compute();
  339. if (decide ()) {
  340. ykd_state.session_id = session_id_max + 1;
  341. memcpy (ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list,
  342. view_list, sizeof (unsigned int) * view_list_entries);
  343. ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list_entries = view_list_entries;
  344. ykd_state.ambiguous_sessions_entries += 1;
  345. ykd_attempt_send();
  346. }
  347. }
  348. break;
  349. case YKD_MODE_ATTEMPT:
  350. if (all_received) {
  351. log_printf (LOGSYS_LEVEL_NOTICE,
  352. "This processor is within the primary component.\n");
  353. primary_designated = 1;
  354. ykd_primary_callback_fn (
  355. view_list,
  356. view_list_entries,
  357. primary_designated,
  358. &ykd_ring_id);
  359. memcpy (ykd_state.last_primary.member_list, view_list, sizeof (view_list));
  360. ykd_state.last_primary.member_list_entries = view_list_entries;
  361. ykd_state.last_primary.session_id = ykd_state.session_id;
  362. ykd_state.ambiguous_sessions_entries = 0;
  363. }
  364. break;
  365. }
  366. }
  367. int first_run = 1;
  368. static void ykd_confchg_fn (
  369. enum totem_configuration_type configuration_type,
  370. const unsigned int *member_list, size_t member_list_entries,
  371. const unsigned int *left_list, size_t left_list_entries,
  372. const unsigned int *joined_list, size_t joined_list_entries,
  373. const struct memb_ring_id *ring_id)
  374. {
  375. int i;
  376. if (configuration_type != TOTEM_CONFIGURATION_REGULAR) {
  377. return;
  378. }
  379. memcpy (&ykd_ring_id, ring_id, sizeof (struct memb_ring_id));
  380. if (first_run) {
  381. ykd_state.last_primary.member_list[0] = api->totem_nodeid_get();
  382. ykd_state.last_primary.member_list_entries = 1;
  383. ykd_state.last_primary.session_id = 0;
  384. first_run = 0;
  385. }
  386. memcpy (view_list, member_list,
  387. member_list_entries * sizeof (unsigned int));
  388. view_list_entries = member_list_entries;
  389. ykd_mode = YKD_MODE_SENDSTATE;
  390. primary_designated = 0;
  391. ykd_primary_callback_fn (
  392. view_list,
  393. view_list_entries,
  394. primary_designated,
  395. &ykd_ring_id);
  396. memset (&state_received_confchg, 0, sizeof (state_received_confchg));
  397. for (i = 0; i < member_list_entries; i++) {
  398. state_received_confchg[i].nodeid = member_list[i];
  399. state_received_confchg[i].received = 0;
  400. }
  401. memcpy (state_received_process, state_received_confchg,
  402. sizeof (state_received_confchg));
  403. state_received_confchg_entries = member_list_entries;
  404. state_received_process_entries = member_list_entries;
  405. ykd_state_send ();
  406. }
  407. struct corosync_tpg_group ykd_group = {
  408. .group = "ykd",
  409. .group_len = 3
  410. };
  411. static void ykd_init (
  412. struct corosync_api_v1 *corosync_api,
  413. quorum_set_quorate_fn_t set_primary)
  414. {
  415. ykd_primary_callback_fn = set_primary;
  416. api = corosync_api;
  417. api->tpg_init (
  418. &ykd_group_handle,
  419. ykd_deliver_fn,
  420. ykd_confchg_fn);
  421. api->tpg_join (
  422. ykd_group_handle,
  423. &ykd_group,
  424. 1);
  425. ykd_state_init ();
  426. }
  427. /*
  428. * lcrso object definition
  429. */
  430. static struct quorum_services_api_ver1 vsf_ykd_iface_ver0 = {
  431. .init = ykd_init,
  432. };
  433. static struct lcr_iface corosync_vsf_ykd_ver0[1] = {
  434. {
  435. .name = "corosync_quorum_ykd",
  436. .version = 0,
  437. .versions_replace = 0,
  438. .versions_replace_count = 0,
  439. .dependencies = 0,
  440. .dependency_count = 0,
  441. .constructor = NULL,
  442. .destructor = NULL,
  443. .interfaces = (void **)(void *)&vsf_ykd_iface_ver0,
  444. }
  445. };
  446. static struct lcr_comp vsf_ykd_comp_ver0 = {
  447. .iface_count = 1,
  448. .ifaces = corosync_vsf_ykd_ver0
  449. };
  450. #ifdef COROSYNC_SOLARIS
  451. void corosync_lcr_component_register (void);
  452. void corosync_lcr_component_register (void) {
  453. #else
  454. __attribute__ ((constructor)) static void corosync_lcr_component_register (void) {
  455. #endif
  456. lcr_component_register (&vsf_ykd_comp_ver0);
  457. }