vsf_ykd.c 14 KB

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