1 /* cp-hash.c -- file copying (hash search routines)
2 Copyright (C) 89, 90, 91, 1995-2002 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., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
18 Written by Torbjorn Granlund, Sweden (tege@sics.se).
19 Rewritten to use lib/hash.c by Jim Meyering. */
24 # include <inttypes.h>
27 #include <sys/types.h>
36 /* Use ST_DEV and ST_INO as the key, FILENAME as the value.
37 These are used e.g., in copy.c to associate the destination path with
38 the source device/inode pair so that if we encounter a matching dev/ino
39 pair in the source tree we can arrange to create a hard link between
40 the corresponding names in the destination tree. */
45 /* Destination path name (of non-directory or pre-existing directory)
46 corresponding to the dev/ino of a copied file, or the destination path
47 name corresponding to a dev/ino pair for a newly-created directory. */
51 /* This table maps source dev/ino to destination file name.
52 We use it to preserve hard links when copying. */
53 static Hash_table
*src_to_dest
;
55 /* Initial size of the above hash table. */
56 #define INITIAL_TABLE_SIZE 103
59 src_to_dest_hash (void const *x
, unsigned int table_size
)
61 struct Src_to_dest
const *p
= x
;
63 /* Ignoring the device number here should be fine. */
64 /* The cast to uintmax_t prevents negative remainders
65 if st_ino is negative. */
66 return (uintmax_t) p
->st_ino
% table_size
;
69 /* Compare two Src_to_dest entries.
70 Return true if their keys are judged `equal'. */
72 src_to_dest_compare (void const *x
, void const *y
)
74 struct Src_to_dest
const *a
= x
;
75 struct Src_to_dest
const *b
= y
;
76 return SAME_INODE (*a
, *b
) ? true : false;
80 src_to_dest_free (void *x
)
82 struct Src_to_dest
*a
= x
;
83 free ((char *) (a
->name
));
87 /* Remove the entry matching INO/DEV from the table
88 that maps source ino/dev to destination file name. */
90 forget_created (ino_t ino
, dev_t dev
)
92 struct Src_to_dest probe
;
93 struct Src_to_dest
*ent
;
99 ent
= hash_delete (src_to_dest
, &probe
);
101 src_to_dest_free (ent
);
104 /* Add PATH to the list of files that we have created.
105 Return 1 if we can't stat PATH, otherwise 0. */
108 remember_created (const char *path
)
112 if (stat (path
, &sb
) < 0)
114 error (0, errno
, "%s", quote (path
));
118 remember_copied (path
, sb
.st_ino
, sb
.st_dev
);
122 /* Add path NAME, copied from inode number INO and device number DEV,
123 to the list of files we have copied.
124 Return NULL if inserted, otherwise non-NULL. */
127 remember_copied (const char *name
, ino_t ino
, dev_t dev
)
129 struct Src_to_dest
*ent
;
130 struct Src_to_dest
*ent_from_table
;
132 ent
= (struct Src_to_dest
*) xmalloc (sizeof *ent
);
133 ent
->name
= xstrdup (name
);
137 ent_from_table
= hash_insert (src_to_dest
, ent
);
138 if (ent_from_table
== NULL
)
140 /* Insertion failed due to lack of memory. */
144 /* Determine whether there was already an entry in the table
145 with a matching key. If so, free ENT (it wasn't inserted) and
146 return the `name' from the table entry. */
147 if (ent_from_table
!= ent
)
149 src_to_dest_free (ent
);
150 return (char *) ent_from_table
->name
;
153 /* New key; insertion succeeded. */
157 /* Initialize the hash table. */
161 src_to_dest
= hash_initialize (INITIAL_TABLE_SIZE
, NULL
,
165 if (src_to_dest
== NULL
)
169 /* Reset the hash structure in the global variable `htab' to
170 contain no entries. */
175 hash_free (src_to_dest
);