2001-11-30 05:50:29 -05:00
|
|
|
|
/* Host name resolution and matching.
|
|
|
|
|
Copyright (C) 1995, 1996, 1997, 2000, 2001 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
|
|
|
|
|
the Free Software Foundation; either version 2 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
|
2001-05-27 15:35:15 -04:00
|
|
|
|
along with Wget; if not, write to the Free Software
|
2002-05-17 22:16:36 -04:00
|
|
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
|
|
|
|
|
In addition, as a special exception, the Free Software Foundation
|
|
|
|
|
gives permission to link the code of its release of Wget with the
|
|
|
|
|
OpenSSL project's "OpenSSL" library (or with modified versions of it
|
|
|
|
|
that use the same license as the "OpenSSL" library), and distribute
|
|
|
|
|
the linked executables. You must obey the GNU General Public License
|
|
|
|
|
in all respects for all of the code used other than "OpenSSL". If you
|
|
|
|
|
modify this file, you may extend this exception to your version of the
|
|
|
|
|
file, but you are not obligated to do so. If you do not wish to do
|
|
|
|
|
so, delete this exception statement from your version. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
#include <config.h>
|
2002-01-30 21:23:04 -05:00
|
|
|
|
|
|
|
|
|
#ifndef WINDOWS
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#include <netdb.h>
|
2002-01-30 21:23:04 -05:00
|
|
|
|
#endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#ifdef HAVE_STRING_H
|
|
|
|
|
# include <string.h>
|
|
|
|
|
#else
|
|
|
|
|
# include <strings.h>
|
|
|
|
|
#endif
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
|
|
|
|
|
#ifdef WINDOWS
|
|
|
|
|
# include <winsock.h>
|
2003-10-29 13:23:56 -05:00
|
|
|
|
# define SET_H_ERRNO(err) WSASetLastError (err)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#else
|
|
|
|
|
# include <sys/socket.h>
|
|
|
|
|
# include <netinet/in.h>
|
2001-11-30 03:36:22 -05:00
|
|
|
|
# ifndef __BEOS__
|
|
|
|
|
# include <arpa/inet.h>
|
|
|
|
|
# endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
# include <netdb.h>
|
2002-04-15 15:01:56 -04:00
|
|
|
|
# define SET_H_ERRNO(err) ((void)(h_errno = (err)))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#endif /* WINDOWS */
|
|
|
|
|
|
2001-11-16 11:58:08 -05:00
|
|
|
|
#ifndef NO_ADDRESS
|
2003-11-04 10:28:18 -05:00
|
|
|
|
# define NO_ADDRESS NO_DATA
|
2001-11-16 11:58:08 -05:00
|
|
|
|
#endif
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#include <errno.h>
|
|
|
|
|
|
|
|
|
|
#include "wget.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
|
|
|
|
|
|
|
|
|
#ifndef errno
|
|
|
|
|
extern int errno;
|
|
|
|
|
#endif
|
|
|
|
|
|
2001-12-03 12:22:06 -05:00
|
|
|
|
#ifndef h_errno
|
|
|
|
|
# ifndef __CYGWIN__
|
|
|
|
|
extern int h_errno;
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Mapping between known hosts and to lists of their addresses. */
|
2001-11-24 22:10:34 -05:00
|
|
|
|
|
2001-12-08 20:24:41 -05:00
|
|
|
|
static struct hash_table *host_name_addresses_map;
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Lists of addresses. This should eventually be extended to handle
|
|
|
|
|
IPv6. */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
struct address_list {
|
|
|
|
|
int count; /* number of adrresses */
|
2002-01-24 00:45:54 -05:00
|
|
|
|
ip_address *addresses; /* pointer to the string of addresses */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
int faulty; /* number of addresses known not to work. */
|
2003-10-30 19:18:08 -05:00
|
|
|
|
int from_cache; /* whether this entry was pulled from
|
|
|
|
|
cache or freshly looked up. */
|
|
|
|
|
|
|
|
|
|
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 whether this address list entry has been obtained from the
|
|
|
|
|
cache. */
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
2003-10-30 19:18:08 -05:00
|
|
|
|
int
|
|
|
|
|
address_list_cached_p (const struct address_list *al)
|
|
|
|
|
{
|
|
|
|
|
return al->from_cache;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
}
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Check whether two address lists have all their IPs in common. */
|
|
|
|
|
|
|
|
|
|
int
|
2003-10-29 18:13:25 -05:00
|
|
|
|
address_list_match_all (const struct address_list *al1,
|
|
|
|
|
const struct address_list *al2)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-10-29 18:13:25 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-10-29 13:23:56 -05:00
|
|
|
|
int i;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
#endif
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (al1 == al2)
|
|
|
|
|
return 1;
|
|
|
|
|
if (al1->count != al2->count)
|
|
|
|
|
return 0;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
|
|
|
|
|
/* For the comparison to be complete, we'd need to sort the IP
|
|
|
|
|
addresses first. But that's not necessary because this is only
|
|
|
|
|
used as an optimization. */
|
|
|
|
|
|
|
|
|
|
#ifndef ENABLE_IPV6
|
|
|
|
|
/* In the non-IPv6 case, there is only one address type, so we can
|
|
|
|
|
compare the whole array with memcmp. */
|
|
|
|
|
return 0 == memcmp (al1->addresses, al2->addresses,
|
|
|
|
|
al1->count * sizeof (ip_address));
|
|
|
|
|
#else /* ENABLE_IPV6 */
|
2003-10-29 13:23:56 -05:00
|
|
|
|
for (i = 0; i < al1->count; ++i)
|
|
|
|
|
{
|
2003-10-29 18:13:25 -05:00
|
|
|
|
const ip_address *ip1 = &al1->addresses[i];
|
|
|
|
|
const ip_address *ip2 = &al2->addresses[i];
|
|
|
|
|
|
|
|
|
|
if (ip1->type != ip2->type)
|
2003-10-29 13:23:56 -05:00
|
|
|
|
return 0;
|
|
|
|
|
|
2003-10-29 18:13:25 -05:00
|
|
|
|
switch (ip1->type)
|
|
|
|
|
{
|
|
|
|
|
case IPV4_ADDRESS:
|
|
|
|
|
if (ADDRESS_IPV4_IN_ADDR (ip1).s_addr
|
2003-11-02 18:48:45 -05:00
|
|
|
|
!=
|
|
|
|
|
ADDRESS_IPV4_IN_ADDR (ip2).s_addr)
|
2003-10-29 18:13:25 -05:00
|
|
|
|
return 0;
|
|
|
|
|
break;
|
|
|
|
|
case IPV6_ADDRESS:
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef HAVE_SOCKADDR_IN6_SCOPE_ID
|
2003-10-29 18:13:25 -05:00
|
|
|
|
if (ADDRESS_IPV6_SCOPE (ip1) != ADDRESS_IPV6_SCOPE (ip2))
|
2003-10-29 13:23:56 -05:00
|
|
|
|
return 0;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
#endif /* HAVE_SOCKADDR_IN6_SCOPE_ID */
|
|
|
|
|
if (!IN6_ARE_ADDR_EQUAL (&ADDRESS_IPV6_IN6_ADDR (ip1),
|
|
|
|
|
&ADDRESS_IPV6_IN6_ADDR (ip2)))
|
2003-10-29 13:23:56 -05:00
|
|
|
|
return 0;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
break;
|
|
|
|
|
default:
|
|
|
|
|
abort ();
|
2003-10-29 13:23:56 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
return 1;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
#endif /* ENABLE_IPV6 */
|
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-10-29 13:23:56 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2002-01-24 00:45:54 -05:00
|
|
|
|
/**
|
|
|
|
|
* address_list_from_addrinfo
|
|
|
|
|
*
|
|
|
|
|
* This function transform an addrinfo links list in and address_list.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
2003-10-30 19:18:08 -05:00
|
|
|
|
* addrinfo* Linked list of addrinfo
|
2002-01-24 00:45:54 -05:00
|
|
|
|
*
|
|
|
|
|
* Output:
|
|
|
|
|
* address_list* New allocated address_list
|
|
|
|
|
*/
|
|
|
|
|
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);
|
|
|
|
|
al->addresses = xnew_array (ip_address, cnt);
|
2003-10-30 19:18:08 -05:00
|
|
|
|
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)
|
2003-10-29 13:23:56 -05:00
|
|
|
|
if (ptr->ai_family == AF_INET6)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
const struct sockaddr_in6 *sin6 =
|
|
|
|
|
(const struct sockaddr_in6 *)ptr->ai_addr;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
ip->type = IPV6_ADDRESS;
|
|
|
|
|
ADDRESS_IPV6_IN6_ADDR (ip) = sin6->sin6_addr;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef HAVE_SOCKADDR_IN6_SCOPE_ID
|
2003-10-29 18:13:25 -05:00
|
|
|
|
ADDRESS_IPV6_SCOPE (ip) = sin6->sin6_scope_id;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
2003-10-29 18:13:25 -05:00
|
|
|
|
++ip;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
else if (ptr->ai_family == AF_INET)
|
2002-01-24 00:45:54 -05:00
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
const struct sockaddr_in *sin =
|
|
|
|
|
(const struct sockaddr_in *)ptr->ai_addr;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
ip->type = IPV4_ADDRESS;
|
|
|
|
|
ADDRESS_IPV4_IN_ADDR (ip) = 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;
|
|
|
|
|
}
|
|
|
|
|
#else
|
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-10-31 09:55:50 -05:00
|
|
|
|
al->addresses = xnew_array (ip_address, count);
|
2003-10-30 19:18:08 -05:00
|
|
|
|
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];
|
|
|
|
|
ip->type = IPV4_ADDRESS;
|
2003-10-31 21:22:11 -05:00
|
|
|
|
memcpy (ADDRESS_IPV4_DATA (ip), vec[i], 4);
|
2003-10-29 18:13:25 -05:00
|
|
|
|
}
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
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
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
void
|
|
|
|
|
address_list_release (struct address_list *al)
|
|
|
|
|
{
|
|
|
|
|
--al->refcount;
|
|
|
|
|
DEBUGP (("Releasing %p (new refcount %d).\n", al, al->refcount));
|
|
|
|
|
if (al->refcount <= 0)
|
|
|
|
|
{
|
|
|
|
|
DEBUGP (("Deleting unused %p.\n", al));
|
|
|
|
|
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-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,
|
|
|
|
|
const struct addrinfo *hints, struct addrinfo **res,
|
2003-09-20 19:12:18 -04:00
|
|
|
|
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
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
/* Pretty-print ADDR. When compiled without IPv6, this is the same as
|
|
|
|
|
inet_ntoa. With IPv6, it either prints an IPv6 address or an IPv4
|
|
|
|
|
address. */
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
const char *
|
|
|
|
|
pretty_print_address (const ip_address *addr)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
switch (addr->type)
|
|
|
|
|
{
|
2003-10-29 18:13:25 -05:00
|
|
|
|
case IPV4_ADDRESS:
|
|
|
|
|
return inet_ntoa (ADDRESS_IPV4_IN_ADDR (addr));
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-10-29 18:13:25 -05:00
|
|
|
|
case IPV6_ADDRESS:
|
2003-10-29 13:23:56 -05:00
|
|
|
|
{
|
|
|
|
|
static char buf[128];
|
2003-10-29 18:13:25 -05:00
|
|
|
|
inet_ntop (AF_INET6, &ADDRESS_IPV6_IN6_ADDR (addr), buf, sizeof (buf));
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#if 0
|
|
|
|
|
#ifdef HAVE_SOCKADDR_IN6_SCOPE_ID
|
2003-10-29 18:13:25 -05:00
|
|
|
|
{
|
|
|
|
|
/* append "%SCOPE_ID" for all ?non-global? addresses */
|
|
|
|
|
char *p = buf + strlen (buf);
|
|
|
|
|
*p++ = '%';
|
|
|
|
|
number_to_string (p, ADDRESS_IPV6_SCOPE (addr));
|
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#endif
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#endif
|
2003-10-29 13:23:56 -05:00
|
|
|
|
buf[sizeof (buf) - 1] = '\0';
|
|
|
|
|
return buf;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
abort ();
|
|
|
|
|
return NULL;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Add host name HOST with the address ADDR_TEXT to the cache.
|
|
|
|
|
ADDR_LIST is a NULL-terminated list of addresses, as in struct
|
|
|
|
|
hostent. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
static void
|
|
|
|
|
cache_host_lookup (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);
|
|
|
|
|
|
2003-10-07 20:05:51 -04:00
|
|
|
|
#ifdef ENABLE_DEBUG
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (opt.debug)
|
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
debug_logprintf ("Caching %s =>", host);
|
|
|
|
|
for (i = 0; i < al->count; i++)
|
2001-12-11 03:32:58 -05:00
|
|
|
|
debug_logprintf (" %s", pretty_print_address (al->addresses + i));
|
2001-11-26 00:36:33 -05:00
|
|
|
|
debug_logprintf ("\n");
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-31 21:22:11 -05:00
|
|
|
|
/* Remove HOST from Wget's DNS cache. Does nothing is HOST is not in
|
|
|
|
|
the cache. */
|
|
|
|
|
|
2003-10-30 19:18:08 -05:00
|
|
|
|
void
|
|
|
|
|
forget_host_lookup (const char *host)
|
|
|
|
|
{
|
|
|
|
|
struct address_list *al = hash_table_get (host_name_addresses_map, host);
|
|
|
|
|
if (al)
|
|
|
|
|
{
|
|
|
|
|
address_list_release (al);
|
|
|
|
|
hash_table_remove (host_name_addresses_map, host);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2003-10-31 21:22:11 -05:00
|
|
|
|
/* Look up HOST in DNS and return a list of IP addresses.
|
|
|
|
|
|
|
|
|
|
This function caches its result so that, if the same host is passed
|
|
|
|
|
the second time, the addresses are returned without the DNS lookup.
|
|
|
|
|
If you want to force lookup, call forget_host_lookup() prior to
|
|
|
|
|
this function, or set opt.dns_cache to 0 to globally disable
|
|
|
|
|
caching.
|
|
|
|
|
|
|
|
|
|
FLAGS can be a combination of:
|
|
|
|
|
LH_SILENT - don't print the "resolving ... done" message.
|
|
|
|
|
LH_IPV4_ONLY - return only IPv4 addresses.
|
|
|
|
|
LH_IPV6_ONLY - return only IPv6 addresses. */
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
struct address_list *
|
2003-10-29 13:23:56 -05:00
|
|
|
|
lookup_host (const char *host, int flags)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
|
|
|
|
struct address_list *al = NULL;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-09-09 15:30:45 -04:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-10-31 21:22:11 -05:00
|
|
|
|
int err;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
struct addrinfo hints, *res;
|
|
|
|
|
|
2003-10-31 21:22:11 -05:00
|
|
|
|
xzero (hints);
|
|
|
|
|
hints.ai_socktype = SOCK_STREAM;
|
|
|
|
|
|
|
|
|
|
/* Should we inspect opt.<something> directly? */
|
2003-10-29 18:13:25 -05:00
|
|
|
|
if (flags & LH_IPV4_ONLY)
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_family = AF_INET;
|
2003-10-29 18:13:25 -05:00
|
|
|
|
else if (flags & LH_IPV6_ONLY)
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_family = AF_INET6;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
else
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_family = AF_UNSPEC;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#endif
|
2003-10-31 21:22:11 -05:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
/* First, try to check whether the address is already a numeric
|
2003-10-31 21:22:11 -05:00
|
|
|
|
address, in which case we don't want to cache it or bother with
|
|
|
|
|
setting up timeouts. Plus, old (e.g. Ultrix) implementations of
|
2003-10-29 18:13:25 -05:00
|
|
|
|
gethostbyname can't handle numeric addresses (!).
|
|
|
|
|
|
|
|
|
|
Where getaddrinfo is available, we do it using the AI_NUMERICHOST
|
2003-10-31 21:22:11 -05:00
|
|
|
|
flag. Without IPv6, we use inet_addr. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_flags = AI_NUMERICHOST;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
if (flags & LH_PASSIVE)
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_flags |= AI_PASSIVE;
|
2003-10-29 13:23:56 -05:00
|
|
|
|
|
2003-10-31 21:29:38 -05:00
|
|
|
|
/* No need to specify timeout, as we're not resolving HOST, but
|
|
|
|
|
merely translating it from the presentation (ASCII) to network
|
|
|
|
|
format. */
|
2003-10-29 13:23:56 -05:00
|
|
|
|
err = getaddrinfo (host, NULL, &hints, &res);
|
|
|
|
|
if (err == 0 && res != NULL)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
al = address_list_from_addrinfo (res);
|
|
|
|
|
freeaddrinfo (res);
|
|
|
|
|
return al;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#else
|
|
|
|
|
{
|
|
|
|
|
uint32_t addr_ipv4 = (uint32_t)inet_addr (host);
|
|
|
|
|
if (addr_ipv4 != (uint32_t) -1)
|
|
|
|
|
{
|
|
|
|
|
/* The return value of inet_addr is in network byte order, so
|
2003-10-29 18:13:25 -05:00
|
|
|
|
we can just copy it to IP. */
|
2003-10-31 21:22:11 -05:00
|
|
|
|
char *vec[2];
|
2003-10-31 05:50:03 -05:00
|
|
|
|
vec[0] = (char *)&addr_ipv4;
|
|
|
|
|
vec[1] = NULL;
|
|
|
|
|
return address_list_from_ipv4_addresses (vec);
|
2003-10-29 13:23:56 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Then, try to find the host in the cache. */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (host_name_addresses_map)
|
2000-11-19 15:50:10 -05:00
|
|
|
|
{
|
2002-01-24 00:45:54 -05:00
|
|
|
|
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;
|
2003-10-30 19:18:08 -05:00
|
|
|
|
al->from_cache = 1;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
return al;
|
|
|
|
|
}
|
2000-11-19 15:50:10 -05:00
|
|
|
|
}
|
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
if (!(flags & LH_SILENT))
|
2001-11-26 00:36:33 -05:00
|
|
|
|
logprintf (LOG_VERBOSE, _("Resolving %s... "), host);
|
|
|
|
|
|
2002-04-14 22:21:38 -04:00
|
|
|
|
/* Host name lookup goes on below. */
|
2002-04-13 18:18:28 -04:00
|
|
|
|
|
2003-10-29 13:23:56 -05:00
|
|
|
|
#ifdef ENABLE_IPV6
|
2003-10-31 21:22:11 -05:00
|
|
|
|
hints.ai_flags = 0;
|
|
|
|
|
if (flags & LH_PASSIVE)
|
|
|
|
|
hints.ai_flags |= AI_PASSIVE;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
|
2003-10-31 21:22:11 -05:00
|
|
|
|
err = getaddrinfo_with_timeout (host, NULL, &hints, &res, opt.dns_timeout);
|
|
|
|
|
if (err != 0 || res == NULL)
|
|
|
|
|
{
|
|
|
|
|
if (!(flags & LH_SILENT))
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"),
|
|
|
|
|
err != EAI_SYSTEM ? gai_strerror (err) : strerror (errno));
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
al = address_list_from_addrinfo (res);
|
|
|
|
|
freeaddrinfo (res);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#else
|
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
struct hostent *hptr = gethostbyname_with_timeout (host, opt.dns_timeout);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
if (!hptr)
|
|
|
|
|
{
|
2003-10-29 13:23:56 -05:00
|
|
|
|
if (!(flags & LH_SILENT))
|
2002-04-14 22:21:38 -04:00
|
|
|
|
{
|
|
|
|
|
if (errno != ETIMEDOUT)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"), herrmsg (h_errno));
|
|
|
|
|
else
|
|
|
|
|
logputs (LOG_VERBOSE, _("failed: timed out.\n"));
|
|
|
|
|
}
|
2002-01-24 00:45:54 -05:00
|
|
|
|
return NULL;
|
|
|
|
|
}
|
2003-10-29 13:23:56 -05:00
|
|
|
|
assert (hptr->h_length == 4);
|
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
|
|
|
|
}
|
|
|
|
|
#endif
|
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. */
|
2003-10-29 13:23:56 -05:00
|
|
|
|
if (!(flags & LH_SILENT))
|
2003-09-10 16:46:32 -04:00
|
|
|
|
{
|
|
|
|
|
int i;
|
|
|
|
|
int printmax = al->count <= 3 ? al->count : 3;
|
|
|
|
|
for (i = 0; i < printmax; i++)
|
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_VERBOSE, "%s",
|
|
|
|
|
pretty_print_address (al->addresses + i));
|
|
|
|
|
if (i < printmax - 1)
|
|
|
|
|
logputs (LOG_VERBOSE, ", ");
|
|
|
|
|
}
|
|
|
|
|
if (printmax != al->count)
|
|
|
|
|
logputs (LOG_VERBOSE, ", ...");
|
|
|
|
|
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-09-10 15:41:54 -04:00
|
|
|
|
if (opt.dns_cache)
|
|
|
|
|
cache_host_lookup (host, al);
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
return al;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
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. */
|
|
|
|
|
int
|
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))
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
if (opt.exclude_domains)
|
|
|
|
|
{
|
|
|
|
|
if (sufmatch ((const char **)opt.exclude_domains, u->host))
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
int
|
|
|
|
|
sufmatch (const char **list, const char *what)
|
|
|
|
|
{
|
|
|
|
|
int i, j, k, lw;
|
|
|
|
|
|
|
|
|
|
lw = strlen (what);
|
|
|
|
|
for (i = 0; list[i]; i++)
|
|
|
|
|
{
|
|
|
|
|
for (j = strlen (list[i]), k = lw; j >= 0 && k >= 0; j--, k--)
|
2000-03-31 09:05:53 -05:00
|
|
|
|
if (TOLOWER (list[i][j]) != TOLOWER (what[k]))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
break;
|
|
|
|
|
/* The domain must be first to reach to beginning. */
|
|
|
|
|
if (j == -1)
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print error messages for host errors. */
|
|
|
|
|
char *
|
|
|
|
|
herrmsg (int error)
|
|
|
|
|
{
|
|
|
|
|
/* Can't use switch since some constants are equal (at least on my
|
|
|
|
|
system), and the compiler signals "duplicate case value". */
|
|
|
|
|
if (error == HOST_NOT_FOUND
|
|
|
|
|
|| error == NO_RECOVERY
|
|
|
|
|
|| error == NO_DATA
|
|
|
|
|
|| error == NO_ADDRESS
|
|
|
|
|
|| error == TRY_AGAIN)
|
|
|
|
|
return _("Host not found");
|
|
|
|
|
else
|
|
|
|
|
return _("Unknown error");
|
|
|
|
|
}
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
static int
|
|
|
|
|
host_cleanup_mapper (void *key, void *value, void *arg_ignored)
|
|
|
|
|
{
|
|
|
|
|
struct address_list *al;
|
|
|
|
|
|
|
|
|
|
xfree (key); /* host */
|
|
|
|
|
|
|
|
|
|
al = (struct address_list *)value;
|
|
|
|
|
assert (al->refcount == 1);
|
|
|
|
|
address_list_delete (al);
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
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)
|
|
|
|
|
{
|
|
|
|
|
hash_table_map (host_name_addresses_map, host_cleanup_mapper, NULL);
|
|
|
|
|
hash_table_destroy (host_name_addresses_map);
|
|
|
|
|
host_name_addresses_map = NULL;
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|