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-2008 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.
28 extern int modify_window;
29 extern int relative_paths;
30 extern int preserve_xattrs;
31 extern char *module_dir;
32 extern unsigned int module_dirlen;
33 extern mode_t orig_umask;
34 extern char *partial_dir;
35 extern struct filter_list_struct daemon_filter_list;
37 int sanitize_paths = 0;
39 char curr_dir[MAXPATHLEN];
40 unsigned int curr_dir_len;
41 int curr_dir_depth; /* This is only set for a sanitizing daemon. */
43 /* Set a fd into nonblocking mode. */
44 void set_nonblocking(int fd)
48 if ((val = fcntl(fd, F_GETFL)) == -1)
50 if (!(val & NONBLOCK_FLAG)) {
52 fcntl(fd, F_SETFL, val);
56 /* Set a fd into blocking mode. */
57 void set_blocking(int fd)
61 if ((val = fcntl(fd, F_GETFL)) == -1)
63 if (val & NONBLOCK_FLAG) {
64 val &= ~NONBLOCK_FLAG;
65 fcntl(fd, F_SETFL, val);
70 * Create a file descriptor pair - like pipe() but use socketpair if
71 * possible (because of blocking issues on pipes).
73 * Always set non-blocking.
75 int fd_pair(int fd[2])
79 #ifdef HAVE_SOCKETPAIR
80 ret = socketpair(AF_UNIX, SOCK_STREAM, 0, fd);
86 set_nonblocking(fd[0]);
87 set_nonblocking(fd[1]);
93 void print_child_argv(const char *prefix, char **cmd)
95 rprintf(FCLIENT, "%s ", prefix);
97 /* Look for characters that ought to be quoted. This
98 * is not a great quoting algorithm, but it's
99 * sufficient for a log message. */
100 if (strspn(*cmd, "abcdefghijklmnopqrstuvwxyz"
101 "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
103 ",.-_=+@/") != strlen(*cmd)) {
104 rprintf(FCLIENT, "\"%s\" ", *cmd);
106 rprintf(FCLIENT, "%s ", *cmd);
109 rprintf(FCLIENT, "\n");
112 NORETURN void out_of_memory(const char *str)
114 rprintf(FERROR, "ERROR: out of memory in %s [%s]\n", str, who_am_i());
115 exit_cleanup(RERR_MALLOC);
118 NORETURN void overflow_exit(const char *str)
120 rprintf(FERROR, "ERROR: buffer overflow in %s [%s]\n", str, who_am_i());
121 exit_cleanup(RERR_MALLOC);
124 int set_modtime(const char *fname, time_t modtime, mode_t mode)
126 #if !defined HAVE_LUTIMES || !defined HAVE_UTIMES
131 if (DEBUG_GTE(TIME, 1)) {
132 rprintf(FINFO, "set modtime of %s to (%ld) %s",
133 fname, (long)modtime,
134 asctime(localtime(&modtime)));
143 t[0].tv_sec = time(NULL);
145 t[1].tv_sec = modtime;
149 if (lutimes(fname, t) < 0)
150 return errno == ENOSYS ? 1 : -1;
154 return utimes(fname, t);
155 #elif defined HAVE_STRUCT_UTIMBUF
157 tbuf.actime = time(NULL);
158 tbuf.modtime = modtime;
159 return utime(fname,&tbuf);
160 #elif defined HAVE_UTIME
164 return utime(fname,t);
166 #error No file-time-modification routine found!
171 /* This creates a new directory with default permissions. Since there
172 * might be some directory-default permissions affecting this, we can't
173 * force the permissions directly using the original umask and mkdir(). */
174 int mkdir_defmode(char *fname)
179 ret = do_mkdir(fname, ACCESSPERMS);
185 /* Create any necessary directories in fname. Any missing directories are
186 * created with default permissions. */
187 int create_directory_path(char *fname)
192 while (*fname == '/')
194 while (strncmp(fname, "./", 2) == 0)
199 while ((p = strchr(p,'/')) != NULL) {
201 if (do_mkdir(fname, ACCESSPERMS) < 0 && errno != EEXIST)
211 * Write @p len bytes at @p ptr to descriptor @p desc, retrying if
214 * @retval len upon success
216 * @retval <0 write's (negative) error code
218 * Derived from GNU C's cccp.c.
220 int full_write(int desc, const char *ptr, size_t len)
226 int written = write(desc, ptr, len);
232 total_written += written;
236 return total_written;
240 * Read @p len bytes at @p ptr from descriptor @p desc, retrying if
243 * @retval >0 the actual number of bytes read
247 * @retval <0 for an error.
249 * Derived from GNU C's cccp.c. */
250 static int safe_read(int desc, char *ptr, size_t len)
258 n_chars = read(desc, ptr, len);
259 } while (n_chars < 0 && errno == EINTR);
264 /* Copy a file. If ofd < 0, copy_file unlinks and opens the "dest" file.
265 * Otherwise, it just writes to and closes the provided file descriptor.
266 * In either case, if --xattrs are being preserved, the dest file will
267 * have its xattrs set from the source file.
269 * This is used in conjunction with the --temp-dir, --backup, and
270 * --copy-dest options. */
271 int copy_file(const char *source, const char *dest, int ofd,
272 mode_t mode, int create_bak_dir)
276 int len; /* Number of bytes read into `buf'. */
278 if ((ifd = do_open(source, O_RDONLY, 0)) < 0) {
279 int save_errno = errno;
280 rsyserr(FERROR_XFER, errno, "open %s", full_fname(source));
286 if (robust_unlink(dest) && errno != ENOENT) {
287 int save_errno = errno;
288 rsyserr(FERROR_XFER, errno, "unlink %s", full_fname(dest));
293 if ((ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode)) < 0) {
294 int save_errno = errno ? errno : EINVAL; /* 0 paranoia */
295 if (create_bak_dir && errno == ENOENT && make_bak_dir(dest) == 0) {
296 if ((ofd = do_open(dest, O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, mode)) < 0)
297 save_errno = errno ? errno : save_errno;
302 rsyserr(FERROR_XFER, save_errno, "open %s", full_fname(dest));
310 while ((len = safe_read(ifd, buf, sizeof buf)) > 0) {
311 if (full_write(ofd, buf, len) < 0) {
312 int save_errno = errno;
313 rsyserr(FERROR_XFER, errno, "write %s", full_fname(dest));
322 int save_errno = errno;
323 rsyserr(FERROR_XFER, errno, "read %s", full_fname(source));
330 if (close(ifd) < 0) {
331 rsyserr(FWARNING, errno, "close failed on %s",
335 if (close(ofd) < 0) {
336 int save_errno = errno;
337 rsyserr(FERROR_XFER, errno, "close failed on %s",
343 #ifdef SUPPORT_XATTRS
345 copy_xattrs(source, dest);
351 /* MAX_RENAMES should be 10**MAX_RENAMES_DIGITS */
352 #define MAX_RENAMES_DIGITS 3
353 #define MAX_RENAMES 1000
356 * Robust unlink: some OS'es (HPUX) refuse to unlink busy files, so
357 * rename to <path>/.rsyncNNN instead.
359 * Note that successive rsync runs will shuffle the filenames around a
360 * bit as long as the file is still busy; this is because this function
361 * does not know if the unlink call is due to a new file coming in, or
362 * --delete trying to remove old .rsyncNNN files, hence it renames it
365 int robust_unlink(const char *fname)
368 return do_unlink(fname);
370 static int counter = 1;
372 char path[MAXPATHLEN];
374 rc = do_unlink(fname);
375 if (rc == 0 || errno != ETXTBSY)
378 if ((pos = strlcpy(path, fname, MAXPATHLEN)) >= MAXPATHLEN)
379 pos = MAXPATHLEN - 1;
381 while (pos > 0 && path[pos-1] != '/')
383 pos += strlcpy(path+pos, ".rsync", MAXPATHLEN-pos);
385 if (pos > (MAXPATHLEN-MAX_RENAMES_DIGITS-1)) {
390 /* start where the last one left off to reduce chance of clashes */
393 snprintf(&path[pos], MAX_RENAMES_DIGITS+1, "%03d", counter);
394 if (++counter >= MAX_RENAMES)
396 } while ((rc = access(path, 0)) == 0 && counter != start);
398 if (INFO_GTE(MISC, 1)) {
399 rprintf(FWARNING, "renaming %s to %s because of text busy\n",
403 /* maybe we should return rename()'s exit status? Nah. */
404 if (do_rename(fname, path) != 0) {
412 /* Returns 0 on successful rename, 1 if we successfully copied the file
413 * across filesystems, -2 if copy_file() failed, and -1 on other errors.
414 * If partialptr is not NULL and we need to do a copy, copy the file into
415 * the active partial-dir instead of over the destination file. */
416 int robust_rename(const char *from, const char *to, const char *partialptr,
422 if (do_rename(from, to) == 0)
428 if (robust_unlink(to) != 0) {
437 if (!handle_partial_dir(partialptr,PDIR_CREATE))
441 if (copy_file(from, to, -1, mode, 0) != 0)
452 static pid_t all_pids[10];
455 /** Fork and record the pid of the child. **/
458 pid_t newpid = fork();
460 if (newpid != 0 && newpid != -1) {
461 all_pids[num_pids++] = newpid;
469 * @todo It would be kind of nice to make sure that they are actually
470 * all our children before we kill them, because their pids may have
471 * been recycled by some other process. Perhaps when we wait for a
472 * child, we should remove it from this array. Alternatively we could
473 * perhaps use process groups, but I think that would not work on
474 * ancient Unix versions that don't support them.
476 void kill_all(int sig)
480 for (i = 0; i < num_pids; i++) {
481 /* Let's just be a little careful where we
482 * point that gun, hey? See kill(2) for the
483 * magic caused by negative values. */
484 pid_t p = all_pids[i];
495 /** Turn a user name into a uid */
496 int name_to_uid(const char *name, uid_t *uid_p)
501 if (!(pass = getpwnam(name)))
503 *uid_p = pass->pw_uid;
507 /** Turn a group name into a gid */
508 int name_to_gid(const char *name, gid_t *gid_p)
513 if (!(grp = getgrnam(name)))
515 *gid_p = grp->gr_gid;
519 /** Lock a byte range in a open file */
520 int lock_range(int fd, int offset, int len)
524 lock.l_type = F_WRLCK;
525 lock.l_whence = SEEK_SET;
526 lock.l_start = offset;
530 return fcntl(fd,F_SETLK,&lock) == 0;
533 #define ENSURE_MEMSPACE(buf, type, sz, req) \
534 if ((req) > sz && !(buf = realloc_array(buf, type, sz = MAX(sz * 2, req)))) \
535 out_of_memory("glob_expand")
537 static inline void call_glob_match(const char *name, int len, int from_glob,
538 char *arg, int abpos, int fbpos);
540 static struct glob_data {
541 char *arg_buf, *filt_buf, **argv;
542 int absize, fbsize, maxargs, argc;
545 static void glob_match(char *arg, int abpos, int fbpos)
550 while (*arg == '.' && arg[1] == '/') {
552 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, glob.absize);
553 memcpy(glob.filt_buf, glob.arg_buf, abpos + 1);
556 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + 3);
557 glob.arg_buf[abpos++] = *arg++;
558 glob.arg_buf[abpos++] = *arg++;
559 glob.arg_buf[abpos] = '\0';
561 if ((slash = strchr(arg, '/')) != NULL) {
566 if (strpbrk(arg, "*?[")) {
570 if (!(d = opendir(abpos ? glob.arg_buf : ".")))
572 while ((di = readdir(d)) != NULL) {
573 char *dname = d_name(di);
574 if (dname[0] == '.' && (dname[1] == '\0'
575 || (dname[1] == '.' && dname[2] == '\0')))
577 if (!wildmatch(arg, dname))
579 call_glob_match(dname, strlen(dname), 1,
580 slash ? arg + len + 1 : NULL,
585 call_glob_match(arg, len, 0,
586 slash ? arg + len + 1 : NULL,
593 static inline void call_glob_match(const char *name, int len, int from_glob,
594 char *arg, int abpos, int fbpos)
598 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, abpos + len + 2);
599 memcpy(glob.arg_buf + abpos, name, len);
601 glob.arg_buf[abpos] = '\0';
604 ENSURE_MEMSPACE(glob.filt_buf, char, glob.fbsize, fbpos + len + 2);
605 memcpy(glob.filt_buf + fbpos, name, len);
607 glob.filt_buf[fbpos] = '\0';
608 use_buf = glob.filt_buf;
610 use_buf = glob.arg_buf;
612 if (from_glob || (arg && len)) {
616 if (do_stat(glob.arg_buf, &st) != 0)
618 is_dir = S_ISDIR(st.st_mode) != 0;
622 if (daemon_filter_list.head
623 && check_filter(&daemon_filter_list, FLOG, use_buf, is_dir) < 0)
628 glob.arg_buf[abpos++] = '/';
629 glob.arg_buf[abpos] = '\0';
631 glob.filt_buf[fbpos++] = '/';
632 glob.filt_buf[fbpos] = '\0';
634 glob_match(arg, abpos, fbpos);
636 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
637 if (!(glob.argv[glob.argc++] = strdup(glob.arg_buf)))
638 out_of_memory("glob_match");
642 /* This routine performs wild-card expansion of the pathname in "arg". Any
643 * daemon-excluded files/dirs will not be matched by the wildcards. Returns 0
644 * if a wild-card string is the only returned item (due to matching nothing). */
645 int glob_expand(const char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
654 memset(&glob, 0, sizeof glob);
659 s = sanitize_path(NULL, arg, "", 0, SP_KEEP_DOT_DIRS);
663 out_of_memory("glob_expand");
664 clean_fname(s, CFN_KEEP_DOT_DIRS
665 | CFN_KEEP_TRAILING_SLASH
666 | CFN_COLLAPSE_DOT_DOT_DIRS);
669 ENSURE_MEMSPACE(glob.arg_buf, char, glob.absize, MAXPATHLEN);
670 *glob.arg_buf = '\0';
672 glob.argc = save_argc = *argc_p;
674 glob.maxargs = *maxargs_p;
676 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, 100);
678 glob_match(s, 0, -1);
680 /* The arg didn't match anything, so add the failed arg to the list. */
681 if (glob.argc == save_argc) {
682 ENSURE_MEMSPACE(glob.argv, char *, glob.maxargs, glob.argc + 1);
683 glob.argv[glob.argc++] = s;
690 *maxargs_p = glob.maxargs;
697 /* This routine is only used in daemon mode. */
698 void glob_expand_module(char *base1, char *arg, char ***argv_p, int *argc_p, int *maxargs_p)
702 int base_len = strlen(base);
707 if (strncmp(arg, base, base_len) == 0)
710 if (!(arg = strdup(arg)))
711 out_of_memory("glob_expand_module");
713 if (asprintf(&base," %s/", base1) <= 0)
714 out_of_memory("glob_expand_module");
717 for (s = arg; *s; s = p + base_len) {
718 if ((p = strstr(s, base)) != NULL)
719 *p = '\0'; /* split it at this point */
720 glob_expand(s, argv_p, argc_p, maxargs_p);
730 * Convert a string to lower case
732 void strlower(char *s)
741 /* Join strings p1 & p2 into "dest" with a guaranteed '/' between them. (If
742 * p1 ends with a '/', no extra '/' is inserted.) Returns the length of both
743 * strings + 1 (if '/' was inserted), regardless of whether the null-terminated
744 * string fits into destsize. */
745 size_t pathjoin(char *dest, size_t destsize, const char *p1, const char *p2)
747 size_t len = strlcpy(dest, p1, destsize);
748 if (len < destsize - 1) {
749 if (!len || dest[len-1] != '/')
751 if (len < destsize - 1)
752 len += strlcpy(dest + len, p2, destsize - len);
759 len += strlen(p2) + 1; /* Assume we'd insert a '/'. */
763 /* Join any number of strings together, putting them in "dest". The return
764 * value is the length of all the strings, regardless of whether the null-
765 * terminated whole fits in destsize. Your list of string pointers must end
766 * with a NULL to indicate the end of the list. */
767 size_t stringjoin(char *dest, size_t destsize, ...)
773 va_start(ap, destsize);
775 if (!(src = va_arg(ap, const char *)))
782 memcpy(dest, src, len);
793 int count_dir_elements(const char *p)
795 int cnt = 0, new_component = 1;
798 new_component = (*p != '.' || (p[1] != '/' && p[1] != '\0'));
799 else if (new_component) {
807 /* Turns multiple adjacent slashes into a single slash, drops all leading or
808 * interior "." elements unless CFN_KEEP_DOT_DIRS is flagged. Will also drop
809 * a trailing '.' after a '/' if CFN_DROP_TRAILING_DOT_DIR is flagged, removes
810 * a trailing slash (perhaps after removing the aforementioned dot) unless
811 * CFN_KEEP_TRAILING_SLASH is flagged, and will also collapse ".." elements
812 * (except at the start) if CFN_COLLAPSE_DOT_DOT_DIRS is flagged. If the
813 * resulting name would be empty, returns ".". */
814 unsigned int clean_fname(char *name, int flags)
816 char *limit = name - 1, *t = name, *f = name;
822 if ((anchored = *f == '/') != 0)
824 else if (flags & CFN_KEEP_DOT_DIRS && *f == '.' && f[1] == '/') {
829 /* discard extra slashes */
835 /* discard interior "." dirs */
836 if (f[1] == '/' && !(flags & CFN_KEEP_DOT_DIRS)) {
840 if (f[1] == '\0' && flags & CFN_DROP_TRAILING_DOT_DIR)
842 /* collapse ".." dirs */
843 if (flags & CFN_COLLAPSE_DOT_DOT_DIRS
844 && f[1] == '.' && (f[2] == '/' || !f[2])) {
846 if (s == name && anchored) {
850 while (s > limit && *--s != '/') {}
851 if (s != t - 1 && (s < name || *s == '/')) {
859 while (*f && (*t++ = *f++) != '/') {}
862 if (t > name+anchored && t[-1] == '/' && !(flags & CFN_KEEP_TRAILING_SLASH))
871 /* Make path appear as if a chroot had occurred. This handles a leading
872 * "/" (either removing it or expanding it) and any leading or embedded
873 * ".." components that attempt to escape past the module's top dir.
875 * If dest is NULL, a buffer is allocated to hold the result. It is legal
876 * to call with the dest and the path (p) pointing to the same buffer, but
877 * rootdir will be ignored to avoid expansion of the string.
879 * The rootdir string contains a value to use in place of a leading slash.
880 * Specify NULL to get the default of "module_dir".
882 * The depth var is a count of how many '..'s to allow at the start of the
885 * We also clean the path in a manner similar to clean_fname() but with a
888 * Turns multiple adjacent slashes into a single slash, gets rid of "." dir
889 * elements (INCLUDING a trailing dot dir), PRESERVES a trailing slash, and
890 * ALWAYS collapses ".." elements (except for those at the start of the
891 * string up to "depth" deep). If the resulting name would be empty,
892 * change it into a ".". */
893 char *sanitize_path(char *dest, const char *p, const char *rootdir, int depth,
897 int rlen = 0, drop_dot_dirs = !relative_paths || !(flags & SP_KEEP_DOT_DIRS);
900 int plen = strlen(p);
903 rootdir = module_dir;
904 rlen = strlen(rootdir);
909 if (rlen + plen + 1 >= MAXPATHLEN)
911 } else if (!(dest = new_array(char, rlen + plen + 1)))
912 out_of_memory("sanitize_path");
914 memcpy(dest, rootdir, rlen);
921 while (*p == '.' && p[1] == '/')
925 start = sanp = dest + rlen;
926 /* This loop iterates once per filename component in p, pointing at
927 * the start of the name (past any prior slash) for each iteration. */
929 /* discard leading or extra slashes */
935 if (*p == '.' && (p[1] == '/' || p[1] == '\0')) {
936 /* skip "." component */
941 if (*p == '.' && p[1] == '.' && (p[2] == '/' || p[2] == '\0')) {
942 /* ".." component followed by slash or end */
943 if (depth <= 0 || sanp != start) {
946 /* back up sanp one level */
947 --sanp; /* now pointing at slash */
948 while (sanp > start && sanp[-1] != '/')
953 /* allow depth levels of .. at the beginning */
955 /* move the virtual beginning to leave the .. alone */
958 /* copy one component through next slash */
959 while (*p && (*sanp++ = *p++) != '/') {}
962 /* ended up with nothing, so put in "." component */
970 /* Like chdir(), but it keeps track of the current directory (in the
971 * global "curr_dir"), and ensures that the path size doesn't overflow.
972 * Also cleans the path using the clean_fname() function. */
973 int change_dir(const char *dir, int set_path_only)
975 static int initialised;
980 getcwd(curr_dir, sizeof curr_dir - 1);
981 curr_dir_len = strlen(curr_dir);
984 if (!dir) /* this call was probably just to initialize */
988 if (len == 1 && *dir == '.')
992 if (len >= sizeof curr_dir) {
993 errno = ENAMETOOLONG;
996 if (!set_path_only && chdir(dir))
998 memcpy(curr_dir, dir, len + 1);
1000 if (curr_dir_len + 1 + len >= sizeof curr_dir) {
1001 errno = ENAMETOOLONG;
1004 curr_dir[curr_dir_len] = '/';
1005 memcpy(curr_dir + curr_dir_len + 1, dir, len + 1);
1007 if (!set_path_only && chdir(curr_dir)) {
1008 curr_dir[curr_dir_len] = '\0';
1013 curr_dir_len = clean_fname(curr_dir, CFN_COLLAPSE_DOT_DOT_DIRS);
1014 if (sanitize_paths) {
1015 if (module_dirlen > curr_dir_len)
1016 module_dirlen = curr_dir_len;
1017 curr_dir_depth = count_dir_elements(curr_dir + module_dirlen);
1020 if (DEBUG_GTE(CHDIR, 1) && !set_path_only)
1021 rprintf(FINFO, "[%s] change_dir(%s)\n", who_am_i(), curr_dir);
1027 * Return a quoted string with the full pathname of the indicated filename.
1028 * The string " (in MODNAME)" may also be appended. The returned pointer
1029 * remains valid until the next time full_fname() is called.
1031 char *full_fname(const char *fn)
1033 static char *result = NULL;
1043 p1 = curr_dir + module_dirlen;
1044 for (p2 = p1; *p2 == '/'; p2++) {}
1048 if (module_id >= 0) {
1050 m2 = lp_name(module_id);
1055 if (asprintf(&result, "\"%s%s%s\"%s%s%s", p1, p2, fn, m1, m2, m3) <= 0)
1056 out_of_memory("full_fname");
1061 static char partial_fname[MAXPATHLEN];
1063 char *partial_dir_fname(const char *fname)
1065 char *t = partial_fname;
1066 int sz = sizeof partial_fname;
1069 if ((fn = strrchr(fname, '/')) != NULL) {
1071 if (*partial_dir != '/') {
1072 int len = fn - fname;
1073 strncpy(t, fname, len); /* safe */
1079 if ((int)pathjoin(t, sz, partial_dir, fn) >= sz)
1081 if (daemon_filter_list.head) {
1082 t = strrchr(partial_fname, '/');
1084 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 1) < 0)
1087 if (check_filter(&daemon_filter_list, FLOG, partial_fname, 0) < 0)
1091 return partial_fname;
1094 /* If no --partial-dir option was specified, we don't need to do anything
1095 * (the partial-dir is essentially '.'), so just return success. */
1096 int handle_partial_dir(const char *fname, int create)
1100 if (fname != partial_fname)
1102 if (!create && *partial_dir == '/')
1104 if (!(fn = strrchr(partial_fname, '/')))
1108 dir = partial_fname;
1111 int statret = do_lstat(dir, &st);
1112 if (statret == 0 && !S_ISDIR(st.st_mode)) {
1113 if (do_unlink(dir) < 0) {
1119 if (statret < 0 && do_mkdir(dir, 0700) < 0) {
1131 * Determine if a symlink points outside the current directory tree.
1132 * This is considered "unsafe" because e.g. when mirroring somebody
1133 * else's machine it might allow them to establish a symlink to
1134 * /etc/passwd, and then read it through a web server.
1136 * Null symlinks and absolute symlinks are always unsafe.
1138 * Basically here we are concerned with symlinks whose target contains
1139 * "..", because this might cause us to walk back up out of the
1140 * transferred directory. We are not allowed to go back up and
1143 * @param dest Target of the symlink in question.
1145 * @param src Top source directory currently applicable. Basically this
1146 * is the first parameter to rsync in a simple invocation, but it's
1147 * modified by flist.c in slightly complex ways.
1149 * @retval True if unsafe
1150 * @retval False is unsafe
1154 int unsafe_symlink(const char *dest, const char *src)
1156 const char *name, *slash;
1159 /* all absolute and null symlinks are unsafe */
1160 if (!dest || !*dest || *dest == '/')
1163 /* find out what our safety margin is */
1164 for (name = src; (slash = strchr(name, '/')) != 0; name = slash+1) {
1165 if (strncmp(name, "../", 3) == 0) {
1167 } else if (strncmp(name, "./", 2) == 0) {
1173 if (strcmp(name, "..") == 0)
1176 for (name = dest; (slash = strchr(name, '/')) != 0; name = slash+1) {
1177 if (strncmp(name, "../", 3) == 0) {
1178 /* if at any point we go outside the current directory
1179 then stop - it is unsafe */
1182 } else if (strncmp(name, "./", 2) == 0) {
1188 if (strcmp(name, "..") == 0)
1194 /* Return the date and time as a string. Some callers tweak returned buf. */
1195 char *timestring(time_t t)
1197 static char TimeBuf[200];
1198 struct tm *tm = localtime(&t);
1201 #ifdef HAVE_STRFTIME
1202 strftime(TimeBuf, sizeof TimeBuf - 1, "%Y/%m/%d %H:%M:%S", tm);
1204 strlcpy(TimeBuf, asctime(tm), sizeof TimeBuf);
1207 if ((p = strchr(TimeBuf, '\n')) != NULL)
1214 * Sleep for a specified number of milliseconds.
1216 * Always returns TRUE. (In the future it might return FALSE if
1222 struct timeval tval, t1, t2;
1224 gettimeofday(&t1, NULL);
1227 tval.tv_sec = (t-tdiff)/1000;
1228 tval.tv_usec = 1000*((t-tdiff)%1000);
1231 select(0,NULL,NULL, NULL, &tval);
1233 gettimeofday(&t2, NULL);
1234 tdiff = (t2.tv_sec - t1.tv_sec)*1000 +
1235 (t2.tv_usec - t1.tv_usec)/1000;
1241 /* Determine if two time_t values are equivalent (either exact, or in
1242 * the modification timestamp window established by --modify-window).
1244 * @retval 0 if the times should be treated as the same
1246 * @retval +1 if the first is later
1248 * @retval -1 if the 2nd is later
1250 int cmp_time(time_t file1, time_t file2)
1252 if (file2 > file1) {
1253 if (file2 - file1 <= modify_window)
1257 if (file1 - file2 <= modify_window)
1267 This routine is a trick to immediately catch errors when debugging
1268 with insure. A xterm with a gdb is popped up when insure catches
1269 a error. It is Linux specific.
1271 int _Insure_trap_error(int a1, int a2, int a3, int a4, int a5, int a6)
1277 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'",
1278 getpid(), getpid(), getpid());
1282 h = dlopen("/usr/local/parasoft/insure++lite/lib.linux2/libinsure.so", RTLD_LAZY);
1283 fn = dlsym(h, "_Insure_trap_error");
1286 ret = fn(a1, a2, a3, a4, a5, a6);
1296 #define MALLOC_MAX 0x40000000
1298 void *_new_array(unsigned long num, unsigned int size, int use_calloc)
1300 if (num >= MALLOC_MAX/size)
1302 return use_calloc ? calloc(num, size) : malloc(num * size);
1305 void *_realloc_array(void *ptr, unsigned int size, size_t num)
1307 if (num >= MALLOC_MAX/size)
1310 return malloc(size * num);
1311 return realloc(ptr, size * num);
1314 /* Take a filename and filename length and return the most significant
1315 * filename suffix we can find. This ignores suffixes such as "~",
1316 * ".bak", ".orig", ".~1~", etc. */
1317 const char *find_filename_suffix(const char *fn, int fn_len, int *len_ptr)
1319 const char *suf, *s;
1323 /* One or more dots at the start aren't a suffix. */
1324 while (fn_len && *fn == '.') fn++, fn_len--;
1326 /* Ignore the ~ in a "foo~" filename. */
1327 if (fn_len > 1 && fn[fn_len-1] == '~')
1328 fn_len--, had_tilde = True;
1332 /* Assume we don't find an suffix. */
1336 /* Find the last significant suffix. */
1337 for (s = fn + fn_len; fn_len > 1; ) {
1338 while (*--s != '.' && s != fn) {}
1341 s_len = fn_len - (s - fn);
1344 if (strcmp(s+1, "bak") == 0
1345 || strcmp(s+1, "old") == 0)
1347 } else if (s_len == 5) {
1348 if (strcmp(s+1, "orig") == 0)
1350 } else if (s_len > 2 && had_tilde
1351 && s[1] == '~' && isDigit(s + 2))
1357 /* Determine if the suffix is all digits. */
1358 for (s++, s_len--; s_len > 0; s++, s_len--) {
1362 /* An all-digit suffix may not be that signficant. */
1369 /* This is an implementation of the Levenshtein distance algorithm. It
1370 * was implemented to avoid needing a two-dimensional matrix (to save
1371 * memory). It was also tweaked to try to factor in the ASCII distance
1372 * between changed characters as a minor distance quantity. The normal
1373 * Levenshtein units of distance (each signifying a single change between
1374 * the two strings) are defined as a "UNIT". */
1376 #define UNIT (1 << 16)
1378 uint32 fuzzy_distance(const char *s1, int len1, const char *s2, int len2)
1380 uint32 a[MAXPATHLEN], diag, above, left, diag_inc, above_inc, left_inc;
1384 if (!len1 || !len2) {
1389 for (i1 = 0, cost = 0; i1 < len1; i1++)
1391 return (int32)len1 * UNIT + cost;
1394 for (i2 = 0; i2 < len2; i2++)
1395 a[i2] = (i2+1) * UNIT;
1397 for (i1 = 0; i1 < len1; i1++) {
1399 above = (i1+1) * UNIT;
1400 for (i2 = 0; i2 < len2; i2++) {
1402 if ((cost = *((uchar*)s1+i1) - *((uchar*)s2+i2)) != 0) {
1408 diag_inc = diag + cost;
1409 left_inc = left + UNIT + *((uchar*)s1+i1);
1410 above_inc = above + UNIT + *((uchar*)s2+i2);
1411 a[i2] = above = left < above
1412 ? (left_inc < diag_inc ? left_inc : diag_inc)
1413 : (above_inc < diag_inc ? above_inc : diag_inc);
1421 #define BB_SLOT_SIZE (16*1024) /* Desired size in bytes */
1422 #define BB_PER_SLOT_BITS (BB_SLOT_SIZE * 8) /* Number of bits per slot */
1423 #define BB_PER_SLOT_INTS (BB_SLOT_SIZE / 4) /* Number of int32s per slot */
1430 struct bitbag *bitbag_create(int max_ndx)
1432 struct bitbag *bb = new(struct bitbag);
1433 bb->slot_cnt = (max_ndx + BB_PER_SLOT_BITS - 1) / BB_PER_SLOT_BITS;
1435 if (!(bb->bits = (uint32**)calloc(bb->slot_cnt, sizeof (uint32*))))
1436 out_of_memory("bitbag_create");
1441 void bitbag_set_bit(struct bitbag *bb, int ndx)
1443 int slot = ndx / BB_PER_SLOT_BITS;
1444 ndx %= BB_PER_SLOT_BITS;
1446 if (!bb->bits[slot]) {
1447 if (!(bb->bits[slot] = (uint32*)calloc(BB_PER_SLOT_INTS, 4)))
1448 out_of_memory("bitbag_set_bit");
1451 bb->bits[slot][ndx/32] |= 1u << (ndx % 32);
1454 #if 0 /* not needed yet */
1455 void bitbag_clear_bit(struct bitbag *bb, int ndx)
1457 int slot = ndx / BB_PER_SLOT_BITS;
1458 ndx %= BB_PER_SLOT_BITS;
1460 if (!bb->bits[slot])
1463 bb->bits[slot][ndx/32] &= ~(1u << (ndx % 32));
1466 int bitbag_check_bit(struct bitbag *bb, int ndx)
1468 int slot = ndx / BB_PER_SLOT_BITS;
1469 ndx %= BB_PER_SLOT_BITS;
1471 if (!bb->bits[slot])
1474 return bb->bits[slot][ndx/32] & (1u << (ndx % 32)) ? 1 : 0;
1478 /* Call this with -1 to start checking from 0. Returns -1 at the end. */
1479 int bitbag_next_bit(struct bitbag *bb, int after)
1482 int i, ndx = after + 1;
1483 int slot = ndx / BB_PER_SLOT_BITS;
1484 ndx %= BB_PER_SLOT_BITS;
1486 mask = (1u << (ndx % 32)) - 1;
1487 for (i = ndx / 32; slot < bb->slot_cnt; slot++, i = mask = 0) {
1488 if (!bb->bits[slot])
1490 for ( ; i < BB_PER_SLOT_INTS; i++, mask = 0) {
1491 if (!(bits = bb->bits[slot][i] & ~mask))
1493 /* The xor magic figures out the lowest enabled bit in
1494 * bits, and the switch quickly computes log2(bit). */
1495 switch (bits ^ (bits & (bits-1))) {
1496 #define LOG2(n) case 1u << n: return slot*BB_PER_SLOT_BITS + i*32 + n
1497 LOG2(0); LOG2(1); LOG2(2); LOG2(3);
1498 LOG2(4); LOG2(5); LOG2(6); LOG2(7);
1499 LOG2(8); LOG2(9); LOG2(10); LOG2(11);
1500 LOG2(12); LOG2(13); LOG2(14); LOG2(15);
1501 LOG2(16); LOG2(17); LOG2(18); LOG2(19);
1502 LOG2(20); LOG2(21); LOG2(22); LOG2(23);
1503 LOG2(24); LOG2(25); LOG2(26); LOG2(27);
1504 LOG2(28); LOG2(29); LOG2(30); LOG2(31);
1506 return -1; /* impossible... */
1513 void *expand_item_list(item_list *lp, size_t item_size,
1514 const char *desc, int incr)
1516 /* First time through, 0 <= 0, so list is expanded. */
1517 if (lp->malloced <= lp->count) {
1519 size_t new_size = lp->malloced;
1521 new_size += -incr; /* increase slowly */
1522 else if (new_size < (size_t)incr)
1526 if (new_size < lp->malloced)
1527 overflow_exit("expand_item_list");
1528 /* Using _realloc_array() lets us pass the size, not a type. */
1529 new_ptr = _realloc_array(lp->items, item_size, new_size);
1530 if (DEBUG_GTE(FLIST, 3)) {
1531 rprintf(FINFO, "[%s] expand %s to %s bytes, did%s move\n",
1532 who_am_i(), desc, big_num(new_size * item_size),
1533 new_ptr == lp->items ? " not" : "");
1536 out_of_memory("expand_item_list");
1538 lp->items = new_ptr;
1539 lp->malloced = new_size;
1541 return (char*)lp->items + (lp->count++ * item_size);