exec/util.c

   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@mvista.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
  42 #include "../include/saAis.h"
  43 #include "../include/list.h"
  44 #include "util.h"
  45 #include "logsys.h"
  46
  47 LOGSYS_DECLARE_SUBSYS ("MAIN", LOG_INFO);
  48
  49 /*
  50  * Compare two names.  returns non-zero on match.
  51  */
  52 int name_match(SaNameT *name1, SaNameT *name2)
  53 {
  54         if (name1->length == name2->length) {
  55                 return ((strncmp ((char *)name1->value, (char *)name2->value,
  56                         name1->length)) == 0);
  57         }
  58         return 0;
  59 }
  60
  61 int mar_name_match(mar_name_t *name1, mar_name_t *name2)
  62 {
  63         if (name1->length == name2->length) {
  64                 return ((strncmp ((char *)name1->value, (char *)name2->value,
  65                         name1->length)) == 0);
  66         }
  67         return 0;
  68 }
  69
  70 /*
  71  * Get the time of day and convert to nanoseconds
  72  */
  73 SaTimeT clust_time_now(void)
  74 {
  75         struct timeval tv;
  76         SaTimeT time_now;
  77
  78         if (gettimeofday(&tv, 0)) {
  79                 return 0ULL;
  80         }
  81
  82         time_now = (SaTimeT)(tv.tv_sec) * 1000000000ULL;
  83         time_now += (SaTimeT)(tv.tv_usec) * 1000ULL;
  84
  85         return time_now;
  86 }
  87
  88
  89 void _openais_exit_error (
  90         enum e_ais_done err, const char *file, unsigned int line)
  91 {
  92         log_printf (LOG_LEVEL_ERROR, "AIS Executive exiting "
  93                 "with status %d at %s:%u.\n", err, file, line);
  94         logsys_flush();
  95         exit (EXIT_FAILURE);
  96 }
  97
  98 char *getSaNameT (SaNameT *name)
  99 {
 100 #if 0
 101         static char ret_name[300];
 102
 103         memset (ret_name, 0, sizeof (ret_name));
 104         if (name->length > 299) {
 105                 memcpy (ret_name, name->value, 299);
 106         } else {
 107
 108                 memcpy (ret_name, name->value, name->length);
 109         }
 110         return (ret_name);
 111 #endif
 112 // TODO
 113         return ((char *)name->value);
 114 }
 115
 116 char *get_mar_name_t (mar_name_t *name) {
 117         return ((char *)name->value);
 118 }
 119
 120 char *strstr_rs (const char *haystack, const char *needle)
 121 {
 122         char *end_address;
 123         char *new_needle;
 124
 125         new_needle = (char *)strdup (needle);
 126         new_needle[strlen (new_needle) - 1] = '\0';
 127
 128         end_address = strstr (haystack, new_needle);
 129         if (end_address) {
 130                 end_address += strlen (new_needle);
 131                 end_address = strstr (end_address, needle + strlen (new_needle));
 132         }
 133         if (end_address) {
 134                 end_address += 1; /* skip past { or = */
 135                 do {
 136                         if (*end_address == '\t' || *end_address == ' ') {
 137                                 end_address++;
 138                         } else {
 139                                 break;
 140                         }
 141                 } while (*end_address != '\0');
 142         }
 143
 144         free (new_needle);
 145         return (end_address);
 146 }
 147
 148 void setSaNameT (SaNameT *name, char *str) {
 149         strncpy ((char *)name->value, str, SA_MAX_NAME_LENGTH);
 150         if (strlen ((char *)name->value) > SA_MAX_NAME_LENGTH) {
 151                 name->length = SA_MAX_NAME_LENGTH;
 152         } else {
 153                 name->length = strlen (str);
 154         }
 155 }
 156
 157 int SaNameTisEqual (SaNameT *str1, char *str2) {
 158         if (str1->length == strlen (str2)) {
 159                 return ((strncmp ((char *)str1->value, (char *)str2,
 160                         str1->length)) == 0);
 161         } else {
 162                 return 0;
 163         }
 164 }
 165