syncv2.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622
  1. /*
  2. * Copyright (c) 2009 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Steven Dake (sdake@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 MontaVista Software, 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 <config.h>
  35. #include <sys/types.h>
  36. #include <sys/socket.h>
  37. #include <sys/un.h>
  38. #include <sys/ioctl.h>
  39. #include <netinet/in.h>
  40. #include <sys/uio.h>
  41. #include <unistd.h>
  42. #include <fcntl.h>
  43. #include <stdlib.h>
  44. #include <stdio.h>
  45. #include <errno.h>
  46. #include <time.h>
  47. #include <unistd.h>
  48. #include <netinet/in.h>
  49. #include <arpa/inet.h>
  50. #include <corosync/corotypes.h>
  51. #include <corosync/swab.h>
  52. #include <corosync/totem/totempg.h>
  53. #include <corosync/totem/totem.h>
  54. #include <corosync/lcr/lcr_ifact.h>
  55. #include <corosync/engine/logsys.h>
  56. #include <corosync/coroipc_types.h>
  57. #include "schedwrk.h"
  58. #include "quorum.h"
  59. #include "sync.h"
  60. #include "syncv2.h"
  61. LOGSYS_DECLARE_SUBSYS ("SYNCV2");
  62. #define MESSAGE_REQ_SYNC_BARRIER 0
  63. #define MESSAGE_REQ_SYNC_SERVICE_BUILD 1
  64. #define MESSAGE_REQ_SYNC_MEMB_DETERMINE 2
  65. enum sync_process_state {
  66. INIT,
  67. PROCESS,
  68. ACTIVATE
  69. };
  70. enum sync_state {
  71. SYNC_SERVICELIST_BUILD,
  72. SYNC_PROCESS,
  73. SYNC_BARRIER
  74. };
  75. struct service_entry {
  76. int service_id;
  77. int api_version;
  78. union sync_init_api sync_init_api;
  79. void (*sync_abort) (void);
  80. int (*sync_process) (void);
  81. void (*sync_activate) (void);
  82. enum sync_process_state state;
  83. char name[128];
  84. };
  85. struct processor_entry {
  86. int nodeid;
  87. int received;
  88. };
  89. struct req_exec_memb_determine_message {
  90. coroipc_request_header_t header __attribute__((aligned(8)));
  91. struct memb_ring_id ring_id __attribute__((aligned(8)));
  92. };
  93. struct req_exec_service_build_message {
  94. coroipc_request_header_t header __attribute__((aligned(8)));
  95. struct memb_ring_id ring_id __attribute__((aligned(8)));
  96. int service_list_entries __attribute__((aligned(8)));
  97. int service_list[128] __attribute__((aligned(8)));
  98. };
  99. struct req_exec_barrier_message {
  100. coroipc_request_header_t header __attribute__((aligned(8)));
  101. struct memb_ring_id ring_id __attribute__((aligned(8)));
  102. };
  103. static enum sync_state my_state = SYNC_BARRIER;
  104. static struct memb_ring_id my_ring_id;
  105. static struct memb_ring_id my_memb_determine_ring_id;
  106. static int my_memb_determine = 0;
  107. static unsigned int my_memb_determine_list[PROCESSOR_COUNT_MAX];
  108. static unsigned int my_memb_determine_list_entries = 0;
  109. static int my_processing_idx = 0;
  110. static hdb_handle_t my_schedwrk_handle;
  111. static struct processor_entry my_processor_list[PROCESSOR_COUNT_MAX];
  112. static unsigned int my_member_list[PROCESSOR_COUNT_MAX];
  113. static unsigned int my_trans_list[PROCESSOR_COUNT_MAX];
  114. static size_t my_member_list_entries = 0;
  115. static size_t my_trans_list_entries = 0;
  116. static int my_processor_list_entries = 0;
  117. static struct service_entry my_service_list[128];
  118. static int my_service_list_entries = 0;
  119. static const struct memb_ring_id sync_ring_id;
  120. static void (*sync_synchronization_completed) (void);
  121. static void sync_deliver_fn (
  122. unsigned int nodeid,
  123. const void *msg,
  124. unsigned int msg_len,
  125. int endian_conversion_required);
  126. static int schedwrk_processor (const void *context);
  127. static void sync_process_enter (void);
  128. static struct totempg_group sync_group = {
  129. .group = "syncv2",
  130. .group_len = 6
  131. };
  132. static hdb_handle_t sync_group_handle;
  133. int (*my_sync_callbacks_retrieve) (
  134. int service_id,
  135. struct sync_callbacks *callbacks);
  136. int sync_v2_init (
  137. int (*sync_callbacks_retrieve) (
  138. int service_id,
  139. struct sync_callbacks *callbacks),
  140. void (*synchronization_completed) (void))
  141. {
  142. unsigned int res;
  143. res = totempg_groups_initialize (
  144. &sync_group_handle,
  145. sync_deliver_fn,
  146. NULL);
  147. if (res == -1) {
  148. log_printf (LOGSYS_LEVEL_ERROR,
  149. "Couldn't initialize groups interface.\n");
  150. return (-1);
  151. }
  152. res = totempg_groups_join (
  153. sync_group_handle,
  154. &sync_group,
  155. 1);
  156. if (res == -1) {
  157. log_printf (LOGSYS_LEVEL_ERROR, "Couldn't join group.\n");
  158. return (-1);
  159. }
  160. sync_synchronization_completed = synchronization_completed;
  161. my_sync_callbacks_retrieve = sync_callbacks_retrieve;
  162. return (0);
  163. }
  164. static void sync_barrier_handler (unsigned int nodeid, const void *msg)
  165. {
  166. const struct req_exec_barrier_message *req_exec_barrier_message = msg;
  167. int i;
  168. int barrier_reached = 1;
  169. if (memcmp (&my_ring_id, &req_exec_barrier_message->ring_id,
  170. sizeof (struct memb_ring_id)) != 0) {
  171. return;
  172. }
  173. for (i = 0; i < my_processor_list_entries; i++) {
  174. if (my_processor_list[i].nodeid == nodeid) {
  175. my_processor_list[i].received = 1;
  176. }
  177. }
  178. for (i = 0; i < my_processor_list_entries; i++) {
  179. if (my_processor_list[i].received == 0) {
  180. barrier_reached = 0;
  181. }
  182. }
  183. if (barrier_reached) {
  184. log_printf (LOGSYS_LEVEL_DEBUG, "Committing synchronization for %s\n",
  185. my_service_list[my_processing_idx].name);
  186. my_service_list[my_processing_idx].state = ACTIVATE;
  187. my_service_list[my_processing_idx].sync_activate ();
  188. my_processing_idx += 1;
  189. if (my_service_list_entries == my_processing_idx) {
  190. my_memb_determine_list_entries = 0;
  191. sync_synchronization_completed ();
  192. } else {
  193. sync_process_enter ();
  194. }
  195. }
  196. }
  197. static void dummy_sync_init (
  198. const unsigned int *member_list,
  199. size_t member_list_entries,
  200. const struct memb_ring_id *ring_id)
  201. {
  202. }
  203. static void dummy_sync_abort (void)
  204. {
  205. }
  206. static int dummy_sync_process (void)
  207. {
  208. return (0);
  209. }
  210. static void dummy_sync_activate (void)
  211. {
  212. }
  213. static int service_entry_compare (const void *a, const void *b)
  214. {
  215. const struct service_entry *service_entry_a = a;
  216. const struct service_entry *service_entry_b = b;
  217. return (service_entry_a->service_id > service_entry_b->service_id);
  218. }
  219. static void sync_memb_determine (unsigned int nodeid, const void *msg)
  220. {
  221. const struct req_exec_memb_determine_message *req_exec_memb_determine_message = msg;
  222. int found = 0;
  223. int i;
  224. if (memcmp (&req_exec_memb_determine_message->ring_id,
  225. &my_memb_determine_ring_id, sizeof (struct memb_ring_id)) != 0) {
  226. return;
  227. }
  228. my_memb_determine = 1;
  229. for (i = 0; i < my_memb_determine_list_entries; i++) {
  230. if (my_memb_determine_list[i] == nodeid) {
  231. found = 1;
  232. }
  233. }
  234. if (found == 0) {
  235. my_memb_determine_list[my_memb_determine_list_entries] = nodeid;
  236. my_memb_determine_list_entries += 1;
  237. }
  238. }
  239. static void sync_service_build_handler (unsigned int nodeid, const void *msg)
  240. {
  241. const struct req_exec_service_build_message *req_exec_service_build_message = msg;
  242. int i, j;
  243. int barrier_reached = 1;
  244. int found;
  245. int qsort_trigger = 0;
  246. if (memcmp (&my_ring_id, &req_exec_service_build_message->ring_id,
  247. sizeof (struct memb_ring_id)) != 0) {
  248. return;
  249. }
  250. for (i = 0; i < req_exec_service_build_message->service_list_entries; i++) {
  251. found = 0;
  252. for (j = 0; j < my_service_list_entries; j++) {
  253. if (req_exec_service_build_message->service_list[i] ==
  254. my_service_list[j].service_id) {
  255. found = 1;
  256. break;
  257. }
  258. }
  259. if (found == 0) {
  260. my_service_list[my_service_list_entries].state =
  261. INIT;
  262. my_service_list[my_service_list_entries].service_id =
  263. req_exec_service_build_message->service_list[i];
  264. sprintf (my_service_list[my_service_list_entries].name,
  265. "External Service (id = %d)\n",
  266. req_exec_service_build_message->service_list[i]);
  267. my_service_list[my_service_list_entries].api_version = 1;
  268. my_service_list[my_service_list_entries].sync_init_api.sync_init_v1 =
  269. dummy_sync_init;
  270. my_service_list[my_service_list_entries].sync_abort =
  271. dummy_sync_abort;
  272. my_service_list[my_service_list_entries].sync_process =
  273. dummy_sync_process;
  274. my_service_list[my_service_list_entries].sync_activate =
  275. dummy_sync_activate;
  276. my_service_list_entries += 1;
  277. qsort_trigger = 1;
  278. }
  279. }
  280. if (qsort_trigger) {
  281. qsort (my_service_list, my_service_list_entries,
  282. sizeof (struct service_entry), service_entry_compare);
  283. }
  284. for (i = 0; i < my_processor_list_entries; i++) {
  285. if (my_processor_list[i].nodeid == nodeid) {
  286. my_processor_list[i].received = 1;
  287. }
  288. }
  289. for (i = 0; i < my_processor_list_entries; i++) {
  290. if (my_processor_list[i].received == 0) {
  291. barrier_reached = 0;
  292. }
  293. }
  294. if (barrier_reached) {
  295. sync_process_enter ();
  296. }
  297. }
  298. static void sync_deliver_fn (
  299. unsigned int nodeid,
  300. const void *msg,
  301. unsigned int msg_len,
  302. int endian_conversion_required)
  303. {
  304. coroipc_request_header_t *header = (coroipc_request_header_t *)msg;
  305. switch (header->id) {
  306. case MESSAGE_REQ_SYNC_BARRIER:
  307. sync_barrier_handler (nodeid, msg);
  308. break;
  309. case MESSAGE_REQ_SYNC_SERVICE_BUILD:
  310. sync_service_build_handler (nodeid, msg);
  311. break;
  312. case MESSAGE_REQ_SYNC_MEMB_DETERMINE:
  313. sync_memb_determine (nodeid, msg);
  314. break;
  315. }
  316. }
  317. static void memb_determine_message_transmit (void)
  318. {
  319. struct iovec iovec;
  320. struct req_exec_memb_determine_message req_exec_memb_determine_message;
  321. int res;
  322. req_exec_memb_determine_message.header.size = sizeof (struct req_exec_memb_determine_message);
  323. req_exec_memb_determine_message.header.id = MESSAGE_REQ_SYNC_MEMB_DETERMINE;
  324. memcpy (&req_exec_memb_determine_message.ring_id,
  325. &my_memb_determine_ring_id,
  326. sizeof (struct memb_ring_id));
  327. iovec.iov_base = (char *)&req_exec_memb_determine_message;
  328. iovec.iov_len = sizeof (req_exec_memb_determine_message);
  329. res = totempg_groups_mcast_joined (sync_group_handle,
  330. &iovec, 1, TOTEMPG_AGREED);
  331. }
  332. static void barrier_message_transmit (void)
  333. {
  334. struct iovec iovec;
  335. struct req_exec_barrier_message req_exec_barrier_message;
  336. int res;
  337. req_exec_barrier_message.header.size = sizeof (struct req_exec_barrier_message);
  338. req_exec_barrier_message.header.id = MESSAGE_REQ_SYNC_BARRIER;
  339. memcpy (&req_exec_barrier_message.ring_id, &my_ring_id,
  340. sizeof (struct memb_ring_id));
  341. iovec.iov_base = (char *)&req_exec_barrier_message;
  342. iovec.iov_len = sizeof (req_exec_barrier_message);
  343. res = totempg_groups_mcast_joined (sync_group_handle,
  344. &iovec, 1, TOTEMPG_AGREED);
  345. }
  346. static void service_build_message_transmit (struct req_exec_service_build_message *service_build_message)
  347. {
  348. struct iovec iovec;
  349. int res;
  350. service_build_message->header.size = sizeof (struct req_exec_service_build_message);
  351. service_build_message->header.id = MESSAGE_REQ_SYNC_SERVICE_BUILD;
  352. memcpy (&service_build_message->ring_id, &my_ring_id,
  353. sizeof (struct memb_ring_id));
  354. iovec.iov_base = (void *)service_build_message;
  355. iovec.iov_len = sizeof (struct req_exec_service_build_message);
  356. res = totempg_groups_mcast_joined (sync_group_handle,
  357. &iovec, 1, TOTEMPG_AGREED);
  358. }
  359. static void sync_barrier_enter (void)
  360. {
  361. my_state = SYNC_BARRIER;
  362. barrier_message_transmit ();
  363. }
  364. static void sync_process_enter (void)
  365. {
  366. int i;
  367. my_state = SYNC_PROCESS;
  368. /*
  369. * No syncv2 services
  370. */
  371. if (my_service_list_entries == 0) {
  372. my_state = SYNC_SERVICELIST_BUILD;
  373. my_memb_determine_list_entries = 0;
  374. sync_synchronization_completed ();
  375. return;
  376. }
  377. for (i = 0; i < my_processor_list_entries; i++) {
  378. my_processor_list[i].received = 0;
  379. }
  380. schedwrk_create (&my_schedwrk_handle,
  381. schedwrk_processor,
  382. NULL);
  383. }
  384. static void sync_servicelist_build_enter (
  385. const unsigned int *member_list,
  386. size_t member_list_entries,
  387. const struct memb_ring_id *ring_id)
  388. {
  389. struct req_exec_service_build_message service_build;
  390. int i;
  391. int res;
  392. struct sync_callbacks sync_callbacks;
  393. my_state = SYNC_SERVICELIST_BUILD;
  394. for (i = 0; i < member_list_entries; i++) {
  395. my_processor_list[i].nodeid = member_list[i];
  396. my_processor_list[i].received = 0;
  397. }
  398. my_processor_list_entries = member_list_entries;
  399. memcpy (my_member_list, member_list,
  400. member_list_entries * sizeof (unsigned int));
  401. my_member_list_entries = member_list_entries;
  402. my_processing_idx = 0;
  403. memset(my_service_list, 0, sizeof (struct service_entry) * 128);
  404. my_service_list_entries = 0;
  405. for (i = 0; i < 64; i++) {
  406. res = my_sync_callbacks_retrieve (i, &sync_callbacks);
  407. if (res == -1) {
  408. continue;
  409. }
  410. if (sync_callbacks.sync_init_api.sync_init_v1 == NULL) {
  411. continue;
  412. }
  413. my_service_list[my_service_list_entries].state =
  414. INIT;
  415. my_service_list[my_service_list_entries].service_id = i;
  416. strcpy (my_service_list[my_service_list_entries].name,
  417. sync_callbacks.name);
  418. my_service_list[my_service_list_entries].api_version = sync_callbacks.api_version;
  419. my_service_list[my_service_list_entries].sync_init_api = sync_callbacks.sync_init_api;
  420. my_service_list[my_service_list_entries].sync_process = sync_callbacks.sync_process;
  421. my_service_list[my_service_list_entries].sync_abort = sync_callbacks.sync_abort;
  422. my_service_list[my_service_list_entries].sync_activate = sync_callbacks.sync_activate;
  423. my_service_list_entries += 1;
  424. }
  425. for (i = 0; i < my_service_list[i].service_id; i++) {
  426. service_build.service_list[i] =
  427. my_service_list[i].service_id;
  428. }
  429. service_build.service_list_entries = i;
  430. service_build_message_transmit (&service_build);
  431. }
  432. static int schedwrk_processor (const void *context)
  433. {
  434. int res = 0;
  435. if (my_service_list[my_processing_idx].state == INIT) {
  436. my_service_list[my_processing_idx].state = PROCESS;
  437. if (my_service_list[my_processing_idx].api_version == 1) {
  438. my_service_list[my_processing_idx].sync_init_api.sync_init_v1 (my_member_list,
  439. my_member_list_entries,
  440. &my_ring_id);
  441. } else {
  442. unsigned int old_trans_list[PROCESSOR_COUNT_MAX];
  443. size_t old_trans_list_entries = 0;
  444. int o, m;
  445. memcpy (old_trans_list, my_trans_list, my_trans_list_entries *
  446. sizeof (unsigned int));
  447. old_trans_list_entries = my_trans_list_entries;
  448. my_trans_list_entries = 0;
  449. for (o = 0; o < old_trans_list_entries; o++) {
  450. for (m = 0; m < my_member_list_entries; m++) {
  451. if (old_trans_list[o] == my_member_list[m]) {
  452. my_trans_list[my_trans_list_entries] = my_member_list[m];
  453. my_trans_list_entries++;
  454. break;
  455. }
  456. }
  457. }
  458. my_service_list[my_processing_idx].sync_init_api.sync_init_v2 (my_trans_list,
  459. my_trans_list_entries, my_member_list,
  460. my_member_list_entries,
  461. &my_ring_id);
  462. }
  463. }
  464. if (my_service_list[my_processing_idx].state == PROCESS) {
  465. my_service_list[my_processing_idx].state = PROCESS;
  466. res = my_service_list[my_processing_idx].sync_process ();
  467. if (res == 0) {
  468. sync_barrier_enter();
  469. } else {
  470. return (-1);
  471. }
  472. }
  473. return (0);
  474. }
  475. void sync_v2_start (
  476. const unsigned int *member_list,
  477. size_t member_list_entries,
  478. const struct memb_ring_id *ring_id)
  479. {
  480. memcpy (&my_ring_id, ring_id, sizeof (struct memb_ring_id));
  481. if (my_memb_determine) {
  482. my_memb_determine = 0;
  483. sync_servicelist_build_enter (my_memb_determine_list,
  484. my_memb_determine_list_entries, ring_id);
  485. } else {
  486. sync_servicelist_build_enter (member_list, member_list_entries,
  487. ring_id);
  488. }
  489. }
  490. void sync_v2_save_transitional (
  491. const unsigned int *member_list,
  492. size_t member_list_entries,
  493. const struct memb_ring_id *ring_id)
  494. {
  495. log_printf (LOGSYS_LEVEL_DEBUG, "saving transitional configuration\n");
  496. memcpy (my_trans_list, member_list, member_list_entries *
  497. sizeof (unsigned int));
  498. my_trans_list_entries = member_list_entries;
  499. }
  500. void sync_v2_abort (void)
  501. {
  502. if (my_state == SYNC_PROCESS) {
  503. schedwrk_destroy (my_schedwrk_handle);
  504. my_service_list[my_processing_idx].sync_abort ();
  505. }
  506. /* this will cause any "old" barrier messages from causing
  507. * problems.
  508. */
  509. memset (&my_ring_id, 0, sizeof (struct memb_ring_id));
  510. }
  511. void sync_v2_memb_list_determine (const struct memb_ring_id *ring_id)
  512. {
  513. memcpy (&my_memb_determine_ring_id, ring_id,
  514. sizeof (struct memb_ring_id));
  515. memb_determine_message_transmit ();
  516. }
  517. void sync_v2_memb_list_abort (void)
  518. {
  519. my_memb_determine_list_entries = 0;
  520. memset (&my_memb_determine_ring_id, 0, sizeof (struct memb_ring_id));
  521. }