util.c 4.0 KB

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