1 /* cp-hash.c -- file copying (hash search routines)
2 Copyright (C) 89, 90, 91, 1995-2005 Free Software Foundation.
4 This program is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 2, or (at your option)
9 This program is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with this program; if not, write to the Free Software Foundation,
16 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
18 Written by Torbjorn Granlund, Sweden (tege@sics.se).
19 Rewritten to use lib/hash.c by Jim Meyering. */
24 #include <sys/types.h>
33 /* Use ST_DEV and ST_INO as the key, FILENAME as the value.
34 These are used e.g., in copy.c to associate the destination name with
35 the source device/inode pair so that if we encounter a matching dev/ino
36 pair in the source tree we can arrange to create a hard link between
37 the corresponding names in the destination tree. */
42 /* Destination file name (of non-directory or pre-existing directory)
43 corresponding to the dev/ino of a copied file, or the destination file
44 name corresponding to a dev/ino pair for a newly-created directory. */
48 /* This table maps source dev/ino to destination file name.
49 We use it to preserve hard links when copying. */
50 static Hash_table
*src_to_dest
;
52 /* Initial size of the above hash table. */
53 #define INITIAL_TABLE_SIZE 103
56 src_to_dest_hash (void const *x
, size_t table_size
)
58 struct Src_to_dest
const *p
= x
;
60 /* Ignoring the device number here should be fine. */
61 /* The cast to uintmax_t prevents negative remainders
62 if st_ino is negative. */
63 return (uintmax_t) p
->st_ino
% table_size
;
66 /* Compare two Src_to_dest entries.
67 Return true if their keys are judged `equal'. */
69 src_to_dest_compare (void const *x
, void const *y
)
71 struct Src_to_dest
const *a
= x
;
72 struct Src_to_dest
const *b
= y
;
73 return SAME_INODE (*a
, *b
) ? true : false;
77 src_to_dest_free (void *x
)
79 struct Src_to_dest
*a
= x
;
84 /* Remove the entry matching INO/DEV from the table
85 that maps source ino/dev to destination file name. */
87 forget_created (ino_t ino
, dev_t dev
)
89 struct Src_to_dest probe
;
90 struct Src_to_dest
*ent
;
96 ent
= hash_delete (src_to_dest
, &probe
);
98 src_to_dest_free (ent
);
101 /* Add FILE to the list of files that we have created.
102 Return true if successful. */
105 remember_created (char const *file
)
109 if (stat (file
, &sb
) < 0)
111 error (0, errno
, "%s", quote (file
));
115 remember_copied (file
, sb
.st_ino
, sb
.st_dev
);
119 /* If INO/DEV correspond to an already-copied source file, return the
120 name of the corresponding destination file. Otherwise, return NULL. */
123 src_to_dest_lookup (ino_t ino
, dev_t dev
)
125 struct Src_to_dest ent
;
126 struct Src_to_dest
const *e
;
129 e
= hash_lookup (src_to_dest
, &ent
);
130 return e
? e
->name
: NULL
;
133 /* Add file NAME, copied from inode number INO and device number DEV,
134 to the list of files we have copied.
135 Return NULL if inserted, otherwise non-NULL. */
138 remember_copied (const char *name
, ino_t ino
, dev_t dev
)
140 struct Src_to_dest
*ent
;
141 struct Src_to_dest
*ent_from_table
;
143 ent
= xmalloc (sizeof *ent
);
144 ent
->name
= xstrdup (name
);
148 ent_from_table
= hash_insert (src_to_dest
, ent
);
149 if (ent_from_table
== NULL
)
151 /* Insertion failed due to lack of memory. */
155 /* Determine whether there was already an entry in the table
156 with a matching key. If so, free ENT (it wasn't inserted) and
157 return the `name' from the table entry. */
158 if (ent_from_table
!= ent
)
160 src_to_dest_free (ent
);
161 return (char *) ent_from_table
->name
;
164 /* New key; insertion succeeded. */
168 /* Initialize the hash table. */
172 src_to_dest
= hash_initialize (INITIAL_TABLE_SIZE
, NULL
,
176 if (src_to_dest
== NULL
)
180 /* Reset the hash structure in the global variable `htab' to
181 contain no entries. */
186 hash_free (src_to_dest
);