4
0

syncv2.c 17 KB

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