syncv2.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576
  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. void (*sync_init) (
  78. const unsigned int *member_list,
  79. size_t member_list_entries,
  80. const struct memb_ring_id *ring_id);
  81. void (*sync_abort) (void);
  82. int (*sync_process) (void);
  83. void (*sync_activate) (void);
  84. enum sync_process_state state;
  85. char name[128];
  86. };
  87. struct processor_entry {
  88. int nodeid;
  89. int received;
  90. };
  91. struct req_exec_memb_determine_message {
  92. coroipc_request_header_t header;
  93. struct memb_ring_id ring_id;
  94. };
  95. struct req_exec_service_build_message {
  96. coroipc_request_header_t header;
  97. struct memb_ring_id ring_id;
  98. int service_list_entries;
  99. int service_list[128];
  100. };
  101. struct req_exec_barrier_message {
  102. coroipc_request_header_t header;
  103. struct memb_ring_id ring_id;
  104. };
  105. static enum sync_state my_state = SYNC_BARRIER;
  106. static struct memb_ring_id my_ring_id;
  107. static struct memb_ring_id my_memb_determine_ring_id;
  108. static int my_memb_determine = 0;
  109. static unsigned int my_memb_determine_list[PROCESSOR_COUNT_MAX];
  110. static unsigned int my_memb_determine_list_entries = 0;
  111. static int my_processing_idx = 0;
  112. static hdb_handle_t my_schedwrk_handle;
  113. static struct processor_entry my_processor_list[PROCESSOR_COUNT_MAX];
  114. static unsigned int my_member_list[PROCESSOR_COUNT_MAX];
  115. static size_t my_member_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 == 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].sync_init = sync_callbacks.sync_init;
  176. my_initial_service_list[my_initial_service_list_entries].sync_process = sync_callbacks.sync_process;
  177. my_initial_service_list[my_initial_service_list_entries].sync_abort = sync_callbacks.sync_abort;
  178. my_initial_service_list[my_initial_service_list_entries].sync_activate = sync_callbacks.sync_activate;
  179. my_initial_service_list_entries += 1;
  180. }
  181. return (0);
  182. }
  183. static void sync_barrier_handler (unsigned int nodeid, const void *msg)
  184. {
  185. const struct req_exec_barrier_message *req_exec_barrier_message = msg;
  186. int i;
  187. int barrier_reached = 1;
  188. if (memcmp (&my_ring_id, &req_exec_barrier_message->ring_id,
  189. sizeof (struct memb_ring_id)) != 0) {
  190. return;
  191. }
  192. for (i = 0; i < my_processor_list_entries; i++) {
  193. if (my_processor_list[i].nodeid == nodeid) {
  194. my_processor_list[i].received = 1;
  195. }
  196. }
  197. for (i = 0; i < my_processor_list_entries; i++) {
  198. if (my_processor_list[i].received == 0) {
  199. barrier_reached = 0;
  200. }
  201. }
  202. if (barrier_reached) {
  203. my_processing_idx += 1;
  204. if (my_service_list_entries == my_processing_idx) {
  205. my_memb_determine_list_entries = 0;
  206. sync_synchronization_completed ();
  207. } else {
  208. sync_process_enter ();
  209. }
  210. }
  211. }
  212. static void dummy_sync_init (
  213. const unsigned int *member_list,
  214. size_t member_list_entries,
  215. const struct memb_ring_id *ring_id)
  216. {
  217. }
  218. static void dummy_sync_abort (void)
  219. {
  220. }
  221. static int dummy_sync_process (void)
  222. {
  223. return (0);
  224. }
  225. static void dummy_sync_activate (void)
  226. {
  227. }
  228. static int service_entry_compare (const void *a, const void *b)
  229. {
  230. const struct service_entry *service_entry_a = a;
  231. const struct service_entry *service_entry_b = b;
  232. return (service_entry_a->service_id > service_entry_b->service_id);
  233. }
  234. static void sync_memb_determine (unsigned int nodeid, const void *msg)
  235. {
  236. const struct req_exec_memb_determine_message *req_exec_memb_determine_message = msg;
  237. int found = 0;
  238. int i;
  239. if (memcmp (&req_exec_memb_determine_message->ring_id,
  240. &my_memb_determine_ring_id, sizeof (struct memb_ring_id)) != 0) {
  241. return;
  242. }
  243. my_memb_determine = 1;
  244. for (i = 0; i < my_memb_determine_list_entries; i++) {
  245. if (my_memb_determine_list[i] == nodeid) {
  246. found = 1;
  247. }
  248. }
  249. if (found == 0) {
  250. my_memb_determine_list[my_memb_determine_list_entries] = nodeid;
  251. my_memb_determine_list_entries += 1;
  252. }
  253. }
  254. static void sync_service_build_handler (unsigned int nodeid, const void *msg)
  255. {
  256. const struct req_exec_service_build_message *req_exec_service_build_message = msg;
  257. int i, j;
  258. int barrier_reached = 1;
  259. int found;
  260. int qsort_trigger = 0;
  261. if (memcmp (&my_ring_id, &req_exec_service_build_message->ring_id,
  262. sizeof (struct memb_ring_id)) != 0) {
  263. return;
  264. }
  265. for (i = 0; i < req_exec_service_build_message->service_list_entries; i++) {
  266. found = 0;
  267. for (j = 0; j < my_service_list_entries; j++) {
  268. if (req_exec_service_build_message->service_list[i] ==
  269. my_service_list[j].service_id) {
  270. found = 1;
  271. break;
  272. }
  273. }
  274. if (found == 0) {
  275. my_service_list[my_service_list_entries].state =
  276. INIT;
  277. my_service_list[my_service_list_entries].service_id =
  278. req_exec_service_build_message->service_list[i];
  279. sprintf (my_service_list[my_service_list_entries].name,
  280. "External Service (id = %d)\n",
  281. req_exec_service_build_message->service_list[i]);
  282. my_service_list[my_service_list_entries].sync_init =
  283. dummy_sync_init;
  284. my_service_list[my_service_list_entries].sync_abort =
  285. dummy_sync_abort;
  286. my_service_list[my_service_list_entries].sync_process =
  287. dummy_sync_process;
  288. my_service_list[my_service_list_entries].sync_activate =
  289. dummy_sync_activate;
  290. my_service_list_entries += 1;
  291. qsort_trigger = 1;
  292. }
  293. }
  294. if (qsort_trigger) {
  295. qsort (my_service_list, my_service_list_entries,
  296. sizeof (struct service_entry), service_entry_compare);
  297. }
  298. for (i = 0; i < my_processor_list_entries; i++) {
  299. if (my_processor_list[i].nodeid == nodeid) {
  300. my_processor_list[i].received = 1;
  301. }
  302. }
  303. for (i = 0; i < my_processor_list_entries; i++) {
  304. if (my_processor_list[i].received == 0) {
  305. barrier_reached = 0;
  306. }
  307. }
  308. if (barrier_reached) {
  309. sync_process_enter ();
  310. }
  311. }
  312. static void sync_deliver_fn (
  313. unsigned int nodeid,
  314. const void *msg,
  315. unsigned int msg_len,
  316. int endian_conversion_required)
  317. {
  318. coroipc_request_header_t *header = (coroipc_request_header_t *)msg;
  319. switch (header->id) {
  320. case MESSAGE_REQ_SYNC_BARRIER:
  321. sync_barrier_handler (nodeid, msg);
  322. break;
  323. case MESSAGE_REQ_SYNC_SERVICE_BUILD:
  324. sync_service_build_handler (nodeid, msg);
  325. break;
  326. case MESSAGE_REQ_SYNC_MEMB_DETERMINE:
  327. sync_memb_determine (nodeid, msg);
  328. break;
  329. }
  330. }
  331. static void memb_determine_message_transmit (void)
  332. {
  333. struct iovec iovec;
  334. struct req_exec_memb_determine_message req_exec_memb_determine_message;
  335. int res;
  336. req_exec_memb_determine_message.header.size = sizeof (struct req_exec_memb_determine_message);
  337. req_exec_memb_determine_message.header.id = MESSAGE_REQ_SYNC_MEMB_DETERMINE;
  338. memcpy (&req_exec_memb_determine_message.ring_id,
  339. &my_memb_determine_ring_id,
  340. sizeof (struct memb_ring_id));
  341. iovec.iov_base = (char *)&req_exec_memb_determine_message;
  342. iovec.iov_len = sizeof (req_exec_memb_determine_message);
  343. res = totempg_groups_mcast_joined (sync_group_handle,
  344. &iovec, 1, TOTEMPG_AGREED);
  345. }
  346. static void barrier_message_transmit (void)
  347. {
  348. struct iovec iovec;
  349. struct req_exec_barrier_message req_exec_barrier_message;
  350. int res;
  351. req_exec_barrier_message.header.size = sizeof (struct req_exec_barrier_message);
  352. req_exec_barrier_message.header.id = MESSAGE_REQ_SYNC_BARRIER;
  353. memcpy (&req_exec_barrier_message.ring_id, &my_ring_id,
  354. sizeof (struct memb_ring_id));
  355. iovec.iov_base = (char *)&req_exec_barrier_message;
  356. iovec.iov_len = sizeof (req_exec_barrier_message);
  357. res = totempg_groups_mcast_joined (sync_group_handle,
  358. &iovec, 1, TOTEMPG_AGREED);
  359. }
  360. static void service_build_message_transmit (struct req_exec_service_build_message *service_build_message)
  361. {
  362. struct iovec iovec;
  363. int res;
  364. service_build_message->header.size = sizeof (struct req_exec_service_build_message);
  365. service_build_message->header.id = MESSAGE_REQ_SYNC_SERVICE_BUILD;
  366. memcpy (&service_build_message->ring_id, &my_ring_id,
  367. sizeof (struct memb_ring_id));
  368. iovec.iov_base = (void *)service_build_message;
  369. iovec.iov_len = sizeof (struct req_exec_service_build_message);
  370. res = totempg_groups_mcast_joined (sync_group_handle,
  371. &iovec, 1, TOTEMPG_AGREED);
  372. }
  373. static void sync_barrier_enter (void)
  374. {
  375. my_state = SYNC_BARRIER;
  376. barrier_message_transmit ();
  377. }
  378. static void sync_process_enter (void)
  379. {
  380. int i;
  381. my_state = SYNC_PROCESS;
  382. /*
  383. * No syncv2 services
  384. */
  385. if (my_service_list_entries == 0) {
  386. my_state = SYNC_SERVICELIST_BUILD;
  387. my_memb_determine_list_entries = 0;
  388. sync_synchronization_completed ();
  389. return;
  390. }
  391. for (i = 0; i < my_processor_list_entries; i++) {
  392. my_processor_list[i].received = 0;
  393. }
  394. schedwrk_create (&my_schedwrk_handle,
  395. schedwrk_processor,
  396. NULL);
  397. }
  398. static void sync_servicelist_build_enter (
  399. const unsigned int *member_list,
  400. size_t member_list_entries,
  401. const struct memb_ring_id *ring_id)
  402. {
  403. struct req_exec_service_build_message service_build;
  404. int i;
  405. my_state = SYNC_SERVICELIST_BUILD;
  406. for (i = 0; i < member_list_entries; i++) {
  407. my_processor_list[i].nodeid = member_list[i];
  408. my_processor_list[i].received = 0;
  409. }
  410. my_processor_list_entries = member_list_entries;
  411. memcpy (my_member_list, member_list,
  412. member_list_entries * sizeof (unsigned int));
  413. my_member_list_entries = member_list_entries;
  414. my_processing_idx = 0;
  415. memcpy (my_service_list, my_initial_service_list,
  416. sizeof (struct service_entry) *
  417. my_initial_service_list_entries);
  418. my_service_list_entries = my_initial_service_list_entries;
  419. for (i = 0; i < my_initial_service_list[i].service_id; i++) {
  420. service_build.service_list[i] =
  421. my_initial_service_list[i].service_id;
  422. }
  423. service_build.service_list_entries = i;
  424. service_build_message_transmit (&service_build);
  425. }
  426. static int schedwrk_processor (const void *context)
  427. {
  428. int res;
  429. if (my_service_list[my_processing_idx].state == INIT) {
  430. my_service_list[my_processing_idx].state = PROCESS;
  431. my_service_list[my_processing_idx].sync_init (my_member_list,
  432. my_member_list_entries,
  433. &my_ring_id);
  434. }
  435. if (my_service_list[my_processing_idx].state == PROCESS) {
  436. my_service_list[my_processing_idx].state = PROCESS;
  437. res = my_service_list[my_processing_idx].sync_process ();
  438. if (res != -1) {
  439. my_service_list[my_processing_idx].state = ACTIVATE;
  440. } else {
  441. return (-1);
  442. }
  443. }
  444. if (my_service_list[my_processing_idx].state == ACTIVATE) {
  445. my_service_list[my_processing_idx].state = ACTIVATE;
  446. my_service_list[my_processing_idx].sync_activate ();
  447. log_printf (LOGSYS_LEVEL_DEBUG, "Committing synchronization for %s\n",
  448. my_service_list[my_processing_idx].name);
  449. sync_barrier_enter();
  450. }
  451. return (0);
  452. }
  453. void sync_v2_start (
  454. const unsigned int *member_list,
  455. size_t member_list_entries,
  456. const struct memb_ring_id *ring_id)
  457. {
  458. memcpy (&my_ring_id, ring_id, sizeof (struct memb_ring_id));
  459. if (my_memb_determine) {
  460. my_memb_determine = 0;
  461. sync_servicelist_build_enter (my_memb_determine_list,
  462. my_memb_determine_list_entries, ring_id);
  463. } else {
  464. sync_servicelist_build_enter (member_list, member_list_entries,
  465. ring_id);
  466. }
  467. }
  468. void sync_v2_abort (void)
  469. {
  470. if (my_state == SYNC_PROCESS) {
  471. schedwrk_destroy (my_schedwrk_handle);
  472. my_service_list[my_processing_idx].sync_abort ();
  473. }
  474. }
  475. void sync_v2_memb_list_determine (const struct memb_ring_id *ring_id)
  476. {
  477. memcpy (&my_memb_determine_ring_id, ring_id,
  478. sizeof (struct memb_ring_id));
  479. memb_determine_message_transmit ();
  480. }
  481. void sync_v2_memb_list_abort (void)
  482. {
  483. my_memb_determine_list_entries = 0;
  484. }