| 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 | extern int make_backups; |
| 26 | |
| 27 | #if SUPPORT_HARD_LINKS |
| 28 | static int hlink_compare(struct file_struct **file1, struct file_struct **file2) |
| 29 | { |
| 30 | struct file_struct *f1 = *file1; |
| 31 | struct file_struct *f2 = *file2; |
| 32 | |
| 33 | if (f1->F_DEV != f2->F_DEV) |
| 34 | return (int) (f1->F_DEV > f2->F_DEV ? 1 : -1); |
| 35 | |
| 36 | if (f1->F_INODE != f2->F_INODE) |
| 37 | return (int) (f1->F_INODE > f2->F_INODE ? 1 : -1); |
| 38 | |
| 39 | return file_compare(file1, file2); |
| 40 | } |
| 41 | |
| 42 | static struct file_struct **hlink_list; |
| 43 | static int hlink_count; |
| 44 | |
| 45 | #define LINKED(p1,p2) ((p1)->F_DEV == (p2)->F_DEV \ |
| 46 | && (p1)->F_INODE == (p2)->F_INODE) |
| 47 | |
| 48 | /* Analyze the data in the hlink_list[], remove items that aren't multiply |
| 49 | * linked, and replace the dev+inode data with the hlindex+next linked list. */ |
| 50 | static void link_idev_data(struct file_list *flist) |
| 51 | { |
| 52 | struct file_struct *head; |
| 53 | int from, to, start; |
| 54 | |
| 55 | alloc_pool_t hlink_pool; |
| 56 | alloc_pool_t idev_pool = flist->hlink_pool; |
| 57 | |
| 58 | hlink_pool = pool_create(128 * 1024, sizeof (struct hlink), |
| 59 | out_of_memory, POOL_INTERN); |
| 60 | |
| 61 | for (from = to = 0; from < hlink_count; from++) { |
| 62 | start = from; |
| 63 | head = hlink_list[start]; |
| 64 | while (from < hlink_count-1 |
| 65 | && LINKED(hlink_list[from], hlink_list[from+1])) { |
| 66 | pool_free(idev_pool, 0, hlink_list[from]->link_u.idev); |
| 67 | hlink_list[from]->link_u.links = pool_talloc(hlink_pool, |
| 68 | struct hlink, 1, "hlink_list"); |
| 69 | |
| 70 | hlink_list[from]->F_HLINDEX = to; |
| 71 | hlink_list[from]->F_NEXT = hlink_list[from+1]; |
| 72 | from++; |
| 73 | } |
| 74 | if (from > start) { |
| 75 | pool_free(idev_pool, 0, hlink_list[from]->link_u.idev); |
| 76 | hlink_list[from]->link_u.links = pool_talloc(hlink_pool, |
| 77 | struct hlink, 1, "hlink_list"); |
| 78 | |
| 79 | hlink_list[from]->F_HLINDEX = to; |
| 80 | hlink_list[from]->F_NEXT = head; |
| 81 | hlink_list[from]->flags |= FLAG_HLINK_EOL; |
| 82 | hlink_list[to++] = head; |
| 83 | } else { |
| 84 | pool_free(idev_pool, 0, head->link_u.idev); |
| 85 | head->link_u.idev = NULL; |
| 86 | } |
| 87 | } |
| 88 | |
| 89 | if (!to) { |
| 90 | free(hlink_list); |
| 91 | hlink_list = NULL; |
| 92 | pool_destroy(hlink_pool); |
| 93 | hlink_pool = NULL; |
| 94 | } else { |
| 95 | hlink_count = to; |
| 96 | if (!(hlink_list = realloc_array(hlink_list, |
| 97 | struct file_struct *, hlink_count))) |
| 98 | out_of_memory("init_hard_links"); |
| 99 | } |
| 100 | flist->hlink_pool = hlink_pool; |
| 101 | pool_destroy(idev_pool); |
| 102 | } |
| 103 | #endif |
| 104 | |
| 105 | void init_hard_links(struct file_list *flist) |
| 106 | { |
| 107 | #if SUPPORT_HARD_LINKS |
| 108 | int i; |
| 109 | |
| 110 | if (flist->count < 2) |
| 111 | return; |
| 112 | |
| 113 | if (hlink_list) |
| 114 | free(hlink_list); |
| 115 | |
| 116 | if (!(hlink_list = new_array(struct file_struct *, flist->count))) |
| 117 | out_of_memory("init_hard_links"); |
| 118 | |
| 119 | hlink_count = 0; |
| 120 | for (i = 0; i < flist->count; i++) { |
| 121 | if (flist->files[i]->link_u.idev) |
| 122 | hlink_list[hlink_count++] = flist->files[i]; |
| 123 | } |
| 124 | |
| 125 | qsort(hlink_list, hlink_count, |
| 126 | sizeof hlink_list[0], (int (*)()) hlink_compare); |
| 127 | |
| 128 | if (!hlink_count) { |
| 129 | free(hlink_list); |
| 130 | hlink_list = NULL; |
| 131 | } else |
| 132 | link_idev_data(flist); |
| 133 | #endif |
| 134 | } |
| 135 | |
| 136 | int hard_link_check(struct file_struct *file, int skip) |
| 137 | { |
| 138 | #if SUPPORT_HARD_LINKS |
| 139 | if (!hlink_list || !file->link_u.links) |
| 140 | return 0; |
| 141 | if (skip && !(file->flags & FLAG_HLINK_EOL)) |
| 142 | hlink_list[file->F_HLINDEX] = file->F_NEXT; |
| 143 | if (hlink_list[file->F_HLINDEX] != file) { |
| 144 | if (verbose > 1) { |
| 145 | rprintf(FINFO, "\"%s\" is a hard link\n", |
| 146 | f_name(file)); |
| 147 | } |
| 148 | return 1; |
| 149 | } |
| 150 | #endif |
| 151 | return 0; |
| 152 | } |
| 153 | |
| 154 | #if SUPPORT_HARD_LINKS |
| 155 | static void hard_link_one(char *hlink1, char *hlink2) |
| 156 | { |
| 157 | if (do_link(hlink1, hlink2)) { |
| 158 | if (verbose) { |
| 159 | rsyserr(FINFO, errno, "link %s => %s failed", |
| 160 | hlink2, hlink1); |
| 161 | } |
| 162 | } |
| 163 | else if (verbose) |
| 164 | rprintf(FINFO, "%s => %s\n", hlink2, hlink1); |
| 165 | } |
| 166 | #endif |
| 167 | |
| 168 | |
| 169 | |
| 170 | /** |
| 171 | * Create any hard links in the global hlink_list. They were put |
| 172 | * there by running init_hard_links on the filelist. |
| 173 | **/ |
| 174 | void do_hard_links(void) |
| 175 | { |
| 176 | #if SUPPORT_HARD_LINKS |
| 177 | struct file_struct *file, *first; |
| 178 | char hlink1[MAXPATHLEN]; |
| 179 | char *hlink2; |
| 180 | STRUCT_STAT st1, st2; |
| 181 | int i; |
| 182 | |
| 183 | if (!hlink_list) |
| 184 | return; |
| 185 | |
| 186 | for (i = 0; i < hlink_count; i++) { |
| 187 | first = file = hlink_list[i]; |
| 188 | if (link_stat(f_name_to(first, hlink1), &st1, 0) < 0) |
| 189 | continue; |
| 190 | while ((file = file->F_NEXT) != first) { |
| 191 | hlink2 = f_name(file); |
| 192 | if (link_stat(hlink2, &st2, 0) == 0) { |
| 193 | if (st2.st_dev == st1.st_dev |
| 194 | && st2.st_ino == st1.st_ino) |
| 195 | continue; |
| 196 | if (make_backups) { |
| 197 | if (!make_backup(hlink2)) |
| 198 | continue; |
| 199 | } else if (robust_unlink(hlink2)) { |
| 200 | if (verbose > 0) { |
| 201 | rsyserr(FINFO, errno, |
| 202 | "unlink %s failed", |
| 203 | full_fname(hlink2)); |
| 204 | } |
| 205 | continue; |
| 206 | } |
| 207 | } |
| 208 | hard_link_one(hlink1, hlink2); |
| 209 | } |
| 210 | } |
| 211 | #endif |
| 212 | } |