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 mode_t orig_umask;
36 extern char *partial_dir;
37 extern struct filter_list_struct daemon_filter_list;
39 int sanitize_paths = 0;
41 char curr_dir[MAXPATHLEN];
42 unsigned int curr_dir_len;
43 int curr_dir_depth; /* This is only set for a sanitizing daemon. */
45 /* Set a fd into nonblocking mode. */
46 void set_nonblocking(int fd)
50 if ((val = fcntl(fd, F_GETFL)) == -1)
52 if (!(val & NONBLOCK_FLAG)) {
54 fcntl(fd, F_SETFL, val);
58 /* Set a fd into blocking mode. */
59 void set_blocking(int fd)
63 if ((val = fcntl(fd, F_GETFL)) == -1)
65 if (val & NONBLOCK_FLAG) {
66 val &= ~NONBLOCK_FLAG;
67 fcntl(fd, F_SETFL, val);
72 * Create a file descriptor pair - like pipe() but use socketpair if
73 * possible (because of blocking issues on pipes).
75 * Always set non-blocking.
77 int fd_pair(int fd[2])
81 #ifdef HAVE_SOCKETPAIR
82 ret = socketpair(AF_UNIX, SOCK_STREAM, 0, fd);
88 set_nonblocking(fd[0]);
89 set_nonblocking(fd[1]);
95 void print_child_argv(const char *prefix, char **cmd)
97 rprintf(FCLIENT, "%s ", prefix);
99 /* Look for characters that ought to be quoted. This
100 * is not a great quoting algorithm, but it's
101 * sufficient for a log message. */
102 if (strspn(*cmd, "abcdefghijklmnopqrstuvwxyz"
103 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
105 ",.-_=+@/") != strlen(*cmd)) {
106 rprintf(FCLIENT, "\"%s\" ", *cmd);
108 rprintf(FCLIENT, "%s ", *cmd);
111 rprintf(FCLIENT, "\n");
114 NORETURN void out_of_memory(const char *str)
116 rprintf(FERROR, "ERROR: out of memory in %s [%s]\n", str, who_am_i());
117 exit_cleanup(RERR_MALLOC);
120 NORETURN void overflow_exit(const char *str)
122 rprintf(FERROR, "ERROR: buffer overflow in %s [%s]\n", str, who_am_i());
123 exit_cleanup(RERR_MALLOC);
126 int set_modtime(const char *fname, time_t modtime, mode_t mode)
128 #if !defined HAVE_LUTIMES || !defined HAVE_UTIMES
133 if (DEBUG_GTE(TIME, 1)) {
134 rprintf(FINFO, "set modtime of %s to (%ld) %s",
135 fname, (long)modtime,
136 asctime(localtime(&modtime)));
145 t[0].tv_sec = time(NULL);
147 t[1].tv_sec = modtime;
151 if (lutimes(fname, t) < 0)
152 return errno == ENOSYS ? 1 : -1;
156 return utimes(fname, t);
157 #elif defined HAVE_STRUCT_UTIMBUF
159 tbuf.actime = time(NULL);
160 tbuf.modtime = modtime;
161 return utime(fname,&tbuf);
162 #elif defined HAVE_UTIME
166 return utime(fname,t);
168 #error No file-time-modification routine found!
173 /* This creates a new directory with default permissions. Since there
174 * might be some directory-default permissions affecting this, we can't
175 * force the permissions directly using the original umask and mkdir(). */
176 int mkdir_defmode(char *fname)
181 ret = do_mkdir(fname, ACCESSPERMS);
187 /* Create any necessary directories in fname. Any missing directories are
188 * created with default permissions. Returns < 0 on error, or the number
189 * of directories created. */
190 int make_path(char *fname, int flags)
195 if (flags & MKP_SKIP_SLASH) {
196 while (*fname == '/')
200 while (*fname == '.' && fname[1] == '/')
203 if (flags & MKP_DROP_NAME) {
204 end = strrchr(fname, '/');
209 end = fname + strlen(fname);
211 umask(orig_umask); /* NOTE: don't return before setting this back to 0! */
213 /* Try to find an existing dir, starting from the deepest dir. */
215 if (do_mkdir(fname, ACCESSPERMS) == 0) {
219 if (errno != ENOENT) {
231 ret = -ret - 1; /* impossible... */
241 /* Make all the dirs that we didn't find on the way here. */
245 if (ret < 0) /* Skip mkdir on error, but keep restoring the path. */
247 if (do_mkdir(fname, ACCESSPERMS) < 0)
255 if (flags & MKP_DROP_NAME)
262 * Write @p len bytes at @p ptr to descriptor @p desc, retrying if
265 * @retval len upon success
267 * @retval <0 write's (negative) error code
269 * Derived from GNU C's cccp.c.
271 int full_write(int desc, const char *ptr, size_t len)
277 int written = write(desc, ptr, len);
283 total_written += written;
287 return total_written;
291 * Read @p len bytes at @p ptr from descriptor @p desc, retrying if
294 * @retval >0 the actual number of bytes read
298 * @retval <0 for an error.
300 * Derived from GNU C's cccp.c. */
301 static int safe_read(int desc, char *ptr, size_t len)
309 n_chars = read(desc, ptr, len);
310 } while (n_chars < 0 && errno == EINTR);
315 /* Copy a file. If ofd < 0, copy_file unlinks and opens the "dest" file.
316 * Otherwise, it just writes to and closes the provided file descriptor.
317 * In either case, if --xattrs are being preserved, the dest file will
318 * have its xattrs set from the source file.
320 * This is used in conjunction with the --temp-dir, --backup, and
321 * --copy-dest options. */
322 int copy_file(const char *source, const char *dest, int ofd, mode_t mode)
326 int len; /* Number of bytes read into `buf'. */
328 if ((ifd = do_open(source, O_RDONLY, 0)) < 0) {
329 int save_errno = errno;
330 rsyserr(FERROR_XFER, errno, "open %s", full_fname(source));
336 if (robust_unlink(dest) && errno != ENOENT) {
337 int save_errno = errno;
338 rsyserr(FERROR_XFER, errno, "unlink %s", full_fname(dest));
343 if ((ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode)) < 0) {
344 int save_errno = errno;
345 rsyserr(FERROR_XFER, save_errno, "open %s", full_fname(dest));
352 while ((len = safe_read(ifd, buf, sizeof buf)) > 0) {
353 if (full_write(ofd, buf, len) < 0) {
354 int save_errno = errno;
355 rsyserr(FERROR_XFER, errno, "write %s", full_fname(dest));
364 int save_errno = errno;
365 rsyserr(FERROR_XFER, errno, "read %s", full_fname(source));
372 if (close(ifd) < 0) {
373 rsyserr(FWARNING, errno, "close failed on %s",
377 if (close(ofd) < 0) {
378 int save_errno = errno;
379 rsyserr(FERROR_XFER, errno, "close failed on %s",
385 #ifdef SUPPORT_XATTRS
387 copy_xattrs(source, dest);
393 /* MAX_RENAMES should be 10**MAX_RENAMES_DIGITS */
394 #define MAX_RENAMES_DIGITS 3
395 #define MAX_RENAMES 1000
398 * Robust unlink: some OS'es (HPUX) refuse to unlink busy files, so
399 * rename to <path>/.rsyncNNN instead.
401 * Note that successive rsync runs will shuffle the filenames around a
402 * bit as long as the file is still busy; this is because this function
403 * does not know if the unlink call is due to a new file coming in, or
404 * --delete trying to remove old .rsyncNNN files, hence it renames it
407 int robust_unlink(const char *fname)
410 return do_unlink(fname);
412 static int counter = 1;
414 char path[MAXPATHLEN];
416 rc = do_unlink(fname);
417 if (rc == 0 || errno != ETXTBSY)
420 if ((pos = strlcpy(path, fname, MAXPATHLEN)) >= MAXPATHLEN)
421 pos = MAXPATHLEN - 1;
423 while (pos > 0 && path[pos-1] != '/')
425 pos += strlcpy(path+pos, ".rsync", MAXPATHLEN-pos);
427 if (pos > (MAXPATHLEN-MAX_RENAMES_DIGITS-1)) {
432 /* start where the last one left off to reduce chance of clashes */
435 snprintf(&path[pos], MAX_RENAMES_DIGITS+1, "%03d", counter);
436 if (++counter >= MAX_RENAMES)
438 } while ((rc = access(path, 0)) == 0 && counter != start);
440 if (INFO_GTE(MISC, 1)) {
441 rprintf(FWARNING, "renaming %s to %s because of text busy\n",
445 /* maybe we should return rename()'s exit status? Nah. */
446 if (do_rename(fname, path) != 0) {
454 /* Returns 0 on successful rename, 1 if we successfully copied the file
455 * across filesystems, -2 if copy_file() failed, and -1 on other errors.
456 * If partialptr is not NULL and we need to do a copy, copy the file into
457 * the active partial-dir instead of over the destination file. */
458 int robust_rename(const char *from, const char *to, const char *partialptr,
464 if (do_rename(from, to) == 0)
470 if (robust_unlink(to) != 0) {
479 if (!handle_partial_dir(partialptr,PDIR_CREATE))
483 if (copy_file(from, to, -1, mode) != 0)
494 static pid_t all_pids[10];
497 /** Fork and record the pid of the child. **/
500 pid_t newpid = fork();
502 if (newpid != 0 && newpid != -1) {
503 all_pids[num_pids++] = newpid;
511 * @todo It would be kind of nice to make sure that they are actually
512 * all our children before we kill them, because their pids may have
513 * been recycled by some other process. Perhaps when we wait for a
514 * child, we should remove it from this array. Alternatively we could
515 * perhaps use process groups, but I think that would not work on
516 * ancient Unix versions that don't support them.
518 void kill_all(int sig)
522 for (i = 0; i < num_pids; i++) {
523 /* Let's just be a little careful where we
524 * point that gun, hey? See kill(2) for the
525 * magic caused by negative values. */
526 pid_t p = all_pids[i];
537 /** Turn a user name into a uid */
538 int name_to_uid(const char *name, uid_t *uid_p, BOOL num_ok)
543 if (num_ok && name[strspn(name, "0123456789")] == '\0') {
546 } else if ((pass = getpwnam(name))) {
547 *uid_p = pass->pw_uid;
553 /** Turn a group name into a gid */
554 int name_to_gid(const char *name, gid_t *gid_p, BOOL num_ok)
559 if (num_ok && name[strspn(name, "0123456789")] == '\0') {
562 } else if ((grp = getgrnam(name))) {
563 *gid_p = grp->gr_gid;
569 /** Lock a byte range in a open file */
570 int lock_range(int fd, int offset, int len)
574 lock.l_type = F_WRLCK;
575 lock.l_whence = SEEK_SET;
576 lock.l_start = offset;
580 return fcntl(fd,F_SETLK,&lock) == 0;
583 #define ENSURE_MEMSPACE(buf, type, sz, req) \
584 if ((req) > sz && !(buf = realloc_array(buf, type, sz = MAX(sz * 2, req)))) \
585 out_of_memory("glob_expand")
587 static inline void call_glob_match(const char *name, int len, int from_glob,
588 char *arg, int abpos, int fbpos);
590 static struct glob_data {
591 char *arg_buf, *filt_buf, **argv;
592 int absize, fbsize, maxargs, argc;
595 static void glob_match(char *arg, int abpos, int fbpos)
600 while (*arg == '.' && arg[1] == '/') {
602 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, glob.absize);
603 memcpy(glob.filt_buf, glob.arg_buf, abpos + 1);
606 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + 3);
607 glob.arg_buf[abpos++] = *arg++;
608 glob.arg_buf[abpos++] = *arg++;
609 glob.arg_buf[abpos] = '\0';
611 if ((slash = strchr(arg, '/')) != NULL) {
616 if (strpbrk(arg, "*?[")) {
620 if (!(d = opendir(abpos ? glob.arg_buf : ".")))
622 while ((di = readdir(d)) != NULL) {
623 char *dname = d_name(di);
624 if (dname[0] == '.' && (dname[1] == '\0'
625 || (dname[1] == '.' && dname[2] == '\0')))
627 if (!wildmatch(arg, dname))
629 call_glob_match(dname, strlen(dname), 1,
630 slash ? arg + len + 1 : NULL,
635 call_glob_match(arg, len, 0,
636 slash ? arg + len + 1 : NULL,
643 static inline void call_glob_match(const char *name, int len, int from_glob,
644 char *arg, int abpos, int fbpos)
648 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + len + 2);
649 memcpy(glob.arg_buf + abpos, name, len);
651 glob.arg_buf[abpos] = '\0';
654 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, fbpos + len + 2);
655 memcpy(glob.filt_buf + fbpos, name, len);
657 glob.filt_buf[fbpos] = '\0';
658 use_buf = glob.filt_buf;
660 use_buf = glob.arg_buf;
662 if (from_glob || (arg && len)) {
666 if (do_stat(glob.arg_buf, &st) != 0)
668 is_dir = S_ISDIR(st.st_mode) != 0;
672 if (daemon_filter_list.head
673 && check_filter(&daemon_filter_list, FLOG, use_buf, is_dir) < 0)
678 glob.arg_buf[abpos++] = '/';
679 glob.arg_buf[abpos] = '\0';
681 glob.filt_buf[fbpos++] = '/';
682 glob.filt_buf[fbpos] = '\0';
684 glob_match(arg, abpos, fbpos);
686 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
687 if (!(glob.argv[glob.argc++] = strdup(glob.arg_buf)))
688 out_of_memory("glob_match");
692 /* This routine performs wild-card expansion of the pathname in "arg". Any
693 * daemon-excluded files/dirs will not be matched by the wildcards. Returns 0
694 * if a wild-card string is the only returned item (due to matching nothing). */
695 int glob_expand(const char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
704 memset(&glob, 0, sizeof glob);
709 s = sanitize_path(NULL, arg, "", 0, SP_KEEP_DOT_DIRS);
713 out_of_memory("glob_expand");
714 clean_fname(s, CFN_KEEP_DOT_DIRS
715 | CFN_KEEP_TRAILING_SLASH
716 | CFN_COLLAPSE_DOT_DOT_DIRS);
719 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, MAXPATHLEN);
720 *glob.arg_buf = '\0';
722 glob.argc = save_argc = *argc_p;
724 glob.maxargs = *maxargs_p;
726 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, 100);
728 glob_match(s, 0, -1);
730 /* The arg didn't match anything, so add the failed arg to the list. */
731 if (glob.argc == save_argc) {
732 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
733 glob.argv[glob.argc++] = s;
740 *maxargs_p = glob.maxargs;
747 /* This routine is only used in daemon mode. */
748 void glob_expand_module(char *base1, char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
752 int base_len = strlen(base);
757 if (strncmp(arg, base, base_len) == 0)
760 if (!(arg = strdup(arg)))
761 out_of_memory("glob_expand_module");
763 if (asprintf(&base," %s/", base1) <= 0)
764 out_of_memory("glob_expand_module");
767 for (s = arg; *s; s = p + base_len) {
768 if ((p = strstr(s, base)) != NULL)
769 *p = '\0'; /* split it at this point */
770 glob_expand(s, argv_p, argc_p, maxargs_p);
780 * Convert a string to lower case
782 void strlower(char *s)
791 /* Join strings p1 & p2 into "dest" with a guaranteed '/' between them. (If
792 * p1 ends with a '/', no extra '/' is inserted.) Returns the length of both
793 * strings + 1 (if '/' was inserted), regardless of whether the null-terminated
794 * string fits into destsize. */
795 size_t pathjoin(char *dest, size_t destsize, const char *p1, const char *p2)
797 size_t len = strlcpy(dest, p1, destsize);
798 if (len < destsize - 1) {
799 if (!len || dest[len-1] != '/')
801 if (len < destsize - 1)
802 len += strlcpy(dest + len, p2, destsize - len);
809 len += strlen(p2) + 1; /* Assume we'd insert a '/'. */
813 /* Join any number of strings together, putting them in "dest". The return
814 * value is the length of all the strings, regardless of whether the null-
815 * terminated whole fits in destsize. Your list of string pointers must end
816 * with a NULL to indicate the end of the list. */
817 size_t stringjoin(char *dest, size_t destsize, ...)
823 va_start(ap, destsize);
825 if (!(src = va_arg(ap, const char *)))
832 memcpy(dest, src, len);
843 /* Append formatted text at *dest_ptr up to a maximum of sz (like snprintf).
844 * On success, advance *dest_ptr and return True; on overflow, return False. */
845 BOOL snappendf(char **dest_ptr, size_t sz, const char *format, ...)
850 va_start(ap, format);
851 len = vsnprintf(*dest_ptr, sz, format, ap);
862 int count_dir_elements(const char *p)
864 int cnt = 0, new_component = 1;
867 new_component = (*p != '.' || (p[1] != '/' && p[1] != '\0'));
868 else if (new_component) {
876 /* Turns multiple adjacent slashes into a single slash (possible exception:
877 * the preserving of two leading slashes at the start), drops all leading or
878 * interior "." elements unless CFN_KEEP_DOT_DIRS is flagged. Will also drop
879 * a trailing '.' after a '/' if CFN_DROP_TRAILING_DOT_DIR is flagged, removes
880 * a trailing slash (perhaps after removing the aforementioned dot) unless
881 * CFN_KEEP_TRAILING_SLASH is flagged, and will also collapse ".." elements
882 * (except at the start) if CFN_COLLAPSE_DOT_DOT_DIRS is flagged. If the
883 * resulting name would be empty, returns ".". */
884 unsigned int clean_fname(char *name, int flags)
886 char *limit = name - 1, *t = name, *f = name;
892 if ((anchored = *f == '/') != 0) {
895 /* If there are exactly 2 slashes at the start, preserve
896 * them. Would break daemon excludes unless the paths are
897 * really treated differently, so used this sparingly. */
898 if (*f == '/' && f[1] != '/')
901 } else if (flags & CFN_KEEP_DOT_DIRS && *f == '.' && f[1] == '/') {
906 /* discard extra slashes */
912 /* discard interior "." dirs */
913 if (f[1] == '/' && !(flags & CFN_KEEP_DOT_DIRS)) {
917 if (f[1] == '\0' && flags & CFN_DROP_TRAILING_DOT_DIR)
919 /* collapse ".." dirs */
920 if (flags & CFN_COLLAPSE_DOT_DOT_DIRS
921 && f[1] == '.' && (f[2] == '/' || !f[2])) {
923 if (s == name && anchored) {
927 while (s > limit && *--s != '/') {}
928 if (s != t - 1 && (s < name || *s == '/')) {
936 while (*f && (*t++ = *f++) != '/') {}
939 if (t > name+anchored && t[-1] == '/' && !(flags & CFN_KEEP_TRAILING_SLASH))
948 /* Make path appear as if a chroot had occurred. This handles a leading
949 * "/" (either removing it or expanding it) and any leading or embedded
950 * ".." components that attempt to escape past the module's top dir.
952 * If dest is NULL, a buffer is allocated to hold the result. It is legal
953 * to call with the dest and the path (p) pointing to the same buffer, but
954 * rootdir will be ignored to avoid expansion of the string.
956 * The rootdir string contains a value to use in place of a leading slash.
957 * Specify NULL to get the default of "module_dir".
959 * The depth var is a count of how many '..'s to allow at the start of the
962 * We also clean the path in a manner similar to clean_fname() but with a
965 * Turns multiple adjacent slashes into a single slash, gets rid of "." dir
966 * elements (INCLUDING a trailing dot dir), PRESERVES a trailing slash, and
967 * ALWAYS collapses ".." elements (except for those at the start of the
968 * string up to "depth" deep). If the resulting name would be empty,
969 * change it into a ".". */
970 char *sanitize_path(char *dest, const char *p, const char *rootdir, int depth,
974 int rlen = 0, drop_dot_dirs = !relative_paths || !(flags & SP_KEEP_DOT_DIRS);
977 int plen = strlen(p);
980 rootdir = module_dir;
981 rlen = strlen(rootdir);
986 if (rlen + plen + 1 >= MAXPATHLEN)
988 } else if (!(dest = new_array(char, rlen + plen + 1)))
989 out_of_memory("sanitize_path");
991 memcpy(dest, rootdir, rlen);
998 while (*p == '.' && p[1] == '/')
1002 start = sanp = dest + rlen;
1003 /* This loop iterates once per filename component in p, pointing at
1004 * the start of the name (past any prior slash) for each iteration. */
1006 /* discard leading or extra slashes */
1011 if (drop_dot_dirs) {
1012 if (*p == '.' && (p[1] == '/' || p[1] == '\0')) {
1013 /* skip "." component */
1018 if (*p == '.' && p[1] == '.' && (p[2] == '/' || p[2] == '\0')) {
1019 /* ".." component followed by slash or end */
1020 if (depth <= 0 || sanp != start) {
1022 if (sanp != start) {
1023 /* back up sanp one level */
1024 --sanp; /* now pointing at slash */
1025 while (sanp > start && sanp[-1] != '/')
1030 /* allow depth levels of .. at the beginning */
1032 /* move the virtual beginning to leave the .. alone */
1035 /* copy one component through next slash */
1036 while (*p && (*sanp++ = *p++) != '/') {}
1039 /* ended up with nothing, so put in "." component */
1047 /* Like chdir(), but it keeps track of the current directory (in the
1048 * global "curr_dir"), and ensures that the path size doesn't overflow.
1049 * Also cleans the path using the clean_fname() function. */
1050 int change_dir(const char *dir, int set_path_only)
1052 static int initialised;
1057 if (getcwd(curr_dir, sizeof curr_dir - 1) == NULL) {
1058 rsyserr(FERROR, errno, "getcwd()");
1059 exit_cleanup(RERR_FILESELECT);
1061 curr_dir_len = strlen(curr_dir);
1064 if (!dir) /* this call was probably just to initialize */
1068 if (len == 1 && *dir == '.')
1072 if (len >= sizeof curr_dir) {
1073 errno = ENAMETOOLONG;
1076 if (!set_path_only && chdir(dir))
1078 memcpy(curr_dir, dir, len + 1);
1080 if (curr_dir_len + 1 + len >= sizeof curr_dir) {
1081 errno = ENAMETOOLONG;
1084 curr_dir[curr_dir_len] = '/';
1085 memcpy(curr_dir + curr_dir_len + 1, dir, len + 1);
1087 if (!set_path_only && chdir(curr_dir)) {
1088 curr_dir[curr_dir_len] = '\0';
1093 curr_dir_len = clean_fname(curr_dir, CFN_COLLAPSE_DOT_DOT_DIRS);
1094 if (sanitize_paths) {
1095 if (module_dirlen > curr_dir_len)
1096 module_dirlen = curr_dir_len;
1097 curr_dir_depth = count_dir_elements(curr_dir + module_dirlen);
1100 if (DEBUG_GTE(CHDIR, 1) && !set_path_only)
1101 rprintf(FINFO, "[%s] change_dir(%s)\n", who_am_i(), curr_dir);
1106 /* This will make a relative path absolute and clean it up via clean_fname().
1107 * Returns the string, which might be newly allocated, or NULL on error. */
1108 char *normalize_path(char *path, BOOL force_newbuf, unsigned int *len_ptr)
1112 if (*path != '/') { /* Make path absolute. */
1113 int len = strlen(path);
1114 if (curr_dir_len + 1 + len >= sizeof curr_dir)
1116 curr_dir[curr_dir_len] = '/';
1117 memcpy(curr_dir + curr_dir_len + 1, path, len + 1);
1118 if (!(path = strdup(curr_dir)))
1119 out_of_memory("normalize_path");
1120 curr_dir[curr_dir_len] = '\0';
1121 } else if (force_newbuf) {
1122 if (!(path = strdup(path)))
1123 out_of_memory("normalize_path");
1126 len = clean_fname(path, CFN_COLLAPSE_DOT_DOT_DIRS | CFN_DROP_TRAILING_DOT_DIR);
1135 * Return a quoted string with the full pathname of the indicated filename.
1136 * The string " (in MODNAME)" may also be appended. The returned pointer
1137 * remains valid until the next time full_fname() is called.
1139 char *full_fname(const char *fn)
1141 static char *result = NULL;
1151 p1 = curr_dir + module_dirlen;
1152 for (p2 = p1; *p2 == '/'; p2++) {}
1156 if (module_id >= 0) {
1158 m2 = lp_name(module_id);
1163 if (asprintf(&result, "\"%s%s%s\"%s%s%s", p1, p2, fn, m1, m2, m3) <= 0)
1164 out_of_memory("full_fname");
1169 static char partial_fname[MAXPATHLEN];
1171 char *partial_dir_fname(const char *fname)
1173 char *t = partial_fname;
1174 int sz = sizeof partial_fname;
1177 if ((fn = strrchr(fname, '/')) != NULL) {
1179 if (*partial_dir != '/') {
1180 int len = fn - fname;
1181 strncpy(t, fname, len); /* safe */
1187 if ((int)pathjoin(t, sz, partial_dir, fn) >= sz)
1189 if (daemon_filter_list.head) {
1190 t = strrchr(partial_fname, '/');
1192 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 1) < 0)
1195 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 0) < 0)
1199 return partial_fname;
1202 /* If no --partial-dir option was specified, we don't need to do anything
1203 * (the partial-dir is essentially '.'), so just return success. */
1204 int handle_partial_dir(const char *fname, int create)
1208 if (fname != partial_fname)
1210 if (!create && *partial_dir == '/')
1212 if (!(fn = strrchr(partial_fname, '/')))
1216 dir = partial_fname;
1219 int statret = do_lstat(dir, &st);
1220 if (statret == 0 && !S_ISDIR(st.st_mode)) {
1221 if (do_unlink(dir) < 0) {
1227 if (statret < 0 && do_mkdir(dir, 0700) < 0) {
1238 /* Determine if a symlink points outside the current directory tree.
1239 * This is considered "unsafe" because e.g. when mirroring somebody
1240 * else's machine it might allow them to establish a symlink to
1241 * /etc/passwd, and then read it through a web server.
1243 * Returns 1 if unsafe, 0 if safe.
1245 * Null symlinks and absolute symlinks are always unsafe.
1247 * Basically here we are concerned with symlinks whose target contains
1248 * "..", because this might cause us to walk back up out of the
1249 * transferred directory. We are not allowed to go back up and
1252 * "dest" is the target of the symlink in question.
1254 * "src" is the top source directory currently applicable at the level
1255 * of the referenced symlink. This is usually the symlink's full path
1256 * (including its name), as referenced from the root of the transfer. */
1257 int unsafe_symlink(const char *dest, const char *src)
1259 const char *name, *slash;
1262 /* all absolute and null symlinks are unsafe */
1263 if (!dest || !*dest || *dest == '/')
1266 /* find out what our safety margin is */
1267 for (name = src; (slash = strchr(name, '/')) != 0; name = slash+1) {
1268 /* ".." segment starts the count over. "." segment is ignored. */
1269 if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) {
1274 while (slash[1] == '/') slash++; /* just in case src isn't clean */
1276 if (*name == '.' && name[1] == '.' && name[2] == '\0')
1279 for (name = dest; (slash = strchr(name, '/')) != 0; name = slash+1) {
1280 if (*name == '.' && (name[1] == '/' || (name[1] == '.' && name[2] == '/'))) {
1281 if (name[1] == '.') {
1282 /* if at any point we go outside the current directory
1283 then stop - it is unsafe */
1289 while (slash[1] == '/') slash++;
1291 if (*name == '.' && name[1] == '.' && name[2] == '\0')
1297 /* Return the date and time as a string. Some callers tweak returned buf. */
1298 char *timestring(time_t t)
1300 static char TimeBuf[200];
1301 struct tm *tm = localtime(&t);
1304 #ifdef HAVE_STRFTIME
1305 strftime(TimeBuf, sizeof TimeBuf - 1, "%Y/%m/%d %H:%M:%S", tm);
1307 strlcpy(TimeBuf, asctime(tm), sizeof TimeBuf);
1310 if ((p = strchr(TimeBuf, '\n')) != NULL)
1317 * Sleep for a specified number of milliseconds.
1319 * Always returns TRUE. (In the future it might return FALSE if
1325 struct timeval tval, t1, t2;
1327 gettimeofday(&t1, NULL);
1330 tval.tv_sec = (t-tdiff)/1000;
1331 tval.tv_usec = 1000*((t-tdiff)%1000);
1334 select(0,NULL,NULL, NULL, &tval);
1336 gettimeofday(&t2, NULL);
1337 tdiff = (t2.tv_sec - t1.tv_sec)*1000 +
1338 (t2.tv_usec - t1.tv_usec)/1000;
1344 /* Determine if two time_t values are equivalent (either exact, or in
1345 * the modification timestamp window established by --modify-window).
1347 * @retval 0 if the times should be treated as the same
1349 * @retval +1 if the first is later
1351 * @retval -1 if the 2nd is later
1353 int cmp_time(time_t file1, time_t file2)
1355 if (file2 > file1) {
1356 if (file2 - file1 <= modify_window)
1360 if (file1 - file2 <= modify_window)
1370 This routine is a trick to immediately catch errors when debugging
1371 with insure. A xterm with a gdb is popped up when insure catches
1372 a error. It is Linux specific.
1374 int _Insure_trap_error(int a1, int a2, int a3, int a4, int a5, int a6)
1380 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'",
1381 getpid(), getpid(), getpid());
1385 h = dlopen("/usr/local/parasoft/insure++lite/lib.linux2/libinsure.so", RTLD_LAZY);
1386 fn = dlsym(h, "_Insure_trap_error");
1389 ret = fn(a1, a2, a3, a4, a5, a6);
1399 #define MALLOC_MAX 0x40000000
1401 void *_new_array(unsigned long num, unsigned int size, int use_calloc)
1403 if (num >= MALLOC_MAX/size)
1405 return use_calloc ? calloc(num, size) : malloc(num * size);
1408 void *_realloc_array(void *ptr, unsigned int size, size_t num)
1410 if (num >= MALLOC_MAX/size)
1413 return malloc(size * num);
1414 return realloc(ptr, size * num);
1417 /* Take a filename and filename length and return the most significant
1418 * filename suffix we can find. This ignores suffixes such as "~",
1419 * ".bak", ".orig", ".~1~", etc. */
1420 const char *find_filename_suffix(const char *fn, int fn_len, int *len_ptr)
1422 const char *suf, *s;
1426 /* One or more dots at the start aren't a suffix. */
1427 while (fn_len && *fn == '.') fn++, fn_len--;
1429 /* Ignore the ~ in a "foo~" filename. */
1430 if (fn_len > 1 && fn[fn_len-1] == '~')
1431 fn_len--, had_tilde = True;
1435 /* Assume we don't find an suffix. */
1439 /* Find the last significant suffix. */
1440 for (s = fn + fn_len; fn_len > 1; ) {
1441 while (*--s != '.' && s != fn) {}
1444 s_len = fn_len - (s - fn);
1447 if (strcmp(s+1, "bak") == 0
1448 || strcmp(s+1, "old") == 0)
1450 } else if (s_len == 5) {
1451 if (strcmp(s+1, "orig") == 0)
1453 } else if (s_len > 2 && had_tilde
1454 && s[1] == '~' && isDigit(s + 2))
1460 /* Determine if the suffix is all digits. */
1461 for (s++, s_len--; s_len > 0; s++, s_len--) {
1465 /* An all-digit suffix may not be that signficant. */
1472 /* This is an implementation of the Levenshtein distance algorithm. It
1473 * was implemented to avoid needing a two-dimensional matrix (to save
1474 * memory). It was also tweaked to try to factor in the ASCII distance
1475 * between changed characters as a minor distance quantity. The normal
1476 * Levenshtein units of distance (each signifying a single change between
1477 * the two strings) are defined as a "UNIT". */
1479 #define UNIT (1 << 16)
1481 uint32 fuzzy_distance(const char *s1, int len1, const char *s2, int len2)
1483 uint32 a[MAXPATHLEN], diag, above, left, diag_inc, above_inc, left_inc;
1487 if (!len1 || !len2) {
1492 for (i1 = 0, cost = 0; i1 < len1; i1++)
1494 return (int32)len1 * UNIT + cost;
1497 for (i2 = 0; i2 < len2; i2++)
1498 a[i2] = (i2+1) * UNIT;
1500 for (i1 = 0; i1 < len1; i1++) {
1502 above = (i1+1) * UNIT;
1503 for (i2 = 0; i2 < len2; i2++) {
1505 if ((cost = *((uchar*)s1+i1) - *((uchar*)s2+i2)) != 0) {
1511 diag_inc = diag + cost;
1512 left_inc = left + UNIT + *((uchar*)s1+i1);
1513 above_inc = above + UNIT + *((uchar*)s2+i2);
1514 a[i2] = above = left < above
1515 ? (left_inc < diag_inc ? left_inc : diag_inc)
1516 : (above_inc < diag_inc ? above_inc : diag_inc);
1524 #define BB_SLOT_SIZE (16*1024) /* Desired size in bytes */
1525 #define BB_PER_SLOT_BITS (BB_SLOT_SIZE * 8) /* Number of bits per slot */
1526 #define BB_PER_SLOT_INTS (BB_SLOT_SIZE / 4) /* Number of int32s per slot */
1533 struct bitbag *bitbag_create(int max_ndx)
1535 struct bitbag *bb = new(struct bitbag);
1536 bb->slot_cnt = (max_ndx + BB_PER_SLOT_BITS - 1) / BB_PER_SLOT_BITS;
1538 if (!(bb->bits = (uint32**)calloc(bb->slot_cnt, sizeof (uint32*))))
1539 out_of_memory("bitbag_create");
1544 void bitbag_set_bit(struct bitbag *bb, int ndx)
1546 int slot = ndx / BB_PER_SLOT_BITS;
1547 ndx %= BB_PER_SLOT_BITS;
1549 if (!bb->bits[slot]) {
1550 if (!(bb->bits[slot] = (uint32*)calloc(BB_PER_SLOT_INTS, 4)))
1551 out_of_memory("bitbag_set_bit");
1554 bb->bits[slot][ndx/32] |= 1u << (ndx % 32);
1557 #if 0 /* not needed yet */
1558 void bitbag_clear_bit(struct bitbag *bb, int ndx)
1560 int slot = ndx / BB_PER_SLOT_BITS;
1561 ndx %= BB_PER_SLOT_BITS;
1563 if (!bb->bits[slot])
1566 bb->bits[slot][ndx/32] &= ~(1u << (ndx % 32));
1569 int bitbag_check_bit(struct bitbag *bb, int ndx)
1571 int slot = ndx / BB_PER_SLOT_BITS;
1572 ndx %= BB_PER_SLOT_BITS;
1574 if (!bb->bits[slot])
1577 return bb->bits[slot][ndx/32] & (1u << (ndx % 32)) ? 1 : 0;
1581 /* Call this with -1 to start checking from 0. Returns -1 at the end. */
1582 int bitbag_next_bit(struct bitbag *bb, int after)
1585 int i, ndx = after + 1;
1586 int slot = ndx / BB_PER_SLOT_BITS;
1587 ndx %= BB_PER_SLOT_BITS;
1589 mask = (1u << (ndx % 32)) - 1;
1590 for (i = ndx / 32; slot < bb->slot_cnt; slot++, i = mask = 0) {
1591 if (!bb->bits[slot])
1593 for ( ; i < BB_PER_SLOT_INTS; i++, mask = 0) {
1594 if (!(bits = bb->bits[slot][i] & ~mask))
1596 /* The xor magic figures out the lowest enabled bit in
1597 * bits, and the switch quickly computes log2(bit). */
1598 switch (bits ^ (bits & (bits-1))) {
1599 #define LOG2(n) case 1u << n: return slot*BB_PER_SLOT_BITS + i*32 + n
1600 LOG2(0); LOG2(1); LOG2(2); LOG2(3);
1601 LOG2(4); LOG2(5); LOG2(6); LOG2(7);
1602 LOG2(8); LOG2(9); LOG2(10); LOG2(11);
1603 LOG2(12); LOG2(13); LOG2(14); LOG2(15);
1604 LOG2(16); LOG2(17); LOG2(18); LOG2(19);
1605 LOG2(20); LOG2(21); LOG2(22); LOG2(23);
1606 LOG2(24); LOG2(25); LOG2(26); LOG2(27);
1607 LOG2(28); LOG2(29); LOG2(30); LOG2(31);
1609 return -1; /* impossible... */
1616 void flist_ndx_push(flist_ndx_list *lp, int ndx)
1618 struct flist_ndx_item *item;
1620 if (!(item = new(struct flist_ndx_item)))
1621 out_of_memory("flist_ndx_push");
1625 lp->tail->next = item;
1631 int flist_ndx_pop(flist_ndx_list *lp)
1633 struct flist_ndx_item *next;
1639 ndx = lp->head->ndx;
1640 next = lp->head->next;
1649 void *expand_item_list(item_list *lp, size_t item_size,
1650 const char *desc, int incr)
1652 /* First time through, 0 <= 0, so list is expanded. */
1653 if (lp->malloced <= lp->count) {
1655 size_t new_size = lp->malloced;
1657 new_size += -incr; /* increase slowly */
1658 else if (new_size < (size_t)incr)
1662 if (new_size < lp->malloced)
1663 overflow_exit("expand_item_list");
1664 /* Using _realloc_array() lets us pass the size, not a type. */
1665 new_ptr = _realloc_array(lp->items, item_size, new_size);
1666 if (DEBUG_GTE(FLIST, 3)) {
1667 rprintf(FINFO, "[%s] expand %s to %s bytes, did%s move\n",
1668 who_am_i(), desc, big_num(new_size * item_size),
1669 new_ptr == lp->items ? " not" : "");
1672 out_of_memory("expand_item_list");
1674 lp->items = new_ptr;
1675 lp->malloced = new_size;
1677 return (char*)lp->items + (lp->count++ * item_size);