summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 3e005ba)
raw | patch | inline | side by side (parent: 3e005ba)
author | Shawn O. Pearce <spearce@spearce.org> | |
Mon, 15 Jan 2007 11:51:58 +0000 (06:51 -0500) | ||
committer | Shawn O. Pearce <spearce@spearce.org> | |
Mon, 15 Jan 2007 12:12:23 +0000 (07:12 -0500) |
When we are generating multiple packfiles at once we only need
to scan the blocks of object_entry structs which contain objects
for the current packfile. Because the most recent blocks are at
the front of the linked list, and because all new objects going
into the current file are allocated from the front of that list,
we can stop scanning for objects as soon as we identify one which
doesn't belong to the current packfile.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
to scan the blocks of object_entry structs which contain objects
for the current packfile. Because the most recent blocks are at
the front of the linked list, and because all new objects going
into the current file are allocated from the front of that list,
we can stop scanning for objects as soon as we identify one which
doesn't belong to the current packfile.
Signed-off-by: Shawn O. Pearce <spearce@spearce.org>
fast-import.c | patch | blob | history |
diff --git a/fast-import.c b/fast-import.c
index 207acb3230f1c3a8b7843e82da282729ad4be37a..cfadda043296474ebb5f11a917eb8aa745ba786a 100644 (file)
--- a/fast-import.c
+++ b/fast-import.c
idx = xmalloc(object_count * sizeof(struct object_entry*));
c = idx;
for (o = blocks; o; o = o->next_pool)
- for (e = o->entries; e != o->next_free; e++)
- if (pack_id == e->pack_id)
- *c++ = e;
+ for (e = o->next_free; e-- != o->entries;) {
+ if (pack_id != e->pack_id)
+ goto sort_index;
+ *c++ = e;
+ }
+sort_index:
last = idx + object_count;
+ if (c != last)
+ die("internal consistency error creating the index");
qsort(idx, object_count, sizeof(struct object_entry*), oecmp);
/* Generate the fan-out array. */