1 /* Various utility functions.
2 Copyright (C) 1996-2005 Free Software Foundation, Inc.
4 This file is part of GNU Wget.
6 GNU Wget is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 GNU Wget is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with Wget; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 In addition, as a special exception, the Free Software Foundation
21 gives permission to link the code of its release of Wget with the
22 OpenSSL project's "OpenSSL" library (or with modified versions of it
23 that use the same license as the "OpenSSL" library), and distribute
24 the linked executables. You must obey the GNU General Public License
25 in all respects for all of the code used other than "OpenSSL". If you
26 modify this file, you may extend this exception to your version of the
27 file, but you are not obligated to do so. If you do not wish to do
28 so, delete this exception statement from your version. */
36 #ifdef HAVE_SYS_TIME_H
37 # include <sys/time.h>
43 # include <sys/mman.h>
51 #ifdef HAVE_SYS_UTIME_H
52 # include <sys/utime.h>
56 # include <libc.h> /* for access() */
63 /* For TIOCGWINSZ and friends: */
64 #ifdef HAVE_SYS_IOCTL_H
65 # include <sys/ioctl.h>
71 /* Needed for Unix version of run_with_timeout. */
75 #ifndef HAVE_SIGSETJMP
76 /* If sigsetjmp is a macro, configure won't pick it up. */
78 # define HAVE_SIGSETJMP
82 #undef USE_SIGNAL_TIMEOUT
83 #if defined(HAVE_SIGSETJMP) || defined(HAVE_SIGBLOCK)
84 # define USE_SIGNAL_TIMEOUT
91 /* Utility function: like xstrdup(), but also lowercases S. */
94 xstrdup_lower (const char *s)
96 char *copy = xstrdup (s);
103 /* Copy the string formed by two pointers (one on the beginning, other
104 on the char after the last char) to a new, malloc-ed location.
107 strdupdelim (const char *beg, const char *end)
109 char *res = xmalloc (end - beg + 1);
110 memcpy (res, beg, end - beg);
111 res[end - beg] = '\0';
115 /* Parse a string containing comma-separated elements, and return a
116 vector of char pointers with the elements. Spaces following the
117 commas are ignored. */
119 sepstring (const char *s)
133 res = xrealloc (res, (i + 2) * sizeof (char *));
134 res[i] = strdupdelim (p, s);
137 /* Skip the blanks following the ','. */
145 res = xrealloc (res, (i + 2) * sizeof (char *));
146 res[i] = strdupdelim (p, s);
151 /* Like sprintf, but allocates a string of sufficient size with malloc
152 and returns it. GNU libc has a similar function named asprintf,
153 which requires the pointer to the string to be passed. */
156 aprintf (const char *fmt, ...)
158 /* This function is implemented using vsnprintf, which we provide
159 for the systems that don't have it. Therefore, it should be 100%
163 char *str = xmalloc (size);
170 /* See log_vprintf_internal for explanation why it's OK to rely
171 on the return value of vsnprintf. */
173 va_start (args, fmt);
174 n = vsnprintf (str, size, fmt, args);
177 /* If the printing worked, return the string. */
178 if (n > -1 && n < size)
181 /* Else try again with a larger buffer. */
182 if (n > -1) /* C99 */
183 size = n + 1; /* precisely what is needed */
185 size <<= 1; /* twice the old size */
186 str = xrealloc (str, size);
190 /* Concatenate the NULL-terminated list of string arguments into
191 freshly allocated space. */
194 concat_strings (const char *str0, ...)
197 int saved_lengths[5]; /* inspired by Apache's apr_pstrcat */
200 const char *next_str;
201 int total_length = 0;
204 /* Calculate the length of and allocate the resulting string. */
207 va_start (args, str0);
208 for (next_str = str0; next_str != NULL; next_str = va_arg (args, char *))
210 int len = strlen (next_str);
211 if (argcount < countof (saved_lengths))
212 saved_lengths[argcount++] = len;
216 p = ret = xmalloc (total_length + 1);
218 /* Copy the strings into the allocated space. */
221 va_start (args, str0);
222 for (next_str = str0; next_str != NULL; next_str = va_arg (args, char *))
225 if (argcount < countof (saved_lengths))
226 len = saved_lengths[argcount++];
228 len = strlen (next_str);
229 memcpy (p, next_str, len);
238 /* Return pointer to a static char[] buffer in which zero-terminated
239 string-representation of TM (in form hh:mm:ss) is printed.
241 If TM is NULL, the current time will be used. */
244 time_str (time_t *tm)
246 static char output[15];
248 time_t secs = tm ? *tm : time (NULL);
252 /* In case of error, return the empty string. Maybe we should
253 just abort if this happens? */
257 ptm = localtime (&secs);
258 sprintf (output, "%02d:%02d:%02d", ptm->tm_hour, ptm->tm_min, ptm->tm_sec);
262 /* Like the above, but include the date: YYYY-MM-DD hh:mm:ss. */
265 datetime_str (time_t *tm)
267 static char output[20]; /* "YYYY-MM-DD hh:mm:ss" + \0 */
269 time_t secs = tm ? *tm : time (NULL);
273 /* In case of error, return the empty string. Maybe we should
274 just abort if this happens? */
278 ptm = localtime (&secs);
279 sprintf (output, "%04d-%02d-%02d %02d:%02d:%02d",
280 ptm->tm_year + 1900, ptm->tm_mon + 1, ptm->tm_mday,
281 ptm->tm_hour, ptm->tm_min, ptm->tm_sec);
285 /* The Windows versions of the following two functions are defined in
290 fork_to_background (void)
293 /* Whether we arrange our own version of opt.lfilename here. */
294 bool logfile_changed = false;
298 /* We must create the file immediately to avoid either a race
299 condition (which arises from using unique_name and failing to
300 use fopen_excl) or lying to the user about the log file name
301 (which arises from using unique_name, printing the name, and
302 using fopen_excl later on.) */
303 FILE *new_log_fp = unique_create (DEFAULT_LOGFILE, false, &opt.lfilename);
306 logfile_changed = true;
319 /* parent, no error */
320 printf (_("Continuing in background, pid %d.\n"), (int) pid);
322 printf (_("Output will be written to `%s'.\n"), opt.lfilename);
323 exit (0); /* #### should we use _exit()? */
326 /* child: give up the privileges and keep running. */
328 freopen ("/dev/null", "r", stdin);
329 freopen ("/dev/null", "w", stdout);
330 freopen ("/dev/null", "w", stderr);
332 #endif /* not WINDOWS */
334 /* "Touch" FILE, i.e. make its mtime ("modified time") equal the time
335 specified with TM. The atime ("access time") is set to the current
339 touch (const char *file, time_t tm)
341 #ifdef HAVE_STRUCT_UTIMBUF
342 struct utimbuf times;
350 times.actime = time (NULL);
351 if (utime (file, ×) == -1)
352 logprintf (LOG_NOTQUIET, "utime(%s): %s\n", file, strerror (errno));
355 /* Checks if FILE is a symbolic link, and removes it if it is. Does
356 nothing under MS-Windows. */
358 remove_link (const char *file)
363 if (lstat (file, &st) == 0 && S_ISLNK (st.st_mode))
365 DEBUGP (("Unlinking %s (symlink).\n", file));
368 logprintf (LOG_VERBOSE, _("Failed to unlink symlink `%s': %s\n"),
369 file, strerror (errno));
374 /* Does FILENAME exist? This is quite a lousy implementation, since
375 it supplies no error codes -- only a yes-or-no answer. Thus it
376 will return that a file does not exist if, e.g., the directory is
377 unreadable. I don't mind it too much currently, though. The
378 proper way should, of course, be to have a third, error state,
379 other than true/false, but that would introduce uncalled-for
380 additional complexity to the callers. */
382 file_exists_p (const char *filename)
385 return access (filename, F_OK) >= 0;
388 return stat (filename, &buf) >= 0;
392 /* Returns 0 if PATH is a directory, 1 otherwise (any kind of file).
393 Returns 0 on error. */
395 file_non_directory_p (const char *path)
398 /* Use lstat() rather than stat() so that symbolic links pointing to
399 directories can be identified correctly. */
400 if (lstat (path, &buf) != 0)
402 return S_ISDIR (buf.st_mode) ? false : true;
405 /* Return the size of file named by FILENAME, or -1 if it cannot be
406 opened or seeked into. */
408 file_size (const char *filename)
410 #if defined(HAVE_FSEEKO) && defined(HAVE_FTELLO)
412 /* We use fseek rather than stat to determine the file size because
413 that way we can also verify that the file is readable without
414 explicitly checking for permissions. Inspired by the POST patch
416 FILE *fp = fopen (filename, "rb");
419 fseeko (fp, 0, SEEK_END);
425 if (stat (filename, &st) < 0)
431 /* stat file names named PREFIX.1, PREFIX.2, etc., until one that
432 doesn't exist is found. Return a freshly allocated copy of the
436 unique_name_1 (const char *prefix)
439 int plen = strlen (prefix);
440 char *template = (char *)alloca (plen + 1 + 24);
441 char *template_tail = template + plen;
443 memcpy (template, prefix, plen);
444 *template_tail++ = '.';
447 number_to_string (template_tail, count++);
448 while (file_exists_p (template));
450 return xstrdup (template);
453 /* Return a unique file name, based on FILE.
455 More precisely, if FILE doesn't exist, it is returned unmodified.
456 If not, FILE.1 is tried, then FILE.2, etc. The first FILE.<number>
457 file name that doesn't exist is returned.
459 The resulting file is not created, only verified that it didn't
460 exist at the point in time when the function was called.
461 Therefore, where security matters, don't rely that the file created
462 by this function exists until you open it with O_EXCL or
465 If ALLOW_PASSTHROUGH is 0, it always returns a freshly allocated
466 string. Otherwise, it may return FILE if the file doesn't exist
467 (and therefore doesn't need changing). */
470 unique_name (const char *file, bool allow_passthrough)
472 /* If the FILE itself doesn't exist, return it without
474 if (!file_exists_p (file))
475 return allow_passthrough ? (char *)file : xstrdup (file);
477 /* Otherwise, find a numeric suffix that results in unused file name
479 return unique_name_1 (file);
482 /* Create a file based on NAME, except without overwriting an existing
483 file with that name. Providing O_EXCL is correctly implemented,
484 this function does not have the race condition associated with
485 opening the file returned by unique_name. */
488 unique_create (const char *name, bool binary, char **opened_name)
490 /* unique file name, based on NAME */
491 char *uname = unique_name (name, false);
493 while ((fp = fopen_excl (uname, binary)) == NULL && errno == EEXIST)
496 uname = unique_name (name, false);
498 if (opened_name && fp != NULL)
501 *opened_name = uname;
513 /* Open the file for writing, with the addition that the file is
514 opened "exclusively". This means that, if the file already exists,
515 this function will *fail* and errno will be set to EEXIST. If
516 BINARY is set, the file will be opened in binary mode, equivalent
519 If opening the file fails for any reason, including the file having
520 previously existed, this function returns NULL and sets errno
524 fopen_excl (const char *fname, bool binary)
528 int flags = O_WRONLY | O_CREAT | O_EXCL;
533 fd = open (fname, flags, 0666);
536 return fdopen (fd, binary ? "wb" : "w");
537 #else /* not O_EXCL */
538 /* Manually check whether the file exists. This is prone to race
539 conditions, but systems without O_EXCL haven't deserved
541 if (file_exists_p (fname))
546 return fopen (fname, binary ? "wb" : "w");
547 #endif /* not O_EXCL */
550 /* Create DIRECTORY. If some of the pathname components of DIRECTORY
551 are missing, create them first. In case any mkdir() call fails,
552 return its error status. Returns 0 on successful completion.
554 The behaviour of this function should be identical to the behaviour
555 of `mkdir -p' on systems where mkdir supports the `-p' option. */
557 make_directory (const char *directory)
559 int i, ret, quit = 0;
562 /* Make a copy of dir, to be able to write to it. Otherwise, the
563 function is unsafe if called with a read-only char *argument. */
564 STRDUP_ALLOCA (dir, directory);
566 /* If the first character of dir is '/', skip it (and thus enable
567 creation of absolute-pathname directories. */
568 for (i = (*dir == '/'); 1; ++i)
570 for (; dir[i] && dir[i] != '/'; i++)
575 /* Check whether the directory already exists. Allow creation of
576 of intermediate directories to fail, as the initial path components
577 are not necessarily directories! */
578 if (!file_exists_p (dir))
579 ret = mkdir (dir, 0777);
590 /* Merge BASE with FILE. BASE can be a directory or a file name, FILE
591 should be a file name.
593 file_merge("/foo/bar", "baz") => "/foo/baz"
594 file_merge("/foo/bar/", "baz") => "/foo/bar/baz"
595 file_merge("foo", "bar") => "bar"
597 In other words, it's a simpler and gentler version of uri_merge. */
600 file_merge (const char *base, const char *file)
603 const char *cut = (const char *)strrchr (base, '/');
606 return xstrdup (file);
608 result = xmalloc (cut - base + 1 + strlen (file) + 1);
609 memcpy (result, base, cut - base);
610 result[cut - base] = '/';
611 strcpy (result + (cut - base) + 1, file);
616 /* Like fnmatch, but performs a case-insensitive match. */
619 fnmatch_nocase (const char *pattern, const char *string, int flags)
622 /* The FNM_CASEFOLD flag started as a GNU extension, but it is now
623 also present on *BSD platforms, and possibly elsewhere. */
624 return fnmatch (pattern, string, flags | FNM_CASEFOLD);
626 /* Turn PATTERN and STRING to lower case and call fnmatch on them. */
627 char *patcopy = (char *) alloca (strlen (pattern) + 1);
628 char *strcopy = (char *) alloca (strlen (string) + 1);
630 for (p = patcopy; *pattern; pattern++, p++)
631 *p = TOLOWER (*pattern);
633 for (p = strcopy; *string; string++, p++)
634 *p = TOLOWER (*string);
636 return fnmatch (patcopy, strcopy, flags);
640 static bool in_acclist (const char *const *, const char *, bool);
642 /* Determine whether a file is acceptable to be followed, according to
643 lists of patterns to accept/reject. */
645 acceptable (const char *s)
649 while (l && s[l] != '/')
656 return (in_acclist ((const char *const *)opt.accepts, s, true)
657 && !in_acclist ((const char *const *)opt.rejects, s, true));
659 return in_acclist ((const char *const *)opt.accepts, s, true);
661 else if (opt.rejects)
662 return !in_acclist ((const char *const *)opt.rejects, s, true);
666 /* Compare S1 and S2 frontally; S2 must begin with S1. E.g. if S1 is
667 `/something', frontcmp() will return true only if S2 begins with
670 frontcmp (const char *s1, const char *s2)
672 if (!opt.ignore_case)
673 for (; *s1 && *s2 && (*s1 == *s2); ++s1, ++s2);
675 for (; *s1 && *s2 && (TOLOWER (*s1) == TOLOWER (*s2)); ++s1, ++s2);
679 /* Iterate through STRLIST, and return the first element that matches
680 S, through wildcards or front comparison (as appropriate). */
682 proclist (char **strlist, const char *s)
685 int (*matcher) (const char *, const char *, int)
686 = opt.ignore_case ? fnmatch_nocase : fnmatch;
688 for (x = strlist; *x; x++)
690 /* Remove leading '/' */
691 char *p = *x + (**x == '/');
692 if (has_wildcards_p (p))
694 if (matcher (p, s, FNM_PATHNAME) == 0)
706 /* Returns whether DIRECTORY is acceptable for download, wrt the
707 include/exclude lists.
709 The leading `/' is ignored in paths; relative and absolute paths
710 may be freely intermixed. */
713 accdir (const char *directory)
715 /* Remove starting '/'. */
716 if (*directory == '/')
720 if (!proclist (opt.includes, directory))
725 if (proclist (opt.excludes, directory))
731 /* Return true if STRING ends with TAIL. For instance:
733 match_tail ("abc", "bc", false) -> 1
734 match_tail ("abc", "ab", false) -> 0
735 match_tail ("abc", "abc", false) -> 1
737 If FOLD_CASE is true, the comparison will be case-insensitive. */
740 match_tail (const char *string, const char *tail, bool fold_case)
744 /* We want this to be fast, so we code two loops, one with
745 case-folding, one without. */
749 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
750 if (string[i] != tail[j])
755 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
756 if (TOLOWER (string[i]) != TOLOWER (tail[j]))
760 /* If the tail was exhausted, the match was succesful. */
767 /* Checks whether string S matches each element of ACCEPTS. A list
768 element are matched either with fnmatch() or match_tail(),
769 according to whether the element contains wildcards or not.
771 If the BACKWARD is false, don't do backward comparison -- just compare
774 in_acclist (const char *const *accepts, const char *s, bool backward)
776 for (; *accepts; accepts++)
778 if (has_wildcards_p (*accepts))
780 int res = opt.ignore_case
781 ? fnmatch_nocase (*accepts, s, 0) : fnmatch (*accepts, s, 0);
782 /* fnmatch returns 0 if the pattern *does* match the string. */
790 if (match_tail (s, *accepts, opt.ignore_case))
795 int cmp = opt.ignore_case
796 ? strcasecmp (s, *accepts) : strcmp (s, *accepts);
805 /* Return the location of STR's suffix (file extension). Examples:
806 suffix ("foo.bar") -> "bar"
807 suffix ("foo.bar.baz") -> "baz"
808 suffix ("/foo/bar") -> NULL
809 suffix ("/foo.bar/baz") -> NULL */
811 suffix (const char *str)
815 for (i = strlen (str); i && str[i] != '/' && str[i] != '.'; i--)
819 return (char *)str + i;
824 /* Return true if S contains globbing wildcards (`*', `?', `[' or
828 has_wildcards_p (const char *s)
831 if (*s == '*' || *s == '?' || *s == '[' || *s == ']')
836 /* Return true if FNAME ends with a typical HTML suffix. The
837 following (case-insensitive) suffixes are presumed to be HTML
842 ?html (`?' matches one character)
844 #### CAVEAT. This is not necessarily a good indication that FNAME
845 refers to a file that contains HTML! */
847 has_html_suffix_p (const char *fname)
851 if ((suf = suffix (fname)) == NULL)
853 if (!strcasecmp (suf, "html"))
855 if (!strcasecmp (suf, "htm"))
857 if (suf[0] && !strcasecmp (suf + 1, "html"))
862 /* Read a line from FP and return the pointer to freshly allocated
863 storage. The storage space is obtained through malloc() and should
864 be freed with free() when it is no longer needed.
866 The length of the line is not limited, except by available memory.
867 The newline character at the end of line is retained. The line is
868 terminated with a zero character.
870 After end-of-file is encountered without anything being read, NULL
871 is returned. NULL is also returned on error. To distinguish
872 between these two cases, use the stdio function ferror(). */
875 read_whole_line (FILE *fp)
879 char *line = xmalloc (bufsize);
881 while (fgets (line + length, bufsize - length, fp))
883 length += strlen (line + length);
885 /* Possible for example when reading from a binary file where
886 a line begins with \0. */
889 if (line[length - 1] == '\n')
892 /* fgets() guarantees to read the whole line, or to use up the
893 space we've given it. We can double the buffer
896 line = xrealloc (line, bufsize);
898 if (length == 0 || ferror (fp))
903 if (length + 1 < bufsize)
904 /* Relieve the memory from our exponential greediness. We say
905 `length + 1' because the terminating \0 is not included in
906 LENGTH. We don't need to zero-terminate the string ourselves,
907 though, because fgets() does that. */
908 line = xrealloc (line, length + 1);
912 /* Read FILE into memory. A pointer to `struct file_memory' are
913 returned; use struct element `content' to access file contents, and
914 the element `length' to know the file length. `content' is *not*
915 zero-terminated, and you should *not* read or write beyond the [0,
916 length) range of characters.
918 After you are done with the file contents, call read_file_free to
921 Depending on the operating system and the type of file that is
922 being read, read_file() either mmap's the file into memory, or
923 reads the file into the core using read().
925 If file is named "-", fileno(stdin) is used for reading instead.
926 If you want to read from a real file named "-", use "./-" instead. */
929 read_file (const char *file)
932 struct file_memory *fm;
934 bool inhibit_close = false;
936 /* Some magic in the finest tradition of Perl and its kin: if FILE
937 is "-", just use stdin. */
941 inhibit_close = true;
942 /* Note that we don't inhibit mmap() in this case. If stdin is
943 redirected from a regular file, mmap() will still work. */
946 fd = open (file, O_RDONLY);
949 fm = xnew (struct file_memory);
954 if (fstat (fd, &buf) < 0)
956 fm->length = buf.st_size;
957 /* NOTE: As far as I know, the callers of this function never
958 modify the file text. Relying on this would enable us to
959 specify PROT_READ and MAP_SHARED for a marginal gain in
960 efficiency, but at some cost to generality. */
961 fm->content = mmap (NULL, fm->length, PROT_READ | PROT_WRITE,
963 if (fm->content == (char *)MAP_FAILED)
973 /* The most common reason why mmap() fails is that FD does not point
974 to a plain file. However, it's also possible that mmap() doesn't
975 work for a particular type of file. Therefore, whenever mmap()
976 fails, we just fall back to the regular method. */
977 #endif /* HAVE_MMAP */
980 size = 512; /* number of bytes fm->contents can
981 hold at any given time. */
982 fm->content = xmalloc (size);
986 if (fm->length > size / 2)
988 /* #### I'm not sure whether the whole exponential-growth
989 thing makes sense with kernel read. On Linux at least,
990 read() refuses to read more than 4K from a file at a
991 single chunk anyway. But other Unixes might optimize it
992 better, and it doesn't *hurt* anything, so I'm leaving
995 /* Normally, we grow SIZE exponentially to make the number
996 of calls to read() and realloc() logarithmic in relation
997 to file size. However, read() can read an amount of data
998 smaller than requested, and it would be unreasonable to
999 double SIZE every time *something* was read. Therefore,
1000 we double SIZE only when the length exceeds half of the
1001 entire allocated size. */
1003 fm->content = xrealloc (fm->content, size);
1005 nread = read (fd, fm->content + fm->length, size - fm->length);
1007 /* Successful read. */
1008 fm->length += nread;
1018 if (size > fm->length && fm->length != 0)
1019 /* Due to exponential growth of fm->content, the allocated region
1020 might be much larger than what is actually needed. */
1021 fm->content = xrealloc (fm->content, fm->length);
1028 xfree (fm->content);
1033 /* Release the resources held by FM. Specifically, this calls
1034 munmap() or xfree() on fm->content, depending whether mmap or
1035 malloc/read were used to read in the file. It also frees the
1036 memory needed to hold the FM structure itself. */
1039 read_file_free (struct file_memory *fm)
1044 munmap (fm->content, fm->length);
1049 xfree (fm->content);
1054 /* Free the pointers in a NULL-terminated vector of pointers, then
1055 free the pointer itself. */
1057 free_vec (char **vec)
1068 /* Append vector V2 to vector V1. The function frees V2 and
1069 reallocates V1 (thus you may not use the contents of neither
1070 pointer after the call). If V1 is NULL, V2 is returned. */
1072 merge_vecs (char **v1, char **v2)
1082 /* To avoid j == 0 */
1087 for (i = 0; v1[i]; i++);
1089 for (j = 0; v2[j]; j++);
1090 /* Reallocate v1. */
1091 v1 = xrealloc (v1, (i + j + 1) * sizeof (char **));
1092 memcpy (v1 + i, v2, (j + 1) * sizeof (char *));
1097 /* Append a freshly allocated copy of STR to VEC. If VEC is NULL, it
1098 is allocated as needed. Return the new value of the vector. */
1101 vec_append (char **vec, const char *str)
1103 int cnt; /* count of vector elements, including
1104 the one we're about to append */
1107 for (cnt = 0; vec[cnt]; cnt++)
1113 /* Reallocate the array to fit the new element and the NULL. */
1114 vec = xrealloc (vec, (cnt + 1) * sizeof (char *));
1115 /* Append a copy of STR to the vector. */
1116 vec[cnt - 1] = xstrdup (str);
1121 /* Sometimes it's useful to create "sets" of strings, i.e. special
1122 hash tables where you want to store strings as keys and merely
1123 query for their existence. Here is a set of utility routines that
1124 makes that transparent. */
1127 string_set_add (struct hash_table *ht, const char *s)
1129 /* First check whether the set element already exists. If it does,
1130 do nothing so that we don't have to free() the old element and
1131 then strdup() a new one. */
1132 if (hash_table_contains (ht, s))
1135 /* We use "1" as value. It provides us a useful and clear arbitrary
1136 value, and it consumes no memory -- the pointers to the same
1137 string "1" will be shared by all the key-value pairs in all `set'
1139 hash_table_put (ht, xstrdup (s), "1");
1142 /* Synonym for hash_table_contains... */
1145 string_set_contains (struct hash_table *ht, const char *s)
1147 return hash_table_contains (ht, s);
1151 string_set_to_array_mapper (void *key, void *value_ignored, void *arg)
1153 char ***arrayptr = (char ***) arg;
1154 *(*arrayptr)++ = (char *) key;
1158 /* Convert the specified string set to array. ARRAY should be large
1159 enough to hold hash_table_count(ht) char pointers. */
1161 void string_set_to_array (struct hash_table *ht, char **array)
1163 hash_table_map (ht, string_set_to_array_mapper, &array);
1167 string_set_free_mapper (void *key, void *value_ignored, void *arg_ignored)
1174 string_set_free (struct hash_table *ht)
1176 hash_table_map (ht, string_set_free_mapper, NULL);
1177 hash_table_destroy (ht);
1181 free_keys_and_values_mapper (void *key, void *value, void *arg_ignored)
1188 /* Another utility function: call free() on all keys and values of HT. */
1191 free_keys_and_values (struct hash_table *ht)
1193 hash_table_map (ht, free_keys_and_values_mapper, NULL);
1197 /* Get grouping data, the separator and grouping info, by calling
1198 localeconv(). The information is cached after the first call to
1201 In locales that don't set a thousand separator (such as the "C"
1202 locale), this forces it to be ",". We are now only showing
1203 thousand separators in one place, so this shouldn't be a problem in
1207 get_grouping_data (const char **sep, const char **grouping)
1209 static const char *cached_sep;
1210 static const char *cached_grouping;
1211 static bool initialized;
1214 /* Get the grouping info from the locale. */
1215 struct lconv *lconv = localeconv ();
1216 cached_sep = lconv->thousands_sep;
1217 cached_grouping = lconv->grouping;
1220 /* Many locales (such as "C" or "hr_HR") don't specify
1221 grouping, which we still want to use it for legibility.
1222 In those locales set the sep char to ',', unless that
1223 character is used for decimal point, in which case set it
1225 if (*lconv->decimal_point != ',')
1229 cached_grouping = "\x03";
1234 *grouping = cached_grouping;
1237 /* Return a printed representation of N with thousand separators.
1238 This should respect locale settings, with the exception of the "C"
1239 locale which mandates no separator, but we use one anyway.
1241 Unfortunately, we cannot use %'d (in fact it would be %'j) to get
1242 the separators because it's too non-portable, and it's hard to test
1243 for this feature at configure time. Besides, it wouldn't work in
1244 the "C" locale, which many Unix users still work in. */
1247 with_thousand_seps (wgint n)
1249 static char outbuf[48];
1250 char *p = outbuf + sizeof outbuf;
1252 /* Info received from locale */
1253 const char *grouping, *sep;
1256 /* State information */
1257 int i = 0, groupsize;
1258 const char *atgroup;
1260 bool negative = n < 0;
1262 /* Initialize grouping data. */
1263 get_grouping_data (&sep, &grouping);
1264 seplen = strlen (sep);
1266 groupsize = *atgroup++;
1268 /* This will overflow on WGINT_MIN, but we're not using this to
1269 print negative numbers anyway. */
1273 /* Write the number into the buffer, backwards, inserting the
1274 separators as necessary. */
1278 *--p = n % 10 + '0';
1282 /* Prepend SEP to every groupsize'd digit and get new groupsize. */
1283 if (++i == groupsize)
1288 memcpy (p -= seplen, sep, seplen);
1291 groupsize = *atgroup++;
1300 /* N, a byte quantity, is converted to a human-readable abberviated
1301 form a la sizes printed by `ls -lh'. The result is written to a
1302 static buffer, a pointer to which is returned.
1304 Unlike `with_thousand_seps', this approximates to the nearest unit.
1305 Quoting GNU libit: "Most people visually process strings of 3-4
1306 digits effectively, but longer strings of digits are more prone to
1307 misinterpretation. Hence, converting to an abbreviated form
1308 usually improves readability."
1310 This intentionally uses kilobyte (KB), megabyte (MB), etc. in their
1311 original computer-related meaning of "powers of 1024". Powers of
1312 1000 would be useless since Wget already displays sizes with
1313 thousand separators. We don't use the "*bibyte" names invented in
1314 1998, and seldom used in practice. Wikipedia's entry on kilobyte
1315 discusses this in some detail. */
1318 human_readable (HR_NUMTYPE n)
1320 /* These suffixes are compatible with those of GNU `ls -lh'. */
1321 static char powers[] =
1323 'K', /* kilobyte, 2^10 bytes */
1324 'M', /* megabyte, 2^20 bytes */
1325 'G', /* gigabyte, 2^30 bytes */
1326 'T', /* terabyte, 2^40 bytes */
1327 'P', /* petabyte, 2^50 bytes */
1328 'E', /* exabyte, 2^60 bytes */
1333 /* If the quantity is smaller than 1K, just print it. */
1336 snprintf (buf, sizeof (buf), "%d", (int) n);
1340 /* Loop over powers, dividing N with 1024 in each iteration. This
1341 works unchanged for all sizes of wgint, while still avoiding
1342 non-portable `long double' arithmetic. */
1343 for (i = 0; i < countof (powers); i++)
1345 /* At each iteration N is greater than the *subsequent* power.
1346 That way N/1024.0 produces a decimal number in the units of
1348 if ((n / 1024) < 1024 || i == countof (powers) - 1)
1350 double val = n / 1024.0;
1351 /* Print values smaller than 10 with one decimal digits, and
1352 others without any decimals. */
1353 snprintf (buf, sizeof (buf), "%.*f%c",
1354 val < 10 ? 1 : 0, val, powers[i]);
1359 return NULL; /* unreached */
1362 /* Count the digits in the provided number. Used to allocate space
1363 when printing numbers. */
1366 numdigit (wgint number)
1370 ++cnt; /* accomodate '-' */
1371 while ((number /= 10) != 0)
1376 #define PR(mask) *p++ = n / (mask) + '0'
1378 /* DIGITS_<D> is used to print a D-digit number and should be called
1379 with mask==10^(D-1). It prints n/mask (the first digit), reducing
1380 n to n%mask (the remaining digits), and calling DIGITS_<D-1>.
1381 Recursively this continues until DIGITS_1 is invoked. */
1383 #define DIGITS_1(mask) PR (mask)
1384 #define DIGITS_2(mask) PR (mask), n %= (mask), DIGITS_1 ((mask) / 10)
1385 #define DIGITS_3(mask) PR (mask), n %= (mask), DIGITS_2 ((mask) / 10)
1386 #define DIGITS_4(mask) PR (mask), n %= (mask), DIGITS_3 ((mask) / 10)
1387 #define DIGITS_5(mask) PR (mask), n %= (mask), DIGITS_4 ((mask) / 10)
1388 #define DIGITS_6(mask) PR (mask), n %= (mask), DIGITS_5 ((mask) / 10)
1389 #define DIGITS_7(mask) PR (mask), n %= (mask), DIGITS_6 ((mask) / 10)
1390 #define DIGITS_8(mask) PR (mask), n %= (mask), DIGITS_7 ((mask) / 10)
1391 #define DIGITS_9(mask) PR (mask), n %= (mask), DIGITS_8 ((mask) / 10)
1392 #define DIGITS_10(mask) PR (mask), n %= (mask), DIGITS_9 ((mask) / 10)
1394 /* DIGITS_<11-20> are only used on machines with 64-bit wgints. */
1396 #define DIGITS_11(mask) PR (mask), n %= (mask), DIGITS_10 ((mask) / 10)
1397 #define DIGITS_12(mask) PR (mask), n %= (mask), DIGITS_11 ((mask) / 10)
1398 #define DIGITS_13(mask) PR (mask), n %= (mask), DIGITS_12 ((mask) / 10)
1399 #define DIGITS_14(mask) PR (mask), n %= (mask), DIGITS_13 ((mask) / 10)
1400 #define DIGITS_15(mask) PR (mask), n %= (mask), DIGITS_14 ((mask) / 10)
1401 #define DIGITS_16(mask) PR (mask), n %= (mask), DIGITS_15 ((mask) / 10)
1402 #define DIGITS_17(mask) PR (mask), n %= (mask), DIGITS_16 ((mask) / 10)
1403 #define DIGITS_18(mask) PR (mask), n %= (mask), DIGITS_17 ((mask) / 10)
1404 #define DIGITS_19(mask) PR (mask), n %= (mask), DIGITS_18 ((mask) / 10)
1406 /* SPRINTF_WGINT is used by number_to_string to handle pathological
1407 cases and to portably support strange sizes of wgint. Ideally this
1408 would just use "%j" and intmax_t, but many systems don't support
1409 it, so it's used only if nothing else works. */
1410 #if SIZEOF_LONG >= SIZEOF_WGINT
1411 # define SPRINTF_WGINT(buf, n) sprintf (buf, "%ld", (long) (n))
1412 #elif SIZEOF_LONG_LONG >= SIZEOF_WGINT
1413 # define SPRINTF_WGINT(buf, n) sprintf (buf, "%lld", (long long) (n))
1414 #elif defined(WINDOWS)
1415 # define SPRINTF_WGINT(buf, n) sprintf (buf, "%I64d", (__int64) (n))
1417 # define SPRINTF_WGINT(buf, n) sprintf (buf, "%j", (intmax_t) (n))
1420 /* Shorthand for casting to wgint. */
1423 /* Print NUMBER to BUFFER in base 10. This is equivalent to
1424 `sprintf(buffer, "%lld", (long long) number)', only typically much
1425 faster and portable to machines without long long.
1427 The speedup may make a difference in programs that frequently
1428 convert numbers to strings. Some implementations of sprintf,
1429 particularly the one in GNU libc, have been known to be extremely
1430 slow when converting integers to strings.
1432 Return the pointer to the location where the terminating zero was
1433 printed. (Equivalent to calling buffer+strlen(buffer) after the
1436 BUFFER should be big enough to accept as many bytes as you expect
1437 the number to take up. On machines with 64-bit longs the maximum
1438 needed size is 24 bytes. That includes the digits needed for the
1439 largest 64-bit number, the `-' sign in case it's negative, and the
1440 terminating '\0'. */
1443 number_to_string (char *buffer, wgint number)
1448 #if (SIZEOF_WGINT != 4) && (SIZEOF_WGINT != 8)
1449 /* We are running in a strange or misconfigured environment. Let
1450 sprintf cope with it. */
1451 SPRINTF_WGINT (buffer, n);
1452 p += strlen (buffer);
1453 #else /* (SIZEOF_WGINT == 4) || (SIZEOF_WGINT == 8) */
1459 /* -n would overflow. Have sprintf deal with this. */
1460 SPRINTF_WGINT (buffer, n);
1461 p += strlen (buffer);
1469 /* Use the DIGITS_ macro appropriate for N's number of digits. That
1470 way printing any N is fully open-coded without a loop or jump.
1471 (Also see description of DIGITS_*.) */
1473 if (n < 10) DIGITS_1 (1);
1474 else if (n < 100) DIGITS_2 (10);
1475 else if (n < 1000) DIGITS_3 (100);
1476 else if (n < 10000) DIGITS_4 (1000);
1477 else if (n < 100000) DIGITS_5 (10000);
1478 else if (n < 1000000) DIGITS_6 (100000);
1479 else if (n < 10000000) DIGITS_7 (1000000);
1480 else if (n < 100000000) DIGITS_8 (10000000);
1481 else if (n < 1000000000) DIGITS_9 (100000000);
1482 #if SIZEOF_WGINT == 4
1483 /* wgint is 32 bits wide: no number has more than 10 digits. */
1484 else DIGITS_10 (1000000000);
1486 /* wgint is 64 bits wide: handle numbers with 9-19 decimal digits.
1487 Constants are constructed by compile-time multiplication to avoid
1488 dealing with different notations for 64-bit constants
1489 (nL/nLL/nI64, depending on the compiler and architecture). */
1490 else if (n < 10*(W)1000000000) DIGITS_10 (1000000000);
1491 else if (n < 100*(W)1000000000) DIGITS_11 (10*(W)1000000000);
1492 else if (n < 1000*(W)1000000000) DIGITS_12 (100*(W)1000000000);
1493 else if (n < 10000*(W)1000000000) DIGITS_13 (1000*(W)1000000000);
1494 else if (n < 100000*(W)1000000000) DIGITS_14 (10000*(W)1000000000);
1495 else if (n < 1000000*(W)1000000000) DIGITS_15 (100000*(W)1000000000);
1496 else if (n < 10000000*(W)1000000000) DIGITS_16 (1000000*(W)1000000000);
1497 else if (n < 100000000*(W)1000000000) DIGITS_17 (10000000*(W)1000000000);
1498 else if (n < 1000000000*(W)1000000000) DIGITS_18 (100000000*(W)1000000000);
1499 else DIGITS_19 (1000000000*(W)1000000000);
1503 #endif /* (SIZEOF_WGINT == 4) || (SIZEOF_WGINT == 8) */
1510 #undef SPRINTF_WGINT
1533 /* Print NUMBER to a statically allocated string and return a pointer
1534 to the printed representation.
1536 This function is intended to be used in conjunction with printf.
1537 It is hard to portably print wgint values:
1538 a) you cannot use printf("%ld", number) because wgint can be long
1539 long on 32-bit machines with LFS.
1540 b) you cannot use printf("%lld", number) because NUMBER could be
1541 long on 32-bit machines without LFS, or on 64-bit machines,
1542 which do not require LFS. Also, Windows doesn't support %lld.
1543 c) you cannot use printf("%j", (int_max_t) number) because not all
1544 versions of printf support "%j", the most notable being the one
1546 d) you cannot #define WGINT_FMT to the appropriate format and use
1547 printf(WGINT_FMT, number) because that would break translations
1548 for user-visible messages, such as printf("Downloaded: %d
1551 What you should use instead is printf("%s", number_to_static_string
1554 CAVEAT: since the function returns pointers to static data, you
1555 must be careful to copy its result before calling it again.
1556 However, to make it more useful with printf, the function maintains
1557 an internal ring of static buffers to return. That way things like
1558 printf("%s %s", number_to_static_string (num1),
1559 number_to_static_string (num2)) work as expected. Three buffers
1560 are currently used, which means that "%s %s %s" will work, but "%s
1561 %s %s %s" won't. If you need to print more than three wgints,
1562 bump the RING_SIZE (or rethink your message.) */
1565 number_to_static_string (wgint number)
1567 static char ring[RING_SIZE][24];
1569 char *buf = ring[ringpos];
1570 number_to_string (buf, number);
1571 ringpos = (ringpos + 1) % RING_SIZE;
1575 /* Determine the width of the terminal we're running on. If that's
1576 not possible, return 0. */
1579 determine_screen_width (void)
1581 /* If there's a way to get the terminal size using POSIX
1582 tcgetattr(), somebody please tell me. */
1587 if (opt.lfilename != NULL)
1590 fd = fileno (stderr);
1591 if (ioctl (fd, TIOCGWINSZ, &wsz) < 0)
1592 return 0; /* most likely ENOTTY */
1595 #elif defined(WINDOWS)
1596 CONSOLE_SCREEN_BUFFER_INFO csbi;
1597 if (!GetConsoleScreenBufferInfo (GetStdHandle (STD_ERROR_HANDLE), &csbi))
1599 return csbi.dwSize.X;
1600 #else /* neither TIOCGWINSZ nor WINDOWS */
1602 #endif /* neither TIOCGWINSZ nor WINDOWS */
1605 /* Whether the rnd system (either rand or [dl]rand48) has been
1607 static int rnd_seeded;
1609 /* Return a random number between 0 and MAX-1, inclusive.
1611 If the system does not support lrand48 and MAX is greater than the
1612 value of RAND_MAX+1 on the system, the returned value will be in
1613 the range [0, RAND_MAX]. This may be fixed in a future release.
1614 The random number generator is seeded automatically the first time
1617 This uses lrand48 where available, rand elsewhere. DO NOT use it
1618 for cryptography. It is only meant to be used in situations where
1619 quality of the random numbers returned doesn't really matter. */
1622 random_number (int max)
1627 srand48 ((long) time (NULL) ^ (long) getpid ());
1630 return lrand48 () % max;
1631 #else /* not HAVE_DRAND48 */
1637 srand ((unsigned) time (NULL) ^ (unsigned) getpid ());
1642 /* Like rand() % max, but uses the high-order bits for better
1643 randomness on architectures where rand() is implemented using a
1644 simple congruential generator. */
1646 bounded = (double) max * rnd / (RAND_MAX + 1.0);
1647 return (int) bounded;
1649 #endif /* not HAVE_DRAND48 */
1652 /* Return a random uniformly distributed floating point number in the
1653 [0, 1) range. Uses drand48 where available, and a really lame
1654 kludge elsewhere. */
1662 srand48 ((long) time (NULL) ^ (long) getpid ());
1666 #else /* not HAVE_DRAND48 */
1667 return ( random_number (10000) / 10000.0
1668 + random_number (10000) / (10000.0 * 10000.0)
1669 + random_number (10000) / (10000.0 * 10000.0 * 10000.0)
1670 + random_number (10000) / (10000.0 * 10000.0 * 10000.0 * 10000.0));
1671 #endif /* not HAVE_DRAND48 */
1674 /* Implementation of run_with_timeout, a generic timeout-forcing
1675 routine for systems with Unix-like signal handling. */
1677 #ifdef USE_SIGNAL_TIMEOUT
1678 # ifdef HAVE_SIGSETJMP
1679 # define SETJMP(env) sigsetjmp (env, 1)
1681 static sigjmp_buf run_with_timeout_env;
1684 abort_run_with_timeout (int sig)
1686 assert (sig == SIGALRM);
1687 siglongjmp (run_with_timeout_env, -1);
1689 # else /* not HAVE_SIGSETJMP */
1690 # define SETJMP(env) setjmp (env)
1692 static jmp_buf run_with_timeout_env;
1695 abort_run_with_timeout (int sig)
1697 assert (sig == SIGALRM);
1698 /* We don't have siglongjmp to preserve the set of blocked signals;
1699 if we longjumped out of the handler at this point, SIGALRM would
1700 remain blocked. We must unblock it manually. */
1701 int mask = siggetmask ();
1702 mask &= ~sigmask (SIGALRM);
1705 /* Now it's safe to longjump. */
1706 longjmp (run_with_timeout_env, -1);
1708 # endif /* not HAVE_SIGSETJMP */
1710 /* Arrange for SIGALRM to be delivered in TIMEOUT seconds. This uses
1711 setitimer where available, alarm otherwise.
1713 TIMEOUT should be non-zero. If the timeout value is so small that
1714 it would be rounded to zero, it is rounded to the least legal value
1715 instead (1us for setitimer, 1s for alarm). That ensures that
1716 SIGALRM will be delivered in all cases. */
1719 alarm_set (double timeout)
1722 /* Use the modern itimer interface. */
1723 struct itimerval itv;
1725 itv.it_value.tv_sec = (long) timeout;
1726 itv.it_value.tv_usec = 1000000 * (timeout - (long)timeout);
1727 if (itv.it_value.tv_sec == 0 && itv.it_value.tv_usec == 0)
1728 /* Ensure that we wait for at least the minimum interval.
1729 Specifying zero would mean "wait forever". */
1730 itv.it_value.tv_usec = 1;
1731 setitimer (ITIMER_REAL, &itv, NULL);
1732 #else /* not ITIMER_REAL */
1733 /* Use the old alarm() interface. */
1734 int secs = (int) timeout;
1736 /* Round TIMEOUTs smaller than 1 to 1, not to zero. This is
1737 because alarm(0) means "never deliver the alarm", i.e. "wait
1738 forever", which is not what someone who specifies a 0.5s
1739 timeout would expect. */
1742 #endif /* not ITIMER_REAL */
1745 /* Cancel the alarm set with alarm_set. */
1751 struct itimerval disable;
1753 setitimer (ITIMER_REAL, &disable, NULL);
1754 #else /* not ITIMER_REAL */
1756 #endif /* not ITIMER_REAL */
1759 /* Call FUN(ARG), but don't allow it to run for more than TIMEOUT
1760 seconds. Returns true if the function was interrupted with a
1761 timeout, false otherwise.
1763 This works by setting up SIGALRM to be delivered in TIMEOUT seconds
1764 using setitimer() or alarm(). The timeout is enforced by
1765 longjumping out of the SIGALRM handler. This has several
1766 advantages compared to the traditional approach of relying on
1767 signals causing system calls to exit with EINTR:
1769 * The callback function is *forcibly* interrupted after the
1770 timeout expires, (almost) regardless of what it was doing and
1771 whether it was in a syscall. For example, a calculation that
1772 takes a long time is interrupted as reliably as an IO
1775 * It works with both SYSV and BSD signals because it doesn't
1776 depend on the default setting of SA_RESTART.
1778 * It doesn't require special handler setup beyond a simple call
1779 to signal(). (It does use sigsetjmp/siglongjmp, but they're
1782 The only downside is that, if FUN allocates internal resources that
1783 are normally freed prior to exit from the functions, they will be
1784 lost in case of timeout. */
1787 run_with_timeout (double timeout, void (*fun) (void *), void *arg)
1797 signal (SIGALRM, abort_run_with_timeout);
1798 if (SETJMP (run_with_timeout_env) != 0)
1800 /* Longjumped out of FUN with a timeout. */
1801 signal (SIGALRM, SIG_DFL);
1804 alarm_set (timeout);
1807 /* Preserve errno in case alarm() or signal() modifies it. */
1808 saved_errno = errno;
1810 signal (SIGALRM, SIG_DFL);
1811 errno = saved_errno;
1816 #else /* not USE_SIGNAL_TIMEOUT */
1819 /* A stub version of run_with_timeout that just calls FUN(ARG). Don't
1820 define it under Windows, because Windows has its own version of
1821 run_with_timeout that uses threads. */
1824 run_with_timeout (double timeout, void (*fun) (void *), void *arg)
1829 #endif /* not WINDOWS */
1830 #endif /* not USE_SIGNAL_TIMEOUT */
1834 /* Sleep the specified amount of seconds. On machines without
1835 nanosleep(), this may sleep shorter if interrupted by signals. */
1838 xsleep (double seconds)
1840 #ifdef HAVE_NANOSLEEP
1841 /* nanosleep is the preferred interface because it offers high
1842 accuracy and, more importantly, because it allows us to reliably
1843 restart receiving a signal such as SIGWINCH. (There was an
1844 actual Debian bug report about --limit-rate malfunctioning while
1845 the terminal was being resized.) */
1846 struct timespec sleep, remaining;
1847 sleep.tv_sec = (long) seconds;
1848 sleep.tv_nsec = 1000000000 * (seconds - (long) seconds);
1849 while (nanosleep (&sleep, &remaining) < 0 && errno == EINTR)
1850 /* If nanosleep has been interrupted by a signal, adjust the
1851 sleeping period and return to sleep. */
1853 #elif defined(HAVE_USLEEP)
1854 /* If usleep is available, use it in preference to select. */
1857 /* On some systems, usleep cannot handle values larger than
1858 1,000,000. If the period is larger than that, use sleep
1859 first, then add usleep for subsecond accuracy. */
1861 seconds -= (long) seconds;
1863 usleep (seconds * 1000000);
1864 #else /* fall back select */
1865 /* Note that, although Windows supports select, it can't be used to
1866 implement sleeping because Winsock's select doesn't implement
1867 timeout when it is passed NULL pointers for all fd sets. (But it
1868 does under Cygwin, which implements Unix-compatible select.) */
1869 struct timeval sleep;
1870 sleep.tv_sec = (long) seconds;
1871 sleep.tv_usec = 1000000 * (seconds - (long) seconds);
1872 select (0, NULL, NULL, NULL, &sleep);
1873 /* If select returns -1 and errno is EINTR, it means we were
1874 interrupted by a signal. But without knowing how long we've
1875 actually slept, we can't return to sleep. Using gettimeofday to
1876 track sleeps is slow and unreliable due to clock skew. */
1880 #endif /* not WINDOWS */
1882 /* Encode the string STR of length LENGTH to base64 format and place it
1883 to B64STORE. The output will be \0-terminated, and must point to a
1884 writable buffer of at least 1+BASE64_LENGTH(length) bytes. It
1885 returns the length of the resulting base64 data, not counting the
1888 This implementation will not emit newlines after 76 characters of
1892 base64_encode (const char *str, int length, char *b64store)
1894 /* Conversion table. */
1895 static char tbl[64] = {
1896 'A','B','C','D','E','F','G','H',
1897 'I','J','K','L','M','N','O','P',
1898 'Q','R','S','T','U','V','W','X',
1899 'Y','Z','a','b','c','d','e','f',
1900 'g','h','i','j','k','l','m','n',
1901 'o','p','q','r','s','t','u','v',
1902 'w','x','y','z','0','1','2','3',
1903 '4','5','6','7','8','9','+','/'
1906 const unsigned char *s = (const unsigned char *) str;
1909 /* Transform the 3x8 bits to 4x6 bits, as required by base64. */
1910 for (i = 0; i < length; i += 3)
1912 *p++ = tbl[s[0] >> 2];
1913 *p++ = tbl[((s[0] & 3) << 4) + (s[1] >> 4)];
1914 *p++ = tbl[((s[1] & 0xf) << 2) + (s[2] >> 6)];
1915 *p++ = tbl[s[2] & 0x3f];
1919 /* Pad the result if necessary... */
1920 if (i == length + 1)
1922 else if (i == length + 2)
1923 *(p - 1) = *(p - 2) = '=';
1925 /* ...and zero-terminate it. */
1928 return p - b64store;
1931 /* Store in C the next non-whitespace character from the string, or \0
1932 when end of string is reached. */
1933 #define NEXT_CHAR(c, p) do { \
1934 c = (unsigned char) *p++; \
1935 } while (ISSPACE (c))
1937 #define IS_ASCII(c) (((c) & 0x80) == 0)
1939 /* Decode data from BASE64 (pointer to \0-terminated text) into memory
1940 pointed to by TO. TO should be large enough to accomodate the
1941 decoded data, which is guaranteed to be less than strlen(base64).
1943 Since TO is assumed to contain binary data, it is not
1944 NUL-terminated. The function returns the length of the data
1945 written to TO. -1 is returned in case of error caused by malformed
1949 base64_decode (const char *base64, char *to)
1951 /* Table of base64 values for first 128 characters. Note that this
1952 assumes ASCII (but so does Wget in other places). */
1953 static signed char base64_char_to_value[128] =
1955 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0- 9 */
1956 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 10- 19 */
1957 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 20- 29 */
1958 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 30- 39 */
1959 -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, /* 40- 49 */
1960 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, /* 50- 59 */
1961 -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, /* 60- 69 */
1962 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, /* 70- 79 */
1963 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, /* 80- 89 */
1964 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, /* 90- 99 */
1965 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, /* 100-109 */
1966 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, /* 110-119 */
1967 49, 50, 51, -1, -1, -1, -1, -1 /* 120-127 */
1969 #define BASE64_CHAR_TO_VALUE(c) ((int) base64_char_to_value[c])
1970 #define IS_BASE64(c) ((IS_ASCII (c) && BASE64_CHAR_TO_VALUE (c) >= 0) || c == '=')
1972 const char *p = base64;
1978 unsigned long value;
1980 /* Process first byte of a quadruplet. */
1984 if (c == '=' || !IS_BASE64 (c))
1985 return -1; /* illegal char while decoding base64 */
1986 value = BASE64_CHAR_TO_VALUE (c) << 18;
1988 /* Process second byte of a quadruplet. */
1991 return -1; /* premature EOF while decoding base64 */
1992 if (c == '=' || !IS_BASE64 (c))
1993 return -1; /* illegal char while decoding base64 */
1994 value |= BASE64_CHAR_TO_VALUE (c) << 12;
1997 /* Process third byte of a quadruplet. */
2000 return -1; /* premature EOF while decoding base64 */
2002 return -1; /* illegal char while decoding base64 */
2008 return -1; /* premature EOF while decoding base64 */
2010 return -1; /* padding `=' expected but not found */
2014 value |= BASE64_CHAR_TO_VALUE (c) << 6;
2015 *q++ = 0xff & value >> 8;
2017 /* Process fourth byte of a quadruplet. */
2020 return -1; /* premature EOF while decoding base64 */
2024 return -1; /* illegal char while decoding base64 */
2026 value |= BASE64_CHAR_TO_VALUE (c);
2027 *q++ = 0xff & value;
2030 #undef BASE64_CHAR_TO_VALUE
2038 /* Simple merge sort for use by stable_sort. Implementation courtesy
2039 Zeljko Vrba with additional debugging by Nenad Barbutov. */
2042 mergesort_internal (void *base, void *temp, size_t size, size_t from, size_t to,
2043 int (*cmpfun) (const void *, const void *))
2045 #define ELT(array, pos) ((char *)(array) + (pos) * size)
2049 size_t mid = (to + from) / 2;
2050 mergesort_internal (base, temp, size, from, mid, cmpfun);
2051 mergesort_internal (base, temp, size, mid + 1, to, cmpfun);
2054 for (k = from; (i <= mid) && (j <= to); k++)
2055 if (cmpfun (ELT (base, i), ELT (base, j)) <= 0)
2056 memcpy (ELT (temp, k), ELT (base, i++), size);
2058 memcpy (ELT (temp, k), ELT (base, j++), size);
2060 memcpy (ELT (temp, k++), ELT (base, i++), size);
2062 memcpy (ELT (temp, k++), ELT (base, j++), size);
2063 for (k = from; k <= to; k++)
2064 memcpy (ELT (base, k), ELT (temp, k), size);
2069 /* Stable sort with interface exactly like standard library's qsort.
2070 Uses mergesort internally, allocating temporary storage with
2074 stable_sort (void *base, size_t nmemb, size_t size,
2075 int (*cmpfun) (const void *, const void *))
2079 void *temp = alloca (nmemb * size * sizeof (void *));
2080 mergesort_internal (base, temp, size, 0, nmemb - 1, cmpfun);
2084 /* Print a decimal number. If it is equal to or larger than ten, the
2085 number is rounded. Otherwise it is printed with one significant
2086 digit without trailing zeros and with no more than three fractional
2087 digits total. For example, 0.1 is printed as "0.1", 0.035 is
2088 printed as "0.04", 0.0091 as "0.009", and 0.0003 as simply "0".
2090 This is useful for displaying durations because it provides
2091 order-of-magnitude information without unnecessary clutter --
2092 long-running downloads are shown without the fractional part, and
2093 short ones still retain one significant digit. */
2096 print_decimal (double number)
2098 static char buf[32];
2099 double n = number >= 0 ? number : -number;
2102 /* Cut off at 9.95 because the below %.1f would round 9.96 to
2103 "10.0" instead of "10". OTOH 9.94 will print as "9.9". */
2104 snprintf (buf, sizeof buf, "%.0f", number);
2106 snprintf (buf, sizeof buf, "%.1f", number);
2107 else if (n >= 0.001)
2108 snprintf (buf, sizeof buf, "%.1g", number);
2109 else if (n >= 0.0005)
2110 /* round [0.0005, 0.001) to 0.001 */
2111 snprintf (buf, sizeof buf, "%.3f", number);
2113 /* print numbers close to 0 as 0, not 0.000 */