X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/c9b62cf375f393de076d0fc7a3c2748d581c54a2..aacd188034703acc9d4ab43704d627f5d48a7eb8:/hlink.c diff --git a/hlink.c b/hlink.c index 536b571f..5c61170e 100644 --- a/hlink.c +++ b/hlink.c @@ -22,7 +22,6 @@ #include "rsync.h" -extern int verbose; extern int dry_run; extern int list_only; extern int am_sender; @@ -36,8 +35,8 @@ 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; +extern char *basis_dir[MAX_BASIS_DIRS+1]; +extern struct file_list *cur_flist, *first_flist; #ifdef SUPPORT_HARD_LINKS @@ -69,8 +68,14 @@ struct ht_int64_node *idev_find(int64 dev, int64 ino) 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)) + if (!(tbl = dev_node->data)) { tbl = dev_node->data = hashtable_create(512, SIZEOF_INT64 == 8); + if (DEBUG_GTE(HLINK, 3)) { + rprintf(FINFO, + "[%s] created hashtable for dev %s\n", + who_am_i(), big_num(dev, 0)); + } + } } else tbl = dev_node->data; @@ -179,7 +184,7 @@ static void match_gnums(int32 *ndx_list, int ndx_count) * to first when we're done. */ void match_hard_links(struct file_list *flist) { - if (!list_only) { + if (!list_only && flist->used) { int i, ndx_count = 0; int32 *ndx_list; @@ -215,7 +220,7 @@ static int maybe_hard_link(struct file_struct *file, int ndx, ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0, ""); } - if (verbose > 1 && maybe_ATTRS_REPORT) + if (INFO_GTE(NAME, 2) && maybe_ATTRS_REPORT) rprintf(FCLIENT, "%s is uptodate\n", fname); file->flags |= FLAG_HLINK_DONE; return 0; @@ -236,7 +241,7 @@ static int maybe_hard_link(struct file_struct *file, int ndx, ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0, realname); } - if (code != FNONE && verbose) + if (code != FNONE && INFO_GTE(NAME, 1)) rprintf(code, "%s => %s\n", fname, realname); return 0; } @@ -249,17 +254,13 @@ static char *check_prior(struct file_struct *file, int gnum, int *prev_ndx_p, struct file_list **flist_p) { struct file_struct *fp; - struct file_list *flist; struct ht_int32_node *node; int prev_ndx = F_HL_PREV(file); while (1) { - if (prev_ndx < 0) { - *prev_ndx_p = prev_ndx; - *flist_p = NULL; - return NULL; - } - if ((flist = flist_for_ndx(prev_ndx)) == NULL) + struct file_list *flist; + if (prev_ndx < 0 + || (flist = flist_for_ndx(prev_ndx)) == NULL) break; fp = flist->files[prev_ndx - flist->ndx_start]; if (!(fp->flags & FLAG_SKIP_HLINK)) { @@ -270,20 +271,21 @@ static char *check_prior(struct file_struct *file, int gnum, F_HL_PREV(file) = prev_ndx = F_HL_PREV(fp); } - node = hashtable_find(prior_hlinks, gnum, 0); - assert(node != NULL && node->data); - - if (CVAL(node->data, 0) == 0) { + if (inc_recurse + && (node = hashtable_find(prior_hlinks, gnum, 0)) != NULL) { + assert(node->data != NULL); + if (CVAL(node->data, 0) != 0) { + *prev_ndx_p = -1; + *flist_p = NULL; + return node->data; + } /* The prior file must have been skipped. */ - F_HL_PREV(file) = prev_ndx = -1; - *prev_ndx_p = prev_ndx; - *flist_p = NULL; - return NULL; + F_HL_PREV(file) = -1; } - *prev_ndx_p = prev_ndx; - *flist_p = flist; - return node->data; + *prev_ndx_p = -1; + *flist_p = NULL; + return NULL; } /* Only called if FLAG_HLINKED is set and FLAG_HLINK_FIRST is not. Returns: @@ -307,6 +309,10 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, if (!flist) { /* The previous file was skipped, so this one is * treated as if it were the first in its group. */ + if (DEBUG_GTE(HLINK, 2)) { + rprintf(FINFO, "hlink for %d (%s,%d): virtual first\n", + ndx, f_name(file, NULL), gnum); + } return 0; } @@ -323,8 +329,16 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, F_HL_PREV(prev_file) = ndx; file->flags |= FLAG_FILE_SENT; cur_flist->in_progress++; + if (DEBUG_GTE(HLINK, 2)) { + rprintf(FINFO, "hlink for %d (%s,%d): waiting for %d\n", + ndx, f_name(file, NULL), gnum, F_HL_PREV(file)); + } return 1; } + if (DEBUG_GTE(HLINK, 2)) { + rprintf(FINFO, "hlink for %d (%s,%d): looking for a leader\n", + ndx, f_name(file, NULL), gnum); + } return 0; } @@ -332,7 +346,6 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, if (!(prev_file->flags & FLAG_HLINK_FIRST)) { /* The previous previous is FIRST when prev is not. */ prev_name = realname = check_prior(prev_file, gnum, &prev_ndx, &flist); - assert(prev_name != NULL || flist != NULL); /* Update our previous pointer to point to the FIRST. */ F_HL_PREV(file) = prev_ndx; } @@ -340,9 +353,14 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, if (!prev_name) { int alt_dest; + assert(flist != NULL); 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 (DEBUG_GTE(HLINK, 2)) { + rprintf(FINFO, "hlink for %d (%s,%d): found flist match (alt %d)\n", + ndx, f_name(file, NULL), gnum, alt_dest); + } if (alt_dest >= 0 && dry_run) { pathjoin(namebuf, MAXPATHLEN, basis_dir[alt_dest], @@ -356,6 +374,11 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, } } + if (DEBUG_GTE(HLINK, 2)) { + rprintf(FINFO, "hlink for %d (%s,%d): leader is %d (%s)\n", + ndx, f_name(file, NULL), gnum, prev_ndx, prev_name); + } + if (link_stat(prev_name, &prev_st, 0) < 0) { rsyserr(FERROR_XFER, errno, "stat %s failed", full_fname(prev_name)); @@ -380,10 +403,10 @@ int hard_link_check(struct file_struct *file, int ndx, const char *fname, continue; statret = 1; if (stdout_format_has_i == 0 - || (verbose < 2 && stdout_format_has_i < 2)) { + || (!INFO_GTE(NAME, 2) && stdout_format_has_i < 2)) { itemizing = 0; code = FNONE; - if (verbose > 1 && maybe_ATTRS_REPORT) + if (INFO_GTE(NAME, 2) && maybe_ATTRS_REPORT) rprintf(FCLIENT, "%s is uptodate\n", fname); } break; @@ -429,7 +452,7 @@ int hard_link_one(struct file_struct *file, const char *fname, if (do_link(oldname, fname) < 0) { enum logcode code; if (terse) { - if (!verbose) + if (!INFO_GTE(NAME, 1)) return 0; code = FINFO; } else @@ -450,7 +473,7 @@ void finish_hard_link(struct file_struct *file, const char *fname, int fin_ndx, { stat_x prev_sx; STRUCT_STAT st; - char alt_name[MAXPATHLEN], *prev_name; + char prev_name[MAXPATHLEN], alt_name[MAXPATHLEN]; const char *our_name; struct file_list *flist; int prev_statret, ndx, prev_ndx = F_HL_PREV(file); @@ -481,13 +504,20 @@ void finish_hard_link(struct file_struct *file, const char *fname, int fin_ndx, while ((ndx = prev_ndx) >= 0) { int val; flist = flist_for_ndx(ndx); - assert(flist != NULL); + if (flist == NULL) { + int start1 = first_flist ? first_flist->ndx_start : 0; + int start2 = first_flist ? first_flist->prev->ndx_start : 0; + int used = first_flist ? first_flist->prev->used : 0; + rprintf(FERROR, + "File index not found: %d (%d - %d)\n", + ndx, start1 - 1, start2 + used - 1); + exit_cleanup(RERR_PROTOCOL); + } 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); + prev_statret = link_stat(f_name(file, 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--;