clm.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  1. /*
  2. * Copyright (c) 2002-2004 MontaVista Software, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Steven Dake (sdake@mvista.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 <sys/types.h>
  35. #include <sys/socket.h>
  36. #include <sys/un.h>
  37. #include <sys/sysinfo.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 <signal.h>
  47. #include <time.h>
  48. #include <netinet/in.h>
  49. #include <arpa/inet.h>
  50. #include "../include/ais_types.h"
  51. #include "../include/ais_msg.h"
  52. #include "../include/list.h"
  53. #include "../include/queue.h"
  54. #include "aispoll.h"
  55. #include "gmi.h"
  56. #include "parse.h"
  57. #include "main.h"
  58. #include "print.h"
  59. #include "mempool.h"
  60. #include "handlers.h"
  61. SaClmClusterChangesT thisClusterNodeLastChange = SA_CLM_NODE_JOINED;
  62. SaClmClusterNodeT thisClusterNode;
  63. #define NODE_MAX 16
  64. SaClmClusterNodeT clusterNodes[NODE_MAX];
  65. int clusterNodeEntries = 0;
  66. static DECLARE_LIST_INIT (library_notification_send_listhead);
  67. SaClmClusterNodeT *clm_get_by_nodeid (struct in_addr node_id)
  68. {
  69. SaClmClusterNodeT *ret = NULL;
  70. int i;
  71. for (i = 0; i < clusterNodeEntries; i++) {
  72. if (clusterNodes[i].nodeId == node_id.s_addr) {
  73. ret = &clusterNodes[i];
  74. break;
  75. }
  76. }
  77. return (ret);
  78. }
  79. /*
  80. * Service Interfaces required by service_message_handler struct
  81. */
  82. static int clmExecutiveInitialize (void);
  83. static int clmConfChg (
  84. struct sockaddr_in *member_list, int member_list_entries,
  85. struct sockaddr_in *left_list, int left_list_entries,
  86. struct sockaddr_in *joined_list, int joined_list_entries);
  87. static int message_handler_req_exec_clm_nodejoin (void *message, struct in_addr source_addr);
  88. static int message_handler_req_clm_init (struct conn_info *conn_info,
  89. void *message);
  90. static int message_handler_req_lib_activatepoll (struct conn_info *conn_info,
  91. void *message);
  92. static int message_handler_req_clm_trackstart (struct conn_info *conn_info,
  93. void *message);
  94. static int message_handler_req_clm_trackstop (struct conn_info *conn_info,
  95. void *message);
  96. static int message_handler_req_clm_nodeget (struct conn_info *conn_info,
  97. void *message);
  98. static int clm_exit_fn (struct conn_info *conn_info);
  99. struct libais_handler clm_libais_handlers[] =
  100. {
  101. { /* 0 */
  102. .libais_handler_fn = message_handler_req_lib_activatepoll,
  103. .response_size = sizeof (struct res_lib_activatepoll),
  104. .response_id = MESSAGE_RES_LIB_ACTIVATEPOLL, // TODO RESPONSE
  105. .gmi_prio = GMI_PRIO_RECOVERY
  106. },
  107. { /* 1 */
  108. .libais_handler_fn = message_handler_req_clm_trackstart,
  109. .response_size = sizeof (struct res_clm_trackstart),
  110. .response_id = MESSAGE_RES_CLM_TRACKSTART, // TODO RESPONSE
  111. .gmi_prio = GMI_PRIO_RECOVERY
  112. },
  113. { /* 2 */
  114. .libais_handler_fn = message_handler_req_clm_trackstop,
  115. .response_size = sizeof (struct res_clm_trackstop),
  116. .response_id = MESSAGE_RES_CLM_TRACKSTOP, // TODO RESPONSE
  117. .gmi_prio = GMI_PRIO_RECOVERY
  118. },
  119. { /* 3 */
  120. .libais_handler_fn = message_handler_req_clm_nodeget,
  121. .response_size = sizeof (struct res_clm_nodeget),
  122. .response_id = MESSAGE_RES_CLM_NODEGET, // TODO RESPONSE
  123. .gmi_prio = GMI_PRIO_RECOVERY
  124. }
  125. };
  126. static int (*clm_aisexec_handler_fns[]) (void *, struct in_addr source_addr) = {
  127. message_handler_req_exec_clm_nodejoin
  128. };
  129. struct service_handler clm_service_handler = {
  130. .libais_handlers = clm_libais_handlers,
  131. .libais_handlers_count = sizeof (clm_libais_handlers) / sizeof (struct libais_handler),
  132. .aisexec_handler_fns = clm_aisexec_handler_fns,
  133. .aisexec_handler_fns_count = sizeof (clm_aisexec_handler_fns) / sizeof (int (*)),
  134. .confchg_fn = clmConfChg,
  135. .libais_init_fn = message_handler_req_clm_init,
  136. .libais_exit_fn = clm_exit_fn,
  137. .aisexec_init_fn = clmExecutiveInitialize
  138. };
  139. static int clmExecutiveInitialize (void)
  140. {
  141. memset (clusterNodes, 0, sizeof (SaClmClusterNodeT) * NODE_MAX);
  142. /*
  143. * Build local cluster node data structure
  144. */
  145. thisClusterNode.nodeId = this_ip.sin_addr.s_addr;
  146. memcpy (&thisClusterNode.nodeAddress.value, &this_ip.sin_addr, sizeof (struct in_addr));
  147. thisClusterNode.nodeAddress.length = sizeof (struct in_addr);
  148. strcpy (thisClusterNode.nodeName.value, (char *)inet_ntoa (this_ip.sin_addr));
  149. thisClusterNode.nodeName.length = strlen (thisClusterNode.nodeName.value);
  150. strcpy (thisClusterNode.clusterName.value, "mvlcge");
  151. thisClusterNode.clusterName.length = strlen ("mvlcge");
  152. thisClusterNode.member = 1;
  153. {
  154. struct sysinfo s_info;
  155. time_t current_time;
  156. sysinfo (&s_info);
  157. current_time = time (NULL);
  158. /* (currenttime (s) - uptime (s)) * 1 billion (ns) / 1 (s) */
  159. thisClusterNode.bootTimestamp = ((SaTimeT)(current_time - s_info.uptime)) * 1000000000;
  160. }
  161. #ifdef DEBUG
  162. printSaClmClusterNodeT ("this cluster node", &thisClusterNode);
  163. #endif
  164. memcpy (&clusterNodes[0], &thisClusterNode, sizeof (SaClmClusterNodeT));
  165. clusterNodeEntries = 1;
  166. return (0);
  167. }
  168. static int clm_exit_fn (struct conn_info *conn_info)
  169. {
  170. /*
  171. * Delete track entry if there is one
  172. */
  173. list_del (&conn_info->conn_list);
  174. return (0);
  175. }
  176. static void libraryNotificationCurrentState (struct conn_info *conn_info)
  177. {
  178. struct res_clm_trackcallback res_clm_trackcallback;
  179. SaClmClusterNotificationT clusterNotification[NODE_MAX];
  180. int i;
  181. if ((conn_info->ais_ci.u.libclm_ci.trackFlags & SA_TRACK_CURRENT) == 0) {
  182. return;
  183. }
  184. /*
  185. * Turn off track current
  186. */
  187. conn_info->ais_ci.u.libclm_ci.trackFlags &= ~SA_TRACK_CURRENT;
  188. /*
  189. * Build notification list
  190. */
  191. for (i = 0; i < clusterNodeEntries; i++) {
  192. clusterNotification[i].clusterChanges = SA_CLM_NODE_NO_CHANGE;
  193. memcpy (&clusterNotification[i].clusterNode, &clusterNodes[i],
  194. sizeof (SaClmClusterNodeT));
  195. }
  196. /*
  197. * Send track response
  198. */
  199. res_clm_trackcallback.header.size = sizeof (struct res_clm_trackcallback) +
  200. sizeof (SaClmClusterNotificationT) * i;
  201. res_clm_trackcallback.header.id = MESSAGE_RES_CLM_TRACKCALLBACK;
  202. res_clm_trackcallback.header.error = SA_OK;
  203. res_clm_trackcallback.viewNumber = 0;
  204. res_clm_trackcallback.numberOfItems = i;
  205. res_clm_trackcallback.numberOfMembers = i;
  206. res_clm_trackcallback.notificationBufferAddress =
  207. conn_info->ais_ci.u.libclm_ci.notificationBufferAddress;
  208. libais_send_response (conn_info, &res_clm_trackcallback, sizeof (struct res_clm_trackcallback));
  209. libais_send_response (conn_info, clusterNotification, sizeof (SaClmClusterNotificationT) * i);
  210. }
  211. void library_notification_send (SaClmClusterNotificationT *cluster_notification_entries,
  212. int notify_entries)
  213. {
  214. struct res_clm_trackcallback res_clm_trackcallback;
  215. struct conn_info *conn_info;
  216. struct list_head *list;
  217. for (list = library_notification_send_listhead.next;
  218. list != &library_notification_send_listhead;
  219. list = list->next) {
  220. conn_info = list_entry (list, struct conn_info, conn_list);
  221. /*
  222. * Send notifications to all CLM listeners
  223. */
  224. if (notify_entries) {
  225. res_clm_trackcallback.header.size = sizeof (struct res_clm_trackcallback) +
  226. (notify_entries * sizeof (SaClmClusterNotificationT));
  227. res_clm_trackcallback.header.id = MESSAGE_RES_CLM_TRACKCALLBACK;
  228. res_clm_trackcallback.header.error = SA_OK;
  229. res_clm_trackcallback.viewNumber = 0;
  230. res_clm_trackcallback.numberOfItems = notify_entries;
  231. res_clm_trackcallback.numberOfMembers = notify_entries;
  232. res_clm_trackcallback.notificationBufferAddress =
  233. conn_info->ais_ci.u.libclm_ci.notificationBufferAddress;
  234. libais_send_response (conn_info, &res_clm_trackcallback,
  235. sizeof (struct res_clm_trackcallback));
  236. libais_send_response (conn_info, cluster_notification_entries,
  237. sizeof (SaClmClusterNotificationT) * notify_entries);
  238. }
  239. }
  240. }
  241. static void libraryNotificationJoin (SaClmNodeIdT node)
  242. {
  243. SaClmClusterNotificationT clusterNotification;
  244. int i;
  245. /*
  246. * Generate notification element
  247. */
  248. clusterNotification.clusterChanges = SA_CLM_NODE_JOINED;
  249. for (i = 0; i < clusterNodeEntries; i++) {
  250. if (node == clusterNodes[i].nodeId) {
  251. memcpy (&clusterNotification.clusterNode, &clusterNodes[i],
  252. sizeof (SaClmClusterNodeT));
  253. }
  254. }
  255. library_notification_send (&clusterNotification, 1);
  256. }
  257. static void libraryNotificationLeave (SaClmNodeIdT *nodes, int nodes_entries)
  258. {
  259. SaClmClusterNotificationT clusterNotification[NODE_MAX];
  260. int i, j;
  261. int notifyEntries;
  262. /*
  263. * Determine notification list
  264. */
  265. for (notifyEntries = 0, i = 0; i < clusterNodeEntries; i++) {
  266. for (j = 0; j < nodes_entries; j++) {
  267. if (clusterNodes[i].nodeId == nodes[j]) {
  268. memcpy (&clusterNotification[notifyEntries].clusterNode,
  269. &clusterNodes[i],
  270. sizeof (SaClmClusterNodeT));
  271. clusterNotification[notifyEntries].clusterChanges = SA_CLM_NODE_LEFT;
  272. notifyEntries += 1;
  273. break;
  274. }
  275. }
  276. }
  277. library_notification_send (clusterNotification, notifyEntries);
  278. /*
  279. * Remove entries from clusterNodes array
  280. */
  281. for (i = 0; i < nodes_entries; i++) {
  282. for (j = 0; j < clusterNodeEntries;) {
  283. if (nodes[i] == clusterNodes[j].nodeId) {
  284. clusterNodeEntries -= 1;
  285. memmove (&clusterNodes[j], &clusterNodes[j + 1],
  286. (clusterNodeEntries - j) * sizeof (SaClmClusterNodeT));
  287. } else {
  288. /*
  289. * next clusterNode entry
  290. */
  291. j++;
  292. }
  293. }
  294. }
  295. }
  296. static int clmNodeJoinSend (void)
  297. {
  298. struct req_exec_clm_nodejoin req_exec_clm_nodejoin;
  299. struct iovec req_exec_clm_iovec;
  300. int result;
  301. req_exec_clm_nodejoin.header.size = sizeof (struct req_exec_clm_nodejoin);
  302. req_exec_clm_nodejoin.header.id = MESSAGE_REQ_EXEC_CLM_NODEJOIN;
  303. // TODO dont use memcpy, use iovecs !!
  304. memcpy (&req_exec_clm_nodejoin.clusterNode, &thisClusterNode,
  305. sizeof (SaClmClusterNodeT));
  306. req_exec_clm_iovec.iov_base = (char *)&req_exec_clm_nodejoin;
  307. req_exec_clm_iovec.iov_len = sizeof (req_exec_clm_nodejoin);
  308. result = gmi_mcast (&aisexec_groupname, &req_exec_clm_iovec, 1, GMI_PRIO_HIGH);
  309. return (result);
  310. }
  311. static int clmConfChg (
  312. struct sockaddr_in *member_list, int member_list_entries,
  313. struct sockaddr_in *left_list, int left_list_entries,
  314. struct sockaddr_in *joined_list, int joined_list_entries) {
  315. int i;
  316. SaClmNodeIdT nodes[NODE_MAX];
  317. log_printf (LOG_LEVEL_NOTICE, "CLM CONFIGURATION CHANGE\n");
  318. log_printf (LOG_LEVEL_NOTICE, "New Configuration:\n");
  319. for (i = 0; i < member_list_entries; i++) {
  320. log_printf (LOG_LEVEL_NOTICE, "\t%s\n", inet_ntoa (member_list[i].sin_addr));
  321. }
  322. log_printf (LOG_LEVEL_NOTICE, "Members Left:\n");
  323. for (i = 0; i < left_list_entries; i++) {
  324. log_printf (LOG_LEVEL_NOTICE, "\t%s\n", inet_ntoa (left_list[i].sin_addr));
  325. }
  326. log_printf (LOG_LEVEL_NOTICE, "Members Joined:\n");
  327. for (i = 0; i < joined_list_entries; i++) {
  328. log_printf (LOG_LEVEL_NOTICE, "\t%s\n", inet_ntoa (joined_list[i].sin_addr));
  329. }
  330. /*
  331. * Send node information to other nodes
  332. */
  333. if (joined_list_entries) {
  334. clmNodeJoinSend ();
  335. }
  336. for (i = 0; i < left_list_entries; i++) {
  337. nodes[i] = left_list[i].sin_addr.s_addr;
  338. }
  339. libraryNotificationLeave (nodes, i);
  340. return (0);
  341. }
  342. static int message_handler_req_exec_clm_nodejoin (void *message, struct in_addr source_addr)
  343. {
  344. struct req_exec_clm_nodejoin *req_exec_clm_nodejoin = (struct req_exec_clm_nodejoin *)message;
  345. int found;
  346. int i;
  347. log_printf (LOG_LEVEL_NOTICE, "got nodejoin message %s\n", req_exec_clm_nodejoin->clusterNode.nodeName.value);
  348. /*
  349. * Determine if nodejoin already received
  350. */
  351. for (found = 0, i = 0; i < clusterNodeEntries; i++) {
  352. if (memcmp (&clusterNodes[i], &req_exec_clm_nodejoin->clusterNode,
  353. sizeof (SaClmClusterNodeT)) == 0) {
  354. found = 1;
  355. }
  356. }
  357. /*
  358. * If not received, add to internal list
  359. */
  360. if (found == 0) {
  361. memcpy (&clusterNodes[clusterNodeEntries],
  362. &req_exec_clm_nodejoin->clusterNode,
  363. sizeof (SaClmClusterNodeT));
  364. clusterNodeEntries += 1;
  365. libraryNotificationJoin (req_exec_clm_nodejoin->clusterNode.nodeId);
  366. }
  367. return (0);
  368. }
  369. static int message_handler_req_clm_init (struct conn_info *conn_info, void *message)
  370. {
  371. SaErrorT error = SA_ERR_SECURITY;
  372. struct res_lib_init res_lib_init;
  373. log_printf (LOG_LEVEL_DEBUG, "Got request to initalize cluster membership service.\n");
  374. if (conn_info->authenticated) {
  375. conn_info->service = SOCKET_SERVICE_CLM;
  376. error = SA_OK;
  377. }
  378. res_lib_init.header.size = sizeof (struct res_lib_init);
  379. res_lib_init.header.id = MESSAGE_RES_INIT;
  380. res_lib_init.header.error = error;
  381. libais_send_response (conn_info, &res_lib_init, sizeof (res_lib_init));
  382. list_init (&conn_info->conn_list);
  383. if (conn_info->authenticated) {
  384. return (0);
  385. }
  386. return (-1);
  387. }
  388. static int message_handler_req_lib_activatepoll (struct conn_info *conn_info, void *message)
  389. {
  390. struct res_lib_activatepoll res_lib_activatepoll;
  391. res_lib_activatepoll.header.size = sizeof (struct res_lib_activatepoll);
  392. res_lib_activatepoll.header.id = MESSAGE_RES_LIB_ACTIVATEPOLL;
  393. res_lib_activatepoll.header.error = SA_OK;
  394. libais_send_response (conn_info, &res_lib_activatepoll,
  395. sizeof (struct res_lib_activatepoll));
  396. return (0);
  397. }
  398. int message_handler_req_clm_trackstart (struct conn_info *conn_info, void *message)
  399. {
  400. struct req_clm_trackstart *req_clm_trackstart = (struct req_clm_trackstart *)message;
  401. conn_info->ais_ci.u.libclm_ci.trackFlags = req_clm_trackstart->trackFlags;
  402. conn_info->ais_ci.u.libclm_ci.notificationBufferAddress = req_clm_trackstart->notificationBufferAddress;
  403. list_add (&conn_info->conn_list, &library_notification_send_listhead);
  404. libraryNotificationCurrentState (conn_info);
  405. return (0);
  406. }
  407. static int message_handler_req_clm_trackstop (struct conn_info *conn_info, void *message)
  408. {
  409. conn_info->ais_ci.u.libclm_ci.trackFlags = 0;
  410. conn_info->ais_ci.u.libclm_ci.notificationBufferAddress = 0;
  411. list_del (&conn_info->conn_list);
  412. return (0);
  413. }
  414. static int message_handler_req_clm_nodeget (struct conn_info *conn_info, void *message)
  415. {
  416. struct req_clm_nodeget *req_clm_nodeget = (struct req_clm_nodeget *)message;
  417. struct res_clm_nodeget res_clm_nodeget;
  418. SaClmClusterNodeT *clusterNode = 0;
  419. int valid = 0;
  420. int i;
  421. log_printf (LOG_LEVEL_DEBUG, "nodeget: trying to find node %x\n", (int)req_clm_nodeget->nodeId);
  422. if (req_clm_nodeget->nodeId == SA_CLM_LOCAL_NODE_ID) {
  423. clusterNode = &clusterNodes[0];
  424. valid = 1;
  425. } else
  426. for (i = 0; i < clusterNodeEntries; i++) {
  427. if (clusterNodes[i].nodeId == req_clm_nodeget->nodeId) {
  428. log_printf (LOG_LEVEL_DEBUG, "found host that matches one desired in nodeget.\n");
  429. clusterNode = &clusterNodes[i];
  430. valid = 1;
  431. break;
  432. }
  433. }
  434. res_clm_nodeget.header.size = sizeof (struct res_clm_nodeget);
  435. res_clm_nodeget.header.id = MESSAGE_RES_CLM_NODEGET;
  436. res_clm_nodeget.header.error = SA_OK;
  437. res_clm_nodeget.invocation = req_clm_nodeget->invocation;
  438. res_clm_nodeget.clusterNodeAddress = req_clm_nodeget->clusterNodeAddress;
  439. res_clm_nodeget.valid = valid;
  440. if (valid) {
  441. memcpy (&res_clm_nodeget.clusterNode, clusterNode, sizeof (SaClmClusterNodeT));
  442. }
  443. libais_send_response (conn_info, &res_clm_nodeget, sizeof (struct res_clm_nodeget));
  444. return (0);
  445. }