/*
- Copyright (C) Andrew Tridgell 1996
- Copyright (C) Paul Mackerras 1996
- Copyright (C) 2002 by Martin Pool <mbp@samba.org>
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
-*/
+ * Routines to support hard-linking.
+ *
+ * Copyright (C) 1996 Andrew Tridgell
+ * Copyright (C) 1996 Paul Mackerras
+ * Copyright (C) 2002 Martin Pool <mbp@samba.org>
+ * Copyright (C) 2004-2007 Wayne Davison
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along
+ * with this program; if not, visit the http://fsf.org website.
+ */
#include "rsync.h"
-extern int dry_run;
extern int verbose;
+extern int dry_run;
+extern int am_sender;
+extern int inc_recurse;
+extern int do_xfers;
+extern int link_dest;
+extern int preserve_acls;
extern int make_backups;
+extern int protocol_version;
+extern int remove_source_files;
+extern int stdout_format_has_i;
+extern int maybe_ATTRS_REPORT;
+extern int unsort_ndx;
+extern char *basis_dir[];
+extern struct file_list *cur_flist;
+
+#ifdef SUPPORT_HARD_LINKS
+
+/* Starting with protocol 30, we use a simple hashtable on the sending side
+ * for hashing the st_dev and st_ino info. The receiving side gets told
+ * (via flags and a "group index") which items are hard-linked together, so
+ * we can avoid the pool of dev+inode data. For incremental recursion mode,
+ * the receiver will use a ndx hash to remember old pathnames. */
+
+static struct hashtable *dev_tbl;
+
+static struct hashtable *prior_hlinks;
+
+static struct file_list *hlink_flist;
+
+void init_hard_links(void)
+{
+ if (am_sender || protocol_version < 30)
+ dev_tbl = hashtable_create(16, SIZEOF_INT64 == 8);
+ else if (inc_recurse)
+ prior_hlinks = hashtable_create(1024, 0);
+}
-#if SUPPORT_HARD_LINKS
-static int hlink_compare(struct file_struct **file1, struct file_struct **file2)
+struct ht_int64_node *idev_find(int64 dev, int64 ino)
{
- struct file_struct *f1 = *file1;
- struct file_struct *f2 = *file2;
+ static struct ht_int64_node *dev_node = NULL;
+ struct hashtable *tbl;
+
+ if (!dev_node || dev_node->key != dev) {
+ /* We keep a separate hash table of inodes for every device. */
+ dev_node = hashtable_find(dev_tbl, dev, 1);
+ if (!(tbl = dev_node->data))
+ tbl = dev_node->data = hashtable_create(512, SIZEOF_INT64 == 8);
+ } else
+ tbl = dev_node->data;
- if (f1->F_DEV != f2->F_DEV)
- return (int) (f1->F_DEV > f2->F_DEV ? 1 : -1);
+ return hashtable_find(tbl, ino, 1);
+}
- if (f1->F_INODE != f2->F_INODE)
- return (int) (f1->F_INODE > f2->F_INODE ? 1 : -1);
+void idev_destroy(void)
+{
+ int i;
- return file_compare(file1, file2);
+ for (i = 0; i < dev_tbl->size; i++) {
+ struct ht_int32_node *node = HT_NODE(dev_tbl, dev_tbl->nodes, i);
+ if (node->data)
+ hashtable_destroy(node->data);
+ }
+
+ hashtable_destroy(dev_tbl);
}
-static struct file_struct **hlink_list;
-static int hlink_count;
+static int hlink_compare_gnum(int *int1, int *int2)
+{
+ struct file_struct *f1 = hlink_flist->sorted[*int1];
+ struct file_struct *f2 = hlink_flist->sorted[*int2];
+ int32 gnum1 = F_HL_GNUM(f1);
+ int32 gnum2 = F_HL_GNUM(f2);
-#define LINKED(p1,p2) ((p1)->F_DEV == (p2)->F_DEV \
- && (p1)->F_INODE == (p2)->F_INODE)
+ if (gnum1 != gnum2)
+ return gnum1 > gnum2 ? 1 : -1;
+
+ return *int1 > *int2 ? 1 : -1;
+}
-/* Analyze the data in the hlink_list[], remove items that aren't multiply
- * linked, and replace the dev+inode data with the hlindex+next linked list. */
-static void link_idev_data(struct file_list *flist)
+static void match_gnums(int32 *ndx_list, int ndx_count)
{
- struct file_struct *head;
- int from, to, start;
-
- alloc_pool_t hlink_pool;
- alloc_pool_t idev_pool = flist->hlink_pool;
-
- hlink_pool = pool_create(128 * 1024, sizeof (struct hlink),
- out_of_memory, POOL_INTERN);
-
- for (from = to = 0; from < hlink_count; from++) {
- start = from;
- head = hlink_list[start];
- while (from < hlink_count-1
- && LINKED(hlink_list[from], hlink_list[from+1])) {
- pool_free(idev_pool, 0, hlink_list[from]->link_u.idev);
- hlink_list[from]->link_u.links = pool_talloc(hlink_pool,
- struct hlink, 1, "hlink_list");
-
- hlink_list[from]->F_HLINDEX = to;
- hlink_list[from]->F_NEXT = hlink_list[from+1];
- from++;
- }
- if (from > start) {
- pool_free(idev_pool, 0, hlink_list[from]->link_u.idev);
- hlink_list[from]->link_u.links = pool_talloc(hlink_pool,
- struct hlink, 1, "hlink_list");
-
- hlink_list[from]->F_HLINDEX = to;
- hlink_list[from]->F_NEXT = head;
- hlink_list[from]->flags |= FLAG_HLINK_EOL;
- hlink_list[to++] = head;
+ int32 from, prev;
+ struct file_struct *file, *file_next;
+ struct ht_int32_node *node = NULL;
+ int32 gnum, gnum_next;
+
+ qsort(ndx_list, ndx_count, sizeof ndx_list[0],
+ (int (*)()) hlink_compare_gnum);
+
+ for (from = 0; from < ndx_count; from++) {
+ file = hlink_flist->sorted[ndx_list[from]];
+ gnum = F_HL_GNUM(file);
+ if (inc_recurse) {
+ node = hashtable_find(prior_hlinks, gnum, 1);
+ if (!node->data) {
+ node->data = new_array0(char, 5);
+ assert(gnum >= hlink_flist->ndx_start);
+ file->flags |= FLAG_HLINK_FIRST;
+ prev = -1;
+ } else if (CVAL(node->data, 0) == 0) {
+ struct file_list *flist;
+ struct file_struct *fp;
+ prev = IVAL(node->data, 1);
+ flist = flist_for_ndx(prev);
+ assert(flist != NULL);
+ fp = flist->files[prev - flist->ndx_start];
+ fp->flags &= ~FLAG_HLINK_LAST;
+ } else
+ prev = -1;
} else {
- pool_free(idev_pool, 0, head->link_u.idev);
- head->link_u.idev = NULL;
+ file->flags |= FLAG_HLINK_FIRST;
+ prev = -1;
+ }
+ for ( ; from < ndx_count-1; file = file_next, gnum = gnum_next, from++) { /*SHARED ITERATOR*/
+ file_next = hlink_flist->sorted[ndx_list[from+1]];
+ gnum_next = F_HL_GNUM(file_next);
+ if (gnum != gnum_next)
+ break;
+ F_HL_PREV(file) = prev;
+ /* The linked list must use raw ndx values. */
+ if (unsort_ndx)
+ prev = F_NDX(file);
+ else
+ prev = ndx_list[from] + hlink_flist->ndx_start;
+ }
+ if (prev < 0 && !inc_recurse) {
+ /* Disable hard-link bit and set DONE so that
+ * HLINK_BUMP()-dependent values are unaffected. */
+ file->flags &= ~(FLAG_HLINKED | FLAG_HLINK_FIRST);
+ file->flags |= FLAG_HLINK_DONE;
+ continue;
}
- }
- if (!to) {
- free(hlink_list);
- hlink_list = NULL;
- pool_destroy(hlink_pool);
- hlink_pool = NULL;
- } else {
- hlink_count = to;
- if (!(hlink_list = realloc_array(hlink_list,
- struct file_struct *, hlink_count)))
- out_of_memory("init_hard_links");
+ file->flags |= FLAG_HLINK_LAST;
+ F_HL_PREV(file) = prev;
+ if (inc_recurse && CVAL(node->data, 0) == 0) {
+ if (unsort_ndx)
+ prev = F_NDX(file);
+ else
+ prev = ndx_list[from] + hlink_flist->ndx_start;
+ SIVAL(node->data, 1, prev);
+ }
}
- flist->hlink_pool = hlink_pool;
- pool_destroy(idev_pool);
}
-#endif
-void init_hard_links(struct file_list *flist)
+/* Analyze the hard-links in the file-list by creating a list of all the
+ * items that have hlink data, sorting them, and matching up identical
+ * values into clusters. These will be a single linked list from last
+ * to first when we're done. */
+void match_hard_links(struct file_list *flist)
{
-#if SUPPORT_HARD_LINKS
- int i;
-
- if (flist->count < 2)
- return;
+ int i, ndx_count = 0;
+ int32 *ndx_list;
- if (hlink_list)
- free(hlink_list);
+ if (!(ndx_list = new_array(int32, flist->used)))
+ out_of_memory("match_hard_links");
- if (!(hlink_list = new_array(struct file_struct *, flist->count)))
- out_of_memory("init_hard_links");
-
- hlink_count = 0;
- for (i = 0; i < flist->count; i++) {
- if (flist->files[i]->link_u.idev)
- hlink_list[hlink_count++] = flist->files[i];
+ for (i = 0; i < flist->used; i++) {
+ if (F_IS_HLINKED(flist->sorted[i]))
+ ndx_list[ndx_count++] = i;
}
- qsort(hlink_list, hlink_count,
- sizeof hlink_list[0], (int (*)()) hlink_compare);
+ hlink_flist = flist;
- if (!hlink_count) {
- free(hlink_list);
- hlink_list = NULL;
- } else
- link_idev_data(flist);
-#endif
+ if (ndx_count)
+ match_gnums(ndx_list, ndx_count);
+
+ free(ndx_list);
+ if (protocol_version < 30)
+ idev_destroy();
}
-int hard_link_check(struct file_struct *file, int skip)
+static int maybe_hard_link(struct file_struct *file, int ndx,
+ const char *fname, int statret, stat_x *sxp,
+ const char *oldname, STRUCT_STAT *old_stp,
+ const char *realname, int itemizing, enum logcode code)
{
- if (!hlink_list || !file->link_u.links)
- return 0;
- if (skip && !(file->flags & FLAG_HLINK_EOL))
- hlink_list[file->F_HLINDEX] = file->F_NEXT;
- if (hlink_list[file->F_HLINDEX] != file) {
- if (verbose > 1) {
- rprintf(FINFO, "\"%s\" is a hard link\n",
- f_name(file));
+ if (statret == 0) {
+ if (sxp->st.st_dev == old_stp->st_dev
+ && sxp->st.st_ino == old_stp->st_ino) {
+ if (itemizing) {
+ itemize(fname, file, ndx, statret, sxp,
+ ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS,
+ 0, "");
+ }
+ if (verbose > 1 && maybe_ATTRS_REPORT)
+ rprintf(FCLIENT, "%s is uptodate\n", fname);
+ file->flags |= FLAG_HLINK_DONE;
+ return 0;
+ }
+ if (make_backups > 0) {
+ if (!make_backup(fname))
+ return -1;
+ } else if (robust_unlink(fname)) {
+ rsyserr(FERROR_XFER, errno, "unlink %s failed",
+ full_fname(fname));
+ return -1;
}
- return 1;
}
- return 0;
-}
-#if SUPPORT_HARD_LINKS
-static void hard_link_one(char *hlink1, char *hlink2)
-{
- if (do_link(hlink1, hlink2)) {
- if (verbose) {
- rsyserr(FINFO, errno, "link %s => %s failed",
- hlink2, hlink1);
+ if (hard_link_one(file, fname, oldname, 0)) {
+ if (itemizing) {
+ itemize(fname, file, ndx, statret, sxp,
+ ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0,
+ realname);
}
+ if (code != FNONE && verbose)
+ rprintf(code, "%s => %s\n", fname, realname);
+ return 0;
}
- else if (verbose)
- rprintf(FINFO, "%s => %s\n", hlink2, hlink1);
+ return -1;
}
-#endif
+/* Figure out if a prior entry is still there or if we just have a
+ * cached name for it. Never called with a FLAG_HLINK_FIRST entry. */
+static char *check_prior(int prev_ndx, int gnum, struct file_list **flist_p)
+{
+ struct file_list *flist = flist_for_ndx(prev_ndx);
+ struct ht_int32_node *node;
+
+ if (flist) {
+ *flist_p = flist;
+ return NULL;
+ }
+ node = hashtable_find(prior_hlinks, gnum, 0);
+ assert(node != NULL && node->data);
+ assert(CVAL(node->data, 0) != 0);
+ return node->data;
+}
-/**
- * Create any hard links in the global hlink_list. They were put
- * there by running init_hard_links on the filelist.
- **/
-void do_hard_links(void)
+/* Only called if FLAG_HLINKED is set and FLAG_HLINK_FIRST is not. Returns:
+ * 0 = process the file, 1 = skip the file, -1 = error occurred. */
+int hard_link_check(struct file_struct *file, int ndx, const char *fname,
+ int statret, stat_x *sxp, int itemizing,
+ enum logcode code)
{
-#if SUPPORT_HARD_LINKS
- struct file_struct *file, *first;
- char hlink1[MAXPATHLEN];
- char *hlink2;
- STRUCT_STAT st1, st2;
- int i;
+ STRUCT_STAT prev_st;
+ char namebuf[MAXPATHLEN], altbuf[MAXPATHLEN];
+ char *realname, *prev_name;
+ struct file_list *flist;
+ int gnum = inc_recurse ? F_HL_GNUM(file) : -1;
+ int prev_ndx = F_HL_PREV(file);
+
+ prev_name = realname = check_prior(prev_ndx, gnum, &flist);
+
+ if (!prev_name) {
+ struct file_struct *prev_file = flist->files[prev_ndx - flist->ndx_start];
+
+ /* Is the previous link is not complete yet? */
+ if (!(prev_file->flags & FLAG_HLINK_DONE)) {
+ /* Is the previous link being transferred? */
+ if (prev_file->flags & FLAG_FILE_SENT) {
+ /* Add ourselves to the list of files that will be
+ * updated when the transfer completes, and mark
+ * ourself as waiting for the transfer. */
+ F_HL_PREV(file) = F_HL_PREV(prev_file);
+ F_HL_PREV(prev_file) = ndx;
+ file->flags |= FLAG_FILE_SENT;
+ cur_flist->in_progress++;
+ return 1;
+ }
+ return 0;
+ }
- if (!hlink_list)
- return;
+ /* There is a finished file to link with! */
+ if (!(prev_file->flags & FLAG_HLINK_FIRST)) {
+ /* The previous previous is FIRST when prev is not. */
+ prev_ndx = F_HL_PREV(prev_file);
+ prev_name = realname = check_prior(prev_ndx, gnum, &flist);
+ /* Update our previous pointer to point to the FIRST. */
+ F_HL_PREV(file) = prev_ndx;
+ }
- for (i = 0; i < hlink_count; i++) {
- first = file = hlink_list[i];
- if (link_stat(f_name_to(first, hlink1), &st1, 0) < 0)
- continue;
- while ((file = file->F_NEXT) != first) {
- hlink2 = f_name(file);
- if (link_stat(hlink2, &st2, 0) == 0) {
- if (st2.st_dev == st1.st_dev
- && st2.st_ino == st1.st_ino)
- continue;
- if (make_backups) {
- if (!make_backup(hlink2))
- continue;
- } else if (robust_unlink(hlink2)) {
- if (verbose > 0) {
- rsyserr(FINFO, errno,
- "unlink %s failed",
- full_fname(hlink2));
- }
+ if (!prev_name) {
+ int alt_dest;
+
+ prev_file = flist->files[prev_ndx - flist->ndx_start];
+ /* F_HL_PREV() is alt_dest value when DONE && FIRST. */
+ alt_dest = F_HL_PREV(prev_file);
+
+ if (alt_dest >= 0 && dry_run) {
+ pathjoin(namebuf, MAXPATHLEN, basis_dir[alt_dest],
+ f_name(prev_file, NULL));
+ prev_name = namebuf;
+ realname = f_name(prev_file, altbuf);
+ } else {
+ prev_name = f_name(prev_file, namebuf);
+ realname = prev_name;
+ }
+ }
+ }
+
+ if (link_stat(prev_name, &prev_st, 0) < 0) {
+ rsyserr(FERROR_XFER, errno, "stat %s failed",
+ full_fname(prev_name));
+ return -1;
+ }
+
+ if (statret < 0 && basis_dir[0] != NULL) {
+ /* If we match an alt-dest item, we don't output this as a change. */
+ char cmpbuf[MAXPATHLEN];
+ stat_x alt_sx;
+ int j = 0;
+#ifdef SUPPORT_ACLS
+ alt_sx.acc_acl = alt_sx.def_acl = NULL;
+#endif
+ do {
+ pathjoin(cmpbuf, MAXPATHLEN, basis_dir[j], fname);
+ if (link_stat(cmpbuf, &alt_sx.st, 0) < 0)
+ continue;
+ if (link_dest) {
+ if (prev_st.st_dev != alt_sx.st.st_dev
+ || prev_st.st_ino != alt_sx.st.st_ino)
continue;
+ statret = 1;
+ if (stdout_format_has_i == 0
+ || (verbose < 2 && stdout_format_has_i < 2)) {
+ itemizing = 0;
+ code = FNONE;
+ if (verbose > 1 && maybe_ATTRS_REPORT)
+ rprintf(FCLIENT, "%s is uptodate\n", fname);
+ }
+ break;
+ }
+ if (!unchanged_file(cmpbuf, file, &alt_sx.st))
+ continue;
+ statret = 1;
+ if (unchanged_attrs(cmpbuf, file, &alt_sx))
+ break;
+ } while (basis_dir[++j] != NULL);
+ if (statret == 1) {
+ sxp->st = alt_sx.st;
+#ifdef SUPPORT_ACLS
+ if (preserve_acls && !S_ISLNK(file->mode)) {
+ if (!ACL_READY(*sxp))
+ get_acl(cmpbuf, sxp);
+ else {
+ sxp->acc_acl = alt_sx.acc_acl;
+ sxp->def_acl = alt_sx.def_acl;
}
}
- hard_link_one(hlink1, hlink2);
+#endif
+ }
+#ifdef SUPPORT_ACLS
+ else if (preserve_acls)
+ free_acl(&alt_sx);
+#endif
+ }
+
+ if (maybe_hard_link(file, ndx, fname, statret, sxp, prev_name, &prev_st,
+ realname, itemizing, code) < 0)
+ return -1;
+
+ if (remove_source_files == 1 && do_xfers)
+ send_msg_int(MSG_SUCCESS, ndx);
+
+ return 1;
+}
+
+int hard_link_one(struct file_struct *file, const char *fname,
+ const char *oldname, int terse)
+{
+ if (do_link(oldname, fname) < 0) {
+ enum logcode code;
+ if (terse) {
+ if (!verbose)
+ return -1;
+ code = FINFO;
+ } else
+ code = FERROR_XFER;
+ rsyserr(code, errno, "link %s => %s failed",
+ full_fname(fname), oldname);
+ return 0;
+ }
+
+ file->flags |= FLAG_HLINK_DONE;
+
+ return 1;
+}
+
+void finish_hard_link(struct file_struct *file, const char *fname, int fin_ndx,
+ STRUCT_STAT *stp, int itemizing, enum logcode code,
+ int alt_dest)
+{
+ stat_x prev_sx;
+ STRUCT_STAT st;
+ char alt_name[MAXPATHLEN], *prev_name;
+ const char *our_name;
+ struct file_list *flist;
+ int prev_statret, ndx, prev_ndx = F_HL_PREV(file);
+
+ if (stp == NULL && prev_ndx >= 0) {
+ if (link_stat(fname, &st, 0) < 0) {
+ rsyserr(FERROR_XFER, errno, "stat %s failed",
+ full_fname(fname));
+ return;
}
+ stp = &st;
}
+
+ /* FIRST combined with DONE means we were the first to get done. */
+ file->flags |= FLAG_HLINK_FIRST | FLAG_HLINK_DONE;
+ F_HL_PREV(file) = alt_dest;
+ if (alt_dest >= 0 && dry_run) {
+ pathjoin(alt_name, MAXPATHLEN, basis_dir[alt_dest],
+ f_name(file, NULL));
+ our_name = alt_name;
+ } else
+ our_name = fname;
+
+#ifdef SUPPORT_ACLS
+ prev_sx.acc_acl = prev_sx.def_acl = NULL;
+#endif
+
+ while ((ndx = prev_ndx) >= 0) {
+ int val;
+ flist = flist_for_ndx(ndx);
+ assert(flist != NULL);
+ file = flist->files[ndx - flist->ndx_start];
+ file->flags = (file->flags & ~FLAG_HLINK_FIRST) | FLAG_HLINK_DONE;
+ prev_ndx = F_HL_PREV(file);
+ F_HL_PREV(file) = fin_ndx;
+ prev_name = f_name(file, NULL);
+ prev_statret = link_stat(prev_name, &prev_sx.st, 0);
+ val = maybe_hard_link(file, ndx, prev_name, prev_statret, &prev_sx,
+ our_name, stp, fname, itemizing, code);
+ flist->in_progress--;
+#ifdef SUPPORT_ACLS
+ if (preserve_acls)
+ free_acl(&prev_sx);
#endif
+ if (val < 0)
+ continue;
+ if (remove_source_files == 1 && do_xfers)
+ send_msg_int(MSG_SUCCESS, ndx);
+ }
+
+ if (inc_recurse) {
+ int gnum = F_HL_GNUM(file);
+ struct ht_int32_node *node = hashtable_find(prior_hlinks, gnum, 0);
+ assert(node != NULL && node->data != NULL);
+ assert(CVAL(node->data, 0) == 0);
+ free(node->data);
+ if (!(node->data = strdup(our_name)))
+ out_of_memory("finish_hard_link");
+ }
}
+#endif
Matt McCutchen's Web Site / rsync / rsync.git / blobdiff