util.c 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152
  1. /*
  2. * Copyright (c) 2002-2004 MontaVista Software, Inc.
  3. * Copyright (c) 2004 Open Source Development Lab
  4. * Copyright (c) 2006-2007 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 <stdio.h>
  37. #include <string.h>
  38. #include <stdlib.h>
  39. #include <errno.h>
  40. #include <sys/time.h>
  41. #include <corosync/saAis.h>
  42. #include <corosync/list.h>
  43. #include <corosync/engine/logsys.h>
  44. #include "util.h"
  45. LOGSYS_DECLARE_SUBSYS ("MAIN", LOG_INFO);
  46. /*
  47. * Compare two names. returns non-zero on match.
  48. */
  49. int name_match(SaNameT *name1, SaNameT *name2)
  50. {
  51. if (name1->length == name2->length) {
  52. return ((strncmp ((char *)name1->value, (char *)name2->value,
  53. name1->length)) == 0);
  54. }
  55. return 0;
  56. }
  57. /*
  58. * Get the time of day and convert to nanoseconds
  59. */
  60. SaTimeT clust_time_now(void)
  61. {
  62. struct timeval tv;
  63. SaTimeT time_now;
  64. if (gettimeofday(&tv, 0)) {
  65. return 0ULL;
  66. }
  67. time_now = (SaTimeT)(tv.tv_sec) * 1000000000ULL;
  68. time_now += (SaTimeT)(tv.tv_usec) * 1000ULL;
  69. return time_now;
  70. }
  71. void _openais_exit_error (
  72. enum e_ais_done err, const char *file, unsigned int line)
  73. {
  74. log_printf (LOG_LEVEL_ERROR, "AIS Executive exiting "
  75. "with status %d at %s:%u.\n", err, file, line);
  76. logsys_flush();
  77. exit (EXIT_FAILURE);
  78. }
  79. char *getSaNameT (SaNameT *name)
  80. {
  81. #if 0
  82. static char ret_name[300];
  83. memset (ret_name, 0, sizeof (ret_name));
  84. if (name->length > 299) {
  85. memcpy (ret_name, name->value, 299);
  86. } else {
  87. memcpy (ret_name, name->value, name->length);
  88. }
  89. return (ret_name);
  90. #endif
  91. // TODO
  92. return ((char *)name->value);
  93. }
  94. char *strstr_rs (const char *haystack, const char *needle)
  95. {
  96. char *end_address;
  97. char *new_needle;
  98. new_needle = (char *)strdup (needle);
  99. new_needle[strlen (new_needle) - 1] = '\0';
  100. end_address = strstr (haystack, new_needle);
  101. if (end_address) {
  102. end_address += strlen (new_needle);
  103. end_address = strstr (end_address, needle + strlen (new_needle));
  104. }
  105. if (end_address) {
  106. end_address += 1; /* skip past { or = */
  107. do {
  108. if (*end_address == '\t' || *end_address == ' ') {
  109. end_address++;
  110. } else {
  111. break;
  112. }
  113. } while (*end_address != '\0');
  114. }
  115. free (new_needle);
  116. return (end_address);
  117. }
  118. void setSaNameT (SaNameT *name, char *str) {
  119. strncpy ((char *)name->value, str, SA_MAX_NAME_LENGTH);
  120. if (strlen ((char *)name->value) > SA_MAX_NAME_LENGTH) {
  121. name->length = SA_MAX_NAME_LENGTH;
  122. } else {
  123. name->length = strlen (str);
  124. }
  125. }
  126. int SaNameTisEqual (SaNameT *str1, char *str2) {
  127. if (str1->length == strlen (str2)) {
  128. return ((strncmp ((char *)str1->value, (char *)str2,
  129. str1->length)) == 0);
  130. } else {
  131. return 0;
  132. }
  133. }