1999-12-02 02:42:23 -05:00
|
|
|
|
/* File retrieval.
|
2000-11-01 20:50:03 -05:00
|
|
|
|
Copyright (C) 1995, 1996, 1997, 1998, 2000 Free Software Foundation, Inc.
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
This file is part of Wget.
|
|
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
|
|
|
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
|
|
|
|
|
along with this program; if not, write to the Free Software
|
|
|
|
|
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 <ctype.h>
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
|
|
|
|
|
#include "wget.h"
|
|
|
|
|
#include "utils.h"
|
|
|
|
|
#include "retr.h"
|
|
|
|
|
#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
|
|
|
|
|
2000-10-30 16:07:04 -05:00
|
|
|
|
#ifdef WINDOWS
|
|
|
|
|
LARGE_INTEGER internal_time;
|
|
|
|
|
#else
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* Internal variables used by the timer. */
|
|
|
|
|
static long internal_secs, internal_msecs;
|
2000-10-30 16:07:04 -05:00
|
|
|
|
#endif
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
void logflush PARAMS ((void));
|
|
|
|
|
|
|
|
|
|
/* From http.c. */
|
|
|
|
|
uerr_t http_loop PARAMS ((struct urlinfo *, char **, int *));
|
|
|
|
|
|
|
|
|
|
/* Flags for show_progress(). */
|
|
|
|
|
enum spflags { SP_NONE, SP_INIT, SP_FINISH };
|
|
|
|
|
|
|
|
|
|
static int show_progress PARAMS ((long, long, enum spflags));
|
|
|
|
|
|
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,
|
2000-11-19 15:50:10 -05:00
|
|
|
|
struct rbuf *rbuf, int use_expected)
|
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];
|
|
|
|
|
|
|
|
|
|
*len = restval;
|
|
|
|
|
if (opt.verbose)
|
|
|
|
|
show_progress (restval, expected, SP_INIT);
|
|
|
|
|
if (rbuf && RBUF_FD (rbuf) == fd)
|
|
|
|
|
{
|
|
|
|
|
while ((res = rbuf_flush (rbuf, c, sizeof (c))) != 0)
|
|
|
|
|
{
|
|
|
|
|
if (fwrite (c, sizeof (char), res, fp) < res)
|
|
|
|
|
return -2;
|
|
|
|
|
if (opt.verbose)
|
|
|
|
|
{
|
|
|
|
|
if (show_progress (res, expected, SP_NONE))
|
|
|
|
|
fflush (fp);
|
|
|
|
|
}
|
|
|
|
|
*len += res;
|
|
|
|
|
}
|
|
|
|
|
}
|
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));
|
|
|
|
|
res = iread (fd, c, amount_to_read);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (res > 0)
|
|
|
|
|
{
|
|
|
|
|
if (fwrite (c, sizeof (char), res, fp) < res)
|
|
|
|
|
return -2;
|
|
|
|
|
if (opt.verbose)
|
|
|
|
|
{
|
|
|
|
|
if (show_progress (res, expected, SP_NONE))
|
|
|
|
|
fflush (fp);
|
|
|
|
|
}
|
|
|
|
|
*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;
|
|
|
|
|
if (opt.verbose)
|
|
|
|
|
show_progress (0, expected, SP_FINISH);
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
print_percentage (long bytes, long expected)
|
|
|
|
|
{
|
|
|
|
|
int percentage = (int)(100.0 * bytes / expected);
|
|
|
|
|
logprintf (LOG_VERBOSE, " [%3d%%]", percentage);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Show the dotted progress report of file loading. Called with
|
|
|
|
|
length and a flag to tell it whether to reset or not. It keeps the
|
|
|
|
|
offset information in static local variables.
|
|
|
|
|
|
|
|
|
|
Return value: 1 or 0, designating whether any dots have been drawn.
|
|
|
|
|
|
|
|
|
|
If the init argument is set, the routine will initialize.
|
|
|
|
|
|
|
|
|
|
If the res is non-zero, res/line_bytes lines are skipped
|
|
|
|
|
(meaning the appropriate number ok kilobytes), and the number of
|
|
|
|
|
"dots" fitting on the first line are drawn as ','. */
|
|
|
|
|
static int
|
|
|
|
|
show_progress (long res, long expected, enum spflags flags)
|
|
|
|
|
{
|
|
|
|
|
static long line_bytes;
|
|
|
|
|
static long offs;
|
|
|
|
|
static int ndot, nrow;
|
|
|
|
|
int any_output = 0;
|
|
|
|
|
|
|
|
|
|
if (flags == SP_FINISH)
|
|
|
|
|
{
|
|
|
|
|
if (expected)
|
|
|
|
|
{
|
|
|
|
|
int dot = ndot;
|
|
|
|
|
char *tmpstr = (char *)alloca (2 * opt.dots_in_line + 1);
|
|
|
|
|
char *tmpp = tmpstr;
|
|
|
|
|
for (; dot < opt.dots_in_line; dot++)
|
|
|
|
|
{
|
|
|
|
|
if (!(dot % opt.dot_spacing))
|
|
|
|
|
*tmpp++ = ' ';
|
|
|
|
|
*tmpp++ = ' ';
|
|
|
|
|
}
|
|
|
|
|
*tmpp = '\0';
|
|
|
|
|
logputs (LOG_VERBOSE, tmpstr);
|
|
|
|
|
print_percentage (nrow * line_bytes + ndot * opt.dot_bytes + offs,
|
|
|
|
|
expected);
|
|
|
|
|
}
|
|
|
|
|
logputs (LOG_VERBOSE, "\n\n");
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Temporarily disable flushing. */
|
|
|
|
|
opt.no_flush = 1;
|
|
|
|
|
/* init set means initialization. If res is set, it also means that
|
|
|
|
|
the retrieval is *not* done from the beginning. The part that
|
|
|
|
|
was already retrieved is not shown again. */
|
|
|
|
|
if (flags == SP_INIT)
|
|
|
|
|
{
|
|
|
|
|
/* Generic initialization of static variables. */
|
|
|
|
|
offs = 0L;
|
|
|
|
|
ndot = nrow = 0;
|
|
|
|
|
line_bytes = (long)opt.dots_in_line * opt.dot_bytes;
|
|
|
|
|
if (res)
|
|
|
|
|
{
|
|
|
|
|
if (res >= line_bytes)
|
|
|
|
|
{
|
|
|
|
|
nrow = res / line_bytes;
|
|
|
|
|
res %= line_bytes;
|
|
|
|
|
logprintf (LOG_VERBOSE,
|
|
|
|
|
_("\n [ skipping %dK ]"),
|
|
|
|
|
(int) ((nrow * line_bytes) / 1024));
|
|
|
|
|
ndot = 0;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
logprintf (LOG_VERBOSE, "\n%5ldK ->", nrow * line_bytes / 1024);
|
|
|
|
|
}
|
|
|
|
|
/* Offset gets incremented by current value. */
|
|
|
|
|
offs += res;
|
|
|
|
|
/* While offset is >= opt.dot_bytes, print dots, taking care to
|
|
|
|
|
precede every 50th dot with a status message. */
|
|
|
|
|
for (; offs >= opt.dot_bytes; offs -= opt.dot_bytes)
|
|
|
|
|
{
|
|
|
|
|
if (!(ndot % opt.dot_spacing))
|
|
|
|
|
logputs (LOG_VERBOSE, " ");
|
|
|
|
|
any_output = 1;
|
|
|
|
|
logputs (LOG_VERBOSE, flags == SP_INIT ? "," : ".");
|
|
|
|
|
++ndot;
|
|
|
|
|
if (ndot == opt.dots_in_line)
|
|
|
|
|
{
|
|
|
|
|
ndot = 0;
|
|
|
|
|
++nrow;
|
|
|
|
|
if (expected)
|
|
|
|
|
print_percentage (nrow * line_bytes, expected);
|
|
|
|
|
logprintf (LOG_VERBOSE, "\n%5ldK ->", nrow * line_bytes / 1024);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
/* Reenable flushing. */
|
|
|
|
|
opt.no_flush = 0;
|
|
|
|
|
if (any_output)
|
|
|
|
|
/* Force flush. #### Oh, what a kludge! */
|
|
|
|
|
logflush ();
|
|
|
|
|
return any_output;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Reset the internal timer. */
|
|
|
|
|
void
|
|
|
|
|
reset_timer (void)
|
|
|
|
|
{
|
2000-10-30 16:07:04 -05:00
|
|
|
|
#ifndef WINDOWS
|
|
|
|
|
/* Under Unix, the preferred way to measure the passage of time is
|
|
|
|
|
through gettimeofday() because of its granularity. However, on
|
|
|
|
|
some old or weird systems, gettimeofday() might not be available.
|
|
|
|
|
There we use the simple time(). */
|
|
|
|
|
# ifdef HAVE_GETTIMEOFDAY
|
1999-12-02 02:42:23 -05:00
|
|
|
|
struct timeval t;
|
|
|
|
|
gettimeofday (&t, NULL);
|
|
|
|
|
internal_secs = t.tv_sec;
|
|
|
|
|
internal_msecs = t.tv_usec / 1000;
|
2000-10-30 16:07:04 -05:00
|
|
|
|
# else /* not HAVE_GETTIMEOFDAY */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
internal_secs = time (NULL);
|
|
|
|
|
internal_msecs = 0;
|
2000-10-30 16:07:04 -05:00
|
|
|
|
# endif /* not HAVE_GETTIMEOFDAY */
|
|
|
|
|
#else /* WINDOWS */
|
|
|
|
|
/* Under Windows, use Windows-specific APIs. */
|
|
|
|
|
FILETIME ft;
|
|
|
|
|
SYSTEMTIME st;
|
|
|
|
|
GetSystemTime(&st);
|
|
|
|
|
SystemTimeToFileTime(&st,&ft);
|
|
|
|
|
internal_time.HighPart = ft.dwHighDateTime;
|
|
|
|
|
internal_time.LowPart = ft.dwLowDateTime;
|
|
|
|
|
#endif /* WINDOWS */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the time elapsed from the last call to reset_timer(), in
|
|
|
|
|
milliseconds. */
|
|
|
|
|
long
|
|
|
|
|
elapsed_time (void)
|
|
|
|
|
{
|
2000-10-30 16:07:04 -05:00
|
|
|
|
#ifndef WINDOWS
|
|
|
|
|
# ifdef HAVE_GETTIMEOFDAY
|
1999-12-02 02:42:23 -05:00
|
|
|
|
struct timeval t;
|
|
|
|
|
gettimeofday (&t, NULL);
|
|
|
|
|
return ((t.tv_sec - internal_secs) * 1000
|
|
|
|
|
+ (t.tv_usec / 1000 - internal_msecs));
|
2000-10-30 16:07:04 -05:00
|
|
|
|
# else /* not HAVE_GETTIMEOFDAY */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
return 1000 * ((long)time (NULL) - internal_secs);
|
2000-10-30 16:07:04 -05:00
|
|
|
|
# endif /* not HAVE_GETTIMEOFDAY */
|
|
|
|
|
#else /* WINDOWS */
|
|
|
|
|
FILETIME ft;
|
|
|
|
|
SYSTEMTIME st;
|
|
|
|
|
LARGE_INTEGER li;
|
|
|
|
|
GetSystemTime(&st);
|
|
|
|
|
SystemTimeToFileTime(&st,&ft);
|
|
|
|
|
li.HighPart = ft.dwHighDateTime;
|
|
|
|
|
li.LowPart = ft.dwLowDateTime;
|
|
|
|
|
return (long) ((li.QuadPart - internal_time.QuadPart) / 1e4);
|
|
|
|
|
#endif /* WINDOWS */
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Print out the appropriate download rate. Appropriate means that if
|
|
|
|
|
rate is > 1024 bytes per second, kilobytes are used, and if rate >
|
|
|
|
|
1024 * 1024 bps, megabytes are used. */
|
|
|
|
|
char *
|
|
|
|
|
rate (long bytes, long msecs)
|
|
|
|
|
{
|
|
|
|
|
static char res[15];
|
|
|
|
|
double dlrate;
|
|
|
|
|
|
|
|
|
|
if (!msecs)
|
|
|
|
|
++msecs;
|
|
|
|
|
dlrate = (double)1000 * bytes / msecs;
|
|
|
|
|
/* #### Should these strings be translatable? */
|
|
|
|
|
if (dlrate < 1024.0)
|
|
|
|
|
sprintf (res, "%.2f B/s", dlrate);
|
|
|
|
|
else if (dlrate < 1024.0 * 1024.0)
|
|
|
|
|
sprintf (res, "%.2f KB/s", dlrate / 1024.0);
|
|
|
|
|
else
|
|
|
|
|
sprintf (res, "%.2f MB/s", dlrate / (1024.0 * 1024.0));
|
|
|
|
|
return res;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define USE_PROXY_P(u) (opt.use_proxy && getproxy((u)->proto) \
|
|
|
|
|
&& no_proxy_match((u)->host, \
|
|
|
|
|
(const char **)opt.no_proxy))
|
|
|
|
|
|
|
|
|
|
/* Retrieve the given URL. Decides which loop to call -- HTTP, FTP,
|
|
|
|
|
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;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
int local_use_proxy;
|
|
|
|
|
char *mynewloc, *proxy;
|
|
|
|
|
struct urlinfo *u;
|
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;
|
|
|
|
|
|
|
|
|
|
u = newurl ();
|
2000-10-31 14:25:32 -05:00
|
|
|
|
/* Parse the URL. */
|
2000-10-31 23:21:50 -05:00
|
|
|
|
result = parseurl (url, u, 0);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (result != URLOK)
|
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, "%s: %s.\n", url, uerrmsg (result));
|
2000-10-31 23:21:50 -05:00
|
|
|
|
freeurl (u, 1);
|
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 result;
|
|
|
|
|
}
|
|
|
|
|
|
2000-10-31 23:21:50 -05:00
|
|
|
|
redirected:
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
/* Set the referer. */
|
|
|
|
|
if (refurl)
|
|
|
|
|
u->referer = xstrdup (refurl);
|
2000-07-14 10:15:23 -04:00
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (opt.referer)
|
|
|
|
|
u->referer = xstrdup (opt.referer);
|
|
|
|
|
else
|
|
|
|
|
u->referer = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
local_use_proxy = USE_PROXY_P (u);
|
|
|
|
|
if (local_use_proxy)
|
|
|
|
|
{
|
|
|
|
|
struct urlinfo *pu = newurl ();
|
|
|
|
|
|
|
|
|
|
/* Copy the original URL to new location. */
|
|
|
|
|
memcpy (pu, u, sizeof (*u));
|
|
|
|
|
pu->proxy = NULL; /* A minor correction :) */
|
|
|
|
|
/* Initialize u to nil. */
|
|
|
|
|
memset (u, 0, sizeof (*u));
|
|
|
|
|
u->proxy = pu;
|
|
|
|
|
/* Get the appropriate proxy server, appropriate for the
|
|
|
|
|
current protocol. */
|
|
|
|
|
proxy = getproxy (pu->proto);
|
|
|
|
|
if (!proxy)
|
|
|
|
|
{
|
|
|
|
|
logputs (LOG_NOTQUIET, _("Could not find proxy host.\n"));
|
|
|
|
|
freeurl (u, 1);
|
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;
|
|
|
|
|
}
|
|
|
|
|
/* Parse the proxy URL. */
|
|
|
|
|
result = parseurl (proxy, u, 0);
|
|
|
|
|
if (result != URLOK || u->proto != URLHTTP)
|
|
|
|
|
{
|
|
|
|
|
if (u->proto == URLHTTP)
|
2000-03-02 01:33:48 -05:00
|
|
|
|
logprintf (LOG_NOTQUIET, "Proxy %s: %s.\n", proxy, uerrmsg(result));
|
1999-12-02 02:42:23 -05:00
|
|
|
|
else
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("Proxy %s: Must be HTTP.\n"), proxy);
|
|
|
|
|
freeurl (u, 1);
|
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;
|
|
|
|
|
}
|
|
|
|
|
u->proto = URLHTTP;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
assert (u->proto != URLFILE); /* #### Implement me! */
|
|
|
|
|
mynewloc = NULL;
|
|
|
|
|
|
|
|
|
|
if (u->proto == URLHTTP)
|
|
|
|
|
result = http_loop (u, &mynewloc, dt);
|
|
|
|
|
else if (u->proto == URLFTP)
|
|
|
|
|
{
|
|
|
|
|
/* 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;
|
|
|
|
|
/* 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
|
|
|
|
|
`.htm', case-insensitive.
|
|
|
|
|
|
|
|
|
|
#### All of this is, of course, crap. These types should be
|
|
|
|
|
determined through mailcap. */
|
2000-10-31 23:21:50 -05:00
|
|
|
|
if (redirections && u->local && (u->proto == URLFTP ))
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
char *suf = suffix (u->local);
|
|
|
|
|
if (suf && (!strcasecmp (suf, "html") || !strcasecmp (suf, "htm")))
|
|
|
|
|
*dt |= TEXTHTML;
|
|
|
|
|
FREE_MAYBE (suf);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
location_changed = (result == NEWLOCATION);
|
|
|
|
|
if (location_changed)
|
|
|
|
|
{
|
2000-10-31 23:21:50 -05:00
|
|
|
|
char *construced_newloc;
|
|
|
|
|
uerr_t newloc_result;
|
|
|
|
|
struct urlinfo *newloc_struct;
|
|
|
|
|
|
|
|
|
|
assert (mynewloc != NULL);
|
|
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
construced_newloc = url_concat (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. */
|
|
|
|
|
newloc_struct = newurl ();
|
|
|
|
|
newloc_result = parseurl (mynewloc, newloc_struct, 1);
|
|
|
|
|
if (newloc_result != URLOK)
|
2000-10-31 14:25:32 -05:00
|
|
|
|
{
|
2000-10-31 23:21:50 -05:00
|
|
|
|
logprintf (LOG_NOTQUIET, "%s: %s.\n", mynewloc, uerrmsg (newloc_result));
|
|
|
|
|
freeurl (newloc_struct, 1);
|
|
|
|
|
freeurl (u, 1);
|
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
|
|
|
|
|
|
|
|
|
/* Now mynewloc will become newloc_struct->url, because if the
|
|
|
|
|
Location contained relative paths like .././something, we
|
|
|
|
|
don't want that propagating as url. */
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (mynewloc);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
mynewloc = xstrdup (newloc_struct->url);
|
|
|
|
|
|
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
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* The new location is OK. Let's check for redirection cycle by
|
|
|
|
|
peeking through the history of redirections. */
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (string_set_exists (redirections, newloc_struct->url))
|
2000-10-31 23:21:50 -05:00
|
|
|
|
{
|
|
|
|
|
logprintf (LOG_NOTQUIET, _("%s: Redirection cycle detected.\n"),
|
|
|
|
|
mynewloc);
|
|
|
|
|
freeurl (newloc_struct, 1);
|
|
|
|
|
freeurl (u, 1);
|
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;
|
|
|
|
|
}
|
2000-11-19 15:50:10 -05:00
|
|
|
|
string_set_add (redirections, newloc_struct->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;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
freeurl (u, 1);
|
2000-10-31 23:21:50 -05:00
|
|
|
|
u = newloc_struct;
|
|
|
|
|
goto redirected;
|
1999-12-02 02:42:23 -05:00
|
|
|
|
}
|
2000-10-31 23:21:50 -05:00
|
|
|
|
|
1999-12-02 02:42:23 -05:00
|
|
|
|
if (file)
|
|
|
|
|
{
|
|
|
|
|
if (u->local)
|
|
|
|
|
*file = xstrdup (u->local);
|
|
|
|
|
else
|
|
|
|
|
*file = NULL;
|
|
|
|
|
}
|
|
|
|
|
freeurl (u, 1);
|
2000-11-19 15:50:10 -05:00
|
|
|
|
if (redirections)
|
|
|
|
|
string_set_free (redirections);
|
1999-12-02 02:42:23 -05:00
|
|
|
|
|
|
|
|
|
if (newloc)
|
|
|
|
|
*newloc = url;
|
|
|
|
|
else
|
2000-11-22 11:58:28 -05:00
|
|
|
|
xfree (url);
|
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;
|
|
|
|
|
urlpos *url_list, *cur_url;
|
|
|
|
|
|
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. */
|
|
|
|
|
recursive_reset ();
|
|
|
|
|
for (cur_url = url_list; cur_url; cur_url = cur_url->next, ++*count)
|
|
|
|
|
{
|
|
|
|
|
char *filename, *new_file;
|
|
|
|
|
int dt;
|
|
|
|
|
|
2000-11-01 18:17:31 -05:00
|
|
|
|
if (downloaded_exceeds_quota ())
|
1999-12-02 02:42:23 -05:00
|
|
|
|
{
|
|
|
|
|
status = QUOTEXC;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
status = retrieve_url (cur_url->url, &filename, &new_file, NULL, &dt);
|
|
|
|
|
if (opt.recursive && status == RETROK && (dt & TEXTHTML))
|
2000-03-02 01:33:48 -05:00
|
|
|
|
status = recursive_retrieve (filename, new_file ? new_file
|
|
|
|
|
: cur_url->url);
|
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;
|
|
|
|
|
}
|