4 #include "git-compat-util.h"
16 * A pseudo-merge group tracks the set of non-bitmapped reference tips
17 * that match the given pattern.
19 * Within those matches, they are further segmented by separating
20 * consecutive capture groups with '-' dash character capture groups
21 * with '-' dash characters.
23 * Those groups are then ordered by committer date and partitioned
24 * into individual pseudo-merge(s) according to the decay, max_merges,
25 * sample_rate, and threshold parameters.
27 struct pseudo_merge_group
{
30 /* capture group(s) -> struct pseudo_merge_matches */
31 struct strmap matches
;
34 * The individual pseudo-merge(s) that are generated from the
35 * above array of matches, partitioned according to the below
38 struct commit
**merges
;
43 * Pseudo-merge grouping parameters. See git-config(1) for
50 timestamp_t threshold
;
51 timestamp_t stable_threshold
;
54 void pseudo_merge_group_release(struct pseudo_merge_group
*group
);
56 struct pseudo_merge_matches
{
57 struct commit
**stable
;
58 struct commit
**unstable
;
59 size_t stable_nr
, stable_alloc
;
60 size_t unstable_nr
, unstable_alloc
;
64 * Read the repository's configuration:
66 * - bitmapPseudoMerge.<name>.pattern
67 * - bitmapPseudoMerge.<name>.decay
68 * - bitmapPseudoMerge.<name>.sampleRate
69 * - bitmapPseudoMerge.<name>.threshold
70 * - bitmapPseudoMerge.<name>.maxMerges
71 * - bitmapPseudoMerge.<name>.stableThreshold
72 * - bitmapPseudoMerge.<name>.stableSize
74 * and populates the given `list` with pseudo-merge groups. String
75 * entry keys are the pseudo-merge group names, and the values are
76 * pointers to the pseudo_merge_group structure itself.
78 void load_pseudo_merges_from_config(struct repository
*r
, struct string_list
*list
);
81 * A pseudo-merge commit index (pseudo_merge_commit_idx) maps a
82 * particular (non-pseudo-merge) commit to the list of pseudo-merge(s)
85 struct pseudo_merge_commit_idx
{
86 uint32_t *pseudo_merge
;
91 * Selects pseudo-merges from a list of commits, populating the given
92 * string_list of pseudo-merge groups.
94 * Populates the pseudo_merge_commits map with a commit_idx
95 * corresponding to each commit in the list. Counts the total number
96 * of pseudo-merges generated.
98 * Optionally shows a progress meter.
100 void select_pseudo_merges(struct bitmap_writer
*writer
);
103 * Represents a serialized view of a file containing pseudo-merge(s)
104 * (see Documentation/technical/bitmap-format.txt for a specification
107 struct pseudo_merge_map
{
109 * An array of pseudo-merge(s), lazily loaded from the .bitmap
112 struct pseudo_merge
*v
;
117 * Pointers into a memory-mapped view of the .bitmap file:
119 * - map: the beginning of the .bitmap file
120 * - commits: the beginning of the pseudo-merge commit index
121 * - map_size: the size of the .bitmap file
123 const unsigned char *map
;
124 const unsigned char *commits
;
130 * An individual pseudo-merge, storing a pair of lazily-loaded
133 * - commits: the set of commit(s) that are part of the pseudo-merge
134 * - bitmap: the set of object(s) reachable from the above set of
137 * The `at` and `bitmap_at` fields are used to store the locations of
138 * each of the above bitmaps in the .bitmap file.
140 struct pseudo_merge
{
141 struct ewah_bitmap
*commits
;
142 struct ewah_bitmap
*bitmap
;
148 * `satisfied` indicates whether the given pseudo-merge has been
151 * `loaded_commits` and `loaded_bitmap` indicate whether the
152 * respective bitmaps have been loaded and read from the
155 unsigned satisfied
: 1,
161 * Frees the given pseudo-merge map, releasing any memory held by (a)
162 * parsed EWAH bitmaps, or (b) the array of pseudo-merges itself. Does
163 * not free the memory-mapped view of the .bitmap file.
165 void free_pseudo_merge_map(struct pseudo_merge_map
*pm
);
168 * Loads the bitmap corresponding to the given pseudo-merge from the
169 * map, if it has not already been loaded.
171 struct ewah_bitmap
*pseudo_merge_bitmap(const struct pseudo_merge_map
*pm
,
172 struct pseudo_merge
*merge
);
175 * Loads the pseudo-merge and its commits bitmap from the given
176 * pseudo-merge map, if it has not already been loaded.
178 struct pseudo_merge
*use_pseudo_merge(const struct pseudo_merge_map
*pm
,
179 struct pseudo_merge
*merge
);
182 * Applies pseudo-merge(s) containing the given commit to the bitmap
185 * If any pseudo-merge(s) were satisfied, returns the number
186 * satisfied, otherwise returns 0. If any were satisfied, the
187 * remaining unsatisfied pseudo-merges are cascaded (see below).
189 int apply_pseudo_merges_for_commit(const struct pseudo_merge_map
*pm
,
190 struct bitmap
*result
,
191 struct commit
*commit
, uint32_t commit_pos
);
194 * Applies pseudo-merge(s) which are satisfied according to the
195 * current bitmap in result (or roots, see below). If any
196 * pseudo-merges were satisfied, repeat the process over unsatisfied
197 * pseudo-merge commits until no more pseudo-merges are satisfied.
199 * Result is the bitmap to which the pseudo-merge(s) are applied.
200 * Roots (if given) is a bitmap of the traversal tip(s) for either
201 * side of a reachability traversal.
203 * Roots may given instead of a populated results bitmap at the
204 * beginning of a traversal on either side where the reachability
205 * closure over tips is not yet known.
207 int cascade_pseudo_merges(const struct pseudo_merge_map
*pm
,
208 struct bitmap
*result
,
209 struct bitmap
*roots
);
212 * Returns a pseudo-merge which contains the exact set of commits
213 * listed in the "parents" bitamp, or NULL if none could be found.
215 struct pseudo_merge
*pseudo_merge_for_parents(const struct pseudo_merge_map
*pm
,
216 struct bitmap
*parents
);