2001-11-30 05:50:29 -05:00
|
|
|
|
/* Host name resolution and matching.
|
2009-09-04 03:13:47 -04:00
|
|
|
|
Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004,
|
2011-01-01 07:19:37 -05:00
|
|
|
|
2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software Foundation,
|
|
|
|
|
Inc.
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-05-27 15:35:15 -04:00
|
|
|
|
This file is part of GNU Wget.
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-05-27 15:35:15 -04:00
|
|
|
|
GNU Wget is free software; you can redistribute it and/or modify
|
1999-12-02 02:42:23 -05:00
|
|
|
|
it under the terms of the GNU General Public License as published by
|
2007-07-10 01:53:22 -04:00
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
2003-10-30 19:18:08 -05:00
|
|
|
|
(at your option) any later version.
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-05-27 15:35:15 -04:00
|
|
|
|
GNU Wget is distributed in the hope that it will be useful,
|
1999-12-02 02:42:23 -05:00
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
2007-07-10 01:53:22 -04:00
|
|
|
|
along with Wget. If not, see <http://www.gnu.org/licenses/>.
|
2002-05-17 22:16:36 -04:00
|
|
|
|
|
2007-11-28 03:05:33 -05:00
|
|
|
|
Additional permission under GNU GPL version 3 section 7
|
|
|
|
|
|
|
|
|
|
If you modify this program, or any covered work, by linking or
|
|
|
|
|
combining it with the OpenSSL project's OpenSSL library (or a
|
|
|
|
|
modified version of that library), containing parts covered by the
|
|
|
|
|
terms of the OpenSSL or SSLeay licenses, the Free Software Foundation
|
|
|
|
|
grants you additional permission to convey the resulting work.
|
|
|
|
|
Corresponding Source for a non-source form of such a combination
|
|
|
|
|
shall include the source code for the parts of OpenSSL used as well
|
|
|
|
|
as that of the covered work. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2007-10-18 23:50:40 -04:00
|
|
|
|
#include "wget.h"
|
2002-01-30 21:23:04 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
2005-06-19 18:34:58 -04:00
|
|
|
|
#include <string.h>
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
2005-03-20 05:41:46 -05:00
|
|
|
|
#ifndef WINDOWS
|
2009-06-12 18:37:10 -04:00
|
|
|
|
# include <sys/types.h>
|
1999-12-02 02:42:23 -05:00
|
|
|
|
# include <sys/socket.h>
|
|
|
|
|
# include <netinet/in.h>
|
2001-11-30 03:36:22 -05:00
|
|
|
|
# ifndef __BEOS__
|
|
|
|
|
# include <arpa/inet.h>
|
|
|
|
|
# endif
|
2008-04-22 17:48:36 -04:00
|
|
|
|
# ifdef __VMS
|
|
|
|
|
# include "vms_ip.h"
|
|
|
|
|
# else /* def __VMS */
|
|
|
|
|
# include <netdb.h>
|
|
|
|
|
# endif /* def __VMS [else] */
|
2002-04-15 15:01:56 -04:00
|
|
|
|
# define SET_H_ERRNO(err) ((void)(h_errno = (err)))
|
2005-03-20 05:41:46 -05:00
|
|
|
|
#else /* WINDOWS */
|
2011-04-04 06:52:35 -04:00
|
|
|
|
# include <winsock2.h>
|
|
|
|
|
# include <ws2tcpip.h>
|
2005-03-20 05:41:46 -05:00
|
|
|
|
# define SET_H_ERRNO(err) WSASetLastError (err)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#endif /* WINDOWS */
|
|
|
|
|
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
|
|
#include "utils.h"
|
|
|
|
|
#include "host.h"
|
|
|
|
|
#include "url.h"
|
2000-11-19 15:50:10 -05:00
|
|
|
|
#include "hash.h"
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2005-04-07 16:43:26 -04:00
|
|
|
|
#ifndef NO_ADDRESS
|
|
|
|
|
# define NO_ADDRESS NO_DATA
|
|
|
|
|
#endif
|
|
|
|
|
|
2009-09-22 21:43:02 -04:00
|
|
|
|
#if !HAVE_DECL_H_ERRNO && !defined(WINDOWS)
|
2009-06-12 04:32:44 -04:00
|
|
|
|
extern int h_errno;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
2003-11-12 20:37:46 -05:00
|
|
|
|
/* Lists of IP addresses that result from running DNS queries. See
|
|
|
|
|
lookup_host for details. */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
struct address_list {
|
2007-08-02 23:38:21 -04:00
|
|
|
|
int count; /* number of adrresses */
|
|
|
|
|
ip_address *addresses; /* pointer to the string of addresses */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2007-08-02 23:38:21 -04:00
|
|
|
|
int faulty; /* number of addresses known not to work. */
|
|
|
|
|
bool connected; /* whether we were able to connect to
|
|
|
|
|
one of the addresses in the list,
|
|
|
|
|
at least once. */
|
2003-10-30 19:18:08 -05:00
|
|
|
|
|
2007-08-02 23:38:21 -04:00
|
|
|
|
int refcount; /* reference count; when it drops to
|
|
|
|
|
0, the entry is freed. */
|
2001-11-26 00:36:33 -05:00
|
|
|
|
};
|
|
|
|
|
|
2001-11-27 09:55:40 -05:00
|
|
|
|
/* Get the bounds of the address list. */
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2001-11-27 09:55:40 -05:00
|
|
|
|
void
|
2003-10-29 13:23:56 -05:00
|
|
|
|
address_list_get_bounds (const struct address_list *al, int *start, int *end)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-27 09:55:40 -05:00
|
|
|
|
*start = al->faulty;
|
|
|
|
|
*end = al->count;
|
2001-11-26 00:36:33 -05:00
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2003-10-30 19:18:08 -05:00
|
|
|
|
/* Return a pointer to the address at position POS. */
|
|
|
|
|
|
|
|
|
|
const ip_address *
|
|
|
|
|
address_list_address_at (const struct address_list *al, int pos)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-10-30 19:18:08 -05:00
|
|
|
|
assert (pos >= al->faulty && pos < al->count);
|
|
|
|
|
return al->addresses + pos;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
/* Return true if AL contains IP, false otherwise. */
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool
|
2003-11-18 17:18:44 -05:00
|
|
|
|
address_list_contains (const struct address_list *al, const ip_address *ip)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
int i;
|
2005-08-10 09:50:08 -04:00
|
|
|
|
switch (ip->family)
|
2003-10-29 13:23:56 -05:00
|
|
|
|
{
|
2005-08-10 09:50:08 -04:00
|
|
|
|
case AF_INET:
|
2003-11-07 21:57:51 -05:00
|
|
|
|
for (i = 0; i < al->count; i++)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
ip_address *cur = al->addresses + i;
|
|
|
|
|
if (cur->family == AF_INET
|
|
|
|
|
&& (cur->data.d4.s_addr == ip->data.d4.s_addr))
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2003-11-07 21:57:51 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2005-08-10 09:50:08 -04:00
|
|
|
|
case AF_INET6:
|
2003-11-07 21:57:51 -05:00
|
|
|
|
for (i = 0; i < al->count; i++)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
ip_address *cur = al->addresses + i;
|
|
|
|
|
if (cur->family == AF_INET6
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef HAVE_SOCKADDR_IN6_SCOPE_ID
|
2007-08-02 23:38:21 -04:00
|
|
|
|
&& cur->ipv6_scope == ip->ipv6_scope
|
2003-11-07 21:57:51 -05:00
|
|
|
|
#endif
|
2007-08-02 23:38:21 -04:00
|
|
|
|
&& IN6_ARE_ADDR_EQUAL (&cur->data.d6, &ip->data.d6))
|
|
|
|
|
return true;
|
|
|
|
|
}
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
#endif /* ENABLE_IPV6 */
|
2003-11-07 21:57:51 -05:00
|
|
|
|
default:
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
2001-11-26 00:36:33 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-27 09:55:40 -05:00
|
|
|
|
/* Mark the INDEXth element of AL as faulty, so that the next time
|
|
|
|
|
this address list is used, the faulty element will be skipped. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
address_list_set_faulty (struct address_list *al, int index)
|
|
|
|
|
{
|
2001-12-09 21:33:08 -05:00
|
|
|
|
/* We assume that the address list is traversed in order, so that a
|
|
|
|
|
"faulty" attempt is always preceded with all-faulty addresses,
|
|
|
|
|
and this is how Wget uses it. */
|
2001-12-08 20:24:41 -05:00
|
|
|
|
assert (index == al->faulty);
|
|
|
|
|
|
2001-11-27 09:55:40 -05:00
|
|
|
|
++al->faulty;
|
|
|
|
|
if (al->faulty >= al->count)
|
|
|
|
|
/* All addresses have been proven faulty. Since there's not much
|
|
|
|
|
sense in returning the user an empty address list the next
|
|
|
|
|
time, we'll rather make them all clean, so that they can be
|
|
|
|
|
retried anew. */
|
|
|
|
|
al->faulty = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2003-11-10 08:20:46 -05:00
|
|
|
|
/* Set the "connected" flag to true. This flag used by connect.c to
|
|
|
|
|
see if the host perhaps needs to be resolved again. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
address_list_set_connected (struct address_list *al)
|
|
|
|
|
{
|
2005-06-22 15:38:10 -04:00
|
|
|
|
al->connected = true;
|
2003-11-10 08:20:46 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the value of the "connected" flag. */
|
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool
|
2003-11-10 08:20:46 -05:00
|
|
|
|
address_list_connected_p (const struct address_list *al)
|
|
|
|
|
{
|
|
|
|
|
return al->connected;
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-11-10 19:26:14 -05:00
|
|
|
|
|
|
|
|
|
/* Create an address_list from the addresses in the given struct
|
|
|
|
|
addrinfo. */
|
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
static struct address_list *
|
2003-10-29 13:23:56 -05:00
|
|
|
|
address_list_from_addrinfo (const struct addrinfo *ai)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
|
|
|
|
struct address_list *al;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
const struct addrinfo *ptr;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
int cnt;
|
|
|
|
|
ip_address *ip;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-10-29 18:13:25 -05:00
|
|
|
|
cnt = 0;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
for (ptr = ai; ptr != NULL ; ptr = ptr->ai_next)
|
|
|
|
|
if (ptr->ai_family == AF_INET || ptr->ai_family == AF_INET6)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
++cnt;
|
|
|
|
|
if (cnt == 0)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2003-10-31 09:55:50 -05:00
|
|
|
|
al = xnew0 (struct address_list);
|
2003-11-29 17:19:26 -05:00
|
|
|
|
al->addresses = xnew_array (ip_address, cnt);
|
|
|
|
|
al->count = cnt;
|
|
|
|
|
al->refcount = 1;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-10-29 18:13:25 -05:00
|
|
|
|
ip = al->addresses;
|
|
|
|
|
for (ptr = ai; ptr != NULL; ptr = ptr->ai_next)
|
2009-09-21 23:39:44 -04:00
|
|
|
|
if (ptr->ai_family == AF_INET6)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
const struct sockaddr_in6 *sin6 =
|
|
|
|
|
(const struct sockaddr_in6 *)ptr->ai_addr;
|
|
|
|
|
ip->family = AF_INET6;
|
|
|
|
|
ip->data.d6 = sin6->sin6_addr;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef HAVE_SOCKADDR_IN6_SCOPE_ID
|
2007-08-02 23:38:21 -04:00
|
|
|
|
ip->ipv6_scope = sin6->sin6_scope_id;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
2007-08-02 23:38:21 -04:00
|
|
|
|
++ip;
|
2009-09-21 23:39:44 -04:00
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
else if (ptr->ai_family == AF_INET)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
const struct sockaddr_in *sin =
|
|
|
|
|
(const struct sockaddr_in *)ptr->ai_addr;
|
|
|
|
|
ip->family = AF_INET;
|
|
|
|
|
ip->data.d4 = sin->sin_addr;
|
|
|
|
|
++ip;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
}
|
2003-10-29 18:13:25 -05:00
|
|
|
|
assert (ip - al->addresses == cnt);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
return al;
|
|
|
|
|
}
|
2003-11-10 19:26:14 -05:00
|
|
|
|
|
2005-08-10 09:50:08 -04:00
|
|
|
|
#define IS_IPV4(addr) (((const ip_address *) addr)->family == AF_INET)
|
2005-04-24 16:00:19 -04:00
|
|
|
|
|
2005-08-10 09:50:08 -04:00
|
|
|
|
/* Compare two IP addresses by family, giving preference to the IPv4
|
2005-04-24 16:00:19 -04:00
|
|
|
|
address (sorting it first). In other words, return -1 if ADDR1 is
|
|
|
|
|
IPv4 and ADDR2 is IPv6, +1 if ADDR1 is IPv6 and ADDR2 is IPv4, and
|
|
|
|
|
0 otherwise.
|
|
|
|
|
|
|
|
|
|
This is intended to be used as the comparator arg to a qsort-like
|
|
|
|
|
sorting function, which is why it accepts generic pointers. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
cmp_prefer_ipv4 (const void *addr1, const void *addr2)
|
|
|
|
|
{
|
|
|
|
|
return !IS_IPV4 (addr1) - !IS_IPV4 (addr2);
|
|
|
|
|
}
|
|
|
|
|
|
2005-08-10 09:50:08 -04:00
|
|
|
|
#define IS_IPV6(addr) (((const ip_address *) addr)->family == AF_INET6)
|
2005-04-24 16:00:19 -04:00
|
|
|
|
|
|
|
|
|
/* Like the above, but give preference to the IPv6 address. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
cmp_prefer_ipv6 (const void *addr1, const void *addr2)
|
|
|
|
|
{
|
|
|
|
|
return !IS_IPV6 (addr1) - !IS_IPV6 (addr2);
|
|
|
|
|
}
|
|
|
|
|
|
2003-11-10 19:26:14 -05:00
|
|
|
|
#else /* not ENABLE_IPV6 */
|
|
|
|
|
|
2003-10-31 05:50:03 -05:00
|
|
|
|
/* Create an address_list from a NULL-terminated vector of IPv4
|
|
|
|
|
addresses. This kind of vector is returned by gethostbyname. */
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
static struct address_list *
|
2003-10-31 21:22:11 -05:00
|
|
|
|
address_list_from_ipv4_addresses (char **vec)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-10-29 18:13:25 -05:00
|
|
|
|
int count, i;
|
2003-10-31 09:55:50 -05:00
|
|
|
|
struct address_list *al = xnew0 (struct address_list);
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2003-10-29 18:13:25 -05:00
|
|
|
|
count = 0;
|
2003-10-31 21:22:11 -05:00
|
|
|
|
while (vec[count])
|
2001-11-26 00:36:33 -05:00
|
|
|
|
++count;
|
|
|
|
|
assert (count > 0);
|
2003-10-29 18:13:25 -05:00
|
|
|
|
|
2003-11-14 08:55:02 -05:00
|
|
|
|
al->addresses = xnew_array (ip_address, count);
|
|
|
|
|
al->count = count;
|
|
|
|
|
al->refcount = 1;
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2003-10-29 18:13:25 -05:00
|
|
|
|
for (i = 0; i < count; i++)
|
|
|
|
|
{
|
|
|
|
|
ip_address *ip = &al->addresses[i];
|
2005-08-10 09:50:08 -04:00
|
|
|
|
ip->family = AF_INET;
|
2005-08-23 16:40:37 -04:00
|
|
|
|
memcpy (IP_INADDR_DATA (ip), vec[i], 4);
|
2003-10-29 18:13:25 -05:00
|
|
|
|
}
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2003-11-10 19:26:14 -05:00
|
|
|
|
|
|
|
|
|
#endif /* not ENABLE_IPV6 */
|
2001-12-03 12:48:12 -05:00
|
|
|
|
|
2000-11-19 15:50:10 -05:00
|
|
|
|
static void
|
2001-11-26 00:36:33 -05:00
|
|
|
|
address_list_delete (struct address_list *al)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-12-11 03:32:58 -05:00
|
|
|
|
xfree (al->addresses);
|
2001-11-26 00:36:33 -05:00
|
|
|
|
xfree (al);
|
|
|
|
|
}
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2003-11-10 19:26:14 -05:00
|
|
|
|
/* Mark the address list as being no longer in use. This will reduce
|
|
|
|
|
its reference count which will cause the list to be freed when the
|
|
|
|
|
count reaches 0. */
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
void
|
|
|
|
|
address_list_release (struct address_list *al)
|
|
|
|
|
{
|
|
|
|
|
--al->refcount;
|
2005-05-14 15:36:30 -04:00
|
|
|
|
DEBUGP (("Releasing 0x%0*lx (new refcount %d).\n", PTR_FORMAT (al),
|
2007-08-02 23:38:21 -04:00
|
|
|
|
al->refcount));
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (al->refcount <= 0)
|
|
|
|
|
{
|
2005-05-14 15:36:30 -04:00
|
|
|
|
DEBUGP (("Deleting unused 0x%0*lx.\n", PTR_FORMAT (al)));
|
2001-11-26 00:36:33 -05:00
|
|
|
|
address_list_delete (al);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2002-04-14 22:21:38 -04:00
|
|
|
|
/* Versions of gethostbyname and getaddrinfo that support timeout. */
|
|
|
|
|
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#ifndef ENABLE_IPV6
|
2002-04-14 22:21:38 -04:00
|
|
|
|
|
|
|
|
|
struct ghbnwt_context {
|
|
|
|
|
const char *host_name;
|
|
|
|
|
struct hostent *hptr;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
gethostbyname_with_timeout_callback (void *arg)
|
|
|
|
|
{
|
|
|
|
|
struct ghbnwt_context *ctx = (struct ghbnwt_context *)arg;
|
|
|
|
|
ctx->hptr = gethostbyname (ctx->host_name);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Just like gethostbyname, except it times out after TIMEOUT seconds.
|
|
|
|
|
In case of timeout, NULL is returned and errno is set to ETIMEDOUT.
|
|
|
|
|
The function makes sure that when NULL is returned for reasons
|
|
|
|
|
other than timeout, errno is reset. */
|
|
|
|
|
|
|
|
|
|
static struct hostent *
|
2003-09-20 19:12:18 -04:00
|
|
|
|
gethostbyname_with_timeout (const char *host_name, double timeout)
|
2002-04-14 22:21:38 -04:00
|
|
|
|
{
|
|
|
|
|
struct ghbnwt_context ctx;
|
|
|
|
|
ctx.host_name = host_name;
|
|
|
|
|
if (run_with_timeout (timeout, gethostbyname_with_timeout_callback, &ctx))
|
|
|
|
|
{
|
2002-04-15 15:01:56 -04:00
|
|
|
|
SET_H_ERRNO (HOST_NOT_FOUND);
|
2002-04-14 22:21:38 -04:00
|
|
|
|
errno = ETIMEDOUT;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
if (!ctx.hptr)
|
|
|
|
|
errno = 0;
|
|
|
|
|
return ctx.hptr;
|
|
|
|
|
}
|
|
|
|
|
|
2003-11-09 20:38:09 -05:00
|
|
|
|
/* Print error messages for host errors. */
|
2009-09-24 14:50:07 -04:00
|
|
|
|
static const char *
|
2003-11-09 20:38:09 -05:00
|
|
|
|
host_errstr (int error)
|
|
|
|
|
{
|
|
|
|
|
/* Can't use switch since some of these constants can be equal,
|
|
|
|
|
which makes the compiler complain about duplicate case
|
|
|
|
|
values. */
|
|
|
|
|
if (error == HOST_NOT_FOUND
|
|
|
|
|
|| error == NO_RECOVERY
|
|
|
|
|
|| error == NO_DATA
|
|
|
|
|
|| error == NO_ADDRESS)
|
2003-11-10 22:19:33 -05:00
|
|
|
|
return _("Unknown host");
|
2003-11-09 20:38:09 -05:00
|
|
|
|
else if (error == TRY_AGAIN)
|
|
|
|
|
/* Message modeled after what gai_strerror returns in similar
|
|
|
|
|
circumstances. */
|
|
|
|
|
return _("Temporary failure in name resolution");
|
|
|
|
|
else
|
|
|
|
|
return _("Unknown error");
|
|
|
|
|
}
|
|
|
|
|
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#else /* ENABLE_IPV6 */
|
2002-04-14 22:21:38 -04:00
|
|
|
|
|
|
|
|
|
struct gaiwt_context {
|
|
|
|
|
const char *node;
|
|
|
|
|
const char *service;
|
|
|
|
|
const struct addrinfo *hints;
|
|
|
|
|
struct addrinfo **res;
|
|
|
|
|
int exit_code;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
getaddrinfo_with_timeout_callback (void *arg)
|
|
|
|
|
{
|
|
|
|
|
struct gaiwt_context *ctx = (struct gaiwt_context *)arg;
|
|
|
|
|
ctx->exit_code = getaddrinfo (ctx->node, ctx->service, ctx->hints, ctx->res);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Just like getaddrinfo, except it times out after TIMEOUT seconds.
|
|
|
|
|
In case of timeout, the EAI_SYSTEM error code is returned and errno
|
|
|
|
|
is set to ETIMEDOUT. */
|
|
|
|
|
|
|
|
|
|
static int
|
|
|
|
|
getaddrinfo_with_timeout (const char *node, const char *service,
|
2007-08-02 23:38:21 -04:00
|
|
|
|
const struct addrinfo *hints, struct addrinfo **res,
|
|
|
|
|
double timeout)
|
2002-04-14 22:21:38 -04:00
|
|
|
|
{
|
|
|
|
|
struct gaiwt_context ctx;
|
|
|
|
|
ctx.node = node;
|
|
|
|
|
ctx.service = service;
|
|
|
|
|
ctx.hints = hints;
|
|
|
|
|
ctx.res = res;
|
|
|
|
|
|
|
|
|
|
if (run_with_timeout (timeout, getaddrinfo_with_timeout_callback, &ctx))
|
|
|
|
|
{
|
|
|
|
|
errno = ETIMEDOUT;
|
|
|
|
|
return EAI_SYSTEM;
|
|
|
|
|
}
|
|
|
|
|
return ctx.exit_code;
|
|
|
|
|
}
|
|
|
|
|
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#endif /* ENABLE_IPV6 */
|
2002-04-14 22:21:38 -04:00
|
|
|
|
|
2005-06-30 16:03:18 -04:00
|
|
|
|
/* Return a textual representation of ADDR, i.e. the dotted quad for
|
|
|
|
|
IPv4 addresses, and the colon-separated list of hex words (with all
|
|
|
|
|
zeros omitted, etc.) for IPv6 addresses. */
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
const char *
|
2005-06-30 16:03:18 -04:00
|
|
|
|
print_address (const ip_address *addr)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2005-08-10 09:50:08 -04:00
|
|
|
|
static char buf[64];
|
|
|
|
|
if (!inet_ntop (addr->family, IP_INADDR_DATA (addr), buf, sizeof buf))
|
|
|
|
|
snprintf (buf, sizeof buf, "<error: %s>", strerror (errno));
|
|
|
|
|
return buf;
|
|
|
|
|
#else
|
|
|
|
|
return inet_ntoa (addr->data.d4);
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
|
2005-08-10 09:50:08 -04:00
|
|
|
|
/* The following two functions were adapted from glibc's
|
|
|
|
|
implementation of inet_pton, written by Paul Vixie. */
|
2005-03-04 14:21:02 -05:00
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
static bool
|
2005-03-04 14:21:02 -05:00
|
|
|
|
is_valid_ipv4_address (const char *str, const char *end)
|
|
|
|
|
{
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool saw_digit = false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
int octets = 0;
|
|
|
|
|
int val = 0;
|
|
|
|
|
|
|
|
|
|
while (str < end)
|
|
|
|
|
{
|
|
|
|
|
int ch = *str++;
|
|
|
|
|
|
|
|
|
|
if (ch >= '0' && ch <= '9')
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
val = val * 10 + (ch - '0');
|
|
|
|
|
|
|
|
|
|
if (val > 255)
|
|
|
|
|
return false;
|
|
|
|
|
if (!saw_digit)
|
|
|
|
|
{
|
|
|
|
|
if (++octets > 4)
|
|
|
|
|
return false;
|
|
|
|
|
saw_digit = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
2005-06-22 15:38:10 -04:00
|
|
|
|
else if (ch == '.' && saw_digit)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
if (octets == 4)
|
|
|
|
|
return false;
|
|
|
|
|
val = 0;
|
|
|
|
|
saw_digit = false;
|
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
else
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
if (octets < 4)
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2009-09-21 23:39:44 -04:00
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return true;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool
|
2005-03-04 14:21:02 -05:00
|
|
|
|
is_valid_ipv6_address (const char *str, const char *end)
|
|
|
|
|
{
|
2005-04-24 16:00:19 -04:00
|
|
|
|
/* Use lower-case for these to avoid clash with system headers. */
|
2005-03-04 14:21:02 -05:00
|
|
|
|
enum {
|
2005-04-24 16:00:19 -04:00
|
|
|
|
ns_inaddrsz = 4,
|
|
|
|
|
ns_in6addrsz = 16,
|
|
|
|
|
ns_int16sz = 2
|
2005-03-04 14:21:02 -05:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const char *curtok;
|
|
|
|
|
int tp;
|
|
|
|
|
const char *colonp;
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool saw_xdigit;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
unsigned int val;
|
|
|
|
|
|
|
|
|
|
tp = 0;
|
|
|
|
|
colonp = NULL;
|
|
|
|
|
|
|
|
|
|
if (str == end)
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2009-09-21 23:39:44 -04:00
|
|
|
|
|
2005-03-04 14:21:02 -05:00
|
|
|
|
/* Leading :: requires some special handling. */
|
|
|
|
|
if (*str == ':')
|
|
|
|
|
{
|
|
|
|
|
++str;
|
|
|
|
|
if (str == end || *str != ':')
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
curtok = str;
|
2005-06-22 15:38:10 -04:00
|
|
|
|
saw_xdigit = false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
val = 0;
|
|
|
|
|
|
|
|
|
|
while (str < end)
|
|
|
|
|
{
|
|
|
|
|
int ch = *str++;
|
|
|
|
|
|
|
|
|
|
/* if ch is a number, add it to val. */
|
2007-10-14 17:46:24 -04:00
|
|
|
|
if (c_isxdigit (ch))
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
val <<= 4;
|
|
|
|
|
val |= XDIGIT_TO_NUM (ch);
|
|
|
|
|
if (val > 0xffff)
|
|
|
|
|
return false;
|
|
|
|
|
saw_xdigit = true;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
|
|
|
|
|
/* if ch is a colon ... */
|
|
|
|
|
if (ch == ':')
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
curtok = str;
|
|
|
|
|
if (!saw_xdigit)
|
|
|
|
|
{
|
|
|
|
|
if (colonp != NULL)
|
|
|
|
|
return false;
|
|
|
|
|
colonp = str + tp;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
else if (str == end)
|
|
|
|
|
return false;
|
|
|
|
|
if (tp > ns_in6addrsz - ns_int16sz)
|
|
|
|
|
return false;
|
|
|
|
|
tp += ns_int16sz;
|
|
|
|
|
saw_xdigit = false;
|
|
|
|
|
val = 0;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
|
|
|
|
|
/* if ch is a dot ... */
|
2005-04-24 16:00:19 -04:00
|
|
|
|
if (ch == '.' && (tp <= ns_in6addrsz - ns_inaddrsz)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
&& is_valid_ipv4_address (curtok, end) == 1)
|
|
|
|
|
{
|
|
|
|
|
tp += ns_inaddrsz;
|
|
|
|
|
saw_xdigit = false;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2009-09-21 23:39:44 -04:00
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
if (saw_xdigit)
|
2005-03-04 14:21:02 -05:00
|
|
|
|
{
|
2009-09-21 23:39:44 -04:00
|
|
|
|
if (tp > ns_in6addrsz - ns_int16sz)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
2005-04-24 16:00:19 -04:00
|
|
|
|
tp += ns_int16sz;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (colonp != NULL)
|
|
|
|
|
{
|
2009-09-21 23:39:44 -04:00
|
|
|
|
if (tp == ns_in6addrsz)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
2005-04-24 16:00:19 -04:00
|
|
|
|
tp = ns_in6addrsz;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
|
2005-04-24 16:00:19 -04:00
|
|
|
|
if (tp != ns_in6addrsz)
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return true;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
2003-11-14 20:49:52 -05:00
|
|
|
|
|
|
|
|
|
/* Simple host cache, used by lookup_host to speed up resolving. The
|
|
|
|
|
cache doesn't handle TTL because Wget is a fairly short-lived
|
|
|
|
|
application. Refreshing is attempted when connect fails, though --
|
|
|
|
|
see connect_to_host. */
|
|
|
|
|
|
|
|
|
|
/* Mapping between known hosts and to lists of their addresses. */
|
|
|
|
|
static struct hash_table *host_name_addresses_map;
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
/* Return the host's resolved addresses from the cache, if
|
|
|
|
|
available. */
|
|
|
|
|
|
|
|
|
|
static struct address_list *
|
|
|
|
|
cache_query (const char *host)
|
|
|
|
|
{
|
|
|
|
|
struct address_list *al;
|
|
|
|
|
if (!host_name_addresses_map)
|
|
|
|
|
return NULL;
|
|
|
|
|
al = hash_table_get (host_name_addresses_map, host);
|
|
|
|
|
if (al)
|
|
|
|
|
{
|
|
|
|
|
DEBUGP (("Found %s in host_name_addresses_map (%p)\n", host, al));
|
|
|
|
|
++al->refcount;
|
|
|
|
|
return al;
|
|
|
|
|
}
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Cache the DNS lookup of HOST. Subsequent invocations of
|
|
|
|
|
lookup_host will return the cached value. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
static void
|
2003-11-14 20:49:52 -05:00
|
|
|
|
cache_store (const char *host, struct address_list *al)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (!host_name_addresses_map)
|
|
|
|
|
host_name_addresses_map = make_nocase_string_hash_table (0);
|
|
|
|
|
|
|
|
|
|
++al->refcount;
|
|
|
|
|
hash_table_put (host_name_addresses_map, xstrdup_lower (host), al);
|
|
|
|
|
|
2005-06-21 21:26:22 -04:00
|
|
|
|
IF_DEBUG
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
debug_logprintf ("Caching %s =>", host);
|
|
|
|
|
for (i = 0; i < al->count; i++)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
debug_logprintf (" %s", print_address (al->addresses + i));
|
2001-11-26 00:36:33 -05:00
|
|
|
|
debug_logprintf ("\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
/* Remove HOST from the DNS cache. Does nothing is HOST is not in
|
2003-10-31 21:22:11 -05:00
|
|
|
|
the cache. */
|
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
static void
|
|
|
|
|
cache_remove (const char *host)
|
2003-10-30 19:18:08 -05:00
|
|
|
|
{
|
2003-11-14 20:49:52 -05:00
|
|
|
|
struct address_list *al;
|
|
|
|
|
if (!host_name_addresses_map)
|
|
|
|
|
return;
|
|
|
|
|
al = hash_table_get (host_name_addresses_map, host);
|
2003-10-30 19:18:08 -05:00
|
|
|
|
if (al)
|
|
|
|
|
{
|
|
|
|
|
address_list_release (al);
|
|
|
|
|
hash_table_remove (host_name_addresses_map, host);
|
|
|
|
|
}
|
|
|
|
|
}
|
2003-11-14 20:49:52 -05:00
|
|
|
|
|
2005-04-24 16:00:19 -04:00
|
|
|
|
/* Look up HOST in DNS and return a list of IP addresses.
|
2003-10-31 21:22:11 -05:00
|
|
|
|
|
|
|
|
|
This function caches its result so that, if the same host is passed
|
2003-11-14 21:10:56 -05:00
|
|
|
|
the second time, the addresses are returned without DNS lookup.
|
|
|
|
|
(Use LH_REFRESH to force lookup, or set opt.dns_cache to 0 to
|
|
|
|
|
globally disable caching.)
|
2003-10-31 21:22:11 -05:00
|
|
|
|
|
2005-04-24 16:00:19 -04:00
|
|
|
|
The order of the returned addresses is affected by the setting of
|
|
|
|
|
opt.prefer_family: if it is set to prefer_ipv4, IPv4 addresses are
|
|
|
|
|
placed at the beginning; if it is prefer_ipv6, IPv6 ones are placed
|
|
|
|
|
at the beginning; otherwise, the order is left intact. The
|
|
|
|
|
relative order of addresses with the same family is left
|
|
|
|
|
undisturbed in either case.
|
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
FLAGS can be a combination of:
|
|
|
|
|
LH_SILENT - don't print the "resolving ... done" messages.
|
|
|
|
|
LH_BIND - resolve addresses for use with bind, which under
|
|
|
|
|
IPv6 means to use AI_PASSIVE flag to getaddrinfo.
|
2007-08-02 23:38:21 -04:00
|
|
|
|
Passive lookups are not cached under IPv6.
|
2003-11-14 20:49:52 -05:00
|
|
|
|
LH_REFRESH - if HOST is cached, remove the entry from the cache
|
|
|
|
|
and resolve it anew. */
|
2003-10-31 21:22:11 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
struct address_list *
|
2003-11-14 20:49:52 -05:00
|
|
|
|
lookup_host (const char *host, int flags)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2005-02-26 22:00:59 -05:00
|
|
|
|
struct address_list *al;
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool silent = !!(flags & LH_SILENT);
|
|
|
|
|
bool use_cache;
|
|
|
|
|
bool numeric_address = false;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
double timeout = opt.dns_timeout;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-11-10 07:56:08 -05:00
|
|
|
|
#ifndef ENABLE_IPV6
|
2003-11-14 08:51:32 -05:00
|
|
|
|
/* If we're not using getaddrinfo, first check if HOST specifies a
|
2005-03-04 14:21:02 -05:00
|
|
|
|
numeric IPv4 address. Some implementations of gethostbyname
|
|
|
|
|
(e.g. the Ultrix one and possibly Winsock) don't accept
|
|
|
|
|
dotted-decimal IPv4 addresses. */
|
2003-10-29 13:23:56 -05:00
|
|
|
|
{
|
|
|
|
|
uint32_t addr_ipv4 = (uint32_t)inet_addr (host);
|
|
|
|
|
if (addr_ipv4 != (uint32_t) -1)
|
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
/* No need to cache host->addr relation, just return the
|
|
|
|
|
address. */
|
|
|
|
|
char *vec[2];
|
|
|
|
|
vec[0] = (char *)&addr_ipv4;
|
|
|
|
|
vec[1] = NULL;
|
|
|
|
|
return address_list_from_ipv4_addresses (vec);
|
2003-10-29 13:23:56 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
#else /* ENABLE_IPV6 */
|
|
|
|
|
/* If we're using getaddrinfo, at least check whether the address is
|
|
|
|
|
already numeric, in which case there is no need to print the
|
|
|
|
|
"Resolving..." output. (This comes at no additional cost since
|
|
|
|
|
the is_valid_ipv*_address are already required for
|
|
|
|
|
url_parse.) */
|
|
|
|
|
{
|
|
|
|
|
const char *end = host + strlen (host);
|
|
|
|
|
if (is_valid_ipv4_address (host, end) || is_valid_ipv6_address (host, end))
|
2005-06-22 15:38:10 -04:00
|
|
|
|
numeric_address = true;
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
/* Cache is normally on, but can be turned off with --no-dns-cache.
|
|
|
|
|
Don't cache passive lookups under IPv6. */
|
|
|
|
|
use_cache = opt.dns_cache;
|
|
|
|
|
#ifdef ENABLE_IPV6
|
2005-03-04 14:21:02 -05:00
|
|
|
|
if ((flags & LH_BIND) || numeric_address)
|
2005-06-22 15:38:10 -04:00
|
|
|
|
use_cache = false;
|
2003-11-14 20:49:52 -05:00
|
|
|
|
#endif
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
/* Try to find the host in the cache so we don't need to talk to the
|
|
|
|
|
resolver. If LH_REFRESH is requested, remove HOST from the cache
|
|
|
|
|
instead. */
|
|
|
|
|
if (use_cache)
|
2000-11-19 15:50:10 -05:00
|
|
|
|
{
|
2003-11-14 20:49:52 -05:00
|
|
|
|
if (!(flags & LH_REFRESH))
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
al = cache_query (host);
|
|
|
|
|
if (al)
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2003-11-14 20:49:52 -05:00
|
|
|
|
else
|
2007-08-02 23:38:21 -04:00
|
|
|
|
cache_remove (host);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
}
|
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
/* No luck with the cache; resolve HOST. */
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2005-03-04 14:21:02 -05:00
|
|
|
|
if (!silent && !numeric_address)
|
2008-07-02 10:37:28 -04:00
|
|
|
|
{
|
2008-07-07 18:44:08 -04:00
|
|
|
|
char *str = NULL, *name;
|
2008-07-02 10:37:28 -04:00
|
|
|
|
|
2008-07-20 07:10:02 -04:00
|
|
|
|
if (opt.enable_iri && (name = idn_decode ((char *) host)) != NULL)
|
2008-07-02 10:37:28 -04:00
|
|
|
|
{
|
|
|
|
|
int len = strlen (host) + strlen (name) + 4;
|
|
|
|
|
str = xmalloc (len);
|
|
|
|
|
snprintf (str, len, "%s (%s)", name, host);
|
|
|
|
|
str[len-1] = '\0';
|
|
|
|
|
xfree (name);
|
|
|
|
|
}
|
|
|
|
|
|
2008-07-20 07:10:02 -04:00
|
|
|
|
logprintf (LOG_VERBOSE, _("Resolving %s... "),
|
2008-07-02 10:37:28 -04:00
|
|
|
|
quotearg_style (escape_quoting_style, str ? str : host));
|
|
|
|
|
|
|
|
|
|
if (str)
|
|
|
|
|
xfree (str);
|
|
|
|
|
}
|
2002-04-13 18:18:28 -04:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-11-10 07:56:08 -05:00
|
|
|
|
{
|
|
|
|
|
int err;
|
|
|
|
|
struct addrinfo hints, *res;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-11-10 07:56:08 -05:00
|
|
|
|
xzero (hints);
|
|
|
|
|
hints.ai_socktype = SOCK_STREAM;
|
2003-11-17 07:59:54 -05:00
|
|
|
|
if (opt.ipv4_only)
|
2003-11-14 20:49:52 -05:00
|
|
|
|
hints.ai_family = AF_INET;
|
2003-11-17 07:59:54 -05:00
|
|
|
|
else if (opt.ipv6_only)
|
2003-11-14 20:49:52 -05:00
|
|
|
|
hints.ai_family = AF_INET6;
|
2003-11-14 21:18:41 -05:00
|
|
|
|
else
|
2005-06-17 14:30:05 -04:00
|
|
|
|
/* We tried using AI_ADDRCONFIG, but removed it because: it
|
2007-08-02 23:38:21 -04:00
|
|
|
|
misinterprets IPv6 loopbacks, it is broken on AIX 5.1, and
|
|
|
|
|
it's unneeded since we sort the addresses anyway. */
|
|
|
|
|
hints.ai_family = AF_UNSPEC;
|
2005-06-17 12:48:29 -04:00
|
|
|
|
|
2003-11-14 20:49:52 -05:00
|
|
|
|
if (flags & LH_BIND)
|
|
|
|
|
hints.ai_flags |= AI_PASSIVE;
|
2003-11-10 07:56:08 -05:00
|
|
|
|
|
2005-03-04 14:21:02 -05:00
|
|
|
|
#ifdef AI_NUMERICHOST
|
|
|
|
|
if (numeric_address)
|
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
/* Where available, the AI_NUMERICHOST hint can prevent costly
|
|
|
|
|
access to DNS servers. */
|
|
|
|
|
hints.ai_flags |= AI_NUMERICHOST;
|
|
|
|
|
timeout = 0; /* no timeout needed when "resolving"
|
|
|
|
|
numeric hosts -- avoid setting up
|
|
|
|
|
signal handlers and such. */
|
2005-03-04 14:21:02 -05:00
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
err = getaddrinfo_with_timeout (host, NULL, &hints, &res, timeout);
|
2003-11-10 07:56:08 -05:00
|
|
|
|
if (err != 0 || res == NULL)
|
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
if (!silent)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"),
|
|
|
|
|
err != EAI_SYSTEM ? gai_strerror (err) : strerror (errno));
|
|
|
|
|
return NULL;
|
2003-11-10 07:56:08 -05:00
|
|
|
|
}
|
|
|
|
|
al = address_list_from_addrinfo (res);
|
|
|
|
|
freeaddrinfo (res);
|
2003-11-11 16:48:35 -05:00
|
|
|
|
if (!al)
|
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
logprintf (LOG_VERBOSE,
|
|
|
|
|
_("failed: No IPv4/IPv6 addresses for host.\n"));
|
|
|
|
|
return NULL;
|
2003-11-11 16:48:35 -05:00
|
|
|
|
}
|
2005-04-24 16:00:19 -04:00
|
|
|
|
|
|
|
|
|
/* Reorder addresses so that IPv4 ones (or IPv6 ones, as per
|
|
|
|
|
--prefer-family) come first. Sorting is stable so the order of
|
|
|
|
|
the addresses with the same family is undisturbed. */
|
|
|
|
|
if (al->count > 1 && opt.prefer_family != prefer_none)
|
|
|
|
|
stable_sort (al->addresses, al->count, sizeof (ip_address),
|
2007-08-02 23:38:21 -04:00
|
|
|
|
opt.prefer_family == prefer_ipv4
|
|
|
|
|
? cmp_prefer_ipv4 : cmp_prefer_ipv6);
|
2003-11-10 07:56:08 -05:00
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
#else /* not ENABLE_IPV6 */
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
2005-03-04 14:21:02 -05:00
|
|
|
|
struct hostent *hptr = gethostbyname_with_timeout (host, timeout);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
if (!hptr)
|
|
|
|
|
{
|
2007-08-02 23:38:21 -04:00
|
|
|
|
if (!silent)
|
|
|
|
|
{
|
|
|
|
|
if (errno != ETIMEDOUT)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"),
|
|
|
|
|
host_errstr (h_errno));
|
|
|
|
|
else
|
|
|
|
|
logputs (LOG_VERBOSE, _("failed: timed out.\n"));
|
|
|
|
|
}
|
|
|
|
|
return NULL;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
}
|
2003-10-31 05:50:03 -05:00
|
|
|
|
/* Do older systems have h_addr_list? */
|
|
|
|
|
al = address_list_from_ipv4_addresses (hptr->h_addr_list);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
}
|
2005-03-04 14:21:02 -05:00
|
|
|
|
#endif /* not ENABLE_IPV6 */
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2003-09-10 16:46:32 -04:00
|
|
|
|
/* Print the addresses determined by DNS lookup, but no more than
|
|
|
|
|
three. */
|
2005-03-04 14:21:02 -05:00
|
|
|
|
if (!silent && !numeric_address)
|
2003-09-10 16:46:32 -04:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
int printmax = al->count <= 3 ? al->count : 3;
|
|
|
|
|
for (i = 0; i < printmax; i++)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
{
|
|
|
|
|
logputs (LOG_VERBOSE, print_address (al->addresses + i));
|
|
|
|
|
if (i < printmax - 1)
|
|
|
|
|
logputs (LOG_VERBOSE, ", ");
|
|
|
|
|
}
|
2003-09-10 16:46:32 -04:00
|
|
|
|
if (printmax != al->count)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
logputs (LOG_VERBOSE, ", ...");
|
2003-09-10 16:46:32 -04:00
|
|
|
|
logputs (LOG_VERBOSE, "\n");
|
|
|
|
|
}
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Cache the lookup information. */
|
2003-11-14 20:49:52 -05:00
|
|
|
|
if (use_cache)
|
|
|
|
|
cache_store (host, al);
|
2003-11-09 20:38:09 -05:00
|
|
|
|
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* Determine whether a URL is acceptable to be followed, according to
|
|
|
|
|
a list of domains to accept. */
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool
|
2001-11-21 19:24:28 -05:00
|
|
|
|
accept_domain (struct url *u)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
assert (u->host != NULL);
|
|
|
|
|
if (opt.domains)
|
|
|
|
|
{
|
|
|
|
|
if (!sufmatch ((const char **)opt.domains, u->host))
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
if (opt.exclude_domains)
|
|
|
|
|
{
|
|
|
|
|
if (sufmatch ((const char **)opt.exclude_domains, u->host))
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return false;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return true;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Check whether WHAT is matched in LIST, each element of LIST being a
|
|
|
|
|
pattern to match WHAT against, using backward matching (see
|
|
|
|
|
match_backwards() in utils.c).
|
|
|
|
|
|
|
|
|
|
If an element of LIST matched, 1 is returned, 0 otherwise. */
|
2005-06-22 15:38:10 -04:00
|
|
|
|
bool
|
1999-12-02 02:42:23 -05:00
|
|
|
|
sufmatch (const char **list, const char *what)
|
|
|
|
|
{
|
|
|
|
|
int i, j, k, lw;
|
|
|
|
|
|
|
|
|
|
lw = strlen (what);
|
|
|
|
|
for (i = 0; list[i]; i++)
|
|
|
|
|
{
|
2010-05-25 12:36:02 -04:00
|
|
|
|
if (list[i][0] == '\0')
|
|
|
|
|
continue;
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
for (j = strlen (list[i]), k = lw; j >= 0 && k >= 0; j--, k--)
|
2007-10-14 17:46:24 -04:00
|
|
|
|
if (c_tolower (list[i][j]) != c_tolower (what[k]))
|
2007-08-02 23:38:21 -04:00
|
|
|
|
break;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* The domain must be first to reach to beginning. */
|
|
|
|
|
if (j == -1)
|
2007-08-02 23:38:21 -04:00
|
|
|
|
return true;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2005-06-22 15:38:10 -04:00
|
|
|
|
return false;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void
|
2001-11-24 22:10:34 -05:00
|
|
|
|
host_cleanup (void)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (host_name_addresses_map)
|
|
|
|
|
{
|
2005-08-27 09:05:39 -04:00
|
|
|
|
hash_table_iterator iter;
|
|
|
|
|
for (hash_table_iterate (host_name_addresses_map, &iter);
|
2007-08-02 23:38:21 -04:00
|
|
|
|
hash_table_iter_next (&iter);
|
|
|
|
|
)
|
|
|
|
|
{
|
|
|
|
|
char *host = iter.key;
|
|
|
|
|
struct address_list *al = iter.value;
|
|
|
|
|
xfree (host);
|
|
|
|
|
assert (al->refcount == 1);
|
|
|
|
|
address_list_delete (al);
|
|
|
|
|
}
|
2001-11-26 00:36:33 -05:00
|
|
|
|
hash_table_destroy (host_name_addresses_map);
|
|
|
|
|
host_name_addresses_map = NULL;
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|