4
0

vsf_ykd.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527
  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/logsys.h>
  57. #include <corosync/corotypes.h>
  58. #include <qb/qbipc_common.h>
  59. #include <corosync/mar_gen.h>
  60. #include <corosync/coroapi.h>
  61. #include <corosync/engine/quorum.h>
  62. #include <corosync/swab.h>
  63. LOGSYS_DECLARE_SUBSYS ("YKD");
  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 void *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 ykd_view_list[YKD_PROCESSOR_COUNT_MAX];
  102. static int ykd_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 ykd_primary_designated = 0;
  108. static struct memb_ring_id ykd_ring_id;
  109. hdb_handle_t schedwrk_attempt_send_callback_handle;
  110. hdb_handle_t schedwrk_state_send_callback_handle;
  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 (const void *context)
  126. {
  127. struct iovec iovec[2];
  128. struct ykd_header header;
  129. int res;
  130. header.id = YKD_HEADER_SENDSTATE;
  131. iovec[0].iov_base = (char *)&header;
  132. iovec[0].iov_len = sizeof (struct ykd_header);
  133. iovec[1].iov_base = (char *)&ykd_state;
  134. iovec[1].iov_len = sizeof (struct ykd_state);
  135. res = api->tpg_joined_mcast (ykd_group_handle, iovec, 2,
  136. TOTEM_AGREED);
  137. return (res);
  138. }
  139. static void ykd_state_send (void)
  140. {
  141. api->schedwrk_create (
  142. &schedwrk_state_send_callback_handle,
  143. ykd_state_send_msg,
  144. NULL);
  145. }
  146. static int ykd_attempt_send_msg (const void *context)
  147. {
  148. struct iovec iovec;
  149. struct ykd_header header;
  150. int res;
  151. header.id = YKD_HEADER_ATTEMPT;
  152. iovec.iov_base = (char *)&header;
  153. iovec.iov_len = sizeof (struct ykd_header);
  154. res = api->tpg_joined_mcast (ykd_group_handle, &iovec, 1,
  155. TOTEM_AGREED);
  156. return (res);
  157. }
  158. static void ykd_attempt_send (void)
  159. {
  160. api->schedwrk_create (
  161. &schedwrk_attempt_send_callback_handle,
  162. ykd_attempt_send_msg,
  163. NULL);
  164. }
  165. static void compute (void)
  166. {
  167. int i;
  168. int j;
  169. session_id_max = 0;
  170. last_primary_max = &state_received_process[0].ykd_state.last_primary;
  171. ambiguous_sessions_max_entries = 0;
  172. for (i = 0; i < state_received_process_entries; i++) {
  173. /*
  174. * Calculate maximum session id
  175. */
  176. if (state_received_process[i].ykd_state.session_id > session_id_max) {
  177. session_id_max = state_received_process[i].ykd_state.session_id;
  178. }
  179. /*
  180. * Calculate maximum primary id
  181. */
  182. if (state_received_process[i].ykd_state.last_primary.session_id > last_primary_max->session_id) {
  183. last_primary_max = &state_received_process[i].ykd_state.last_primary;
  184. }
  185. /*
  186. * generate the maximum ambiguous sessions list
  187. */
  188. for (j = 0; j < state_received_process[i].ykd_state.ambiguous_sessions_entries; j++) {
  189. if (state_received_process[i].ykd_state.ambiguous_sessions[j].session_id > last_primary_max->session_id) {
  190. memcpy (&ambiguous_sessions_max[ambiguous_sessions_max_entries],
  191. &state_received_process[i].ykd_state.ambiguous_sessions[j],
  192. sizeof (struct ykd_session));
  193. ambiguous_sessions_max_entries += 1;
  194. }
  195. }
  196. }
  197. }
  198. static int subquorum (
  199. unsigned int *member_list,
  200. int member_list_entries,
  201. struct ykd_session *session)
  202. {
  203. int intersections = 0;
  204. int i;
  205. int j;
  206. for (i = 0; i < member_list_entries; i++) {
  207. for (j = 0; j < session->member_list_entries; j++) {
  208. if (member_list[i] == session->member_list[j]) {
  209. intersections += 1;
  210. }
  211. }
  212. }
  213. /*
  214. * even split
  215. */
  216. if (intersections == (session->member_list_entries - intersections)) {
  217. return (1);
  218. } else
  219. /*
  220. * majority split
  221. */
  222. if (intersections > (session->member_list_entries - intersections)) {
  223. return (1);
  224. }
  225. return (0);
  226. }
  227. static int decide (void)
  228. {
  229. int i;
  230. /*
  231. * Determine if there is a subquorum
  232. */
  233. if (subquorum (ykd_view_list, ykd_view_list_entries, last_primary_max) == 0) {
  234. return (0);
  235. }
  236. for (i = 0; i < ambiguous_sessions_max_entries; i++) {
  237. if (subquorum (ykd_view_list, ykd_view_list_entries, &ambiguous_sessions_max[i]) == 0) {
  238. return (0);
  239. }
  240. }
  241. return (1);
  242. }
  243. static void ykd_session_endian_convert (struct ykd_session *ykd_session)
  244. {
  245. int i;
  246. ykd_session->member_list_entries =
  247. swab32 (ykd_session->member_list_entries);
  248. ykd_session->session_id = swab32 (ykd_session->session_id);
  249. for (i = 0; i < ykd_session->member_list_entries; i++) {
  250. ykd_session->member_list[i] =
  251. swab32 (ykd_session->member_list[i]);
  252. }
  253. }
  254. static void ykd_state_endian_convert (struct ykd_state *state)
  255. {
  256. int i;
  257. ykd_session_endian_convert (&state->last_primary);
  258. state->last_formed_entries = swab32 (state->last_formed_entries);
  259. state->ambiguous_sessions_entries = swab32 (state->ambiguous_sessions_entries);
  260. state->session_id = swab32 (state->session_id);
  261. for (i = 0; i < state->last_formed_entries; i++) {
  262. ykd_session_endian_convert (&state->last_formed[i]);
  263. }
  264. for (i = 0; i < state->ambiguous_sessions_entries; i++) {
  265. ykd_session_endian_convert (&state->ambiguous_sessions[i]);
  266. }
  267. }
  268. static void ykd_deliver_fn (
  269. unsigned int nodeid,
  270. const void *msg,
  271. unsigned int msg_len,
  272. int endian_conversion_required)
  273. {
  274. int all_received = 1;
  275. int state_position = 0;
  276. int i;
  277. struct ykd_header *header = (struct ykd_header *)msg;
  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. ykd_view_list,
  289. ykd_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. /*
  321. * Ignore messages from a different state
  322. */
  323. if ((ykd_mode == YKD_MODE_SENDSTATE && header->id == YKD_HEADER_ATTEMPT) ||
  324. (ykd_mode == YKD_MODE_ATTEMPT && header->id == YKD_HEADER_SENDSTATE))
  325. return;
  326. switch (ykd_mode) {
  327. case YKD_MODE_SENDSTATE:
  328. assert (msg_len > sizeof (struct ykd_header));
  329. /*
  330. * Copy state information for the sending processor
  331. */
  332. memcpy (&state_received_process[state_position].ykd_state,
  333. msg_state, sizeof (struct ykd_state));
  334. /*
  335. * Try to form a component
  336. */
  337. if (all_received) {
  338. for (i = 0; i < state_received_confchg_entries; i++) {
  339. state_received_process[i].received = 0;
  340. }
  341. ykd_mode = YKD_MODE_ATTEMPT;
  342. // TODO resolve optimizes for failure conditions during ykd calculation
  343. // resolve();
  344. compute();
  345. if (decide ()) {
  346. ykd_state.session_id = session_id_max + 1;
  347. memcpy (ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list,
  348. ykd_view_list, sizeof (unsigned int) * ykd_view_list_entries);
  349. ykd_state.ambiguous_sessions[ykd_state.ambiguous_sessions_entries].member_list_entries = ykd_view_list_entries;
  350. ykd_state.ambiguous_sessions_entries += 1;
  351. ykd_attempt_send();
  352. }
  353. }
  354. break;
  355. case YKD_MODE_ATTEMPT:
  356. if (all_received) {
  357. log_printf (LOGSYS_LEVEL_NOTICE,
  358. "This processor is within the primary component.\n");
  359. ykd_primary_designated = 1;
  360. ykd_primary_callback_fn (
  361. ykd_view_list,
  362. ykd_view_list_entries,
  363. ykd_primary_designated,
  364. &ykd_ring_id);
  365. memcpy (ykd_state.last_primary.member_list, ykd_view_list, sizeof (ykd_view_list));
  366. ykd_state.last_primary.member_list_entries = ykd_view_list_entries;
  367. ykd_state.last_primary.session_id = ykd_state.session_id;
  368. ykd_state.ambiguous_sessions_entries = 0;
  369. }
  370. break;
  371. }
  372. }
  373. int first_run = 1;
  374. static void ykd_confchg_fn (
  375. enum totem_configuration_type configuration_type,
  376. const unsigned int *member_list, size_t member_list_entries,
  377. const unsigned int *left_list, size_t left_list_entries,
  378. const unsigned int *joined_list, size_t joined_list_entries,
  379. const struct memb_ring_id *ring_id)
  380. {
  381. int i;
  382. if (configuration_type != TOTEM_CONFIGURATION_REGULAR) {
  383. return;
  384. }
  385. memcpy (&ykd_ring_id, ring_id, sizeof (struct memb_ring_id));
  386. if (first_run) {
  387. ykd_state.last_primary.member_list[0] = api->totem_nodeid_get();
  388. ykd_state.last_primary.member_list_entries = 1;
  389. ykd_state.last_primary.session_id = 0;
  390. first_run = 0;
  391. }
  392. memcpy (ykd_view_list, member_list,
  393. member_list_entries * sizeof (unsigned int));
  394. ykd_view_list_entries = member_list_entries;
  395. ykd_mode = YKD_MODE_SENDSTATE;
  396. ykd_primary_designated = 0;
  397. ykd_primary_callback_fn (
  398. ykd_view_list,
  399. ykd_view_list_entries,
  400. ykd_primary_designated,
  401. &ykd_ring_id);
  402. memset (&state_received_confchg, 0, sizeof (state_received_confchg));
  403. for (i = 0; i < member_list_entries; i++) {
  404. state_received_confchg[i].nodeid = member_list[i];
  405. state_received_confchg[i].received = 0;
  406. }
  407. memcpy (state_received_process, state_received_confchg,
  408. sizeof (state_received_confchg));
  409. state_received_confchg_entries = member_list_entries;
  410. state_received_process_entries = member_list_entries;
  411. ykd_state_send ();
  412. }
  413. struct corosync_tpg_group ykd_group = {
  414. .group = "ykd",
  415. .group_len = 3
  416. };
  417. static void ykd_init (
  418. struct corosync_api_v1 *corosync_api,
  419. quorum_set_quorate_fn_t set_primary)
  420. {
  421. ykd_primary_callback_fn = set_primary;
  422. api = corosync_api;
  423. api->tpg_init (
  424. &ykd_group_handle,
  425. ykd_deliver_fn,
  426. ykd_confchg_fn);
  427. api->tpg_join (
  428. ykd_group_handle,
  429. &ykd_group,
  430. 1);
  431. ykd_state_init ();
  432. }