corosync-quorumtool.c 24 KB

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