2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
4 Copyright (C) 2002 by Martin Pool <mbp@samba.org>
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.
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.
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.
26 #if SUPPORT_HARD_LINKS
27 static int hlink_compare(struct file_struct **file1, struct file_struct **file2)
29 struct file_struct *f1 = *file1;
30 struct file_struct *f2 = *file2;
32 if (f1->F_DEV != f2->F_DEV)
33 return (int) (f1->F_DEV > f2->F_DEV ? 1 : -1);
35 if (f1->F_INODE != f2->F_INODE)
36 return (int) (f1->F_INODE > f2->F_INODE ? 1 : -1);
38 return file_compare(file1, file2);
41 struct file_struct **hlink_list;
44 #define LINKED(p1,p2) ((p1)->F_DEV == (p2)->F_DEV \
45 && (p1)->F_INODE == (p2)->F_INODE)
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(struct file_list *flist)
51 struct file_struct *head;
54 alloc_pool_t hlink_pool;
55 alloc_pool_t idev_pool = flist->hlink_pool;
57 hlink_pool = pool_create(128 * 1024, sizeof (struct hlink),
58 out_of_memory, POOL_INTERN);
60 for (from = to = 0; from < hlink_count; from++) {
62 head = hlink_list[start];
63 while (from < hlink_count-1
64 && LINKED(hlink_list[from], hlink_list[from+1])) {
65 pool_free(idev_pool, 0, hlink_list[from]->link_u.idev);
66 hlink_list[from]->link_u.links = pool_talloc(hlink_pool,
67 struct hlink, 1, "hlink_list");
69 hlink_list[from]->F_HLINDEX = to;
70 hlink_list[from]->F_NEXT = hlink_list[from+1];
74 pool_free(idev_pool, 0, hlink_list[from]->link_u.idev);
75 hlink_list[from]->link_u.links = pool_talloc(hlink_pool,
76 struct hlink, 1, "hlink_list");
78 hlink_list[from]->F_HLINDEX = to;
79 hlink_list[from]->F_NEXT = head;
80 hlink_list[from]->flags |= FLAG_HLINK_EOL;
81 hlink_list[to++] = head;
83 pool_free(idev_pool, 0, head->link_u.idev);
84 head->link_u.idev = NULL;
91 pool_destroy(hlink_pool);
95 if (!(hlink_list = realloc_array(hlink_list,
96 struct file_struct *, hlink_count)))
97 out_of_memory("init_hard_links");
99 flist->hlink_pool = hlink_pool;
100 pool_destroy(idev_pool);
104 void init_hard_links(struct file_list *flist)
106 #if SUPPORT_HARD_LINKS
109 if (flist->count < 2)
115 if (!(hlink_list = new_array(struct file_struct *, flist->count)))
116 out_of_memory("init_hard_links");
119 for (i = 0; i < flist->count; i++) {
120 if (flist->files[i]->link_u.idev)
121 hlink_list[hlink_count++] = flist->files[i];
124 qsort(hlink_list, hlink_count,
125 sizeof hlink_list[0], (int (*)()) hlink_compare);
131 link_idev_data(flist);
135 int hard_link_check(struct file_struct *file, int skip)
137 if (!file->link_u.links)
139 if (skip && !(file->flags & FLAG_HLINK_EOL))
140 hlink_list[file->F_HLINDEX] = file->F_NEXT;
141 if (hlink_list[file->F_HLINDEX] != file) {
143 rprintf(FINFO, "\"%s\" is a hard link\n",
151 #if SUPPORT_HARD_LINKS
152 static void hard_link_one(char *hlink1, char *hlink2)
154 if (do_link(hlink1, hlink2)) {
156 rprintf(FINFO, "link %s => %s failed: %s\n",
157 hlink2, hlink1, strerror(errno));
161 rprintf(FINFO, "%s => %s\n", hlink2, hlink1);
168 * Create any hard links in the global hlink_list. They were put
169 * there by running init_hard_links on the filelist.
171 void do_hard_links(void)
173 #if SUPPORT_HARD_LINKS
174 struct file_struct *file, *first;
175 char hlink1[MAXPATHLEN];
177 STRUCT_STAT st1, st2;
183 for (i = 0; i < hlink_count; i++) {
184 first = file = hlink_list[i];
185 if (link_stat(f_name_to(first, hlink1), &st1) != 0)
187 while ((file = file->F_NEXT) != first) {
188 hlink2 = f_name(file);
189 if (link_stat(hlink2, &st2) == 0) {
190 if (st2.st_dev == st1.st_dev
191 && st2.st_ino == st1.st_ino)
193 if (robust_unlink(hlink2)) {
196 "unlink %s failed: %s\n",
203 hard_link_one(hlink1, hlink2);