mirror of
https://git.proxmox.com/git/mirror_corosync
synced 2025-05-30 11:02:47 +00:00

git-svn-id: http://svn.fedorahosted.org/svn/corosync/trunk@1076 fd59a12c-fef9-0310-b244-a6a79926bd2f
161 lines
4.2 KiB
C
161 lines
4.2 KiB
C
/*
|
|
* Copyright (c) 2002-2004 MontaVista Software, Inc.
|
|
* Copyright (c) 2004 Open Source Development Lab
|
|
*
|
|
* All rights reserved.
|
|
*
|
|
* Author: Steven Dake (sdake@mvista.com), Mark Haverkamp (markh@osdl.org)
|
|
*
|
|
* This software licensed under BSD license, the text of which follows:
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* - Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* - Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* - Neither the name of the MontaVista Software, Inc. nor the names of its
|
|
* contributors may be used to endorse or promote products derived from this
|
|
* software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
|
|
* THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <stdlib.h>
|
|
#include <errno.h>
|
|
#include <sys/time.h>
|
|
|
|
#include "../include/saAis.h"
|
|
#include "../include/list.h"
|
|
#include "util.h"
|
|
#include "print.h"
|
|
|
|
/*
|
|
* Compare two names. returns non-zero on match.
|
|
*/
|
|
int name_match(SaNameT *name1, SaNameT *name2)
|
|
{
|
|
if (name1->length == name2->length) {
|
|
return ((strncmp ((char *)name1->value, (char *)name2->value,
|
|
name1->length)) == 0);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int mar_name_match(mar_name_t *name1, mar_name_t *name2)
|
|
{
|
|
if (name1->length == name2->length) {
|
|
return ((strncmp ((char *)name1->value, (char *)name2->value,
|
|
name1->length)) == 0);
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* Get the time of day and convert to nanoseconds
|
|
*/
|
|
SaTimeT clust_time_now(void)
|
|
{
|
|
struct timeval tv;
|
|
SaTimeT time_now;
|
|
|
|
if (gettimeofday(&tv, 0)) {
|
|
return 0ULL;
|
|
}
|
|
|
|
time_now = (SaTimeT)(tv.tv_sec) * 1000000000ULL;
|
|
time_now += (SaTimeT)(tv.tv_usec) * 1000ULL;
|
|
|
|
return time_now;
|
|
}
|
|
|
|
|
|
void openais_exit_error (enum e_ais_done err)
|
|
{
|
|
log_printf (LOG_LEVEL_ERROR, "AIS Executive exiting (%d).\n", err);
|
|
log_flush();
|
|
exit (err);
|
|
}
|
|
|
|
char *getSaNameT (SaNameT *name)
|
|
{
|
|
#if 0
|
|
static char ret_name[300];
|
|
|
|
memset (ret_name, 0, sizeof (ret_name));
|
|
if (name->length > 299) {
|
|
memcpy (ret_name, name->value, 299);
|
|
} else {
|
|
|
|
memcpy (ret_name, name->value, name->length);
|
|
}
|
|
return (ret_name);
|
|
#endif
|
|
// TODO
|
|
return ((char *)name->value);
|
|
}
|
|
|
|
char *get_mar_name_t (mar_name_t *name) {
|
|
return ((char *)name->value);
|
|
}
|
|
|
|
char *strstr_rs (const char *haystack, const char *needle)
|
|
{
|
|
char *end_address;
|
|
char *new_needle;
|
|
|
|
new_needle = (char *)strdup (needle);
|
|
new_needle[strlen (new_needle) - 1] = '\0';
|
|
|
|
end_address = strstr (haystack, new_needle);
|
|
if (end_address) {
|
|
end_address += strlen (new_needle);
|
|
end_address = strstr (end_address, needle + strlen (new_needle));
|
|
}
|
|
if (end_address) {
|
|
end_address += 1; /* skip past { or = */
|
|
do {
|
|
if (*end_address == '\t' || *end_address == ' ') {
|
|
end_address++;
|
|
} else {
|
|
break;
|
|
}
|
|
} while (*end_address != '\0');
|
|
}
|
|
|
|
free (new_needle);
|
|
return (end_address);
|
|
}
|
|
|
|
void setSaNameT (SaNameT *name, char *str) {
|
|
strncpy ((char *)name->value, str, SA_MAX_NAME_LENGTH);
|
|
if (strlen ((char *)name->value) > SA_MAX_NAME_LENGTH) {
|
|
name->length = SA_MAX_NAME_LENGTH;
|
|
} else {
|
|
name->length = strlen (str);
|
|
}
|
|
}
|
|
|
|
int SaNameTisEqual (SaNameT *str1, char *str2) {
|
|
if (str1->length == strlen (str2)) {
|
|
return ((strncmp ((char *)str1->value, (char *)str2,
|
|
str1->length)) == 0);
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|