corosync-quorumtool.c 25 KB

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