2 * Utility routines used in rsync.
4 * Copyright (C) 1996-2000 Andrew Tridgell
5 * Copyright (C) 1996 Paul Mackerras
6 * Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org>
7 * Copyright (C) 2003-2009 Wayne Davison
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 3 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, visit the http://fsf.org website.
30 extern int modify_window;
31 extern int relative_paths;
32 extern int preserve_xattrs;
33 extern char *module_dir;
34 extern unsigned int module_dirlen;
35 extern char *partial_dir;
36 extern filter_rule_list daemon_filter_list;
38 int sanitize_paths = 0;
40 char curr_dir[MAXPATHLEN];
41 unsigned int curr_dir_len;
42 int curr_dir_depth; /* This is only set for a sanitizing daemon. */
44 /* Set a fd into nonblocking mode. */
45 void set_nonblocking(int fd)
49 if ((val = fcntl(fd, F_GETFL)) == -1)
51 if (!(val & NONBLOCK_FLAG)) {
53 fcntl(fd, F_SETFL, val);
57 /* Set a fd into blocking mode. */
58 void set_blocking(int fd)
62 if ((val = fcntl(fd, F_GETFL)) == -1)
64 if (val & NONBLOCK_FLAG) {
65 val &= ~NONBLOCK_FLAG;
66 fcntl(fd, F_SETFL, val);
71 * Create a file descriptor pair - like pipe() but use socketpair if
72 * possible (because of blocking issues on pipes).
74 * Always set non-blocking.
76 int fd_pair(int fd[2])
80 #ifdef HAVE_SOCKETPAIR
81 ret = socketpair(AF_UNIX, SOCK_STREAM, 0, fd);
87 set_nonblocking(fd[0]);
88 set_nonblocking(fd[1]);
94 void print_child_argv(const char *prefix, char **cmd)
96 rprintf(FCLIENT, "%s ", prefix);
98 /* Look for characters that ought to be quoted. This
99 * is not a great quoting algorithm, but it's
100 * sufficient for a log message. */
101 if (strspn(*cmd, "abcdefghijklmnopqrstuvwxyz"
102 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
104 ",.-_=+@/") != strlen(*cmd)) {
105 rprintf(FCLIENT, "\"%s\" ", *cmd);
107 rprintf(FCLIENT, "%s ", *cmd);
110 rprintf(FCLIENT, "\n");
113 NORETURN void out_of_memory(const char *str)
115 rprintf(FERROR, "ERROR: out of memory in %s [%s]\n", str, who_am_i());
116 exit_cleanup(RERR_MALLOC);
119 NORETURN void overflow_exit(const char *str)
121 rprintf(FERROR, "ERROR: buffer overflow in %s [%s]\n", str, who_am_i());
122 exit_cleanup(RERR_MALLOC);
125 int set_modtime(const char *fname, time_t modtime, uint32 mod_nsec, mode_t mode)
127 #ifndef CAN_SET_SYMLINK_TIMES
132 if (DEBUG_GTE(TIME, 1)) {
133 rprintf(FINFO, "set modtime of %s to (%ld) %s",
134 fname, (long)modtime,
135 asctime(localtime(&modtime)));
142 #ifdef HAVE_UTIMENSAT
143 struct timespec t[2];
145 t[0].tv_nsec = UTIME_NOW;
146 t[1].tv_sec = modtime;
147 t[1].tv_nsec = mod_nsec;
148 if (utimensat(AT_FDCWD, fname, t, AT_SYMLINK_NOFOLLOW) < 0)
149 return S_ISLNK(mode) && errno == ENOSYS ? 1 : -1;
151 #elif defined HAVE_UTIMES || defined HAVE_LUTIMES
153 t[0].tv_sec = time(NULL);
155 t[1].tv_sec = modtime;
156 t[1].tv_usec = mod_nsec / 1000;
158 if (lutimes(fname, t) < 0)
159 return S_ISLNK(mode) && errno == ENOSYS ? 1 : -1;
162 return utimes(fname, t);
164 #elif defined HAVE_STRUCT_UTIMBUF
166 tbuf.actime = time(NULL);
167 tbuf.modtime = modtime;
168 return utime(fname,&tbuf);
169 #elif defined HAVE_UTIME
173 return utime(fname,t);
175 #error No file-time-modification routine found!
180 /* Create any necessary directories in fname. Any missing directories are
181 * created with default permissions. Returns < 0 on error, or the number
182 * of directories created. */
183 int make_path(char *fname, int flags)
188 if (flags & MKP_SKIP_SLASH) {
189 while (*fname == '/')
193 while (*fname == '.' && fname[1] == '/')
196 if (flags & MKP_DROP_NAME) {
197 end = strrchr(fname, '/');
202 end = fname + strlen(fname);
204 /* Try to find an existing dir, starting from the deepest dir. */
206 if (do_mkdir(fname, ACCESSPERMS) == 0) {
210 if (errno != ENOENT) {
222 ret = -ret - 1; /* impossible... */
232 /* Make all the dirs that we didn't find on the way here. */
236 if (ret < 0) /* Skip mkdir on error, but keep restoring the path. */
238 if (do_mkdir(fname, ACCESSPERMS) < 0)
244 if (flags & MKP_DROP_NAME)
251 * Write @p len bytes at @p ptr to descriptor @p desc, retrying if
254 * @retval len upon success
256 * @retval <0 write's (negative) error code
258 * Derived from GNU C's cccp.c.
260 int full_write(int desc, const char *ptr, size_t len)
266 int written = write(desc, ptr, len);
272 total_written += written;
276 return total_written;
280 * Read @p len bytes at @p ptr from descriptor @p desc, retrying if
283 * @retval >0 the actual number of bytes read
287 * @retval <0 for an error.
289 * Derived from GNU C's cccp.c. */
290 static int safe_read(int desc, char *ptr, size_t len)
298 n_chars = read(desc, ptr, len);
299 } while (n_chars < 0 && errno == EINTR);
304 /* Copy a file. If ofd < 0, copy_file unlinks and opens the "dest" file.
305 * Otherwise, it just writes to and closes the provided file descriptor.
306 * In either case, if --xattrs are being preserved, the dest file will
307 * have its xattrs set from the source file.
309 * This is used in conjunction with the --temp-dir, --backup, and
310 * --copy-dest options. */
311 int copy_file(const char *source, const char *dest, int ofd, mode_t mode)
315 int len; /* Number of bytes read into `buf'. */
317 if ((ifd = do_open(source, O_RDONLY, 0)) < 0) {
318 int save_errno = errno;
319 rsyserr(FERROR_XFER, errno, "open %s", full_fname(source));
325 if (robust_unlink(dest) && errno != ENOENT) {
326 int save_errno = errno;
327 rsyserr(FERROR_XFER, errno, "unlink %s", full_fname(dest));
332 #ifdef SUPPORT_XATTRS
336 mode &= INITACCESSPERMS;
337 if ((ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode)) < 0) {
338 int save_errno = errno;
339 rsyserr(FERROR_XFER, save_errno, "open %s", full_fname(dest));
346 while ((len = safe_read(ifd, buf, sizeof buf)) > 0) {
347 if (full_write(ofd, buf, len) < 0) {
348 int save_errno = errno;
349 rsyserr(FERROR_XFER, errno, "write %s", full_fname(dest));
358 int save_errno = errno;
359 rsyserr(FERROR_XFER, errno, "read %s", full_fname(source));
366 if (close(ifd) < 0) {
367 rsyserr(FWARNING, errno, "close failed on %s",
371 if (close(ofd) < 0) {
372 int save_errno = errno;
373 rsyserr(FERROR_XFER, errno, "close failed on %s",
379 #ifdef SUPPORT_XATTRS
381 copy_xattrs(source, dest);
387 /* MAX_RENAMES should be 10**MAX_RENAMES_DIGITS */
388 #define MAX_RENAMES_DIGITS 3
389 #define MAX_RENAMES 1000
392 * Robust unlink: some OS'es (HPUX) refuse to unlink busy files, so
393 * rename to <path>/.rsyncNNN instead.
395 * Note that successive rsync runs will shuffle the filenames around a
396 * bit as long as the file is still busy; this is because this function
397 * does not know if the unlink call is due to a new file coming in, or
398 * --delete trying to remove old .rsyncNNN files, hence it renames it
401 int robust_unlink(const char *fname)
404 return do_unlink(fname);
406 static int counter = 1;
408 char path[MAXPATHLEN];
410 rc = do_unlink(fname);
411 if (rc == 0 || errno != ETXTBSY)
414 if ((pos = strlcpy(path, fname, MAXPATHLEN)) >= MAXPATHLEN)
415 pos = MAXPATHLEN - 1;
417 while (pos > 0 && path[pos-1] != '/')
419 pos += strlcpy(path+pos, ".rsync", MAXPATHLEN-pos);
421 if (pos > (MAXPATHLEN-MAX_RENAMES_DIGITS-1)) {
426 /* start where the last one left off to reduce chance of clashes */
429 snprintf(&path[pos], MAX_RENAMES_DIGITS+1, "%03d", counter);
430 if (++counter >= MAX_RENAMES)
432 } while ((rc = access(path, 0)) == 0 && counter != start);
434 if (INFO_GTE(MISC, 1)) {
435 rprintf(FWARNING, "renaming %s to %s because of text busy\n",
439 /* maybe we should return rename()'s exit status? Nah. */
440 if (do_rename(fname, path) != 0) {
448 /* Returns 0 on successful rename, 1 if we successfully copied the file
449 * across filesystems, -2 if copy_file() failed, and -1 on other errors.
450 * If partialptr is not NULL and we need to do a copy, copy the file into
451 * the active partial-dir instead of over the destination file. */
452 int robust_rename(const char *from, const char *to, const char *partialptr,
458 if (do_rename(from, to) == 0)
464 if (robust_unlink(to) != 0) {
473 if (!handle_partial_dir(partialptr,PDIR_CREATE))
477 if (copy_file(from, to, -1, mode) != 0)
488 static pid_t all_pids[10];
491 /** Fork and record the pid of the child. **/
494 pid_t newpid = fork();
496 if (newpid != 0 && newpid != -1) {
497 all_pids[num_pids++] = newpid;
505 * @todo It would be kind of nice to make sure that they are actually
506 * all our children before we kill them, because their pids may have
507 * been recycled by some other process. Perhaps when we wait for a
508 * child, we should remove it from this array. Alternatively we could
509 * perhaps use process groups, but I think that would not work on
510 * ancient Unix versions that don't support them.
512 void kill_all(int sig)
516 for (i = 0; i < num_pids; i++) {
517 /* Let's just be a little careful where we
518 * point that gun, hey? See kill(2) for the
519 * magic caused by negative values. */
520 pid_t p = all_pids[i];
531 /** Lock a byte range in a open file */
532 int lock_range(int fd, int offset, int len)
536 lock.l_type = F_WRLCK;
537 lock.l_whence = SEEK_SET;
538 lock.l_start = offset;
542 return fcntl(fd,F_SETLK,&lock) == 0;
545 #define ENSURE_MEMSPACE(buf, type, sz, req) \
546 if ((req) > sz && !(buf = realloc_array(buf, type, sz = MAX(sz * 2, req)))) \
547 out_of_memory("glob_expand")
549 static inline void call_glob_match(const char *name, int len, int from_glob,
550 char *arg, int abpos, int fbpos);
552 static struct glob_data {
553 char *arg_buf, *filt_buf, **argv;
554 int absize, fbsize, maxargs, argc;
557 static void glob_match(char *arg, int abpos, int fbpos)
562 while (*arg == '.' && arg[1] == '/') {
564 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, glob.absize);
565 memcpy(glob.filt_buf, glob.arg_buf, abpos + 1);
568 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + 3);
569 glob.arg_buf[abpos++] = *arg++;
570 glob.arg_buf[abpos++] = *arg++;
571 glob.arg_buf[abpos] = '\0';
573 if ((slash = strchr(arg, '/')) != NULL) {
578 if (strpbrk(arg, "*?[")) {
582 if (!(d = opendir(abpos ? glob.arg_buf : ".")))
584 while ((di = readdir(d)) != NULL) {
585 char *dname = d_name(di);
586 if (dname[0] == '.' && (dname[1] == '\0'
587 || (dname[1] == '.' && dname[2] == '\0')))
589 if (!wildmatch(arg, dname))
591 call_glob_match(dname, strlen(dname), 1,
592 slash ? arg + len + 1 : NULL,
597 call_glob_match(arg, len, 0,
598 slash ? arg + len + 1 : NULL,
605 static inline void call_glob_match(const char *name, int len, int from_glob,
606 char *arg, int abpos, int fbpos)
610 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + len + 2);
611 memcpy(glob.arg_buf + abpos, name, len);
613 glob.arg_buf[abpos] = '\0';
616 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, fbpos + len + 2);
617 memcpy(glob.filt_buf + fbpos, name, len);
619 glob.filt_buf[fbpos] = '\0';
620 use_buf = glob.filt_buf;
622 use_buf = glob.arg_buf;
624 if (from_glob || (arg && len)) {
628 if (do_stat(glob.arg_buf, &st) != 0)
630 is_dir = S_ISDIR(st.st_mode) != 0;
634 if (daemon_filter_list.head
635 && check_filter(&daemon_filter_list, FLOG, use_buf, is_dir) < 0)
640 glob.arg_buf[abpos++] = '/';
641 glob.arg_buf[abpos] = '\0';
643 glob.filt_buf[fbpos++] = '/';
644 glob.filt_buf[fbpos] = '\0';
646 glob_match(arg, abpos, fbpos);
648 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
649 if (!(glob.argv[glob.argc++] = strdup(glob.arg_buf)))
650 out_of_memory("glob_match");
654 /* This routine performs wild-card expansion of the pathname in "arg". Any
655 * daemon-excluded files/dirs will not be matched by the wildcards. Returns 0
656 * if a wild-card string is the only returned item (due to matching nothing). */
657 int glob_expand(const char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
666 memset(&glob, 0, sizeof glob);
671 s = sanitize_path(NULL, arg, "", 0, SP_KEEP_DOT_DIRS);
675 out_of_memory("glob_expand");
676 clean_fname(s, CFN_KEEP_DOT_DIRS
677 | CFN_KEEP_TRAILING_SLASH
678 | CFN_COLLAPSE_DOT_DOT_DIRS);
681 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, MAXPATHLEN);
682 *glob.arg_buf = '\0';
684 glob.argc = save_argc = *argc_p;
686 glob.maxargs = *maxargs_p;
688 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, 100);
690 glob_match(s, 0, -1);
692 /* The arg didn't match anything, so add the failed arg to the list. */
693 if (glob.argc == save_argc) {
694 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
695 glob.argv[glob.argc++] = s;
702 *maxargs_p = glob.maxargs;
709 /* This routine is only used in daemon mode. */
710 void glob_expand_module(char *base1, char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
714 int base_len = strlen(base);
719 if (strncmp(arg, base, base_len) == 0)
722 if (!(arg = strdup(arg)))
723 out_of_memory("glob_expand_module");
725 if (asprintf(&base," %s/", base1) <= 0)
726 out_of_memory("glob_expand_module");
729 for (s = arg; *s; s = p + base_len) {
730 if ((p = strstr(s, base)) != NULL)
731 *p = '\0'; /* split it at this point */
732 glob_expand(s, argv_p, argc_p, maxargs_p);
742 * Convert a string to lower case
744 void strlower(char *s)
753 /* Join strings p1 & p2 into "dest" with a guaranteed '/' between them. (If
754 * p1 ends with a '/', no extra '/' is inserted.) Returns the length of both
755 * strings + 1 (if '/' was inserted), regardless of whether the null-terminated
756 * string fits into destsize. */
757 size_t pathjoin(char *dest, size_t destsize, const char *p1, const char *p2)
759 size_t len = strlcpy(dest, p1, destsize);
760 if (len < destsize - 1) {
761 if (!len || dest[len-1] != '/')
763 if (len < destsize - 1)
764 len += strlcpy(dest + len, p2, destsize - len);
771 len += strlen(p2) + 1; /* Assume we'd insert a '/'. */
775 /* Join any number of strings together, putting them in "dest". The return
776 * value is the length of all the strings, regardless of whether the null-
777 * terminated whole fits in destsize. Your list of string pointers must end
778 * with a NULL to indicate the end of the list. */
779 size_t stringjoin(char *dest, size_t destsize, ...)
785 va_start(ap, destsize);
787 if (!(src = va_arg(ap, const char *)))
794 memcpy(dest, src, len);
805 int count_dir_elements(const char *p)
807 int cnt = 0, new_component = 1;
810 new_component = (*p != '.' || (p[1] != '/' && p[1] != '\0'));
811 else if (new_component) {
819 /* Turns multiple adjacent slashes into a single slash (possible exception:
820 * the preserving of two leading slashes at the start), drops all leading or
821 * interior "." elements unless CFN_KEEP_DOT_DIRS is flagged. Will also drop
822 * a trailing '.' after a '/' if CFN_DROP_TRAILING_DOT_DIR is flagged, removes
823 * a trailing slash (perhaps after removing the aforementioned dot) unless
824 * CFN_KEEP_TRAILING_SLASH is flagged, and will also collapse ".." elements
825 * (except at the start) if CFN_COLLAPSE_DOT_DOT_DIRS is flagged. If the
826 * resulting name would be empty, returns ".". */
827 unsigned int clean_fname(char *name, int flags)
829 char *limit = name - 1, *t = name, *f = name;
835 if ((anchored = *f == '/') != 0) {
838 /* If there are exactly 2 slashes at the start, preserve
839 * them. Would break daemon excludes unless the paths are
840 * really treated differently, so used this sparingly. */
841 if (*f == '/' && f[1] != '/')
844 } else if (flags & CFN_KEEP_DOT_DIRS && *f == '.' && f[1] == '/') {
849 /* discard extra slashes */
855 /* discard interior "." dirs */
856 if (f[1] == '/' && !(flags & CFN_KEEP_DOT_DIRS)) {
860 if (f[1] == '\0' && flags & CFN_DROP_TRAILING_DOT_DIR)
862 /* collapse ".." dirs */
863 if (flags & CFN_COLLAPSE_DOT_DOT_DIRS
864 && f[1] == '.' && (f[2] == '/' || !f[2])) {
866 if (s == name && anchored) {
870 while (s > limit && *--s != '/') {}
871 if (s != t - 1 && (s < name || *s == '/')) {
879 while (*f && (*t++ = *f++) != '/') {}
882 if (t > name+anchored && t[-1] == '/' && !(flags & CFN_KEEP_TRAILING_SLASH))
891 /* Make path appear as if a chroot had occurred. This handles a leading
892 * "/" (either removing it or expanding it) and any leading or embedded
893 * ".." components that attempt to escape past the module's top dir.
895 * If dest is NULL, a buffer is allocated to hold the result. It is legal
896 * to call with the dest and the path (p) pointing to the same buffer, but
897 * rootdir will be ignored to avoid expansion of the string.
899 * The rootdir string contains a value to use in place of a leading slash.
900 * Specify NULL to get the default of "module_dir".
902 * The depth var is a count of how many '..'s to allow at the start of the
905 * We also clean the path in a manner similar to clean_fname() but with a
908 * Turns multiple adjacent slashes into a single slash, gets rid of "." dir
909 * elements (INCLUDING a trailing dot dir), PRESERVES a trailing slash, and
910 * ALWAYS collapses ".." elements (except for those at the start of the
911 * string up to "depth" deep). If the resulting name would be empty,
912 * change it into a ".". */
913 char *sanitize_path(char *dest, const char *p, const char *rootdir, int depth,
917 int rlen = 0, drop_dot_dirs = !relative_paths || !(flags & SP_KEEP_DOT_DIRS);
920 int plen = strlen(p);
923 rootdir = module_dir;
924 rlen = strlen(rootdir);
929 if (rlen + plen + 1 >= MAXPATHLEN)
931 } else if (!(dest = new_array(char, rlen + plen + 1)))
932 out_of_memory("sanitize_path");
934 memcpy(dest, rootdir, rlen);
941 while (*p == '.' && p[1] == '/')
945 start = sanp = dest + rlen;
946 /* This loop iterates once per filename component in p, pointing at
947 * the start of the name (past any prior slash) for each iteration. */
949 /* discard leading or extra slashes */
955 if (*p == '.' && (p[1] == '/' || p[1] == '\0')) {
956 /* skip "." component */
961 if (*p == '.' && p[1] == '.' && (p[2] == '/' || p[2] == '\0')) {
962 /* ".." component followed by slash or end */
963 if (depth <= 0 || sanp != start) {
966 /* back up sanp one level */
967 --sanp; /* now pointing at slash */
968 while (sanp > start && sanp[-1] != '/')
973 /* allow depth levels of .. at the beginning */
975 /* move the virtual beginning to leave the .. alone */
978 /* copy one component through next slash */
979 while (*p && (*sanp++ = *p++) != '/') {}
982 /* ended up with nothing, so put in "." component */
990 /* Like chdir(), but it keeps track of the current directory (in the
991 * global "curr_dir"), and ensures that the path size doesn't overflow.
992 * Also cleans the path using the clean_fname() function. */
993 int change_dir(const char *dir, int set_path_only)
995 static int initialised;
1000 if (getcwd(curr_dir, sizeof curr_dir - 1) == NULL) {
1001 rsyserr(FERROR, errno, "getcwd()");
1002 exit_cleanup(RERR_FILESELECT);
1004 curr_dir_len = strlen(curr_dir);
1007 if (!dir) /* this call was probably just to initialize */
1011 if (len == 1 && *dir == '.')
1015 if (len >= sizeof curr_dir) {
1016 errno = ENAMETOOLONG;
1019 if (!set_path_only && chdir(dir))
1021 memcpy(curr_dir, dir, len + 1);
1023 if (curr_dir_len + 1 + len >= sizeof curr_dir) {
1024 errno = ENAMETOOLONG;
1027 curr_dir[curr_dir_len] = '/';
1028 memcpy(curr_dir + curr_dir_len + 1, dir, len + 1);
1030 if (!set_path_only && chdir(curr_dir)) {
1031 curr_dir[curr_dir_len] = '\0';
1036 curr_dir_len = clean_fname(curr_dir, CFN_COLLAPSE_DOT_DOT_DIRS);
1037 if (sanitize_paths) {
1038 if (module_dirlen > curr_dir_len)
1039 module_dirlen = curr_dir_len;
1040 curr_dir_depth = count_dir_elements(curr_dir + module_dirlen);
1043 if (DEBUG_GTE(CHDIR, 1) && !set_path_only)
1044 rprintf(FINFO, "[%s] change_dir(%s)\n", who_am_i(), curr_dir);
1049 /* This will make a relative path absolute and clean it up via clean_fname().
1050 * Returns the string, which might be newly allocated, or NULL on error. */
1051 char *normalize_path(char *path, BOOL force_newbuf, unsigned int *len_ptr)
1055 if (*path != '/') { /* Make path absolute. */
1056 int len = strlen(path);
1057 if (curr_dir_len + 1 + len >= sizeof curr_dir)
1059 curr_dir[curr_dir_len] = '/';
1060 memcpy(curr_dir + curr_dir_len + 1, path, len + 1);
1061 if (!(path = strdup(curr_dir)))
1062 out_of_memory("normalize_path");
1063 curr_dir[curr_dir_len] = '\0';
1064 } else if (force_newbuf) {
1065 if (!(path = strdup(path)))
1066 out_of_memory("normalize_path");
1069 len = clean_fname(path, CFN_COLLAPSE_DOT_DOT_DIRS | CFN_DROP_TRAILING_DOT_DIR);
1078 * Return a quoted string with the full pathname of the indicated filename.
1079 * The string " (in MODNAME)" may also be appended. The returned pointer
1080 * remains valid until the next time full_fname() is called.
1082 char *full_fname(const char *fn)
1084 static char *result = NULL;
1094 p1 = curr_dir + module_dirlen;
1095 for (p2 = p1; *p2 == '/'; p2++) {}
1099 if (module_id >= 0) {
1101 m2 = lp_name(module_id);
1106 if (asprintf(&result, "\"%s%s%s\"%s%s%s", p1, p2, fn, m1, m2, m3) <= 0)
1107 out_of_memory("full_fname");
1112 static char partial_fname[MAXPATHLEN];
1114 char *partial_dir_fname(const char *fname)
1116 char *t = partial_fname;
1117 int sz = sizeof partial_fname;
1120 if ((fn = strrchr(fname, '/')) != NULL) {
1122 if (*partial_dir != '/') {
1123 int len = fn - fname;
1124 strncpy(t, fname, len); /* safe */
1130 if ((int)pathjoin(t, sz, partial_dir, fn) >= sz)
1132 if (daemon_filter_list.head) {
1133 t = strrchr(partial_fname, '/');
1135 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 1) < 0)
1138 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 0) < 0)
1142 return partial_fname;
1145 /* If no --partial-dir option was specified, we don't need to do anything
1146 * (the partial-dir is essentially '.'), so just return success. */
1147 int handle_partial_dir(const char *fname, int create)
1151 if (fname != partial_fname)
1153 if (!create && *partial_dir == '/')
1155 if (!(fn = strrchr(partial_fname, '/')))
1159 dir = partial_fname;
1162 int statret = do_lstat(dir, &st);
1163 if (statret == 0 && !S_ISDIR(st.st_mode)) {
1164 if (do_unlink(dir) < 0) {
1170 if (statret < 0 && do_mkdir(dir, 0700) < 0) {
1181 /* Determine if a symlink points outside the current directory tree.
1182 * This is considered "unsafe" because e.g. when mirroring somebody
1183 * else's machine it might allow them to establish a symlink to
1184 * /etc/passwd, and then read it through a web server.
1186 * Returns 1 if unsafe, 0 if safe.
1188 * Null symlinks and absolute symlinks are always unsafe.
1190 * Basically here we are concerned with symlinks whose target contains
1191 * "..", because this might cause us to walk back up out of the
1192 * transferred directory. We are not allowed to go back up and
1195 * "dest" is the target of the symlink in question.
1197 * "src" is the top source directory currently applicable at the level
1198 * of the referenced symlink. This is usually the symlink's full path
1199 * (including its name), as referenced from the root of the transfer. */
1200 int unsafe_symlink(const char *dest, const char *src)
1202 const char *name, *slash;
1205 /* all absolute and null symlinks are unsafe */
1206 if (!dest || !*dest || *dest == '/')
1209 /* find out what our safety margin is */
1210 for (name = src; (slash = strchr(name, '/')) != 0; name = slash+1) {
1211 /* ".." segment starts the count over. "." segment is ignored. */
1212 if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) {
1217 while (slash[1] == '/') slash++; /* just in case src isn't clean */
1219 if (*name == '.' && name[1] == '.' && name[2] == '\0')
1222 for (name = dest; (slash = strchr(name, '/')) != 0; name = slash+1) {
1223 if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) {
1224 if (name[1] == '.') {
1225 /* if at any point we go outside the current directory
1226 then stop - it is unsafe */
1232 while (slash[1] == '/') slash++;
1234 if (*name == '.' && name[1] == '.' && name[2] == '\0')
1240 /* Return the date and time as a string. Some callers tweak returned buf. */
1241 char *timestring(time_t t)
1243 static char TimeBuf[200];
1244 struct tm *tm = localtime(&t);
1247 #ifdef HAVE_STRFTIME
1248 strftime(TimeBuf, sizeof TimeBuf - 1, "%Y/%m/%d %H:%M:%S", tm);
1250 strlcpy(TimeBuf, asctime(tm), sizeof TimeBuf);
1253 if ((p = strchr(TimeBuf, '\n')) != NULL)
1260 * Sleep for a specified number of milliseconds.
1262 * Always returns TRUE. (In the future it might return FALSE if
1268 struct timeval tval, t1, t2;
1270 gettimeofday(&t1, NULL);
1273 tval.tv_sec = (t-tdiff)/1000;
1274 tval.tv_usec = 1000*((t-tdiff)%1000);
1277 select(0,NULL,NULL, NULL, &tval);
1279 gettimeofday(&t2, NULL);
1280 tdiff = (t2.tv_sec - t1.tv_sec)*1000 +
1281 (t2.tv_usec - t1.tv_usec)/1000;
1287 /* Determine if two time_t values are equivalent (either exact, or in
1288 * the modification timestamp window established by --modify-window).
1290 * @retval 0 if the times should be treated as the same
1292 * @retval +1 if the first is later
1294 * @retval -1 if the 2nd is later
1296 int cmp_time(time_t file1, time_t file2)
1298 if (file2 > file1) {
1299 if (file2 - file1 <= modify_window)
1303 if (file1 - file2 <= modify_window)
1313 This routine is a trick to immediately catch errors when debugging
1314 with insure. A xterm with a gdb is popped up when insure catches
1315 a error. It is Linux specific.
1317 int _Insure_trap_error(int a1, int a2, int a3, int a4, int a5, int a6)
1323 asprintf(&cmd, "/usr/X11R6/bin/xterm -display :0 -T Panic -n Panic -e /bin/sh -c 'cat /tmp/ierrs.*.%d ; gdb /proc/%d/exe %d'",
1324 getpid(), getpid(), getpid());
1328 h = dlopen("/usr/local/parasoft/insure++lite/lib.linux2/libinsure.so", RTLD_LAZY);
1329 fn = dlsym(h, "_Insure_trap_error");
1332 ret = fn(a1, a2, a3, a4, a5, a6);
1342 #define MALLOC_MAX 0x40000000
1344 void *_new_array(unsigned long num, unsigned int size, int use_calloc)
1346 if (num >= MALLOC_MAX/size)
1348 return use_calloc ? calloc(num, size) : malloc(num * size);
1351 void *_realloc_array(void *ptr, unsigned int size, size_t num)
1353 if (num >= MALLOC_MAX/size)
1356 return malloc(size * num);
1357 return realloc(ptr, size * num);
1360 /* Take a filename and filename length and return the most significant
1361 * filename suffix we can find. This ignores suffixes such as "~",
1362 * ".bak", ".orig", ".~1~", etc. */
1363 const char *find_filename_suffix(const char *fn, int fn_len, int *len_ptr)
1365 const char *suf, *s;
1369 /* One or more dots at the start aren't a suffix. */
1370 while (fn_len && *fn == '.') fn++, fn_len--;
1372 /* Ignore the ~ in a "foo~" filename. */
1373 if (fn_len > 1 && fn[fn_len-1] == '~')
1374 fn_len--, had_tilde = True;
1378 /* Assume we don't find an suffix. */
1382 /* Find the last significant suffix. */
1383 for (s = fn + fn_len; fn_len > 1; ) {
1384 while (*--s != '.' && s != fn) {}
1387 s_len = fn_len - (s - fn);
1390 if (strcmp(s+1, "bak") == 0
1391 || strcmp(s+1, "old") == 0)
1393 } else if (s_len == 5) {
1394 if (strcmp(s+1, "orig") == 0)
1396 } else if (s_len > 2 && had_tilde
1397 && s[1] == '~' && isDigit(s + 2))
1403 /* Determine if the suffix is all digits. */
1404 for (s++, s_len--; s_len > 0; s++, s_len--) {
1408 /* An all-digit suffix may not be that signficant. */
1415 /* This is an implementation of the Levenshtein distance algorithm. It
1416 * was implemented to avoid needing a two-dimensional matrix (to save
1417 * memory). It was also tweaked to try to factor in the ASCII distance
1418 * between changed characters as a minor distance quantity. The normal
1419 * Levenshtein units of distance (each signifying a single change between
1420 * the two strings) are defined as a "UNIT". */
1422 #define UNIT (1 << 16)
1424 uint32 fuzzy_distance(const char *s1, unsigned len1, const char *s2, unsigned len2)
1426 uint32 a[MAXPATHLEN], diag, above, left, diag_inc, above_inc, left_inc;
1430 if (!len1 || !len2) {
1435 for (i1 = 0, cost = 0; i1 < len1; i1++)
1437 return (int32)len1 * UNIT + cost;
1440 for (i2 = 0; i2 < len2; i2++)
1441 a[i2] = (i2+1) * UNIT;
1443 for (i1 = 0; i1 < len1; i1++) {
1445 above = (i1+1) * UNIT;
1446 for (i2 = 0; i2 < len2; i2++) {
1448 if ((cost = *((uchar*)s1+i1) - *((uchar*)s2+i2)) != 0) {
1454 diag_inc = diag + cost;
1455 left_inc = left + UNIT + *((uchar*)s1+i1);
1456 above_inc = above + UNIT + *((uchar*)s2+i2);
1457 a[i2] = above = left < above
1458 ? (left_inc < diag_inc ? left_inc : diag_inc)
1459 : (above_inc < diag_inc ? above_inc : diag_inc);
1467 #define BB_SLOT_SIZE (16*1024) /* Desired size in bytes */
1468 #define BB_PER_SLOT_BITS (BB_SLOT_SIZE * 8) /* Number of bits per slot */
1469 #define BB_PER_SLOT_INTS (BB_SLOT_SIZE / 4) /* Number of int32s per slot */
1476 struct bitbag *bitbag_create(int max_ndx)
1478 struct bitbag *bb = new(struct bitbag);
1479 bb->slot_cnt = (max_ndx + BB_PER_SLOT_BITS - 1) / BB_PER_SLOT_BITS;
1481 if (!(bb->bits = (uint32**)calloc(bb->slot_cnt, sizeof (uint32*))))
1482 out_of_memory("bitbag_create");
1487 void bitbag_set_bit(struct bitbag *bb, int ndx)
1489 int slot = ndx / BB_PER_SLOT_BITS;
1490 ndx %= BB_PER_SLOT_BITS;
1492 if (!bb->bits[slot]) {
1493 if (!(bb->bits[slot] = (uint32*)calloc(BB_PER_SLOT_INTS, 4)))
1494 out_of_memory("bitbag_set_bit");
1497 bb->bits[slot][ndx/32] |= 1u << (ndx % 32);
1500 #if 0 /* not needed yet */
1501 void bitbag_clear_bit(struct bitbag *bb, int ndx)
1503 int slot = ndx / BB_PER_SLOT_BITS;
1504 ndx %= BB_PER_SLOT_BITS;
1506 if (!bb->bits[slot])
1509 bb->bits[slot][ndx/32] &= ~(1u << (ndx % 32));
1512 int bitbag_check_bit(struct bitbag *bb, int ndx)
1514 int slot = ndx / BB_PER_SLOT_BITS;
1515 ndx %= BB_PER_SLOT_BITS;
1517 if (!bb->bits[slot])
1520 return bb->bits[slot][ndx/32] & (1u << (ndx % 32)) ? 1 : 0;
1524 /* Call this with -1 to start checking from 0. Returns -1 at the end. */
1525 int bitbag_next_bit(struct bitbag *bb, int after)
1528 int i, ndx = after + 1;
1529 int slot = ndx / BB_PER_SLOT_BITS;
1530 ndx %= BB_PER_SLOT_BITS;
1532 mask = (1u << (ndx % 32)) - 1;
1533 for (i = ndx / 32; slot < bb->slot_cnt; slot++, i = mask = 0) {
1534 if (!bb->bits[slot])
1536 for ( ; i < BB_PER_SLOT_INTS; i++, mask = 0) {
1537 if (!(bits = bb->bits[slot][i] & ~mask))
1539 /* The xor magic figures out the lowest enabled bit in
1540 * bits, and the switch quickly computes log2(bit). */
1541 switch (bits ^ (bits & (bits-1))) {
1542 #define LOG2(n) case 1u << n: return slot*BB_PER_SLOT_BITS + i*32 + n
1543 LOG2(0); LOG2(1); LOG2(2); LOG2(3);
1544 LOG2(4); LOG2(5); LOG2(6); LOG2(7);
1545 LOG2(8); LOG2(9); LOG2(10); LOG2(11);
1546 LOG2(12); LOG2(13); LOG2(14); LOG2(15);
1547 LOG2(16); LOG2(17); LOG2(18); LOG2(19);
1548 LOG2(20); LOG2(21); LOG2(22); LOG2(23);
1549 LOG2(24); LOG2(25); LOG2(26); LOG2(27);
1550 LOG2(28); LOG2(29); LOG2(30); LOG2(31);
1552 return -1; /* impossible... */
1559 void flist_ndx_push(flist_ndx_list *lp, int ndx)
1561 struct flist_ndx_item *item;
1563 if (!(item = new(struct flist_ndx_item)))
1564 out_of_memory("flist_ndx_push");
1568 lp->tail->next = item;
1574 int flist_ndx_pop(flist_ndx_list *lp)
1576 struct flist_ndx_item *next;
1582 ndx = lp->head->ndx;
1583 next = lp->head->next;
1592 void *expand_item_list(item_list *lp, size_t item_size,
1593 const char *desc, int incr)
1595 /* First time through, 0 <= 0, so list is expanded. */
1596 if (lp->malloced <= lp->count) {
1598 size_t new_size = lp->malloced;
1600 new_size += -incr; /* increase slowly */
1601 else if (new_size < (size_t)incr)
1605 if (new_size < lp->malloced)
1606 overflow_exit("expand_item_list");
1607 /* Using _realloc_array() lets us pass the size, not a type. */
1608 new_ptr = _realloc_array(lp->items, item_size, new_size);
1609 if (DEBUG_GTE(FLIST, 3)) {
1610 rprintf(FINFO, "[%s] expand %s to %s bytes, did%s move\n",
1611 who_am_i(), desc, big_num(new_size * item_size),
1612 new_ptr == lp->items ? " not" : "");
1615 out_of_memory("expand_item_list");
1617 lp->items = new_ptr;
1618 lp->malloced = new_size;
1620 return (char*)lp->items + (lp->count++ * item_size);