git
/
pack-bitmap-write.c
1071 строка · 27.3 Кб
1#define USE_THE_REPOSITORY_VARIABLE2{41return writer->selected_nr - writer->pseudo_merges_nr;42}43{47memset(writer, 0, sizeof(struct bitmap_writer));48if (writer->bitmaps)49BUG("bitmap writer already initialized");50writer->bitmaps = kh_init_oid_map();51writer->pseudo_merge_commits = kh_init_oid_map();52writer->to_pack = pdata;53}58{61if (!idx)62return;63free(idx->pseudo_merge);64free(idx);65}66{69uint32_t i;70struct pseudo_merge_commit_idx *idx;71}94{97writer->show_progress = show;98}99/**101* Build the initial type index for the packfile or multi-pack-index102*/103void bitmap_writer_build_type_index(struct bitmap_writer *writer,104struct pack_idx_entry **index)105{106uint32_t i;107}158{162return kh_get_oid_map(writer->bitmaps, *oid) != kh_end(writer->bitmaps);163}164/**166* Compute the actual bitmaps167*/168{172if (writer->selected_nr >= writer->selected_alloc) {173writer->selected_alloc = (writer->selected_alloc + 32) * 2;174REALLOC_ARRAY(writer->selected, writer->selected_alloc);175}176}197{201struct object_entry *entry = packlist_find(writer->to_pack, oid);202}215{218static const int MAX_XOR_OFFSET_SEARCH = 10;219}260{273free_commit_list(commit->reverse_edges);274bitmap_free(commit->commit_mask);275bitmap_free(commit->bitmap);276}277{290struct rev_info revs;291struct commit *commit;292struct commit_list *reusable = NULL;293struct commit_list *r;294unsigned int i, num_maximal = 0;295* If there is no commit_mask, there is no reason to iterate332* over this commit; it is not selected (if it were, it would333* not have a blank commit mask) and all its children have334* existing bitmaps (see the comment starting with "This commit335* has an existing bitmap" below), so it does not contribute336* anything to the final bitmap file or its descendants.337*/338if (!c_ent->commit_mask)339continue;340* This commit has an existing bitmap, so we can344* get its bits immediately without an object345* walk. That is, it is reusable as-is and there is no346* need to continue walking beyond it.347*348* Mark it as such and add it to bb->commits separately349* to avoid allocating a position in the commit mask.350*/351commit_list_insert(commit, &reusable);352goto next;353}354}417{420deep_clear_bb_data(&bb->data, clear_bb_commit);421free(bb->commits);422bb->commits_nr = bb->commits_alloc = 0;423}424{429int found;430uint32_t pos;431struct tree_desc desc;432struct name_entry entry;433* If our bit is already set, then there is nothing to do. Both this436* tree and all of its children will be set.437*/438pos = find_object_pos(writer, &tree->object.oid, &found);439if (!found)440return -1;441if (bitmap_get(bitmap, pos))442return 0;443bitmap_set(bitmap, pos);444}472{484int found;485uint32_t pos;486if (!ent->bitmap)487ent->bitmap = bitmap_new();488* If this commit has an old bitmap, then translate that505* bitmap and add its bits to this one. No need to walk506* parents or the tree for this commit.507*/508if (old && !rebuild_bitmap(mapping, old, remapped)) {509bitmap_or(ent->bitmap, remapped);510bitmap_free(remapped);511if (commit->object.flags & BITMAP_PSEUDO_MERGE)512reused_pseudo_merge_bitmaps_nr++;513else514reused_bitmaps_nr++;515continue;516}517bitmap_free(remapped);518}519* Mark ourselves and queue our tree. The commit522* walk ensures we cover all parents.523*/524if (!(c->object.flags & BITMAP_PSEUDO_MERGE)) {525pos = find_object_pos(writer, &c->object.oid, &found);526if (!found)527return -1;528bitmap_set(ent->bitmap, pos);529prio_queue_put(tree_queue,530repo_get_commit_tree(the_repository, c));531}532}552{556struct bitmapped_commit *stored = &writer->selected[ent->idx];557khiter_t hash_pos;558}571{574struct bitmap_builder bb;575size_t i;576int nr_stored = 0; /* for progress */577struct prio_queue queue = { compare_commits_by_gen_then_commit_date };578struct prio_queue tree_queue = { NULL };579struct bitmap_index *old_bitmap;580uint32_t *mapping;581int closed = 1; /* until proven otherwise */582}651/**653* Select the commits that will be bitmapped654*/655static inline unsigned int next_commit_index(unsigned int idx)656{657static const unsigned int MIN_COMMITS = 100;658static const unsigned int MAX_COMMITS = 5000;659}678{681struct commit *a = *(struct commit **)_a;682struct commit *b = *(struct commit **)_b;683return (long)b->date - (long)a->date;684}685{690unsigned int i = 0, j, next;691}742{746/* hashwrite will die on error */747hashwrite(f, buf, len);748return len;749}750/**752* Write the bitmap index to disk753*/754static inline void dump_bitmap(struct hashfile *f, struct ewah_bitmap *bitmap)755{756if (ewah_serialize_to(bitmap, hashwrite_ewah_helper, f) < 0)757die("Failed to write bitmap index");758}759{762const struct pack_idx_entry * const *index = table;763return &index[pos]->oid;764}765{769int i;770}787{791struct oid_array commits = OID_ARRAY_INIT;792struct bitmap **commits_bitmap = NULL;793off_t *pseudo_merge_ofs = NULL;794off_t start, table_start, next_ext;795}911{914struct bitmap_writer *writer = _data;915struct bitmapped_commit *a = &writer->selected[*(uint32_t *)_va];916struct bitmapped_commit *b = &writer->selected[*(uint32_t *)_vb];917}925{929uint32_t i;930uint32_t *table, *table_inv;931* At the end of this sort table[j] = i means that the i'th940* bitmap corresponds to j'th bitmapped commit (among the selected941* commits) in lex order of OIDs.942*/943QSORT_S(table, bitmap_writer_nr_selected_commits(writer), table_cmp, writer);944* to j'th commit by j = table_inv[i])947*/948for (i = 0; i < bitmap_writer_nr_selected_commits(writer); i++)949table_inv[table[i]] = i;950* xor_index stores the index (in the bitmap entries)960* of the corresponding xor bitmap. But we need to convert961* this index into lookup table's index. So, table_inv[xor_index]962* gives us the index position w.r.t. the lookup table.963*964* If "k = table[i] - xor_offset" then the xor base is the k'th965* bitmap. `table_inv[k]` gives us the position of that bitmap966* in the lookup table.967*/968uint32_t xor_index = table[i] - xor_offset;969xor_row = table_inv[xor_index];970} else {971xor_row = 0xffffffff;972}973}983{988uint32_t i;989}995{999hashcpy(writer->pack_checksum, sha1, the_repository->hash_algo);1000}1001{1007static uint16_t default_version = 1;1008static uint16_t flags = BITMAP_OPT_FULL_DAG;1009struct strbuf tmp_file = STRBUF_INIT;1010struct hashfile *f;1011off_t *offsets = NULL;1012uint32_t i;1013}1072