1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
|
/* $NetBSD: misc.c,v 1.6 2008/07/15 00:47:09 mgrooms Exp $ */
/* $KAME: misc.c,v 1.23 2001/08/16 14:37:29 itojun Exp $ */
/*
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. Neither the name of the project 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 PROJECT 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 PROJECT 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 "config.h"
#include <sys/types.h>
#include <sys/param.h>
#include <sys/stat.h>
#include <sys/time.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <syslog.h>
#include <ctype.h>
#include <fcntl.h>
#include "var.h"
#include "misc.h"
#include "debug.h"
#if 0
static int bindump __P((void *, size_t));
static int
bindump(buf0, len)
void *buf0;
size_t len;
{
unsigned char *buf = (unsigned char *)buf0;
size_t i;
for (i = 0; i < len; i++) {
if ((buf[i] & 0x80) || !isprint(buf[i]))
printf("\\x%x", buf[i]);
else
printf("%c", buf[i]);
}
printf("\n");
return 0;
}
#endif
int
racoon_hexdump(buf0, len)
void *buf0;
size_t len;
{
caddr_t buf = (caddr_t)buf0;
size_t i;
for (i = 0; i < len; i++) {
if (i != 0 && i % 32 == 0)
printf("\n");
if (i % 4 == 0)
printf(" ");
printf("%02x", (unsigned char)buf[i]);
}
printf("\n");
return 0;
}
char *
bit2str(n, bl)
int n, bl;
{
#define MAXBITLEN 128
static char b[MAXBITLEN + 1];
int i;
if (bl > MAXBITLEN)
return "Failed to convert."; /* NG */
memset(b, '0', bl);
b[bl] = '\0';
for (i = 0; i < bl; i++) {
if (n & (1 << i))
b[bl - 1 - i] = '1';
}
return b;
}
const char *
debug_location(file, line, func)
const char *file;
int line;
const char *func;
{
static char buf[1024];
const char *p;
/* truncate pathname */
p = strrchr(file, '/');
if (p)
p++;
else
p = file;
if (func)
snprintf(buf, sizeof(buf), "%s:%d:%s()", p, line, func);
else
snprintf(buf, sizeof(buf), "%s:%d", p, line);
return buf;
}
/*
* get file size.
* -1: error occured.
*/
int
getfsize(path)
char *path;
{
struct stat st;
if (stat(path, &st) != 0)
return -1;
else
return st.st_size;
}
/*
* set the close-on-exec flag for file descriptor fd.
*/
void
close_on_exec(fd)
int fd;
{
fcntl(fd, F_SETFD, FD_CLOEXEC);
}
/*
* calculate the difference between two times.
* t1: start
* t2: end
*/
double
timedelta(t1, t2)
struct timeval *t1, *t2;
{
if (t2->tv_usec >= t1->tv_usec)
return t2->tv_sec - t1->tv_sec +
(double)(t2->tv_usec - t1->tv_usec) / 1000000;
return t2->tv_sec - t1->tv_sec - 1 +
(double)(1000000 + t2->tv_usec - t1->tv_usec) / 1000000;
}
|
