2002-09-03 13:52:59 +02:00
|
|
|
/***************************************************************************
|
1999-12-29 15:20:26 +01:00
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2002-03-19 08:54:55 +01:00
|
|
|
* Copyright (C) 1998 - 2002, Daniel Stenberg, <daniel@haxx.se>, et al.
|
1999-12-29 15:20:26 +01:00
|
|
|
*
|
2002-09-03 13:52:59 +02:00
|
|
|
* This software is licensed as described in the file COPYING, which
|
|
|
|
* you should have received as part of this distribution. The terms
|
|
|
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
|
|
|
*
|
2001-01-03 10:29:33 +01:00
|
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
|
|
* copies of the Software, and permit persons to whom the Software is
|
2002-09-03 13:52:59 +02:00
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
1999-12-29 15:20:26 +01:00
|
|
|
*
|
2001-01-03 10:29:33 +01:00
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
1999-12-29 15:20:26 +01:00
|
|
|
*
|
2001-01-03 10:29:33 +01:00
|
|
|
* $Id$
|
2002-09-03 13:52:59 +02:00
|
|
|
***************************************************************************/
|
1999-12-29 15:20:26 +01:00
|
|
|
|
2000-08-24 16:26:33 +02:00
|
|
|
#include "setup.h"
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
#include <string.h>
|
2000-08-23 09:23:42 +02:00
|
|
|
#include <errno.h>
|
1999-12-29 15:20:26 +01:00
|
|
|
|
2000-08-23 09:23:42 +02:00
|
|
|
#define _REENTRANT
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
#if defined(WIN32) && !defined(__GNUC__) || defined(__MINGW32__)
|
|
|
|
#include <winsock.h>
|
|
|
|
#else
|
|
|
|
#ifdef HAVE_SYS_TYPES_H
|
|
|
|
#include <sys/types.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_SYS_SOCKET_H
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#endif
|
2000-08-23 09:23:42 +02:00
|
|
|
#ifdef HAVE_NETINET_IN_H
|
1999-12-29 15:20:26 +01:00
|
|
|
#include <netinet/in.h>
|
2000-08-23 09:23:42 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_NETDB_H
|
1999-12-29 15:20:26 +01:00
|
|
|
#include <netdb.h>
|
2000-08-23 09:23:42 +02:00
|
|
|
#endif
|
1999-12-29 15:20:26 +01:00
|
|
|
#ifdef HAVE_ARPA_INET_H
|
|
|
|
#include <arpa/inet.h>
|
|
|
|
#endif
|
2001-12-04 14:03:08 +01:00
|
|
|
#ifdef HAVE_STDLIB_H
|
|
|
|
#include <stdlib.h> /* required for free() prototypes */
|
|
|
|
#endif
|
2001-08-06 14:19:26 +02:00
|
|
|
#ifdef VMS
|
2002-02-20 14:46:53 +01:00
|
|
|
#include <in.h>
|
2001-08-06 14:19:26 +02:00
|
|
|
#include <inet.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#endif
|
1999-12-29 15:20:26 +01:00
|
|
|
#endif
|
|
|
|
|
2002-06-11 17:10:18 +02:00
|
|
|
#ifdef HAVE_SETJMP_H
|
|
|
|
#include <setjmp.h>
|
|
|
|
#endif
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
#include "urldata.h"
|
|
|
|
#include "sendf.h"
|
2001-09-28 09:05:26 +02:00
|
|
|
#include "hostip.h"
|
2002-01-03 11:22:59 +01:00
|
|
|
#include "hash.h"
|
1999-12-29 15:20:26 +01:00
|
|
|
|
2002-01-17 09:03:48 +01:00
|
|
|
#define _MPRINTF_REPLACE /* use our functions only */
|
|
|
|
#include <curl/mprintf.h>
|
|
|
|
|
2000-08-24 14:33:16 +02:00
|
|
|
#if defined(HAVE_INET_NTOA_R) && !defined(HAVE_INET_NTOA_R_DECL)
|
2000-05-30 00:51:13 +02:00
|
|
|
#include "inet_ntoa_r.h"
|
|
|
|
#endif
|
|
|
|
|
2000-10-09 13:12:34 +02:00
|
|
|
/* The last #include file should be: */
|
|
|
|
#ifdef MALLOCDEBUG
|
|
|
|
#include "memdebug.h"
|
|
|
|
#endif
|
|
|
|
|
2002-01-03 11:22:59 +01:00
|
|
|
static curl_hash hostname_cache;
|
2002-01-07 21:52:32 +01:00
|
|
|
static int host_cache_initialized;
|
2002-01-03 11:22:59 +01:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
static Curl_addrinfo *my_getaddrinfo(struct SessionHandle *data,
|
|
|
|
char *hostname,
|
|
|
|
int port,
|
|
|
|
char **bufp);
|
|
|
|
|
2002-01-07 21:52:32 +01:00
|
|
|
void Curl_global_host_cache_init(void)
|
2002-01-03 11:22:59 +01:00
|
|
|
{
|
2002-01-07 21:52:32 +01:00
|
|
|
if (!host_cache_initialized) {
|
2002-11-26 10:41:54 +01:00
|
|
|
Curl_hash_init(&hostname_cache, 7, Curl_freednsinfo);
|
2002-01-07 21:52:32 +01:00
|
|
|
host_cache_initialized = 1;
|
|
|
|
}
|
2002-01-03 11:22:59 +01:00
|
|
|
}
|
|
|
|
|
2002-01-07 21:52:32 +01:00
|
|
|
curl_hash *Curl_global_host_cache_get(void)
|
2002-01-03 11:22:59 +01:00
|
|
|
{
|
2002-01-07 21:52:32 +01:00
|
|
|
return &hostname_cache;
|
2002-01-03 11:22:59 +01:00
|
|
|
}
|
|
|
|
|
2002-01-07 21:52:32 +01:00
|
|
|
void Curl_global_host_cache_dtor(void)
|
|
|
|
{
|
|
|
|
if (host_cache_initialized) {
|
2002-04-27 15:07:51 +02:00
|
|
|
Curl_hash_clean(&hostname_cache);
|
2002-01-07 21:55:35 +01:00
|
|
|
host_cache_initialized = 0;
|
2002-01-07 21:52:32 +01:00
|
|
|
}
|
|
|
|
}
|
2002-01-03 11:22:59 +01:00
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* count the number of characters that an integer takes up */
|
2002-01-17 07:55:37 +01:00
|
|
|
static int _num_chars(int i)
|
|
|
|
{
|
|
|
|
int chars = 0;
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* While the number divided by 10 is greater than one,
|
|
|
|
* re-divide the number by 10, and increment the number of
|
|
|
|
* characters by 1.
|
|
|
|
*
|
|
|
|
* this relies on the fact that for every multiple of 10,
|
|
|
|
* a new digit is added onto every number
|
|
|
|
*/
|
2002-01-17 07:55:37 +01:00
|
|
|
do {
|
|
|
|
chars++;
|
|
|
|
|
|
|
|
i = (int) i / 10;
|
2002-01-31 08:51:06 +01:00
|
|
|
} while (i >= 1);
|
2002-01-17 07:55:37 +01:00
|
|
|
|
|
|
|
return chars;
|
|
|
|
}
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* Create a hostcache id */
|
2002-01-17 07:55:37 +01:00
|
|
|
static char *
|
2002-11-05 11:51:41 +01:00
|
|
|
create_hostcache_id(char *server, int port, ssize_t *entry_len)
|
2002-01-17 07:55:37 +01:00
|
|
|
{
|
|
|
|
char *id = NULL;
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* Get the length of the new entry id */
|
|
|
|
*entry_len = *entry_len + /* Hostname length */
|
|
|
|
1 + /* The ':' seperator */
|
|
|
|
_num_chars(port); /* The number of characters the port will take up */
|
|
|
|
|
|
|
|
/* Allocate the new entry id */
|
|
|
|
id = malloc(*entry_len + 1);
|
2002-01-17 07:55:37 +01:00
|
|
|
if (!id) {
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* Create the new entry */
|
|
|
|
/* If sprintf() doesn't return the entry length, that signals failure */
|
|
|
|
if (sprintf(id, "%s:%d", server, port) != *entry_len) {
|
|
|
|
/* Free the allocated id, set length to zero and return NULL */
|
|
|
|
*entry_len = 0;
|
2002-01-17 07:55:37 +01:00
|
|
|
free(id);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return id;
|
|
|
|
}
|
|
|
|
|
2002-04-27 15:07:51 +02:00
|
|
|
struct hostcache_prune_data {
|
2002-04-17 22:13:55 +02:00
|
|
|
int cache_timeout;
|
|
|
|
int now;
|
|
|
|
};
|
|
|
|
|
|
|
|
static int
|
2002-11-05 11:51:41 +01:00
|
|
|
hostcache_timestamp_remove(void *datap, void *hc)
|
2002-04-17 22:13:55 +02:00
|
|
|
{
|
2002-04-27 15:07:51 +02:00
|
|
|
struct hostcache_prune_data *data =
|
|
|
|
(struct hostcache_prune_data *) datap;
|
2002-11-05 11:51:41 +01:00
|
|
|
struct Curl_dns_entry *c = (struct Curl_dns_entry *) hc;
|
2002-04-17 22:13:55 +02:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
if ((data->now - c->timestamp < data->cache_timeout) ||
|
|
|
|
c->inuse) {
|
|
|
|
/* please don't remove */
|
2002-04-17 22:13:55 +02:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
/* fine, remove */
|
2002-04-17 22:13:55 +02:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2002-04-27 15:07:51 +02:00
|
|
|
hostcache_prune(curl_hash *hostcache, int cache_timeout, int now)
|
2002-04-17 22:13:55 +02:00
|
|
|
{
|
2002-04-27 15:07:51 +02:00
|
|
|
struct hostcache_prune_data user;
|
2002-04-17 22:13:55 +02:00
|
|
|
|
|
|
|
user.cache_timeout = cache_timeout;
|
|
|
|
user.now = now;
|
|
|
|
|
2002-04-27 15:07:51 +02:00
|
|
|
Curl_hash_clean_with_criterium(hostcache,
|
2002-04-17 22:13:55 +02:00
|
|
|
(void *) &user,
|
2002-11-05 11:51:41 +01:00
|
|
|
hostcache_timestamp_remove);
|
2002-04-17 22:13:55 +02:00
|
|
|
}
|
|
|
|
|
2002-11-11 23:51:09 +01:00
|
|
|
#if defined(MALLOCDEBUG) && defined(AGGRESIVE_TEST)
|
2002-11-05 11:51:41 +01:00
|
|
|
/* Called from Curl_done() to check that there's no DNS cache entry with
|
|
|
|
a non-zero counter left. */
|
|
|
|
void Curl_scan_cache_used(void *user, void *ptr)
|
|
|
|
{
|
|
|
|
struct Curl_dns_entry *e = ptr;
|
|
|
|
(void)user; /* prevent compiler warning */
|
|
|
|
if(e->inuse) {
|
|
|
|
fprintf(stderr, "*** WARNING: locked DNS cache entry detected: %s\n",
|
|
|
|
e->entry_id);
|
|
|
|
/* perform a segmentation fault to draw attention */
|
|
|
|
*(void **)0 = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* Macro to save redundant free'ing of entry_id */
|
2002-11-05 11:51:41 +01:00
|
|
|
#define HOSTCACHE_RETURN(dns) \
|
2002-01-17 08:38:25 +01:00
|
|
|
{ \
|
|
|
|
free(entry_id); \
|
2002-11-05 11:51:41 +01:00
|
|
|
return dns; \
|
2002-01-17 08:38:25 +01:00
|
|
|
}
|
2002-01-17 07:55:37 +01:00
|
|
|
|
2002-06-11 17:10:18 +02:00
|
|
|
#ifdef HAVE_SIGSETJMP
|
|
|
|
/* Beware this is a global and unique instance */
|
|
|
|
sigjmp_buf curl_jmpenv;
|
|
|
|
#endif
|
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
struct Curl_dns_entry *Curl_resolv(struct SessionHandle *data,
|
|
|
|
char *hostname,
|
|
|
|
int port)
|
2002-01-03 11:22:59 +01:00
|
|
|
{
|
2002-01-17 08:38:25 +01:00
|
|
|
char *entry_id = NULL;
|
2002-11-05 11:51:41 +01:00
|
|
|
struct Curl_dns_entry *dns = NULL;
|
2002-01-17 09:03:48 +01:00
|
|
|
ssize_t entry_len;
|
2002-01-08 05:26:47 +01:00
|
|
|
time_t now;
|
2002-04-25 21:00:57 +02:00
|
|
|
char *bufp;
|
2002-01-08 05:26:47 +01:00
|
|
|
|
2002-06-11 17:10:18 +02:00
|
|
|
#ifdef HAVE_SIGSETJMP
|
2002-11-05 11:51:41 +01:00
|
|
|
/* this allows us to time-out from the name resolver, as the timeout
|
|
|
|
will generate a signal and we will siglongjmp() from that here */
|
|
|
|
if(!data->set.no_signal && sigsetjmp(curl_jmpenv, 1)) {
|
2002-06-11 17:10:18 +02:00
|
|
|
/* this is coming from a siglongjmp() */
|
|
|
|
failf(data, "name lookup time-outed");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2002-01-17 08:38:25 +01:00
|
|
|
/* Create an entry id, based upon the hostname and port */
|
|
|
|
entry_len = strlen(hostname);
|
2002-11-05 11:51:41 +01:00
|
|
|
entry_id = create_hostcache_id(hostname, port, &entry_len);
|
|
|
|
/* If we can't create the entry id, fail */
|
|
|
|
if (!entry_id)
|
|
|
|
return NULL;
|
2002-01-17 07:55:37 +01:00
|
|
|
|
2002-01-08 05:26:47 +01:00
|
|
|
/* See if its already in our dns cache */
|
2002-11-05 11:51:41 +01:00
|
|
|
dns = Curl_hash_pick(data->hostcache, entry_id, entry_len+1);
|
2002-01-08 05:26:47 +01:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
if (!dns) {
|
|
|
|
Curl_addrinfo *addr = my_getaddrinfo(data, hostname, port, &bufp);
|
|
|
|
|
|
|
|
if (!addr) {
|
|
|
|
HOSTCACHE_RETURN(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a new cache entry */
|
|
|
|
dns = (struct Curl_dns_entry *) malloc(sizeof(struct Curl_dns_entry));
|
|
|
|
if (!dns) {
|
|
|
|
Curl_freeaddrinfo(addr);
|
|
|
|
HOSTCACHE_RETURN(NULL);
|
|
|
|
}
|
|
|
|
|
|
|
|
dns->inuse = 0;
|
|
|
|
dns->addr = addr;
|
|
|
|
/* Save it in our host cache */
|
|
|
|
Curl_hash_add(data->hostcache, entry_id, entry_len+1, (const void *) dns);
|
2002-01-17 08:38:25 +01:00
|
|
|
}
|
2002-11-05 11:51:41 +01:00
|
|
|
time(&now);
|
2002-01-08 05:26:47 +01:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
dns->timestamp = now;
|
|
|
|
dns->inuse++; /* mark entry as in-use */
|
|
|
|
#ifdef MALLOCDEBUG
|
|
|
|
dns->entry_id = entry_id;
|
|
|
|
#endif
|
2002-01-08 05:26:47 +01:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
/* Remove outdated and unused entries from the hostcache */
|
|
|
|
hostcache_prune(data->hostcache,
|
|
|
|
data->set.dns_cache_timeout,
|
|
|
|
now);
|
2002-01-03 11:22:59 +01:00
|
|
|
|
2002-11-05 11:51:41 +01:00
|
|
|
HOSTCACHE_RETURN(dns);
|
2002-01-03 11:22:59 +01:00
|
|
|
}
|
|
|
|
|
2001-10-04 15:36:11 +02:00
|
|
|
/*
|
|
|
|
* This is a wrapper function for freeing name information in a protocol
|
|
|
|
* independent way. This takes care of using the appropriate underlaying
|
2002-11-26 10:41:54 +01:00
|
|
|
* function.
|
2001-10-04 15:36:11 +02:00
|
|
|
*/
|
2002-11-26 10:41:54 +01:00
|
|
|
void Curl_freeaddrinfo(Curl_addrinfo *p)
|
2001-10-04 15:36:11 +02:00
|
|
|
{
|
|
|
|
#ifdef ENABLE_IPV6
|
2002-11-26 10:41:54 +01:00
|
|
|
freeaddrinfo(p);
|
2001-10-04 15:36:11 +02:00
|
|
|
#else
|
2002-11-26 10:41:54 +01:00
|
|
|
free(p);
|
2001-10-04 15:36:11 +02:00
|
|
|
#endif
|
2002-11-26 10:41:54 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Free a cache dns entry.
|
|
|
|
*/
|
|
|
|
void Curl_freednsinfo(void *freethis)
|
|
|
|
{
|
|
|
|
struct Curl_dns_entry *p = (struct Curl_dns_entry *) freethis;
|
|
|
|
|
|
|
|
Curl_freeaddrinfo(p->addr);
|
2002-01-08 05:26:47 +01:00
|
|
|
|
|
|
|
free(p);
|
2001-10-04 15:36:11 +02:00
|
|
|
}
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
/* --- resolve name or IP-number --- */
|
|
|
|
|
2001-02-06 00:04:44 +01:00
|
|
|
#ifdef ENABLE_IPV6
|
2001-10-04 15:25:12 +02:00
|
|
|
|
|
|
|
#ifdef MALLOCDEBUG
|
|
|
|
/* These two are strictly for memory tracing and are using the same
|
|
|
|
* style as the family otherwise present in memdebug.c. I put these ones
|
|
|
|
* here since they require a bunch of struct types I didn't wanna include
|
|
|
|
* in memdebug.c
|
|
|
|
*/
|
|
|
|
int curl_getaddrinfo(char *hostname, char *service,
|
|
|
|
struct addrinfo *hints,
|
|
|
|
struct addrinfo **result,
|
|
|
|
int line, const char *source)
|
|
|
|
{
|
|
|
|
int res=(getaddrinfo)(hostname, service, hints, result);
|
2001-10-17 14:33:35 +02:00
|
|
|
if(0 == res) {
|
2001-10-04 15:25:12 +02:00
|
|
|
/* success */
|
2001-10-17 14:33:35 +02:00
|
|
|
if(logfile)
|
|
|
|
fprintf(logfile, "ADDR %s:%d getaddrinfo() = %p\n",
|
2002-01-08 08:06:07 +01:00
|
|
|
source, line, (void *)*result);
|
2001-10-17 14:33:35 +02:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
if(logfile)
|
|
|
|
fprintf(logfile, "ADDR %s:%d getaddrinfo() failed\n",
|
|
|
|
source, line);
|
|
|
|
}
|
2001-10-04 15:25:12 +02:00
|
|
|
return res;
|
|
|
|
}
|
2001-10-17 14:33:35 +02:00
|
|
|
|
2001-10-04 15:25:12 +02:00
|
|
|
void curl_freeaddrinfo(struct addrinfo *freethis,
|
|
|
|
int line, const char *source)
|
|
|
|
{
|
|
|
|
(freeaddrinfo)(freethis);
|
2001-10-17 14:33:35 +02:00
|
|
|
if(logfile)
|
|
|
|
fprintf(logfile, "ADDR %s:%d freeaddrinfo(%p)\n",
|
2002-01-08 08:06:07 +01:00
|
|
|
source, line, (void *)freethis);
|
2001-10-04 15:25:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return name information about the given hostname and port number. If
|
|
|
|
* successful, the 'addrinfo' is returned and the forth argument will point to
|
|
|
|
* memory we need to free after use. That meory *MUST* be freed with
|
|
|
|
* Curl_freeaddrinfo(), nothing else.
|
|
|
|
*/
|
2002-11-05 11:51:41 +01:00
|
|
|
static Curl_addrinfo *my_getaddrinfo(struct SessionHandle *data,
|
|
|
|
char *hostname,
|
|
|
|
int port,
|
|
|
|
char **bufp)
|
2001-02-06 00:04:44 +01:00
|
|
|
{
|
|
|
|
struct addrinfo hints, *res;
|
|
|
|
int error;
|
|
|
|
char sbuf[NI_MAXSERV];
|
2002-03-15 10:54:30 +01:00
|
|
|
int s, pf = PF_UNSPEC;
|
|
|
|
|
|
|
|
/* see if we have an IPv6 stack */
|
|
|
|
s = socket(PF_INET6, SOCK_DGRAM, 0);
|
|
|
|
if (s < 0)
|
|
|
|
/* Some non-IPv6 stacks have been found to make very slow name resolves
|
|
|
|
* when PF_UNSPEC is used, so thus we switch to a mere PF_INET lookup if
|
|
|
|
* the stack seems to be a non-ipv6 one. */
|
|
|
|
pf = PF_INET;
|
|
|
|
else
|
|
|
|
/* This seems to be an IPv6-capable stack, use PF_UNSPEC for the widest
|
|
|
|
* possible checks. And close the socket again.
|
|
|
|
*/
|
2002-04-23 01:53:49 +02:00
|
|
|
sclose(s);
|
2002-03-15 10:54:30 +01:00
|
|
|
|
2001-02-06 00:04:44 +01:00
|
|
|
memset(&hints, 0, sizeof(hints));
|
2002-03-15 10:54:30 +01:00
|
|
|
hints.ai_family = pf;
|
2001-02-06 00:04:44 +01:00
|
|
|
hints.ai_socktype = SOCK_STREAM;
|
|
|
|
hints.ai_flags = AI_CANONNAME;
|
|
|
|
snprintf(sbuf, sizeof(sbuf), "%d", port);
|
|
|
|
error = getaddrinfo(hostname, sbuf, &hints, &res);
|
|
|
|
if (error) {
|
2002-06-10 15:26:02 +02:00
|
|
|
infof(data, "getaddrinfo(3) failed for %s:%d\n", hostname, port);
|
2001-02-06 00:04:44 +01:00
|
|
|
return NULL;
|
|
|
|
}
|
2001-10-04 15:25:12 +02:00
|
|
|
*bufp=(char *)res; /* make it point to the result struct */
|
|
|
|
|
2001-02-06 00:04:44 +01:00
|
|
|
return res;
|
|
|
|
}
|
2001-09-28 09:05:26 +02:00
|
|
|
#else /* following code is IPv4-only */
|
2001-02-06 00:04:44 +01:00
|
|
|
|
2001-10-04 15:36:11 +02:00
|
|
|
#ifndef HAVE_GETHOSTBYNAME_R
|
2002-05-17 09:49:28 +02:00
|
|
|
static void hostcache_fixoffset(struct hostent *h, int offset);
|
2001-10-03 23:42:04 +02:00
|
|
|
/**
|
2001-10-23 14:11:43 +02:00
|
|
|
* Performs a "deep" copy of a hostent into a buffer (returns a pointer to the
|
|
|
|
* copy). Make absolutely sure the destination buffer is big enough!
|
2001-10-03 23:42:04 +02:00
|
|
|
*
|
|
|
|
* Keith McGuigan
|
2001-10-23 14:11:43 +02:00
|
|
|
* 10/3/2001 */
|
2002-04-22 15:31:16 +02:00
|
|
|
static struct hostent* pack_hostent(char** buf, struct hostent* orig)
|
2001-10-03 23:42:04 +02:00
|
|
|
{
|
2002-05-17 09:49:28 +02:00
|
|
|
char *bufptr;
|
|
|
|
char *newbuf;
|
2001-10-03 23:42:04 +02:00
|
|
|
struct hostent* copy;
|
|
|
|
|
|
|
|
int i;
|
2002-05-17 09:49:28 +02:00
|
|
|
char *str;
|
2001-10-03 23:42:04 +02:00
|
|
|
int len;
|
|
|
|
|
2002-04-22 15:31:16 +02:00
|
|
|
bufptr = *buf;
|
2001-10-03 23:42:04 +02:00
|
|
|
copy = (struct hostent*)bufptr;
|
|
|
|
|
|
|
|
bufptr += sizeof(struct hostent);
|
|
|
|
copy->h_name = bufptr;
|
|
|
|
len = strlen(orig->h_name) + 1;
|
|
|
|
strncpy(bufptr, orig->h_name, len);
|
|
|
|
bufptr += len;
|
|
|
|
|
2001-10-23 14:11:43 +02:00
|
|
|
/* we align on even 64bit boundaries for safety */
|
2002-04-19 13:00:26 +02:00
|
|
|
#define MEMALIGN(x) ((x)+(8-(((unsigned long)(x))&0x7)))
|
2001-10-23 14:11:43 +02:00
|
|
|
|
|
|
|
/* This must be aligned properly to work on many CPU architectures! */
|
2002-04-19 13:00:26 +02:00
|
|
|
bufptr = MEMALIGN(bufptr);
|
|
|
|
|
|
|
|
copy->h_aliases = (char**)bufptr;
|
2001-10-03 23:42:04 +02:00
|
|
|
|
|
|
|
/* Figure out how many aliases there are */
|
|
|
|
for (i = 0; orig->h_aliases[i] != NULL; ++i);
|
|
|
|
|
|
|
|
/* Reserve room for the array */
|
|
|
|
bufptr += (i + 1) * sizeof(char*);
|
|
|
|
|
2001-10-23 14:11:43 +02:00
|
|
|
/* Clone all known aliases */
|
|
|
|
for(i = 0; (str = orig->h_aliases[i]); i++) {
|
2001-10-03 23:42:04 +02:00
|
|
|
len = strlen(str) + 1;
|
|
|
|
strncpy(bufptr, str, len);
|
|
|
|
copy->h_aliases[i] = bufptr;
|
|
|
|
bufptr += len;
|
|
|
|
}
|
2001-10-23 14:11:43 +02:00
|
|
|
/* Terminate the alias list with a NULL */
|
2001-10-03 23:42:04 +02:00
|
|
|
copy->h_aliases[i] = NULL;
|
|
|
|
|
|
|
|
copy->h_addrtype = orig->h_addrtype;
|
|
|
|
copy->h_length = orig->h_length;
|
|
|
|
|
2001-10-23 14:11:43 +02:00
|
|
|
/* align it for (at least) 32bit accesses */
|
2002-04-19 13:00:26 +02:00
|
|
|
bufptr = MEMALIGN(bufptr);
|
2001-10-23 14:11:43 +02:00
|
|
|
|
2001-10-03 23:42:04 +02:00
|
|
|
copy->h_addr_list = (char**)bufptr;
|
|
|
|
|
|
|
|
/* Figure out how many addresses there are */
|
|
|
|
for (i = 0; orig->h_addr_list[i] != NULL; ++i);
|
|
|
|
|
|
|
|
/* Reserve room for the array */
|
|
|
|
bufptr += (i + 1) * sizeof(char*);
|
|
|
|
|
|
|
|
i = 0;
|
|
|
|
len = orig->h_length;
|
|
|
|
str = orig->h_addr_list[i];
|
|
|
|
while (str != NULL) {
|
|
|
|
memcpy(bufptr, str, len);
|
|
|
|
copy->h_addr_list[i] = bufptr;
|
|
|
|
bufptr += len;
|
|
|
|
str = orig->h_addr_list[++i];
|
|
|
|
}
|
|
|
|
copy->h_addr_list[i] = NULL;
|
|
|
|
|
2002-05-17 09:49:28 +02:00
|
|
|
/* now, shrink the allocated buffer to the size we actually need, which
|
|
|
|
most often is only a fraction of the original alloc */
|
|
|
|
newbuf=(char *)realloc(*buf, (int)bufptr-(int)(*buf));
|
|
|
|
|
|
|
|
/* if the alloc moved, we need to adjust things again */
|
|
|
|
if(newbuf != *buf)
|
|
|
|
hostcache_fixoffset((struct hostent*)newbuf, (int)newbuf-(int)*buf);
|
|
|
|
|
|
|
|
/* setup the return */
|
|
|
|
*buf = newbuf;
|
|
|
|
copy = (struct hostent*)newbuf;
|
|
|
|
|
2001-10-03 23:42:04 +02:00
|
|
|
return copy;
|
|
|
|
}
|
2001-10-04 15:36:11 +02:00
|
|
|
#endif
|
2001-10-03 23:42:04 +02:00
|
|
|
|
2001-09-28 09:46:39 +02:00
|
|
|
static char *MakeIP(unsigned long num,char *addr, int addr_len)
|
|
|
|
{
|
|
|
|
#if defined(HAVE_INET_NTOA) || defined(HAVE_INET_NTOA_R)
|
|
|
|
struct in_addr in;
|
|
|
|
in.s_addr = htonl(num);
|
|
|
|
|
|
|
|
#if defined(HAVE_INET_NTOA_R)
|
|
|
|
inet_ntoa_r(in,addr,addr_len);
|
|
|
|
#else
|
|
|
|
strncpy(addr,inet_ntoa(in),addr_len);
|
|
|
|
#endif
|
|
|
|
#else
|
|
|
|
unsigned char *paddr;
|
|
|
|
|
|
|
|
num = htonl(num); /* htonl() added to avoid endian probs */
|
|
|
|
paddr = (unsigned char *)#
|
|
|
|
sprintf(addr, "%u.%u.%u.%u", paddr[0], paddr[1], paddr[2], paddr[3]);
|
|
|
|
#endif
|
|
|
|
return (addr);
|
|
|
|
}
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
#ifndef INADDR_NONE
|
2002-02-18 23:59:26 +01:00
|
|
|
#define INADDR_NONE (in_addr_t) ~0
|
1999-12-29 15:20:26 +01:00
|
|
|
#endif
|
2001-01-05 11:11:41 +01:00
|
|
|
|
2002-05-01 13:36:13 +02:00
|
|
|
static void hostcache_fixoffset(struct hostent *h, int offset)
|
|
|
|
{
|
|
|
|
int i=0;
|
2002-06-05 15:41:33 +02:00
|
|
|
h->h_name=(char *)((long)h->h_name+offset);
|
|
|
|
h->h_aliases=(char **)((long)h->h_aliases+offset);
|
2002-05-01 13:36:13 +02:00
|
|
|
while(h->h_aliases[i]) {
|
2002-06-05 15:41:33 +02:00
|
|
|
h->h_aliases[i]=(char *)((long)h->h_aliases[i]+offset);
|
2002-05-01 13:36:13 +02:00
|
|
|
i++;
|
|
|
|
}
|
2002-06-05 15:41:33 +02:00
|
|
|
h->h_addr_list=(char **)((long)h->h_addr_list+offset);
|
2002-05-01 13:36:13 +02:00
|
|
|
i=0;
|
|
|
|
while(h->h_addr_list[i]) {
|
2002-06-05 15:41:33 +02:00
|
|
|
h->h_addr_list[i]=(char *)((long)h->h_addr_list[i]+offset);
|
2002-05-01 13:36:13 +02:00
|
|
|
i++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The original code to this function was once stolen from the Dancer source
|
|
|
|
code, written by Bjorn Reese, it has since been patched and modified
|
|
|
|
considerably. */
|
2002-11-05 11:51:41 +01:00
|
|
|
static Curl_addrinfo *my_getaddrinfo(struct SessionHandle *data,
|
|
|
|
char *hostname,
|
|
|
|
int port,
|
|
|
|
char **bufp)
|
1999-12-29 15:20:26 +01:00
|
|
|
{
|
|
|
|
struct hostent *h = NULL;
|
2002-01-02 11:06:47 +01:00
|
|
|
in_addr_t in;
|
2000-11-21 10:29:21 +01:00
|
|
|
int ret; /* this variable is unused on several platforms but used on some */
|
1999-12-29 15:20:26 +01:00
|
|
|
|
2000-09-21 10:47:48 +02:00
|
|
|
#define CURL_NAMELOOKUP_SIZE 9000
|
|
|
|
/* Allocate enough memory to hold the full name information structs and
|
|
|
|
* everything. OSF1 is known to require at least 8872 bytes. The buffer
|
|
|
|
* required for storing all possible aliases and IP numbers is according to
|
|
|
|
* Stevens' Unix Network Programming 2nd editor, p. 304: 8192 bytes! */
|
2001-09-28 09:05:26 +02:00
|
|
|
port=0; /* unused in IPv4 code */
|
2001-05-30 13:06:33 +02:00
|
|
|
ret = 0; /* to prevent the compiler warning */
|
|
|
|
|
1999-12-29 15:20:26 +01:00
|
|
|
if ( (in=inet_addr(hostname)) != INADDR_NONE ) {
|
2000-05-30 00:51:13 +02:00
|
|
|
struct in_addr *addrentry;
|
2002-06-26 10:03:46 +02:00
|
|
|
struct namebuf {
|
|
|
|
struct hostent hostentry;
|
|
|
|
char *h_addr_list[2];
|
|
|
|
struct in_addr addrentry;
|
2002-06-26 17:39:23 +02:00
|
|
|
char h_name[128];
|
|
|
|
} *buf = (struct namebuf *)malloc(sizeof(struct namebuf));
|
2002-04-22 15:31:16 +02:00
|
|
|
if(!buf)
|
|
|
|
return NULL; /* major failure */
|
|
|
|
*bufp = (char *)buf;
|
2000-05-30 00:51:13 +02:00
|
|
|
|
2002-06-26 10:03:46 +02:00
|
|
|
h = &buf->hostentry;
|
|
|
|
h->h_addr_list = &buf->h_addr_list[0];
|
|
|
|
addrentry = &buf->addrentry;
|
2000-05-30 00:51:13 +02:00
|
|
|
addrentry->s_addr = in;
|
|
|
|
h->h_addr_list[0] = (char*)addrentry;
|
|
|
|
h->h_addr_list[1] = NULL;
|
|
|
|
h->h_addrtype = AF_INET;
|
|
|
|
h->h_length = sizeof(*addrentry);
|
2002-06-26 10:03:46 +02:00
|
|
|
h->h_name = &buf->h_name[0];
|
2002-06-26 17:39:23 +02:00
|
|
|
MakeIP(ntohl(in), h->h_name, sizeof(buf->h_name));
|
2000-05-30 00:51:13 +02:00
|
|
|
}
|
2000-08-04 13:27:17 +02:00
|
|
|
#if defined(HAVE_GETHOSTBYNAME_R)
|
2000-05-30 00:51:13 +02:00
|
|
|
else {
|
|
|
|
int h_errnop;
|
2002-04-22 15:31:16 +02:00
|
|
|
int res=ERANGE;
|
|
|
|
int step_size=200;
|
|
|
|
int *buf = (int *)malloc(CURL_NAMELOOKUP_SIZE);
|
|
|
|
if(!buf)
|
|
|
|
return NULL; /* major failure */
|
|
|
|
*bufp=(char *)buf;
|
|
|
|
|
2000-09-21 10:47:48 +02:00
|
|
|
/* Workaround for gethostbyname_r bug in qnx nto. It is also _required_
|
|
|
|
for some of these functions. */
|
|
|
|
memset(buf, 0, CURL_NAMELOOKUP_SIZE);
|
2000-08-04 13:27:17 +02:00
|
|
|
#ifdef HAVE_GETHOSTBYNAME_R_5
|
2000-05-31 00:27:39 +02:00
|
|
|
/* Solaris, IRIX and more */
|
2002-08-30 13:10:50 +02:00
|
|
|
(void)res; /* prevent compiler warning */
|
2002-04-22 15:31:16 +02:00
|
|
|
while(!h) {
|
|
|
|
h = gethostbyname_r(hostname,
|
|
|
|
(struct hostent *)buf,
|
|
|
|
(char *)buf + sizeof(struct hostent),
|
|
|
|
step_size - sizeof(struct hostent),
|
|
|
|
&h_errnop);
|
|
|
|
|
|
|
|
/* If the buffer is too small, it returns NULL and sets errno to
|
|
|
|
ERANGE. The errno is thread safe if this is compiled with
|
|
|
|
-D_REENTRANT as then the 'errno' variable is a macro defined to
|
|
|
|
get used properly for threads. */
|
|
|
|
|
|
|
|
if(h || (errno != ERANGE))
|
|
|
|
break;
|
|
|
|
|
|
|
|
step_size+=200;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef MALLOCDEBUG
|
|
|
|
infof(data, "gethostbyname_r() uses %d bytes\n", step_size);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if(h) {
|
2002-05-01 13:36:13 +02:00
|
|
|
int offset;
|
|
|
|
h=(struct hostent *)realloc(buf, step_size);
|
2002-06-05 15:41:33 +02:00
|
|
|
offset=(long)h-(long)buf;
|
2002-05-01 13:36:13 +02:00
|
|
|
hostcache_fixoffset(h, offset);
|
|
|
|
buf=(int *)h;
|
2002-04-22 15:31:16 +02:00
|
|
|
*bufp=(char *)buf;
|
|
|
|
}
|
|
|
|
else
|
2000-08-04 13:27:17 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_GETHOSTBYNAME_R_6
|
|
|
|
/* Linux */
|
2002-10-21 15:20:30 +02:00
|
|
|
do {
|
|
|
|
res=gethostbyname_r(hostname,
|
|
|
|
(struct hostent *)buf,
|
|
|
|
(char *)buf + sizeof(struct hostent),
|
|
|
|
step_size - sizeof(struct hostent),
|
|
|
|
&h, /* DIFFERENCE */
|
|
|
|
&h_errnop);
|
|
|
|
/* Redhat 8, using glibc 2.2.93 changed the behavior. Now all of a
|
|
|
|
sudden this function seems to be setting EAGAIN if the given buffer
|
|
|
|
size is too small. Previous versions are known to return ERANGE for
|
|
|
|
the same. */
|
|
|
|
|
|
|
|
if((ERANGE == res) || (EAGAIN == res)) {
|
|
|
|
step_size+=200;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
} while(1);
|
|
|
|
|
2002-09-30 10:07:16 +02:00
|
|
|
if(!h) /* failure */
|
|
|
|
res=1;
|
2002-04-22 15:31:16 +02:00
|
|
|
|
|
|
|
#ifdef MALLOCDEBUG
|
|
|
|
infof(data, "gethostbyname_r() uses %d bytes\n", step_size);
|
|
|
|
#endif
|
|
|
|
if(!res) {
|
2002-05-01 13:36:13 +02:00
|
|
|
int offset;
|
|
|
|
h=(struct hostent *)realloc(buf, step_size);
|
2002-06-05 15:41:33 +02:00
|
|
|
offset=(long)h-(long)buf;
|
2002-05-01 13:36:13 +02:00
|
|
|
hostcache_fixoffset(h, offset);
|
|
|
|
buf=(int *)h;
|
2002-04-22 15:31:16 +02:00
|
|
|
*bufp=(char *)buf;
|
|
|
|
}
|
|
|
|
else
|
2000-08-04 13:27:17 +02:00
|
|
|
#endif
|
|
|
|
#ifdef HAVE_GETHOSTBYNAME_R_3
|
2000-08-17 23:07:22 +02:00
|
|
|
/* AIX, Digital Unix, HPUX 10, more? */
|
2000-08-04 13:27:17 +02:00
|
|
|
|
2000-09-21 10:47:48 +02:00
|
|
|
if(CURL_NAMELOOKUP_SIZE >=
|
|
|
|
(sizeof(struct hostent)+sizeof(struct hostent_data)))
|
2000-08-04 13:27:17 +02:00
|
|
|
|
2000-09-21 10:47:48 +02:00
|
|
|
/* August 22nd, 2000: Albert Chin-A-Young brought an updated version
|
|
|
|
* that should work! September 20: Richard Prescott worked on the buffer
|
|
|
|
* size dilemma. */
|
2000-08-23 09:23:42 +02:00
|
|
|
|
2000-09-21 10:47:48 +02:00
|
|
|
ret = gethostbyname_r(hostname,
|
2002-04-22 15:31:16 +02:00
|
|
|
(struct hostent *)buf,
|
2002-08-09 00:44:43 +02:00
|
|
|
(struct hostent_data *)((char *)buf + sizeof(struct hostent)));
|
2000-09-21 10:47:48 +02:00
|
|
|
else
|
|
|
|
ret = -1; /* failure, too smallish buffer size */
|
|
|
|
|
2000-08-23 09:23:42 +02:00
|
|
|
/* result expected in h */
|
|
|
|
h = (struct hostent*)buf;
|
2000-08-17 23:07:22 +02:00
|
|
|
h_errnop= errno; /* we don't deal with this, but set it anyway */
|
2000-08-23 09:23:42 +02:00
|
|
|
if(ret)
|
2000-05-31 00:27:39 +02:00
|
|
|
#endif
|
|
|
|
{
|
2000-05-30 00:51:13 +02:00
|
|
|
infof(data, "gethostbyname_r(2) failed for %s\n", hostname);
|
2000-09-18 23:16:27 +02:00
|
|
|
h = NULL; /* set return code to NULL */
|
2000-09-21 10:47:48 +02:00
|
|
|
free(buf);
|
2000-11-21 16:35:45 +01:00
|
|
|
*bufp=NULL;
|
2000-05-30 00:51:13 +02:00
|
|
|
}
|
|
|
|
#else
|
|
|
|
else {
|
|
|
|
if ((h = gethostbyname(hostname)) == NULL ) {
|
|
|
|
infof(data, "gethostbyname(2) failed for %s\n", hostname);
|
2001-09-12 10:59:00 +02:00
|
|
|
*bufp=NULL;
|
2000-05-30 00:51:13 +02:00
|
|
|
}
|
2001-10-03 23:42:04 +02:00
|
|
|
else
|
2002-04-22 15:31:16 +02:00
|
|
|
{
|
|
|
|
char *buf=(char *)malloc(CURL_NAMELOOKUP_SIZE);
|
2001-10-03 23:42:04 +02:00
|
|
|
/* we make a copy of the hostent right now, right here, as the
|
|
|
|
static one we got a pointer to might get removed when we don't
|
|
|
|
want/expect that */
|
2002-04-22 15:31:16 +02:00
|
|
|
h = pack_hostent(&buf, h);
|
|
|
|
*bufp=(char *)buf;
|
|
|
|
}
|
2000-05-30 00:51:13 +02:00
|
|
|
#endif
|
1999-12-29 15:20:26 +01:00
|
|
|
}
|
|
|
|
return (h);
|
|
|
|
}
|
2001-09-07 06:01:32 +02:00
|
|
|
|
2001-09-28 09:05:26 +02:00
|
|
|
#endif /* end of IPv4-specific code */
|
|
|
|
|
2001-09-07 06:01:32 +02:00
|
|
|
/*
|
|
|
|
* local variables:
|
|
|
|
* eval: (load-file "../curl-mode.el")
|
|
|
|
* end:
|
2001-10-11 11:32:19 +02:00
|
|
|
* vim600: fdm=marker
|
|
|
|
* vim: et sw=2 ts=2 sts=2 tw=78
|
2001-09-07 06:01:32 +02:00
|
|
|
*/
|
2002-01-07 21:52:32 +01:00
|
|
|
|