1 /* Various functions of utilitarian nature.
2 Copyright (C) 1995, 1996, 1997, 1998, 2000, 2001
3 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 2 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, write to the Free Software
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. */
27 #else /* not HAVE_STRING_H */
29 #endif /* not HAVE_STRING_H */
30 #include <sys/types.h>
35 # include <sys/mman.h>
44 #ifdef HAVE_SYS_UTIME_H
45 # include <sys/utime.h>
49 # include <libc.h> /* for access() */
54 /* For TIOCGWINSZ and friends: */
55 #ifdef HAVE_SYS_IOCTL_H
56 # include <sys/ioctl.h>
71 /* This section implements several wrappers around the basic
72 allocation routines. This is done for two reasons: first, so that
73 the callers of these functions need not consistently check for
74 errors. If there is not enough virtual memory for running Wget,
75 something is seriously wrong, and Wget exits with an appropriate
78 The second reason why these are useful is that, if DEBUG_MALLOC is
79 defined, they also provide a handy (if crude) malloc debugging
80 interface that checks memory leaks. */
82 /* Croak the fatal memory error and bail out with non-zero exit
85 memfatal (const char *what)
87 /* HACK: expose save_log_p from log.c, so we can turn it off in
88 order to prevent saving the log. Saving the log is dangerous
89 because logprintf() and logputs() can call malloc(), so this
90 could infloop. When logging is turned off, infloop can no longer
93 #### This is no longer really necessary because the new routines
94 in log.c cons only if the line exceeds eighty characters. But
95 this can come at the end of a line, so it's OK to be careful.
97 On a more serious note, it would be good to have a
98 log_forced_shutdown() routine that exposes this cleanly. */
99 extern int save_log_p;
102 logprintf (LOG_ALWAYS, _("%s: %s: Not enough memory.\n"), exec_name, what);
106 /* These functions end with _real because they need to be
107 distinguished from the debugging functions, and from the macros.
110 If memory debugging is not turned on, wget.h defines these:
112 #define xmalloc xmalloc_real
113 #define xrealloc xrealloc_real
114 #define xstrdup xstrdup_real
117 In case of memory debugging, the definitions are a bit more
118 complex, because we want to provide more information, *and* we want
119 to call the debugging code. (The former is the reason why xmalloc
120 and friends need to be macros in the first place.) Then it looks
123 #define xmalloc(a) xmalloc_debug (a, __FILE__, __LINE__)
124 #define xfree(a) xfree_debug (a, __FILE__, __LINE__)
125 #define xrealloc(a, b) xrealloc_debug (a, b, __FILE__, __LINE__)
126 #define xstrdup(a) xstrdup_debug (a, __FILE__, __LINE__)
128 Each of the *_debug function does its magic and calls the real one. */
131 # define STATIC_IF_DEBUG static
133 # define STATIC_IF_DEBUG
136 STATIC_IF_DEBUG void *
137 xmalloc_real (size_t size)
139 void *ptr = malloc (size);
145 STATIC_IF_DEBUG void *
146 xrealloc_real (void *ptr, size_t newsize)
150 /* Not all Un*xes have the feature of realloc() that calling it with
151 a NULL-pointer is the same as malloc(), but it is easy to
154 newptr = realloc (ptr, newsize);
156 newptr = malloc (newsize);
158 memfatal ("realloc");
162 STATIC_IF_DEBUG char *
163 xstrdup_real (const char *s)
169 copy = malloc (l + 1);
172 memcpy (copy, s, l + 1);
173 #else /* HAVE_STRDUP */
177 #endif /* HAVE_STRDUP */
184 /* Crude home-grown routines for debugging some malloc-related
187 * Counting the number of malloc and free invocations, and reporting
188 the "balance", i.e. how many times more malloc was called than it
189 was the case with free.
191 * Making malloc store its entry into a simple array and free remove
192 stuff from that array. At the end, print the pointers which have
193 not been freed, along with the source file and the line number.
194 This also has the side-effect of detecting freeing memory that
197 Note that this kind of memory leak checking strongly depends on
198 every malloc() being followed by a free(), even if the program is
199 about to finish. Wget is careful to free the data structure it
200 allocated in init.c. */
202 static int malloc_count, free_count;
208 } malloc_debug[100000];
210 /* Both register_ptr and unregister_ptr take O(n) operations to run,
211 which can be a real problem. It would be nice to use a hash table
212 for malloc_debug, but the functions in hash.c are not suitable
213 because they can call malloc() themselves. Maybe it would work if
214 the hash table were preallocated to a huge size, and if we set the
215 rehash threshold to 1.0. */
217 /* Register PTR in malloc_debug. Abort if this is not possible
218 (presumably due to the number of current allocations exceeding the
219 size of malloc_debug.) */
222 register_ptr (void *ptr, const char *file, int line)
225 for (i = 0; i < ARRAY_SIZE (malloc_debug); i++)
226 if (malloc_debug[i].ptr == NULL)
228 malloc_debug[i].ptr = ptr;
229 malloc_debug[i].file = file;
230 malloc_debug[i].line = line;
236 /* Unregister PTR from malloc_debug. Abort if PTR is not present in
237 malloc_debug. (This catches calling free() with a bogus pointer.) */
240 unregister_ptr (void *ptr)
243 for (i = 0; i < ARRAY_SIZE (malloc_debug); i++)
244 if (malloc_debug[i].ptr == ptr)
246 malloc_debug[i].ptr = NULL;
252 /* Print the malloc debug stats that can be gathered from the above
253 information. Currently this is the count of mallocs, frees, the
254 difference between the two, and the dump of the contents of
255 malloc_debug. The last part are the memory leaks. */
258 print_malloc_debug_stats (void)
261 printf ("\nMalloc: %d\nFree: %d\nBalance: %d\n\n",
262 malloc_count, free_count, malloc_count - free_count);
263 for (i = 0; i < ARRAY_SIZE (malloc_debug); i++)
264 if (malloc_debug[i].ptr != NULL)
265 printf ("0x%08ld: %s:%d\n", (long)malloc_debug[i].ptr,
266 malloc_debug[i].file, malloc_debug[i].line);
270 xmalloc_debug (size_t size, const char *source_file, int source_line)
272 void *ptr = xmalloc_real (size);
274 register_ptr (ptr, source_file, source_line);
279 xfree_debug (void *ptr, const char *source_file, int source_line)
281 assert (ptr != NULL);
283 unregister_ptr (ptr);
288 xrealloc_debug (void *ptr, size_t newsize, const char *source_file, int source_line)
290 void *newptr = xrealloc_real (ptr, newsize);
294 register_ptr (newptr, source_file, source_line);
296 else if (newptr != ptr)
298 unregister_ptr (ptr);
299 register_ptr (newptr, source_file, source_line);
305 xstrdup_debug (const char *s, const char *source_file, int source_line)
307 char *copy = xstrdup_real (s);
309 register_ptr (copy, source_file, source_line);
313 #endif /* DEBUG_MALLOC */
315 /* Utility function: like xstrdup(), but also lowercases S. */
318 xstrdup_lower (const char *s)
320 char *copy = xstrdup (s);
327 /* Return a count of how many times CHR occurs in STRING. */
330 count_char (const char *string, char chr)
334 for (p = string; *p; p++)
340 /* Copy the string formed by two pointers (one on the beginning, other
341 on the char after the last char) to a new, malloc-ed location.
344 strdupdelim (const char *beg, const char *end)
346 char *res = (char *)xmalloc (end - beg + 1);
347 memcpy (res, beg, end - beg);
348 res[end - beg] = '\0';
352 /* Parse a string containing comma-separated elements, and return a
353 vector of char pointers with the elements. Spaces following the
354 commas are ignored. */
356 sepstring (const char *s)
370 res = (char **)xrealloc (res, (i + 2) * sizeof (char *));
371 res[i] = strdupdelim (p, s);
374 /* Skip the blanks following the ','. */
382 res = (char **)xrealloc (res, (i + 2) * sizeof (char *));
383 res[i] = strdupdelim (p, s);
388 /* Return pointer to a static char[] buffer in which zero-terminated
389 string-representation of TM (in form hh:mm:ss) is printed.
391 If TM is non-NULL, the current time-in-seconds will be stored
394 (#### This is misleading: one would expect TM would be used instead
395 of the current time in that case. This design was probably
396 influenced by the design time(2), and should be changed at some
397 points. No callers use non-NULL TM anyway.) */
400 time_str (time_t *tm)
402 static char output[15];
404 time_t secs = time (tm);
408 /* In case of error, return the empty string. Maybe we should
409 just abort if this happens? */
413 ptm = localtime (&secs);
414 sprintf (output, "%02d:%02d:%02d", ptm->tm_hour, ptm->tm_min, ptm->tm_sec);
418 /* Like the above, but include the date: YYYY-MM-DD hh:mm:ss. */
421 datetime_str (time_t *tm)
423 static char output[20]; /* "YYYY-MM-DD hh:mm:ss" + \0 */
425 time_t secs = time (tm);
429 /* In case of error, return the empty string. Maybe we should
430 just abort if this happens? */
434 ptm = localtime (&secs);
435 sprintf (output, "%04d-%02d-%02d %02d:%02d:%02d",
436 ptm->tm_year + 1900, ptm->tm_mon + 1, ptm->tm_mday,
437 ptm->tm_hour, ptm->tm_min, ptm->tm_sec);
441 /* The Windows versions of the following two functions are defined in
446 fork_to_background (void)
449 /* Whether we arrange our own version of opt.lfilename here. */
454 opt.lfilename = unique_name (DEFAULT_LOGFILE);
466 /* parent, no error */
467 printf (_("Continuing in background.\n"));
469 printf (_("Output will be written to `%s'.\n"), opt.lfilename);
472 /* child: keep running */
474 #endif /* not WINDOWS */
476 /* Resolve "." and ".." elements of PATH by destructively modifying
477 PATH. "." is resolved by removing that path element, and ".." is
478 resolved by removing the preceding path element. Leading and
479 trailing slashes are preserved.
481 Return non-zero if any changes have been made.
483 For example, "a/b/c/./../d/.." will yield "a/b/". More exhaustive
484 test examples are provided below. If you change anything in this
485 function, run test_path_simplify to make sure you haven't broken a
488 A previous version of this function was based on path_simplify()
489 from GNU Bash, but it has been rewritten for Wget 1.8.1. */
492 path_simplify (char *path)
498 ++path; /* preserve the leading '/'. */
501 end = p + strlen (p) + 1; /* position past the terminating zero. */
506 /* P should point to the beginning of a path element. */
508 if (*p == '.' && (*(p + 1) == '/' || *(p + 1) == '\0'))
510 /* Handle "./foo" by moving "foo" two characters to the
515 memmove (p, p + 2, end - p);
526 else if (*p == '.' && *(p + 1) == '.'
527 && (*(p + 2) == '/' || *(p + 2) == '\0'))
529 /* Handle "../foo" by moving "foo" one path element to the
531 char *b = p; /* not p-1 because P can equal PATH */
533 /* Backtrack by one path element, but not past the beginning
542 /* Move backwards until B hits the beginning of the
543 previous path element or the beginning of path. */
544 for (--b; b > path && *(b - 1) != '/'; b--)
551 memmove (b, p + 3, end - (p + 3));
565 /* Remove empty path elements. Not mandated by rfc1808 et
566 al, but empty path elements are not all that useful, and
567 the rest of Wget might not deal with them well. */
577 memmove (p, q, end - q);
582 /* Skip to the next path element. */
583 while (*p && *p != '/')
588 /* Make sure P points to the beginning of the next path element,
589 which is location after the slash. */
596 /* "Touch" FILE, i.e. make its atime and mtime equal to the time
597 specified with TM. */
599 touch (const char *file, time_t tm)
601 #ifdef HAVE_STRUCT_UTIMBUF
602 struct utimbuf times;
603 times.actime = times.modtime = tm;
606 times[0] = times[1] = tm;
609 if (utime (file, ×) == -1)
610 logprintf (LOG_NOTQUIET, "utime(%s): %s\n", file, strerror (errno));
613 /* Checks if FILE is a symbolic link, and removes it if it is. Does
614 nothing under MS-Windows. */
616 remove_link (const char *file)
621 if (lstat (file, &st) == 0 && S_ISLNK (st.st_mode))
623 DEBUGP (("Unlinking %s (symlink).\n", file));
626 logprintf (LOG_VERBOSE, _("Failed to unlink symlink `%s': %s\n"),
627 file, strerror (errno));
632 /* Does FILENAME exist? This is quite a lousy implementation, since
633 it supplies no error codes -- only a yes-or-no answer. Thus it
634 will return that a file does not exist if, e.g., the directory is
635 unreadable. I don't mind it too much currently, though. The
636 proper way should, of course, be to have a third, error state,
637 other than true/false, but that would introduce uncalled-for
638 additional complexity to the callers. */
640 file_exists_p (const char *filename)
643 return access (filename, F_OK) >= 0;
646 return stat (filename, &buf) >= 0;
650 /* Returns 0 if PATH is a directory, 1 otherwise (any kind of file).
651 Returns 0 on error. */
653 file_non_directory_p (const char *path)
656 /* Use lstat() rather than stat() so that symbolic links pointing to
657 directories can be identified correctly. */
658 if (lstat (path, &buf) != 0)
660 return S_ISDIR (buf.st_mode) ? 0 : 1;
663 /* Return a unique filename, given a prefix and count */
665 unique_name_1 (const char *fileprefix, int count)
671 filename = (char *)xmalloc (strlen (fileprefix) + numdigit (count) + 2);
672 sprintf (filename, "%s.%d", fileprefix, count);
675 filename = xstrdup (fileprefix);
677 if (!file_exists_p (filename))
686 /* Return a unique file name, based on PREFIX. */
688 unique_name (const char *prefix)
694 file = unique_name_1 (prefix, count++);
698 /* Create DIRECTORY. If some of the pathname components of DIRECTORY
699 are missing, create them first. In case any mkdir() call fails,
700 return its error status. Returns 0 on successful completion.
702 The behaviour of this function should be identical to the behaviour
703 of `mkdir -p' on systems where mkdir supports the `-p' option. */
705 make_directory (const char *directory)
711 /* Make a copy of dir, to be able to write to it. Otherwise, the
712 function is unsafe if called with a read-only char *argument. */
713 STRDUP_ALLOCA (dir, directory);
715 /* If the first character of dir is '/', skip it (and thus enable
716 creation of absolute-pathname directories. */
717 for (i = (*dir == '/'); 1; ++i)
719 for (; dir[i] && dir[i] != '/'; i++)
724 /* Check whether the directory already exists. */
725 if (!file_exists_p (dir))
727 if (mkdir (dir, 0777) < 0)
738 /* Merge BASE with FILE. BASE can be a directory or a file name, FILE
739 should be a file name.
741 file_merge("/foo/bar", "baz") => "/foo/baz"
742 file_merge("/foo/bar/", "baz") => "/foo/bar/baz"
743 file_merge("foo", "bar") => "bar"
745 In other words, it's a simpler and gentler version of uri_merge_1. */
748 file_merge (const char *base, const char *file)
751 const char *cut = (const char *)strrchr (base, '/');
754 return xstrdup (file);
756 result = (char *)xmalloc (cut - base + 1 + strlen (file) + 1);
757 memcpy (result, base, cut - base);
758 result[cut - base] = '/';
759 strcpy (result + (cut - base) + 1, file);
764 static int in_acclist PARAMS ((const char *const *, const char *, int));
766 /* Determine whether a file is acceptable to be followed, according to
767 lists of patterns to accept/reject. */
769 acceptable (const char *s)
773 while (l && s[l] != '/')
780 return (in_acclist ((const char *const *)opt.accepts, s, 1)
781 && !in_acclist ((const char *const *)opt.rejects, s, 1));
783 return in_acclist ((const char *const *)opt.accepts, s, 1);
785 else if (opt.rejects)
786 return !in_acclist ((const char *const *)opt.rejects, s, 1);
790 /* Compare S1 and S2 frontally; S2 must begin with S1. E.g. if S1 is
791 `/something', frontcmp() will return 1 only if S2 begins with
792 `/something'. Otherwise, 0 is returned. */
794 frontcmp (const char *s1, const char *s2)
796 for (; *s1 && *s2 && (*s1 == *s2); ++s1, ++s2);
800 /* Iterate through STRLIST, and return the first element that matches
801 S, through wildcards or front comparison (as appropriate). */
803 proclist (char **strlist, const char *s, enum accd flags)
807 for (x = strlist; *x; x++)
808 if (has_wildcards_p (*x))
810 if (fnmatch (*x, s, FNM_PATHNAME) == 0)
815 char *p = *x + ((flags & ALLABS) && (**x == '/')); /* Remove '/' */
822 /* Returns whether DIRECTORY is acceptable for download, wrt the
823 include/exclude lists.
825 If FLAGS is ALLABS, the leading `/' is ignored in paths; relative
826 and absolute paths may be freely intermixed. */
828 accdir (const char *directory, enum accd flags)
830 /* Remove starting '/'. */
831 if (flags & ALLABS && *directory == '/')
835 if (!proclist (opt.includes, directory, flags))
840 if (proclist (opt.excludes, directory, flags))
846 /* Match the end of STRING against PATTERN. For instance:
848 match_backwards ("abc", "bc") -> 1
849 match_backwards ("abc", "ab") -> 0
850 match_backwards ("abc", "abc") -> 1 */
852 match_tail (const char *string, const char *pattern)
856 for (i = strlen (string), j = strlen (pattern); i >= 0 && j >= 0; i--, j--)
857 if (string[i] != pattern[j])
859 /* If the pattern was exhausted, the match was succesful. */
866 /* Checks whether string S matches each element of ACCEPTS. A list
867 element are matched either with fnmatch() or match_tail(),
868 according to whether the element contains wildcards or not.
870 If the BACKWARD is 0, don't do backward comparison -- just compare
873 in_acclist (const char *const *accepts, const char *s, int backward)
875 for (; *accepts; accepts++)
877 if (has_wildcards_p (*accepts))
879 /* fnmatch returns 0 if the pattern *does* match the
881 if (fnmatch (*accepts, s, 0) == 0)
888 if (match_tail (s, *accepts))
893 if (!strcmp (s, *accepts))
901 /* Return the location of STR's suffix (file extension). Examples:
902 suffix ("foo.bar") -> "bar"
903 suffix ("foo.bar.baz") -> "baz"
904 suffix ("/foo/bar") -> NULL
905 suffix ("/foo.bar/baz") -> NULL */
907 suffix (const char *str)
911 for (i = strlen (str); i && str[i] != '/' && str[i] != '.'; i--)
915 return (char *)str + i;
920 /* Read a line from FP. The function reallocs the storage as needed
921 to accomodate for any length of the line. Reallocs are done
922 exponentially, doubling the storage after each overflow to minimize
923 the number of calls to realloc() and fgets(). The newline
924 character at the end of line is retained.
926 After end-of-file is encountered without anything being read, NULL
927 is returned. NULL is also returned on error. To distinguish
928 between these two cases, use the stdio function ferror().
930 A future version of this function will be rewritten to use fread()
931 instead of fgets(), and to return the length of the line, which
932 will make the function usable on files with binary content. */
935 read_whole_line (FILE *fp)
939 char *line = (char *)xmalloc (bufsize);
941 while (fgets (line + length, bufsize - length, fp))
943 length += strlen (line + length);
945 /* Possible for example when reading from a binary file where
946 a line begins with \0. */
949 if (line[length - 1] == '\n')
952 /* fgets() guarantees to read the whole line, or to use up the
953 space we've given it. We can double the buffer
956 line = xrealloc (line, bufsize);
958 if (length == 0 || ferror (fp))
963 if (length + 1 < bufsize)
964 /* Relieve the memory from our exponential greediness. We say
965 `length + 1' because the terminating \0 is not included in
966 LENGTH. We don't need to zero-terminate the string ourselves,
967 though, because fgets() does that. */
968 line = xrealloc (line, length + 1);
972 /* Read FILE into memory. A pointer to `struct file_memory' are
973 returned; use struct element `content' to access file contents, and
974 the element `length' to know the file length. `content' is *not*
975 zero-terminated, and you should *not* read or write beyond the [0,
976 length) range of characters.
978 After you are done with the file contents, call read_file_free to
981 Depending on the operating system and the type of file that is
982 being read, read_file() either mmap's the file into memory, or
983 reads the file into the core using read().
985 If file is named "-", fileno(stdin) is used for reading instead.
986 If you want to read from a real file named "-", use "./-" instead. */
989 read_file (const char *file)
992 struct file_memory *fm;
994 int inhibit_close = 0;
996 /* Some magic in the finest tradition of Perl and its kin: if FILE
997 is "-", just use stdin. */
1000 fd = fileno (stdin);
1002 /* Note that we don't inhibit mmap() in this case. If stdin is
1003 redirected from a regular file, mmap() will still work. */
1006 fd = open (file, O_RDONLY);
1009 fm = xmalloc (sizeof (struct file_memory));
1014 if (fstat (fd, &buf) < 0)
1016 fm->length = buf.st_size;
1017 /* NOTE: As far as I know, the callers of this function never
1018 modify the file text. Relying on this would enable us to
1019 specify PROT_READ and MAP_SHARED for a marginal gain in
1020 efficiency, but at some cost to generality. */
1021 fm->content = mmap (NULL, fm->length, PROT_READ | PROT_WRITE,
1022 MAP_PRIVATE, fd, 0);
1023 if (fm->content == (char *)MAP_FAILED)
1033 /* The most common reason why mmap() fails is that FD does not point
1034 to a plain file. However, it's also possible that mmap() doesn't
1035 work for a particular type of file. Therefore, whenever mmap()
1036 fails, we just fall back to the regular method. */
1037 #endif /* HAVE_MMAP */
1040 size = 512; /* number of bytes fm->contents can
1041 hold at any given time. */
1042 fm->content = xmalloc (size);
1046 if (fm->length > size / 2)
1048 /* #### I'm not sure whether the whole exponential-growth
1049 thing makes sense with kernel read. On Linux at least,
1050 read() refuses to read more than 4K from a file at a
1051 single chunk anyway. But other Unixes might optimize it
1052 better, and it doesn't *hurt* anything, so I'm leaving
1055 /* Normally, we grow SIZE exponentially to make the number
1056 of calls to read() and realloc() logarithmic in relation
1057 to file size. However, read() can read an amount of data
1058 smaller than requested, and it would be unreasonably to
1059 double SIZE every time *something* was read. Therefore,
1060 we double SIZE only when the length exceeds half of the
1061 entire allocated size. */
1063 fm->content = xrealloc (fm->content, size);
1065 nread = read (fd, fm->content + fm->length, size - fm->length);
1067 /* Successful read. */
1068 fm->length += nread;
1078 if (size > fm->length && fm->length != 0)
1079 /* Due to exponential growth of fm->content, the allocated region
1080 might be much larger than what is actually needed. */
1081 fm->content = xrealloc (fm->content, fm->length);
1088 xfree (fm->content);
1093 /* Release the resources held by FM. Specifically, this calls
1094 munmap() or xfree() on fm->content, depending whether mmap or
1095 malloc/read were used to read in the file. It also frees the
1096 memory needed to hold the FM structure itself. */
1099 read_file_free (struct file_memory *fm)
1104 munmap (fm->content, fm->length);
1109 xfree (fm->content);
1114 /* Free the pointers in a NULL-terminated vector of pointers, then
1115 free the pointer itself. */
1117 free_vec (char **vec)
1128 /* Append vector V2 to vector V1. The function frees V2 and
1129 reallocates V1 (thus you may not use the contents of neither
1130 pointer after the call). If V1 is NULL, V2 is returned. */
1132 merge_vecs (char **v1, char **v2)
1142 /* To avoid j == 0 */
1147 for (i = 0; v1[i]; i++);
1149 for (j = 0; v2[j]; j++);
1150 /* Reallocate v1. */
1151 v1 = (char **)xrealloc (v1, (i + j + 1) * sizeof (char **));
1152 memcpy (v1 + i, v2, (j + 1) * sizeof (char *));
1157 /* A set of simple-minded routines to store strings in a linked list.
1158 This used to also be used for searching, but now we have hash
1161 /* It's a shame that these simple things like linked lists and hash
1162 tables (see hash.c) need to be implemented over and over again. It
1163 would be nice to be able to use the routines from glib -- see
1164 www.gtk.org for details. However, that would make Wget depend on
1165 glib, and I want to avoid dependencies to external libraries for
1166 reasons of convenience and portability (I suspect Wget is more
1167 portable than anything ever written for Gnome). */
1169 /* Append an element to the list. If the list has a huge number of
1170 elements, this can get slow because it has to find the list's
1171 ending. If you think you have to call slist_append in a loop,
1172 think about calling slist_prepend() followed by slist_nreverse(). */
1175 slist_append (slist *l, const char *s)
1177 slist *newel = (slist *)xmalloc (sizeof (slist));
1180 newel->string = xstrdup (s);
1185 /* Find the last element. */
1192 /* Prepend S to the list. Unlike slist_append(), this is O(1). */
1195 slist_prepend (slist *l, const char *s)
1197 slist *newel = (slist *)xmalloc (sizeof (slist));
1198 newel->string = xstrdup (s);
1203 /* Destructively reverse L. */
1206 slist_nreverse (slist *l)
1211 slist *next = l->next;
1219 /* Is there a specific entry in the list? */
1221 slist_contains (slist *l, const char *s)
1223 for (; l; l = l->next)
1224 if (!strcmp (l->string, s))
1229 /* Free the whole slist. */
1231 slist_free (slist *l)
1242 /* Sometimes it's useful to create "sets" of strings, i.e. special
1243 hash tables where you want to store strings as keys and merely
1244 query for their existence. Here is a set of utility routines that
1245 makes that transparent. */
1248 string_set_add (struct hash_table *ht, const char *s)
1250 /* First check whether the set element already exists. If it does,
1251 do nothing so that we don't have to free() the old element and
1252 then strdup() a new one. */
1253 if (hash_table_contains (ht, s))
1256 /* We use "1" as value. It provides us a useful and clear arbitrary
1257 value, and it consumes no memory -- the pointers to the same
1258 string "1" will be shared by all the key-value pairs in all `set'
1260 hash_table_put (ht, xstrdup (s), "1");
1263 /* Synonym for hash_table_contains... */
1266 string_set_contains (struct hash_table *ht, const char *s)
1268 return hash_table_contains (ht, s);
1272 string_set_free_mapper (void *key, void *value_ignored, void *arg_ignored)
1279 string_set_free (struct hash_table *ht)
1281 hash_table_map (ht, string_set_free_mapper, NULL);
1282 hash_table_destroy (ht);
1286 free_keys_and_values_mapper (void *key, void *value, void *arg_ignored)
1293 /* Another utility function: call free() on all keys and values of HT. */
1296 free_keys_and_values (struct hash_table *ht)
1298 hash_table_map (ht, free_keys_and_values_mapper, NULL);
1302 /* Engine for legible and legible_very_long; this function works on
1306 legible_1 (const char *repr)
1308 static char outbuf[128];
1313 /* Reset the pointers. */
1316 /* If the number is negative, shift the pointers. */
1322 /* How many digits before the first separator? */
1323 mod = strlen (inptr) % 3;
1325 for (i = 0; i < mod; i++)
1326 *outptr++ = inptr[i];
1327 /* Now insert the rest of them, putting separator before every
1329 for (i1 = i, i = 0; inptr[i1]; i++, i1++)
1331 if (i % 3 == 0 && i1 != 0)
1333 *outptr++ = inptr[i1];
1335 /* Zero-terminate the string. */
1340 /* Legible -- return a static pointer to the legibly printed long. */
1345 /* Print the number into the buffer. */
1346 number_to_string (inbuf, l);
1347 return legible_1 (inbuf);
1350 /* Write a string representation of NUMBER into the provided buffer.
1351 We cannot use sprintf() because we cannot be sure whether the
1352 platform supports printing of what we chose for VERY_LONG_TYPE.
1354 Example: Gcc supports `long long' under many platforms, but on many
1355 of those the native libc knows nothing of it and therefore cannot
1358 How long BUFFER needs to be depends on the platform and the content
1359 of NUMBER. For 64-bit VERY_LONG_TYPE (the most common case), 24
1360 bytes are sufficient. Using more might be a good idea.
1362 This function does not go through the hoops that long_to_string
1363 goes to because it doesn't aspire to be fast. (It's called perhaps
1364 once in a Wget run.) */
1367 very_long_to_string (char *buffer, VERY_LONG_TYPE number)
1372 /* Print the number backwards... */
1375 buffer[i++] = '0' + number % 10;
1380 /* ...and reverse the order of the digits. */
1381 for (j = 0; j < i / 2; j++)
1384 buffer[j] = buffer[i - 1 - j];
1385 buffer[i - 1 - j] = c;
1390 /* The same as legible(), but works on VERY_LONG_TYPE. See sysdep.h. */
1392 legible_very_long (VERY_LONG_TYPE l)
1395 /* Print the number into the buffer. */
1396 very_long_to_string (inbuf, l);
1397 return legible_1 (inbuf);
1400 /* Count the digits in a (long) integer. */
1402 numdigit (long number)
1410 while ((number /= 10) > 0)
1415 #define ONE_DIGIT(figure) *p++ = n / (figure) + '0'
1416 #define ONE_DIGIT_ADVANCE(figure) (ONE_DIGIT (figure), n %= (figure))
1418 #define DIGITS_1(figure) ONE_DIGIT (figure)
1419 #define DIGITS_2(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_1 ((figure) / 10)
1420 #define DIGITS_3(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_2 ((figure) / 10)
1421 #define DIGITS_4(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_3 ((figure) / 10)
1422 #define DIGITS_5(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_4 ((figure) / 10)
1423 #define DIGITS_6(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_5 ((figure) / 10)
1424 #define DIGITS_7(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_6 ((figure) / 10)
1425 #define DIGITS_8(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_7 ((figure) / 10)
1426 #define DIGITS_9(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_8 ((figure) / 10)
1427 #define DIGITS_10(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_9 ((figure) / 10)
1429 /* DIGITS_<11-20> are only used on machines with 64-bit longs. */
1431 #define DIGITS_11(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_10 ((figure) / 10)
1432 #define DIGITS_12(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_11 ((figure) / 10)
1433 #define DIGITS_13(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_12 ((figure) / 10)
1434 #define DIGITS_14(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_13 ((figure) / 10)
1435 #define DIGITS_15(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_14 ((figure) / 10)
1436 #define DIGITS_16(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_15 ((figure) / 10)
1437 #define DIGITS_17(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_16 ((figure) / 10)
1438 #define DIGITS_18(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_17 ((figure) / 10)
1439 #define DIGITS_19(figure) ONE_DIGIT_ADVANCE (figure); DIGITS_18 ((figure) / 10)
1441 /* Print NUMBER to BUFFER in base 10. This should be completely
1442 equivalent to `sprintf(buffer, "%ld", number)', only much faster.
1444 The speedup may make a difference in programs that frequently
1445 convert numbers to strings. Some implementations of sprintf,
1446 particularly the one in GNU libc, have been known to be extremely
1447 slow compared to this function.
1449 Return the pointer to the location where the terminating zero was
1450 printed. (Equivalent to calling buffer+strlen(buffer) after the
1453 BUFFER should be big enough to accept as many bytes as you expect
1454 the number to take up. On machines with 64-bit longs the maximum
1455 needed size is 24 bytes. That includes the digits needed for the
1456 largest 64-bit number, the `-' sign in case it's negative, and the
1457 terminating '\0'. */
1460 number_to_string (char *buffer, long number)
1465 #if (SIZEOF_LONG != 4) && (SIZEOF_LONG != 8)
1466 /* We are running in a strange or misconfigured environment. Let
1467 sprintf cope with it. */
1468 sprintf (buffer, "%ld", n);
1469 p += strlen (buffer);
1470 #else /* (SIZEOF_LONG == 4) || (SIZEOF_LONG == 8) */
1478 if (n < 10) { DIGITS_1 (1); }
1479 else if (n < 100) { DIGITS_2 (10); }
1480 else if (n < 1000) { DIGITS_3 (100); }
1481 else if (n < 10000) { DIGITS_4 (1000); }
1482 else if (n < 100000) { DIGITS_5 (10000); }
1483 else if (n < 1000000) { DIGITS_6 (100000); }
1484 else if (n < 10000000) { DIGITS_7 (1000000); }
1485 else if (n < 100000000) { DIGITS_8 (10000000); }
1486 else if (n < 1000000000) { DIGITS_9 (100000000); }
1487 #if SIZEOF_LONG == 4
1488 /* ``if (1)'' serves only to preserve editor indentation. */
1489 else if (1) { DIGITS_10 (1000000000); }
1490 #else /* SIZEOF_LONG != 4 */
1491 else if (n < 10000000000L) { DIGITS_10 (1000000000L); }
1492 else if (n < 100000000000L) { DIGITS_11 (10000000000L); }
1493 else if (n < 1000000000000L) { DIGITS_12 (100000000000L); }
1494 else if (n < 10000000000000L) { DIGITS_13 (1000000000000L); }
1495 else if (n < 100000000000000L) { DIGITS_14 (10000000000000L); }
1496 else if (n < 1000000000000000L) { DIGITS_15 (100000000000000L); }
1497 else if (n < 10000000000000000L) { DIGITS_16 (1000000000000000L); }
1498 else if (n < 100000000000000000L) { DIGITS_17 (10000000000000000L); }
1499 else if (n < 1000000000000000000L) { DIGITS_18 (100000000000000000L); }
1500 else { DIGITS_19 (1000000000000000000L); }
1501 #endif /* SIZEOF_LONG != 4 */
1504 #endif /* (SIZEOF_LONG == 4) || (SIZEOF_LONG == 8) */
1510 #undef ONE_DIGIT_ADVANCE
1532 /* Support for timers. */
1534 #undef TIMER_WINDOWS
1535 #undef TIMER_GETTIMEOFDAY
1538 /* Depending on the OS and availability of gettimeofday(), one and
1539 only one of the above constants will be defined. Virtually all
1540 modern Unix systems will define TIMER_GETTIMEOFDAY; Windows will
1541 use TIMER_WINDOWS. TIMER_TIME is a catch-all method for
1542 non-Windows systems without gettimeofday.
1544 #### Perhaps we should also support ftime(), which exists on old
1545 BSD 4.2-influenced systems? (It also existed under MS DOS Borland
1546 C, if memory serves me.) */
1549 # define TIMER_WINDOWS
1550 #else /* not WINDOWS */
1551 # ifdef HAVE_GETTIMEOFDAY
1552 # define TIMER_GETTIMEOFDAY
1556 #endif /* not WINDOWS */
1559 #ifdef TIMER_GETTIMEOFDAY
1568 #ifdef TIMER_WINDOWS
1569 ULARGE_INTEGER wintime;
1573 /* Allocate a timer. It is not legal to do anything with a freshly
1574 allocated timer, except call wtimer_reset() or wtimer_delete(). */
1577 wtimer_allocate (void)
1579 struct wget_timer *wt =
1580 (struct wget_timer *)xmalloc (sizeof (struct wget_timer));
1584 /* Allocate a new timer and reset it. Return the new timer. */
1589 struct wget_timer *wt = wtimer_allocate ();
1594 /* Free the resources associated with the timer. Its further use is
1598 wtimer_delete (struct wget_timer *wt)
1603 /* Reset timer WT. This establishes the starting point from which
1604 wtimer_elapsed() will return the number of elapsed
1605 milliseconds. It is allowed to reset a previously used timer. */
1608 wtimer_reset (struct wget_timer *wt)
1610 #ifdef TIMER_GETTIMEOFDAY
1612 gettimeofday (&t, NULL);
1613 wt->secs = t.tv_sec;
1614 wt->usecs = t.tv_usec;
1618 wt->secs = time (NULL);
1621 #ifdef TIMER_WINDOWS
1624 GetSystemTime (&st);
1625 SystemTimeToFileTime (&st, &ft);
1626 wt->wintime.HighPart = ft.dwHighDateTime;
1627 wt->wintime.LowPart = ft.dwLowDateTime;
1631 /* Return the number of milliseconds elapsed since the timer was last
1632 reset. It is allowed to call this function more than once to get
1633 increasingly higher elapsed values. */
1636 wtimer_elapsed (struct wget_timer *wt)
1638 #ifdef TIMER_GETTIMEOFDAY
1640 gettimeofday (&t, NULL);
1641 return (t.tv_sec - wt->secs) * 1000 + (t.tv_usec - wt->usecs) / 1000;
1645 time_t now = time (NULL);
1646 return 1000 * (now - wt->secs);
1653 GetSystemTime (&st);
1654 SystemTimeToFileTime (&st, &ft);
1655 uli.HighPart = ft.dwHighDateTime;
1656 uli.LowPart = ft.dwLowDateTime;
1657 return (long)((uli.QuadPart - wt->wintime.QuadPart) / 10000);
1661 /* Return the assessed granularity of the timer implementation. This
1662 is important for certain code that tries to deal with "zero" time
1666 wtimer_granularity (void)
1668 #ifdef TIMER_GETTIMEOFDAY
1669 /* Granularity of gettimeofday is hugely architecture-dependent.
1670 However, it appears that on modern machines it is better than
1676 /* This is clear. */
1680 #ifdef TIMER_WINDOWS
1686 /* This should probably be at a better place, but it doesn't really
1687 fit into html-parse.c. */
1689 /* The function returns the pointer to the malloc-ed quoted version of
1690 string s. It will recognize and quote numeric and special graphic
1691 entities, as per RFC1866:
1699 No other entities are recognized or replaced. */
1701 html_quote_string (const char *s)
1707 /* Pass through the string, and count the new size. */
1708 for (i = 0; *s; s++, i++)
1711 i += 4; /* `amp;' */
1712 else if (*s == '<' || *s == '>')
1713 i += 3; /* `lt;' and `gt;' */
1714 else if (*s == '\"')
1715 i += 5; /* `quot;' */
1719 res = (char *)xmalloc (i + 1);
1721 for (p = res; *s; s++)
1734 *p++ = (*s == '<' ? 'l' : 'g');
1761 /* Determine the width of the terminal we're running on. If that's
1762 not possible, return 0. */
1765 determine_screen_width (void)
1767 /* If there's a way to get the terminal size using POSIX
1768 tcgetattr(), somebody please tell me. */
1771 #else /* TIOCGWINSZ */
1775 if (opt.lfilename != NULL)
1778 fd = fileno (stderr);
1779 if (ioctl (fd, TIOCGWINSZ, &wsz) < 0)
1780 return 0; /* most likely ENOTTY */
1783 #endif /* TIOCGWINSZ */
1787 /* A debugging function for checking whether an MD5 library works. */
1789 #include "gen-md5.h"
1792 debug_test_md5 (char *buf)
1794 unsigned char raw[16];
1795 static char res[33];
1799 ALLOCA_MD5_CONTEXT (ctx);
1802 gen_md5_update ((unsigned char *)buf, strlen (buf), ctx);
1803 gen_md5_finish (ctx, raw);
1810 *p2++ = XDIGIT_TO_xchar (*p1 >> 4);
1811 *p2++ = XDIGIT_TO_xchar (*p1 & 0xf);
1821 /* Debugging and testing support for path_simplify. */
1823 /* Debug: run path_simplify on PATH and return the result in a new
1824 string. Useful for calling from the debugger. */
1828 char *copy = xstrdup (path);
1829 path_simplify (copy);
1834 run_test (char *test, char *expected_result, int expected_change)
1836 char *test_copy = xstrdup (test);
1837 int modified = path_simplify (test_copy);
1839 if (0 != strcmp (test_copy, expected_result))
1841 printf ("Failed path_simplify(\"%s\"): expected \"%s\", got \"%s\".\n",
1842 test, expected_result, test_copy);
1844 if (modified != expected_change)
1846 if (expected_change == 1)
1847 printf ("Expected no modification with path_simplify(\"%s\").\n",
1850 printf ("Expected modification with path_simplify(\"%s\").\n",
1857 test_path_simplify (void)
1860 char *test, *result;
1866 { "foo", "foo", 0 },
1867 { "foo/bar", "foo/bar", 0 },
1868 { "foo///bar", "foo/bar", 1 },
1869 { "foo/.", "foo/", 1 },
1870 { "foo/./", "foo/", 1 },
1871 { "foo./", "foo./", 0 },
1872 { "foo/../bar", "bar", 1 },
1873 { "foo/../bar/", "bar/", 1 },
1874 { "foo/bar/..", "foo/", 1 },
1875 { "foo/bar/../x", "foo/x", 1 },
1876 { "foo/bar/../x/", "foo/x/", 1 },
1877 { "foo/..", "", 1 },
1878 { "foo/../..", "", 1 },
1879 { "a/b/../../c", "c", 1 },
1880 { "./a/../b", "b", 1 }
1884 for (i = 0; i < ARRAY_SIZE (tests); i++)
1886 char *test = tests[i].test;
1887 char *expected_result = tests[i].result;
1888 int expected_change = tests[i].should_modify;
1889 run_test (test, expected_result, expected_change);
1892 /* Now run all the tests with a leading slash before the test case,
1893 to prove that the slash is being preserved. */
1894 for (i = 0; i < ARRAY_SIZE (tests); i++)
1896 char *test, *expected_result;
1897 int expected_change = tests[i].should_modify;
1899 test = xmalloc (1 + strlen (tests[i].test) + 1);
1900 sprintf (test, "/%s", tests[i].test);
1902 expected_result = xmalloc (1 + strlen (tests[i].result) + 1);
1903 sprintf (expected_result, "/%s", tests[i].result);
1905 run_test (test, expected_result, expected_change);
1908 xfree (expected_result);