]> sourceware.org Git - glibc.git/blame - inet/rexec.c
Update.
[glibc.git] / inet / rexec.c
CommitLineData
28f540f4
RM
1/*
2 * Copyright (c) 1980, 1993
3 * The Regents of the University of California. 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.
28f540f4
RM
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30#if defined(LIBC_SCCS) && !defined(lint)
31static char sccsid[] = "@(#)rexec.c 8.1 (Berkeley) 6/4/93";
32#endif /* LIBC_SCCS and not lint */
33
34#include <sys/types.h>
35#include <sys/socket.h>
36
37#include <netinet/in.h>
38
e4cf5070 39#include <alloca.h>
28f540f4
RM
40#include <stdio.h>
41#include <netdb.h>
42#include <errno.h>
84384f5b
UD
43#include <string.h>
44#include <unistd.h>
28f540f4 45
28f540f4 46int rexecoptions;
2d29aba9 47char ahostbuf[NI_MAXHOST];
28f540f4 48
84384f5b 49int
2d29aba9 50rexec_af(ahost, rport, name, pass, cmd, fd2p, af)
28f540f4
RM
51 char **ahost;
52 int rport;
e7fd8a39 53 const char *name, *pass, *cmd;
28f540f4 54 int *fd2p;
2d29aba9 55 sa_family_t af;
28f540f4 56{
2d29aba9
UD
57 struct sockaddr_storage sa2, from;
58 struct addrinfo hints, *res0;
8a3c8443
UD
59 const char *orig_name = name;
60 const char *orig_pass = pass;
28f540f4
RM
61 u_short port;
62 int s, timo = 1, s3;
63 char c;
e4cf5070 64 int herr;
2d29aba9
UD
65 int gai, ok;
66 char servbuff[NI_MAXSERV];
67
68 snprintf(servbuff, sizeof(servbuff), "%d", rport);
69 servbuff[sizeof(servbuff) - 1] = '\0';
e4cf5070 70
2d29aba9
UD
71 memset(&hints, 0, sizeof(hints));
72 hints.ai_family = af;
73 hints.ai_socktype = SOCK_STREAM;
74 hints.ai_flags = AI_CANONNAME;
75 if (gai = getaddrinfo(*ahost, servbuff, &hints, &res0)){
76 /* XXX: set errno? */
77 return -1;
78 }
28f540f4 79
2d29aba9
UD
80 if (res0->ai_canonname){
81 strncpy(ahostbuf, res0->ai_canonname, sizeof(ahostbuf));
82 ahostbuf[sizeof(ahostbuf)-1] = '\0';
83 *ahost = ahostbuf;
84 }
85 else{
86 *ahost = NULL;
87 }
88 ruserpass(res0->ai_canonname, &name, &pass);
28f540f4 89retry:
2d29aba9 90 s = __socket(res0->ai_family, res0->ai_socktype, 0);
28f540f4
RM
91 if (s < 0) {
92 perror("rexec: socket");
93 return (-1);
94 }
2d29aba9 95 if (__connect(s, res0->ai_addr, res0->ai_addrlen) < 0) {
28f540f4 96 if (errno == ECONNREFUSED && timo <= 16) {
50304ef0
UD
97 (void) __close(s);
98 __sleep(timo);
28f540f4
RM
99 timo *= 2;
100 goto retry;
101 }
2d29aba9 102 perror(res0->ai_canonname);
28f540f4
RM
103 return (-1);
104 }
105 if (fd2p == 0) {
50304ef0 106 (void) __write(s, "", 1);
28f540f4
RM
107 port = 0;
108 } else {
d68171ed 109 char num[32];
2d29aba9 110 int s2, sa2len;
d68171ed 111
2d29aba9 112 s2 = __socket(res0->ai_family, res0->ai_socktype, 0);
28f540f4 113 if (s2 < 0) {
50304ef0 114 (void) __close(s);
28f540f4
RM
115 return (-1);
116 }
117 listen(s2, 1);
2d29aba9
UD
118 sa2len = sizeof (sa2);
119 if (getsockname(s2, (struct sockaddr *)&sa2, &sa2len) < 0 ||
4974d2b2 120 sa2len != SA_LEN((struct sockaddr *)&sa2)) {
28f540f4 121 perror("getsockname");
50304ef0 122 (void) __close(s2);
28f540f4
RM
123 goto bad;
124 }
2d29aba9
UD
125 port = 0;
126 if (!getnameinfo((struct sockaddr *)&sa2, sa2len,
127 NULL, 0, servbuff, sizeof(servbuff),
128 NI_NUMERICSERV))
129 port = atoi(servbuff);
28f540f4 130 (void) sprintf(num, "%u", port);
50304ef0 131 (void) __write(s, num, strlen(num)+1);
28f540f4
RM
132 { int len = sizeof (from);
133 s3 = accept(s2, (struct sockaddr *)&from, &len);
50304ef0 134 __close(s2);
28f540f4
RM
135 if (s3 < 0) {
136 perror("accept");
137 port = 0;
138 goto bad;
139 }
140 }
141 *fd2p = s3;
142 }
50304ef0 143 (void) __write(s, name, strlen(name) + 1);
28f540f4 144 /* should public key encypt the password here */
50304ef0
UD
145 (void) __write(s, pass, strlen(pass) + 1);
146 (void) __write(s, cmd, strlen(cmd) + 1);
8a3c8443
UD
147
148 /* We don't need the memory allocated for the name and the password
149 in ruserpass anymore. */
150 if (name != orig_name)
151 free (name);
152 if (pass != orig_pass)
153 free (pass);
154
50304ef0 155 if (__read(s, &c, 1) != 1) {
28f540f4
RM
156 perror(*ahost);
157 goto bad;
158 }
159 if (c != 0) {
50304ef0
UD
160 while (__read(s, &c, 1) == 1) {
161 (void) __write(2, &c, 1);
28f540f4
RM
162 if (c == '\n')
163 break;
164 }
165 goto bad;
166 }
2d29aba9 167 freeaddrinfo(res0);
28f540f4
RM
168 return (s);
169bad:
170 if (port)
50304ef0
UD
171 (void) __close(*fd2p);
172 (void) __close(s);
2d29aba9 173 freeaddrinfo(res0);
28f540f4
RM
174 return (-1);
175}
2d29aba9
UD
176
177int
178rexec(ahost, rport, name, pass, cmd, fd2p)
179 char **ahost;
180 int rport;
181 const char *name, *pass, *cmd;
182 int *fd2p;
183{
184 return rexec_af(ahost, rport, name, pass, cmd, fd2p, AF_INET);
185}
This page took 0.110873 seconds and 5 git commands to generate.