sync.c 17 KB

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