tlv.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173
  1. /*
  2. * Copyright (c) 2015-2020 Red Hat, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Jan Friesse (jfriesse@redhat.com)
  7. *
  8. * This software licensed under BSD license, the text of which follows:
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions are met:
  12. *
  13. * - Redistributions of source code must retain the above copyright notice,
  14. * this list of conditions and the following disclaimer.
  15. * - Redistributions in binary form must reproduce the above copyright notice,
  16. * this list of conditions and the following disclaimer in the documentation
  17. * and/or other materials provided with the distribution.
  18. * - Neither the name of the Red Hat, Inc. nor the names of its
  19. * contributors may be used to endorse or promote products derived from this
  20. * software without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  23. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  26. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  27. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  28. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  29. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  30. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  31. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  32. * THE POSSIBILITY OF SUCH DAMAGE.
  33. */
  34. #include <sys/types.h>
  35. #include <arpa/inet.h>
  36. #include <assert.h>
  37. #include <inttypes.h>
  38. #include <stdlib.h>
  39. #include <string.h>
  40. /*
  41. * 64-bit variant of ntoh is not exactly standard...
  42. */
  43. #if defined(__linux__)
  44. #include <endian.h>
  45. #elif defined(__FreeBSD__) || defined(__NetBSD__)
  46. #include <sys/endian.h>
  47. #elif defined(__OpenBSD__)
  48. #define be64toh(x) betoh64(x)
  49. #endif
  50. #include "tlv.h"
  51. #define TLV_TYPE_LENGTH 2
  52. #define TLV_LENGTH_LENGTH 2
  53. #define TLV_STATIC_SUPPORTED_OPTIONS_SIZE 24
  54. enum tlv_opt_type tlv_static_supported_options[TLV_STATIC_SUPPORTED_OPTIONS_SIZE] = {
  55. TLV_OPT_MSG_SEQ_NUMBER,
  56. TLV_OPT_CLUSTER_NAME,
  57. TLV_OPT_TLS_SUPPORTED,
  58. TLV_OPT_TLS_CLIENT_CERT_REQUIRED,
  59. TLV_OPT_SUPPORTED_MESSAGES,
  60. TLV_OPT_SUPPORTED_OPTIONS,
  61. TLV_OPT_REPLY_ERROR_CODE,
  62. TLV_OPT_SERVER_MAXIMUM_REQUEST_SIZE,
  63. TLV_OPT_SERVER_MAXIMUM_REPLY_SIZE,
  64. TLV_OPT_NODE_ID,
  65. TLV_OPT_SUPPORTED_DECISION_ALGORITHMS,
  66. TLV_OPT_DECISION_ALGORITHM,
  67. TLV_OPT_HEARTBEAT_INTERVAL,
  68. TLV_OPT_RING_ID,
  69. TLV_OPT_CONFIG_VERSION,
  70. TLV_OPT_DATA_CENTER_ID,
  71. TLV_OPT_NODE_STATE,
  72. TLV_OPT_NODE_INFO,
  73. TLV_OPT_NODE_LIST_TYPE,
  74. TLV_OPT_VOTE,
  75. TLV_OPT_QUORATE,
  76. TLV_OPT_TIE_BREAKER,
  77. TLV_OPT_HEURISTICS,
  78. TLV_OPT_KEEP_ACTIVE_PARTITION_TIE_BREAKER,
  79. };
  80. int
  81. tlv_add(struct dynar *msg, enum tlv_opt_type opt_type, uint16_t opt_len, const void *value)
  82. {
  83. uint16_t nlen;
  84. uint16_t nopt_type;
  85. if (dynar_size(msg) + sizeof(nopt_type) + sizeof(nlen) + opt_len > dynar_max_size(msg)) {
  86. return (-1);
  87. }
  88. nopt_type = htons((uint16_t)opt_type);
  89. nlen = htons(opt_len);
  90. if (dynar_cat(msg, &nopt_type, sizeof(nopt_type)) == -1) {
  91. return (-1);
  92. }
  93. if (dynar_cat(msg, &nlen, sizeof(nlen)) == -1) {
  94. return (-1);
  95. }
  96. if (dynar_cat(msg, value, opt_len) == -1) {
  97. return (-1);
  98. }
  99. return (0);
  100. }
  101. int
  102. tlv_add_u32(struct dynar *msg, enum tlv_opt_type opt_type, uint32_t u32)
  103. {
  104. uint32_t nu32;
  105. nu32 = htonl(u32);
  106. return (tlv_add(msg, opt_type, sizeof(nu32), &nu32));
  107. }
  108. int
  109. tlv_add_u8(struct dynar *msg, enum tlv_opt_type opt_type, uint8_t u8)
  110. {
  111. return (tlv_add(msg, opt_type, sizeof(u8), &u8));
  112. }
  113. int
  114. tlv_add_u16(struct dynar *msg, enum tlv_opt_type opt_type, uint16_t u16)
  115. {
  116. uint16_t nu16;
  117. nu16 = htons(u16);
  118. return (tlv_add(msg, opt_type, sizeof(nu16), &nu16));
  119. }
  120. int
  121. tlv_add_u64(struct dynar *msg, enum tlv_opt_type opt_type, uint64_t u64)
  122. {
  123. uint64_t nu64;
  124. nu64 = htobe64(u64);
  125. return (tlv_add(msg, opt_type, sizeof(nu64), &nu64));
  126. }
  127. int
  128. tlv_add_string(struct dynar *msg, enum tlv_opt_type opt_type, const char *str)
  129. {
  130. return (tlv_add(msg, opt_type, strlen(str), str));
  131. }
  132. int
  133. tlv_add_msg_seq_number(struct dynar *msg, uint32_t msg_seq_number)
  134. {
  135. return (tlv_add_u32(msg, TLV_OPT_MSG_SEQ_NUMBER, msg_seq_number));
  136. }
  137. int
  138. tlv_add_cluster_name(struct dynar *msg, const char *cluster_name)
  139. {
  140. return (tlv_add_string(msg, TLV_OPT_CLUSTER_NAME, cluster_name));
  141. }
  142. int
  143. tlv_add_tls_supported(struct dynar *msg, enum tlv_tls_supported tls_supported)
  144. {
  145. return (tlv_add_u8(msg, TLV_OPT_TLS_SUPPORTED, tls_supported));
  146. }
  147. int
  148. tlv_add_tls_client_cert_required(struct dynar *msg, int tls_client_cert_required)
  149. {
  150. return (tlv_add_u8(msg, TLV_OPT_TLS_CLIENT_CERT_REQUIRED, tls_client_cert_required));
  151. }
  152. int
  153. tlv_add_u16_array(struct dynar *msg, enum tlv_opt_type opt_type, const uint16_t *array,
  154. size_t array_size)
  155. {
  156. size_t i;
  157. uint16_t *nu16a;
  158. uint16_t opt_len;
  159. int res;
  160. nu16a = malloc(sizeof(uint16_t) * array_size);
  161. if (nu16a == NULL) {
  162. return (-1);
  163. }
  164. for (i = 0; i < array_size; i++) {
  165. nu16a[i] = htons(array[i]);
  166. }
  167. opt_len = sizeof(uint16_t) * array_size;
  168. res = tlv_add(msg, opt_type, opt_len, nu16a);
  169. free(nu16a);
  170. return (res);
  171. }
  172. int
  173. tlv_add_supported_options(struct dynar *msg, const enum tlv_opt_type *supported_options,
  174. size_t no_supported_options)
  175. {
  176. uint16_t *u16a;
  177. size_t i;
  178. int res;
  179. u16a = malloc(sizeof(*u16a) * no_supported_options);
  180. if (u16a == NULL) {
  181. return (-1);
  182. }
  183. for (i = 0; i < no_supported_options; i++) {
  184. u16a[i] = (uint16_t)supported_options[i];
  185. }
  186. res = (tlv_add_u16_array(msg, TLV_OPT_SUPPORTED_OPTIONS, u16a, no_supported_options));
  187. free(u16a);
  188. return (res);
  189. }
  190. int
  191. tlv_add_supported_decision_algorithms(struct dynar *msg,
  192. const enum tlv_decision_algorithm_type *supported_algorithms, size_t no_supported_algorithms)
  193. {
  194. uint16_t *u16a;
  195. size_t i;
  196. int res;
  197. u16a = malloc(sizeof(*u16a) * no_supported_algorithms);
  198. if (u16a == NULL) {
  199. return (-1);
  200. }
  201. for (i = 0; i < no_supported_algorithms; i++) {
  202. u16a[i] = (uint16_t)supported_algorithms[i];
  203. }
  204. res = (tlv_add_u16_array(msg, TLV_OPT_SUPPORTED_DECISION_ALGORITHMS, u16a,
  205. no_supported_algorithms));
  206. free(u16a);
  207. return (res);
  208. }
  209. int
  210. tlv_add_reply_error_code(struct dynar *msg, enum tlv_reply_error_code error_code)
  211. {
  212. return (tlv_add_u16(msg, TLV_OPT_REPLY_ERROR_CODE, (uint16_t)error_code));
  213. }
  214. int
  215. tlv_add_server_maximum_request_size(struct dynar *msg, size_t server_maximum_request_size)
  216. {
  217. return (tlv_add_u32(msg, TLV_OPT_SERVER_MAXIMUM_REQUEST_SIZE, server_maximum_request_size));
  218. }
  219. int
  220. tlv_add_server_maximum_reply_size(struct dynar *msg, size_t server_maximum_reply_size)
  221. {
  222. return (tlv_add_u32(msg, TLV_OPT_SERVER_MAXIMUM_REPLY_SIZE, server_maximum_reply_size));
  223. }
  224. int
  225. tlv_add_node_id(struct dynar *msg, uint32_t node_id)
  226. {
  227. return (tlv_add_u32(msg, TLV_OPT_NODE_ID, node_id));
  228. }
  229. int
  230. tlv_add_decision_algorithm(struct dynar *msg, enum tlv_decision_algorithm_type decision_algorithm)
  231. {
  232. return (tlv_add_u16(msg, TLV_OPT_DECISION_ALGORITHM, (uint16_t)decision_algorithm));
  233. }
  234. int
  235. tlv_add_heartbeat_interval(struct dynar *msg, uint32_t heartbeat_interval)
  236. {
  237. return (tlv_add_u32(msg, TLV_OPT_HEARTBEAT_INTERVAL, heartbeat_interval));
  238. }
  239. int
  240. tlv_add_ring_id(struct dynar *msg, const struct tlv_ring_id *ring_id)
  241. {
  242. uint64_t nu64;
  243. uint32_t nu32;
  244. char tmp_buf[12];
  245. nu32 = htonl(ring_id->node_id);
  246. nu64 = htobe64(ring_id->seq);
  247. memcpy(tmp_buf, &nu32, sizeof(nu32));
  248. memcpy(tmp_buf + sizeof(nu32), &nu64, sizeof(nu64));
  249. return (tlv_add(msg, TLV_OPT_RING_ID, sizeof(tmp_buf), tmp_buf));
  250. }
  251. int
  252. tlv_add_tie_breaker(struct dynar *msg, const struct tlv_tie_breaker *tie_breaker)
  253. {
  254. uint32_t nu32;
  255. uint8_t u8;
  256. char tmp_buf[5];
  257. u8 = tie_breaker->mode;
  258. nu32 = (tie_breaker->mode == TLV_TIE_BREAKER_MODE_NODE_ID ?
  259. htonl(tie_breaker->node_id) : 0);
  260. memcpy(tmp_buf, &u8, sizeof(u8));
  261. memcpy(tmp_buf + sizeof(u8), &nu32, sizeof(nu32));
  262. return (tlv_add(msg, TLV_OPT_TIE_BREAKER, sizeof(tmp_buf), tmp_buf));
  263. }
  264. int
  265. tlv_add_config_version(struct dynar *msg, uint64_t config_version)
  266. {
  267. return (tlv_add_u64(msg, TLV_OPT_CONFIG_VERSION, config_version));
  268. }
  269. int
  270. tlv_add_data_center_id(struct dynar *msg, uint32_t data_center_id)
  271. {
  272. return (tlv_add_u32(msg, TLV_OPT_DATA_CENTER_ID, data_center_id));
  273. }
  274. int
  275. tlv_add_node_state(struct dynar *msg, enum tlv_node_state node_state)
  276. {
  277. return (tlv_add_u8(msg, TLV_OPT_NODE_STATE, node_state));
  278. }
  279. int
  280. tlv_add_node_info(struct dynar *msg, const struct tlv_node_info *node_info)
  281. {
  282. struct dynar opt_value;
  283. int res;
  284. res = 0;
  285. /*
  286. * Create sub message,
  287. */
  288. dynar_init(&opt_value, 1024);
  289. if ((res = tlv_add_node_id(&opt_value, node_info->node_id)) != 0) {
  290. goto exit_dynar_destroy;
  291. }
  292. if (node_info->data_center_id != 0) {
  293. if ((res = tlv_add_data_center_id(&opt_value, node_info->data_center_id)) != 0) {
  294. goto exit_dynar_destroy;
  295. }
  296. }
  297. if (node_info->node_state != TLV_NODE_STATE_NOT_SET) {
  298. if ((res = tlv_add_node_state(&opt_value, node_info->node_state)) != 0) {
  299. goto exit_dynar_destroy;
  300. }
  301. }
  302. res = tlv_add(msg, TLV_OPT_NODE_INFO, dynar_size(&opt_value), dynar_data(&opt_value));
  303. if (res != 0) {
  304. goto exit_dynar_destroy;
  305. }
  306. exit_dynar_destroy:
  307. dynar_destroy(&opt_value);
  308. return (res);
  309. }
  310. int
  311. tlv_add_node_list_type(struct dynar *msg, enum tlv_node_list_type node_list_type)
  312. {
  313. return (tlv_add_u8(msg, TLV_OPT_NODE_LIST_TYPE, node_list_type));
  314. }
  315. int
  316. tlv_add_vote(struct dynar *msg, enum tlv_vote vote)
  317. {
  318. return (tlv_add_u8(msg, TLV_OPT_VOTE, vote));
  319. }
  320. int
  321. tlv_add_quorate(struct dynar *msg, enum tlv_quorate quorate)
  322. {
  323. return (tlv_add_u8(msg, TLV_OPT_QUORATE, quorate));
  324. }
  325. int
  326. tlv_add_heuristics(struct dynar *msg, enum tlv_heuristics heuristics)
  327. {
  328. if (heuristics == TLV_HEURISTICS_UNDEFINED) {
  329. return (-1);
  330. }
  331. return (tlv_add_u8(msg, TLV_OPT_HEURISTICS, heuristics));
  332. }
  333. int
  334. tlv_add_keep_active_partition_tie_breaker(struct dynar *msg,
  335. enum tlv_keep_active_partition_tie_breaker enabled)
  336. {
  337. return (tlv_add_u8(msg, TLV_OPT_KEEP_ACTIVE_PARTITION_TIE_BREAKER, enabled));
  338. }
  339. void
  340. tlv_iter_init_str(const char *msg, size_t msg_len, size_t msg_header_len,
  341. struct tlv_iterator *tlv_iter)
  342. {
  343. tlv_iter->msg = msg;
  344. tlv_iter->msg_len = msg_len;
  345. tlv_iter->current_pos = 0;
  346. tlv_iter->msg_header_len = msg_header_len;
  347. tlv_iter->iter_next_called = 0;
  348. }
  349. void
  350. tlv_iter_init(const struct dynar *msg, size_t msg_header_len, struct tlv_iterator *tlv_iter)
  351. {
  352. tlv_iter_init_str(dynar_data(msg), dynar_size(msg), msg_header_len, tlv_iter);
  353. }
  354. enum tlv_opt_type
  355. tlv_iter_get_type(const struct tlv_iterator *tlv_iter)
  356. {
  357. uint16_t ntype;
  358. uint16_t type;
  359. memcpy(&ntype, tlv_iter->msg + tlv_iter->current_pos, sizeof(ntype));
  360. type = ntohs(ntype);
  361. return (type);
  362. }
  363. uint16_t
  364. tlv_iter_get_len(const struct tlv_iterator *tlv_iter)
  365. {
  366. uint16_t nlen;
  367. uint16_t len;
  368. memcpy(&nlen, tlv_iter->msg + tlv_iter->current_pos + TLV_TYPE_LENGTH, sizeof(nlen));
  369. len = ntohs(nlen);
  370. return (len);
  371. }
  372. const char *
  373. tlv_iter_get_data(const struct tlv_iterator *tlv_iter)
  374. {
  375. return (tlv_iter->msg + tlv_iter->current_pos + TLV_TYPE_LENGTH + TLV_LENGTH_LENGTH);
  376. }
  377. int
  378. tlv_iter_next(struct tlv_iterator *tlv_iter)
  379. {
  380. uint16_t len;
  381. if (tlv_iter->iter_next_called == 0) {
  382. tlv_iter->iter_next_called = 1;
  383. tlv_iter->current_pos = tlv_iter->msg_header_len;
  384. goto check_tlv_validity;
  385. }
  386. len = tlv_iter_get_len(tlv_iter);
  387. if (tlv_iter->current_pos + TLV_TYPE_LENGTH + TLV_LENGTH_LENGTH + len >=
  388. tlv_iter->msg_len) {
  389. return (0);
  390. }
  391. tlv_iter->current_pos += TLV_TYPE_LENGTH + TLV_LENGTH_LENGTH + len;
  392. check_tlv_validity:
  393. /*
  394. * Check if tlv is valid = is not larger than whole message
  395. */
  396. len = tlv_iter_get_len(tlv_iter);
  397. if (tlv_iter->current_pos + TLV_TYPE_LENGTH + TLV_LENGTH_LENGTH + len > tlv_iter->msg_len) {
  398. return (-1);
  399. }
  400. return (1);
  401. }
  402. int
  403. tlv_iter_decode_u32(struct tlv_iterator *tlv_iter, uint32_t *res)
  404. {
  405. const char *opt_data;
  406. uint16_t opt_len;
  407. uint32_t nu32;
  408. opt_len = tlv_iter_get_len(tlv_iter);
  409. opt_data = tlv_iter_get_data(tlv_iter);
  410. if (opt_len != sizeof(nu32)) {
  411. return (-1);
  412. }
  413. memcpy(&nu32, opt_data, sizeof(nu32));
  414. *res = ntohl(nu32);
  415. return (0);
  416. }
  417. int
  418. tlv_iter_decode_u8(struct tlv_iterator *tlv_iter, uint8_t *res)
  419. {
  420. const char *opt_data;
  421. uint16_t opt_len;
  422. opt_len = tlv_iter_get_len(tlv_iter);
  423. opt_data = tlv_iter_get_data(tlv_iter);
  424. if (opt_len != sizeof(*res)) {
  425. return (-1);
  426. }
  427. memcpy(res, opt_data, sizeof(*res));
  428. return (0);
  429. }
  430. int
  431. tlv_iter_decode_client_cert_required(struct tlv_iterator *tlv_iter, uint8_t *client_cert_required)
  432. {
  433. return (tlv_iter_decode_u8(tlv_iter, client_cert_required));
  434. }
  435. int
  436. tlv_iter_decode_str(struct tlv_iterator *tlv_iter, char **str, size_t *str_len)
  437. {
  438. const char *opt_data;
  439. uint16_t opt_len;
  440. char *tmp_str;
  441. opt_len = tlv_iter_get_len(tlv_iter);
  442. opt_data = tlv_iter_get_data(tlv_iter);
  443. tmp_str = malloc(opt_len + 1);
  444. if (tmp_str == NULL) {
  445. return (-1);
  446. }
  447. memcpy(tmp_str, opt_data, opt_len);
  448. tmp_str[opt_len] = '\0';
  449. *str = tmp_str;
  450. *str_len = opt_len;
  451. return (0);
  452. }
  453. int
  454. tlv_iter_decode_u16_array(struct tlv_iterator *tlv_iter, uint16_t **u16a, size_t *no_items)
  455. {
  456. uint16_t opt_len;
  457. uint16_t *u16a_res;
  458. size_t i;
  459. opt_len = tlv_iter_get_len(tlv_iter);
  460. if (opt_len % sizeof(uint16_t) != 0) {
  461. return (-1);
  462. }
  463. *no_items = opt_len / sizeof(uint16_t);
  464. u16a_res = malloc(sizeof(uint16_t) * *no_items);
  465. if (u16a_res == NULL) {
  466. return (-2);
  467. }
  468. memcpy(u16a_res, tlv_iter_get_data(tlv_iter), opt_len);
  469. for (i = 0; i < *no_items; i++) {
  470. u16a_res[i] = ntohs(u16a_res[i]);
  471. }
  472. *u16a = u16a_res;
  473. return (0);
  474. }
  475. int
  476. tlv_iter_decode_supported_options(struct tlv_iterator *tlv_iter,
  477. enum tlv_opt_type **supported_options, size_t *no_supported_options)
  478. {
  479. uint16_t *u16a;
  480. enum tlv_opt_type *tlv_opt_array;
  481. size_t i;
  482. int res;
  483. res = tlv_iter_decode_u16_array(tlv_iter, &u16a, no_supported_options);
  484. if (res != 0) {
  485. return (res);
  486. }
  487. tlv_opt_array = malloc(sizeof(enum tlv_opt_type) * *no_supported_options);
  488. if (tlv_opt_array == NULL) {
  489. free(u16a);
  490. return (-2);
  491. }
  492. for (i = 0; i < *no_supported_options; i++) {
  493. tlv_opt_array[i] = (enum tlv_opt_type)u16a[i];
  494. }
  495. free(u16a);
  496. *supported_options = tlv_opt_array;
  497. return (0);
  498. }
  499. int
  500. tlv_iter_decode_supported_decision_algorithms(struct tlv_iterator *tlv_iter,
  501. enum tlv_decision_algorithm_type **supported_decision_algorithms,
  502. size_t *no_supported_decision_algorithms)
  503. {
  504. uint16_t *u16a;
  505. enum tlv_decision_algorithm_type *tlv_decision_algorithm_type_array;
  506. size_t i;
  507. int res;
  508. res = tlv_iter_decode_u16_array(tlv_iter, &u16a, no_supported_decision_algorithms);
  509. if (res != 0) {
  510. return (res);
  511. }
  512. tlv_decision_algorithm_type_array = malloc(
  513. sizeof(enum tlv_decision_algorithm_type) * *no_supported_decision_algorithms);
  514. if (tlv_decision_algorithm_type_array == NULL) {
  515. free(u16a);
  516. return (-2);
  517. }
  518. for (i = 0; i < *no_supported_decision_algorithms; i++) {
  519. tlv_decision_algorithm_type_array[i] = (enum tlv_decision_algorithm_type)u16a[i];
  520. }
  521. free(u16a);
  522. *supported_decision_algorithms = tlv_decision_algorithm_type_array;
  523. return (0);
  524. }
  525. int
  526. tlv_iter_decode_u16(struct tlv_iterator *tlv_iter, uint16_t *u16)
  527. {
  528. const char *opt_data;
  529. uint16_t opt_len;
  530. uint16_t nu16;
  531. opt_len = tlv_iter_get_len(tlv_iter);
  532. opt_data = tlv_iter_get_data(tlv_iter);
  533. if (opt_len != sizeof(nu16)) {
  534. return (-1);
  535. }
  536. memcpy(&nu16, opt_data, sizeof(nu16));
  537. *u16 = ntohs(nu16);
  538. return (0);
  539. }
  540. int
  541. tlv_iter_decode_u64(struct tlv_iterator *tlv_iter, uint64_t *u64)
  542. {
  543. const char *opt_data;
  544. uint64_t opt_len;
  545. uint64_t nu64;
  546. opt_len = tlv_iter_get_len(tlv_iter);
  547. opt_data = tlv_iter_get_data(tlv_iter);
  548. if (opt_len != sizeof(nu64)) {
  549. return (-1);
  550. }
  551. memcpy(&nu64, opt_data, sizeof(nu64));
  552. *u64 = be64toh(nu64);
  553. return (0);
  554. }
  555. int
  556. tlv_iter_decode_reply_error_code(struct tlv_iterator *tlv_iter,
  557. enum tlv_reply_error_code *reply_error_code)
  558. {
  559. return (tlv_iter_decode_u16(tlv_iter, (uint16_t *)reply_error_code));
  560. }
  561. int
  562. tlv_iter_decode_tls_supported(struct tlv_iterator *tlv_iter, enum tlv_tls_supported *tls_supported)
  563. {
  564. uint8_t u8;
  565. enum tlv_tls_supported tmp_tls_supported;
  566. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  567. return (-1);
  568. }
  569. tmp_tls_supported = u8;
  570. if (tmp_tls_supported != TLV_TLS_UNSUPPORTED &&
  571. tmp_tls_supported != TLV_TLS_SUPPORTED &&
  572. tmp_tls_supported != TLV_TLS_REQUIRED) {
  573. return (-4);
  574. }
  575. *tls_supported = tmp_tls_supported;
  576. return (0);
  577. }
  578. int
  579. tlv_iter_decode_decision_algorithm(struct tlv_iterator *tlv_iter,
  580. enum tlv_decision_algorithm_type *decision_algorithm)
  581. {
  582. uint16_t u16;
  583. if (tlv_iter_decode_u16(tlv_iter, &u16) != 0) {
  584. return (-1);
  585. }
  586. *decision_algorithm = (enum tlv_decision_algorithm_type)u16;
  587. return (0);
  588. }
  589. int
  590. tlv_iter_decode_ring_id(struct tlv_iterator *tlv_iter, struct tlv_ring_id *ring_id)
  591. {
  592. const char *opt_data;
  593. uint16_t opt_len;
  594. uint32_t nu32;
  595. uint64_t nu64;
  596. char tmp_buf[12];
  597. opt_len = tlv_iter_get_len(tlv_iter);
  598. opt_data = tlv_iter_get_data(tlv_iter);
  599. if (opt_len != sizeof(tmp_buf)) {
  600. return (-1);
  601. }
  602. memcpy(&nu32, opt_data, sizeof(nu32));
  603. memcpy(&nu64, opt_data + sizeof(nu32), sizeof(nu64));
  604. ring_id->node_id = ntohl(nu32);
  605. ring_id->seq = be64toh(nu64);
  606. return (0);
  607. }
  608. int
  609. tlv_iter_decode_tie_breaker(struct tlv_iterator *tlv_iter, struct tlv_tie_breaker *tie_breaker)
  610. {
  611. const char *opt_data;
  612. uint16_t opt_len;
  613. uint32_t nu32;
  614. uint8_t u8;
  615. enum tlv_tie_breaker_mode tie_breaker_mode;
  616. char tmp_buf[5];
  617. opt_len = tlv_iter_get_len(tlv_iter);
  618. opt_data = tlv_iter_get_data(tlv_iter);
  619. if (opt_len != sizeof(tmp_buf)) {
  620. return (-1);
  621. }
  622. memcpy(&u8, opt_data, sizeof(u8));
  623. tie_breaker_mode = u8;
  624. if (tie_breaker_mode != TLV_TIE_BREAKER_MODE_LOWEST &&
  625. tie_breaker_mode != TLV_TIE_BREAKER_MODE_HIGHEST &&
  626. tie_breaker_mode != TLV_TIE_BREAKER_MODE_NODE_ID) {
  627. return (-4);
  628. }
  629. memcpy(&nu32, opt_data + sizeof(u8), sizeof(nu32));
  630. tie_breaker->mode = tie_breaker_mode;
  631. tie_breaker->node_id = (tie_breaker->mode == TLV_TIE_BREAKER_MODE_NODE_ID ?
  632. ntohl(nu32) : 0);
  633. return (0);
  634. }
  635. int
  636. tlv_iter_decode_node_state(struct tlv_iterator *tlv_iter, enum tlv_node_state *node_state)
  637. {
  638. uint8_t u8;
  639. enum tlv_node_state tmp_node_state;
  640. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  641. return (-1);
  642. }
  643. tmp_node_state = u8;
  644. if (tmp_node_state != TLV_NODE_STATE_MEMBER &&
  645. tmp_node_state != TLV_NODE_STATE_DEAD &&
  646. tmp_node_state != TLV_NODE_STATE_LEAVING) {
  647. return (-4);
  648. }
  649. *node_state = tmp_node_state;
  650. return (0);
  651. }
  652. int
  653. tlv_iter_decode_node_info(struct tlv_iterator *tlv_iter, struct tlv_node_info *node_info)
  654. {
  655. struct tlv_iterator data_tlv_iter;
  656. int iter_res;
  657. int res;
  658. enum tlv_opt_type opt_type;
  659. struct tlv_node_info tmp_node_info;
  660. memset(&tmp_node_info, 0, sizeof(tmp_node_info));
  661. tlv_iter_init_str(tlv_iter_get_data(tlv_iter), tlv_iter_get_len(tlv_iter), 0,
  662. &data_tlv_iter);
  663. while ((iter_res = tlv_iter_next(&data_tlv_iter)) > 0) {
  664. opt_type = tlv_iter_get_type(&data_tlv_iter);
  665. switch (opt_type) {
  666. case TLV_OPT_NODE_ID:
  667. if ((res = tlv_iter_decode_u32(&data_tlv_iter,
  668. &tmp_node_info.node_id)) != 0) {
  669. return (res);
  670. }
  671. break;
  672. case TLV_OPT_DATA_CENTER_ID:
  673. if ((res = tlv_iter_decode_u32(&data_tlv_iter,
  674. &tmp_node_info.data_center_id)) != 0) {
  675. return (res);
  676. }
  677. break;
  678. case TLV_OPT_NODE_STATE:
  679. if ((res = tlv_iter_decode_node_state(&data_tlv_iter,
  680. &tmp_node_info.node_state)) != 0) {
  681. return (res);
  682. }
  683. break;
  684. default:
  685. /*
  686. * Other options are not processed
  687. */
  688. break;
  689. }
  690. }
  691. if (iter_res != 0) {
  692. return (-3);
  693. }
  694. if (tmp_node_info.node_id == 0) {
  695. return (-4);
  696. }
  697. memcpy(node_info, &tmp_node_info, sizeof(tmp_node_info));
  698. return (0);
  699. }
  700. int
  701. tlv_iter_decode_node_list_type(struct tlv_iterator *tlv_iter,
  702. enum tlv_node_list_type *node_list_type)
  703. {
  704. uint8_t u8;
  705. enum tlv_node_list_type tmp_node_list_type;
  706. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  707. return (-1);
  708. }
  709. tmp_node_list_type = u8;
  710. if (tmp_node_list_type != TLV_NODE_LIST_TYPE_INITIAL_CONFIG &&
  711. tmp_node_list_type != TLV_NODE_LIST_TYPE_CHANGED_CONFIG &&
  712. tmp_node_list_type != TLV_NODE_LIST_TYPE_MEMBERSHIP &&
  713. tmp_node_list_type != TLV_NODE_LIST_TYPE_QUORUM) {
  714. return (-4);
  715. }
  716. *node_list_type = tmp_node_list_type;
  717. return (0);
  718. }
  719. int
  720. tlv_iter_decode_vote(struct tlv_iterator *tlv_iter, enum tlv_vote *vote)
  721. {
  722. uint8_t u8;
  723. enum tlv_vote tmp_vote;
  724. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  725. return (-1);
  726. }
  727. tmp_vote = u8;
  728. if (tmp_vote != TLV_VOTE_ACK &&
  729. tmp_vote != TLV_VOTE_NACK &&
  730. tmp_vote != TLV_VOTE_ASK_LATER &&
  731. tmp_vote != TLV_VOTE_WAIT_FOR_REPLY &&
  732. tmp_vote != TLV_VOTE_NO_CHANGE) {
  733. return (-4);
  734. }
  735. *vote = tmp_vote;
  736. return (0);
  737. }
  738. int
  739. tlv_iter_decode_quorate(struct tlv_iterator *tlv_iter, enum tlv_quorate *quorate)
  740. {
  741. uint8_t u8;
  742. enum tlv_quorate tmp_quorate;
  743. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  744. return (-1);
  745. }
  746. tmp_quorate = u8;
  747. if (tmp_quorate != TLV_QUORATE_QUORATE &&
  748. tmp_quorate != TLV_QUORATE_INQUORATE) {
  749. return (-4);
  750. }
  751. *quorate = tmp_quorate;
  752. return (0);
  753. }
  754. int
  755. tlv_iter_decode_heuristics(struct tlv_iterator *tlv_iter, enum tlv_heuristics *heuristics)
  756. {
  757. uint8_t u8;
  758. enum tlv_heuristics tmp_heuristics;
  759. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  760. return (-1);
  761. }
  762. tmp_heuristics = u8;
  763. if (tmp_heuristics != TLV_HEURISTICS_PASS &&
  764. tmp_heuristics != TLV_HEURISTICS_FAIL) {
  765. return (-4);
  766. }
  767. *heuristics = tmp_heuristics;
  768. return (0);
  769. }
  770. int
  771. tlv_iter_decode_keep_active_partition_tie_breaker(struct tlv_iterator *tlv_iter,
  772. enum tlv_keep_active_partition_tie_breaker *keep_active_partition_tie_breaker)
  773. {
  774. uint8_t u8;
  775. enum tlv_keep_active_partition_tie_breaker tmp_keep_active_partition_tb;
  776. if (tlv_iter_decode_u8(tlv_iter, &u8) != 0) {
  777. return (-1);
  778. }
  779. tmp_keep_active_partition_tb = u8;
  780. if (tmp_keep_active_partition_tb != TLV_KEEP_ACTIVE_PARTITION_TIE_BREAKER_DISABLED &&
  781. tmp_keep_active_partition_tb != TLV_KEEP_ACTIVE_PARTITION_TIE_BREAKER_ENABLED) {
  782. return (-4);
  783. }
  784. *keep_active_partition_tie_breaker = tmp_keep_active_partition_tb;
  785. return (0);
  786. }
  787. void
  788. tlv_get_supported_options(enum tlv_opt_type **supported_options, size_t *no_supported_options)
  789. {
  790. *supported_options = tlv_static_supported_options;
  791. *no_supported_options = TLV_STATIC_SUPPORTED_OPTIONS_SIZE;
  792. }
  793. int
  794. tlv_ring_id_eq(const struct tlv_ring_id *rid1, const struct tlv_ring_id *rid2)
  795. {
  796. return (rid1->node_id == rid2->node_id && rid1->seq == rid2->seq);
  797. }
  798. int
  799. tlv_tie_breaker_eq(const struct tlv_tie_breaker *tb1, const struct tlv_tie_breaker *tb2)
  800. {
  801. if (tb1->mode == tb2->mode && tb1->mode == TLV_TIE_BREAKER_MODE_NODE_ID) {
  802. return (tb1->node_id == tb2->node_id);
  803. }
  804. return (tb1->mode == tb2->mode);
  805. }
  806. const char *
  807. tlv_vote_to_str(enum tlv_vote vote)
  808. {
  809. switch (vote) {
  810. case TLV_VOTE_UNDEFINED: break;
  811. case TLV_VOTE_ACK: return ("ACK"); break;
  812. case TLV_VOTE_NACK: return ("NACK"); break;
  813. case TLV_VOTE_ASK_LATER: return ("Ask later"); break;
  814. case TLV_VOTE_WAIT_FOR_REPLY: return ("Wait for reply"); break;
  815. case TLV_VOTE_NO_CHANGE: return ("No change"); break;
  816. }
  817. return ("Unknown vote value");
  818. }
  819. const char *
  820. tlv_node_state_to_str(enum tlv_node_state state)
  821. {
  822. switch (state) {
  823. case TLV_NODE_STATE_NOT_SET: return ("not set"); break;
  824. case TLV_NODE_STATE_MEMBER: return ("member"); break;
  825. case TLV_NODE_STATE_DEAD: return ("dead"); break;
  826. case TLV_NODE_STATE_LEAVING: return ("leaving"); break;
  827. }
  828. return ("Unhandled node state");
  829. }
  830. const char *
  831. tlv_tls_supported_to_str(enum tlv_tls_supported tls_supported)
  832. {
  833. switch (tls_supported) {
  834. case TLV_TLS_UNSUPPORTED: return ("Unsupported"); break;
  835. case TLV_TLS_SUPPORTED: return ("Supported"); break;
  836. case TLV_TLS_REQUIRED: return ("Required"); break;
  837. }
  838. return ("Unhandled tls supported state");
  839. }
  840. const char *
  841. tlv_decision_algorithm_type_to_str(enum tlv_decision_algorithm_type algorithm)
  842. {
  843. switch (algorithm) {
  844. case TLV_DECISION_ALGORITHM_TYPE_TEST: return ("Test"); break;
  845. case TLV_DECISION_ALGORITHM_TYPE_FFSPLIT: return ("Fifty-Fifty split"); break;
  846. case TLV_DECISION_ALGORITHM_TYPE_2NODELMS: return ("2 Node LMS"); break;
  847. case TLV_DECISION_ALGORITHM_TYPE_LMS: return ("LMS"); break;
  848. }
  849. return ("Unknown algorithm");
  850. }
  851. const char *
  852. tlv_heuristics_to_str(enum tlv_heuristics heuristics)
  853. {
  854. switch (heuristics) {
  855. case TLV_HEURISTICS_UNDEFINED: return ("Undefined"); break;
  856. case TLV_HEURISTICS_PASS: return ("Pass"); break;
  857. case TLV_HEURISTICS_FAIL: return ("Fail"); break;
  858. }
  859. return ("Unknown heuristics type");
  860. }
  861. int
  862. tlv_heuristics_cmp(enum tlv_heuristics h1, enum tlv_heuristics h2)
  863. {
  864. int res;
  865. res = -2;
  866. switch (h1) {
  867. case TLV_HEURISTICS_UNDEFINED:
  868. switch (h2) {
  869. case TLV_HEURISTICS_UNDEFINED: res = 0; break;
  870. case TLV_HEURISTICS_PASS: res = -1; break;
  871. case TLV_HEURISTICS_FAIL: res = 1; break;
  872. }
  873. break;
  874. case TLV_HEURISTICS_PASS:
  875. switch (h2) {
  876. case TLV_HEURISTICS_UNDEFINED: res = 1; break;
  877. case TLV_HEURISTICS_PASS: res = 0; break;
  878. case TLV_HEURISTICS_FAIL: res = 1; break;
  879. }
  880. break;
  881. case TLV_HEURISTICS_FAIL:
  882. switch (h2) {
  883. case TLV_HEURISTICS_UNDEFINED: res = -1; break;
  884. case TLV_HEURISTICS_PASS: res = -1; break;
  885. case TLV_HEURISTICS_FAIL: res = 0; break;
  886. }
  887. break;
  888. }
  889. assert(res == -1 || res == 0 || res == 1);
  890. return (res);
  891. }
  892. const char *
  893. tlv_keep_active_partition_tie_breaker_to_str(enum tlv_keep_active_partition_tie_breaker kap_tb)
  894. {
  895. switch (kap_tb) {
  896. case TLV_KEEP_ACTIVE_PARTITION_TIE_BREAKER_DISABLED: return ("Disabled"); break;
  897. case TLV_KEEP_ACTIVE_PARTITION_TIE_BREAKER_ENABLED: return ("Enabled"); break;
  898. }
  899. return ("Unknown keep active partition tie breaker type");
  900. }