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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
|
/*-
* 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$Exp $
*/
/*
* Simple netipx regression test that attempts to build an SPX stream socket
* pair, and send data twice over the stream, once in each direction.
* Purposefully pick a small packet length that should fit into the buffers
* at both ends, and therefore not result in a buffer deadlock.
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <netipx/ipx.h>
#include <err.h>
#include <errno.h>
#include <signal.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
#define IPX_ENDPOINT "0xbebe.1.0x8a13"
#define PACKETLEN 16 * (1024 * 1024)
static void
packet_fill(u_char *packet)
{
int i;
for (i = 0; i < PACKETLEN; i++)
packet[i] = (i & 0xff);
}
static int
packet_check(u_char *packet, size_t totlen, ssize_t len)
{
size_t i;
for (i = totlen; i < totlen + len; i++) {
if (packet[i] != (i & 0xff))
return (-1);
}
return (0);
}
static void
my_send(int sock, const char *who, pid_t pid)
{
u_char packet[PACKETLEN];
ssize_t len;
size_t totlen;
int error;
totlen = 0;
packet_fill(packet);
while (totlen < PACKETLEN) {
len = send(sock, packet + totlen, PACKETLEN - totlen, 0);
if (len < 0) {
error = errno;
(void)kill(pid, SIGTERM);
errno = error;
err(-1, "%s: send()", who);
}
if (len == 0) {
(void)kill(pid, SIGTERM);
errx(-1, "%s: send(): EOF", who);
}
totlen += len;
}
}
static void
my_recv(int sock, const char *who, pid_t pid)
{
u_char packet[PACKETLEN];
ssize_t len;
size_t totlen;
int error;
totlen = 0;
bzero(packet, sizeof(packet));
while (totlen < PACKETLEN) {
len = recv(sock, packet + totlen, sizeof(packet) - totlen, 0);
if (len < 0) {
errno = error;
(void)kill(pid, SIGTERM);
errno = error;
err(-1, "%s: recv()", who);
}
if (len == 0) {
(void)kill(pid, SIGTERM);
errx(-1, "%s: recv(): EOF", who);
}
if (packet_check(packet, totlen, len) < 0) {
(void)kill(pid, SIGTERM);
errx(-1, "%s: recv(): got bad data", who);
}
totlen += len;
}
}
int
main(int argc, char *argv[])
{
int error, sock_listen, sock_recv, sock_send;
struct sockaddr_ipx sipx_listen, sipx_send;
pid_t childpid, parentpid;
/*
* Socket to receive with.
*/
sock_listen = socket(PF_IPX, SOCK_STREAM, 0);
if (sock_listen < 0)
err(-1, "sock_listen = socket(PF_IPX, SOCK_STREAM, 0)");
bzero(&sipx_listen, sizeof(sipx_listen));
sipx_listen.sipx_len = sizeof(sipx_listen);
sipx_listen.sipx_family = AF_IPX;
sipx_listen.sipx_addr = ipx_addr(IPX_ENDPOINT);
if (bind(sock_listen, (struct sockaddr *)&sipx_listen,
sizeof(sipx_listen)) < 0)
err(-1, "bind(sock_listen)");
if (listen(sock_listen, -1) < 0)
err(-1, "listen(sock_listen)");
parentpid = getpid();
childpid = fork();
if (childpid < 0)
err(-1, "fork()");
if (childpid == 0) {
/*
* The child: accept connections and process data on them.
*/
while (1) {
sock_recv = accept(sock_listen, NULL, NULL);
if (sock_recv < 0) {
warn("accept()");
continue;
}
my_recv(sock_recv, "listener", parentpid);
my_send(sock_recv, "listener", parentpid);
close(sock_recv);
}
} else {
/*
* The parent: connect, send data, receive it back, and exit;
* build two connections, once using a full connect() API
* call, and the second using sendto().
*/
/*
* Socket to send with.
*/
sock_send = socket(PF_IPX, SOCK_STREAM, 0);
if (sock_send < 0) {
error = errno;
(void)kill(childpid, SIGTERM);
errno = error;
err(-1, "sock_send = socket(PF_IPX, SOCK_STREAM, 0)");
}
bzero(&sipx_send, sizeof(sipx_send));
sipx_send.sipx_len = sizeof(sipx_send);
sipx_send.sipx_family = AF_IPX;
sipx_send.sipx_addr = ipx_addr(IPX_ENDPOINT);
if (connect(sock_send, (struct sockaddr *)&sipx_send,
sizeof(sipx_send)) < 0) {
error = errno;
(void)kill(childpid, SIGTERM);
errno = error;
err(-1, "sock_send = socket(PF_IPX, SOCK_STREAM, 0)");
}
my_send(sock_send, "connector", childpid);
my_recv(sock_send, "connector", childpid);
close(sock_send);
#ifdef SPX_SUPPORTS_SENDTO_WITH_CONNECT
sock_send = socket(PF_IPX, SOCK_STREAM, 0);
if (sock_send < 0) {
error = errno;
(void)kill(childpid, SIGTERM);
errno = error;
err(-1, "sock_send = socket(PF_IPX, SOCK_STREAM, 0)");
}
bzero(&sipx_send, sizeof(sipx_send));
sipx_send.sipx_len = sizeof(sipx_send);
sipx_send.sipx_family = AF_IPX;
sipx_send.sipx_addr = ipx_addr(IPX_ENDPOINT);
my_sendto(sock_send, "connector", childpid,
(struct sockaddr *)&sipx_send, sizeof(sipx_send));
my_recv(sock_send, "connector", childpid);
close(sock_send);
#endif
(void)kill(childpid, SIGTERM);
}
return (0);
}
|
