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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*-
* Copyright (c) 2006 Robert N. M. Watson
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*
* $FreeBSD$
*/
/*
* Attempts to exercise UNIX domain socket races relating to the non-atomic
* connect-and-send properties of sendto(). As the result of such a race is
* a kernel panic, this test simply completes or doesn't.
*
* XXX: Despite implementing support for sendto() on stream sockets with
* implied connect, the appropriate flag isn't set in the FreeBSD kernel so
* it does not work. For now, don't call the stream test.
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/un.h>
#include <err.h>
#include <signal.h>
#include <string.h>
#include <unistd.h>
#define PATH "/tmp/123"
#define ITERATIONS 1000000
static void
stream_server(int listenfd)
{
int acceptfd;
while (1) {
acceptfd = accept(listenfd, NULL, NULL);
if (acceptfd < 0) {
warn("stream_server: accept");
continue;
}
sleep(1);
close(acceptfd);
}
}
static void
stream_client(void)
{
struct sockaddr_un sun;
ssize_t len;
char c = 0;
int fd, i;
bzero(&sun, sizeof(sun));
sun.sun_len = sizeof(sun);
sun.sun_family = AF_UNIX;
strcpy(sun.sun_path, PATH);
for (i = 0; i < ITERATIONS; i++) {
fd = socket(PF_UNIX, SOCK_STREAM, 0);
if (fd < 0) {
warn("stream_client: socket");
return;
}
len = sendto(fd, &c, sizeof(c), 0, (struct sockaddr *)&sun,
sizeof(sun));
if (len < 0)
warn("stream_client: sendto");
close(fd);
}
}
static void
stream_test(void)
{
struct sockaddr_un sun;
pid_t childpid;
int listenfd;
listenfd = socket(PF_UNIX, SOCK_STREAM, 0);
if (listenfd < 0)
err(-1, "stream_test: socket");
bzero(&sun, sizeof(sun));
sun.sun_len = sizeof(sun);
sun.sun_family = AF_UNIX;
strcpy(sun.sun_path, PATH);
if (bind(listenfd, (struct sockaddr *)&sun, sizeof(sun)) < 0)
err(-1, "stream_test: bind");
if (listen(listenfd, -1) < 0)
err(-1, "stream_test: listen");
childpid = fork();
if (childpid < 0)
err(-1, "stream_test: fork");
if (childpid != 0) {
sleep(1);
stream_client();
kill(childpid, SIGTERM);
sleep(1);
} else
stream_server(listenfd);
(void)unlink(PATH);
}
static void
datagram_server(int serverfd)
{
ssize_t len;
char c;
while (1) {
len = recv(serverfd, &c, sizeof(c), 0);
if (len < 0)
warn("datagram_server: recv");
}
}
static void
datagram_client(void)
{
struct sockaddr_un sun;
ssize_t len;
char c = 0;
int fd, i;
bzero(&sun, sizeof(sun));
sun.sun_len = sizeof(sun);
sun.sun_family = AF_UNIX;
strcpy(sun.sun_path, PATH);
for (i = 0; i < ITERATIONS; i++) {
fd = socket(PF_UNIX, SOCK_DGRAM, 0);
if (fd < 0) {
warn("datagram_client: socket");
return;
}
len = sendto(fd, &c, sizeof(c), 0, (struct sockaddr *)&sun,
sizeof(sun));
if (len < 0)
warn("datagram_client: sendto");
close(fd);
}
}
static void
datagram_test(void)
{
struct sockaddr_un sun;
pid_t childpid;
int serverfd;
serverfd = socket(PF_UNIX, SOCK_DGRAM, 0);
if (serverfd < 0)
err(-1, "datagram_test: socket");
bzero(&sun, sizeof(sun));
sun.sun_len = sizeof(sun);
sun.sun_family = AF_UNIX;
strcpy(sun.sun_path, PATH);
if (bind(serverfd, (struct sockaddr *)&sun, sizeof(sun)) < 0)
err(-1, "datagram_test: bind");
childpid = fork();
if (childpid < 0)
err(-1, "datagram_test: fork");
if (childpid != 0) {
sleep(1);
datagram_client();
kill(childpid, SIGTERM);
sleep(1);
} else
datagram_server(serverfd);
(void)unlink(PATH);
}
int
main(int argc, char *argv[])
{
(void)unlink(PATH);
datagram_test();
if (0)
stream_test();
return (0);
}
|
