util.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  1. /*
  2. * Copyright (c) 2002-2004 MontaVista Software, Inc.
  3. * Copyright (c) 2004 Open Source Development Lab
  4. * Copyright (c) 2006-2012 Red Hat, Inc.
  5. *
  6. * All rights reserved.
  7. *
  8. * Author: Steven Dake (sdake@redhat.com), Mark Haverkamp (markh@osdl.org)
  9. *
  10. * This software licensed under BSD license, the text of which follows:
  11. *
  12. * Redistribution and use in source and binary forms, with or without
  13. * modification, are permitted provided that the following conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above copyright notice,
  16. * this list of conditions and the following disclaimer.
  17. * - Redistributions in binary form must reproduce the above copyright notice,
  18. * this list of conditions and the following disclaimer in the documentation
  19. * and/or other materials provided with the distribution.
  20. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  21. * contributors may be used to endorse or promote products derived from this
  22. * software without specific prior written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  25. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  34. * THE POSSIBILITY OF SUCH DAMAGE.
  35. */
  36. #include <config.h>
  37. #include <stdio.h>
  38. #include <string.h>
  39. #include <stdlib.h>
  40. #include <errno.h>
  41. #include <sys/time.h>
  42. #include <assert.h>
  43. #include <sys/socket.h>
  44. #include <libknet.h>
  45. #include <corosync/corotypes.h>
  46. #include <corosync/corodefs.h>
  47. #include <corosync/icmap.h>
  48. #include <corosync/logsys.h>
  49. #include "util.h"
  50. LOGSYS_DECLARE_SUBSYS ("MAIN");
  51. struct service_names {
  52. const char *c_name;
  53. int32_t c_val;
  54. };
  55. static struct service_names servicenames[] =
  56. {
  57. { "CFG", CFG_SERVICE },
  58. { "CPG", CPG_SERVICE },
  59. { "QUORUM", QUORUM_SERVICE },
  60. { "PLOAD", PLOAD_SERVICE },
  61. { "VOTEQUORUM", VOTEQUORUM_SERVICE },
  62. { "MON", MON_SERVICE },
  63. { "WD", WD_SERVICE },
  64. { "CMAP", CMAP_SERVICE },
  65. { NULL, -1 }
  66. };
  67. const char * short_service_name_get(uint32_t service_id,
  68. char *buf, size_t buf_size)
  69. {
  70. uint32_t i;
  71. for (i = 0; servicenames[i].c_name != NULL; i++) {
  72. if (service_id == servicenames[i].c_val) {
  73. return (servicenames[i].c_name);
  74. }
  75. }
  76. snprintf(buf, buf_size, "%d", service_id);
  77. return buf;
  78. }
  79. /*
  80. * Compare two names. returns non-zero on match.
  81. */
  82. int name_match(cs_name_t *name1, cs_name_t *name2)
  83. {
  84. if (name1->length == name2->length) {
  85. return ((strncmp ((char *)name1->value, (char *)name2->value,
  86. name1->length)) == 0);
  87. }
  88. return 0;
  89. }
  90. /*
  91. * Get the time of day and convert to nanoseconds
  92. */
  93. cs_time_t clust_time_now(void)
  94. {
  95. struct timeval tv;
  96. cs_time_t time_now;
  97. if (gettimeofday(&tv, 0)) {
  98. return 0ULL;
  99. }
  100. time_now = (cs_time_t)(tv.tv_sec) * 1000000000ULL;
  101. time_now += (cs_time_t)(tv.tv_usec) * 1000ULL;
  102. return time_now;
  103. }
  104. void _corosync_out_of_memory_error (void) __attribute__((noreturn));
  105. void _corosync_out_of_memory_error (void)
  106. {
  107. assert (0==1);
  108. exit (EXIT_FAILURE);
  109. }
  110. void _corosync_exit_error (
  111. enum e_corosync_done err, const char *file, unsigned int line) __attribute__((noreturn));
  112. void _corosync_exit_error (
  113. enum e_corosync_done err, const char *file, unsigned int line)
  114. {
  115. if (err == COROSYNC_DONE_EXIT) {
  116. log_printf (LOGSYS_LEVEL_NOTICE,
  117. "Corosync Cluster Engine exiting normally");
  118. } else {
  119. log_printf (LOGSYS_LEVEL_ERROR, "Corosync Cluster Engine exiting "
  120. "with status %d at %s:%u.", err, file, line);
  121. }
  122. logsys_system_fini ();
  123. exit (err);
  124. }
  125. char *getcs_name_t (cs_name_t *name)
  126. {
  127. static char ret_name[CS_MAX_NAME_LENGTH];
  128. /* if string is corrupt (non-terminated), ensure it's displayed safely */
  129. if (name->length >= CS_MAX_NAME_LENGTH || name->value[name->length] != '\0') {
  130. memset (ret_name, 0, sizeof (ret_name));
  131. memcpy (ret_name, name->value, min(name->length, CS_MAX_NAME_LENGTH -1));
  132. return (ret_name);
  133. }
  134. return ((char *)name->value);
  135. }
  136. void setcs_name_t (cs_name_t *name, char *str) {
  137. strncpy ((char *)name->value, str, sizeof (name->value) - 1);
  138. ((char *)name->value)[sizeof (name->value) - 1] = '\0';
  139. if (strlen ((char *)name->value) > CS_MAX_NAME_LENGTH) {
  140. name->length = CS_MAX_NAME_LENGTH;
  141. } else {
  142. name->length = strlen (str);
  143. }
  144. }
  145. int cs_name_tisEqual (cs_name_t *str1, char *str2) {
  146. if (str1->length == strlen (str2)) {
  147. return ((strncmp ((char *)str1->value, (char *)str2,
  148. str1->length)) == 0);
  149. } else {
  150. return 0;
  151. }
  152. }
  153. const char *get_state_dir(void)
  154. {
  155. static char path[PATH_MAX] = {'\0'};
  156. char *state_dir;
  157. int res;
  158. if (path[0] == '\0') {
  159. if (icmap_get_string("system.state_dir", &state_dir) == CS_OK) {
  160. res = snprintf(path, PATH_MAX, "%s", state_dir);
  161. free(state_dir);
  162. } else if ((state_dir = getenv("STATE_DIRECTORY")) != NULL) {
  163. /*
  164. * systemd allows multiple directory names that are
  165. * passed to env variable separated by colon. Support for this feature
  166. * is deliberately not implemented because corosync always
  167. * uses just one state directory and it is unclear what behavior should
  168. * be taken for multiple ones. If reasonable need for
  169. * supporting multiple directories appear, it must be implemented also
  170. * for cmap.
  171. */
  172. res = snprintf(path, PATH_MAX, "%s", state_dir);
  173. } else {
  174. res = snprintf(path, PATH_MAX, "%s/%s", LOCALSTATEDIR, "lib/corosync");
  175. }
  176. assert(res < PATH_MAX);
  177. }
  178. return (path);
  179. }
  180. static int safe_strcat(char *dst, size_t dst_len, const char *src)
  181. {
  182. if (strlen(dst) + strlen(src) >= dst_len - 1) {
  183. return (-1);
  184. }
  185. strcat(dst, src);
  186. return (0);
  187. }
  188. /*
  189. * val - knet crypto model to find
  190. * crypto_list_str - string with concatenated list of available crypto models - can be NULL
  191. * machine_parseable_str - 0 - split strings by space, 1 - use human form (split by "," and last item with "or")
  192. * error_string_prefix - Prefix to add into error string
  193. * error_string - Complete error string
  194. */
  195. int util_is_valid_knet_crypto_model(const char *val,
  196. const char **list_str, int machine_parseable_str,
  197. const char *error_string_prefix, const char **error_string)
  198. {
  199. size_t entries;
  200. struct knet_crypto_info crypto_list[16];
  201. size_t zi;
  202. static char local_error_str[512];
  203. static char local_list_str[256];
  204. int model_found = 0;
  205. if (list_str != NULL) {
  206. *list_str = local_list_str;
  207. }
  208. memset(local_error_str, 0, sizeof(local_error_str));
  209. memset(local_list_str, 0, sizeof(local_list_str));
  210. safe_strcat(local_error_str, sizeof(local_error_str), error_string_prefix);
  211. if (knet_get_crypto_list(NULL, &entries) != 0) {
  212. *error_string = "internal error - cannot get knet crypto list";
  213. return (-1);
  214. }
  215. if (entries > sizeof(crypto_list) / sizeof(crypto_list[0])) {
  216. *error_string = "internal error - too many knet crypto list entries";
  217. return (-1);
  218. }
  219. if (knet_get_crypto_list(crypto_list, &entries) != 0) {
  220. *error_string = "internal error - cannot get knet crypto list";
  221. return (-1);
  222. }
  223. for (zi = 0; zi < entries; zi++) {
  224. if (zi == 0) {
  225. } else if (zi == entries - 1) {
  226. if (machine_parseable_str) {
  227. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  228. } else {
  229. (void)safe_strcat(local_list_str, sizeof(local_list_str), " or ");
  230. }
  231. } else {
  232. if (machine_parseable_str) {
  233. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  234. } else {
  235. (void)safe_strcat(local_list_str, sizeof(local_list_str), ", ");
  236. }
  237. }
  238. (void)safe_strcat(local_list_str, sizeof(local_list_str), crypto_list[zi].name);
  239. if (val != NULL && strcmp(val, crypto_list[zi].name) == 0) {
  240. model_found = 1;
  241. }
  242. }
  243. if (!model_found) {
  244. (void)safe_strcat(local_error_str, sizeof(local_error_str), local_list_str);
  245. *error_string = local_error_str;
  246. }
  247. return (model_found);
  248. }
  249. int util_is_valid_knet_compress_model(const char *val,
  250. const char **list_str, int machine_parseable_str,
  251. const char *error_string_prefix, const char **error_string)
  252. {
  253. size_t entries;
  254. struct knet_compress_info compress_list[16];
  255. size_t zi;
  256. static char local_error_str[512];
  257. static char local_list_str[256];
  258. int model_found = 0;
  259. if (list_str != NULL) {
  260. *list_str = local_list_str;
  261. }
  262. memset(local_error_str, 0, sizeof(local_error_str));
  263. memset(local_list_str, 0, sizeof(local_list_str));
  264. safe_strcat(local_error_str, sizeof(local_error_str), error_string_prefix);
  265. if (knet_get_compress_list(NULL, &entries) != 0) {
  266. *error_string = "internal error - cannot get knet compress list";
  267. return (-1);
  268. }
  269. if (entries > sizeof(compress_list) / sizeof(compress_list[0])) {
  270. *error_string = "internal error - too many knet compress list entries";
  271. return (-1);
  272. }
  273. if (knet_get_compress_list(compress_list, &entries) != 0) {
  274. *error_string = "internal error - cannot get knet compress list";
  275. return (-1);
  276. }
  277. for (zi = 0; zi < entries; zi++) {
  278. if (zi == 0) {
  279. } else if (zi == entries - 1) {
  280. if (machine_parseable_str) {
  281. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  282. } else {
  283. (void)safe_strcat(local_list_str, sizeof(local_list_str), " or ");
  284. }
  285. } else {
  286. if (machine_parseable_str) {
  287. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  288. } else {
  289. (void)safe_strcat(local_list_str, sizeof(local_list_str), ", ");
  290. }
  291. }
  292. (void)safe_strcat(local_list_str, sizeof(local_list_str), compress_list[zi].name);
  293. if (val != NULL && strcmp(val, compress_list[zi].name) == 0) {
  294. model_found = 1;
  295. }
  296. }
  297. if (!model_found) {
  298. (void)safe_strcat(local_error_str, sizeof(local_error_str), local_list_str);
  299. *error_string = local_error_str;
  300. }
  301. return (model_found);
  302. }
  303. int
  304. set_socket_dscp(int socket, unsigned char dscp)
  305. {
  306. int res = 0;
  307. int tos;
  308. if (dscp) {
  309. /* dscp is the upper 6 bits of TOS IP header field, RFC 2474 */
  310. tos = (dscp & 0x3f) << 2;
  311. res = setsockopt(socket, IPPROTO_IP, IP_TOS, &tos, sizeof(tos));
  312. }
  313. return res;
  314. }