1/*-
2 * Copyright (c) 2005 Robert N. M. Watson
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 *    notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 *    notice, this list of conditions and the following disclaimer in the
12 *    documentation and/or other materials provided with the distribution.
13 *
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24 * SUCH DAMAGE.
25 */
26
27/*
28 * Back end to a variety of TCP-related benchmarks.  This program accepts TCP
29 * connections on a port, and echoes all received data back to the sender.
30 * It is capable of handling only one connection at a time out of a single
31 * thread.
32 */
33#include <sys/types.h>
34#include <sys/socket.h>
35
36#include <netinet/in.h>
37
38#include <arpa/inet.h>
39
40#include <err.h>
41#include <stdlib.h>
42#include <string.h>
43#include <unistd.h>
44
45/*
46 * Simple micro-benchmark to see how many connections/second can be created
47 * in a serialized fashion against a given server.  A timer signal is used
48 * to interrupt the loop and assess the cost, and uses a fixed maximum
49 * buffer size.  It makes no attempt to time out old connections.
50 */
51#define	BUFFERSIZE	128*1024
52#define	PORT		6060
53
54static void
55handle_connection(int accept_sock)
56{
57	u_char buffer[BUFFERSIZE];
58	ssize_t len, recvlen, sofar;
59	int s;
60
61	s = accept(accept_sock, NULL, NULL);
62	if (s < 0) {
63		warn("accept");
64		return;
65	}
66
67	while (1) {
68		recvlen = recv(s, buffer, BUFFERSIZE, 0);
69		if (recvlen < 0 || recvlen == 0) {
70			close(s);
71			return;
72		}
73		sofar = 0;
74		while (sofar < recvlen) {
75			len = send(s, buffer + sofar, recvlen - sofar, 0);
76			if (len < 0) {
77				close(s);
78				return;
79			}
80			sofar += len;
81		}
82	}
83}
84
85int
86main(int argc, char *argv[])
87{
88	struct sockaddr_in sin;
89	int accept_sock;
90
91	accept_sock = socket(PF_INET, SOCK_STREAM, 0);
92	if (accept_sock < 0)
93		err(-1, "socket(PF_INET, SOCKET_STREAM, 0)");
94
95	bzero(&sin, sizeof(sin));
96	sin.sin_family = AF_INET;
97	sin.sin_len = sizeof(sin);
98	sin.sin_addr.s_addr = INADDR_ANY;
99	sin.sin_port = htons(PORT);
100
101	if (bind(accept_sock, (struct sockaddr *)&sin, sizeof(sin)) < 0)
102		err(-1, "bind");
103
104	if (listen(accept_sock, -1) < 0)
105		err(-1, "listen");
106
107	while (1)
108		handle_connection(accept_sock);
109
110	return (0);
111}
112