rexec.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212
  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.
  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. #define __FORCE_GLIBC
  30. #include <features.h>
  31. #include <sys/types.h>
  32. #include <sys/socket.h>
  33. #include <netinet/in.h>
  34. #include <alloca.h>
  35. #include <stdio.h>
  36. #include <netdb.h>
  37. #include <errno.h>
  38. #include <stdlib.h>
  39. #include <string.h>
  40. #include <unistd.h>
  41. /* Experimentally off - libc_hidden_proto(memset) */
  42. /* Experimentally off - libc_hidden_proto(strlen) */
  43. /* Experimentally off - libc_hidden_proto(strncpy) */
  44. /* libc_hidden_proto(read) */
  45. /* libc_hidden_proto(write) */
  46. /* libc_hidden_proto(close) */
  47. /* libc_hidden_proto(socket) */
  48. /* libc_hidden_proto(perror) */
  49. /* libc_hidden_proto(sprintf) */
  50. /* libc_hidden_proto(snprintf) */
  51. /* libc_hidden_proto(getsockname) */
  52. /* libc_hidden_proto(getnameinfo) */
  53. /* libc_hidden_proto(getaddrinfo) */
  54. /* libc_hidden_proto(freeaddrinfo) */
  55. /* libc_hidden_proto(sleep) */
  56. /* libc_hidden_proto(atoi) */
  57. /* libc_hidden_proto(connect) */
  58. /* libc_hidden_proto(accept) */
  59. /* libc_hidden_proto(listen) */
  60. /* libc_hidden_proto(ruserpass) */
  61. #define SA_LEN(_x) __libc_sa_len((_x)->sa_family)
  62. extern int __libc_sa_len (sa_family_t __af) __THROW attribute_hidden;
  63. int rexecoptions;
  64. char ahostbuf[NI_MAXHOST] attribute_hidden;
  65. /* libc_hidden_proto(rexec_af) */
  66. int
  67. rexec_af(char **ahost, int rport, const char *name, const char *pass, const char *cmd, int *fd2p, sa_family_t af)
  68. {
  69. struct sockaddr_storage sa2, from;
  70. struct addrinfo hints, *res0;
  71. const char *orig_name = name;
  72. const char *orig_pass = pass;
  73. u_short port = 0;
  74. int s, timo = 1, s3;
  75. char c;
  76. int gai;
  77. char servbuff[NI_MAXSERV];
  78. snprintf(servbuff, sizeof(servbuff), "%d", ntohs(rport));
  79. servbuff[sizeof(servbuff) - 1] = '\0';
  80. memset(&hints, '\0', sizeof(hints));
  81. hints.ai_family = af;
  82. hints.ai_socktype = SOCK_STREAM;
  83. hints.ai_flags = AI_CANONNAME;
  84. gai = getaddrinfo(*ahost, servbuff, &hints, &res0);
  85. if (gai){
  86. /* XXX: set errno? */
  87. return -1;
  88. }
  89. if (res0->ai_canonname){
  90. strncpy(ahostbuf, res0->ai_canonname, sizeof(ahostbuf));
  91. ahostbuf[sizeof(ahostbuf)-1] = '\0';
  92. *ahost = ahostbuf;
  93. }
  94. else{
  95. *ahost = NULL;
  96. __set_errno (ENOENT);
  97. return -1;
  98. }
  99. ruserpass(res0->ai_canonname, &name, &pass);
  100. retry:
  101. s = socket(res0->ai_family, res0->ai_socktype, 0);
  102. if (s < 0) {
  103. perror("rexec: socket");
  104. return (-1);
  105. }
  106. if (connect(s, res0->ai_addr, res0->ai_addrlen) < 0) {
  107. if (errno == ECONNREFUSED && timo <= 16) {
  108. (void) close(s);
  109. sleep(timo);
  110. timo *= 2;
  111. goto retry;
  112. }
  113. perror(res0->ai_canonname);
  114. return (-1);
  115. }
  116. if (fd2p == 0) {
  117. (void) write(s, "", 1);
  118. port = 0;
  119. } else {
  120. char num[32];
  121. int s2;
  122. socklen_t sa2len;
  123. s2 = socket(res0->ai_family, res0->ai_socktype, 0);
  124. if (s2 < 0) {
  125. (void) close(s);
  126. return (-1);
  127. }
  128. listen(s2, 1);
  129. sa2len = sizeof (sa2);
  130. if (getsockname(s2, (struct sockaddr *)&sa2, &sa2len) < 0) {
  131. perror("getsockname");
  132. (void) close(s2);
  133. goto bad;
  134. } else if (sa2len != SA_LEN((struct sockaddr *)&sa2)) {
  135. __set_errno(EINVAL);
  136. (void) close(s2);
  137. goto bad;
  138. }
  139. port = 0;
  140. if (!getnameinfo((struct sockaddr *)&sa2, sa2len,
  141. NULL, 0, servbuff, sizeof(servbuff),
  142. NI_NUMERICSERV))
  143. port = atoi(servbuff);
  144. (void) sprintf(num, "%u", port);
  145. (void) write(s, num, strlen(num)+1);
  146. { socklen_t len = sizeof (from);
  147. s3 = TEMP_FAILURE_RETRY (accept(s2, (struct sockaddr *)&from,
  148. &len));
  149. close(s2);
  150. if (s3 < 0) {
  151. perror("accept");
  152. port = 0;
  153. goto bad;
  154. }
  155. }
  156. *fd2p = s3;
  157. }
  158. (void) write(s, name, strlen(name) + 1);
  159. /* should public key encypt the password here */
  160. (void) write(s, pass, strlen(pass) + 1);
  161. (void) write(s, cmd, strlen(cmd) + 1);
  162. /* We don't need the memory allocated for the name and the password
  163. in ruserpass anymore. */
  164. if (name != orig_name)
  165. free ((char *) name);
  166. if (pass != orig_pass)
  167. free ((char *) pass);
  168. if (read(s, &c, 1) != 1) {
  169. perror(*ahost);
  170. goto bad;
  171. }
  172. if (c != 0) {
  173. while (read(s, &c, 1) == 1) {
  174. (void) write(2, &c, 1);
  175. if (c == '\n')
  176. break;
  177. }
  178. goto bad;
  179. }
  180. freeaddrinfo(res0);
  181. return (s);
  182. bad:
  183. if (port)
  184. (void) close(*fd2p);
  185. (void) close(s);
  186. freeaddrinfo(res0);
  187. return (-1);
  188. }
  189. libc_hidden_def(rexec_af)
  190. int
  191. rexec(ahost, rport, name, pass, cmd, fd2p)
  192. char **ahost;
  193. int rport;
  194. const char *name, *pass, *cmd;
  195. int *fd2p;
  196. {
  197. return rexec_af(ahost, rport, name, pass, cmd, fd2p, AF_INET);
  198. }