| 1 | /* |
| 2 | Copyright (C) Andrew Tridgell 1996 |
| 3 | Copyright (C) Paul Mackerras 1996 |
| 4 | Copyright (C) 2002 by Martin Pool <mbp@samba.org> |
| 5 | |
| 6 | This program is free software; you can redistribute it and/or modify |
| 7 | it under the terms of the GNU General Public License as published by |
| 8 | the Free Software Foundation; either version 2 of the License, or |
| 9 | (at your option) any later version. |
| 10 | |
| 11 | This program is distributed in the hope that it will be useful, |
| 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 | GNU General Public License for more details. |
| 15 | |
| 16 | You should have received a copy of the GNU General Public License |
| 17 | along with this program; if not, write to the Free Software |
| 18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 19 | */ |
| 20 | |
| 21 | #include "rsync.h" |
| 22 | |
| 23 | extern int dry_run; |
| 24 | extern int verbose; |
| 25 | |
| 26 | #if SUPPORT_HARD_LINKS |
| 27 | static int hlink_compare(struct file_struct *f1, struct file_struct *f2) |
| 28 | { |
| 29 | if (!S_ISREG(f1->mode) && !S_ISREG(f2->mode)) |
| 30 | return 0; |
| 31 | if (!S_ISREG(f1->mode)) |
| 32 | return -1; |
| 33 | if (!S_ISREG(f2->mode)) |
| 34 | return 1; |
| 35 | |
| 36 | if (f1->dev != f2->dev) |
| 37 | return (int) (f1->dev > f2->dev ? 1 : -1); |
| 38 | |
| 39 | if (f1->inode != f2->inode) |
| 40 | return (int) (f1->inode > f2->inode ? 1 : -1); |
| 41 | |
| 42 | return file_compare(&f1, &f2); |
| 43 | } |
| 44 | |
| 45 | |
| 46 | static struct file_struct *hlink_list; |
| 47 | static int hlink_count; |
| 48 | #endif |
| 49 | |
| 50 | void init_hard_links(struct file_list *flist) |
| 51 | { |
| 52 | #if SUPPORT_HARD_LINKS |
| 53 | int i; |
| 54 | if (flist->count < 2) |
| 55 | return; |
| 56 | |
| 57 | if (hlink_list) |
| 58 | free(hlink_list); |
| 59 | |
| 60 | if (!(hlink_list = new_array(struct file_struct, flist->count))) |
| 61 | out_of_memory("init_hard_links"); |
| 62 | |
| 63 | for (i = 0; i < flist->count; i++) |
| 64 | memcpy(&hlink_list[i], flist->files[i], |
| 65 | sizeof(hlink_list[0])); |
| 66 | |
| 67 | qsort(hlink_list, flist->count, |
| 68 | sizeof(hlink_list[0]), (int (*)()) hlink_compare); |
| 69 | |
| 70 | hlink_count = flist->count; |
| 71 | #endif |
| 72 | } |
| 73 | |
| 74 | /* check if a file should be skipped because it is the same as an |
| 75 | earlier hard link */ |
| 76 | int check_hard_link(struct file_struct *file) |
| 77 | { |
| 78 | #if SUPPORT_HARD_LINKS |
| 79 | int low = 0, high = hlink_count - 1; |
| 80 | int ret = 0; |
| 81 | |
| 82 | if (!hlink_list || !S_ISREG(file->mode)) |
| 83 | return 0; |
| 84 | |
| 85 | while (low != high) { |
| 86 | int mid = (low + high) / 2; |
| 87 | ret = hlink_compare(&hlink_list[mid], file); |
| 88 | if (ret == 0) { |
| 89 | low = mid; |
| 90 | break; |
| 91 | } |
| 92 | if (ret > 0) |
| 93 | high = mid; |
| 94 | else |
| 95 | low = mid + 1; |
| 96 | } |
| 97 | |
| 98 | /* XXX: To me this looks kind of dodgy -- why do we use [low] |
| 99 | * here and [low-1] below? -- mbp */ |
| 100 | if (hlink_compare(&hlink_list[low], file) != 0) |
| 101 | return 0; |
| 102 | |
| 103 | if (low > 0 && |
| 104 | S_ISREG(hlink_list[low - 1].mode) && |
| 105 | file->dev == hlink_list[low - 1].dev && |
| 106 | file->inode == hlink_list[low - 1].inode) { |
| 107 | if (verbose >= 2) { |
| 108 | rprintf(FINFO, "check_hard_link: \"%s\" is a hard link to file %d, \"%s\"\n", |
| 109 | f_name(file), low-1, f_name(&hlink_list[low-1])); |
| 110 | } |
| 111 | return 1; |
| 112 | } |
| 113 | #endif |
| 114 | |
| 115 | return 0; |
| 116 | } |
| 117 | |
| 118 | |
| 119 | #if SUPPORT_HARD_LINKS |
| 120 | static void hard_link_one(int i) |
| 121 | { |
| 122 | STRUCT_STAT st1, st2; |
| 123 | char *hlink2, *hlink1 = f_name(&hlink_list[i - 1]); |
| 124 | |
| 125 | if (link_stat(hlink1, &st1) != 0) |
| 126 | return; |
| 127 | |
| 128 | hlink2 = f_name(&hlink_list[i]); |
| 129 | if (link_stat(hlink2, &st2) != 0) { |
| 130 | if (do_link(hlink1, hlink2)) { |
| 131 | if (verbose > 0) { |
| 132 | rprintf(FINFO, "link %s => %s : %s\n", |
| 133 | hlink2, hlink1, strerror(errno)); |
| 134 | } |
| 135 | return; |
| 136 | } |
| 137 | } else { |
| 138 | if (st2.st_dev == st1.st_dev && st2.st_ino == st1.st_ino) |
| 139 | return; |
| 140 | |
| 141 | if (robust_unlink(hlink2) || do_link(hlink1, hlink2)) { |
| 142 | if (verbose > 0) { |
| 143 | rprintf(FINFO, "link %s => %s : %s\n", |
| 144 | hlink2, hlink1, strerror(errno)); |
| 145 | } |
| 146 | return; |
| 147 | } |
| 148 | } |
| 149 | if (verbose > 0) |
| 150 | rprintf(FINFO, "%s => %s\n", hlink2, hlink1); |
| 151 | } |
| 152 | #endif |
| 153 | |
| 154 | |
| 155 | |
| 156 | /** |
| 157 | * Create any hard links in the global hlink_list. They were put |
| 158 | * there by running init_hard_links on the filelist. |
| 159 | **/ |
| 160 | void do_hard_links(void) |
| 161 | { |
| 162 | #if SUPPORT_HARD_LINKS |
| 163 | int i; |
| 164 | |
| 165 | if (!hlink_list) |
| 166 | return; |
| 167 | |
| 168 | for (i = 1; i < hlink_count; i++) { |
| 169 | if (S_ISREG(hlink_list[i].mode) && |
| 170 | S_ISREG(hlink_list[i - 1].mode) && |
| 171 | hlink_list[i].basename && hlink_list[i - 1].basename && |
| 172 | hlink_list[i].dev == hlink_list[i - 1].dev && |
| 173 | hlink_list[i].inode == hlink_list[i - 1].inode) { |
| 174 | hard_link_one(i); |
| 175 | } |
| 176 | } |
| 177 | #endif |
| 178 | } |