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
|
2003-09-15 17:14:15 -04:00
|
|
|
|
the Free Software Foundation; either version 2 of the License, or (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>
|
|
|
|
|
|
|
|
|
|
#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"
|
2003-09-21 18:47:14 -04:00
|
|
|
|
#include "convert.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 {
|
2003-09-21 00:05:12 -04:00
|
|
|
|
long chunk_bytes;
|
|
|
|
|
double chunk_start;
|
|
|
|
|
double sleep_adjust;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
} limit_data;
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
limit_bandwidth_reset (void)
|
|
|
|
|
{
|
2003-09-21 00:05:12 -04:00
|
|
|
|
limit_data.chunk_bytes = 0;
|
|
|
|
|
limit_data.chunk_start = 0;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Limit the bandwidth by pausing the download for an amount of time.
|
2003-09-20 17:08:41 -04:00
|
|
|
|
BYTES is the number of bytes received from the network, and DELTA
|
2003-09-20 19:12:18 -04:00
|
|
|
|
is the number of milliseconds it took to receive them. */
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
|
|
|
|
static void
|
2003-09-21 00:05:12 -04:00
|
|
|
|
limit_bandwidth (long bytes, double *dltime, struct wget_timer *timer)
|
2001-11-26 15:07:13 -05:00
|
|
|
|
{
|
2003-09-21 00:05:12 -04:00
|
|
|
|
double delta_t = *dltime - limit_data.chunk_start;
|
2003-09-15 17:14:15 -04:00
|
|
|
|
double expected;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
2003-09-21 00:05:12 -04:00
|
|
|
|
limit_data.chunk_bytes += bytes;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
2003-09-21 00:05:12 -04:00
|
|
|
|
/* Calculate the amount of time we expect downloading the chunk
|
|
|
|
|
should take. If in reality it took less time, sleep to
|
|
|
|
|
compensate for the difference. */
|
|
|
|
|
expected = 1000.0 * limit_data.chunk_bytes / opt.limit_rate;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
2003-09-21 00:05:12 -04:00
|
|
|
|
if (expected > delta_t)
|
2001-11-26 15:07:13 -05:00
|
|
|
|
{
|
2003-09-21 00:05:12 -04:00
|
|
|
|
double slp = expected - delta_t + limit_data.sleep_adjust;
|
|
|
|
|
double t0, t1;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
if (slp < 200)
|
|
|
|
|
{
|
2003-09-15 17:14:15 -04:00
|
|
|
|
DEBUGP (("deferring a %.2f ms sleep (%ld/%.2f).\n",
|
2003-09-21 00:05:12 -04:00
|
|
|
|
slp, limit_data.chunk_bytes, delta_t));
|
2001-11-26 15:07:13 -05:00
|
|
|
|
return;
|
|
|
|
|
}
|
2003-09-21 00:05:12 -04:00
|
|
|
|
DEBUGP (("\nsleeping %.2f ms for %ld bytes, adjust %.2f ms\n",
|
|
|
|
|
slp, limit_data.chunk_bytes, limit_data.sleep_adjust));
|
|
|
|
|
|
|
|
|
|
t0 = *dltime;
|
2003-09-15 17:14:15 -04:00
|
|
|
|
usleep ((unsigned long) (1000 * slp));
|
2003-09-21 00:05:12 -04:00
|
|
|
|
t1 = wtimer_elapsed (timer);
|
|
|
|
|
|
|
|
|
|
/* Due to scheduling, we probably slept slightly longer (or
|
|
|
|
|
shorter) than desired. Calculate the difference between the
|
|
|
|
|
desired and the actual sleep, and adjust the next sleep by
|
|
|
|
|
that amount. */
|
|
|
|
|
limit_data.sleep_adjust = slp - (t1 - t0);
|
|
|
|
|
|
|
|
|
|
/* Since we've called wtimer_elapsed, we might as well update
|
|
|
|
|
the caller's dltime. */
|
|
|
|
|
*dltime = t1;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
}
|
|
|
|
|
|
2003-09-21 00:05:12 -04:00
|
|
|
|
limit_data.chunk_bytes = 0;
|
|
|
|
|
limit_data.chunk_start = *dltime;
|
2001-11-26 15:07:13 -05:00
|
|
|
|
}
|
|
|
|
|
|
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,
|
2003-09-15 17:14:15 -04:00
|
|
|
|
struct rbuf *rbuf, int use_expected, double *elapsed)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2000-11-19 15:50:10 -05:00
|
|
|
|
int res = 0;
|
2003-09-15 17:48:43 -04:00
|
|
|
|
|
|
|
|
|
static char dlbuf[16384];
|
|
|
|
|
int dlbufsize = sizeof (dlbuf);
|
|
|
|
|
|
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 ();
|
2003-09-21 00:05:12 -04:00
|
|
|
|
double 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;
|
2003-09-15 17:48:43 -04:00
|
|
|
|
while ((res = rbuf_flush (rbuf, dlbuf, sizeof (dlbuf))) != 0)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2003-09-15 17:48:43 -04:00
|
|
|
|
fwrite (dlbuf, 1, 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;
|
|
|
|
|
}
|
2002-04-14 00:22:47 -04:00
|
|
|
|
if (progress)
|
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);
|
|
|
|
|
|
2003-09-22 09:34:55 -04:00
|
|
|
|
/* Use a smaller buffer for low requested bandwidths. For example,
|
|
|
|
|
with --limit-rate=2k, it doesn't make sense to slurp in 16K of
|
|
|
|
|
data and then sleep for 8s. With buffer size equal to the limit,
|
|
|
|
|
we never have to sleep for more than one second. */
|
2003-09-15 17:48:43 -04:00
|
|
|
|
if (opt.limit_rate && opt.limit_rate < dlbufsize)
|
|
|
|
|
dlbufsize = opt.limit_rate;
|
|
|
|
|
|
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
|
2003-09-15 17:48:43 -04:00
|
|
|
|
? MIN (expected - *len, dlbufsize) : dlbufsize);
|
2000-12-05 18:09:41 -05:00
|
|
|
|
#ifdef HAVE_SSL
|
2001-11-26 15:07:13 -05:00
|
|
|
|
if (rbuf->ssl!=NULL)
|
2003-09-18 07:43:00 -04:00
|
|
|
|
res = ssl_iread (rbuf->ssl, dlbuf, amount_to_read);
|
2001-11-26 15:07:13 -05:00
|
|
|
|
else
|
2000-12-05 18:09:41 -05:00
|
|
|
|
#endif /* HAVE_SSL */
|
2003-09-15 17:48:43 -04:00
|
|
|
|
res = iread (fd, dlbuf, amount_to_read);
|
2001-11-26 15:07:13 -05:00
|
|
|
|
|
2003-09-20 17:08:41 -04:00
|
|
|
|
if (res <= 0)
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
fwrite (dlbuf, 1, res, fp);
|
|
|
|
|
/* Always flush the contents of the network packet. This should
|
|
|
|
|
not hinder performance: fast downloads will be received in
|
|
|
|
|
16K chunks (which stdio would write out anyway), and slow
|
|
|
|
|
downloads won't be limited with disk performance. */
|
|
|
|
|
fflush (fp);
|
|
|
|
|
if (ferror (fp))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2003-09-20 17:08:41 -04:00
|
|
|
|
res = -2;
|
|
|
|
|
goto out;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
dltime = wtimer_elapsed (timer);
|
|
|
|
|
if (opt.limit_rate)
|
2003-09-21 00:05:12 -04:00
|
|
|
|
limit_bandwidth (res, &dltime, timer);
|
2003-09-20 17:08:41 -04:00
|
|
|
|
|
2003-09-30 17:24:36 -04:00
|
|
|
|
*len += res;
|
2003-09-20 17:08:41 -04:00
|
|
|
|
if (progress)
|
|
|
|
|
progress_update (progress, res, dltime);
|
2003-09-30 17:24:36 -04:00
|
|
|
|
#ifdef WINDOWS
|
|
|
|
|
if (use_expected && expected > 0)
|
|
|
|
|
ws_percenttitle (100.0 * (double)(*len) / (double)expected);
|
|
|
|
|
#endif
|
2000-11-19 15:50:10 -05:00
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (res < -1)
|
|
|
|
|
res = -1;
|
2001-11-26 07:49:10 -05:00
|
|
|
|
|
|
|
|
|
out:
|
2002-04-14 00:22:47 -04:00
|
|
|
|
if (progress)
|
2001-11-26 15:07:13 -05:00
|
|
|
|
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 *
|
2003-09-15 17:14:15 -04:00
|
|
|
|
retr_rate (long bytes, double msecs, int pad)
|
2001-11-24 23:46:26 -05:00
|
|
|
|
{
|
|
|
|
|
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
|
2003-09-15 17:14:15 -04:00
|
|
|
|
calc_rate (long bytes, double 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)
|
2003-09-15 17:14:15 -04:00
|
|
|
|
/* If elapsed time is exactly zero, it means we're under the
|
|
|
|
|
granularity of the timer. This often happens on systems that
|
|
|
|
|
use time() for the timer. */
|
2001-04-24 19:09:45 -04:00
|
|
|
|
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
|
2003-09-20 17:08:41 -04:00
|
|
|
|
/* Maybe someone will need this, one day. */
|
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-30 16:33:31 -05:00
|
|
|
|
/* Maximum number of allowed redirections. 20 was chosen as a
|
|
|
|
|
"reasonable" value, which is low enough to not cause havoc, yet
|
|
|
|
|
high enough to guarantee that normal retrievals will not be hurt by
|
|
|
|
|
the check. */
|
|
|
|
|
|
|
|
|
|
#define MAX_REDIRECTIONS 20
|
|
|
|
|
|
2002-04-14 00:22:47 -04:00
|
|
|
|
#define SUSPEND_POST_DATA do { \
|
|
|
|
|
post_data_suspended = 1; \
|
|
|
|
|
saved_post_data = opt.post_data; \
|
|
|
|
|
saved_post_file_name = opt.post_file_name; \
|
|
|
|
|
opt.post_data = NULL; \
|
|
|
|
|
opt.post_file_name = NULL; \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
#define RESTORE_POST_DATA do { \
|
|
|
|
|
if (post_data_suspended) \
|
|
|
|
|
{ \
|
|
|
|
|
opt.post_data = saved_post_data; \
|
|
|
|
|
opt.post_file_name = saved_post_file_name; \
|
|
|
|
|
post_data_suspended = 0; \
|
|
|
|
|
} \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
2003-09-21 18:47:14 -04:00
|
|
|
|
static char *getproxy PARAMS ((struct url *));
|
|
|
|
|
|
2001-11-30 16:33:31 -05:00
|
|
|
|
/* Retrieve the given URL. Decides which loop to call -- HTTP, FTP,
|
|
|
|
|
FTP, proxy, etc. */
|
|
|
|
|
|
2002-04-14 00:22:47 -04:00
|
|
|
|
/* #### This function should be rewritten so it doesn't return from
|
|
|
|
|
multiple points. */
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
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;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
char *mynewloc, *proxy;
|
2002-04-12 23:04:47 -04:00
|
|
|
|
struct url *u, *proxy_url;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
int up_error_code; /* url parse error code */
|
|
|
|
|
char *local_file;
|
2001-11-30 16:33:31 -05:00
|
|
|
|
int redirection_count = 0;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
2002-04-14 00:22:47 -04:00
|
|
|
|
int post_data_suspended = 0;
|
2002-04-14 01:19:27 -04:00
|
|
|
|
char *saved_post_data = NULL;
|
|
|
|
|
char *saved_post_file_name = NULL;
|
2002-04-14 00:22:47 -04:00
|
|
|
|
|
2003-10-02 17:21:07 -04:00
|
|
|
|
/* If dt is NULL, use local storage. */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (!dt)
|
2003-10-02 17:21:07 -04:00
|
|
|
|
{
|
|
|
|
|
dt = &dummy;
|
|
|
|
|
dummy = 0;
|
|
|
|
|
}
|
1999-12-02 02:42:23 -05:00
|
|
|
|
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-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;
|
2002-04-12 23:04:47 -04:00
|
|
|
|
proxy_url = NULL;
|
2000-07-14 10:15:23 -04:00
|
|
|
|
|
2002-04-12 23:04:47 -04:00
|
|
|
|
proxy = getproxy (u);
|
|
|
|
|
if (proxy)
|
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));
|
|
|
|
|
xfree (url);
|
2002-04-14 00:22:47 -04:00
|
|
|
|
RESTORE_POST_DATA;
|
2001-11-21 19:24:28 -05:00
|
|
|
|
return PROXERR;
|
|
|
|
|
}
|
2002-04-12 23:04:47 -04:00
|
|
|
|
if (proxy_url->scheme != SCHEME_HTTP && proxy_url->scheme != u->scheme)
|
2001-11-21 19:24:28 -05:00
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("Error in proxy URL %s: Must be HTTP.\n"), proxy);
|
|
|
|
|
url_free (proxy_url);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
2002-04-14 00:22:47 -04:00
|
|
|
|
RESTORE_POST_DATA;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return PROXERR;
|
|
|
|
|
}
|
2001-11-21 19:24:28 -05:00
|
|
|
|
}
|
2002-04-12 23:04:47 -04:00
|
|
|
|
|
|
|
|
|
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
|
2002-04-12 23:04:47 -04:00
|
|
|
|
|| (proxy_url && proxy_url->scheme == SCHEME_HTTP))
|
2001-11-21 19:24:28 -05:00
|
|
|
|
{
|
2002-04-12 23:04:47 -04:00
|
|
|
|
result = http_loop (u, &mynewloc, &local_file, refurl, dt, proxy_url);
|
2001-11-21 19:24:28 -05:00
|
|
|
|
}
|
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;
|
2002-01-30 14:12:20 -05:00
|
|
|
|
if (redirection_count)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
opt.recursive = 0;
|
2002-04-12 23:04:47 -04:00
|
|
|
|
result = ftp_loop (u, dt, proxy_url);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
opt.recursive = oldrec;
|
2001-11-30 16:33:31 -05:00
|
|
|
|
|
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
|
2002-04-12 14:53:39 -04:00
|
|
|
|
according to the suffix. The HTML suffixes are `.html',
|
|
|
|
|
`.htm' and a few others, case-insensitive. */
|
2002-01-30 14:12:20 -05:00
|
|
|
|
if (redirection_count && local_file && u->scheme == SCHEME_FTP)
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
2002-04-12 14:53:39 -04:00
|
|
|
|
if (has_html_suffix_p (local_file))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
*dt |= TEXTHTML;
|
|
|
|
|
}
|
|
|
|
|
}
|
2002-04-12 23:04:47 -04:00
|
|
|
|
|
|
|
|
|
if (proxy_url)
|
|
|
|
|
{
|
|
|
|
|
url_free (proxy_url);
|
|
|
|
|
proxy_url = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
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-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
|
|
|
|
xfree (mynewloc);
|
2002-04-14 00:22:47 -04:00
|
|
|
|
RESTORE_POST_DATA;
|
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
|
|
|
|
|
2002-01-30 14:12:20 -05:00
|
|
|
|
/* Check for max. number of redirections. */
|
2001-11-30 16:33:31 -05:00
|
|
|
|
if (++redirection_count > MAX_REDIRECTIONS)
|
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("%d redirections exceeded.\n"),
|
|
|
|
|
MAX_REDIRECTIONS);
|
|
|
|
|
url_free (newloc_parsed);
|
|
|
|
|
url_free (u);
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
|
|
|
|
xfree (mynewloc);
|
2002-04-14 00:22:47 -04:00
|
|
|
|
RESTORE_POST_DATA;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return WRONGCODE;
|
|
|
|
|
}
|
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;
|
2002-04-14 00:22:47 -04:00
|
|
|
|
|
|
|
|
|
/* If we're being redirected from POST, we don't want to POST
|
|
|
|
|
again. Many requests answer POST with a redirection to an
|
|
|
|
|
index page; that redirection is clearly a GET. We "suspend"
|
|
|
|
|
POST data for the duration of the redirections, and restore
|
|
|
|
|
it when we're done. */
|
|
|
|
|
if (!post_data_suspended)
|
|
|
|
|
SUSPEND_POST_DATA;
|
|
|
|
|
|
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-12-04 16:03:35 -05:00
|
|
|
|
register_download (u->url, local_file);
|
2002-01-30 14:12:20 -05:00
|
|
|
|
if (redirection_count && 0 != strcmp (origurl, u->url))
|
|
|
|
|
register_redirection (origurl, u->url);
|
2001-03-30 21:05:54 -05:00
|
|
|
|
if (*dt & TEXTHTML)
|
2001-12-04 16:03:35 -05:00
|
|
|
|
register_html (u->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
|
|
|
|
|
2002-01-30 14:12:20 -05:00
|
|
|
|
if (redirection_count)
|
2001-11-26 00:36:33 -05:00
|
|
|
|
{
|
|
|
|
|
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;
|
2002-04-14 00:22:47 -04:00
|
|
|
|
RESTORE_POST_DATA;
|
2001-04-01 19:50:04 -04:00
|
|
|
|
|
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
|
|
|
|
|
2001-11-30 16:17:53 -05:00
|
|
|
|
url_list = (html ? get_urls_html (file, NULL, 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-12-17 10:00:25 -05:00
|
|
|
|
if (first_retrieval)
|
2000-12-05 19:24:40 -05:00
|
|
|
|
{
|
2001-12-17 10:00:25 -05:00
|
|
|
|
/* Don't sleep before the very first retrieval. */
|
|
|
|
|
first_retrieval = 0;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
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
|
2003-09-20 19:12:18 -04:00
|
|
|
|
usleep (1000000L * opt.waitretry);
|
2001-12-17 10:00:25 -05:00
|
|
|
|
}
|
|
|
|
|
else if (opt.wait)
|
|
|
|
|
{
|
|
|
|
|
if (!opt.random_wait || count > 1)
|
|
|
|
|
/* If random-wait is not specified, or if we are sleeping
|
|
|
|
|
between retries of the same download, sleep the fixed
|
|
|
|
|
interval. */
|
2003-09-20 19:12:18 -04:00
|
|
|
|
usleep (1000000L * opt.wait);
|
2001-12-17 10:00:25 -05:00
|
|
|
|
else
|
2001-11-25 16:23:15 -05:00
|
|
|
|
{
|
2001-12-17 10:00:25 -05:00
|
|
|
|
/* Sleep a random amount of time averaging in opt.wait
|
|
|
|
|
seconds. The sleeping amount ranges from 0 to
|
|
|
|
|
opt.wait*2, inclusive. */
|
2003-09-20 19:12:18 -04:00
|
|
|
|
double waitsecs = 2 * opt.wait * random_float ();
|
|
|
|
|
DEBUGP (("sleep_between_retrievals: avg=%f,sleep=%f\n",
|
|
|
|
|
opt.wait, waitsecs));
|
|
|
|
|
usleep (1000000L * waitsecs);
|
2001-11-25 16:23:15 -05:00
|
|
|
|
}
|
2000-12-05 19:24:40 -05:00
|
|
|
|
}
|
|
|
|
|
}
|
2003-09-21 18:47:14 -04:00
|
|
|
|
|
|
|
|
|
/* Free the linked list of urlpos. */
|
|
|
|
|
void
|
|
|
|
|
free_urlpos (struct urlpos *l)
|
|
|
|
|
{
|
|
|
|
|
while (l)
|
|
|
|
|
{
|
|
|
|
|
struct urlpos *next = l->next;
|
|
|
|
|
if (l->url)
|
|
|
|
|
url_free (l->url);
|
|
|
|
|
FREE_MAYBE (l->local_name);
|
|
|
|
|
xfree (l);
|
|
|
|
|
l = next;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Rotate FNAME opt.backups times */
|
|
|
|
|
void
|
|
|
|
|
rotate_backups(const char *fname)
|
|
|
|
|
{
|
|
|
|
|
int maxlen = strlen (fname) + 1 + numdigit (opt.backups) + 1;
|
|
|
|
|
char *from = (char *)alloca (maxlen);
|
|
|
|
|
char *to = (char *)alloca (maxlen);
|
|
|
|
|
struct stat sb;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
if (stat (fname, &sb) == 0)
|
|
|
|
|
if (S_ISREG (sb.st_mode) == 0)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
for (i = opt.backups; i > 1; i--)
|
|
|
|
|
{
|
|
|
|
|
sprintf (from, "%s.%d", fname, i - 1);
|
|
|
|
|
sprintf (to, "%s.%d", fname, i);
|
|
|
|
|
rename (from, to);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
sprintf (to, "%s.%d", fname, 1);
|
|
|
|
|
rename(fname, to);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static int no_proxy_match PARAMS ((const char *, const char **));
|
|
|
|
|
|
|
|
|
|
/* Return the URL of the proxy appropriate for url U. */
|
|
|
|
|
|
|
|
|
|
static char *
|
|
|
|
|
getproxy (struct url *u)
|
|
|
|
|
{
|
|
|
|
|
char *proxy = NULL;
|
|
|
|
|
char *rewritten_url;
|
|
|
|
|
static char rewritten_storage[1024];
|
|
|
|
|
|
|
|
|
|
if (!opt.use_proxy)
|
|
|
|
|
return NULL;
|
|
|
|
|
if (!no_proxy_match (u->host, (const char **)opt.no_proxy))
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
switch (u->scheme)
|
|
|
|
|
{
|
|
|
|
|
case SCHEME_HTTP:
|
|
|
|
|
proxy = opt.http_proxy ? opt.http_proxy : getenv ("http_proxy");
|
|
|
|
|
break;
|
|
|
|
|
#ifdef HAVE_SSL
|
|
|
|
|
case SCHEME_HTTPS:
|
|
|
|
|
proxy = opt.https_proxy ? opt.https_proxy : getenv ("https_proxy");
|
|
|
|
|
break;
|
|
|
|
|
#endif
|
|
|
|
|
case SCHEME_FTP:
|
|
|
|
|
proxy = opt.ftp_proxy ? opt.ftp_proxy : getenv ("ftp_proxy");
|
|
|
|
|
break;
|
|
|
|
|
case SCHEME_INVALID:
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (!proxy || !*proxy)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
|
|
/* Handle shorthands. `rewritten_storage' is a kludge to allow
|
|
|
|
|
getproxy() to return static storage. */
|
|
|
|
|
rewritten_url = rewrite_shorthand_url (proxy);
|
|
|
|
|
if (rewritten_url)
|
|
|
|
|
{
|
|
|
|
|
strncpy (rewritten_storage, rewritten_url, sizeof(rewritten_storage));
|
|
|
|
|
rewritten_storage[sizeof (rewritten_storage) - 1] = '\0';
|
|
|
|
|
proxy = rewritten_storage;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return proxy;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Should a host be accessed through proxy, concerning no_proxy? */
|
|
|
|
|
int
|
|
|
|
|
no_proxy_match (const char *host, const char **no_proxy)
|
|
|
|
|
{
|
|
|
|
|
if (!no_proxy)
|
|
|
|
|
return 1;
|
|
|
|
|
else
|
|
|
|
|
return !sufmatch (no_proxy, host);
|
|
|
|
|
}
|