There's no point in using 8 bits per-directory when 1 bit
will do. This saves us 224 bytes per object directory, which
ends up being 22MB when dealing with 100K alternates.
Signed-off-by: Eric Wong <e@xxxxxxxxx>
---
object-file.c | 10 +++++++---
object-store.h | 2 +-
2 files changed, 8 insertions(+), 4 deletions(-)
diff --git a/object-file.c b/object-file.c
index 6be43c2b60..2c8b9c05f9 100644
--- a/object-file.c
+++ b/object-file.c
@@ -2463,12 +2463,16 @@ struct oid_array *odb_loose_cache(struct object_directory *odb,
{
int subdir_nr = oid->hash[0];
struct strbuf buf = STRBUF_INIT;
+ size_t BM_SIZE = sizeof(odb->loose_objects_subdir_seen[0]) * CHAR_BIT;
+ uint32_t *bitmap;
+ uint32_t bit = 1 << (subdir_nr % BM_SIZE);
if (subdir_nr < 0 ||
- subdir_nr >= ARRAY_SIZE(odb->loose_objects_subdir_seen))
+ subdir_nr >= ARRAY_SIZE(odb->loose_objects_subdir_seen) * BM_SIZE)
BUG("subdir_nr out of range");
- if (odb->loose_objects_subdir_seen[subdir_nr])
+ bitmap = &odb->loose_objects_subdir_seen[subdir_nr / BM_SIZE];
+ if (*bitmap & bit)
return &odb->loose_objects_cache[subdir_nr];
strbuf_addstr(&buf, odb->path);
@@ -2476,7 +2480,7 @@ struct oid_array *odb_loose_cache(struct object_directory *odb,
append_loose_object,
NULL, NULL,
&odb->loose_objects_cache[subdir_nr]);
- odb->loose_objects_subdir_seen[subdir_nr] = 1;
+ *bitmap |= bit;
strbuf_release(&buf);
return &odb->loose_objects_cache[subdir_nr];
}
diff --git a/object-store.h b/object-store.h
index 20c1cedb75..8fcddf3e65 100644
--- a/object-store.h
+++ b/object-store.h
@@ -22,7 +22,7 @@ struct object_directory {
*
* Be sure to call odb_load_loose_cache() before using.
*/
- char loose_objects_subdir_seen[256];
+ uint32_t loose_objects_subdir_seen[8]; /* 256 bits */
struct oid_array loose_objects_cache[256];
/*
