4
0

util.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343
  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 <libknet.h>
  44. #include <corosync/corotypes.h>
  45. #include <corosync/corodefs.h>
  46. #include <corosync/icmap.h>
  47. #include <corosync/logsys.h>
  48. #include "util.h"
  49. LOGSYS_DECLARE_SUBSYS ("MAIN");
  50. struct service_names {
  51. const char *c_name;
  52. int32_t c_val;
  53. };
  54. static struct service_names servicenames[] =
  55. {
  56. { "CFG", CFG_SERVICE },
  57. { "CPG", CPG_SERVICE },
  58. { "QUORUM", QUORUM_SERVICE },
  59. { "PLOAD", PLOAD_SERVICE },
  60. { "VOTEQUORUM", VOTEQUORUM_SERVICE },
  61. { "MON", MON_SERVICE },
  62. { "WD", WD_SERVICE },
  63. { "CMAP", CMAP_SERVICE },
  64. { NULL, -1 }
  65. };
  66. const char * short_service_name_get(uint32_t service_id,
  67. char *buf, size_t buf_size)
  68. {
  69. uint32_t i;
  70. for (i = 0; servicenames[i].c_name != NULL; i++) {
  71. if (service_id == servicenames[i].c_val) {
  72. return (servicenames[i].c_name);
  73. }
  74. }
  75. snprintf(buf, buf_size, "%d", service_id);
  76. return buf;
  77. }
  78. /*
  79. * Compare two names. returns non-zero on match.
  80. */
  81. int name_match(cs_name_t *name1, cs_name_t *name2)
  82. {
  83. if (name1->length == name2->length) {
  84. return ((strncmp ((char *)name1->value, (char *)name2->value,
  85. name1->length)) == 0);
  86. }
  87. return 0;
  88. }
  89. /*
  90. * Get the time of day and convert to nanoseconds
  91. */
  92. cs_time_t clust_time_now(void)
  93. {
  94. struct timeval tv;
  95. cs_time_t time_now;
  96. if (gettimeofday(&tv, 0)) {
  97. return 0ULL;
  98. }
  99. time_now = (cs_time_t)(tv.tv_sec) * 1000000000ULL;
  100. time_now += (cs_time_t)(tv.tv_usec) * 1000ULL;
  101. return time_now;
  102. }
  103. void _corosync_out_of_memory_error (void) __attribute__((noreturn));
  104. void _corosync_out_of_memory_error (void)
  105. {
  106. assert (0==1);
  107. exit (EXIT_FAILURE);
  108. }
  109. void _corosync_exit_error (
  110. enum e_corosync_done err, const char *file, unsigned int line) __attribute__((noreturn));
  111. void _corosync_exit_error (
  112. enum e_corosync_done err, const char *file, unsigned int line)
  113. {
  114. if (err == COROSYNC_DONE_EXIT) {
  115. log_printf (LOGSYS_LEVEL_NOTICE,
  116. "Corosync Cluster Engine exiting normally");
  117. } else {
  118. log_printf (LOGSYS_LEVEL_ERROR, "Corosync Cluster Engine exiting "
  119. "with status %d at %s:%u.", err, file, line);
  120. }
  121. logsys_system_fini ();
  122. exit (err);
  123. }
  124. char *getcs_name_t (cs_name_t *name)
  125. {
  126. static char ret_name[CS_MAX_NAME_LENGTH];
  127. /* if string is corrupt (non-terminated), ensure it's displayed safely */
  128. if (name->length >= CS_MAX_NAME_LENGTH || name->value[name->length] != '\0') {
  129. memset (ret_name, 0, sizeof (ret_name));
  130. memcpy (ret_name, name->value, min(name->length, CS_MAX_NAME_LENGTH -1));
  131. return (ret_name);
  132. }
  133. return ((char *)name->value);
  134. }
  135. void setcs_name_t (cs_name_t *name, char *str) {
  136. strncpy ((char *)name->value, str, sizeof (name->value) - 1);
  137. ((char *)name->value)[sizeof (name->value) - 1] = '\0';
  138. if (strlen ((char *)name->value) > CS_MAX_NAME_LENGTH) {
  139. name->length = CS_MAX_NAME_LENGTH;
  140. } else {
  141. name->length = strlen (str);
  142. }
  143. }
  144. int cs_name_tisEqual (cs_name_t *str1, char *str2) {
  145. if (str1->length == strlen (str2)) {
  146. return ((strncmp ((char *)str1->value, (char *)str2,
  147. str1->length)) == 0);
  148. } else {
  149. return 0;
  150. }
  151. }
  152. const char *get_state_dir(void)
  153. {
  154. static char path[PATH_MAX] = {'\0'};
  155. char *cmap_state_dir;
  156. int res;
  157. if (path[0] == '\0') {
  158. if (icmap_get_string("system.state_dir", &cmap_state_dir) == CS_OK) {
  159. res = snprintf(path, PATH_MAX, "%s", cmap_state_dir);
  160. free(cmap_state_dir);
  161. } else {
  162. res = snprintf(path, PATH_MAX, "%s/%s", LOCALSTATEDIR, "lib/corosync");
  163. }
  164. assert(res < PATH_MAX);
  165. }
  166. return (path);
  167. }
  168. static int safe_strcat(char *dst, size_t dst_len, const char *src)
  169. {
  170. if (strlen(dst) + strlen(src) >= dst_len - 1) {
  171. return (-1);
  172. }
  173. strcat(dst, src);
  174. return (0);
  175. }
  176. /*
  177. * val - knet crypto model to find
  178. * crypto_list_str - string with concatenated list of available crypto models - can be NULL
  179. * machine_parseable_str - 0 - split strings by space, 1 - use human form (split by "," and last item with "or")
  180. * error_string_prefix - Prefix to add into error string
  181. * error_string - Complete error string
  182. */
  183. int util_is_valid_knet_crypto_model(const char *val,
  184. const char **list_str, int machine_parseable_str,
  185. const char *error_string_prefix, const char **error_string)
  186. {
  187. size_t entries;
  188. struct knet_crypto_info crypto_list[16];
  189. size_t zi;
  190. static char local_error_str[512];
  191. static char local_list_str[256];
  192. int model_found = 0;
  193. if (list_str != NULL) {
  194. *list_str = local_list_str;
  195. }
  196. memset(local_error_str, 0, sizeof(local_error_str));
  197. memset(local_list_str, 0, sizeof(local_list_str));
  198. safe_strcat(local_error_str, sizeof(local_error_str), error_string_prefix);
  199. if (knet_get_crypto_list(NULL, &entries) != 0) {
  200. *error_string = "internal error - cannot get knet crypto list";
  201. return (-1);
  202. }
  203. if (entries > sizeof(crypto_list) / sizeof(crypto_list[0])) {
  204. *error_string = "internal error - too many knet crypto list entries";
  205. return (-1);
  206. }
  207. if (knet_get_crypto_list(crypto_list, &entries) != 0) {
  208. *error_string = "internal error - cannot get knet crypto list";
  209. return (-1);
  210. }
  211. for (zi = 0; zi < entries; zi++) {
  212. if (zi == 0) {
  213. } else if (zi == entries - 1) {
  214. if (machine_parseable_str) {
  215. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  216. } else {
  217. (void)safe_strcat(local_list_str, sizeof(local_list_str), " or ");
  218. }
  219. } else {
  220. if (machine_parseable_str) {
  221. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  222. } else {
  223. (void)safe_strcat(local_list_str, sizeof(local_list_str), ", ");
  224. }
  225. }
  226. (void)safe_strcat(local_list_str, sizeof(local_list_str), crypto_list[zi].name);
  227. if (val != NULL && strcmp(val, crypto_list[zi].name) == 0) {
  228. model_found = 1;
  229. }
  230. }
  231. if (!model_found) {
  232. (void)safe_strcat(local_error_str, sizeof(local_error_str), local_list_str);
  233. *error_string = local_error_str;
  234. }
  235. return (model_found);
  236. }
  237. int util_is_valid_knet_compress_model(const char *val,
  238. const char **list_str, int machine_parseable_str,
  239. const char *error_string_prefix, const char **error_string)
  240. {
  241. size_t entries;
  242. struct knet_compress_info compress_list[16];
  243. size_t zi;
  244. static char local_error_str[512];
  245. static char local_list_str[256];
  246. int model_found = 0;
  247. if (list_str != NULL) {
  248. *list_str = local_list_str;
  249. }
  250. memset(local_error_str, 0, sizeof(local_error_str));
  251. memset(local_list_str, 0, sizeof(local_list_str));
  252. safe_strcat(local_error_str, sizeof(local_error_str), error_string_prefix);
  253. if (knet_get_compress_list(NULL, &entries) != 0) {
  254. *error_string = "internal error - cannot get knet compress list";
  255. return (-1);
  256. }
  257. if (entries > sizeof(compress_list) / sizeof(compress_list[0])) {
  258. *error_string = "internal error - too many knet compress list entries";
  259. return (-1);
  260. }
  261. if (knet_get_compress_list(compress_list, &entries) != 0) {
  262. *error_string = "internal error - cannot get knet compress list";
  263. return (-1);
  264. }
  265. for (zi = 0; zi < entries; zi++) {
  266. if (zi == 0) {
  267. } else if (zi == entries - 1) {
  268. if (machine_parseable_str) {
  269. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  270. } else {
  271. (void)safe_strcat(local_list_str, sizeof(local_list_str), " or ");
  272. }
  273. } else {
  274. if (machine_parseable_str) {
  275. (void)safe_strcat(local_list_str, sizeof(local_list_str), " ");
  276. } else {
  277. (void)safe_strcat(local_list_str, sizeof(local_list_str), ", ");
  278. }
  279. }
  280. (void)safe_strcat(local_list_str, sizeof(local_list_str), compress_list[zi].name);
  281. if (val != NULL && strcmp(val, compress_list[zi].name) == 0) {
  282. model_found = 1;
  283. }
  284. }
  285. if (!model_found) {
  286. (void)safe_strcat(local_error_str, sizeof(local_error_str), local_list_str);
  287. *error_string = local_error_str;
  288. }
  289. return (model_found);
  290. }