util.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161
  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. int mar_name_match(mar_name_t *name1, mar_name_t *name2)
  57. {
  58. if (name1->length == name2->length) {
  59. return ((strncmp ((char *)name1->value, (char *)name2->value,
  60. name1->length)) == 0);
  61. }
  62. return 0;
  63. }
  64. /*
  65. * Get the time of day and convert to nanoseconds
  66. */
  67. SaTimeT clust_time_now(void)
  68. {
  69. struct timeval tv;
  70. SaTimeT time_now;
  71. if (gettimeofday(&tv, 0)) {
  72. return 0ULL;
  73. }
  74. time_now = (SaTimeT)(tv.tv_sec) * 1000000000ULL;
  75. time_now += (SaTimeT)(tv.tv_usec) * 1000ULL;
  76. return time_now;
  77. }
  78. void openais_exit_error (enum e_ais_done err)
  79. {
  80. log_printf (LOG_LEVEL_ERROR, "AIS Executive exiting (%d).\n", err);
  81. log_flush();
  82. exit (err);
  83. }
  84. char *getSaNameT (SaNameT *name)
  85. {
  86. #if 0
  87. static char ret_name[300];
  88. memset (ret_name, 0, sizeof (ret_name));
  89. if (name->length > 299) {
  90. memcpy (ret_name, name->value, 299);
  91. } else {
  92. memcpy (ret_name, name->value, name->length);
  93. }
  94. return (ret_name);
  95. #endif
  96. // TODO
  97. return ((char *)name->value);
  98. }
  99. char *get_mar_name_t (mar_name_t *name) {
  100. return ((char *)name->value);
  101. }
  102. char *strstr_rs (const char *haystack, const char *needle)
  103. {
  104. char *end_address;
  105. char *new_needle;
  106. new_needle = (char *)strdup (needle);
  107. new_needle[strlen (new_needle) - 1] = '\0';
  108. end_address = strstr (haystack, new_needle);
  109. if (end_address) {
  110. end_address += strlen (new_needle);
  111. end_address = strstr (end_address, needle + strlen (new_needle));
  112. }
  113. if (end_address) {
  114. end_address += 1; /* skip past { or = */
  115. do {
  116. if (*end_address == '\t' || *end_address == ' ') {
  117. end_address++;
  118. } else {
  119. break;
  120. }
  121. } while (*end_address != '\0');
  122. }
  123. free (new_needle);
  124. return (end_address);
  125. }
  126. void setSaNameT (SaNameT *name, char *str) {
  127. strncpy ((char *)name->value, str, SA_MAX_NAME_LENGTH);
  128. if (strlen ((char *)name->value) > SA_MAX_NAME_LENGTH) {
  129. name->length = SA_MAX_NAME_LENGTH;
  130. } else {
  131. name->length = strlen (str);
  132. }
  133. }
  134. int SaNameTisEqual (SaNameT *str1, char *str2) {
  135. if (str1->length == strlen (str2)) {
  136. return ((strncmp ((char *)str1->value, (char *)str2,
  137. str1->length)) == 0);
  138. } else {
  139. return 0;
  140. }
  141. }