| 1 | /* |
| 2 | Copyright (C) Andrew Tridgell 1996 |
| 3 | Copyright (C) Paul Mackerras 1996 |
| 4 | |
| 5 | This program is free software; you can redistribute it and/or modify |
| 6 | it under the terms of the GNU General Public License as published by |
| 7 | the Free Software Foundation; either version 2 of the License, or |
| 8 | (at your option) any later version. |
| 9 | |
| 10 | This program is distributed in the hope that it will be useful, |
| 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 13 | GNU General Public License for more details. |
| 14 | |
| 15 | You should have received a copy of the GNU General Public License |
| 16 | along with this program; if not, write to the Free Software |
| 17 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 18 | */ |
| 19 | |
| 20 | #include "rsync.h" |
| 21 | |
| 22 | extern int am_server; |
| 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)) return 0; |
| 30 | if (!S_ISREG(f1->mode)) return -1; |
| 31 | if (!S_ISREG(f2->mode)) return 1; |
| 32 | |
| 33 | if (f1->dev != f2->dev) |
| 34 | return (int)(f1->dev - f2->dev); |
| 35 | |
| 36 | if (f1->inode != f2->inode) |
| 37 | return (f1->inode - f2->inode); |
| 38 | |
| 39 | return file_compare(&f1,&f2); |
| 40 | } |
| 41 | |
| 42 | |
| 43 | static struct file_struct *hlink_list; |
| 44 | static int hlink_count; |
| 45 | #endif |
| 46 | |
| 47 | void init_hard_links(struct file_list *flist) |
| 48 | { |
| 49 | #if SUPPORT_HARD_LINKS |
| 50 | int i; |
| 51 | if (flist->count < 2) return; |
| 52 | |
| 53 | if (hlink_list) free(hlink_list); |
| 54 | |
| 55 | if (!(hlink_list = |
| 56 | (struct file_struct *)malloc(sizeof(hlink_list[0])*flist->count))) |
| 57 | out_of_memory("init_hard_links"); |
| 58 | |
| 59 | for (i = 0; i < flist->count; i++) |
| 60 | bcopy(flist->files[i], &hlink_list[i], sizeof(hlink_list[0])); |
| 61 | |
| 62 | qsort(hlink_list,flist->count, |
| 63 | sizeof(hlink_list[0]), |
| 64 | (int (*)())hlink_compare); |
| 65 | |
| 66 | hlink_count=flist->count; |
| 67 | #endif |
| 68 | } |
| 69 | |
| 70 | /* check if a file should be skipped because it is the same as an |
| 71 | earlier hard link */ |
| 72 | int check_hard_link(struct file_struct *file) |
| 73 | { |
| 74 | #if SUPPORT_HARD_LINKS |
| 75 | int low=0,high=hlink_count-1; |
| 76 | int ret=0; |
| 77 | |
| 78 | if (!hlink_list || !S_ISREG(file->mode)) return 0; |
| 79 | |
| 80 | while (low != high) { |
| 81 | int mid = (low+high)/2; |
| 82 | ret = hlink_compare(&hlink_list[mid],file); |
| 83 | if (ret == 0) { |
| 84 | low = mid; |
| 85 | break; |
| 86 | } |
| 87 | if (ret > 0) |
| 88 | high=mid; |
| 89 | else |
| 90 | low=mid+1; |
| 91 | } |
| 92 | |
| 93 | if (hlink_compare(&hlink_list[low],file) != 0) return 0; |
| 94 | |
| 95 | if (low > 0 && |
| 96 | S_ISREG(hlink_list[low-1].mode) && |
| 97 | file->dev == hlink_list[low-1].dev && |
| 98 | file->inode == hlink_list[low-1].inode) |
| 99 | return 1; |
| 100 | #endif |
| 101 | |
| 102 | return 0; |
| 103 | } |
| 104 | |
| 105 | |
| 106 | /* create any hard links in the flist */ |
| 107 | void do_hard_links(struct file_list *flist) |
| 108 | { |
| 109 | #if SUPPORT_HARD_LINKS |
| 110 | int i; |
| 111 | |
| 112 | if (!hlink_list) return; |
| 113 | |
| 114 | for (i=1;i<hlink_count;i++) { |
| 115 | if (S_ISREG(hlink_list[i].mode) && |
| 116 | S_ISREG(hlink_list[i-1].mode) && |
| 117 | hlink_list[i].basename && hlink_list[i-1].basename && |
| 118 | hlink_list[i].dev == hlink_list[i-1].dev && |
| 119 | hlink_list[i].inode == hlink_list[i-1].inode) { |
| 120 | struct stat st1,st2; |
| 121 | |
| 122 | if (link_stat(f_name(&hlink_list[i-1]),&st1) != 0) continue; |
| 123 | if (link_stat(f_name(&hlink_list[i]),&st2) != 0) { |
| 124 | if (do_link(f_name(&hlink_list[i-1]),f_name(&hlink_list[i])) != 0) { |
| 125 | if (verbose > 0) |
| 126 | fprintf(FINFO,"link %s => %s : %s\n", |
| 127 | f_name(&hlink_list[i]), |
| 128 | f_name(&hlink_list[i-1]),strerror(errno)); |
| 129 | continue; |
| 130 | } |
| 131 | } else { |
| 132 | if (st2.st_dev == st1.st_dev && st2.st_ino == st1.st_ino) continue; |
| 133 | |
| 134 | if (do_unlink(f_name(&hlink_list[i])) != 0 || |
| 135 | do_link(f_name(&hlink_list[i-1]),f_name(&hlink_list[i])) != 0) { |
| 136 | if (verbose > 0) |
| 137 | fprintf(FINFO,"link %s => %s : %s\n", |
| 138 | f_name(&hlink_list[i]), |
| 139 | f_name(&hlink_list[i-1]),strerror(errno)); |
| 140 | continue; |
| 141 | } |
| 142 | } |
| 143 | if (verbose > 0) |
| 144 | fprintf(FINFO,"%s => %s\n", |
| 145 | f_name(&hlink_list[i]),f_name(&hlink_list[i-1])); |
| 146 | } |
| 147 | } |
| 148 | #endif |
| 149 | } |