corosync-quorumtool.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026
  1. /*
  2. * Copyright (c) 2009-2019 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 <string.h>
  39. #include <sys/types.h>
  40. #include <sys/socket.h>
  41. #include <netdb.h>
  42. #include <limits.h>
  43. #include <corosync/totem/totem.h>
  44. #include <corosync/cfg.h>
  45. #include <corosync/cmap.h>
  46. #include <corosync/quorum.h>
  47. #include <corosync/votequorum.h>
  48. typedef enum {
  49. NODEID_FORMAT_DECIMAL,
  50. NODEID_FORMAT_HEX
  51. } nodeid_format_t;
  52. typedef enum {
  53. ADDRESS_FORMAT_NAME,
  54. ADDRESS_FORMAT_IP
  55. } name_format_t;
  56. typedef enum {
  57. CMD_UNKNOWN,
  58. CMD_SHOWNODES,
  59. CMD_SHOWSTATUS,
  60. CMD_SETVOTES,
  61. CMD_SETEXPECTED,
  62. CMD_MONITOR,
  63. CMD_UNREGISTER_QDEVICE
  64. } command_t;
  65. typedef enum {
  66. SORT_ADDR,
  67. SORT_NODEID,
  68. SORT_NODENAME
  69. } sorttype_t;
  70. #define EXIT_NOT_QUORATE 2
  71. /*
  72. * global vars
  73. */
  74. /*
  75. * cmap bits
  76. */
  77. static cmap_handle_t cmap_handle;
  78. /*
  79. * quorum bits
  80. */
  81. static void quorum_notification_fn(
  82. quorum_handle_t handle,
  83. uint32_t quorate,
  84. uint64_t ring_id,
  85. uint32_t view_list_entries,
  86. uint32_t *view_list);
  87. static quorum_handle_t q_handle;
  88. static uint32_t q_type;
  89. static quorum_callbacks_t q_callbacks = {
  90. .quorum_notify_fn = quorum_notification_fn
  91. };
  92. /*
  93. * quorum call back vars
  94. */
  95. /* Containing struct to keep votequorum & normal quorum bits together */
  96. typedef struct {
  97. struct votequorum_info *vq_info; /* Might be NULL if votequorum not present */
  98. char *name; /* Might be IP address or NULL */
  99. int node_id; /* Always present */
  100. } view_list_entry_t;
  101. static view_list_entry_t *g_view_list;
  102. static uint32_t g_quorate;
  103. static uint64_t g_ring_id;
  104. static uint32_t g_ring_id_rep_node;
  105. static uint32_t g_view_list_entries;
  106. static uint32_t g_called;
  107. static uint32_t g_vq_called;
  108. static uint32_t g_show_all_addrs = 0;
  109. /*
  110. * votequorum bits
  111. */
  112. static void votequorum_notification_fn(
  113. votequorum_handle_t handle,
  114. uint64_t context,
  115. votequorum_ring_id_t ring_id,
  116. uint32_t node_list_entries,
  117. uint32_t node_list[]);
  118. static votequorum_handle_t v_handle;
  119. static votequorum_callbacks_t v_callbacks = {
  120. .votequorum_quorum_notify_fn = NULL,
  121. .votequorum_expectedvotes_notify_fn = NULL,
  122. .votequorum_nodelist_notify_fn = votequorum_notification_fn,
  123. };
  124. static uint32_t our_nodeid = 0;
  125. /*
  126. * cfg bits
  127. */
  128. static corosync_cfg_handle_t c_handle;
  129. static corosync_cfg_callbacks_t c_callbacks = {
  130. .corosync_cfg_shutdown_callback = NULL
  131. };
  132. /*
  133. * global
  134. */
  135. static int machine_parsable = 0;
  136. static void show_usage(const char *name)
  137. {
  138. printf("usage: \n");
  139. printf("%s <options>\n", name);
  140. printf("\n");
  141. printf(" options:\n");
  142. printf("\n");
  143. printf(" -s show quorum status\n");
  144. printf(" -m constantly monitor quorum status\n");
  145. printf(" -l list nodes\n");
  146. printf(" -a show all names or addresses for each node\n");
  147. printf(" -p when used with -s or -l, generates machine parsable output\n");
  148. printf(" -v <votes> change the number of votes for a node (*)\n");
  149. printf(" -n <nodeid> optional nodeid of node for -v\n");
  150. printf(" -e <expected> change expected votes for the cluster (*)\n");
  151. printf(" -H show nodeids in hexadecimal rather than decimal\n");
  152. printf(" -i show node IP addresses instead of the resolved name\n");
  153. printf(" -o <a|n|i> order by [a] IP address (default), [n] name, [i] nodeid\n");
  154. printf(" -f forcefully unregister a quorum device *DANGEROUS* (*)\n");
  155. printf(" -h show this help text\n");
  156. printf(" -V show version and exit\n");
  157. printf("\n");
  158. printf(" (*) Starred items only work if votequorum is the quorum provider for corosync\n");
  159. printf("\n");
  160. }
  161. static int get_quorum_type(char *quorum_type, size_t quorum_type_len)
  162. {
  163. int err;
  164. char *str = NULL;
  165. if ((!quorum_type) || (quorum_type_len <= 0)) {
  166. return -1;
  167. }
  168. if (q_type == QUORUM_FREE) {
  169. return -1;
  170. }
  171. if ((err = cmap_get_string(cmap_handle, "quorum.provider", &str)) != CS_OK) {
  172. goto out;
  173. }
  174. if (!str) {
  175. return -1;
  176. }
  177. strncpy(quorum_type, str, quorum_type_len - 1);
  178. free(str);
  179. return 0;
  180. out:
  181. return err;
  182. }
  183. /*
  184. * Returns 1 if 'votequorum' is active. The called then knows that
  185. * votequorum calls should work and can provide extra information
  186. */
  187. static int using_votequorum(void)
  188. {
  189. char quorumtype[256];
  190. int using_voteq;
  191. memset(quorumtype, 0, sizeof(quorumtype));
  192. if (get_quorum_type(quorumtype, sizeof(quorumtype))) {
  193. return -1;
  194. }
  195. if (strcmp(quorumtype, "corosync_votequorum") == 0) {
  196. using_voteq = 1;
  197. } else {
  198. using_voteq = 0;
  199. }
  200. return using_voteq;
  201. }
  202. static int set_votes(uint32_t nodeid, int votes)
  203. {
  204. int err;
  205. if ((err=votequorum_setvotes(v_handle, nodeid, votes)) != CS_OK) {
  206. fprintf(stderr, "Unable to set votes %d for nodeid: %u: %s\n",
  207. votes, nodeid, cs_strerror(err));
  208. }
  209. return (err == CS_OK ? EXIT_SUCCESS : EXIT_FAILURE);
  210. }
  211. static int set_expected(int expected_votes)
  212. {
  213. int err;
  214. if ((err=votequorum_setexpected(v_handle, expected_votes)) != CS_OK) {
  215. fprintf(stderr, "Unable to set expected votes: %s\n", cs_strerror(err));
  216. }
  217. return (err == CS_OK ? EXIT_SUCCESS : EXIT_FAILURE);
  218. }
  219. /*
  220. * node name by nodelist
  221. */
  222. static const char *node_name_by_nodelist(uint32_t nodeid)
  223. {
  224. cmap_iter_handle_t iter;
  225. char key_name[CMAP_KEYNAME_MAXLEN + 1];
  226. char tmp_key[CMAP_KEYNAME_MAXLEN + 1];
  227. static char ret_buf[_POSIX_HOST_NAME_MAX];
  228. char *str = NULL;
  229. uint32_t node_pos, cur_nodeid;
  230. int res = 0;
  231. if (cmap_iter_init(cmap_handle, "nodelist.node.", &iter) != CS_OK) {
  232. return "";
  233. }
  234. memset(ret_buf, 0, sizeof(ret_buf));
  235. while ((cmap_iter_next(cmap_handle, iter, key_name, NULL, NULL)) == CS_OK) {
  236. res = sscanf(key_name, "nodelist.node.%u.%s", &node_pos, tmp_key);
  237. if (res != 2) {
  238. continue;
  239. }
  240. if (strcmp(tmp_key, "ring0_addr") != 0) {
  241. continue;
  242. }
  243. snprintf(tmp_key, CMAP_KEYNAME_MAXLEN, "nodelist.node.%u.nodeid", node_pos);
  244. if (cmap_get_uint32(cmap_handle, tmp_key, &cur_nodeid) != CS_OK) {
  245. continue;
  246. }
  247. if (cur_nodeid != nodeid) {
  248. continue;
  249. }
  250. snprintf(tmp_key, CMAP_KEYNAME_MAXLEN, "nodelist.node.%u.ring0_addr", node_pos);
  251. if (cmap_get_string(cmap_handle, tmp_key, &str) != CS_OK) {
  252. continue;
  253. }
  254. if (!str) {
  255. continue;
  256. }
  257. strncpy(ret_buf, str, sizeof(ret_buf) - 1);
  258. free(str);
  259. break;
  260. }
  261. cmap_iter_finalize(cmap_handle, iter);
  262. return ret_buf;
  263. }
  264. /*
  265. * This resolves the first address assigned to a node
  266. * and returns the name or IP address. Use cfgtool if you need more information.
  267. */
  268. static const char *node_name(uint32_t nodeid, name_format_t name_format)
  269. {
  270. int err;
  271. int numaddrs;
  272. corosync_cfg_node_address_t addrs[INTERFACE_MAX];
  273. static char buf[(INET6_ADDRSTRLEN + 1) * INTERFACE_MAX];
  274. const char *nodelist_name = NULL;
  275. socklen_t addrlen;
  276. struct sockaddr_storage *ss;
  277. int start_addr = 0;
  278. int i;
  279. int bufptr = 0;
  280. buf[0] = '\0';
  281. /* If a name is required, always look for the nodelist node0_addr name first */
  282. if (name_format == ADDRESS_FORMAT_NAME) {
  283. nodelist_name = node_name_by_nodelist(nodeid);
  284. }
  285. if ((nodelist_name) &&
  286. (strlen(nodelist_name) > 0)) {
  287. start_addr = 1;
  288. assert(strlen(nodelist_name) < sizeof(buf));
  289. strcpy(buf, nodelist_name);
  290. bufptr = strlen(buf);
  291. }
  292. err = corosync_cfg_get_node_addrs(c_handle, nodeid, INTERFACE_MAX, &numaddrs, addrs);
  293. if (err != CS_OK) {
  294. fprintf(stderr, "Unable to get node address for nodeid %u: %s\n", nodeid, cs_strerror(err));
  295. return "";
  296. }
  297. /* Don't show all addressess */
  298. if (!g_show_all_addrs) {
  299. numaddrs = 1;
  300. }
  301. for (i=start_addr; i<numaddrs; i++) {
  302. if (i) {
  303. buf[bufptr++] = ',';
  304. buf[bufptr++] = ' ';
  305. }
  306. ss = (struct sockaddr_storage *)addrs[i].address;
  307. if (ss->ss_family == AF_INET6) {
  308. addrlen = sizeof(struct sockaddr_in6);
  309. } else {
  310. addrlen = sizeof(struct sockaddr_in);
  311. }
  312. if (!getnameinfo(
  313. (struct sockaddr *)addrs[i].address, addrlen,
  314. buf+bufptr, sizeof(buf)-bufptr,
  315. NULL, 0,
  316. (name_format == ADDRESS_FORMAT_IP)?NI_NUMERICHOST:0)) {
  317. bufptr += strlen(buf+bufptr);
  318. }
  319. }
  320. return buf;
  321. }
  322. static void votequorum_notification_fn(
  323. votequorum_handle_t handle,
  324. uint64_t context,
  325. votequorum_ring_id_t ring_id,
  326. uint32_t node_list_entries,
  327. uint32_t node_list[])
  328. {
  329. g_ring_id_rep_node = ring_id.nodeid;
  330. g_vq_called = 1;
  331. }
  332. static void quorum_notification_fn(
  333. quorum_handle_t handle,
  334. uint32_t quorate,
  335. uint64_t ring_id,
  336. uint32_t view_list_entries,
  337. uint32_t *view_list)
  338. {
  339. int i;
  340. g_called = 1;
  341. g_quorate = quorate;
  342. g_ring_id = ring_id;
  343. g_view_list_entries = view_list_entries;
  344. if (g_view_list) {
  345. free(g_view_list);
  346. }
  347. g_view_list = malloc(sizeof(view_list_entry_t) * view_list_entries);
  348. if (g_view_list) {
  349. for (i=0; i< view_list_entries; i++) {
  350. g_view_list[i].node_id = view_list[i];
  351. g_view_list[i].name = NULL;
  352. g_view_list[i].vq_info = NULL;
  353. }
  354. }
  355. }
  356. static void print_string_padded(const char *buf)
  357. {
  358. int len, delta;
  359. len = strlen(buf);
  360. delta = 10 - len;
  361. while (delta > 0) {
  362. printf(" ");
  363. delta--;
  364. }
  365. printf("%s ", buf);
  366. }
  367. static void print_uint32_padded(uint32_t value)
  368. {
  369. char buf[12];
  370. snprintf(buf, sizeof(buf) - 1, "%u", value);
  371. print_string_padded(buf);
  372. }
  373. /* for qsort */
  374. static int compare_nodeids(const void *one, const void *two)
  375. {
  376. const view_list_entry_t *info1 = one;
  377. const view_list_entry_t *info2 = two;
  378. if (info1->node_id == info2->node_id) {
  379. return 0;
  380. }
  381. if (info1->node_id > info2->node_id) {
  382. return 1;
  383. }
  384. return -1;
  385. }
  386. static int compare_nodenames(const void *one, const void *two)
  387. {
  388. const view_list_entry_t *info1 = one;
  389. const view_list_entry_t *info2 = two;
  390. return strcmp(info1->name, info2->name);
  391. }
  392. static void display_nodes_data(nodeid_format_t nodeid_format, name_format_t name_format, sorttype_t sort_type)
  393. {
  394. int i, display_qdevice = 0;
  395. unsigned int our_flags = 0;
  396. struct votequorum_info info[g_view_list_entries];
  397. /*
  398. * cache node info because we need to parse them twice
  399. */
  400. if (v_handle) {
  401. for (i=0; i < g_view_list_entries; i++) {
  402. if (votequorum_getinfo(v_handle, g_view_list[i].node_id, &info[i]) != CS_OK) {
  403. printf("Unable to get node %u info\n", g_view_list[i].node_id);
  404. }
  405. g_view_list[i].vq_info = &info[i];
  406. if (info[i].flags & VOTEQUORUM_INFO_QDEVICE_REGISTERED) {
  407. display_qdevice = 1;
  408. }
  409. }
  410. }
  411. /*
  412. * Get node names
  413. */
  414. for (i=0; i < g_view_list_entries; i++) {
  415. g_view_list[i].name = strdup(node_name(g_view_list[i].node_id, name_format));
  416. }
  417. printf("\nMembership information\n");
  418. printf("----------------------\n");
  419. print_string_padded("Nodeid");
  420. if (v_handle) {
  421. print_string_padded("Votes");
  422. if ((display_qdevice) || (machine_parsable)) {
  423. print_string_padded("Qdevice");
  424. }
  425. }
  426. printf("Name\n");
  427. /* corosync sends them already sorted by address */
  428. if (sort_type == SORT_NODEID) {
  429. qsort(g_view_list, g_view_list_entries, sizeof(view_list_entry_t), compare_nodeids);
  430. }
  431. if (sort_type == SORT_NODENAME) {
  432. qsort(g_view_list, g_view_list_entries, sizeof(view_list_entry_t), compare_nodenames);
  433. }
  434. for (i=0; i < g_view_list_entries; i++) {
  435. if (nodeid_format == NODEID_FORMAT_DECIMAL) {
  436. print_uint32_padded(g_view_list[i].node_id);
  437. } else {
  438. printf("0x%08x ", g_view_list[i].node_id);
  439. }
  440. if (v_handle) {
  441. int votes = -1;
  442. votes = info[i].node_votes;
  443. print_uint32_padded(votes);
  444. if ((display_qdevice) || (machine_parsable)) {
  445. if (info[i].flags & VOTEQUORUM_INFO_QDEVICE_REGISTERED) {
  446. char buf[10];
  447. snprintf(buf, sizeof(buf),
  448. "%s,%s,%s",
  449. info[i].flags & VOTEQUORUM_INFO_QDEVICE_ALIVE?"A":"NA",
  450. info[i].flags & VOTEQUORUM_INFO_QDEVICE_CAST_VOTE?"V":"NV",
  451. info[i].flags & VOTEQUORUM_INFO_QDEVICE_MASTER_WINS?"MW":"NMW");
  452. print_string_padded(buf);
  453. } else {
  454. print_string_padded("NR");
  455. }
  456. }
  457. }
  458. printf("%s", g_view_list[i].name);
  459. if (g_view_list[i].node_id == our_nodeid) {
  460. printf(" (local)");
  461. if (v_handle) {
  462. our_flags = info[i].flags;
  463. }
  464. }
  465. printf("\n");
  466. }
  467. if (g_view_list_entries) {
  468. for (i=0; i < g_view_list_entries; i++) {
  469. free(g_view_list[i].name);
  470. }
  471. free(g_view_list);
  472. g_view_list = NULL;
  473. }
  474. if (display_qdevice) {
  475. if (nodeid_format == NODEID_FORMAT_DECIMAL) {
  476. print_uint32_padded(VOTEQUORUM_QDEVICE_NODEID);
  477. } else {
  478. printf("0x%08x ", VOTEQUORUM_QDEVICE_NODEID);
  479. }
  480. /* If the quorum device is inactive on this node then show votes as 0
  481. so that the display is not confusing */
  482. if (our_flags & VOTEQUORUM_INFO_QDEVICE_CAST_VOTE) {
  483. print_uint32_padded(info[0].qdevice_votes);
  484. }
  485. else {
  486. print_uint32_padded(0);
  487. }
  488. printf(" %s", info[0].qdevice_name);
  489. if (our_flags & VOTEQUORUM_INFO_QDEVICE_CAST_VOTE) {
  490. printf("\n");
  491. }
  492. else {
  493. printf(" (votes %d)\n", info[0].qdevice_votes);
  494. }
  495. }
  496. }
  497. static int display_quorum_data(int is_quorate,
  498. nodeid_format_t nodeid_format, name_format_t name_format, sorttype_t sort_type,
  499. int loop)
  500. {
  501. struct votequorum_info info;
  502. int err;
  503. char quorumtype[256];
  504. time_t t;
  505. memset(quorumtype, 0, sizeof(quorumtype));
  506. printf("Quorum information\n");
  507. printf("------------------\n");
  508. time(&t);
  509. printf("Date: %s", ctime((const time_t *)&t));
  510. if (get_quorum_type(quorumtype, sizeof(quorumtype))) {
  511. strncpy(quorumtype, "Not configured", sizeof(quorumtype) - 1);
  512. }
  513. printf("Quorum provider: %s\n", quorumtype);
  514. printf("Nodes: %d\n", g_view_list_entries);
  515. if (nodeid_format == NODEID_FORMAT_DECIMAL) {
  516. printf("Node ID: %u\n", our_nodeid);
  517. } else {
  518. printf("Node ID: 0x%08x\n", our_nodeid);
  519. }
  520. if (v_handle) {
  521. printf("Ring ID: %d/%" PRIu64 "\n", g_ring_id_rep_node, g_ring_id);
  522. }
  523. else {
  524. printf("Ring ID: %" PRIu64 "\n", g_ring_id);
  525. }
  526. printf("Quorate: %s\n", is_quorate?"Yes":"No");
  527. if (!v_handle) {
  528. return CS_OK;
  529. }
  530. err=votequorum_getinfo(v_handle, our_nodeid, &info);
  531. if ((err == CS_OK) || (err == CS_ERR_NOT_EXIST)) {
  532. printf("\nVotequorum information\n");
  533. printf("----------------------\n");
  534. printf("Expected votes: %d\n", info.node_expected_votes);
  535. printf("Highest expected: %d\n", info.highest_expected);
  536. printf("Total votes: %d\n", info.total_votes);
  537. printf("Quorum: %d %s\n", info.quorum, info.flags & VOTEQUORUM_INFO_QUORATE?" ":"Activity blocked");
  538. printf("Flags: ");
  539. if (info.flags & VOTEQUORUM_INFO_TWONODE) printf("2Node ");
  540. if (info.flags & VOTEQUORUM_INFO_QUORATE) printf("Quorate ");
  541. if (info.flags & VOTEQUORUM_INFO_WAIT_FOR_ALL) printf("WaitForAll ");
  542. if (info.flags & VOTEQUORUM_INFO_LAST_MAN_STANDING) printf("LastManStanding ");
  543. if (info.flags & VOTEQUORUM_INFO_AUTO_TIE_BREAKER) printf("AutoTieBreaker ");
  544. if (info.flags & VOTEQUORUM_INFO_ALLOW_DOWNSCALE) printf("AllowDownscale ");
  545. if (info.flags & VOTEQUORUM_INFO_QDEVICE_REGISTERED) printf("Qdevice ");
  546. printf("\n");
  547. } else {
  548. fprintf(stderr, "Unable to get node info: %s\n", cs_strerror(err));
  549. }
  550. display_nodes_data(nodeid_format, name_format, sort_type);
  551. return err;
  552. }
  553. /*
  554. * return EXIT_SUCCESS if quorate
  555. * EXIT_NOT_QUORATE if not quorate
  556. * EXIT_FAILURE on error
  557. */
  558. static int show_status(nodeid_format_t nodeid_format, name_format_t name_format, sorttype_t sort_type)
  559. {
  560. int is_quorate;
  561. int err;
  562. err=quorum_getquorate(q_handle, &is_quorate);
  563. if (err != CS_OK) {
  564. fprintf(stderr, "Unable to get cluster quorate status: %s\n", cs_strerror(err));
  565. goto quorum_err;
  566. }
  567. err=quorum_trackstart(q_handle, CS_TRACK_CURRENT);
  568. if (err != CS_OK) {
  569. fprintf(stderr, "Unable to start quorum status tracking: %s\n", cs_strerror(err));
  570. goto quorum_err;
  571. }
  572. g_called = 0;
  573. while (g_called == 0 && err == CS_OK) {
  574. err = quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  575. if (err != CS_OK) {
  576. fprintf(stderr, "Unable to dispatch quorum status: %s\n", cs_strerror(err));
  577. }
  578. }
  579. if (quorum_trackstop(q_handle) != CS_OK) {
  580. fprintf(stderr, "Unable to stop quorum status tracking: %s\n", cs_strerror(err));
  581. }
  582. if (using_votequorum()) {
  583. if ( (err=votequorum_trackstart(v_handle, 0LL, CS_TRACK_CURRENT)) != CS_OK) {
  584. fprintf(stderr, "Unable to start votequorum status tracking: %s\n", cs_strerror(err));
  585. goto quorum_err;
  586. }
  587. g_vq_called = 0;
  588. while (g_vq_called == 0 && err == CS_OK) {
  589. err = votequorum_dispatch(v_handle, CS_DISPATCH_ONE);
  590. if (err != CS_OK) {
  591. fprintf(stderr, "Unable to dispatch votequorum status: %s\n", cs_strerror(err));
  592. }
  593. }
  594. }
  595. quorum_err:
  596. if (err != CS_OK) {
  597. return EXIT_FAILURE;
  598. }
  599. err = display_quorum_data(is_quorate, nodeid_format, name_format, sort_type, 0);
  600. if (err != CS_OK) {
  601. return EXIT_FAILURE;
  602. }
  603. return (is_quorate ? EXIT_SUCCESS : EXIT_NOT_QUORATE);
  604. }
  605. static int monitor_status(nodeid_format_t nodeid_format, name_format_t name_format, sorttype_t sort_type) {
  606. int err;
  607. int loop = 0;
  608. if (q_type == QUORUM_FREE) {
  609. printf("\nQuorum is not configured - cannot monitor\n");
  610. return show_status(nodeid_format, name_format, sort_type);
  611. }
  612. err=quorum_trackstart(q_handle, CS_TRACK_CHANGES);
  613. if (err != CS_OK) {
  614. fprintf(stderr, "Unable to start quorum status tracking: %s\n", cs_strerror(err));
  615. goto quorum_err;
  616. }
  617. if (using_votequorum()) {
  618. if ( (err=votequorum_trackstart(v_handle, 0LL, CS_TRACK_CHANGES)) != CS_OK) {
  619. fprintf(stderr, "Unable to start votequorum status tracking: %s\n", cs_strerror(err));
  620. goto quorum_err;
  621. }
  622. }
  623. while (1) {
  624. err = quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  625. if (err != CS_OK) {
  626. fprintf(stderr, "Unable to dispatch quorum status: %s\n", cs_strerror(err));
  627. goto quorum_err;
  628. }
  629. if (using_votequorum()) {
  630. g_vq_called = 0;
  631. while (!g_vq_called) {
  632. err = votequorum_dispatch(v_handle, CS_DISPATCH_ONE);
  633. if (err != CS_OK) {
  634. fprintf(stderr, "Unable to dispatch votequorum status: %s\n", cs_strerror(err));
  635. goto quorum_err;
  636. }
  637. }
  638. }
  639. err = display_quorum_data(g_quorate, nodeid_format, name_format, sort_type, loop);
  640. printf("\n");
  641. loop = 1;
  642. if (err != CS_OK) {
  643. fprintf(stderr, "Unable to display quorum data: %s\n", cs_strerror(err));
  644. goto quorum_err;
  645. }
  646. }
  647. quorum_err:
  648. return EXIT_FAILURE;
  649. }
  650. static int show_nodes(nodeid_format_t nodeid_format, name_format_t name_format, sorttype_t sort_type)
  651. {
  652. int err;
  653. int result = EXIT_FAILURE;
  654. err = quorum_trackstart(q_handle, CS_TRACK_CURRENT);
  655. if (err != CS_OK) {
  656. fprintf(stderr, "Unable to start quorum status tracking: %s\n", cs_strerror(err));
  657. goto err_exit;
  658. }
  659. g_called = 0;
  660. while (g_called == 0) {
  661. err = quorum_dispatch(q_handle, CS_DISPATCH_ONE);
  662. if (err != CS_OK) {
  663. fprintf(stderr, "Unable to dispatch quorum status: %s\n", cs_strerror(err));
  664. goto err_exit;
  665. }
  666. }
  667. display_nodes_data(nodeid_format, name_format, sort_type);
  668. result = EXIT_SUCCESS;
  669. err_exit:
  670. return result;
  671. }
  672. static int unregister_qdevice(void)
  673. {
  674. int err;
  675. struct votequorum_info info;
  676. int result;
  677. result = EXIT_FAILURE;
  678. err = votequorum_getinfo(v_handle, our_nodeid, &info);
  679. if (err != CS_OK) {
  680. fprintf(stderr, "Unable to get quorum device info: %s\n", cs_strerror(err));
  681. goto err_exit;
  682. }
  683. if (!(info.flags & VOTEQUORUM_INFO_QDEVICE_REGISTERED)) {
  684. result = EXIT_SUCCESS;
  685. goto err_exit;
  686. }
  687. err = votequorum_qdevice_unregister(v_handle, info.qdevice_name);
  688. if (err != CS_OK) {
  689. fprintf(stderr, "Unable to unregister quorum device: %s\n", cs_strerror(err));
  690. goto err_exit;
  691. }
  692. result = EXIT_SUCCESS;
  693. err_exit:
  694. return result;
  695. }
  696. /*
  697. * return -1 on error
  698. * 0 if OK
  699. */
  700. static int init_all(void) {
  701. cmap_handle = 0;
  702. q_handle = 0;
  703. v_handle = 0;
  704. c_handle = 0;
  705. if (cmap_initialize(&cmap_handle) != CS_OK) {
  706. fprintf(stderr, "Cannot initialize CMAP service\n");
  707. cmap_handle = 0;
  708. goto out;
  709. }
  710. if (quorum_initialize(&q_handle, &q_callbacks, &q_type) != CS_OK) {
  711. fprintf(stderr, "Cannot initialize QUORUM service\n");
  712. q_handle = 0;
  713. goto out;
  714. }
  715. if (corosync_cfg_initialize(&c_handle, &c_callbacks) != CS_OK) {
  716. fprintf(stderr, "Cannot initialise CFG service\n");
  717. c_handle = 0;
  718. goto out;
  719. }
  720. if (using_votequorum() <= 0) {
  721. return 0;
  722. }
  723. if (votequorum_initialize(&v_handle, &v_callbacks) != CS_OK) {
  724. fprintf(stderr, "Cannot initialise VOTEQUORUM service\n");
  725. v_handle = 0;
  726. goto out;
  727. }
  728. if (cmap_get_uint32(cmap_handle, "runtime.votequorum.this_node_id", &our_nodeid) != CS_OK) {
  729. fprintf(stderr, "Unable to retrieve this_node_id\n");
  730. goto out;
  731. }
  732. return 0;
  733. out:
  734. return -1;
  735. }
  736. static void close_all(void) {
  737. if (cmap_handle) {
  738. cmap_finalize(cmap_handle);
  739. }
  740. if (q_handle) {
  741. quorum_finalize(q_handle);
  742. }
  743. if (c_handle) {
  744. corosync_cfg_finalize(c_handle);
  745. }
  746. if (v_handle) {
  747. votequorum_finalize(v_handle);
  748. }
  749. }
  750. int main (int argc, char *argv[]) {
  751. const char *options = "VHaslpmfe:v:hin:o:";
  752. char *endptr;
  753. int opt;
  754. int votes = 0;
  755. int ret = 0;
  756. uint32_t nodeid = 0;
  757. uint32_t nodeid_set = 0;
  758. nodeid_format_t nodeid_format = NODEID_FORMAT_DECIMAL;
  759. name_format_t address_format = ADDRESS_FORMAT_NAME;
  760. command_t command_opt = CMD_SHOWSTATUS;
  761. sorttype_t sort_opt = SORT_ADDR;
  762. char sortchar;
  763. long int l;
  764. if (init_all()) {
  765. close_all();
  766. exit(EXIT_FAILURE);
  767. }
  768. while ( (opt = getopt(argc, argv, options)) != -1 ) {
  769. switch (opt) {
  770. case 'f':
  771. if (using_votequorum() > 0) {
  772. command_opt = CMD_UNREGISTER_QDEVICE;
  773. } else {
  774. fprintf(stderr, "You cannot unregister quorum device, corosync is not using votequorum\n");
  775. exit(EXIT_FAILURE);
  776. }
  777. break;
  778. case 's':
  779. command_opt = CMD_SHOWSTATUS;
  780. break;
  781. case 'a':
  782. g_show_all_addrs = 1;
  783. break;
  784. case 'm':
  785. command_opt = CMD_MONITOR;
  786. break;
  787. case 'i':
  788. address_format = ADDRESS_FORMAT_IP;
  789. break;
  790. case 'H':
  791. nodeid_format = NODEID_FORMAT_HEX;
  792. break;
  793. case 'l':
  794. command_opt = CMD_SHOWNODES;
  795. break;
  796. case 'p':
  797. machine_parsable = 1;
  798. break;
  799. case 'e':
  800. if (using_votequorum() > 0) {
  801. votes = strtol(optarg, &endptr, 0);
  802. if ((votes == 0 && endptr == optarg) || votes <= 0) {
  803. fprintf(stderr, "New expected votes value was not valid, try a positive number\n");
  804. } else {
  805. command_opt = CMD_SETEXPECTED;
  806. }
  807. } else {
  808. fprintf(stderr, "You cannot change expected votes, corosync is not using votequorum\n");
  809. exit(EXIT_FAILURE);
  810. }
  811. break;
  812. case 'n':
  813. l = strtol(optarg, &endptr, 0);
  814. if ((l == 0 && endptr == optarg) || l < 0) {
  815. fprintf(stderr, "The nodeid was not valid, try a positive number\n");
  816. exit(EXIT_FAILURE);
  817. }
  818. nodeid = l;
  819. nodeid_set = 1;
  820. break;
  821. case 'v':
  822. if (using_votequorum() > 0) {
  823. votes = strtol(optarg, &endptr, 0);
  824. if ((votes == 0 && endptr == optarg) || votes < 0) {
  825. fprintf(stderr, "New votes value was not valid, try a positive number or zero\n");
  826. exit(EXIT_FAILURE);
  827. } else {
  828. command_opt = CMD_SETVOTES;
  829. }
  830. }
  831. else {
  832. fprintf(stderr, "You cannot change node votes, corosync is not using votequorum\n");
  833. exit(EXIT_FAILURE);
  834. }
  835. break;
  836. case 'o':
  837. sortchar = optarg[0];
  838. switch (sortchar) {
  839. case 'a': sort_opt = SORT_ADDR;
  840. break;
  841. case 'i': sort_opt = SORT_NODEID;
  842. break;
  843. case 'n': sort_opt = SORT_NODENAME;
  844. break;
  845. default:
  846. fprintf(stderr, "Invalid ordering option. valid orders are a(address), i(node ID) or n(name)\n");
  847. exit(EXIT_FAILURE);
  848. break;
  849. }
  850. break;
  851. case 'V':
  852. printf("corosync-quorumtool version: %s\n", VERSION);
  853. exit(0);
  854. case ':':
  855. case 'h':
  856. case '?':
  857. default:
  858. command_opt = CMD_UNKNOWN;
  859. break;
  860. }
  861. }
  862. switch (command_opt) {
  863. case CMD_UNKNOWN:
  864. show_usage(argv[0]);
  865. ret = EXIT_FAILURE;
  866. break;
  867. case CMD_SHOWNODES:
  868. ret = show_nodes(nodeid_format, address_format, sort_opt);
  869. break;
  870. case CMD_SHOWSTATUS:
  871. ret = show_status(nodeid_format, address_format, sort_opt);
  872. break;
  873. case CMD_SETVOTES:
  874. if (!nodeid_set) {
  875. nodeid = our_nodeid;
  876. }
  877. ret = set_votes(nodeid, votes);
  878. break;
  879. case CMD_SETEXPECTED:
  880. ret = set_expected(votes);
  881. break;
  882. case CMD_MONITOR:
  883. ret = monitor_status(nodeid_format, address_format, sort_opt);
  884. break;
  885. case CMD_UNREGISTER_QDEVICE:
  886. ret = unregister_qdevice();
  887. break;
  888. }
  889. close_all();
  890. return (ret);
  891. }