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