corosync-quorumtool.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624
  1. /*
  2. * Copyright (c) 2009-2012 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Authors: Christine Caulfield <ccaulfie@redhat.com>
  7. * Fabio M. Di Nitto (fdinitto@redhat.com)
  8. *
  9. * This software licensed under BSD license, the text of which follows:
  10. *
  11. * Redistribution and use in source and binary forms, with or without
  12. * modification, are permitted provided that the following conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above copyright notice,
  15. * this list of conditions and the following disclaimer.
  16. * - Redistributions in binary form must reproduce the above copyright notice,
  17. * this list of conditions and the following disclaimer in the documentation
  18. * and/or other materials provided with the distribution.
  19. * - Neither the name of the Red Hat Inc. nor the names of its
  20. * contributors may be used to endorse or promote products derived from this
  21. * software without specific prior written permission.
  22. *
  23. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  24. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  25. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  26. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  27. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  28. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  29. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  30. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  31. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  32. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  33. * THE POSSIBILITY OF SUCH DAMAGE.
  34. */
  35. #include <config.h>
  36. #include <stdio.h>
  37. #include <stdlib.h>
  38. #include <errno.h>
  39. #include <unistd.h>
  40. #include <string.h>
  41. #include <pthread.h>
  42. #include <inttypes.h>
  43. #include <sys/types.h>
  44. #include <sys/socket.h>
  45. #include <sys/select.h>
  46. #include <sys/un.h>
  47. #include <netinet/in.h>
  48. #include <arpa/inet.h>
  49. #include <netdb.h>
  50. #include <corosync/corotypes.h>
  51. #include <corosync/totem/totem.h>
  52. #include <corosync/cfg.h>
  53. #include <corosync/cmap.h>
  54. #include <corosync/quorum.h>
  55. #include <corosync/votequorum.h>
  56. typedef enum {
  57. NODEID_FORMAT_DECIMAL,
  58. NODEID_FORMAT_HEX
  59. } nodeid_format_t;
  60. typedef enum {
  61. ADDRESS_FORMAT_NAME,
  62. ADDRESS_FORMAT_IP
  63. } name_format_t;
  64. typedef enum {
  65. CMD_UNKNOWN,
  66. CMD_SHOWNODES,
  67. CMD_SHOWSTATUS,
  68. CMD_SETVOTES,
  69. CMD_SETEXPECTED,
  70. CMD_MONITOR
  71. } command_t;
  72. /*
  73. * global vars
  74. */
  75. /*
  76. * cmap bits
  77. */
  78. static cmap_handle_t cmap_handle;
  79. /*
  80. * quorum bits
  81. */
  82. static void quorum_notification_fn(
  83. quorum_handle_t handle,
  84. uint32_t quorate,
  85. uint64_t ring_id,
  86. uint32_t view_list_entries,
  87. uint32_t *view_list);
  88. static quorum_handle_t q_handle;
  89. static uint32_t q_type;
  90. static quorum_callbacks_t q_callbacks = {
  91. .quorum_notify_fn = quorum_notification_fn
  92. };
  93. /*
  94. * quorum call back vars
  95. */
  96. static uint32_t g_quorate;
  97. static uint64_t g_ring_id;
  98. static uint32_t g_view_list_entries;
  99. static uint32_t *g_view_list = NULL;
  100. static uint32_t g_called;
  101. /*
  102. * votequorum bits
  103. */
  104. static votequorum_handle_t v_handle;
  105. static votequorum_callbacks_t v_callbacks = {
  106. .votequorum_notify_fn = NULL,
  107. .votequorum_expectedvotes_notify_fn = NULL
  108. };
  109. /*
  110. * cfg bits
  111. */
  112. static corosync_cfg_handle_t c_handle;
  113. static corosync_cfg_callbacks_t c_callbacks = {
  114. .corosync_cfg_state_track_callback = NULL,
  115. .corosync_cfg_shutdown_callback = NULL
  116. };
  117. static void show_usage(const char *name)
  118. {
  119. printf("usage: \n");
  120. printf("%s <options>\n", name);
  121. printf("\n");
  122. printf(" options:\n");
  123. printf("\n");
  124. printf(" -s show quorum status\n");
  125. printf(" -m monitor quorum status\n");
  126. printf(" -l list nodes\n");
  127. printf(" -v <votes> change the number of votes for a node *\n");
  128. printf(" -n <nodeid> optional nodeid of node for -v\n");
  129. printf(" -e <expected> change expected votes for the cluster *\n");
  130. printf(" -H show nodeids in hexadecimal rather than decimal\n");
  131. printf(" -i show node IP addresses instead of the resolved name\n");
  132. printf(" -h show this help text\n");
  133. printf("\n");
  134. printf(" * Starred items only work if votequorum is the quorum provider for corosync\n");
  135. printf("\n");
  136. }
  137. static int get_quorum_type(char *quorum_type, size_t quorum_type_len)
  138. {
  139. int err;
  140. char *str;
  141. if ((!quorum_type) || (quorum_type_len <= 0)) {
  142. errno = EINVAL;
  143. return -1;
  144. }
  145. if (q_type == QUORUM_FREE) {
  146. return -1;
  147. }
  148. if ((err = cmap_get_string(cmap_handle, "quorum.provider", &str)) != CS_OK) {
  149. goto out;
  150. }
  151. strncpy(quorum_type, str, quorum_type_len - 1);
  152. free(str);
  153. return 0;
  154. out:
  155. return err;
  156. }
  157. /*
  158. * Returns 1 if 'votequorum' is active. The called then knows that
  159. * votequorum calls should work and can provide extra information
  160. */
  161. static int using_votequorum(void)
  162. {
  163. char quorumtype[256];
  164. int using_voteq;
  165. if (get_quorum_type(quorumtype, sizeof(quorumtype))) {
  166. return -1;
  167. }
  168. if (strcmp(quorumtype, "corosync_votequorum") == 0) {
  169. using_voteq = 1;
  170. } else {
  171. using_voteq = 0;
  172. }
  173. return using_voteq;
  174. }
  175. static int set_votes(uint32_t nodeid, int votes)
  176. {
  177. int err;
  178. if ((err=votequorum_setvotes(v_handle, nodeid, votes)) != CS_OK) {
  179. fprintf(stderr, "set votes FAILED: %d\n", err);
  180. }
  181. return err==CS_OK?0:err;
  182. }
  183. static int set_expected(int expected_votes)
  184. {
  185. int err;
  186. if ((err=votequorum_setexpected(v_handle, expected_votes)) != CS_OK) {
  187. fprintf(stderr, "set expected votes FAILED: %d\n", err);
  188. }
  189. return err==CS_OK?0:err;
  190. }
  191. static int get_votes(uint32_t nodeid)
  192. {
  193. int votes = -1;
  194. struct votequorum_info info;
  195. if (votequorum_getinfo(v_handle, nodeid, &info) == CS_OK) {
  196. votes = info.node_votes;
  197. }
  198. return votes;
  199. }
  200. /*
  201. * This resolves the first address assigned to a node
  202. * and returns the name or IP address. Use cfgtool if you need more information.
  203. */
  204. static const char *node_name(uint32_t nodeid, name_format_t name_format)
  205. {
  206. int err;
  207. int numaddrs;
  208. corosync_cfg_node_address_t addrs[INTERFACE_MAX];
  209. static char buf[INET6_ADDRSTRLEN];
  210. socklen_t addrlen;
  211. struct sockaddr_storage *ss;
  212. err = corosync_cfg_get_node_addrs(c_handle, nodeid, INTERFACE_MAX, &numaddrs, addrs);
  213. if (err != CS_OK) {
  214. fprintf(stderr, "Unable to get node address for nodeid %u: %d\n", nodeid, err);
  215. return "";
  216. }
  217. ss = (struct sockaddr_storage *)addrs[0].address;
  218. if (ss->ss_family == AF_INET6) {
  219. addrlen = sizeof(struct sockaddr_in6);
  220. } else {
  221. addrlen = sizeof(struct sockaddr_in);
  222. }
  223. if (!getnameinfo(
  224. (struct sockaddr *)addrs[0].address, addrlen,
  225. buf, sizeof(buf),
  226. NULL, 0,
  227. (name_format == ADDRESS_FORMAT_IP)?NI_NUMERICHOST:0)) {
  228. return buf;
  229. }
  230. return "";
  231. }
  232. static void quorum_notification_fn(
  233. quorum_handle_t handle,
  234. uint32_t quorate,
  235. uint64_t ring_id,
  236. uint32_t view_list_entries,
  237. uint32_t *view_list)
  238. {
  239. g_called = 1;
  240. g_quorate = quorate;
  241. g_ring_id = ring_id;
  242. g_view_list_entries = view_list_entries;
  243. if (g_view_list) {
  244. free(g_view_list);
  245. }
  246. g_view_list = malloc(sizeof(uint32_t) * view_list_entries);
  247. if (g_view_list) {
  248. memcpy(g_view_list, view_list,sizeof(uint32_t) * view_list_entries);
  249. }
  250. }
  251. static int display_quorum_data(int is_quorate)
  252. {
  253. struct votequorum_info info;
  254. int err;
  255. char quorum_type[256];
  256. printf("Version: %s\n", VERSION);
  257. printf("Nodes: %d\n", g_view_list_entries);
  258. printf("Ring ID: %" PRIu64 "\n", g_ring_id);
  259. if (get_quorum_type(quorum_type, sizeof(quorum_type))) {
  260. strncpy(quorum_type, "Not configured", sizeof(quorum_type) - 1);
  261. }
  262. printf("Quorum type: %s\n", quorum_type);
  263. printf("Quorate: %s\n", is_quorate?"Yes":"No");
  264. if (!v_handle) {
  265. return CS_OK;
  266. }
  267. if ((err=votequorum_getinfo(v_handle, 0, &info)) == CS_OK) {
  268. printf("Node votes: %d\n", info.node_votes);
  269. printf("Expected votes: %d\n", info.node_expected_votes);
  270. printf("Highest expected: %d\n", info.highest_expected);
  271. printf("Total votes: %d\n", info.total_votes);
  272. printf("Quorum: %d %s\n", info.quorum, info.flags & VOTEQUORUM_INFO_FLAG_QUORATE?" ":"Activity blocked");
  273. printf("Flags: ");
  274. if (info.flags & VOTEQUORUM_INFO_FLAG_TWONODE) printf("2Node ");
  275. if (info.flags & VOTEQUORUM_INFO_FLAG_QUORATE) printf("Quorate ");
  276. printf("\n");
  277. } else {
  278. fprintf(stderr, "votequorum_getinfo FAILED: %d\n", err);
  279. }
  280. return err;
  281. }
  282. /*
  283. * return 1 if quorate
  284. * 0 if not quorate
  285. * -1 on error
  286. */
  287. static int show_status(void)
  288. {
  289. int is_quorate;
  290. int err;
  291. err=quorum_getquorate(q_handle, &is_quorate);
  292. if (err != CS_OK) {
  293. fprintf(stderr, "quorum_getquorate FAILED: %d\n", err);
  294. goto quorum_err;
  295. }
  296. err=quorum_trackstart(q_handle, CS_TRACK_CURRENT);
  297. if (err != CS_OK) {
  298. fprintf(stderr, "quorum_trackstart FAILED: %d\n", err);
  299. goto quorum_err;
  300. }
  301. g_called = 0;
  302. while (g_called == 0 && err == CS_OK) {
  303. err = quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  304. if (err != CS_OK) {
  305. fprintf(stderr, "quorum_dispatch FAILED: %d\n", err);
  306. }
  307. }
  308. if (quorum_trackstop(q_handle) != CS_OK) {
  309. fprintf(stderr, "quorum_trackstop FAILED: %d\n", err);
  310. }
  311. quorum_err:
  312. if (err < 0) {
  313. return err;
  314. }
  315. err = display_quorum_data(is_quorate);
  316. if (err != CS_OK) {
  317. return err;
  318. }
  319. return is_quorate;
  320. }
  321. static int monitor_status(nodeid_format_t nodeid_format, name_format_t name_format) {
  322. int err;
  323. if (q_type == QUORUM_FREE) {
  324. show_status();
  325. printf("\nQuorum is not configured - cannot monitor\n");
  326. return 0;
  327. }
  328. err=quorum_trackstart(q_handle, CS_TRACK_CHANGES);
  329. if (err != CS_OK) {
  330. fprintf(stderr, "quorum_trackstart FAILED: %d\n", err);
  331. goto quorum_err;
  332. }
  333. while (1) {
  334. time_t t;
  335. err = quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  336. if (err != CS_OK) {
  337. fprintf(stderr, "quorum_dispatch FAILED: %d\n", err);
  338. goto quorum_err;
  339. }
  340. time(&t);
  341. printf("\ndate: %s", ctime((const time_t *)&t));
  342. err = display_quorum_data(g_quorate);
  343. if (err != CS_OK) {
  344. fprintf(stderr, "display_quorum_data FAILED: %d\n", err);
  345. goto quorum_err;
  346. }
  347. }
  348. quorum_err:
  349. return err;
  350. }
  351. static int show_nodes(nodeid_format_t nodeid_format, name_format_t name_format)
  352. {
  353. int i;
  354. int err;
  355. int result = EXIT_FAILURE;
  356. err = quorum_trackstart(q_handle, CS_TRACK_CURRENT);
  357. if (err != CS_OK) {
  358. fprintf(stderr, "quorum_trackstart FAILED: %d\n", err);
  359. goto err_exit;
  360. }
  361. g_called = 0;
  362. while (g_called == 0) {
  363. quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  364. }
  365. quorum_finalize(q_handle);
  366. q_handle = 0;
  367. err = corosync_cfg_initialize(&c_handle, &c_callbacks);
  368. if (err != CS_OK) {
  369. fprintf(stderr, "Cannot initialise CFG service\n");
  370. c_handle = 0;
  371. goto err_exit;
  372. }
  373. if (v_handle) {
  374. printf("Nodeid Votes Name\n");
  375. } else {
  376. printf("Nodeid Name\n");
  377. }
  378. for (i=0; i < g_view_list_entries; i++) {
  379. if (nodeid_format == NODEID_FORMAT_DECIMAL) {
  380. printf("%4u ", g_view_list[i]);
  381. } else {
  382. printf("0x%04x ", g_view_list[i]);
  383. }
  384. if (v_handle) {
  385. printf("%3d %s\n", get_votes(g_view_list[i]), node_name(g_view_list[i], name_format));
  386. } else {
  387. printf("%s\n", node_name(g_view_list[i], name_format));
  388. }
  389. }
  390. result = EXIT_SUCCESS;
  391. err_exit:
  392. return result;
  393. }
  394. /*
  395. * return -1 on error
  396. * 0 if OK
  397. */
  398. static int init_all(void) {
  399. cmap_handle = 0;
  400. q_handle = 0;
  401. v_handle = 0;
  402. c_handle = 0;
  403. if (cmap_initialize(&cmap_handle) != CS_OK) {
  404. fprintf(stderr, "Cannot initialize CMAP service\n");
  405. cmap_handle = 0;
  406. goto out;
  407. }
  408. if (quorum_initialize(&q_handle, &q_callbacks, &q_type) != CS_OK) {
  409. fprintf(stderr, "Cannot initialize QUORUM service\n");
  410. q_handle = 0;
  411. goto out;
  412. }
  413. if (corosync_cfg_initialize(&c_handle, &c_callbacks) != CS_OK) {
  414. fprintf(stderr, "Cannot initialise CFG service\n");
  415. c_handle = 0;
  416. goto out;
  417. }
  418. if (using_votequorum() <= 0) {
  419. return 0;
  420. }
  421. if (votequorum_initialize(&v_handle, &v_callbacks) != CS_OK) {
  422. fprintf(stderr, "Cannot initialise VOTEQUORUM service\n");
  423. v_handle = 0;
  424. goto out;
  425. }
  426. return 0;
  427. out:
  428. return -1;
  429. }
  430. static void close_all(void) {
  431. if (cmap_handle) {
  432. cmap_finalize(cmap_handle);
  433. }
  434. if (q_handle) {
  435. quorum_finalize(q_handle);
  436. }
  437. if (c_handle) {
  438. corosync_cfg_finalize(c_handle);
  439. }
  440. if (v_handle) {
  441. votequorum_finalize(v_handle);
  442. }
  443. }
  444. int main (int argc, char *argv[]) {
  445. const char *options = "VHslme:v:hin:d:";
  446. char *endptr;
  447. int opt;
  448. int votes = 0;
  449. int ret = 0;
  450. uint32_t nodeid = VOTEQUORUM_NODEID_US;
  451. nodeid_format_t nodeid_format = NODEID_FORMAT_DECIMAL;
  452. name_format_t address_format = ADDRESS_FORMAT_NAME;
  453. command_t command_opt = CMD_UNKNOWN;
  454. if (argc == 1) {
  455. show_usage (argv[0]);
  456. exit(0);
  457. }
  458. if (init_all()) {
  459. close_all();
  460. exit(1);
  461. }
  462. while ( (opt = getopt(argc, argv, options)) != -1 ) {
  463. switch (opt) {
  464. case 's':
  465. command_opt = CMD_SHOWSTATUS;
  466. break;
  467. case 'm':
  468. command_opt = CMD_MONITOR;
  469. break;
  470. case 'i':
  471. address_format = ADDRESS_FORMAT_IP;
  472. break;
  473. case 'H':
  474. nodeid_format = NODEID_FORMAT_HEX;
  475. break;
  476. case 'l':
  477. command_opt = CMD_SHOWNODES;
  478. break;
  479. case 'e':
  480. if (using_votequorum() > 0) {
  481. votes = strtol(optarg, &endptr, 0);
  482. if ((votes == 0 && endptr == optarg) || votes <= 0) {
  483. fprintf(stderr, "New expected votes value was not valid, try a positive number\n");
  484. } else {
  485. command_opt = CMD_SETEXPECTED;
  486. }
  487. } else {
  488. fprintf(stderr, "You cannot change expected votes, corosync is not using votequorum\n");
  489. exit(2);
  490. }
  491. break;
  492. case 'n':
  493. nodeid = strtol(optarg, &endptr, 0);
  494. if ((nodeid == 0 && endptr == optarg) || nodeid <= 0) {
  495. fprintf(stderr, "The nodeid was not valid, try a positive number\n");
  496. }
  497. break;
  498. case 'v':
  499. if (using_votequorum() > 0) {
  500. votes = strtol(optarg, &endptr, 0);
  501. if ((votes == 0 && endptr == optarg) || votes < 0) {
  502. fprintf(stderr, "New votes value was not valid, try a positive number or zero\n");
  503. } else {
  504. command_opt = CMD_SETVOTES;
  505. }
  506. }
  507. else {
  508. fprintf(stderr, "You cannot change node votes, corosync is not using votequorum\n");
  509. exit(2);
  510. }
  511. break;
  512. case 'h':
  513. case '?':
  514. default:
  515. break;
  516. }
  517. }
  518. switch (command_opt) {
  519. case CMD_UNKNOWN:
  520. show_usage(argv[0]);
  521. ret = -1;
  522. break;
  523. case CMD_SHOWNODES:
  524. ret = show_nodes(nodeid_format, address_format);
  525. break;
  526. case CMD_SHOWSTATUS:
  527. ret = show_status();
  528. break;
  529. case CMD_SETVOTES:
  530. ret = set_votes(nodeid, votes);
  531. break;
  532. case CMD_SETEXPECTED:
  533. ret = set_expected(votes);
  534. break;
  535. case CMD_MONITOR:
  536. ret = monitor_status(nodeid_format, address_format);
  537. break;
  538. }
  539. close_all();
  540. return (ret);
  541. }