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
|
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
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
|
1999-12-02 02:42:23 -05:00
|
|
|
|
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
|
|
|
|
|
|
|
|
|
|
#include <config.h>
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#include <netdb.h>
|
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>
|
|
|
|
|
#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>
|
|
|
|
|
#endif /* WINDOWS */
|
|
|
|
|
|
2001-11-16 11:58:08 -05:00
|
|
|
|
#ifndef NO_ADDRESS
|
|
|
|
|
#define NO_ADDRESS NO_DATA
|
|
|
|
|
#endif
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#ifdef HAVE_SYS_UTSNAME_H
|
|
|
|
|
# include <sys/utsname.h>
|
|
|
|
|
#endif
|
|
|
|
|
#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
|
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
int ip_default_family = AF_INET6;
|
|
|
|
|
#else
|
|
|
|
|
int ip_default_family = AF_INET;
|
|
|
|
|
#endif
|
2001-11-24 22:10:34 -05:00
|
|
|
|
|
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. */
|
|
|
|
|
int refcount; /* so we know whether to free it or not. */
|
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
|
|
|
|
|
address_list_get_bounds (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
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Copy address number INDEX to IP_STORE. */
|
|
|
|
|
|
|
|
|
|
void
|
2002-01-24 00:45:54 -05:00
|
|
|
|
address_list_copy_one (struct address_list *al, int index, ip_address *ip_store)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2002-01-24 22:34:23 -05:00
|
|
|
|
assert (index >= al->faulty && index < al->count);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
memcpy (ip_store, al->addresses + index, sizeof (ip_address));
|
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
|
|
|
|
|
address_list_match_all (struct address_list *al1, struct address_list *al2)
|
|
|
|
|
{
|
|
|
|
|
if (al1 == al2)
|
|
|
|
|
return 1;
|
|
|
|
|
if (al1->count != al2->count)
|
|
|
|
|
return 0;
|
2001-12-11 03:32:58 -05:00
|
|
|
|
return 0 == memcmp (al1->addresses, al2->addresses,
|
2002-01-24 00:45:54 -05:00
|
|
|
|
al1->count * sizeof (ip_address));
|
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;
|
|
|
|
|
}
|
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
/**
|
|
|
|
|
* address_list_from_addrinfo
|
|
|
|
|
*
|
|
|
|
|
* This function transform an addrinfo links list in and address_list.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* addrinfo* Linkt list of addrinfo
|
|
|
|
|
*
|
|
|
|
|
* Output:
|
|
|
|
|
* address_list* New allocated address_list
|
|
|
|
|
*/
|
|
|
|
|
static struct address_list *
|
|
|
|
|
address_list_from_addrinfo (struct addrinfo *ai)
|
|
|
|
|
{
|
|
|
|
|
struct address_list *al;
|
|
|
|
|
struct addrinfo *ai_head = ai;
|
|
|
|
|
int cnt = 0;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (ai = ai_head; ai; ai = ai->ai_next)
|
|
|
|
|
if (ai->ai_family == AF_INET || ai->ai_family == AF_INET6)
|
|
|
|
|
++cnt;
|
|
|
|
|
if (cnt == 0)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
al = xmalloc (sizeof (struct address_list));
|
|
|
|
|
al->addresses = xmalloc (cnt * sizeof (ip_address));
|
|
|
|
|
al->count = cnt;
|
|
|
|
|
al->faulty = 0;
|
|
|
|
|
al->refcount = 1;
|
|
|
|
|
|
|
|
|
|
for (i = 0, ai = ai_head; ai; ai = ai->ai_next)
|
|
|
|
|
if (ai->ai_family == AF_INET6)
|
|
|
|
|
{
|
|
|
|
|
struct sockaddr_in6 *sin6 = (struct sockaddr_in6*)ai->ai_addr;
|
|
|
|
|
memcpy (al->addresses + i, &sin6->sin6_addr, 16);
|
|
|
|
|
++i;
|
|
|
|
|
}
|
|
|
|
|
else if (ai->ai_family == AF_INET)
|
|
|
|
|
{
|
|
|
|
|
struct sockaddr_in *sin = (struct sockaddr_in *)ai->ai_addr;
|
|
|
|
|
map_ipv4_to_ip ((ip4_address *)&sin->sin_addr, al->addresses + i);
|
|
|
|
|
++i;
|
|
|
|
|
}
|
|
|
|
|
assert (i == cnt);
|
|
|
|
|
return al;
|
|
|
|
|
}
|
|
|
|
|
#else
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Create an address_list out of a NULL-terminated list of addresses,
|
|
|
|
|
as returned by gethostbyname. */
|
|
|
|
|
static struct address_list *
|
|
|
|
|
address_list_new (char **h_addr_list)
|
|
|
|
|
{
|
|
|
|
|
int count = 0, i;
|
|
|
|
|
|
|
|
|
|
struct address_list *al = xmalloc (sizeof (struct address_list));
|
|
|
|
|
|
|
|
|
|
while (h_addr_list[count])
|
|
|
|
|
++count;
|
|
|
|
|
assert (count > 0);
|
2001-12-11 03:32:58 -05:00
|
|
|
|
al->count = count;
|
|
|
|
|
al->faulty = 0;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
al->addresses = xmalloc (count * sizeof (ip_address));
|
2001-12-11 03:32:58 -05:00
|
|
|
|
al->refcount = 1;
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
|
|
|
|
for (i = 0; i < count; i++)
|
2002-01-24 01:19:35 -05:00
|
|
|
|
map_ipv4_to_ip ((ip4_address *)h_addr_list[i], al->addresses + i);
|
2001-11-26 00:36:33 -05:00
|
|
|
|
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#endif
|
2000-11-19 15:50:10 -05:00
|
|
|
|
|
2001-12-03 12:48:12 -05:00
|
|
|
|
/* Like address_list_new, but initialized with only one address. */
|
|
|
|
|
|
|
|
|
|
static struct address_list *
|
2002-01-24 00:45:54 -05:00
|
|
|
|
address_list_new_one (ip_address *addr)
|
2001-12-03 12:48:12 -05:00
|
|
|
|
{
|
|
|
|
|
struct address_list *al = xmalloc (sizeof (struct address_list));
|
2001-12-11 03:32:58 -05:00
|
|
|
|
al->count = 1;
|
|
|
|
|
al->faulty = 0;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
al->addresses = xmalloc (sizeof (ip_address));
|
2001-12-11 03:32:58 -05:00
|
|
|
|
al->refcount = 1;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
memcpy (al->addresses, addr, sizeof (ip_address));
|
2001-12-03 12:48:12 -05:00
|
|
|
|
|
|
|
|
|
return al;
|
|
|
|
|
}
|
|
|
|
|
|
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-01-24 00:45:54 -05:00
|
|
|
|
/**
|
|
|
|
|
* wget_sockaddr_set_address
|
|
|
|
|
*
|
|
|
|
|
* This function takes an wget_sockaddr and fill in the protocol type,
|
|
|
|
|
* the port number and the address, there NULL in address means wildcard.
|
|
|
|
|
* Unsuported adress family will abort the whole programm.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* wget_sockaddr* The space to be filled
|
|
|
|
|
* int The wished protocol
|
|
|
|
|
* unsigned short The port
|
|
|
|
|
* const ip_address The Binary IP adress
|
|
|
|
|
*
|
|
|
|
|
* Return:
|
|
|
|
|
* - Only modify 1. param
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
wget_sockaddr_set_address (wget_sockaddr *sa,
|
|
|
|
|
int ip_family, unsigned short port, ip_address *addr)
|
|
|
|
|
{
|
|
|
|
|
if (ip_family == AF_INET)
|
|
|
|
|
{
|
|
|
|
|
sa->sin.sin_family = ip_family;
|
|
|
|
|
sa->sin.sin_port = htons (port);
|
|
|
|
|
if (addr == NULL)
|
2002-01-24 01:19:35 -05:00
|
|
|
|
memset (&sa->sin.sin_addr, 0, sizeof(ip4_address));
|
2002-01-24 22:34:23 -05:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
ip4_address addr4;
|
|
|
|
|
if (!map_ip_to_ipv4 (addr, &addr4))
|
|
|
|
|
/* should the callers have prevented this? */
|
|
|
|
|
abort ();
|
|
|
|
|
memcpy (&sa->sin.sin_addr, &addr4, sizeof(ip4_address));
|
|
|
|
|
}
|
2002-01-24 00:45:54 -05:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (ip_family == AF_INET6)
|
|
|
|
|
{
|
|
|
|
|
sa->sin6.sin6_family = ip_family;
|
|
|
|
|
sa->sin6.sin6_port = htons (port);
|
|
|
|
|
if (addr == NULL)
|
2002-01-24 01:19:35 -05:00
|
|
|
|
memset (&sa->sin6.sin6_addr, 0 , 16);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
else
|
2002-01-24 01:19:35 -05:00
|
|
|
|
memcpy (&sa->sin6.sin6_addr, addr, 16);
|
2002-01-24 00:45:54 -05:00
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* wget_sockaddr_set_port
|
|
|
|
|
*
|
|
|
|
|
* This funtion only fill the port of the socket information.
|
|
|
|
|
* If the protocol is not supported nothing is done.
|
|
|
|
|
* Unsuported adress family will abort the whole programm.
|
|
|
|
|
*
|
|
|
|
|
* Require:
|
|
|
|
|
* that the IP-Protocol already is set.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* wget_sockaddr* The space there port should be entered
|
|
|
|
|
* unsigned int The port that should be entered in host order
|
|
|
|
|
*
|
|
|
|
|
* Return:
|
|
|
|
|
* - Only modify 1. param
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
wget_sockaddr_set_port (wget_sockaddr *sa, unsigned short port)
|
|
|
|
|
{
|
|
|
|
|
if (sa->sa.sa_family == AF_INET)
|
|
|
|
|
{
|
|
|
|
|
sa->sin.sin_port = htons (port);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (sa->sa.sa_family == AF_INET6)
|
|
|
|
|
{
|
|
|
|
|
sa->sin6.sin6_port = htons (port);
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
abort();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* wget_sockaddr_get_addr
|
|
|
|
|
*
|
|
|
|
|
* This function return the adress from an sockaddr as byte string.
|
|
|
|
|
* Unsuported adress family will abort the whole programm.
|
|
|
|
|
*
|
|
|
|
|
* Require:
|
|
|
|
|
* that the IP-Protocol already is set.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* wget_sockaddr* Socket Information
|
|
|
|
|
*
|
|
|
|
|
* Output:
|
|
|
|
|
* unsigned char * IP address as byte string.
|
|
|
|
|
*/
|
|
|
|
|
void *
|
|
|
|
|
wget_sockaddr_get_addr (wget_sockaddr *sa)
|
|
|
|
|
{
|
|
|
|
|
if (sa->sa.sa_family == AF_INET)
|
|
|
|
|
return &sa->sin.sin_addr;
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (sa->sa.sa_family == AF_INET6)
|
|
|
|
|
return &sa->sin6.sin6_addr;
|
|
|
|
|
#endif
|
|
|
|
|
abort();
|
|
|
|
|
/* unreached */
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* wget_sockaddr_get_port
|
|
|
|
|
*
|
|
|
|
|
* This function only return the port from the input structure
|
|
|
|
|
* Unsuported adress family will abort the whole programm.
|
|
|
|
|
*
|
|
|
|
|
* Require:
|
|
|
|
|
* that the IP-Protocol already is set.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* wget_sockaddr* Information where to get the port
|
|
|
|
|
*
|
|
|
|
|
* Output:
|
|
|
|
|
* unsigned short Port Number in host order.
|
|
|
|
|
*/
|
|
|
|
|
unsigned short
|
|
|
|
|
wget_sockaddr_get_port (const wget_sockaddr *sa)
|
|
|
|
|
{
|
|
|
|
|
if (sa->sa.sa_family == AF_INET)
|
|
|
|
|
return htons (sa->sin.sin_port);
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (sa->sa.sa_family == AF_INET6)
|
|
|
|
|
return htons (sa->sin6.sin6_port);
|
|
|
|
|
#endif
|
|
|
|
|
abort();
|
|
|
|
|
/* do not complain about return nothing */
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* sockaddr_len
|
|
|
|
|
*
|
|
|
|
|
* This function return the length of the sockaddr corresponding to
|
|
|
|
|
* the acutall prefered protocol for (bind, connect etc...)
|
|
|
|
|
* Unsuported adress family will abort the whole programm.
|
|
|
|
|
*
|
|
|
|
|
* Require:
|
|
|
|
|
* that the IP-Protocol already is set.
|
|
|
|
|
*
|
|
|
|
|
* Input:
|
|
|
|
|
* - Public IP-Family Information
|
|
|
|
|
*
|
|
|
|
|
* Output:
|
|
|
|
|
* int structure length for socket options
|
|
|
|
|
*/
|
|
|
|
|
int
|
|
|
|
|
sockaddr_len ()
|
|
|
|
|
{
|
|
|
|
|
if (ip_default_family == AF_INET)
|
|
|
|
|
return sizeof (struct sockaddr_in);
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (ip_default_family == AF_INET6)
|
|
|
|
|
return sizeof (struct sockaddr_in6);
|
|
|
|
|
#endif
|
|
|
|
|
abort();
|
|
|
|
|
/* do not complain about return nothing */
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Map an IPv4 adress to the internal adress format.
|
|
|
|
|
*/
|
|
|
|
|
void
|
|
|
|
|
map_ipv4_to_ip (ip4_address *ipv4, ip_address *ip)
|
|
|
|
|
{
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
static unsigned char ipv64[12] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff};
|
|
|
|
|
memcpy ((char *)ip + 12, ipv4 , 4);
|
|
|
|
|
memcpy ((char *)ip + 0, ipv64, 12);
|
|
|
|
|
#else
|
|
|
|
|
if ((char *)ip != (char *)ipv4)
|
|
|
|
|
memcpy (ip, ipv4, 4);
|
|
|
|
|
#endif
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Detect whether an IP adress represents an IPv4 address and, if so,
|
|
|
|
|
copy it to IPV4. 0 is returned on failure.
|
|
|
|
|
This operation always succeeds when Wget is compiled without IPv6.
|
|
|
|
|
If IPV4 is NULL, don't copy, just detect. */
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
map_ip_to_ipv4 (ip_address *ip, ip4_address *ipv4)
|
|
|
|
|
{
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
static unsigned char ipv64[12] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff};
|
|
|
|
|
if (0 != memcmp (ip, ipv64, 12))
|
|
|
|
|
return 0;
|
|
|
|
|
if (ipv4)
|
|
|
|
|
memcpy (ipv4, (char *)ip + 12, 4);
|
|
|
|
|
#else
|
|
|
|
|
if (ipv4)
|
|
|
|
|
memcpy (ipv4, (char *)ip, 4);
|
|
|
|
|
#endif
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* 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
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
char *
|
2002-01-24 00:45:54 -05:00
|
|
|
|
pretty_print_address (ip_address *addr)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
ip4_address addr4;
|
|
|
|
|
static char buf[128];
|
|
|
|
|
|
|
|
|
|
if (map_ip_to_ipv4 (addr, &addr4))
|
|
|
|
|
return inet_ntoa (*(struct in_addr *)&addr4);
|
|
|
|
|
|
|
|
|
|
if (!inet_ntop (AF_INET6, addr, buf, sizeof (buf)))
|
|
|
|
|
return "<unknown>";
|
|
|
|
|
return buf;
|
|
|
|
|
#endif
|
2001-11-26 00:36:33 -05:00
|
|
|
|
return inet_ntoa (*(struct in_addr *)addr);
|
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);
|
|
|
|
|
|
|
|
|
|
#ifdef DEBUG
|
|
|
|
|
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
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
struct address_list *
|
|
|
|
|
lookup_host (const char *host, int silent)
|
|
|
|
|
{
|
|
|
|
|
struct address_list *al = NULL;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
unsigned long addr_ipv4; /* #### use a 32-bit type here. */
|
|
|
|
|
ip_address addr;
|
|
|
|
|
|
|
|
|
|
/* First, try to check whether the address is already a numeric
|
|
|
|
|
address. */
|
|
|
|
|
|
|
|
|
|
#ifdef INET6
|
|
|
|
|
if (inet_pton (AF_INET6, host, &addr) > 0)
|
|
|
|
|
return address_list_new_one (&addr);
|
|
|
|
|
#endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
addr_ipv4 = (unsigned long)inet_addr (host);
|
|
|
|
|
if ((int)addr_ipv4 != -1)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-25 12:13:20 -05:00
|
|
|
|
/* ADDR is defined to be in network byte order, which is what
|
|
|
|
|
this returns, so we can just copy it to STORE_IP. However,
|
|
|
|
|
on big endian 64-bit architectures the value will be stored
|
|
|
|
|
in the *last*, not first four bytes. OFFSET makes sure that
|
|
|
|
|
we copy the correct four bytes. */
|
2002-01-24 00:45:54 -05:00
|
|
|
|
int offset = 0;
|
2000-03-31 09:07:07 -05:00
|
|
|
|
#ifdef WORDS_BIGENDIAN
|
2002-01-24 01:19:35 -05:00
|
|
|
|
offset = sizeof (unsigned long) - sizeof (ip4_address);
|
2000-03-31 09:07:07 -05:00
|
|
|
|
#endif
|
2002-01-24 00:45:54 -05:00
|
|
|
|
map_ipv4_to_ip ((ip4_address *)((char *)&addr_ipv4 + offset), &addr);
|
|
|
|
|
return address_list_new_one (&addr);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
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;
|
|
|
|
|
return al;
|
|
|
|
|
}
|
2000-11-19 15:50:10 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (!silent)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("Resolving %s... "), host);
|
|
|
|
|
|
2002-01-24 00:45:54 -05:00
|
|
|
|
#ifdef INET6
|
|
|
|
|
{
|
|
|
|
|
struct addrinfo hints, *ai;
|
|
|
|
|
int err;
|
|
|
|
|
|
|
|
|
|
memset (&hints, 0, sizeof (hints));
|
2002-01-24 01:19:35 -05:00
|
|
|
|
if (ip_default_family == AF_INET)
|
|
|
|
|
hints.ai_family = AF_INET;
|
|
|
|
|
else
|
|
|
|
|
hints.ai_family = PF_UNSPEC;
|
2002-01-24 00:45:54 -05:00
|
|
|
|
hints.ai_socktype = SOCK_STREAM;
|
|
|
|
|
err = getaddrinfo (host, NULL, &hints, &ai);
|
|
|
|
|
|
|
|
|
|
if (err != 0 || ai == NULL)
|
|
|
|
|
{
|
|
|
|
|
if (!silent)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"), gai_strerror (err));
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
al = address_list_from_addrinfo (ai);
|
|
|
|
|
freeaddrinfo (ai);
|
|
|
|
|
}
|
|
|
|
|
#else
|
|
|
|
|
{
|
|
|
|
|
struct hostent *hptr = gethostbyname (host);
|
|
|
|
|
if (!hptr)
|
|
|
|
|
{
|
|
|
|
|
if (!silent)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("failed: %s.\n"), herrmsg (h_errno));
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
/* Do all systems have h_addr_list, or is it a newer thing? If
|
|
|
|
|
the latter, use address_list_new_one. */
|
|
|
|
|
al = address_list_new (hptr->h_addr_list);
|
|
|
|
|
}
|
|
|
|
|
#endif
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (!silent)
|
|
|
|
|
logprintf (LOG_VERBOSE, _("done.\n"));
|
2001-11-25 12:13:20 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
/* Cache the lookup information. */
|
|
|
|
|
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
|
|
|
|
}
|