hlink.c

   1 /*
   2  * Routines to support hard-linking.
   3  *
   4  * Copyright (C) 1996 Andrew Tridgell
   5  * Copyright (C) 1996 Paul Mackerras
   6  * Copyright (C) 2002 Martin Pool <mbp@samba.org>
   7  * Copyright (C) 2004-2020 Wayne Davison
   8  *
   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.
  13  *
  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.
  18  *
  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.
  21  */
  22
  23 #include "rsync.h"
  24 #include "inums.h"
  25 #include "ifuncs.h"
  26
  27 extern int dry_run;
  28 extern int list_only;
  29 extern int am_sender;
  30 extern int inc_recurse;
  31 extern int do_xfers;
  32 extern int alt_dest_type;
  33 extern int preserve_acls;
  34 extern int preserve_xattrs;
  35 extern int protocol_version;
  36 extern int remove_source_files;
  37 extern int stdout_format_has_i;
  38 extern int maybe_ATTRS_REPORT;
  39 extern int unsort_ndx;
  40 extern char *basis_dir[MAX_BASIS_DIRS+1];
  41 extern struct file_list *cur_flist;
  42
  43 #ifdef SUPPORT_HARD_LINKS
  44
  45 /* Starting with protocol 30, we use a simple hashtable on the sending side
  46  * for hashing the st_dev and st_ino info.  The receiving side gets told
  47  * (via flags and a "group index") which items are hard-linked together, so
  48  * we can avoid the pool of dev+inode data.  For incremental recursion mode,
  49  * the receiver will use a ndx hash to remember old pathnames. */
  50
  51 static void *data_when_new = "";
  52
  53 static struct hashtable *dev_tbl;
  54
  55 static struct hashtable *prior_hlinks;
  56
  57 static struct file_list *hlink_flist;
  58
  59 void init_hard_links(void)
  60 {
  61         if (am_sender || protocol_version < 30)
  62                 dev_tbl = hashtable_create(16, HT_KEY64);
  63         else if (inc_recurse)
  64                 prior_hlinks = hashtable_create(1024, HT_KEY32);
  65 }
  66
  67 struct ht_int64_node *idev_find(int64 dev, int64 ino)
  68 {
  69         static struct ht_int64_node *dev_node = NULL;
  70
  71         /* Note that some OSes have a dev == 0, so increment to avoid storing a 0. */
  72         if (!dev_node || dev_node->key != dev+1) {
  73                 /* We keep a separate hash table of inodes for every device. */
  74                 dev_node = hashtable_find(dev_tbl, dev+1, data_when_new);
  75                 if (dev_node->data == data_when_new) {
  76                         dev_node->data = hashtable_create(512, HT_KEY64);
  77                         if (DEBUG_GTE(HLINK, 3)) {
  78                                 rprintf(FINFO, "[%s] created hashtable for dev %s\n",
  79                                         who_am_i(), big_num(dev));
  80                         }
  81                 }
  82         }
  83
  84         return hashtable_find(dev_node->data, ino, (void*)-1L);
  85 }
  86
  87 void idev_destroy(void)
  88 {
  89         int i;
  90
  91         for (i = 0; i < dev_tbl->size; i++) {
  92                 struct ht_int32_node *node = HT_NODE(dev_tbl, dev_tbl->nodes, i);
  93                 if (node->data)
  94                         hashtable_destroy(node->data);
  95         }
  96
  97         hashtable_destroy(dev_tbl);
  98 }
  99
 100 static int hlink_compare_gnum(int *int1, int *int2)
 101 {
 102         struct file_struct *f1 = hlink_flist->sorted[*int1];
 103         struct file_struct *f2 = hlink_flist->sorted[*int2];
 104         int32 gnum1 = F_HL_GNUM(f1);
 105         int32 gnum2 = F_HL_GNUM(f2);
 106
 107         if (gnum1 != gnum2)
 108                 return gnum1 > gnum2 ? 1 : -1;
 109
 110         return *int1 > *int2 ? 1 : -1;
 111 }
 112
 113 static void match_gnums(int32 *ndx_list, int ndx_count)
 114 {
 115         int32 from, prev;
 116         struct file_struct *file, *file_next;
 117         struct ht_int32_node *node = NULL;
 118         int32 gnum, gnum_next;
 119
 120         qsort(ndx_list, ndx_count, sizeof ndx_list[0], (int (*)()) hlink_compare_gnum);
 121
 122         for (from = 0; from < ndx_count; from++) {
 123                 file = hlink_flist->sorted[ndx_list[from]];
 124                 gnum = F_HL_GNUM(file);
 125                 if (inc_recurse) {
 126                         node = hashtable_find(prior_hlinks, gnum, data_when_new);
 127                         if (node->data == data_when_new) {
 128                                 if (!(node->data = new_array0(char, 5)))
 129                                         out_of_memory("match_gnums");
 130                                 assert(gnum >= hlink_flist->ndx_start);
 131                                 file->flags |= FLAG_HLINK_FIRST;
 132                                 prev = -1;
 133                         } else if (CVAL(node->data, 0) == 0) {
 134                                 struct file_list *flist;
 135                                 prev = IVAL(node->data, 1);
 136                                 flist = flist_for_ndx(prev, NULL);
 137                                 if (flist)
 138                                         flist->files[prev - flist->ndx_start]->flags &= ~FLAG_HLINK_LAST;
 139                                 else {
 140                                         /* We skipped all prior files in this
 141                                          * group, so mark this as a "first". */
 142                                         file->flags |= FLAG_HLINK_FIRST;
 143                                         prev = -1;
 144                                 }
 145                         } else
 146                                 prev = -1;
 147                 } else {
 148                         file->flags |= FLAG_HLINK_FIRST;
 149                         prev = -1;
 150                 }
 151                 for ( ; from < ndx_count-1; file = file_next, gnum = gnum_next, from++) { /*SHARED ITERATOR*/
 152                         file_next = hlink_flist->sorted[ndx_list[from+1]];
 153                         gnum_next = F_HL_GNUM(file_next);
 154                         if (gnum != gnum_next)
 155                                 break;
 156                         F_HL_PREV(file) = prev;
 157                         /* The linked list uses over-the-wire ndx values. */
 158                         if (unsort_ndx)
 159                                 prev = F_NDX(file);
 160                         else
 161                                 prev = ndx_list[from] + hlink_flist->ndx_start;
 162                 }
 163                 if (prev < 0 && !inc_recurse) {
 164                         /* Disable hard-link bit and set DONE so that
 165                          * HLINK_BUMP()-dependent values are unaffected. */
 166                         file->flags &= ~(FLAG_HLINKED | FLAG_HLINK_FIRST);
 167                         file->flags |= FLAG_HLINK_DONE;
 168                         continue;
 169                 }
 170
 171                 file->flags |= FLAG_HLINK_LAST;
 172                 F_HL_PREV(file) = prev;
 173                 if (inc_recurse && CVAL(node->data, 0) == 0) {
 174                         if (unsort_ndx)
 175                                 prev = F_NDX(file);
 176                         else
 177                                 prev = ndx_list[from] + hlink_flist->ndx_start;
 178                         SIVAL(node->data, 1, prev);
 179                 }
 180         }
 181 }
 182
 183 /* Analyze the hard-links in the file-list by creating a list of all the
 184  * items that have hlink data, sorting them, and matching up identical
 185  * values into clusters.  These will be a single linked list from last
 186  * to first when we're done. */
 187 void match_hard_links(struct file_list *flist)
 188 {
 189         if (!list_only && flist->used) {
 190                 int i, ndx_count = 0;
 191                 int32 *ndx_list;
 192
 193                 if (!(ndx_list = new_array(int32, flist->used)))
 194                         out_of_memory("match_hard_links");
 195
 196                 for (i = 0; i < flist->used; i++) {
 197                         if (F_IS_HLINKED(flist->sorted[i]))
 198                                 ndx_list[ndx_count++] = i;
 199                 }
 200
 201                 hlink_flist = flist;
 202
 203                 if (ndx_count)
 204                         match_gnums(ndx_list, ndx_count);
 205
 206                 free(ndx_list);
 207         }
 208         if (protocol_version < 30)
 209                 idev_destroy();
 210 }
 211
 212 static int maybe_hard_link(struct file_struct *file, int ndx,
 213                            char *fname, int statret, stat_x *sxp,
 214                            const char *oldname, STRUCT_STAT *old_stp,
 215                            const char *realname, int itemizing, enum logcode code)
 216 {
 217         if (statret == 0) {
 218                 if (sxp->st.st_dev == old_stp->st_dev
 219                  && sxp->st.st_ino == old_stp->st_ino) {
 220                         if (itemizing) {
 221                                 itemize(fname, file, ndx, statret, sxp,
 222                                         ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS,
 223                                         0, "");
 224                         }
 225                         if (INFO_GTE(NAME, 2) && maybe_ATTRS_REPORT)
 226                                 rprintf(FCLIENT, "%s is uptodate\n", fname);
 227                         file->flags |= FLAG_HLINK_DONE;
 228                         return 0;
 229                 }
 230         }
 231
 232         if (atomic_create(file, fname, NULL, oldname, MAKEDEV(0, 0), sxp, statret == 0 ? DEL_FOR_FILE : 0)) {
 233                 if (itemizing) {
 234                         itemize(fname, file, ndx, statret, sxp,
 235                                 ITEM_LOCAL_CHANGE | ITEM_XNAME_FOLLOWS, 0,
 236                                 realname);
 237                 }
 238                 if (code != FNONE && INFO_GTE(NAME, 1))
 239                         rprintf(code, "%s => %s\n", fname, realname);
 240                 return 0;
 241         }
 242
 243         return -1;
 244 }
 245
 246 /* Figure out if a prior entry is still there or if we just have a
 247  * cached name for it. */
 248 static char *check_prior(struct file_struct *file, int gnum,
 249                          int *prev_ndx_p, struct file_list **flist_p)
 250 {
 251         struct file_struct *fp;
 252         struct ht_int32_node *node;
 253         int prev_ndx = F_HL_PREV(file);
 254
 255         while (1) {
 256                 struct file_list *flist;
 257                 if (prev_ndx < 0
 258                  || (flist = flist_for_ndx(prev_ndx, NULL)) == NULL)
 259                         break;
 260                 fp = flist->files[prev_ndx - flist->ndx_start];
 261                 if (!(fp->flags & FLAG_SKIP_HLINK)) {
 262                         *prev_ndx_p = prev_ndx;
 263                         *flist_p = flist;
 264                         return NULL;
 265                 }
 266                 F_HL_PREV(file) = prev_ndx = F_HL_PREV(fp);
 267         }
 268
 269         if (inc_recurse
 270          && (node = hashtable_find(prior_hlinks, gnum, NULL)) != NULL) {
 271                 assert(node->data != NULL);
 272                 if (CVAL(node->data, 0) != 0) {
 273                         *prev_ndx_p = -1;
 274                         *flist_p = NULL;
 275                         return node->data;
 276                 }
 277                 /* The prior file must have been skipped. */
 278                 F_HL_PREV(file) = -1;
 279         }
 280
 281         *prev_ndx_p = -1;
 282         *flist_p = NULL;
 283         return NULL;
 284 }
 285
 286 /* Only called if FLAG_HLINKED is set and FLAG_HLINK_FIRST is not.  Returns:
 287  * 0 = process the file, 1 = skip the file, -1 = error occurred. */
 288 int hard_link_check(struct file_struct *file, int ndx, char *fname,
 289                     int statret, stat_x *sxp, int itemizing,
 290                     enum logcode code)
 291 {
 292         STRUCT_STAT prev_st;
 293         char namebuf[MAXPATHLEN], altbuf[MAXPATHLEN];
 294         char *realname, *prev_name;
 295         struct file_list *flist;
 296         int gnum = inc_recurse ? F_HL_GNUM(file) : -1;
 297         int prev_ndx;
 298
 299         prev_name = realname = check_prior(file, gnum, &prev_ndx, &flist);
 300
 301         if (!prev_name) {
 302                 struct file_struct *prev_file;
 303
 304                 if (!flist) {
 305                         /* The previous file was skipped, so this one is
 306                          * treated as if it were the first in its group. */
 307                         if (DEBUG_GTE(HLINK, 2)) {
 308                                 rprintf(FINFO, "hlink for %d (%s,%d): virtual first\n",
 309                                         ndx, f_name(file, NULL), gnum);
 310                         }
 311                         return 0;
 312                 }
 313
 314                 prev_file = flist->files[prev_ndx - flist->ndx_start];
 315
 316                 /* Is the previous link not complete yet? */
 317                 if (!(prev_file->flags & FLAG_HLINK_DONE)) {
 318                         /* Is the previous link being transferred? */
 319                         if (prev_file->flags & FLAG_FILE_SENT) {
 320                                 /* Add ourselves to the list of files that will
 321                                  * be updated when the transfer completes, and
 322                                  * mark ourself as waiting for the transfer. */
 323                                 F_HL_PREV(file) = F_HL_PREV(prev_file);
 324                                 F_HL_PREV(prev_file) = ndx;
 325                                 file->flags |= FLAG_FILE_SENT;
 326                                 cur_flist->in_progress++;
 327                                 if (DEBUG_GTE(HLINK, 2)) {
 328                                         rprintf(FINFO, "hlink for %d (%s,%d): waiting for %d\n",
 329                                                 ndx, f_name(file, NULL), gnum, F_HL_PREV(file));
 330                                 }
 331                                 return 1;
 332                         }
 333                         if (DEBUG_GTE(HLINK, 2)) {
 334                                 rprintf(FINFO, "hlink for %d (%s,%d): looking for a leader\n",
 335                                         ndx, f_name(file, NULL), gnum);
 336                         }
 337                         return 0;
 338                 }
 339
 340                 /* There is a finished file to link with! */
 341                 if (!(prev_file->flags & FLAG_HLINK_FIRST)) {
 342                         /* The previous previous is FIRST when prev is not. */
 343                         prev_name = realname = check_prior(prev_file, gnum, &prev_ndx, &flist);
 344                         /* Update our previous pointer to point to the FIRST. */
 345                         F_HL_PREV(file) = prev_ndx;
 346                 }
 347
 348                 if (!prev_name) {
 349                         int alt_dest;
 350
 351                         assert(flist != NULL);
 352                         prev_file = flist->files[prev_ndx - flist->ndx_start];
 353                         /* F_HL_PREV() is alt_dest value when DONE && FIRST. */
 354                         alt_dest = F_HL_PREV(prev_file);
 355                         if (DEBUG_GTE(HLINK, 2)) {
 356                                 rprintf(FINFO, "hlink for %d (%s,%d): found flist match (alt %d)\n",
 357                                         ndx, f_name(file, NULL), gnum, alt_dest);
 358                         }
 359
 360                         if (alt_dest >= 0 && dry_run) {
 361                                 pathjoin(namebuf, MAXPATHLEN, basis_dir[alt_dest],
 362                                          f_name(prev_file, NULL));
 363                                 prev_name = namebuf;
 364                                 realname = f_name(prev_file, altbuf);
 365                         } else {
 366                                 prev_name = f_name(prev_file, namebuf);
 367                                 realname = prev_name;
 368                         }
 369                 }
 370         }
 371
 372         if (DEBUG_GTE(HLINK, 2)) {
 373                 rprintf(FINFO, "hlink for %d (%s,%d): leader is %d (%s)\n",
 374                         ndx, f_name(file, NULL), gnum, prev_ndx, prev_name);
 375         }
 376
 377         if (link_stat(prev_name, &prev_st, 0) < 0) {
 378                 if (!dry_run || errno != ENOENT) {
 379                         rsyserr(FERROR_XFER, errno, "stat %s failed", full_fname(prev_name));
 380                         return -1;
 381                 }
 382                 /* A new hard-link will get a new dev & inode, so approximate
 383                  * those values in dry-run mode by zeroing them. */
 384                 memset(&prev_st, 0, sizeof prev_st);
 385         }
 386
 387         if (statret < 0 && basis_dir[0] != NULL) {
 388                 /* If we match an alt-dest item, we don't output this as a change. */
 389                 char cmpbuf[MAXPATHLEN];
 390                 stat_x alt_sx;
 391                 int j = 0;
 392                 init_stat_x(&alt_sx);
 393                 do {
 394                         pathjoin(cmpbuf, MAXPATHLEN, basis_dir[j], fname);
 395                         if (link_stat(cmpbuf, &alt_sx.st, 0) < 0)
 396                                 continue;
 397                         if (alt_dest_type == LINK_DEST) {
 398                                 if (prev_st.st_dev != alt_sx.st.st_dev
 399                                  || prev_st.st_ino != alt_sx.st.st_ino)
 400                                         continue;
 401                                 statret = 1;
 402                                 if (stdout_format_has_i == 0
 403                                  || (!INFO_GTE(NAME, 2) && stdout_format_has_i < 2)) {
 404                                         itemizing = 0;
 405                                         code = FNONE;
 406                                         if (INFO_GTE(NAME, 2) && maybe_ATTRS_REPORT)
 407                                                 rprintf(FCLIENT, "%s is uptodate\n", fname);
 408                                 }
 409                                 break;
 410                         }
 411                         if (!unchanged_file(cmpbuf, file, &alt_sx.st))
 412                                 continue;
 413                         statret = 1;
 414                         if (unchanged_attrs(cmpbuf, file, &alt_sx))
 415                                 break;
 416                 } while (basis_dir[++j] != NULL);
 417                 if (statret == 1) {
 418                         sxp->st = alt_sx.st;
 419 #ifdef SUPPORT_ACLS
 420                         if (preserve_acls && !S_ISLNK(file->mode)) {
 421                                 free_acl(sxp);
 422                                 if (!ACL_READY(alt_sx))
 423                                         get_acl(cmpbuf, sxp);
 424                                 else {
 425                                         sxp->acc_acl = alt_sx.acc_acl;
 426                                         sxp->def_acl = alt_sx.def_acl;
 427                                         alt_sx.acc_acl = alt_sx.def_acl = NULL;
 428                                 }
 429                         }
 430 #endif
 431 #ifdef SUPPORT_XATTRS
 432                         if (preserve_xattrs) {
 433                                 free_xattr(sxp);
 434                                 if (!XATTR_READY(alt_sx))
 435                                         get_xattr(cmpbuf, sxp);
 436                                 else {
 437                                         sxp->xattr = alt_sx.xattr;
 438                                         alt_sx.xattr = NULL;
 439                                 }
 440                         }
 441 #endif
 442                 } else
 443                         free_stat_x(&alt_sx);
 444         }
 445
 446         if (maybe_hard_link(file, ndx, fname, statret, sxp, prev_name, &prev_st,
 447                             realname, itemizing, code) < 0)
 448                 return -1;
 449
 450         if (remove_source_files == 1 && do_xfers)
 451                 send_msg_int(MSG_SUCCESS, ndx);
 452
 453         return 1;
 454 }
 455
 456 int hard_link_one(struct file_struct *file, const char *fname,
 457                   const char *oldname, int terse)
 458 {
 459         if (do_link(oldname, fname) < 0) {
 460                 enum logcode code;
 461                 if (terse) {
 462                         if (!INFO_GTE(NAME, 1))
 463                                 return 0;
 464                         code = FINFO;
 465                 } else
 466                         code = FERROR_XFER;
 467                 rsyserr(code, errno, "link %s => %s failed",
 468                         full_fname(fname), oldname);
 469                 return 0;
 470         }
 471
 472         file->flags |= FLAG_HLINK_DONE;
 473
 474         return 1;
 475 }
 476
 477 void finish_hard_link(struct file_struct *file, const char *fname, int fin_ndx,
 478                       STRUCT_STAT *stp, int itemizing, enum logcode code,
 479                       int alt_dest)
 480 {
 481         stat_x prev_sx;
 482         STRUCT_STAT st;
 483         char prev_name[MAXPATHLEN], alt_name[MAXPATHLEN];
 484         const char *our_name;
 485         struct file_list *flist;
 486         int prev_statret, ndx, prev_ndx = F_HL_PREV(file);
 487
 488         if (stp == NULL && prev_ndx >= 0) {
 489                 if (link_stat(fname, &st, 0) < 0 && !dry_run) {
 490                         rsyserr(FERROR_XFER, errno, "stat %s failed",
 491                                 full_fname(fname));
 492                         return;
 493                 }
 494                 stp = &st;
 495         }
 496
 497         /* FIRST combined with DONE means we were the first to get done. */
 498         file->flags |= FLAG_HLINK_FIRST | FLAG_HLINK_DONE;
 499         F_HL_PREV(file) = alt_dest;
 500         if (alt_dest >= 0 && dry_run) {
 501                 pathjoin(alt_name, MAXPATHLEN, basis_dir[alt_dest],
 502                          f_name(file, NULL));
 503                 our_name = alt_name;
 504         } else
 505                 our_name = fname;
 506
 507         init_stat_x(&prev_sx);
 508
 509         while ((ndx = prev_ndx) >= 0) {
 510                 int val;
 511                 flist = flist_for_ndx(ndx, "finish_hard_link");
 512                 file = flist->files[ndx - flist->ndx_start];
 513                 file->flags = (file->flags & ~FLAG_HLINK_FIRST) | FLAG_HLINK_DONE;
 514                 prev_ndx = F_HL_PREV(file);
 515                 F_HL_PREV(file) = fin_ndx;
 516                 prev_statret = link_stat(f_name(file, prev_name), &prev_sx.st, 0);
 517                 val = maybe_hard_link(file, ndx, prev_name, prev_statret, &prev_sx,
 518                                       our_name, stp, fname, itemizing, code);
 519                 flist->in_progress--;
 520                 free_stat_x(&prev_sx);
 521                 if (val < 0)
 522                         continue;
 523                 if (remove_source_files == 1 && do_xfers)
 524                         send_msg_int(MSG_SUCCESS, ndx);
 525         }
 526
 527         if (inc_recurse) {
 528                 int gnum = F_HL_GNUM(file);
 529                 struct ht_int32_node *node = hashtable_find(prior_hlinks, gnum, NULL);
 530                 if (node == NULL) {
 531                         rprintf(FERROR, "Unable to find a hlink node for %d (%s)\n", gnum, f_name(file, prev_name));
 532                         exit_cleanup(RERR_MESSAGEIO);
 533                 }
 534                 if (node->data == NULL) {
 535                         rprintf(FERROR, "Hlink node data for %d is NULL (%s)\n", gnum, f_name(file, prev_name));
 536                         exit_cleanup(RERR_MESSAGEIO);
 537                 }
 538                 if (CVAL(node->data, 0) != 0) {
 539                         rprintf(FERROR, "Hlink node data for %d already has path=%s (%s)\n",
 540                                 gnum, (char*)node->data, f_name(file, prev_name));
 541                         exit_cleanup(RERR_MESSAGEIO);
 542                 }
 543                 free(node->data);
 544                 if (!(node->data = strdup(our_name)))
 545                         out_of_memory("finish_hard_link");
 546         }
 547 }
 548
 549 int skip_hard_link(struct file_struct *file, struct file_list **flist_p)
 550 {
 551         struct file_list *flist;
 552         int prev_ndx;
 553
 554         file->flags |= FLAG_SKIP_HLINK;
 555         if (!(file->flags & FLAG_HLINK_LAST))
 556                 return -1;
 557
 558         check_prior(file, F_HL_GNUM(file), &prev_ndx, &flist);
 559         if (prev_ndx >= 0) {
 560                 file = flist->files[prev_ndx - flist->ndx_start];
 561                 if (file->flags & (FLAG_HLINK_DONE|FLAG_FILE_SENT))
 562                         return -1;
 563                 file->flags |= FLAG_HLINK_LAST;
 564                 *flist_p = flist;
 565         }
 566
 567         return prev_ndx;
 568 }
 569 #endif