X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/aadc84d359307e15115b5822f5d16d7faad133c1..13710874ce907cd9405f83814cbebbe73f884e2e:/hlink.c diff --git a/hlink.c b/hlink.c index 7fc92ac7..6dde2cc0 100644 --- a/hlink.c +++ b/hlink.c @@ -4,11 +4,11 @@ * Copyright (C) 1996 Andrew Tridgell * Copyright (C) 1996 Paul Mackerras * Copyright (C) 2002 Martin Pool - * Copyright (C) 2004, 2005, 2006 Wayne Davison + * 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 2 of the License, or + * 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, @@ -17,117 +17,200 @@ * 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., - * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA. + * with this program; if not, visit the http://fsf.org website. */ #include "rsync.h" 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 char *basis_dir[]; -extern struct file_list *the_file_list; +extern struct file_list *cur_flist; +#ifdef ICONV_OPTION +extern int ic_ndx; +#endif #ifdef SUPPORT_HARD_LINKS -alloc_pool_t hlink_pool; +/* 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; -#define FPTR(i) (the_file_list->files[i]) -#define LINKED(i1,i2) ((i1)->dev == (i2)->dev && (i1)->ino == (i2)->ino) +static struct file_list *hlink_flist; void init_hard_links(void) { - if (!(hlink_pool = pool_create(HLINK_EXTENT, sizeof (struct idev), - out_of_memory, POOL_INTERN))) - out_of_memory("init_hard_links"); + if (am_sender || protocol_version < 30) + dev_tbl = hashtable_create(16, SIZEOF_INT64 == 8); + else if (inc_recurse) + prior_hlinks = hashtable_create(1024, 0); } -static int hlink_compare(int *int1, int *int2) +struct ht_int64_node *idev_find(int64 dev, int64 ino) { - struct file_struct *f1 = FPTR(*int1); - struct file_struct *f2 = FPTR(*int2); - struct idev *i1 = F_HL_IDEV(f1); - struct idev *i2 = F_HL_IDEV(f2); + 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 (i1->dev != i2->dev) - return i1->dev > i2->dev ? 1 : -1; + return hashtable_find(tbl, ino, 1); +} - if (i1->ino != i2->ino) - return i1->ino > i2->ino ? 1 : -1; +void idev_destroy(void) +{ + int i; + + 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); + } - return f_name_cmp(f1, f2); + hashtable_destroy(dev_tbl); } -/* Analyze the dev+inode data 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(void) +static int hlink_compare_gnum(int *int1, int *int2) { - int32 from, prev, *ndx_list; - struct file_struct *file, *file_next; - struct idev *idev, *idev_next; - int i, ndx_count = 0; + 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); - if (!(ndx_list = new_array(int32, the_file_list->count))) - out_of_memory("match_hard_links"); + if (gnum1 != gnum2) + return gnum1 > gnum2 ? 1 : -1; - for (i = 0; i < the_file_list->count; i++) { - if (F_IS_HLINKED(FPTR(i))) - ndx_list[ndx_count++] = i; - } + return *int1 > *int2 ? 1 : -1; +} - if (!ndx_count) { - free(ndx_list); - return; - } +static void match_gnums(int32 *ndx_list, int ndx_count) +{ + 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); + (int (*)()) hlink_compare_gnum); for (from = 0; from < ndx_count; from++) { - for (file = FPTR(ndx_list[from]), idev = F_HL_IDEV(file), prev = -1; - from < ndx_count-1; - file = file_next, idev = idev_next, prev = ndx_list[from++]) - { - file_next = FPTR(ndx_list[from+1]); - idev_next = F_HL_IDEV(file_next); - if (!LINKED(idev, idev_next)) - break; - pool_free(hlink_pool, 0, idev); - if (prev < 0) + 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; - F_HL_PREV(file) = prev; + 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 { + file->flags |= FLAG_HLINK_FIRST; + prev = -1; } - pool_free(hlink_pool, 0, idev); - if (prev < 0) - file->flags &= ~FLAG_HLINKED; - else { - file->flags |= FLAG_HLINK_LAST; + 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. */ +#ifdef ICONV_OPTION + if (ic_ndx) + prev = F_NDX(file); + else +#endif + 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; + } + + file->flags |= FLAG_HLINK_LAST; + F_HL_PREV(file) = prev; + if (inc_recurse && CVAL(node->data, 0) == 0) { +#ifdef ICONV_OPTION + if (ic_ndx) + prev = F_NDX(file); + else +#endif + prev = ndx_list[from] + hlink_flist->ndx_start; + SIVAL(node->data, 1, prev); } } +} + +/* 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) +{ + int i, ndx_count = 0; + int32 *ndx_list; + + if (!(ndx_list = new_array(int32, flist->used))) + out_of_memory("match_hard_links"); + + for (i = 0; i < flist->used; i++) { + if (F_IS_HLINKED(flist->sorted[i])) + ndx_list[ndx_count++] = i; + } + + hlink_flist = flist; + + if (ndx_count) + match_gnums(ndx_list, ndx_count); - pool_destroy(hlink_pool); free(ndx_list); + if (protocol_version < 30) + idev_destroy(); } static int maybe_hard_link(struct file_struct *file, int ndx, - const char *fname, int statret, STRUCT_STAT *stp, + const char *fname, int statret, stat_x *sxp, const char *oldname, STRUCT_STAT *old_stp, const char *realname, int itemizing, enum logcode code) { if (statret == 0) { - if (stp->st_dev == old_stp->st_dev - && stp->st_ino == old_stp->st_ino) { + if (sxp->st.st_dev == old_stp->st_dev + && sxp->st.st_ino == old_stp->st_ino) { if (itemizing) { - itemize(file, ndx, statret, stp, + itemize(fname, file, ndx, statret, sxp, ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0, ""); } @@ -136,7 +219,7 @@ static int maybe_hard_link(struct file_struct *file, int ndx, file->flags |= FLAG_HLINK_DONE; return 0; } - if (make_backups) { + if (make_backups > 0) { if (!make_backup(fname)) return -1; } else if (robust_unlink(fname)) { @@ -148,7 +231,7 @@ static int maybe_hard_link(struct file_struct *file, int ndx, if (hard_link_one(file, fname, oldname, 0)) { if (itemizing) { - itemize(file, ndx, statret, stp, + itemize(fname, file, ndx, statret, sxp, ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0, realname); } @@ -159,49 +242,84 @@ static int maybe_hard_link(struct file_struct *file, int ndx, return -1; } +/* 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; +} + /* 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, STRUCT_STAT *stp, int itemizing, + int statret, stat_x *sxp, int itemizing, enum logcode code) { STRUCT_STAT prev_st; - char prev_name[MAXPATHLEN], altbuf[MAXPATHLEN], *realname; - int alt_dest, prev_ndx = F_HL_PREV(file); - struct file_struct *prev_file = FPTR(prev_ndx); - - /* 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_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_SENT; - return 1; + 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; } - return 0; - } - /* There is a finished file to link with! */ - if (!(prev_file->flags & FLAG_HLINK_FIRST)) { - /* The previous previous will be marked with FIRST. */ - prev_ndx = F_HL_PREV(prev_file); - prev_file = FPTR(prev_ndx); - /* Update our previous pointer to point to the first. */ - F_HL_PREV(file) = prev_ndx; - } - alt_dest = F_HL_PREV(prev_file); /* alternate value when DONE && FIRST */ - if (alt_dest >= 0 && dry_run) { - pathjoin(prev_name, MAXPATHLEN, basis_dir[alt_dest], - f_name(prev_file, NULL)); - f_name(prev_file, altbuf); - realname = altbuf; - } else { - f_name(prev_file, prev_name); - realname = prev_name; + /* 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; + } + + 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) { @@ -213,18 +331,20 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, 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]; - STRUCT_STAT alt_st; + 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_st, 0) < 0) + if (link_stat(cmpbuf, &alt_sx.st, 0) < 0) continue; if (link_dest) { - if (prev_st.st_dev != alt_st.st_dev - || prev_st.st_ino != alt_st.st_ino) + if (prev_st.st_dev != alt_sx.st.st_dev + || prev_st.st_ino != alt_sx.st.st_ino) continue; statret = 1; - *stp = alt_st; if (verbose < 2 || !stdout_format_has_i) { itemizing = 0; code = FNONE; @@ -233,16 +353,32 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, } break; } - if (!unchanged_file(cmpbuf, file, &alt_st)) + if (!unchanged_file(cmpbuf, file, &alt_sx.st)) continue; statret = 1; - *stp = alt_st; - if (unchanged_attrs(file, &alt_st)) + 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; + } + } +#endif + } +#ifdef SUPPORT_ACLS + else if (preserve_acls) + free_acl(&alt_sx); +#endif } - if (maybe_hard_link(file, ndx, fname, statret, stp, prev_name, &prev_st, + if (maybe_hard_link(file, ndx, fname, statret, sxp, prev_name, &prev_st, realname, itemizing, code) < 0) return -1; @@ -273,13 +409,15 @@ int hard_link_one(struct file_struct *file, const char *fname, return 1; } -void finish_hard_link(struct file_struct *file, const char *fname, +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) { - STRUCT_STAT st, prev_st; + 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) { @@ -301,17 +439,41 @@ void finish_hard_link(struct file_struct *file, const char *fname, } else our_name = fname; +#ifdef SUPPORT_ACLS + prev_sx.acc_acl = prev_sx.def_acl = NULL; +#endif + while ((ndx = prev_ndx) >= 0) { - file = FPTR(ndx); + 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_st, 0); - if (maybe_hard_link(file, ndx, prev_name, prev_statret, &prev_st, - our_name, stp, fname, itemizing, code) < 0) + 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