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
;
141 size_t header_size
= sizeof(*header
) - GIT_MAX_RAWSZ
+ the_hash_algo
->rawsz
;
143 if (index
->map_size
< header_size
+ the_hash_algo
->rawsz
)
144 return error("Corrupted bitmap index (too small)");
146 if (memcmp(header
->magic
, BITMAP_IDX_SIGNATURE
, sizeof(BITMAP_IDX_SIGNATURE
)) != 0)
147 return error("Corrupted bitmap index file (wrong header)");
149 index
->version
= ntohs(header
->version
);
150 if (index
->version
!= 1)
151 return error("Unsupported version for bitmap index file (%d)", index
->version
);
153 /* Parse known bitmap format options */
155 uint32_t flags
= ntohs(header
->options
);
156 size_t cache_size
= st_mult(index
->pack
->num_objects
, sizeof(uint32_t));
157 unsigned char *index_end
= index
->map
+ index
->map_size
- the_hash_algo
->rawsz
;
159 if ((flags
& BITMAP_OPT_FULL_DAG
) == 0)
160 return error("Unsupported options for bitmap index file "
161 "(Git requires BITMAP_OPT_FULL_DAG)");
163 if (flags
& BITMAP_OPT_HASH_CACHE
) {
164 if (cache_size
> index_end
- index
->map
- header_size
)
165 return error("corrupted bitmap index file (too short to fit hash cache)");
166 index
->hashes
= (void *)(index_end
- cache_size
);
167 index_end
-= cache_size
;
171 index
->entry_count
= ntohl(header
->entry_count
);
172 index
->map_pos
+= header_size
;
176 static struct stored_bitmap
*store_bitmap(struct bitmap_index
*index
,
177 struct ewah_bitmap
*root
,
178 const struct object_id
*oid
,
179 struct stored_bitmap
*xor_with
,
182 struct stored_bitmap
*stored
;
186 stored
= xmalloc(sizeof(struct stored_bitmap
));
188 stored
->xor = xor_with
;
189 stored
->flags
= flags
;
190 oidcpy(&stored
->oid
, oid
);
192 hash_pos
= kh_put_oid_map(index
->bitmaps
, stored
->oid
, &ret
);
194 /* a 0 return code means the insertion succeeded with no changes,
195 * because the SHA1 already existed on the map. this is bad, there
196 * shouldn't be duplicated commits in the index */
198 error("Duplicate entry in bitmap index: %s", oid_to_hex(oid
));
202 kh_value(index
->bitmaps
, hash_pos
) = stored
;
206 static inline uint32_t read_be32(const unsigned char *buffer
, size_t *pos
)
208 uint32_t result
= get_be32(buffer
+ *pos
);
209 (*pos
) += sizeof(result
);
213 static inline uint8_t read_u8(const unsigned char *buffer
, size_t *pos
)
215 return buffer
[(*pos
)++];
218 #define MAX_XOR_OFFSET 160
220 static int load_bitmap_entries_v1(struct bitmap_index
*index
)
223 struct stored_bitmap
*recent_bitmaps
[MAX_XOR_OFFSET
] = { NULL
};
225 for (i
= 0; i
< index
->entry_count
; ++i
) {
226 int xor_offset
, flags
;
227 struct ewah_bitmap
*bitmap
= NULL
;
228 struct stored_bitmap
*xor_bitmap
= NULL
;
229 uint32_t commit_idx_pos
;
230 struct object_id oid
;
232 if (index
->map_size
- index
->map_pos
< 6)
233 return error("corrupt ewah bitmap: truncated header for entry %d", i
);
235 commit_idx_pos
= read_be32(index
->map
, &index
->map_pos
);
236 xor_offset
= read_u8(index
->map
, &index
->map_pos
);
237 flags
= read_u8(index
->map
, &index
->map_pos
);
239 if (nth_packed_object_id(&oid
, index
->pack
, commit_idx_pos
) < 0)
240 return error("corrupt ewah bitmap: commit index %u out of range",
241 (unsigned)commit_idx_pos
);
243 bitmap
= read_bitmap_1(index
);
247 if (xor_offset
> MAX_XOR_OFFSET
|| xor_offset
> i
)
248 return error("Corrupted bitmap pack index");
250 if (xor_offset
> 0) {
251 xor_bitmap
= recent_bitmaps
[(i
- xor_offset
) % MAX_XOR_OFFSET
];
253 if (xor_bitmap
== NULL
)
254 return error("Invalid XOR offset in bitmap pack index");
257 recent_bitmaps
[i
% MAX_XOR_OFFSET
] = store_bitmap(
258 index
, bitmap
, &oid
, xor_bitmap
, flags
);
264 static char *pack_bitmap_filename(struct packed_git
*p
)
268 if (!strip_suffix(p
->pack_name
, ".pack", &len
))
269 BUG("pack_name does not end in .pack");
270 return xstrfmt("%.*s.bitmap", (int)len
, p
->pack_name
);
273 static int open_pack_bitmap_1(struct bitmap_index
*bitmap_git
, struct packed_git
*packfile
)
279 if (open_pack_index(packfile
))
282 idx_name
= pack_bitmap_filename(packfile
);
283 fd
= git_open(idx_name
);
289 if (fstat(fd
, &st
)) {
294 if (bitmap_git
->pack
) {
295 warning("ignoring extra bitmap file: %s", packfile
->pack_name
);
300 bitmap_git
->pack
= packfile
;
301 bitmap_git
->map_size
= xsize_t(st
.st_size
);
302 bitmap_git
->map
= xmmap(NULL
, bitmap_git
->map_size
, PROT_READ
, MAP_PRIVATE
, fd
, 0);
303 bitmap_git
->map_pos
= 0;
306 if (load_bitmap_header(bitmap_git
) < 0) {
307 munmap(bitmap_git
->map
, bitmap_git
->map_size
);
308 bitmap_git
->map
= NULL
;
309 bitmap_git
->map_size
= 0;
316 static int load_pack_bitmap(struct bitmap_index
*bitmap_git
)
318 assert(bitmap_git
->map
);
320 bitmap_git
->bitmaps
= kh_init_oid_map();
321 bitmap_git
->ext_index
.positions
= kh_init_oid_pos();
322 if (load_pack_revindex(bitmap_git
->pack
))
325 if (!(bitmap_git
->commits
= read_bitmap_1(bitmap_git
)) ||
326 !(bitmap_git
->trees
= read_bitmap_1(bitmap_git
)) ||
327 !(bitmap_git
->blobs
= read_bitmap_1(bitmap_git
)) ||
328 !(bitmap_git
->tags
= read_bitmap_1(bitmap_git
)))
331 if (load_bitmap_entries_v1(bitmap_git
) < 0)
337 munmap(bitmap_git
->map
, bitmap_git
->map_size
);
338 bitmap_git
->map
= NULL
;
339 bitmap_git
->map_size
= 0;
341 kh_destroy_oid_map(bitmap_git
->bitmaps
);
342 bitmap_git
->bitmaps
= NULL
;
344 kh_destroy_oid_pos(bitmap_git
->ext_index
.positions
);
345 bitmap_git
->ext_index
.positions
= NULL
;
350 static int open_pack_bitmap(struct repository
*r
,
351 struct bitmap_index
*bitmap_git
)
353 struct packed_git
*p
;
356 assert(!bitmap_git
->map
);
358 for (p
= get_all_packs(r
); p
; p
= p
->next
) {
359 if (open_pack_bitmap_1(bitmap_git
, p
) == 0)
366 struct bitmap_index
*prepare_bitmap_git(struct repository
*r
)
368 struct bitmap_index
*bitmap_git
= xcalloc(1, sizeof(*bitmap_git
));
370 if (!open_pack_bitmap(r
, bitmap_git
) && !load_pack_bitmap(bitmap_git
))
373 free_bitmap_index(bitmap_git
);
377 struct include_data
{
378 struct bitmap_index
*bitmap_git
;
383 struct ewah_bitmap
*bitmap_for_commit(struct bitmap_index
*bitmap_git
,
384 struct commit
*commit
)
386 khiter_t hash_pos
= kh_get_oid_map(bitmap_git
->bitmaps
,
388 if (hash_pos
>= kh_end(bitmap_git
->bitmaps
))
390 return lookup_stored_bitmap(kh_value(bitmap_git
->bitmaps
, hash_pos
));
393 static inline int bitmap_position_extended(struct bitmap_index
*bitmap_git
,
394 const struct object_id
*oid
)
396 kh_oid_pos_t
*positions
= bitmap_git
->ext_index
.positions
;
397 khiter_t pos
= kh_get_oid_pos(positions
, *oid
);
399 if (pos
< kh_end(positions
)) {
400 int bitmap_pos
= kh_value(positions
, pos
);
401 return bitmap_pos
+ bitmap_git
->pack
->num_objects
;
407 static inline int bitmap_position_packfile(struct bitmap_index
*bitmap_git
,
408 const struct object_id
*oid
)
411 off_t offset
= find_pack_entry_one(oid
->hash
, bitmap_git
->pack
);
415 if (offset_to_pack_pos(bitmap_git
->pack
, offset
, &pos
) < 0)
420 static int bitmap_position(struct bitmap_index
*bitmap_git
,
421 const struct object_id
*oid
)
423 int pos
= bitmap_position_packfile(bitmap_git
, oid
);
424 return (pos
>= 0) ? pos
: bitmap_position_extended(bitmap_git
, oid
);
427 static int ext_index_add_object(struct bitmap_index
*bitmap_git
,
428 struct object
*object
, const char *name
)
430 struct eindex
*eindex
= &bitmap_git
->ext_index
;
436 hash_pos
= kh_put_oid_pos(eindex
->positions
, object
->oid
, &hash_ret
);
438 if (eindex
->count
>= eindex
->alloc
) {
439 eindex
->alloc
= (eindex
->alloc
+ 16) * 3 / 2;
440 REALLOC_ARRAY(eindex
->objects
, eindex
->alloc
);
441 REALLOC_ARRAY(eindex
->hashes
, eindex
->alloc
);
444 bitmap_pos
= eindex
->count
;
445 eindex
->objects
[eindex
->count
] = object
;
446 eindex
->hashes
[eindex
->count
] = pack_name_hash(name
);
447 kh_value(eindex
->positions
, hash_pos
) = bitmap_pos
;
450 bitmap_pos
= kh_value(eindex
->positions
, hash_pos
);
453 return bitmap_pos
+ bitmap_git
->pack
->num_objects
;
456 struct bitmap_show_data
{
457 struct bitmap_index
*bitmap_git
;
461 static void show_object(struct object
*object
, const char *name
, void *data_
)
463 struct bitmap_show_data
*data
= data_
;
466 bitmap_pos
= bitmap_position(data
->bitmap_git
, &object
->oid
);
469 bitmap_pos
= ext_index_add_object(data
->bitmap_git
, object
,
472 bitmap_set(data
->base
, bitmap_pos
);
475 static void show_commit(struct commit
*commit
, void *data
)
479 static int add_to_include_set(struct bitmap_index
*bitmap_git
,
480 struct include_data
*data
,
481 struct commit
*commit
,
484 struct ewah_bitmap
*partial
;
486 if (data
->seen
&& bitmap_get(data
->seen
, bitmap_pos
))
489 if (bitmap_get(data
->base
, bitmap_pos
))
492 partial
= bitmap_for_commit(bitmap_git
, commit
);
494 bitmap_or_ewah(data
->base
, partial
);
498 bitmap_set(data
->base
, bitmap_pos
);
502 static int should_include(struct commit
*commit
, void *_data
)
504 struct include_data
*data
= _data
;
507 bitmap_pos
= bitmap_position(data
->bitmap_git
, &commit
->object
.oid
);
509 bitmap_pos
= ext_index_add_object(data
->bitmap_git
,
510 (struct object
*)commit
,
513 if (!add_to_include_set(data
->bitmap_git
, data
, commit
, bitmap_pos
)) {
514 struct commit_list
*parent
= commit
->parents
;
517 parent
->item
->object
.flags
|= SEEN
;
518 parent
= parent
->next
;
527 static int add_commit_to_bitmap(struct bitmap_index
*bitmap_git
,
528 struct bitmap
**base
,
529 struct commit
*commit
)
531 struct ewah_bitmap
*or_with
= bitmap_for_commit(bitmap_git
, commit
);
537 *base
= ewah_to_bitmap(or_with
);
539 bitmap_or_ewah(*base
, or_with
);
544 static struct bitmap
*find_objects(struct bitmap_index
*bitmap_git
,
545 struct rev_info
*revs
,
546 struct object_list
*roots
,
548 struct list_objects_filter_options
*filter
)
550 struct bitmap
*base
= NULL
;
553 struct object_list
*not_mapped
= NULL
;
556 * Go through all the roots for the walk. The ones that have bitmaps
557 * on the bitmap index will be `or`ed together to form an initial
558 * global reachability analysis.
560 * The ones without bitmaps in the index will be stored in the
561 * `not_mapped_list` for further processing.
564 struct object
*object
= roots
->item
;
567 if (object
->type
== OBJ_COMMIT
&&
568 add_commit_to_bitmap(bitmap_git
, &base
, (struct commit
*)object
)) {
569 object
->flags
|= SEEN
;
573 object_list_insert(object
, ¬_mapped
);
577 * Best case scenario: We found bitmaps for all the roots,
578 * so the resulting `or` bitmap has the full reachability analysis
580 if (not_mapped
== NULL
)
586 * Let's iterate through all the roots that don't have bitmaps to
587 * check if we can determine them to be reachable from the existing
590 * If we cannot find them in the existing global bitmap, we'll need
591 * to push them to an actual walk and run it until we can confirm
595 struct object
*object
= roots
->item
;
599 pos
= bitmap_position(bitmap_git
, &object
->oid
);
601 if (pos
< 0 || base
== NULL
|| !bitmap_get(base
, pos
)) {
602 object
->flags
&= ~UNINTERESTING
;
603 add_pending_object(revs
, object
, "");
606 object
->flags
|= SEEN
;
611 struct include_data incdata
;
612 struct bitmap_show_data show_data
;
617 incdata
.bitmap_git
= bitmap_git
;
621 revs
->include_check
= should_include
;
622 revs
->include_check_data
= &incdata
;
624 if (prepare_revision_walk(revs
))
625 die("revision walk setup failed");
627 show_data
.bitmap_git
= bitmap_git
;
628 show_data
.base
= base
;
630 traverse_commit_list_filtered(filter
, revs
,
631 show_commit
, show_object
,
638 static void show_extended_objects(struct bitmap_index
*bitmap_git
,
639 struct rev_info
*revs
,
640 show_reachable_fn show_reach
)
642 struct bitmap
*objects
= bitmap_git
->result
;
643 struct eindex
*eindex
= &bitmap_git
->ext_index
;
646 for (i
= 0; i
< eindex
->count
; ++i
) {
649 if (!bitmap_get(objects
, bitmap_git
->pack
->num_objects
+ i
))
652 obj
= eindex
->objects
[i
];
653 if ((obj
->type
== OBJ_BLOB
&& !revs
->blob_objects
) ||
654 (obj
->type
== OBJ_TREE
&& !revs
->tree_objects
) ||
655 (obj
->type
== OBJ_TAG
&& !revs
->tag_objects
))
658 show_reach(&obj
->oid
, obj
->type
, 0, eindex
->hashes
[i
], NULL
, 0);
662 static void init_type_iterator(struct ewah_iterator
*it
,
663 struct bitmap_index
*bitmap_git
,
664 enum object_type type
)
668 ewah_iterator_init(it
, bitmap_git
->commits
);
672 ewah_iterator_init(it
, bitmap_git
->trees
);
676 ewah_iterator_init(it
, bitmap_git
->blobs
);
680 ewah_iterator_init(it
, bitmap_git
->tags
);
684 BUG("object type %d not stored by bitmap type index", type
);
689 static void show_objects_for_type(
690 struct bitmap_index
*bitmap_git
,
691 enum object_type object_type
,
692 show_reachable_fn show_reach
)
697 struct ewah_iterator it
;
700 struct bitmap
*objects
= bitmap_git
->result
;
702 init_type_iterator(&it
, bitmap_git
, object_type
);
704 for (i
= 0; i
< objects
->word_alloc
&&
705 ewah_iterator_next(&filter
, &it
); i
++) {
706 eword_t word
= objects
->words
[i
] & filter
;
707 size_t pos
= (i
* BITS_IN_EWORD
);
712 for (offset
= 0; offset
< BITS_IN_EWORD
; ++offset
) {
713 struct object_id oid
;
714 uint32_t hash
= 0, index_pos
;
717 if ((word
>> offset
) == 0)
720 offset
+= ewah_bit_ctz64(word
>> offset
);
722 index_pos
= pack_pos_to_index(bitmap_git
->pack
, pos
+ offset
);
723 ofs
= pack_pos_to_offset(bitmap_git
->pack
, pos
+ offset
);
724 nth_packed_object_id(&oid
, bitmap_git
->pack
, index_pos
);
726 if (bitmap_git
->hashes
)
727 hash
= get_be32(bitmap_git
->hashes
+ index_pos
);
729 show_reach(&oid
, object_type
, 0, hash
, bitmap_git
->pack
, ofs
);
734 static int in_bitmapped_pack(struct bitmap_index
*bitmap_git
,
735 struct object_list
*roots
)
738 struct object
*object
= roots
->item
;
741 if (find_pack_entry_one(object
->oid
.hash
, bitmap_git
->pack
) > 0)
748 static struct bitmap
*find_tip_objects(struct bitmap_index
*bitmap_git
,
749 struct object_list
*tip_objects
,
750 enum object_type type
)
752 struct bitmap
*result
= bitmap_new();
753 struct object_list
*p
;
755 for (p
= tip_objects
; p
; p
= p
->next
) {
758 if (p
->item
->type
!= type
)
761 pos
= bitmap_position(bitmap_git
, &p
->item
->oid
);
765 bitmap_set(result
, pos
);
771 static void filter_bitmap_exclude_type(struct bitmap_index
*bitmap_git
,
772 struct object_list
*tip_objects
,
773 struct bitmap
*to_filter
,
774 enum object_type type
)
776 struct eindex
*eindex
= &bitmap_git
->ext_index
;
778 struct ewah_iterator it
;
783 * The non-bitmap version of this filter never removes
784 * objects which the other side specifically asked for,
785 * so we must match that behavior.
787 tips
= find_tip_objects(bitmap_git
, tip_objects
, type
);
790 * We can use the blob type-bitmap to work in whole words
791 * for the objects that are actually in the bitmapped packfile.
793 for (i
= 0, init_type_iterator(&it
, bitmap_git
, type
);
794 i
< to_filter
->word_alloc
&& ewah_iterator_next(&mask
, &it
);
796 if (i
< tips
->word_alloc
)
797 mask
&= ~tips
->words
[i
];
798 to_filter
->words
[i
] &= ~mask
;
802 * Clear any blobs that weren't in the packfile (and so would not have
803 * been caught by the loop above. We'll have to check them
806 for (i
= 0; i
< eindex
->count
; i
++) {
807 uint32_t pos
= i
+ bitmap_git
->pack
->num_objects
;
808 if (eindex
->objects
[i
]->type
== type
&&
809 bitmap_get(to_filter
, pos
) &&
810 !bitmap_get(tips
, pos
))
811 bitmap_unset(to_filter
, pos
);
817 static void filter_bitmap_blob_none(struct bitmap_index
*bitmap_git
,
818 struct object_list
*tip_objects
,
819 struct bitmap
*to_filter
)
821 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
,
825 static unsigned long get_size_by_pos(struct bitmap_index
*bitmap_git
,
828 struct packed_git
*pack
= bitmap_git
->pack
;
830 struct object_info oi
= OBJECT_INFO_INIT
;
834 if (pos
< pack
->num_objects
) {
835 off_t ofs
= pack_pos_to_offset(pack
, pos
);
836 if (packed_object_info(the_repository
, pack
, ofs
, &oi
) < 0) {
837 struct object_id oid
;
838 nth_packed_object_id(&oid
, pack
,
839 pack_pos_to_index(pack
, pos
));
840 die(_("unable to get size of %s"), oid_to_hex(&oid
));
843 struct eindex
*eindex
= &bitmap_git
->ext_index
;
844 struct object
*obj
= eindex
->objects
[pos
- pack
->num_objects
];
845 if (oid_object_info_extended(the_repository
, &obj
->oid
, &oi
, 0) < 0)
846 die(_("unable to get size of %s"), oid_to_hex(&obj
->oid
));
852 static void filter_bitmap_blob_limit(struct bitmap_index
*bitmap_git
,
853 struct object_list
*tip_objects
,
854 struct bitmap
*to_filter
,
857 struct eindex
*eindex
= &bitmap_git
->ext_index
;
859 struct ewah_iterator it
;
863 tips
= find_tip_objects(bitmap_git
, tip_objects
, OBJ_BLOB
);
865 for (i
= 0, init_type_iterator(&it
, bitmap_git
, OBJ_BLOB
);
866 i
< to_filter
->word_alloc
&& ewah_iterator_next(&mask
, &it
);
868 eword_t word
= to_filter
->words
[i
] & mask
;
871 for (offset
= 0; offset
< BITS_IN_EWORD
; offset
++) {
874 if ((word
>> offset
) == 0)
876 offset
+= ewah_bit_ctz64(word
>> offset
);
877 pos
= i
* BITS_IN_EWORD
+ offset
;
879 if (!bitmap_get(tips
, pos
) &&
880 get_size_by_pos(bitmap_git
, pos
) >= limit
)
881 bitmap_unset(to_filter
, pos
);
885 for (i
= 0; i
< eindex
->count
; i
++) {
886 uint32_t pos
= i
+ bitmap_git
->pack
->num_objects
;
887 if (eindex
->objects
[i
]->type
== OBJ_BLOB
&&
888 bitmap_get(to_filter
, pos
) &&
889 !bitmap_get(tips
, pos
) &&
890 get_size_by_pos(bitmap_git
, pos
) >= limit
)
891 bitmap_unset(to_filter
, pos
);
897 static void filter_bitmap_tree_depth(struct bitmap_index
*bitmap_git
,
898 struct object_list
*tip_objects
,
899 struct bitmap
*to_filter
,
903 BUG("filter_bitmap_tree_depth given non-zero limit");
905 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
,
907 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
,
911 static void filter_bitmap_object_type(struct bitmap_index
*bitmap_git
,
912 struct object_list
*tip_objects
,
913 struct bitmap
*to_filter
,
914 enum object_type object_type
)
916 if (object_type
< OBJ_COMMIT
|| object_type
> OBJ_TAG
)
917 BUG("filter_bitmap_object_type given invalid object");
919 if (object_type
!= OBJ_TAG
)
920 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
, OBJ_TAG
);
921 if (object_type
!= OBJ_COMMIT
)
922 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
, OBJ_COMMIT
);
923 if (object_type
!= OBJ_TREE
)
924 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
, OBJ_TREE
);
925 if (object_type
!= OBJ_BLOB
)
926 filter_bitmap_exclude_type(bitmap_git
, tip_objects
, to_filter
, OBJ_BLOB
);
929 static int filter_bitmap(struct bitmap_index
*bitmap_git
,
930 struct object_list
*tip_objects
,
931 struct bitmap
*to_filter
,
932 struct list_objects_filter_options
*filter
)
934 if (!filter
|| filter
->choice
== LOFC_DISABLED
)
937 if (filter
->choice
== LOFC_BLOB_NONE
) {
939 filter_bitmap_blob_none(bitmap_git
, tip_objects
,
944 if (filter
->choice
== LOFC_BLOB_LIMIT
) {
946 filter_bitmap_blob_limit(bitmap_git
, tip_objects
,
948 filter
->blob_limit_value
);
952 if (filter
->choice
== LOFC_TREE_DEPTH
&&
953 filter
->tree_exclude_depth
== 0) {
955 filter_bitmap_tree_depth(bitmap_git
, tip_objects
,
957 filter
->tree_exclude_depth
);
961 if (filter
->choice
== LOFC_OBJECT_TYPE
) {
963 filter_bitmap_object_type(bitmap_git
, tip_objects
,
965 filter
->object_type
);
969 /* filter choice not handled */
973 static int can_filter_bitmap(struct list_objects_filter_options
*filter
)
975 return !filter_bitmap(NULL
, NULL
, NULL
, filter
);
978 struct bitmap_index
*prepare_bitmap_walk(struct rev_info
*revs
,
979 struct list_objects_filter_options
*filter
)
983 struct object_list
*wants
= NULL
;
984 struct object_list
*haves
= NULL
;
986 struct bitmap
*wants_bitmap
= NULL
;
987 struct bitmap
*haves_bitmap
= NULL
;
989 struct bitmap_index
*bitmap_git
;
992 * We can't do pathspec limiting with bitmaps, because we don't know
993 * which commits are associated with which object changes (let alone
994 * even which objects are associated with which paths).
999 if (!can_filter_bitmap(filter
))
1002 /* try to open a bitmapped pack, but don't parse it yet
1003 * because we may not need to use it */
1004 CALLOC_ARRAY(bitmap_git
, 1);
1005 if (open_pack_bitmap(revs
->repo
, bitmap_git
) < 0)
1008 for (i
= 0; i
< revs
->pending
.nr
; ++i
) {
1009 struct object
*object
= revs
->pending
.objects
[i
].item
;
1011 if (object
->type
== OBJ_NONE
)
1012 parse_object_or_die(&object
->oid
, NULL
);
1014 while (object
->type
== OBJ_TAG
) {
1015 struct tag
*tag
= (struct tag
*) object
;
1017 if (object
->flags
& UNINTERESTING
)
1018 object_list_insert(object
, &haves
);
1020 object_list_insert(object
, &wants
);
1022 object
= parse_object_or_die(get_tagged_oid(tag
), NULL
);
1023 object
->flags
|= (tag
->object
.flags
& UNINTERESTING
);
1026 if (object
->flags
& UNINTERESTING
)
1027 object_list_insert(object
, &haves
);
1029 object_list_insert(object
, &wants
);
1033 * if we have a HAVES list, but none of those haves is contained
1034 * in the packfile that has a bitmap, we don't have anything to
1037 if (haves
&& !in_bitmapped_pack(bitmap_git
, haves
))
1040 /* if we don't want anything, we're done here */
1045 * now we're going to use bitmaps, so load the actual bitmap entries
1046 * from disk. this is the point of no return; after this the rev_list
1047 * becomes invalidated and we must perform the revwalk through bitmaps
1049 if (load_pack_bitmap(bitmap_git
) < 0)
1052 object_array_clear(&revs
->pending
);
1055 revs
->ignore_missing_links
= 1;
1056 haves_bitmap
= find_objects(bitmap_git
, revs
, haves
, NULL
,
1058 reset_revision_walk();
1059 revs
->ignore_missing_links
= 0;
1061 if (haves_bitmap
== NULL
)
1062 BUG("failed to perform bitmap walk");
1065 wants_bitmap
= find_objects(bitmap_git
, revs
, wants
, haves_bitmap
,
1069 BUG("failed to perform bitmap walk");
1072 bitmap_and_not(wants_bitmap
, haves_bitmap
);
1074 filter_bitmap(bitmap_git
, wants
, wants_bitmap
, filter
);
1076 bitmap_git
->result
= wants_bitmap
;
1077 bitmap_git
->haves
= haves_bitmap
;
1079 object_list_free(&wants
);
1080 object_list_free(&haves
);
1085 free_bitmap_index(bitmap_git
);
1086 object_list_free(&wants
);
1087 object_list_free(&haves
);
1091 static void try_partial_reuse(struct bitmap_index
*bitmap_git
,
1093 struct bitmap
*reuse
,
1094 struct pack_window
**w_curs
)
1096 off_t offset
, header
;
1097 enum object_type type
;
1100 if (pos
>= bitmap_git
->pack
->num_objects
)
1101 return; /* not actually in the pack */
1103 offset
= header
= pack_pos_to_offset(bitmap_git
->pack
, pos
);
1104 type
= unpack_object_header(bitmap_git
->pack
, w_curs
, &offset
, &size
);
1106 return; /* broken packfile, punt */
1108 if (type
== OBJ_REF_DELTA
|| type
== OBJ_OFS_DELTA
) {
1113 * Find the position of the base object so we can look it up
1114 * in our bitmaps. If we can't come up with an offset, or if
1115 * that offset is not in the revidx, the pack is corrupt.
1116 * There's nothing we can do, so just punt on this object,
1117 * and the normal slow path will complain about it in
1120 base_offset
= get_delta_base(bitmap_git
->pack
, w_curs
,
1121 &offset
, type
, header
);
1124 if (offset_to_pack_pos(bitmap_git
->pack
, base_offset
, &base_pos
) < 0)
1128 * We assume delta dependencies always point backwards. This
1129 * lets us do a single pass, and is basically always true
1130 * due to the way OFS_DELTAs work. You would not typically
1131 * find REF_DELTA in a bitmapped pack, since we only bitmap
1132 * packs we write fresh, and OFS_DELTA is the default). But
1133 * let's double check to make sure the pack wasn't written with
1136 if (base_pos
>= pos
)
1140 * And finally, if we're not sending the base as part of our
1141 * reuse chunk, then don't send this object either. The base
1142 * would come after us, along with other objects not
1143 * necessarily in the pack, which means we'd need to convert
1144 * to REF_DELTA on the fly. Better to just let the normal
1145 * object_entry code path handle it.
1147 if (!bitmap_get(reuse
, base_pos
))
1152 * If we got here, then the object is OK to reuse. Mark it.
1154 bitmap_set(reuse
, pos
);
1157 int reuse_partial_packfile_from_bitmap(struct bitmap_index
*bitmap_git
,
1158 struct packed_git
**packfile_out
,
1160 struct bitmap
**reuse_out
)
1162 struct bitmap
*result
= bitmap_git
->result
;
1163 struct bitmap
*reuse
;
1164 struct pack_window
*w_curs
= NULL
;
1170 while (i
< result
->word_alloc
&& result
->words
[i
] == (eword_t
)~0)
1173 /* Don't mark objects not in the packfile */
1174 if (i
> bitmap_git
->pack
->num_objects
/ BITS_IN_EWORD
)
1175 i
= bitmap_git
->pack
->num_objects
/ BITS_IN_EWORD
;
1177 reuse
= bitmap_word_alloc(i
);
1178 memset(reuse
->words
, 0xFF, i
* sizeof(eword_t
));
1180 for (; i
< result
->word_alloc
; ++i
) {
1181 eword_t word
= result
->words
[i
];
1182 size_t pos
= (i
* BITS_IN_EWORD
);
1184 for (offset
= 0; offset
< BITS_IN_EWORD
; ++offset
) {
1185 if ((word
>> offset
) == 0)
1188 offset
+= ewah_bit_ctz64(word
>> offset
);
1189 try_partial_reuse(bitmap_git
, pos
+ offset
, reuse
, &w_curs
);
1193 unuse_pack(&w_curs
);
1195 *entries
= bitmap_popcount(reuse
);
1202 * Drop any reused objects from the result, since they will not
1203 * need to be handled separately.
1205 bitmap_and_not(result
, reuse
);
1206 *packfile_out
= bitmap_git
->pack
;
1211 int bitmap_walk_contains(struct bitmap_index
*bitmap_git
,
1212 struct bitmap
*bitmap
, const struct object_id
*oid
)
1219 idx
= bitmap_position(bitmap_git
, oid
);
1220 return idx
>= 0 && bitmap_get(bitmap
, idx
);
1223 void traverse_bitmap_commit_list(struct bitmap_index
*bitmap_git
,
1224 struct rev_info
*revs
,
1225 show_reachable_fn show_reachable
)
1227 assert(bitmap_git
->result
);
1229 show_objects_for_type(bitmap_git
, OBJ_COMMIT
, show_reachable
);
1230 if (revs
->tree_objects
)
1231 show_objects_for_type(bitmap_git
, OBJ_TREE
, show_reachable
);
1232 if (revs
->blob_objects
)
1233 show_objects_for_type(bitmap_git
, OBJ_BLOB
, show_reachable
);
1234 if (revs
->tag_objects
)
1235 show_objects_for_type(bitmap_git
, OBJ_TAG
, show_reachable
);
1237 show_extended_objects(bitmap_git
, revs
, show_reachable
);
1240 static uint32_t count_object_type(struct bitmap_index
*bitmap_git
,
1241 enum object_type type
)
1243 struct bitmap
*objects
= bitmap_git
->result
;
1244 struct eindex
*eindex
= &bitmap_git
->ext_index
;
1246 uint32_t i
= 0, count
= 0;
1247 struct ewah_iterator it
;
1250 init_type_iterator(&it
, bitmap_git
, type
);
1252 while (i
< objects
->word_alloc
&& ewah_iterator_next(&filter
, &it
)) {
1253 eword_t word
= objects
->words
[i
++] & filter
;
1254 count
+= ewah_bit_popcount64(word
);
1257 for (i
= 0; i
< eindex
->count
; ++i
) {
1258 if (eindex
->objects
[i
]->type
== type
&&
1259 bitmap_get(objects
, bitmap_git
->pack
->num_objects
+ i
))
1266 void count_bitmap_commit_list(struct bitmap_index
*bitmap_git
,
1267 uint32_t *commits
, uint32_t *trees
,
1268 uint32_t *blobs
, uint32_t *tags
)
1270 assert(bitmap_git
->result
);
1273 *commits
= count_object_type(bitmap_git
, OBJ_COMMIT
);
1276 *trees
= count_object_type(bitmap_git
, OBJ_TREE
);
1279 *blobs
= count_object_type(bitmap_git
, OBJ_BLOB
);
1282 *tags
= count_object_type(bitmap_git
, OBJ_TAG
);
1285 struct bitmap_test_data
{
1286 struct bitmap_index
*bitmap_git
;
1287 struct bitmap
*base
;
1288 struct progress
*prg
;
1292 static void test_show_object(struct object
*object
, const char *name
,
1295 struct bitmap_test_data
*tdata
= data
;
1298 bitmap_pos
= bitmap_position(tdata
->bitmap_git
, &object
->oid
);
1300 die("Object not in bitmap: %s\n", oid_to_hex(&object
->oid
));
1302 bitmap_set(tdata
->base
, bitmap_pos
);
1303 display_progress(tdata
->prg
, ++tdata
->seen
);
1306 static void test_show_commit(struct commit
*commit
, void *data
)
1308 struct bitmap_test_data
*tdata
= data
;
1311 bitmap_pos
= bitmap_position(tdata
->bitmap_git
,
1312 &commit
->object
.oid
);
1314 die("Object not in bitmap: %s\n", oid_to_hex(&commit
->object
.oid
));
1316 bitmap_set(tdata
->base
, bitmap_pos
);
1317 display_progress(tdata
->prg
, ++tdata
->seen
);
1320 void test_bitmap_walk(struct rev_info
*revs
)
1322 struct object
*root
;
1323 struct bitmap
*result
= NULL
;
1324 size_t result_popcnt
;
1325 struct bitmap_test_data tdata
;
1326 struct bitmap_index
*bitmap_git
;
1327 struct ewah_bitmap
*bm
;
1329 if (!(bitmap_git
= prepare_bitmap_git(revs
->repo
)))
1330 die("failed to load bitmap indexes");
1332 if (revs
->pending
.nr
!= 1)
1333 die("you must specify exactly one commit to test");
1335 fprintf(stderr
, "Bitmap v%d test (%d entries loaded)\n",
1336 bitmap_git
->version
, bitmap_git
->entry_count
);
1338 root
= revs
->pending
.objects
[0].item
;
1339 bm
= bitmap_for_commit(bitmap_git
, (struct commit
*)root
);
1342 fprintf(stderr
, "Found bitmap for %s. %d bits / %08x checksum\n",
1343 oid_to_hex(&root
->oid
), (int)bm
->bit_size
, ewah_checksum(bm
));
1345 result
= ewah_to_bitmap(bm
);
1349 die("Commit %s doesn't have an indexed bitmap", oid_to_hex(&root
->oid
));
1351 revs
->tag_objects
= 1;
1352 revs
->tree_objects
= 1;
1353 revs
->blob_objects
= 1;
1355 result_popcnt
= bitmap_popcount(result
);
1357 if (prepare_revision_walk(revs
))
1358 die("revision walk setup failed");
1360 tdata
.bitmap_git
= bitmap_git
;
1361 tdata
.base
= bitmap_new();
1362 tdata
.prg
= start_progress("Verifying bitmap entries", result_popcnt
);
1365 traverse_commit_list(revs
, &test_show_commit
, &test_show_object
, &tdata
);
1367 stop_progress(&tdata
.prg
);
1369 if (bitmap_equals(result
, tdata
.base
))
1370 fprintf(stderr
, "OK!\n");
1372 die("mismatch in bitmap results");
1374 free_bitmap_index(bitmap_git
);
1377 int rebuild_bitmap(const uint32_t *reposition
,
1378 struct ewah_bitmap
*source
,
1379 struct bitmap
*dest
)
1382 struct ewah_iterator it
;
1385 ewah_iterator_init(&it
, source
);
1387 while (ewah_iterator_next(&word
, &it
)) {
1388 uint32_t offset
, bit_pos
;
1390 for (offset
= 0; offset
< BITS_IN_EWORD
; ++offset
) {
1391 if ((word
>> offset
) == 0)
1394 offset
+= ewah_bit_ctz64(word
>> offset
);
1396 bit_pos
= reposition
[pos
+ offset
];
1398 bitmap_set(dest
, bit_pos
- 1);
1399 else /* can't reuse, we don't have the object */
1403 pos
+= BITS_IN_EWORD
;
1408 uint32_t *create_bitmap_mapping(struct bitmap_index
*bitmap_git
,
1409 struct packing_data
*mapping
)
1411 uint32_t i
, num_objects
;
1412 uint32_t *reposition
;
1414 num_objects
= bitmap_git
->pack
->num_objects
;
1415 CALLOC_ARRAY(reposition
, num_objects
);
1417 for (i
= 0; i
< num_objects
; ++i
) {
1418 struct object_id oid
;
1419 struct object_entry
*oe
;
1421 nth_packed_object_id(&oid
, bitmap_git
->pack
,
1422 pack_pos_to_index(bitmap_git
->pack
, i
));
1423 oe
= packlist_find(mapping
, &oid
);
1426 reposition
[i
] = oe_in_pack_pos(mapping
, oe
) + 1;
1432 void free_bitmap_index(struct bitmap_index
*b
)
1438 munmap(b
->map
, b
->map_size
);
1439 ewah_pool_free(b
->commits
);
1440 ewah_pool_free(b
->trees
);
1441 ewah_pool_free(b
->blobs
);
1442 ewah_pool_free(b
->tags
);
1443 kh_destroy_oid_map(b
->bitmaps
);
1444 free(b
->ext_index
.objects
);
1445 free(b
->ext_index
.hashes
);
1446 bitmap_free(b
->result
);
1447 bitmap_free(b
->haves
);
1451 int bitmap_has_oid_in_uninteresting(struct bitmap_index
*bitmap_git
,
1452 const struct object_id
*oid
)
1454 return bitmap_git
&&
1455 bitmap_walk_contains(bitmap_git
, bitmap_git
->haves
, oid
);
1458 static off_t
get_disk_usage_for_type(struct bitmap_index
*bitmap_git
,
1459 enum object_type object_type
)
1461 struct bitmap
*result
= bitmap_git
->result
;
1462 struct packed_git
*pack
= bitmap_git
->pack
;
1464 struct ewah_iterator it
;
1468 init_type_iterator(&it
, bitmap_git
, object_type
);
1469 for (i
= 0; i
< result
->word_alloc
&&
1470 ewah_iterator_next(&filter
, &it
); i
++) {
1471 eword_t word
= result
->words
[i
] & filter
;
1472 size_t base
= (i
* BITS_IN_EWORD
);
1478 for (offset
= 0; offset
< BITS_IN_EWORD
; offset
++) {
1481 if ((word
>> offset
) == 0)
1484 offset
+= ewah_bit_ctz64(word
>> offset
);
1485 pos
= base
+ offset
;
1486 total
+= pack_pos_to_offset(pack
, pos
+ 1) -
1487 pack_pos_to_offset(pack
, pos
);
1494 static off_t
get_disk_usage_for_extended(struct bitmap_index
*bitmap_git
)
1496 struct bitmap
*result
= bitmap_git
->result
;
1497 struct packed_git
*pack
= bitmap_git
->pack
;
1498 struct eindex
*eindex
= &bitmap_git
->ext_index
;
1500 struct object_info oi
= OBJECT_INFO_INIT
;
1504 oi
.disk_sizep
= &object_size
;
1506 for (i
= 0; i
< eindex
->count
; i
++) {
1507 struct object
*obj
= eindex
->objects
[i
];
1509 if (!bitmap_get(result
, pack
->num_objects
+ i
))
1512 if (oid_object_info_extended(the_repository
, &obj
->oid
, &oi
, 0) < 0)
1513 die(_("unable to get disk usage of %s"),
1514 oid_to_hex(&obj
->oid
));
1516 total
+= object_size
;
1521 off_t
get_disk_usage_from_bitmap(struct bitmap_index
*bitmap_git
,
1522 struct rev_info
*revs
)
1526 total
+= get_disk_usage_for_type(bitmap_git
, OBJ_COMMIT
);
1527 if (revs
->tree_objects
)
1528 total
+= get_disk_usage_for_type(bitmap_git
, OBJ_TREE
);
1529 if (revs
->blob_objects
)
1530 total
+= get_disk_usage_for_type(bitmap_git
, OBJ_BLOB
);
1531 if (revs
->tag_objects
)
1532 total
+= get_disk_usage_for_type(bitmap_git
, OBJ_TAG
);
1534 total
+= get_disk_usage_for_extended(bitmap_git
);