xref: /freebsd/crypto/heimdal/lib/roken/mini_inetd.c (revision 1b6c76a2fe091c74f08427e6c870851025a9cf67)
1 /*
2  * Copyright (c) 1995 - 2000 Kungliga Tekniska H�gskolan
3  * (Royal Institute of Technology, Stockholm, Sweden).
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions
8  * are met:
9  *
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  *
13  * 2. Redistributions in binary form must reproduce the above copyright
14  *    notice, this list of conditions and the following disclaimer in the
15  *    documentation and/or other materials provided with the distribution.
16  *
17  * 3. Neither the name of the Institute nor the names of its contributors
18  *    may be used to endorse or promote products derived from this software
19  *    without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31  * SUCH DAMAGE.
32  */
33 
34 #ifdef HAVE_CONFIG_H
35 #include <config.h>
36 RCSID("$Id: mini_inetd.c,v 1.28 2000/10/08 13:38:47 assar Exp $");
37 #endif
38 
39 #include <err.h>
40 #include "roken.h"
41 
42 /*
43  * accept a connection on `s' and pretend it's served by inetd.
44  */
45 
46 static void
47 accept_it (int s)
48 {
49     int s2;
50 
51     s2 = accept(s, NULL, NULL);
52     if(s2 < 0)
53 	err (1, "accept");
54     close(s);
55     dup2(s2, STDIN_FILENO);
56     dup2(s2, STDOUT_FILENO);
57     /* dup2(s2, STDERR_FILENO); */
58     close(s2);
59 }
60 
61 /*
62  * Listen on `port' emulating inetd.
63  */
64 
65 void
66 mini_inetd (int port)
67 {
68     int error, ret;
69     struct addrinfo *ai, *a, hints;
70     char portstr[NI_MAXSERV];
71     int n, nalloc, i;
72     int *fds;
73     fd_set orig_read_set, read_set;
74     int max_fd = -1;
75 
76     memset (&hints, 0, sizeof(hints));
77     hints.ai_flags    = AI_PASSIVE;
78     hints.ai_socktype = SOCK_STREAM;
79 
80     snprintf (portstr, sizeof(portstr), "%d", ntohs(port));
81 
82     error = getaddrinfo (NULL, portstr, &hints, &ai);
83     if (error)
84 	errx (1, "getaddrinfo: %s", gai_strerror (error));
85 
86     for (nalloc = 0, a = ai; a != NULL; a = a->ai_next)
87 	++nalloc;
88 
89     fds = malloc (nalloc * sizeof(*fds));
90     if (fds == NULL)
91 	errx (1, "mini_inetd: out of memory");
92 
93     FD_ZERO(&orig_read_set);
94 
95     for (i = 0, a = ai; a != NULL; a = a->ai_next) {
96 	fds[i] = socket (a->ai_family, a->ai_socktype, a->ai_protocol);
97 	if (fds[i] < 0) {
98 	    warn ("socket");
99 	    continue;
100 	}
101 	socket_set_reuseaddr (fds[i], 1);
102 	if (bind (fds[i], a->ai_addr, a->ai_addrlen) < 0)
103 	    err (1, "bind");
104 	if (listen (fds[i], SOMAXCONN) < 0)
105 	    err (1, "listen");
106 	if (fds[i] >= FD_SETSIZE)
107 	    errx (1, "fd too large");
108 	FD_SET(fds[i], &orig_read_set);
109 	max_fd = max(max_fd, fds[i]);
110 	++i;
111     }
112     freeaddrinfo (ai);
113     if (i == 0)
114 	errx (1, "no sockets");
115     n = i;
116 
117     do {
118 	read_set = orig_read_set;
119 
120 	ret = select (max_fd + 1, &read_set, NULL, NULL, NULL);
121 	if (ret < 0 && errno != EINTR)
122 	    err (1, "select");
123     } while (ret <= 0);
124 
125     for (i = 0; i < n; ++i)
126 	if (FD_ISSET (fds[i], &read_set)) {
127 	    accept_it (fds[i]);
128 	    return;
129 	}
130     abort ();
131 }
132