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