blob: ae70329056cece4001f34c598f786d0c82cc0d41 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
|
#ident "$Id$"
/* ----------------------------------------------------------------------- *
*
* Copyright 2001 H. Peter Anvin - All Rights Reserved
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, Inc., 675 Mass Ave, Cambridge MA 02139,
* USA; either version 2 of the License, or (at your option) any later
* version; incorporated herein by reference.
*
* ----------------------------------------------------------------------- */
/*
* hash.c
*
* Hash table used to find hard-linked files
*/
#include "mkzftree.h" /* Must be included first! */
#define HASH_BUCKETS 2683
struct file_hash {
struct file_hash *next;
struct stat st;
const char *outfile_name;
};
static struct file_hash *hashp[HASH_BUCKETS];
const char *hash_find_file(struct stat *st)
{
int bucket = (st->st_ino + st->st_dev) % HASH_BUCKETS;
struct file_hash *hp;
for ( hp = hashp[bucket] ; hp ; hp = hp->next ) {
if ( hp->st.st_ino == st->st_ino &&
hp->st.st_dev == st->st_dev &&
hp->st.st_mode == st->st_mode &&
hp->st.st_nlink == st->st_nlink &&
hp->st.st_uid == st->st_uid &&
hp->st.st_gid == st->st_gid &&
hp->st.st_size == st->st_size &&
hp->st.st_mtime == st->st_mtime ) {
/* Good enough, it's the same file */
return hp->outfile_name;
}
}
return NULL; /* No match */
}
/* Note: the stat structure is the input file; the name
is the output file to link to */
void hash_insert_file(struct stat *st, const char *outfile)
{
int bucket = (st->st_ino + st->st_dev) % HASH_BUCKETS;
struct file_hash *hp = xmalloc(sizeof(struct file_hash));
hp->next = hashp[bucket];
memcpy(&hp->st, st, sizeof(struct stat));
hp->outfile_name = xstrdup(outfile);
hashp[bucket] = hp;
}
|
