1 /* Various utility functions.
2 Copyright (C) 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003,
3 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc.
5 This file is part of GNU Wget.
7 GNU Wget is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 GNU Wget is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with Wget. If not, see <http://www.gnu.org/licenses/>.
20 Additional permission under GNU GPL version 3 section 7
22 If you modify this program, or any covered work, by linking or
23 combining it with the OpenSSL project's OpenSSL library (or a
24 modified version of that library), containing parts covered by the
25 terms of the OpenSSL or SSLeay licenses, the Free Software Foundation
26 grants you additional permission to convey the resulting work.
27 Corresponding Source for a non-source form of such a combination
28 shall include the source code for the parts of OpenSSL used as well
29 as that of the covered work. */
37 #ifdef HAVE_SYS_TIME_H
38 # include <sys/time.h>
44 # include <sys/mman.h>
47 # include <process.h> /* getpid() */
52 #ifdef HAVE_SYS_UTIME_H
53 # include <sys/utime.h>
61 /* For TIOCGWINSZ and friends: */
62 #ifdef HAVE_SYS_IOCTL_H
63 # include <sys/ioctl.h>
69 /* Needed for Unix version of run_with_timeout. */
73 #ifndef HAVE_SIGSETJMP
74 /* If sigsetjmp is a macro, configure won't pick it up. */
76 # define HAVE_SIGSETJMP
80 #if defined HAVE_SIGSETJMP || defined HAVE_SIGBLOCK
81 # 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 ','. */
138 while (c_isspace (*s))
145 res = xrealloc (res, (i + 2) * sizeof (char *));
146 res[i] = strdupdelim (p, s);
151 /* Like sprintf, but prints into a string of sufficient size freshly
152 allocated with malloc, which is returned. If unable to print due
153 to invalid format, returns NULL. Inability to allocate needed
154 memory results in abort, as with xmalloc. This is in spirit
155 similar to the GNU/BSD extension asprintf, but somewhat easier to
158 Internally the function either calls vasprintf or loops around
159 vsnprintf until the correct size is found. Since Wget also ships a
160 fallback implementation of vsnprintf, this should be portable. */
162 /* Constant is using for limits memory allocation for text buffer.
163 Applicable in situation when: vasprintf is not available in the system
164 and vsnprintf return -1 when long line is truncated (in old versions of
165 glibc and in other system where C99 doesn`t support) */
167 #define FMT_MAX_LENGTH 1048576
170 aprintf (const char *fmt, ...)
172 #if defined HAVE_VASPRINTF && !defined DEBUG_MALLOC
177 va_start (args, fmt);
178 ret = vasprintf (&str, fmt, args);
180 if (ret < 0 && errno == ENOMEM)
181 memfatal ("aprintf", UNKNOWN_ATTEMPTED_SIZE); /* for consistency
182 with xmalloc/xrealloc */
186 #else /* not HAVE_VASPRINTF */
188 /* vasprintf is unavailable. snprintf into a small buffer and
189 resize it as necessary. */
191 char *str = xmalloc (size);
193 /* #### This code will infloop and eventually abort in xrealloc if
194 passed a FMT that causes snprintf to consistently return -1. */
201 va_start (args, fmt);
202 n = vsnprintf (str, size, fmt, args);
205 /* If the printing worked, return the string. */
206 if (n > -1 && n < size)
209 /* Else try again with a larger buffer. */
210 if (n > -1) /* C99 */
211 size = n + 1; /* precisely what is needed */
212 else if (size >= FMT_MAX_LENGTH) /* We have a huge buffer, */
213 { /* maybe we have some wrong
215 logprintf (LOG_ALWAYS,
216 _("%s: aprintf: text buffer is too big (%ld bytes), "
218 exec_name, size); /* printout a log message */
219 abort (); /* and abort... */
223 /* else, we continue to grow our
224 * buffer: Twice the old size. */
227 str = xrealloc (str, size);
229 #endif /* not HAVE_VASPRINTF */
232 /* Concatenate the NULL-terminated list of string arguments into
233 freshly allocated space. */
236 concat_strings (const char *str0, ...)
239 int saved_lengths[5]; /* inspired by Apache's apr_pstrcat */
242 const char *next_str;
243 int total_length = 0;
246 /* Calculate the length of and allocate the resulting string. */
249 va_start (args, str0);
250 for (next_str = str0; next_str != NULL; next_str = va_arg (args, char *))
252 int len = strlen (next_str);
253 if (argcount < countof (saved_lengths))
254 saved_lengths[argcount++] = len;
258 p = ret = xmalloc (total_length + 1);
260 /* Copy the strings into the allocated space. */
263 va_start (args, str0);
264 for (next_str = str0; next_str != NULL; next_str = va_arg (args, char *))
267 if (argcount < countof (saved_lengths))
268 len = saved_lengths[argcount++];
270 len = strlen (next_str);
271 memcpy (p, next_str, len);
280 /* Format the provided time according to the specified format. The
281 format is a string with format elements supported by strftime. */
284 fmttime (time_t t, const char *fmt)
286 static char output[32];
287 struct tm *tm = localtime(&t);
290 if (!strftime(output, sizeof(output), fmt, tm))
295 /* Return pointer to a static char[] buffer in which zero-terminated
296 string-representation of TM (in form hh:mm:ss) is printed.
298 If TM is NULL, the current time will be used. */
303 return fmttime(t, "%H:%M:%S");
306 /* Like the above, but include the date: YYYY-MM-DD hh:mm:ss. */
309 datetime_str (time_t t)
311 return fmttime(t, "%Y-%m-%d %H:%M:%S");
314 /* The Windows versions of the following two functions are defined in
315 mswindows.c. On MSDOS this function should never be called. */
317 #if !defined(WINDOWS) && !defined(MSDOS)
319 fork_to_background (void)
322 /* Whether we arrange our own version of opt.lfilename here. */
323 bool logfile_changed = false;
325 if (opt.quiet && !opt.server_response)
327 /* Don't bother with a logfile, there are virtually no logs we
328 issue in quiet mode. (Server responses in FTP are the
329 exception, when enabled.) */
334 /* We must create the file immediately to avoid either a race
335 condition (which arises from using unique_name and failing to
336 use fopen_excl) or lying to the user about the log file name
337 (which arises from using unique_name, printing the name, and
338 using fopen_excl later on.) */
339 FILE *new_log_fp = unique_create (DEFAULT_LOGFILE, false, &opt.lfilename);
342 logfile_changed = true;
355 /* parent, no error */
357 printf (_("Continuing in background, pid %d.\n"), (int) pid);
359 printf (_("Output will be written to `%s'.\n"), opt.lfilename);
360 exit (0); /* #### should we use _exit()? */
363 /* child: give up the privileges and keep running. */
365 freopen ("/dev/null", "r", stdin);
366 freopen ("/dev/null", "w", stdout);
367 freopen ("/dev/null", "w", stderr);
369 #endif /* !WINDOWS && !MSDOS */
371 /* "Touch" FILE, i.e. make its mtime ("modified time") equal the time
372 specified with TM. The atime ("access time") is set to the current
376 touch (const char *file, time_t tm)
378 #ifdef HAVE_STRUCT_UTIMBUF
379 struct utimbuf times;
387 times.actime = time (NULL);
388 if (utime (file, ×) == -1)
389 logprintf (LOG_NOTQUIET, "utime(%s): %s\n", file, strerror (errno));
392 /* Checks if FILE is a symbolic link, and removes it if it is. Does
393 nothing under MS-Windows. */
395 remove_link (const char *file)
400 if (lstat (file, &st) == 0 && S_ISLNK (st.st_mode))
402 DEBUGP (("Unlinking %s (symlink).\n", file));
405 logprintf (LOG_VERBOSE, _("Failed to unlink symlink `%s': %s\n"),
406 file, strerror (errno));
411 /* Does FILENAME exist? This is quite a lousy implementation, since
412 it supplies no error codes -- only a yes-or-no answer. Thus it
413 will return that a file does not exist if, e.g., the directory is
414 unreadable. I don't mind it too much currently, though. The
415 proper way should, of course, be to have a third, error state,
416 other than true/false, but that would introduce uncalled-for
417 additional complexity to the callers. */
419 file_exists_p (const char *filename)
422 return access (filename, F_OK) >= 0;
425 return stat (filename, &buf) >= 0;
429 /* Returns 0 if PATH is a directory, 1 otherwise (any kind of file).
430 Returns 0 on error. */
432 file_non_directory_p (const char *path)
435 /* Use lstat() rather than stat() so that symbolic links pointing to
436 directories can be identified correctly. */
437 if (lstat (path, &buf) != 0)
439 return S_ISDIR (buf.st_mode) ? false : true;
442 /* Return the size of file named by FILENAME, or -1 if it cannot be
443 opened or seeked into. */
445 file_size (const char *filename)
447 #if defined(HAVE_FSEEKO) && defined(HAVE_FTELLO)
449 /* We use fseek rather than stat to determine the file size because
450 that way we can also verify that the file is readable without
451 explicitly checking for permissions. Inspired by the POST patch
453 FILE *fp = fopen (filename, "rb");
456 fseeko (fp, 0, SEEK_END);
462 if (stat (filename, &st) < 0)
468 /* stat file names named PREFIX.1, PREFIX.2, etc., until one that
469 doesn't exist is found. Return a freshly allocated copy of the
473 unique_name_1 (const char *prefix)
476 int plen = strlen (prefix);
477 char *template = (char *)alloca (plen + 1 + 24);
478 char *template_tail = template + plen;
480 memcpy (template, prefix, plen);
481 *template_tail++ = '.';
484 number_to_string (template_tail, count++);
485 while (file_exists_p (template));
487 return xstrdup (template);
490 /* Return a unique file name, based on FILE.
492 More precisely, if FILE doesn't exist, it is returned unmodified.
493 If not, FILE.1 is tried, then FILE.2, etc. The first FILE.<number>
494 file name that doesn't exist is returned.
496 The resulting file is not created, only verified that it didn't
497 exist at the point in time when the function was called.
498 Therefore, where security matters, don't rely that the file created
499 by this function exists until you open it with O_EXCL or
502 If ALLOW_PASSTHROUGH is 0, it always returns a freshly allocated
503 string. Otherwise, it may return FILE if the file doesn't exist
504 (and therefore doesn't need changing). */
507 unique_name (const char *file, bool allow_passthrough)
509 /* If the FILE itself doesn't exist, return it without
511 if (!file_exists_p (file))
512 return allow_passthrough ? (char *)file : xstrdup (file);
514 /* Otherwise, find a numeric suffix that results in unused file name
516 return unique_name_1 (file);
519 /* Create a file based on NAME, except without overwriting an existing
520 file with that name. Providing O_EXCL is correctly implemented,
521 this function does not have the race condition associated with
522 opening the file returned by unique_name. */
525 unique_create (const char *name, bool binary, char **opened_name)
527 /* unique file name, based on NAME */
528 char *uname = unique_name (name, false);
530 while ((fp = fopen_excl (uname, binary)) == NULL && errno == EEXIST)
533 uname = unique_name (name, false);
535 if (opened_name && fp != NULL)
538 *opened_name = uname;
550 /* Open the file for writing, with the addition that the file is
551 opened "exclusively". This means that, if the file already exists,
552 this function will *fail* and errno will be set to EEXIST. If
553 BINARY is set, the file will be opened in binary mode, equivalent
556 If opening the file fails for any reason, including the file having
557 previously existed, this function returns NULL and sets errno
561 fopen_excl (const char *fname, bool binary)
565 int flags = O_WRONLY | O_CREAT | O_EXCL;
570 fd = open (fname, flags, 0666);
573 return fdopen (fd, binary ? "wb" : "w");
574 #else /* not O_EXCL */
575 /* Manually check whether the file exists. This is prone to race
576 conditions, but systems without O_EXCL haven't deserved
578 if (file_exists_p (fname))
583 return fopen (fname, binary ? "wb" : "w");
584 #endif /* not O_EXCL */
587 /* Create DIRECTORY. If some of the pathname components of DIRECTORY
588 are missing, create them first. In case any mkdir() call fails,
589 return its error status. Returns 0 on successful completion.
591 The behaviour of this function should be identical to the behaviour
592 of `mkdir -p' on systems where mkdir supports the `-p' option. */
594 make_directory (const char *directory)
596 int i, ret, quit = 0;
599 /* Make a copy of dir, to be able to write to it. Otherwise, the
600 function is unsafe if called with a read-only char *argument. */
601 STRDUP_ALLOCA (dir, directory);
603 /* If the first character of dir is '/', skip it (and thus enable
604 creation of absolute-pathname directories. */
605 for (i = (*dir == '/'); 1; ++i)
607 for (; dir[i] && dir[i] != '/'; i++)
612 /* Check whether the directory already exists. Allow creation of
613 of intermediate directories to fail, as the initial path components
614 are not necessarily directories! */
615 if (!file_exists_p (dir))
616 ret = mkdir (dir, 0777);
627 /* Merge BASE with FILE. BASE can be a directory or a file name, FILE
628 should be a file name.
630 file_merge("/foo/bar", "baz") => "/foo/baz"
631 file_merge("/foo/bar/", "baz") => "/foo/bar/baz"
632 file_merge("foo", "bar") => "bar"
634 In other words, it's a simpler and gentler version of uri_merge. */
637 file_merge (const char *base, const char *file)
640 const char *cut = (const char *)strrchr (base, '/');
643 return xstrdup (file);
645 result = xmalloc (cut - base + 1 + strlen (file) + 1);
646 memcpy (result, base, cut - base);
647 result[cut - base] = '/';
648 strcpy (result + (cut - base) + 1, file);
653 /* Like fnmatch, but performs a case-insensitive match. */
656 fnmatch_nocase (const char *pattern, const char *string, int flags)
659 /* The FNM_CASEFOLD flag started as a GNU extension, but it is now
660 also present on *BSD platforms, and possibly elsewhere. */
661 return fnmatch (pattern, string, flags | FNM_CASEFOLD);
663 /* Turn PATTERN and STRING to lower case and call fnmatch on them. */
664 char *patcopy = (char *) alloca (strlen (pattern) + 1);
665 char *strcopy = (char *) alloca (strlen (string) + 1);
667 for (p = patcopy; *pattern; pattern++, p++)
668 *p = c_tolower (*pattern);
670 for (p = strcopy; *string; string++, p++)
671 *p = c_tolower (*string);
673 return fnmatch (patcopy, strcopy, flags);
677 static bool in_acclist (const char *const *, const char *, bool);
679 /* Determine whether a file is acceptable to be followed, according to
680 lists of patterns to accept/reject. */
682 acceptable (const char *s)
686 while (l && s[l] != '/')
693 return (in_acclist ((const char *const *)opt.accepts, s, true)
694 && !in_acclist ((const char *const *)opt.rejects, s, true));
696 return in_acclist ((const char *const *)opt.accepts, s, true);
698 else if (opt.rejects)
699 return !in_acclist ((const char *const *)opt.rejects, s, true);
703 /* Check if D2 is a subdirectory of D1. E.g. if D1 is `/something', subdir_p()
704 will return true if and only if D2 begins with `/something/' or is exactly
707 subdir_p (const char *d1, const char *d2)
711 if (!opt.ignore_case)
712 for (; *d1 && *d2 && (*d1 == *d2); ++d1, ++d2)
715 for (; *d1 && *d2 && (c_tolower (*d1) == c_tolower (*d2)); ++d1, ++d2)
718 return *d1 == '\0' && (*d2 == '\0' || *d2 == '/');
721 /* Iterate through DIRLIST (which must be NULL-terminated), and return the
722 first element that matches DIR, through wildcards or front comparison (as
725 dir_matches_p (char **dirlist, const char *dir)
728 int (*matcher) (const char *, const char *, int)
729 = opt.ignore_case ? fnmatch_nocase : fnmatch;
731 for (x = dirlist; *x; x++)
733 /* Remove leading '/' */
734 char *p = *x + (**x == '/');
735 if (has_wildcards_p (p))
737 if (matcher (p, dir, FNM_PATHNAME) == 0)
742 if (subdir_p (p, dir))
747 return *x ? true : false;
750 /* Returns whether DIRECTORY is acceptable for download, wrt the
751 include/exclude lists.
753 The leading `/' is ignored in paths; relative and absolute paths
754 may be freely intermixed. */
757 accdir (const char *directory)
759 /* Remove starting '/'. */
760 if (*directory == '/')
764 if (!dir_matches_p (opt.includes, directory))
769 if (dir_matches_p (opt.excludes, directory))
775 /* Return true if STRING ends with TAIL. For instance:
777 match_tail ("abc", "bc", false) -> 1
778 match_tail ("abc", "ab", false) -> 0
779 match_tail ("abc", "abc", false) -> 1
781 If FOLD_CASE is true, the comparison will be case-insensitive. */
784 match_tail (const char *string, const char *tail, bool fold_case)
788 /* We want this to be fast, so we code two loops, one with
789 case-folding, one without. */
793 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
794 if (string[i] != tail[j])
799 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
800 if (c_tolower (string[i]) != c_tolower (tail[j]))
804 /* If the tail was exhausted, the match was succesful. */
811 /* Checks whether string S matches each element of ACCEPTS. A list
812 element are matched either with fnmatch() or match_tail(),
813 according to whether the element contains wildcards or not.
815 If the BACKWARD is false, don't do backward comparison -- just compare
818 in_acclist (const char *const *accepts, const char *s, bool backward)
820 for (; *accepts; accepts++)
822 if (has_wildcards_p (*accepts))
824 int res = opt.ignore_case
825 ? fnmatch_nocase (*accepts, s, 0) : fnmatch (*accepts, s, 0);
826 /* fnmatch returns 0 if the pattern *does* match the string. */
834 if (match_tail (s, *accepts, opt.ignore_case))
839 int cmp = opt.ignore_case
840 ? strcasecmp (s, *accepts) : strcmp (s, *accepts);
849 /* Return the location of STR's suffix (file extension). Examples:
850 suffix ("foo.bar") -> "bar"
851 suffix ("foo.bar.baz") -> "baz"
852 suffix ("/foo/bar") -> NULL
853 suffix ("/foo.bar/baz") -> NULL */
855 suffix (const char *str)
859 for (i = strlen (str); i && str[i] != '/' && str[i] != '.'; i--)
863 return (char *)str + i;
868 /* Return true if S contains globbing wildcards (`*', `?', `[' or
872 has_wildcards_p (const char *s)
875 if (*s == '*' || *s == '?' || *s == '[' || *s == ']')
880 /* Return true if FNAME ends with a typical HTML suffix. The
881 following (case-insensitive) suffixes are presumed to be HTML
886 ?html (`?' matches one character)
888 #### CAVEAT. This is not necessarily a good indication that FNAME
889 refers to a file that contains HTML! */
891 has_html_suffix_p (const char *fname)
895 if ((suf = suffix (fname)) == NULL)
897 if (!strcasecmp (suf, "html"))
899 if (!strcasecmp (suf, "htm"))
901 if (suf[0] && !strcasecmp (suf + 1, "html"))
906 /* Read a line from FP and return the pointer to freshly allocated
907 storage. The storage space is obtained through malloc() and should
908 be freed with free() when it is no longer needed.
910 The length of the line is not limited, except by available memory.
911 The newline character at the end of line is retained. The line is
912 terminated with a zero character.
914 After end-of-file is encountered without anything being read, NULL
915 is returned. NULL is also returned on error. To distinguish
916 between these two cases, use the stdio function ferror(). */
919 read_whole_line (FILE *fp)
923 char *line = xmalloc (bufsize);
925 while (fgets (line + length, bufsize - length, fp))
927 length += strlen (line + length);
929 /* Possible for example when reading from a binary file where
930 a line begins with \0. */
933 if (line[length - 1] == '\n')
936 /* fgets() guarantees to read the whole line, or to use up the
937 space we've given it. We can double the buffer
940 line = xrealloc (line, bufsize);
942 if (length == 0 || ferror (fp))
947 if (length + 1 < bufsize)
948 /* Relieve the memory from our exponential greediness. We say
949 `length + 1' because the terminating \0 is not included in
950 LENGTH. We don't need to zero-terminate the string ourselves,
951 though, because fgets() does that. */
952 line = xrealloc (line, length + 1);
956 /* Read FILE into memory. A pointer to `struct file_memory' are
957 returned; use struct element `content' to access file contents, and
958 the element `length' to know the file length. `content' is *not*
959 zero-terminated, and you should *not* read or write beyond the [0,
960 length) range of characters.
962 After you are done with the file contents, call read_file_free to
965 Depending on the operating system and the type of file that is
966 being read, read_file() either mmap's the file into memory, or
967 reads the file into the core using read().
969 If file is named "-", fileno(stdin) is used for reading instead.
970 If you want to read from a real file named "-", use "./-" instead. */
973 read_file (const char *file)
976 struct file_memory *fm;
978 bool inhibit_close = false;
980 /* Some magic in the finest tradition of Perl and its kin: if FILE
981 is "-", just use stdin. */
985 inhibit_close = true;
986 /* Note that we don't inhibit mmap() in this case. If stdin is
987 redirected from a regular file, mmap() will still work. */
990 fd = open (file, O_RDONLY);
993 fm = xnew (struct file_memory);
998 if (fstat (fd, &buf) < 0)
1000 fm->length = buf.st_size;
1001 /* NOTE: As far as I know, the callers of this function never
1002 modify the file text. Relying on this would enable us to
1003 specify PROT_READ and MAP_SHARED for a marginal gain in
1004 efficiency, but at some cost to generality. */
1005 fm->content = mmap (NULL, fm->length, PROT_READ | PROT_WRITE,
1006 MAP_PRIVATE, fd, 0);
1007 if (fm->content == (char *)MAP_FAILED)
1017 /* The most common reason why mmap() fails is that FD does not point
1018 to a plain file. However, it's also possible that mmap() doesn't
1019 work for a particular type of file. Therefore, whenever mmap()
1020 fails, we just fall back to the regular method. */
1021 #endif /* HAVE_MMAP */
1024 size = 512; /* number of bytes fm->contents can
1025 hold at any given time. */
1026 fm->content = xmalloc (size);
1030 if (fm->length > size / 2)
1032 /* #### I'm not sure whether the whole exponential-growth
1033 thing makes sense with kernel read. On Linux at least,
1034 read() refuses to read more than 4K from a file at a
1035 single chunk anyway. But other Unixes might optimize it
1036 better, and it doesn't *hurt* anything, so I'm leaving
1039 /* Normally, we grow SIZE exponentially to make the number
1040 of calls to read() and realloc() logarithmic in relation
1041 to file size. However, read() can read an amount of data
1042 smaller than requested, and it would be unreasonable to
1043 double SIZE every time *something* was read. Therefore,
1044 we double SIZE only when the length exceeds half of the
1045 entire allocated size. */
1047 fm->content = xrealloc (fm->content, size);
1049 nread = read (fd, fm->content + fm->length, size - fm->length);
1051 /* Successful read. */
1052 fm->length += nread;
1062 if (size > fm->length && fm->length != 0)
1063 /* Due to exponential growth of fm->content, the allocated region
1064 might be much larger than what is actually needed. */
1065 fm->content = xrealloc (fm->content, fm->length);
1072 xfree (fm->content);
1077 /* Release the resources held by FM. Specifically, this calls
1078 munmap() or xfree() on fm->content, depending whether mmap or
1079 malloc/read were used to read in the file. It also frees the
1080 memory needed to hold the FM structure itself. */
1083 read_file_free (struct file_memory *fm)
1088 munmap (fm->content, fm->length);
1093 xfree (fm->content);
1098 /* Free the pointers in a NULL-terminated vector of pointers, then
1099 free the pointer itself. */
1101 free_vec (char **vec)
1112 /* Append vector V2 to vector V1. The function frees V2 and
1113 reallocates V1 (thus you may not use the contents of neither
1114 pointer after the call). If V1 is NULL, V2 is returned. */
1116 merge_vecs (char **v1, char **v2)
1126 /* To avoid j == 0 */
1131 for (i = 0; v1[i]; i++)
1134 for (j = 0; v2[j]; j++)
1136 /* Reallocate v1. */
1137 v1 = xrealloc (v1, (i + j + 1) * sizeof (char **));
1138 memcpy (v1 + i, v2, (j + 1) * sizeof (char *));
1143 /* Append a freshly allocated copy of STR to VEC. If VEC is NULL, it
1144 is allocated as needed. Return the new value of the vector. */
1147 vec_append (char **vec, const char *str)
1149 int cnt; /* count of vector elements, including
1150 the one we're about to append */
1153 for (cnt = 0; vec[cnt]; cnt++)
1159 /* Reallocate the array to fit the new element and the NULL. */
1160 vec = xrealloc (vec, (cnt + 1) * sizeof (char *));
1161 /* Append a copy of STR to the vector. */
1162 vec[cnt - 1] = xstrdup (str);
1167 /* Sometimes it's useful to create "sets" of strings, i.e. special
1168 hash tables where you want to store strings as keys and merely
1169 query for their existence. Here is a set of utility routines that
1170 makes that transparent. */
1173 string_set_add (struct hash_table *ht, const char *s)
1175 /* First check whether the set element already exists. If it does,
1176 do nothing so that we don't have to free() the old element and
1177 then strdup() a new one. */
1178 if (hash_table_contains (ht, s))
1181 /* We use "1" as value. It provides us a useful and clear arbitrary
1182 value, and it consumes no memory -- the pointers to the same
1183 string "1" will be shared by all the key-value pairs in all `set'
1185 hash_table_put (ht, xstrdup (s), "1");
1188 /* Synonym for hash_table_contains... */
1191 string_set_contains (struct hash_table *ht, const char *s)
1193 return hash_table_contains (ht, s);
1196 /* Convert the specified string set to array. ARRAY should be large
1197 enough to hold hash_table_count(ht) char pointers. */
1199 void string_set_to_array (struct hash_table *ht, char **array)
1201 hash_table_iterator iter;
1202 for (hash_table_iterate (ht, &iter); hash_table_iter_next (&iter); )
1203 *array++ = iter.key;
1206 /* Free the string set. This frees both the storage allocated for
1207 keys and the actual hash table. (hash_table_destroy would only
1208 destroy the hash table.) */
1211 string_set_free (struct hash_table *ht)
1213 hash_table_iterator iter;
1214 for (hash_table_iterate (ht, &iter); hash_table_iter_next (&iter); )
1216 hash_table_destroy (ht);
1219 /* Utility function: simply call xfree() on all keys and values of HT. */
1222 free_keys_and_values (struct hash_table *ht)
1224 hash_table_iterator iter;
1225 for (hash_table_iterate (ht, &iter); hash_table_iter_next (&iter); )
1232 /* Get digit grouping data for thousand separors by calling
1233 localeconv(). The data includes separator string and grouping info
1234 and is cached after the first call to the function.
1236 In locales that don't set a thousand separator (such as the "C"
1237 locale), this forces it to be ",". We are now only showing
1238 thousand separators in one place, so this shouldn't be a problem in
1242 get_grouping_data (const char **sep, const char **grouping)
1244 static const char *cached_sep;
1245 static const char *cached_grouping;
1246 static bool initialized;
1249 /* Get the grouping info from the locale. */
1250 struct lconv *lconv = localeconv ();
1251 cached_sep = lconv->thousands_sep;
1252 cached_grouping = lconv->grouping;
1253 #if ! USE_NLS_PROGRESS_BAR
1254 /* We can't count column widths, so ensure that the separator
1255 * is single-byte only (let check below determine what byte). */
1256 if (strlen(cached_sep) > 1)
1261 /* Many locales (such as "C" or "hr_HR") don't specify
1262 grouping, which we still want to use it for legibility.
1263 In those locales set the sep char to ',', unless that
1264 character is used for decimal point, in which case set it
1266 if (*lconv->decimal_point != ',')
1270 cached_grouping = "\x03";
1275 *grouping = cached_grouping;
1278 /* Return a printed representation of N with thousand separators.
1279 This should respect locale settings, with the exception of the "C"
1280 locale which mandates no separator, but we use one anyway.
1282 Unfortunately, we cannot use %'d (in fact it would be %'j) to get
1283 the separators because it's too non-portable, and it's hard to test
1284 for this feature at configure time. Besides, it wouldn't display
1285 separators in the "C" locale, still used by many Unix users. */
1288 with_thousand_seps (wgint n)
1290 static char outbuf[48];
1291 char *p = outbuf + sizeof outbuf;
1293 /* Info received from locale */
1294 const char *grouping, *sep;
1297 /* State information */
1298 int i = 0, groupsize;
1299 const char *atgroup;
1301 bool negative = n < 0;
1303 /* Initialize grouping data. */
1304 get_grouping_data (&sep, &grouping);
1305 seplen = strlen (sep);
1307 groupsize = *atgroup++;
1309 /* This would overflow on WGINT_MIN, but printing negative numbers
1310 is not an important goal of this fuinction. */
1314 /* Write the number into the buffer, backwards, inserting the
1315 separators as necessary. */
1319 *--p = n % 10 + '0';
1323 /* Prepend SEP to every groupsize'd digit and get new groupsize. */
1324 if (++i == groupsize)
1329 memcpy (p -= seplen, sep, seplen);
1332 groupsize = *atgroup++;
1341 /* N, a byte quantity, is converted to a human-readable abberviated
1342 form a la sizes printed by `ls -lh'. The result is written to a
1343 static buffer, a pointer to which is returned.
1345 Unlike `with_thousand_seps', this approximates to the nearest unit.
1346 Quoting GNU libit: "Most people visually process strings of 3-4
1347 digits effectively, but longer strings of digits are more prone to
1348 misinterpretation. Hence, converting to an abbreviated form
1349 usually improves readability."
1351 This intentionally uses kilobyte (KB), megabyte (MB), etc. in their
1352 original computer-related meaning of "powers of 1024". We don't
1353 use the "*bibyte" names invented in 1998, and seldom used in
1354 practice. Wikipedia's entry on "binary prefix" discusses this in
1358 human_readable (HR_NUMTYPE n)
1360 /* These suffixes are compatible with those of GNU `ls -lh'. */
1361 static char powers[] =
1363 'K', /* kilobyte, 2^10 bytes */
1364 'M', /* megabyte, 2^20 bytes */
1365 'G', /* gigabyte, 2^30 bytes */
1366 'T', /* terabyte, 2^40 bytes */
1367 'P', /* petabyte, 2^50 bytes */
1368 'E', /* exabyte, 2^60 bytes */
1373 /* If the quantity is smaller than 1K, just print it. */
1376 snprintf (buf, sizeof (buf), "%d", (int) n);
1380 /* Loop over powers, dividing N with 1024 in each iteration. This
1381 works unchanged for all sizes of wgint, while still avoiding
1382 non-portable `long double' arithmetic. */
1383 for (i = 0; i < countof (powers); i++)
1385 /* At each iteration N is greater than the *subsequent* power.
1386 That way N/1024.0 produces a decimal number in the units of
1388 if ((n / 1024) < 1024 || i == countof (powers) - 1)
1390 double val = n / 1024.0;
1391 /* Print values smaller than 10 with one decimal digits, and
1392 others without any decimals. */
1393 snprintf (buf, sizeof (buf), "%.*f%c",
1394 val < 10 ? 1 : 0, val, powers[i]);
1399 return NULL; /* unreached */
1402 /* Count the digits in the provided number. Used to allocate space
1403 when printing numbers. */
1406 numdigit (wgint number)
1410 ++cnt; /* accomodate '-' */
1411 while ((number /= 10) != 0)
1416 #define PR(mask) *p++ = n / (mask) + '0'
1418 /* DIGITS_<D> is used to print a D-digit number and should be called
1419 with mask==10^(D-1). It prints n/mask (the first digit), reducing
1420 n to n%mask (the remaining digits), and calling DIGITS_<D-1>.
1421 Recursively this continues until DIGITS_1 is invoked. */
1423 #define DIGITS_1(mask) PR (mask)
1424 #define DIGITS_2(mask) PR (mask), n %= (mask), DIGITS_1 ((mask) / 10)
1425 #define DIGITS_3(mask) PR (mask), n %= (mask), DIGITS_2 ((mask) / 10)
1426 #define DIGITS_4(mask) PR (mask), n %= (mask), DIGITS_3 ((mask) / 10)
1427 #define DIGITS_5(mask) PR (mask), n %= (mask), DIGITS_4 ((mask) / 10)
1428 #define DIGITS_6(mask) PR (mask), n %= (mask), DIGITS_5 ((mask) / 10)
1429 #define DIGITS_7(mask) PR (mask), n %= (mask), DIGITS_6 ((mask) / 10)
1430 #define DIGITS_8(mask) PR (mask), n %= (mask), DIGITS_7 ((mask) / 10)
1431 #define DIGITS_9(mask) PR (mask), n %= (mask), DIGITS_8 ((mask) / 10)
1432 #define DIGITS_10(mask) PR (mask), n %= (mask), DIGITS_9 ((mask) / 10)
1434 /* DIGITS_<11-20> are only used on machines with 64-bit wgints. */
1436 #define DIGITS_11(mask) PR (mask), n %= (mask), DIGITS_10 ((mask) / 10)
1437 #define DIGITS_12(mask) PR (mask), n %= (mask), DIGITS_11 ((mask) / 10)
1438 #define DIGITS_13(mask) PR (mask), n %= (mask), DIGITS_12 ((mask) / 10)
1439 #define DIGITS_14(mask) PR (mask), n %= (mask), DIGITS_13 ((mask) / 10)
1440 #define DIGITS_15(mask) PR (mask), n %= (mask), DIGITS_14 ((mask) / 10)
1441 #define DIGITS_16(mask) PR (mask), n %= (mask), DIGITS_15 ((mask) / 10)
1442 #define DIGITS_17(mask) PR (mask), n %= (mask), DIGITS_16 ((mask) / 10)
1443 #define DIGITS_18(mask) PR (mask), n %= (mask), DIGITS_17 ((mask) / 10)
1444 #define DIGITS_19(mask) PR (mask), n %= (mask), DIGITS_18 ((mask) / 10)
1446 /* Shorthand for casting to wgint. */
1449 /* Print NUMBER to BUFFER in base 10. This is equivalent to
1450 `sprintf(buffer, "%lld", (long long) number)', only typically much
1451 faster and portable to machines without long long.
1453 The speedup may make a difference in programs that frequently
1454 convert numbers to strings. Some implementations of sprintf,
1455 particularly the one in some versions of GNU libc, have been known
1456 to be quite slow when converting integers to strings.
1458 Return the pointer to the location where the terminating zero was
1459 printed. (Equivalent to calling buffer+strlen(buffer) after the
1462 BUFFER should be large enough to accept as many bytes as you expect
1463 the number to take up. On machines with 64-bit wgints the maximum
1464 needed size is 24 bytes. That includes the digits needed for the
1465 largest 64-bit number, the `-' sign in case it's negative, and the
1466 terminating '\0'. */
1469 number_to_string (char *buffer, wgint number)
1474 int last_digit_char = 0;
1476 #if (SIZEOF_WGINT != 4) && (SIZEOF_WGINT != 8)
1477 /* We are running in a very strange environment. Leave the correct
1478 printing to sprintf. */
1479 p += sprintf (buf, "%j", (intmax_t) (n));
1480 #else /* (SIZEOF_WGINT == 4) || (SIZEOF_WGINT == 8) */
1486 /* n = -n would overflow because -n would evaluate to a
1487 wgint value larger than WGINT_MAX. Need to make n
1488 smaller and handle the last digit separately. */
1489 int last_digit = n % 10;
1490 /* The sign of n%10 is implementation-defined. */
1492 last_digit_char = '0' - last_digit;
1494 last_digit_char = '0' + last_digit;
1495 /* After n is made smaller, -n will not overflow. */
1503 /* Use the DIGITS_ macro appropriate for N's number of digits. That
1504 way printing any N is fully open-coded without a loop or jump.
1505 (Also see description of DIGITS_*.) */
1507 if (n < 10) DIGITS_1 (1);
1508 else if (n < 100) DIGITS_2 (10);
1509 else if (n < 1000) DIGITS_3 (100);
1510 else if (n < 10000) DIGITS_4 (1000);
1511 else if (n < 100000) DIGITS_5 (10000);
1512 else if (n < 1000000) DIGITS_6 (100000);
1513 else if (n < 10000000) DIGITS_7 (1000000);
1514 else if (n < 100000000) DIGITS_8 (10000000);
1515 else if (n < 1000000000) DIGITS_9 (100000000);
1516 #if SIZEOF_WGINT == 4
1517 /* wgint is 32 bits wide: no number has more than 10 digits. */
1518 else DIGITS_10 (1000000000);
1520 /* wgint is 64 bits wide: handle numbers with 9-19 decimal digits.
1521 Constants are constructed by compile-time multiplication to avoid
1522 dealing with different notations for 64-bit constants
1523 (nL/nLL/nI64, depending on the compiler and architecture). */
1524 else if (n < 10*(W)1000000000) DIGITS_10 (1000000000);
1525 else if (n < 100*(W)1000000000) DIGITS_11 (10*(W)1000000000);
1526 else if (n < 1000*(W)1000000000) DIGITS_12 (100*(W)1000000000);
1527 else if (n < 10000*(W)1000000000) DIGITS_13 (1000*(W)1000000000);
1528 else if (n < 100000*(W)1000000000) DIGITS_14 (10000*(W)1000000000);
1529 else if (n < 1000000*(W)1000000000) DIGITS_15 (100000*(W)1000000000);
1530 else if (n < 10000000*(W)1000000000) DIGITS_16 (1000000*(W)1000000000);
1531 else if (n < 100000000*(W)1000000000) DIGITS_17 (10000000*(W)1000000000);
1532 else if (n < 1000000000*(W)1000000000) DIGITS_18 (100000000*(W)1000000000);
1533 else DIGITS_19 (1000000000*(W)1000000000);
1536 if (last_digit_char)
1537 *p++ = last_digit_char;
1540 #endif /* (SIZEOF_WGINT == 4) || (SIZEOF_WGINT == 8) */
1547 #undef SPRINTF_WGINT
1570 /* Print NUMBER to a statically allocated string and return a pointer
1571 to the printed representation.
1573 This function is intended to be used in conjunction with printf.
1574 It is hard to portably print wgint values:
1575 a) you cannot use printf("%ld", number) because wgint can be long
1576 long on 32-bit machines with LFS.
1577 b) you cannot use printf("%lld", number) because NUMBER could be
1578 long on 32-bit machines without LFS, or on 64-bit machines,
1579 which do not require LFS. Also, Windows doesn't support %lld.
1580 c) you cannot use printf("%j", (int_max_t) number) because not all
1581 versions of printf support "%j", the most notable being the one
1583 d) you cannot #define WGINT_FMT to the appropriate format and use
1584 printf(WGINT_FMT, number) because that would break translations
1585 for user-visible messages, such as printf("Downloaded: %d
1588 What you should use instead is printf("%s", number_to_static_string
1591 CAVEAT: since the function returns pointers to static data, you
1592 must be careful to copy its result before calling it again.
1593 However, to make it more useful with printf, the function maintains
1594 an internal ring of static buffers to return. That way things like
1595 printf("%s %s", number_to_static_string (num1),
1596 number_to_static_string (num2)) work as expected. Three buffers
1597 are currently used, which means that "%s %s %s" will work, but "%s
1598 %s %s %s" won't. If you need to print more than three wgints,
1599 bump the RING_SIZE (or rethink your message.) */
1602 number_to_static_string (wgint number)
1604 static char ring[RING_SIZE][24];
1606 char *buf = ring[ringpos];
1607 number_to_string (buf, number);
1608 ringpos = (ringpos + 1) % RING_SIZE;
1612 /* Determine the width of the terminal we're running on. If that's
1613 not possible, return 0. */
1616 determine_screen_width (void)
1618 /* If there's a way to get the terminal size using POSIX
1619 tcgetattr(), somebody please tell me. */
1624 if (opt.lfilename != NULL)
1627 fd = fileno (stderr);
1628 if (ioctl (fd, TIOCGWINSZ, &wsz) < 0)
1629 return 0; /* most likely ENOTTY */
1632 #elif defined(WINDOWS)
1633 CONSOLE_SCREEN_BUFFER_INFO csbi;
1634 if (!GetConsoleScreenBufferInfo (GetStdHandle (STD_ERROR_HANDLE), &csbi))
1636 return csbi.dwSize.X;
1637 #else /* neither TIOCGWINSZ nor WINDOWS */
1639 #endif /* neither TIOCGWINSZ nor WINDOWS */
1642 /* Whether the rnd system (either rand or [dl]rand48) has been
1644 static int rnd_seeded;
1646 /* Return a random number between 0 and MAX-1, inclusive.
1648 If the system does not support lrand48 and MAX is greater than the
1649 value of RAND_MAX+1 on the system, the returned value will be in
1650 the range [0, RAND_MAX]. This may be fixed in a future release.
1651 The random number generator is seeded automatically the first time
1654 This uses lrand48 where available, rand elsewhere. DO NOT use it
1655 for cryptography. It is only meant to be used in situations where
1656 quality of the random numbers returned doesn't really matter. */
1659 random_number (int max)
1664 srand48 ((long) time (NULL) ^ (long) getpid ());
1667 return lrand48 () % max;
1668 #else /* not HAVE_DRAND48 */
1674 srand ((unsigned) time (NULL) ^ (unsigned) getpid ());
1679 /* Like rand() % max, but uses the high-order bits for better
1680 randomness on architectures where rand() is implemented using a
1681 simple congruential generator. */
1683 bounded = (double) max * rnd / (RAND_MAX + 1.0);
1684 return (int) bounded;
1686 #endif /* not HAVE_DRAND48 */
1689 /* Return a random uniformly distributed floating point number in the
1690 [0, 1) range. Uses drand48 where available, and a really lame
1691 kludge elsewhere. */
1699 srand48 ((long) time (NULL) ^ (long) getpid ());
1703 #else /* not HAVE_DRAND48 */
1704 return ( random_number (10000) / 10000.0
1705 + random_number (10000) / (10000.0 * 10000.0)
1706 + random_number (10000) / (10000.0 * 10000.0 * 10000.0)
1707 + random_number (10000) / (10000.0 * 10000.0 * 10000.0 * 10000.0));
1708 #endif /* not HAVE_DRAND48 */
1711 /* Implementation of run_with_timeout, a generic timeout-forcing
1712 routine for systems with Unix-like signal handling. */
1714 #ifdef USE_SIGNAL_TIMEOUT
1715 # ifdef HAVE_SIGSETJMP
1716 # define SETJMP(env) sigsetjmp (env, 1)
1718 static sigjmp_buf run_with_timeout_env;
1721 abort_run_with_timeout (int sig)
1723 assert (sig == SIGALRM);
1724 siglongjmp (run_with_timeout_env, -1);
1726 # else /* not HAVE_SIGSETJMP */
1727 # define SETJMP(env) setjmp (env)
1729 static jmp_buf run_with_timeout_env;
1732 abort_run_with_timeout (int sig)
1734 assert (sig == SIGALRM);
1735 /* We don't have siglongjmp to preserve the set of blocked signals;
1736 if we longjumped out of the handler at this point, SIGALRM would
1737 remain blocked. We must unblock it manually. */
1738 int mask = siggetmask ();
1739 mask &= ~sigmask (SIGALRM);
1742 /* Now it's safe to longjump. */
1743 longjmp (run_with_timeout_env, -1);
1745 # endif /* not HAVE_SIGSETJMP */
1747 /* Arrange for SIGALRM to be delivered in TIMEOUT seconds. This uses
1748 setitimer where available, alarm otherwise.
1750 TIMEOUT should be non-zero. If the timeout value is so small that
1751 it would be rounded to zero, it is rounded to the least legal value
1752 instead (1us for setitimer, 1s for alarm). That ensures that
1753 SIGALRM will be delivered in all cases. */
1756 alarm_set (double timeout)
1759 /* Use the modern itimer interface. */
1760 struct itimerval itv;
1762 itv.it_value.tv_sec = (long) timeout;
1763 itv.it_value.tv_usec = 1000000 * (timeout - (long)timeout);
1764 if (itv.it_value.tv_sec == 0 && itv.it_value.tv_usec == 0)
1765 /* Ensure that we wait for at least the minimum interval.
1766 Specifying zero would mean "wait forever". */
1767 itv.it_value.tv_usec = 1;
1768 setitimer (ITIMER_REAL, &itv, NULL);
1769 #else /* not ITIMER_REAL */
1770 /* Use the old alarm() interface. */
1771 int secs = (int) timeout;
1773 /* Round TIMEOUTs smaller than 1 to 1, not to zero. This is
1774 because alarm(0) means "never deliver the alarm", i.e. "wait
1775 forever", which is not what someone who specifies a 0.5s
1776 timeout would expect. */
1779 #endif /* not ITIMER_REAL */
1782 /* Cancel the alarm set with alarm_set. */
1788 struct itimerval disable;
1790 setitimer (ITIMER_REAL, &disable, NULL);
1791 #else /* not ITIMER_REAL */
1793 #endif /* not ITIMER_REAL */
1796 /* Call FUN(ARG), but don't allow it to run for more than TIMEOUT
1797 seconds. Returns true if the function was interrupted with a
1798 timeout, false otherwise.
1800 This works by setting up SIGALRM to be delivered in TIMEOUT seconds
1801 using setitimer() or alarm(). The timeout is enforced by
1802 longjumping out of the SIGALRM handler. This has several
1803 advantages compared to the traditional approach of relying on
1804 signals causing system calls to exit with EINTR:
1806 * The callback function is *forcibly* interrupted after the
1807 timeout expires, (almost) regardless of what it was doing and
1808 whether it was in a syscall. For example, a calculation that
1809 takes a long time is interrupted as reliably as an IO
1812 * It works with both SYSV and BSD signals because it doesn't
1813 depend on the default setting of SA_RESTART.
1815 * It doesn't require special handler setup beyond a simple call
1816 to signal(). (It does use sigsetjmp/siglongjmp, but they're
1819 The only downside is that, if FUN allocates internal resources that
1820 are normally freed prior to exit from the functions, they will be
1821 lost in case of timeout. */
1824 run_with_timeout (double timeout, void (*fun) (void *), void *arg)
1834 signal (SIGALRM, abort_run_with_timeout);
1835 if (SETJMP (run_with_timeout_env) != 0)
1837 /* Longjumped out of FUN with a timeout. */
1838 signal (SIGALRM, SIG_DFL);
1841 alarm_set (timeout);
1844 /* Preserve errno in case alarm() or signal() modifies it. */
1845 saved_errno = errno;
1847 signal (SIGALRM, SIG_DFL);
1848 errno = saved_errno;
1853 #else /* not USE_SIGNAL_TIMEOUT */
1856 /* A stub version of run_with_timeout that just calls FUN(ARG). Don't
1857 define it under Windows, because Windows has its own version of
1858 run_with_timeout that uses threads. */
1861 run_with_timeout (double timeout, void (*fun) (void *), void *arg)
1866 #endif /* not WINDOWS */
1867 #endif /* not USE_SIGNAL_TIMEOUT */
1871 /* Sleep the specified amount of seconds. On machines without
1872 nanosleep(), this may sleep shorter if interrupted by signals. */
1875 xsleep (double seconds)
1877 #ifdef HAVE_NANOSLEEP
1878 /* nanosleep is the preferred interface because it offers high
1879 accuracy and, more importantly, because it allows us to reliably
1880 restart receiving a signal such as SIGWINCH. (There was an
1881 actual Debian bug report about --limit-rate malfunctioning while
1882 the terminal was being resized.) */
1883 struct timespec sleep, remaining;
1884 sleep.tv_sec = (long) seconds;
1885 sleep.tv_nsec = 1000000000 * (seconds - (long) seconds);
1886 while (nanosleep (&sleep, &remaining) < 0 && errno == EINTR)
1887 /* If nanosleep has been interrupted by a signal, adjust the
1888 sleeping period and return to sleep. */
1890 #elif defined(HAVE_USLEEP)
1891 /* If usleep is available, use it in preference to select. */
1894 /* On some systems, usleep cannot handle values larger than
1895 1,000,000. If the period is larger than that, use sleep
1896 first, then add usleep for subsecond accuracy. */
1898 seconds -= (long) seconds;
1900 usleep (seconds * 1000000);
1901 #else /* fall back select */
1902 /* Note that, although Windows supports select, it can't be used to
1903 implement sleeping because Winsock's select doesn't implement
1904 timeout when it is passed NULL pointers for all fd sets. (But it
1905 does under Cygwin, which implements Unix-compatible select.) */
1906 struct timeval sleep;
1907 sleep.tv_sec = (long) seconds;
1908 sleep.tv_usec = 1000000 * (seconds - (long) seconds);
1909 select (0, NULL, NULL, NULL, &sleep);
1910 /* If select returns -1 and errno is EINTR, it means we were
1911 interrupted by a signal. But without knowing how long we've
1912 actually slept, we can't return to sleep. Using gettimeofday to
1913 track sleeps is slow and unreliable due to clock skew. */
1917 #endif /* not WINDOWS */
1919 /* Encode the octets in DATA of length LENGTH to base64 format,
1920 storing the result to DEST. The output will be zero-terminated,
1921 and must point to a writable buffer of at least
1922 1+BASE64_LENGTH(length) bytes. The function returns the length of
1923 the resulting base64 data, not counting the terminating zero.
1925 This implementation does not emit newlines after 76 characters of
1929 base64_encode (const void *data, int length, char *dest)
1931 /* Conversion table. */
1932 static const char tbl[64] = {
1933 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P',
1934 'Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f',
1935 'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v',
1936 'w','x','y','z','0','1','2','3','4','5','6','7','8','9','+','/'
1938 /* Access bytes in DATA as unsigned char, otherwise the shifts below
1939 don't work for data with MSB set. */
1940 const unsigned char *s = data;
1941 /* Theoretical ANSI violation when length < 3. */
1942 const unsigned char *end = (const unsigned char *) data + length - 2;
1945 /* Transform the 3x8 bits to 4x6 bits, as required by base64. */
1946 for (; s < end; s += 3)
1948 *p++ = tbl[s[0] >> 2];
1949 *p++ = tbl[((s[0] & 3) << 4) + (s[1] >> 4)];
1950 *p++ = tbl[((s[1] & 0xf) << 2) + (s[2] >> 6)];
1951 *p++ = tbl[s[2] & 0x3f];
1954 /* Pad the result if necessary... */
1958 *p++ = tbl[s[0] >> 2];
1959 *p++ = tbl[(s[0] & 3) << 4];
1964 *p++ = tbl[s[0] >> 2];
1965 *p++ = tbl[((s[0] & 3) << 4) + (s[1] >> 4)];
1966 *p++ = tbl[((s[1] & 0xf) << 2)];
1970 /* ...and zero-terminate it. */
1976 /* Store in C the next non-whitespace character from the string, or \0
1977 when end of string is reached. */
1978 #define NEXT_CHAR(c, p) do { \
1979 c = (unsigned char) *p++; \
1980 } while (c_isspace (c))
1982 #define IS_ASCII(c) (((c) & 0x80) == 0)
1984 /* Decode data from BASE64 (a null-terminated string) into memory
1985 pointed to by DEST. DEST is assumed to be large enough to
1986 accomodate the decoded data, which is guaranteed to be no more than
1989 Since DEST is assumed to contain binary data, it is not
1990 NUL-terminated. The function returns the length of the data
1991 written to TO. -1 is returned in case of error caused by malformed
1994 This function originates from Free Recode. */
1997 base64_decode (const char *base64, void *dest)
1999 /* Table of base64 values for first 128 characters. Note that this
2000 assumes ASCII (but so does Wget in other places). */
2001 static const signed char base64_char_to_value[128] =
2003 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 0- 9 */
2004 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 10- 19 */
2005 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 20- 29 */
2006 -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, /* 30- 39 */
2007 -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, /* 40- 49 */
2008 54, 55, 56, 57, 58, 59, 60, 61, -1, -1, /* 50- 59 */
2009 -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, /* 60- 69 */
2010 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, /* 70- 79 */
2011 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, /* 80- 89 */
2012 25, -1, -1, -1, -1, -1, -1, 26, 27, 28, /* 90- 99 */
2013 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, /* 100-109 */
2014 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, /* 110-119 */
2015 49, 50, 51, -1, -1, -1, -1, -1 /* 120-127 */
2017 #define BASE64_CHAR_TO_VALUE(c) ((int) base64_char_to_value[c])
2018 #define IS_BASE64(c) ((IS_ASCII (c) && BASE64_CHAR_TO_VALUE (c) >= 0) || c == '=')
2020 const char *p = base64;
2026 unsigned long value;
2028 /* Process first byte of a quadruplet. */
2032 if (c == '=' || !IS_BASE64 (c))
2033 return -1; /* illegal char while decoding base64 */
2034 value = BASE64_CHAR_TO_VALUE (c) << 18;
2036 /* Process second byte of a quadruplet. */
2039 return -1; /* premature EOF while decoding base64 */
2040 if (c == '=' || !IS_BASE64 (c))
2041 return -1; /* illegal char while decoding base64 */
2042 value |= BASE64_CHAR_TO_VALUE (c) << 12;
2045 /* Process third byte of a quadruplet. */
2048 return -1; /* premature EOF while decoding base64 */
2050 return -1; /* illegal char while decoding base64 */
2056 return -1; /* premature EOF while decoding base64 */
2058 return -1; /* padding `=' expected but not found */
2062 value |= BASE64_CHAR_TO_VALUE (c) << 6;
2063 *q++ = 0xff & value >> 8;
2065 /* Process fourth byte of a quadruplet. */
2068 return -1; /* premature EOF while decoding base64 */
2072 return -1; /* illegal char while decoding base64 */
2074 value |= BASE64_CHAR_TO_VALUE (c);
2075 *q++ = 0xff & value;
2078 #undef BASE64_CHAR_TO_VALUE
2080 return q - (char *) dest;
2086 /* Simple merge sort for use by stable_sort. Implementation courtesy
2087 Zeljko Vrba with additional debugging by Nenad Barbutov. */
2090 mergesort_internal (void *base, void *temp, size_t size, size_t from, size_t to,
2091 int (*cmpfun) (const void *, const void *))
2093 #define ELT(array, pos) ((char *)(array) + (pos) * size)
2097 size_t mid = (to + from) / 2;
2098 mergesort_internal (base, temp, size, from, mid, cmpfun);
2099 mergesort_internal (base, temp, size, mid + 1, to, cmpfun);
2102 for (k = from; (i <= mid) && (j <= to); k++)
2103 if (cmpfun (ELT (base, i), ELT (base, j)) <= 0)
2104 memcpy (ELT (temp, k), ELT (base, i++), size);
2106 memcpy (ELT (temp, k), ELT (base, j++), size);
2108 memcpy (ELT (temp, k++), ELT (base, i++), size);
2110 memcpy (ELT (temp, k++), ELT (base, j++), size);
2111 for (k = from; k <= to; k++)
2112 memcpy (ELT (base, k), ELT (temp, k), size);
2117 /* Stable sort with interface exactly like standard library's qsort.
2118 Uses mergesort internally, allocating temporary storage with
2122 stable_sort (void *base, size_t nmemb, size_t size,
2123 int (*cmpfun) (const void *, const void *))
2127 void *temp = alloca (nmemb * size * sizeof (void *));
2128 mergesort_internal (base, temp, size, 0, nmemb - 1, cmpfun);
2132 /* Print a decimal number. If it is equal to or larger than ten, the
2133 number is rounded. Otherwise it is printed with one significant
2134 digit without trailing zeros and with no more than three fractional
2135 digits total. For example, 0.1 is printed as "0.1", 0.035 is
2136 printed as "0.04", 0.0091 as "0.009", and 0.0003 as simply "0".
2138 This is useful for displaying durations because it provides
2139 order-of-magnitude information without unnecessary clutter --
2140 long-running downloads are shown without the fractional part, and
2141 short ones still retain one significant digit. */
2144 print_decimal (double number)
2146 static char buf[32];
2147 double n = number >= 0 ? number : -number;
2150 /* Cut off at 9.95 because the below %.1f would round 9.96 to
2151 "10.0" instead of "10". OTOH 9.94 will print as "9.9". */
2152 snprintf (buf, sizeof buf, "%.0f", number);
2154 snprintf (buf, sizeof buf, "%.1f", number);
2155 else if (n >= 0.001)
2156 snprintf (buf, sizeof buf, "%.1g", number);
2157 else if (n >= 0.0005)
2158 /* round [0.0005, 0.001) to 0.001 */
2159 snprintf (buf, sizeof buf, "%.3f", number);
2161 /* print numbers close to 0 as 0, not 0.000 */
2178 { "/somedir", "/somedir", true },
2179 { "/somedir", "/somedir/d2", true },
2180 { "/somedir/d1", "/somedir", false },
2183 for (i = 0; i < countof(test_array); ++i)
2185 bool res = subdir_p (test_array[i].d1, test_array[i].d2);
2187 mu_assert ("test_subdir_p: wrong result",
2188 res == test_array[i].result);
2195 test_dir_matches_p()
2203 { { "/somedir", "/someotherdir", NULL }, "somedir", true },
2204 { { "/somedir", "/someotherdir", NULL }, "anotherdir", false },
2205 { { "/somedir", "/*otherdir", NULL }, "anotherdir", true },
2206 { { "/somedir/d1", "/someotherdir", NULL }, "somedir/d1", true },
2207 { { "*/*d1", "/someotherdir", NULL }, "somedir/d1", true },
2208 { { "/somedir/d1", "/someotherdir", NULL }, "d1", false },
2209 { { "!COMPLETE", NULL, NULL }, "!COMPLETE", true },
2210 { { "*COMPLETE", NULL, NULL }, "!COMPLETE", true },
2211 { { "*/!COMPLETE", NULL, NULL }, "foo/!COMPLETE", true },
2212 { { "*COMPLETE", NULL, NULL }, "foo/!COMPLETE", false },
2213 { { "*/*COMPLETE", NULL, NULL }, "foo/!COMPLETE", true },
2214 { { "/dir with spaces", NULL, NULL }, "dir with spaces", true },
2215 { { "/dir*with*spaces", NULL, NULL }, "dir with spaces", true },
2218 for (i = 0; i < countof(test_array); ++i)
2220 bool res = dir_matches_p (test_array[i].dirlist, test_array[i].dir);
2222 mu_assert ("test_dir_matches_p: wrong result",
2223 res == test_array[i].result);
2229 #endif /* TESTING */