mirrors/git
1
0
Fork 0
mirror of https://github.com/git/git.git synced 2024-10-30 22:07:53 +01:00
Code Activity

fsck-cache: sort entries by inode number

Browse source 
This improves the cold-cache behaviour on most filesystems,
since it makes the fsck access patterns more regular on
the disk, rather than seeking back and forth.

Note the "most". Not all filesystems have any relationship
between inode number and location on disk.
This commit is contained in:
Linus Torvalds 2005-05-02 09:06:33 -07:00
parent 0980d9b3a5
commit 7e8c174a97
1 changed files with 74 additions and 17 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

91
fsck-cache.c
View file

@ -88,25 +88,78 @@ static int fsck_tag(struct tag *tag)
return 0; return 0;
} }
static int fsck_name(char *hex) static int fsck_sha1(unsigned char *sha1)
{ {
unsigned char sha1[20]; struct object *obj = parse_object(sha1);
if (!get_sha1_hex(hex, sha1)) { if (!obj)
struct object *obj = parse_object(sha1); return -1;
if (!obj) if (obj->type == blob_type)
return -1; return 0;
if (obj->type == blob_type) if (obj->type == tree_type)
return 0; return fsck_tree((struct tree *) obj);
if (obj->type == tree_type) if (obj->type == commit_type)
return fsck_tree((struct tree *) obj); return fsck_commit((struct commit *) obj);
if (obj->type == commit_type) if (obj->type == tag_type)
return fsck_commit((struct commit *) obj); return fsck_tag((struct tag *) obj);
if (obj->type == tag_type)
return fsck_tag((struct tag *) obj);
}
return -1; return -1;
} }
/*
* This is the sorting chunk size: make it reasonably
* big so that we can sort well..
*/
#define MAX_SHA1_ENTRIES (1024)
struct sha1_entry {
unsigned long ino;
unsigned char sha1[20];
};
static struct {
unsigned long nr;
struct sha1_entry *entry[MAX_SHA1_ENTRIES];
} sha1_list;
static int ino_compare(const void *_a, const void *_b)
{
const struct sha1_entry *a = _a, *b = _b;
unsigned long ino1 = a->ino, ino2 = b->ino;
return ino1 < ino2 ? -1 : ino1 > ino2 ? 1 : 0;
}
static void fsck_sha1_list(void)
{
int i, nr = sha1_list.nr;
qsort(sha1_list.entry, nr, sizeof(struct sha1_entry *), ino_compare);
for (i = 0; i < nr; i++) {
struct sha1_entry *entry = sha1_list.entry[i];
unsigned char *sha1 = entry->sha1;
sha1_list.entry[i] = NULL;
if (fsck_sha1(sha1) < 0)
fprintf(stderr, "bad sha1 entry '%s'\n", sha1_to_hex(sha1));
free(entry);
}
sha1_list.nr = 0;
}
static void add_sha1_list(unsigned char *sha1, unsigned long ino)
{
struct sha1_entry *entry = xmalloc(sizeof(*entry));
int nr;
entry->ino = ino;
memcpy(entry->sha1, sha1, 20);
nr = sha1_list.nr;
if (nr == MAX_SHA1_ENTRIES) {
fsck_sha1_list();
nr = 0;
}
sha1_list.entry[nr] = entry;
sha1_list.nr = ++nr;
}
static int fsck_dir(int i, char *path) static int fsck_dir(int i, char *path)
{ {
DIR *dir = opendir(path); DIR *dir = opendir(path);
@ -118,6 +171,7 @@ static int fsck_dir(int i, char *path)
while ((de = readdir(dir)) != NULL) { while ((de = readdir(dir)) != NULL) {
char name[100]; char name[100];
unsigned char sha1[20];
int len = strlen(de->d_name); int len = strlen(de->d_name);
switch (len) { switch (len) {
@ -131,8 +185,10 @@ static int fsck_dir(int i, char *path)
case 38: case 38:
sprintf(name, "%02x", i); sprintf(name, "%02x", i);
memcpy(name+2, de->d_name, len+1); memcpy(name+2, de->d_name, len+1);
if (!fsck_name(name)) if (get_sha1_hex(name, sha1) < 0)
continue; break;
add_sha1_list(sha1, de->d_ino);
continue;
} }
fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name); fprintf(stderr, "bad sha1 file: %s/%s\n", path, de->d_name);
} }
@ -170,6 +226,7 @@ int main(int argc, char **argv)
sprintf(dir, "%s/%02x", sha1_dir, i); sprintf(dir, "%s/%02x", sha1_dir, i);
fsck_dir(i, dir); fsck_dir(i, dir);
} }
fsck_sha1_list();
heads = 0; heads = 0;
for (i = 1; i < argc; i++) { for (i = 1; i < argc; i++) {