2003-06-14 02:43:22 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2000-2003 Damien Miller. All rights reserved.
|
|
|
|
* Copyright (C) 1999 WIDE Project. 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.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT 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.
|
|
|
|
*/
|
|
|
|
|
2000-01-14 07:45:46 +03:00
|
|
|
/*
|
2003-06-05 12:52:47 +04:00
|
|
|
* Pseudo-implementation of RFC2553 name / address resolution functions
|
2000-01-14 07:45:46 +03:00
|
|
|
*
|
|
|
|
* But these functions are not implemented correctly. The minimum subset
|
2003-06-11 17:56:41 +04:00
|
|
|
* is implemented for ssh use only. For example, this routine assumes
|
2000-01-14 07:45:46 +03:00
|
|
|
* that ai_family is AF_INET. Don't use it for another purpose.
|
|
|
|
*/
|
|
|
|
|
2003-06-05 13:37:30 +04:00
|
|
|
#include "includes.h"
|
|
|
|
|
2003-06-05 12:52:47 +04:00
|
|
|
#ifndef HAVE_GETNAMEINFO
|
|
|
|
int getnameinfo(const struct sockaddr *sa, size_t salen, char *host,
|
|
|
|
size_t hostlen, char *serv, size_t servlen, int flags)
|
|
|
|
{
|
|
|
|
struct sockaddr_in *sin = (struct sockaddr_in *)sa;
|
|
|
|
struct hostent *hp;
|
|
|
|
char tmpserv[16];
|
|
|
|
|
|
|
|
if (serv != NULL) {
|
|
|
|
snprintf(tmpserv, sizeof(tmpserv), "%d", ntohs(sin->sin_port));
|
|
|
|
if (strlcpy(serv, tmpserv, servlen) >= servlen)
|
|
|
|
return (EAI_MEMORY);
|
|
|
|
}
|
2000-01-14 07:45:46 +03:00
|
|
|
|
2003-06-05 12:52:47 +04:00
|
|
|
if (host != NULL) {
|
|
|
|
if (flags & NI_NUMERICHOST) {
|
|
|
|
if (strlcpy(host, inet_ntoa(sin->sin_addr),
|
|
|
|
hostlen) >= hostlen)
|
|
|
|
return (EAI_MEMORY);
|
|
|
|
else
|
|
|
|
return (0);
|
|
|
|
} else {
|
|
|
|
hp = gethostbyaddr((char *)&sin->sin_addr,
|
|
|
|
sizeof(struct in_addr), AF_INET);
|
|
|
|
if (hp == NULL)
|
|
|
|
return (EAI_NODATA);
|
|
|
|
|
|
|
|
if (strlcpy(host, hp->h_name, hostlen) >= hostlen)
|
|
|
|
return (EAI_MEMORY);
|
|
|
|
else
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
#endif /* !HAVE_GETNAMEINFO */
|
2001-02-09 04:55:35 +03:00
|
|
|
|
2000-01-14 07:45:46 +03:00
|
|
|
#ifndef HAVE_GAI_STRERROR
|
2003-09-22 06:08:23 +04:00
|
|
|
#ifdef HAVE_CONST_GAI_STRERROR_PROTO
|
|
|
|
const char *
|
|
|
|
#else
|
2003-05-18 18:13:38 +04:00
|
|
|
char *
|
2003-09-22 06:08:23 +04:00
|
|
|
#endif
|
2003-05-18 18:13:38 +04:00
|
|
|
gai_strerror(int err)
|
2000-01-14 07:45:46 +03:00
|
|
|
{
|
2003-05-18 18:13:38 +04:00
|
|
|
switch (err) {
|
|
|
|
case EAI_NODATA:
|
|
|
|
return ("no address associated with name");
|
|
|
|
case EAI_MEMORY:
|
|
|
|
return ("memory allocation failure.");
|
2003-06-05 03:48:32 +04:00
|
|
|
case EAI_NONAME:
|
|
|
|
return ("nodename nor servname provided, or not known");
|
2003-05-18 18:13:38 +04:00
|
|
|
default:
|
|
|
|
return ("unknown/invalid error.");
|
2000-05-31 05:20:11 +04:00
|
|
|
}
|
2000-01-14 07:45:46 +03:00
|
|
|
}
|
|
|
|
#endif /* !HAVE_GAI_STRERROR */
|
|
|
|
|
|
|
|
#ifndef HAVE_FREEADDRINFO
|
2003-05-18 18:13:38 +04:00
|
|
|
void
|
|
|
|
freeaddrinfo(struct addrinfo *ai)
|
2000-01-14 07:45:46 +03:00
|
|
|
{
|
2000-05-31 05:20:11 +04:00
|
|
|
struct addrinfo *next;
|
|
|
|
|
2003-05-19 04:39:37 +04:00
|
|
|
for(; ai != NULL;) {
|
|
|
|
next = ai->ai_next;
|
2000-05-31 05:20:11 +04:00
|
|
|
free(ai);
|
2003-05-18 18:13:38 +04:00
|
|
|
ai = next;
|
|
|
|
}
|
2000-01-14 07:45:46 +03:00
|
|
|
}
|
|
|
|
#endif /* !HAVE_FREEADDRINFO */
|
|
|
|
|
|
|
|
#ifndef HAVE_GETADDRINFO
|
2003-05-18 18:13:38 +04:00
|
|
|
static struct
|
|
|
|
addrinfo *malloc_ai(int port, u_long addr, const struct addrinfo *hints)
|
2000-01-14 07:45:46 +03:00
|
|
|
{
|
2000-05-31 05:20:11 +04:00
|
|
|
struct addrinfo *ai;
|
|
|
|
|
2003-06-05 04:04:12 +04:00
|
|
|
ai = malloc(sizeof(*ai) + sizeof(struct sockaddr_in));
|
|
|
|
if (ai == NULL)
|
|
|
|
return (NULL);
|
2000-05-31 05:20:11 +04:00
|
|
|
|
2003-05-18 18:13:38 +04:00
|
|
|
memset(ai, '\0', sizeof(*ai) + sizeof(struct sockaddr_in));
|
2000-05-31 05:20:11 +04:00
|
|
|
|
|
|
|
ai->ai_addr = (struct sockaddr *)(ai + 1);
|
|
|
|
/* XXX -- ssh doesn't use sa_len */
|
|
|
|
ai->ai_addrlen = sizeof(struct sockaddr_in);
|
|
|
|
ai->ai_addr->sa_family = ai->ai_family = AF_INET;
|
2000-01-14 07:45:46 +03:00
|
|
|
|
2000-05-31 05:20:11 +04:00
|
|
|
((struct sockaddr_in *)(ai)->ai_addr)->sin_port = port;
|
|
|
|
((struct sockaddr_in *)(ai)->ai_addr)->sin_addr.s_addr = addr;
|
|
|
|
|
2003-05-14 15:48:51 +04:00
|
|
|
/* XXX: the following is not generally correct, but does what we want */
|
|
|
|
if (hints->ai_socktype)
|
|
|
|
ai->ai_socktype = hints->ai_socktype;
|
|
|
|
else
|
|
|
|
ai->ai_socktype = SOCK_STREAM;
|
|
|
|
|
|
|
|
if (hints->ai_protocol)
|
|
|
|
ai->ai_protocol = hints->ai_protocol;
|
|
|
|
|
2003-05-18 18:13:38 +04:00
|
|
|
return (ai);
|
2000-01-14 07:45:46 +03:00
|
|
|
}
|
|
|
|
|
2003-05-18 18:13:38 +04:00
|
|
|
int
|
|
|
|
getaddrinfo(const char *hostname, const char *servname,
|
|
|
|
const struct addrinfo *hints, struct addrinfo **res)
|
2000-01-14 07:45:46 +03:00
|
|
|
{
|
2000-05-31 05:20:11 +04:00
|
|
|
struct hostent *hp;
|
2003-02-06 02:50:42 +03:00
|
|
|
struct servent *sp;
|
2000-07-08 05:50:37 +04:00
|
|
|
struct in_addr in;
|
2003-02-06 02:50:42 +03:00
|
|
|
int i;
|
|
|
|
long int port;
|
2003-03-24 05:35:58 +03:00
|
|
|
u_long addr;
|
2000-05-31 05:20:11 +04:00
|
|
|
|
2003-02-06 02:50:42 +03:00
|
|
|
port = 0;
|
|
|
|
if (servname != NULL) {
|
|
|
|
char *cp;
|
|
|
|
|
|
|
|
port = strtol(servname, &cp, 10);
|
|
|
|
if (port > 0 && port <= 65535 && *cp == '\0')
|
|
|
|
port = htons(port);
|
|
|
|
else if ((sp = getservbyname(servname, NULL)) != NULL)
|
|
|
|
port = sp->s_port;
|
|
|
|
else
|
|
|
|
port = 0;
|
|
|
|
}
|
2000-05-31 05:20:11 +04:00
|
|
|
|
|
|
|
if (hints && hints->ai_flags & AI_PASSIVE) {
|
2003-03-24 05:35:58 +03:00
|
|
|
addr = htonl(0x00000000);
|
|
|
|
if (hostname && inet_aton(hostname, &in) != 0)
|
|
|
|
addr = in.s_addr;
|
2003-05-18 18:13:38 +04:00
|
|
|
*res = malloc_ai(port, addr, hints);
|
2003-06-05 04:04:12 +04:00
|
|
|
if (*res == NULL)
|
|
|
|
return (EAI_MEMORY);
|
2003-05-18 18:13:38 +04:00
|
|
|
return (0);
|
2000-05-31 05:20:11 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (!hostname) {
|
2003-05-18 18:13:38 +04:00
|
|
|
*res = malloc_ai(port, htonl(0x7f000001), hints);
|
2003-06-05 04:04:12 +04:00
|
|
|
if (*res == NULL)
|
|
|
|
return (EAI_MEMORY);
|
2003-05-18 18:13:38 +04:00
|
|
|
return (0);
|
2000-05-31 05:20:11 +04:00
|
|
|
}
|
|
|
|
|
2000-07-11 06:15:54 +04:00
|
|
|
if (inet_aton(hostname, &in)) {
|
2003-05-18 18:13:38 +04:00
|
|
|
*res = malloc_ai(port, in.s_addr, hints);
|
2003-06-05 04:04:12 +04:00
|
|
|
if (*res == NULL)
|
|
|
|
return (EAI_MEMORY);
|
2003-05-18 18:13:38 +04:00
|
|
|
return (0);
|
2000-05-31 05:20:11 +04:00
|
|
|
}
|
|
|
|
|
2003-06-05 03:48:32 +04:00
|
|
|
/* Don't try DNS if AI_NUMERICHOST is set */
|
|
|
|
if (hints && hints->ai_flags & AI_NUMERICHOST)
|
|
|
|
return (EAI_NONAME);
|
|
|
|
|
2000-05-31 05:20:11 +04:00
|
|
|
hp = gethostbyname(hostname);
|
|
|
|
if (hp && hp->h_name && hp->h_name[0] && hp->h_addr_list[0]) {
|
2003-05-18 18:13:38 +04:00
|
|
|
struct addrinfo *cur, *prev;
|
|
|
|
|
2003-06-05 04:04:12 +04:00
|
|
|
cur = prev = *res = NULL;
|
2000-05-31 05:20:11 +04:00
|
|
|
for (i = 0; hp->h_addr_list[i]; i++) {
|
2003-05-18 18:13:38 +04:00
|
|
|
struct in_addr *in = (struct in_addr *)hp->h_addr_list[i];
|
|
|
|
|
|
|
|
cur = malloc_ai(port, in->s_addr, hints);
|
2003-06-05 04:04:12 +04:00
|
|
|
if (cur == NULL) {
|
|
|
|
if (*res != NULL)
|
|
|
|
freeaddrinfo(*res);
|
|
|
|
return (EAI_MEMORY);
|
|
|
|
}
|
2000-05-31 05:20:11 +04:00
|
|
|
if (prev)
|
|
|
|
prev->ai_next = cur;
|
|
|
|
else
|
|
|
|
*res = cur;
|
|
|
|
|
|
|
|
prev = cur;
|
|
|
|
}
|
2003-05-18 18:13:38 +04:00
|
|
|
return (0);
|
2000-05-31 05:20:11 +04:00
|
|
|
}
|
|
|
|
|
2003-05-18 18:13:38 +04:00
|
|
|
return (EAI_NODATA);
|
2000-01-14 07:45:46 +03:00
|
|
|
}
|
|
|
|
#endif /* !HAVE_GETADDRINFO */
|