1999-12-02 02:42:23 -05:00
|
|
|
|
/* File retrieval.
|
2001-02-10 19:00:30 -05:00
|
|
|
|
Copyright (C) 1995, 1996, 1997, 1998, 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>
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
|
# include <unistd.h>
|
|
|
|
|
#endif /* HAVE_UNISTD_H */
|
|
|
|
|
#include <errno.h>
|
|
|
|
|
#ifdef HAVE_STRING_H
|
|
|
|
|
# include <string.h>
|
|
|
|
|
#else
|
|
|
|
|
# include <strings.h>
|
|
|
|
|
#endif /* HAVE_STRING_H */
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
|
|
#include "wget.h"
|
|
|
|
|
#include "utils.h"
|
|
|
|
|
#include "retr.h"
|
2001-11-22 23:59:52 -05:00
|
|
|
|
#include "progress.h"
|
1999-12-02 02:42:23 -05:00
|
|
|
|
#include "url.h"
|
|
|
|
|
#include "recur.h"
|
|
|
|
|
#include "ftp.h"
|
|
|
|
|
#include "host.h"
|
|
|
|
|
#include "connect.h"
|
2000-11-19 15:50:10 -05:00
|
|
|
|
#include "hash.h"
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-11-29 13:22:18 -05:00
|
|
|
|
#ifdef HAVE_SSL
|
|
|
|
|
# include "gen_sslfunc.h" /* for ssl_iread */
|
|
|
|
|
#endif
|
|
|
|
|
|
2000-12-17 13:12:02 -05:00
|
|
|
|
#ifndef errno
|
|
|
|
|
extern int errno;
|
|
|
|
|
#endif
|
|
|
|
|
|
2001-04-01 19:50:04 -04:00
|
|
|
|
/* See the comment in gethttp() why this is needed. */
|
|
|
|
|
int global_download_count;
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-11-26 15:07:13 -05:00
|
|
|
|
static struct {
|
|
|
|
|
long bytes;
|
|
|
|
|
long dltime;
|
|
|
|
|
} limit_data;
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
limit_bandwidth_reset (void)
|
|
|
|
|
{
|
|
|
|
|
limit_data.bytes = 0;
|
|
|
|
|
limit_data.dltime = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Limit the bandwidth by pausing the download for an amount of time.
|
|
|
|
|
BYTES is the number of bytes received from the network, DELTA is
|
|
|
|
|
how long it took to receive them, DLTIME the current download time,
|
|
|
|
|
TIMER the timer, and ADJUSTMENT the previous. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
limit_bandwidth (long bytes, long delta)
|
|
|
|
|
{
|
|
|
|
|
long expected;
|
|
|
|
|
|
|
|
|
|
limit_data.bytes += bytes;
|
|
|
|
|
limit_data.dltime += delta;
|
|
|
|
|
|
|
|
|
|
expected = (long)(1000.0 * limit_data.bytes / opt.limit_rate);
|
|
|
|
|
|
|
|
|
|
if (expected > limit_data.dltime)
|
|
|
|
|
{
|
|
|
|
|
long slp = expected - limit_data.dltime;
|
|
|
|
|
if (slp < 200)
|
|
|
|
|
{
|
|
|
|
|
DEBUGP (("deferring a %ld ms sleep (%ld/%ld) until later.\n",
|
|
|
|
|
slp, limit_data.bytes, limit_data.dltime));
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
DEBUGP (("sleeping %ld ms\n", slp));
|
|
|
|
|
usleep (1000 * slp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
limit_data.bytes = 0;
|
|
|
|
|
limit_data.dltime = 0;
|
|
|
|
|
}
|
|
|
|
|
|
2000-11-19 15:50:10 -05:00
|
|
|
|
#define MIN(i, j) ((i) <= (j) ? (i) : (j))
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* Reads the contents of file descriptor FD, until it is closed, or a
|
|
|
|
|
read error occurs. The data is read in 8K chunks, and stored to
|
|
|
|
|
stream fp, which should have been open for writing. If BUF is
|
|
|
|
|
non-NULL and its file descriptor is equal to FD, flush RBUF first.
|
|
|
|
|
This function will *not* use the rbuf_* functions!
|
|
|
|
|
|
|
|
|
|
The EXPECTED argument is passed to show_progress() unchanged, but
|
|
|
|
|
otherwise ignored.
|
|
|
|
|
|
|
|
|
|
If opt.verbose is set, the progress is also shown. RESTVAL
|
|
|
|
|
represents a value from which to start downloading (which will be
|
|
|
|
|
shown accordingly). If RESTVAL is non-zero, the stream should have
|
|
|
|
|
been open for appending.
|
|
|
|
|
|
|
|
|
|
The function exits and returns codes of 0, -1 and -2 if the
|
|
|
|
|
connection was closed, there was a read error, or if it could not
|
|
|
|
|
write to the output stream, respectively.
|
|
|
|
|
|
|
|
|
|
IMPORTANT: The function flushes the contents of the buffer in
|
|
|
|
|
rbuf_flush() before actually reading from fd. If you wish to read
|
|
|
|
|
from fd immediately, flush or discard the buffer. */
|
|
|
|
|
int
|
|
|
|
|
get_contents (int fd, FILE *fp, long *len, long restval, long expected,
|
2001-11-26 07:49:10 -05:00
|
|
|
|
struct rbuf *rbuf, int use_expected, long *elapsed)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2000-11-19 15:50:10 -05:00
|
|
|
|
int res = 0;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
static char c[8192];
|
2001-11-22 23:59:52 -05:00
|
|
|
|
void *progress = NULL;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
struct wget_timer *timer = wtimer_allocate ();
|
|
|
|
|
long dltime = 0, last_dltime = 0;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
*len = restval;
|
2001-11-26 07:49:10 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (opt.verbose)
|
2001-11-22 23:59:52 -05:00
|
|
|
|
progress = progress_create (restval, expected);
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (rbuf && RBUF_FD (rbuf) == fd)
|
|
|
|
|
{
|
2001-11-26 07:49:10 -05:00
|
|
|
|
int sz = 0;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
while ((res = rbuf_flush (rbuf, c, sizeof (c))) != 0)
|
|
|
|
|
{
|
2001-11-26 07:49:10 -05:00
|
|
|
|
fwrite (c, sizeof (char), res, fp);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
*len += res;
|
2001-11-26 07:49:10 -05:00
|
|
|
|
sz += res;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2001-11-26 07:49:10 -05:00
|
|
|
|
if (sz)
|
2001-11-22 23:59:52 -05:00
|
|
|
|
fflush (fp);
|
|
|
|
|
if (ferror (fp))
|
2001-11-26 07:49:10 -05:00
|
|
|
|
{
|
|
|
|
|
res = -2;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
if (opt.verbose)
|
2001-11-26 15:07:13 -05:00
|
|
|
|
progress_update (progress, sz, 0);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
|
|
|
|
if (opt.limit_rate)
|
|
|
|
|
limit_bandwidth_reset ();
|
|
|
|
|
wtimer_reset (timer);
|
|
|
|
|
|
2000-11-19 15:50:10 -05:00
|
|
|
|
/* Read from fd while there is available data.
|
|
|
|
|
|
|
|
|
|
Normally, if expected is 0, it means that it is not known how
|
|
|
|
|
much data is expected. However, if use_expected is specified,
|
|
|
|
|
then expected being zero means exactly that. */
|
|
|
|
|
while (!use_expected || (*len < expected))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2000-11-19 15:50:10 -05:00
|
|
|
|
int amount_to_read = (use_expected
|
|
|
|
|
? MIN (expected - *len, sizeof (c))
|
|
|
|
|
: sizeof (c));
|
2000-12-05 18:09:41 -05:00
|
|
|
|
#ifdef HAVE_SSL
|
2001-11-26 15:07:13 -05:00
|
|
|
|
if (rbuf->ssl!=NULL)
|
|
|
|
|
res = ssl_iread (rbuf->ssl, c, amount_to_read);
|
|
|
|
|
else
|
2000-12-05 18:09:41 -05:00
|
|
|
|
#endif /* HAVE_SSL */
|
2001-11-26 15:07:13 -05:00
|
|
|
|
res = iread (fd, c, amount_to_read);
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (res > 0)
|
|
|
|
|
{
|
2001-11-22 23:59:52 -05:00
|
|
|
|
fwrite (c, sizeof (char), res, fp);
|
|
|
|
|
/* Always flush the contents of the network packet. This
|
|
|
|
|
should not be adverse to performance, as the network
|
|
|
|
|
packets typically won't be too tiny anyway. */
|
|
|
|
|
fflush (fp);
|
|
|
|
|
if (ferror (fp))
|
2001-11-26 07:49:10 -05:00
|
|
|
|
{
|
|
|
|
|
res = -2;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
|
|
|
|
/* If bandwidth is not limited, one call to wtimer_elapsed
|
|
|
|
|
is sufficient. */
|
|
|
|
|
dltime = wtimer_elapsed (timer);
|
|
|
|
|
if (opt.limit_rate)
|
|
|
|
|
{
|
|
|
|
|
limit_bandwidth (res, dltime - last_dltime);
|
|
|
|
|
dltime = wtimer_elapsed (timer);
|
|
|
|
|
last_dltime = dltime;
|
|
|
|
|
}
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (opt.verbose)
|
2001-11-26 15:07:13 -05:00
|
|
|
|
progress_update (progress, res, dltime);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
*len += res;
|
|
|
|
|
}
|
2000-11-19 15:50:10 -05:00
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (res < -1)
|
|
|
|
|
res = -1;
|
2001-11-26 07:49:10 -05:00
|
|
|
|
|
|
|
|
|
out:
|
2001-11-26 15:07:13 -05:00
|
|
|
|
if (opt.verbose)
|
|
|
|
|
progress_finish (progress, dltime);
|
|
|
|
|
if (elapsed)
|
|
|
|
|
*elapsed = dltime;
|
|
|
|
|
wtimer_delete (timer);
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
2001-11-22 23:59:52 -05:00
|
|
|
|
/* Return a printed representation of the download rate, as
|
2001-11-24 23:46:26 -05:00
|
|
|
|
appropriate for the speed. If PAD is non-zero, strings will be
|
|
|
|
|
padded to the width of 7 characters (xxxx.xx). */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
char *
|
2001-11-24 23:46:26 -05:00
|
|
|
|
retr_rate (long bytes, long msecs, int pad)
|
|
|
|
|
{
|
|
|
|
|
static char res[20];
|
|
|
|
|
static char *rate_names[] = {"B/s", "KB/s", "MB/s", "GB/s" };
|
|
|
|
|
int units = 0;
|
|
|
|
|
|
|
|
|
|
double dlrate = calc_rate (bytes, msecs, &units);
|
|
|
|
|
sprintf (res, pad ? "%7.2f %s" : "%.2f %s", dlrate, rate_names[units]);
|
|
|
|
|
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Calculate the download rate and trim it as appropriate for the
|
|
|
|
|
speed. Appropriate means that if rate is greater than 1K/s,
|
|
|
|
|
kilobytes are used, and if rate is greater than 1MB/s, megabytes
|
|
|
|
|
are used.
|
|
|
|
|
|
|
|
|
|
UNITS is zero for B/s, one for KB/s, two for MB/s, and three for
|
|
|
|
|
GB/s. */
|
|
|
|
|
double
|
|
|
|
|
calc_rate (long bytes, long msecs, int *units)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
double dlrate;
|
|
|
|
|
|
2001-11-22 23:59:52 -05:00
|
|
|
|
assert (msecs >= 0);
|
|
|
|
|
assert (bytes >= 0);
|
|
|
|
|
|
2001-04-24 19:09:45 -04:00
|
|
|
|
if (msecs == 0)
|
|
|
|
|
/* If elapsed time is 0, it means we're under the granularity of
|
|
|
|
|
the timer. This often happens on systems that use time() for
|
|
|
|
|
the timer. */
|
|
|
|
|
msecs = wtimer_granularity ();
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
dlrate = (double)1000 * bytes / msecs;
|
|
|
|
|
if (dlrate < 1024.0)
|
2001-11-24 23:46:26 -05:00
|
|
|
|
*units = 0;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
else if (dlrate < 1024.0 * 1024.0)
|
2001-11-24 23:46:26 -05:00
|
|
|
|
*units = 1, dlrate /= 1024.0;
|
2001-04-24 19:09:45 -04:00
|
|
|
|
else if (dlrate < 1024.0 * 1024.0 * 1024.0)
|
2001-11-24 23:46:26 -05:00
|
|
|
|
*units = 2, dlrate /= (1024.0 * 1024.0);
|
2001-04-24 19:09:45 -04:00
|
|
|
|
else
|
|
|
|
|
/* Maybe someone will need this one day. More realistically, it
|
|
|
|
|
will get tickled by buggy timers. */
|
2001-11-24 23:46:26 -05:00
|
|
|
|
*units = 3, dlrate /= (1024.0 * 1024.0 * 1024.0);
|
2001-04-24 19:09:45 -04:00
|
|
|
|
|
2001-11-24 23:46:26 -05:00
|
|
|
|
return dlrate;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-24 22:10:34 -05:00
|
|
|
|
static int
|
|
|
|
|
register_redirections_mapper (void *key, void *value, void *arg)
|
|
|
|
|
{
|
|
|
|
|
const char *redirected_from = (const char *)key;
|
|
|
|
|
const char *redirected_to = (const char *)arg;
|
|
|
|
|
if (0 != strcmp (redirected_from, redirected_to))
|
|
|
|
|
register_redirection (redirected_from, redirected_to);
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Register the redirections that lead to the successful download of
|
|
|
|
|
this URL. This is necessary so that the link converter can convert
|
|
|
|
|
redirected URLs to the local file. */
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
register_all_redirections (struct hash_table *redirections, const char *final)
|
|
|
|
|
{
|
|
|
|
|
hash_table_map (redirections, register_redirections_mapper, (void *)final);
|
|
|
|
|
}
|
|
|
|
|
|
2001-11-18 19:12:05 -05:00
|
|
|
|
#define USE_PROXY_P(u) (opt.use_proxy && getproxy((u)->scheme) \
|
1999-12-02 02:42:23 -05:00
|
|
|
|
&& no_proxy_match((u)->host, \
|
|
|
|
|
(const char **)opt.no_proxy))
|
|
|
|
|
|
2000-12-05 18:09:41 -05:00
|
|
|
|
/* Retrieve the given URL. Decides which loop to call -- HTTP(S), FTP,
|
1999-12-02 02:42:23 -05:00
|
|
|
|
or simply copy it with file:// (#### the latter not yet
|
|
|
|
|
implemented!). */
|
|
|
|
|
uerr_t
|
|
|
|
|
retrieve_url (const char *origurl, char **file, char **newloc,
|
|
|
|
|
const char *refurl, int *dt)
|
|
|
|
|
{
|
|
|
|
|
uerr_t result;
|
|
|
|
|
char *url;
|
2000-10-31 23:21:50 -05:00
|
|
|
|
int location_changed, dummy;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
int use_proxy;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
char *mynewloc, *proxy;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
struct url *u;
|
|
|
|
|
int up_error_code; /* url parse error code */
|
|
|
|
|
char *local_file;
|
2000-11-19 15:50:10 -05:00
|
|
|
|
struct hash_table *redirections = NULL;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
/* If dt is NULL, just ignore it. */
|
|
|
|
|
if (!dt)
|
|
|
|
|
dt = &dummy;
|
|
|
|
|
url = xstrdup (origurl);
|
|
|
|
|
if (newloc)
|
|
|
|
|
*newloc = NULL;
|
|
|
|
|
if (file)
|
|
|
|
|
*file = NULL;
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
u = url_parse (url, &up_error_code);
|
|
|
|
|
if (!u)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-21 19:24:28 -05:00
|
|
|
|
logprintf (LOG_NOTQUIET, "%s: %s.\n", url, url_error (up_error_code));
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
2001-11-21 19:24:28 -05:00
|
|
|
|
return URLERROR;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
if (!refurl)
|
|
|
|
|
refurl = opt.referer;
|
|
|
|
|
|
2000-10-31 23:21:50 -05:00
|
|
|
|
redirected:
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
result = NOCONERROR;
|
|
|
|
|
mynewloc = NULL;
|
|
|
|
|
local_file = NULL;
|
2000-07-14 10:15:23 -04:00
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
use_proxy = USE_PROXY_P (u);
|
|
|
|
|
if (use_proxy)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-21 19:24:28 -05:00
|
|
|
|
struct url *proxy_url;
|
|
|
|
|
|
|
|
|
|
/* Get the proxy server for the current scheme. */
|
|
|
|
|
proxy = getproxy (u->scheme);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (!proxy)
|
|
|
|
|
{
|
|
|
|
|
logputs (LOG_NOTQUIET, _("Could not find proxy host.\n"));
|
2001-11-21 19:24:28 -05:00
|
|
|
|
url_free (u);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return PROXERR;
|
|
|
|
|
}
|
2001-11-21 19:24:28 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* Parse the proxy URL. */
|
2001-11-21 19:24:28 -05:00
|
|
|
|
proxy_url = url_parse (proxy, &up_error_code);
|
|
|
|
|
if (!proxy_url)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2001-11-24 22:10:34 -05:00
|
|
|
|
logprintf (LOG_NOTQUIET, _("Error parsing proxy URL %s: %s.\n"),
|
2001-11-21 19:24:28 -05:00
|
|
|
|
proxy, url_error (up_error_code));
|
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
|
|
|
|
xfree (url);
|
|
|
|
|
return PROXERR;
|
|
|
|
|
}
|
|
|
|
|
if (proxy_url->scheme != SCHEME_HTTP)
|
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("Error in proxy URL %s: Must be HTTP.\n"), proxy);
|
|
|
|
|
url_free (proxy_url);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return PROXERR;
|
|
|
|
|
}
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
result = http_loop (u, &mynewloc, &local_file, refurl, dt, proxy_url);
|
|
|
|
|
url_free (proxy_url);
|
|
|
|
|
}
|
|
|
|
|
else if (u->scheme == SCHEME_HTTP
|
2000-12-05 18:09:41 -05:00
|
|
|
|
#ifdef HAVE_SSL
|
2001-11-18 19:12:05 -05:00
|
|
|
|
|| u->scheme == SCHEME_HTTPS
|
2001-03-30 21:05:54 -05:00
|
|
|
|
#endif
|
|
|
|
|
)
|
2001-11-21 19:24:28 -05:00
|
|
|
|
{
|
|
|
|
|
result = http_loop (u, &mynewloc, &local_file, refurl, dt, NULL);
|
|
|
|
|
}
|
2001-11-18 19:12:05 -05:00
|
|
|
|
else if (u->scheme == SCHEME_FTP)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
/* If this is a redirection, we must not allow recursive FTP
|
|
|
|
|
retrieval, so we save recursion to oldrec, and restore it
|
|
|
|
|
later. */
|
|
|
|
|
int oldrec = opt.recursive;
|
2000-10-31 23:21:50 -05:00
|
|
|
|
if (redirections)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
opt.recursive = 0;
|
|
|
|
|
result = ftp_loop (u, dt);
|
|
|
|
|
opt.recursive = oldrec;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
#if 0
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* There is a possibility of having HTTP being redirected to
|
|
|
|
|
FTP. In these cases we must decide whether the text is HTML
|
|
|
|
|
according to the suffix. The HTML suffixes are `.html' and
|
2001-11-21 19:24:28 -05:00
|
|
|
|
`.htm', case-insensitive. */
|
2001-11-18 19:12:05 -05:00
|
|
|
|
if (redirections && u->local && (u->scheme == SCHEME_FTP))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
char *suf = suffix (u->local);
|
|
|
|
|
if (suf && (!strcasecmp (suf, "html") || !strcasecmp (suf, "htm")))
|
|
|
|
|
*dt |= TEXTHTML;
|
|
|
|
|
}
|
2001-11-21 19:24:28 -05:00
|
|
|
|
#endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
location_changed = (result == NEWLOCATION);
|
|
|
|
|
if (location_changed)
|
|
|
|
|
{
|
2000-10-31 23:21:50 -05:00
|
|
|
|
char *construced_newloc;
|
2001-11-24 22:10:34 -05:00
|
|
|
|
struct url *newloc_parsed;
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
|
|
|
|
assert (mynewloc != NULL);
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
if (local_file)
|
|
|
|
|
xfree (local_file);
|
|
|
|
|
|
2000-10-31 23:21:50 -05:00
|
|
|
|
/* The HTTP specs only allow absolute URLs to appear in
|
|
|
|
|
redirects, but a ton of boneheaded webservers and CGIs out
|
|
|
|
|
there break the rules and use relative URLs, and popular
|
|
|
|
|
browsers are lenient about this, so wget should be too. */
|
2001-04-14 00:11:35 -04:00
|
|
|
|
construced_newloc = uri_merge (url, mynewloc);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (mynewloc);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
mynewloc = construced_newloc;
|
|
|
|
|
|
|
|
|
|
/* Now, see if this new location makes sense. */
|
2001-11-24 22:10:34 -05:00
|
|
|
|
newloc_parsed = url_parse (mynewloc, &up_error_code);
|
|
|
|
|
if (!newloc_parsed)
|
2000-10-31 14:25:32 -05:00
|
|
|
|
{
|
2001-11-24 09:02:10 -05:00
|
|
|
|
logprintf (LOG_NOTQUIET, "%s: %s.\n", mynewloc,
|
|
|
|
|
url_error (up_error_code));
|
2001-11-21 19:24:28 -05:00
|
|
|
|
url_free (u);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
|
|
|
|
xfree (mynewloc);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
return result;
|
2000-10-31 14:25:32 -05:00
|
|
|
|
}
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
2001-11-24 22:10:34 -05:00
|
|
|
|
/* Now mynewloc will become newloc_parsed->url, because if the
|
2000-10-31 23:21:50 -05:00
|
|
|
|
Location contained relative paths like .././something, we
|
|
|
|
|
don't want that propagating as url. */
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (mynewloc);
|
2001-11-24 22:10:34 -05:00
|
|
|
|
mynewloc = xstrdup (newloc_parsed->url);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (!redirections)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2000-11-19 15:50:10 -05:00
|
|
|
|
redirections = make_string_hash_table (0);
|
|
|
|
|
/* Add current URL immediately so we can detect it as soon
|
|
|
|
|
as possible in case of a cycle. */
|
|
|
|
|
string_set_add (redirections, u->url);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
}
|
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
/* The new location is OK. Check for redirection cycle by
|
2000-10-31 23:21:50 -05:00
|
|
|
|
peeking through the history of redirections. */
|
2001-11-24 22:10:34 -05:00
|
|
|
|
if (string_set_contains (redirections, newloc_parsed->url))
|
2000-10-31 23:21:50 -05:00
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("%s: Redirection cycle detected.\n"),
|
|
|
|
|
mynewloc);
|
2001-11-24 22:10:34 -05:00
|
|
|
|
url_free (newloc_parsed);
|
2001-11-21 19:24:28 -05:00
|
|
|
|
url_free (u);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
|
|
|
|
xfree (mynewloc);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return WRONGCODE;
|
|
|
|
|
}
|
2001-11-24 22:10:34 -05:00
|
|
|
|
string_set_add (redirections, newloc_parsed->url);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
2000-10-31 14:25:32 -05:00
|
|
|
|
url = mynewloc;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
url_free (u);
|
2001-11-24 22:10:34 -05:00
|
|
|
|
u = newloc_parsed;
|
2000-10-31 23:21:50 -05:00
|
|
|
|
goto redirected;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
2001-11-21 19:24:28 -05:00
|
|
|
|
if (local_file)
|
2001-03-30 21:05:54 -05:00
|
|
|
|
{
|
|
|
|
|
if (*dt & RETROKF)
|
|
|
|
|
{
|
2001-11-21 19:24:28 -05:00
|
|
|
|
register_download (url, local_file);
|
2001-11-24 22:10:34 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
register_all_redirections (redirections, url);
|
2001-03-30 21:05:54 -05:00
|
|
|
|
if (*dt & TEXTHTML)
|
2001-11-21 19:24:28 -05:00
|
|
|
|
register_html (url, local_file);
|
2001-03-30 21:05:54 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (file)
|
2001-11-21 19:24:28 -05:00
|
|
|
|
*file = local_file ? local_file : NULL;
|
|
|
|
|
else
|
|
|
|
|
FREE_MAYBE (local_file);
|
|
|
|
|
|
|
|
|
|
url_free (u);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-11-26 00:36:33 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
{
|
|
|
|
|
string_set_free (redirections);
|
|
|
|
|
if (newloc)
|
|
|
|
|
*newloc = url;
|
|
|
|
|
else
|
|
|
|
|
xfree (url);
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
else
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
|
|
|
|
if (newloc)
|
|
|
|
|
*newloc = NULL;
|
|
|
|
|
xfree (url);
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2001-04-01 19:50:04 -04:00
|
|
|
|
++global_download_count;
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
2000-08-30 07:26:21 -04:00
|
|
|
|
/* Find the URLs in the file and call retrieve_url() for each of
|
1999-12-02 02:42:23 -05:00
|
|
|
|
them. If HTML is non-zero, treat the file as HTML, and construct
|
2000-08-30 07:26:21 -04:00
|
|
|
|
the URLs accordingly.
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
If opt.recursive is set, call recursive_retrieve() for each file. */
|
|
|
|
|
uerr_t
|
|
|
|
|
retrieve_from_file (const char *file, int html, int *count)
|
|
|
|
|
{
|
|
|
|
|
uerr_t status;
|
2001-11-24 22:10:34 -05:00
|
|
|
|
struct urlpos *url_list, *cur_url;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2000-11-19 15:50:10 -05:00
|
|
|
|
url_list = (html ? get_urls_html (file, NULL, FALSE, NULL)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
: get_urls_file (file));
|
|
|
|
|
status = RETROK; /* Suppose everything is OK. */
|
|
|
|
|
*count = 0; /* Reset the URL count. */
|
2001-11-24 22:10:34 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
for (cur_url = url_list; cur_url; cur_url = cur_url->next, ++*count)
|
|
|
|
|
{
|
2001-11-27 14:14:34 -05:00
|
|
|
|
char *filename = NULL, *new_file = NULL;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
int dt;
|
|
|
|
|
|
2001-11-25 13:40:55 -05:00
|
|
|
|
if (cur_url->ignore_when_downloading)
|
|
|
|
|
continue;
|
|
|
|
|
|
2000-11-01 18:17:31 -05:00
|
|
|
|
if (downloaded_exceeds_quota ())
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
status = QUOTEXC;
|
|
|
|
|
break;
|
|
|
|
|
}
|
2001-11-24 22:10:34 -05:00
|
|
|
|
if (opt.recursive && cur_url->url->scheme != SCHEME_FTP)
|
|
|
|
|
status = retrieve_tree (cur_url->url->url);
|
|
|
|
|
else
|
|
|
|
|
status = retrieve_url (cur_url->url->url, &filename, &new_file, NULL, &dt);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
if (filename && opt.delete_after && file_exists_p (filename))
|
|
|
|
|
{
|
2000-10-23 23:43:47 -04:00
|
|
|
|
DEBUGP (("Removing file due to --delete-after in"
|
|
|
|
|
" retrieve_from_file():\n"));
|
1999-12-02 02:42:23 -05:00
|
|
|
|
logprintf (LOG_VERBOSE, _("Removing %s.\n"), filename);
|
|
|
|
|
if (unlink (filename))
|
|
|
|
|
logprintf (LOG_NOTQUIET, "unlink: %s\n", strerror (errno));
|
|
|
|
|
dt &= ~RETROKF;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
FREE_MAYBE (new_file);
|
|
|
|
|
FREE_MAYBE (filename);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Free the linked list of URL-s. */
|
|
|
|
|
free_urlpos (url_list);
|
|
|
|
|
|
|
|
|
|
return status;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print `giving up', or `retrying', depending on the impending
|
|
|
|
|
action. N1 and N2 are the attempt number and the attempt limit. */
|
|
|
|
|
void
|
|
|
|
|
printwhat (int n1, int n2)
|
|
|
|
|
{
|
|
|
|
|
logputs (LOG_VERBOSE, (n1 == n2) ? _("Giving up.\n\n") : _("Retrying.\n\n"));
|
|
|
|
|
}
|
2000-11-01 18:17:31 -05:00
|
|
|
|
|
|
|
|
|
/* Increment opt.downloaded by BY_HOW_MUCH. If an overflow occurs,
|
|
|
|
|
set opt.downloaded_overflow to 1. */
|
|
|
|
|
void
|
|
|
|
|
downloaded_increase (unsigned long by_how_much)
|
|
|
|
|
{
|
|
|
|
|
VERY_LONG_TYPE old;
|
|
|
|
|
if (opt.downloaded_overflow)
|
|
|
|
|
return;
|
|
|
|
|
old = opt.downloaded;
|
|
|
|
|
opt.downloaded += by_how_much;
|
|
|
|
|
if (opt.downloaded < old) /* carry flag, where are you when I
|
|
|
|
|
need you? */
|
|
|
|
|
{
|
|
|
|
|
/* Overflow. */
|
|
|
|
|
opt.downloaded_overflow = 1;
|
|
|
|
|
opt.downloaded = ~((VERY_LONG_TYPE)0);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return non-zero if the downloaded amount of bytes exceeds the
|
|
|
|
|
desired quota. If quota is not set or if the amount overflowed, 0
|
|
|
|
|
is returned. */
|
|
|
|
|
int
|
|
|
|
|
downloaded_exceeds_quota (void)
|
|
|
|
|
{
|
|
|
|
|
if (!opt.quota)
|
|
|
|
|
return 0;
|
|
|
|
|
if (opt.downloaded_overflow)
|
2000-11-01 19:18:27 -05:00
|
|
|
|
/* We don't really know. (Wildly) assume not. */
|
2000-11-01 18:17:31 -05:00
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
return opt.downloaded > opt.quota;
|
|
|
|
|
}
|
2000-12-05 19:24:40 -05:00
|
|
|
|
|
|
|
|
|
/* If opt.wait or opt.waitretry are specified, and if certain
|
|
|
|
|
conditions are met, sleep the appropriate number of seconds. See
|
|
|
|
|
the documentation of --wait and --waitretry for more information.
|
|
|
|
|
|
|
|
|
|
COUNT is the count of current retrieval, beginning with 1. */
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
|
sleep_between_retrievals (int count)
|
|
|
|
|
{
|
|
|
|
|
static int first_retrieval = 1;
|
|
|
|
|
|
2001-11-27 14:49:28 -05:00
|
|
|
|
if (first_retrieval && opt.random_wait)
|
|
|
|
|
/* --random-wait uses the RNG, so seed it. */
|
|
|
|
|
srand (time (NULL));
|
|
|
|
|
|
2000-12-05 19:24:40 -05:00
|
|
|
|
if (!first_retrieval && (opt.wait || opt.waitretry))
|
|
|
|
|
{
|
|
|
|
|
if (opt.waitretry && count > 1)
|
|
|
|
|
{
|
|
|
|
|
/* If opt.waitretry is specified and this is a retry, wait
|
|
|
|
|
for COUNT-1 number of seconds, or for opt.waitretry
|
|
|
|
|
seconds. */
|
|
|
|
|
if (count <= opt.waitretry)
|
|
|
|
|
sleep (count - 1);
|
|
|
|
|
else
|
|
|
|
|
sleep (opt.waitretry);
|
|
|
|
|
}
|
|
|
|
|
else if (opt.wait)
|
2001-11-25 16:23:15 -05:00
|
|
|
|
{
|
|
|
|
|
/* Otherwise, check if opt.wait is specified. If so, sleep. */
|
|
|
|
|
if (count > 1 || !opt.random_wait)
|
|
|
|
|
sleep (opt.wait);
|
|
|
|
|
else
|
|
|
|
|
{
|
2001-11-27 14:49:28 -05:00
|
|
|
|
int waitmax = 2 * opt.wait;
|
|
|
|
|
/* This is equivalent to rand() % waitmax, but uses the
|
|
|
|
|
high-order bits for better randomness. */
|
|
|
|
|
int waitsecs = (double)waitmax * rand () / (RAND_MAX + 1.0);
|
|
|
|
|
|
|
|
|
|
DEBUGP (("sleep_between_retrievals: norm=%ld,fuzz=%ld,sleep=%d\n",
|
|
|
|
|
opt.wait, waitsecs - opt.wait, waitsecs));
|
|
|
|
|
|
|
|
|
|
if (waitsecs)
|
|
|
|
|
sleep (waitsecs);
|
2001-11-25 16:23:15 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
2000-12-05 19:24:40 -05:00
|
|
|
|
}
|
|
|
|
|
if (first_retrieval)
|
|
|
|
|
first_retrieval = 0;
|
|
|
|
|
}
|