7 #include "list-objects.h"
9 #include "pack-bitmap.h"
10 #include "pack-revindex.h"
11 #include "pack-objects.h"
13 #include "repository.h"
14 #include "object-store.h"
15 #include "list-objects-filter-options.h"
18 * An entry on the bitmap index, representing the bitmap for a given
21 struct stored_bitmap
{
23 struct ewah_bitmap
*root
;
24 struct stored_bitmap
*xor;
29 * The active bitmap index for a repository. By design, repositories only have
30 * a single bitmap index available (the index for the biggest packfile in
31 * the repository), since bitmap indexes need full closure.
33 * If there is more than one bitmap index available (e.g. because of alternates),
34 * the active bitmap index is the largest one.
37 /* Packfile to which this bitmap index belongs to */
38 struct packed_git
*pack
;
41 * Mark the first `reuse_objects` in the packfile as reused:
42 * they will be sent as-is without using them for repacking
45 uint32_t reuse_objects
;
47 /* mmapped buffer of the whole bitmap index */
49 size_t map_size
; /* size of the mmaped buffer */
50 size_t map_pos
; /* current position when loading the index */
55 * Each bitmap marks which objects in the packfile are of the given
56 * type. This provides type information when yielding the objects from
57 * the packfile during a walk, which allows for better delta bases.
59 struct ewah_bitmap
*commits
;
60 struct ewah_bitmap
*trees
;
61 struct ewah_bitmap
*blobs
;
62 struct ewah_bitmap
*tags
;
64 /* Map from object ID -> `stored_bitmap` for all the bitmapped commits */
65 kh_oid_map_t
*bitmaps
;
67 /* Number of bitmapped commits */
70 /* If not NULL, this is a name-hash cache pointing into map. */
76 * When trying to perform bitmap operations with objects that are not
77 * packed in `pack`, these objects are added to this "fake index" and
78 * are assumed to appear at the end of the packfile for all operations
81 struct object
**objects
;
83 uint32_t count
, alloc
;
84 kh_oid_pos_t
*positions
;
87 /* Bitmap result of the last performed walk */
88 struct bitmap
*result
;
90 /* "have" bitmap from the last performed walk */
93 /* Version of the bitmap index */
97 static struct ewah_bitmap
*lookup_stored_bitmap(struct stored_bitmap
*st
)
99 struct ewah_bitmap
*parent
;
100 struct ewah_bitmap
*composed
;
105 composed
= ewah_pool_new();
106 parent
= lookup_stored_bitmap(st
->xor);
107 ewah_xor(st
->root
, parent
, composed
);
109 ewah_pool_free(st
->root
);
117 * Read a bitmap from the current read position on the mmaped
118 * index, and increase the read position accordingly
120 static struct ewah_bitmap
*read_bitmap_1(struct bitmap_index
*index
)
122 struct ewah_bitmap
*b
= ewah_pool_new();
124 ssize_t bitmap_size
= ewah_read_mmap(b
,
125 index
->map
+ index
->map_pos
,
126 index
->map_size
- index
->map_pos
);
128 if (bitmap_size
< 0) {
129 error("Failed to load bitmap index (corrupted?)");
134 index
->map_pos
+= bitmap_size
;
138 static int load_bitmap_header(struct bitmap_index
*index
)
140 struct bitmap_disk_header
*header
= (void *)index
->map
;
142 if (index
->map_size
< sizeof(*header
) + the_hash_algo
->rawsz
)
143 return error("Corrupted bitmap index (missing header data)");
145 if (memcmp(header
->magic
, BITMAP_IDX_SIGNATURE
, sizeof(BITMAP_IDX_SIGNATURE
)) != 0)
146 return error("Corrupted bitmap index file (wrong header)");
148 index
->version
= ntohs(header
->version
);
149 if (index
->version
!= 1)
150 return error("Unsupported version for bitmap index file (%d)", index
->version
);
152 /* Parse known bitmap format options */
154 uint32_t flags
= ntohs(header
->options
);
156 if ((flags
& BITMAP_OPT_FULL_DAG
) == 0)
157 return error("Unsupported options for bitmap index file "
158 "(Git requires BITMAP_OPT_FULL_DAG)");
160 if (flags
& BITMAP_OPT_HASH_CACHE
) {
161 unsigned char *end
= index
->map
+ index
->map_size
- the_hash_algo
->rawsz
;
162 index
->hashes
= ((uint32_t *)end
) - index
->pack
->num_objects
;
166 index
->entry_count
= ntohl(header
->entry_count
);
167 index
->map_pos
+= sizeof(*header
) - GIT_MAX_RAWSZ
+ the_hash_algo
->rawsz
;
171 static struct stored_bitmap
*store_bitmap(struct bitmap_index
*index
,
172 struct ewah_bitmap
*root
,
173 const unsigned char *hash
,
174 struct stored_bitmap
*xor_with
,
177 struct stored_bitmap
*stored
;
181 stored
= xmalloc(sizeof(struct stored_bitmap
));
183 stored
->xor = xor_with
;
184 stored
->flags
= flags
;
185 oidread(&stored
->oid
, hash
);
187 hash_pos
= kh_put_oid_map(index
->bitmaps
, stored
->oid
, &ret
);
189 /* a 0 return code means the insertion succeeded with no changes,
190 * because the SHA1 already existed on the map. this is bad, there
191 * shouldn't be duplicated commits in the index */
193 error("Duplicate entry in bitmap index: %s", hash_to_hex(hash
));
197 kh_value(index
->bitmaps
, hash_pos
) = stored
;
201 static inline uint32_t read_be32(const unsigned char *buffer
, size_t *pos
)
203 uint32_t result
= get_be32(buffer
+ *pos
);
204 (*pos
) += sizeof(result
);
208 static inline uint8_t read_u8(const unsigned char *buffer
, size_t *pos
)
210 return buffer
[(*pos
)++];
213 #define MAX_XOR_OFFSET 160
215 static int load_bitmap_entries_v1(struct bitmap_index
*index
)
218 struct stored_bitmap
*recent_bitmaps
[MAX_XOR_OFFSET
] = { NULL
};
220 for (i
= 0; i
< index
->entry_count
; ++i
) {
221 int xor_offset
, flags
;
222 struct ewah_bitmap
*bitmap
= NULL
;
223 struct stored_bitmap
*xor_bitmap
= NULL
;
224 uint32_t commit_idx_pos
;
225 const unsigned char *sha1
;
227 commit_idx_pos
= read_be32(index
->map
, &index
->map_pos
);
228 xor_offset
= read_u8(index
->map
, &index
->map_pos
);
229 flags
= read_u8(index
->map
, &index
->map_pos
);
231 sha1
= nth_packed_object_sha1(index
->pack
, commit_idx_pos
);
233 bitmap
= read_bitmap_1(index
);
237 if (xor_offset
> MAX_XOR_OFFSET
|| xor_offset
> i
)
238 return error("Corrupted bitmap pack index");
240 if (xor_offset
> 0) {
241 xor_bitmap
= recent_bitmaps
[(i
- xor_offset
) % MAX_XOR_OFFSET
];
243 if (xor_bitmap
== NULL
)
244 return error("Invalid XOR offset in bitmap pack index");
247 recent_bitmaps
[i
% MAX_XOR_OFFSET
] = store_bitmap(
248 index
, bitmap
, sha1
, xor_bitmap
, flags
);
254 static char *pack_bitmap_filename(struct packed_git
*p
)
258 if (!strip_suffix(p
->pack_name
, ".pack", &len
))
259 BUG("pack_name does not end in .pack");
260 return xstrfmt("%.*s.bitmap", (int)len
, p
->pack_name
);
263 static int open_pack_bitmap_1(struct bitmap_index
*bitmap_git
, struct packed_git
*packfile
)
269 if (open_pack_index(packfile
))
272 idx_name
= pack_bitmap_filename(packfile
);
273 fd
= git_open(idx_name
);
279 if (fstat(fd
, &st
)) {
284 if (bitmap_git
->pack
) {
285 warning("ignoring extra bitmap file: %s", packfile
->pack_name
);
290 bitmap_git
->pack
= packfile
;
291 bitmap_git
->map_size
= xsize_t(st
.st_size
);
292 bitmap_git
->map
= xmmap(NULL
, bitmap_git
->map_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
293 bitmap_git
->map_pos
= 0;
296 if (load_bitmap_header(bitmap_git
) < 0) {
297 munmap(bitmap_git
->map
, bitmap_git
->map_size
);
298 bitmap_git
->map
= NULL
;
299 bitmap_git
->map_size
= 0;
306 static int load_pack_bitmap(struct bitmap_index
*bitmap_git
)
308 assert(bitmap_git
->map
);
310 bitmap_git
->bitmaps
= kh_init_oid_map();
311 bitmap_git
->ext_index
.positions
= kh_init_oid_pos();
312 if (load_pack_revindex(bitmap_git
->pack
))
315 if (!(bitmap_git
->commits
= read_bitmap_1(bitmap_git
)) ||
316 !(bitmap_git
->trees
= read_bitmap_1(bitmap_git
)) ||
317 !(bitmap_git
->blobs
= read_bitmap_1(bitmap_git
)) ||
318 !(bitmap_git
->tags
= read_bitmap_1(bitmap_git
)))
321 if (load_bitmap_entries_v1(bitmap_git
) < 0)
327 munmap(bitmap_git
->map
, bitmap_git
->map_size
);
328 bitmap_git
->map
= NULL
;
329 bitmap_git
->map_size
= 0;
333 static int open_pack_bitmap(struct repository
*r
,
334 struct bitmap_index
*bitmap_git
)
336 struct packed_git
*p
;
339 assert(!bitmap_git
->map
);
341 for (p
= get_all_packs(r
); p
; p
= p
->next
) {
342 if (open_pack_bitmap_1(bitmap_git
, p
) == 0)
349 struct bitmap_index
*prepare_bitmap_git(struct repository
*r
)
351 struct bitmap_index
*bitmap_git
= xcalloc(1, sizeof(*bitmap_git
));
353 if (!open_pack_bitmap(r
, bitmap_git
) && !load_pack_bitmap(bitmap_git
))
356 free_bitmap_index(bitmap_git
);
360 struct include_data
{
361 struct bitmap_index
*bitmap_git
;
366 static inline int bitmap_position_extended(struct bitmap_index
*bitmap_git
,
367 const struct object_id
*oid
)
369 kh_oid_pos_t
*positions
= bitmap_git
->ext_index
.positions
;
370 khiter_t pos
= kh_get_oid_pos(positions
, *oid
);
372 if (pos
< kh_end(positions
)) {
373 int bitmap_pos
= kh_value(positions
, pos
);
374 return bitmap_pos
+ bitmap_git
->pack
->num_objects
;
380 static inline int bitmap_position_packfile(struct bitmap_index
*bitmap_git
,
381 const struct object_id
*oid
)
383 off_t offset
= find_pack_entry_one(oid
->hash
, bitmap_git
->pack
);
387 return find_revindex_position(bitmap_git
->pack
, offset
);
390 static int bitmap_position(struct bitmap_index
*bitmap_git
,
391 const struct object_id
*oid
)
393 int pos
= bitmap_position_packfile(bitmap_git
, oid
);
394 return (pos
>= 0) ? pos
: bitmap_position_extended(bitmap_git
, oid
);
397 static int ext_index_add_object(struct bitmap_index
*bitmap_git
,
398 struct object
*object
, const char *name
)
400 struct eindex
*eindex
= &bitmap_git
->ext_index
;
406 hash_pos
= kh_put_oid_pos(eindex
->positions
, object
->oid
, &hash_ret
);
408 if (eindex
->count
>= eindex
->alloc
) {
409 eindex
->alloc
= (eindex
->alloc
+ 16) * 3 / 2;
410 REALLOC_ARRAY(eindex
->objects
, eindex
->alloc
);
411 REALLOC_ARRAY(eindex
->hashes
, eindex
->alloc
);
414 bitmap_pos
= eindex
->count
;
415 eindex
->objects
[eindex
->count
] = object
;
416 eindex
->hashes
[eindex
->count
] = pack_name_hash(name
);
417 kh_value(eindex
->positions
, hash_pos
) = bitmap_pos
;
420 bitmap_pos
= kh_value(eindex
->positions
, hash_pos
);
423 return bitmap_pos
+ bitmap_git
->pack
->num_objects
;
426 struct bitmap_show_data
{
427 struct bitmap_index
*bitmap_git
;
431 static void show_object(struct object
*object
, const char *name
, void *data_
)
433 struct bitmap_show_data
*data
= data_
;
436 bitmap_pos
= bitmap_position(data
->bitmap_git
, &object
->oid
);
439 bitmap_pos
= ext_index_add_object(data
->bitmap_git
, object
,
442 bitmap_set(data
->base
, bitmap_pos
);
445 static void show_commit(struct commit
*commit
, void *data
)
449 static int add_to_include_set(struct bitmap_index
*bitmap_git
,
450 struct include_data
*data
,
451 const struct object_id
*oid
,
456 if (data
->seen
&& bitmap_get(data
->seen
, bitmap_pos
))
459 if (bitmap_get(data
->base
, bitmap_pos
))
462 hash_pos
= kh_get_oid_map(bitmap_git
->bitmaps
, *oid
);
463 if (hash_pos
< kh_end(bitmap_git
->bitmaps
)) {
464 struct stored_bitmap
*st
= kh_value(bitmap_git
->bitmaps
, hash_pos
);
465 bitmap_or_ewah(data
->base
, lookup_stored_bitmap(st
));
469 bitmap_set(data
->base
, bitmap_pos
);
473 static int should_include(struct commit
*commit
, void *_data
)
475 struct include_data
*data
= _data
;
478 bitmap_pos
= bitmap_position(data
->bitmap_git
, &commit
->object
.oid
);
480 bitmap_pos
= ext_index_add_object(data
->bitmap_git
,
481 (struct object
*)commit
,
484 if (!add_to_include_set(data
->bitmap_git
, data
, &commit
->object
.oid
,
486 struct commit_list
*parent
= commit
->parents
;
489 parent
->item
->object
.flags
|= SEEN
;
490 parent
= parent
->next
;
499 static struct bitmap
*find_objects(struct bitmap_index
*bitmap_git
,
500 struct rev_info
*revs
,
501 struct object_list
*roots
,
504 struct bitmap
*base
= NULL
;
507 struct object_list
*not_mapped
= NULL
;
510 * Go through all the roots for the walk. The ones that have bitmaps
511 * on the bitmap index will be `or`ed together to form an initial
512 * global reachability analysis.
514 * The ones without bitmaps in the index will be stored in the
515 * `not_mapped_list` for further processing.
518 struct object
*object
= roots
->item
;
521 if (object
->type
== OBJ_COMMIT
) {
522 khiter_t pos
= kh_get_oid_map(bitmap_git
->bitmaps
, object
->oid
);
524 if (pos
< kh_end(bitmap_git
->bitmaps
)) {
525 struct stored_bitmap
*st
= kh_value(bitmap_git
->bitmaps
, pos
);
526 struct ewah_bitmap
*or_with
= lookup_stored_bitmap(st
);
529 base
= ewah_to_bitmap(or_with
);
531 bitmap_or_ewah(base
, or_with
);
533 object
->flags
|= SEEN
;
538 object_list_insert(object
, ¬_mapped
);
542 * Best case scenario: We found bitmaps for all the roots,
543 * so the resulting `or` bitmap has the full reachability analysis
545 if (not_mapped
== NULL
)
551 * Let's iterate through all the roots that don't have bitmaps to
552 * check if we can determine them to be reachable from the existing
555 * If we cannot find them in the existing global bitmap, we'll need
556 * to push them to an actual walk and run it until we can confirm
560 struct object
*object
= roots
->item
;
564 pos
= bitmap_position(bitmap_git
, &object
->oid
);
566 if (pos
< 0 || base
== NULL
|| !bitmap_get(base
, pos
)) {
567 object
->flags
&= ~UNINTERESTING
;
568 add_pending_object(revs
, object
, "");
571 object
->flags
|= SEEN
;
576 struct include_data incdata
;
577 struct bitmap_show_data show_data
;
582 incdata
.bitmap_git
= bitmap_git
;
586 revs
->include_check
= should_include
;
587 revs
->include_check_data
= &incdata
;
589 if (prepare_revision_walk(revs
))
590 die("revision walk setup failed");
592 show_data
.bitmap_git
= bitmap_git
;
593 show_data
.base
= base
;
595 traverse_commit_list(revs
, show_commit
, show_object
,
602 static void show_extended_objects(struct bitmap_index
*bitmap_git
,
603 struct rev_info
*revs
,
604 show_reachable_fn show_reach
)
606 struct bitmap
*objects
= bitmap_git
->result
;
607 struct eindex
*eindex
= &bitmap_git
->ext_index
;
610 for (i
= 0; i
< eindex
->count
; ++i
) {
613 if (!bitmap_get(objects
, bitmap_git
->pack
->num_objects
+ i
))
616 obj
= eindex
->objects
[i
];
617 if ((obj
->type
== OBJ_BLOB
&& !revs
->blob_objects
) ||
618 (obj
->type
== OBJ_TREE
&& !revs
->tree_objects
) ||
619 (obj
->type
== OBJ_TAG
&& !revs
->tag_objects
))
622 show_reach(&obj
->oid
, obj
->type
, 0, eindex
->hashes
[i
], NULL
, 0);
626 static void init_type_iterator(struct ewah_iterator
*it
,
627 struct bitmap_index
*bitmap_git
,
628 enum object_type type
)
632 ewah_iterator_init(it
, bitmap_git
->commits
);
636 ewah_iterator_init(it
, bitmap_git
->trees
);
640 ewah_iterator_init(it
, bitmap_git
->blobs
);
644 ewah_iterator_init(it
, bitmap_git
->tags
);
648 BUG("object type %d not stored by bitmap type index", type
);
653 static void show_objects_for_type(
654 struct bitmap_index
*bitmap_git
,
655 enum object_type object_type
,
656 show_reachable_fn show_reach
)
658 size_t pos
= 0, i
= 0;
661 struct ewah_iterator it
;
664 struct bitmap
*objects
= bitmap_git
->result
;
666 if (bitmap_git
->reuse_objects
== bitmap_git
->pack
->num_objects
)
669 init_type_iterator(&it
, bitmap_git
, object_type
);
671 while (i
< objects
->word_alloc
&& ewah_iterator_next(&filter
, &it
)) {
672 eword_t word
= objects
->words
[i
] & filter
;
674 for (offset
= 0; offset
< BITS_IN_EWORD
; ++offset
) {
675 struct object_id oid
;
676 struct revindex_entry
*entry
;
679 if ((word
>> offset
) == 0)
682 offset
+= ewah_bit_ctz64(word
>> offset
);
684 if (pos
+ offset
< bitmap_git
->reuse_objects
)
687 entry
= &bitmap_git
->pack
->revindex
[pos
+ offset
];
688 nth_packed_object_oid(&oid
, bitmap_git
->pack
, entry
->nr
);
690 if (bitmap_git
->hashes
)
691 hash
= get_be32(bitmap_git
->hashes
+ entry
->nr
);
693 show_reach(&oid
, object_type
, 0, hash
, bitmap_git
->pack
, entry
->offset
);
696 pos
+= BITS_IN_EWORD
;
701 static int in_bitmapped_pack(struct bitmap_index
*bitmap_git
,
702 struct object_list
*roots
)
705 struct object
*object
= roots
->item
;
708 if (find_pack_entry_one(object
->oid
.hash
, bitmap_git
->pack
) > 0)
715 static int filter_bitmap(struct bitmap_index
*bitmap_git
,
716 struct object_list
*tip_objects
,
717 struct bitmap
*to_filter
,
718 struct list_objects_filter_options
*filter
)
720 if (!filter
|| filter
->choice
== LOFC_DISABLED
)
723 /* filter choice not handled */
727 static int can_filter_bitmap(struct list_objects_filter_options
*filter
)
729 return !filter_bitmap(NULL
, NULL
, NULL
, filter
);
732 struct bitmap_index
*prepare_bitmap_walk(struct rev_info
*revs
,
733 struct list_objects_filter_options
*filter
)
737 struct object_list
*wants
= NULL
;
738 struct object_list
*haves
= NULL
;
740 struct bitmap
*wants_bitmap
= NULL
;
741 struct bitmap
*haves_bitmap
= NULL
;
743 struct bitmap_index
*bitmap_git
;
746 * We can't do pathspec limiting with bitmaps, because we don't know
747 * which commits are associated with which object changes (let alone
748 * even which objects are associated with which paths).
753 if (!can_filter_bitmap(filter
))
756 /* try to open a bitmapped pack, but don't parse it yet
757 * because we may not need to use it */
758 bitmap_git
= xcalloc(1, sizeof(*bitmap_git
));
759 if (open_pack_bitmap(revs
->repo
, bitmap_git
) < 0)
762 for (i
= 0; i
< revs
->pending
.nr
; ++i
) {
763 struct object
*object
= revs
->pending
.objects
[i
].item
;
765 if (object
->type
== OBJ_NONE
)
766 parse_object_or_die(&object
->oid
, NULL
);
768 while (object
->type
== OBJ_TAG
) {
769 struct tag
*tag
= (struct tag
*) object
;
771 if (object
->flags
& UNINTERESTING
)
772 object_list_insert(object
, &haves
);
774 object_list_insert(object
, &wants
);
776 object
= parse_object_or_die(get_tagged_oid(tag
), NULL
);
779 if (object
->flags
& UNINTERESTING
)
780 object_list_insert(object
, &haves
);
782 object_list_insert(object
, &wants
);
786 * if we have a HAVES list, but none of those haves is contained
787 * in the packfile that has a bitmap, we don't have anything to
790 if (haves
&& !in_bitmapped_pack(bitmap_git
, haves
))
793 /* if we don't want anything, we're done here */
798 * now we're going to use bitmaps, so load the actual bitmap entries
799 * from disk. this is the point of no return; after this the rev_list
800 * becomes invalidated and we must perform the revwalk through bitmaps
802 if (load_pack_bitmap(bitmap_git
) < 0)
805 object_array_clear(&revs
->pending
);
808 revs
->ignore_missing_links
= 1;
809 haves_bitmap
= find_objects(bitmap_git
, revs
, haves
, NULL
);
810 reset_revision_walk();
811 revs
->ignore_missing_links
= 0;
813 if (haves_bitmap
== NULL
)
814 BUG("failed to perform bitmap walk");
817 wants_bitmap
= find_objects(bitmap_git
, revs
, wants
, haves_bitmap
);
820 BUG("failed to perform bitmap walk");
823 bitmap_and_not(wants_bitmap
, haves_bitmap
);
825 filter_bitmap(bitmap_git
, wants
, wants_bitmap
, filter
);
827 bitmap_git
->result
= wants_bitmap
;
828 bitmap_git
->haves
= haves_bitmap
;
830 object_list_free(&wants
);
831 object_list_free(&haves
);
836 free_bitmap_index(bitmap_git
);
837 object_list_free(&wants
);
838 object_list_free(&haves
);
842 int reuse_partial_packfile_from_bitmap(struct bitmap_index
*bitmap_git
,
843 struct packed_git
**packfile
,
848 * Reuse the packfile content if we need more than
851 static const double REUSE_PERCENT
= 0.9;
853 struct bitmap
*result
= bitmap_git
->result
;
854 uint32_t reuse_threshold
;
855 uint32_t i
, reuse_objects
= 0;
859 for (i
= 0; i
< result
->word_alloc
; ++i
) {
860 if (result
->words
[i
] != (eword_t
)~0) {
861 reuse_objects
+= ewah_bit_ctz64(~result
->words
[i
]);
865 reuse_objects
+= BITS_IN_EWORD
;
868 #ifdef GIT_BITMAP_DEBUG
870 const unsigned char *sha1
;
871 struct revindex_entry
*entry
;
873 entry
= &bitmap_git
->reverse_index
->revindex
[reuse_objects
];
874 sha1
= nth_packed_object_sha1(bitmap_git
->pack
, entry
->nr
);
876 fprintf(stderr
, "Failed to reuse at %d (%016llx)\n",
877 reuse_objects
, result
->words
[i
]);
878 fprintf(stderr
, " %s\n", hash_to_hex(sha1
));
885 if (reuse_objects
>= bitmap_git
->pack
->num_objects
) {
886 bitmap_git
->reuse_objects
= *entries
= bitmap_git
->pack
->num_objects
;
887 *up_to
= -1; /* reuse the full pack */
888 *packfile
= bitmap_git
->pack
;
892 reuse_threshold
= bitmap_popcount(bitmap_git
->result
) * REUSE_PERCENT
;
894 if (reuse_objects
< reuse_threshold
)
897 bitmap_git
->reuse_objects
= *entries
= reuse_objects
;
898 *up_to
= bitmap_git
->pack
->revindex
[reuse_objects
].offset
;
899 *packfile
= bitmap_git
->pack
;
904 void traverse_bitmap_commit_list(struct bitmap_index
*bitmap_git
,
905 struct rev_info
*revs
,
906 show_reachable_fn show_reachable
)
908 assert(bitmap_git
->result
);
910 show_objects_for_type(bitmap_git
, OBJ_COMMIT
, show_reachable
);
911 if (revs
->tree_objects
)
912 show_objects_for_type(bitmap_git
, OBJ_TREE
, show_reachable
);
913 if (revs
->blob_objects
)
914 show_objects_for_type(bitmap_git
, OBJ_BLOB
, show_reachable
);
915 if (revs
->tag_objects
)
916 show_objects_for_type(bitmap_git
, OBJ_TAG
, show_reachable
);
918 show_extended_objects(bitmap_git
, revs
, show_reachable
);
921 static uint32_t count_object_type(struct bitmap_index
*bitmap_git
,
922 enum object_type type
)
924 struct bitmap
*objects
= bitmap_git
->result
;
925 struct eindex
*eindex
= &bitmap_git
->ext_index
;
927 uint32_t i
= 0, count
= 0;
928 struct ewah_iterator it
;
931 init_type_iterator(&it
, bitmap_git
, type
);
933 while (i
< objects
->word_alloc
&& ewah_iterator_next(&filter
, &it
)) {
934 eword_t word
= objects
->words
[i
++] & filter
;
935 count
+= ewah_bit_popcount64(word
);
938 for (i
= 0; i
< eindex
->count
; ++i
) {
939 if (eindex
->objects
[i
]->type
== type
&&
940 bitmap_get(objects
, bitmap_git
->pack
->num_objects
+ i
))
947 void count_bitmap_commit_list(struct bitmap_index
*bitmap_git
,
948 uint32_t *commits
, uint32_t *trees
,
949 uint32_t *blobs
, uint32_t *tags
)
951 assert(bitmap_git
->result
);
954 *commits
= count_object_type(bitmap_git
, OBJ_COMMIT
);
957 *trees
= count_object_type(bitmap_git
, OBJ_TREE
);
960 *blobs
= count_object_type(bitmap_git
, OBJ_BLOB
);
963 *tags
= count_object_type(bitmap_git
, OBJ_TAG
);
966 struct bitmap_test_data
{
967 struct bitmap_index
*bitmap_git
;
969 struct progress
*prg
;
973 static void test_show_object(struct object
*object
, const char *name
,
976 struct bitmap_test_data
*tdata
= data
;
979 bitmap_pos
= bitmap_position(tdata
->bitmap_git
, &object
->oid
);
981 die("Object not in bitmap: %s\n", oid_to_hex(&object
->oid
));
983 bitmap_set(tdata
->base
, bitmap_pos
);
984 display_progress(tdata
->prg
, ++tdata
->seen
);
987 static void test_show_commit(struct commit
*commit
, void *data
)
989 struct bitmap_test_data
*tdata
= data
;
992 bitmap_pos
= bitmap_position(tdata
->bitmap_git
,
993 &commit
->object
.oid
);
995 die("Object not in bitmap: %s\n", oid_to_hex(&commit
->object
.oid
));
997 bitmap_set(tdata
->base
, bitmap_pos
);
998 display_progress(tdata
->prg
, ++tdata
->seen
);
1001 void test_bitmap_walk(struct rev_info
*revs
)
1003 struct object
*root
;
1004 struct bitmap
*result
= NULL
;
1006 size_t result_popcnt
;
1007 struct bitmap_test_data tdata
;
1008 struct bitmap_index
*bitmap_git
;
1010 if (!(bitmap_git
= prepare_bitmap_git(revs
->repo
)))
1011 die("failed to load bitmap indexes");
1013 if (revs
->pending
.nr
!= 1)
1014 die("you must specify exactly one commit to test");
1016 fprintf(stderr
, "Bitmap v%d test (%d entries loaded)\n",
1017 bitmap_git
->version
, bitmap_git
->entry_count
);
1019 root
= revs
->pending
.objects
[0].item
;
1020 pos
= kh_get_oid_map(bitmap_git
->bitmaps
, root
->oid
);
1022 if (pos
< kh_end(bitmap_git
->bitmaps
)) {
1023 struct stored_bitmap
*st
= kh_value(bitmap_git
->bitmaps
, pos
);
1024 struct ewah_bitmap
*bm
= lookup_stored_bitmap(st
);
1026 fprintf(stderr
, "Found bitmap for %s. %d bits / %08x checksum\n",
1027 oid_to_hex(&root
->oid
), (int)bm
->bit_size
, ewah_checksum(bm
));
1029 result
= ewah_to_bitmap(bm
);
1033 die("Commit %s doesn't have an indexed bitmap", oid_to_hex(&root
->oid
));
1035 revs
->tag_objects
= 1;
1036 revs
->tree_objects
= 1;
1037 revs
->blob_objects
= 1;
1039 result_popcnt
= bitmap_popcount(result
);
1041 if (prepare_revision_walk(revs
))
1042 die("revision walk setup failed");
1044 tdata
.bitmap_git
= bitmap_git
;
1045 tdata
.base
= bitmap_new();
1046 tdata
.prg
= start_progress("Verifying bitmap entries", result_popcnt
);
1049 traverse_commit_list(revs
, &test_show_commit
, &test_show_object
, &tdata
);
1051 stop_progress(&tdata
.prg
);
1053 if (bitmap_equals(result
, tdata
.base
))
1054 fprintf(stderr
, "OK!\n");
1056 fprintf(stderr
, "Mismatch!\n");
1058 free_bitmap_index(bitmap_git
);
1061 static int rebuild_bitmap(uint32_t *reposition
,
1062 struct ewah_bitmap
*source
,
1063 struct bitmap
*dest
)
1066 struct ewah_iterator it
;
1069 ewah_iterator_init(&it
, source
);
1071 while (ewah_iterator_next(&word
, &it
)) {
1072 uint32_t offset
, bit_pos
;
1074 for (offset
= 0; offset
< BITS_IN_EWORD
; ++offset
) {
1075 if ((word
>> offset
) == 0)
1078 offset
+= ewah_bit_ctz64(word
>> offset
);
1080 bit_pos
= reposition
[pos
+ offset
];
1082 bitmap_set(dest
, bit_pos
- 1);
1083 else /* can't reuse, we don't have the object */
1087 pos
+= BITS_IN_EWORD
;
1092 int rebuild_existing_bitmaps(struct bitmap_index
*bitmap_git
,
1093 struct packing_data
*mapping
,
1094 kh_oid_map_t
*reused_bitmaps
,
1097 uint32_t i
, num_objects
;
1098 uint32_t *reposition
;
1099 struct bitmap
*rebuild
;
1100 struct stored_bitmap
*stored
;
1101 struct progress
*progress
= NULL
;
1106 num_objects
= bitmap_git
->pack
->num_objects
;
1107 reposition
= xcalloc(num_objects
, sizeof(uint32_t));
1109 for (i
= 0; i
< num_objects
; ++i
) {
1110 struct object_id oid
;
1111 struct revindex_entry
*entry
;
1112 struct object_entry
*oe
;
1114 entry
= &bitmap_git
->pack
->revindex
[i
];
1115 nth_packed_object_oid(&oid
, bitmap_git
->pack
, entry
->nr
);
1116 oe
= packlist_find(mapping
, &oid
);
1119 reposition
[i
] = oe_in_pack_pos(mapping
, oe
) + 1;
1122 rebuild
= bitmap_new();
1126 progress
= start_progress("Reusing bitmaps", 0);
1128 kh_foreach_value(bitmap_git
->bitmaps
, stored
, {
1129 if (stored
->flags
& BITMAP_FLAG_REUSE
) {
1130 if (!rebuild_bitmap(reposition
,
1131 lookup_stored_bitmap(stored
),
1133 hash_pos
= kh_put_oid_map(reused_bitmaps
,
1136 kh_value(reused_bitmaps
, hash_pos
) =
1137 bitmap_to_ewah(rebuild
);
1139 bitmap_reset(rebuild
);
1140 display_progress(progress
, ++i
);
1144 stop_progress(&progress
);
1147 bitmap_free(rebuild
);
1151 void free_bitmap_index(struct bitmap_index
*b
)
1157 munmap(b
->map
, b
->map_size
);
1158 ewah_pool_free(b
->commits
);
1159 ewah_pool_free(b
->trees
);
1160 ewah_pool_free(b
->blobs
);
1161 ewah_pool_free(b
->tags
);
1162 kh_destroy_oid_map(b
->bitmaps
);
1163 free(b
->ext_index
.objects
);
1164 free(b
->ext_index
.hashes
);
1165 bitmap_free(b
->result
);
1166 bitmap_free(b
->haves
);
1170 int bitmap_has_oid_in_uninteresting(struct bitmap_index
*bitmap_git
,
1171 const struct object_id
*oid
)
1176 return 0; /* no bitmap loaded */
1177 if (!bitmap_git
->haves
)
1178 return 0; /* walk had no "haves" */
1180 pos
= bitmap_position_packfile(bitmap_git
, oid
);
1184 return bitmap_get(bitmap_git
->haves
, pos
);